Search results for "Turing"

showing 10 items of 2644 documents

Compliance error compensation technique for parallel robots composed of non-perfect serial chains

2012

The paper presents the compliance errors compensation technique for over-constrained parallel manipulators under external and internal loadings. This technique is based on the non-linear stiffness modeling which is able to take into account the influence of non-perfect geometry of serial chains caused by manufacturing errors. Within the developed technique, the deviation compensation reduces to an adjustment of a target trajectory that is modified in the off-line mode. The advantages and practical significance of the proposed technique are illustrated by an example that deals with groove milling by the Orthoglide manipulator that considers different locations of the workpiece. It is also de…

FOS: Computer and information sciences0209 industrial biotechnologyEngineeringGeneral Mathematicsnonlinear stiffness modelingcompliance error compensation02 engineering and technologyIndustrial and Manufacturing EngineeringCompensation (engineering)Computer Science::RoboticsSuperposition principleComputer Science - Robotics020901 industrial engineering & automation0203 mechanical engineeringControl theorymedicine[INFO.INFO-RB]Computer Science [cs]/Robotics [cs.RO]ManipulatorGroove (engineering)business.industryMode (statistics)Parallel manipulatorStiffnessComputer Science Applications020303 mechanical engineering & transportsControl and Systems EngineeringTrajectoryParallel robotsmedicine.symptombusinessnon-perfect manipulatorsRobotics (cs.RO)Software
researchProduct

Scalability of using Restricted Boltzmann Machines for Combinatorial Optimization

2014

Abstract Estimation of Distribution Algorithms (EDAs) require flexible probability models that can be efficiently learned and sampled. Restricted Boltzmann Machines (RBMs) are generative neural networks with these desired properties. We integrate an RBM into an EDA and evaluate the performance of this system in solving combinatorial optimization problems with a single objective. We assess how the number of fitness evaluations and the CPU time scale with problem size and complexity. The results are compared to the Bayesian Optimization Algorithm (BOA), a state-of-the-art multivariate EDA, and the Dependency Tree Algorithm (DTA), which uses a simpler probability model requiring less computati…

FOS: Computer and information sciencesMathematical optimizationInformation Systems and ManagementOptimization problemGeneral Computer SciencePopulationComputer Science::Neural and Evolutionary Computation0211 other engineering and technologiesBoltzmann machine02 engineering and technologyManagement Science and Operations ResearchIndustrial and Manufacturing EngineeringEvolutionary computation0202 electrical engineering electronic engineering information engineeringNeural and Evolutionary Computing (cs.NE)educationMathematicseducation.field_of_study021103 operations researchArtificial neural networkI.2.6I.2.8Computer Science - Neural and Evolutionary ComputingEstimation of distribution algorithmModeling and SimulationScalabilityCombinatorial optimization020201 artificial intelligence & image processingI.2.6; I.2.8Algorithm
researchProduct

Quantum Computation With Devices Whose Contents Are Never Read

2010

In classical computation, a "write-only memory" (WOM) is little more than an oxymoron, and the addition of WOM to a (deterministic or probabilistic) classical computer brings no advantage. We prove that quantum computers that are augmented with WOM can solve problems that neither a classical computer with WOM nor a quantum computer without WOM can solve, when all other resource bounds are equal. We focus on realtime quantum finite automata, and examine the increase in their power effected by the addition of WOMs with different access modes and capacities. Some problems that are unsolvable by two-way probabilistic Turing machines using sublogarithmic amounts of read/write memory are shown to…

FOS: Computer and information sciencesQuantum sortQuantum PhysicsTheoretical computer scienceQuantum Turing machineComputer scienceFormal Languages and Automata Theory (cs.FL)ComputationQuantum simulatorFOS: Physical sciencesComputer Science - Formal Languages and Automata TheoryComputational Complexity (cs.CC)Computer Science - Computational ComplexityQuantum algorithmQuantum informationComputational problemQuantum Physics (quant-ph)Quantum computer
researchProduct

Estimation des performances, test et contrôle des systèmes cyber-physiques employant des réseaux de communication non idéaux

2020

Wireless technology is a key enabler of the promises of Industry 4.0 (Smart Manufacturing). As such, wireless technology will be adopted as a principal mode of communication within the factory beginning with the factory enterprise and eventually being adopted for use within the factory workcell. Factory workcell communication has particular requirements on latency, reliability, scale, and security that must first be met by the wireless communication technology used. Wireless is considered a non-ideal form of communication in that when compared to its wired counterparts, it is considered less reliable (lossy) and less secure. These possible impairments lead to delay and loss of data in indus…

Fabrication intelligenteIndustrial wireless testbed[INFO.INFO-TS] Computer Science [cs]/Signal and Image ProcessingSmart manufacturingApprentissage automatiqueSystems modelingGraph databaseBase de données graphe[INFO.INFO-TS]Computer Science [cs]/Signal and Image ProcessingMachine learningIndustrial wirelessModelisation systémeCommunications sans fil industrielBanc d'essai sans fil industriel
researchProduct

Untersuchungen zur Herstellung von ZSM-5-Schalen- und Vollkatalysatoren

1990

FabricationMaterials scienceGeneral Chemical EngineeringGeneral ChemistryZeoliteIndustrial and Manufacturing EngineeringCatalysisNuclear chemistryChemie Ingenieur Technik
researchProduct

Nonstoichiometric silica mask to fabricate reverse proton-exchange waveguides in lithium niobate crystals

2004

Producing channel waveguides requires a photolithographic mask, but the standard technique of using thermally evaporated metal films for proton exchange has proved to be unsuitable for withstanding the rather aggressive process of reverse proton exchange. We report the fabrication of a nonstoichiometric silica mask by ion-plating plasma-assisted deposition. This mask is strong enough to resist both direct and reverse proton exchange and is also compatible with anisotropic dry etching for patterning the mask and with electric field poling. Our technique is a practical alternative to the use of SiO2 sputtered masks.

FabricationMaterials sciencebusiness.industryMaterials Science (miscellaneous)PolingLithium niobateIndustrial and Manufacturing Engineeringlaw.inventionchemistry.chemical_compoundOpticsResistchemistryEtching (microfabrication)lawOptoelectronicsDry etchingBusiness and International ManagementThin filmPhotolithographybusiness
researchProduct

Nanomanufacturing/Nanotechnology

2008

This chapter provides comprehensive knowledge regarding the fabrication of nanoproducts and element of micro-electromechanical systems using various techniques and processes. Both well-established techniques, such as nanomachining (ultra-precision) and new trends in improving nanoprocesses taking into account AFM, laser beam machining, electron beam machining processes are overviewed. The background of nanomachining processes, including typical machining operations such as turning, milling and grinding and different construction materials (metallic and nonmetallic), is outlined. The physical mechanisms responsible for the transition from brittle to ductile regime machining are explained. Mo…

FabricationNanomanufacturingElectron beam machiningMachiningAtomic force microscopyComputer scienceSystem of measurementLaser beam machiningNanotechnologyGrinding
researchProduct

The General Routing Problem polyhedron: Facets from the RPP and GTSP polyhedra

1998

[EN] In this paper we study the polyhedron associated with the General Routing Problem (GRP). This problem, first introduced by Orloff in 1974, is a generalization of both the Rural Postman Problem (RPP) and the Graphical Traveling Salesman Problem (GTSP) and, thus, is NP -hard. We describe a formulation of the problem such that from every non-trivial facet-inducing inequality for the RPP and GTSP polyhedra, we obtain facet-inducing inequalities for the GRP polyhedron, We describe a new family of facet-inducing inequalities for the GRP, the honeycomb constraints, which seem to be very useful for solving GRP and RPP instances. Finally, new classes of facets obtained by composition of facet-i…

Facet (geometry)Information Systems and ManagementGeneral Computer ScienceGeneralizationHoneycomb (geometry)Facets of polyhedraGraph theoryManagement Science and Operations ResearchTravelling salesman problemIndustrial and Manufacturing EngineeringRural Postman ProblemGeneral Routing ProblemCombinatoricsPolyhedronModeling and SimulationGraphical Traveling Salesman ProblemCombinatorial optimizationMathematics::Metric GeometryRouting (electronic design automation)MATEMATICA APLICADAMathematicsRouting
researchProduct

An efficient algorithm for stopping on a sink in a directed graph

2013

Abstract Vertices of an unknown directed graph of order n are revealed one by one in some random permutation. At each point, we know the subgraph induced by the revealed vertices. Our goal is to stop on a sink, a vertex with no out-neighbors. We show that if a sink exists this can be achieved with probability Θ ( 1 / n ) , which is best possible.

Factor-critical graphDiscrete mathematicsApplied MathematicsNeighbourhood (graph theory)Directed graphManagement Science and Operations ResearchBiconnected graphIndustrial and Manufacturing EngineeringHypercube graphCombinatoricsWheel graphPath graphGraph factorizationSoftwareMathematicsofComputing_DISCRETEMATHEMATICSMathematicsOperations Research Letters
researchProduct

Theoretical and Experimental Studies on the Influence of Process Parameters on Strains and Forces of Single Point Incremental Forming

2014

These paper aims to determine the influence of the most important geometrical parameters (vertical step and punch diameter) on the main strains, thickness reduction and the forces along two directions during the single point incremental forming process (SPIF). The paper comprises a comparative numericalexperimental study, for a simple geometry part obtained by incremental forming. In fact, in the first stage, the punch has a vertical motion with the value of one vertical step. In the second stage, the punch follows a linear trajectory along one side of the die. After each linear trajectory the punch has successive vertical motions, taking one vertical step at a time until the entire geometr…

FactorialEngineeringbusiness.product_categoryComputer simulationbusiness.industryGeneral EngineeringProcess (computing)Forming processesGeometryStructural engineeringTrajectoryDie (manufacturing)Single pointReduction (mathematics)businessMathematicsofComputing_DISCRETEMATHEMATICSAdvanced Materials Research
researchProduct