Design of Reconfigurable Machine Tools

2002 ◽  
Vol 124 (2) ◽  
pp. 480-483 ◽  
Author(s):  
Yong-Mo Moon , ◽  
Sridhar Kota,
Keyword(s):  
Machine Tools ◽  
Screw Theory ◽  
Building Blocks ◽  
Mathematical Framework ◽  
Functional Requirements ◽  
Matrix Representations ◽  
Graph Theoretic ◽  
Structural Configurations ◽  
Synthesis Methodology ◽  
The Given

In this paper, we present a systematic methodology for designing Reconfigurable Machine Tools (RMTs). The synthesis methodology takes as input a set of functional requirements—a set of process plans and generates a set of kinematically viable reconfigurable machine tools that meet the given design specifications. We present a mathematical framework for synthesis of machine tools using a library of building blocks. The framework is rooted in (a) graph theoretic methods of enumeration of alternate structural configurations and (b) screw theory that enables us to manipulate matrix representations of motions to identify appropriate kinematic building blocks.

Synthesis of Reconfigurable Machine Tools With Screw Theory

2000 ◽  
Author(s):  
Yong-Mo Moon ◽  
Sridhar Kota
Keyword(s):  
Machine Tool ◽  
Machine Tools ◽  
Screw Theory ◽  
Dynamic Stiffness ◽  
Building Blocks ◽  
Mathematical Framework ◽  
Functional Requirements ◽  
Structural Configurations ◽  
Synthesis Methodology ◽  
Reconfigurable Machine Tool

Abstract In this paper, we present a systematic methodology for designing Reconfigurable Machine Tools (RMTs). The synthesis methodology takes as input a set of functional requirements — a set of process plans and outputs a set of kinematically-viable reconfigurable machine tools that meet the given design specifications. We present a mathematical framework for synthesis of machine tools using a library of building blocks. The framework is rooted in (a) graph theoretic methods of enumeration of alternate structural configurations and (b) screw theory that enables us to manipulate matrix representations of motions to identify appropriate kinematic building blocks. The methodology described in this paper provides a mathematical framework to address dynamic stiffness, and accuracy prediction of the kinematically-viable designs that are generated by the synthesis procedure. This methodology has been implemented in a program, called PREMADE (PRogram for REconfigurable MAchine tool DEsign), and the results are validated against commercial machine tool designs.

Screw Theory Based Metrology for Design and Error Compensation of Machine Tools

2001 ◽  
Author(s):  
Sang-Ku Moon ◽  
Yong-Mo Moon ◽  
Sridhar Kota ◽  
Robert G. Landers
Keyword(s):  
Machine Tool ◽  
Error Compensation ◽  
Machine Tools ◽  
Reference Frames ◽  
Screw Theory ◽  
Mathematical Framework ◽  
Functional Representation ◽  
Local Reference ◽  
Filtering Technique ◽  
Five Axis

Abstract The paper presents a generalized mathematical framework for computation and compensation of tool tip errors in multi-axis machine tools using screw theory. In contrast to conventional Denavit–Hartenberg notation, Screw theory offers several advantages including: (i) modeling of complex machine tool configurations with rotational axes, (ii) tractability of error propagation which simplifies solution of inverse kinematics and subsequent error-compensation procedures, and (iii) functional representation of error screws in a global reference frame rather than cumbersome coordinate transformations of local reference frames. Kinestatic filtering technique [11,12] is adopted for evaluating the compensatability of errors and the Jacobian is used for error compensation. The methodology is illustrated using a five-axis machine tool with two rotational axes.

Screw Theory Based Methodology for the Deterministic Type Synthesis of Flexure Mechanisms

2011 ◽  
Vol 3 (3) ◽  
Author(s):  
Jingjun Yu ◽  
Shouzhong Li ◽  
Hai-jun Su ◽  
M. L. Culpepper
Keyword(s):  
System Theory ◽  
Screw Theory ◽  
Building Blocks ◽  
Mathematical Tool ◽  
Geometric Form ◽  
Type Synthesis ◽  
Mechanism Synthesis ◽  
Flexure Mechanism ◽  
Synthesis Methodology ◽  
Set Operation

Flexure mechanism synthesis, however, is still a comparably difficult task. This paper aims at exploring a simple but systematic type synthesis methodology for general flexure mechanisms. The applied mathematical tool is reciprocal screw system theory in geometric form, and the proposed approach is an improvement of freedom and constraint topology (FACT), which is based on the FACT approach, combining with other methods including equivalent compliance mapping, set operation on building blocks, etc. As a result, it enables the type synthesis of flexure mechanisms simple, complete, and effective. What is more significant is that the proposed approach makes the unified type synthesis of both constraint-based and kinematics-based flexure mechanisms available. That is also the new contribution to the flexure de-sign.

