Academic literature on the topic 'Sequani'

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Sequani.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Sequani"

1

Fischer, Brigitte. "Le premier monnayage des Sequani." Etudes Celtiques 25, no. 1 (1988): 69–78. http://dx.doi.org/10.3406/ecelt.1988.1871.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Faszcza, Michał. "Cezariańska okupacja ziem Eduów i Sekwanów w latach 58–51 p.n.e. Przebieg i strategie oporu." Przegląd Historyczno-Wojskowy 23, no. 4 (2022): 46–66. http://dx.doi.org/10.32089/wbh.phw.2022.4(282).0002.

Full text
Abstract:
During the Roman conquest of Gaul between 58–51 B.C., the tribes of the Aedui and the Sequani provided important, but not entirely voluntary support to Caesar’s army. Although they entered into an alliance with Rome, their lands began to be actually occupied soon after. Understanding the situation they find themselves in requires a reversal of perspective and an analysis of events from the Gallic point of view. The author tries to characterize the benefits that Caesar gained from this increasingly coercive collaboration and the strategies of resistance adopted by his Gallic „allies”.
APA, Harvard, Vancouver, ISO, and other styles
3

Rao, R. Shyama Prasad, Ole Thomsen Buus, and Bernd Wollenweber. "Evolutionary Pattern of N-Glycosylation Sequon Numbers in Eukaryotic ABC Protein Superfamilies." Bioinformatics and Biology Insights 4 (January 2010): BBI.S4337. http://dx.doi.org/10.4137/bbi.s4337.

Full text
Abstract:
Many proteins contain a large number of NXS/T sequences (where X is any amino acid except proline) which are the potential sites of asparagine (N) linked glycosylation. However, the patterns of occurrence of these N-glycosylation sequons in related proteins or groups of proteins and their underlying causes have largely been unexplored. We computed the actual and probabilistic occurrence of NXS/T sequons in ABC protein superfamilies from eight diverse eukaryotic organisms. The ABC proteins contained significantly higher NXS/T sequon numbers compared to respective genome-wide average, but the sequon density was significantly lower owing to the increase in protein size and decrease in sequon specific amino acids. However, mammalian ABC proteins have significantly higher sequon density, and both serine and threonine containing sequons (NXS and NXT) have been positively selected—against the recent findings of only threonine specific Darwinian selection of sequons in proteins. The occurrence of sequons was positively correlated with the frequency of sequon specific amino acids and negatively correlated with proline and the NPS/T sequences. Further, the NPS/T sequences were significantly higher than expected in plant ABC proteins which have the lowest number of NXS/T sequons. Accordingly, compared to overall proteins, N-glycosylation sequons in ABC protein superfamilies have a distinct pattern of occurrence, and the results are discussed in an evolutionary perspective.
APA, Harvard, Vancouver, ISO, and other styles
4

KASTURI, Lakshmi, Hegang CHEN, and Susan H. SHAKIN-ESHLEMAN. "Regulation of N-linked core glycosylation: use of a site-directed mutagenesis approach to identify Asn-Xaa-Ser/Thr sequons that are poor oligosaccharide acceptors." Biochemical Journal 323, no. 2 (1997): 415–19. http://dx.doi.org/10.1042/bj3230415.

Full text
Abstract:
N-linked glycosylation can profoundly affect protein expression and function. N-linked glycosylation usually occurs at the sequon Asn-Xaa-Ser/Thr, where Xaa is any amino acid residue except Pro. However, many Asn-Xaa-Ser/Thr sequons are glycosylated inefficiently or not at all for reasons that are poorly understood. We have used a site-directed mutagenesis approach to examine how the Xaa and hydroxy (Ser/Thr) amino acid residues in sequons influence core-glycosylation efficiency. We recently demonstrated that certain Xaa amino acids inhibit core glycosylation of the sequon, Asn37-Xaa-Ser, in rabies virus glycoprotein (RGP). Here we examine the impact of different Xaa residues on core-glycosylation efficiency when the Ser residue in this sequon is replaced with Thr. The core-glycosylation efficiencies of RGP variants with different Asn37-Xaa-Ser/Thr sequons were compared by using a cell-free translation/glycosylation system. Using this approach we confirm that four Asn-Xaa-Ser sequons are poor oligosaccharide acceptors: Asn-Trp-Ser, Asn-Asp-Ser, Asn-Glu-Ser and Asn-Leu-Ser. In contrast, Asn-Xaa-Thr sequons are efficiently glycosylated, even when Xaa = Trp, Asp, Glu or Leu. A comparison of the glycosylation status of Asn-Xaa-Ser and Asn-Xaa-Thr sequons in other glycoproteins confirms that sequons with Xaa = Trp, Asp, Glu or Leu are rarely glycosylated when Ser is the hydroxy amino acid residue, and that these sequons are unlikely to serve as glycosylation sites when introduced into proteins by site-directed mutagenesis.
APA, Harvard, Vancouver, ISO, and other styles
5

