programs for machines Research Articles (Page 3)

Abstract Although the nonlinear power form model structure is widely accepted by practitioners in the flood regionalization modelling, there is a lack of studies on whether there is a room for further improvement, and if the answer is yes, what should be done to explore alternative model structures. A framework is proposed in this study towards investigating this issue by the following steps: (i) a universal data‐driven model is utilized to see if there is a room for improvement compared with the conventional model, and (ii) if improvement is achieved, this means that there should exist more effective model structures than the current form. However, because the universal data‐driven models are usually opaque, more explicit model structures should be explored, which are convenient for practical usage. In this study, the proposed framework is applied in a case study using the catchment characteristics from the Flood Estimation Handbook in conjunction with the gamma test, support vector machine (SVM) and genetic programming (GP). First, the gamma test is used for the purpose of input variables selection where no model structure needs to be defined as a priori, and therefore, the result can be applied to any model structures for model building. Second, an SVM, which is a powerful data‐driven nonlinear model capable of modelling a variety of nonlinear systems, is applied to the index flood model for the first time. Once the best model is determined using those two data‐driven tools, GP is employed to find an alternative model structure. As the SVM is not formulated for producing explicit model functional form, the GP offers an advantage at this point where it can infer an explicit mathematical model functional form. Copyright © 2012 John Wiley & Sons, Ltd.

The research of using the 5-axis NC cutting machine and CAD-CAM program in the medical equipment development

A new driver behavior model to create realistic urban traffic environment

On the Complexity and Optimization of Branching Programs for Decision Diagram Machines

The existence of electrical energy to human needs can not be separated, electrical energy is used by all humans on this planet from small scale region (household) to large-scale region such as industr ies . T he electric energy quantity and quality demand of the electric ity transmission system has been increas ing over the time . Failure in the electricity transmission system can be fatal to the electrical components or operati onal loss in an industry. SCADA is proposed t o accommodate th ese problems . It capable s to monitor and control the disturbance on the electrical redundant system. The purpose of this final project is to simulate the SCADA on redundant power system to eliminate the failure of power transmission lines such as open-circuit failure , short circuit, and overload that can be controlled directly from the plant or through a computer interface. The Finite State Machine (FSM) and ladder diagram programming language are used to design the PLC system . There are hardware and software to support this final project , such as plant of redundant electrical systems, PLC CPM1A Omron, Laptop , CX One 9.0 software for programming the PLC and the CX Supervisor 3.0 to build the HMI. T he result showed that the current sensors can be used to detect overload failure and simulate short circuit failure . Plant redundant electrical system can be monitored and controlled through the input-output of the plant, the interface on the computer, and W orld Wide Web . T here is a relay on plant that can connect power lines to cutting power lines when the failure occurs. If an failure occurs in the form of open circuit, short circuit or overload the alarm and failure indicator will active. Keyword : SCADA, PLC, open circuit, short circuit, overload

The numerical controlling simulation of process indicates a mapping of NC machine tool in the virtual environment, and it includes the technique of manufacture, the theories of NC machine tool, CAD, CAM, and the technique of modeling and simulating. The people can apperceive the virtual environment of 3D simulated model developed by computers, carry the NC process of parts in virtual condition before the true doing when we design or alter a project, inspect the exactitude and justification of NC program, evaluate and optimize the project of process. Thereby the intention, abridging the time of developing products, depressing the cost of manufacture, advancing the quality of products and the efficiency of Production, can be finally achieved. With the rapid development of NC technique and computer graphical technology and the extensive application of computer, NC simulation technology provide an effective tool in order to validate the NC machining program and forecast the machine process. The main purpose of this dissertation is to derive the mathematical model and to simulate the lathe tool cutter. In order to enhance the operating efficiency and the demonstration quality of the numerical control lathe simulation software, the analysis has compared a kind of shape about lathe tool cutter-- PARALLELOGRAM, has established the cutter forms, thus inferred the mathematical model of the numerical control lathe simulation on the lathe tool cutter. The cutter is display in the DELPHI software development platform based on the environments of GLSence using this derived mathematical model.

357: MRSA Contamination of Emergency Department Ultrasonography Probes

Motion profile smooth control is significant to reduce the obvious impact on machine tool in high speed and high accuracy CNC machining. However, the jerk is discontinuous and brings about flexible impact on machine tool in the linear Acceleration/Deceleration (ab. Acc/Dec), exponent Acc/Dec and S curve Acc/Dec approach. In the paper, the CNC machine tool dynamic model is built up to analyze the cause of machine impact, to describe the mathematics and physics meanings of jerk. Then a new Acc/Dec approach in which the jerk is continuous is put forward. And the motion profile smooth control algorithm based on continuous jerk is developed in details according to the permissible maximum acceleration, the permissible maximum jerk, the machining program segment displacement and the instruction feedrate. The motion profile smooth control algorithm can achieve continuous jerk, reduce impact on machine tool effectively, and be important to high speed and high accuracy CNC machining.