An Algorithm for the Enumeration of Serial and/or Parallel Combinations of Kinematic Building Blocks

2004 ◽  
Author(s):  
Hong-Sen Yan ◽  
Feng-Ming Ou ◽  
Ming-Feng Tang
Keyword(s):  
Graph Theory ◽  
Building Blocks ◽  
Power Source ◽  
Cam Follower ◽  
Tree Representations ◽  
The Given

An algorithm is presented, based on graph theory, for enumerating all feasible serial and/or parallel combined mechanisms from the given rotary or translational power source and specific kinematic building blocks. Through the labeled out-tree representations for the configurations of combined mechanisms, the enumeration procedure is developed by adapting the algorithm for the enumeration of trees. A rotary power source and four kinematic building blocks: a crank-rocker linkage, a rack-pinion, a double-slider mechanism, and a cam-follower mechanism, are chosen as the combination to illustrate the algorithm. And, two examples are provided to validate the algorithm.

scholarly journals Geometry of Multiprimary Display Colors II: Metameric Control Sets and Gamut Tiling Color Control Functions

2021 ◽  
Author(s):  
Carlos Rodriguez-Pardo ◽  
Gaurav Sharma
Keyword(s):  
Broad Class ◽  
Convex Polytope ◽  
Building Blocks ◽  
Complete Characterization ◽  
Mathematical Framework ◽  
Control Functions ◽  
Control Sets ◽  
Multiple Alternative ◽  
Color Control

<div>For multiprimary displays that have four or more primaries, a color may be reproduced using multiple alternative control vectors. We provide a complete characterization of the Metameric Control Set (MCS), i.e., the set of control vectors that reproduce a given color on the display. Specifically, we show that MCS is a convex polytope whose vertices are control vectors obtained from (parallelepiped) tilings of the gamut, i.e., the range of colors that the display can produce. The mathematical framework that we develop: (a) characterizes gamut tilings in terms of fundamental building blocks called facet spans, (b) establishes that the vertices of the MCS are fully characterized by the tilings of the gamut, and (c) introduces a methodology for the efficient enumeration of gamut tilings. The framework reveals the fundamental inter-relations between the geometry of the MCS and the geometry of the gamut developed in a companion Part I paper, and provides insight into alternative strategies for color control. Our characterization of tilings and the strategy for their enumeration also advance knowledge in geometry, providing new approaches and computational results for the enumeration of tilings for a broad class of zonotopes in R<sup>3</sup>.</div>

scholarly journals Graph Theoretic Techniques in the Analysis of Uniquely Localizable Sensor Networks

2009 ◽  
pp. 146-173 ◽  
Author(s):  
Bill Jackson ◽  
Tibor Jordán
Keyword(s):  
Graph Theory ◽  
Sensor Networks ◽  
Optimization Problems ◽  
Partial Information ◽  
Two Dimensions ◽  
Localization Problem ◽  
Graph Theoretic ◽  
Network Localization ◽  
Exact Location ◽  
The Given

In the network localization problem the goal is to determine the location of all nodes by using only partial information on the pairwise distances (and by computing the exact location of some nodes, called anchors). The network is said to be uniquely localizable if there is a unique set of locations consistent with the given data. Recent results from graph theory and combinatorial rigidity made it possible to characterize uniquely localizable networks in two dimensions. Based on these developments, extensions, related optimization problems, algorithms, and constructions also became tractable. This chapter gives a detailed survey of these new results from the graph theorist’s viewpoint.

scholarly journals Digitally Enabled Health Service for the Integrated Management of Hypertension: A Participatory User-Centred Design Process

2021 ◽  
Vol 18 (23) ◽  
pp. 12442
Author(s):  
Vincenzo De De Luca ◽  
Vanja Lazic ◽  
Strahil Birov ◽  
Klaus Piesche ◽  
Ozan Beyhan ◽  
...  
Keyword(s):  
Healthcare Professionals ◽  
Healthy Lifestyle ◽  
Integrated Management ◽  
Integrated Approach ◽  
Building Blocks ◽  
Process Models ◽  
Functional Requirements ◽  
Health Care Organisation ◽  
Care Organisation ◽  
It Systems

