Thematische Bibliographien / Bounded repetition

Inhaltsverzeichnis

Zeitschriftenartikel
Dissertationen
Bücher
Buchteile
Konferenzberichte

Auswahl der wissenschaftlichen Literatur zum Thema „Bounded repetition“

Autor: Grafiati

Veröffentlicht am 28. Juni 2021

Zuletzt aktualisiert am 2. Februar 2022

Geben Sie eine Quelle nach APA, MLA, Chicago, Harvard und anderen Zitierweisen an

Wählen Sie eine Art der Quelle aus:

Machen Sie sich mit den Listen der aktuellen Artikel, Bücher, Dissertationen, Berichten und anderer wissenschaftlichen Quellen zum Thema "Bounded repetition" bekannt.

Neben jedem Werk im Literaturverzeichnis ist die Option "Zur Bibliographie hinzufügen" verfügbar. Nutzen Sie sie, wird Ihre bibliographische Angabe des gewählten Werkes nach der nötigen Zitierweise (APA, MLA, Harvard, Chicago, Vancouver usw.) automatisch gestaltet.

Sie können auch den vollen Text der wissenschaftlichen Publikation im PDF-Format herunterladen und eine Online-Annotation der Arbeit lesen, wenn die relevanten Parameter in den Metadaten verfügbar sind.

Zeitschriftenartikel zum Thema "Bounded repetition"

Davison, J. L. „CONTINUED FRACTIONS WITH BOUNDED PARTIAL QUOTIENTS“. Proceedings of the Edinburgh Mathematical Society 45, Nr. 3 (Oktober 2002): 653–71. http://dx.doi.org/10.1017/s001309150000119x.

Der volle Inhalt der Quelle

Annotation:

AbstractPrecise bounds are given for the quantity$$ L(\alpha)=\frac{\limsup_{m\rightarrow\infty}(1/m)\ln q_m}{\liminf_{m\rightarrow\infty}(1/m)\ln q_m}, $$where $(q_m)$ is the classical sequence of denominators of convergents to the continued fraction $\alpha=[0,u_1,u_2,\dots]$ and $(u_m)$ is assumed bounded, with a distribution.If the infinite word $\bm{u}=u_1u_2\dots$ has arbitrarily large instances of segment repetition at or near the beginning of the word, then we quantify this property by means of a number $\gamma$, called the segment-repetition factor.If $\alpha$ is not a quadratic irrational, then we produce a specific sequence of quadratic irrational approximations to $\alpha$, the rate of convergence given in terms of $L$ and $\gamma$. As an application, we demonstrate the transcendence of some continued fractions, a typical one being of the form $[0,u_1,u_2,\dots]$ with $u_m=1+\lfloor m\theta\rfloor\Mod n$, $n\geq2$, and $\theta$ an irrational number which satisfies any of a given set of conditions.AMS 2000 Mathematics subject classification: Primary 11A55. Secondary 11B37

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Razgon, Igor. „On Oblivious Branching Programs with Bounded Repetition that Cannot Efficiently Compute CNFs of Bounded Treewidth“. Theory of Computing Systems 61, Nr. 3 (17.10.2016): 755–76. http://dx.doi.org/10.1007/s00224-016-9714-0.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Asahiro, Yuichi, Jesper Jansson, Guohui Lin, Eiji Miyano, Hirotaka Ono und Tadatoshi Utashima. „Exact algorithms for the repetition-bounded longest common subsequence problem“. Theoretical Computer Science 838 (Oktober 2020): 238–49. http://dx.doi.org/10.1016/j.tcs.2020.07.042.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Holub, Štěpán. „Words with unbounded periodicity complexity“. International Journal of Algebra and Computation 24, Nr. 06 (September 2014): 827–36. http://dx.doi.org/10.1142/s0218196714500362.

Der volle Inhalt der Quelle

Annotation:

