Search results for "machine"
showing 10 items of 2592 documents
Improving operational performance in altered gravity
2022
Human motor adaptation is crucial to remain efficient when exposed to unfamiliar environments. In these contexts, the efficient strategies developed by the brain to optimise movement can prove deficient. Dexterous manual movement execution in space therefore require the learning of new coordinated motor actions. Traditionally, adaptation mechanisms are tested in laboratory using robotic devices that disturb the limb specifically involved in the task while the dynamics of the rest of the body remain unchanged. Although participants build a more accurate representation of the task over repetitions, these approaches are limiting as they do not reflect the ecological adjustment to globally modi…
Hybrid (diffractive-refractive) optical processor for space-variant color pattern recognition
2002
Space-variant optical processing constitutes an interesting approach in information processing techniques when the location of the reference object is of as much importance as its identification. Applications range from machine vision, optical logic, or neural network systems, to cryptography. First results of positional sensitivity were obtained in the past few years by Fresnel transform correlators with coherent light [1,2]. On the other hand, optical Fresnel cor-relators working under broadband point-source illumination allow us to exploit color information of input scenes and present a discrimination ability higher than its monochromatic counterparts. However, the use of the wavelength …
An Experimental Investigation of Residual Stresses in Hard Machining of AISI 52100 Steel
2011
In this paper an experimental investigation was conducted to determine the effects of the tool cutting-edge geometry, workpiece hardness, cutting speed, and microstructural changes (white and dark layers) on the residual stresses in dry orthogonal hard machining of AISI 52100 steel. X-ray diffraction technique was used to obtain in-depth residual stresses profiles in both axial and circumferential directions. The results show that tool geometry, workpiece hardness and cutting parameters significantly affect the surface residual stress, maximum compressive residual stress below the machined surface and its location. Moreover, microstructural analysis shows that thermally-induced phase transf…
The continuous cooling transformation (CCT) as a flexible tool to investigate polymer crystallization under processing conditions
2009
An experimental route for investigating polymer crystallization over a wide range of cooling rates (from 0.01 to 1000◦C/s) and pressures (from 0.1 to 40 MPa) is illustrated, using a method that recalls the approach adopted in metallurgy for studying structure development in metals. Two types of experimental setup were used, namely an apparatus for fast cooling of thin films (100–200 μm thick) at various cooling rates under atmospheric pressure and a device (based on a on-purpose modified injection molding machine) for quenching massive samples (about 1–2 cm3) under hydrostatic pressure fields. In both cases, ex situ characterization experiments were carried out to probe the resulting struct…
An efficient VM-based software protection
2011
This paper presents Truly-protect, a system, incorporating a virtual machine, that enables execution of encrypted programs. Our intention is to form a framework for a conditional access/digital rights management system.
Transition Function Complexity of Finite Automata
2011
State complexity of finite automata in some cases gives the same complexity value for automata which intuitively seem to have completely different complexities. In this paper we consider a new measure of descriptional complexity of finite automata -- BC-complexity. Comparison of it with the state complexity is carried out here as well as some interesting minimization properties are discussed. It is shown that minimization of the number of states can lead to a superpolynomial increase of BC-complexity.
Capabilities of Ultrametric Automata with One, Two, and Three States
2016
Ultrametric automata use p-adic numbers to describe the random branching of the process of computation. Previous research has shown that ultrametric automata can have a significant decrease in computing complexity. In this paper we consider the languages that can be recognized by one-way ultrametric automata with one, two, and three states. We also show an example of a promise problem that can be solved by ultrametric integral automaton with three states.
On the determinization of weighted finite automata
1998
We study determinization of weighted finite-state automata (WFAs), which has important applications in automatic speech recognition (ASR). We provide the first polynomial-time algorithm to test for the twins property, which determines if a WFA admits a deterministic equivalent. We also provide a rigorous analysis of a determinization algorithm of Mohri, with tight bounds for acyclic WFAs. Given that WFAs can expand exponentially when determinized, we explore why those used in ASR tend to shrink. The folklore explanation is that ASR WFAs have an acyclic, multi-partite structure. We show, however, that there exist such WFAs that always incur exponential expansion when determinized. We then in…
Simulation is decidable for one-counter nets
1998
We prove that the simulation preorder is decidable for the class of one-counter nets. A one-counter net consists of a finite-state machine operating on a variable (counter) which ranges over the natural numbers. Each transition can increase or decrease the value of the counter. A transition may not be performed if this implies that the value of the counter becomes negative. The class of one-counter nets is computationally equivalent to the class of Petri nets with one unbounded place, and to the class of pushdown automata where the stack alphabet is restricted to one symbol. To our knowledge, this is the first result in the literature which gives a positive answer to the decidability of sim…
Testing Grammars for Parsability
1990
In the preceding chapters we have studied in detail the major methods of deterministic context-free parsing: strong LL(k) parsing (Chapter 5), simple precedence parsing (Chapter 5), canonical LR(k) parsing, LALR(k) parsing, and SLR(k) parsing (Chapters 6 and 7), and canonical LL(k) parsing (Chapter 8). Each of these methods induces a class of grammars that are “parsable” using that method, that is, a class of grammars for which a deterministic parser employing that method can be constructed. For example, the LL(k) grammars constitute the class of grammars parsable by the LL(k) parsing method. By definition, a context-free grammar is an LL(k) grammar if and only if its canonical LL(k) parser…