Ralston, Ian. "Central Gaul at the Roman Conquest: conceptions and misconceptions." Antiquity 62, no. 237 (1988): 786–94. http://dx.doi.org/10.1017/s0003598x00075232.

Full text
Abstract:
Several recent reconstructions of the social and economic development of non-Mediterranean Gaul afterc. 200 BC have argued for the development of complex societies, characterized by the appearance of centralized political entities with urban – or at least urbanizing – communities. The emergence of such ‘Archaic States’ is often considered as having been restricted to a broad zone running eastward from the Atlantic façade through the northern Massif Central to the Swiss plateau. Five certain such states are usually claimed: Bituriges cubi, Aedui, Arverni, Sequani, Helvetii; and three probable: Pictones, Lemovices and Lingones. The constitutents of this zone were originally recognized by Dr Daphne Nash (1976; 1978a; 1978b; 1981), and her view has since been adopted in Britain by Champion and his collaborators (1984), Bintliff (1984) and, most recently, Cunliffe (1988: figure 38). Essential to the formulation of this hypothesis was a wide-ranging consideration of three domains of protohistoric evidence on Gaul: literary, most conspicuously Julius Caesar’s deBello Gallico; numismatics; and the settlement record of the late La Tène and its more shadowy antecedents. Among more recent commentators, a primary interest in the ‘core–periphery’ relationship (Cunliffe 1988; Rowlands et al. 1987) which existed between the Mediterranean world and Central Gaul is manifest. In a minimal view, this interaction may be envisaged in terms of the consequences of long-distance trade and subsequent military conquest spurring socio-political change. The unspoken by-product of this perspective is that differential development within non-Mediterranean Gaul is simplistically presented in terms of distance-decay from the Mediterranean littoral, with little attention being paid to the effects of physiographic diversity across this landmass.
APA, Harvard, Vancouver, ISO, and other styles
6

Abu-Qarn, Mehtap, and Jerry Eichler. "An analysis of amino acid sequences surrounding archaeal glycoprotein sequons." Archaea 2, no. 2 (2006): 73–81. http://dx.doi.org/10.1155/2006/510578.

Full text
Abstract:
Despite having provided the first example of a prokaryal glycoprotein, little is known of the rules governing theN-glycosylation process in Archaea. As in Eukarya and Bacteria, archaealN-glycosylation takes place at the Asn residues of Asn-X-Ser/Thr sequons. Since not all sequons are utilized, it is clear that other factors, including the context in which a sequon exists, affect glycosylation efficiency. As yet, the contribution toN-glycosylation made by sequon-bordering residues and other related factors in Archaea remains unaddressed. In the following, the surroundings of Asn residues confirmed by experiment as modified were analyzed in an attempt to define sequence rules and requirements for archaealN-glycosylation.
APA, Harvard, Vancouver, ISO, and other styles
7

Pakhrin, Subash C., Kiyoko F. Aoki-Kinoshita, Doina Caragea, and Dukka B. KC. "DeepNGlyPred: A Deep Neural Network-Based Approach for Human N-Linked Glycosylation Site Prediction." Molecules 26, no. 23 (2021): 7314. http://dx.doi.org/10.3390/molecules26237314.