This article describes a user-centred approach taken by a group of five procurers to set specifications for the procurement of value-based research and development services for IT-supported integrated hypertension management. The approach considered the unmet needs of patients and health systems of the involved regions. The procurers established a framework for requirements and a solution design consisting of nine building blocks, divided into three domains: service delivery, devices and integration, and health care organisation. The approach included the development of questionnaires, capturing patients’ and professionals’ views on possible system functionalities, and a template collecting information about the organisation of healthcare, professionals involved and existing IT systems at the procurers’ premises. A total of 28 patients diagnosed with hypertension and 26 professionals were interviewed. The interviewees identified 98 functional requirements, grouped in the nine building blocks. A total of nine use cases and their corresponding process models were defined by the procurers’ working group. As result, a digitally enabled integrated approach to hypertension has been designed to allow citizens to learn how to prevent the development of hypertension and lead a healthy lifestyle, and to receive comprehensive, individualised treatment in close collaboration with healthcare professionals.

scholarly journals A weapon in the battle of definitions: a special rhetorical strategy in Hánfēizǐ

2014 ◽  
Vol 68 (4) ◽  
pp. 969-999
Author(s):  
Lukáš Zádrapa
Keyword(s):  
Textual Analysis ◽  
Building Blocks ◽  
Warring States Period ◽  
Rhetorical Strategy ◽  
Semantic Relationships ◽  
Lexical Semantic ◽  
Warring States ◽  
Structural Relationships ◽  
Textual Strategies ◽  
The Given

Abstract Regardless of the actual views on the art of embellished speech of the author(s) presented by the collection of essays known as Hánfēizǐ, the work is well known for its formal intricacy and refinement. The composition of several chapters appears unique against the background of other transmitted texts of the Warring States period, and the same is true of some textual strategies serving to convey the presented ideas with intensified rhetorical appeal. In this study, I aim to identify one of these strategies, showing, on the basis of thorough textual analysis, how the sections in which it is employed are structured and how the given devices contribute to the construction of meaning. Relevant parts of the chapters 45 (“Guǐshǐ” 詭使), 46 (“Liùfǎn” 六反) and 47 (“Bāshuō” 八說) are analyzed here both with regard to their formal features, such as various arrangements of basic building blocks or transformations of metalinguistic formulae, and to their semantics, including the systematic lexical-semantic relationships of synonymy and antonymy. It is argued that not only overt interventions by the author in favour of “correct” definitions of selected terms, but also the very inventory of the terms itself and their deeper structural relationships and tensions reveal much about the author's intentions and opinions.

Edge (m,k)-choosability of graphs

2021 ◽  
Author(s):  
P. Soorya ◽  
K. A. Germina
Keyword(s):  
Connected Graph ◽  
Matching Number ◽  
Graph Theoretic ◽  
Maximum Value ◽  
Choice Number ◽  
The Given ◽  
Simple Connected Graph

Let [Formula: see text] be a simple, connected graph of order [Formula: see text] and size [Formula: see text] Then, [Formula: see text] is said to be edge [Formula: see text]-choosable, if there exists a collection of subsets of the edge set, [Formula: see text] of cardinality [Formula: see text] such that [Formula: see text] whenever [Formula: see text] and [Formula: see text] are incident. This paper initiates a study on edge [Formula: see text]-choosability of certain fundamental classes of graphs and determines the maximum value of [Formula: see text] for which the given graph [Formula: see text] is edge [Formula: see text]-choosable. Also, in this paper, the relation between edge choice number and other graph theoretic parameters is discussed and we have given a conjecture on the relation between edge choice number and matching number of a graph.

New Developments in Quasigroup-Based Cryptography

2014 ◽  
pp. 286-317 ◽  
Author(s):  
Aleksandra Mileva
Keyword(s):  
Building Blocks ◽  
Block Ciphers ◽  
Public Key ◽  
Message Authentication ◽  
Authentication Codes ◽  
New Developments ◽  
Identification Schemes ◽  
Public Key Cryptosystems ◽  
Research Activities ◽  
The Given

This chapter offers an overview of new developments in quasigroup-based cryptography, especially of new defined quasigroup-based block ciphers and stream ciphers, hash functions and message authentication codes, PRNGs, public key cryptosystems, etc. Special attention is given to Multivariate Quadratic Quasigroups (MQQs) and MQQ public key schemes, because of their potential to become one of the most efficient pubic key algorithms today. There are also directions of using MQQs for building Zero knowledge ID-based identification schemes. Recent research activities show that some existing non-quasigroup block ciphers or their building blocks can be represented by quasigroup string transformations. There is a method for generating optimal 4x4 S-boxes by quasigroups of order 4, by which a more optimized hardware implementation of the given S-box can be obtained. Even some block ciphers' modes of operations can be represented by quasigroup string transformations, which leads to finding weaknesses in the interchanged use of these modes.

Sign in / Sign up

Export Citation Format

Share Document