Fixtures are used to locate, hold and support workpieces in manufacturing operations such as machining, inspection, and assembly. Designing and fabricating fixtures can take up to 10-20% of the total cost of a manufacturing system. Fixture planning is a complex activity restricted by the extreme diversity of workpiece, product batch size, product geometry, part accessibility, and working force. Computer-Aided Fixture Planning (CAFP) has been used to improve the fixture design for over 20 years. CAFP contributes to the reduction of lead-time and human interaction in fixture planning. It helps verification of the fixture quality and integration of fixture design with CAD/CAM systems. This paper summarizes constraints of fixture planning and four phases of CAFP. Various approaches to CAFP are surveyed. Application systems of CAFP including some recent patents are reviewed. The paper concludes with the research trend of CAFP. The global competition and customer demand change lead to greater product variety, smaller product batch size, shorter production time and higher product quality. Industrial organizations have to pursue flexibility and automation in manufacturing systems to remain competitive and profitable. Flexible Manufacturing System (FMS) developed in the past decades is to meet such challenge. FMS usually consists of one or more CNC machines which are capable of machining a variety of workpieces. With the development of Computer- Aided Design and Computer-Aided Manufacturing (CAD/ CAM) technology, product design and machining program- ming have been greatly computerized. However, one of the difficulties in FMS is the fixture design for locating and securing a workpiece during manufacturing operations. Fixture planning is time-consuming as it is customized for workpieces. Computer-aided fixture planning (CAFP) aims to reduce the lead-time and human interaction in fixture planning. It can verify fixture quality to integrate fixture design with CAD/CAM systems by automating the reasoning process. The integration of CAFP with CAD/CAM has greatly reduced the production lead-time and cost for an overall optimal solution in product design and manufacturing (1). Fixtures are used to locate, hold and support workpieces in manufacturing operations such as machining, inspection, and assembly. Fixture design and manufacturing is costly due to the tight tolerance and restricted machining opera- tions. Designing and fabricating fixtures can take up to 10- 20% of the total cost of a manufacturing system. Dedicated fixtures are mostly applied in mass production to gain high efficiency. For smaller batch size, the fixture flexibility becomes more important than efficiency due to the workpiece variety and machining requirements. Flexible and

Least-squares iterations with penalty functions have been carried out on the fine structural Earth model CAL5, based on observations of eigenvibrations, surface waves and body waves. The penalty function formalism provides a more objective treatment for programming inversions. The value of cubic splines to control the smoothness of the variations is demonstrated. A revised set of observed torsional eigenfrequencies is used following a maximum entropy spectral estimation of the 1960 Trieste record by Bolt and R. Currie. On the assumption that the observations are independent and normally distributed, a simple procedure is derived to calculate the trade-off functions between spread and variance for density estimates. The present resolvability of density and the index of homogeneity at a number of levels of the Earth are then assessed. Iterate CAL5I1A is a plausible Earth model having an overall standard error of 1·83 s from 39 eigenvibration observations.

Evolutionary programming of CNC machines

Scala is a new programming language developed at EPFL and incorporating the most important concepts of object-oriented and functional languages. It aims at integrating well with the Java and .NET platforms: their respective libraries are accessible without glue code, and the compiler can produce programs for both virtual machines. This thesis focuses on the compilation of two important concepts of Scala : mixin inheritance and run time types. The compilation techniques are presented in the context of the Java virtual machine, but could be adapted easily to other similar environments. Mixin inheritance is a relatively recent form of inheritance, offering new capabilities compared to single inheritance, without the complexity of multiple inheritance. We propose two implementation techniques for mixin inheritance: code copying and delegation. The implementation used in the Scala compiler is then presented and justified. Run time types make it possible for a program to examine the type of its values during execution. This possibility is interesting in itself, offering new capabilities to the programmer. Furthermore, run time types are also required to implement other high level concepts, like pattern matching, type-safe serialisation and reflection. We propose an implementation technique based on the representation of types as values, and show how to use the run time types of the underlying virtual machine to implement those of Scala. The techniques presented in this thesis have been implemented in our Scala compiler, scalac. This enabled us to evaluate these techniques, in particular their impact on the performances of programs. This evaluation was performed on several real, non-trivial programs.

The gradual evolution of language features and approaches used for the programming of distributed memory machines underwent substantial advances in the 1990s. One of the most promising and widely praised approaches was based on data parallelism and resulted in High Performance Fortran. This paper reports on an experiment using that approach based on a commercial distributed memory machine, available compilers and simple test programs. The results are disappointing and not encouraging. The variety of components involved and the lack of detailed knowledge available for the compilers compound the difficulties of obtaining results and doing comparisons. The results show great variation and question the premise that communication is the decisive factor in performance determination. The results are also a contribution towards the difficult tasks of predicating performance on a distributed memory computer.

