Results 131 to 140 of about 3,746,779 (357)
On the Average Complexity of Moore's State Minimization Algorithm [PDF]
We prove that, for any arbitrary finite alphabet and for the uniform distribution over deterministic and accessible automata with n states, the average complexity of Moore's state minimization algorithm is in O(n log n). Moreover this bound is tight in the case of unary utomata.
arxiv
Scalable Fabrication of Height‐Variable Microstructures with a Revised Wetting Model
Height‐variable microstructures are fabricated using a scalable CO2 laser machining approach, enabling precise control of wettability through structural gradients. Classical wetting models fail to capture height‐induced effects, necessitating a revised theoretical framework.
Prabuddha De Saram+2 more
wiley +1 more source
27th International Symposium on Theoretical Aspects of Computer Science (STACS)
The Symposium on Theoretical Aspects of Computer Science (STACS) is held alter- nately in France and in Germany. The conference of March 4-6, 2010, held in Nancy, is the 27th in this series. Previous meetings took place in Paris (1984), Saarbrücken (1985), Orsay (1986), Passau (1987), Bordeaux (1988), Paderborn (1989), Rouen (1990), Hamburg (1991 ...
Marion, Jean-Yves, Schwentick, Thomas
openaire +2 more sources
The article deals with some aspects of the process of forming the future computer science bachelor's graphic competency at the stage of user's interface prototyping in the course of software development.
Kateryna P. Osadcha, Hanna Yu. Chemerys
doaj
Next generation smart system: 4-layer modern organization and activity theory for a new paradigm perspective [PDF]
This research article discusses a new paradigm in smart system development using the 4-layer framework and activity theory from the perspectives of ontology, epistemology, and axiology.
Ary Setijadi Prihatmanto+2 more
doaj +1 more source
Cache-Oblivious Implicit Predecessor Dictionaries with the Working Set Property [PDF]
In this paper we present an implicit dynamic dictionary with the working-set property, supporting insert(e) and delete(e) in O(log n) time, predecessor(e) in O(log l_{p(e)}) time, successor(e) in O(log l_{s(e)}) time and search(e) in O(log min(l_{p(e ...
Brodal, Gerth Stølting+1 more
core +5 more sources
This study investigates the complex mechanics of individual electrospun polycaprolactone fibers under small and large strains. Combining experiments with a visco‐hyperelastic damage model, this work reveals and quantifies these fibers’ nonlinear behavior, including strain‐stiffening, viscoelasticity, and damage.
Sascha L. Granhold+8 more
wiley +1 more source
In the article the author has researched some aspects of ideas concerning implementation of modern information technologies in the system of special education.
Tetyana M. Dehtyarenko
doaj
On the algebraic numbers computable by some generalized Ehrenfest urns [PDF]
This article deals with some stochastic population protocols, motivated by theoretical aspects of distributed computing. We modelize the problem by a large urn of black and white balls from which at every time unit a fixed number of balls are drawn and their colors are changed according to the number of black balls among them.
arxiv
Profilometry‐Based Indentation Plastometry Testing of Tungsten at High Temperature
Profilometry‐based indentation plastometry (PIP) allows extraction of stress‐strain curves from indent profiles. Tungsten is of industrial interest but is brittle at room temperature. It does plastically deform at higher temperatures. Excellent agreement is obtained between the two techniques in this regime, but PIP also gives plasticity ...
James Rees Miller+3 more
wiley +1 more source