Full text
Abstract:
Protein N-linked glycosylation is a post-translational modification that plays an important role in a myriad of biological processes. Computational prediction approaches serve as complementary methods for the characterization of glycosylation sites. Most of the existing predictors for N-linked glycosylation utilize the information that the glycosylation site occurs at the N-X-[S/T] sequon, where X is any amino acid except proline. Not all N-X-[S/T] sequons are glycosylated, thus the N-X-[S/T] sequon is a necessary but not sufficient determinant for protein glycosylation. In that regard, computational prediction of N-linked glycosylation sites confined to N-X-[S/T] sequons is an important problem. Here, we report DeepNGlyPred a deep learning-based approach that encodes the positive and negative sequences in the human proteome dataset (extracted from N-GlycositeAtlas) using sequence-based features (gapped-dipeptide), predicted structural features, and evolutionary information. DeepNGlyPred produces SN, SP, MCC, and ACC of 88.62%, 73.92%, 0.60, and 79.41%, respectively on N-GlyDE independent test set, which is better than the compared approaches. These results demonstrate that DeepNGlyPred is a robust computational technique to predict N-Linked glycosylation sites confined to N-X-[S/T] sequon. DeepNGlyPred will be a useful resource for the glycobiology community.
APA, Harvard, Vancouver, ISO, and other styles
8

WALMSLEY, Adrian R., and Nigel M. HOOPER. "Distance of sequons to the C-terminus influences the cellular N-glycosylation of the prion protein." Biochemical Journal 370, no. 1 (2003): 351–55. http://dx.doi.org/10.1042/bj20021303.

Full text
Abstract:
Cell-specific differences in the utilization of the two N-glycosylation sequons (Asn180-Ile-Thr and Asn196-Phe-Thr) of the prion protein (PrP) have been proposed to influence the aetiology of the neurodegenerative prion diseases. As the N-glycosylation of PrP is ablated by deletion of the C-terminal glycosyl-phosphatidylinositol (GPI) anchor signal sequence, we have investigated the determinants for PrP sequon utilization in human neuronal cells using the novel approach of restoring N-glycosylation to secreted forms of PrP lacking a GPI anchor. N-glycosylation was restored to an efficiency comparable with that of GPI anchored PrP when the distance of the sequon to the C-terminus was increased so that it was sufficient to reach the active site of oligosaccharyltransferase before chain termination. Our findings indicate that sequon utilization in PrP is a co-translational process that precedes GPI anchor addition and, as such, will be greatly influenced by the dynamics of the translocon—oligosaccharyltransferase complex.
APA, Harvard, Vancouver, ISO, and other styles
9

Restyawati, Merinda Dwi, and Lutfiyah Hidayati. "PENERAPAN APLIKASI PAYET & AKRILIK PADA BUSANA PESTA MALAM SEBAGAI SUMBER IDE STAR NIGHT." BAJU: Journal of Fashion & Textile Design Unesa 1, no. 1 (2020): 73–81. http://dx.doi.org/10.26740/baju.v1n1.p73-81.

Full text
Abstract:
Aplikasi payet merupakan hiasan yang dilekatkan pada suatu permukaan kain berupa payet berlubang ditengahnya untuk dipasang pada baju. Busana pesta malam sebagai sumber ide star night terinspirasi dari bintang yaitu sebuah sinar bintang langit dimalam hari. Tujuan penelitian ini adalah:1) untuk mendeskripsikan proses penerapan aplikasi payet & akrilik pada busana pesta malam bertema star night 2) untuk mendeskripsikan hasil jadi busana pesta malam sesuai sumber ide dengan menerapkan aplikasi payet & akrilik. Penelitian ini merupakan penelitian penciptaan karya, yang terdiri atas 4 tahap yaitu pra-perancangan, perancangan, perwujudan, dan penyajian. Hasil penelitian menyatakan bahwa:1) proses penerapan aplikasi pada busana pesta malam meliputi menyiapkan alat dan bahan, untuk aplikasi payet menata payet dan melekatkan pada busana dengan teknik tabur. Sedangkan penerapan akrilik meliputi memberikan warna pada akrilik dengan di pylox, menata akrilik bintang dan melekatkan pada busana dengan teknik tabur. 2) Hasil busana pesta malam dengan sumber ide star night yang diwujudkan melalui penerapan aplikasi payet & akrilik untuk mendapatkan warna ungu tua, busana pesta berbentuk siluet A seperti bentuk star. Bahan yang digunakan bahan satin dan tile, karena memiliki kemiripan pada background langit. Busana pesta malam ini terdiri dari bustier, rok lingkar penuh dan lengan bishop. Sequin application an ornament that is attached to a fabric surface in the form of a hollow sequin in the middle to be attached to clothes. Evening wear as a source of star night ideas inspired by the stars that is a star sky at night. The purpose of this study is: 1) to describe the application process of sequin & acrylic applications on star night themed nightclubs 2) to describe the results of the evening wear according to the source of ideas by applying sequin & acrylic applications. This research is a work creation research, which consists of 4 stage, namely pre-design, design, embodiment, and presentation. The results of the study stated that:1) the application process in the evening wear included preparing tools and materials, for the application of sequins arranging the sequins and attaching them to clothes with the sow technique. While the application of acrylics includes giving color to acrylics in pylox, arranging star acrylic and attaching to clothes by sowing technique.2) The results of the evening wear with the source of the Star night idea that is realized through the application of sequins & acrylic applications to get a dark purple color, A dress in the shape of a silhouette like a star shape. The material used in this dress is satin and tile, because it has similarities in the sky background. This evening wear consists of a bustier, full-circle skirt and bishop sleeves.
APA, Harvard, Vancouver, ISO, and other styles
10