Although code transformations are routinely applied to improve the performance of programs for both scalar and parallel machines, the properties of code-improving transformations are not well understood. In this article we present a framework that enables the exploration, both analytically and experimentally, of properties of code-improving transformations. The major component of the framework is a specification language, Gospel, for expressing the conditions needed to safely apply a transformation and the actions required to change the code to implement the transformation. The framework includes a technique that facilitates an analytical investigation of code-improving transformations using the Gospel specifications. It also contains a tool, Genesis, that automatically produces a transformer that implements the transformations specified in Gospel. We demonstrate the usefulness of the framework by exploring the enabling and disabling properties of transformations. We first present analytical results on the enabling and disabling properties of a set of code transformations, including both traditional and parallelizing transformations, and then describe experimental results showing the types of transformations and the enabling and disabling interactions actually found in a set of programs.

Automation of forging processes is important for both safety and efficiency in today's advanced manufacturing operations. This work supports the development of an Intelligent Open Die Forging System which will integrate state-of-the-art modelling techniques, automatic die selection and sequencing, full system dynamic simulation, automatic machine programming and coordination, and sensor-based process control to enable the production of more general and complex workpiece geometries than are achievable using current forging methods. Effective automation of this open die forging system requires the coordination and control of the major system components: press, robot, and furnace. In particular, forces exerted on the robot through its manipulation of the workpiece during forging must be minimized to avoid damage to the manipulator mechanism. In this paper, the application of neural networks for compliance control of the forging robot to minimize these forces is investigated. Effectiveness of the neural network-based compliance control module is evaluated through a full dynamic system simulation, which will later form a central part of the complete Intelligent Forging System. Dynamic simulation of the robot is achieved using an efficient O(N) recursive algorithm, while material flow of the workpiece is modeled with a finite element approach. Simulation and timing results for the complete processing system for a specific open die forging example are presented.

Smiles: a fortran-77 program for sequential machine interpreted lineament extraction using digital images

The data alignment phase in compiling programs for distributed-memory machines

A rule-based system to generate NC programs from CAD exchange files

Abstract Despite the attractive features of data flow computers, skepticism exists concerning their efficiency in handling arrays (vectors) in high performance scientific computation. This paper argues that massive parallelism in vector computation can be exploited effectively utilizing data flow principles. The key is to organize the data flow machine program graph such that array operations can be fully pipelined. Unlike in conventional pipelined vector processors, there is no requirement that the activities belonging to the same vector operation be continuously processed by one or a group of physically tightly-coupled function units in the processor. The applicative nature of the data flow graph model allows flexible scheduling of the execution of enabled instructions in the pipeline data flow programs. Accordingly, program transformation can be performed on the basis of both the global and local data flow analysis to generate efficient pipelined data flow machine code. As a result of such fine-grain pa...

Recursive function theory studies functions that can be evaluated by an algorithm based on some computing model such as a Turing machine or computer program. These functions are called partial recursive (p.r.) and are defined on subsets of N, where N = {0, 1,... }, with values in N. (A good introduction to the theory may be found in [2].) This paper explains the Parameter Theorem, illustrates some unusual computer programs, and explains their connection to recursive function theory. Basing our computing model on a modern high level language, we can construct programs whose existence is known through more formal means. Our functions will operate on strings rather than numbers, however. There is no loss in generality since strings can be viewed as members of N, and vice-versa. From a practical aspect, this approach is somewhat more desirable since conventional programming languages often allow making use of long strings, but place more restrictive limits on the size of integers. We first pose a problem: Does there exist a program (written in some conventional programming language) which halts if and only if its input is identical to the program's text (i.e., source code)? For the remainder of this note X is the set of ASCII characters 'a,' 'b, +,' space, line feed, and so forth, needed to write programs in most programming languages. We denote by X * the set of all strings (finite sequences) over X. Let P1 be the set of all one variable partial recursive functions on X *. A function I belongs to P1 if and only if there is a subset of S of X* and some algorithm which computes 't by associating with each element of S a well-defined element of X *. Similarly, 't belongs to P2 if and only if there is a set S c X * X X *, and an algorithm for 't which associates with each element of S a well-defined element of X *. A partial recursive function I in P1 (or in P2) is recursive if the algorithm is defined on all of X * (or X * X X *). This is equivalent to saying that the algorithm which evaluates I always halts. Our computing model will be based on Adat; its high-level string-handling properties simplify later examples. For readability, however, we will express algorithms in a more familiar Pascal-like style. Readers familiar with either programming language should find forthcoming algorithms sufficiently clear. A formal presentation in Ada is given in the Appendix. A string of ASCII characters, such as in FIGURE 1, represents a function in our language which takes strings to strings. Of course, strings of ASCII characters such as The quick brown fox and %*!! represent nothing at all in our programming language. Let A1 be the set of all strings in X * representing functions in our language of one input STRING which outputs a STRING. Similarly let A2 be the set of all strings in