Delayed motor production of open polygonal chains presented visually in static and dynamic modes: Comparison between 9- to 11-year-old children and adults

2015 ◽  
Vol 41 (2) ◽  
pp. 143-149
Author(s):  
A. A. Antonova ◽  
K. A. Absatova ◽  
A. A. Korneev ◽  
A. V. Kurgansky
Author(s):  
Sergey Bereg ◽  
Minghui Jiang ◽  
Wencheng Wang ◽  
Boting Yang ◽  
Binhai Zhu

2019 ◽  
Vol 469 (2) ◽  
pp. 537-548
Author(s):  
Shouliu Wei ◽  
Wai Chee Shiu
Keyword(s):  

IEEE Access ◽  
2020 ◽  
Vol 8 ◽  
pp. 36691-36701
Author(s):  
Saurabh Upadhyay ◽  
A. Pedro Aguiar
Keyword(s):  

1998 ◽  
Vol 120 (08) ◽  
pp. 74-75
Author(s):  
Michael Valenti

This article analyzes that the demand of compressed gas has increased manifold in automobile engineering. A manufacturer of gear motors retrofitted its system to provide a more reliable supply of air, which help reduce its energy bills by over $40,000 a year. When Bodine Electric Co. built a fractional horsepower gear-motor plant in Chicago 35 years ago, management intentionally overbuilt the compressed-air system to serve projected expansion. As it turned out, Bodine’s motor production never came near to stretching its compressed-air system’s capacity, largely because the company replaced its spray-paint delivery system with a powder coating technology. To ensure that compressed-air capacity was more in line with demand, assistance was sought in early 1996 from Chicago-based Commonwealth Edison (ComEd) in purchasing a new compressed-air system. In addition to the annual savings in electricity, the new compressors provide Bodine with a more reliable supply of compressed air. The system is completely backed up, so that even if one air compressor goes completely out of service, production will continue.


1993 ◽  
Vol 03 (04) ◽  
pp. 383-415 ◽  
Author(s):  
LEONIDAS J. GUIBAS ◽  
JOHN E. HERSHBERGER ◽  
JOSEPH S.B. MITCHELL ◽  
JACK SCOTT SNOEYINK

We study several variations on one basic approach to the task of simplifying a plane polygon or subdivision: Fatten the given object and construct an approximation inside the fattened region. We investigate fattening by convolving the segments or vertices with disks and attempt to approximate objects with the minimum number of line segments, or with near the minimum, by using efficient greedy algorithms. We give some variants that have linear or O(n log n) algorithms approximating polygonal chains of n segments. We also show that approximating subdivisions and approximating with chains with. no self-intersections are NP-hard.


1995 ◽  
Vol 13 (1) ◽  
pp. 123-140 ◽  
Author(s):  
W. J. Lenhart ◽  
S. H. Whitesides
Keyword(s):  

2001 ◽  
Vol 26 (3) ◽  
pp. 269-281 ◽  
Author(s):  
T. Biedl ◽  
E. Demaine ◽  
M. Demaine ◽  
S. Lazard ◽  
A. Lubiw ◽  
...  

Sign in / Sign up

Export Citation Format

Share Document