DOYON, Yannick, William HOME, Philippe DAULL та Denis LeBEL. "Effect of C-domain N-glycosylation and deletion on rat pancreaticα-amylase secretion and activity". Biochemical Journal 362, № 2 (2002): 259–64. http://dx.doi.org/10.1042/bj3620259.

Full text
Abstract:
Even though all animal α-amylases include glycosylation sequons (Asn-Xaa-Thr/Ser) in their sequences, amylases purified from natural sources are not quantitatively glycosylated. When wild-type rat pancreatic α-amylase, which contains two glycosylation sequons, was expressed in animal cell lines the protein displayed a very low rate of glycosylation (approx. 2%), even after Brefeldin A treatment to increase the contact with the glycosylation machinery. Site-directed mutagenesis of the first glycosylation sequon (Asn410 → Gln) resulted in 90% of the protein being glycosylated at the second glycosylation sequon (Asn459). Mutation of the second sequon completely inhibited glycosylation. In order to ascertain if the interference in the glycosylation of Asn459 that was eliminated by the Asn410 →Gln mutation could be due to the position of the asparagine residue in the Cys448-Cys460 disulphide bridge, these cysteine residues were mutated to serine residues. The resulting mutant was found to be 100% glycosylated. All mutants with mutations in the C-domain had specific activities identical to that of the wild-type enzyme, indicating that enzymic activity is independent of the structure and modification of the C-terminal domain. To further test the independence of the C-domain with respect to the two N-terminal domains of the protein, which harbour the catalytic site, the last seven of the ten β-strands that make up the β-sandwich configuration of the domain were deleted. The truncated protein was not secreted from cells and all enzyme activity was destroyed. These observations show that Asn459 is the only site that can be glycosylated in wild-type amylase, and confirm the relative independence of the C-terminal domain of α-amylase with respect to enzyme activity. In addition, they also establish that the C-terminal domain is absolutely essential for the correct post-translational folding of the enzyme that is responsible for its activity and allows for its secretion.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Sequani"

1

Fisher, Katherine E. "Dream Sequins." Kent State University / OhioLINK, 2012. http://rave.ohiolink.edu/etdc/view?acc_num=kent1343057904.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Knoll, Michael. "Von der Sequenz zur Funktion : systematische Modellierung verschiedener Proteinfamilien auf Sequenz- und Strukturebene$nElektronische Ressource /." [S.l. : s.n.], 2008. http://nbn-resolving.de/urn:nbn:de:bsz:93-opus-38488.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Lorenz, Dieter. "Generische Ansätze zur Entwicklung hypermedialer biochemischer Lernlaborsysteme." [S.l. : s.n.], 2001. http://deposit.ddb.de/cgi-bin/dokserv?idn=963786040.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Johnson-Freyd, Philip Alden. "Properties of Sequent-Calculus-Based Languages." Thesis, University of Oregon, 2018. http://pqdtopen.proquest.com/#viewpdf?dispub=10684255.

Full text
Abstract:

Programmers don't just have to write programs, they are have to reason about them. Programming languages aren't just tools for instructing computers what to do, they are tools for reasoning. And, it isn't just programmers who reason about programs: compilers and other tools reason similarly as they transform from one language into another one, or as they optimize an inefficient program into a better one. Languages, both surface languages and intermediate ones, need therefore to be both efficiently implementable and to support effective logical reasoning. However, these goals often seem to be in conflict.

