Inicio  /  Applied Sciences  /  Vol: 11 Par: 3 (2021)  /  Artículo
ARTÍCULO
TITULO

Connectivity as a Design Feature for Industry 4.0 Production Equipment: Application for the Development of an In-Line Metrology System

Ana Pamela Castro-Martin    
Horacio Ahuett-Garza    
Darío Guamán-Lozada    
Maria F. Márquez-Alderete    
Pedro D. Urbina Coronado    
Pedro A. Orta Castañon    
Thomas R. Kurfess and Emilio González de Castilla    

Resumen

No disponible

 Artículos similares

       
 
Sven Kliesch, Josef Chalupper, Thomas Lenarz and Andreas Büchner    
Smartphones are increasingly being used to enable patients to play an active role in managing their own health through applications, also called apps. The latest generation of sound processors for cochlear implants offer Bluetooth connectivity that makes... ver más
Revista: Applied Sciences

 
Michal Wolanski    
In 2016, Carlos Moreno proposed the concept of ?15-minute cities? based on the principles of proximity, diversity, density, and ubiquity. In fact, he re-formulated (?re-invented?) some of the already existing planning principles, making them recognized a... ver más
Revista: Infrastructures

 
Minjae Ko, Changho Lee and Yongju Cho    
Recently, manufacturing companies have been improving quality and productivity, reducing costs, and producing customized products according to Industry 4.0. The global value chain (GVC) is also being reorganized and manufacturing companies are recovering... ver más
Revista: Applied Sciences

 
Zixuan Zhang, Bo Zhang and Yunlong Wu    
In the recent decade, many research efforts in robotic society have considered motion planning for maintaining connectivity in networked robotic system (NRS) by exploiting robotic autonomous mobility. On the other hand, cognitive radio (CR) in the commun... ver más
Revista: Applied Sciences

 
Fatemeh Keshavarz-Kohjerdi and Ruo-Wei Hung    
A graph is called Hamiltonian connected if it contains a Hamiltonian path between any two distinct vertices. In the past, we proved the Hamiltonian path and cycle problems for general supergrid graphs to be NP-complete. However, they are still open for s... ver más
Revista: Algorithms