If an infinite non-periodic word is uniformly recurrent or is of bounded repetition, then the limit of its periodicity complexity is infinity. Moreover, there are uniformly recurrent words with the periodicity complexity arbitrarily high at infinitely many positions.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Serfes, Konstantinos, und Nicholas C. Yannelis. „LEARNING IN BAYESIAN GAMES BY BOUNDED RATIONAL PLAYERS II: NONMYOPIA“. Macroeconomic Dynamics 2, Nr. 2 (Juni 1998): 141–55. http://dx.doi.org/10.1017/s1365100598007019.

Der volle Inhalt der Quelle

Annotation:

We generalize results of earlier work on learning in Bayesian games by allowing players to make decisions in a nonmyopic fashion. In particular, we address the issue of nonmyopic Bayesian learning with an arbitrary number of bounded rational players, i.e., players who choose approximate best-response strategies for the entire horizon (rather than the current period). We show that, by repetition, nonmyopic bounded rational players can reach a limit full-information nonmyopic Bayesian Nash equilibrium (NBNE) strategy. The converse is also proved: Given a limit full-information NBNE strategy, one can find a sequence of nonmyopic bounded rational plays that converges to that strategy.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Feng, Deren, Xiaojuan Xu, Jin Luo, Xiaolong Lee, Zhaohu Yao und Chengda Yu. „A High-Repetition-Rate Bounded-Wave EMP Simulator Based on Hydrogen Thyratron and Transmission Line Transformer“. IEEE Transactions on Plasma Science 40, Nr. 12 (Dezember 2012): 3499–507. http://dx.doi.org/10.1109/tps.2012.2222030.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Hellman, Ziv, und Ron Peretz. „A Survey on Entropy and Economic Behaviour“. Entropy 22, Nr. 2 (29.01.2020): 157. http://dx.doi.org/10.3390/e22020157.

Der volle Inhalt der Quelle

Annotation:

Entropy plays a significant role in the study of games and economic behaviour in several ways. A decision maker faced with an n-fold repetition of a decision-making problem needs to apply strategies that become increasingly complex as n increases. When several players are involved in selecting strategies in interactive games, bounds on the memories and cognitive capacities of the players can affect possible outcomes. A player who can recall only the last k periods of history is said to have bounded recall of capacity k. We present here a brief survey of results of games played by players with different bounded recall capacities, in particular those indicating surprisingly strong relations between memory and entropy in the study of the min-max values of repeated games with bounded recall. In addition, we consider uses of entropy in measuring the value of information of noisy signal structures, also known as experiments. These are represented by stochastic matrices, with the rows representing states of the world and the columns possible signals. The classic ordering of experiments, due to David Blackwell and based on decision-making criteria, is a partial ordering, which has led to attempts to extend this ordering to a total ordering. If a decision maker has a prior distribution over the states, receipt of a signal yields a posterior. The difference between the entropy of a prior and the expected entropy of the set of possible posteriors has been proposed as a natural extension of the Blackwell ordering. We survey this alongside the theory of rational inattention, which posits that, since individuals have limited attention, they do not always follow every single piece of economic news in planning their economic behaviour. By modelling attention limits as finite channel capacity in the sense of Shannon, economists have developed a theory that explains a range of observed economic behavioural phenomena well.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

McMillan, Christian. „Jung and Deleuze: Enchanted Openings to the Other: A Philosophical Contribution“. International Journal of Jungian Studies 10, Nr. 3 (08.02.2018): 184–98. http://dx.doi.org/10.1080/19409052.2018.1505236.

Der volle Inhalt der Quelle

Annotation:

This paper draws from resources in the work of Deleuze to critically examine the notion of organicism and holistic relations that appear in historical forerunners that Jung identifies in his work on synchronicity. I interpret evidence in Jung’s comments on synchronicity that resonate with Deleuze’s interpretation of repetition and time and which challenge any straightforward foundationalist critique of Jung’s thought. A contention of the paper is that Jung and Deleuze envisage enchanted openings onto relations which are not constrained by the presupposition of a bounded whole, whether at the level of the macrocosm or the microcosm. Openings to these relations entail the potential for experimental transformation beyond sedentary habits of thought which are blocked by a disenchanting ‘image of thought’ that stands in need of critique. Other examples of enchanted openings in Jung’s work are signposted in an effort to counter their marginalisation in some post-Jungian critiques and to signal their potential value from a Deleuzian perspective.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Gharibian, Sevag, Jamie Sikora und Sarvagya Upadhyay. „QMA variants with polynomially many provers“. Quantum Information and Computation 13, Nr. 1&2 (Januar 2013): 135–57. http://dx.doi.org/10.26421/qic13.1-2-8.

Der volle Inhalt der Quelle

Annotation:

We study three variants of multi-prover quantum Merlin-Arthur proof systems. We first show that the class of problems that can be efficiently verified using polynomially many quantum proofs, each of logarithmic-size, is exactly \class{MQA} (also known as QCMA), the class of problems which can be efficiently verified via a classical proof and a quantum verifier. We then study the class $\class{BellQMA}(\poly)$, characterized by a verifier who first applies unentangled, nonadaptive measurements to each of the polynomially many proofs, followed by an arbitrary but efficient quantum verification circuit on the resulting measurement outcomes. We show that if the number of outcomes per nonadaptive measurement is a polynomially-bounded function, then the expressive power of the proof system is exactly \class{QMA}. Finally, we study a class equivalent to \class{QMA}($m$), denoted $\class{SepQMA}(m)$, where the verifier's measurement operator corresponding to outcome {\it accept} is a fully separable operator across the $m$ quantum proofs. Using cone programming duality, we give an alternate proof of a result of Harrow and Montanaro [FOCS, pp. 633--642 (2010)] that shows a perfect parallel repetition theorem for $\class{SepQMA}(m)$ for any $m$.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Narmour, Eugene. „Music Expectation by Cognitive Rule-Mapping“. Music Perception 17, Nr. 3 (2000): 329–98. http://dx.doi.org/10.2307/40285821.

Der volle Inhalt der Quelle

Annotation:

Iterative rules appear everywhere in music cognition, creating strong expectations. Consequently, denial of rule projection becomes an important compositional strategy, generating numerous possibilities for musical affect. Other rules enter the musical aesthetic through reflexive game playing. Still other kinds are completely constructivist in nature and may be uncongenial to cognition, requiring much training to be recognized, if at all. Cognitive rules are frequently found in contexts of varied repetition (AA), but they are not necessarily bounded by stylistic similarity. Indeed, rules may be especially relevant in the processing of unfamiliar contexts (AB), where only abstract coding is available. There are many kinds of deduction in music cognition. Typical examples include melodic sequence, partial melodic sequence, and alternating melodic sequence (which produces streaming). These types may coexist in the musical fabric, involving the invocation of both simultaneous and nested rules. Intervallic expansion and reduction in melody also involve higherorder abstractions. Various mirrored forms in music entail rule-mapping as well, although these may be more difficult to perceive than their analogous visual symmetries. Listeners can likewise deduce additivity and subtractivity at work in harmony, tempo, texture, pace, and dynamics. Rhythmic augmentation and diminution, by contrast, rely on multiplication and division. The examples suggest numerous hypotheses for experimental research.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Mehr Quellen

Dissertationen zum Thema "Bounded repetition"

Horký, Michal. „Rychlejší než grep pomocí čítačů“. Master's thesis, Vysoké učení technické v Brně. Fakulta informačních technologií, 2021. http://www.nusl.cz/ntk/nusl-445473.

Der volle Inhalt der Quelle

Annotation:

Vyhledávání regulárních výrazů má ve vývoji softwaru nezastupitelné místo. Rychlost vyhledávání může ovlivnit použitelnost softwaru, a proto je na ni kladen velký důraz. Pro určité druhy regulárních výrazů mají standardní přístupy pro vyhledávání vysokou složitost. Kvůli tomu jsou náchylné k útokům založeným na vysoké náročnosti vyhledávání regulárních výrazů (takzvané ReDoS útoky). Regulární výrazy s omezeným opakováním, které se v praxi často vyskytují, jsou jedním z těchto druhů. Efektivní reprezentace a rychlé vyhledávání těchto regulárních výrazů je možné s použítím automatu s čítači. V této práci představujeme implementaci vyhledávání regulárních výrazů založeném na automatech s čítači v C++. Vyhledávání je implementováno v rámci RE2, rychlé moderní knihovny pro vyhledávání regulárních výrazů. V práci jsme provedli experimenty na v praxi používaných regulárních výrazech. Výsledky experimentů ukázaly, že implementace v rámci nástroje RE2 je rychleší než původní implementace v jazyce C#.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Frangoulidis, Stavros. „The structure and repetition in the Prometheus Bound and the Persians“. The Ohio State University, 1985. http://rave.ohiolink.edu/etdc/view?acc_num=osu1406735321.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Beeferman, Leah. „JOURNEYS INTO THE UNKNOWN: A SERIES OF SCIENCE ARCHITECTURE TASKS AND EVENTS, SPACE-BOUND EXPLORATIONS AND FAR-TRAVELS, DISCOVERIES AND MISSES (NEAR AND FAR), IMAGINATIVE SPACE-GAZING AND RELATED INVESTIGATIONS, OBSERVATIONS, ORBITS, AND OTHER REPETITIOUS MONITORING TASKS“. VCU Scholars Compass, 2010. http://scholarscompass.vcu.edu/etd/2164.

Der volle Inhalt der Quelle

Annotation:

This thesis expansively and inclusively puts forth the imaginings, research, processes and experiences behind my two thesis exhibitions, "Journeys into the unknown: a series of science architecture tasks and events, space-bound explorations and far-travels, discoveries and misses (near and far), imaginative space-gazing and related investigations, observations, orbits, and other repetitious monitoring tasks" and "Timed travel: asystematic accounts of regular and geometrical timekeeping, orbital flight, repetitive rotations and other journeys into actual time and slow space." It begins with an abstract interpretation of the dial: a tool not limited to scientific measurement but, instead, a gauge of an object’s overall position and general status. Equal parts scientific information, abstracted and fictionalized instruments and facts, and the personal experiences which provided these concrete informational elements with psychological and metaphorical meaning, this document is as much a record of time as it is an elucidation of my artistic practice and methodology.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Bücher zum Thema "Bounded repetition"

Marín, Yarí Pérez. Marvels of Medicine. Liverpool University Press, 2020. http://dx.doi.org/10.3828/liverpool/9781789622508.001.0001.

Der volle Inhalt der Quelle

Annotation:

Marvels of Medicine makes a compelling case for including sixteenth century medical and surgical writing in the critical frameworks we now use to think about a genealogy of cultural expression in Latin America. Focusing on a small group of practitioners who differed in their levels of training, but who shared the common experience of having left Spain to join colonial societies in the making, this book analyses the paths their texts charted to attitudes and political positions that would come to characterize a criollo mode of enunciation. Unlike the accounts of first explorers, which sought to amaze audiences back in Europe with descriptions of strange and astonishing lands, these texts instead engaged the marvellous in an effort to supersede it, stressing the value of sensorial experience and of verifying information through repetition and demonstration. Vernacular medical writing became an unlikely early platform for a new form of regionally anchored discourse that demanded participation in a global intellectual conversation yet found itself increasingly relegated to the margins. In responding to that challenge, anatomical treatises, natural histories and surgical manuals exceeded the bounds set by earlier templates becoming rich, hybrid narratives that were as concerned with science as with portraying the lives and sensibilities of women and men in early colonial Mexico.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Buchteile zum Thema "Bounded repetition"

Asahiro, Yuichi, Jesper Jansson, Guohui Lin, Eiji Miyano, Hirotaka Ono und Tadatoshi Utashima. „Exact Algorithms for the Bounded Repetition Longest Common Subsequence Problem“. In Combinatorial Optimization and Applications, 1–12. Cham: Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-36412-0_1.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Pape-Lange, Julian. „Upper Bounds on Distinct Maximal (Sub-)Repetitions in Compressed Strings“. In Developments in Language Theory, 316–27. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-81508-0_26.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Gawrychowski, Paweł, Samah Ghazawi und Gad M. Landau. „Lower Bounds for the Number of Repetitions in 2D Strings“. In String Processing and Information Retrieval, 179–92. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-86692-1_15.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Schmidt, Stefan. „Replication and Reproducibility“. In Research Methods in the Social Sciences: An A-Z of key concepts, 238–42. Oxford University Press, 2021. http://dx.doi.org/10.1093/hepl/9780198850298.003.0055.

Der volle Inhalt der Quelle

Annotation:

This chapter focuses on replication and reproducibility. A single observation cannot be trusted. Similarly, findings from a single experimental investigation may reflect some regularity but they may also be due to chance, artefacts, or misinterpretations. Therefore, it is necessary to repeat the respective research procedure in order to validate the observations from the first study. Such a repetition is called replication. It is a very basic methodological tool that serves to transform an observation into a piece of validated knowledge. An observation or relationship that is found repeatedly and is also found under various scope conditions fulfils the important scientific criteria of reproducibility. There are different types of replications. The most basic distinction is between a narrow-bounded notion of replication termed direct replication and a wider notion of replication termed conceptual replication.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Lin, Lana. „Prosthetic Objects“. In Freud's Jaw and Other Lost Objects. Fordham University Press, 2017. http://dx.doi.org/10.5422/fordham/9780823277711.003.0002.

Der volle Inhalt der Quelle

Annotation:

This chapter examines Freud’s ambivalent attachment to his prosthetic jaw, a result of his addiction to smoking. It argues that illness highlights the technological predicament in which humans as “prosthetic gods” are bound up. Exposing the contradiction between the promise of technology and its potential to fail, the prosthesis paradoxically represents both injury and reparation. The chapter provides a close reading of Freud’s medical case alongside his theories and relevant personal narrative. The uncanny repetitions of Freud’s prosthetic adjustment rhyme with the compulsive structure embedded in his theory of the death drives. The term “not-death” is proposed to describe the persistent entanglement of the life and death drives. Simultaneously creative and destructive, Freud’s inorganic and organic prosthetic dependencies mediate the ongoing contest that cancer perpetuates between life and death.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Kirousis, Lefteris M., und Lefteris M. Stamatiou. „The Satisfiability Threshold Conjecture: Techniques Behind Upper Bound Improvements“. In Computational Complexity and Statistical Physics. Oxford University Press, 2005. http://dx.doi.org/10.1093/oso/9780195177374.003.0015.

Der volle Inhalt der Quelle

Annotation:

One of the most challenging problems in probability and complexity theory is to establish and determine the satisfiability threshold, or phase transition, for random 3-SAT instances: Boolean formulas consisting of clauses with exactly k literals. As the previous part of the volume has explored, empirical observations suggest that there exists a critical ratio of the number of clauses to the number of variables, such that almost all randomly generated formulas with a higher ratio are unsatisfiable while almost all randomly generated formulas with a lower ratio are satisfiable. The statement that such a crossover point really exists is called the satisfiability threshold conjecture. Experiments hint at such a direction, but as far as theoretical work is concerned, progress has been difficult. In an important advance, Friedgut [177] showed that the phase transition is a sharp one, though without proving that it takes place at a “fixed” ratio for large formulas. Otherwise, rigorous proofs have focused on providing successively better upper and lower bounds for the value of the (conjectured) threshold. In this chapter, our goal is to review the series of improvements of upper bounds for 3-SAT and the techniques leading to these. We give only a passing reference to the improvements of the lower bounds as they rely on significantly different techniques, one of which is discussed in the next chapter. Let ϕ be a random k-SAT formula constructed by selecting, uniformly and with replacement, ra clauses from the set of all possible clauses with k literals (no variable repetitions allowed within a clause) over n variables. It has been experimentally observed that as the numbers m, n of variables and clauses tend to infinity while the ratio or clause density m/n is fixed to a constant a, the property of satisfiability exhibits a phase transition. For the case of 3-SAT, when a is greater than a number that has been experimentally determined to be approximately α < 4.27, then almost all random 3-SAT formulas are unsatisfiable; that is, the fraction of unsatisfiable formulas tends to 1.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Cook, Diane J., und Lawrence B. Holder. „Discovering Concepts in Structural Data“. In Pattern Discovery in Biomolecular Data. Oxford University Press, 1999. http://dx.doi.org/10.1093/oso/9780195119404.003.0016.