This dissertation studies programming language calculi inspired by the Curry-Howard correspondence, relating programming languages to proof systems. Our focus is on calculi corresponding logically to classical sequent calculus and connected computationally to abstract machines. We prove that these calculi have desirable properties to help bridge the gap between reasoning and implementation.

Firstly, we explore a persistent conflict between extensionality and effects for lazy functional programs that manifests in a loss of confluence. Building on prior work, we develop a new rewriting theory for lazy functions and control which we first prove corresponds to the desired equational theory and then prove, by way of reductions into a smaller system, to be confluent. Next, we turn to the inconsistency between weak-head normalization and extensionality. Using ideas from our study of confluence, we develop a new operational semantics and series of abstract machines for head reduction which show us how to retain weak-head reduction's ease of implementation.

After demonstrating the limitations of the above approach for call-by-value or types other than functions, we turn to typed calculi, showing how a type system can be used not only for mixing different kinds of data, but also different evaluation strategies in a single program. Building on variations of the reducibility candidates method such as biorthogonality and symmetric candidates, we present a uniform proof of strong normalization for our mixed-strategy system which works so long as all the strategies used satisfy criteria we isolate.

This dissertation includes previously published co-authored material.

APA, Harvard, Vancouver, ISO, and other styles
5

Johnson-Freyd, Philip. "Properties of Sequent-Calculus-Based Languages." Thesis, University of Oregon, 2018. http://hdl.handle.net/1794/23191.

Full text
Abstract:
Programmers don't just have to write programs, they are have to reason about them. Programming languages aren't just tools for instructing computers what to do, they are tools for reasoning. And, it isn't just programmers who reason about programs: compilers and other tools reason similarly as they transform from one language into another one, or as they optimize an inefficient program into a better one. Languages, both surface languages and intermediate ones, need therefore to be both efficiently implementable and to support effective logical reasoning. However, these goals often seem to be in conflict. This dissertation studies programming language calculi inspired by the Curry-Howard correspondence, relating programming languages to proof systems. Our focus is on calculi corresponding logically to classical sequent calculus and connected computationally to abstract machines. We prove that these calculi have desirable properties to help bridge the gap between reasoning and implementation. Firstly, we explore a persistent conflict between extensionality and effects for lazy functional programs that manifests in a loss of confluence. Building on prior work, we develop a new rewriting theory for lazy functions and control which we first prove corresponds to the desired equational theory and then prove, by way of reductions into a smaller system, to be confluent. Next, we turn to the inconsistency between weak-head normalization and extensionality. Using ideas from our study of confluence, we develop a new operational semantics and series of abstract machines for head reduction which show us how to retain weak-head reduction's ease of implementation. After demonstrating the limitations of the above approach for call-by-value or types other than functions, we turn to typed calculi, showing how a type system can be used not only for mixing different kinds of data, but also different evaluation strategies in a single program. Building on variations of the reducibility candidates method such as biorthogonality and symmetric candidates, we present a uniform proof of strong normalization for our mixed-strategy system which works so long as all the strategies used satisfy criteria we isolate. This dissertation includes previously published co-authored material.
APA, Harvard, Vancouver, ISO, and other styles
6

Kerbach, Sandra. "Sequenz-spezifische Rekombination in Zea mays L." [S.l.] : [s.n.], 2005. http://deposit.ddb.de/cgi-bin/dokserv?idn=974050342.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Nigam, Vivek. "Exploiting non-canonicity in the sequent calculus." Phd thesis, Ecole Polytechnique X, 2009. http://pastel.archives-ouvertes.fr/pastel-00005487.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Brotherston, James. "Sequent calculus proof systems for inductive definitions." Thesis, University of Edinburgh, 2006. http://hdl.handle.net/1842/1458.

