Log in

Relevant bibliographies by topics / Bounded repetition / Journal articles

To see the other types of publications on this topic, follow the link: Bounded repetition.

Journal articles on the topic 'Bounded repetition'

Author: Grafiati

Published: 28 June 2021

Last updated: 29 July 2025

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

Select a source type:

Consult the top 50 journal articles for your research on the topic 'Bounded repetition.'

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.

Browse journal articles on a wide variety of disciplines and organise your bibliography correctly.

1

Le Glaunec, Alexis, Lingkun Kong, and Konstantinos Mamouras. "Regular Expression Matching using Bit Vector Automata." Proceedings of the ACM on Programming Languages 7, OOPSLA1 (2023): 492–521. http://dx.doi.org/10.1145/3586044.

Full text

Abstract:

Regular expressions (regexes) are ubiquitous in modern software. There is a variety of implementation techniques for regex matching, which can be roughly categorized as (1) relying on backtracking search, or (2) being based on finite-state automata. The implementations that use backtracking are often chosen due to their ability to support advanced pattern-matching constructs. Unfortunately, they are known to suffer from severe performance problems. For some regular expressions, the running time for matching can be exponential in the size of the input text. In order to provide stronger guarante

APA, Harvard, Vancouver, ISO, and other styles

2

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

Full text

Abstract:

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 irrat

APA, Harvard, Vancouver, ISO, and other styles

3

Razgon, Igor. "The splitting power of branching programs of bounded repetition and CNFs of bounded width." Discrete Applied Mathematics 360 (January 2025): 366–81. http://dx.doi.org/10.1016/j.dam.2024.09.028.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

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

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

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

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

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

Full text

Abstract:

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, and other styles

7

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

Full text

Abstract:

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

APA, Harvard, Vancouver, ISO, and other styles

8

Galashin, Pavel, and Thomas Lam. "Positroid Catalan numbers." Communications of the American Mathematical Society 4, no. 8 (2024): 357–86. http://dx.doi.org/10.1090/cams/33.

Full text

Abstract:

Given a (bounded affine) permutation f f , we study the positroid Catalan number C f C_f defined to be the torus-equivariant Euler characteristic of the associated open positroid variety. We introduce a class of repetition-free permutations and show that the corresponding positroid Catalan numbers count Dyck paths avoiding a convex subset of the rectangle. We show that any convex subset appears in this way. Conjecturally, the associated q , t q,t -polynomials coincide with the generalized q , t q,t -Catalan numbers that recently appeared in relation to the shuffle conjecture, flag Hilbert sche

APA, Harvard, Vancouver, ISO, and other styles

9

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

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Ueno, Rei, Naofumi Homma, Akiko Inoue, and Kazuhiko Minematsu. "Fallen Sanctuary: A Higher-Order and Leakage-Resilient Rekeying Scheme." IACR Transactions on Cryptographic Hardware and Embedded Systems 2024, no. 1 (2023): 264–308. http://dx.doi.org/10.46586/tches.v2024.i1.264-308.

Full text

Abstract:

This paper presents a provably secure, higher-order, and leakage-resilient (LR) rekeying scheme named LR Rekeying with Random oracle Repetition (LR4), along with a quantitative security evaluation methodology. Many existing LR primitives are based on a concept of leveled implementation, which still essentially require a leak-free sanctuary (i.e., differential power analysis (DPA)-resistant component(s)) for some parts. In addition, although several LR pseudorandom functions (PRFs) based on only bounded DPA-resistant components have been developed, their validity and effectiveness for rekeying

APA, Harvard, Vancouver, ISO, and other styles

11

Mandal, Banashree, Deepanwita Das, and Niladri Mandal. "Obstacle Prone Area Coverage by Swarm of Mobile Robots with Limited Visibility." Defence Science Journal 75, no. 4 (2025): 411–17. https://doi.org/10.14429/dsj.20508.

Full text

Abstract:

This paper studies a distributed coverage algorithm of a bounded rectangular region in the presence of horizontal line obstacles by an autonomous swarm of asynchronous mobile robots. They follow the basic Look-Compute-Move model, formally known as the CORDA model. The robot has no prior knowledge about the internal environment of the target region, especially the number and location of the robots, as well as obstacles. Robots are assumed to be anonymous, small, identical, simple, oblivious, inexpensive, and non-communicating in nature. The robots have a limited range of visibility. The robots

APA, Harvard, Vancouver, ISO, and other styles

12

Hellman, Ziv, and Ron Peretz. "A Survey on Entropy and Economic Behaviour." Entropy 22, no. 2 (2020): 157. http://dx.doi.org/10.3390/e22020157.

Full text

Abstract:

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

APA, Harvard, Vancouver, ISO, and other styles

13

Donovan, Brian F., Taylor L. Gray, Adam A. Wilson, and Ronald J. Warzoha. "Unwrapping a full temporal cycle in time domain thermoreflectance for enhanced measurement sensitivity in thermally insulating materials." Review of Scientific Instruments 93, no. 8 (2022): 084904. http://dx.doi.org/10.1063/5.0089075.

Full text

Abstract:

Time delayed pump–probe measurement techniques, such as Time Domain Thermoreflectance (TDTR), have opened up a wealth of opportunities for metrology at ultra-fast timescales and nanometer length scales. For nanoscale thermal transport measurements, typical thermal lifetimes used to measure thermal conductivity and thermal boundary conductance span from sub-picosecond to [Formula: see text] nanoseconds. In this work, we demonstrate a simple rearrangement and validation of a configuration that allows access to the entire 12.5 ns time delay available in the standard pulse train. By reconfiguring

APA, Harvard, Vancouver, ISO, and other styles

14

Lutikov, Alexander, Irina Gabsatarova, and Galina Dontsova. "On the stability of the seismic mode parameters in time by the example of the east of the central part of Northern Caucasus." Russian Journal of Seismology 3, no. 3 (2021): 61–74. http://dx.doi.org/10.35540/2686-7907.2021.3.04.

Full text

Abstract:

The parameters of the seismic regime of the eastern zone of the Central Caucasus are deter-mined based on the new catalog data. A similar study is being carried out for the third time: in 1996, 2015 and 2021. The basis for work in the area surrounding Grozny was laid in 1996 by a comprehensive study of geological, geomorphological, geophysical and seismological ma-terials. When comparing the results, the stability of the seismic regime parameters was estab-lished: the repetition schedule b and seismic activity A3.3 near Grozny, the capital of the Che-chen Republic and a large industrial center

APA, Harvard, Vancouver, ISO, and other styles

15

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

Full text

Abstract:

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 l

APA, Harvard, Vancouver, ISO, and other styles

16

Pisarenko, V. F., A. A. Skorkina, and T. A. Rukavishnikova. "Application of New Statistical Methods to Estimation of the Seismicity Field Parameters by an Example of the Japan Region." Физика земли 2023, no. 6 (2023): 163–74. http://dx.doi.org/10.31857/s0002333723060169.

Full text

Abstract:

Abstract—This study is devoted to application of some new statistical methods to analysis of the spatial struc-ture of the seismic field in the seismically active region in the Japan region bounded by the following coordinates: 28°–50° north latitude, 130°–150° east longitude. The estimates of the seismic flux by using the k nearest neighbors method for the magnitude interval m ≥ 5.2. The highest values of intensity of about 10–4 \(\frac{1}{{{\text{year}}{\kern 1pt} - {\kern 1pt} {\text{k}}{{{\text{m}}}^{{\text{2}}}}}}\) are located at depths of down to 100 km and manifest themselves in the ne

APA, Harvard, Vancouver, ISO, and other styles

17

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

Full text

Abstract:

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 c

APA, Harvard, Vancouver, ISO, and other styles

18

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

Full text

Abstract:

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 b

APA, Harvard, Vancouver, ISO, and other styles

19

Cruz, Filipe D., Derek B. Schaeffer, Fábio Cruz, and Luis O. Silva. "Laser-driven, ion-scale magnetospheres in laboratory plasmas. II. Particle-in-cell simulations." Physics of Plasmas 29, no. 3 (2022): 032902. http://dx.doi.org/10.1063/5.0084354.

Full text

Abstract:

Ion-scale magnetospheres have been observed around comets, weakly magnetized asteroids, and localized regions on the Moon and provide a unique environment to study kinetic-scale plasma physics, in particular in the collision-less regime. In this work, we present the results of particle-in-cell simulations that replicate recent experiments on the large plasma device at the University of California, Los Angeles. Using high-repetition rate lasers, ion-scale magnetospheres were created to drive a plasma flow into a dipolar magnetic field embedded in a uniform background magnetic field. The simulat

APA, Harvard, Vancouver, ISO, and other styles

20

Briet, Jop, Harry Buhrman, Troy Lee, and Thomas Vidick. "Multipartite entanglement in XOR games." Quantum Information and Computation 13, no. 3&4 (2013): 334–60. http://dx.doi.org/10.26421/qic13.3-4-11.

Full text

Abstract:

We study multipartite entanglement in the context of XOR games. In particular, we study the ratio of the entangled and classical \emph{biases}, which measure the maximum advantage of a quantum or classical strategy over a uniformly random strategy. For the case of two-player XOR games, Tsirelson proved that this ratio is upper bounded by the celebrated Grothendieck constant. In contrast, \PG proved the existence of entangled states that give quantum players an unbounded advantage over classical players in a three-player XOR game. We show that the multipartite entangled states that are most oft

APA, Harvard, Vancouver, ISO, and other styles

21

Cockett, J. Robin B., Jalel Zrida, and J. Douglas Birdwell. "Stochastic Decision Theory." Probability in the Engineering and Informational Sciences 3, no. 1 (1989): 13–54. http://dx.doi.org/10.1017/s0269964800000966.

Full text

Abstract:

The manipulations and basic results of stochastic decision theory are introduced. The manipulations of idempotence, transposition, and repetition, introduced for deterministic decision trees, can be used to manipulate stochastic trees. However, there are two major differences. First, in order to obtain a complete set of manipulations it is necessary to introduce an additional rule called indifference. Second, these identities must be treated as rules of inference. Not all the rules can be soundly applied in both directions; in particular, idempotence is a one-way rule.A manipulation of a stoch

APA, Harvard, Vancouver, ISO, and other styles

22

Happel, Dieter, Bernhard Keller, and Idun Reiten. "Bounded derived categories and repetitive algebras." Journal of Algebra 319, no. 4 (2008): 1611–35. http://dx.doi.org/10.1016/j.jalgebra.2007.10.001.

Full text

APA, Harvard, Vancouver, ISO, and other styles

23

Getachew, Getu, Tariku Yinebeb, and Emyayu Yosef. "Computer Vision Based Authentication and Employee Monitoring System." International Journal of Innovative Science and Research Technology 7, no. 7 (2022): 827–75. https://doi.org/10.5281/zenodo.6969508.

Full text

Abstract:

Computer vision is a recently active topic which is based on image processing. Computer vision used in variety of topics from a simple feature detection up to a sophisticated system those need animage as in modern robots. In this project, we are going to use computer vision to make an authentication system for employee of a company to have an access to the campus or for specific resource like entering to a datacenter. By using the art-of-state of CV, we develop the system which screen users by using their face which is more secured and have no doubt of repetition since facial features are uniq

APA, Harvard, Vancouver, ISO, and other styles

24

Černý, Anton. "On a class of infinite words with bounded repetitions." RAIRO. Informatique théorique 19, no. 4 (1985): 337–49. http://dx.doi.org/10.1051/ita/1985190403371.

Full text

APA, Harvard, Vancouver, ISO, and other styles

25

Mueller, W., J. A. Donaldson, D. Dufresne, and M. Rocheleau. "The Duparquet Formation: sedimentation in a late Archean successor basin, Abitibi greenstone belt, Quebec, Canada." Canadian Journal of Earth Sciences 28, no. 9 (1991): 1394–406. http://dx.doi.org/10.1139/e91-123.

Full text

Abstract:

In the south-central part of the Abitibi greenstone belt, a succession of Archean epiclastic sediments at least 2 km thick was deposited in the Duparquet Basin. The Destor–Porcupine fault and a secondary fault that splays off the major fault define the margins of this basin, which is at least 15 km long and up to 2.5 km wide. Sedimentary evidence of tectonic influence includes (i) rapid vertical and lateral facies changes over tens of metres; (ii) cyclic repetition of facies associations; (iii) mixed fining-upward – coarsening-upward – fining-upward sequences in conglomerate units; (iv) local

APA, Harvard, Vancouver, ISO, and other styles

26

Frettlöh, Dirk, Alexey Garber, and Lorenzo Sadun. "Number of bounded distance equivalence classes in hulls of repetitive Delone sets." Discrete & Continuous Dynamical Systems 42, no. 3 (2022): 1403. http://dx.doi.org/10.3934/dcds.2021157.

Full text

Abstract:

<p style='text-indent:20px;'>Two Delone sets are bounded distance equivalent to each other if there is a bijection between them such that the distance of corresponding points is uniformly bounded. Bounded distance equivalence is an equivalence relation. We show that the hull of a repetitive Delone set with finite local complexity has either one equivalence class or uncountably many.</p>

APA, Harvard, Vancouver, ISO, and other styles

27

Wehner, Stephan. "On recursive enumerability with finite repetitions." Journal of Symbolic Logic 64, no. 3 (1999): 927–45. http://dx.doi.org/10.2307/2586612.

Full text

Abstract:

AbstractIt is an open problem within the study of recursively enumerable classes of recursively enumerable sets to characterize those recursively enumerable classes which can be recursively enumerated without repetitions. This paper is concerned with a weaker property of r.e. classes, namely that of being recursively enumerable with at most finite repetitions.This property is shown to behave more naturally: First we prove an extension theorem for classes satisfying this property. Then the analogous theorem for the property of recursively enumerable classes of being recursively enumerable with

APA, Harvard, Vancouver, ISO, and other styles

28

Xu, Chengcheng, Kun Yu, Xinghua Xu, Xianqiang Bao, Songbing Wu, and Baokang Zhao. "Offset-FA: A Uniform Method to Handle Both Unbounded and Bounded Repetitions in Regular Expression Matching." Sensors 22, no. 20 (2022): 7781. http://dx.doi.org/10.3390/s22207781.

Full text

Abstract:

With the exponential growth of cyber–physical systems (CPSs), security challenges have emerged; attacks on critical infrastructure could result in catastrophic consequences. Intrusion detection is the foundation for CPS security protection, and deep-packet inspection is the primary method for signature-matched mechanisms. This method usually employs regular expression matching (REM) to detect possible threats in the packet payload. State explosion is the critical challenge for REM applications, which originates primarily from features of large character sets with unbounded (closures) or bounde

APA, Harvard, Vancouver, ISO, and other styles

29

ALISTE-PRIETO, JOSÉ, and DANIEL CORONEL. "Tower systems for linearly repetitive Delone sets." Ergodic Theory and Dynamical Systems 31, no. 6 (2010): 1595–618. http://dx.doi.org/10.1017/s0143385710000507.

Full text

Abstract:

AbstractIn this paper we study linearly repetitive Delone sets and prove, following the work of Bellissard, Benedetti and Gambaudo, that the hull of a linearly repetitive Delone set admits a properly nested sequence of box decompositions (tower system) with strictly positive and uniformly bounded (in size and norm) transition matrices. This generalizes a result of Durand for linearly recurrent symbolic systems. Furthermore, we apply this result to give a new proof of a classic estimation of Lagarias and Pleasants on the rate of convergence of patch frequencies.

APA, Harvard, Vancouver, ISO, and other styles

30

Shelenok, E. A. "REPETITIVE ADAPTIVE CONTROL OF NONLINEAR UNCERTAIN PLANT WITH INPUT SATURATION." Informatika i sistemy upravleniya, no. 4 (2021): 122–35. http://dx.doi.org/10.22250/isu.2021.70.122-135.

Full text

Abstract:

The article proposes solution to the problem of synthesizing adaptive control algorithm for dy-namic T-periodic nonlinear plant operating under conditions of structural and parametric uncer-tainty, in the presence of input restrictions and constant bounded disturbances. The hyperstabil-ity criterion, L-dissipativity conditions, fast-acting filter-correctors, and an implicit reference model are used as the methods for synthesis of repetitive adaptive control system.

APA, Harvard, Vancouver, ISO, and other styles

31

LAMBERTI, LISA. "REPETITIVE HIGHER CLUSTER CATEGORIES OF TYPE An." Journal of Algebra and Its Applications 13, no. 02 (2013): 1350091. http://dx.doi.org/10.1142/s0219498813500916.

Full text

Abstract:

We show that the repetitive higher cluster category of type An, defined as the orbit category [Formula: see text], is equivalent to a category defined on a subset of diagonals in a regular polygon. This generalizes the construction of Caldero–Chapoton–Schiffler [Quivers with relations arising from clusters (An case), Trans. Amer. Math. Soc.358(3) (2006) 1347–1364], which we recover when p = m = 1, and the work of Baur–Marsh, [A geometric description of the m-cluster categories, Trans. Amer. Math. Soc.360(11) (2008) 5789–5803], treating the case p = 1, m > 1. Our approach also leads to a geo

APA, Harvard, Vancouver, ISO, and other styles

32

Wang, Ying-Chung, Chiang-Ju Chien, and Chi-Nan Chuang. "ADAPTIVE ITERATIVE LEARNING CONTROL OF ROBOTIC SYSTEMS USING BACKSTEPPING DESIGN." Transactions of the Canadian Society for Mechanical Engineering 37, no. 3 (2013): 591–601. http://dx.doi.org/10.1139/tcsme-2013-0047.

Full text

Abstract:

In this paper, a backstepping adaptive iterative learning control (AILC) is proposed for robotic systems with repetitive tasks. The AILC is designed to approximate unknown certainty equivalent controller. Finally, we apply a Lyapunov like analysis to show that all adjustable parameters and the internal signals remain bounded for all iterations.

APA, Harvard, Vancouver, ISO, and other styles

33

Grobler, Trienko, Manfred Habeck, Zijl Lynette van, and Jaco Geldenhuys. "Search Algorithms for the Combinatorial Generation of Bordered Box Repetition-Free Words." JUCS - Journal of Universal Computer Science 29, no. (2) (2023): 100–117. https://doi.org/10.3897/jucs.87330.

Full text

Abstract:

A bordered box repetition-free word is a finite word w where any given factor of the form <em>asa</em>, with <em>a</em> ∈ Σ and <em>s</em> ∈ Σ<sup>&lowast;</sup>, occurs at most once. Four existing search algorithms are adapted to search for long bordered box repetition-free words over a given alphabet, giving an empirical result on the upper bound of the length of these words. Two algorithms use a tree-based search space, whilst the other two use a graph-based search space. For larger alphabets, the search space rapidly becomes intractable for the tree-based algorithms.

APA, Harvard, Vancouver, ISO, and other styles

34

Pogorzały, Zygmunt. "On locally bounded categories stably equivalent to the repetitive algebras of tubular algebras." Colloquium Mathematicum 72, no. 1 (1997): 123–46. http://dx.doi.org/10.4064/cm-72-1-123-146.

Full text

APA, Harvard, Vancouver, ISO, and other styles

35

Wang, Ying Chung, Chiang Ju Chien, and Chi Nan Chuang. "Backstepping Adaptive Iterative Learning Control for Robotic Systems." Applied Mechanics and Materials 284-287 (January 2013): 1759–63. http://dx.doi.org/10.4028/www.scientific.net/amm.284-287.1759.

Full text

Abstract:

A backstepping adaptive iterative learning control for robotic systems with repetitive tasks is proposed in this paper. The backstepping-like procedure is introduced to design the AILC. A fuzzy neural network is applied for compensation of the unknown certainty equivalent controller. Using a Lyapunov like analysis, we show that the adjustable parameters and internal signals remain bounded, the tracking error will asymptotically converge to zero as iteration goes to infinity.

APA, Harvard, Vancouver, ISO, and other styles

36

Wang, Lei, Mu Li, and Huizhong Yang. "Robust PD-Type Iterative Learning Control of Discrete Linear Repetitive Processes in the Finite Frequency Domain." Mathematics 8, no. 6 (2020): 1004. http://dx.doi.org/10.3390/math8061004.

Full text

Abstract:

This paper studies a robust iterative learning control design for discrete linear repetitive processes in the finite frequency domain. Firstly, the state-space model of the iterative learning process is deduced. Then the dynamic performance condition of the control system in the finite frequency domain is derived by combining it with the stability theory of discrete linear repetitive processes. The system performances in the finite frequency domain are then transformed into the corresponding solutions of the linear matrix inequality by using the generalised KYP lemma. Finally, an integrated st

APA, Harvard, Vancouver, ISO, and other styles

37

Chen, Wentao, Yechun Lin, and Qingping Wu. "State Feedback Guaranteed Cost Repetitive Control for Uncertain Discrete-Time Systems." Mathematical Problems in Engineering 2011 (2011): 1–16. http://dx.doi.org/10.1155/2011/904914.

Full text

Abstract:

This paper considers the problem of guaranteed cost repetitive control for uncertain discrete-time systems. The uncertainty in the system is assumed to be norm-bounded and time-varying. The objective is to develop a novel design method so that the closed-loop repetitive control system is quadratically stable and a certain bound of performance index is guaranteed for all admissible uncertainties. The state feedback control technique is used in the paper. While for the case that the states are not measurable, an observer-based control scheme is adopted. Sufficient conditions for the existence of

APA, Harvard, Vancouver, ISO, and other styles

38

Neumann, Peter M., and Cheryl E. Praeger. "On Tensor-Factorisation Problems,I: The Combinatorial Problem." LMS Journal of Computation and Mathematics 7 (2004): 73–100. http://dx.doi.org/10.1112/s1461157000001054.

Full text

Abstract:

AbstractA k-multiset is an unordered k-tuple, perhaps with repetitions. If x is an r-multiset {x1, …, xr} and y is an s-multiset {y1, …, ys} with elements from an abelian group A the tensor product x ⊗ y is defined as the rs-multiset {xi yj | 1 ≤ i ≤ r, 1 ≤ j ≤ s}. The main focus of this paper is a polynomial-time algorithm to discover whether a given rs-multiset from A can be factorised. The algorithm is not guaranteed to succeed, but there is an acceptably small upper bound for the probability of failure. The paper also contains a description of the context of this factorisation problem, and

APA, Harvard, Vancouver, ISO, and other styles

39

Rattew, Arthur G., Yue Sun, Pierre Minssen, and Marco Pistoia. "The Efficient Preparation of Normal Distributions in Quantum Registers." Quantum 5 (December 23, 2021): 609. http://dx.doi.org/10.22331/q-2021-12-23-609.

Full text

Abstract:

The efficient preparation of input distributions is an important problem in obtaining quantum advantage in a wide range of domains. We propose a novel quantum algorithm for the efficient preparation of arbitrary normal distributions in quantum registers. To the best of our knowledge, our work is the first to leverage the power of Mid-Circuit Measurement and Reuse (MCMR), in a way that is broadly applicable to a range of state-preparation problems. Specifically, our algorithm employs a repeat-until-success scheme, and only requires a constant-bounded number of repetitions in expectation. In the

APA, Harvard, Vancouver, ISO, and other styles

40

Aine, Sandip, Charupriya Sharma, and Maxim Likhachev. "Learning to Search More Efficiently from Experience: A Multi-heuristic Approach." Proceedings of the International Symposium on Combinatorial Search 6, no. 1 (2021): 141–45. http://dx.doi.org/10.1609/socs.v6i1.18376.

Full text

Abstract:

Learning from experience can significantly improve the performance of search based planners, especially for challenging problems like high-dimensional planning. Experience Graph (E-Graph) is a recently developed framework that encodes experiences, obtained from solving instances in the past, into a single bounded-admissible heuristic, and uses it to guide the search. While the E-Graph approach was shown to be very useful for repetitive problems, it suffers from two issues. First, computing the E-Graph heuristic is time consuming as it maintains the bounded admissibility constraints. Second, a

APA, Harvard, Vancouver, ISO, and other styles

41

Moore, J. B., R. Horowitz, and W. Messner. "Functional Persistence of Excitation and Observability for Learning Control Systems." Journal of Dynamic Systems, Measurement, and Control 114, no. 3 (1992): 500–507. http://dx.doi.org/10.1115/1.2897375.

Full text

Abstract:

Adaptive systems involving function learning can be formulated in terms of integral equations of the first kind, possibly with separable, finite-dimensional kernels. The learning process involves estimating the influence functions (Messner et al., 1989). To achieve convergence of the influence function estimates and exponentially stability, it is important to have persistence of excitation in the training tasks. This paper develops the concept of functional persistence of excitation (PE), and the associated concept of functional uniform complete observability (UCO). Relevant PE and UCO propert

APA, Harvard, Vancouver, ISO, and other styles

42

Kovačević, Mladen, and Vincent Y. F. Tan. "Asymptotically Optimal Codes Correcting Fixed-Length Duplication Errors in DNA Storage Systems." IEEE Communications Letters 22, no. 11 (2018): 2194–97. https://doi.org/10.1109/LCOMM.2018.2868666.

Full text

Abstract:

A (tandem) duplication of length k is an insertion of an exact copy of a substring of length k next to its original position. This and related types of impairments are of relevance in modeling communication in the presence of synchronization errors, as well as in several information storage applications. We demonstrate that Levenshtein's construction of binary codes correcting insertions of zeros is, with minor modifications, applicable also to channels with arbitrary alphabets and with duplication errors of arbitrary (but fixed) length k. Furthermore, we deri

APA, Harvard, Vancouver, ISO, and other styles

43

Shaoul, Yorai, Itamar Mishani, Maxim Likhachev, and Jiaoyang Li. "Accelerating Search-Based Planning for Multi-Robot Manipulation by Leveraging Online-Generated Experiences." Proceedings of the International Conference on Automated Planning and Scheduling 34 (May 30, 2024): 523–31. http://dx.doi.org/10.1609/icaps.v34i1.31513.

Full text

Abstract:

An exciting frontier in robotic manipulation is the use of multiple arms at once. However, planning concurrent motions is a challenging task using current methods. The high-dimensional composite state space renders many well-known motion planning algorithms intractable. Recently, Multi-Agent Path Finding (MAPF) algorithms have shown promise in discrete 2D domains, providing rigorous guarantees. However, widely used conflict-based methods in MAPF assume an efficient single-agent motion planner. This poses challenges in adapting them to manipulation cases where this assumption does not hold, due

APA, Harvard, Vancouver, ISO, and other styles

44

Chen, Chih-Cheng, Kelsen Serra, Albert C. Reynolds, and Rajagopal Raghavan. "Pressure Transient Analysis Methods for Bounded Naturally Fractured Reservoirs." Society of Petroleum Engineers Journal 25, no. 03 (1985): 451–64. http://dx.doi.org/10.2118/11243-pa.

Full text

Abstract:

Abstract New methods for analyzing drawdown and buildup pressure data obtained at a well located in an infinite, pressure data obtained at a well located in an infinite, naturally fractured reservoir were presented recently. In this work, the analysis of both drawdown and buildup data in a bounded, naturally fractured reservoir is considered. For the bounded case, we show that five possible flow regimes may be exhibited by drawdown data. We delineate the conditions under which each of these five flow regimes exists and the information that can be obtained from each possible combination of flow

APA, Harvard, Vancouver, ISO, and other styles

45

Agbor-Taku, Junior, Olivier Anoh Njoh, Nicoline Ngum Fon, and Moise Bessong. "Sedimentology, T-R sequence stratigraphy and geochemical characterization of sedimentary successions of the West and Central African Rift System, Koum Basin." Stratigraphy 20, no. 4 (2023): 303–33. http://dx.doi.org/10.29041/strat.20.4.03.

Full text

Abstract:

The Koum Basin (KB) is among the numerous relatively unexplored sedimentary basins lining theWCARS(West and Central African Rift System), hence limiting the understanding of how sedimentation evolved along the full extent of the WCARS. The intensification of petroleum exploration within WCARS has further emphasized the need to study these greenfields. This study contributes in solving the above issue by establishing a sequence stratigraphic framework and expanding the sedimentological databank of the KB. Systematic fieldmapping and lithofacies analyses of theKB along three NNW-SSE traverse lin

APA, Harvard, Vancouver, ISO, and other styles

46

Çubreli, Gramoz, Pavel Psota, Ahmad Kouta, and Petra Dančová. "Two-wavelength digital holographic interferometry for unambiguous range extended measurements in fluid mechanics." EPJ Web of Conferences 264 (2022): 01009. http://dx.doi.org/10.1051/epjconf/202226401009.

Full text

Abstract:

Non-contact optical methods such as digital holographic interferometry are highly suitable in measurements where the phenomena is fast, performed in transparent or semi-transparent environment and mustn’t be obstructed as when applying local contact techniques. Such specific application can be studying dynamic events during transonic and supersonic blade flutter. Fast, sensitive and rather easy access to the phase information make these techniques very attractive in the study of phase objects/phenomena. However, since light’s phase is bounded to a repetitive cycle of 2π radians, the range of m

APA, Harvard, Vancouver, ISO, and other styles

47

Cook, D. J., and L. B. Holder. "Substructure Discovery Using Minimum Description Length and Background Knowledge." Journal of Artificial Intelligence Research 1 (February 1, 1994): 231–55. http://dx.doi.org/10.1613/jair.43.

Full text

Abstract:

The ability to identify interesting and repetitive substructures is an essential component to discovering knowledge in structural data. We describe a new version of our SUBDUE substructure discovery system based on the minimum description length principle. The SUBDUE system discovers substructures that compress the original data and represent structural concepts in the data. By replacing previously-discovered substructures in the data, multiple passes of SUBDUE produce a hierarchical description of the structural regularities in the data. SUBDUE uses a computationally-bounded inexact graph mat

APA, Harvard, Vancouver, ISO, and other styles

48

Gurtuev, Alim, and Zaur Ivanov. "Comparison of different land distribution mechanisms for a land-hungry region." E3S Web of Conferences 164 (2020): 07017. http://dx.doi.org/10.1051/e3sconf/202016407017.

Full text

Abstract:

This paper proposes an approach to the development an efficient land distribution mechanism for a particular land-hungry region. We separate budgetary and allocative efficiency and use general utility approach during evaluation of particular distribution mechanisms. We propose a model of potential land users, which allows quantifying the efficiency of a number of mechanisms of land distribution for land-hungry regions. Land users are represented as economic agents with bounded rationality and subjective utility functions. The model calculates allocation efficiency and budgetary efficiency as i

APA, Harvard, Vancouver, ISO, and other styles

49

Pacheco-Valencia, Víctor, José Alberto Hernández, José María Sigarreta, and Nodari Vakhania. "Simple Constructive, Insertion, and Improvement Heuristics Based on the Girding Polygon for the Euclidean Traveling Salesman Problem." Algorithms 13, no. 1 (2019): 5. http://dx.doi.org/10.3390/a13010005.

Full text

Abstract:

The Traveling Salesman Problem (TSP) aims at finding the shortest trip for a salesman, who has to visit each of the locations from a given set exactly once, starting and ending at the same location. Here, we consider the Euclidean version of the problem, in which the locations are points in the two-dimensional Euclidean space and the distances are correspondingly Euclidean distances. We propose simple, fast, and easily implementable heuristics that work well, in practice, for large real-life problem instances. The algorithm works on three phases, the constructive, the insertion, and the improv

APA, Harvard, Vancouver, ISO, and other styles

50

Felber, F. S., F. J. Wessel, N. C. Wild, et al. "Gas–puff Z pinches with strong axial magnetic fields." Laser and Particle Beams 5, no. 4 (1987): 699–706. http://dx.doi.org/10.1017/s0263034600003219.

Full text

Abstract:

Ultrahigh axial magnetic fields have been compressed and measured in a gas-puff Z pinch. A 0·5-MA, 2–cm-radius annular gas-puff Z pinch with a 3-minute repetition rate was imploded radially onto an axial seed field, causing the field to compress. Axial magnetic field compressions up to 180 and peak magnetic fields up to 1·6 MG were measured. Faraday rotation of an argon laser (515·4 nm) in a quartz fiber on axis was the principal magnetic field diagnostic. Other diagnostics included a nitrogen laser interferometer, x-ray diodes, and magnetic field probes.The magnetic field compression results

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!