Der volle Inhalt der Quelle

Annotation:

The large amount of data collected today is quickly overwhelming researchers’ abilities to interpret the data and discover interesting patterns. In response to this problem, a number of researchers have developed techniques for discovering concepts in databases. These techniques work well for data expressed in a nonstructural, attribute-value representation and address issues of data relevance, missing data, noise and uncertainty, and utilization of domain knowledge (Fisher, 1987; Cheeseman and Stutz, 1996). However, recent data acquisition projects are collecting structural data describing the relationships among the data objects. Correspondingly, there exists a need for techniques to analyze and discover concepts in structural databases (Fayyad et al., 1996b). One method for discovering knowledge in structural data is the identification of common substructures. The goal is to find substructures capable of compressing the data and to identify conceptually interesting substructures that enhance the interpretation of the data. Substructure discovery is the process of identifying concepts describing interesting and repetitive substructures within structural data. Once discovered, the substructure concept can be used to simplify the data by replacing instances of the substructure with a pointer to the newly discovered concept. The discovered substructure concepts allow abstraction over detailed structure in the original data and provide new, relevant attributes for interpreting the data. Iteration of the substructure discovery and replacement process constructs a hierarchical description of the structural data in terms of the discovered substructures. This hierarchy provides varying levels of interpretation that can be accessed based on the goals of the data analysis. We describe a system called Subdue that discovers interesting substructures in structural data based on the minimum description length (MDL) principle. The Subdue system discovers substructures that compress the original data and represent structural concepts in the data. By replacing previously discovered substructures, multiple passes of Subdue produce a hierarchical description of the structural regularities in the data. Subdue uses a computationally bounded inexact graph match that identifies similar, but not identical, instances of a substructure and finds an approximate measure of closeness of two substructures when under computational constraints.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Konferenzberichte zum Thema "Bounded repetition"

Yamada, Manabu, und Masayoshi Tomizuka. „Robust Repetitive Control System With On-Line Identification of the Period of Periodic Disturbances“. In ASME 2004 International Mechanical Engineering Congress and Exposition. ASMEDC, 2004. http://dx.doi.org/10.1115/imece2004-61964.

Der volle Inhalt der Quelle

Annotation:

Repetitive control system is a servo system that achieves zero steady-state tracking error for any periodic desired outputs and any periodic disturbance inputs with a known period. This paper deals with a repetitive control problem for the case where the plant has a norm-bounded uncertainty and the period of periodic disturbances is unknown but is within known lower and upper bounds. A new robust repetitive controller is proposed not only to guarantee the robust stability against the uncertainty but also to estimate the unknown period and to reject any periodic disturbances with the period. It is shown that the design problem is reduced to a simple and feasible l1 norm minimization problem. The controller can be obtained easily by solving a simple linear programming problem. Simulation results show the effectiveness of the proposed controller for rejection of periodic disturbances with uncertain periods.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Rao, Anup. „Parallel repetition in projection games and a concentration bound“. In the 40th annual ACM symposium. New York, New York, USA: ACM Press, 2008. http://dx.doi.org/10.1145/1374376.1374378.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Wang, Xuqin, und Yong Yao. „Switchable repetition rate bound solitons passively mode-locked fiber laser“. In SPIE/COS Photonics Asia, herausgegeben von Minlin Zhong, Jonathan Lawrence, Minghui Hong und Jian Liu. SPIE, 2016. http://dx.doi.org/10.1117/12.2247778.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Fuente, Juan De La, Susheelkumar C. Subramanian, Prudhvi Tej Chinimilli, Sangram Redkar und Thomas Sugar. „The Design of Robust Phase Oscillator for Wearable Robotic Systems“. In ASME 2019 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. American Society of Mechanical Engineers, 2019. http://dx.doi.org/10.1115/detc2019-97453.

Der volle Inhalt der Quelle

Annotation:

Abstract This paper presents the design of a phase-based robust oscillator for wearable robots that assists the human performing periodic or repetitive tasks. The robustness of the phase oscillator controller is evaluated by finding bounds for perturbations that guaranteed the stability of the output. Then, the Lyapunov redesign method is applied to construct a robust controller using a bounding function which can handle the uncertainties such as noise and perturbations in the overall human-robot system. The robust controller produces a bounded control signal to modify the amplitude and frequency of the resulting second-order oscillator to modulate the stiffness and damping properties. In this paper, the focus is put on the wearable robot that assists human hip joint while performing periodic activities such as walking. The proposed approach is verified through a simple pendulum experiment. The results show that a better limit cycle can be obtained with Lyapunov redesigned phase oscillator which controls the radial spread of the steady state. Finally, the potential of the proposed approach for hip assistance in a healthy subject wearing HeSa (Hip Exoskeleton for Superior Assistance) during periodic activities are discussed.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Shaqfeh, Mohammad, und Hussein Alnuweiri. „The broadcast of repetition coding achieves the capacity bounds of decode-and-forward“. In 2012 9th International Symposium on Wireless Communication Systems (ISWCS 2012). IEEE, 2012. http://dx.doi.org/10.1109/iswcs.2012.6328360.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Glebov, Anton, Nikolay Matveev, Kirill Andreev, Alexey Frolov und Andrey Turlikov. „Achievability Bounds for T-Fold Irregular Repetition Slotted ALOHA Scheme in the Gaussian MAC“. In 2019 IEEE Wireless Communications and Networking Conference (WCNC). IEEE, 2019. http://dx.doi.org/10.1109/wcnc.2019.8885472.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Koichi, M., S. Ujita, Y. Maeda, K. Miyamoto und T. Omatsu. „MHz repetition rate, pico-second mid-infrared generation pumped by a Nd-doped vanadate bounce laser“. In Nonlinear Photonics. Washington, D.C.: OSA, 2010. http://dx.doi.org/10.1364/np.2010.nme47.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Takashige Omatsu, Ara Minassian und Michael J. Damzen. „High repetition rate Q-switching performance in transversely diode-pumped Nd doped mixed gadolinium yttrium vanadate bounce laser“. In 2006 Conference on Lasers and Electro-Optics and 2006 Quantum Electronics and Laser Science Conference. IEEE, 2006. http://dx.doi.org/10.1109/cleo.2006.4628051.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Shah-Mansouri, H., und M. R. Pakravan. „An Upper Bound on the Performance of Non-Repetitive Flooding over CSMA in Wireless Ad-Hoc Networks“. In ICC 2009 - 2009 IEEE International Conference on Communications. IEEE, 2009. http://dx.doi.org/10.1109/icc.2009.5198741.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Huang, Qianqian, Tianxing Wang, Zhijun Yan, Chuanhang Zou, Kaiming Zhou, Lin Zhang und Chengbo Mou. „Dual pulse bound states in a dispersion-managed mode-locked all-fiber laser with 101.75MHz repetition rate using 45° tilted fiber grating“. In 2017 16th International Conference on Optical Communications and Networks (ICOCN). IEEE, 2017. http://dx.doi.org/10.1109/icocn.2017.8121195.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Wir bieten Rabatte auf alle Premium-Pläne für Autoren, deren Werke in thematische Literatursammlungen aufgenommen wurden. Kontaktieren Sie uns, um einen einzigartigen Promo-Code zu erhalten!