Full text
Abstract:
Inductive definitions are the most natural means by which to represent many families of structures occurring in mathematics and computer science, and their corresponding induction / recursion principles provide the fundamental proof techniques by which to reason about such families. This thesis studies formal proof systems for inductive definitions, as needed, e.g., for inductive proof support in automated theorem proving tools. The systems are formulated as sequent calculi for classical first-order logic extended with a framework for (mutual) inductive definitions. The default approach to reasoning with inductive definitions is to formulate the induction principles of the inductively defined relations as suitable inference rules or axioms, which are incorporated into the reasoning framework of choice. Our first system LKID adopts this direct approach to inductive proof, with the induction rules formulated as rules for introducing atomic formulas involving inductively defined predicates on the left of sequents. We show this system to be sound and cut-free complete with respect to a natural class of Henkin models. As a corollary, we obtain cut-admissibility for LKID. The well-known method of infinite descent `a la Fermat, which exploits the fact that there are no infinite descending chains of elements of well-ordered sets, provides an alternative approach to reasoning with inductively defined relations. Our second proof system LKIDw formalises this approach. In this system, the left-introduction rules for formulas involving inductively defined predicates are not induction rules but simple case distinction rules, and an infinitary, global soundness condition on proof trees — formulated in terms of “traces” on infinite paths in the tree — is required to ensure soundness. This condition essentially ensures that, for every infinite branch in the proof, there is an inductive definition that is unfolded infinitely often along the branch. By an infinite descent argument based upon the well-foundedness of inductive definitions, the infinite branches of the proof can thus be disregarded, whence the remaining portion of proof is well-founded and hence sound. We show this system to be cutfree complete with respect to standard models, and again infer the admissibility of cut. The infinitary system LKIDw is unsuitable for formal reasoning. However, it has a natural restriction to proofs given by regular trees, i.e. to those proofs representable by finite graphs. This restricted “cyclic” proof system, CLKIDw, is suitable for formal reasoning since proofs have finite representations and the soundness condition on proofs is thus decidable. We show how the formulation of our systems LKIDw and CLKIDw can be generalised to obtain soundness conditions for a general class of infinite proof systems and their corresponding cyclic restrictions. We provide machinery for manipulating and analysing the structure of proofs in these essentially arbitrary cyclic systems, based primarily on viewing them as generating regular infinite trees, and we show that any proof can be converted into an equivalent proof with a restricted cycle structure. For proofs in this “cycle normal form”, a finitary, localised soundness condition exists that is strictly stronger than the general, infinitary soundness condition, but provides more explicit information about the proof. Finally, returning to the specific setting of our systems for inductive definitions, we show that any LKID proof can be transformed into a CLKIDw proof (that, in fact, satisfies the finitary soundness condition). We conjecture that the two systems are in fact equivalent, i.e. that proof by induction is equivalent to regular proof by infinite descent.
APA, Harvard, Vancouver, ISO, and other styles
9

Hüben, Michael. "Synthese von S-Adenosyl-L-methionin-Analoga für enzymatische DNA-Markierung und funktionelle Proteomuntersuchungen /." Aachen : Mainz, 2009. http://d-nb.info/996996257/04.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Persson, Daniel. "Sequi : Tredimensionell sequencer." Thesis, Konstfack, Grafisk Design & Illustration, 2014. http://urn.kb.se/resolve?urn=urn:nbn:se:konstfack:diva-4707.

Full text
Abstract:
Music production software has a strong tradition of two-dimensional graphical user interface (GUI), in which the time line is represented as a flat composition either horizontally (from left to right) or vertically (from top to bottom). In my degree work titled Sequi, I approach music composition from a different angle. Instead of a two-dimensional time line with only two possibly ways of progression (forward or backward) I constructed a three-dimensional GUI with the maximum of four different ways of progression from any given point in a composition. The height axis is used to describe time-intervals (the time between downbeats) and the wide and depth axes are used to describe progression from one sound to another.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "Sequani"

1

author, Humbert Sylviane, ed. Échanges et vie économique en Franche-Comté, chez les Séquanes: Le témoignage des amphores du IIe s. av. J.-C. au IVe s. ap. J.-C. Presses universitaires de Franche-Comté, 2022.

APA, Harvard, Vancouver, ISO, and other styles
2

Jousseaume, Isabelle. HISTOIRE DE SEQUANA - conte. Editions L'Harmattan, 2012.

APA, Harvard, Vancouver, ISO, and other styles
3

Worboyes, Sally. Red sequins. Coronet, 2002.

APA, Harvard, Vancouver, ISO, and other styles
4

Schneider, Uta. Sequens 6.8. Unica T, 1991.

APA, Harvard, Vancouver, ISO, and other styles
5

Kraß, Andreas, and Christina Ostermann, eds. Hymnus, Sequenz, Antiphon. De Gruyter, 2019. http://dx.doi.org/10.1515/9783110648799.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Roger, Willems, Manders Mark 1968-, Wandschneider Miguel, and Culturgest (Gallery), eds. Kees Goudzwaard, Sequent. Roma Publications, 2006.

APA, Harvard, Vancouver, ISO, and other styles
7

Satie, Erik. Vieux sequins et vieilles cuirasses. M. Eschig, 1996.

APA, Harvard, Vancouver, ISO, and other styles
8

Johnson, Amryl. Sequins for a ragged hem. Virago, 1988.

APA, Harvard, Vancouver, ISO, and other styles
9

Johnson, Amryl. Sequins for a ragged hem. Virago, 1988.

APA, Harvard, Vancouver, ISO, and other styles
10

Yilmaz, Dziewior, and Kunsthaus Bregenz, eds. Räumliche Sequenz: Spatial sequence : Florian Pumhösl. Buchhandlung Walther König, 2012.

APA, Harvard, Vancouver, ISO, and other styles
More sources

Book chapters on the topic "Sequani"

1

Ono, Hiroakira. "Sequent Systems." In Proof Theory and Algebra in Logic. Springer Singapore, 2019. http://dx.doi.org/10.1007/978-981-13-7997-0_1.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Sannella, Donald, Michael Fourman, Haoran Peng, and Philip Wadler. "Sequent Calculus." In Undergraduate Topics in Computer Science. Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-76908-6_14.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Kraß, Andreas, and Christina Ostermann. "Einleitung." In Hymnus, Sequenz, Antiphon, edited by Andreas Kraß and Christina Ostermann. De Gruyter, 2019. http://dx.doi.org/10.1515/9783110648799-001.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Ammer, Jessica. "Die Reimpaarübersetzungen des Hymnus Veni creator spiritus." In Hymnus, Sequenz, Antiphon, edited by Andreas Kraß and Christina Ostermann. De Gruyter, 2019. http://dx.doi.org/10.1515/9783110648799-002.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Standke, Matthias. "Die deutschen Übertragungen des Hymnus Jesu dulcis memoria Überlegungen zu Umfang und Strophenfolge im Spannungsfeld von Liturgie und Volkssprache." In Hymnus, Sequenz, Antiphon, edited by Andreas Kraß and Christina Ostermann. De Gruyter, 2019. http://dx.doi.org/10.1515/9783110648799-003.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Ostermann, Christina. "Sehen und Erkennen Der Hymnus Ave vivens hostia und seine mittelalterlichen deutschen Übertragungen." In Hymnus, Sequenz, Antiphon, edited by Andreas Kraß and Christina Ostermann. De Gruyter, 2019. http://dx.doi.org/10.1515/9783110648799-004.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Bußmann, Britta. "Mischsprachigkeit Heinrich Laufenbergs Bearbeitungen der Antiphon Ave regina caelorum und des Hymnus Ave maris stella." In Hymnus, Sequenz, Antiphon, edited by Andreas Kraß and Christina Ostermann. De Gruyter, 2019. http://dx.doi.org/10.1515/9783110648799-005.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Kraß, Andreas. "Der Mönch von Salzburg als Übersetzer von Hymnen und Sequenzen Die Fallbeispiele Lauda Sion salvatorem und Stabat mater dolorosa." In Hymnus, Sequenz, Antiphon, edited by Andreas Kraß and Christina Ostermann. De Gruyter, 2019. http://dx.doi.org/10.1515/9783110648799-006.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Kulagina, Pavlina. "Die Sequenz Salve mater salvatoris von Adam von St. Viktor und ihre niederrheinische Tagzeiten-Bearbeitung Ein Fallbeispiel der Marienverehrung zwischen Liturgie und Privatandacht." In Hymnus, Sequenz, Antiphon, edited by Andreas Kraß and Christina Ostermann. De Gruyter, 2019. http://dx.doi.org/10.1515/9783110648799-007.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Murray, David. "Die Übersetzungen des Mönchs von Salzburg als Lieder Das Fallbeispiel der Mariensequenz Salve mater salvatoris." In Hymnus, Sequenz, Antiphon, edited by Andreas Kraß and Christina Ostermann. De Gruyter, 2019. http://dx.doi.org/10.1515/9783110648799-008.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Sequani"

1

Thanh, Cedric Ho, Pierre-Louis Curien, and Samuel Mimram. "A Sequent Calculus for Opetopes." In 2019 34th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS). IEEE, 2019. http://dx.doi.org/10.1109/lics.2019.8785667.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Schumann, Andrew. "Non-Archimedean Valued Sequent Logic." In 2006 8th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing. IEEE, 2006. http://dx.doi.org/10.1109/synasc.2006.57.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Lyon, Timothy S., and Jonas Karge. "Constructive Interpolation and Concept-Based Beth Definability for Description Logics via Sequents." In Thirty-Third International Joint Conference on Artificial Intelligence {IJCAI-24}. International Joint Conferences on Artificial Intelligence Organization, 2024. http://dx.doi.org/10.24963/ijcai.2024/386.

Full text
Abstract:
We introduce a constructive method applicable to a large number of description logics (DLs) for establishing the concept-based Beth definability property (CBP) based on sequent systems. Using the highly expressive DL RIQ as a case study, we introduce novel sequent calculi for RIQ-ontologies and show how certain interpolants can be computed from sequent calculus proofs, which permit the extraction of explicit definitions of implicitly definable concepts. To the best of our knowledge, this is the first sequent-based approach to computing interpolants and definitions within the context of DLs, as well as the first proof that RIQ enjoys the CBP. Moreover, due to the modularity of our sequent systems, our results hold for any restriction of RIQ, and are applicable to other DLs by suitable modifications.
APA, Harvard, Vancouver, ISO, and other styles
4

Griffiths, M. "Ada tasking on the sequent balance." In the third conference. ACM Press, 1988. http://dx.doi.org/10.1145/62297.62344.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Gabbay, M., and J. Cheney. "A sequent calculus for nominal logic." In Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science, 2004. IEEE, 2004. http://dx.doi.org/10.1109/lics.2004.1319608.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Li, Der-Chiang, Yu-Ching Chang, and Yi-Hsiang Huang. "Sequent location information embedded grey model." In 2013 IEEE International Conference on Grey Systems and Intelligent Services (GSIS). IEEE, 2013. http://dx.doi.org/10.1109/gsis.2013.6714830.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

McCall, McKenna, Lay Kuan Loh, and Limin Jia. "A Sequent Calculus for Counterfactual Reasoning." In CCS '17: 2017 ACM SIGSAC Conference on Computer and Communications Security. ACM, 2017. http://dx.doi.org/10.1145/3139337.3139342.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Oettel, A., SD Costa, and K. Wollschlaeger. "Fallbericht: monochoriale Geminigravidität mit TRAP-Sequenz." In 62. Kongress der Deutschen Gesellschaft für Gynäkologie und Geburtshilfe – DGGG'18. Georg Thieme Verlag KG, 2018. http://dx.doi.org/10.1055/s-0038-1671269.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Pasura, L., I. Vitezica, EM Spur, CR Weiß, T. Braun, and W. Henrich. "Konservatives geburtsmedizinisches Management einer TRAP-Sequenz." In 62. Kongress der Deutschen Gesellschaft für Gynäkologie und Geburtshilfe – DGGG'18. Georg Thieme Verlag KG, 2018. http://dx.doi.org/10.1055/s-0038-1671545.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Maghrabi, Talal, and Forouzan Golshani. "Automatic program generation using sequent calculus." In the 1992 ACM annual conference. ACM Press, 1992. http://dx.doi.org/10.1145/131214.131224.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Sequani"

1

Cody, W. ELEFUNT test results under AST Fortran V1. 8. 0 on the Sequent Symmetry. Office of Scientific and Technical Information (OSTI), 1990. http://dx.doi.org/10.2172/6686300.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

ADA JOINT PROGRAM OFFICE ARLINGTON VA. Ada (Tradename) Compiler Validation Summary Report: Certificate Number: 880201W1.09019 Verdix Corporation VAda-010-2323, Version 5.5 Sequent Balance 8000. Defense Technical Information Center, 1988. http://dx.doi.org/10.21236/ada205959.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

ADA JOINT PROGRAM OFFICE ARLINGTON VA. Ada Compiler Validation Summary Report. Verdix Corporation, VAda-110-2323, Version 5.5, Sequent Balance 8000 (Host and Target), 890216W1.10029. Defense Technical Information Center, 1989. http://dx.doi.org/10.21236/ada209881.

Full text
APA, Harvard, Vancouver, ISO, and other styles
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography