WorldWideScience

Sample records for machine setup time

  1. Setup Time Reduction On Solder Paste Printing Machine – A Case Study

    Directory of Open Access Journals (Sweden)

    Rajesh Dhake

    2013-06-01

    Full Text Available Lean manufacturing envisages the reduction of the seven deadly wastes referred to as MUDA. Setup time forms a major component of the equipment downtime. It leads to lower machine utilization and restricts the output and product variety. This necessitates the requirement for quick setups. Single Minute Exchange of Die philosophy (a lean manufacturing tool here after referred as “SMED” is one of the important tool which aims at quick setups driving smaller lot sizes, lower production costs, improve productivity in terms of increased output, increased utilization of machine and labor hours, make additional capacity available (often at bottleneck resources, reduce scrap and rework, and increase flexibility[3]. This paper focuses on the application of Single Minute Exchange of Die[1] and Quick Changeover Philosophy[2] for reducing setup time on Solder Past Printing Machine (bottleneck machine in a electronic speedo-cluster manufacturing company. The four step SMED philosophy was adopted to effect reduction in setup time. The initial step was gathering information about the present setup times and its proportion to the total productive time. A detailed video based time study of setup activities was done to classify them into external and internal setup activities in terms of their need (i.e. preparation, replacement or adjustment, time taken and the way these could be reduced, simplified or eliminated. The improvements effected were of three categories viz., mechanical, procedural and organizational. The paper concludes by comparing the present and proposed (implemented methods of setup procedures.

  2. Single-machine scheduling with family setup times in a manufacturing system

    Science.gov (United States)

    Chen, Wen-Jinn

    2008-06-01

    This study considers a single-machine scheduling problem with sequence-dependent setup times. Specifically, this article discusses the problem with several families. In this research, the study assumes that the job being processed must be stopped if workers do not want to work at the weekend. This article calls the weekend period 'vacation'. Owing to complications in the production system, the setup time will be affected if the setup time is interrupted due to vacations. An efficient heuristic is developed to solve the problem of minimizing the maximum tardiness, subject to the family-setup time and vacation constraints. The article presents a heuristic to solve large-sized problems. A branch-and-bound algorithm that utilizes several theorems is also proposed to find the optimal schedules for the problem. Computational results are provided to demonstrate the effectiveness of the heuristic.

  3. List scheduling in a parallel machine environment with precedence constraints and setup times

    NARCIS (Netherlands)

    Hurink, J.L.; Knust, S.

    2000-01-01

    We present complexity results which have influence on the strength of list scheduling in a parallel machine environment where additionally precedence constraints and sequence-dependent setup times are given and the makespan has to be minimized. We show that contrary to various other scheduling probl

  4. List scheduling in a parallel machine environment with precedence constraints and setup times

    NARCIS (Netherlands)

    Hurink, Johann; Knust, Sigrid

    2001-01-01

    We present complexity results which have influence on the strength of list scheduling in a parallel machine environment where additionally precedence constraints and sequence-dependent setup times are given and the makespan has to be minimized. We show that contrary to various other scheduling probl

  5. An Improved Ant Colony Algorithm for a Single-machine Scheduling Problem with Setup Times

    Institute of Scientific and Technical Information of China (English)

    YE Qiang; LIU Xinbao; LIU Lin; YANG Shanglin

    2006-01-01

    Motivated by industrial applications we study a single-machine scheduling problem in which all the jobs are mutually independent and available at time zero. The machine processes the jobs sequentially and it is not idle if there is any job to be processed. The operation of each job cannot be interrupted. The machine cannot process more than one job at a time. A setup time is needed if the machine switches from one type of job to another. The objective is to find an optimal schedule with the minimal total jobs' completion time. While the sum of jobs' processing time is always a constant, the objective is to minimize the sum of setup times. Ant colony optimization (ACO) is a meta-heuristic that has recently been applied to scheduling problem. In this paper we propose an improved ACO-Branching Ant Colony with Dynamic Perturbation (DPBAC) algorithm for the single-machine scheduling problem. DPBAC improves traditional ACO in following aspects: introducing Branching Method to choose starting points; improving state transition rules; introducing Mutation Method to shorten tours; improving pheromone updating rules and introducing Conditional Dynamic Perturbation Strategy. Computational results show that DPBAC algorithm is superior to the traditional ACO algorithm.

  6. A two-stage flow shop scheduling problem on a batching machine and a discrete machine with blocking and shared setup times

    NARCIS (Netherlands)

    H. Gong; L. Tang; C.W. Duin

    2010-01-01

    Motivated by applications in iron and steel industry, we consider a two-stage flow shop scheduling problem where the first machine is a batching machine subject to the blocking constraint and the second machine is a discrete machine with shared setup times. We show that the problem is strongly NP-ha

  7. A two-stage flow shop scheduling problem on a batching machine and a discrete machine with blocking and shared setup times

    NARCIS (Netherlands)

    Gong, H.; Tang, L.; Duin, C.W.

    2010-01-01

    Motivated by applications in iron and steel industry, we consider a two-stage flow shop scheduling problem where the first machine is a batching machine subject to the blocking constraint and the second machine is a discrete machine with shared setup times. We show that the problem is strongly

  8. Reduction in Setup Change Time of a Machine in a Bearing Manufacturing Plant Using SMED and ECRS

    Directory of Open Access Journals (Sweden)

    Gaurav J. Pawar, Nishant S. Sirdeshpande, Aniket B. Atram, Prachi R. Patil

    2014-05-01

    Full Text Available Single minute exchange of dies along with ECRS can be used efficiently to reduce setup time. The present paper provides an analysis of current changeover methods of bearing ring grinding machine in a manufacturing plant having line layout. The study gives methods for reducing setup time using above mentioned tools.

  9. setup times

    Directory of Open Access Journals (Sweden)

    Elesandro Antônio Baptista

    2012-01-01

    Full Text Available In previous work the authors proposed a model suitable for reducing the number of cutting tools required for machining in factory environments, where production lots consisting of a small number of pieces of different materials and geometries were optimized. The model, although yielding good results in simulations, lacked a practical application. The purpose of this paper is to analyze and provide any needed modifications of the optimization model and then validate the more recent one using data obtained from its practical implementation in the shop floor of an industry that operates using flexible machining practices. This implementation is important to allow the identification of other situations that were not perceived in simulation, such as the variation in cutting tool life. The results show that the model can be successfully applied to flexible manufacturing environments.

  10. Setup planning for machining

    CERN Document Server

    Hazarika, Manjuri

    2015-01-01

    Professionals as well as researchers can benefit from this comprehensive introduction into the topic of setup planning, which reflects the latest state of research and gives hands-on examples. Starting with a brief but thorough introduction, this book explains the significance of setup planning in process planning and includes a reflection on its external constraints. Step-by-step the different phases of setup planning are outlined and traditional as well as modern approaches, such as fuzzy logic based setup planning, on the solution of setup planning problems are presented. Three detailed examples of applications provide a clear and accessible insight into the up-to-date techniques and various approaches in setup planning.

  11. Scheduling a three-machine no-wait flowshop with separated setup time

    Institute of Scientific and Technical Information of China (English)

    CHANG Jun-lin; SHAO Hui-he

    2006-01-01

    In many practical flowshop production environments, there is no intermediate storage space available to keep partially completed jobs between any two machines. The workflow has to be continuous, implying that the no-wait conditions must be abided, which is typical in steel and plastic production. We discuss the threemachine no-wait flowshop scheduling problem where the setup times are considered as separated from processing times and sequence independent. The scheduling goal is to minimize the total flowtime. An optimal property and two heuristic algorithms for this problem are proposed. Evaluated over a large number of problems, the proposed heuristics are found that they can yield good solutions effectively with low computational complexity, and have more obvious advantage for the large size problem compared with the existing one.

  12. Robust Parallel Machine Scheduling Problem with Uncertainties and Sequence-Dependent Setup Time

    Directory of Open Access Journals (Sweden)

    Hongtao Hu

    2016-01-01

    Full Text Available A parallel machine scheduling problem in plastic production is studied in this paper. In this problem, the processing time and arrival time are uncertain but lie in their respective intervals. In addition, each job must be processed together with a mold while jobs which belong to one family can share the same mold. Therefore, time changing mold is required for two consecutive jobs that belong to different families, which is known as sequence-dependent setup time. This paper aims to identify a robust schedule by min–max regret criterion. It is proved that the scenario incurring maximal regret for each feasible solution lies in finite extreme scenarios. A mixed integer linear programming formulation and an exact algorithm are proposed to solve the problem. Moreover, a modified artificial bee colony algorithm is developed to solve large-scale problems. The performance of the presented algorithm is evaluated through extensive computational experiments and the results show that the proposed algorithm surpasses the exact method in terms of objective value and computational time.

  13. Makespan Minimization for The Identical Machine Parallel Shop with Sequence Dependent Setup Times Using a Genetic Algorithm

    Directory of Open Access Journals (Sweden)

    Salazar-Hornig E.

    2013-01-01

    Full Text Available A genetic algorithm for the parallel shop with identical machines scheduling problem with sequence dependent setup times and makespan (Cmáx minimization is presented. The genetic algorithm is compared with other heuristic methods using a randomly generated test problem set. A local improvement procedure in the evolutionary process of the genetic algorithm is introduced, which significantly improves its performance.

  14. AN IMPROVED BRANCH-AND-BOUND ALGORITHM TO MINIMIZE THE WEIGHTED FLOWTIME ON IDENTICAL PARALLEL MACHINES WITH FAMILY SETUP TIMES

    Institute of Scientific and Technical Information of China (English)

    Belgacem BETTAYEB; Imed KACEM; Kondo H.ADJALLAH

    2008-01-01

    This article investigates identical parallel machines scheduling with family setup times. Theobjective function being the weighted sum of completion times, the problem is known to be strongly NP-hard. We propose a constructive heuristic algorithm and three complementary lower bounds. Two of these bounds proceed by elimination of setup times or by distributing each of them to jobs of the corresponding family, while the third one is based on a lagrangian relaxation. The bounds and the heuristic are incorporated into a branch-and-bound algorithm. Experimental results obtained outperform those of the methods presented in previous works, in term of size of solved problems.

  15. Setup reduction approaches for machining

    Energy Technology Data Exchange (ETDEWEB)

    Gillespie, L.K.

    1997-04-01

    Rapid setup is a common improvement approach in press working operations such as blanking and shearing. It has paid major dividends in the sheet metal industry. It also has been a major improvement thrust for high-production machining operations. However, the literature does not well cover all the setup operations and constraints for job shop work. This review provides some insight into the issues involved. It highlights the floor problems and provides insights for further improvement. The report is designed to provide a quick understanding of the issues.

  16. A hybrid multi-objective evolutionary algorithm approach for handling sequence- and machine-dependent set-up times in unrelated parallel machine scheduling problem

    Indian Academy of Sciences (India)

    V K MANUPATI; G RAJYALAKSHMI; FELIX T S CHAN; J J THAKKAR

    2017-03-01

    This paper addresses a fuzzy mixed-integer non-linear programming (FMINLP) model by considering machine-dependent and job-sequence-dependent set-up times that minimize the total completion time,the number of tardy jobs, the total flow time and the machine load variation in the context of unrelated parallel machine scheduling (UPMS) problem. The above-mentioned multi-objectives were considered based on nonzero ready times, machine- and sequence-dependent set-up times and secondary resource constraints for jobs.The proposed approach considers unrelated parallel machines with inherent uncertainty in processing times and due dates. Since the problem is shown to be NP-hard in nature, it is a challenging task to find the optimal/nearoptimal solutions for conflicting objectives simultaneously in a reasonable time. Therefore, we introduced a new multi-objective-based evolutionary artificial immune non-dominated sorting genetic algorithm (AI-NSGA-II) to resolve the above-mentioned complex problem. The performance of the proposed multi-objective AI-NSGA-II algorithm has been compared to that of multi-objective particle swarm optimization (MOPSO) and conventionalnon-dominated sorting genetic algorithm (CNSGA-II), and it is found that the proposed multi-objective-based hybrid meta-heuristic produces high-quality solutions. Finally, the results obtained from benchmark instances and randomly generated instances as test problems evince the robust performance of the proposed multiobjective algorithm.

  17. Minimizing total weighted tardiness for the single machine scheduling problem with dependent setup time and precedence constraints

    Directory of Open Access Journals (Sweden)

    Hamidreza Haddad

    2012-04-01

    Full Text Available This paper tackles the single machine scheduling problem with dependent setup time and precedence constraints. The primary objective of this paper is minimization of total weighted tardiness. Since the complexity of the resulted problem is NP-hard we use metaheuristics method to solve the resulted model. The proposed model of this paper uses genetic algorithm to solve the problem in reasonable amount of time. Because of high sensitivity of GA to its initial values of parameters, a Taguchi approach is presented to calibrate its parameters. Computational experiments validate the effectiveness and capability of proposed method.

  18. ILS Heuristics for the Single-Machine Scheduling Problem with Sequence-Dependent Family Setup Times to Minimize Total Tardiness

    Directory of Open Access Journals (Sweden)

    Vinícius Vilar Jacob

    2016-01-01

    Full Text Available This paper addresses a single-machine scheduling problem with sequence-dependent family setup times. In this problem the jobs are classified into families according to their similarity characteristics. Setup times are required on each occasion when the machine switches from processing jobs in one family to jobs in another family. The performance measure to be minimized is the total tardiness with respect to the given due dates of the jobs. The problem is classified as NP-hard in the ordinary sense. Since the computational complexity associated with the mathematical formulation of the problem makes it difficult for optimization solvers to deal with large-sized instances in reasonable solution time, efficient heuristic algorithms are needed to obtain near-optimal solutions. In this work we propose three heuristics based on the Iterated Local Search (ILS metaheuristic. The first heuristic is a basic ILS, the second uses a dynamic perturbation size, and the third uses a Path Relinking (PR technique as an intensification strategy. We carry out comprehensive computational and statistical experiments in order to analyze the performance of the proposed heuristics. The computational experiments show that the ILS heuristics outperform a genetic algorithm proposed in the literature. The ILS heuristic with dynamic perturbation size and PR intensification has a superior performance compared to other heuristics.

  19. Parallel machine scheduling with step-deteriorating jobs and setup times by a hybrid discrete cuckoo search algorithm

    Science.gov (United States)

    Guo, Peng; Cheng, Wenming; Wang, Yi

    2015-11-01

    This article considers the parallel machine scheduling problem with step-deteriorating jobs and sequence-dependent setup times. The objective is to minimize the total tardiness by determining the allocation and sequence of jobs on identical parallel machines. In this problem, the processing time of each job is a step function dependent upon its starting time. An individual extended time is penalized when the starting time of a job is later than a specific deterioration date. The possibility of deterioration of a job makes the parallel machine scheduling problem more challenging than ordinary ones. A mixed integer programming model for the optimal solution is derived. Due to its NP-hard nature, a hybrid discrete cuckoo search algorithm is proposed to solve this problem. In order to generate a good initial swarm, a modified Biskup-Hermann-Gupta (BHG) heuristic called MBHG is incorporated into the population initialization. Several discrete operators are proposed in the random walk of Lévy flights and the crossover search. Moreover, a local search procedure based on variable neighbourhood descent is integrated into the algorithm as a hybrid strategy in order to improve the quality of elite solutions. Computational experiments are executed on two sets of randomly generated test instances. The results show that the proposed hybrid algorithm can yield better solutions in comparison with the commercial solver CPLEX® with a one hour time limit, the discrete cuckoo search algorithm and the existing variable neighbourhood search algorithm.

  20. Parallel machine scheduling with release dates, due dates and family setup times

    NARCIS (Netherlands)

    Schutten, J.M.J.; Leussink, R.A.M.

    1996-01-01

    In manufacturing, there is a fundamental conflict between efficient production and delivery performance. Maximizing machine utilization by batching similar jobs may lead to poor delivery performance. Minimizing customers' dissatisfaction may lead to an inefficient use of the machines. In this paper,

  1. Android Virtual Machine (VM) Setup on Linux

    Science.gov (United States)

    2014-12-01

    Machine (VM) Setup on Linux Ken F Yu Computational and Information Sciences Directorate, ARL...Virtual Machine (VM) Setup on Linux 5a. CONTRACT NUMBER 5b. GRANT NUMBER 5c. PROGRAM ELEMENT NUMBER 6. AUTHOR(S) Ken F Yu 5d. PROJECT NUMBER

  2. An iterated greedy algorithm for the single-machine total weighted tardiness problem with sequence-dependent setup times

    Science.gov (United States)

    Deng, Guanlong; Gu, Xingsheng

    2014-03-01

    This article presents an enhanced iterated greedy (EIG) algorithm that searches both insert and swap neighbourhoods for the single-machine total weighted tardiness problem with sequence-dependent setup times. Novel elimination rules and speed-ups are proposed for the swap move to make the employment of swap neighbourhood worthwhile due to its reduced computational expense. Moreover, a perturbation operator is newly designed as a substitute for the existing destruction and construction procedures to prevent the search from being attracted to local optima. To validate the proposed algorithm, computational experiments are conducted on a benchmark set from the literature. The results show that the EIG outperforms the existing state-of-the-art algorithms for the considered problem.

  3. Split scheduling with uniform setup times.

    NARCIS (Netherlands)

    F. Schalekamp; R.A. Sitters (René); S.L. van der Ster; L. Stougie (Leen); V. Verdugo; A. van Zuylen

    2015-01-01

    htmlabstractWe study a scheduling problem in which jobs may be split into parts, where the parts of a split job may be processed simultaneously on more than one machine. Each part of a job requires a setup time, however, on the machine where the job part is processed. During setup, a

  4. Simultaneous selection and scheduling with sequence-dependent setup times, lateness penalties, and machine availability constraint: Heuristic approaches

    Directory of Open Access Journals (Sweden)

    Mohammad Hossein Zarei

    2016-01-01

    Full Text Available Job selection and scheduling are among the most important decisions for production planning in today’s manufacturing systems. However, the studies that take into account both problems together are scarce. Given that such problems are strongly NP-hard, this paper presents an approach based on two heuristic algorithms for simultaneous job selection and scheduling. The objective is to select a subset of candidate jobs and schedule them in such a way that the total net profit is maximized. The cost components considered here include jobs' processing costs and weighted earliness/tardiness penalties. Two heuristic algorithms; namely scatter search (SS and simulated annealing (SA, were employed to solve the problem for single machine environments. The algorithms were applied to several examples of different sizes with sequence-dependent setup times. Computational results were compared in terms of quality of solutions and convergence speed. Both algorithms were found to be efficient in solving the problem. While SS could provide solutions with slightly higher quality for large size problems, SA could achieve solutions in a more reasonable computational time.

  5. total completion time with random and bounded setup times

    Directory of Open Access Journals (Sweden)

    Ali Allahverdi

    2003-01-01

    Full Text Available This paper addresses the two-machine flowshop scheduling problem with separate setup times to minimize makespan or total completion time (TCT. Setup times are relaxed to be random variables rather than deterministic as commonly used in the OR literature. Moreover, distribution-free setup times are used where only the lower and upper bounds are given. Global and local dominance relations are developed for the considered flowshops and an illustrative numerical example is given.

  6. Hybrid Pareto artificial bee colony algorithm for multi-objective single machine group scheduling problem with sequence-dependent setup times and learning effects.

    Science.gov (United States)

    Yue, Lei; Guan, Zailin; Saif, Ullah; Zhang, Fei; Wang, Hao

    2016-01-01

    Group scheduling is significant for efficient and cost effective production system. However, there exist setup times between the groups, which require to decrease it by sequencing groups in an efficient way. Current research is focused on a sequence dependent group scheduling problem with an aim to minimize the makespan in addition to minimize the total weighted tardiness simultaneously. In most of the production scheduling problems, the processing time of jobs is assumed as fixed. However, the actual processing time of jobs may be reduced due to "learning effect". The integration of sequence dependent group scheduling problem with learning effects has been rarely considered in literature. Therefore, current research considers a single machine group scheduling problem with sequence dependent setup times and learning effects simultaneously. A novel hybrid Pareto artificial bee colony algorithm (HPABC) with some steps of genetic algorithm is proposed for current problem to get Pareto solutions. Furthermore, five different sizes of test problems (small, small medium, medium, large medium, large) are tested using proposed HPABC. Taguchi method is used to tune the effective parameters of the proposed HPABC for each problem category. The performance of HPABC is compared with three famous multi objective optimization algorithms, improved strength Pareto evolutionary algorithm (SPEA2), non-dominated sorting genetic algorithm II (NSGAII) and particle swarm optimization algorithm (PSO). Results indicate that HPABC outperforms SPEA2, NSGAII and PSO and gives better Pareto optimal solutions in terms of diversity and quality for almost all the instances of the different sizes of problems.

  7. Setup Aid for Electrical-Discharge Machining

    Science.gov (United States)

    Lines, G.; Duca, J.

    1985-01-01

    Interlock assures that workpiece is correctly assembled in machining fixture. A Plunger in a Hollow Shaft actuates a switch, allowing a power supply to produce current for electrical-discharge machining. Plunger operates only when necessary parts are position.

  8. Minimization of number of setups for mounting machines

    Energy Technology Data Exchange (ETDEWEB)

    Kolman, Pavel; Nchor, Dennis; Hampel, David [Department of Statistics and Operation Analysis, Faculty of Business and Economics, Mendel University in Brno, Zemědělská 1, 603 00 Brno (Czech Republic); Žák, Jaroslav [Institute of Technology and Business, Okružní 517/10, 370 01 České Budejovice (Czech Republic)

    2015-03-10

    The article deals with the problem of minimizing the number of setups for mounting SMT machines. SMT is a device used to assemble components on printed circuit boards (PCB) during the manufacturing of electronics. Each type of PCB has a different set of components, which are obligatory. Components are placed in the SMT tray. The problem consists in the fact that the total number of components used for all products is greater than the size of the tray. Therefore, every change of manufactured product requires a complete change of components in the tray (i.e., a setup change). Currently, the number of setups corresponds to the number of printed circuit board type. Any production change affects the change of setup and stops production on one shift. Many components occur in more products therefore the question arose as to how to deploy the products into groups so as to minimize the number of setups. This would result in a huge increase in efficiency of production.

  9. Dominance rules for single machine schedule with sequence dependent setup and due date

    Institute of Scientific and Technical Information of China (English)

    Xiaochuan LUO; Xiao LIU; Chengen WANG; Zhen LIU

    2005-01-01

    Some dominance rules are proposed for the problems of scheduling N jobs on a single machine with due dates,sequence dependent setup times and no preemption. Two algorithms based on Ragatz's branch and bound scheme are developed including the dominance rules where the objective is to minimize the maximum tardiness or the total tardiness. Computational experiments demonstrate the effectiveness of the dominance rules.

  10. LOT SIZING WITH NON-ZERO SETUP TIMES FOR REWORK

    Institute of Scientific and Technical Information of China (English)

    Rasoul HAJI; Alireza HAJI; Mehdi SAJADIFAR; Saeed ZOLFAGHARI

    2008-01-01

    In this paper we consider a single machine multi-product lot scheduling problem in which defective items are produced in any production run of each product. In each cycle after the normal production of each product the machine is setup for the rework of the defectives of the same product and then the rework process starts. We assume that the setup time for the normal production process as well as the rework process is non-zero. Further we consider the waiting time cost of defectives for rework. This paper has two objectives. The first objective is to obtain the economic batch quantity (EBQ) for a single product. The second objective is to extend the result of the first objective to the multi-product case. Adopting the common cycle scheduling policy we obtain optimal batch sizes for each product such that the total cost of the system per unit time is minimized.

  11. An optimal setup planning selection approach in a complex product machining process

    Science.gov (United States)

    Zhu, Fang

    2011-10-01

    Setup planning has very important influence on the product quality in a Complex Product Machining Process (CPMP). Part production in a CPMP involves multiple setup plans, which will lead into variation propagation and lead to extreme complexity in final product quality. Current approaches of setup planning in a CPMP are experience-based that lead to adopt higher machining process cost to ensure the final product quality, and most approaches are used for a single machining process. This work attempts to solve those challenging problems and aims to develop a method to obtain an optimal setup planning in a CPMP, which can satisfies the quality specifications and minimizes the expected value of the sum of machining costs. To this end, a machining process model is established to describe the variation propagation effect of setup plan throughout all stages in a CPMP firstly and then a quantitative setup plan evaluation methods driven by cost constraint is proposed to clarify what is optimality of setup plans. Based on the above procedures, an optimal setup planning is obtained through a dynamic programming solver. At last, a case study is provided to illustrate the validity and the significance of the proposed setup planning selective method.

  12. Technology Time Machine 2012

    DEFF Research Database (Denmark)

    Lehner, Wolfgang; Fettweis, Gerhard; Fitzek, Frank

    2013-01-01

    The IEEE Technology Time Machine (TTM) is a unique event for industry leaders, academics, and decision making government officials who direct R&D activities, plan research programs or manage portfolios of research activities. This report covers the main topics of the 2nd Symposium of future...

  13. Parallel Machine Problems with a Single Server and Release Times

    Institute of Scientific and Technical Information of China (English)

    SHI Ling

    2005-01-01

    Parallel machine problems with a single server and release times are generalizations of classical parallel machine problems.Before processing, each job must be loaded on a machine, which takes a certain release times and a certain setup times.All these setups have to be done by a single server, which can handle at most one job at a time.In this paper, we continue studying the complexity result for parallel machine problem with a single and release times.New complexity results are derived for special cases.

  14. submitter The TwinEBIS setup: Machine description

    CERN Document Server

    Breitenfeldt, M; Pitters, J; Shornikov, A; Wenander, F

    2017-01-01

    TwinEBIS is an Electron Beam Ion Source (EBIS) recently made operational at CERN. The device is similar in construction to the REXEBIS charge breeder operating at the ISOLDE facility. After relocation of the solenoid from the Manne Siegbahn Laboratory (MSL) Stockholm, TwinEBIS was commissioned at CERN and serves as a test bench dedicated to manipulation of low-energy highly charged ions. In this paper we give an overview of the setup and present advanced numerical simulations of the electron optics. In addition, the alignment procedure of the solenoid magnetic field is described and measurement results are presented. Results from cathode investigations, electron beam tests and ion extraction modulation are presented in a follow-up paper.

  15. Setup time reduction in pvc boots production through smed technique

    Directory of Open Access Journals (Sweden)

    Amanda Herculano da Costa

    2012-03-01

    Full Text Available The competition imposed by the market requires of the organizations the continuous improvement of its processes, products and offered services, with lower production costs. This article addresses this issue describing the resulting improvements from the implementation of Single Minute Exchange of Die (SMED in the process of exchange the mold of the injection machine of PVC during the boots manufacturing. The case study was conducted in a large company of footwear, located in the state of Paraiba. In order to find the best alternative to the problem of the setup of the molds, were used the SMED and the methodology for problem resolution, and then was implemented the solution that generated greater productivity for the company. Among the improvements made, we should emphasize the reduction of inactive time of 11.56 minutes to 5 minutes, reducing the time needed for the adjustments of the molds with the implementation of guides for centering and shims to standardize the heights of the molds.

  16. Development of Experimental Setup of Metal Rapid Prototyping Machine using Selective Laser Sintering Technique

    Science.gov (United States)

    Patil, S. N.; Mulay, A. V.; Ahuja, B. B.

    2016-08-01

    Unlike in the traditional manufacturing processes, additive manufacturing as rapid prototyping, allows designers to produce parts that were previously considered too complex to make economically. The shift is taking place from plastic prototype to fully functional metallic parts by direct deposition of metallic powders as produced parts can be directly used for desired purpose. This work is directed towards the development of experimental setup of metal rapid prototyping machine using selective laser sintering and studies the various parameters, which plays important role in the metal rapid prototyping using SLS technique. The machine structure in mainly divided into three main categories namely, (1) Z-movement of bed and table, (2) X-Y movement arrangement for LASER movements and (3) feeder mechanism. Z-movement of bed is controlled by using lead screw, bevel gear pair and stepper motor, which will maintain the accuracy of layer thickness. X-Y movements are controlled using timing belt and stepper motors for precise movements of LASER source. Feeder mechanism is then developed to control uniformity of layer thickness metal powder. Simultaneously, the study is carried out for selection of material. Various types of metal powders can be used for metal RP as Single metal powder, mixture of two metals powder, and combination of metal and polymer powder. Conclusion leads to use of mixture of two metals powder to minimize the problems such as, balling effect and porosity. Developed System can be validated by conducting various experiments on manufactured part to check mechanical and metallurgical properties. After studying the results of these experiments, various process parameters as LASER properties (as power, speed etc.), and material properties (as grain size and structure etc.) will be optimized. This work is mainly focused on the design and development of cost effective experimental setup of metal rapid prototyping using SLS technique which will gives the feel of

  17. MANUFACTURING CELL DESIGN WITH REDUCTION IN SETUP TIME THROUGH GENETIC ALGORITHM

    Directory of Open Access Journals (Sweden)

    M. Murugan

    2007-01-01

    Full Text Available Cellular manufacturing emerged as a production strategy capable of solving the problems of complexity and long manufacturing lead times in batch production. The fundamental problem in cellular manufacturing is the formation of product families and machine cells. This paper presents a new approach for obtaining simultaneous arrangement of part families and machine cells for cellular manufacturing systems. The main feature of the proposed method is, the relevant production data such as process sequences and setup times are taken in to account. It has the ability to select the best solution among the solutions of compactness, group technology efficiency and reducing setup time efficiency for each part before attempting to cluster the machines and parts. The formation of part family and machine cell has been treated as a maximization problem according to a defined performance measure ‘β’. A genetic algorithm has been developed for solving the cell formation problem considering the reduction in setup time. The validation has been done based on a real time manufacturing data. This algorithm is written in the ‘C’ language on Intel Pentium / PIII compatible system.

  18. Estimation of functional preparedness of young handballers in setup time

    Directory of Open Access Journals (Sweden)

    Favoritоv V.N.

    2012-11-01

    Full Text Available The dynamics of level of functional preparedness of young handballers in setup time is shown. It was foreseen to make alteration in educational-training process with the purpose of optimization of their functional preparedness. 11 youths were plugged in research, calendar age 14 - 15 years. For determination of level of their functional preparedness the computer program "SVSM" was applied. It is set that at the beginning of setup time of 18,18% of all respondent functional preparedness is characterized by a "middle" level, 27,27% - below the "average", 54,54% - "above" the average. At the end of setup time among sportsmen representatives prevailed with the level of functional preparedness "above" average - 63,63%, with level "high" - 27,27%, sportsmen with level below the average were not observed. Efficiency of the offered system of trainings employments for optimization of functional preparedness of young handballers is well-proven.

  19. Heuristics methods for the flow shop scheduling problem with separated setup times

    Directory of Open Access Journals (Sweden)

    Marcelo Seido Nagano

    2012-06-01

    Full Text Available This paper deals with the permutation flow shop scheduling problem with separated machine setup times. As a result of an investigation on the problem characteristics, four heuristics methods are proposed with procedures of the construction sequencing solution by an analogy with the asymmetric traveling salesman problem with the objective of minimizing makespan. Experimental results show that one of the new heuristics methods proposed provide high quality solutions in comparisons with the evaluated methods considered in the literature.

  20. A MULTICRITERIA PERMUTATION FLOWSHOP SCHEDULING PROBLEM WITH SETUP TIMES

    Directory of Open Access Journals (Sweden)

    M.Saravanan

    2014-07-01

    Full Text Available The permutation flow shop scheduling problem has been completely concentrated on in late decades, both from single objective and additionally from multi-objective points of view. To the best of our information, little has been carried out with respect to the multi-objective flow shop with sequence dependent setup times are acknowledged. As setup times and multi-criteria problems are significant in industry, we must concentrate on this area. We propose a simple and powerful meta-heuristic algorithm as artificial immune system for the sequence dependent setup time’s flow shop problem with several criteria. The objective functions are framed to simultaneously minimize the makespan time, tardiness time, earliness time and total completion time. The proposed approach is in conjunction with the constructive heuristic of Nawaz et al. evaluated using benchmark problems taken from Taillard and compared with the prevailing Simulated annealing approach and B-Grasp approach. Computational experiments indicate that the proposed algorithm is better than the SA approach and B-Grasp approach in all cases and can be very well applied to find better schedule.

  1. Build your own time machine

    CERN Document Server

    Clegg, Brian

    2012-01-01

    There is no physical law to prevent time travel nothing in physics to say it is impossible. So who is to say it can't be done? In Build Your Own Time Machine, acclaimed science writer Brian Clegg takes inspiration from his childhood heroes, Doctor Who and H. G. Wells, to explain the nature of time. How do we understand it and why measure it the way we do? How did the theories of one man change the way time was perceived by the world? Why wouldn't H. G. Wells's time machine have worked? And what would we need to do to make a real one? Build Your Own Time Machine explores the amazing possib

  2. Setup time reduction: SMED-balancing integrated model for manufacturing systems with automated transfer

    Directory of Open Access Journals (Sweden)

    Maurizio Faccio

    2013-10-01

    Full Text Available The importance of short setup times is increasing in every type of industry. It has been known how to address this problem for about 20 years. The SMED method, originally developed by the Japanese industrial engineer Shigeo Shingo for reducing the time to exchange dies, gives a really straightforward approach to improve existing setups. On the other hand, in the case of complex manufacturing systems the simple application of the SMED methodology is not enough. Manufacturing systems composed of different working machines with automated transfer facilities are a good example. Technologicalconstraints, task precedence constraints, and synchronization between different setup tasks are just some of the influencing factors that make an improved SMED desirable. The present paper, starting from an industrial case, aims to provide a heuristics methodology that integrates the traditional SMED with the workload balancing problem that is typical of assembly systems, in order to address the setup reduction problem in the case of complex manufacturing systems. Anindustrial case is reported to validate the proposed model and to demonstrate its practical implications.

  3. A proposal simulated annealing algorithm for proportional parallel flow shops with separated setup times

    Directory of Open Access Journals (Sweden)

    Helio Yochihiro Fuchigami

    2014-08-01

    Full Text Available This article addresses the problem of minimizing makespan on two parallel flow shops with proportional processing and setup times. The setup times are separated and sequence-independent. The parallel flow shop scheduling problem is a specific case of well-known hybrid flow shop, characterized by a multistage production system with more than one machine working in parallel at each stage. This situation is very common in various kinds of companies like chemical, electronics, automotive, pharmaceutical and food industries. This work aimed to propose six Simulated Annealing algorithms, their perturbation schemes and an algorithm for initial sequence generation. This study can be classified as “applied research” regarding the nature, “exploratory” about the objectives and “experimental” as to procedures, besides the “quantitative” approach. The proposed algorithms were effective regarding the solution and computationally efficient. Results of Analysis of Variance (ANOVA revealed no significant difference between the schemes in terms of makespan. It’s suggested the use of PS4 scheme, which moves a subsequence of jobs, for providing the best percentage of success. It was also found that there is a significant difference between the results of the algorithms for each value of the proportionality factor of the processing and setup times of flow shops.

  4. Programación de Máquinas Paralelas no Relacionadas con Tiempos de Montaje dependientes de la Secuencia y Entrada Dinámica usando Algoritmos Genéticos Scheduling of Non-Related Parallel Machines with Sequence Dependent Setup Times and Dynamic Entry using Genetic Algorithms

    Directory of Open Access Journals (Sweden)

    Jaime A Arango

    2013-01-01

    Full Text Available Este trabajo describe una propuesta de solución al problema de procesar n trabajos en m máquinas paralelas no relacionadas. Es un problema de asignación generalizado de orden lineal y tipo combinatorial que considera tiempos de montaje dependientes de la secuencia y entrada dinámica de trabajos. Se propone un algoritmo genético con codificación entera y conformación de la población, selección de padres, cruzamiento y mutación aleatorios. Hay dos descendientes por generación que compiten contra el peor elemento existente para entrar a la población. Se itera un número de generaciones proporcional al producto de nxm para obtener la solución En cada máquina se secuencian los trabajos por fecha de entrega y los tiempos computacionales son aceptables. Se concluye que el problema pudo ser solucionado mediante el algoritmo genético propuesto de forma eficaz y eficiente y que las soluciones se enfocan en reducir el tiempo de procesamiento y cumplimiento de fechas de entrega.This paper describes a solution method to the problem of processing n jobs on m non-related parallel machines. It is a linear and combinatorial generalized allocation problem that considered a sequence-dependent setup time and dynamic job entry. A genetic algorithm with integer coding and random generation of population, parent selection, crossover and mutation is proposed. There are two descendants per generation that are compared against the worst existing element to enter to population. After a number of generations that is proportional to the product of nxm the solution is generated. The jobs are sequenced on each machine by due date and computational times are acceptable. It is concluded that the proposed genetic algorithm is an effective and efficient solution that focuses on reducing processing time and on meeting deadlines.

  5. Time-machine in Perfect Fluid Cosmologies

    Institute of Scientific and Technical Information of China (English)

    DUAN Yan-zhi

    2009-01-01

    This letter investigates the time-machine problem in perfect fluid cosmologies. It solves the Einstein's field equations with the energy-momentum tensors for perfect fluid and constructs a class of time-machine solutions,by which the time-machine problem in the perfect fluid cosmologies is solved.

  6. Single-Machine Group Scheduling Problems with Deterioration to Minimize the Sum of Completion Times

    Directory of Open Access Journals (Sweden)

    Yong He

    2012-01-01

    Full Text Available We consider two single-machine group scheduling problems with deteriorating group setup and job processing times. That is, the job processing times and group setup times are linearly increasing (or decreasing functions of their starting times. Jobs in each group have the same deteriorating rate. The objective of scheduling problems is to minimize the sum of completion times. We show that the sum of completion times minimization problems remains polynomially solvable under the agreeable conditions.

  7. Machine scheduling with resource dependent processing times

    NARCIS (Netherlands)

    Grigoriev, A.; Sviridenko, M.; Uetz, Marc Jochen

    We consider machine scheduling on unrelated parallel machines with the objective to minimize the schedule makespan. We assume that, in addition to its machine dependence, the processing time of any job is dependent on the usage of a discrete renewable resource, e.g. workers. A given amount of that

  8. A hybrid algorithm for flexible job-shop scheduling problem with setup times

    Directory of Open Access Journals (Sweden)

    Ameni Azzouz

    2017-01-01

    Full Text Available Job-shop scheduling problem is one of the most important fields in manufacturing optimization where a set of n jobs must be processed on a set of m specified machines. Each job consists of a specific set of operations, which have to be processed according to a given order. The Flexible Job Shop problem (FJSP is a generalization of the above-mentioned problem, where each operation can be processed by a set of resources and has a processing time depending on the resource used. The FJSP problems cover two difficulties, namely, machine assignment problem and operation sequencing problem. This paper addresses the flexible job-shop scheduling problem with sequence-dependent setup times to minimize two kinds of objectives function: makespan and bi-criteria objective function. For that, we propose a hybrid algorithm based on genetic algorithm (GA and variable neighbourhood search (VNS to solve this problem. To evaluate the performance of our algorithm, we compare our results with other methods existing in literature. All the results show the superiority of our algorithm against the available ones in terms of solution quality.

  9. An Improved Particle Swarm Optimization for Selective Single Machine Scheduling with Sequence Dependent Setup Costs and Downstream Demands

    Directory of Open Access Journals (Sweden)

    Kun Li

    2015-01-01

    Full Text Available This paper investigates a special single machine scheduling problem derived from practical industries, namely, the selective single machine scheduling with sequence dependent setup costs and downstream demands. Different from traditional single machine scheduling, this problem further takes into account the selection of jobs and the demands of downstream lines. This problem is formulated as a mixed integer linear programming model and an improved particle swarm optimization (PSO is proposed to solve it. To enhance the exploitation ability of the PSO, an adaptive neighborhood search with different search depth is developed based on the decision characteristics of the problem. To improve the search diversity and make the proposed PSO algorithm capable of getting out of local optimum, an elite solution pool is introduced into the PSO. Computational results based on extensive test instances show that the proposed PSO can obtain optimal solutions for small size problems and outperform the CPLEX and some other powerful algorithms for large size problems.

  10. A survey of infinite time Turing machines

    NARCIS (Netherlands)

    Hamkins, J.D.

    2007-01-01

    Infinite time Turing machines extend the operation of ordinary Turing machines into transfinite ordinal time, thereby providing a natural model of infinitary computability, with robust notions of computability and decidability on the reals, while remaining close to classical concepts of computabilit

  11. The Time Machine in Our Mind

    Science.gov (United States)

    Stocker, Kurt

    2012-01-01

    This article provides the first comprehensive conceptual account for the imagistic mental machinery that allows us to travel through time--for the time machine in our mind. It is argued that language reveals this imagistic machine and how we use it. Findings from a range of cognitive fields are theoretically unified and a recent proposal about…

  12. The Time Machine in Our Mind

    Science.gov (United States)

    Stocker, Kurt

    2012-01-01

    This article provides the first comprehensive conceptual account for the imagistic mental machinery that allows us to travel through time--for the time machine in our mind. It is argued that language reveals this imagistic machine and how we use it. Findings from a range of cognitive fields are theoretically unified and a recent proposal about…

  13. Integration of micro milling highspeed spindle on a microEDM-milling machine set-up

    DEFF Research Database (Denmark)

    De Grave, Arnaud; Hansen, Hans Nørgaard; Andolfatto, Loic

    2009-01-01

    In order to cope with repositioning errors and to combine the fast removal rate of micro milling with the precision and small feature size achievable with micro EDM milling, a hybrid micro-milling and micro-EDM milling centre was built and tested. The aim was to build an affordable set-up, easy...... by micro milling. Examples of test parts are shown and used as an experimental validation....

  14. An obstacle to building a time machine

    Science.gov (United States)

    Carroll, Sean M.; Farhi, Edward; Guth, Alan H.

    1992-01-01

    Gott (1991) has shown that a spacetime with two infinite parallel cosmic strings passing each other with sufficient velocity contains closed timelike curves. An attempt to build such a time machine is discussed. Using the energy-momentum conservation laws in the equivalent (2 + 1)-dimensional theory, the spacetime representing the decay of one gravitating particle into two is explicitly constructed; there is never enough mass in an open universe to build the time machine from the products of decays of stationary particles. More generally, the Gott time machine cannot exist in any open (2 + 1)-dimensional universe for which the total momentum is timelike.

  15. An economic production model for time dependent demand with rework and multiple production setups

    Directory of Open Access Journals (Sweden)

    S.R. Singh

    2014-04-01

    Full Text Available In this paper, we present a model for time dependent demand with multiple productions and rework setups. Production is demand dependent and greater than the demand rate. Production facility produces items in m production setups and one rework setup (m, 1 policy. The major reason of reverse logistic and green supply chain is rework, so it reduces the cost of production and other ecological problems. Most of the researchers developed a rework model without deteriorating items. A numerical example and sensitivity analysis is shown to describe the model.

  16. Minimizing the total tardiness and makespan in an open shop scheduling problem with sequence-dependent setup times

    Science.gov (United States)

    Noori-Darvish, Samaneh; Tavakkoli-Moghaddam, Reza

    2012-10-01

    We consider an open shop scheduling problem with setup and processing times separately such that not only the setup times are dependent on the machines, but also they are dependent on the sequence of jobs that should be processed on a machine. A novel bi-objective mathematical programming is designed in order to minimize the total tardiness and the makespan. Among several multi-objective decision making (MODM) methods, an interactive one, called the TH method is applied for solving small-sized instances optimally and obtaining Pareto-optimal solutions by the Lingo software. To achieve Pareto-optimal sets for medium to large-sized problems, an improved non-dominated sorting genetic algorithm II (NSGA-II) is presented that consists of a heuristic method for obtaining a good initial population. In addition, by using the design of experiments (DOE), the efficiency of the proposed improved NSGA-II is compared with the efficiency of a well-known multi-objective genetic algorithm, namely SPEA-II. Finally, the performance of the improved NSGA-II is examined in a comparison with the performance of the traditional NSGA-II.

  17. Cosmic Time Machines: the Causality Issue

    Directory of Open Access Journals (Sweden)

    Felice Fernando de

    2013-09-01

    Full Text Available Continued gravitational collapse gives rise to curvature singularities. If a curvature singularity is globally naked then the space-time may be causally future illbehaved admitting closed time-like or null curves which extend to asymptotic distances and generate a Cosmic Time Machine (de Felice (1995 Lecture Notes in Physics 455, 99 [6]. The existence of Cosmic Time Machines makes it plausible the violation of causality. I conjecture that this circumstance is prevented by some, yet unknown, physical process and show that such a mechanism indeed exists in the Kerr spacetime.

  18. Machine-Checkable Timed CSP

    Science.gov (United States)

    Goethel, Thomas; Glesner, Sabine

    2009-01-01

    The correctness of safety-critical embedded software is crucial, whereas non-functional properties like deadlock-freedom and real-time constraints are particularly important. The real-time calculus Timed Communicating Sequential Processes (CSP) is capable of expressing such properties and can therefore be used to verify embedded software. In this paper, we present our formalization of Timed CSP in the Isabelle/HOL theorem prover, which we have formulated as an operational coalgebraic semantics together with bisimulation equivalences and coalgebraic invariants. Furthermore, we apply these techniques in an abstract specification with real-time constraints, which is the basis for current work in which we verify the components of a simple real-time operating system deployed on a satellite.

  19. THE M/M/c QUEUE WITH (e,d) SETUP TIME

    Institute of Scientific and Technical Information of China (English)

    Xiuli XU; Naishuo TIAN

    2008-01-01

    The authors present a new queueing model with (e, d) setup time. Using the quasi-birth-and-death process and matrix-geometric method, the authors obtain the stationary distribution of queue length and the LST of waiting time of a customer in the system. Furthermore, the conditional stochastic decomposition results of queue length and waiting time are given.

  20. The Time Machine: Writing Historical Fiction.

    Science.gov (United States)

    Karr, Kathleen

    2000-01-01

    Discusses historical fiction for children and young adults from a writer's point of view and equates it to a time machine into the past. Considers the books that influenced the writer; larger-than-life characters; story ideas; and research to really know and feel the setting. (LRW)

  1. X-ray quantum-eraser setup for time-energy complementarity

    Science.gov (United States)

    Gunst, Jonas; Pálffy, Adriana

    2016-12-01

    A quantum-eraser setup exploiting the time-energy complementarity relation in the x-ray regime is investigated theoretically. The starting point is the interference process between x-ray quanta driving two nuclear hyperfine transitions in a nuclear forward-scattering setup. We show that which-way information can be obtained by marking the scattering paths with orthogonal polarization states, thus leading to the disappearance of the interference pattern. In turn, erasure of the which-way information leads to the reappearance of the interference fringes. We put forward two schemes using resonant scattering off nuclear targets and design which-way marking procedures to realize the quantum-eraser setup for x-ray quanta.

  2. All optical implementation of a time-domain ptychographic pulse reconstruction set-up

    CERN Document Server

    Spangenberg, Dirk-Mathys; Rohwer, Erich; Feurer, Thomas

    2016-01-01

    An all optical implementation of pulse reconstruction using time-domain ptychography is demonstrated showing excellent results. Setup and reconstruction are easy to implement and a number of drawbacks found in other second order techniques are removed, such as the beam splitter modifying the pulse under consideration, the time ambiguity, or the strict correspondence between time delay increment and temporal resolution. Ptychography generally performs superior to algorithms based on general projections, requires considerable less computational effort and is much less susceptible to noise.

  3. Linear Time Algorithms for Parallel Machine Scheduling

    Institute of Scientific and Technical Information of China (English)

    Zhi Yi TAN; Yong HE

    2007-01-01

    This paper addresses linear time algorithms for parallel machine scheduling problems. We introduce a kind of threshold algorithms and discuss their main features. Three linear time threshold algorithm classes DT, PT and DTm are studied thoroughly. For all classes, we study their best possible algorithms among each class. We also present their application to several scheduling problems.The new algorithms are better than classical algorithms in time complexity and/or worst-case ratio.Computer-aided proof technique is used in the proof of main results, which greatly simplifies the proof and decreases case by case analysis.

  4. Black holes, wormholes and time machines

    CERN Document Server

    Al-Khalili, Jim

    2011-01-01

    Bringing the material up to date, Black Holes, Wormholes and Time Machines, Second Edition captures the new ideas and discoveries made in physics since the publication of the best-selling first edition. While retaining the popular format and style of its predecessor, this edition explores the latest developments in high-energy astroparticle physics and Big Bang cosmology.The book continues to make the ideas and theories of modern physics easily understood by anyone, from researchers to students to general science enthusiasts. Taking you on a journey through space and time, author Jim Al-Khalil

  5. Experimental and theoretical investigation of timing jitter inside a stretcher-compressor setup.

    Science.gov (United States)

    Klingebiel, Sandro; Ahmad, Izhar; Wandt, Christoph; Skrobol, Christoph; Trushin, Sergei A; Major, Zsuzsanna; Krausz, Ferenc; Karsch, Stefan

    2012-02-13

    In an optically synchronized short-pulse optical-parametric chirped-pulse amplification (OPCPA) system, we observe a few-100 fs-scale timing jitter. With an active timing stabilization system slow fluctuations are removed and the timing jitter can be reduced to 100 fs standard deviation (Std). As the main source for the timing fluctuations we could identify air turbulence in the stretcher-compressor setup inside the chirped pulse amplification (CPA) pump chain. This observation is supported by theoretical investigation of group delay changes for angular deviations occurring between the parallel gratings of a compressor or stretcher, as they can be introduced by air turbulence.

  6. Aliens and time in the machine age

    Science.gov (United States)

    Brake, Mark; Hook, Neil

    2006-12-01

    The 19th century saw sweeping changes for the development of astrobiology, both in the constituency of empirical science encroaching upon all aspects of life and in the evolution of ideas, with Lyell's Principles of Geology radically raising expectation of the true age of the Earth and the drama of Darwinism questioning biblically literalist accounts of natural history. This paper considers the popular culture spun on the crackling loom of the emergent aspects of astrobiology of the day: Edward Bulwer-Lytton's The Coming Race (1871), which foretold the race of the future, and satirist Samuel Butler's anticipation of machine intelligence, `Darwin Among the Machines', in his Erewhon (1872). Finally, we look at the way Darwin, Huxley and natural selection travelled into space with French astronomer Camille Flammarion's immensely popular Récits de l'infini (Stories of Infinity, 1872), and the social Darwinism of H.G. Wells' The Time Machine (1895) and The War of the Worlds (1898). These works of popular culture presented an effective and inspiring communication of science; their crucial discourse was the reducible gap between the new worlds uncovered by science and exploration and the fantastic strange worlds of the imagination. As such they exemplify a way in which the culture and science of popular astrobiology can be fused.

  7. Analysis of dispatching rules in a stochastic dynamic job shop manufacturing system with sequence-dependent setup times

    Science.gov (United States)

    Sharma, Pankaj; Jain, Ajai

    2014-12-01

    Stochastic dynamic job shop scheduling problem with consideration of sequence-dependent setup times are among the most difficult classes of scheduling problems. This paper assesses the performance of nine dispatching rules in such shop from makespan, mean flow time, maximum flow time, mean tardiness, maximum tardiness, number of tardy jobs, total setups and mean setup time performance measures viewpoint. A discrete event simulation model of a stochastic dynamic job shop manufacturing system is developed for investigation purpose. Nine dispatching rules identified from literature are incorporated in the simulation model. The simulation experiments are conducted under due date tightness factor of 3, shop utilization percentage of 90% and setup times less than processing times. Results indicate that shortest setup time (SIMSET) rule provides the best performance for mean flow time and number of tardy jobs measures. The job with similar setup and modified earliest due date (JMEDD) rule provides the best performance for makespan, maximum flow time, mean tardiness, maximum tardiness, total setups and mean setup time measures.

  8. Real-time setup to record radon emission during rock deformation: implications for geochemical surveillance

    Science.gov (United States)

    Tuccimei, P.; Mollo, S.; Soligo, M.; Scarlato, P.; Castelluccio, M.

    2015-02-01

    Laboratory experiments can represent a valid approach to unravel the complex interplay between the geochemical behaviour of radon and rock deformation mechanisms. In light of this, we present a new real-time experimental setup for analyzing in continuum the alpha-emitting 222Rn and 220Rn daughters over variable stress-strain regimes. The most innovative segment of this setup consists of the radon accumulation chamber obtained from a tough and durable material that can host large cylindrical rock samples. The accumulation chamber is connected, in a closed-loop configuration, to a gas-drying unit and to a RAD7 radon monitor. A re-circulating pump moves the gas from the rock sample to a solid-state detector for alpha counting of radon and thoron progeny. The measured radon signal is enhanced by surrounding the accumulation chamber with a digitally controlled heating belt. As the temperature is increased, the number of effective collision of radon atoms increases favouring the diffusion of radon through the material and reducing the analytical uncertainty. The accumulation chamber containing the sample is then placed into an uniaxial testing apparatus where the axial deformation is measured throughout a linear variable displacement transducer. A dedicated software allows to obtain a variety of stress-strain regimes from fast deformation rates to long-term creep tests. Experiments conducted with this new real-time setup have important ramifications for the interpretation of geochemical anomalies recorded prior to volcanic eruptions or earthquakes.

  9. Real-time setup to measure radon emission during rock deformation: implications for geochemical surveillance

    Science.gov (United States)

    Tuccimei, P.; Mollo, S.; Soligo, M.; Scarlato, P.; Castelluccio, M.

    2015-05-01

    Laboratory experiments can represent a valid approach to unravel the complex interplay between the geochemical behaviour of radon and rock deformation mechanisms. In light of this, we present a new real-time experimental setup for analysing in continuum the alpha-emitting 222Rn and 220Rn daughters over variable stress-strain regimes. The most innovative segment of this setup consists of the radon accumulation chamber obtained from a tough and durable material that can host large cylindrical rock samples. The accumulation chamber is connected, in a closed-loop configuration, to a gas-drying unit and to a RAD7 radon monitor. A recirculating pump moves the gas from the rock sample to a solid-state detector for alpha counting of radon and thoron progeny. The measured radon signal is enhanced by surrounding the accumulation chamber with a digitally controlled heating belt. As the temperature is increased, the number of effective collisions of radon atoms increases favouring the diffusion of radon through the material and reducing the analytical uncertainty. The accumulation chamber containing the sample is then placed into a uniaxial testing apparatus where the axial deformation is measured throughout a linear variable displacement transducer. A dedicated software allows obtaining a variety of stress-strain regimes from fast deformation rates to long-term creep tests. Experiments conducted with this new real-time setup have important ramifications for the interpretation of geochemical anomalies recorded prior to volcanic eruptions or earthquakes.

  10. Real-time setup to record radon emission during rock deformation: implications for geochemical surveillance

    Directory of Open Access Journals (Sweden)

    P. Tuccimei

    2015-02-01

    Full Text Available Laboratory experiments can represent a valid approach to unravel the complex interplay between the geochemical behaviour of radon and rock deformation mechanisms. In light of this, we present a new real-time experimental setup for analyzing in continuum the alpha-emitting 222Rn and 220Rn daughters over variable stress–strain regimes. The most innovative segment of this setup consists of the radon accumulation chamber obtained from a tough and durable material that can host large cylindrical rock samples. The accumulation chamber is connected, in a closed-loop configuration, to a gas-drying unit and to a RAD7 radon monitor. A re-circulating pump moves the gas from the rock sample to a solid-state detector for alpha counting of radon and thoron progeny. The measured radon signal is enhanced by surrounding the accumulation chamber with a digitally controlled heating belt. As the temperature is increased, the number of effective collision of radon atoms increases favouring the diffusion of radon through the material and reducing the analytical uncertainty. The accumulation chamber containing the sample is then placed into an uniaxial testing apparatus where the axial deformation is measured throughout a linear variable displacement transducer. A dedicated software allows to obtain a variety of stress–strain regimes from fast deformation rates to long-term creep tests. Experiments conducted with this new real-time setup have important ramifications for the interpretation of geochemical anomalies recorded prior to volcanic eruptions or earthquakes.

  11. Time-Machine Solutions of Einstein's Equations with Electromagnetic Field

    Institute of Scientific and Technical Information of China (English)

    SHEN Ming; SUN Qing-You

    2011-01-01

    In this paper we investigate the time-machine problem in the electromagnetic field.Based on a metric which is a more general form of Ori's, we solve the Einstein's equations with the energy-momentum tensors for electromagnetic field, and construct the time-machine solutions, which solve the time machine problem in electromagnetic field.

  12. Holographic dual of a time machine

    Science.gov (United States)

    Arefeva, Irina; Bagrov, Andrey; Säterskog, Petter; Schalm, Koenraad

    2016-08-01

    Assuming that the AdS/CFT prescription is valid in the case of noncausal backgrounds, we apply it to the simplest possible eternal time machine solution in AdS3 based on two conical defects moving around their center of mass along a circular orbit. Closed timelike curves in this space-time extend all the way to the boundary of AdS3, violating causality of the boundary field theory. By use of the geodesic approximation we address the issue of self-consistent dynamics of the dual 1 +1 dimensional field theory when causality is violated, and calculate the two-point retarded Green function. It has a nontrivial analytical structure both at negative and positive times, providing us with an intuition on how an interacting quantum field could behave once causality is broken.

  13. A comparison of genetic algorithm and artificial bee colony approaches in solving blocking hybrid flowshop scheduling problem with sequence dependent setup/changeover times

    Directory of Open Access Journals (Sweden)

    Pongpan Nakkaew

    2016-06-01

    Full Text Available In manufacturing process where efficiency is crucial in order to remain competitive, flowshop is a common configuration in which machines are arranged in series and products are produced through the stages one by one. In certain production processes, the machines are frequently configured in the way that each production stage may contain multiple processing units in parallel or hybrid. Moreover, along with precedent conditions, the sequence dependent setup times may exist. Finally, in case there is no buffer, a machine is said to be blocked if the next stage to handle its output is being occupied. Such NP-Hard problem, referred as Blocking Hybrid Flowshop Scheduling Problem with Sequence Dependent Setup/Changeover Times, is usually not possible to find the best exact solution to satisfy optimization objectives such as minimization of the overall production time. Thus, it is usually solved by approximate algorithms such as metaheuristics. In this paper, we investigate comparatively the effectiveness of the two approaches: a Genetic Algorithm (GA and an Artificial Bee Colony (ABC algorithm. GA is inspired by the process of natural selection. ABC, in the same manner, resembles the way types of bees perform specific functions and work collectively to find their foods by means of division of labor. Additionally, we apply an algorithm to improve the GA and ABC algorithms so that they can take advantage of parallel processing resources of modern multiple core processors while eliminate the need for screening the optimal parameters of both algorithms in advance.

  14. Stochastic integrated vendor–buyer model with unstable lead time and setup cost

    Directory of Open Access Journals (Sweden)

    Chandra K. Jaggi

    2011-01-01

    Full Text Available This paper presents a new vendor-buyer system where there are different objectives for both sides. The proposed method of this paper is different from the other previously published works since it considers different objectives for both sides. In this paper, the vendor’s emphasis is on the crashing of the setup cost, which not only helps him compete in the market but also provides better services to his customers; and the buyer’s aim is to reduce the lead time, which not only facilitates the buyer to fulfill the customers’ demand on time but also enables him to earn a good reputation in the market or vice versa. In the light of the above stated facts, an integrated vendor-buyer stochastic inventory model is also developed. The propsed model considers two cases for demand during lead time: Case (i Complete demand information, Case (ii Partial demand information. The proposed model jointly optimizes the buyer’s ordered quantity and lead time along with vendor’s setup cost and the number of shipments. The results are demonstrated with the help of numerical examples.

  15. Measurement of Overall Performance Effectiveness in Setup Improvement

    Directory of Open Access Journals (Sweden)

    Shye-Nee Low

    2014-01-01

    Full Text Available This study aimed to improve the setup process of injection molding machines by using the developed setup improvement methodology. Overall performance effectiveness (OPE was used to evaluate the setup improvement. A case study was tested on the application of the developed setup improvement methodology. A 50.1% reduction in setup time was attained by the developed methodology, and significant time savings were achieved with minimum investment. Comparisons between before and after improvement implementation were conducted through OPE to verify the improvement. In terms of OPE, the setup performance in the case study considered an acceptable value of 60.45%. The setup process performance of the developed setup improvement methodology was judged in terms of effectiveness. Results therefore indicate that OPE measurement is an effective way to analyze the efficiency of a single setup process.

  16. BOOK REVIEW: Black Holes, Wormholes & Time Machines

    Science.gov (United States)

    Mellema, Steven H.

    2000-05-01

    Black Holes Wormholes & Time Machines is a welcome addition to the collection of books written with the purpose of explaining interesting aspects of 20th century physics to a general audience. Throughout the book it is clear that the author, Jim Al-Khalili, must be a wonderful public lecturer. His style, informal yet precise, is just what is needed to convey these difficult concepts to an audience of non-specialists. As the title might suggest, the author has chosen to specifically address certain topics that have been introduced into the public imagination through the mass media (primarily movies and television). He does an admirable job, both of connecting to these media-generated perceptions (with frequent references, for example, to Star Trek) and of correcting them (or at least placing them in the proper context) insofar as the current knowledge of physics is concerned. What emerges is a well thought-out journey through the theories of special and general relativity as well as appropriate aspects of cosmology. The book eschews the standard, historical approach, which would introduce special relativity, followed by general relativity, and finally some cosmology. Rather, it begins with the promise and the paradoxes of time travel (exemplified in the movie The Terminator) and then winds its way carefully through all of the physics relevant to the possible existence of a time machine. Along the way, the reader is introduced to aspects of special and general relativity, including higher dimensional space-times and geometries. The astrophysical and cosmological journey visits the Big Bang, open and closed universes, and black holes. By meticulously piecing together the puzzle of time (and along the way meeting such oddities as parallel universes and wormholes) the author comes to the climactic chapter entitled `How to Build a Time Machine'. There may be readers who are disappointed that this ultimate question is unraveled, not so much like an instruction manual (as

  17. A Design for a Quantum Time Machine

    CERN Document Server

    Gray, A

    1998-01-01

    In the new ``History Selection'' formulation of Quantum Mechanics an entire cosmic history is selected over all space and time, with a probability for selection assigned to each possible history. As this probability depends on the whole history, and is not merely composed of the product of probabilities for each step in the history, the theory is not a causal theory. It shall be shown that this violation of causality is usually completely unobservable and confined to the microscopic world, occurring inbetween ``observations''. However it shall also be shown that in certain special circumstances it is possible to exploit the intrinsic non-causal nature of the theory to violate causality at the macroscopic level. A practical design for a device which can exploit this effect is shown. Such a device would effectively enable one to see into the future, and is thus a kind of time machine. Finally it shall be shown that, according to this new formulation of Quantum Mechanics, this does not give rise to any unpleasan...

  18. What kind of time for a Time Machine?

    Science.gov (United States)

    Alfano, Marina; Buccheri, Rosolino

    2013-09-01

    The linear, unstructured, parameter t used in the equations of mechanics, in spite of its great aptness in describing the nature's laws, does not fit with the unidirectional flow of time tssubjectively experienced by humans, just the investigators of nature. Being ts the main foundation upon which we build our knowledge of nature through our continuous and inescapable reciprocal interaction - the possible key factor of our cerebral modulation, mediator between us and the world -, its objective essence appears to be inevitably destined to remain unveiled. We derive that any imagined and theoretically possible Time Machine, aimed to get us in our past or in our future allowing us to act there, does not have any practical grounds if it is built by using the illusory, impersonal, time, modeled by the parameter t, at the place of our interpersonal lived time ts. A real, humanly-tuned, Time Machine could perhaps arise by integrating tsin the body of a new kind of rationality - a `complex thought' - where empiricism and logic-mathematic are harmonized with participation and interaction. Ongoing joint research in neurophysiology and physics (without neglecting any important contribution coming from anthropology) will surely help achieving such a goal.

  19. On a BMAP/G/1 G-queue with Setup Times andMultiple Vacations

    Institute of Scientific and Technical Information of China (English)

    Yi PENG; Xiang-qun YANG

    2011-01-01

    In this paper,we consider a BMAP/G/1 G-queue with setup times and multiple vacations.Arrivals of positive customers and negative customers follow a batch Markovian arrival process (BMAP) and Markovian arrival process (MAP) respectively.The arrival of a negative customer removes all the customers in the system when the server is working.The server leaves for a vacation as soon as the system empties and is allowed to take repeated (multiple) vacations.By using the supplementary variables method and the censoring technique,we obtain the queue length distributions.We also obtain the mean of the busy period based on the renewal theory.

  20. Optymisation of equipment setup processes in enterprises

    Directory of Open Access Journals (Sweden)

    K. Grzybowska

    2012-10-01

    Full Text Available Fast equipment setup in a machine on production line is the key precondition to increase the fl exibility of the production. Methodology of SMED (Single Minute Exchange of Die is an example which allows reducing the time of setup practically to the minimum. The article presents the theoretical bases and required rules as well as case study conducted in one of chosen enterprises. This paper also answers the question if SMED methodology is applicable in metallurgical sector, presenting the example of shortening the time between the production of various metallurgical products manufactured in the machine for continuous casting of steel (COS in Polish.

  1. The Northern High Time Resolution Universe Pulsar Survey I: Setup and initial discoveries

    CERN Document Server

    Barr, Ewan D; Kramer, Michael; Eatough, Ralph P; Freire, Paulo C C; Karuppusamy, Ramesh; Lee, K J; Verbiest, Joris P W; Bassa, Cees G; Lyne, Andrew G; Stappers, Benjamin; Lorimer, Duncan R; Klein, Bernd

    2013-01-01

    We report on the setup and initial discoveries of the Northern High Time Resolution Universe survey for pulsars and fast transients, the first major pulsar survey conducted with the 100-m Effelsberg radio telescope and the first in 20 years to observe the whole northern sky at high radio frequencies. Using a newly developed 7-beam receiver system combined with a state-of-the-art polyphase filterbank, we record an effective bandwidth of 240 MHz in 410 channels centred on 1.36 GHz with a time resolution of 54 $\\mu$s. Such fine time and frequency resolution increases our sensitivity to millisecond pulsars and fast transients, especially deep inside the Galaxy, where previous surveys have been limited due to intra-channel dispersive smearing. To optimise observing time, the survey is split into three integration regimes dependent on Galactic latitude, with 1500-s, 180-s and 90-s integrations for latitude ranges $|b|15^{\\circ}$, respectively. The survey has so far resulted in the discovery of 15 radio pulsars, inc...

  2. A novel setup for time-resolved X-ray diffraction on gas gun experiments

    Science.gov (United States)

    Zucchini, Frédéric; Chauvin, Camille; Loyen, Arnaud; Combes, Philippe; Petit, Jacques; Bland, Simon

    2017-01-01

    Polymorphic phase transitions in metals have been investigated for a long time under dynamic loadings through usual dynamic compression diagnostics such as velocity and temperature measurements. Such measurements were valuable for revealing the key role of kinetic effects in most phase transition mechanisms. However, the information extracted was mostly macroscopic. Obtaining direct insight about the crystallographic structure under dynamic loadings is critical for understanding mechanisms governing shock-induced structural changes. For example, in order to evidence a mixture phase or to determine the time scale of a transition, structural information may be extremely valuable. Over the last 20 years a significant number of X-ray diffraction experiments were carried under dynamic loading, either using laboratory X-ray sources or synchrotron radiation. We are developing a novel experimental setup based on a compact High Pulsed Power generator capable of producing intense X radiation through an X-pinch X-ray source. This source is specifically designed for time-resolved X-ray diffraction in Bragg geometry on gas gun experiments. Promising preliminary diffraction data obtained under static conditions are presented.

  3. New scheduling rules for a dynamic flexible flow line problem with sequence-dependent setup times

    Science.gov (United States)

    Kia, Hamidreza; Ghodsypour, Seyed Hassan; Davoudpour, Hamid

    2017-01-01

    In the literature, the application of multi-objective dynamic scheduling problem and simple priority rules are widely studied. Although these rules are not efficient enough due to simplicity and lack of general insight, composite dispatching rules have a very suitable performance because they result from experiments. In this paper, a dynamic flexible flow line problem with sequence-dependent setup times is studied. The objective of the problem is minimization of mean flow time and mean tardiness. A 0-1 mixed integer model of the problem is formulated. Since the problem is NP-hard, four new composite dispatching rules are proposed to solve it by applying genetic programming framework and choosing proper operators. Furthermore, a discrete-event simulation model is made to examine the performances of scheduling rules considering four new heuristic rules and the six adapted heuristic rules from the literature. It is clear from the experimental results that composite dispatching rules that are formed from genetic programming have a better performance in minimization of mean flow time and mean tardiness than others.

  4. New scheduling rules for a dynamic flexible flow line problem with sequence-dependent setup times

    Science.gov (United States)

    Kia, Hamidreza; Ghodsypour, Seyed Hassan; Davoudpour, Hamid

    2017-01-01

    In the literature, the application of multi-objective dynamic scheduling problem and simple priority rules are widely studied. Although these rules are not efficient enough due to simplicity and lack of general insight, composite dispatching rules have a very suitable performance because they result from experiments. In this paper, a dynamic flexible flow line problem with sequence-dependent setup times is studied. The objective of the problem is minimization of mean flow time and mean tardiness. A 0-1 mixed integer model of the problem is formulated. Since the problem is NP-hard, four new composite dispatching rules are proposed to solve it by applying genetic programming framework and choosing proper operators. Furthermore, a discrete-event simulation model is made to examine the performances of scheduling rules considering four new heuristic rules and the six adapted heuristic rules from the literature. It is clear from the experimental results that composite dispatching rules that are formed from genetic programming have a better performance in minimization of mean flow time and mean tardiness than others.

  5. Sleep Management on Multiple Machines for Energy and Flow Time

    DEFF Research Database (Denmark)

    Chan, Sze-Hang; Lam, Tak-Wah; Lee, Lap Kei

    2011-01-01

    -time scheduling on multiple machines to take sleep management and energy into consideration. Specifically, we study online algorithms that can determine dynamically when and which subset of machines should wake up (or sleep), and how jobs are dispatched and scheduled. We consider schedules whose objective...

  6. LEAR: a machine ahead of its time

    CERN Multimedia

    Katarina Anthony

    2012-01-01

    Described as a “machine physicist's concert platform”, the Low Energy Antiproton Ring (LEAR) was everything at once: an accelerator, a storage ring, a decelerator, a cooler ring and a beam stretcher. 2012 marks the 30th anniversary of its start-up and an opportunity for the Bulletin to take a look back at the history of this remarkable machine.   This article is a tribute to Dieter Möhl, one of LEAR's founding fathers, who passed away at the end May.   Kilian's graph shows the phase space density of antiprotons produced from 26 GeV protons vs. antiproton momentum. Note that this density is significantly higher at low momentum for a decelerated beam. (Graph published in the 1977 "Low Energy Antiproton Factory" paper.) Like most great CERN projects, LEAR began with a dream and a coffee between colleagues. The year was 1976, the coffee was shared by Kurt Kilian and Diete...

  7. AN INVENTORY MODEL WITH REWORKING AND SETUP TIME TO CONSIDER EFFECT OF INFLATION AND TIME VALUE OF MONEY

    Directory of Open Access Journals (Sweden)

    IMAN SEYEDI

    2016-03-01

    Full Text Available This paper investigates the effect of inflation and time value of money on an economic production quantity (EPQ model in the single product system while the shortage of inventory is not allowed and production of defective parts during the production process and also setup time for reworking have been considered that can be non-zero. Studies show that considering the production of defective parts and reworking, the effect of inflation rate and the time value of money in EPQ model leads to change the optimal Production batch size. Since cost function is complex and finding the optimal solution is not simple, so in this study the approximate values of close to the optimal which obtained by Inventory-Total Cost chart, has been used of investigation of the effect of inflation and the time value of money on an economic quantity of production. Numerical calculations show that lack of attention to inflation and time value of money causes relatively high and unavoidably error in the cost.

  8. Controlling Mechatronic Set-up Using Real-time Linux and CTC ++

    NARCIS (Netherlands)

    Broenink, Johannes F.; Jovanovic, D.S.; Hilderink, G.H.; van Amerongen, J.; Jonker, B.; Regtien, P.; Stramigioli, S.

    2002-01-01

    The development of control software for mechatronic systems is presented by means of a case study: a 2 DOF mechanical rotational set-up usable as a camera-positioning device. The control software is generated using the code generation facility of 20-SIM, thus guaranteeing the generated code being

  9. Parallel-Machine Scheduling with Time-Dependent and Machine Availability Constraints

    Directory of Open Access Journals (Sweden)

    Cuixia Miao

    2015-01-01

    Full Text Available We consider the parallel-machine scheduling problem in which the machines have availability constraints and the processing time of each job is simple linear increasing function of its starting times. For the makespan minimization problem, which is NP-hard in the strong sense, we discuss the Longest Deteriorating Rate algorithm and List Scheduling algorithm; we also provide a lower bound of any optimal schedule. For the total completion time minimization problem, we analyze the strong NP-hardness, and we present a dynamic programming algorithm and a fully polynomial time approximation scheme for the two-machine problem. Furthermore, we extended the dynamic programming algorithm to the total weighted completion time minimization problem.

  10. An efficient genetic algorithm for a hybrid flow shop scheduling problem with time lags and sequence-dependent setup time

    Directory of Open Access Journals (Sweden)

    Farahmand-Mehr Mohammad

    2014-01-01

    Full Text Available In this paper, a hybrid flow shop scheduling problem with a new approach considering time lags and sequence-dependent setup time in realistic situations is presented. Since few works have been implemented in this field, the necessity of finding better solutions is a motivation to extend heuristic or meta-heuristic algorithms. This type of production system is found in industries such as food processing, chemical, textile, metallurgical, printed circuit board, and automobile manufacturing. A mixed integer linear programming (MILP model is proposed to minimize the makespan. Since this problem is known as NP-Hard class, a meta-heuristic algorithm, named Genetic Algorithm (GA, and three heuristic algorithms (Johnson, SPTCH and Palmer are proposed. Numerical experiments of different sizes are implemented to evaluate the performance of presented mathematical programming model and the designed GA in compare to heuristic algorithms and a benchmark algorithm. Computational results indicate that the designed GA can produce near optimal solutions in a short computational time for different size problems.

  11. Controlling Mechatronic Set-up Using Real-time Linux and CTC ++

    OpenAIRE

    Broenink, Johannes F.; Jovanovic, D.S.; Hilderink, G.H.; van Amerongen, J.; Jonker, B.; Regtien, P.; Stramigioli, S.

    2002-01-01

    The development of control software for mechatronic systems is presented by means of a case study: a 2 DOF mechanical rotational set-up usable as a camera-positioning device. The control software is generated using the code generation facility of 20-SIM, thus guaranteeing the generated code being the same as verified by simulation during the controller design phase. We use CTC++ (Communicating Threads for C++) as Communication Abstraction Layer to facilitate the conversion process from the bl...

  12. Unrelated Machine Scheduling with Stochastic Processing Times

    NARCIS (Netherlands)

    Skutella, Martin; Sviridenko, Maxim; Uetz, Marc

    2016-01-01

    Two important characteristics encountered in many real-world scheduling problems are heterogeneous processors and a certain degree of uncertainty about the processing times of jobs. In this paper we address both, and study for the first time a scheduling problem that combines the classical unrelated

  13. Unrelated Machine Scheduling with Stochastic Processing Times

    NARCIS (Netherlands)

    Skutella, Martin; Sviridenko, Maxim; Uetz, Marc Jochen

    Two important characteristics encountered in many real-world scheduling problems are heterogeneous processors and a certain degree of uncertainty about the processing times of jobs. In this paper we address both, and study for the first time a scheduling problem that combines the classical unrelated

  14. Semi on-line scheduling for maximizing the minimum machine completion time on three uniform machines

    Institute of Scientific and Technical Information of China (English)

    LUO Run-zi; SUN Shi-jie

    2005-01-01

    The paper investigates a semi on-line scheduling problem wherein the largest processing time of jobs done by three uniform machines M1, M2, M3 is known in advance. A speed si (s1=1, s2=r, s3=s, 1≤r≤s) is associated with machine Mi. Our goal is to maximize Cmin-the minimum workload of the three machines. We present a min3 algorithm and prove its competitive ratio is max {r+ 1,(3s+r+ 1)/(1 +r+s)}, with the lower bound being at least max {2,r}. We also claim the competitive ratio of min3 algorithn cannot be improved and is the best possible for 1≤s≤2, r=1.

  15. Hubble Space Telescope: A cosmic time machine

    Science.gov (United States)

    Westphal, J. A.; Harms, R. J.; Brandt, J. C.; Bless, R. C.; Macchetto, F. D.; Jefferys, W. H.

    1991-01-01

    The mission of the Hubble Space Telescope (HST) is to explore the expanding and evolving universe. During the 3,000 operating hours every year for the next 15 years or more, the HST will be used to study: galaxies; pulsars; globular clusters; neighboring stars where planets may be forming; binary star systems; condensing gas clouds and their chemical composition; and the rings of Saturn and the swirling ultraviolet clouds of Venus. The major technical achievements - its nearly perfect mirrors, its precise guidance system of rate gyroscopes, reaction wheels, star trackers, and fine guidance sensors are briefly discussed. The scientific instruments on board HST are briefly described. The integration of the equipment and instruments is outlined. The Space Telescope Science Institute (STScI) has approved time for 162 observations from among 556 proposals. The mission operation and data flow are explained.

  16. Time-series prediction and applications a machine intelligence approach

    CERN Document Server

    Konar, Amit

    2017-01-01

    This book presents machine learning and type-2 fuzzy sets for the prediction of time-series with a particular focus on business forecasting applications. It also proposes new uncertainty management techniques in an economic time-series using type-2 fuzzy sets for prediction of the time-series at a given time point from its preceding value in fluctuating business environments. It employs machine learning to determine repetitively occurring similar structural patterns in the time-series and uses stochastic automaton to predict the most probabilistic structure at a given partition of the time-series. Such predictions help in determining probabilistic moves in a stock index time-series Primarily written for graduate students and researchers in computer science, the book is equally useful for researchers/professionals in business intelligence and stock index prediction. A background of undergraduate level mathematics is presumed, although not mandatory, for most of the sections. Exercises with tips are provided at...

  17. The stopped-drop method: a novel setup for containment-free and time-resolved measurements

    Energy Technology Data Exchange (ETDEWEB)

    Schiener, Andreas; Seifert, Soenke; Magerl, Andreas

    2016-03-01

    A novel setup for containment-free time-resolved experiments at a free-hanging drop is reported. Within a dead-time of 100 ms a drop of mixed reactant solutions is formed and the time evolution of a reaction can be followed from thereon by various techniques. As an example, a small-angle X-ray scattering study on the formation mechanism of EDTA-stabilized CdS both at a synchrotron and a laboratory X-ray source is presented here. While the evolution can be followed with one drop only at a synchrotron source, a stroboscopic mode with many drops is preferable for the laboratory source.

  18. STEP-NC oriented parts setup planning based on machining feature clustering%面向STEP-NC基于加工特征规则聚类的零件装夹规划

    Institute of Scientific and Technical Information of China (English)

    欧阳华兵; 沈斌

    2012-01-01

    Aiming at the setup planning problem in parts process planning,a heuristic clustering setup planning solving method oriented to STEP-NC machining feature was proposed.Based on the analysis of STEP-NC data model and machining unit,a mathematical model for setup planning was established.The machining unit was clustered by using manufacturing priority rules of machining features,and the setup scheme set was formed.Through expert estimation and evaluating scheme,these setup scheme sets were ordered.Thus the setup planning scheme that accord with parts setup demand was generated.The concrete shape and stability of parts were considered and each unit’s locating surface as well as clamping surface were determined.Based on Solidworks 3D computer aided design platform,the generation of parts setup planning was realized.The proposed algorithm was verified by examples.%针对零件工艺规划过程中的装夹规划问题,提出一种面向STEP-NC加工特征的启发式聚类装夹规划求解方法。在分析STEP-NC数据模型和加工单元的基础上,建立了零件装夹规划的数学模型,基于加工特征制造优先级规则对加工单元进行聚类分组,形成零件的装夹方案集;随后通过专家打分和评定策略对这些装夹方案集进行排序,生成符合零件装夹要求的装夹规划方案。装夹规划考虑了零件的具体形状及其稳定性等多种约束条件,确定零件每一个加工单元的定位面和装夹面,较好地体现了零件实际加工过程中的装夹情况。基于Solid-works三维计算机辅助设计平台实现了零件装夹规划的生成,通过实例对所提算法进行了验证。

  19. Gott Time Machines, BTZ Black Hole Formation, and Choptuik Scaling

    CERN Document Server

    Birmingham, Daniel; Birmingham, Danny; Sen, Siddhartha

    2000-01-01

    We study the formation of BTZ black holes by the collision of point particles. It is shown that the Gott time machine, originally constructed for the case of vanishing cosmological constant, provides a precise mechanism for black hole formation. As a result, one obtains an exact analytic understanding of the Choptuik scaling.

  20. Gott time machines, BTZ black hole formation, and choptuik scaling

    Science.gov (United States)

    Birmingham; Sen

    2000-02-07

    We study the formation of Banados-Teitelboim-Zanelli black holes by the collision of point particles. It is shown that the Gott time machine, originally constructed for the case of vanishing cosmological constant, provides a precise mechanism for black hole formation. As a result, one obtains an exact analytic understanding of the Choptuik scaling.

  1. Machining automation: Doing it right the first time

    Energy Technology Data Exchange (ETDEWEB)

    Setter, D.L.

    1990-08-01

    The implementation of a machining automation program and of the Allied-Signal efforts to Do it Right the First Time'' is presented. The automation program is a Flexible Manufacturing System (FMS) for the machining and on-line inspection of a family of aluminum and stainless steel prismatic parts. The critical management and technical aspects found necessary to assure success in implementing large and risky automation programs are presented. The process being used is team based and has concentrated on involving the end users from the beginning.

  2. Hierarchical production planning model in flexible job shop including a preemption and sequence-dependent setup times

    Directory of Open Access Journals (Sweden)

    Juan Carlos Osorio Gómez

    2010-04-01

    Full Text Available Production planning and control are complex problems for manufacturing organisations. Hierarchical production planning and control is one way to address the problem as it can reduce its complexity and reach good solutions in reasonable computational time. This paper presents a hierarchical approach to resolving production programming in a flexible job shop configuration; this problem includes pre-emption and sequence-dependent setup times. Al-though non-optimal (as expected, good solutions were obtained as shown in the validation of the method.

  3. Online Scheduling on a Single Machine with Grouped Processing Times

    Directory of Open Access Journals (Sweden)

    Qijia Liu

    2015-01-01

    Full Text Available We consider the online scheduling problem on a single machine with the assumption that all jobs have their processing times in [p,(1+αp], where p>0 and α=(5-1/2. All jobs arrive over time, and each job and its processing time become known at its arrival time. The jobs should be first processed on a single machine and then delivered by a vehicle to some customer. When the capacity of the vehicle is infinite, we provide an online algorithm with the best competitive ratio of (5+1/2. When the capacity of the vehicle is finite, that is, the vehicle can deliver at most c jobs at a time, we provide another best possible online algorithm with the competitive ratio of (5+1/2.

  4. Designing and commissioning of a setup for timing-jitter measurements using electro-optic temporal decoding

    Energy Technology Data Exchange (ETDEWEB)

    Borissenko, Dennis

    2016-12-15

    Precise measurements of the arrival time jitter between the ionization laser, used to create the plasma, and the driver beam in the PWFA setup of the FLASHForward project are of high interest for the operation and optimization of the experiment. In this thesis, an electro-optic temporal decoding (EOTD) setup with near crossed polarizer detection scheme is presented, which can measure the timing-jitter to an accuracy of around 30 fs. This result was obtained during several measurements conducted at the coherent transition radiation beamline CTR141 at FLASH, using a 100 μm thick GaP crystal and coherent diffraction/transition radiation, generated from the FLASH1 electron bunches. Measurements were performed during long and short electron bunch operation at FLASH, showing that best results are obtained with CDR from long electron bunches. Utilizing CTR led to a higher EO signal and ''over-compensation'' of the SHG background level during the measurement, which resulted in a double-peak structure of the observed THz pulses. To resolve the single-cycle nature of these THz pulses, the SHG background had to be adjusted properly. Furthermore, EOTD measurements during a short bunch operation run at FLASH exhibited strong oscillations in the EO signal, which were suspected to come either from internal lattice resonances of the EO crystal or internal reflections, or excitation of water vapor in the humid air in the laboratory. The oscillations spoiled the observed EOTD trace leading to no sensible measurements of the arrival time jitter during this short bunch operation. To evaluate the capabilities of the setup for monitoring the timing jitter of short PWFA accelerated electron bunches or very short driver bunches at FLASHForward, further investigations on the observed oscillations in the EOTD traces have to be performed during short bunch operation at FLASH with different crystals and under vacuum conditions, to understand the oscillations of the EO

  5. Axially Symmetric Null Dust Space-Time, Naked Singularity, and Cosmic Time Machine

    National Research Council Canada - National Science Library

    Faizuddin Ahmed

    2017-01-01

    ... the cylinder which has closed orbits. The space-time admits closed timelike curves (CTCs) which develop at some particular moment in a causally well-behaved manner and may represent a Cosmic Time Machine...

  6. MARTI: man-machine animation real-time interface

    Science.gov (United States)

    Jones, Christian M.; Dlay, Satnam S.

    1997-05-01

    The research introduces MARTI (man-machine animation real-time interface) for the realization of natural human-machine interfacing. The system uses simple vocal sound-tracks of human speakers to provide lip synchronization of computer graphical facial models. We present novel research in a number of engineering disciplines, which include speech recognition, facial modeling, and computer animation. This interdisciplinary research utilizes the latest, hybrid connectionist/hidden Markov model, speech recognition system to provide very accurate phone recognition and timing for speaker independent continuous speech, and expands on knowledge from the animation industry in the development of accurate facial models and automated animation. The research has many real-world applications which include the provision of a highly accurate and 'natural' man-machine interface to assist user interactions with computer systems and communication with one other using human idiosyncrasies; a complete special effects and animation toolbox providing automatic lip synchronization without the normal constraints of head-sets, joysticks, and skilled animators; compression of video data to well below standard telecommunication channel bandwidth for video communications and multi-media systems; assisting speech training and aids for the handicapped; and facilitating player interaction for 'video gaming' and 'virtual worlds.' MARTI has introduced a new level of realism to man-machine interfacing and special effect animation which has been previously unseen.

  7. Cytomegalovirus DNA quantification using an automated platform for nucleic acid extraction and real-time PCR assay setup.

    Science.gov (United States)

    Forman, Michael; Wilson, Andy; Valsamakis, Alexandra

    2011-07-01

    Analytical performance characteristics of the QIAsymphony RGQ system with artus cytomegalovirus (CMV) reagents were determined. Measurable range spanned 2.0 to ≥ 7.0 log(10) copies/ml. The detection limit was 23 copies/ml. Intrarun and interrun coefficients of variation were ≤ 2.1% at 3.0 and 5.0 log(10) copies/ml. In clinical specimens, RGQ values were ~0.2 log(10) copies/ml higher than those in an assay using a BioRobot M48 extraction/manual reaction setup/7500 Real-Time PCR instrument. No cross-contamination was observed.

  8. Implementation of a combined SAXS/WAXS/QEXAFS set-up for time-resolved in situ experiments

    NARCIS (Netherlands)

    Nikitenko, Sergey; Beale, Andrew M.; van der Eerden, Ad M. J.; Jacques, Simon D. M.; Leynaud, Olivier; O'Brien, Matthew G.; Detollenaere, Dirk; Kaptein, Reinier; Weckhuysen, Bert M.; Bras, Wim

    2008-01-01

    It has previously been shown that there are many benefits to be obtained in combining several techniques in one in situ set-up to study chemical processes in action. Many of these combined set-ups make use of two techniques, but in some cases it is possible and useful to combine even more. A set-up

  9. Advanced GPS-Based Time Link Calibration with PTB’s New GPS Calibration Setup

    Science.gov (United States)

    2010-11-01

    and O. Koudelka, 2008, “Time transfer with nanosecond accuracy for the realization of International Atomic Time,” Metrologia , 45, 185- 198. [4] H...Observatory, Washington, D.C.), pp. 63-88. [14] P. Defraigne and G. Petit, 2004, “Time Transfer to TAI using geodetic receivers,” Metrologia , 40, 184-188

  10. Wormholes, time machines, and the weak energy condition

    OpenAIRE

    Morris, Michael S.; Thorne, Kip S.; Yurtsever, Ulvi

    1988-01-01

    It is argued that, if the laws of physics permit an advanced civilization to create and maintain a wormhole in space for interstellar travel, then that wormhole can be converted into a time machine with which causality might be violatable. Whether wormholes can be created and maintained entails deep, ill-understood issues about cosmic censorship, quantum gravity, and quantum field theory, including the question of whether field theory enforces an averaged version of the weak energy condition.

  11. Software architecture for time-constrained machine vision applications

    Science.gov (United States)

    Usamentiaga, Rubén; Molleda, Julio; García, Daniel F.; Bulnes, Francisco G.

    2013-01-01

    Real-time image and video processing applications require skilled architects, and recent trends in the hardware platform make the design and implementation of these applications increasingly complex. Many frameworks and libraries have been proposed or commercialized to simplify the design and tuning of real-time image processing applications. However, they tend to lack flexibility, because they are normally oriented toward particular types of applications, or they impose specific data processing models such as the pipeline. Other issues include large memory footprints, difficulty for reuse, and inefficient execution on multicore processors. We present a novel software architecture for time-constrained machine vision applications that addresses these issues. The architecture is divided into three layers. The platform abstraction layer provides a high-level application programming interface for the rest of the architecture. The messaging layer provides a message-passing interface based on a dynamic publish/subscribe pattern. A topic-based filtering in which messages are published to topics is used to route the messages from the publishers to the subscribers interested in a particular type of message. The application layer provides a repository for reusable application modules designed for machine vision applications. These modules, which include acquisition, visualization, communication, user interface, and data processing, take advantage of the power of well-known libraries such as OpenCV, Intel IPP, or CUDA. Finally, the proposed architecture is applied to a real machine vision application: a jam detector for steel pickling lines.

  12. An economic production model for deteriorating items and time dependent demand with rework and multiple production setups

    Science.gov (United States)

    Uthayakumar, R.; Tharani, S.

    2017-04-01

    Recently, much emphasis has given to study the control and maintenance of production inventories of the deteriorating items. Rework is one of the main issues in reverse logistic and green supply chain, since it can reduce production cost and the environmental problem. Many researchers have focused on developing rework model, but few of them have developed model for deteriorating items. Due to this fact, we take up productivity and rework with deterioration as the major concern in this paper. In this paper, a production-inventory model with deteriorative items in which one cycle has n production setups and one rework setup (n, 1) policy is considered for deteriorating items with stock-dependent demand in case 1 and exponential demand in case 2. An effective iterative solution procedure is developed to achieve optimal time, so that the total cost of the system is minimized. Numerical and sensitivity analyses are discussed to examine the outcome of the proposed solution procedure presented in this research.

  13. Um método para o cálculo do benefício econômico e definição da estratégia em trabalhos de redução do tempo de setup A method for the calculation of economic benefits and development of setup time reduction strategies

    Directory of Open Access Journals (Sweden)

    Mário Eduardo Pauka Reis

    2010-01-01

    Full Text Available Uma das bases da produção enxuta é o baixo tempo de setup, que pode ser obtido por soluções organizacionais de baixo custo e/ou de projeto de alto custo, tal como mudança de máquina. Quando a mudança de projeto se apresentar como a melhor solução, torna-se necessário o cálculo do ganho para se ter certeza da viabilidade econômica da ação. O presente artigo apresenta um método para se calcular o ganho da redução de tempo de setup e mostra em quais situações as soluções de projeto devem ser consideradas como a primeira opção. Um estudo de caso da implementação do método procura evidenciar a sua efetividade.One of the pillars of lean manufacturing is the low setup time that may be obtained by low cost organizational solutions and/or design such as relatively high cost machine modifications. When design change is the best solution, it is necessary to calculate the gains in order to be sure of the economic feasibility of the action. The present article introduces a method to calculate the gains originated from the reduction of setup time, and it defines the situations in which the project solutions may be considered as the first option. A case study was used to investigate the effectiveness of such method.

  14. BCG2 data session setup facilitated by real-time measurement

    NARCIS (Netherlands)

    Zhang, H.; Oostveen, J.C.; Litjens, R.

    2012-01-01

    In this document, we propose two approaches of obtaining radio distance between data cells (especially inactive ones) and terminal via real-time measurement. One approach is via terminals measurement of downlink beacon signals broadcast by inactive cells, showing their presence in the network. The o

  15. The advancement of regulation fee, budget system, and set-up time management

    Energy Technology Data Exchange (ETDEWEB)

    Jung, J. S.; Choi, E. S.; Cho, J. I.; Jung, S. C.; Lee, J. H. [Caleb and Company, Seoul (Korea, Republic of)

    2001-07-15

    Analyze the government's charging fee amendment and suggest the national regulation fee system. Suggest the future business portfolio based in the current business analysis. Design the advanced budget code structure, the performance management of the project budget and the survice level agreement between divisions. Develop the time management and the methodology of the standard man-hour calculation.

  16. Time machines and traversable wormholes in modified theories of gravity

    Directory of Open Access Journals (Sweden)

    Lobo Francisco S.N.

    2013-09-01

    Full Text Available We review recent work on wormhole geometries in the context of modified theories of gravity, in particular, in f(R gravity and with a nonminimal curvature-matter coupling, and in the recently proposed hybrid metric-Palatini theory. In principle, the normal matter threading the throat can be shown to satisfy the energy conditions and it is the higher order curvatures terms that sustain these wormhole geometries. We also briefly review the conversion of wormholes into time-machines, explore several of the time travel paradoxes and possible remedies to these intriguing side-effects in wormhole physics.

  17. Geometry of historical epoch, the Alexandrov's problem and non-G\\"odel quantum time machine

    CERN Document Server

    Guts, Alexander K

    2016-01-01

    The new quantum principle of a time machine that is not using a smooth timelike loops in Lorentz manifolds is described. The proposed time machine is based on the destruction of interference of quantum superposition states in the Wheeler superspace.

  18. A flexible experimental setup for femtosecond time-resolved broad-band ellipsometry and magneto-optics

    Energy Technology Data Exchange (ETDEWEB)

    Boschini, F.; Hedayat, H.; Piovera, C.; Dallera, C. [Dipartimento di Fisica, Politecnico di Milano, p.zza Leonardo da Vinci 32, 20133 Milano (Italy); Gupta, A. [Department of Chemistry, University of Alabama, Tuscaloosa, Alabama 35487 (United States); Carpene, E., E-mail: ettore.carpene@polimi.it [CNR-IFN, Dipartimento di Fisica, Politecnico di Milano, p.zza Leonardo da Vinci 32, 20133 Milano (Italy)

    2015-01-15

    A versatile experimental setup for femtosecond time-resolved ellipsometry and magneto-optical Kerr effect measurements in the visible light range is described. The apparatus is based on the pump-probe technique and combines a broad-band probing beam with an intense near-infrared pump. According to Fresnel scattering matrix formalism, the analysis of the reflected beam at different polarization states of the incident probe light allows one to determine the diagonal and the off-diagonal elements of the dielectric tensor in the investigated sample. Moreover, the pump-probe method permits to study the dynamics of the dielectric response after a short and intense optical excitation. The performance of the experimental apparatus is tested on CrO{sub 2} single crystals as a benchmark.

  19. Development of windows based software to analyze fluorescence decay with time-correlated single photon counting (TCSPC) setup

    CERN Document Server

    Mallick, M B; Ravindranath, S V G

    2002-01-01

    A VUV spectroscopic facility for studies in photophysics and photochemistry is being set up at INDUS-I synchrotron source, CAT, Indore. For this purpose, a data acquisition system based on time-correlated single photon counting method is being developed for fluorescence lifetime measurement. To estimate fluorescence lifetime from the data collected with this sytem, a Windows based program has been developed using Visual Basic 5.0. It uses instrument response function (IRF) and observed decay curve and estimates parameters of single exponential decay by least square analysis and Marquardt method as convergence mechanism. Estimation of parameters was performed using data collected with a commercial setup. Goodness of fit was judged by evaluating chi R sup 2 , weighted residuals and autocorrelation function. Performance is compared with two commercial software packages and found to be satisfactory.

  20. The high performing backtracking algorithm and heuristic for the sequence-dependent setup times flowshop problem with total weighted tardiness

    Science.gov (United States)

    Zheng, Jun-Xi; Zhang, Ping; Li, Fang; Du, Guang-Long

    2016-09-01

    Although the sequence-dependent setup times flowshop problem with the total weighted tardiness minimization objective exists widely in industry, work on the problem has been scant in the existing literature. To the authors' best knowledge, the NEH?EWDD heuristic and the Iterated Greedy (IG) algorithm with descent local search have been regarded as the high performing heuristic and the state-of-the-art algorithm for the problem, which are both based on insertion search. In this article firstly, an efficient backtracking algorithm and a novel heuristic (HPIS) are presented for insertion search. Accordingly, two heuristics are introduced, one is NEH?EWDD with HPIS for insertion search, and the other is the combination of NEH?EWDD and both the two methods. Furthermore, the authors improve the IG algorithm with the proposed methods. Finally, experimental results show that both the proposed heuristics and the improved IG (IG*) significantly outperform the original ones.

  1. Experiences in set-up and usage of a geodetic real-time differential correction network

    Science.gov (United States)

    Martin, Sven; Jahn, Cord-Hinrich

    2000-10-01

    Global Navigation Satellite Systems (GNSS) are commonly used for geodetic and land surveying applications. The stand alone accuracy provided by these GNSS are insufficient for the majority of these operations (GPS, 1995), therefore some form of differential correction method is required. Accordingly, the state survey offices of Germany have installed a differential correction service for geodetic applications. Code- and phase-corrections are broadcast in the VHF-band using the RTCM V2.1 format (RTCM, 1994). One major problem is that the accuracy depends on the distance to a reference station (length of baseline) because of residual orbit and atmospheric biases. To achieve a more precise solution, a number of reference stations are connected together to form a network. Within this network these influences are computed and a set of "area correction parameters" are also transmitted in RTCM message Type 59. Field trials and measurements have confirmed the high accuracy of this service. This paper describes the system itself, investigations of communication methods as well as site planning. In addition measurements from field trials will be presented to demonstrate the high accuracy in a real-time environment.

  2. PENERAPAN METODE JUST-IN-TIME DENGAN PEMBAKUAN KEGIATAN DAN MINIMASI WAKTU SET-UP PADA BAGIAN PERMESINAN PEMBUATAN PRODUK GT 060

    Directory of Open Access Journals (Sweden)

    Indah Pratiwi

    2007-08-01

    Full Text Available Membuat produk dalam jumlah banyak menyebabkan pemborosan yang dapat mengurangi efisiensi produksi. Aktivitas yang paling banyak membuang waktu adalah aktivitas set-up mesin, untuk mengatasi masalah ini maka perlu diterapkan metode just-in-time dengan pembakuan kegiatan dan minimasi waktu set-up dengan mengambil kondisi real yang ada pada lantai produksi. Penelitian dilakukan di CV. Roda Jati, data yang digunakan adalah waktu penyelesaian komponen frame ujung produk GT 060 pada bagian permesinan dan waktu set-up mesin. Analisa meliputi : urutan kegiatan sekarang, usulan pembakuan kegiatan, perbaikan pembakuan kegiatan menggunakan minimasi waktu set-up, analisa menggunakan prinsip 5S. Hasil dari pengamatan didapatkan pembakuan kegiatan pada bagian permesinan dan mengurangi waktu set-up mesin. Waktu yang digunakan untuk memproduksi komponen tersebut sebelum dilakukan pembakuan kegiatan sebesar 4655,42 detik dan mengalami penurunan menjadi 4635,08 detik. Setelah dilakukan minimasi waktu set-up maka mengalami penurunan lagi mejadi sebesar 4296,31detik. Agar proses dapat selesai tepat waktu maka operator harus mentaati kegiatan yang telah dibakukan perusahaan dan dilakukan minimasi waktu set-up sebelum melakukan pekerjaan. Mempromosikan program 5S agar pekerja membiasakan diri untuk menjaga kerapian, kebersihan dan kedisplinan pada waktu berkerja.

  3. Execution time support for scientific programs on distributed memory machines

    Science.gov (United States)

    Berryman, Harry; Saltz, Joel; Scroggs, Jeffrey

    1990-01-01

    Optimizations are considered that are required for efficient execution of code segments that consists of loops over distributed data structures. The PARTI (Parallel Automated Runtime Toolkit at ICASE) execution time primitives are designed to carry out these optimizations and can be used to implement a wide range of scientific algorithms on distributed memory machines. These primitives allow the user to control array mappings in a way that gives an appearance of shared memory. Computations can be based on a global index set. Primitives are used to carry out gather and scatter operations on distributed arrays. Communications patterns are derived at runtime, and the appropriate send and receive messages are automatically generated.

  4. Improving the Timing of Extended Finite State Machines Via Catalyst

    Directory of Open Access Journals (Sweden)

    Shi-Yu Huang

    2002-01-01

    Full Text Available We propose a timing optimization technique for a complex finite state machine that consists of not only random logic but also data operators. In such a design, the timing critical path often forms a cycle and thus cannot be cut down easily by popular techniques such as pipelining or retiming. The proposed technique, based on the concept of catalyst, adds a functionally redundant block—which includes a piece of combinational logic and several other registers—to the circuits under consideration so that the timing critical paths are divided into stages. During this transformation, the circuit's functionality is not affected, while the speed is improved significantly. This technique has been successfully applied to an industrial application—a Built-In Self-Test (BIST circuit for static random access memories (SRAMs. The synthesis result indicates a 47% clock cycle time reduction.

  5. Set-up errors analyses in IMRT treatments for nasopharyngeal carcinoma to evaluate time trends, PTV and PRV margins

    Energy Technology Data Exchange (ETDEWEB)

    Mongioj, Valeria (Dept. of Medical Physics, Fondazione IRCCS Istituto Nazionale Tumori, Milan (Italy)), e-mail: valeria.mongioj@istitutotumori.mi.it; Orlandi, Ester (Dept. of Radiotherapy, Fondazione IRCCS Istituto Nazionale Tumori, Milan (Italy)); Palazzi, Mauro (Dept. of Radiotherapy, A.O. Niguarda Ca' Granda, Milan (Italy)) (and others)

    2011-01-15

    Introduction. The aims of this study were to analyze the systematic and random interfractional set-up errors during Intensity Modulated Radiation Therapy (IMRT) in 20 consecutive nasopharyngeal carcinoma (NPC) patients by means of Electronic Portal Images Device (EPID), to define appropriate Planning Target Volume (PTV) and Planning Risk Volume (PRV) margins, as well as to investigate set-up displacement trend as a function of time during fractionated RT course. Material and methods. Before EPID clinical implementation, an anthropomorphic phantom was shifted intentionally 5 mm to all directions and the EPIs were compared with the digitally reconstructed radiographs (DRRs) to test the system's capability to recognize displacements observed in clinical studies. Then, 578 clinical images were analyzed with a mean of 29 images for each patient. Results. Phantom data showed that the system was able to correct shifts with an accuracy of 1 mm. As regards clinical data, the estimated population systematic errors were 1.3 mm for left-right (L-R), 1 mm for superior-inferior (S-I) and 1.1 mm for anterior-posterior (A-P) directions, respectively. Population random errors were 1.3 mm, 1.5 mm and 1.3 mm for L-R, S-I and A-P directions, respectively. PTV margin was at least 3.4, 3 and 3.2 mm for L-R, S-I and A-P direction, respectively. PRV margins for brainstem and spinal cord were 2.3, 2 and 2.1 mm and 3.8, 3.5 and 3.2 mm for L-R, A-P and S-I directions, respectively. Set-up error displacements showed no significant changes as the therapy progressed (p>0.05), although displacements >3 mm were found more frequently when severe weight loss or tumor nodal shrinkage occurred. Discussion. These results enable us to choose margins that guarantee with sufficient accuracy the coverage of PTVs and organs at risk sparing. Collected data confirmed the need for a strict check of patient position reproducibility in case of anatomical changes

  6. Optimization-based manufacturing scheduling with multiple resources and setup requirements

    Science.gov (United States)

    Chen, Dong; Luh, Peter B.; Thakur, Lakshman S.; Moreno, Jack, Jr.

    1998-10-01

    The increasing demand for on-time delivery and low price forces manufacturer to seek effective schedules to improve coordination of multiple resources and to reduce product internal costs associated with labor, setup and inventory. This study describes the design and implementation of a scheduling system for J. M. Product Inc. whose manufacturing is characterized by the need to simultaneously consider machines and operators while an operator may attend several operations at the same time, and the presence of machines requiring significant setup times. The scheduling problem with these characteristics are typical for many manufacturers, very difficult to be handled, and have not been adequately addressed in the literature. In this study, both machine and operators are modeled as resources with finite capacities to obtain efficient coordination between them, and an operator's time can be shared by several operations at the same time to make full use of the operator. Setups are explicitly modeled following our previous work, with additional penalties on excessive setups to reduce setup costs and avoid possible scraps. An integer formulation with a separable structure is developed to maximize on-time delivery of products, low inventory and small number of setups. Within the Lagrangian relaxation framework, the problem is decomposed into individual subproblems that are effectively solved by using dynamic programming with additional penalties embedded in state transitions. Heuristics is then developed to obtain a feasible schedule following on our previous work with new mechanism to satisfy operator capacity constraints. The method has been implemented using the object-oriented programming language C++ with a user-friendly interface, and numerical testing shows that the method generates high quality schedules in a timely fashion. Through simultaneous consideration of machines and operators, machines and operators are well coordinated to facilitate the smooth flow of

  7. ON THE COMPLETION TIME AND THE INTERRUPTION TIME OF A JOB PROCESSED ON AN UNRELIABLE MACHINE

    Institute of Scientific and Technical Information of China (English)

    YUE Dequan; TU Fengsheng

    2005-01-01

    This paper considers the completion time and the interruption time of a job processed on an unreliable machine.By using the general theory of stochastic orderings,we obtain the closure properties of the distribution of the completion time and the interruption time on L+ and PH life distribution classes.We get an exponential bound for the tail probability of the interruption time.

  8. Convex quadratic programming relaxations for parallel machine scheduling with controllable processing times subject to release times

    Institute of Scientific and Technical Information of China (English)

    ZHANG Feng; CHEN Feng; TANG Guochun

    2004-01-01

    Scheduling unrelated parallel machines with controllable processing times subject to release times is investigated. Based on the convex quadratic programming relaxation and the randomized rounding strategy, a 2-approximation algorithm is obtained for a special case with the all-or-none property and then a 3-approximation algorithm is presented for general problem.

  9. Wave-Based Turing Machine: Time Reversal and Information Erasing.

    Science.gov (United States)

    Perrard, S; Fort, E; Couder, Y

    2016-08-26

    The investigation of dynamical systems has revealed a deep-rooted difference between waves and objects regarding temporal reversibility and particlelike objects. In nondissipative chaos, the dynamic of waves always remains time reversible, unlike that of particles. Here, we explore the dynamics of a wave-particle entity. It consists in a drop bouncing on a vibrated liquid bath, self-propelled and piloted by the surface waves it generates. This walker, in which there is an information exchange between the particle and the wave, can be analyzed in terms of a Turing machine with waves as the information repository. The experiments reveal that in this system, the drop can read information backwards while erasing it. The drop can thus backtrack on its previous trajectory. A transient temporal reversibility, restricted to the drop motion, is obtained in spite of the system being both dissipative and chaotic.

  10. Wave-Based Turing Machine: Time Reversal and Information Erasing

    Science.gov (United States)

    Perrard, S.; Fort, E.; Couder, Y.

    2016-08-01

    The investigation of dynamical systems has revealed a deep-rooted difference between waves and objects regarding temporal reversibility and particlelike objects. In nondissipative chaos, the dynamic of waves always remains time reversible, unlike that of particles. Here, we explore the dynamics of a wave-particle entity. It consists in a drop bouncing on a vibrated liquid bath, self-propelled and piloted by the surface waves it generates. This walker, in which there is an information exchange between the particle and the wave, can be analyzed in terms of a Turing machine with waves as the information repository. The experiments reveal that in this system, the drop can read information backwards while erasing it. The drop can thus backtrack on its previous trajectory. A transient temporal reversibility, restricted to the drop motion, is obtained in spite of the system being both dissipative and chaotic.

  11. STABILITY OF MOTION OF MOBILE MODULE OF EXPERIMENTAL SETUP IN THE STUDY OF ACTIVE ROTARY WORKING OF MACHINES FOR SOIL TREATMENT

    Directory of Open Access Journals (Sweden)

    Vladimir F. Kupryashkin

    2016-06-01

    Full Text Available Introduction. The paper is devoted to the theoretical study of stability of movement of the movable unit of the experimental setup intended for the exploration of the active rotational working organs of the car for soil treatment. This takes into account the design features of the mobile unit and features active rotary force interaction of working bodies with the soil. From the analysis of previously conducted both theoretical and experimental studies of this type of working bodies noted the possibility of breaking the stability of the mobile stroke unit, which in turn will have a negative impact on the enforcement of a given method of the experiment program. From the analysis of previous studies shows that the assumptions under which they were made, not allow you to fully take into account the nature of the effect occurring dynamic processes of interaction of active rotary working bodies with the soil on the experimental setup truck driving stability. Materials and Methods. To address the shortcomings in the research, based on a synthesis of the main provisions and laws of mechanics and the experimental data of active rotary force interaction of working bodies with the soil, carried out theoretical studies of stability of movement of the movable unit of the experimental setup in view of its design features and conditions of the experiment. Results. A theoretical study was composed of loading trolley design scheme of the experimental setup with regard to its design features and power factors acting on its working elements, namely, the wheel bearing and studied active rotary working bodies. Processing results of the study allowed the weary twist zone of stable and unstable movement of the movable unit Expo tal installation. The presence of unstable movement zone carts at-leads to a breach of the conditions set by the plan of experimental-governmental research and a negative impact on their quality and purity. Discussion and Conclusions. All of

  12. HVMTP: A time predictable and portable java virtual machine for hard real-time embedded systems

    DEFF Research Database (Denmark)

    Luckow, Kasper Søe; Thomsen, Bent; Korsholm, Stephan

    2016-01-01

    We present HVMTP, a time predictable and portable Java virtual machine (JVM) implementation with applications in resource-constrained, hard real-time embedded systems, which implements all levels of the safety critical Java (SCJ) specification. Time predictability is achieved by a combination...... can be obtained using the tool TETASARTSJVM. The timing model readily integrates with the rest of the TETASARTS tool set for temporal verification of SCJ systems. We will also show how a complete timing scheme in terms of safe worst-case execution times and best-case execution times of the Java...

  13. Scheduling Jobs with Variable Job Processing Times on Unrelated Parallel Machines

    Directory of Open Access Journals (Sweden)

    Guang-Qian Zhang

    2014-01-01

    Full Text Available m unrelated parallel machines scheduling problems with variable job processing times are considered, where the processing time of a job is a function of its position in a sequence, its starting time, and its resource allocation. The objective is to determine the optimal resource allocation and the optimal schedule to minimize a total cost function that dependents on the total completion (waiting time, the total machine load, the total absolute differences in completion (waiting times on all machines, and total resource cost. If the number of machines is a given constant number, we propose a polynomial time algorithm to solve the problem.

  14. Cyclic flow shop scheduling problem with two-machine cells

    Directory of Open Access Journals (Sweden)

    Bożejko Wojciech

    2017-06-01

    Full Text Available In the paper a variant of cyclic production with setups and two-machine cell is considered. One of the stages of the problem solving consists of assigning each operation to the machine on which it will be carried out. The total number of such assignments is exponential. We propose a polynomial time algorithm finding the optimal operations to machines assignment.

  15. Semi On-line Scheduling Problem for Maximizing the Minimum Machine Completion Time on m Identical Machines

    Institute of Scientific and Technical Information of China (English)

    罗润梓; 孙世杰

    2005-01-01

    In this paper, a semi on-line version on m identical machines M1 , M2, …, Mm ( m ≥ 3 ) was considered, where the processing time of the largest job is known in advance. Our goal is to maximize the minimum machine load, an NPLS algorithm was presented and its worst-case ratio was proved to be equal to m - 1 which is the best possible value. It is concluded that if the total processing time of jobs is also known to be greater than (2 m - 1 )Pmax where pmax is the largest job's processing time, then the worstcase ratio is 2 - 1/m.

  16. TIME ANALYSIS ACCORDING TO PART PROGRAMS ON A CNC VERTICAL MACHINING CENTER

    Directory of Open Access Journals (Sweden)

    Ahmet Murat PİNAR

    2002-01-01

    Full Text Available In this study, a program examining the CNC programs in the control unit of Dyna Myte 2900 Vertical Machining Center and calculating the machining time and rapid movement time of the cutting tools has been developed. The workpiece program to be examined is transferred to CNC code editor by the user manually, by a computer file with a diskette, or through hard disk or the machine tool. By examining all the movements of the cutting tools, detailed machining time, rapid movement time or total time is served to the user. So that, an important part of workpiece cost analysis information is provided.

  17. A new experimental setup for the time resolved x-ray diffraction study of self-propagating high-temperature synthesis

    Science.gov (United States)

    Vrel, D.; Girodon-Boulandet, N.; Paris, S.; Mazué, J. F.; Couqueberg, E.; Gailhanou, M.; Thiaudière, D.; Gaffet, E.; Bernard, F.

    2002-02-01

    A new experimental setup for time resolved x-ray diffraction is described. Designed for the LURE H10 beamline and its 4 (+2) circles goniometer, it allows simultaneous recordings of x-ray patterns with a rate of 30 patterns per second, a maximum 2θ range of 120°, infrared thermography at the same rate, and thermocouples readings at a frequency of up to 3×104 Hz. Preliminary results obtained using this setup are presented, showing how it is possible to analyze a solid-solid or solid-liquid reaction. As an example, an in situ study of phase transformation and temperature evolution during the self-sustaining synthesis of an FeAl intermetallic compound starting from a mechanically activated mixture is investigated. The versatility of the setup was proved and could even be enhanced by the design of new sample holders, thus expanding its area of use at low cost.

  18. 面向可重构机床配置合成的装夹规划方法%Setup planning method for configuration synthesis of reconfigurable machine tools

    Institute of Scientific and Technical Information of China (English)

    马丽梅; 李建勇; 徐文胜

    2012-01-01

    According to the definition and classification of machining feature(MF) ,the part was decomposed into machining feature set. The information of MF was expand based on the embedded feature model, and formed enriched machining feature(EMF) .Then the extended element model(EEM) and XML description method were proposed'Jto support its implementation. Using extended-hybrid graph theory and heuristic algorithm, a new approach of setup planning for RMT configuration synthesis was proposed. Finally,a standard case study was used to validate its feasibility and effectiveness.%基于加工特征的定义与分类,将零件分解为一系列加工特征集合,在嵌入式特征模型的基础上,对加工特征的信息进行扩展,建立了基于富集加工特征的可拓基元模型及基于XML的描述方法,提出了基于拓展混合图论与启发式算法相结合的装夹规划方法,并通过标准实例验证了该方法的可行性与有效性.

  19. Design of a modular and versatile interlock system for ultrahigh vacuum machines: A crossed molecular beam setup as a case study

    Science.gov (United States)

    Guo, Ying; Gu, Xibin; Kawamura, Ed; Kaiser, Ralf I.

    2006-03-01

    The design of a modular, versatile interlock system for ultrahigh vacuum machines is presented. This system can monitor the pressure (ultrahigh vacuum and high vacuum), the status of the power (power failure, power fluctuations, and scheduled power outages), the operation mode of the pumps (operation versus failure), the flow of cooling water, the humidity and temperature levels in the laboratory, as well as the concentration of toxic gases. If any of the set points is triggered, the vacuum machine is protected fully automatically. The interlock system is also interfaced to an automated paging system, thus transmitting a pager signal to the person on duty. Since the interlock system is modular in nature, it can be expanded and be adapted stepwise to incorporate additional safety and monitoring functions as needed.

  20. Real-Time Compensation of Chatter Vibration in Machine Tools

    Directory of Open Access Journals (Sweden)

    Dong-Hoon Kim

    2013-05-01

    Full Text Available The chatter vibration stands for a sudden relative vibration appeared between a material and a tool while processing with a machine. This vibration is a factor that seriously affects the quality of processed materials as well as being a factor which causes serious damages to the tool and the machine. This study is related to the detection and compensation of chatter vibration that can compensate chatter vibration faster and produce processed goods with more precision by autonomous compensation. The above-mentioned chatter vibration compensator includes the chatter vibration sensor and the chatter compensator that estimates the compensation value according to the sensor detecting the chatter vibration of machine tool and the chatter vibration detected from the sensor while having a feature of being organized by interlocking with the machine tool controller.

  1. Time machines with the compactly determined Cauchy horizon

    CERN Document Server

    Krasnikov, S

    2014-01-01

    The building of a time machine, if possible at all, requires the relevant regions of spacetime to be compact (that is, physically speaking, free from sources of unpredictability such as infinities and singularities). Motivated by this argument we consider the spacetimes with the compactly determined Cauchy horizons (CDCHs), the defining property of which is the compactness of $\\overline{J^-(\\EuScript U)}\\cap J^+(\\EuScript S_0)$, where $\\EuScript U$ is an open subset of the Cauchy horizon and $\\EuScript S_0$ is a Cauchy surface of the initial globally hyperbolic region $\\ingh$. The following two facts are established: 1) $\\ingh$ has no globally hyperbolic maximal extension. This means that by shaping appropriately a precompact portion of a globally hyperbolic region one can \\emph{force} the Universe to produce either a closed causal curve, or a quasiregular singularity, whichever it abhors less; 2) Before a CDCH is formed a null geodesic appears which infinitely approaches the horizon returning again and again...

  2. River flow time series using least squares support vector machines

    Science.gov (United States)

    Samsudin, R.; Saad, P.; Shabri, A.

    2011-06-01

    This paper proposes a novel hybrid forecasting model known as GLSSVM, which combines the group method of data handling (GMDH) and the least squares support vector machine (LSSVM). The GMDH is used to determine the useful input variables which work as the time series forecasting for the LSSVM model. Monthly river flow data from two stations, the Selangor and Bernam rivers in Selangor state of Peninsular Malaysia were taken into consideration in the development of this hybrid model. The performance of this model was compared with the conventional artificial neural network (ANN) models, Autoregressive Integrated Moving Average (ARIMA), GMDH and LSSVM models using the long term observations of monthly river flow discharge. The root mean square error (RMSE) and coefficient of correlation (R) are used to evaluate the models' performances. In both cases, the new hybrid model has been found to provide more accurate flow forecasts compared to the other models. The results of the comparison indicate that the new hybrid model is a useful tool and a promising new method for river flow forecasting.

  3. Fast setup time characterization of static random access memory based on search-delay%基于时延搜索的SRAM建立时间快速提取方法

    Institute of Scientific and Technical Information of China (English)

    黄雪维; 张培勇; 吕冬明; 郑丹丹; 严晓浪

    2011-01-01

    The amount of embedded memory in system-on-chip designs has been increasing rapidly, which demands faster and more accurate characterization of static random access memory (SRAM) setup time.Traditional approach (search based for setup time, sbSetup) affects the time to market since the simulation consumes too much time.A novel methodology was proposed to characterize setup time for SRAM-sdbSetup(search-delay-based-setup-time).The methodology analyzes and extractes partial circuits that have great impact on setup time for simulation instead of the traditional entire circuit topology simulation approach, thereby determines more precise timing window for dichotomizing characterization of setup time based on the path delay calculation methodology.Moreover, this work characterized the setup time for SRAM, aside from an accurate setup time, sdbSetup also improves run-time 60 times comparing with the traditional approach.%片上系统包含的嵌入式存储器数量在迅速增加,这需要高速的提取静态随机存储器(SRAM)时序的方法.传统的SRAM建立时间提取方法(search based for setup time,sbSetup)耗时过大,严重影响了定制电路SRAM的设计周期.针对该问题提出一种基于时延搜索的SRAM建立时间快速提取方法(search delay based for setup time,sdbSetup)+该方法通过仿真影响建立时间的局部电路,并利用基于路径延时方法(delay based for setup time,dbSetup)来确定比较精确的时间窗,再运用二分迭代法来提取建立时间.该方法从减少仿真电路的规模和确定精确的时间窗两个方面来优化提取时间.仿真实验表明:与sbSetup方法相比,sdbSetup方法不仅能提供准确的建立时间,而且提取速度平均提高了60倍.

  4. Single-machine batch scheduling minimizing weighted flow times and delivery costs with job release times

    Directory of Open Access Journals (Sweden)

    Amir Ebrahimzadeh Pilerood

    2012-04-01

    Full Text Available This paper addresses scheduling a set of weighted jobs on a single machine in presence of release date for delivery in batches to customers or to other machines for further processing. The problem is a natural extension of minimizing the sum of weighted flow times by considering the possibility of delivering jobs in batches and introducing batch delivery costs. The classical problem is NP-hard and then the extended version of the problem is NP-hard. The objective function is that of minimizing the sum of weighted flow times and delivery costs. The extended problem arises in a real supply chain network by cooperation between two layers of chain. Structural properties of the problem are investigated and used to devise a branch-and-bound solution scheme. Computational experiments show the efficiency of suggested algorithm for solving instances up to 40 jobs.

  5. Time machine tales the science fiction adventures and philosophical puzzles of time travel

    CERN Document Server

    Nahin, Paul J

    2017-01-01

    This book contains a broad overview of time travel in science fiction, along with a detailed examination of the philosophical implications of time travel. The emphasis of this book is now on the philosophical and on science fiction, rather than on physics, as in the author's earlier books on the subject. In that spirit there are, for example, no Tech Notes filled with algebra, integrals, and differential equations, as there are in the first and second editions of TIME MACHINES. Writing about time travel is, today, a respectable business. It hasn’t always been so. After all, time travel, prima facie, appears to violate a fundamental law of nature; every effect has a cause, with the cause occurring before the effect. Time travel to the past, however, seems to allow, indeed to demand, backwards causation, with an effect (the time traveler emerging into the past as he exits from his time machine) occurring before its cause (the time traveler pushing the start button on his machine’s control panel to start his...

  6. Electronic setup for fluorescence emission measurements and long-time constant-temperature maintenance of Single-Walled Carbon Nano-Tubes in water solutions

    Directory of Open Access Journals (Sweden)

    De Rosa Matteo

    2017-03-01

    Full Text Available In our previous research we have observed that the fluorescence emission from water solutions of Single-Walled Carbon Nano-Tubes (SWCNT, excited by a laser with a wavelength of 830nm, diminishes with the time. We have already proved that such a fading is a function of the storage time and the storage temperature. In order to study the emission of the SWCNT as a function of these two parameters we have designed and realized a special measurement compartment with a cuvette holder where the SWCNT solutions can be measured and stored at a fixed constant temperature for periods of time as long as several weeks. To maintain the measurement setup under a constant temperature we have designed special experimental setup based on two Peltier cells with electronic temperature control.

  7. Electronic setup for fluorescence emission measurements and long-time constant-temperature maintenance of Single-Walled Carbon Nano-Tubes in water solutions

    Science.gov (United States)

    De Rosa, Matteo; De Nardo, Laura; Bello, Michele; Uzunov, Nikolay

    2017-03-01

    In our previous research we have observed that the fluorescence emission from water solutions of Single-Walled Carbon Nano-Tubes (SWCNT), excited by a laser with a wavelength of 830nm, diminishes with the time. We have already proved that such a fading is a function of the storage time and the storage temperature. In order to study the emission of the SWCNT as a function of these two parameters we have designed and realized a special measurement compartment with a cuvette holder where the SWCNT solutions can be measured and stored at a fixed constant temperature for periods of time as long as several weeks. To maintain the measurement setup under a constant temperature we have designed special experimental setup based on two Peltier cells with electronic temperature control.

  8. Ball machine usage in tennis: movement initiation and swing timing while returning balls from a ball machine and from a real server.

    Science.gov (United States)

    Carboch, Jan; Süss, Vladimir; Kocib, Tomas

    2014-05-01

    Practicing with the use of a ball machine could handicap a player compared to playing against an actual opponent. Recent studies have shown some differences in swing timing and movement coordination, when a player faces a ball projection machine as opposed to a human opponent. We focused on the time of movement initiation and on stroke timing during returning tennis serves (simulated by a ball machine or by a real server). Receivers' movements were measured on a tennis court. In spite of using a serving ball speed from 90 kph to 135 kph, results showed significant differences in movement initiation and backswing duration between serves received from a ball machine and serves received from a real server. Players had shorter movement initiation when they faced a ball machine. Backswing duration was longer for the group using a ball machine. That demonstrates different movement timing of tennis returns when players face a ball machine. Use of ball machines in tennis practice should be limited as it may disrupt stroke timing. Key pointsPlayers have shorter initial move time when they are facing the ball machine.Using the ball machine results in different swing timing and movement coordination.The use of the ball machine should be limited.

  9. Ball Machine Usage in Tennis: Movement Initiation and Swing Timing While Returning Balls from a Ball Machine and from a Real Server

    Science.gov (United States)

    Carboch, Jan; Süss, Vladimir; Kocib, Tomas

    2014-01-01

    Practicing with the use of a ball machine could handicap a player compared to playing against an actual opponent. Recent studies have shown some differences in swing timing and movement coordination, when a player faces a ball projection machine as opposed to a human opponent. We focused on the time of movement initiation and on stroke timing during returning tennis serves (simulated by a ball machine or by a real server). Receivers’ movements were measured on a tennis court. In spite of using a serving ball speed from 90 kph to 135 kph, results showed significant differences in movement initiation and backswing duration between serves received from a ball machine and serves received from a real server. Players had shorter movement initiation when they faced a ball machine. Backswing duration was longer for the group using a ball machine. That demonstrates different movement timing of tennis returns when players face a ball machine. Use of ball machines in tennis practice should be limited as it may disrupt stroke timing. Key points Players have shorter initial move time when they are facing the ball machine. Using the ball machine results in different swing timing and movement coordination. The use of the ball machine should be limited. PMID:24790483

  10. Parallel-Machine Scheduling Problems with Past-Sequence-Dependent Delivery Times and Aging Maintenance

    Directory of Open Access Journals (Sweden)

    Wei-min Ma

    2015-01-01

    Full Text Available We consider parallel-machine scheduling problems with past-sequence-dependent (psd delivery times and aging maintenance. The delivery time is proportional to the waiting time in the system. Each machine has an aging maintenance activity. We develop polynomial algorithms to three versions of the problem to minimize the total absolute deviation of job completion times, the total load, and the total completion time.

  11. Pathologies of van Stockum dust/Tipler's time machine

    Science.gov (United States)

    Lindsay, David S.

    2016-09-01

    We study the internal solution, and external vacuum solution for radial cutoff, of "van Stockum dust", an infinitely long rotating pressureless dust column; its density increases with radius. This interesting but poorly explored spacetime turns out to have a number of exotic properties, especially in the external vacuum region. These solutions have been known for decades, but it seems that they have never been investigated in detail. In this paper we analyze them and describe their peculiar properties. There are three regimes of radial cutoff that are of interest: (1) If the dust column is thick enough that closed timelike loops (CTLs or "time machines") exist inside the column, then the radius of the entire "universe" is finite, and in fact does not extend much beyond the edge of the matter, even though the metric's radial parameter is unbounded. This interesting finite proper radius seems to have been missed by earlier investigators. Other exotic properties of the external vacuum in this regime: CTLs exist in cylindrical shells, alternating with shells having no circular CTLs; there are infinitely many such shells, getting closer and closer together as one gets farther from the rotation axis. Also, a separate set of infinitely many cylindrical shells exists, having what might be termed "extreme frame-dragging", within which motion is possible only in one direction; they alternate with "normal" shells allowing motion in either direction. Gravitational attraction and tides increase with distance from the matter column, and diverge at the "edge of the universe". In addition, though the radius of the universe is finite, its circumference is infinite; and its boundary is a circle, not a cylinder (the z-axis has shrunk to nothing at the edge). (2) For smaller radial cutoff, but still large enough to produce CTLs, the radius of the universe is infinite; but there are still infinitely many cylindrical shells of CTLs alternating with non-CTL shells. However, the innermost

  12. Online Scheduling with Delivery Time on a Bounded Parallel Batch Machine with Limited Restart

    National Research Council Canada - National Science Library

    Liu, Hailing; Wan, Long; Yan, Zhigang; Yuan, Jinjiang

    2015-01-01

      We consider the online (over time) scheduling of equal length jobs on a bounded parallel batch machine with batch capacity b to minimize the time by which all jobs have been delivered with limited restart...

  13. A time-shared machine repair problem with mixed spares under N-policy

    Science.gov (United States)

    Jain, Madhu; Shekhar, Chandra; Shukla, Shalini

    2016-02-01

    The present investigation deals with a machine repair problem consisting of cold and warm standby machines. The machines are subject to breakdown and are repaired by the permanent repairman operating under N-policy. There is provision of one additional removable repairman who is called upon when the work load of failed machines crosses a certain threshold level and is removed as soon as the work load again ceases to that level. Both repairmen recover the failed machines by following the time sharing concept which means that the repairmen share their repair job simultaneously among all the failed machines that have joined the system for repair. Markovian model has been developed by considering the queue dependent rates and solved analytically using the recursive technique. Various performance indices are derived which are further used to obtain the cost function. By taking illustration, numerical simulation and sensitivity analysis have been provided.

  14. Phase Space Prediction of Chaotic Time Series with Nu-Support Vector Machine Regression

    Institute of Scientific and Technical Information of China (English)

    YE Mei-Ying; WANG Xiao-Dong

    2005-01-01

    A new class of support vector machine, nu-support vector machine, is discussed which can handle both classification and regression. We focus on nu-support vector machine regression and use it for phase space prediction of compares nu-support vector machine with back propagation (BP) networks in order to better evaluate the performance of the proposed methods. The experimental results show that the nu-support vector machine regression obtains lower root mean squared error than the BP networks and provides an accurate chaotic time series prediction. These results can be attributable to the fact that nu-support vector machine implements the structural risk minimization principle and this leads to better generalization than the BP networks.

  15. Job shop scheduling model for non-identic machine with fixed delivery time to minimize tardiness

    Science.gov (United States)

    Kusuma, K. K.; Maruf, A.

    2016-02-01

    Scheduling non-identic machines problem with low utilization characteristic and fixed delivery time are frequent in manufacture industry. This paper propose a mathematical model to minimize total tardiness for non-identic machines in job shop environment. This model will be categorized as an integer linier programming model and using branch and bound algorithm as the solver method. We will use fixed delivery time as main constraint and different processing time to process a job. The result of this proposed model shows that the utilization of production machines can be increase with minimal tardiness using fixed delivery time as constraint.

  16. Using Multiple FPGA Architectures for Real-time Processing of Low-level Machine Vision Functions

    Science.gov (United States)

    Thomas H. Drayer; William E. King; Philip A. Araman; Joseph G. Tront; Richard W. Conners

    1995-01-01

    In this paper, we investigate the use of multiple Field Programmable Gate Array (FPGA) architectures for real-time machine vision processing. The use of FPGAs for low-level processing represents an excellent tradeoff between software and special purpose hardware implementations. A library of modules that implement common low-level machine vision operations is presented...

  17. Meta-heurística para programação da produção com tempos de preparação dependentes da seqüência Metaheuristic for scheduling with dependent setup times

    Directory of Open Access Journals (Sweden)

    Hamilton Carlos Massaro Santos

    1995-12-01

    Full Text Available Este trabalho considera o problema de programação da produção, em uma máquina, de um conjunto de ordens de produção que podem ser agrupadas em famílias, sendo que os tempos de preparação entre essas famílias são dependentes da seqüência em que são executadas. Propõe-se um procedimento aproximado, baseado na meta-heurística de Busca Tabu, para a resolução deste problema. A função objetivo considera uma ponderação envolvendo os custos de preparação de máquina, uma penalidade por atraso em relação à data de entrega das ordens e o custo de estoque. O desempenho do método proposto é avaliado, computacionalmente, frente a três diferentes situações. 1 análise empírica de desempenho da heurística, em função dos parâmetros do problema; 2 comparação entre a heurística e regras de despacho tradicionais EDD e SPT; 3 emprego da heurística para a resolução de um problema prático real.This article focuses on the one machine scheduling problem where jobs can be grouped in classes with the same machine setups. The setup times between classes are sequence dependent. An approximation method based on Tabu Search metaheuristic is proposed. The objetive is to minimize the weighted sum of setup costs, tardiness and inventory holding costs. The performance of the heuristic is evaluated through three sets of computational tests: 1 empirical performance analysis of the heuristic with different data sets; 2 comparison between the heuristic and the well known dispatching rules EDD and SPT; 3 application of the heuristic for solving a real life scheduling problem.

  18. A sessile drop setup for the time-resolved synchrotron study of solid-liquid interactions: Application to intermetallic formation in 55%Al-Zn alloys

    Energy Technology Data Exchange (ETDEWEB)

    Bernier, N., E-mail: n.bernier@yahoo.fr; De Bruyn, D.; De Craene, M.; Scheers, J.; Claessens, S. [OCAS N.V., ArcelorMittal Global R and D Gent, Pres. J.F. Kennedylaan 3, 9060 Zelzate (Belgium); Vaughan, G. B. M.; Vitoux, H.; Gleyzolle, H.; Gorges, B. [European Synchrotron Radiation Facility, BP 220, 38043 Grenoble Cedex (France)

    2014-04-28

    We introduce a dedicated setup for measuring by synchrotron diffraction in-situ crystallographic and chemical information at the solid–liquid interface. This setup mostly consists of a double-heating furnace composed of a resistive heating for the solid surface and an inductive heating to produce a liquid droplet. The available high energy and high flux beams allow the rapid reaction kinetics to be investigated with very good time resolution down to 1 ms. An application of this setup is illustrated for the growth mechanisms of intermetallic phases during the hot-dipping of steel in a 55%Al-Zn bath. Results show that the three η-Al{sub 5}Fe{sub 2}, θ-Al{sub 13}Fe{sub 4}, and α-Al{sub 8}Fe{sub 2}Si phases grow at different times and rates during the dipping process, whereas the face-centered cubic AlFe{sub 3} phase is not formed.

  19. Quick-EXAFS setup at the SuperXAS beamline for in situ X-ray absorption spectroscopy with 10 ms time resolution

    Science.gov (United States)

    Müller, Oliver; Nachtegaal, Maarten; Just, Justus; Lützenkirchen-Hecht, Dirk; Frahm, Ronald

    2016-01-01

    The quick-EXAFS (QEXAFS) method adds time resolution to X-ray absorption spectroscopy (XAS) and allows dynamic structural changes to be followed. A completely new QEXAFS setup consisting of monochromator, detectors and data acquisition system is presented, as installed at the SuperXAS bending-magnet beamline at the Swiss Light Source (Paul Scherrer Institute, Switzerland). The monochromator uses Si(111) and Si(311) channel-cut crystals mounted on one crystal stage, and remote exchange allows an energy range from 4.0 keV to 32 keV to be covered. The spectral scan range can be electronically adjusted up to several keV to cover multiple absorption edges in one scan. The determination of the Bragg angle close to the position of the crystals allows high-accuracy measurements. Absorption spectra can be acquired with fast gridded ionization chambers at oscillation frequencies of up to 50 Hz resulting in a time resolution of 10 ms, using both scan directions of each oscillation period. The carefully developed low-noise detector system yields high-quality absorption data. The unique setup allows both state-of-the-art QEXAFS and stable step-scan operation without the need to exchange whole monochromators. The long-term stability of the Bragg angle was investigated and absorption spectra of reference materials as well as of a fast chemical reaction demonstrate the overall capabilities of the new setup. PMID:26698072

  20. Quick-EXAFS setup at the SuperXAS beamline for in situ X-ray absorption spectroscopy with 10 ms time resolution.

    Science.gov (United States)

    Müller, Oliver; Nachtegaal, Maarten; Just, Justus; Lützenkirchen-Hecht, Dirk; Frahm, Ronald

    2016-01-01

    The quick-EXAFS (QEXAFS) method adds time resolution to X-ray absorption spectroscopy (XAS) and allows dynamic structural changes to be followed. A completely new QEXAFS setup consisting of monochromator, detectors and data acquisition system is presented, as installed at the SuperXAS bending-magnet beamline at the Swiss Light Source (Paul Scherrer Institute, Switzerland). The monochromator uses Si(111) and Si(311) channel-cut crystals mounted on one crystal stage, and remote exchange allows an energy range from 4.0 keV to 32 keV to be covered. The spectral scan range can be electronically adjusted up to several keV to cover multiple absorption edges in one scan. The determination of the Bragg angle close to the position of the crystals allows high-accuracy measurements. Absorption spectra can be acquired with fast gridded ionization chambers at oscillation frequencies of up to 50 Hz resulting in a time resolution of 10 ms, using both scan directions of each oscillation period. The carefully developed low-noise detector system yields high-quality absorption data. The unique setup allows both state-of-the-art QEXAFS and stable step-scan operation without the need to exchange whole monochromators. The long-term stability of the Bragg angle was investigated and absorption spectra of reference materials as well as of a fast chemical reaction demonstrate the overall capabilities of the new setup.

  1. Taxi Time Prediction at Charlotte Airport Using Fast-Time Simulation and Machine Learning Techniques

    Science.gov (United States)

    Lee, Hanbong

    2016-01-01

    Accurate taxi time prediction is required for enabling efficient runway scheduling that can increase runway throughput and reduce taxi times and fuel consumptions on the airport surface. Currently NASA and American Airlines are jointly developing a decision-support tool called Spot and Runway Departure Advisor (SARDA) that assists airport ramp controllers to make gate pushback decisions and improve the overall efficiency of airport surface traffic. In this presentation, we propose to use Linear Optimized Sequencing (LINOS), a discrete-event fast-time simulation tool, to predict taxi times and provide the estimates to the runway scheduler in real-time airport operations. To assess its prediction accuracy, we also introduce a data-driven analytical method using machine learning techniques. These two taxi time prediction methods are evaluated with actual taxi time data obtained from the SARDA human-in-the-loop (HITL) simulation for Charlotte Douglas International Airport (CLT) using various performance measurement metrics. Based on the taxi time prediction results, we also discuss how the prediction accuracy can be affected by the operational complexity at this airport and how we can improve the fast time simulation model before implementing it with an airport scheduling algorithm in a real-time environment.

  2. Tight bounds for the space complexity of nonregular language recognition by real-time machines

    CERN Document Server

    Yakaryilmaz, Abuzer

    2011-01-01

    We examine the minimum amounts of useful memory for real-time, as opposed to one-way, computation using several different machine models. In most cases, we are able to show that the lower bounds established using arguments about one-way machines remain tight in the real-time case. It is shown that increasing the number of stacks of real-time pushdown automata can result in exponential improvement in the total amount of space usage for nonregular language recognition.

  3. Decentralized real-time simulation of forest machines

    Science.gov (United States)

    Freund, Eckhard; Adam, Frank; Hoffmann, Katharina; Rossmann, Juergen; Kraemer, Michael; Schluse, Michael

    2000-10-01

    To develop realistic forest machine simulators is a demanding task. A useful simulator has to provide a close- to-reality simulation of the forest environment as well as the simulation of the physics of the vehicle. Customers demand a highly realistic three dimensional forestry landscape and the realistic simulation of the complex motion of the vehicle even in rough terrain in order to be able to use the simulator for operator training under close-to- reality conditions. The realistic simulation of the vehicle, especially with the driver's seat mounted on a motion platform, greatly improves the effect of immersion into the virtual reality of a simulated forest and the achievable level of education of the driver. Thus, the connection of the real control devices of forest machines to the simulation system has to be supported, i.e. the real control devices like the joysticks or the board computer system to control the crane, the aggregate etc. Beyond, the fusion of the board computer system and the simulation system is realized by means of sensors, i.e. digital and analog signals. The decentralized system structure allows several virtual reality systems to evaluate and visualize the information of the control devices and the sensors. So, while the driver is practicing, the instructor can immerse into the same virtual forest to monitor the session from his own viewpoint. In this paper, we are describing the realized structure as well as the necessary software and hardware components and application experiences.

  4. ON THE COMPLETION TIME OF A JOB PROCESSED ON AN UNRELIABLE MACHINE

    Institute of Scientific and Technical Information of China (English)

    岳德权; 涂菶生

    2001-01-01

    In this paper, we consider the completion time of a job processed on an unreliable machine.Assume that the lifetime and the repair time of the machine and the service time of the job have general distributions. We obtain the Laplace-Stieltjes transforms and the expectations of the distributions of the completion time, the interruption time and the actual service time. Under some special cases, we derive sufficient and necessary (or sufficient) conditions such that the completion time is larger and smaller than the service time in the sense of the Laplace transform order (or the expectation), respectively.

  5. Brain-machine interfaces for real-time speech synthesis.

    Science.gov (United States)

    Guenther, Frank H; Brumberg, Jonathan S

    2011-01-01

    This paper reports on studies involving brain-machine interfaces (BMIs) that provide near-instantaneous audio feedback from a speech synthesizer to the BMI user. In one study, neural signals recorded by an intracranial electrode implanted in a speech-related region of the left precentral gyrus of a human volunteer suffering from locked-in syndrome were transmitted wirelessly across the scalp and used to drive a formant synthesizer, allowing the user to produce vowels. In a second, pilot study, a neurologically normal user was able to drive the formant synthesizer with imagined movements detected using electroencephalography. Our results support the feasibility of neural prostheses that have the potential to provide near-conversational synthetic speech for individuals with severely impaired speech output.

  6. Experimental setup and commissioning baseline study in search of time-variations in beta-decay half-lives

    Energy Technology Data Exchange (ETDEWEB)

    Goddard, Braden, E-mail: goddard.braden@gmail.com [Department of Nuclear Engineering, Khalifa University of Science, Technology & Research, P.O. Box 127788, Abu Dhabi (United Arab Emirates); Hitt, George W. [Department of Nuclear Engineering, Khalifa University of Science, Technology & Research, P.O. Box 127788, Abu Dhabi (United Arab Emirates); Department of Applied Mathematics and Science, Khalifa University of Science, Technology & Research, P.O. Box 127788, Abu Dhabi (United Arab Emirates); Solodov, Alexander A. [Department of Nuclear Engineering, Khalifa University of Science, Technology & Research, P.O. Box 127788, Abu Dhabi (United Arab Emirates); Bridi, Dorian; Isakovic, A.F. [Department of Applied Mathematics and Science, Khalifa University of Science, Technology & Research, P.O. Box 127788, Abu Dhabi (United Arab Emirates); El-Khazali, Reyad [Department of Electrical and Computer Engineering, Khalifa University of Science, Technology & Research, P.O. Box 127788, Abu Dhabi (United Arab Emirates); Abulail, Ayman, E-mail: aabulail@pi.ac.ae [Department of Applied Mathematics and Science, Khalifa University of Science, Technology & Research, P.O. Box 127788, Abu Dhabi (United Arab Emirates)

    2016-03-11

    Recently there have been a number of investigations into whether the decay constant of a radioactive isotope can be influenced by external factors, such as the Earth–Sun distance or Solar flare activity. Positive claims suggest that annual oscillations of ~0.1% and accelerations of ~0.4% in the relative activity of beta-emitters coincide with the Earth–Sun distance and solar flare activity, respectively. Results from replication experiments have so far been conflicting. The main criticism of the measurements used to trace and quantify these effects is that the data is of poor quality or limited in scope. Data have often been collected as part of short duration weekly calibration measurements, measured with a single type of low precision detector, only using one isotope, and having no environmental conditions information (temperature, pressure, humidity) accompanying the radiation measurements. This paper describes the setup of a series of counting experiments commissioned for addressing these criticisms. Six dedicated detector systems (four different types) measuring six different isotopes ({sup 14}C, {sup 54}Mn, {sup 60}Co, {sup 90}Sr, {sup 204}Tl, and {sup 226}Ra) have been continuously collecting source activity synchronously with environmental data for a period of one month (April 2014). The results of this baseline commissioning study show that there are correlations between activity and environmental conditions for some detector types which are then quantified. The results also show that the one sigma counting uncertainties in all the detectors are less than 0.024% for a given 24 h period. After accounting for propagated uncertainties from corrections against correlations with environmental data, the ability to resolve 0.1% activity changes varies, from 8 min to 1.6 days, depending on the specific detector. All six experiments therefore, will have sufficient precision over the upcoming year to scrutinize claims of both annual activity oscillations and

  7. Experimental setup and commissioning baseline study in search of time-variations in beta-decay half-lives

    Science.gov (United States)

    Goddard, Braden; Hitt, George W.; Solodov, Alexander A.; Bridi, Dorian; Isakovic, A. F.; El-Khazali, Reyad; Abulail, Ayman

    2016-03-01

    Recently there have been a number of investigations into whether the decay constant of a radioactive isotope can be influenced by external factors, such as the Earth-Sun distance or Solar flare activity. Positive claims suggest that annual oscillations of ~0.1% and accelerations of ~0.4% in the relative activity of beta-emitters coincide with the Earth-Sun distance and solar flare activity, respectively. Results from replication experiments have so far been conflicting. The main criticism of the measurements used to trace and quantify these effects is that the data is of poor quality or limited in scope. Data have often been collected as part of short duration weekly calibration measurements, measured with a single type of low precision detector, only using one isotope, and having no environmental conditions information (temperature, pressure, humidity) accompanying the radiation measurements. This paper describes the setup of a series of counting experiments commissioned for addressing these criticisms. Six dedicated detector systems (four different types) measuring six different isotopes (14C, 54Mn, 60Co, 90Sr, 204Tl, and 226Ra) have been continuously collecting source activity synchronously with environmental data for a period of one month (April 2014). The results of this baseline commissioning study show that there are correlations between activity and environmental conditions for some detector types which are then quantified. The results also show that the one sigma counting uncertainties in all the detectors are less than 0.024% for a given 24 h period. After accounting for propagated uncertainties from corrections against correlations with environmental data, the ability to resolve 0.1% activity changes varies, from 8 min to 1.6 days, depending on the specific detector. All six experiments therefore, will have sufficient precision over the upcoming year to scrutinize claims of both annual activity oscillations and solar flare activity changes.

  8. Setup Analysis: Combining SMED with Other Tools

    Directory of Open Access Journals (Sweden)

    Stadnicka Dorota

    2015-02-01

    Full Text Available The purpose of this paper is to propose the methodology for the setup analysis, which can be implemented mainly in small and medium enterprises which are not convinced to implement the setups development. The methodology was developed after the research which determined the problem. Companies still have difficulties with a long setup time. Many of them do nothing to decrease this time. A long setup is not a sufficient reason for companies to undertake any actions towards the setup time reduction. To encourage companies to implement SMED it is essential to make some analyses of changeovers in order to discover problems. The methodology proposed can really encourage the management to take a decision about the SMED implementation, and that was verified in a production company. The setup analysis methodology is made up of seven steps. Four of them concern a setups analysis in a chosen area of a company, such as a work stand which is a bottleneck with many setups. The goal is to convince the management to begin actions concerning the setups improvement. The last three steps are related to a certain setup and, there, the goal is to reduce a setup time and the risk of problems which can appear during the setup. In this paper, the tools such as SMED, Pareto analysis, statistical analysis, FMEA and other were used.

  9. Quick-EXAFS setup at the SuperXAS beamline for in situ X-ray absorption spectroscopy with 10 ms time resolution

    Energy Technology Data Exchange (ETDEWEB)

    Müller, Oliver, E-mail: o.mueller@uni-wuppertal.de [University of Wuppertal, Gaußstraße 20, 42119 Wuppertal (Germany); Nachtegaal, Maarten [Paul Scherrer Institute, 5232 Villigen (Switzerland); Just, Justus [University of Wuppertal, Gaußstraße 20, 42119 Wuppertal (Germany); Helmholtz-Zentrum Berlin für Materialien und Energie, Hahn-Meitner-Platz 1, 14109 Berlin (Germany); Lützenkirchen-Hecht, Dirk; Frahm, Ronald [University of Wuppertal, Gaußstraße 20, 42119 Wuppertal (Germany)

    2016-01-01

    A new quick-scanning EXAFS (QEXAFS) monochromator, ionization chambers and data acquisition system have been developed and installed at the SuperXAS beamline at the Swiss Light Source to reach a temporal resolution of 10 ms. The quick-EXAFS (QEXAFS) method adds time resolution to X-ray absorption spectroscopy (XAS) and allows dynamic structural changes to be followed. A completely new QEXAFS setup consisting of monochromator, detectors and data acquisition system is presented, as installed at the SuperXAS bending-magnet beamline at the Swiss Light Source (Paul Scherrer Institute, Switzerland). The monochromator uses Si(111) and Si(311) channel-cut crystals mounted on one crystal stage, and remote exchange allows an energy range from 4.0 keV to 32 keV to be covered. The spectral scan range can be electronically adjusted up to several keV to cover multiple absorption edges in one scan. The determination of the Bragg angle close to the position of the crystals allows high-accuracy measurements. Absorption spectra can be acquired with fast gridded ionization chambers at oscillation frequencies of up to 50 Hz resulting in a time resolution of 10 ms, using both scan directions of each oscillation period. The carefully developed low-noise detector system yields high-quality absorption data. The unique setup allows both state-of-the-art QEXAFS and stable step-scan operation without the need to exchange whole monochromators. The long-term stability of the Bragg angle was investigated and absorption spectra of reference materials as well as of a fast chemical reaction demonstrate the overall capabilities of the new setup.

  10. A Pareto-Based Adaptive Variable Neighborhood Search for Biobjective Hybrid Flow Shop Scheduling Problem with Sequence-Dependent Setup Time

    Directory of Open Access Journals (Sweden)

    Huixin Tian

    2016-01-01

    Full Text Available Different from most researches focused on the single objective hybrid flowshop scheduling (HFS problem, this paper investigates a biobjective HFS problem with sequence dependent setup time. The two objectives are the minimization of total weighted tardiness and the total setup time. To efficiently solve this problem, a Pareto-based adaptive biobjective variable neighborhood search (PABOVNS is developed. In the proposed PABOVNS, a solution is denoted as a sequence of all jobs and a decoding procedure is presented to obtain the corresponding complete schedule. In addition, the proposed PABOVNS has three major features that can guarantee a good balance of exploration and exploitation. First, an adaptive selection strategy of neighborhoods is proposed to automatically select the most promising neighborhood instead of the sequential selection strategy of canonical VNS. Second, a two phase multiobjective local search based on neighborhood search and path relinking is designed for each selected neighborhood. Third, an external archive with diversity maintenance is adopted to store the nondominated solutions and at the same time provide initial solutions for the local search. Computational results based on randomly generated instances show that the PABOVNS is efficient and even superior to some other powerful multiobjective algorithms in the literature.

  11. Sub-nanosecond time-resolved ambient-pressure X-ray photoelectron spectroscopy setup for pulsed and constant wave X-ray light sources.

    Science.gov (United States)

    Shavorskiy, Andrey; Neppl, Stefan; Slaughter, Daniel S; Cryan, James P; Siefermann, Katrin R; Weise, Fabian; Lin, Ming-Fu; Bacellar, Camila; Ziemkiewicz, Michael P; Zegkinoglou, Ioannis; Fraund, Matthew W; Khurmi, Champak; Hertlein, Marcus P; Wright, Travis W; Huse, Nils; Schoenlein, Robert W; Tyliszczak, Tolek; Coslovich, Giacomo; Robinson, Joseph; Kaindl, Robert A; Rude, Bruce S; Ölsner, Andreas; Mähl, Sven; Bluhm, Hendrik; Gessner, Oliver

    2014-09-01

    An apparatus for sub-nanosecond time-resolved ambient-pressure X-ray photoelectron spectroscopy studies with pulsed and constant wave X-ray light sources is presented. A differentially pumped hemispherical electron analyzer is equipped with a delay-line detector that simultaneously records the position and arrival time of every single electron at the exit aperture of the hemisphere with ~0.1 mm spatial resolution and ~150 ps temporal accuracy. The kinetic energies of the photoelectrons are encoded in the hit positions along the dispersive axis of the two-dimensional detector. Pump-probe time-delays are provided by the electron arrival times relative to the pump pulse timing. An average time-resolution of (780 ± 20) ps (FWHM) is demonstrated for a hemisphere pass energy E(p) = 150 eV and an electron kinetic energy range KE = 503-508 eV. The time-resolution of the setup is limited by the electron time-of-flight (TOF) spread related to the electron trajectory distribution within the analyzer hemisphere and within the electrostatic lens system that images the interaction volume onto the hemisphere entrance slit. The TOF spread for electrons with KE = 430 eV varies between ~9 ns at a pass energy of 50 eV and ~1 ns at pass energies between 200 eV and 400 eV. The correlation between the retarding ratio and the TOF spread is evaluated by means of both analytical descriptions of the electron trajectories within the analyzer hemisphere and computer simulations of the entire trajectories including the electrostatic lens system. In agreement with previous studies, we find that the by far dominant contribution to the TOF spread is acquired within the hemisphere. However, both experiment and computer simulations show that the lens system indirectly affects the time resolution of the setup to a significant extent by inducing a strong dependence of the angular spread of electron trajectories entering the hemisphere on the retarding ratio. The scaling of the angular spread with

  12. Evaluation of containment failure and cleanup time for Pu shots on the Z machine.

    Energy Technology Data Exchange (ETDEWEB)

    Darby, John L.

    2010-02-01

    Between November 30 and December 11, 2009 an evaluation was performed of the probability of containment failure and the time for cleanup of contamination of the Z machine given failure, for plutonium (Pu) experiments on the Z machine at Sandia National Laboratories (SNL). Due to the unique nature of the problem, there is little quantitative information available for the likelihood of failure of containment components or for the time to cleanup. Information for the evaluation was obtained from Subject Matter Experts (SMEs) at the Z machine facility. The SMEs provided the State of Knowledge (SOK) for the evaluation. There is significant epistemic- or state of knowledge- uncertainty associated with the events that comprise both failure of containment and cleanup. To capture epistemic uncertainty and to allow the SMEs to reason at the fidelity of the SOK, we used the belief/plausibility measure of uncertainty for this evaluation. We quantified two variables: the probability that the Pu containment system fails given a shot on the Z machine, and the time to cleanup Pu contamination in the Z machine given failure of containment. We identified dominant contributors for both the time to cleanup and the probability of containment failure. These results will be used by SNL management to decide the course of action for conducting the Pu experiments on the Z machine.

  13. A Genetic Algorithm for Single Machine Scheduling with Fuzzy Processing Time and Multiple Objectives

    Institute of Scientific and Technical Information of China (English)

    吴超超; 顾幸生

    2004-01-01

    In this paper, by considering the fuzzy nature of the data in real-life problems, single machine scheduling problems with fuzzy processing time and multiple objectives are formulated and an efficient genetic algorithm which is suitable for solving these problems is proposed. As illustrative numerical examples, twenty jobs processing on a machine is considered. The feasibility and effectiveness of the proposed method have been demonstrated in the simulation.

  14. Ball Machine Usage in Tennis: Movement Initiation and Swing Timing While Returning Balls from a Ball Machine and from a Real Server

    Directory of Open Access Journals (Sweden)

    Jan Carboch, Vladimir Süss, Tomas Kocib

    2014-06-01

    Full Text Available Practicing with the use of a ball machine could handicap a player compared to playing against an actual opponent. Recent studies have shown some differences in swing timing and movement coordination, when a player faces a ball projection machine as opposed to a human opponent. We focused on the time of movement initiation and on stroke timing during returning tennis serves (simulated by a ball machine or by a real server. Receivers’ movements were measured on a tennis court. In spite of using a serving ball speed from 90 kph to 135 kph, results showed significant differences in movement initiation and backswing duration between serves received from a ball machine and serves received from a real server. Players had shorter movement initiation when they faced a ball machine. Backswing duration was longer for the group using a ball machine. That demonstrates different movement timing of tennis returns when players face a ball machine. Use of ball machines in tennis practice should be limited as it may disrupt stroke timing.

  15. Chaotic time series prediction using mean-field theory for support vector machine

    Institute of Scientific and Technical Information of China (English)

    Cui Wan-Zhao; Zhu Chang-Chun; Bao Wen-Xing; Liu Jun-Hua

    2005-01-01

    This paper presents a novel method for predicting chaotic time series which is based on the support vector machines approach, and it uses the mean-field theory for developing an easy and efficient learning procedure for the support vector machine. The proposed method approximates the distribution of the support vector machine parameters to a Gaussian process and uses the mean-field theory to estimate these parameters easily, and select the weights of the mixture of kernels used in the support vector machine estimation more accurately and faster than traditional quadratic programming-based algorithms. Finally, relationships between the embedding dimension and the predicting performance of this method are discussed, and the Mackey-Glass equation is applied to test this method. The stimulations show that the mean-field theory for support vector machine can predict chaotic time series accurately, and even if the embedding dimension is unknown, the predicted results are still satisfactory. This result implies that the mean-field theory for support vector machine is a good tool for studying chaotic time series.

  16. Two-Agent Single-Machine Scheduling of Jobs with Time-Dependent Processing Times and Ready Times

    Directory of Open Access Journals (Sweden)

    Jan-Yee Kung

    2013-01-01

    Full Text Available Scheduling involving jobs with time-dependent processing times has recently attracted much research attention. However, multiagent scheduling with simultaneous considerations of jobs with time-dependent processing times and ready times is relatively unexplored. Inspired by this observation, we study a two-agent single-machine scheduling problem in which the jobs have both time-dependent processing times and ready times. We consider the model in which the actual processing time of a job of the first agent is a decreasing function of its scheduled position while the actual processing time of a job of the second agent is an increasing function of its scheduled position. In addition, each job has a different ready time. The objective is to minimize the total completion time of the jobs of the first agent with the restriction that no tardy job is allowed for the second agent. We propose a branch-and-bound and several genetic algorithms to obtain optimal and near-optimal solutions for the problem, respectively. We also conduct extensive computational results to test the proposed algorithms and examine the impacts of different problem parameters on their performance.

  17. On-machine dimensional verification. Final report

    Energy Technology Data Exchange (ETDEWEB)

    Rendulic, W.

    1993-08-01

    General technology for automating in-process verification of machined products has been studied and implemented on a variety of machines and products at AlliedSignal Inc., Kansas City Division (KCD). Tests have been performed to establish system accuracy and probe reliability on two numerically controlled machining centers. Commercial software has been revised, and new cycles such as skew check and skew machining, have been developed to enhance and expand probing capabilities. Probe benefits have been demonstrated in the area of setup, cycle time, part quality, tooling cost, and product sampling.

  18. Time complexity of tape reduction for reversible Turing machines

    DEFF Research Database (Denmark)

    Axelsen, Holger Bock

    2012-01-01

    , it is known that the reduction from k tapes to 1 tape in general leads to a quadratic increase in time. For k to 2 tapes, a celebrated result shows that the time overhead can be reduced to a logarithmic factor. We show that identical results hold for multitape RTMs. This establishes that the structure...

  19. On Heuristic Approach for Solution of Scheduling Problem Involving Transportation Time and Break-down Times for Three Machines

    Directory of Open Access Journals (Sweden)

    A. Khodadadi

    2014-04-01

    Full Text Available In most manufacturing and distribution systems, semi-finished jobs are transferred from one processing facility to another by transporters such as automated guided vehicles and conveyors and finished jobs are delivered to customers or warehouses by vehicles such as trucks. Most machine scheduling models assume either that there are a finite number of transporters for delivering jobs or that jobs are delivered instantaneously from one location to another without transportation time involved. In this study we study a new simple heuristic algorithm for a ‘3-machine, n-job’ flow shop scheduling problem in which transportation time and break down times of machines are considered. A heuristic approach method to find optimal and near optimal sequence minimizing the total elapsed time.

  20. A Real-Time Tool Positioning Sensor for Machine-Tools

    Science.gov (United States)

    Ruiz, Antonio Ramon Jimenez; Rosas, Jorge Guevara; Granja, Fernando Seco; Honorato, Jose Carlos Prieto; Taboada, Jose Juan Esteve; Serrano, Vicente Mico; Jimenez, Teresa Molina

    2009-01-01

    In machining, natural oscillations, and elastic, gravitational or temperature deformations, are still a problem to guarantee the quality of fabricated parts. In this paper we present an optical measurement system designed to track and localize in 3D a reference retro-reflector close to the machine-tool's drill. The complete system and its components are described in detail. Several tests, some static (including impacts and rotations) and others dynamic (by executing linear and circular trajectories), were performed on two different machine tools. It has been integrated, for the first time, a laser tracking system into the position control loop of a machine-tool. Results indicate that oscillations and deformations close to the tool can be estimated with micrometric resolution and a bandwidth from 0 to more than 100 Hz. Therefore this sensor opens the possibility for on-line compensation of oscillations and deformations. PMID:22408472

  1. A Real-Time Tool Positioning Sensor for Machine-Tools

    Directory of Open Access Journals (Sweden)

    Vicente Mico Serrano

    2009-09-01

    Full Text Available In machining, natural oscillations, and elastic, gravitational or temperature deformations, are still a problem to guarantee the quality of fabricated parts. In this paper we present an optical measurement system designed to track and localize in 3D a reference retro-reflector close to the machine-tool’s drill. The complete system and its components are described in detail. Several tests, some static (including impacts and rotations and others dynamic (by executing linear and circular trajectories, were performed on two different machine tools. It has been integrated, for the first time, a laser tracking system into the position control loop of a machine-tool. Results indicate that oscillations and deformations close to the tool can be estimated with micrometric resolution and a bandwidth from 0 to more than 100 Hz. Therefore this sensor opens the possibility for on-line compensation of oscillations and deformations.

  2. A real-time tool positioning sensor for machine-tools.

    Science.gov (United States)

    Ruiz, Antonio Ramon Jimenez; Rosas, Jorge Guevara; Granja, Fernando Seco; Honorato, Jose Carlos Prieto; Taboada, Jose Juan Esteve; Serrano, Vicente Mico; Jimenez, Teresa Molina

    2009-01-01

    In machining, natural oscillations, and elastic, gravitational or temperature deformations, are still a problem to guarantee the quality of fabricated parts. In this paper we present an optical measurement system designed to track and localize in 3D a reference retro-reflector close to the machine-tool's drill. The complete system and its components are described in detail. Several tests, some static (including impacts and rotations) and others dynamic (by executing linear and circular trajectories), were performed on two different machine tools. It has been integrated, for the first time, a laser tracking system into the position control loop of a machine-tool. Results indicate that oscillations and deformations close to the tool can be estimated with micrometric resolution and a bandwidth from 0 to more than 100 Hz. Therefore this sensor opens the possibility for on-line compensation of oscillations and deformations.

  3. Application of TPM indicators for analyzing work time of machines used in the pressure die casting

    Science.gov (United States)

    Borkowski, Stanisław; Czajkowska, Agnieszka; Stasiak-Betlejewska, Renata; Borade, Atul B.

    2014-05-01

    The article presents the application of total productive maintenance (TPM) to analyze the working time indicators of casting machines with particular emphasis on failures and unplanned downtime to reduce the proportion of emergency operation for preventive maintenance and diagnostics. The article presents that the influence of individual factors of complex machinery maintenance (TPM) is different and depends on the machines' modernity level. In an original way, by using correlation graphs, research findings on the impact of individual TPM factors on the castings quality were presented and interpreted. The examination results conducted for machines with varying modernity degrees allowed to determine changes within the impact of individual TPM factors depending on machine parameters. These results provide a rich source of information for the improvement processes on casting quality of the foundry industry that satisfies the automotive industry demand.

  4. Time-triggered State-machine Reliable Software Architecture for Micro Turbine Engine Control

    Institute of Scientific and Technical Information of China (English)

    ZHANG Qi; XU Guoqiang; DING Shuiting

    2012-01-01

    Time-triggered (TT) embedded software pattern is well accepted in aerospace industry for its high reliability.Finite-state-machine (FSM) design method is widely used for its high efficiency and predictable behavior.In this paper,the time-triggered and state-machine combination software architecture is implemented for a 25 kg thrust micro turbine engine (MTE) used for unmanned aerial vehicle (UAV) system; also model-based-design development workflow for airworthiness software directive DO-178B is utilized.Experimental results show that time-triggered state-machine software architecture and development method could shorten the system development time,reduce the system test cost and make the turbine engine easily comply with the airworthiness rules.

  5. Hardware Approach for Real Time Machine Stereo Vision

    Directory of Open Access Journals (Sweden)

    Michael Tornow

    2006-02-01

    Full Text Available Image processing is an effective tool for the analysis of optical sensor information for driver assistance systems and controlling of autonomous robots. Algorithms for image processing are often very complex and costly in terms of computation. In robotics and driver assistance systems, real-time processing is necessary. Signal processing algorithms must often be drastically modified so they can be implemented in the hardware. This task is especially difficult for continuous real-time processing at high speeds. This article describes a hardware-software co-design for a multi-object position sensor based on a stereophotogrammetric measuring method. In order to cover a large measuring area, an optimized algorithm based on an image pyramid is implemented in an FPGA as a parallel hardware solution for depth map calculation. Object recognition and tracking are then executed in real-time in a processor with help of software. For this task a statistical cluster method is used. Stabilization of the tracking is realized through use of a Kalman filter. Keywords: stereophotogrammetry, hardware-software co-design, FPGA, 3-d image analysis, real-time, clustering and tracking.

  6. A Class of Single Machine Scheduling Problems with Variable Processing Time

    Institute of Scientific and Technical Information of China (English)

    2001-01-01

    In this paper, single machine scheduling problems with variableprocessing time are raised. The criterions of the problem considered are minimizing scheduling length of all jobs, flow time and number of tardy jobs and so on. The complexity of the problem is determined.

  7. An Eternal Time Machine in 2+1 Dimensional anti-de Sitter Space

    CERN Document Server

    De Deo, S

    2002-01-01

    2+1 dimensional anti-de Sitter space has been the subject of much recent investigation. Studies of the behaviour of point particles in this space have given us a greater understanding of the BTZ black hole solutions produced by topological identification of adS isometries. In this paper, we present a new configuration of two orbiting massive point particles that leads to an ``eternal'' time machine, where closed timelike curves fill the entire space. In contrast to previous solutions, this configuration has no event or chronology horizons. Another interesting feature is that there is no lower bound on the relative velocities of the point masses used to construct the time machine; as long as the particles exceed a certain mass threshold, an eternal time machine will be produced.

  8. Small-time scale network traffic prediction based on a local support vector machine regression model

    Institute of Scientific and Technical Information of China (English)

    Meng Qing-Fang; Chen Yue-Hui; Peng Yu-Hua

    2009-01-01

    In this paper we apply the nonlinear time series analysis method to small-time scale traffic measurement data. The prediction-based method is used to determine the embedding dimension of the traffic data. Based on the reconstructed phase space, the local support vector machine prediction method is used to predict the traffic measurement data, and the BIC-based neighbouring point selection method is used to choose the number of the nearest neighbouring points for the local support vector machine regression model. The experimental results show that the local support vector machine prediction method whose neighbouring points are optimized can effectively predict the small-time scale traffic measurement data and can reproduce the statistical features of real traffic measurements.

  9. Life time evaluation of spectrum loaded machine parts

    Energy Technology Data Exchange (ETDEWEB)

    Rabb, R. [Waertsilae NSD Corporation, Vaasa (Finland)

    1998-12-31

    In a medium speed diesel engine there are some important components, such as the cylinder head, the piston and the cylinder liner, which are subjected to a specific load spectrum consisting of mainly two distinct parts. One is the low cycle part which is due to the temperature field that builds up after that the engine has been started. This low cycle part causes a big stress amplitude but consists of only a couple of thousand cycles during the engine life time. The other part of the load spectrum is the high cycle part due to the firing pressure. The high cycle part has a smaller amplitude but consists of billions of cycles during the engine life time. The cylinder head and the cylinder liner are made of cast iron. In this investigation the true extension into the high cycle domain of the S-N curve for grey cast iron grade 300/ISO 185 was established through fatigue tests with a load spectrum resembling the existing one. This testing resulted in much new and improved knowledge about the fatigue properties of grey cast iron and it was even possible to generalize the outcome of the spectrum fatigue tests into a simple design curve. (orig.) 11 refs.

  10. An Investigation into Error Source Identification of Machine Tools Based on Time-Frequency Feature Extraction

    Directory of Open Access Journals (Sweden)

    Dongju Chen

    2016-01-01

    Full Text Available This paper presents a new identification method to identify the main errors of the machine tool in time-frequency domain. The low- and high-frequency signals of the workpiece surface are decomposed based on the Daubechies wavelet transform. With power spectral density analysis, the main features of the high-frequency signal corresponding to the imbalance of the spindle system are extracted from the surface topography of the workpiece in the frequency domain. With the cross-correlation analysis method, the relationship between the guideway error of the machine tool and the low-frequency signal of the surface topography is calculated in the time domain.

  11. Using positioned completion times to solve a two-machine flowshop problem involving batching and scheduling

    Energy Technology Data Exchange (ETDEWEB)

    Hoogeveen, J.A.; Van de Velde, S.L.

    1994-12-31

    We address the problem of scheduling n jobs in a flow shop environment that consists of a batching machine with capacity c and a standard machine with capacity 1 such that total completion time is minimized. We formulate this problem as a pidgin integer programming problem by using the concept of position dependent completion times; to this formulation we apply Lagrangian relaxation to obtain a strong lower bound. We show that this lower bound dominates the bound that was obtained by Ahmadi et al. by applying Lagrangian relaxation to an ordinary formulation of this problem.

  12. Design of MOEMS adjustable optical delay line to reduce link set-up time in a tera-bit/s optical interconnection network.

    Science.gov (United States)

    Jing, Wencai; Zhang, Yimo; Zhou, Ge

    2002-07-15

    A new structure for bit synchronization in a tera-bit/s optical interconnection network has been designed using micro-electro-mechanical system (MEMS) technique. Link multiplexing has been adopted to reduce data packet communication latency. To eliminate link set-up time, adjustable optical delay lines (AODLs) have been adopted to shift the phases of the distributed optical clock signals for bit synchronization. By changing the optical path distance of the optical clock signal, the phase of the clock signal can be shifted at a very high resolution. A phase-shift resolution of 0.1 ps can be easily achieved with 30-microm alternation of the optical path length in vacuum.

  13. Five-Axis Machine Tool Condition Monitoring Using dSPACE Real-Time System

    Science.gov (United States)

    Sztendel, S.; Pislaru, C.; Longstaff, A. P.; Fletcher, S.; Myers, A.

    2012-05-01

    This paper presents the design, development and SIMULINK implementation of the lumped parameter model of C-axis drive from GEISS five-axis CNC machine tool. The simulated results compare well with the experimental data measured from the actual machine. Also the paper describes the steps for data acquisition using ControlDesk and hardware-in-the-loop implementation of the drive models in dSPACE real-time system. The main components of the HIL system are: the drive model simulation and input - output (I/O) modules for receiving the real controller outputs. The paper explains how the experimental data obtained from the data acquisition process using dSPACE real-time system can be used for the development of machine tool diagnosis and prognosis systems that facilitate the improvement of maintenance activities.

  14. Improved mortar setup technique

    CSIR Research Space (South Africa)

    De Villiers, D

    2008-10-01

    Full Text Available bearing sensor. This concept focuses directly on one of the most cumbersome aspects of a mortar set-up, namely the use of aiming posts. The prismatic mirror and bearing dials is described as well as the required setup procedures. The measurement...

  15. Optimal replacement time estimation for machines and equipment based on cost function

    Directory of Open Access Journals (Sweden)

    J. Šebo

    2013-01-01

    Full Text Available The article deals with a multidisciplinary issue of estimating the optimal replacement time for the machines. Considered categories of machines, for which the optimization method is usable, are of the metallurgical and engineering production. Different models of cost function are considered (both with one and two variables. Parameters of the models were calculated through the least squares method. Models testing show that all are good enough, so for estimation of optimal replacement time is sufficient to use simpler models. In addition to the testing of models we developed the method (tested on selected simple model which enable us in actual real time (with limited data set to indicate the optimal replacement time. The indicated time moment is close enough to the optimal replacement time t*.

  16. Number of Tardy Jobs of Single Machine Scheduling Problem with Variable Processing Time

    Institute of Scientific and Technical Information of China (English)

    1999-01-01

    The number of tardy jobs of the single machine scheduling problem with a variable processing time is studied in accordance with the published instances of traffic transportation management engineering. It is proved by 3-partition problem that if the problem is of ready time and common deadline-constrained, its complexity is NP-hard in the strong sense. Finally, a polynomial algorithm for solving unit processing time and common deadline problems is proposed.

  17. Deflecting cavity dynamics for time-resolved machine studies of SXFEL user facility

    CERN Document Server

    Song, Minghao; Liu, Bo; Wang, Dong

    2016-01-01

    Radio frequency deflectors are widely used for time-resolved electron beam energy, emittance and radiation profile measurements in modern free electron laser facilities. In this paper, we present the beam dynamics aspects of the deflecting cavity of SXFEL user facility, which is located at the exit of the undulator. With a targeted time resolution around 10 fs, it is expected to be an important tool for time-resolved commissioning and machine studies for SXFEL user facility.

  18. An Analysis about The Time Machine in the Light of Darwinism

    Institute of Scientific and Technical Information of China (English)

    朱晓娟

    2013-01-01

      Time Machine is one of the representatives of Herbert George Wells, the father of the modern science fiction, describing human beings’degeneration in future and satirizing ruthless exploitation of workers by capitalists. This text analyzes Wells ’inten⁃tion of writing and his concerns about the development of human civilization.

  19. Wormholes and time-machines in nonminimally coupled matter-curvature theories of gravity

    DEFF Research Database (Denmark)

    Bertolami, O.; Ferreira, R. Z.

    2013-01-01

    In this work we show the existence of traversable wormhole and time-machine solutions in a modified theory of gravity where matter and curvature are nonminimally coupled. Those solutions present a nontrivial redshift function and exist even in the presence of ordinary matter which satisfies...

  20. Wormholes and Time-Machines in Nonminimally Coupled Matter-Curvature Theories of Gravity

    Directory of Open Access Journals (Sweden)

    Bertolami Orfeu

    2013-09-01

    Full Text Available In this work we show the existence of traversable wormhole and time-machine solutions in a modified theory of gravity where matter and curvature are nonminimally coupled. Those solutions present a nontrivial redshift function and exist even in the presence of ordinary matter which satisfies the dominant energy condition.

  1. Wormholes and time-machines in nonminimally coupled matter-curvature theories of gravity

    DEFF Research Database (Denmark)

    Bertolami, O.; Ferreira, R. Z.

    2013-01-01

    In this work we show the existence of traversable wormhole and time-machine solutions in a modified theory of gravity where matter and curvature are nonminimally coupled. Those solutions present a nontrivial redshift function and exist even in the presence of ordinary matter which satisfies...

  2. Time Machines with Non-compactly Generated Cauchy Horizons and "Handy Singularities"

    CERN Document Server

    Krasnikov, S V

    1997-01-01

    The use of "handy singularities" (i.e. singularities similar to those arising in the Deutch-Politzer space) enables one to avoid (almost) all known difficulties inherent usually to creation of time machines. A simple method is discussed for constructing a variety of such singularities. A few 3-dimensional examples are cited.

  3. One method for life time estimation of a bucket wheel machine for coal moving

    Science.gov (United States)

    Vîlceanu, Fl; Iancu, C.

    2016-08-01

    Rehabilitation of outdated equipment with lifetime expired, or in the ultimate life period, together with high cost investments for their replacement, makes rational the efforts made to extend their life. Rehabilitation involves checking operational safety based on relevant expertise of metal structures supporting effective resistance and assessing the residual lifetime. The bucket wheel machine for coal constitute basic machine within deposits of coal of power plants. The estimate of remaining life can be done by checking the loading on the most stressed subassembly by Finite Element Analysis on a welding detail. The paper presents step-by-step the method of calculus applied in order to establishing the residual lifetime of a bucket wheel machine for coal moving using non-destructive methods of study (fatigue cracking analysis + FEA). In order to establish the actual state of machine and areas subject to study, was done FEA of this mining equipment, performed on the geometric model of mechanical analyzed structures, with powerful CAD/FEA programs. By applying the method it can be calculated residual lifetime, by extending the results from the most stressed area of the equipment to the entire machine, and thus saving time and money from expensive replacements.

  4. A branch-and-bound algorithm for single-machine earliness-tardiness scheduling with idle time

    NARCIS (Netherlands)

    Hoogeveen, J.A.; Velde, van de S.L.

    1996-01-01

    We address the NP-hard single-machine problem of scheduling n independent jobs so as to minimize the sum of α times total completion time and β times total earliness with β > α, which can be rewritten as an earliness–tardiness problem. Postponing jobs by leaving the machine idle may then be advantag

  5. A branch-and-bound algorithm for single-machine earliness-tardiness scheduling with idle time

    NARCIS (Netherlands)

    Hoogeveen, J.A.; van de Velde, S.L.; van de Velde, S.L.

    1996-01-01

    We address the NP-hard single-machine problem of scheduling n independent jobs so as to minimize the sum of α times total completion time and β times total earliness with β > α, which can be rewritten as an earliness–tardiness problem. Postponing jobs by leaving the machine idle may then be

  6. Development of a Flexible Laser Hardening & Machining Center and Proof of Concept on C-45 Steel

    Science.gov (United States)

    Bouquet, Jan; Van Camp, Dries; Vanhove, Hans; Clijsters, Stijn; Amirahmad, Mohammadi; Lauwers, Bert

    The production of hardened precision parts is conventionally done in 3 steps. Rough machining of a workpiece in soft stage is followed by a hardening step, usually a batch process, and finalized by a hard machining finishing step. To omit the inevitable time delay and loss of accuracy because of part re-clamping, these steps should be incorporated within one flexible machining center. This paper describes the development of this machining center which allowsmachining and laser hardening in one setup, followed by a proof of concept for hardening C45 steel on this setup.

  7. Hinged Shields for Machine Tools

    Science.gov (United States)

    Lallande, J. B.; Poland, W. W.; Tull, S.

    1985-01-01

    Flaps guard against flying chips, but fold away for tool setup. Clear plastic shield in position to intercept flying chips from machine tool and retracted to give operator access to workpiece. Machine shops readily make such shields for own use.

  8. The New Method for CNC Trajectory Machining Motion Planning Based on Reference Time

    Institute of Scientific and Technical Information of China (English)

    JIANG Yongmin; XU Mingheng

    2006-01-01

    In order to make motion planning fitting practice, many characteristic of CNC trajectory motion are discussed, such as the geometric function, the motion and the time. It is found that the relation between orbit function and motional parameter, so the differential equation about the trajectory motion be set-up by the goal of trajectory motion. The actual motion process is defined as reference time to link planning and practice. Present a new movement planning method based on self-defining time. At rest state, the differential simultaneous equation can be calculated according geometric characteristic analysis, it can be get that simple function consisted of coordinate and reference time variants. At motive state, dynamic parameter can be worked out according practical value of reference time, It is proved by experiment and simulation that it is a good way to control geometry and motion comprehensively, to reduce computation times and to increase the ability of environmental adaptation for path planning

  9. ON-LINE SCHEDULING OF UNIT TIME JOBS WITH REJECTION ON UNIFORM MACHINES

    Institute of Scientific and Technical Information of China (English)

    Shoupeng LIU; Yuzhong ZHANG

    2008-01-01

    The authors consider the problem of on-line scheduling of unit execution time jobs on uniform machines with rejection penalty. The jobs arrive one by one and can be either accepted and scheduled, or be rejected. The objective is to minimize the total completion time of the accepted jobs and the total penalty of the rejection jobs. The authors propose an on-line algorithm and prove that the competitive ratio is 1/2 (2 + ) ≈ 1.86602.

  10. The Time and Cost Prediction of Tunnel Boring Machine in Tunnelling

    Institute of Scientific and Technical Information of China (English)

    2006-01-01

    Making use of microsoft visual studio. net platform, the assistant decision-making system of tunnel boring machine in tunnelling has been built to predict the time and cost. Computation methods of the performance parameters have been discussed. New time and cost prediction models have been depicted. The multivariate linear regression has been used to make the parameters more precise, which are the key factor to affect the prediction near to the reality.

  11. Discussion of Some Problems About Nonlinear Time Series Prediction Using v-Support Vector Machine

    Institute of Scientific and Technical Information of China (English)

    GAO Cheng-Feng; CHEN Tian-Lun; NAN Tian-Shi

    2007-01-01

    Some problems in using v-support vector machine (v-SVM) for the prediction of nonlinear time series are discussed. The problems include selection of various net parameters, which affect the performance of prediction, mixture of kernels, and decomposition cooperation linear programming v-SVM regression, which result in improvements of the algorithm. Computer simulations in the prediction of nonlinear time series produced by Mackey-Glass equation and Lorenz equation provide some improved results.

  12. Machine learning strategies for multi-step-ahead time series forecasting

    OpenAIRE

    Ben Taieb, Souhaib

    2014-01-01

    How much electricity is going to be consumed for the next 24 hours? What will be the temperature for the next three days? What will be the number of sales of a certain product for the next few months? Answering these questions often requires forecasting several future observations from a given sequence of historical observations, called a time series. Historically, time series forecasting has been mainly studied in econometrics and statistics. In the last two decades, machine learning, a fiel...

  13. Novel experimental setup for time-of-flight mass spectrometry ion detection in collisions of anionic species with neutral gas-phase molecular targets.

    Science.gov (United States)

    Oller, J C; Ellis-Gibbings, L; da Silva, F Ferreira; Limão-Vieira, P; García, G

    We report a novel experimental setup for studying collision induced products resulting from the interaction of anionic beams with a neutral gas-phase molecular target. The precursor projectile was admitted into vacuum through a commercial pulsed valve, with the anionic beam produced in a hollow cathode discharge-induced plasma, and guided to the interaction region by a set of deflecting plates where it was made to interact with the target beam. Depending on the collision energy regime, negative and positive species can be formed in the collision region and ions were time-of-flight (TOF) mass-analysed. Here, we present data on O2 precursor projectile, where we show clear evidence of O(-) and O2(-) formation from the hollow cathode source as well as preliminary results on the interaction of these anions with nitromethane, CH3NO2. The negative ions formed in such collisions were analysed using time-of-flight mass spectrometry. The five most dominant product anions were assigned to H(-), O(-), NO(-), CNO(-) and CH3NO2(-).

  14. From wormhole to time machine Comments on Hawking's Chronology Protection Conjecture

    CERN Document Server

    Visser, B M

    1993-01-01

    The recent interest in ``time machines'' has been largely fueled by the apparent ease with which such systems may be formed in general relativity, given relatively benign initial conditions such as the existence of traversable wormholes or of infinite cosmic strings. This rather disturbing state of affairs has led Hawking to formulate his Chronology Protection Conjecture, whereby the formation of ``time machines'' is forbidden. This paper will use several simple examples to argue that the universe appears to exhibit a ``defense in depth'' strategy in this regard. For appropriate parameter regimes Casimir effects, wormhole disruption effects, and gravitational back reaction effects all contribute to the fight against time travel. Particular attention is paid to the role of the quantum gravity cutoff. For the class of model problems considered it is shown that the gravitational back reaction becomes large before the Planck scale quantum gravity cutoff is reached, thus supporting Hawking's conjecture.

  15. An HTS machine laboratory prototype

    DEFF Research Database (Denmark)

    Mijatovic, Nenad; Jensen, Bogi Bech; Træholt, Chresten

    2012-01-01

    This paper describes Superwind HTS machine laboratory setup which is a small scale HTS machine designed and build as a part of the efforts to identify and tackle some of the challenges the HTS machine design may face. One of the challenges of HTS machines is a Torque Transfer Element (TTE) which...

  16. Approach towards sensor placement, selection and fusion for real-time condition monitoring of precision machines

    Science.gov (United States)

    Er, Poi Voon; Teo, Chek Sing; Tan, Kok Kiong

    2016-02-01

    Moving mechanical parts in a machine will inevitably generate vibration profiles reflecting its operating conditions. Vibration profile analysis is a useful tool for real-time condition monitoring to avoid loss of performance and unwanted machine downtime. In this paper, we propose and validate an approach for sensor placement, selection and fusion for continuous machine condition monitoring. The main idea is to use a minimal series of sensors mounted at key locations of a machine to measure and infer the actual vibration spectrum at a critical point where it is not suitable to mount a sensor. The locations for sensors' mountings which are subsequently used for vibration inference are identified based on sensitivity calibration at these locations moderated with normalized Fisher Information (NFI) associated with the measurement quality of the sensor at that location. Each of the identified sensor placement location is associated with one or more sensitive frequencies for which it ranks top in terms of the moderated sensitivities calibrated. A set of Radial Basis Function (RBF), each of them associated with a range of sensitive frequencies, is used to infer the vibration at the critical point for that frequency. The overall vibration spectrum of the critical point is then fused from these components. A comprehensive set of experimental results for validation of the proposed approach is provided in the paper.

  17. Non-contact test set-up for aeroelasticity in a rotating turbomachine combining a novel acoustic excitation system with tip-timing

    Science.gov (United States)

    Freund, O.; Montgomery, M.; Mittelbach, M.; Seume, J. R.

    2014-03-01

    Due to trends in aero-design, aeroelasticity becomes increasingly important in modern turbomachines. Design requirements of turbomachines lead to the development of high aspect ratio blades and blade integral disc designs (blisks), which are especially prone to complex modes of vibration. Therefore, experimental investigations yielding high quality data are required for improving the understanding of aeroelastic effects in turbomachines. One possibility to achieve high quality data is to excite and measure blade vibrations in turbomachines. The major requirement for blade excitation and blade vibration measurements is to minimize interference with the aeroelastic effects to be investigated. Thus in this paper, a non-contact—and thus low interference—experimental set-up for exciting and measuring blade vibrations is proposed and shown to work. A novel acoustic system excites rotor blade vibrations, which are measured with an optical tip-timing system. By performing measurements in an axial compressor, the potential of the acoustic excitation method for investigating aeroelastic effects is explored. The basic principle of this method is described and proven through the analysis of blade responses at different acoustic excitation frequencies and at different rotational speeds. To verify the accuracy of the tip-timing system, amplitudes measured by tip-timing are compared with strain gage measurements. They are found to agree well. Two approaches to vary the nodal diameter (ND) of the excited vibration mode by controlling the acoustic excitation are presented. By combining the different excitable acoustic modes with a phase-lag control, each ND of the investigated 30 blade rotor can be excited individually. This feature of the present acoustic excitation system is of great benefit to aeroelastic investigations and represents one of the main advantages over other excitation methods proposed in the past. In future studies, the acoustic excitation method will be used

  18. Minimum Time Trajectory Optimization of CNC Machining with Tracking Error Constraints

    Directory of Open Access Journals (Sweden)

    Qiang Zhang

    2014-01-01

    Full Text Available An off-line optimization approach of high precision minimum time feedrate for CNC machining is proposed. Besides the ordinary considered velocity, acceleration, and jerk constraints, dynamic performance constraint of each servo drive is also considered in this optimization problem to improve the tracking precision along the optimized feedrate trajectory. Tracking error is applied to indicate the servo dynamic performance of each axis. By using variable substitution, the tracking error constrained minimum time trajectory planning problem is formulated as a nonlinear path constrained optimal control problem. Bang-bang constraints structure of the optimal trajectory is proved in this paper; then a novel constraint handling method is proposed to realize a convex optimization based solution of the nonlinear constrained optimal control problem. A simple ellipse feedrate planning test is presented to demonstrate the effectiveness of the approach. Then the practicability and robustness of the trajectory generated by the proposed approach are demonstrated by a butterfly contour machining example.

  19. Sub-nanosecond machine timing and frequency distribution via serial data links

    CERN Document Server

    Rohlev, A; Serrano, J; Cattin, M; Settler, M

    2008-01-01

    FERMI@ELETTRA is a 4th generation light source under construction at Sincrotrone Trieste. It will be operated as a seeded FEL driven by a warm S-band Linac which places very stringent specifications on control of the amplitude and phase of the RF stations. The local clock generation and distribution system at each station will not be based on the phase reference distribution but rather on a separate frequency reference distribution which has significantly less stringent phase stability requirements. This frequency reference will be embedded in the serial data link to each station and has the further advantage of being able to broadcast synchronous machine timing signals with sub-nanosecond temporal accuracy. The phase and amplitude of the phase reference line is measured for each pulse and used to calibrate the other measurements. This paper describes the architecture used to distribute the frequency reference along with the precision machine timing and clocking signals.

  20. SEMI-DEFINITE RELAXATION ALGORITHM FOR SINGLE MACHINE SCHEDULING WITH CONTROLLABLE PROCESSING TIMES

    Institute of Scientific and Technical Information of China (English)

    CHEN FENG; ZHANG LIANSHENG

    2005-01-01

    The authors present a semi-definite relaxation algorithm for the scheduling problem with controllable times on a single machine. Their approach shows how to relate this problem with the maximum vertex-cover problem with kernel constraints (MKVC).The established relationship enables to transfer the approximate solutions of MKVCinto the approximate solutions for the scheduling problem. Then, they show how to obtain an integer approximate solution for MKVC based on the semi-definite relaxation and randomized rounding technique.

  1. No Time Machine Construction in Open 2+1 Gravity with Timelike Total Energy Momentum

    CERN Document Server

    Tiglio, M H

    1998-01-01

    It is shown that in 2+1 dimensional gravity an open spacetime with timelike total energy momentum cannot have a stable compactly generated Cauchy horizon. This constitutes a proof of a version of Kabat's conjecture and shows, in particular, that not only a Gott pair cannot be formed from the decay of a single cosmic string as has been shown by Carroll et al., but that, in a precise sense, a time machine cannot be constructed at all.

  2. Hybrid Machine Learning Technique for Forecasting Dhaka Stock Market Timing Decisions

    OpenAIRE

    Shipra Banik; Khodadad Khan, A. F. M.; Mohammad Anwer

    2014-01-01

    Forecasting stock market has been a difficult job for applied researchers owing to nature of facts which is very noisy and time varying. However, this hypothesis has been featured by several empirical experiential studies and a number of researchers have efficiently applied machine learning techniques to forecast stock market. This paper studied stock prediction for the use of investors. It is always true that investors typically obtain loss because of uncertain investment purposes and unsigh...

  3. Discussion About Nonlinear Time Series Prediction Using Least Squares Support Vector Machine

    Institute of Scientific and Technical Information of China (English)

    XU Rui-Rui; BIAN Guo-Xing; GAO Chen-Feng; CHEN Tian-Lun

    2005-01-01

    The least squares support vector machine (LS-SVM) is used to study the nonlinear time series prediction.First, the parameter γ and multi-step prediction capabilities of the LS-SVM network are discussed. Then we employ clustering method in the model to prune the number of the support values. The learning rate and the capabilities of filtering noise for LS-SVM are all greatly improved.

  4. Energy-momentum restrictions on the creation of gott time machines

    CERN Document Server

    Carroll, S M; Guth, A H; Olum, K D; Sean M Carroll; Edward Farhi; Alan H Guth; Ken D Olum

    1994-01-01

    The discovery by Gott of a remarkably simple spacetime with closed timelike curves (CTC's) provides a tool for investigating how the creation of time machines is prevented in classical general relativity. The Gott spacetime contains two infinitely long, parallel cosmic strings, which can equivalently be viewed as point masses in (2+1)-dimensional gravity. We examine the possibility of building such a time machine in an open universe. Specifically, we consider initial data specified on an edgeless, noncompact, spacelike hypersurface, for which the total momentum is timelike (i.e., not the momentum of a Gott spacetime). In contrast to the case of a closed universe (in which Gott pairs, although not CTC's, can be produced from the decay of stationary particles), we find that there is never enough energy for a Gott-like time machine to evolve from the specified data; it is impossible to accelerate two particles to sufficiently high velocity. Thus, the no-CTC theorems of Tipler and Hawking are enforced in an open ...

  5. A Note on Two-Agent Scheduling with Resource Dependent Release Times on a Single Machine

    Directory of Open Access Journals (Sweden)

    Peng Liu

    2015-01-01

    Full Text Available We consider a scheduling problem in which both resource dependent release times and two agents exist simultaneously. Two agents share a common single machine, and each agent wants to minimize a cost function dependent on its own jobs. The release time of each A-agent’s job is related to the amount of resource consumed. The objective is to find a schedule for the problem of minimizing A-agent’s total amount of resource consumption with a constraint on B-agent’s makespan. The optimal properties and the optimal polynomial time algorithm are proposed to solve the scheduling problem.

  6. Productivity improvement of high end cnc machines by dmaic methodology

    OpenAIRE

    Veeresh Bhusnur; Dr. Bhimasen Soragaon; Hemanth Kumar C

    2017-01-01

    This research mainly emphasizes on productivity improvement with the application of DMAIC (Define, Measure, Analyze, Measure, Improve, Control) which is sub methodology of Six Sigma. It shows the application of Six Sigma in Auma India Pvt. Ltd. to reduce the cycle time and set-up times of High End CNC machines. At Auma, one of the most critical problem is that the existing production rate cannot meet the customer demands. This work was focused on improving the production rate of CNC machines ...

  7. Real-time machine vision FPGA implementation for microfluidic monitoring on Lab-on-Chips.

    Science.gov (United States)

    Sotiropoulou, Calliope-Louisa; Voudouris, Liberis; Gentsos, Christos; Demiris, Athanasios M; Vassiliadis, Nikolaos; Nikolaidis, Spyridon

    2014-04-01

    A machine vision implementation on a field-programmable gate array (FPGA) device for real-time microfluidic monitoring on Lab-On-Chips is presented in this paper. The machine vision system is designed to follow continuous or plug flows, for which the menisci of the fluids are always visible. The system discriminates between the front or "head" of the flow and the back or "tail" and is able to follow flows with a maximum speed of 20 mm/sec in circular channels of a diameter of 200 μm (corresponding to approx. 60 μl/sec ). It is designed to be part of a complete Point-of-Care system, which will be portable and operate in non-ideal laboratory conditions. Thus, it is able to cope with noise due to lighting conditions and small LoC displacements during the experiment execution. The machine vision system can be used for a variety of LoC devices, without the need for fiducial markers (such as redundancy patterns) for its operation. The underlying application requirements called for a complete hardware implementation. The architecture uses a variety of techniques to improve performance and minimize memory access requirements. The system input is 8 bit grayscale uncompressed video of up to 1 Mpixel resolution. The system uses an operating frequency of 170 Mhz and achieves a computational time of 13.97 ms (worst case), which leads to a throughput of 71.6 fps for 1 Mpixel video resolution.

  8. Real-Time Simulation and Analysis of the Induction Machine Performances Operating at Flux Constant

    Directory of Open Access Journals (Sweden)

    Aziz Derouich

    2014-05-01

    Full Text Available In this paper, we are interested, in a first time, at the study and the implementation of a V/f control for induction machine in real time. After, We are attached to a comparison of the results by simulation and experiment for, speed responses, flux and currents of the real machine, with a DSPACE card and model established by classical identification (Direct Current test , blocked-rotor test, no-load test , synchronous test, to ensure the validity of the established model. The scalar controlled induction motor allows operation of the motor with the maximum torque by simultaneous action on the frequency and amplitude of the stator voltage, with conservation of the ratio V/f. Speed reference imposes a frequency at the inverter supplying the voltages needed to power the motor, which determines the speed of rotation. The maximum torque of the machine is proportional to the square of the supply voltage and inversely proportional to the frequency voltage. So, Keep V/f constant implies a operating with maximum constant torque. The results obtained for the rotor flux and the stator currents are especially satisfactory steady.

  9. Modeling the Scheduling Problem of Identical Parallel Machines with Load Balancing by Time Petri Nets

    Directory of Open Access Journals (Sweden)

    Sekhri Larbi

    2014-12-01

    Full Text Available The optimal resources allocation to tasks was the primary objective of the research dealing with scheduling problems. These problems are characterized by their complexity, known as NP-hard in most cases. Currently with the evolution of technology, classical methods are inadequate because they degrade system performance (inflexibility, inefficient resources using policy, etc.. In the context of parallel and distributed systems, several computing units process multitasking applications in concurrent way. Main goal of such process is to schedule tasks and map them on the appropriate machines to achieve the optimal overall system performance (Minimize the Make-span and balance the load among the machines. In this paper we present a Time Petri Net (TPN based approach to solve the scheduling problem by mapping each entity (tasks, resources and constraints to correspondent one in the TPN. In this case, the scheduling problem can be reduced to finding an optimal sequence of transitions leading from an initial marking to a final one. Our approach improves the classical mapping algorithms by introducing a control over resources allocation and by taking into consideration the resource balancing aspect leading to an acceptable state of the system. The approach is applied to a specific class of problems where the machines are parallel and identical. This class is analyzed by using the TiNA (Time Net Analyzer tool software developed in the LAAS laboratory (Toulouse, France.

  10. Parallel patterns determination in solving cyclic flow shop problem with setups

    Directory of Open Access Journals (Sweden)

    Bożejko Wojciech

    2017-06-01

    Full Text Available The subject of this work is the new idea of blocks for the cyclic flow shop problem with setup times, using multiple patterns with different sizes determined for each machine constituting optimal schedule of cities for the traveling salesman problem (TSP. We propose to take advantage of the Intel Xeon Phi parallel computing environment during so-called ’blocks’ determination basing on patterns, in effect significantly improving the quality of obtained results.

  11. A two-level real-time vision machine combining coarse and fine grained parallelism

    DEFF Research Database (Denmark)

    Jensen, Lars Baunegaard With; Kjær-Nielsen, Anders; Pauwels, Karl;

    2010-01-01

    In this paper, we describe a real-time vision machine having a stereo camera as input generating visual information on two different levels of abstraction. The system provides visual low-level and mid-level information in terms of dense stereo and optical flow, egomotion, indicating areas...... a factor 90 and a reduction of latency of a factor 26 compared to processing on a single CPU--core. Since the vision machine provides generic visual information it can be used in many contexts. Currently it is used in a driver assistance context as well as in two robotic applications....... with independently moving objects as well as a condensed geometric description of the scene. The system operates at more than 20 Hz using a hybrid architecture consisting of one dual--GPU card and one quad-core CPU. The different processing stages of visual information have rather different characteristics...

  12. STUDY OF MACHINING PROCESS MONITORING OF FMS BASED ON TIME SERIES ANALYSIS

    Institute of Scientific and Technical Information of China (English)

    Zhang Libin; Su Jian; Liu Yumei; Jia Yazhou

    2004-01-01

    FMS is a sort of highly automatic machining system,how to ensure part quality is master key to system highly active running.At first, series of machining dimension and process capability of flexible manufacturing system(FMS), is analyzed.Result of its, strong self-correlation of data series shows that time series analysis is applicable to data series analyzed.Based on-line modeling and forecasting for data series, principle and method of feedback compensation control is proposed.On a foundation of the virtual instrument platform, Labview of national instrument (NI), FMS dimension and process capability monitoring system(monitoring system) is developed.In practice, it is proved that part quality and process capability of FMS are greatly improved.

  13. Minimizing Tardy Jobs in a Single Machine Scheduling Problem with Fuzzy Processing Times and Due Dates

    Institute of Scientific and Technical Information of China (English)

    2005-01-01

    The optimality of a fuzzy logic alternative to the usual treatment of uncertainties in a scheduling system using fuzzy numbers is examined formally. Processing times and due dates are fuzzified and presented by fuzzy numbers. With introducing the necessity measure, we compare fuzzy completion times of jobs with fuzzy due dates to decide whether jobs are tardy. The object is to minimize the numbers of tardy jobs.The efficient solution method for this problem is proposed. And deterministic counterpart of this single machine scheduling problem is a special case of fuzzy version.

  14. Time-dependent solution for the manufacturing line with unreliable machine and batched arrivals

    Science.gov (United States)

    Kempa, W. M.; Paprocka, I.; Grabowik, C.; Kalinowski, K.

    2015-11-01

    Time-dependent queue-size distribution in a finite-buffer manufacturing line with unreliable machine is investigated. Successive jobs arrive in batches (groups) with sizes being generally distributed random variables, and are being processed individually with exponential service times. Applying the approach based on the memory less property of exponential distribution and the total probability law, a system of integral equations for the transient queue- size distribution conditioned by the initial level of buffer saturation is derived. The solution of the corresponding system written for Laplace transforms is found via linear-algebraic approach.

  15. Delay time dependence of thermal effect of combined pulse laser machining

    Science.gov (United States)

    Yuan, Boshi; Jin, Guangyong; Ma, Yao; Zhang, Wei

    2016-10-01

    The research focused on the effect of delay time in combined pulse laser machining on the material temperature field. Aiming at the parameter optimization of pulse laser machining aluminum alloy, the combined pulse laser model based on heat conduction equation was introduced. And the finite element analysis software, COMSOL Multiphysics, was also utilized in the research. Without considering the phase transition process of aluminum alloy, the results of the numerical simulation was shown in this paper. By the simulation study of aluminum alloy's irradiation with combined pulse, the effect of the change in delay time of combined pulse on the temperature field of the aluminum alloy and simultaneously the quantized results under the specific laser spot conditions were obtained. Based on the results, several conclusions could be reached, the delay time could affect the rule of temperature changing with time. The reasonable delay time controlling would help improving the efficiency. In addition, when the condition of the laser pulse energy density is constant, the optimal delay time depends on pulse sequence.

  16. Support vector echo-state machine for chaotic time-series prediction.

    Science.gov (United States)

    Shi, Zhiwei; Han, Min

    2007-03-01

    A novel chaotic time-series prediction method based on support vector machines (SVMs) and echo-state mechanisms is proposed. The basic idea is replacing "kernel trick" with "reservoir trick" in dealing with nonlinearity, that is, performing linear support vector regression (SVR) in the high-dimension "reservoir" state space, and the solution benefits from the advantages from structural risk minimization principle, and we call it support vector echo-state machines (SVESMs). SVESMs belong to a special kind of recurrent neural networks (RNNs) with convex objective function, and their solution is global, optimal, and unique. SVESMs are especially efficient in dealing with real life nonlinear time series, and its generalization ability and robustness are obtained by regularization operator and robust loss function. The method is tested on the benchmark prediction problem of Mackey-Glass time series and applied to some real life time series such as monthly sunspots time series and runoff time series of the Yellow River, and the prediction results are promising.

  17. Machine Translation

    Institute of Scientific and Technical Information of China (English)

    张严心

    2015-01-01

    As a kind of ancillary translation tool, Machine Translation has been paid increasing attention to and received different kinds of study by a great deal of researchers and scholars for a long time. To know the definition of Machine Translation and to analyse its benefits and problems are significant for translators in order to make good use of Machine Translation, and helpful to develop and consummate Machine Translation Systems in the future.

  18. Simultaneous Scheduling of Jobs, AGVs and Tools Considering Tool Transfer Times in Multi Machine FMS By SOS Algorithm

    Science.gov (United States)

    Sivarami Reddy, N.; Ramamurthy, D. V., Dr.; Prahlada Rao, K., Dr.

    2017-08-01

    This article addresses simultaneous scheduling of machines, AGVs and tools where machines are allowed to share the tools considering transfer times of jobs and tools between machines, to generate best optimal sequences that minimize makespan in a multi-machine Flexible Manufacturing System (FMS). Performance of FMS is expected to improve by effective utilization of its resources, by proper integration and synchronization of their scheduling. Symbiotic Organisms Search (SOS) algorithm is a potent tool which is a better alternative for solving optimization problems like scheduling and proven itself. The proposed SOS algorithm is tested on 22 job sets with makespan as objective for scheduling of machines and tools where machines are allowed to share tools without considering transfer times of jobs and tools and the results are compared with the results of existing methods. The results show that the SOS has outperformed. The same SOS algorithm is used for simultaneous scheduling of machines, AGVs and tools where machines are allowed to share tools considering transfer times of jobs and tools to determine the best optimal sequences that minimize makespan.

  19. Implementation of Real-Time Machining Process Control Based on Fuzzy Logic in a New STEP-NC Compatible System

    Directory of Open Access Journals (Sweden)

    Po Hu

    2016-01-01

    Full Text Available Implementing real-time machining process control at shop floor has great significance on raising the efficiency and quality of product manufacturing. A framework and implementation methods of real-time machining process control based on STEP-NC are presented in this paper. Data model compatible with ISO 14649 standard is built to transfer high-level real-time machining process control information between CAPP systems and CNC systems, in which EXPRESS language is used to define new STEP-NC entities. Methods for implementing real-time machining process control at shop floor are studied and realized on an open STEP-NC controller, which is developed using object-oriented, multithread, and shared memory technologies conjunctively. Cutting force at specific direction of machining feature in side mill is chosen to be controlled object, and a fuzzy control algorithm with self-adjusting factor is designed and embedded in the software CNC kernel of STEP-NC controller. Experiments are carried out to verify the proposed framework, STEP-NC data model, and implementation methods for real-time machining process control. The results of experiments prove that real-time machining process control tasks can be interpreted and executed correctly by the STEP-NC controller at shop floor, in which actual cutting force is kept around ideal value, whether axial cutting depth changes suddenly or continuously.

  20. Bicriteria Scheduling on a Series-Batching Machine to Minimize Makespan and Total Weighted Completion Time with Equal Length Job

    Institute of Scientific and Technical Information of China (English)

    HE Cheng; LIN Hao; DOU Jun-mei; MU Yun-dong

    2014-01-01

    It is known that the problem of minimizing total weighted completion time on a series-batching machine is NP-hard. We consider a series-batching bicriteria scheduling problem of minimizing makespan and total weighted completion time with equal length job simultaneously. A batching machine can handle up to b jobs in a batch, where b is called the batch capacity of the machine. We study the unbounded model with b≥n, where n denotes the number of jobs. A dynamic programming algorithm is proposed to solve the unbounded model, which can find all Pareto optimal schedules in O(n3) time.

  1. Improving the applicability of workload control (WLC) : the influence of sequence-dependent set-up times on workload controlled job shops

    NARCIS (Netherlands)

    Thurer, M.; Stevenson, M.; Silva, C.; Land, M.J.

    2012-01-01

    Simulation has demonstrated that the workload control (WLC) concept can improve performance in job shops, but positive empirical results are scarce. A key reason for this is that the concept has not been developed to handle a number of practical considerations, including sequence-dependent set-up ti

  2. Generation and Validation of Spatial Distribution of Hourly Wind Speed Time-Series using Machine Learning

    Science.gov (United States)

    Veronesi, F.; Grassi, S.

    2016-09-01

    Wind resource assessment is a key aspect of wind farm planning since it allows to estimate the long term electricity production. Moreover, wind speed time-series at high resolution are helpful to estimate the temporal changes of the electricity generation and indispensable to design stand-alone systems, which are affected by the mismatch of supply and demand. In this work, we present a new generalized statistical methodology to generate the spatial distribution of wind speed time-series, using Switzerland as a case study. This research is based upon a machine learning model and demonstrates that statistical wind resource assessment can successfully be used for estimating wind speed time-series. In fact, this method is able to obtain reliable wind speed estimates and propagate all the sources of uncertainty (from the measurements to the mapping process) in an efficient way, i.e. minimizing computational time and load. This allows not only an accurate estimation, but the creation of precise confidence intervals to map the stochasticity of the wind resource for a particular site. The validation shows that machine learning can minimize the bias of the wind speed hourly estimates. Moreover, for each mapped location this method delivers not only the mean wind speed, but also its confidence interval, which are crucial data for planners.

  3. Time dynamics of burst-train filamentation assisted femtosecond laser machining in glasses.

    Science.gov (United States)

    Esser, Dagmar; Rezaei, Saeid; Li, Jianzhao; Herman, Peter R; Gottmann, Jens

    2011-12-05

    Bursts of femtosecond laser pulses with a repetition rate of f = 38.5MHz were created using a purpose-built optical resonator. Single Ti:Sapphire laser pulses, trapped inside a resonator and released into controllable burst profiles by computer generated trigger delays to a fast Pockels cell switch, drove filamentation-assisted laser machining of high aspect ratio holes deep into transparent glasses. The time dynamics of the hole formation and ablation plume physics on 2-ns to 400-ms time scales were examined in time-resolved side-view images recorded with an intensified-CCD camera during the laser machining process. Transient effects of photoluminescence and ablation plume emissions confirm the build-up of heat accumulation effects during the burst train, the formation of laser-generated filaments and plume-shielding effects inside the deeply etched vias. The small time interval between the pulses in the present burst train enabled a more gentle modification in the laser interaction volume that mitigated shock-induced microcracks compared with single pulses.

  4. The ASDEX upgrade digital video processing system for real-time machine protection

    Energy Technology Data Exchange (ETDEWEB)

    Drube, Reinhard, E-mail: reinhard.drube@ipp.mpg.de [Max-Planck-Institut für Plasmaphysik, EURATOM Association, Boltzmannstr. 2, 85748 Garching (Germany); Neu, Gregor [Max-Planck-Institut für Plasmaphysik, EURATOM Association, Boltzmannstr. 2, 85748 Garching (Germany); Cole, Richard H.; Lüddecke, Klaus [Unlimited Computer Systems GmbH, Seeshaupterstr. 15, 82393 Iffeldorf (Germany); Lunt, Tilmann; Herrmann, Albrecht [Max-Planck-Institut für Plasmaphysik, EURATOM Association, Boltzmannstr. 2, 85748 Garching (Germany)

    2013-11-15

    Highlights: • We present the Real-Time Video diagnostic system of ASDEX Upgrade. • We show the implemented image processing algorithms for machine protection. • The way to achieve a robust operating multi-threading Real-Time system is described. -- Abstract: This paper describes the design, implementation, and operation of the Video Real-Time (VRT) diagnostic system of the ASDEX Upgrade plasma experiment and its integration with the ASDEX Upgrade Discharge Control System (DCS). Hot spots produced by heating systems erroneously or accidentally hitting the vessel walls, or from objects in the vessel reaching into the plasma outer border, show up as bright areas in the videos during and after the reaction. A system to prevent damage to the machine by allowing for intervention in a running discharge of the experiment was proposed and implemented. The VRT was implemented on a multi-core real-time Linux system. Up to 16 analog video channels (color and b/w) are acquired and multiple regions of interest (ROI) are processed on each video frame. Detected critical states can be used to initiate appropriate reactions – e.g. gracefully terminate the discharge. The system has been in routine operation since 2007.

  5. Extracting Date/Time Expressions in Super-Function Based Japanese-English Machine Translation

    Science.gov (United States)

    Sasayama, Manabu; Kuroiwa, Shingo; Ren, Fuji

    Super-Function Based Machine Translation(SFBMT) which is a type of Example-Based Machine Translation has a feature which makes it possible to expand the coverage of examples by changing nouns into variables, however, there were problems extracting entire date/time expressions containing parts-of-speech other than nouns, because only nouns/numbers were changed into variables. We describe a method for extracting date/time expressions for SFBMT. SFBMT uses noun determination rules to extract nouns and a bilingual dictionary to obtain correspondence of the extracted nouns between the source and the target languages. In this method, we add a rule to extract date/time expressions and then extract date/time expressions from a Japanese-English bilingual corpus. The evaluation results shows that the precision of this method for Japanese sentences is 96.7%, with a recall of 98.2% and the precision for English sentences is 94.7%, with a recall of 92.7%.

  6. Note on a Single-Machine Scheduling Problem with Sum of Processing Times Based Learning and Ready Times

    Directory of Open Access Journals (Sweden)

    Shang-Chia Liu

    2015-01-01

    Full Text Available In the recent 20 years, scheduling with learning effect has received considerable attention. However, considering the learning effect along with release time is limited. In light of these observations, in this paper, we investigate a single-machine problem with sum of processing times based learning and ready times where the objective is to minimize the makespan. For solving this problem, we build a branch-and-bound algorithm and a heuristic algorithm for the optimal solution and near-optimal solution, respectively. The computational experiments indicate that the branch-and-bound algorithm can perform well the problem instances up to 24 jobs in terms of CPU time and node numbers, and the average error percentage of the proposed heuristic algorithm is less than 0.5%.

  7. Extensions of cutting problems: setups

    Directory of Open Access Journals (Sweden)

    Sebastian Henn

    2013-08-01

    Full Text Available Even though the body of literature in the area of cutting and packing is growing rapidly, research seems to focus on standard problems in the first place, while practical aspects are less frequently dealt with. This is particularly true for setup processes which arise in industrial cutting processes whenever a new cutting pattern is started (i.e. a pattern is different from its predecessor and the cutting equipment has to be prepared in order to meet the technological requirements of the new pattern. Setups involve the consumption of resources and the loss of production time capacity. Therefore, consequences of this kind must explicitly be taken into account for the planning and control of industrial cutting processes. This results in extensions to traditional models which will be reviewed here. We show how setups can be represented in such models, and we report on the algorithms which have been suggested for the determination of solutions of the respective models. We discuss the value of these approaches and finally point out potential directions of future research.

  8. PLL Usage in the General Machine Timing System for the LHC

    CERN Document Server

    Alvarez-Sanchez, P; King, Q; Lewis, J; Serrano, J; Todd, B

    2003-01-01

    Analogue PLLs have been successfully used for decades to recover clocks and clean the jitter introduced by transmission media. Nevertheless the design parameters are hard to change once the PCB has been mounted. Digital PLLs overcome this problem. They can be either completely digital, substituting the VCO by a Numeric Oscillator, or they can keep a VCXO in case a low jitter is needed. This paper describes both configurations and gives lab results for the latter. This architecture will be used in every General Machine Timing reveiver card for the LHC.

  9. Reservation System for machine time in the laboratories of the University of Information Sciences

    Directory of Open Access Journals (Sweden)

    Omar Mar Cornelio

    2013-12-01

    Full Text Available In organizations that many people have access to services of machine time, it requires proper planning and control. At the University of Computer Sciences, is done through pre-printed models which generates an inefficient management and poor quality service. In this paper we describe the solution of this problem from the computerization of the process for which was coded using a programming language such as PHP5 on Eclipse Integrated Development Environment with CodeIgniter framework, MySQL as a delivery system database. The system also has a set of reports that facilitate decision making to managers such as availability, location number reserved among others.

  10. Execution time supports for adaptive scientific algorithms on distributed memory machines

    Science.gov (United States)

    Berryman, Harry; Saltz, Joel; Scroggs, Jeffrey

    1990-01-01

    Optimizations are considered that are required for efficient execution of code segments that consists of loops over distributed data structures. The PARTI (Parallel Automated Runtime Toolkit at ICASE) execution time primitives are designed to carry out these optimizations and can be used to implement a wide range of scientific algorithms on distributed memory machines. These primitives allow the user to control array mappings in a way that gives an appearance of shared memory. Computations can be based on a global index set. Primitives are used to carry out gather and scatter operations on distributed arrays. Communications patterns are derived at runtime, and the appropriate send and receive messages are automatically generated.

  11. Single-machine scheduling to minimize total completion time and tardiness with two competing agents.

    Science.gov (United States)

    Lee, Wen-Chiung; Shiau, Yau-Ren; Chung, Yu-Hsiang; Ding, Lawson

    2014-01-01

    We consider a single-machine two-agent problem where the objective is to minimize a weighted combination of the total completion time and the total tardiness of jobs from the first agent given that no tardy jobs are allowed for the second agent. A branch-and-bound algorithm is developed to derive the optimal sequence and two simulated annealing heuristic algorithms are proposed to search for the near-optimal solutions. Computational experiments are also conducted to evaluate the proposed branch-and-bound and simulated annealing algorithms.

  12. Control, anticontrol and synchronization of chaos for an autonomous rotational machine system with time-delay

    Energy Technology Data Exchange (ETDEWEB)

    Ge Zhengming [Department of Mechanical Engineering, National Chiao Tung University, 1001 Ta Hsueh Road, Hsinchu 300, Taiwan (China)]. E-mail: zmg@cc.nctu.edu.tw; Lee, Ching-I [Department of Mechanical Engineering, National Chiao Tung University, 1001 Ta Hsueh Road, Hsinchu 300, Taiwan (China)

    2005-03-01

    Chaos, control, anticontrol and synchronization of chaos for an autonomous rotational machine system with a hexagonal centrifugal governor and spring for which time-delay effect is considered are studied in the paper. By applying numerical results, phase diagram and power spectrum are presented to observe periodic and chaotic motions. Linear feedback control and adaptive control algorithm are used to control chaos effectively. Linear and nonlinear feedback synchronization and phase synchronization for the coupled systems are presented. Finally, anticontrol of chaos for this system is also studied.

  13. An efficient inplementation of boolean functions and finite state machines as self-timed circuits

    Energy Technology Data Exchange (ETDEWEB)

    David, I.; Ginosar, R.; Yoeli, M. (Technion-Israel Institute of Technology, Haifa (IL))

    1989-12-01

    Self-timed logic provides a method for designing logic circuits such that their correct behavior depends neither on the speed of their components nor on the delay along the communication wires. General synthesis methods for efficiently implementing self-timed combinational logic (CL) and finite state machines (FSM) are presented. The resulting CL is shown to require less gates than other proposed methods. The FSM is implemented by interconnectng a CL module with a self-timed master-slave register. The FSM synthesis method is also compared with other approaches. A formal system of behavioral sequential constraints is presented for each of the systems, and their behavior is proven correct. Thus, the synthesized CLs and FSMs can serve as correct-by-construction building blocks for self-timed silicon system compilation.

  14. Prediction of chaotic time series based on modified minimax probability machine regression

    Institute of Scientific and Technical Information of China (English)

    Sun Jian-Cheng

    2007-01-01

    Long-term prediction of chaotic time series is very difficult, for the chaos restricts predictability. In thie paper a new method is studied to model and predict chaotic time series based on minimax probability machine regression (MPMR). Since the positive global Lyapunov exponents lead the errors to increase exponentially in modelling the chaotic time series, a weighted term is introduced to compensate a cost function. Using mean square error (MSE) and absolute error (AE) as a criterion, simulation results show that the proposed method is more effective and accurate for multistep prediction. It can identify the system characteristics quite well and provide a new way to make long-term predictions of the chaotic time series.

  15. Towards a Formal Semantics for UML/MARTE State Machines Based on Hierarchical Timed Automata

    Institute of Scientific and Technical Information of China (English)

    Yu Zhou; Luciano Baresi; Matteo Rossi

    2013-01-01

    UML is a widely-used,general purpose modeling language.But its lack of a rigorous semantics forbids the thorough analysis of designed solution,and thus precludes the discovery of significant problems at design time.To bridge the gap,the paper investigates the underlying semantics of UML state machine diagrams,along with the time-related modeling elements of MARTE,the profile for modeling and analysis of real-time embedded systems,and proposes a formal operational semantics based on extended hierarchical timed automata.The approach is exemplified on a simple example taken from the automotive domain.Verification is accomplished by translating designed models into the input language of the UPPAAL model checker.

  16. A Novel Approach for Multi Class Fault Diagnosis in Induction Machine Based on Statistical Time Features and Random Forest Classifier

    Science.gov (United States)

    Sonje, M. Deepak; Kundu, P.; Chowdhury, A.

    2017-08-01

    Fault diagnosis and detection is the important area in health monitoring of electrical machines. This paper proposes the recently developed machine learning classifier for multi class fault diagnosis in induction machine. The classification is based on random forest (RF) algorithm. Initially, stator currents are acquired from the induction machine under various conditions. After preprocessing the currents, fourteen statistical time features are estimated for each phase of the current. These parameters are considered as inputs to the classifier. The main scope of the paper is to evaluate effectiveness of RF classifier for individual and mixed fault diagnosis in induction machine. The stator, rotor and mixed faults (stator and rotor faults) are classified using the proposed classifier. The obtained performance measures are compared with the multilayer perceptron neural network (MLPNN) classifier. The results show the much better performance measures and more accurate than MLPNN classifier. For demonstration of planned fault diagnosis algorithm, experimentally obtained results are considered to build the classifier more practical.

  17. CARMA Correlator Graphical Setup

    Science.gov (United States)

    Wu, D.; Shaya, B.; Pound, M. W.

    2011-07-01

    CARMA Correlator Graphical Setup (CGS) is a Java tool to help users of the Combined Array for Research in Millimeter-wave Astronomy (CARMA) plan observations. It allows users to visualize the correlator bands overlaid on frequency space and view spectral lines within each band. Bands can be click-dragged to anywhere in frequency and can have their properties (e.g., bandwidth, quantization level, rest frequency) changed interactively. Spectral lines can be filtered from the view by expected line strength to reduce visual clutter. Once the user is happy with the setup, a button click generates the Python commands needed to configure the correlator within the observing script. CGS can also read Python configurations from an observing script and reproduce the correlator setup that was used. Because the correlator hardware description is defined in an XML file, the tool can be rapidly reconfigured for changing hardware. This has been quite useful as CARMA has recently commissioned a new correlator. The tool was written in Java by high school summer interns working in UMD's Laboratory for Millimeter Astronomy and has become an essential planning tool for CARMA PIs.

  18. ASSESSMENT OF INFLUENCE OF CUTTING TOOL BREAKAGE ON DRIVE LIFE TIME OF CUTTING UNIT OF HEADING MACHINE

    Directory of Open Access Journals (Sweden)

    О.Е. SHABAEV

    2014-01-01

    Full Text Available In this work a necessity to develop means of technical diagnostics of cutter's performance without stopping heading machine was grounded. There was theoretically demonstrated the possibility of essential decrease in life time of transmission elements of cutting unit during prolonged work of heading machine with broken cutting tool. It was defined that influence of cutting tool breakage on life time of transmission elements depends on cutting tool position on cutting head according to the assembly drawing.

  19. Using machine learning to identify structural breaks in single-group interrupted time series designs.

    Science.gov (United States)

    Linden, Ariel; Yarnold, Paul R

    2016-12-01

    Single-group interrupted time series analysis (ITSA) is a popular evaluation methodology in which a single unit of observation is being studied, the outcome variable is serially ordered as a time series and the intervention is expected to 'interrupt' the level and/or trend of the time series, subsequent to its introduction. Given that the internal validity of the design rests on the premise that the interruption in the time series is associated with the introduction of the treatment, treatment effects may seem less plausible if a parallel trend already exists in the time series prior to the actual intervention. Thus, sensitivity analyses should focus on detecting structural breaks in the time series before the intervention. In this paper, we introduce a machine-learning algorithm called optimal discriminant analysis (ODA) as an approach to determine if structural breaks can be identified in years prior to the initiation of the intervention, using data from California's 1988 voter-initiated Proposition 99 to reduce smoking rates. The ODA analysis indicates that numerous structural breaks occurred prior to the actual initiation of Proposition 99 in 1989, including perfect structural breaks in 1983 and 1985, thereby casting doubt on the validity of treatment effects estimated for the actual intervention when using a single-group ITSA design. Given the widespread use of ITSA for evaluating observational data and the increasing use of machine-learning techniques in traditional research, we recommend that structural break sensitivity analysis is routinely incorporated in all research using the single-group ITSA design. © 2016 John Wiley & Sons, Ltd.

  20. Two Machine Learning Approaches for Short-Term Wind Speed Time-Series Prediction.

    Science.gov (United States)

    Ak, Ronay; Fink, Olga; Zio, Enrico

    2016-08-01

    The increasing liberalization of European electricity markets, the growing proportion of intermittent renewable energy being fed into the energy grids, and also new challenges in the patterns of energy consumption (such as electric mobility) require flexible and intelligent power grids capable of providing efficient, reliable, economical, and sustainable energy production and distribution. From the supplier side, particularly, the integration of renewable energy sources (e.g., wind and solar) into the grid imposes an engineering and economic challenge because of the limited ability to control and dispatch these energy sources due to their intermittent characteristics. Time-series prediction of wind speed for wind power production is a particularly important and challenging task, wherein prediction intervals (PIs) are preferable results of the prediction, rather than point estimates, because they provide information on the confidence in the prediction. In this paper, two different machine learning approaches to assess PIs of time-series predictions are considered and compared: 1) multilayer perceptron neural networks trained with a multiobjective genetic algorithm and 2) extreme learning machines combined with the nearest neighbors approach. The proposed approaches are applied for short-term wind speed prediction from a real data set of hourly wind speed measurements for the region of Regina in Saskatchewan, Canada. Both approaches demonstrate good prediction precision and provide complementary advantages with respect to different evaluation criteria.

  1. Sparse Bayesian learning machine for real-time management of reservoir releases

    Science.gov (United States)

    Khalil, Abedalrazq; McKee, Mac; Kemblowski, Mariush; Asefa, Tirusew

    2005-11-01

    Water scarcity and uncertainties in forecasting future water availabilities present serious problems for basin-scale water management. These problems create a need for intelligent prediction models that learn and adapt to their environment in order to provide water managers with decision-relevant information related to the operation of river systems. This manuscript presents examples of state-of-the-art techniques for forecasting that combine excellent generalization properties and sparse representation within a Bayesian paradigm. The techniques are demonstrated as decision tools to enhance real-time water management. A relevance vector machine, which is a probabilistic model, has been used in an online fashion to provide confident forecasts given knowledge of some state and exogenous conditions. In practical applications, online algorithms should recognize changes in the input space and account for drift in system behavior. Support vectors machines lend themselves particularly well to the detection of drift and hence to the initiation of adaptation in response to a recognized shift in system structure. The resulting model will normally have a structure and parameterization that suits the information content of the available data. The utility and practicality of this proposed approach have been demonstrated with an application in a real case study involving real-time operation of a reservoir in a river basin in southern Utah.

  2. How can the D-Wave machine exhibit long-time quantum behaviour

    Science.gov (United States)

    Drakova, D.; Doyen, G.

    2015-07-01

    Extensive experiments have demonstrated quantum behaviour in the long-time operation of the D-Wave quantum computer. The decoherence time of a single flux qubit is reported to be on the order of nanoseconds [1], which is much shorter than the time required to carry out a computation on the timescale of seconds [2, 3]. Previous judgements of whether the D-Wave device should be thought of as a quantum computer have been based on correlations of the input-output behaviour of the D-Wave machine with a quantum model, called simulated quantum annealing, or classical models, called simulated annealing and classical spin dynamics [4]. Explanations for a factor of 108 discrepancy between the single flux qubit decoherence time and the long-time coherent quantum behaviour of many integrated flux qubits of the D-Wave device have not been offered so far. In our contribution we investigate a model of four qubits with one qubit coupled to a phonon and (optionally) to environmental particles of high density of states, called gravonons. The calculations indicate that when no gravonons are present, the current in the qubit is flipped at some time and adiabatic evolution is discontinued. The time dependent wave functional becomes a non-correctable superposition of many excited states. The results demonstrate the possibility of effectively suppressing the current flip and allowing for continued adiabatic evolution when the entanglement to gravonons is included. This adiabatic evolution is, however, a coherent evolution in high dimensional spacetime and cannot be understood as a solution of Schrödinger's time dependent equation in 4 dimensional spacetime. Compared to Schrödinger's time development in 4D, the evolution is considerably slowed down, though still adiabatic. The properties of our model reflect correctly the experimentally found behaviour of the D-Wave machine and explain the factor of 108 discrepancy between decoherence time and quantum computation time. The observation

  3. A finite element-based machine learning approach for modeling the mechanical behavior of the breast tissues under compression in real-time.

    Science.gov (United States)

    Martínez-Martínez, F; Rupérez-Moreno, M J; Martínez-Sober, M; Solves-Llorens, J A; Lorente, D; Serrano-López, A J; Martínez-Sanchis, S; Monserrat, C; Martín-Guerrero, J D

    2017-09-28

    This work presents a data-driven method to simulate, in real-time, the biomechanical behavior of the breast tissues in some image-guided interventions such as biopsies or radiotherapy dose delivery as well as to speed up multimodal registration algorithms. Ten real breasts were used for this work. Their deformation due to the displacement of two compression plates was simulated off-line using the finite element (FE) method. Three machine learning models were trained with the data from those simulations. Then, they were used to predict in real-time the deformation of the breast tissues during the compression. The models were a decision tree and two tree-based ensemble methods (extremely randomized trees and random forest). Two different experimental setups were designed to validate and study the performance of these models under different conditions. The mean 3D Euclidean distance between nodes predicted by the models and those extracted from the FE simulations was calculated to assess the performance of the models in the validation set. The experiments proved that extremely randomized trees performed better than the other two models. The mean error committed by the three models in the prediction of the nodal displacements was under 2 mm, a threshold usually set for clinical applications. The time needed for breast compression prediction is sufficiently short to allow its use in real-time (<0.2 s). Copyright © 2017 Elsevier Ltd. All rights reserved.

  4. The time machine : the LHC adventure is a journey through time ....

    CERN Document Server

    Jean Leyder

    1998-01-01

    Archaeological findings at one LHC site take us back some 1700 years. Civil engineers dug through rock that dates from about 208 to 144 million years, and the LHC's collisions will complete the journey back to the beginning of time itself.

  5. An implantable VLSI architecture for real time spike sorting in cortically controlled Brain Machine Interfaces.

    Science.gov (United States)

    Aghagolzadeh, Mehdi; Zhang, Fei; Oweiss, Karim

    2010-01-01

    Brain Machine Interface (BMI) systems demand real-time spike sorting to instantaneously decode the spike trains of simultaneously recorded cortical neurons. Real-time spike sorting, however, requires extensive computational power that is not feasible to implement in implantable BMI architectures, thereby requiring transmission of high-bandwidth raw neural data to an external computer. In this work, we describe a miniaturized, low power, programmable hardware module capable of performing this task within the resource constraints of an implantable chip. The module computes a sparse representation of the spike waveforms followed by "smart" thresholding. This cascade restricts the sparse representation to a subset of projections that preserve the discriminative features of neuron-specific spike waveforms. In addition, it further reduces telemetry bandwidth making it feasible to wirelessly transmit only the important biological information to the outside world, thereby improving the efficiency, practicality and viability of BMI systems in clinical applications.

  6. Common Spatio-Time-Frequency Patterns for Motor Imagery-Based Brain Machine Interfaces

    Directory of Open Access Journals (Sweden)

    Hiroshi Higashi

    2013-01-01

    Full Text Available For efficient decoding of brain activities in analyzing brain function with an application to brain machine interfacing (BMI, we address a problem of how to determine spatial weights (spatial patterns, bandpass filters (frequency patterns, and time windows (time patterns by utilizing electroencephalogram (EEG recordings. To find these parameters, we develop a data-driven criterion that is a natural extension of the so-called common spatial patterns (CSP that are known to be effective features in BMI. We show that the proposed criterion can be optimized by an alternating procedure to achieve fast convergence. Experiments demonstrate that the proposed method can effectively extract discriminative features for a motor imagery-based BMI.

  7. Hybrid machine learning technique for forecasting Dhaka stock market timing decisions.

    Science.gov (United States)

    Banik, Shipra; Khodadad Khan, A F M; Anwer, Mohammad

    2014-01-01

    Forecasting stock market has been a difficult job for applied researchers owing to nature of facts which is very noisy and time varying. However, this hypothesis has been featured by several empirical experiential studies and a number of researchers have efficiently applied machine learning techniques to forecast stock market. This paper studied stock prediction for the use of investors. It is always true that investors typically obtain loss because of uncertain investment purposes and unsighted assets. This paper proposes a rough set model, a neural network model, and a hybrid neural network and rough set model to find optimal buy and sell of a share on Dhaka stock exchange. Investigational findings demonstrate that our proposed hybrid model has higher precision than the single rough set model and the neural network model. We believe this paper findings will help stock investors to decide about optimal buy and/or sell time on Dhaka stock exchange.

  8. Prediction and real-time compensation of qubit decoherence via machine-learning

    CERN Document Server

    Mavadia, Sandeep; Sastrawan, Jarrah; Dona, Stephen; Biercuk, Michael J

    2016-01-01

    Control engineering techniques are emerging as a promising approach to realize the stabilisation of quantum systems, and a powerful complement to attempts to design-in passive robustness. However, applications to date have largely been limited by the challenge that projective measurement of quantum devices causes the collapse of quantum superposition states. As a result significant tradeoffs have been mandated in applying the concept of feedback, and experiments have relied on open-loop control, weak measurements, access to ancilla states, or largely sacrificing quantum coherence in the controlled system. In this work we use techniques from control theory and machine learning to enable the real-time feedback suppression of semiclassical decoherence in a qubit when access to measurements is limited. Using a time-series of measurements of a qubit's phase we are able to predict future stochastic evolution without requiring a deterministic model of qubit evolution. We demonstrate this capability by preemptively s...

  9. A real-time surface inspection system for precision steel balls based on machine vision

    Science.gov (United States)

    Chen, Yi-Ji; Tsai, Jhy-Cherng; Hsu, Ya-Chen

    2016-07-01

    Precision steel balls are one of the most fundament components for motion and power transmission parts and they are widely used in industrial machinery and the automotive industry. As precision balls are crucial for the quality of these products, there is an urgent need to develop a fast and robust system for inspecting defects of precision steel balls. In this paper, a real-time system for inspecting surface defects of precision steel balls is developed based on machine vision. The developed system integrates a dual-lighting system, an unfolding mechanism and inspection algorithms for real-time signal processing and defect detection. The developed system is tested under feeding speeds of 4 pcs s-1 with a detection rate of 99.94% and an error rate of 0.10%. The minimum detectable surface flaw area is 0.01 mm2, which meets the requirement for inspecting ISO grade 100 precision steel balls.

  10. Least squares support vector machine for short-term prediction of meteorological time series

    Science.gov (United States)

    Mellit, A.; Pavan, A. Massi; Benghanem, M.

    2013-01-01

    The prediction of meteorological time series plays very important role in several fields. In this paper, an application of least squares support vector machine (LS-SVM) for short-term prediction of meteorological time series (e.g. solar irradiation, air temperature, relative humidity, wind speed, wind direction and pressure) is presented. In order to check the generalization capability of the LS-SVM approach, a K-fold cross-validation and Kolmogorov-Smirnov test have been carried out. A comparison between LS-SVM and different artificial neural network (ANN) architectures (recurrent neural network, multi-layered perceptron, radial basis function and probabilistic neural network) is presented and discussed. The comparison showed that the LS-SVM produced significantly better results than ANN architectures. It also indicates that LS-SVM provides promising results for short-term prediction of meteorological data.

  11. A Machine Learning Tool for Weighted Regressions in Time, Discharge, and Season

    Directory of Open Access Journals (Sweden)

    Alexander Maestre

    2014-01-01

    Full Text Available A new machine learning tool has been developed to classify water stations with similar water quality trends. The tool is based on the statistical method, Weighted Regressions in Time, Discharge, and Season (WRTDS, developed by the United States Geological Survey (USGS to estimate daily concentrations of water constituents in rivers and streams based on continuous daily discharge data and discrete water quality samples collected at the same or nearby locations. WRTDS is based on parametric survival regressions using a jack-knife cross validation procedure that generates unbiased estimates of the prediction errors. One of the disadvantages of WRTDS is that it needs a large number of samples (n > 200 collected during at least two decades. In this article, the tool is used to evaluate the use of Boosted Regression Trees (BRT as an alternative to the parametric survival regressions for water quality stations with a small number of samples. We describe the development of the machine learning tool as well as an evaluation comparison of the two methods, WRTDS and BRT. The purpose of the tool is to evaluate the reduction in variability of the estimates by clustering data from nearby stations with similar concentration and discharge characteristics. The results indicate that, using clustering, the predicted concentrations using BRT are in general higher than the observed concentrations. In addition, it appears that BRT generates higher sum of square residuals than the parametric survival regressions.

  12. A Naive Bayes machine learning approach to risk prediction using censored, time-to-event data.

    Science.gov (United States)

    Wolfson, Julian; Bandyopadhyay, Sunayan; Elidrisi, Mohamed; Vazquez-Benitez, Gabriela; Vock, David M; Musgrove, Donald; Adomavicius, Gediminas; Johnson, Paul E; O'Connor, Patrick J

    2015-09-20

    Predicting an individual's risk of experiencing a future clinical outcome is a statistical task with important consequences for both practicing clinicians and public health experts. Modern observational databases such as electronic health records provide an alternative to the longitudinal cohort studies traditionally used to construct risk models, bringing with them both opportunities and challenges. Large sample sizes and detailed covariate histories enable the use of sophisticated machine learning techniques to uncover complex associations and interactions, but observational databases are often 'messy', with high levels of missing data and incomplete patient follow-up. In this paper, we propose an adaptation of the well-known Naive Bayes machine learning approach to time-to-event outcomes subject to censoring. We compare the predictive performance of our method with the Cox proportional hazards model which is commonly used for risk prediction in healthcare populations, and illustrate its application to prediction of cardiovascular risk using an electronic health record dataset from a large Midwest integrated healthcare system.

  13. Calculation of upper esophageal sphincter restitution time from high resolution manometry data using machine learning.

    Science.gov (United States)

    Jungheim, Michael; Busche, Andre; Miller, Simone; Schilling, Nicolas; Schmidt-Thieme, Lars; Ptok, Martin

    2016-10-15

    After swallowing, the upper esophageal sphincter (UES) needs a certain amount of time to return from maximum pressure to the resting condition. Disturbances of sphincter function not only during the swallowing process but also in this phase of pressure restitution may lead to globus sensation or dysphagia. Since UES pressures do not decrease in a linear or asymptotic manner, it is difficult to determine the exact time when the resting pressure is reached, even when using high resolution manometry (HRM). To overcome this problem a Machine Learning model was established to objectively determine the UES restitution time (RT) and moreover to collect physiological data on sphincter function after swallowing. HRM-data of 15 healthy participants performing 10 swallows each were included. After manual annotation of the RT interval by two swallowing experts, data were transferred to the Machine Learning model, which applied a sequence labeling modeling approach based on logistic regression to learn and objectivize the characteristics of all swallows. Individually computed RT values were then compared with the annotated values. Estimates of the RT were generated by the Machine Learning model for all 150 swallows. When annotated by swallowing experts mean RT of 11.16s±5.7 (SD) and 10.04s±5.74 were determined respectively, compared to model-generated values from 8.91s±3.71 to 10.87s±4.68 depending on model selection. The correlation score for the annotated RT of both examiners was 0.76 and 0.63 to 0.68 for comparison of model predicted values. Restitution time represents an important physiologic swallowing parameter not previously considered in HRM-studies of the UES, especially since disturbances of UES restitution may increase the risk of aspiration. The data presented here show that it takes approximately 9 to 11s for the UES to come to rest after swallowing. Based on maximal RT values, we demonstrate that an interval of 25-30s in between swallows is necessary until the

  14. 带启动期的单重工作休假GI/Geom/1排队%The discrete-time GI/Geom/1 queue with single working vacation and setup times

    Institute of Scientific and Technical Information of China (English)

    徐秀丽; 王威

    2011-01-01

    详细分析了带启动期的单重工作休假GI/Geom/1排队.首先在顾客到达时刻嵌入二维Markov链,把状态转移概率矩阵表示成Block-Jocabi形式.然后用矩阵几何解方法导出了稳态队长的分布及其随机分解结构,得到等待时间的母函数及其随机分解结构,同时给出了平均队长和平均等待时间.最后,用Matlab软件验证了一个数值例子.%The GI/Geom/1 queue with single working vacation and setup times is considerd in this paper. With the two-dimensional Markov chain embedded in the time that the customers arrive the system, its transition probability matrix is expressed in Block-Jocabi form. And with the matrix-geometric solution method, probability distribution of the stationary queue length and the highly complicated PGF of the stationary waiting time are firstly derived. Meanwhile, the mean queue length and the mean waiting time are given. Finally, the numerical results with Matlab are presented.

  15. Time series online prediction algorithm based on least squares support vector machine

    Institute of Scientific and Technical Information of China (English)

    WU Qiong; LIU Wen-ying; YANG Yi-han

    2007-01-01

    Deficiencies of applying the traditional least squares support vector machine (LS-SVM) to time series online prediction were specified. According to the kernel function matrix's property and using the recursive calculation of block matrix, a new time series online prediction algorithm based on improved LS-SVM was proposed. The historical training results were fully utilized and the computing speed of LS-SVM was enhanced. Then, the improved algorithm was applied to time series online prediction. Based on the operational data provided by the Northwest Power Grid of China, the method was used in the transient stability prediction of electric power system. The results show that, compared with the calculation time of the traditional LS-SVM(75-1 600 ms), that of the proposed method in different time windows is 40-60 ms, and the prediction accuracy(normalized root mean squared error) of the proposed method is above 0.8. So the improved method is better than the traditional LS-SVM and more suitable for time series online prediction.

  16. VSS BASED SESSION SETUP MECHANISM IN IMS

    Institute of Scientific and Technical Information of China (English)

    Cao Yufei; Liao Jianxin; Qi Qi; Zhu Xiaomin

    2009-01-01

    This paper proposes a novel session setup mechanism in IMS (IP Multimedia Subsystem) by introducing the functional entity termed VSS (Visitor Subscriber Server) which is used to provide registration and location management.The new mechanism aims at improving session setup procedure by a betterment of location management in IMS.Through the use of two-tier subscriber information database constituted by the HSS (Home Subscriber Server) and the VSS,the new mechanism seperates the registration procedure and location management from the S-CSCF (Serving-Call'Session Control Function),and makes them be handled by the VSS.At the same time,the new mechanism updates the signaling procedure of registration and session setup.With VSS based location management.the cost of registeration and session setup procedure as well as the delay of session setup procedure become lower.he cost and delay functious of the new session setup mechanism as well aus the cost function of new registeration are deduced.Then,simulations and analysis verify that the performance of this new mechanism gets the benefit in cost and time.

  17. Heuristic and Exact Algorithms for the Two-Machine Just in Time Job Shop Scheduling Problem

    Directory of Open Access Journals (Sweden)

    Mohammed Al-Salem

    2016-01-01

    Full Text Available The problem addressed in this paper is the two-machine job shop scheduling problem when the objective is to minimize the total earliness and tardiness from a common due date (CDD for a set of jobs when their weights equal 1 (unweighted problem. This objective became very significant after the introduction of the Just in Time manufacturing approach. A procedure to determine whether the CDD is restricted or unrestricted is developed and a semirestricted CDD is defined. Algorithms are introduced to find the optimal solution when the CDD is unrestricted and semirestricted. When the CDD is restricted, which is a much harder problem, a heuristic algorithm is proposed to find approximate solutions. Through computational experiments, the heuristic algorithms’ performance is evaluated with problems up to 500 jobs.

  18. A combination of HARMONIE short time direct normal irradiance forecasts and machine learning: The #hashtdim procedure

    Science.gov (United States)

    Gastón, Martín; Fernández-Peruchena, Carlos; Körnich, Heiner; Landelius, Tomas

    2017-06-01

    The present work describes the first approach of a new procedure to forecast Direct Normal Irradiance (DNI): the #hashtdim that treats to combine ground information and Numerical Weather Predictions. The system is centered in generate predictions for the very short time. It combines the outputs from the Numerical Weather Prediction Model HARMONIE with an adaptive methodology based on Machine Learning. The DNI predictions are generated with 15-minute and hourly temporal resolutions and presents 3-hourly updates. Each update offers forecasts to the next 12 hours, the first nine hours are generated with 15-minute temporal resolution meanwhile the last three hours present hourly temporal resolution. The system is proved over a Spanish emplacement with BSRN operative station in south of Spain (PSA station). The #hashtdim has been implemented in the framework of the Direct Normal Irradiance Nowcasting methods for optimized operation of concentrating solar technologies (DNICast) project, under the European Union's Seventh Programme for research, technological development and demonstration framework.

  19. High-Density Liquid-State Machine Circuitry for Time-Series Forecasting.

    Science.gov (United States)

    Rosselló, Josep L; Alomar, Miquel L; Morro, Antoni; Oliver, Antoni; Canals, Vincent

    2016-08-01

    Spiking neural networks (SNN) are the last neural network generation that try to mimic the real behavior of biological neurons. Although most research in this area is done through software applications, it is in hardware implementations in which the intrinsic parallelism of these computing systems are more efficiently exploited. Liquid state machines (LSM) have arisen as a strategic technique to implement recurrent designs of SNN with a simple learning methodology. In this work, we show a new low-cost methodology to implement high-density LSM by using Boolean gates. The proposed method is based on the use of probabilistic computing concepts to reduce hardware requirements, thus considerably increasing the neuron count per chip. The result is a highly functional system that is applied to high-speed time series forecasting.

  20. Development of a machine vision system for a real-time precision sprayer

    Science.gov (United States)

    Bossu, Jérémie; Gée, Christelle; Truchetet, Frédéric

    2007-01-01

    In the context of precision agriculture, we have developed a machine vision system for a real time precision sprayer. From a monochrome CCD camera located in front of the tractor, the discrimination between crop and weeds is obtained with an image processing based on spatial information using a Gabor filter. This method allows to detect the periodic signals from the non periodic one and it enables to enhance the crop rows whereas weeds have patchy distribution. Thus, weed patches were clearly identified by a blob-coloring method. Finally, we use a pinhole model to transform the weed patch coordinates image in world coordinates in order to activate the right electro-pneumatic valve of the sprayer at the right moment.

  1. On Machine-Learned Classification of Variable Stars with Sparse and Noisy Time-Series Data

    CERN Document Server

    Richards, Joseph W; Butler, Nathaniel R; Bloom, Joshua S; Brewer, John M; Crellin-Quick, Arien; Higgins, Justin; Kennedy, Rachel; Rischard, Maxime

    2011-01-01

    With the coming data deluge from synoptic surveys, there is a growing need for frameworks that can quickly and automatically produce calibrated classification probabilities for newly-observed variables based on a small number of time-series measurements. In this paper, we introduce a methodology for variable-star classification, drawing from modern machine-learning techniques. We describe how to homogenize the information gleaned from light curves by selection and computation of real-numbered metrics ("feature"), detail methods to robustly estimate periodic light-curve features, introduce tree-ensemble methods for accurate variable star classification, and show how to rigorously evaluate the classification results using cross validation. On a 25-class data set of 1542 well-studied variable stars, we achieve a 22.8% overall classification error using the random forest classifier; this represents a 24% improvement over the best previous classifier on these data. This methodology is effective for identifying sam...

  2. Single Machine Problem with Multi-Rate-Modifying Activities under a Time-Dependent Deterioration

    Directory of Open Access Journals (Sweden)

    M. Huang

    2013-01-01

    Full Text Available The single machine scheduling problem with multi-rate-modifying activities under a time-dependent deterioration to minimize makespan is studied. After examining the characteristics of the problem, a number of properties and a lower bound are proposed. A branch and bound algorithm and a heuristic algorithm are used in the solution, and two special cases are also examined. The computational experiments show that, for the situation with a rate-modifying activity, the proposed branch and bound algorithm can solve situations with 50 jobs within a reasonable time, and the heuristic algorithm can obtain the near-optimal solution with an error percentage less than 0.053 in a very short time. In situations with multi-rate-modifying activities, the proposed branch and bound algorithm can solve the case with 15 jobs within a reasonable time, and the heuristic algorithm can obtain the near-optimal with an error percentage less than 0.070 in a very short time. The branch and bound algorithm and the heuristic algorithm are both shown to be efficient and effective.

  3. Production Inventory Models for Deteriorating Items with Stochastic Machine Unavailability Time, Lost Sales and Price-Dependent Demand

    Directory of Open Access Journals (Sweden)

    Gede Agus Widyadana

    2010-01-01

    Full Text Available The economic production quantity (EPQ model is widely employed in reality and is also being intensively developed in the research area. This research tries to develop more realistic EPQ models for deteriorating items by considering stochastic machine unavailability time (uniformly and exponentially distributed and price-dependent demand. Lost sales will occur when machine unavailability time is longer than the non production time. Since the closed form solution cannot be derived, we use Genetic Algorithm (GA to solve the models. A numerical example and sensitivity analysis is shown to illustrate the models. The sensitivity analyses show that a management can use price policy to minimize the profit loss due to machine unavailability time under a price- dependent demand situation

  4. Electrochemical Discharge Machining Process

    Directory of Open Access Journals (Sweden)

    Anjali V. Kulkarni

    2007-09-01

    Full Text Available Electrochemical discharge machining process is evolving as a promising micromachiningprocess. The experimental investigations in the present work substantiate this trend. In the presentwork, in situ, synchronised, transient temperature and current measurements have been carriedout. The need for the transient measurements arose due to the time-varying nature of the dischargeformation and time varying circuit current. Synchronised and transient measurements revealedthe discrete nature of the process. It also helped in formulating the basic mechanism for thedischarge formation and the material removal in the process. Temperature profile on workpieceand in electrochemical discharge machining cell is experimentally measured using pyrometer,and two varieties of K-type thermocouples. Surface topography of the discharge-affected zoneson the workpiece has been carried out using scanning electron microscope. Measurements andsurface topographical studies reveal the potential use of this process for machining in micronregime. With careful experimental set-up design, suitable supply voltage and its polarity, theprocess can be applied for both micromachining and micro-deposition. It can be extended formachining and or deposition of wide range of materials.

  5. Real-time, adaptive machine learning for non-stationary, near chaotic gasoline engine combustion time series.

    Science.gov (United States)

    Vaughan, Adam; Bohac, Stanislav V

    2015-10-01

    Fuel efficient Homogeneous Charge Compression Ignition (HCCI) engine combustion timing predictions must contend with non-linear chemistry, non-linear physics, period doubling bifurcation(s), turbulent mixing, model parameters that can drift day-to-day, and air-fuel mixture state information that cannot typically be resolved on a cycle-to-cycle basis, especially during transients. In previous work, an abstract cycle-to-cycle mapping function coupled with ϵ-Support Vector Regression was shown to predict experimentally observed cycle-to-cycle combustion timing over a wide range of engine conditions, despite some of the aforementioned difficulties. The main limitation of the previous approach was that a partially acasual randomly sampled training dataset was used to train proof of concept offline predictions. The objective of this paper is to address this limitation by proposing a new online adaptive Extreme Learning Machine (ELM) extension named Weighted Ring-ELM. This extension enables fully causal combustion timing predictions at randomly chosen engine set points, and is shown to achieve results that are as good as or better than the previous offline method. The broader objective of this approach is to enable a new class of real-time model predictive control strategies for high variability HCCI and, ultimately, to bring HCCI's low engine-out NOx and reduced CO2 emissions to production engines.

  6. Selection of machining datum and allocation of tolerance through tolerance charting technique

    Science.gov (United States)

    Thilak, Manoharan; Sivakumar, Karuppan; Jayaprakash, Govindharajalu

    2012-07-01

    Tolerance charting is an effective tool to determine the optimal allocation of working dimensions and working tolerances such that the blueprint dimensions and tolerances can be achieved to accomplish the cost objectives. The selection of machining datum and allocation of tolerances are critical in any machining process planning as they directly affect any setup methods/machine tools selection and machining time. This paper mainly focuses on the selection of optimum machining datums and machining tolerances simultaneously in process planning. A dynamic tolerance charting constraint scheme is developed and implemented in the optimization procedure. An optimization model is formulated for selecting machining datum and tolerances and implemented with an algorithm namely Elitist Non-Dominated Sorting Genetic Algorithm (NSGA-II).The computational results indicate that the proposed methodology is capable and robust in finding the optimal machining datum set and tolerances.

  7. Average Flow Time Estimation of Jobs in a Flexible Manufacturing Cell Consisting of a Number of Identical Machines

    NARCIS (Netherlands)

    Slomp, Jannes; Bokhorst, Jos A. C.; Caprihan, Rahul

    2011-01-01

    This paper concerns the estimation of flow times of jobs to be produced in a Flexible Manufacturing Cell (FMC) consisting of a number of identical machines. An analytical expression is derived from a careful analysis of the elements of the flow time. Next, a simulation study is performed which

  8. Simple machines

    CERN Document Server

    Graybill, George

    2007-01-01

    Just how simple are simple machines? With our ready-to-use resource, they are simple to teach and easy to learn! Chocked full of information and activities, we begin with a look at force, motion and work, and examples of simple machines in daily life are given. With this background, we move on to different kinds of simple machines including: Levers, Inclined Planes, Wedges, Screws, Pulleys, and Wheels and Axles. An exploration of some compound machines follows, such as the can opener. Our resource is a real time-saver as all the reading passages, student activities are provided. Presented in s

  9. Polynomial-time solution of prime factorization and NP-complete problems with digital memcomputing machines.

    Science.gov (United States)

    Traversa, Fabio L; Di Ventra, Massimiliano

    2017-02-01

    We introduce a class of digital machines, we name Digital Memcomputing Machines, (DMMs) able to solve a wide range of problems including Non-deterministic Polynomial (NP) ones with polynomial resources (in time, space, and energy). An abstract DMM with this power must satisfy a set of compatible mathematical constraints underlying its practical realization. We prove this by making a connection with the dynamical systems theory. This leads us to a set of physical constraints for poly-resource resolvability. Once the mathematical requirements have been assessed, we propose a practical scheme to solve the above class of problems based on the novel concept of self-organizing logic gates and circuits (SOLCs). These are logic gates and circuits able to accept input signals from any terminal, without distinction between conventional input and output terminals. They can solve boolean problems by self-organizing into their solution. They can be fabricated either with circuit elements with memory (such as memristors) and/or standard MOS technology. Using tools of functional analysis, we prove mathematically the following constraints for the poly-resource resolvability: (i) SOLCs possess a global attractor; (ii) their only equilibrium points are the solutions of the problems to solve; (iii) the system converges exponentially fast to the solutions; (iv) the equilibrium convergence rate scales at most polynomially with input size. We finally provide arguments that periodic orbits and strange attractors cannot coexist with equilibria. As examples, we show how to solve the prime factorization and the search version of the NP-complete subset-sum problem. Since DMMs map integers into integers, they are robust against noise and hence scalable. We finally discuss the implications of the DMM realization through SOLCs to the NP = P question related to constraints of poly-resources resolvability.

  10. Polynomial-time solution of prime factorization and NP-complete problems with digital memcomputing machines

    Science.gov (United States)

    Traversa, Fabio L.; Di Ventra, Massimiliano

    2017-02-01

    We introduce a class of digital machines, we name Digital Memcomputing Machines, (DMMs) able to solve a wide range of problems including Non-deterministic Polynomial (NP) ones with polynomial resources (in time, space, and energy). An abstract DMM with this power must satisfy a set of compatible mathematical constraints underlying its practical realization. We prove this by making a connection with the dynamical systems theory. This leads us to a set of physical constraints for poly-resource resolvability. Once the mathematical requirements have been assessed, we propose a practical scheme to solve the above class of problems based on the novel concept of self-organizing logic gates and circuits (SOLCs). These are logic gates and circuits able to accept input signals from any terminal, without distinction between conventional input and output terminals. They can solve boolean problems by self-organizing into their solution. They can be fabricated either with circuit elements with memory (such as memristors) and/or standard MOS technology. Using tools of functional analysis, we prove mathematically the following constraints for the poly-resource resolvability: (i) SOLCs possess a global attractor; (ii) their only equilibrium points are the solutions of the problems to solve; (iii) the system converges exponentially fast to the solutions; (iv) the equilibrium convergence rate scales at most polynomially with input size. We finally provide arguments that periodic orbits and strange attractors cannot coexist with equilibria. As examples, we show how to solve the prime factorization and the search version of the NP-complete subset-sum problem. Since DMMs map integers into integers, they are robust against noise and hence scalable. We finally discuss the implications of the DMM realization through SOLCs to the NP = P question related to constraints of poly-resources resolvability.

  11. A machine learning nowcasting method based on real-time reanalysis data

    Science.gov (United States)

    Han, Lei; Sun, Juanzhen; Zhang, Wei; Xiu, Yuanyuan; Feng, Hailei; Lin, Yinjing

    2017-04-01

    Despite marked progress over the past several decades, convective storm nowcasting remains a challenge because most nowcasting systems are based on linear extrapolation of radar reflectivity without much consideration for other meteorological fields. The variational Doppler radar analysis system (VDRAS) is an advanced convective-scale analysis system capable of providing analysis of 3-D wind, temperature, and humidity by assimilating Doppler radar observations. Although potentially useful, it is still an open question as to how to use these fields to improve nowcasting. In this study, we present results from our first attempt at developing a support vector machine (SVM) box-based nowcasting (SBOW) method under the machine learning framework using VDRAS analysis data. The key design points of SBOW are as follows: (1) The study domain is divided into many position-fixed small boxes, and the nowcasting problem is transformed into one question, i.e., will a radar echo > 35 dBZ appear in a box in 30 min? (2) Box-based temporal and spatial features, which include time trends and surrounding environmental information, are constructed. (3) And the box-based constructed features are used to first train the SVM classifier, and then the trained classifier is used to make predictions. Compared with complicated and expensive expert systems, the above design of SBOW allows the system to be small, compact, straightforward, and easy to maintain and expand at low cost. The experimental results show that although no complicated tracking algorithm is used, SBOW can predict the storm movement trend and storm growth with reasonable skill.

  12. Time-frequency atoms-driven support vector machine method for bearings incipient fault diagnosis

    Science.gov (United States)

    Liu, Ruonan; Yang, Boyuan; Zhang, Xiaoli; Wang, Shibin; Chen, Xuefeng

    2016-06-01

    Bearing plays an essential role in the performance of mechanical system and fault diagnosis of mechanical system is inseparably related to the diagnosis of the bearings. However, it is a challenge to detect weak fault from the complex and non-stationary vibration signals with a large amount of noise, especially at the early stage. To improve the anti-noise ability and detect incipient fault, a novel fault detection method based on a short-time matching method and Support Vector Machine (SVM) is proposed. In this paper, the mechanism of roller bearing is discussed and the impact time frequency dictionary is constructed targeting the multi-component characteristics and fault feature of roller bearing fault vibration signals. Then, a short-time matching method is described and the simulation results show the excellent feature extraction effects in extremely low signal-to-noise ratio (SNR). After extracting the most relevance atoms as features, SVM was trained for fault recognition. Finally, the practical bearing experiments indicate that the proposed method is more effective and efficient than the traditional methods in weak impact signal oscillatory characters extraction and incipient fault diagnosis.

  13. Prediction and real-time compensation of qubit decoherence via machine learning

    Science.gov (United States)

    Mavadia, Sandeep; Frey, Virginia; Sastrawan, Jarrah; Dona, Stephen; Biercuk, Michael J.

    2017-01-01

    The wide-ranging adoption of quantum technologies requires practical, high-performance advances in our ability to maintain quantum coherence while facing the challenge of state collapse under measurement. Here we use techniques from control theory and machine learning to predict the future evolution of a qubit's state; we deploy this information to suppress stochastic, semiclassical decoherence, even when access to measurements is limited. First, we implement a time-division multiplexed approach, interleaving measurement periods with periods of unsupervised but stabilised operation during which qubits are available, for example, in quantum information experiments. Second, we employ predictive feedback during sequential but time delayed measurements to reduce the Dick effect as encountered in passive frequency standards. Both experiments demonstrate significant improvements in qubit-phase stability over `traditional' measurement-based feedback approaches by exploiting time domain correlations in the noise processes. This technique requires no additional hardware and is applicable to all two-level quantum systems where projective measurements are possible.

  14. A real-time phenotyping framework using machine learning for plant stress severity rating in soybean.

    Science.gov (United States)

    Naik, Hsiang Sing; Zhang, Jiaoping; Lofquist, Alec; Assefa, Teshale; Sarkar, Soumik; Ackerman, David; Singh, Arti; Singh, Asheesh K; Ganapathysubramanian, Baskar

    2017-01-01

    Phenotyping is a critical component of plant research. Accurate and precise trait collection, when integrated with genetic tools, can greatly accelerate the rate of genetic gain in crop improvement. However, efficient and automatic phenotyping of traits across large populations is a challenge; which is further exacerbated by the necessity of sampling multiple environments and growing replicated trials. A promising approach is to leverage current advances in imaging technology, data analytics and machine learning to enable automated and fast phenotyping and subsequent decision support. In this context, the workflow for phenotyping (image capture → data storage and curation → trait extraction → machine learning/classification → models/apps for decision support) has to be carefully designed and efficiently executed to minimize resource usage and maximize utility. We illustrate such an end-to-end phenotyping workflow for the case of plant stress severity phenotyping in soybean, with a specific focus on the rapid and automatic assessment of iron deficiency chlorosis (IDC) severity on thousands of field plots. We showcase this analytics framework by extracting IDC features from a set of ~4500 unique canopies representing a diverse germplasm base that have different levels of IDC, and subsequently training a variety of classification models to predict plant stress severity. The best classifier is then deployed as a smartphone app for rapid and real time severity rating in the field. We investigated 10 different classification approaches, with the best classifier being a hierarchical classifier with a mean per-class accuracy of ~96%. We construct a phenotypically meaningful 'population canopy graph', connecting the automatically extracted canopy trait features with plant stress severity rating. We incorporated this image capture → image processing → classification workflow into a smartphone app that enables automated real-time evaluation of IDC

  15. Reservoir computing and extreme learning machines for non-linear time-series data analysis.

    Science.gov (United States)

    Butcher, J B; Verstraeten, D; Schrauwen, B; Day, C R; Haycock, P W

    2013-02-01

    Random projection architectures such as Echo state networks (ESNs) and Extreme Learning Machines (ELMs) use a network containing a randomly connected hidden layer and train only the output weights, overcoming the problems associated with the complex and computationally demanding training algorithms traditionally used to train neural networks, particularly recurrent neural networks. In this study an ESN is shown to contain an antagonistic trade-off between the amount of non-linear mapping and short-term memory it can exhibit when applied to time-series data which are highly non-linear. To overcome this trade-off a new architecture, Reservoir with Random Static Projections (R(2)SP) is investigated, that is shown to offer a significant improvement in performance. A similar approach using an ELM whose input is presented through a time delay (TD-ELM) is shown to further enhance performance where it significantly outperformed the ESN and R(2)SP as well other architectures when applied to a novel task which allows the short-term memory and non-linearity to be varied. The hard-limiting memory of the TD-ELM appears to be best suited for the data investigated in this study, although ESN-based approaches may offer improved performance when processing data which require a longer fading memory.

  16. Time and spectral analysis methods with machine learning for the authentication of digital audio recordings.

    Science.gov (United States)

    Korycki, Rafal

    2013-07-10

    This paper addresses the problem of tampering detection and discusses new methods that can be used for authenticity analysis of digital audio recordings. Nowadays, the only method referred to digital audio files commonly approved by forensic experts is the ENF criterion. It consists in fluctuation analysis of the mains frequency induced in electronic circuits of recording devices. Therefore, its effectiveness is strictly dependent on the presence of mains signal in the recording, which is a rare occurrence. This article presents the existing methods of time and spectral analysis along with their modifications as proposed by the author involving spectral analysis of residual signal enhanced by machine learning algorithms. The effectiveness of tampering detection methods described in this paper is tested on a predefined music database. The results are compared graphically using ROC-like curves. Furthermore, time-frequency plots are presented and enhanced by reassignment method in purpose of visual inspection of modified recordings. Using this solution, enables analysis of minimal changes of background sounds, which may indicate tampering.

  17. An Efficient Multiobjective Backtracking Search Algorithm for Single Machine Scheduling with Controllable Processing Times

    Directory of Open Access Journals (Sweden)

    Chao Lu

    2017-01-01

    Full Text Available The scheduling problem with controllable processing times (CPT is one of the most important research topics in the scheduling field due to its widespread application. Because of the complexity of this problem, a majority of research mainly addressed single-objective small scale problems. However, most practical problems are multiobjective and large scale issues. Multiobjective metaheuristics are very efficient in solving such problems. This paper studies a single machine scheduling problem with CPT for minimizing total tardiness and compression cost simultaneously. We aim to develop a new multiobjective discrete backtracking search algorithm (MODBSA to solve this problem. To accommodate the characteristic of the problem, a solution representation is constructed by a permutation vector and an amount vector of compression processing times. Furthermore, two major improvement strategies named adaptive selection scheme and total cost reduction strategy are developed. The adaptive selection scheme is used to select a suitable population to enhance the search efficiency of MODBSA, and the total cost reduction strategy is developed to further improve the quality of solutions. For the assessment of MODBSA, MODBSA is compared with other algorithms including NSGA-II, SPEA2, and PAES. Experimental results demonstrate that the proposed MODBSA is a promising algorithm for such scheduling problem.

  18. Large-scale machine learning and evaluation platform for real-time traffic surveillance

    Science.gov (United States)

    Eichel, Justin A.; Mishra, Akshaya; Miller, Nicholas; Jankovic, Nicholas; Thomas, Mohan A.; Abbott, Tyler; Swanson, Douglas; Keller, Joel

    2016-09-01

    In traffic engineering, vehicle detectors are trained on limited datasets, resulting in poor accuracy when deployed in real-world surveillance applications. Annotating large-scale high-quality datasets is challenging. Typically, these datasets have limited diversity; they do not reflect the real-world operating environment. There is a need for a large-scale, cloud-based positive and negative mining process and a large-scale learning and evaluation system for the application of automatic traffic measurements and classification. The proposed positive and negative mining process addresses the quality of crowd sourced ground truth data through machine learning review and human feedback mechanisms. The proposed learning and evaluation system uses a distributed cloud computing framework to handle data-scaling issues associated with large numbers of samples and a high-dimensional feature space. The system is trained using AdaBoost on 1,000,000 Haar-like features extracted from 70,000 annotated video frames. The trained real-time vehicle detector achieves an accuracy of at least 95% for 1/2 and about 78% for 19/20 of the time when tested on ˜7,500,000 video frames. At the end of 2016, the dataset is expected to have over 1 billion annotated video frames.

  19. A Near Real-time IP Traffic Classification Using Machine Learning

    Directory of Open Access Journals (Sweden)

    Kuldeep Singh

    2013-02-01

    Full Text Available With drastic increase in internet traffic over last few years due to increase in number of internet users, IP traffic classification has gained significant importance for research community as well as various internet service providers for optimization of their network performance and for governmental intelligence organizations. Today, traditional IP traffic classification techniques such as port number and payload based direct packet inspection techniques are rarely used because of use of dynamic port number instead of well-known port number in packet headers and various cryptographic techniques which inhibit inspection of packet payload. Current trends are use of machine learning (ML techniques for IP traffic classification. In this research paper, a real time internet traffic dataset has been developed using packet capturing tool for 2 second packet capturing duration and other datasets have been developed by reducing number of features of 2 second duration dataset using Correlation and Consistency based Feature Selection (FS Algorithms. Then, five ML algorithms MLP, RBF, C4.5, Bayes Net and Naïve Bayes are employed for IP traffic classification with these datasets. This experimental analysis shows that Bayes Net is an effective ML technique for near real time and online IP traffic classification with reduction in packet capture duration and reduction in number of features characterizing each application sample with Correlation based FS Algorithm.

  20. Efficient priority rules for dynamic sequencing with sequence-dependent setups

    Directory of Open Access Journals (Sweden)

    A. S. Xanthopoulos

    2016-06-01

    Full Text Available This article addresses the problem of dynamic sequencing on n identical parallel machines with stochastic arrivals, processing times, due dates and sequence-dependent setups. The system operates under a completely reactive scheduling policy and the sequence of jobs is determined with the use of dispatching rules. Seventeen existing dispatching rules are considered including standard and setup-oriented rules. The performance of the system is evaluated by four metrics. An experimental study of the system is conducted where the effect of categorical and continuous system parameters on the objective functions is examined. In light of the results from the simulation experiments, a parameterized priority rule is introduced and tested. The simulation output is analyzed using rigorous statistical methods and the proposed rule is found to produce significantly better results regarding the metrics of mean cycle time and mean tardiness in single machine cases. In respect to three machine cases, the proposed rule matches the performance of the best rule from the set of existing rules which were studied in this research for three metrics.

  1. Parallel machine scheduling with a common server

    Energy Technology Data Exchange (ETDEWEB)

    Hall, N.; Sriskandarajah, C.; Potts, C.

    1994-12-31

    This paper considers the nonpreemptive scheduling of a given set of jobs on several identical, parallel machines. Each job must be processed on one of the machines. Prior to processing, a job must be loaded (setup) by a single server onto the relevant machine. The server may be a human operator, a robot, or a piece of specialized equipment. We study a number of classical scheduling objectives in this environment, including makespan, maximum lateness, the sum of completion times, the number of late jobs, and total tardiness, as well as weighted versions of some of these. The number of machines may be constant or arbitrary. Setup times may be unit, equal, or arbitrary. Processing times may be unit or arbitrary. For each problem considered, we attempt to provide either an efficient algorithm, or a proof that such an algorithm is unlikely to exist. Our results provide a mapping of the computational complexity of these problems. Included in these results are generalizations of the classical algorithms of Moore, Lawler and Moore and Lawler. In addition, we describe two heuristics for makespan scheduling in this environment, and provide an exact analysis of their worst-case performance.

  2. A branch-and-bound algorithm for single-machine earliness-tardiness scheduling with idle time

    NARCIS (Netherlands)

    J.A. Hoogeveen (Han); S.L. van de Velde (Steef)

    1996-01-01

    textabstractPresents a branch-and-bound algorithm which is based upon many dominance rules and various lower bound approaches, including relaxation of the machine capacity, data manipulation and Lagrangian relaxation. Insertion of the idle time for a given sequence; Properties of the proposed lower

  3. Analysed potential of big data and supervised machine learning techniques in effectively forecasting travel times from fused data

    Directory of Open Access Journals (Sweden)

    Ivana Šemanjski

    2015-12-01

    Full Text Available Travel time forecasting is an interesting topic for many ITS services. Increased availability of data collection sensors increases the availability of the predictor variables but also highlights the high processing issues related to this big data availability. In this paper we aimed to analyse the potential of big data and supervised machine learning techniques in effectively forecasting travel times. For this purpose we used fused data from three data sources (Global Positioning System vehicles tracks, road network infrastructure data and meteorological data and four machine learning techniques (k-nearest neighbours, support vector machines, boosting trees and random forest. To evaluate the forecasting results we compared them in-between different road classes in the context of absolute values, measured in minutes, and the mean squared percentage error. For the road classes with the high average speed and long road segments, machine learning techniques forecasted travel times with small relative error, while for the road classes with the small average speeds and segment lengths this was a more demanding task. All three data sources were proven itself to have a high impact on the travel time forecast accuracy and the best results (taking into account all road classes were achieved for the k-nearest neighbours and random forest techniques.

  4. Real-time Embedded Java Virtual Machine for Application Development in Wireless Sensor Network

    Directory of Open Access Journals (Sweden)

    Xing Liu

    2014-07-01

    Full Text Available The application development in wireless sensor network (WSN is complicated due to the diverse software and hardware platforms. One way to solve this problem is to apply the embedded Java virtual machine (EJVM on the WSN nodes. With the EJVM, the users can program the applications by the popular and high-level abstract Java language. However, several challenges exist for applying the EJVM on the WSN nodes, such as the memory resources on the WSN nodes are constrained, the multitasking programming and real-time response are required by many WSN applications. Currently, these challenges cannot be addressed well by most EJVMs. And in order to address these challenges, a real-time memory-efficient Java operating system HEROS is developed. By means of HEROS, the multitasking real-time Java applications can be developed even on the memory-constrained WSN nodes. Nevertheless, the execution efficiency of the Java bytecode is not high, making the EJVM not suitable to be used on the tight energy-constrained WSN nodes. To solve this problem, a new mid-layer software REMID, which is designed to have some similar functionalities as the EJVM, is also developed. Different from the EJVM, REMID is designed to be both memory efficient and energy efficient, thus it can substitute the EJVM to be used even on the severe energy-constrained WSN nodes. The final evaluation works prove that a user-friendly WSN application development environment can be provided to the users by means of the EJVM, HEROS and REMID.

  5. Recognition of Time Stamps on Full-Disk Hα Images Using Machine Learning Methods

    Science.gov (United States)

    Xu, Y.; Huang, N.; Jing, J.; Liu, C.; Wang, H.; Fu, G.

    2016-12-01

    Observation and understanding of the physics of the 11-year solar activity cycle and 22-year magnetic cycle are among the most important research topics in solar physics. The solar cycle is responsible for magnetic field and particle fluctuation in the near-earth environment that have been found increasingly important in affecting the living of human beings in the modern era. A systematic study of large-scale solar activities, as made possible by our rich data archive, will further help us to understand the global-scale magnetic fields that are closely related to solar cycles. The long-time-span data archive includes both full-disk and high-resolution Hα images. Prior to the widely use of CCD cameras in 1990s, 35-mm films were the major media to store images. The research group at NJIT recently finished the digitization of film data obtained by the National Solar Observatory (NSO) and Big Bear Solar Observatory (BBSO) covering the period of 1953 to 2000. The total volume of data exceeds 60 TB. To make this huge database scientific valuable, some processing and calibration are required. One of the most important steps is to read the time stamps on all of the 14 million images, which is almost impossible to be done manually. We implemented three different methods to recognize the time stamps automatically, including Optical Character Recognition (OCR), Classification Tree and TensorFlow. The latter two are known as machine learning algorithms which are very popular now a day in pattern recognition area. We will present some sample images and the results of clock recognition from all three methods.

  6. Impact of Model Detail of Synchronous Machines on Real-time Transient Stability Assessment

    DEFF Research Database (Denmark)

    Weckesser, Johannes Tilman Gabriel; Jóhannsson, Hjörtur; Østergaard, Jacob

    2013-01-01

    to identify the transient stability mechanism, a simulation with a high-order model was used as reference. The Western System Coordinating Council System (WSCC) and the New England & New York system are considered and simulations of an unstable and a stable scenario are carried out, where the detail......In this paper, it is investigated how detailed the model of a synchronous machine needs to be in order to assess transient stability using a Single Machine Equivalent (SIME). The results will show how the stability mechanism and the stability assessment are affected by the model detail. In order...... of the machine models is varied. Analyses of the results suggest that a 4th-order model may be sufficient to represent synchronous machines in transient stability studies....

  7. Embedded Hardware-Efficient Real-Time Classification With Cascade Support Vector Machines.

    Science.gov (United States)

    Kyrkou, Christos; Bouganis, Christos-Savvas; Theocharides, Theocharis; Polycarpou, Marios M

    2016-01-01

    Cascade support vector machines (SVMs) are optimized to efficiently handle problems, where the majority of the data belong to one of the two classes, such as image object classification, and hence can provide speedups over monolithic (single) SVM classifiers. However, SVM classification is a computationally demanding task and existing hardware architectures for SVMs only consider monolithic classifiers. This paper proposes the acceleration of cascade SVMs through a hybrid processing hardware architecture optimized for the cascade SVM classification flow, accompanied by a method to reduce the required hardware resources for its implementation, and a method to improve the classification speed utilizing cascade information to further discard data samples. The proposed SVM cascade architecture is implemented on a Spartan-6 field-programmable gate array (FPGA) platform and evaluated for object detection on 800×600 (Super Video Graphics Array) resolution images. The proposed architecture, boosted by a neural network that processes cascade information, achieves a real-time processing rate of 40 frames/s for the benchmark face detection application. Furthermore, the hardware-reduction method results in the utilization of 25% less FPGA custom-logic resources and 20% peak power reduction compared with a baseline implementation.

  8. A Brain-Machine Interface Operating with a Real-Time Spiking Neural Network Control Algorithm.

    Science.gov (United States)

    Dethier, Julie; Nuyujukian, Paul; Eliasmith, Chris; Stewart, Terry; Elassaad, Shauki A; Shenoy, Krishna V; Boahen, Kwabena

    2011-01-01

    Motor prostheses aim to restore function to disabled patients. Despite compelling proof of concept systems, barriers to clinical translation remain. One challenge is to develop a low-power, fully-implantable system that dissipates only minimal power so as not to damage tissue. To this end, we implemented a Kalman-filter based decoder via a spiking neural network (SNN) and tested it in brain-machine interface (BMI) experiments with a rhesus monkey. The Kalman filter was trained to predict the arm's velocity and mapped on to the SNN using the Neural Engineering Framework (NEF). A 2,000-neuron embedded Matlab SNN implementation runs in real-time and its closed-loop performance is quite comparable to that of the standard Kalman filter. The success of this closed-loop decoder holds promise for hardware SNN implementations of statistical signal processing algorithms on neuromorphic chips, which may offer power savings necessary to overcome a major obstacle to the successful clinical translation of neural motor prostheses.

  9. Evaluation of the status of rotary machines by time causal Information Theory quantifiers

    Science.gov (United States)

    Redelico, Francisco O.; Traversaro, Francisco; Oyarzabal, Nicolás; Vilaboa, Ivan; Rosso, Osvaldo A.

    2017-03-01

    In this paper several causal Information Theory quantifiers, i.e. Shannon entropy, statistical complexity and Fisher information using the Bandt and Pompe permutation probability distribution, measure are applied to describe the behavior of a rotating machine. An experiment was conducted where a rotating machine runs balanced and then, after a misalignment, runs unbalanced. All the causal Information Theory quantifiers applied are capable to distinguish between both states and grasp the corresponding transition between them.

  10. Objected constrained registration and manifold learning: A new patient setup approach in image guided radiation therapy of thoracic cancer

    Energy Technology Data Exchange (ETDEWEB)

    Chen Ting; Jabbour, Salma K.; Haffty, Bruce G.; Yue, Ning [Radiation Oncology Department, Cancer Institute of New Jersey, University of Medicine and Dentistry of New Jersey, 195 Little Albany Street, New Brunswick, New Jersey 08901 (United States); Qin Songbing [Department of Radiation Oncology, The First Affiliated Hospital of Soochow University, Suzhou 215006 (China)

    2013-04-15

    Purpose: The management of thoracic malignancies with radiation therapy is complicated by continuous target motion. In this study, a real time motion analysis approach is proposed to improve the accuracy of patient setup. Methods: For 11 lung cancer patients a long training fluoroscopy was acquired before the first treatment, and multiple short testing fluoroscopies were acquired weekly at the pretreatment patient setup of image guided radiotherapy (IGRT). The data analysis consisted of three steps: first a 4D target motion model was constructed from 4DCT and projected to the training fluoroscopy through deformable registration. Then the manifold learning method was used to construct a 2D subspace based on the target motion (kinetic) and location (static) information in the training fluoroscopy. Thereafter the respiratory phase in the testing fluoroscopy was determined by finding its location in the subspace. Finally, the phase determined testing fluoroscopy was registered to the corresponding 4DCT to derive the pretreatment patient position adjustment for the IGRT. The method was tested on clinical image sets and numerical phantoms. Results: The registration successfully reconstructed the 4D motion model with over 98% volume similarity in 4DCT, and over 95% area similarity in the training fluoroscopy. The machine learning method derived the phase values in over 98% and 93% test images of the phantom and patient images, respectively, with less than 3% phase error. The setup approach achieved an average accumulated setup error less than 1.7 mm in the cranial-caudal direction and less than 1 mm in the transverse plane. All results were validated against the ground truth of manual delineations by an experienced radiation oncologist. The expected total time for the pretreatment setup analysis was less than 10 s. Conclusions: By combining the registration and machine learning, the proposed approach has the potential to improve the accuracy of pretreatment setup for

  11. Real-time optical path control method that utilizes multiple support vector machines for traffic prediction

    Science.gov (United States)

    Kawase, Hiroshi; Mori, Yojiro; Hasegawa, Hiroshi; Sato, Ken-ichi

    2016-02-01

    An effective solution to the continuous Internet traffic expansion is to offload traffic to lower layers such as the L2 or L1 optical layers. One possible approach is to introduce dynamic optical path operations such as adaptive establishment/tear down according to traffic variation. Path operations cannot be done instantaneously; hence, traffic prediction is essential. Conventional prediction techniques need optimal parameter values to be determined in advance by averaging long-term variations from the past. However, this does not allow adaptation to the ever-changing short-term variations expected to be common in future networks. In this paper, we propose a real-time optical path control method based on a machinelearning technique involving support vector machines (SVMs). A SVM learns the most recent traffic characteristics, and so enables better adaptation to temporal traffic variations than conventional techniques. The difficulty lies in determining how to minimize the time gap between optical path operation and buffer management at the originating points of those paths. The gap makes the required learning data set enormous and the learning process costly. To resolve the problem, we propose the adoption of multiple SVMs running in parallel, trained with non-overlapping subsets of the original data set. The maximum value of the outputs of these SVMs will be the estimated number of necessary paths. Numerical experiments prove that our proposed method outperforms a conventional prediction method, the autoregressive moving average method with optimal parameter values determined by Akaike's information criterion, and reduces the packet-loss ratio by up to 98%.

  12. Automatic Computer Algorithms for Beam-based Setup of the LHC Collimators

    CERN Document Server

    Valentino, G; Assmann, R W; Bruce, R; Redaelli, S; Salvachua, B; Wollmann, D

    2012-01-01

    Beam-based setup of the LHC collimators is necessary to establish the beam centers and beam sizes at the collimator locations and determine the operational settings during various stages of the LHC machine cycle.

  13. Variable neighborhood search algorithm for solving robot cell scheduling problem--scheduling sequence-dependent setup times%变邻域搜索算法求解机器人制造单元调度问题--排序依赖转换时间

    Institute of Scientific and Technical Information of China (English)

    李庆香; 赵晓飞

    2016-01-01

    针对排序依赖转换时间的两机器机器人制造单元调度问题的NP难特性,设计了变邻域搜索算法求解。为了加快算法收敛速度,设计了工件阻塞时间最小化生成初始解;为了搜索到更好解,分析了算法的参数取值。通过随机产生算例测试,提出算法优于模拟退火算法,证实了提出算法的有效性。%Two-machine robotic cell scheduling problem with sequence-dependent setup times which is NP-hard is researched, variable neighborhood search is designed in the field. In order to speed up the convergence, minimization of blocking time close part method which produces initial solution is designed. Parameters of proposed algorithm are analysed for finding better solution. The presented algorithm is compared to SA by solving randomly generated stances, the results show that the algorithm is more effectively.

  14. Single-Machine Scheduling with Learning Effects and Maintenance: A Methodological Note on Some Polynomial-Time Solvable Cases

    Directory of Open Access Journals (Sweden)

    Kuo-Ching Ying

    2017-01-01

    Full Text Available This work addresses four single-machine scheduling problems (SMSPs with learning effects and variable maintenance activity. The processing times of the jobs are simultaneously determined by a decreasing function of their corresponding scheduled positions and the sum of the processing times of the already processed jobs. Maintenance activity must start before a deadline and its duration increases with the starting time of the maintenance activity. This work proposes a polynomial-time algorithm for optimally solving two SMSPs to minimize the total completion time and the total tardiness with a common due date.

  15. A wireless brain-machine interface for real-time speech synthesis.

    Directory of Open Access Journals (Sweden)

    Frank H Guenther

    Full Text Available BACKGROUND: Brain-machine interfaces (BMIs involving electrodes implanted into the human cerebral cortex have recently been developed in an attempt to restore function to profoundly paralyzed individuals. Current BMIs for restoring communication can provide important capabilities via a typing process, but unfortunately they are only capable of slow communication rates. In the current study we use a novel approach to speech restoration in which we decode continuous auditory parameters for a real-time speech synthesizer from neuronal activity in motor cortex during attempted speech. METHODOLOGY/PRINCIPAL FINDINGS: Neural signals recorded by a Neurotrophic Electrode implanted in a speech-related region of the left precentral gyrus of a human volunteer suffering from locked-in syndrome, characterized by near-total paralysis with spared cognition, were transmitted wirelessly across the scalp and used to drive a speech synthesizer. A Kalman filter-based decoder translated the neural signals generated during attempted speech into continuous parameters for controlling a synthesizer that provided immediate (within 50 ms auditory feedback of the decoded sound. Accuracy of the volunteer's vowel productions with the synthesizer improved quickly with practice, with a 25% improvement in average hit rate (from 45% to 70% and 46% decrease in average endpoint error from the first to the last block of a three-vowel task. CONCLUSIONS/SIGNIFICANCE: Our results support the feasibility of neural prostheses that may have the potential to provide near-conversational synthetic speech output for individuals with severely impaired speech motor control. They also provide an initial glimpse into the functional properties of neurons in speech motor cortical areas.

  16. Languages, compilers and run-time environments for distributed memory machines

    CERN Document Server

    Saltz, J

    1992-01-01

    Papers presented within this volume cover a wide range of topics related to programming distributed memory machines. Distributed memory architectures, although having the potential to supply the very high levels of performance required to support future computing needs, present awkward programming problems. The major issue is to design methods which enable compilers to generate efficient distributed memory programs from relatively machine independent program specifications. This book is the compilation of papers describing a wide range of research efforts aimed at easing the task of programmin

  17. A Multiobjective Optimization Approach to Solve a Parallel Machines Scheduling Problem

    OpenAIRE

    2010-01-01

    A multiobjective optimization problem which focuses on parallel machines scheduling is considered. This problem consists of scheduling independent jobs on identical parallel machines with release dates, due dates, and sequence-dependent setup times. The preemption of jobs is forbidden. The aim is to minimize two different objectives: makespan and total tardiness. The contribution of this paper is to propose first a new mathematical model for this specific p...

  18. Stability and Bifurcation Analysis of Man-machine System with Time Delay

    Institute of Scientific and Technical Information of China (English)

    YANG Ji-hua; LIU Mei

    2012-01-01

    A mathematical model of man-machine system is considered.Based on the reference [4],the direction and stability of the Hopf bifurcation are determined using the normal form method and the center manifold theory.Furthermore,the existence of Hopf-zero bifurcation is discussed.In the end,some numerical simulations are carried out to illustrate the results found.

  19. Design of a real-time open architecture controller for reconfigurable machine tool

    CSIR Research Space (South Africa)

    Masekamela, I

    2008-06-01

    Full Text Available modular structure in form of modular machines and open architecture controllers that can quickly change the physical structure and appropriately adjust the control system to adapt to the new production requirements. The paper aims to present the design...

  20. A new setup for the underground study of capture reactions

    CERN Document Server

    Casella, C; Lemut, A; Limata, B; Bemmerer, D; Bonetti, R; Broggini, C; Campajola, L; Cocconi, P; Corvisiero, P; Cruz, J; D'Onofrio, A; Formicola, A; Fülöp, Z; Gervino, G; Gialanella, L; Guglielmetti, A; Gustavino, C; Gyürky, G; Loiano, A; Imbriani, G; Jesus, A P; Junker, M; Musico, P; Ordine, A; Parodi, F; Parolin, M; Pinto, J V; Prati, P; Ribeiro, J P; Roca, V; Rogalla, D; Rolfs, C; Romano, M; Rossi-Alvarez, C; Rottura, A; Schuemann, F; Somorjai, E; Strieder, F; Terrasi, F; Trautvetter, H P; Vomiero, A; Zavatarelli, S

    2002-01-01

    For the study of astrophysically relevant capture reactions in the underground laboratory LUNA a new setup of high sensitivity has been implemented. The setup includes a windowless gas target, a 4 pi BGO summing crystal, and beam calorimeters. The setup has been recently used to measure the d(p,gamma) sup 3 He cross-section for the first time within its solar Gamow peak, i.e. down to 2.5 keV c.m. energy. The features of the optimized setup are described.

  1. Architecture For The Optimization Of A Machining Process In Real Time Through Rule-Based Expert System

    Science.gov (United States)

    Serrano, Rafael; González, Luis Carlos; Martín, Francisco Jesús

    2009-11-01

    Under the project SENSOR-IA which has had financial funding from the Order of Incentives to the Regional Technology Centers of the Counsil of Innovation, Science and Enterprise of Andalusia, an architecture for the optimization of a machining process in real time through rule-based expert system has been developed. The architecture consists of an acquisition system and sensor data processing engine (SATD) from an expert system (SE) rule-based which communicates with the SATD. The SE has been designed as an inference engine with an algorithm for effective action, using a modus ponens rule model of goal-oriented rules.The pilot test demonstrated that it is possible to govern in real time the machining process based on rules contained in a SE. The tests have been done with approximated rules. Future work includes an exhaustive collection of data with different tool materials and geometries in a database to extract more precise rules.

  2. Fully automatic spray-LBL machine with monitoring the real time growth of multilayer films using Quartz Crystal Microbalance

    Directory of Open Access Journals (Sweden)

    Shiratori S.

    2013-08-01

    Full Text Available A fully automatic spray-LBL machine with monitoring the real time growth of multilayer films using Quartz Crystal Microbalance (QCM techniques was newly developed. We established fully automatic spray layer-by-layer method by precisely controlling air pressure, solution flow, and spray pattern. The movement pattern towards the substrate during solution spraying allowed fabrication of a nano-scale, flat, thin film over a wide area. Optimization of spray conditions permitted fabrication of the flat film with high and low refractive indexes, and they were piled up alternatively to constitute a one-dimensional photonic crystal with near-infrared reflection characteristics. The heat shield effect of the near-infrared reflective film was also confirmed under natural sunlight. It was demonstrated that the fabrication using the automatic spray-LBL machine and real-time QCM monitoring allows the fabrication of optical quality thin films with precise thickness.

  3. Concise review of relaxations and approximation algorithms for nonidentical parallel-machine scheduling to minimize total weighted completion times

    Institute of Scientific and Technical Information of China (English)

    Li Kai; Yang Shanlin

    2008-01-01

    A class of nonidentical parallel machine scheduling problems are considered in which the goal is to minimize the total weighted completion time.Models and relaxations are collected.Most of these problems are NP-hard,in the strong sense,or open problems,therefore approximation algorithms are studied.The review reveals that there exist some potential areas worthy of further research.

  4. Setup of a bench for short time laser flash diffusivity measurement; Mise en place d`un banc de mesure de diffusivite flash laser aux temps courts

    Energy Technology Data Exchange (ETDEWEB)

    Remy, B.; Maillet, D.; Degiovanni, A. [Centre National de la Recherche Scientifique (CNRS), 54 - Vandoeuvre-les-Nancy (France)

    1996-12-31

    In the domain of thermal engineering, new materials have been developed which are characterized by a high thermal diffusivity (5 to 10 times greater than the best usual conductors: gold, copper, silicon..) but also by a small thickness (from few hundreds of microns to few microns). Their time of response is very short (some few milliseconds to some few microseconds) and they are mainly used as heat dissipating materials. The classical thermal diffusivity measurement techniques are unable to analyze the thermal properties of these materials. Therefore, a bench for fast thermal diffusivity measurements has been developed that uses a laser system for the excitation and for the measurement of temperature (infrared detector). In this study, the measurement bench is described and the metrological problems encountered are discussed. (J.S.) 10 refs.

  5. Effect of real time aging and cyclic fatigue on fused and cemented machined veneers to Y-TZP zirconia

    Science.gov (United States)

    Alhaddad, Abdulrahman Jafar M.

    Objectives: The objectives of this study was to determine the differences in failure load between cemented and fused machined veneers to zirconia while observing the effects of real time aging on failure load between cemented and fused machined veneers to zirconia. The study was to examine the differences in aging and fatigue resistance amongst a machined glass-ceramic veneer and a machined feldspathic porcelain veneer. Materials & Methods: VITA In Ceram YZ zirconia blocks were used as a substructure framework for the three unit fixed partial denture. The veneering material was either milled IPS e.max CAD (glass-ceramic) or milled VITABLOCS Triluxe Forte (feldspathic porcelain). The types of linking material between the substructures and veneering material were either fusing or cementation. Observations were compared between aged and non-aged specimens divided into two main groups; (a) non-aged group (b) aged for three years at room temperature. Each group has two subgroups; fused and cemented which are further divided into static and cyclic fatigue at 20K, 60K and 80K. Specimens were subjected to load to failure test using universal test machine. 40% of failure load was calculated for the cyclic fatigue subgroups. In order to examine the difference in failure load between the static and fatigued specimens, the Tukey-Kramer HSD test was used to analyze the data. Results and Conclusions: The VITABLOCS Triluxe Forte (feldspathic porcelain) fused to YZ zirconia showed significantly lower failure load values compared to all the other groups (pcemented to YZ zirconia (static and cyclic) showed significantly higher load to failure than the aged cemented Triluxe fatigued groups (pcemented to YZ zirconia framework (p>0.05). The aged IPS e.max CAD fatigued (20K, 60K and 80K cycles) cemented to YZ zirconia showed lower significant difference in failure load among all the other IPS e.max groups. (p<0.05).

  6. An improved method of support vector machine and its applications to financial time series forecasting

    Institute of Scientific and Technical Information of China (English)

    LIANG Yanchun; SUN Yanfeng

    2003-01-01

    A novel method for kernel function of support vector machine is presented based on the information geometry theory. The kernel function is modified using a conformal mapping to make the kernel data-dependent so as to increase the ability of predicting high noise data of the method. Numerical simulations demonstrate the effectiveness of the method. Simulated results on the prediction of the stock price show that the improved approach possesses better forecasting precision and ability of generalization than the conventional models.

  7. Data Mining and Machine Learning in Time-Domain Discovery and Classification

    Science.gov (United States)

    Bloom, Joshua S.; Richards, Joseph W.

    2012-03-01

    The changing heavens have played a central role in the scientific effort of astronomers for centuries. Galileo's synoptic observations of the moons of Jupiter and the phases of Venus starting in 1610, provided strong refutation of Ptolemaic cosmology. These observations came soon after the discovery of Kepler's supernova had challenged the notion of an unchanging firmament. In more modern times, the discovery of a relationship between period and luminosity in some pulsational variable stars [41] led to the inference of the size of the Milky way, the distance scale to the nearest galaxies, and the expansion of the Universe (see Ref. [30] for review). Distant explosions of supernovae were used to uncover the existence of dark energy and provide a precise numerical account of dark matter (e.g., [3]). Repeat observations of pulsars [71] and nearby main-sequence stars revealed the presence of the first extrasolar planets [17,35,44,45]. Indeed, time-domain observations of transient events and variable stars, as a technique, influences a broad diversity of pursuits in the entire astronomy endeavor [68]. While, at a fundamental level, the nature of the scientific pursuit remains unchanged, the advent of astronomy as a data-driven discipline presents fundamental challenges to the way in which the scientific process must now be conducted. Digital images (and data cubes) are not only getting larger, there are more of them. On logistical grounds, this taxes storage and transport systems. But it also implies that the intimate connection that astronomers have always enjoyed with their data - from collection to processing to analysis to inference - necessarily must evolve. Figure 6.1 highlights some of the ways that the pathway to scientific inference is now influenced (if not driven by) modern automation processes, computing, data-mining, and machine-learning (ML). The emerging reliance on computation and ML is a general one - a central theme of this book - but the time

  8. PGNAA neutron source moderation setup optimization

    CERN Document Server

    Zhang, Jinzhao

    2013-01-01

    Monte Carlo simulations were carried out to design a prompt {\\gamma}-ray neutron activation analysis (PGNAA) thermal neutron output setup using MCNP5 computer code. In these simulations the moderator materials, reflective materials and structure of the PGNAA 252Cf neutrons of thermal neutron output setup were optimized. Results of the calcuations revealed that the thin layer paraffin and the thick layer of heavy water moderated effect is best for 252Cf neutrons spectrum. The new design compared with the conventional neutron source design, the thermal neutron flux and rate were increased by 3.02 times and 3.27 times. Results indicate that the use of this design should increase the neutron flux of prompt gamma-ray neutron activation analysis significantly.

  9. Modeling and simulation of LHC beam-based collimator setup

    CERN Document Server

    Valentino, G; Assmann, R W; Burkart, F; Redaelli, S; Rossi, A; Lari, L

    2012-01-01

    In the 2011 Large Hadron Collider run, collimators were aligned for proton and heavy ion beams using a semiautomatic setup algorithm. The algorithm provided a reduction in the beam time required for setup, an elimination of beam dumps during setup and better reproducibility with respect to manual alignment. A collimator setup simulator was developed based on a Gaussian model of the beam distribution as well as a parametric model of the beam losses. A time-varying beam loss signal can be simulated for a given collimator movement into the beam. The simulation results and comparison to measurement data obtained during collimator setups and dedicated fills for beam halo scraping are presented. The simulator will then be used to develop a fully automatic collimator alignment algorithm.

  10. Least Squares Support Vector Machine Based Real-Time Fault Diagnosis Model for Gas Path Parameters of Aero Engines

    Institute of Scientific and Technical Information of China (English)

    WANG Xu-hui; HUANG Sheng-guo; WANG Ye; LIU Yong-jian; SHU Ping

    2009-01-01

    Least squares support vector machine (LS-SVM) is applied in gas path fault diagnosis for aero engines.Firstly,the deviation data of engine cruise are analyzed.Then,model selection is conducted using pattern search method.Finally,by decoding aircraft communication addressing and reporting system (ACARS) report,a real-time cruise data set is acquired,and the diagnosis model is adopted to process data.In contrast to the radial basis function (RBF) neutral network,LS-SVM is more suitable for real-time diagnosis of gas turbine engine.

  11. Algorithmic Pseudorandomness in Quantum Setups

    Science.gov (United States)

    Bendersky, Ariel; de la Torre, Gonzalo; Senno, Gabriel; Figueira, Santiago; Acín, Antonio

    2016-06-01

    Many experimental setups in quantum physics use pseudorandomness in places where the theory requires randomness. In this Letter we show that the use of pseudorandomness instead of proper randomness in quantum setups has potentially observable consequences. First, we present a new loophole for Bell-like experiments: if some of the parties choose their measurements pseudorandomly, then the computational resources of the local model have to be limited in order to have a proper observation of nonlocality. Second, we show that no amount of pseudorandomness is enough to produce a mixed state by computably choosing pure states from some basis.

  12. Time-optimized laser micro machining by using a new high dynamic and high precision galvo scanner

    Science.gov (United States)

    Jaeggi, Beat; Neuenschwander, Beat; Zimmermann, Markus; Zecherle, Markus; Boeckler, Ernst W.

    2016-03-01

    High accuracy, quality and throughput are key factors in laser micro machining. To obtain these goals the ablation process, the machining strategy and the scanning device have to be optimized. The precision is influenced by the accuracy of the galvo scanner and can further be enhanced by synchronizing the movement of the mirrors with the laser pulse train. To maintain a high machining quality i.e. minimum surface roughness, the pulse-to-pulse distance has also to be optimized. Highest ablation efficiency is obtained by choosing the proper laser peak fluence together with highest specific removal rate. The throughput can now be enhanced by simultaneously increasing the average power, the repetition rate as well as the scanning speed to preserve the fluence and the pulse-to-pulse distance. Therefore a high scanning speed is of essential importance. To guarantee the required excellent accuracy even at high scanning speeds a new interferometry based encoder technology was used, that provides a high quality signal for closed-loop control of the galvo scanner position. Low inertia encoder design enables a very dynamic scanner system, which can be driven to very high line speeds by a specially adapted control solution. We will present results with marking speeds up to 25 m/s using a f = 100 mm objective obtained with a new scanning system and scanner tuning maintaining a precision of about 5 μm. Further it will be shown that, especially for short line lengths, the machining time can be minimized by choosing the proper speed which has not to be the maximum one.

  13. A Machine Learning Nowcasting Method based on Real-time Reanalysis Data

    CERN Document Server

    Han, Lei; Zhang, Wei; Xiu, Yuanyuan; Feng, Hailei; Lin, Yinjing

    2016-01-01

    Despite marked progress over the past several decades, convective storm nowcasting remains a challenge because most nowcasting systems are based on linear extrapolation of radar reflectivity without much consideration for other meteorological fields. The variational Doppler radar analysis system (VDRAS) is an advanced convective-scale analysis system capable of providing analysis of 3-D wind, temperature, and humidity by assimilating Doppler radar observations. Although potentially useful, it is still an open question as to how to use these fields to improve nowcasting. In this study, we present results from our first attempt at developing a Support Vector Machine (SVM) Box-based nOWcasting (SBOW) method under the machine learning framework using VDRAS analysis data. The key design points of SBOW are as follows: 1) The study domain is divided into many position-fixed small boxes and the nowcasting problem is transformed into one question, i.e., will a radar echo > 35 dBZ appear in a box in 30 minutes? 2) Box-...

  14. Run-time scheduling and execution of loops on message passing machines

    Science.gov (United States)

    Saltz, Joel; Crowley, Kathleen; Mirchandaney, Ravi; Berryman, Harry

    1990-01-01

    Sparse system solvers and general purpose codes for solving partial differential equations are examples of the many types of problems whose irregularity can result in poor performance on distributed memory machines. Often, the data structures used in these problems are very flexible. Crucial details concerning loop dependences are encoded in these structures rather than being explicitly represented in the program. Good methods for parallelizing and partitioning these types of problems require assignment of computations in rather arbitrary ways. Naive implementations of programs on distributed memory machines requiring general loop partitions can be extremely inefficient. Instead, the scheduling mechanism needs to capture the data reference patterns of the loops in order to partition the problem. First, the indices assigned to each processor must be locally numbered. Next, it is necessary to precompute what information is needed by each processor at various points in the computation. The precomputed information is then used to generate an execution template designed to carry out the computation, communication, and partitioning of data, in an optimized manner. The design is presented for a general preprocessor and schedule executer, the structures of which do not vary, even though the details of the computation and of the type of information are problem dependent.

  15. Investigation of the effect of the hyperparameter optimization and the time lag selection in time series forecasting using machine learning algorithms

    Science.gov (United States)

    Papacharalampous, Georgia; Tyralis, Hristos; Koutsoyiannis, Demetris

    2017-04-01

    The hyperparameter optimization and the time lag selection are considered to be of great importance in time series forecasting using machine learning (ML) algorithms. To investigate their effect on the ML forecasting performance we conduct several large-scale simulation experiments. Within each of the latter we compare 12 methods on 2 000 simulated time series from the family of Autoregressive Fractionally Integrated Moving Average (ARFIMA) models. The methods are defined by the set {ML algorithm, hyperparameter selection procedure, time lags}. We compare three ML algorithms, i.e. Neural Networks (NN), Random Forests (RF) and Support Vector Machines (SVM), two procedures for hyperparameter selection i.e. predefined hyperparameters or defined after optimization and two regression matrices (using time lag 1 or 1, …, 21). After splitting each simulated time series into a fitting and a testing set, we fit the models to the former set and compare their performance on the latter one. We quantify the methods' performance using several metrics proposed in the literature and benchmark methods. Furthermore, we conduct a sensitivity analysis on the length of the fitting set to examine how it affects the robustness of our results. The findings indicate that the hyperparameter optimization mostly has a small effect on the forecasting performance. This is particularly important, because the hyperparameter optimization is computationally intensive. On the other hand, the time lag selection seems to mostly significantly affect the methods performance when using the NN algorithm, while we observe a similar behaviour for the RF algorithm albeit to a smaller extent.

  16. Developing an Upper Bound and Heuristic Solution Algorithm for Order Scheduling Problem with Machines Idle Time Minimization

    Directory of Open Access Journals (Sweden)

    Hadi Mokhtari

    2013-01-01

    Full Text Available In this paper, the problem of received order scheduling by a manufacturer, with the measure of maximum completion times of orders, has been formulated and then an analytical approach has been devised for its solution. At the beginning of a planning period, the manufacturer receives a number of orders from customers, each of which requires two different stages for processing. In order to minimize the work in process inventories, the no-wait condition between two operations of each order is regarded. Then, the equality of obtained schedules is proved by machine idle time minimization, as objective, with the schedules obtained by maximum completion time minimization. A concept entitled “Order pairing” has been defined and an algorithm for achieving optimal order pairs which is based on symmetric assignment problem has been presented. Using the established order pairs, an upper bound has been developed based on contribution of every order pair out of total machines idle time. Out of different states of improving upper bound, 12 potential situations of order pairs sequencing have been also evaluated and then the upper bound improvement has been proved in each situation, separately. Finally, a heuristic algorithm has been developed based on attained results of pair improvement and a case study in printing industry has been investigated and analyzed to approve its applicability.

  17. Negative impact of prolonged cold storage time before machine perfusion preservation in donation after circulatory death kidney transplantation.

    Science.gov (United States)

    Paloyo, Siegfredo; Sageshima, Junichiro; Gaynor, Jeffrey J; Chen, Linda; Ciancio, Gaetano; Burke, George W

    2016-10-01

    Kidney grafts are often preserved initially in static cold storage (CS) and subsequently on hypothermic machine perfusion (MP). However, the impact of CS/MP time on transplant outcome remains unclear. We evaluated the effect of prolonged CS/MP time in a single-center retrospective cohort of 59 donation after circulatory death (DCD) and 177 matched donation after brain death (DBD) kidney-alone transplant recipients. With mean overall CS/MP times of 6.0 h/30.0 h, overall incidence of delayed graft function (DGF) was higher in DCD transplants (30.5%) than DBD transplants (7.3%, P time (P = 0.0002), male recipient (P = 0.02), and longer MP time (P = 0.08) were associated with higher DGF incidence. In evaluating the joint effects of donor type (DBD vs. DCD), CS time (time (time ≥36 h (P = 0.003) across each donor type and CS time stratum, whereas the unfavorable effect of CS time ≥6 h (P = 0.01) is primarily seen among DCD recipients. Prolonged cold ischemia time had no unfavorable effect on renal function or graft survival at 12mo post-transplant. Long CS/MP time detrimentally affects early DCD/DBD kidney transplant outcome when grafts were mainly preserved by MP; prolonged CS time before MP has a particularly negative impact in DCD kidney transplantation.

  18. Single photon ionization time-of-flight mass spectrometry with a pulsed electron beam pumped excimer VUV lamp for on-line gas analysis: setup and first results on cigarette smoke and human breath.

    Science.gov (United States)

    Mühlberger, F; Streibel, T; Wieser, J; Ulrich, A; Zimmermann, R

    2005-11-15

    Single-photon ionization (SPI) using vacuum ultraviolet (VUV) light produced by an electron beam pumped rare gas excimer source has been coupled to a compact and mobile time-of-flight mass spectrometer (TOFMS). The novel device enables real-time on-line monitoring of organic trace substances in complex gaseous matrixes down to the ppb range. The pulsed VUV radiation of the light source is employed for SPI in the ion source of the TOFMS. Ion extraction is also carried out in a pulsed mode with a short time delay with respect to ionization. The experimental setup of the interface VUV light source/time-of-flight mass spectrometer is described, and the novel SPI-TOFMS system is characterized by means of standard calibration gases. Limits of detection down to 50 ppb for aliphatic and aromatic hydrocarbons were achieved. First on-line applications comprised real-time measurements of aromatic and aliphatic trace compounds in mainstream cigarette smoke, which represents a highly dynamic fluctuating gaseous matrix. Time resolution was sufficient to monitor the smoking process on a puff-by-puff resolved basis. Furthermore, human breath analysis has been carried out to detect differences in the breath of a smoker and a nonsmoker, respectively. Several well-known biomarkers for smoke could be identified in the smoker's breath. The possibility for even shorter measurement times while maintaining the achieved sensitivity makes this new device a promising tool for on-line analysis of organic trace compounds in process gases or biological systems.

  19. Heuristic methods for the single machine scheduling problem with different ready times and a common due date

    Science.gov (United States)

    Birgin, Ernesto G.; Ronconi, Débora P.

    2012-10-01

    The single machine scheduling problem with a common due date and non-identical ready times for the jobs is examined in this work. Performance is measured by the minimization of the weighted sum of earliness and tardiness penalties of the jobs. Since this problem is NP-hard, the application of constructive heuristics that exploit specific characteristics of the problem to improve their performance is investigated. The proposed approaches are examined through a computational comparative study on a set of 280 benchmark test problems with up to 1000 jobs.

  20. Just-in-time preemptive single machine problem with costs of earliness/tardiness, interruption and work-in-process

    Directory of Open Access Journals (Sweden)

    Mohammad Kazemi

    2012-04-01

    Full Text Available This paper considers preemption and idle time are allowed in a single machine scheduling problem with just-in-time (JIT approach. It incorporates Earliness/Tardiness (E/T penalties, interruption penalties and holding cost of jobs which are waiting to be processed as work-in-process (WIP. Generally in non-preemptive problems, E/T penalties are a function of the completion time of the jobs. Then, we introduce a non-linear preemptive scheduling model where the earliness penalty depends on the starting time of a job. The model is liberalized by an elaborately–designed procedure to reach the optimum solution. To validate and verify the performance of proposed model, computational results are presented by solving a number of numerical examples.

  1. Procedure to Perform Real-Time Reconstruction of the Magnetic Flux in FTU Using RTAI Virtual Machine

    Science.gov (United States)

    Sadeghi, Yahya

    2012-06-01

    One of the important topics of plasma equilibrium issue in a tokamak is to determine and reconstruct the magnetic iso-flux surfaces using plasma boundary condition (in Shafranov, Sov Phys JETP Engl Transl 37:775, 1960). The equilibrium code ODIN is based on the technique using the multi-polar moments method (in Alladio and Crisanti, Nuclear Fusion 26:1143, 1986) which results from homogeneous solution of the Grad-Shafranov equation. This method is used to reconstruct the magnetic flux and equilibrium in the Frascati Tokamak Upgrade experiment. The real-time reconstruction of the magnetic field map is important to compute quantities necessary to control the plasma. In this paper we address the procedure to perform real-time reconstruction of the magnetic flux (based on ODIN) on RTAI virtual machine. As result of the real-time implementation, we will show the time evolution of the reconstructed magnetic iso-flux surfaces.

  2. Malware Propagation on Social Time Varying Networks: A Comparative Study of Machine Learning Frameworks

    Directory of Open Access Journals (Sweden)

    A.A. Ojugo

    2014-08-01

    Full Text Available Significant research into the logarithmic analysis of complex networks yields solution to help minimize virus spread and propagation over networks. This task of virus propagation is been a recurring subject, and design of complex models will yield modeling solutions used in a number of events not limited to and include propagation, dataflow, network immunization, resource management, service distribution, adoption of viral marketing etc. Stochastic models are successfully used to predict the virus propagation processes and its effects on networks. The study employs SI-models for independent cascade and the dynamic models with Enron dataset (of e-mail addresses and presents comparative result using varied machine models. Study samples 25,000 emails of Enron dataset with Entropy and Information Gain computed to address issues of blocking targeting and extent of virus spread on graphs. Study addressed the problem of the expected spread immunization and the expected epidemic spread minimization; but not the epidemic threshold (for space constraint.

  3. Artificial Neural Networks and Support Vector Machines for Water Demand Time Series Forecasting

    CERN Document Server

    Msiza, Ishmael S; Nelwamondo, Fulufhelo Vincent

    2007-01-01

    Water plays a pivotal role in many physical processes, and most importantly in sustaining human life, animal life and plant life. Water supply entities therefore have the responsibility to supply clean and safe water at the rate required by the consumer. It is therefore necessary to implement mechanisms and systems that can be employed to predict both short-term and long-term water demands. The increasingly growing field of computational intelligence techniques has been proposed as an efficient tool in the modelling of dynamic phenomena. The primary objective of this paper is to compare the efficiency of two computational intelligence techniques in water demand forecasting. The techniques under comparison are the Artificial Neural Networks (ANNs) and the Support Vector Machines (SVMs). In this study it was observed that the ANNs perform better than the SVMs. This performance is measured against the generalisation ability of the two.

  4. Real-time topological image smoothing on shared memory parallel machines

    Science.gov (United States)

    Mahmoudi, Ramzi; Akil, Mohamed

    2011-03-01

    Smoothing filter is the method of choice for image preprocessing and pattern recognition. We present a new concurrent method for smoothing 2D object in binary case. Proposed method provides a parallel computation while preserving the topology by using homotopic transformations. We introduce an adapted parallelization strategy called split, distribute and merge (SDM) strategy which allows efficient parallelization of a large class of topological operators including, mainly, smoothing, skeletonization, and watershed algorithms. To achieve a good speedup, we cared about task scheduling. Distributed work during smoothing process is done by a variable number of threads. Tests on 2D binary image (512*512), using shared memory parallel machine (SMPM) with 8 CPU cores (2× Xeon E5405 running at frequency of 2 GHz), showed an enhancement of 5.2 thus a cadency of 32 images per second is achieved.

  5. Time-resolved temperature measurements in a rapid compression machine using quantum cascade laser absorption in the intrapulse mode

    KAUST Repository

    Nasir, Ehson Fawad

    2016-07-16

    A temperature sensor based on the intrapulse absorption spectroscopy technique has been developed to measure in situ temperature time-histories in a rapid compression machine (RCM). Two quantum-cascade lasers (QCLs) emitting near 4.55μm and 4.89μm were operated in pulsed mode, causing a frequency "down-chirp" across two ro-vibrational transitions of carbon monoxide. The down-chirp phenomenon resulted in large spectral tuning (δν ∼2.8cm-1) within a single pulse of each laser at a high pulse repetition frequency (100kHz). The wide tuning range allowed the application of the two-line thermometry technique, thus making the sensor quantitative and calibration-free. The sensor was first tested in non-reactive CO-N2 gas mixtures in the RCM and then applied to cases of n-pentane oxidation. Experiments were carried out for end of compression (EOC) pressures and temperatures ranging 9.21-15.32bar and 745-827K, respectively. Measured EOC temperatures agreed with isentropic calculations within 5%. Temperature rise measured during the first-stage ignition of n-pentane is over-predicted by zero-dimensional kinetic simulations. This work presents, for the first time, highly time-resolved temperature measurements in reactive and non-reactive rapid compression machine experiments. © 2016 Elsevier Ltd.

  6. A Real-Time Interference Monitoring Technique for GNSS Based on a Twin Support Vector Machine Method.

    Science.gov (United States)

    Li, Wutao; Huang, Zhigang; Lang, Rongling; Qin, Honglei; Zhou, Kai; Cao, Yongbin

    2016-03-04

    Interferences can severely degrade the performance of Global Navigation Satellite System (GNSS) receivers. As the first step of GNSS any anti-interference measures, interference monitoring for GNSS is extremely essential and necessary. Since interference monitoring can be considered as a classification problem, a real-time interference monitoring technique based on Twin Support Vector Machine (TWSVM) is proposed in this paper. A TWSVM model is established, and TWSVM is solved by the Least Squares Twin Support Vector Machine (LSTWSVM) algorithm. The interference monitoring indicators are analyzed to extract features from the interfered GNSS signals. The experimental results show that the chosen observations can be used as the interference monitoring indicators. The interference monitoring performance of the proposed method is verified by using GPS L1 C/A code signal and being compared with that of standard SVM. The experimental results indicate that the TWSVM-based interference monitoring is much faster than the conventional SVM. Furthermore, the training time of TWSVM is on millisecond (ms) level and the monitoring time is on microsecond (μs) level, which make the proposed approach usable in practical interference monitoring applications.

  7. A Real-Time Interference Monitoring Technique for GNSS Based on a Twin Support Vector Machine Method

    Directory of Open Access Journals (Sweden)

    Wutao Li

    2016-03-01

    Full Text Available Interferences can severely degrade the performance of Global Navigation Satellite System (GNSS receivers. As the first step of GNSS any anti-interference measures, interference monitoring for GNSS is extremely essential and necessary. Since interference monitoring can be considered as a classification problem, a real-time interference monitoring technique based on Twin Support Vector Machine (TWSVM is proposed in this paper. A TWSVM model is established, and TWSVM is solved by the Least Squares Twin Support Vector Machine (LSTWSVM algorithm. The interference monitoring indicators are analyzed to extract features from the interfered GNSS signals. The experimental results show that the chosen observations can be used as the interference monitoring indicators. The interference monitoring performance of the proposed method is verified by using GPS L1 C/A code signal and being compared with that of standard SVM. The experimental results indicate that the TWSVM-based interference monitoring is much faster than the conventional SVM. Furthermore, the training time of TWSVM is on millisecond (ms level and the monitoring time is on microsecond (μs level, which make the proposed approach usable in practical interference monitoring applications.

  8. Thermal-Induced Errors Prediction and Compensation for a Coordinate Boring Machine Based on Time Series Analysis

    Directory of Open Access Journals (Sweden)

    Jun Yang

    2014-01-01

    Full Text Available To improve the CNC machine tools precision, a thermal error modeling for the motorized spindle was proposed based on time series analysis, considering the length of cutting tools and thermal declined angles, and the real-time error compensation was implemented. A five-point method was applied to measure radial thermal declinations and axial expansion of the spindle with eddy current sensors, solving the problem that the three-point measurement cannot obtain the radial thermal angle errors. Then the stationarity of the thermal error sequences was determined by the Augmented Dickey-Fuller Test Algorithm, and the autocorrelation/partial autocorrelation function was applied to identify the model pattern. By combining both Yule-Walker equations and information criteria, the order and parameters of the models were solved effectively, which improved the prediction accuracy and generalization ability. The results indicated that the prediction accuracy of the time series model could reach up to 90%. In addition, the axial maximum error decreased from 39.6 μm to 7 μm after error compensation, and the machining accuracy was improved by 89.7%. Moreover, the X/Y-direction accuracy can reach up to 77.4% and 86%, respectively, which demonstrated that the proposed methods of measurement, modeling, and compensation were effective.

  9. Performance Evaluation of Machine Learning Methods for Leaf Area Index Retrieval from Time-Series MODIS Reflectance Data

    Science.gov (United States)

    Wang, Tongtong; Xiao, Zhiqiang; Liu, Zhigang

    2017-01-01

    Leaf area index (LAI) is an important biophysical parameter and the retrieval of LAI from remote sensing data is the only feasible method for generating LAI products at regional and global scales. However, most LAI retrieval methods use satellite observations at a specific time to retrieve LAI. Because of the impacts of clouds and aerosols, the LAI products generated by these methods are spatially incomplete and temporally discontinuous, and thus they cannot meet the needs of practical applications. To generate high-quality LAI products, four machine learning algorithms, including back-propagation neutral network (BPNN), radial basis function networks (RBFNs), general regression neutral networks (GRNNs), and multi-output support vector regression (MSVR) are proposed to retrieve LAI from time-series Moderate Resolution Imaging Spectroradiometer (MODIS) reflectance data in this study and performance of these machine learning algorithms is evaluated. The results demonstrated that GRNNs, RBFNs, and MSVR exhibited low sensitivity to training sample size, whereas BPNN had high sensitivity. The four algorithms performed slightly better with red, near infrared (NIR), and short wave infrared (SWIR) bands than red and NIR bands, and the results were significantly better than those obtained using single band reflectance data (red or NIR). Regardless of band composition, GRNNs performed better than the other three methods. Among the four algorithms, BPNN required the least training time, whereas MSVR needed the most for any sample size. PMID:28045443

  10. The current status of the MASHA setup

    Energy Technology Data Exchange (ETDEWEB)

    Vedeneev, V. Yu., E-mail: vvedeneyev@gmail.com; Rodin, A. M.; Krupa, L.; Belozerov, A. V.; Chernysheva, E. V.; Dmitriev, S. N.; Gulyaev, A. V.; Gulyaeva, A. V.; Kamas, D. [Joint Institute for Nuclear Research, Flerov Laboratory of Nuclear Reactions (Russian Federation); Kliman, J. [Slovak Academy of Sciences, Institute of Physics (Slovakia); Komarov, A. B.; Motycak, S.; Novoselov, A. S.; Salamatin, V. S.; Stepantsov, S. V.; Podshibyakin, A. V.; Yukhimchuk, S. A. [Joint Institute for Nuclear Research, Flerov Laboratory of Nuclear Reactions (Russian Federation); Granja, C.; Pospisil, S. [Czech Technical University in Prague, Institute of Experimental and Applied Physics (Czech Republic)

    2017-11-15

    The MASHA setup designed as the mass-separator with the resolving power of about 1700, which allows mass identification of superheavy nuclides is described. The setup uses solid ISOL (Isotope Separation On-Line) method. In the present article the upgrade of some parts of MASHA are described: target box (rotating target + hot catcher), ion source based on electron cyclotron resonance, data acquisition, beam diagnostics and control systems. The upgrade is undertaken in order to increase the total separation efficiency, reduce the separation time, of the installation and working stability and make possible continuous measurements at high beam currents. Ion source efficiency was measured in autonomous regime with using calibrated gas leaks of Kr and Xe injected directly to ion source. Some results of the first experiments for production of radon isotopes using the multi-nucleon transfer reaction {sup 48}Ca+{sup 242}Pu are described in the present article. The using of TIMEPIX detector with MASHA setup for neutron-rich Rn isotopes identification is also described.

  11. Cost Effective Cloud Environment Setup to Secure Corporate Data

    Directory of Open Access Journals (Sweden)

    Mrs.Ashwini Prakash Sawant

    2013-12-01

    Full Text Available In recent years ad-hoc parallel processing has emerged to be one among the killer applications for Infrastructure-as-a-Service (IaaS clouds. Major Cloud computing firms have began to integrate frameworks for parallel processing in their product portfolio, creating it simple for purchasers to access these services and to deploy their programs. However, the process frameworks that area unit presently used are designed for static, consistent cluster setups and disrespect the actual nature of a cloud. Consequently, the allotted calculate resources could also be inadequate for giant components of the submitted job and unnecessarily increase time interval and value. During this paper we tend to discuss the opportunities and challenges for economical parallel processing in clouds and present our research HPSSD. HPSSD is the data processing framework to overtly utilize the dynamic resource portion presented by today’s IaaS clouds for each with hacker protection, task programming and execution. Specific tasks of a process job are often assigned to differing types of virtual machines that are mechanically instantiated and terminated throughout the task execution.

  12. Real-time estimation of 3D human arm motion from markerless images for human-machine interaction

    Science.gov (United States)

    Verma, Siddharth; Kofman, Jonathan

    2003-10-01

    Vision-based motion tracking is commonly used in surveillance, human-machine interfaces in robotics and automation, virtual and augmented reality applications and biomechanics. Most techniques require markers, use a predefined motion sequence or user-intervention for initialization, and do not process in real-time. This paper describes the implementation of a vision-based non-invasive technique for markerless real-time tracking of human-arm motion. Human-arm motion is tracked by processing images from two calibrated cameras in real-time to estimate the position of the 3D joint centers of the wrist and elbow, and determine the orientation of the hand from the 3D positions of the index finger and thumb. Tracking of the hand and arm was carried out without any prior knowledge of subject's arm length, texture, width and distance from the camera.

  13. Brain-machine interface via real-time fMRI: preliminary study on thought-controlled robotic arm.

    Science.gov (United States)

    Lee, Jong-Hwan; Ryu, Jeongwon; Jolesz, Ferenc A; Cho, Zang-Hee; Yoo, Seung-Schik

    2009-01-23

    Real-time functional MRI (rtfMRI) has been used as a basis for brain-computer interface (BCI) due to its ability to characterize region-specific brain activity in real-time. As an extension of BCI, we present an rtfMRI-based brain-machine interface (BMI) whereby 2-dimensional movement of a robotic arm was controlled by the regulation (and concurrent detection) of regional cortical activations in the primary motor areas. To do so, the subjects were engaged in the right- and/or left-hand motor imagery tasks. The blood oxygenation level dependent (BOLD) signal originating from the corresponding hand motor areas was then translated into horizontal or vertical robotic arm movement. The movement was broadcasted visually back to the subject as a feedback. We demonstrated that real-time control of the robotic arm only through the subjects' thought processes was possible using the rtfMRI-based BMI trials.

  14. Sum-of-Processing-Times-Based Two-Agent Single-Machine Scheduling with Aging Effects and Tardiness

    Directory of Open Access Journals (Sweden)

    Do Gyun Kim

    2015-01-01

    Full Text Available We consider a two-agent single-machine scheduling problem that minimizes the total weighted tardiness of one agent under the restriction that the second agent is prohibited from having tardy jobs. The actual processing times of all jobs are affected by a sum-of-processing-times-based aging effect. After showing the NP-hardness of the problem, we design a branch-and-bound (B&B algorithm to find an optimal solution by developing dominance properties and a lower bound for the total weighted tardiness to increase search efficiency. Because B&B takes a long time to find an optimal solution, we propose a genetic algorithm as an efficient, near optimal solution approach. Four methods for generating initial populations are considered, and edge recombination crossover is adopted as a genetic operator. Through numerical experiments, we verify the outstanding performance of the proposed genetic algorithm.

  15. SINGLE MACHINE SCHEDULING WITH CONTROLLABLE PROCESSING TIMES AND COMPRESSION COSTS (Part Ⅱ Heuristics for the General Case)

    Institute of Scientific and Technical Information of China (English)

    Foulds,L.R.; TangGuochun

    1999-01-01

    A single machine scheduling problem with controllable processing times and compression costs is considered. The objective is to find an optimal sequence to minimize the cost ofcompletion times and the cost of compression. The complexity of this problem is still unknown.In Part Ⅱ of this paper,the authors have considered a special case where the compression timesand the compression costs are equal among all jobs. Such a problem appears polynomiafiy solvable by developing an O(n2) algorithm. In this part(Part Ⅱ ),a general case where the controllable processing times and the compression costs are not equal is discussed. Authors proposehere two heuristics with the first based on some previous work and the second based on the algorithm developed in Part Ⅱ . Computational results are presented to show the efficiency and therobustness of these heuristics.

  16. HVM-TP: A Time Predictable, Portable Java Virtual Machine for Hard Real-Time Embedded Systems

    DEFF Research Database (Denmark)

    Luckow, Kasper Søe; Thomsen, Bent; Korsholm, Stephan Erbs

    2014-01-01

    We present HVMTIME; a portable and time predictable JVM implementation with applications in resource-constrained hard real-time embedded systems. In addition, it implements the Safety Critical Java (SCJ) Level 1 specification. Time predictability is achieved by a combination of time predictable...

  17. Gear fault diagnosis under variable conditions with intrinsic time-scale decomposition-singular value decomposition and support vector machine

    Energy Technology Data Exchange (ETDEWEB)

    Xing, Zhanqiang; Qu, Jianfeng; Chai, Yi; Tang, Qiu; Zhou, Yuming [Chongqing University, Chongqing (China)

    2017-02-15

    The gear vibration signal is nonlinear and non-stationary, gear fault diagnosis under variable conditions has always been unsatisfactory. To solve this problem, an intelligent fault diagnosis method based on Intrinsic time-scale decomposition (ITD)-Singular value decomposition (SVD) and Support vector machine (SVM) is proposed in this paper. The ITD method is adopted to decompose the vibration signal of gearbox into several Proper rotation components (PRCs). Subsequently, the singular value decomposition is proposed to obtain the singular value vectors of the proper rotation components and improve the robustness of feature extraction under variable conditions. Finally, the Support vector machine is applied to classify the fault type of gear. According to the experimental results, the performance of ITD-SVD exceeds those of the time-frequency analysis methods with EMD and WPT combined with SVD for feature extraction, and the classifier of SVM outperforms those for K-nearest neighbors (K-NN) and Back propagation (BP). Moreover, the proposed approach can accurately diagnose and identify different fault types of gear under variable conditions.

  18. Comparison of random forests and support vector machine for real-time radar-derived rainfall forecasting

    Science.gov (United States)

    Yu, Pao-Shan; Yang, Tao-Chang; Chen, Szu-Yin; Kuo, Chen-Min; Tseng, Hung-Wei

    2017-09-01

    This study aims to compare two machine learning techniques, random forests (RF) and support vector machine (SVM), for real-time radar-derived rainfall forecasting. The real-time radar-derived rainfall forecasting models use the present grid-based radar-derived rainfall as the output variable and use antecedent grid-based radar-derived rainfall, grid position (longitude and latitude) and elevation as the input variables to forecast 1- to 3-h ahead rainfalls for all grids in a catchment. Grid-based radar-derived rainfalls of six typhoon events during 2012-2015 in three reservoir catchments of Taiwan are collected for model training and verifying. Two kinds of forecasting models are constructed and compared, which are single-mode forecasting model (SMFM) and multiple-mode forecasting model (MMFM) based on RF and SVM. The SMFM uses the same model for 1- to 3-h ahead rainfall forecasting; the MMFM uses three different models for 1- to 3-h ahead forecasting. According to forecasting performances, it reveals that the SMFMs give better performances than MMFMs and both SVM-based and RF-based SMFMs show satisfactory performances for 1-h ahead forecasting. However, for 2- and 3-h ahead forecasting, it is found that the RF-based SMFM underestimates the observed radar-derived rainfalls in most cases and the SVM-based SMFM can give better performances than RF-based SMFM.

  19. Multivariate Time Series Forecasting of Crude Palm Oil Price Using Machine Learning Techniques

    Science.gov (United States)

    Kanchymalay, Kasturi; Salim, N.; Sukprasert, Anupong; Krishnan, Ramesh; Raba'ah Hashim, Ummi

    2017-08-01

    The aim of this paper was to study the correlation between crude palm oil (CPO) price, selected vegetable oil prices (such as soybean oil, coconut oil, and olive oil, rapeseed oil and sunflower oil), crude oil and the monthly exchange rate. Comparative analysis was then performed on CPO price forecasting results using the machine learning techniques. Monthly CPO prices, selected vegetable oil prices, crude oil prices and monthly exchange rate data from January 1987 to February 2017 were utilized. Preliminary analysis showed a positive and high correlation between the CPO price and soy bean oil price and also between CPO price and crude oil price. Experiments were conducted using multi-layer perception, support vector regression and Holt Winter exponential smoothing techniques. The results were assessed by using criteria of root mean square error (RMSE), means absolute error (MAE), means absolute percentage error (MAPE) and Direction of accuracy (DA). Among these three techniques, support vector regression(SVR) with Sequential minimal optimization (SMO) algorithm showed relatively better results compared to multi-layer perceptron and Holt Winters exponential smoothing method.

  20. Real Time Classification and Clustering Of IDS Alerts Using Machine Learning Algorithms

    Directory of Open Access Journals (Sweden)

    T. Subbulakshmi

    2010-01-01

    Full Text Available Intrusion Detection Systems (IDS monitor a secured network for the evidence of maliciousactivities originating either inside or outside. Upon identifying a suspicious traffic, IDSgenerates and logs an alert. Unfortunately, most of the alerts generated are either false positive,i.e. benign traffic that has been classified as intrusions, or irrelevant, i.e. attacks that are notsuccessful. The abundance of false positive alerts makes it difficult for the security analyst tofind successful attacks and take remedial action. This paper describes a two phase automaticalert classification system to assist the human analyst in identifying the false positives. In thefirst phase, the alerts collected from one or more sensors are normalized and similar alerts aregrouped to form a meta-alert. These meta-alerts are passively verified with an asset database tofind out irrelevant alerts. In addition, an optional alert generalization is also performed for rootcause analysis and thereby reduces false positives with human interaction. In the second phase,the reduced alerts are labeled and passed to an alert classifier which uses machine learningtechniques for building the classification rules. This helps the analyst in automatic classificationof the alerts. The system is tested in real environments and found to be effective in reducing thenumber of alerts as well as false positives dramatically, and thereby reducing the workload ofhuman analyst.

  1. REAL TIME CLASSIFICATION AND CLUSTERING OF IDS ALERTS USING MACHINE LEARNING ALGORITHMS

    Directory of Open Access Journals (Sweden)

    T. Subbulakshmi

    2010-01-01

    Full Text Available Intrusion Detection Systems (IDS monitor a secured network for the evidence of malicious activities originating either inside or outside. Upon identifying a suspicious traffic, IDS generates and logs an alert. Unfortunately, most of the alerts generated are either false positive, i.e. benign traffic that has been classified as intrusions, or irrelevant, i.e. attacks that are not successful. The abundance of false positive alerts makes it difficult for the security analyst to find successful attacks and take remedial action. This paper describes a two phase automatic alert classification system to assist the human analyst in identifying the false positives. In the first phase, the alerts collected from one or more sensors are normalized and similar alerts are grouped to form a meta-alert. These meta-alerts are passively verified with an asset database to find out irrelevant alerts. In addition, an optional alert generalization is also performed for root cause analysis and thereby reduces false positives with human interaction. In the second phase, the reduced alerts are labeled and passed to an alert classifier which uses machine learning techniques for building the classification rules. This helps the analyst in automatic classification of the alerts. The system is tested in real environments and found to be effective in reducing the number of alerts as well as false positives dramatically, and thereby reducing the workload of human analyst.

  2. Simple setup for gas-phase H/D exchange mass spectrometry coupled to electron transfer dissociation and ion mobility for analysis of polypeptide structure on a liquid chromatographic time scale.

    Science.gov (United States)

    Mistarz, Ulrik H; Brown, Jeffery M; Haselmann, Kim F; Rand, Kasper D

    2014-12-01

    Gas-phase hydrogen/deuterium exchange (HDX) is a fast and sensitive, yet unharnessed analytical approach for providing information on the structural properties of biomolecules, in a complementary manner to mass analysis. Here, we describe a simple setup for ND3-mediated millisecond gas-phase HDX inside a mass spectrometer immediately after ESI (gas-phase HDX-MS) and show utility for studying the primary and higher-order structure of peptides and proteins. HDX was achieved by passing N2-gas through a container filled with aqueous deuterated ammonia reagent (ND3/D2O) and admitting the saturated gas immediately upstream or downstream of the primary skimmer cone. The approach was implemented on three commercially available mass spectrometers and required no or minor fully reversible reconfiguration of gas-inlets of the ion source. Results from gas-phase HDX-MS of peptides using the aqueous ND3/D2O as HDX reagent indicate that labeling is facilitated exclusively through gaseous ND3, yielding similar results to the infusion of purified ND3-gas, while circumventing the complications associated with the use of hazardous purified gases. Comparison of the solution-phase- and gas-phase deuterium uptake of Leu-Enkephalin and Glu-Fibrinopeptide B, confirmed that this gas-phase HDX-MS approach allows for labeling of sites (heteroatom-bound non-amide hydrogens located on side-chains, N-terminus and C-terminus) not accessed by classical solution-phase HDX-MS. The simple setup is compatible with liquid chromatography and a chip-based automated nanoESI interface, allowing for online gas-phase HDX-MS analysis of peptides and proteins separated on a liquid chromatographic time scale at increased throughput. Furthermore, online gas-phase HDX-MS could be performed in tandem with ion mobility separation or electron transfer dissociation, thus enabling multiple orthogonal analyses of the structural properties of peptides and proteins in a single automated LC-MS workflow.

  3. Real-time PCR Machine System Modeling and a Systematic Approach for the Robust Design of a Real-time PCR-on-a-Chip System

    Directory of Open Access Journals (Sweden)

    Da-Sheng Lee

    2010-01-01

    Full Text Available Chip-based DNA quantification systems are widespread, and used in many point-of-care applications. However, instruments for such applications may not be maintained or calibrated regularly. Since machine reliability is a key issue for normal operation, this study presents a system model of the real-time Polymerase Chain Reaction (PCR machine to analyze the instrument design through numerical experiments. Based on model analysis, a systematic approach was developed to lower the variation of DNA quantification and achieve a robust design for a real-time PCR-on-a-chip system. Accelerated lift testing was adopted to evaluate the reliability of the chip prototype. According to the life test plan, this proposed real-time PCR-on-a-chip system was simulated to work continuously for over three years with similar reproducibility in DNA quantification. This not only shows the robustness of the lab-on-a-chip system, but also verifies the effectiveness of our systematic method for achieving a robust design.

  4. Some relations between quantum Turing machines and Turing machines

    CERN Document Server

    Sicard, A; Sicard, Andrés; Vélez, Mario

    1999-01-01

    For quantum Turing machines we present three elements: Its components, its time evolution operator and its local transition function. The components are related with deterministic Turing machines, the time evolution operator is related with reversible Turing machines and the local transition function is related with probabilistic and reversible Turing machines.

  5. A machine vision approach to seam tracking in real-time in PAW of large-diameter stainless steel tube

    Institute of Scientific and Technical Information of China (English)

    葛景国; 朱政强; 何德孚; 陈立功

    2004-01-01

    Manual monitoring and seam tracking through watching weld pool images in real-time, by naked eyes or by industrial TV, are experience-depended, subjective, labor intensive, and sometimes biased. So it is necessary to realize the automation of computer-aided seam tracking. A PAW (plasma arc welding) seam tracking system was developed, which senses the molten pool and the seam in one frame by a vision sensor, and then detects the seam deviation to adjust the work piece motion adaptively to the seam position sensed by vision sensor. A novel molten pool area image-processing algorithm based on machine vision was proposed. The algorithm processes each image at the speed of 20 frames/second in real-time to extract three feature variables to get the seam deviation. It is proved experimentally that the algorithm is very fast and effective. Issues related to the algorithm are also discussed.

  6. Perspective: Web-based machine learning models for real-time screening of thermoelectric materials properties

    Science.gov (United States)

    Gaultois, Michael W.; Oliynyk, Anton O.; Mar, Arthur; Sparks, Taylor D.; Mulholland, Gregory J.; Meredig, Bryce

    2016-05-01

    The experimental search for new thermoelectric materials remains largely confined to a limited set of successful chemical and structural families, such as chalcogenides, skutterudites, and Zintl phases. In principle, computational tools such as density functional theory (DFT) offer the possibility of rationally guiding experimental synthesis efforts toward very different chemistries. However, in practice, predicting thermoelectric properties from first principles remains a challenging endeavor [J. Carrete et al., Phys. Rev. X 4, 011019 (2014)], and experimental researchers generally do not directly use computation to drive their own synthesis efforts. To bridge this practical gap between experimental needs and computational tools, we report an open machine learning-based recommendation engine (http://thermoelectrics.citrination.com) for materials researchers that suggests promising new thermoelectric compositions based on pre-screening about 25 000 known materials and also evaluates the feasibility of user-designed compounds. We show this engine can identify interesting chemistries very different from known thermoelectrics. Specifically, we describe the experimental characterization of one example set of compounds derived from our engine, RE12Co5Bi (RE = Gd, Er), which exhibits surprising thermoelectric performance given its unprecedentedly high loading with metallic d and f block elements and warrants further investigation as a new thermoelectric material platform. We show that our engine predicts this family of materials to have low thermal and high electrical conductivities, but modest Seebeck coefficient, all of which are confirmed experimentally. We note that the engine also predicts materials that may simultaneously optimize all three properties entering into zT; we selected RE12Co5Bi for this study due to its interesting chemical composition and known facile synthesis.

  7. Perspective: Web-based machine learning models for real-time screening of thermoelectric materials properties

    Directory of Open Access Journals (Sweden)

    Michael W. Gaultois

    2016-05-01

    Full Text Available The experimental search for new thermoelectric materials remains largely confined to a limited set of successful chemical and structural families, such as chalcogenides, skutterudites, and Zintl phases. In principle, computational tools such as density functional theory (DFT offer the possibility of rationally guiding experimental synthesis efforts toward very different chemistries. However, in practice, predicting thermoelectric properties from first principles remains a challenging endeavor [J. Carrete et al., Phys. Rev. X 4, 011019 (2014], and experimental researchers generally do not directly use computation to drive their own synthesis efforts. To bridge this practical gap between experimental needs and computational tools, we report an open machine learning-based recommendation engine (http://thermoelectrics.citrination.com for materials researchers that suggests promising new thermoelectric compositions based on pre-screening about 25 000 known materials and also evaluates the feasibility of user-designed compounds. We show this engine can identify interesting chemistries very different from known thermoelectrics. Specifically, we describe the experimental characterization of one example set of compounds derived from our engine, RE12Co5Bi (RE = Gd, Er, which exhibits surprising thermoelectric performance given its unprecedentedly high loading with metallic d and f block elements and warrants further investigation as a new thermoelectric material platform. We show that our engine predicts this family of materials to have low thermal and high electrical conductivities, but modest Seebeck coefficient, all of which are confirmed experimentally. We note that the engine also predicts materials that may simultaneously optimize all three properties entering into zT; we selected RE12Co5Bi for this study due to its interesting chemical composition and known facile synthesis.

  8. Hybrid Metaheuristics for the Unrelated Parallel Machine Scheduling to Minimize Makespan and Maximum Just-in-Time Deviations

    Directory of Open Access Journals (Sweden)

    Chiuh Cheng Chyu

    2012-06-01

    Full Text Available This paper studies the unrelated parallel machine scheduling problem with three minimization objectives – makespan, maximum earliness, and maximum tardiness (MET-UPMSP. The last two objectives combined are related to just-in-time (JIT performance of a solution. Three hybrid algorithms are presented to solve the MET-UPMSP: reactive GRASP with path relinking, dual-archived memetic algorithm (DAMA, and SPEA2. In order to improve the solution quality, min-max matching is included in the decoding scheme for each algorithm. An experiment is conducted to evaluate the performance of the three algorithms, using 100 (jobs x 3 (machines and 200 x 5 problem instances with three combinations of two due date factors – tight and range. The numerical results indicate that DAMA performs best and GRASP performs second for most problem instances in three performance metrics: HVR, GD, and Spread. The experimental results also show that incorporating min-max matching into decoding scheme significantly improves the solution quality for the two population-based algorithms. It is worth noting that the solutions produced by DAMA with matching decoding can be used as benchmark to evaluate the performance of other algorithms.

  9. Non-metallic coating thickness prediction using artificial neural network and support vector machine with time resolved thermography

    Science.gov (United States)

    Wang, Hongjin; Hsieh, Sheng-Jen; Peng, Bo; Zhou, Xunfei

    2016-07-01

    A method without requirements on knowledge about thermal properties of coatings or those of substrates will be interested in the industrial application. Supervised machine learning regressions may provide possible solution to the problem. This paper compares the performances of two regression models (artificial neural networks (ANN) and support vector machines for regression (SVM)) with respect to coating thickness estimations made based on surface temperature increments collected via time resolved thermography. We describe SVM roles in coating thickness prediction. Non-dimensional analyses are conducted to illustrate the effects of coating thicknesses and various factors on surface temperature increments. It's theoretically possible to correlate coating thickness with surface increment. Based on the analyses, the laser power is selected in such a way: during the heating, the temperature increment is high enough to determine the coating thickness variance but low enough to avoid surface melting. Sixty-one pain-coated samples with coating thicknesses varying from 63.5 μm to 571 μm are used to train models. Hyper-parameters of the models are optimized by 10-folder cross validation. Another 28 sets of data are then collected to test the performance of the three methods. The study shows that SVM can provide reliable predictions of unknown data, due to its deterministic characteristics, and it works well when used for a small input data group. The SVM model generates more accurate coating thickness estimates than the ANN model.

  10. An Improved Automated Setup for Solubility Determination of Drugs

    Directory of Open Access Journals (Sweden)

    Ahmad Ghanbari 1, Yashar Sarbaz, Vahid Jouyban-Gharamaleki, Karim Jouyban-Gharamaleki, Jafar Soleymani, Abolghasem Jouyban

    2016-09-01

    Full Text Available Background: Solubility of a drug/drug candidate is an essential information in the pharmaceutical area. Classical solubility determination method used in the laboratories are expensive and time-consuming. Attempts were made to provide an automated solubility determination setup based on a laser monitoring technique. Methods: In a previously developed setup, drug powder was added to a given quantity of the solvent which made some troubles in practical applications. The present work reports another setup which adds solvent to a given mass of the drug. The validity of the measured solubilities is checked by comparing the measured solubilities of acetaminophen at two temperatures in water and ethanol mixtures with the corresponding data from the literature. Results: The results reveal that the improved setup could overcome the limitations of the previously developed setup and could be used for drug solubility determination. Conclusion: The improved setup overcomes the troubles made in the previous setup and could be used in generating large amount of solubility data to be used in the pharmaceutical industry.

  11. Lot-Order Assignment Applying Priority Rules for the Single-Machine Total Tardiness Scheduling with Nonnegative Time-Dependent Processing Times

    Directory of Open Access Journals (Sweden)

    Jae-Gon Kim

    2015-01-01

    Full Text Available Lot-order assignment is to assign items in lots being processed to orders to fulfill the orders. It is usually performed periodically for meeting the due dates of orders especially in a manufacturing industry with a long production cycle time such as the semiconductor manufacturing industry. In this paper, we consider the lot-order assignment problem (LOAP with the objective of minimizing the total tardiness of the orders with distinct due dates. We show that we can solve the LOAP optimally by finding an optimal sequence for the single-machine total tardiness scheduling problem with nonnegative time-dependent processing times (SMTTSP-NNTDPT. Also, we address how the priority rules for the SMTTSP can be modified to those for the SMTTSP-NNTDPT to solve the LOAP. In computational experiments, we discuss the performances of the suggested priority rules and show the result of the proposed approach outperforms that of the commercial optimization software package.

  12. When Machines Design Machines!

    DEFF Research Database (Denmark)

    2011-01-01

    Until recently we were the sole designers, alone in the driving seat making all the decisions. But, we have created a world of complexity way beyond human ability to understand, control, and govern. Machines now do more trades than humans on stock markets, they control our power, water, gas...... and food supplies, manage our elevators, microclimates, automobiles and transport systems, and manufacture almost everything. It should come as no surprise that machines are now designing machines. The chips that power our computers and mobile phones, the robots and commercial processing plants on which we...... depend, all are now largely designed by machines. So what of us - will be totally usurped, or are we looking at a new symbiosis with human and artificial intelligences combined to realise the best outcomes possible. In most respects we have no choice! Human abilities alone cannot solve any of the major...

  13. Adaptive Time-Frequency Distribution Based on Time-Varying Autoregressive and Its Application to Machine Fault Diagnosis

    Institute of Scientific and Technical Information of China (English)

    2007-01-01

    The time-varying autoregressive (TVAR) modeling of a non-stationary signal is studied. In the proposed method, time-varying parametric identification of a non-stationary signal can be translated into a linear time-invariant problem by introducing a set of basic functions. Then, the parameters are estimated by using a recursive least square algorithm with a forgetting factor and an adaptive time-frequency distribution is achieved. The simulation results show that the proposed approach is superior to the short-time Fourier transform and Wigner distribution. And finally, the proposed method is applied to the fault diagnosis of a bearing, and the experiment result shows that the proposed method is effective in feature extraction.

  14. Calibration setup for ultralow-current transresistance amplifiers

    CERN Document Server

    Finardi, Ilaria

    2016-01-01

    We describe a calibration setup for the transresistance of low-current amplifiers, based on the capacitance-charging method. The calibration can be performed in the current range of typical interest for electron counting experiments. The setup implementation is simple and rugged, and is suitable to be embedded in larger experiments where the amplifier is employed. The calibration is traceable to units of capacitance and of time. The base relative accuracy of the implementation is in the 10^-5 range.

  15. Study of ExacTrac X-ray 6D IGRT setup uncertainty for marker-based prostate IMRT treatment.

    Science.gov (United States)

    Shi, Chengyu; Tazi, Adam; Fang, Deborah Xiangdong; Iannuzzi, Christopher

    2012-05-10

    Novalis Tx ExacTrac X-ray system has the 6D adjustment ability for patient setup. Limited studies exist about the setup uncertainty with ExacTrac X-ray system for IMRT prostate treatment with fiducial markers implanted. The purpose of this study is to investigate the marker-based prostate IMRT treatment setup uncertainty using ExacTrac 6D IGRT ability for patient setup. Forty-three patients with prostate cancers and markers implanted have been treated on the Novalis Tx machine. The ExacTrac X-ray system has been used for the patient pretreatment setup and intratreatment verification. In total, the shifts data for 1261 fractions and 3504 correction times (the numbers of X-ray images were taken from tube 1 and tube 2) have been analyzed. The setup uncertainty has been separated into uncertainties in 6D. Marker matching uncertainty was also analyzed. Correction frequency probability density function was plotted, and the radiation dose for imaging was calculated. The minimum, average, and maximum translation shifts were: -5.12 ± 3.89 mm, 0.20 ± 2.21 mm, and 6.07 ± 4.44 mm, respectively, in the lateral direction; -6.80 ± 3.21 mm, -1.09 ± 2.21 mm, and 3.12 ± 2.62 mm, respectively, in the longitudinal direction; and -7.33 ± 3.46 mm, -0.93 ± 2.70 mm, and 5.93 ± 4.85mm, respectively, in the vertical direction. The minimum, average, and maximum rotation shifts were: -1.23° ± 1.95°, 0.25° ± 1.30°, and 2.38° ± 2.91°, respectively, along lateral direction; -0.67° ± 0.91°, 0.10° ± 0.61°, and 1.51° ± 2.04°, respectively, along longitudinal direction; and -0.75° ± 1.01°, 0.02° ± 0.50°, and 0.82° ± 1.13°, respectively, along vertical direction. On average, each patient had three correction times during one fraction treatment. The radiation dose is about 3 mSv per fraction. With the ExacTrac 6D X-ray system, the prostate IMRT treatment with marker implanted can achieve less than 2 mm setup uncertainty in translations, and less than 0.25° in

  16. Redução do tempo de setup como estratégia de aumento da capacidade produtiva: estudo de caso em sopradora de garrafas plásticas

    Directory of Open Access Journals (Sweden)

    Teonas Bartz

    2012-01-01

    Full Text Available The increasing demand for the introduction of new products to serve all customers from different markets causes companies to seek new concepts in planning and programming production and in the changing of tools. Single-Minute Exchange of Die (SMED reduces the setup time of equipment, minimizing non-productive periods. Thus, it is possible to reduce the size of production batches to increase operating rates and improve the flexibility, productivity and competitiveness of organizations. This paper presents the stages necessary for the implementation of SMED in a plastic bottle blower and reports the results obtained. To achieve this, we conducted an analysis of activities, suggested improvements in the machine and in procedures, timed the stages before and after introducing the improvements and analyzed the times obtained. The results showed a significant reduction in setup time for the machine in this study. Key words: The increasing demand for the introduction of new products to serve all customers from different markets causes companies to seek new concepts in planning and programming production and in the changing of tools. Single- Minute Exchange of Die (SMED reduces the setup time of equipment, minimizing non-productive periods. Thus, it is possible to reduce the size of production batches to increase operating rates and improve the flexibility, productivity and competitiveness of organizations. This paper presents the stages necessary for the implementation of SMED in a plastic bottle blower and reports the results obtained. To achieve this, we conducted an analysis of activities, suggested improvements in the machine and in procedures, timed the stages before and after introducing the improvements and analyzed the times obtained. The results showed a significant reduction in setup time for the machine in this study.

  17. Techniques for optimizing human-machine information transfer related to real-time interactive display systems

    Science.gov (United States)

    Granaas, Michael M.; Rhea, Donald C.

    1989-01-01

    The requirements for the development of real-time displays are reviewed. Of particular interest are the psychological aspects of design such as the layout, color selection, real-time response rate, and the interactivity of displays. Some existing Western Aeronautical Test Range displays are analyzed.

  18. A production inventory model with flexible manufacturing, random machine breakdown and stochastic repair time

    Directory of Open Access Journals (Sweden)

    S.R. Singh

    2014-08-01

    Full Text Available This paper derives a production inventory model over infinite planning horizon with flexible but unreliable manufacturing process and the stochastic repair time. Demand is stock dependent and during the period of sale it depends on reduction on selling price. Production rate is a function of demand and reliability of the production equipment is assumed to be exponentially decreasing function of time. Repair time is estimated using uniform probability density function. The objective of the study is to determine the optimal policy for production system, which maximizes the total profit subject to some constraints under consideration. The results are discussed with a numerical example to illustrate the theory.

  19. Electric Load Forecasting Based on a Least Squares Support Vector Machine with Fuzzy Time Series and Global Harmony Search Algorithm

    Directory of Open Access Journals (Sweden)

    Yan Hong Chen

    2016-01-01

    Full Text Available This paper proposes a new electric load forecasting model by hybridizing the fuzzy time series (FTS and global harmony search algorithm (GHSA with least squares support vector machines (LSSVM, namely GHSA-FTS-LSSVM model. Firstly, the fuzzy c-means clustering (FCS algorithm is used to calculate the clustering center of each cluster. Secondly, the LSSVM is applied to model the resultant series, which is optimized by GHSA. Finally, a real-world example is adopted to test the performance of the proposed model. In this investigation, the proposed model is verified using experimental datasets from the Guangdong Province Industrial Development Database, and results are compared against autoregressive integrated moving average (ARIMA model and other algorithms hybridized with LSSVM including genetic algorithm (GA, particle swarm optimization (PSO, harmony search, and so on. The forecasting results indicate that the proposed GHSA-FTS-LSSVM model effectively generates more accurate predictive results.

  20. Using a "time machine" to test for local adaptation of aquatic microbes to temporal and spatial environmental variation.

    Science.gov (United States)

    Fox, Jeremy W; Harder, Lawrence D

    2015-01-01

    Local adaptation occurs when different environments are dominated by different specialist genotypes, each of which is relatively fit in its local conditions and relatively unfit under other conditions. Analogously, ecological species sorting occurs when different environments are dominated by different competing species, each of which is relatively fit in its local conditions. The simplest theory predicts that spatial, but not temporal, environmental variation selects for local adaptation (or generates species sorting), but this prediction is difficult to test. Although organisms can be reciprocally transplanted among sites, doing so among times seems implausible. Here, we describe a reciprocal transplant experiment testing for local adaptation or species sorting of lake bacteria in response to both temporal and spatial variation in water chemistry. The experiment used a -80°C freezer as a "time machine." Bacterial isolates and water samples were frozen for later use, allowing transplantation of older isolates "forward in time" and newer isolates "backward in time." Surprisingly, local maladaptation predominated over local adaptation in both space and time. Such local maladaptation may indicate that adaptation, or the analogous species sorting process, fails to keep pace with temporal fluctuations in water chemistry. This hypothesis could be tested with more finely resolved temporal data.

  1. Design of a real-time open architecture controller for a reconfigurable machine tool

    CSIR Research Space (South Africa)

    Masekamela, I

    2008-11-01

    Full Text Available The paper presents the design and the development of a real-time, open architecture controller that is used for control of reconfigurable manufacturing tools (RMTs) in reconfigurable manufacturing systems (RMS). The controller that is presented can...

  2. The evolutionary time machine: forecasting how populations can adapt to changing environments using dormant propagules

    Science.gov (United States)

    Orsini, Luisa; Schwenk, Klaus; De Meester, Luc; Colbourne, John K.; Pfrender, Michael E.; Weider, Lawrence J.

    2013-01-01

    Evolutionary changes are determined by a complex assortment of ecological, demographic and adaptive histories. Predicting how evolution will shape the genetic structures of populations coping with current (and future) environmental challenges has principally relied on investigations through space, in lieu of time, because long-term phenotypic and molecular data are scarce. Yet, dormant propagules in sediments, soils and permafrost are convenient natural archives of population-histories from which to trace adaptive trajectories along extended time periods. DNA sequence data obtained from these natural archives, combined with pioneering methods for analyzing both ecological and population genomic time-series data, are likely to provide predictive models to forecast evolutionary responses of natural populations to environmental changes resulting from natural and anthropogenic stressors, including climate change. PMID:23395434

  3. Extension of the Dynasearch to the Two-Machine Permutation Flowshop Scheduling Problem

    Science.gov (United States)

    Tanaka, Shunji

    The purpose of this study is to construct a solution algorithm for the two-machine permutation flowshop problem based on the dynasearch. The dynasearch is an efficient local search algorithm that employs a special neighborhood structure called dynasearch swap neighborhood. Its primary advantage is that the neighborhood of a solution can be explored in polynomial time although it is composed of an exponential number of solutions. The dynasearch for machine scheduling was originally developed for the single-machine total weighted tardiness problem. Then, it was extended to the problem with idle time and setup times. This study further extends the dynasearch to the two-machine permutation flowshop problem and its effectiveness is examined by numerical experiments for both total weighted tardiness and total weighted earliness-tardiness objectives.

  4. The Optimization of Preventive Maintenance Scheduling for Production Machine of Production System in Finite Time Horizon

    Institute of Scientific and Technical Information of China (English)

    韩帮军; 潘军; 范秀敏; 马登哲

    2004-01-01

    The recursion relation of preventive maintenance (PM) cycle is built up concerning the concept of effective age and age setback factor proposed in this paper, which illustrates the dynamic relationship between failure rate and preventive maintenance activity. And the nonlinear optimal PM policy model satisfying the reliability constraints in finite time horizon following Weibull distribution is proposed. The model built in this paper avoids the shortcoming of steady analytical PM model in infinite time horizon and can be used to aid scheduling the maintenance plan and providing decision supporting for job shop scheduling.

  5. The Effect of the Rolling Direction, Temperature, and Etching Time on the Photochemical Machining of Monel 400 Microchannels

    Directory of Open Access Journals (Sweden)

    Deepakkumar H. Patil

    2016-01-01

    Full Text Available The present paper describes the effect of the rolling direction on the quality of microchannels manufactured using photochemical machining (PCM of Monel 400. Experiments were carried out to fabricate microchannels along and across the rolling direction to investigate the effect of the grain orientation on microchannel etching. The input parameters considered were channel width and rolling direction, whereas the depth of etch was the response parameters. Different channels of widths of 60, 100, 150, 200, and 250 μm were etched. The effects of the etching time and temperature of the etchant solution on the undercut and depth of the microchannels were studied. For good quality microchannels, the effects of spinning time, spinning speed, exposure time, and photoresist film strength were also taken into consideration. Optimized values of the above were used for the experimentation. The results show that the depth of etch of the microchannel increases more along the rolling direction than across the rolling direction. The channel width and depth are significantly affected by the etching time and temperature. The proposed study reports an improvement in the quality of microchannels produced using PCM.

  6. Time machine: scientists smash matter, hoping to elicit the earliest stuff

    CERN Multimedia

    Loft, Kurt

    2007-01-01

    "Can we travel back in time, or predict the future? Will we ever know what seeds nature first planted to nurture our world? Such deep thoughts fill the minds of particle physicists who delve into the darkest dimensions of matter, and they've been busy lately." (1 page)

  7. Prediction of Time Series Based on Least Squares Support Vector Machines%新型SVM对时间序列预测研究

    Institute of Scientific and Technical Information of China (English)

    朱家元; 段宝君; 张恒喜

    2003-01-01

    In this paper, we present a new support vector machines-least squares support vector machines (LS-SVMs). While standard SVMs solutions involve solving quadratic or linear programming problems, the least squaresversion of SVMs corresponds to solving a set of linear equations, due to equality instead of inequality constraints inthe problem formulation. In LS-SVMs, Mercer condition is still applicable. Hence several type of kernels such aspolynomial, RBF's and MLP's can be used. Here we use LS-SVMs to time series prediction compared to radial basisfunction neural networks. We consider a noisy (Gaussian and uniform noise)Mackey-Glass time series. The resultsshow that least squares support vector machines is excellent for time series prediction even with high noise.

  8. Data Mining and Machine-Learning in Time-Domain Discovery & Classification

    CERN Document Server

    Bloom, Joshua S

    2011-01-01

    The changing heavens have played a central role in the scientific effort of astronomers for centuries. Galileo's synoptic observations of the moons of Jupiter and the phases of Venus starting in 1610, provided strong refutation of Ptolemaic cosmology. In more modern times, the discovery of a relationship between period and luminosity in some pulsational variable stars led to the inference of the size of the Milky Way, the distance scale to the nearest galaxies, and the expansion of the Universe. Distant explosions of supernovae were used to uncover the existence of dark energy and provide a precise numerical account of dark matter. Indeed, time-domain observations of transient events and variable stars, as a technique, influences a broad diversity of pursuits in the entire astronomy endeavor. While, at a fundamental level, the nature of the scientific pursuit remains unchanged, the advent of astronomy as a data-driven discipline presents fundamental challenges to the way in which the scientific process must n...

  9. Research of Real-time Grabbing Yarn Tube System Based on Machine Vision

    Directory of Open Access Journals (Sweden)

    Cui Shigang

    2015-01-01

    Full Text Available The current yarn tube manipulator just finishes yarn tube grabbing work according to the fixed coordinates. In the actual production process, equipment problems or human factors which make the spindles not on fixed coordinates cause the damage of the manipulator. Real-time grabbing yarn tube system with visual sensing has been designed and a extraction algorithm of spindles coordinates based on a mixed image morphology and Hough transform algorithm has been proposed. Through the combination of the yarn tube image characteristics which are extracted by the algorithm and the visual measurement model which is established by pinhole imaging principle, the mapping relation of yarn tube image coordinates and world coordinates has been gained to get the location information of yarn tube in real time. Results show that the proposed method could make the robot complete the grabbing job precisely and efficiently, under which the system meet the requirement of spinning and dyeing production line.

  10. Desktop setup for binary holograms

    Science.gov (United States)

    Ginter, Olaf; Rothe, Hendrik

    1996-08-01

    Binary gratings as holograms itself or as photographic masking tools for further fabrication steps can fulfill a lot of applications. The commonly used semiconductor technologies for direct writing of high resolution structures are often too expensive. On the other hand computer plots at a reasonable price with photographic reduction do not meet the needs of precision e.g. for interferometric inspection. The lack of cheap and reliable instruments for direct writing in an appropriate resolution is still a problem in fabricating synthetic holograms. Using off-the-shelf components a direct writing plotter for binary patterns can be built at moderate costs. Typical design rules as well as experimental results are given and the final setup is introduced.

  11. Prediction of Solar Flare Size and Time-to-Flare Using Support Vector Machine Regression

    CERN Document Server

    Boucheron, Laura E; McAteer, R T James

    2015-01-01

    We study the prediction of solar flare size and time-to-flare using 38 features describing magnetic complexity of the photospheric magnetic field. This work uses support vector regression to formulate a mapping from the 38-dimensional feature space to a continuous-valued label vector representing flare size or time-to-flare. When we consider flaring regions only, we find an average error in estimating flare size of approximately half a \\emph{geostationary operational environmental satellite} (\\emph{GOES}) class. When we additionally consider non-flaring regions, we find an increased average error of approximately 3/4 a \\emph{GOES} class. We also consider thresholding the regressed flare size for the experiment containing both flaring and non-flaring regions and find a true positive rate of 0.69 and a true negative rate of 0.86 for flare prediction. The results for both of these size regression experiments are consistent across a wide range of predictive time windows, indicating that the magnetic complexity fe...

  12. Real-time 3D data acquisition for augmented-reality man and machine interfacing

    Science.gov (United States)

    Guan, Chun; Hassebrook, Laurence G.; Lau, Daniel L.

    2003-08-01

    Based on recent discoveries, we present a method to project a single structured pattern and then reconstruct the three-dimensional range from the distortions in the reflected and captured image. Traditional structured light methods require several different patterns to recover the depth, without ambiguity and albedo sensitivity, and are corrupted by object movement during the projection/capture process. Our method efficiently combines multiple patterns into a single composite pattern projection -- allowing for real-time implementations. Because structured light techniques require standard image capture and projection technology, unlike time of arrival techniques, they are relatively low cost. Attaining low cost 3D video acquisition would have a profound impact on most applications that are presently limited to 2D video imaging. Furthermore, it would enable many other applications. In particular, we are studying real time depth imagery for tracking hand motion and rotation as an interface to a virtual reality. Applications include remote controlled robotic interfacing in space, advanced cockpit controls and computer interfacing for the disabled.

  13. Design of high-performing hybrid meta-heuristics for unrelated parallel machine scheduling with machine eligibility and precedence constraints

    Science.gov (United States)

    Afzalirad, Mojtaba; Rezaeian, Javad

    2016-04-01

    This study involves an unrelated parallel machine scheduling problem in which sequence-dependent set-up times, different release dates, machine eligibility and precedence constraints are considered to minimize total late works. A new mixed-integer programming model is presented and two efficient hybrid meta-heuristics, genetic algorithm and ant colony optimization, combined with the acceptance strategy of the simulated annealing algorithm (Metropolis acceptance rule), are proposed to solve this problem. Manifestly, the precedence constraints greatly increase the complexity of the scheduling problem to generate feasible solutions, especially in a parallel machine environment. In this research, a new corrective algorithm is proposed to obtain the feasibility in all stages of the algorithms. The performance of the proposed algorithms is evaluated in numerical examples. The results indicate that the suggested hybrid ant colony optimization statistically outperformed the proposed hybrid genetic algorithm in solving large-size test problems.

  14. STEP based Finish Machining CAPP system

    OpenAIRE

    A Arivazhagan; Mehta, NK; Jain, PK

    2012-01-01

    This research paper presents various methodologies developed in a STEP based Computer Aided Process Planning (CAPP) system named "Finish Machining – CAPP" (FM-CAPP). It is developed to generate automatic process plans for finish machining prismatic parts. It is designed in a modular fashion consisting of three main modules, namely (i) Feature Recognition module (FRM) (ii) Machining Planning Module (MPM) and (iii) Setup Planning Module (SPM). The FRM Module analyses the geometrical and topolog...

  15. A genetic Algorithm for the Single Machine Scheduling Problem with Linear Earliness and Quadratic Tardiness Penalties with Consideration of Preemption and Idle Time

    Directory of Open Access Journals (Sweden)

    Mohamad_Bagher Fakhrzad

    2012-06-01

    Full Text Available In this paper, a non linear mathematical model has been proposed for solving a single machine scheduling problem with a linear earliness and quadratic tardiness cost, where machine idle time and preemptions are allowed. As the model is complex and cannot be solved in polynomial time, it has been assumed to be a NP hard problem, so the known optimal solution methods may not be applicable for its solution. A Genetic Algorithm approach has been developed for solving the model and numerical examples has been presented, which imply that the proposed method is efficient and effective.

  16. THE EVALUATION OF EFFICIENCY OF THE USE OF MACHINE WORKING TIME IN THE INDUSTRIAL COMPANY – CASE STUDY

    Directory of Open Access Journals (Sweden)

    Edyta KARDAS

    2017-10-01

    Full Text Available In the paper the evaluation of efficiency of the use of machines in the selected production company was presented. The OEE method (Overall Equipment Effectiveness was used for the analysis. The selected company deals with the produc-tion of tapered roller bearings. The analysis of effectiveness was done for 17 automatic grinding lines working in the department of grinding rollers. Low level of efficiency of machines was affected by problems with the availability of ma-chines and devices. The causes of machine downtime on these lines was also analyzed. Three basic causes of downtime were identified: no kanban card, diamonding, no operator. Ways to improve the use of these machines were suggested. The analysis takes into account the actual results from the production process and covers the period of one calendar year.

  17. The Local Group as a time machine: studying the high-redshift Universe with nearby galaxies

    CERN Document Server

    Boylan-Kolchin, Michael; Johnson, Benjamin D; Bullock, James S; Conroy, Charlie; Fitts, Alex

    2015-01-01

    We infer the UV luminosities of Local Group galaxies at early cosmic times ($z \\sim 2$ and $z \\sim 7$) by combining stellar population synthesis modeling with star formation histories derived from deep color-magnitude diagrams constructed from Hubble Space Telescope (HST) observations. Our analysis provides a basis for understanding high-$z$ galaxies - including those that may be unobservable even with the James Webb Space Telescope (JWST) - in the context of familiar, well-studied objects in the very low-$z$ Universe. We find that, at the epoch of reionization, all Local Group dwarfs were less luminous than the faintest galaxies detectable in deep HST observations of blank fields. We predict that JWST will observe $z \\sim 7$ progenitors of galaxies similar to the Large Magellanic Cloud today; however, the HST Frontier Fields initiative may already be observing such galaxies, highlighting the power of gravitational lensing. Consensus reionization models require an extrapolation of the observed blank-field lum...

  18. Cryogenic setup for trapped ion quantum computing.

    Science.gov (United States)

    Brandl, M F; van Mourik, M W; Postler, L; Nolf, A; Lakhmanskiy, K; Paiva, R R; Möller, S; Daniilidis, N; Häffner, H; Kaushal, V; Ruster, T; Warschburger, C; Kaufmann, H; Poschinger, U G; Schmidt-Kaler, F; Schindler, P; Monz, T; Blatt, R

    2016-11-01

    We report on the design of a cryogenic setup for trapped ion quantum computing containing a segmented surface electrode trap. The heat shield of our cryostat is designed to attenuate alternating magnetic field noise, resulting in 120 dB reduction of 50 Hz noise along the magnetic field axis. We combine this efficient magnetic shielding with high optical access required for single ion addressing as well as for efficient state detection by placing two lenses each with numerical aperture 0.23 inside the inner heat shield. The cryostat design incorporates vibration isolation to avoid decoherence of optical qubits due to the motion of the cryostat. We measure vibrations of the cryostat of less than ±20 nm over 2 s. In addition to the cryogenic apparatus, we describe the setup required for an operation with (40)Ca(+) and (88)Sr(+) ions. The instability of the laser manipulating the optical qubits in (40)Ca(+) is characterized by yielding a minimum of its Allan deviation of 2.4 ⋅ 10(-15) at 0.33 s. To evaluate the performance of the apparatus, we trapped (40)Ca(+) ions, obtaining a heating rate of 2.14(16) phonons/s and a Gaussian decay of the Ramsey contrast with a 1/e-time of 18.2(8) ms.

  19. Cryogenic setup for trapped ion quantum computing

    Science.gov (United States)

    Brandl, M. F.; van Mourik, M. W.; Postler, L.; Nolf, A.; Lakhmanskiy, K.; Paiva, R. R.; Möller, S.; Daniilidis, N.; Häffner, H.; Kaushal, V.; Ruster, T.; Warschburger, C.; Kaufmann, H.; Poschinger, U. G.; Schmidt-Kaler, F.; Schindler, P.; Monz, T.; Blatt, R.

    2016-11-01

    We report on the design of a cryogenic setup for trapped ion quantum computing containing a segmented surface electrode trap. The heat shield of our cryostat is designed to attenuate alternating magnetic field noise, resulting in 120 dB reduction of 50 Hz noise along the magnetic field axis. We combine this efficient magnetic shielding with high optical access required for single ion addressing as well as for efficient state detection by placing two lenses each with numerical aperture 0.23 inside the inner heat shield. The cryostat design incorporates vibration isolation to avoid decoherence of optical qubits due to the motion of the cryostat. We measure vibrations of the cryostat of less than ±20 nm over 2 s. In addition to the cryogenic apparatus, we describe the setup required for an operation with 40Ca+ and 88Sr+ ions. The instability of the laser manipulating the optical qubits in 40Ca+ is characterized by yielding a minimum of its Allan deviation of 2.4 ṡ 10-15 at 0.33 s. To evaluate the performance of the apparatus, we trapped 40Ca+ ions, obtaining a heating rate of 2.14(16) phonons/s and a Gaussian decay of the Ramsey contrast with a 1/e-time of 18.2(8) ms.

  20. Improving the vector auto regression technique for time-series link prediction by using support vector machine

    Directory of Open Access Journals (Sweden)

    Co Jan Miles

    2016-01-01

    Full Text Available Predicting links between the nodes of a graph has become an important Data Mining task because of its direct applications to biology, social networking, communication surveillance, and other domains. Recent literature in time-series link prediction has shown that the Vector Auto Regression (VAR technique is one of the most accurate for this problem. In this study, we apply Support Vector Machine (SVM to improve the VAR technique that uses an unweighted adjacency matrix along with 5 matrices: Common Neighbor (CN, Adamic-Adar (AA, Jaccard’s Coefficient (JC, Preferential Attachment (PA, and Research Allocation Index (RA. A DBLP dataset covering the years from 2003 until 2013 was collected and transformed into time-sliced graph representations. The appropriate matrices were computed from these graphs, mapped to the feature space, and then used to build baseline VAR models with lag of 2 and some corresponding SVM classifiers. Using the Area Under the Receiver Operating Characteristic Curve (AUC-ROC as the main fitness metric, the average result of 82.04% for the VAR was improved to 84.78% with SVM. Additional experiments to handle the highly imbalanced dataset by oversampling with SMOTE and undersampling with K-means clusters, however, did not improve the average AUC-ROC of the baseline SVM.

  1. A noninvasive technique for real-time detection of bruises in apple surface based on machine vision

    Science.gov (United States)

    Zhao, Juan; Peng, Yankun; Dhakal, Sagar; Zhang, Leilei; Sasao, Akira

    2013-05-01

    Apple is one of the highly consumed fruit item in daily life. However, due to its high damage potential and massive influence on taste and export, the quality of apple has to be detected before it reaches the consumer's hand. This study was aimed to develop a hardware and software unit for real-time detection of apple bruises based on machine vision technology. The hardware unit consisted of a light shield installed two monochrome cameras at different angles, LED light source to illuminate the sample, and sensors at the entrance of box to signal the positioning of sample. Graphical Users Interface (GUI) was developed in VS2010 platform to control the overall hardware and display the image processing result. The hardware-software system was developed to acquire the images of 3 samples from each camera and display the image processing result in real time basis. An image processing algorithm was developed in Opencv and C++ platform. The software is able to control the hardware system to classify the apple into two grades based on presence/absence of surface bruises with the size of 5mm. The experimental result is promising and the system with further modification can be applicable for industrial production in near future.

  2. Using machine learning and real-time workload assessment in a high-fidelity UAV simulation environment

    Science.gov (United States)

    Monfort, Samuel S.; Sibley, Ciara M.; Coyne, Joseph T.

    2016-05-01

    Future unmanned vehicle operations will see more responsibilities distributed among fewer pilots. Current systems typically involve a small team of operators maintaining control over a single aerial platform, but this arrangement results in a suboptimal configuration of operator resources to system demands. Rather than devoting the full-time attention of several operators to a single UAV, the goal should be to distribute the attention of several operators across several UAVs as needed. Under a distributed-responsibility system, operator task load would be continuously monitored, with new tasks assigned based on system needs and operator capabilities. The current paper sought to identify a set of metrics that could be used to assess workload unobtrusively and in near real-time to inform a dynamic tasking algorithm. To this end, we put 20 participants through a variable-difficulty multiple UAV management simulation. We identified a subset of candidate metrics from a larger pool of pupillary and behavioral measures. We then used these metrics as features in a machine learning algorithm to predict workload condition every 60 seconds. This procedure produced an overall classification accuracy of 78%. An automated tasker sensitive to fluctuations in operator workload could be used to efficiently delegate tasks for teams of UAV operators.

  3. A new approach for solving capacitated lot sizing and scheduling problem with sequence and period-dependent setup costs

    Directory of Open Access Journals (Sweden)

    Imen Chaieb Memmi

    2013-09-01

    Full Text Available Purpose: We aim to examine the capacitated multi-item lot sizing problem which is a typical example of a large bucket model, where many different items can be produced on the same machine in one time period. We propose a new approach to determine the production sequence and lot sizes that minimize the sum of start up and setup costs, inventory and production costs over all periods.Design/methodology/approach: The approach is composed of three steps. First, we compute a lower bound on total cost. Then we propose a three sub-steps iteration procedure. We solve optimally the lot sizing problem without considering products sequencing and their cost. Then, we determine products quantities to produce each period while minimizing the storage and variable production costs. Given the products to manufacture each period, we determine its correspondent optimal products sequencing, by using a Branch and Bound algorithm. Given the sequences of products within each period, we evaluate the total start up and setup cost. We compare then the total cost obtained to the lower bound of the total cost. If this value riches a prefixed value, we stop. Otherwise, we modify the results of lot sizing problem.Findings and Originality/value: We show using an illustrative example, that the difference between the total cost and its lower bound is only 10%. This gap depends on the significance of the inventory and production costs and the machine’s capacity. Comparing the approach we develop with a traditional one, we show that we manage to reduce the total cost by 30%.Research limitations/implications: Our model fits better to real-world situations where production systems run continuously. This model is applied for limited number of part types and periods.Practical implications: Our approach determines the products to manufacture each time period, their economic amounts, and their scheduling within each period. This outcome should help decision makers bearing expensive

  4. A hybrid algorithm for unrelated parallel machines scheduling

    Directory of Open Access Journals (Sweden)

    Mohsen Shafiei Nikabadi

    2016-09-01

    Full Text Available In this paper, a new hybrid algorithm based on multi-objective genetic algorithm (MOGA using simulated annealing (SA is proposed for scheduling unrelated parallel machines with sequence-dependent setup times, varying due dates, ready times and precedence relations among jobs. Our objective is to minimize makespan (Maximum completion time of all machines, number of tardy jobs, total tardiness and total earliness at the same time which can be more advantageous in real environment than considering each of objectives separately. For obtaining an optimal solution, hybrid algorithm based on MOGA and SA has been proposed in order to gain both good global and local search abilities. Simulation results and four well-known multi-objective performance metrics, indicate that the proposed hybrid algorithm outperforms the genetic algorithm (GA and SA in terms of each objective and significantly in minimizing the total cost of the weighted function.

  5. Hierarchical planning for a surface mounting machine placement

    Institute of Scientific and Technical Information of China (English)

    曾又姣; 马登哲; 金烨; 严隽琪

    2004-01-01

    For a surface mounting machine (SMM) in printed circuit board (PCB) assembly line, there are four problems, e.g. CAD data conversion, nozzle selection, feeder assignment and placement sequence determination. A hierarchical planning for them to maximize the throughput rate of an SMM is presented here. To minimize set-up time, a CAD data conversion system was first applied that could automatically generate the data for machine placement from CAD design data files. Then an effective nozzle selection approach was implemented to minimize the time of nozzle changing. And then, to minimize picking time, an algorithm for feeder assignment was used to make picking multiple components simultaneously as much as possible. Finally, in order to shorten pick-and-place time, a heuristic algorithm was used to determine optimal component placement sequence according to the decided feeder positions. Experiments were conducted on a four head SMM. The experimental results were used to analyse the assembly line performance.

  6. Uma propriedade estrutural do problema de programação da produção flow shop permutacional com tempos de setup

    Directory of Open Access Journals (Sweden)

    João Vitor Moccellin

    2007-01-01

    Full Text Available Neste artigo apresenta-se uma propriedade estrutural do problema de programação da produção flow shop permutacional com tempos de setup das máquinas separados dos tempos de processamento das tarefas, a qual foi identificada a partir de investigações que foram realizadas sobre as características do problema. Tal propriedade fornece um limitante superior do tempo de máquina parada entre a sua preparação e o início de execução das tarefas. Utilizando a propriedade, o problema original de programação da produção com minimização do makespan pode ser resolvido de maneira heurística por meio de uma analogia com o problema assimétrico do caixeiro-viajante.This paper deals with the permutation flow shop scheduling problem with separated machine setup times. As a result of an investigation on the problem characteristics a structural property is introduced. Such a property provides an upper bound on the idle time of the machines between the setup task and the job processing. As an application of this property, the original scheduling problem with the makespan criterion can be heuristically solved by an analogy with the asymmetric traveling salesman problem.

  7. Design and operation of a setup with a camera and adjustable mirror to inspect the sense-wire planes of the Time Projection Chamber inside the MicroBooNE cryostat

    CERN Document Server

    Carls, Benjamin; James, Catherine C; Kubinski, Robert M; Pordes, Stephen; Schukraft, Anne; Strauss, Thomas

    2015-01-01

    Detectors in particle physics, particularly when including cryogenic components, are often enclosed in vessels that do not provide any physical or visual access to the detectors themselves after installation. However, it can be desirable for experiments to visually investigate the inside of the vessel. The MicroBooNE cryostat hosts a TPC with sense-wire planes, which had to be inspected for damage such as breakage or sagging. This paper describes an approach to view the inside of the MicroBooNE cryostat with a setup of a camera and a mirror through one of its cryogenic service nozzles. The paper describes the camera and mirror chosen for the operation, the illumination, and the mechanical structure of the setup. It explains how the system was operated and demonstrates its performance.

  8. A real-time brain-machine interface combining motor target and trajectory intent using an optimal feedback control design.

    Science.gov (United States)

    Shanechi, Maryam M; Williams, Ziv M; Wornell, Gregory W; Hu, Rollin C; Powers, Marissa; Brown, Emery N

    2013-01-01

    Real-time brain-machine interfaces (BMI) have focused on either estimating the continuous movement trajectory or target intent. However, natural movement often incorporates both. Additionally, BMIs can be modeled as a feedback control system in which the subject modulates the neural activity to move the prosthetic device towards a desired target while receiving real-time sensory feedback of the state of the movement. We develop a novel real-time BMI using an optimal feedback control design that jointly estimates the movement target and trajectory of monkeys in two stages. First, the target is decoded from neural spiking activity before movement initiation. Second, the trajectory is decoded by combining the decoded target with the peri-movement spiking activity using an optimal feedback control design. This design exploits a recursive Bayesian decoder that uses an optimal feedback control model of the sensorimotor system to take into account the intended target location and the sensory feedback in its trajectory estimation from spiking activity. The real-time BMI processes the spiking activity directly using point process modeling. We implement the BMI in experiments consisting of an instructed-delay center-out task in which monkeys are presented with a target location on the screen during a delay period and then have to move a cursor to it without touching the incorrect targets. We show that the two-stage BMI performs more accurately than either stage alone. Correct target prediction can compensate for inaccurate trajectory estimation and vice versa. The optimal feedback control design also results in trajectories that are smoother and have lower estimation error. The two-stage decoder also performs better than linear regression approaches in offline cross-validation analyses. Our results demonstrate the advantage of a BMI design that jointly estimates the target and trajectory of movement and more closely mimics the sensorimotor control system.

  9. A real-time brain-machine interface combining motor target and trajectory intent using an optimal feedback control design.

    Directory of Open Access Journals (Sweden)

    Maryam M Shanechi

    Full Text Available Real-time brain-machine interfaces (BMI have focused on either estimating the continuous movement trajectory or target intent. However, natural movement often incorporates both. Additionally, BMIs can be modeled as a feedback control system in which the subject modulates the neural activity to move the prosthetic device towards a desired target while receiving real-time sensory feedback of the state of the movement. We develop a novel real-time BMI using an optimal feedback control design that jointly estimates the movement target and trajectory of monkeys in two stages. First, the target is decoded from neural spiking activity before movement initiation. Second, the trajectory is decoded by combining the decoded target with the peri-movement spiking activity using an optimal feedback control design. This design exploits a recursive Bayesian decoder that uses an optimal feedback control model of the sensorimotor system to take into account the intended target location and the sensory feedback in its trajectory estimation from spiking activity. The real-time BMI processes the spiking activity directly using point process modeling. We implement the BMI in experiments consisting of an instructed-delay center-out task in which monkeys are presented with a target location on the screen during a delay period and then have to move a cursor to it without touching the incorrect targets. We show that the two-stage BMI performs more accurately than either stage alone. Correct target prediction can compensate for inaccurate trajectory estimation and vice versa. The optimal feedback control design also results in trajectories that are smoother and have lower estimation error. The two-stage decoder also performs better than linear regression approaches in offline cross-validation analyses. Our results demonstrate the advantage of a BMI design that jointly estimates the target and trajectory of movement and more closely mimics the sensorimotor control system.

  10. Optimization of line configuration and balancing for flexible machining lines

    Science.gov (United States)

    Liu, Xuemei; Li, Aiping; Chen, Zurui

    2016-05-01

    Line configuration and balancing is to select the type of line and allot a given set of operations as well as machines to a sequence of workstations to realize high-efficiency production. Most of the current researches for machining line configuration and balancing problems are related to dedicated transfer lines with dedicated machine workstations. With growing trends towards great product variety and fluctuations in market demand, dedicated transfer lines are being replaced with flexible machining line composed of identical CNC machines. This paper deals with the line configuration and balancing problem for flexible machining lines. The objective is to assign operations to workstations and find the sequence of execution, specify the number of machines in each workstation while minimizing the line cycle time and total number of machines. This problem is subject to precedence, clustering, accessibility and capacity constraints among the features, operations, setups and workstations. The mathematical model and heuristic algorithm based on feature group strategy and polychromatic sets theory are presented to find an optimal solution. The feature group strategy and polychromatic sets theory are used to establish constraint model. A heuristic operations sequencing and assignment algorithm is given. An industrial case study is carried out, and multiple optimal solutions in different line configurations are obtained. The case studying results show that the solutions with shorter cycle time and higher line balancing rate demonstrate the feasibility and effectiveness of the proposed algorithm. This research proposes a heuristic line configuration and balancing algorithm based on feature group strategy and polychromatic sets theory which is able to provide better solutions while achieving an improvement in computing time.

  11. Preparation and evaluation of orthodontic setup

    OpenAIRE

    Telma Martins de Araújo; Lílian Martins Fonseca; Luciana Duarte Caldas; Roberto Amarante Costa-Pinto

    2012-01-01

    INTRODUCTION: An orthodontic or diagnostic setup consists in cutting and realigning the teeth in plaster models, making it an important resource in orthodontic treatment planning. OBJECTIVE: The aim of this article is to provide a detailed description of a technique to build an orthodontic setup model and a method to evaluate it. CONCLUSIONS: Although laborious, orthodontic setup procedure and analysis can provide important information such as the need for dental extractions, interproximal st...

  12. Preparation and evaluation of orthodontic setup

    Directory of Open Access Journals (Sweden)

    Telma Martins de Araújo

    2012-06-01

    Full Text Available INTRODUCTION: An orthodontic or diagnostic setup consists in cutting and realigning the teeth in plaster models, making it an important resource in orthodontic treatment planning. OBJECTIVE: The aim of this article is to provide a detailed description of a technique to build an orthodontic setup model and a method to evaluate it. CONCLUSIONS: Although laborious, orthodontic setup procedure and analysis can provide important information such as the need for dental extractions, interproximal stripping, anchorage system, among others.

  13. Preparation and evaluation of orthodontic setup

    OpenAIRE

    Araújo, Telma Martins de; Fonseca, Lílian Martins; Caldas, Luciana Duarte; Pinto, Roberto Amarante Costa

    2012-01-01

    p. 146-165 Introduction: An orthodontic or diagnostic setup consists in cutting and realigning the teeth in plaster models, making it an important resource in orthodontic treatment planning. Objetive: The aim of this article is to provide a detailed description of a technique to build an orthodontic setup model and a method to evaluate it. Conclusions: Although laborious, orthodontic setup procedure and analysis can provide important information such as the need for dental extractions, ...

  14. Technological Superiority and Application of Real-Time Control Die Casting Machine%实时控制压铸机的技术优势及应用*

    Institute of Scientific and Technical Information of China (English)

    张新华; 孔晓武

    2013-01-01

    This article introduces the development of die casting machine controlling theory, concept and feature of die casting machine embedded real time operating system,with drawing conclusions that contain electro-hydraulic schematic diagram for die casting machine injection system, configuration scheme of embedded real time controlling, analysis of real time control curve and comparison with traditional controlling technique. The real time control die casting machine which referred in this article has been to the stage of application,and won quite considerable market share and high praise.%介绍了压铸机控制理论的发展和压铸机嵌入式实时控制技术的概念及其特点优势,给出了压铸机压射系统的电液原理图,嵌入式实时控制的配置方案,实时控制曲线的分析及与传统控制技术的对比。介绍的实时控制压铸机已经进入应用环节,并取得了较大的市场份额和较好的评价。

  15. Optimal space-time precoding of artificial sensory feedback through mutichannel microstimulation in bi-directional brain-machine interfaces

    Science.gov (United States)

    Daly, John; Liu, Jianbo; Aghagolzadeh, Mehdi; Oweiss, Karim

    2012-12-01

    Brain-machine interfaces (BMIs) aim to restore lost sensorimotor and cognitive function in subjects with severe neurological deficits. In particular, lost somatosensory function may be restored by artificially evoking patterns of neural activity through microstimulation to induce perception of tactile and proprioceptive feedback to the brain about the state of the limb. Despite an early proof of concept that subjects could learn to discriminate a limited vocabulary of intracortical microstimulation (ICMS) patterns that instruct the subject about the state of the limb, the dynamics of a moving limb are unlikely to be perceived by an arbitrarily-selected, discrete set of static microstimulation patterns, raising questions about the generalization and the scalability of this approach. In this work, we propose a microstimulation protocol intended to activate optimally the ascending somatosensory pathway. The optimization is achieved through a space-time precoder that maximizes the mutual information between the sensory feedback indicating the limb state and the cortical neural response evoked by thalamic microstimulation. Using a simplified multi-input multi-output model of the thalamocortical pathway, we show that this optimal precoder can deliver information more efficiently in the presence of noise compared to suboptimal precoders that do not account for the afferent pathway structure and/or cortical states. These results are expected to enhance the way microstimulation is used to induce somatosensory perception during sensorimotor control of artificial devices or paralyzed limbs.

  16. QSO Selection Algorithm Using Time Variability and Machine Learning: Selection of 1,620 QSO Candidates from MACHO LMC Database

    CERN Document Server

    Kim, Dae-Won; Byun, Yong-Ik; Alcock, Charles; Khardon, Roni

    2011-01-01

    We present a new QSO selection algorithm using a Support Vector Machine (SVM), a supervised classification method, on a set of extracted times series features including period, amplitude, color, and autocorrelation value. We train a model that separates QSOs from variable stars, non-variable stars and microlensing events using 58 known QSOs, 1,629 variable stars and 4,288 non-variables using the MAssive Compact Halo Object (MACHO) database as a training set. To estimate the efficiency and the accuracy of the model, we perform a cross-validation test using the training set. The test shows that the model correctly identifies ~80% of known QSOs with a 25% false positive rate. The majority of the false positives are Be stars. We applied the trained model to the MACHO Large Magellanic Cloud (LMC) dataset, which consists of 40 million lightcurves, and found 1,620 QSO candidates. During the selection none of the 33,242 known MACHO variables were misclassified as QSO candidates. In order to estimate the true false po...

  17. Space, time and machines

    CERN Document Server

    Annila, Arto

    2009-01-01

    The 2nd law of thermodynamics sheds light on present-day puzzles in cosmology. The universal law, as an equation of motion, describes diverse systems consuming free energy via various mechanisms to attain stationary states in their respective surroundings. Increasing rate of expansion of the Universe, galactic rotation and lensing as well as clustering of red-shifted spectral lines are found as natural consequences of the maximal energy dispersal that satisfies the conservation of energy, in the forms of kinetic, potential and dissipation. The Universe in its entirety is pictured as a giant Riemannian resonator in evolution via step-by-step spontaneous breaking of one stationary-state symmetry to another to diminish the energy density difference relative to its zero-density surroundings. The continuum equation of evolution is proven equivalent to the Navier-Stokes equation. The ubiquitous flow equation has no solution because the forces and flows are inseparable when the dissipative process has three or more ...

  18. The ALICE time machine

    Directory of Open Access Journals (Sweden)

    Ferretti Alessandro

    2013-09-01

    Full Text Available According to the Big Bang theory, the Universe was once in an extremely hot and dense state which expanded rapidly. In such a state the normal nuclear matter could not exist: it is believed that a few microsecond after big-bang the matter underwent a phase transition, from a state called Quark-Gluon Plasma (QGP to a hadron gas. Some of the unexplained features of the Universe could be explained by the QGP properties. One of the aims of the CERN LHC is to recreate (on a smaller scale a QGP state, compressing and heating ordinary nuclear matter by means of ultrarelativistic heavy-ion collisions. The ALICE experiment at CERN is dedicated to the study of the medium produced in these collisions : in particular, the study of the heavy quarkonia suppression pattern can give a measure of the temperature reached in these collisions, helping us to understand how close we are getting to the conditions of the starting point of the Universe.

  19. Brain Machine Interface: Analysis of segmented EEG Signal Classification Using Short-Time PCA and Recurrent Neural Networks

    OpenAIRE

    C. R. Hema; Paulraj, M.P.; Nagarajan, R.; Sazali Yaacob; Abdul Hamid Adom

    2008-01-01

    Brain machine interface provides a communication channel between the human brain and an external device. Brain interfaces are studied to provide rehabilitation to patients with neurodegenerative diseases; such patients loose all communication pathways except for their sensory and cognitive functions. One of the possible rehabilitation methods for these patients is to provide a brain machine interface (BMI) for communication; the BMI uses the electrical activity of the brain detected by scalp ...

  20. Development of group setup strategies for makespan minimization in PCB assembly

    DEFF Research Database (Denmark)

    Yilmaz, I.O.; Grunow, M.; Günther, H.-O.;

    2007-01-01

    of the component magazine into account. We demonstrate the effectiveness of our approach in an extensive numerical investigation of a single-gantry collect-and-place machine equipped with a rotary placement head and an interchangeable feeder trolley. Compared to conventional methodologies, the proposed group setup...

  1. Measurement of electromagnetic tracking error in a navigated breast surgery setup

    Science.gov (United States)

    Harish, Vinyas; Baksh, Aidan; Ungi, Tamas; Lasso, Andras; Baum, Zachary; Gauvin, Gabrielle; Engel, Jay; Rudan, John; Fichtinger, Gabor

    2016-03-01

    PURPOSE: The measurement of tracking error is crucial to ensure the safety and feasibility of electromagnetically tracked, image-guided procedures. Measurement should occur in a clinical environment because electromagnetic field distortion depends on positioning relative to the field generator and metal objects. However, we could not find an accessible and open-source system for calibration, error measurement, and visualization. We developed such a system and tested it in a navigated breast surgery setup. METHODS: A pointer tool was designed for concurrent electromagnetic and optical tracking. Software modules were developed for automatic calibration of the measurement system, real-time error visualization, and analysis. The system was taken to an operating room to test for field distortion in a navigated breast surgery setup. Positional and rotational electromagnetic tracking errors were then calculated using optical tracking as a ground truth. RESULTS: Our system is quick to set up and can be rapidly deployed. The process from calibration to visualization also only takes a few minutes. Field distortion was measured in the presence of various surgical equipment. Positional and rotational error in a clean field was approximately 0.90 mm and 0.31°. The presence of a surgical table, an electrosurgical cautery, and anesthesia machine increased the error by up to a few tenths of a millimeter and tenth of a degree. CONCLUSION: In a navigated breast surgery setup, measurement and visualization of tracking error defines a safe working area in the presence of surgical equipment. Our system is available as an extension for the open-source 3D Slicer platform.

  2. Rapid assessment of tsunami impact from real-time seismology and geographic, historical other datasets using machine learning

    Science.gov (United States)

    Michelini, Alberto; Lomax, Anthony

    2017-04-01

    The impact of an earthquake, tsunami, volcanic eruption, severe weather or other natural disaster is related to: the intensity of the hazard; the vulnerability or exposure of the population, such as housing quality, infrastructure and proximity to a coastlines; and the capacity to resist and cope with the disaster. Rapid assessment by monitoring agencies of the impact of a natural event is fundamental for early warning and response. We previously* proposed the "tsunami importance" parameter, It, for characterizing the strength of a tsunami. This parameter combines 5 descriptive indices from the NOAA/WDC Historical Tsunami Database: 4 tsunami impact measures (deaths, injuries, damage, houses destroyed), and maximum water height. Accordingly, It = 2 corresponds approximately to the JMA threshold for issuing a ''Tsunami Warning'' whereas the largest or most devastating tsunamis typically have It = 10. Here we discuss extending this simple, 5-component parameter with additional impact-related measures from relevant databases (e.g., LandScan population density, major infrastructures) and historical / archaeological information, and measures that might be obtained in near-real-time (e.g., emergency services, news, social media). We combine these measures with seismological and other real-time observations as an ensemble of features within automated procedures to estimate impact and guide decision making. We examine using modern machine learning methodologies to train and calibrate the procedures, while working with high-dimensional feature space. * Lomax, A. and A. Michelini (2011), Tsunami early warning using earthquake rupture duration and P-wave dominant period: the importance of length and depth of faulting, Geophys. J. Int., 185, 283-291, doi: 10.1111/j.1365-246X.2010.04916.x

  3. SU-E-T-373: A Motorized Stage for Fast and Accurate QA of Machine Isocenter

    Energy Technology Data Exchange (ETDEWEB)

    Moore, J; Velarde, E; Wong, J [Johns Hopkins University, Baltimore, MD (United States)

    2014-06-01

    Purpose: Precision delivery of radiation dose relies on accurate knowledge of the machine isocenter under a variety of machine motions. This is typically determined by performing a Winston-Lutz test consisting of imaging a known object at multiple gantry/collimator/table angles and ensuring that the maximum offset is within specified tolerance. The first step in the Winston-Lutz test is careful placement of a ball bearing at the machine isocenter as determined by repeated imaging and shifting until accurate placement has been determined. Conventionally this is performed by adjusting a stage manually using vernier scales which carry the limitation that each adjustment must be done inside the treatment room with the risks of inaccurate adjustment of the scale and physical bumping of the table. It is proposed to use a motorized system controlled outside of the room to improve the required time and accuracy of these tests. Methods: The three dimensional vernier scales are replaced by three motors with accuracy of 1 micron and a range of 25.4mm connected via USB to a computer in the control room. Software is designed which automatically detects the motors and assigns them to proper axes and allows for small shifts to be entered and performed. Input values match calculated offsets in magnitude and sign to reduce conversion errors. Speed of setup, number of iterations to setup, and accuracy of final placement are assessed. Results: Automatic BB placement required 2.25 iterations and 13 minutes on average while manual placement required 3.76 iterations and 37.5 minutes. The average final XYZ offsets is 0.02cm, 0.01cm, 0.04cm for automatic setup and 0.04cm, 0.02cm, 0.04cm for manual setup. Conclusion: Automatic placement decreased time and repeat iterations for setup while improving placement accuracy. Automatic placement greatly reduces the time required to perform QA.

  4. New Measuring Temperature Setup with Optical Probe①

    Institute of Scientific and Technical Information of China (English)

    HOUPeiguo; LIUJianming

    1997-01-01

    A new setup of measuring temperature is developed,which the probe is a micro-power consumptive one with CMOS circuit and is driven by optical power.For transmitting the measured signal and optical signal in a long distance,the fiber technology is applied in this setup.

  5. A setup for active fault diagnosis

    DEFF Research Database (Denmark)

    Niemann, Hans Henrik

    2006-01-01

    A setup for active fault diagnosis (AFD) of parametric faults in dynamic systems is formulated in this paper. It is shown that it is possible to use the same setup for both open loop systems, closed loop systems based on a nominal feedback controller as well as for closed loop systems based...

  6. Virtual setup: application in orthodontic practice

    NARCIS (Netherlands)

    Camardella, L.T.; Rothier, E.K.; Vilella, O.V.; Ongkosuwito, E.M.; Breuning, K.H.

    2016-01-01

    BACKGROUND: A plaster dental model is a patient's traditional three-dimensional (3D) record. If the dental crowns from a plaster model are separated and positioned in wax, this setup of the crowns can be used to simulate orthodontic treatment. The traditional way to make this dental setup requires s

  7. The Application of Time Grating Sensor for Modifying Milling Machines%时栅传感器在铣床数控改造中的应用

    Institute of Scientific and Technical Information of China (English)

    万文略; 胡德全; 崔冰波; 谢伟辉

    2011-01-01

    In order to improve the numerical performance of milling machine, a time grating sensor and an ARM microprocessor constitute a closed-loop control system, where the time grating is adopted as a position feedback detector, and an ARM microprocessor is adopted to control movement axis of milling machine. A circular time grating sensor embedded in rotary table is responsible for angular displacement measurement. The principles of machining along straight line, circle and ellipse are presented in this paper. In addition, machining errors are analyzed in detail. Experiment results prove that the machining accuracy and efficiency of the revised milling machine are improved, as well as the machining flexibility. Therefore, the novel time grating sensors provide a effect solution with high accuracy and low cost to technological innovation of enterprises and NC system production.%为了实现对普通铣床的数控化改造,采用时栅传感器作为位置反馈传感器,通过以ARM为微处理器的嵌入式系统实现对铣床的运动轴进行闭环控制.并为铣床的工作台增加了一个内部安装有圆时栅的数控转台.论文介绍了改造过程以及利用数控转台加工直线、圆弧和椭圆的方法,并对其加工误差进行了分析.实践证明,改造后的铣床数控系统不仅提高了加工精度和效率,而且还提高了加工的灵活性.新型的时栅传感器为企业技术改造和数控加工系统的生产提供了一种高精度、低成本的解决途径.

  8. Multivariate analysis of fMRI time series: classification and regression of brain responses using machine learning.

    Science.gov (United States)

    Formisano, Elia; De Martino, Federico; Valente, Giancarlo

    2008-09-01

    Machine learning and pattern recognition techniques are being increasingly employed in functional magnetic resonance imaging (fMRI) data analysis. By taking into account the full spatial pattern of brain activity measured simultaneously at many locations, these methods allow detecting subtle, non-strictly localized effects that may remain invisible to the conventional analysis with univariate statistical methods. In typical fMRI applications, pattern recognition algorithms "learn" a functional relationship between brain response patterns and a perceptual, cognitive or behavioral state of a subject expressed in terms of a label, which may assume discrete (classification) or continuous (regression) values. This learned functional relationship is then used to predict the unseen labels from a new data set ("brain reading"). In this article, we describe the mathematical foundations of machine learning applications in fMRI. We focus on two methods, support vector machines and relevance vector machines, which are respectively suited for the classification and regression of fMRI patterns. Furthermore, by means of several examples and applications, we illustrate and discuss the methodological challenges of using machine learning algorithms in the context of fMRI data analysis.

  9. Human-machine analytics for closed-loop sense-making in time-dominant cyber defense problems

    Science.gov (United States)

    Henry, Matthew H.

    2017-05-01

    Many defense problems are time-dominant: attacks progress at speeds that outpace human-centric systems designed for monitoring and response. Despite this shortcoming, these well-honed and ostensibly reliable systems pervade most domains, including cyberspace. The argument that often prevails when considering the automation of defense is that while technological systems are suitable for simple, well-defined tasks, only humans possess sufficiently nuanced understanding of problems to act appropriately under complicated circumstances. While this perspective is founded in verifiable truths, it does not account for a middle ground in which human-managed technological capabilities extend well into the territory of complex reasoning, thereby automating more nuanced sense-making and dramatically increasing the speed at which it can be applied. Snort1 and platforms like it enable humans to build, refine, and deploy sense-making tools for network defense. Shortcomings of these platforms include a reliance on rule-based logic, which confounds analyst knowledge of how bad actors behave with the means by which bad behaviors can be detected, and a lack of feedback-informed automation of sensor deployment. We propose an approach in which human-specified computational models hypothesize bad behaviors independent of indicators and then allocate sensors to estimate and forecast the state of an intrusion. State estimates and forecasts inform the proactive deployment of additional sensors and detection logic, thereby closing the sense-making loop. All the while, humans are on the loop, rather than in it, permitting nuanced management of fast-acting automated measurement, detection, and inference engines. This paper motivates and conceptualizes analytics to facilitate this human-machine partnership.

  10. Simulated annealing and metaheuristic for randomized priority search algorithms for the aerial refuelling parallel machine scheduling problem with due date-to-deadline windows and release times

    Science.gov (United States)

    Kaplan, Sezgin; Rabadi, Ghaith

    2013-01-01

    This article addresses the aerial refuelling scheduling problem (ARSP), where a set of fighter jets (jobs) with certain ready times must be refuelled from tankers (machines) by their due dates; otherwise, they reach a low fuel level (deadline) incurring a high cost. ARSP is an identical parallel machine scheduling problem with release times and due date-to-deadline windows to minimize the total weighted tardiness. A simulated annealing (SA) and metaheuristic for randomized priority search (Meta-RaPS) with the newly introduced composite dispatching rule, apparent piecewise tardiness cost with ready times (APTCR), are applied to the problem. Computational experiments compared the algorithms' solutions to optimal solutions for small problems and to each other for larger problems. To obtain optimal solutions, a mixed integer program with a piecewise weighted tardiness objective function was solved for up to 12 jobs. The results show that Meta-RaPS performs better in terms of average relative error but SA is more efficient.

  11. Sustainable machining

    CERN Document Server

    2017-01-01

    This book provides an overview on current sustainable machining. Its chapters cover the concept in economic, social and environmental dimensions. It provides the reader with proper ways to handle several pollutants produced during the machining process. The book is useful on both undergraduate and postgraduate levels and it is of interest to all those working with manufacturing and machining technology.

  12. Statistical analysis of simulation-generated time series : Systolic vs. semi-systolic correlation on the Connection Machine

    NARCIS (Netherlands)

    Dontje, T.; Lippert, Th.; Petkov, N.; Schilling, K.

    1992-01-01

    Autocorrelation becomes an increasingly important tool to verify improvements in the state of the simulational art in Latice Gauge Theory. Semi-systolic and full-systolic algorithms are presented which are intensively used for correlation computations on the Connection Machine CM-2. The semi-systoli

  13. Statistical analysis of simulation-generated time series : Systolic vs. semi-systolic correlation on the Connection Machine

    NARCIS (Netherlands)

    Dontje, T.; Lippert, Th.; Petkov, N.; Schilling, K.

    1992-01-01

    Autocorrelation becomes an increasingly important tool to verify improvements in the state of the simulational art in Latice Gauge Theory. Semi-systolic and full-systolic algorithms are presented which are intensively used for correlation computations on the Connection Machine CM-2. The

  14. An Integer Batch Scheduling Model for a Single Machine with Simultaneous Learning and Deterioration Effects to Minimize Total Actual Flow Time

    Science.gov (United States)

    Yusriski, R.; Sukoyo; Samadhi, T. M. A. A.; Halim, A. H.

    2016-02-01

    In the manufacturing industry, several identical parts can be processed in batches, and setup time is needed between two consecutive batches. Since the processing times of batches are not always fixed during a scheduling period due to learning and deterioration effects, this research deals with batch scheduling problems with simultaneous learning and deterioration effects. The objective is to minimize total actual flow time, defined as a time interval between the arrival of all parts at the shop and their common due date. The decision variables are the number of batches, integer batch sizes, and the sequence of the resulting batches. This research proposes a heuristic algorithm based on the Lagrange Relaxation. The effectiveness of the proposed algorithm is determined by comparing the resulting solutions of the algorithm to the respective optimal solution obtained from the enumeration method. Numerical experience results show that the average of difference among the solutions is 0.05%.

  15. Sine-Bar Attachment For Machine Tools

    Science.gov (United States)

    Mann, Franklin D.

    1988-01-01

    Sine-bar attachment for collets, spindles, and chucks helps machinists set up quickly for precise angular cuts that require greater precision than provided by graduations of machine tools. Machinist uses attachment to index head, carriage of milling machine or lathe relative to table or turning axis of tool. Attachment accurate to 1 minute or arc depending on length of sine bar and precision of gauge blocks in setup. Attachment installs quickly and easily on almost any type of lathe or mill. Requires no special clamps or fixtures, and eliminates many trial-and-error measurements. More stable than improvised setups and not jarred out of position readily.

  16. Sine-Bar Attachment For Machine Tools

    Science.gov (United States)

    Mann, Franklin D.

    1988-01-01

    Sine-bar attachment for collets, spindles, and chucks helps machinists set up quickly for precise angular cuts that require greater precision than provided by graduations of machine tools. Machinist uses attachment to index head, carriage of milling machine or lathe relative to table or turning axis of tool. Attachment accurate to 1 minute or arc depending on length of sine bar and precision of gauge blocks in setup. Attachment installs quickly and easily on almost any type of lathe or mill. Requires no special clamps or fixtures, and eliminates many trial-and-error measurements. More stable than improvised setups and not jarred out of position readily.

  17. Design of rotating electrical machines

    CERN Document Server

    Pyrhonen , Juha; Hrabovcova , Valeria

    2013-01-01

    In one complete volume, this essential reference presents an in-depth overview of the theoretical principles and techniques of electrical machine design. This timely new edition offers up-to-date theory and guidelines for the design of electrical machines, taking into account recent advances in permanent magnet machines as well as synchronous reluctance machines. New coverage includes: Brand new material on the ecological impact of the motors, covering the eco-design principles of rotating electrical machinesAn expanded section on the design of permanent magnet synchronous machines, now repo

  18. A simple configuration setup for compton suppression spectroscopy

    CERN Document Server

    Hai, N X; Dien, N N; Tan, V H; Hoa, N D

    2013-01-01

    The fast timing, standard timing and easy timing are popular timing configurations of compton suppression spectroscopy. Such spectroscopes always use a module of coincidence or time-to-amplitude converter (TAC). A compton suppression spectroscopy with semi-timing configuration is presented in this paper. The semi-timing configuration is relatively simple and easy system setup, especially this spectroscopy does not need to use module of coincidence or TAC. The performance of spectroscopy was tested and summarized. The count rate background, full peak efficiency and the ratios of area/background of peaks in suppressed and unsuppressed modes were comparative.

  19. Micro-machining.

    Science.gov (United States)

    Brinksmeier, Ekkard; Preuss, Werner

    2012-08-28

    Manipulating bulk material at the atomic level is considered to be the domain of physics, chemistry and nanotechnology. However, precision engineering, especially micro-machining, has become a powerful tool for controlling the surface properties and sub-surface integrity of the optical, electronic and mechanical functional parts in a regime where continuum mechanics is left behind and the quantum nature of matter comes into play. The surprising subtlety of micro-machining results from the extraordinary precision of tools, machines and controls expanding into the nanometre range-a hundred times more precise than the wavelength of light. In this paper, we will outline the development of precision engineering, highlight modern achievements of ultra-precision machining and discuss the necessity of a deeper physical understanding of micro-machining.

  20. Characterization of a neutron imaging setup at the INES facility

    Energy Technology Data Exchange (ETDEWEB)

    Durisi, E.A., E-mail: elisabettaalessandra.durisi@unito.it [Università di Torino, Dipartimento di Fisica, Via Pietro Giuria 1, 10125 Torino (Italy); Istituto Nazionale di Fisica Nucleare—Sezione di Torino, Via Pietro Giuria 1, 10125 Torino (Italy); Visca, L. [Università di Torino, Dipartimento di Fisica, Via Pietro Giuria 1, 10125 Torino (Italy); Istituto Nazionale di Fisica Nucleare—Sezione di Torino, Via Pietro Giuria 1, 10125 Torino (Italy); Albertin, F.; Brancaccio, R. [Istituto Nazionale di Fisica Nucleare—Sezione di Torino, Via Pietro Giuria 1, 10125 Torino (Italy); Corsi, J. [Università di Torino, Dipartimento di Fisica, Via Pietro Giuria 1, 10125 Torino (Italy); Istituto Nazionale di Fisica Nucleare—Sezione di Torino, Via Pietro Giuria 1, 10125 Torino (Italy); Dughera, G. [Istituto Nazionale di Fisica Nucleare—Sezione di Torino, Via Pietro Giuria 1, 10125 Torino (Italy); Ferrarese, W. [Università di Torino, Dipartimento di Fisica, Via Pietro Giuria 1, 10125 Torino (Italy); Istituto Nazionale di Fisica Nucleare—Sezione di Torino, Via Pietro Giuria 1, 10125 Torino (Italy); Giovagnoli, A.; Grassi, N. [Fondazione Centro per la Conservazione ed il Restauro dei Beni Culturali “La Venaria Reale”, Piazza della Repubblica, 10078 Venaria Reale, Torino (Italy); Grazzi, F. [Consiglio Nazionale delle Ricerche, Istituto dei Sistemi Complessi, Via Madonna del Piano 10, 50019 Sesto Fiorentino, Firenze (Italy); Lo Giudice, A.; Mila, G. [Università di Torino, Dipartimento di Fisica, Via Pietro Giuria 1, 10125 Torino (Italy); Istituto Nazionale di Fisica Nucleare—Sezione di Torino, Via Pietro Giuria 1, 10125 Torino (Italy); and others

    2013-10-21

    The Italian Neutron Experimental Station (INES) located at the ISIS pulsed neutron source (Didcot, United Kingdom) provides a thermal neutron beam mainly used for diffraction analysis. A neutron transmission imaging system was also developed for beam monitoring and for aligning the sample under investigation. Although the time-of-flight neutron diffraction is a consolidated technique, the neutron imaging setup is not yet completely characterized and optimized. In this paper the performance for neutron radiography and tomography at INES of two scintillator screens read out by two different commercial CCD cameras is compared in terms of linearity, signal-to-noise ratio, effective dynamic range and spatial resolution. In addition, the results of neutron radiographies and a tomography of metal alloy test structures are presented to better characterize the INES imaging capabilities of metal artifacts in the cultural heritage field. -- Highlights: A full characterization of the present INES imaging set-up was carried out. Two CCD cameras and two scintillators (ZnS/{sup 6}LiF) of different thicknesses were tested. Linearity, effective dynamic range and spatial resolution were determined. Radiographies of steep wedges were performed using the highest dynamic range setup. Tomography of a bronze cube was performed using the best spatial resolution setup.

  1. Stirling machine operating experience

    Energy Technology Data Exchange (ETDEWEB)

    Ross, B. [Stirling Technology Co., Richland, WA (United States); Dudenhoefer, J.E. [Lewis Research Center, Cleveland, OH (United States)

    1994-09-01

    Numerous Stirling machines have been built and operated, but the operating experience of these machines is not well known. It is important to examine this operating experience in detail, because it largely substantiates the claim that stirling machines are capable of reliable and lengthy operating lives. The amount of data that exists is impressive, considering that many of the machines that have been built are developmental machines intended to show proof of concept, and are not expected to operate for lengthy periods of time. Some Stirling machines (typically free-piston machines) achieve long life through non-contact bearings, while other Stirling machines (typically kinematic) have achieved long operating lives through regular seal and bearing replacements. In addition to engine and system testing, life testing of critical components is also considered. The record in this paper is not complete, due to the reluctance of some organizations to release operational data and because several organizations were not contacted. The authors intend to repeat this assessment in three years, hoping for even greater participation.

  2. A new Nawaz-Enscore-Ham-based heuristic for permutation flow-shop problems with bicriteria of makespan and machine idle time

    Science.gov (United States)

    Liu, Weibo; Jin, Yan; Price, Mark

    2016-10-01

    A new heuristic based on the Nawaz-Enscore-Ham algorithm is proposed in this article for solving a permutation flow-shop scheduling problem. A new priority rule is proposed by accounting for the average, mean absolute deviation, skewness and kurtosis, in order to fully describe the distribution style of processing times. A new tie-breaking rule is also introduced for achieving effective job insertion with the objective of minimizing both makespan and machine idle time. Statistical tests illustrate better solution quality of the proposed algorithm compared to existing benchmark heuristics.

  3. Perspex machine: VII. The universal perspex machine

    Science.gov (United States)

    Anderson, James A. D. W.

    2006-01-01

    -linear perspex-machine which is very much easier to program than the original perspex-machine. We then show how to map the whole of perspex space into a unit cube. This allows us to construct a fractal of perspex machines with the cardinality of a real-numbered line or space. This fractal is the universal perspex machine. It can solve, in unit time, the halting problem for itself and for all perspex machines instantiated in real-numbered space, including all Turing machines. We cite an experiment that has been proposed to test the physical reality of the perspex machine's model of time, but we make no claim that the physical universe works this way or that it has the cardinality of the perspex machine. We leave it that the perspex machine provides an upper bound on the computational properties of physical things, including manufactured computers and biological organisms, that have a cardinality no greater than the real-number line.

  4. Electric machine

    Science.gov (United States)

    El-Refaie, Ayman Mohamed Fawzi [Niskayuna, NY; Reddy, Patel Bhageerath [Madison, WI

    2012-07-17

    An interior permanent magnet electric machine is disclosed. The interior permanent magnet electric machine comprises a rotor comprising a plurality of radially placed magnets each having a proximal end and a distal end, wherein each magnet comprises a plurality of magnetic segments and at least one magnetic segment towards the distal end comprises a high resistivity magnetic material.

  5. Couch height–based patient setup for abdominal radiation therapy

    Energy Technology Data Exchange (ETDEWEB)

    Ohira, Shingo [Department of Radiation Oncology, Osaka Medical Center for Cancer and Cardiovascular Diseases, Osaka (Japan); Department of Medical Physics and Engineering, Osaka University Graduate School of Medicine, Suita (Japan); Ueda, Yoshihiro [Department of Radiation Oncology, Osaka Medical Center for Cancer and Cardiovascular Diseases, Osaka (Japan); Department of Radiation Oncology, Osaka University Graduate School of Medicine, Suita (Japan); Nishiyama, Kinji [Department of Radiation Oncology, Yao Municipal Hospital, Yao (Japan); Miyazaki, Masayoshi; Isono, Masaru; Tsujii, Katsutomo [Department of Radiation Oncology, Osaka Medical Center for Cancer and Cardiovascular Diseases, Osaka (Japan); Takashina, Masaaki; Koizumi, Masahiko [Department of Medical Physics and Engineering, Osaka University Graduate School of Medicine, Suita (Japan); Kawanabe, Kiyoto [Department of Radiation Oncology, Osaka Medical Center for Cancer and Cardiovascular Diseases, Osaka (Japan); Teshima, Teruki, E-mail: teshima-te@mc.pref.osaka.jp [Department of Radiation Oncology, Osaka Medical Center for Cancer and Cardiovascular Diseases, Osaka (Japan)

    2016-04-01

    There are 2 methods commonly used for patient positioning in the anterior-posterior (A-P) direction: one is the skin mark patient setup method (SMPS) and the other is the couch height–based patient setup method (CHPS). This study compared the setup accuracy of these 2 methods for abdominal radiation therapy. The enrollment for this study comprised 23 patients with pancreatic cancer. For treatments (539 sessions), patients were set up by using isocenter skin marks and thereafter treatment couch was shifted so that the distance between the isocenter and the upper side of the treatment couch was equal to that indicated on the computed tomographic (CT) image. Setup deviation in the A-P direction for CHPS was measured by matching the spine of the digitally reconstructed radiograph (DRR) of a lateral beam at simulation with that of the corresponding time-integrated electronic portal image. For SMPS with no correction (SMPS/NC), setup deviation was calculated based on the couch-level difference between SMPS and CHPS. SMPS/NC was corrected using 2 off-line correction protocols: no action level (SMPS/NAL) and extended NAL (SMPS/eNAL) protocols. Margins to compensate for deviations were calculated using the Stroom formula. A-P deviation > 5 mm was observed in 17% of SMPS/NC, 4% of SMPS/NAL, and 4% of SMPS/eNAL sessions but only in one CHPS session. For SMPS/NC, 7 patients (30%) showed deviations at an increasing rate of > 0.1 mm/fraction, but for CHPS, no such trend was observed. The standard deviations (SDs) of systematic error (Σ) were 2.6, 1.4, 0.6, and 0.8 mm and the root mean squares of random error (σ) were 2.1, 2.6, 2.7, and 0.9 mm for SMPS/NC, SMPS/NAL, SMPS/eNAL, and CHPS, respectively. Margins to compensate for the deviations were wide for SMPS/NC (6.7 mm), smaller for SMPS/NAL (4.6 mm) and SMPS/eNAL (3.1 mm), and smallest for CHPS (2.2 mm). Achieving better setup with smaller margins, CHPS appears to be a reproducible method for abdominal patient setup.

  6. Integer batch scheduling problems for a single-machine with simultaneous effect of learning and forgetting to minimize total actual flow time

    Directory of Open Access Journals (Sweden)

    Rinto Yusriski

    2015-09-01

    Full Text Available This research discusses an integer batch scheduling problems for a single-machine with position-dependent batch processing time due to the simultaneous effect of learning and forgetting. The decision variables are the number of batches, batch sizes, and the sequence of the resulting batches. The objective is to minimize total actual flow time, defined as total interval time between the arrival times of parts in all respective batches and their common due date. There are two proposed algorithms to solve the problems. The first is developed by using the Integer Composition method, and it produces an optimal solution. Since the problems can be solved by the first algorithm in a worst-case time complexity O(n2n-1, this research proposes the second algorithm. It is a heuristic algorithm based on the Lagrange Relaxation method. Numerical experiments show that the heuristic algorithm gives outstanding results.

  7. Optimized Method for Real-Time Face Recognition System Based on PCA and Multiclass Support Vector Machine

    Directory of Open Access Journals (Sweden)

    Reza Azad

    2013-11-01

    Full Text Available Automatic face recognition system is one of the core technologies in computer vision, machine learning, and biometrics. The present study presents a novel and improved way for face recognition. In the suggested approach, first, the place of face is extracted from the original image and then is sent to feature extraction stage, which is based on Principal Component Analysis (PCA technique. In the previous procedures which were established on PCA technique, the whole picture was taken as a vector feature, then among these features, key features were extracted with use of PCA algorithm, revealing finally some poor efficiency. Thus, in the recommended approach underlying the current investigation, first the areas of face features are extracted; then, the areas are combined and are regarded as vector features. Ultimately, its key features are extracted with use of PCA algorithm. Taken together, after extracting the features, for face recognition and classification, Multiclass Support Vector Machine (SVMs classifiers, which are typical of high efficiency, have been employed. In the result part, the proposed approach is applied on FEI database and the accuracy rate achieved 98.45%.

  8. Brain Machine Interface: Analysis of segmented EEG Signal Classification Using Short-Time PCA and Recurrent Neural Networks

    Directory of Open Access Journals (Sweden)

    C. R. Hema

    2008-01-01

    Full Text Available Brain machine interface provides a communication channel between the human brain and an external device. Brain interfaces are studied to provide rehabilitation to patients with neurodegenerative diseases; such patients loose all communication pathways except for their sensory and cognitive functions. One of the possible rehabilitation methods for these patients is to provide a brain machine interface (BMI for communication; the BMI uses the electrical activity of the brain detected by scalp EEG electrodes. Classification of EEG signals extracted during mental tasks is a technique for designing a BMI. In this paper a BMI design using five mental tasks from two subjects were studied, a combination of two tasks is studied per subject. An Elman recurrent neural network is proposed for classification of EEG signals. Two feature extraction algorithms using overlapped and non overlapped signal segments are analyzed. Principal component analysis is used for extracting features from the EEG signal segments. Classification performance of overlapping EEG signal segments is observed to be better in terms of average classification with a range of 78.5% to 100%, while the non overlapping EEG signal segments show better classification in terms of maximum classifications.

  9. Machine Shop. Module 6: Milling. Instructor's Guide.

    Science.gov (United States)

    Walden, Charles H.

    This document consists of materials for a 12-unit course on the following topics: (1) introduction to milling; (2) structure and accessories; (3) safety and maintenance; (4) cutting-tool variables; (5) basic set-up activities; (6) squaring a workpiece; (7) hole-making operations; (8) form milling; (9) machining keyways; (10) milling angular…

  10. Monitor For Electrical-Discharge Machining

    Science.gov (United States)

    Burley, Richard K.

    1993-01-01

    Circuit monitors electrical-discharge-machining (EDM) process to detect and prevent abnormal arcing, which can produce unacceptable "burn" marks on workpiece. When voltage between EDM electrode and workpiece behaves in manner indicative of abnormal arcing, relay made to switch off EDM power, which remains off until operator attends to EDM setup and resets monitor.

  11. 交货期固定的工件准时完工数 ——最大排序问题的多项式时间算法%Job Completed Just-In-Time in Single Machine and Parajllel Machins Scheduling Problem

    Institute of Scientific and Technical Information of China (English)

    张峰

    2000-01-01

    In this paper, we discuss the scheduling problem of maximal number of jobs which must be completed at its due date Just-In-Time. We research two cases, single machine and parallel machine. We give two polynomial time algorithm to solve these two cases respectively.%给出了求解交货期固定的工件准时完工数最大的排序问题的多项式时间算法。

  12. Part Machinability Evaluation System

    Institute of Scientific and Technical Information of China (English)

    1999-01-01

    In the early design period, estimation of the part or the whole product machinability is useful to consider the function and process request of the product at the same time so as to globally optimize the design decision. This paper presents a part machinability evaluation system, discusses the general restrictions of part machinability, and realizes the inspection of these restrictions with the relation between tool scan space and part model. During the system development, the expansibility and understandability were considered, and an independent restriction algorithm library and a general function library were set up. Additionally, the system has an interpreter and a knowledge manager.

  13. Database machine performance

    Energy Technology Data Exchange (ETDEWEB)

    Cesarini, F.; Salza, S.

    1987-01-01

    This book is devoted to the important problem of database machine performance evaluation. The book presents several methodological proposals and case studies, that have been developed within an international project supported by the European Economic Community on Database Machine Evaluation Techniques and Tools in the Context of the Real Time Processing. The book gives an overall view of the modeling methodologies and the evaluation strategies that can be adopted to analyze the performance of the database machine. Moreover, it includes interesting case studies and an extensive bibliography.

  14. Experimental Setups for Single Event Effect Studies

    Directory of Open Access Journals (Sweden)

    N. H. Medina

    2016-08-01

    Full Text Available Experimental setups are being prepared to test and to qualify electronic devices regarding their tolerance to Single Event Effect (SEE. A multiple test setup and a new beam line developed especially for SEE studies at the São Paulo 8 UD Pelletron accelerator were prepared. This accelerator produces proton beams and heavy ion beams up to 107Ag. A Super conducting Linear accelerator, which is under construction, may fulfill all of the European Space Agency requirements to qualify electronic components for SEE.

  15. Optical test setup for Silicon Photomultipliers

    Energy Technology Data Exchange (ETDEWEB)

    Heidemann, Carsten; Enzweiler, Tim; Hebbeker, Thomas; Merschmeyer, Markus

    2015-07-01

    Silicon Photomultipliers (SiPMs) are semiconductor-based photon detectors. Their most important properties, gain and photon detection efficiency, are dependent on or influenced by voltage and temperature and need to be characterised for optimal usage of the SiPMs. The test setup has been built for optical and electrical characterisation of SiPMs. The setup provides a temperature-stabilised SiPM mount, an LED-based multi-purpose light source offers continuous and pulsed operation mode for wavelengths from 300 nm to 650 nm. The result is a complete characterisation of the SiPM within a desired range of operation voltage and ambient temperature.

  16. Braneworld setup and embedding in teleparallel gravity

    Directory of Open Access Journals (Sweden)

    A. Behboodi

    2015-01-01

    Full Text Available We construct the setup of a five-dimensional braneworld scenario in teleparallel gravity. Both cases of Minkowski and Friedmann–Robertson–Walker branes embedded in anti-de Sitter bulk are studied and the effective 4D action were studied. 4-dimensional local Lorentz invariance is found to be recovered in both cases. However, due to different junction conditions, the equations governing the 4D cosmological evolution differ from general relativistic case. Using the results of Ref. [13], we consider a simple inflationary scenario in this setup. The inflation parameters are found to be modified compared to general relativistic case.

  17. Initialization and Setup of the Coastal Model Test Bed: STWAVE

    Science.gov (United States)

    2017-01-01

    coastal numerical models . Pertinent data types, including waves, water levels, nearshore currents, bathymetry, and meteorological measurements, are...correlation coefficients, and other statistics can be calculated between the observed data and the model output for any duration of time using the...ERDC/CHL CHETN-I-93 January 2017 Approved for public release; distribution is unlimited. Initialization and Setup of the Coastal Model Test Bed

  18. Minimizing and balancing setups in a serial production system

    OpenAIRE

    Detti, Paolo; Pranzo, Marco; Meloni, Carlo

    2007-01-01

    Abstract This paper addresses a problem arising in the coordination between two consecutive manufacturing departments of a production system, in which parts are processed in batches, and each batch is characterized by two distinct attributes. Due to limited interstage buffering between the two stages, the two departments have to follow the same batch sequence. In the first department, a setup occurs every time the first attribute of the new batch is different f...

  19. Experimental Setup for the Investigation of Superconducting Persistent Current

    Science.gov (United States)

    2015-09-01

    NOTES 14. ABSTRACT We report on a recent experimental setup for the investigation of the relaxation rate of the persistent current in an assembly of...at cryo-temperatures in magnetic field at time scale of seconds to hours. 15. SUBJECT TERMS persistent current, 2G HTS, coated conductor, relaxation ... activation . One unknown aspect is the variation of the coils’ position with temperature from room to cryogenic. A better design of the coils assembly

  20. Machine musicianship

    Science.gov (United States)

    Rowe, Robert

    2002-05-01

    The training of musicians begins by teaching basic musical concepts, a collection of knowledge commonly known as musicianship. Computer programs designed to implement musical skills (e.g., to make sense of what they hear, perform music expressively, or compose convincing pieces) can similarly benefit from access to a fundamental level of musicianship. Recent research in music cognition, artificial intelligence, and music theory has produced a repertoire of techniques that can make the behavior of computer programs more musical. Many of these were presented in a recently published book/CD-ROM entitled Machine Musicianship. For use in interactive music systems, we are interested in those which are fast enough to run in real time and that need only make reference to the material as it appears in sequence. This talk will review several applications that are able to identify the tonal center of musical material during performance. Beyond this specific task, the design of real-time algorithmic listening through the concurrent operation of several connected analyzers is examined. The presentation includes discussion of a library of C++ objects that can be combined to perform interactive listening and a demonstration of their capability.

  1. Fractional-Order Control of a Nonlinear Time-Delay System: Case Study in Oxygen Regulation in the Heart-Lung Machine

    Directory of Open Access Journals (Sweden)

    S. J. Sadati

    2012-01-01

    Full Text Available A fractional-order controller will be proposed to regulate the inlet oxygen into the heart-lung machine. An analytical approach will be explained to satisfy some requirements together with practical implementation of some restrictions for the first time. Primarily a nonlinear single-input single-output (SISO time-delay model which was obtained previously in the literature is introduced for the oxygen generation process in the heart-lung machine system and we will complete it by adding some new states to control it. Thereafter, the system is linearized using the state feedback linearization approach to find a third-order time-delay dynamics. Consequently classical PID and fractional order controllers are gained to assess the quality of the proposed technique. A set of optimal parameters of those controllers are achieved through the genetic algorithm optimization procedure through minimizing a cost function. Our design method focuses on minimizing some famous performance criterions such as IAE, ISE, and ITSE. In the genetic algorithm, the controller parameters are chosen as a random population. The best relevant values are achieved by reducing the cost function. A time-domain simulation signifies the performance of controller with respect to a traditional optimized PID controller.

  2. The Machine within the Machine

    CERN Multimedia

    Katarina Anthony

    2014-01-01

    Although Virtual Machines are widespread across CERN, you probably won't have heard of them unless you work for an experiment. Virtual machines - known as VMs - allow you to create a separate machine within your own, allowing you to run Linux on your Mac, or Windows on your Linux - whatever combination you need.   Using a CERN Virtual Machine, a Linux analysis software runs on a Macbook. When it comes to LHC data, one of the primary issues collaborations face is the diversity of computing environments among collaborators spread across the world. What if an institute cannot run the analysis software because they use different operating systems? "That's where the CernVM project comes in," says Gerardo Ganis, PH-SFT staff member and leader of the CernVM project. "We were able to respond to experimentalists' concerns by providing a virtual machine package that could be used to run experiment software. This way, no matter what hardware they have ...

  3. Prospects of a mathematical theory of human behavior in complex man-machine systems tasks. [time sharing computer analogy of automobile driving

    Science.gov (United States)

    Johannsen, G.; Rouse, W. B.

    1978-01-01

    A hierarchy of human activities is derived by analyzing automobile driving in general terms. A structural description leads to a block diagram and a time-sharing computer analogy. The range of applicability of existing mathematical models is considered with respect to the hierarchy of human activities in actual complex tasks. Other mathematical tools so far not often applied to man machine systems are also discussed. The mathematical descriptions at least briefly considered here include utility, estimation, control, queueing, and fuzzy set theory as well as artificial intelligence techniques. Some thoughts are given as to how these methods might be integrated and how further work might be pursued.

  4. Development of a Committee of Artificial Neural Networks for the Performance Testing of Compressors for Thermal Machines in Very Reduced Times

    Directory of Open Access Journals (Sweden)

    Coral Rodrigo

    2015-03-01

    Full Text Available This paper presents a new test method able to infer - in periods of less than 7 seconds - the refrigeration capacity of a compressor used in thermal machines, which represents a time reduction of approximately 99.95% related to the standardized traditional methods. The method was developed aiming at its application on compressor manufacture lines and on 100% of the units produced. Artificial neural networks (ANNs were used to establish a model able to infer the refrigeration capacity based on the data collected directly on the production line. The proposed method does not make use of refrigeration systems and also does not require using the compressor oil.

  5. Advanced Laboratory Setup for Testing Offshore Foundations

    DEFF Research Database (Denmark)

    Nielsen, Søren Dam; Ibsen, Lars Bo; Nielsen, Benjaminn Nordahl

    2016-01-01

    This paper describes a test setup for testing small-scale offshore foundations under realistic conditions of high pore-water pressure and high impact loads. The actuator, used for loading has enough capacity to apply sufficient force and displacement to achieve both drained and undrained failure ...

  6. Mechanical Fault Diagnosis of High Voltage Circuit Breakers Based on Wavelet Time-Frequency Entropy and One-Class Support Vector Machine

    Directory of Open Access Journals (Sweden)

    Nantian Huang

    2015-12-01

    Full Text Available Mechanical faults of high voltage circuit breakers (HVCBs are one of the most important factors that affect the reliability of power system operation. Because of the limitation of a lack of samples of each fault type; some fault conditions can be recognized as a normal condition. The fault diagnosis results of HVCBs seriously affect the operation reliability of the entire power system. In order to improve the fault diagnosis accuracy of HVCBs; a method for mechanical fault diagnosis of HVCBs based on wavelet time-frequency entropy (WTFE and one-class support vector machine (OCSVM is proposed. In this method; the S-transform (ST is proposed to analyze the energy time-frequency distribution of HVCBs’ vibration signals. Then; WTFE is selected as the feature vector that reflects the information characteristics of vibration signals in the time and frequency domains. OCSVM is used for judging whether a mechanical fault of HVCBs has occurred or not. In order to improve the fault detection accuracy; a particle swarm optimization (PSO algorithm is employed to optimize the parameters of OCSVM; including the window width of the kernel function and error limit. If the mechanical fault is confirmed; a support vector machine (SVM-based classifier will be used to recognize the fault type. The experiments carried on a real SF6 HVCB demonstrated the improved effectiveness of the new approach.

  7. Electric field stimulation setup for photoemission electron microscopes

    Energy Technology Data Exchange (ETDEWEB)

    Buzzi, M.; Vaz, C. A. F.; Raabe, J.; Nolting, F., E-mail: frithjof.nolting@psi.ch [Paul Scherrer Institut, 5232 Villigen PSI (Switzerland)

    2015-08-15

    Manipulating magnetisation by the application of an electric field in magnetoelectric multiferroics represents a timely issue due to the potential applications in low power electronics and the novel physics involved. Thanks to its element sensitivity and high spatial resolution, X-ray photoemission electron microscopy is a uniquely suited technique for the investigation of magnetoelectric coupling in multiferroic materials. In this work, we present a setup that allows for the application of in situ electric and magnetic fields while the sample is analysed in the microscope. As an example of the performances of the setup, we present measurements on Ni/Pb(Mg{sub 0.66}Nb{sub 0.33})O{sub 3}-PbTiO{sub 3} and La{sub 0.7}Sr{sub 0.3}MnO{sub 3}/PMN-PT artificial multiferroic nanostructures.

  8. Electric field stimulation setup for photoemission electron microscopes

    Science.gov (United States)

    Buzzi, M.; Vaz, C. A. F.; Raabe, J.; Nolting, F.

    2015-08-01

    Manipulating magnetisation by the application of an electric field in magnetoelectric multiferroics represents a timely issue due to the potential applications in low power electronics and the novel physics involved. Thanks to its element sensitivity and high spatial resolution, X-ray photoemission electron microscopy is a uniquely suited technique for the investigation of magnetoelectric coupling in multiferroic materials. In this work, we present a setup that allows for the application of in situ electric and magnetic fields while the sample is analysed in the microscope. As an example of the performances of the setup, we present measurements on Ni/Pb(Mg0.66Nb0.33)O3-PbTiO3 and La0.7Sr0.3MnO3/PMN-PT artificial multiferroic nanostructures.

  9. Electric field stimulation setup for photoemission electron microscopes.

    Science.gov (United States)

    Buzzi, M; Vaz, C A F; Raabe, J; Nolting, F

    2015-08-01

    Manipulating magnetisation by the application of an electric field in magnetoelectric multiferroics represents a timely issue due to the potential applications in low power electronics and the novel physics involved. Thanks to its element sensitivity and high spatial resolution, X-ray photoemission electron microscopy is a uniquely suited technique for the investigation of magnetoelectric coupling in multiferroic materials. In this work, we present a setup that allows for the application of in situ electric and magnetic fields while the sample is analysed in the microscope. As an example of the performances of the setup, we present measurements on Ni/Pb(Mg(0.66)Nb(0.33))O3-PbTiO3 and La(0.7)Sr(0.3)MnO3/PMN-PT artificial multiferroic nanostructures.

  10. Machine Learning

    CERN Document Server

    CERN. Geneva

    2017-01-01

    Machine learning, which builds on ideas in computer science, statistics, and optimization, focuses on developing algorithms to identify patterns and regularities in data, and using these learned patterns to make predictions on new observations. Boosted by its industrial and commercial applications, the field of machine learning is quickly evolving and expanding. Recent advances have seen great success in the realms of computer vision, natural language processing, and broadly in data science. Many of these techniques have already been applied in particle physics, for instance for particle identification, detector monitoring, and the optimization of computer resources. Modern machine learning approaches, such as deep learning, are only just beginning to be applied to the analysis of High Energy Physics data to approach more and more complex problems. These classes will review the framework behind machine learning and discuss recent developments in the field.

  11. ASD FieldSpec Calibration Setup and Techniques

    Science.gov (United States)

    Olive, Dan

    2001-01-01

    This paper describes the Analytical Spectral Devices (ASD) Fieldspec Calibration Setup and Techniques. The topics include: 1) ASD Fieldspec FR Spectroradiometer; 2) Components of Calibration; 3) Equipment list; 4) Spectral Setup; 5) Spectral Calibration; 6) Radiometric and Linearity Setup; 7) Radiometric setup; 8) Datadets Required; 9) Data files; and 10) Field of View Measurement. This paper is in viewgraph form.

  12. A branch and bound algorithm for a single-machine scheduling problem with positive and negative time-lags

    NARCIS (Netherlands)

    Brucker, P.; Hilbig, T.; Hurink, J.L.

    1999-01-01

    Positive and negative time-lags are general timing restrictions between the starting times of jobs which have been introduced by Roy in connection with the Metra Potential Method. They allow the consideration of positive and negative time-lags between the starting times of jobs. It is shown that com

  13. Batch Scheduling Algorithms for Similar Machines with Readiness Time%机器带准备时间的同类机分批排序算法

    Institute of Scientific and Technical Information of China (English)

    李海霞; 朱路宁; 赵晟珂

    2011-01-01

    讨论了两类机器带准备时间的同类机分批排序问题.对工件无到达时间及有常数个到达时间,目标函数为极小化加权总完工时间这两类问题进行研究,给出了两个最优算法,并对算法及其计算复杂性给予了分析与证明.%This paper investigates sorting problems of two classes of similar machines with readiness time.For problems that have no or constant arrival times and which object functions are minimizing weighted completion time,we present the analysis and proof of two optimal algorithms and their complexities.

  14. Handbook of machine soldering SMT and TH

    CERN Document Server

    Woodgate, Ralph W

    1996-01-01

    A shop-floor guide to the machine soldering of electronics Sound electrical connections are the operational backbone of every piece of electronic equipment-and the key to success in electronics manufacturing. The Handbook of Machine Soldering is dedicated to excellence in the machine soldering of electrical connections. Self-contained, comprehensive, and down-to-earth, it cuts through jargon, peels away outdated notions, and presents all the information needed to select, install, and operate machine soldering equipment. This fully updated and revised volume covers all of the new technologies and processes that have emerged in recent years, most notably the use of surface mount technology (SMT). Supplemented with 200 illustrations, this thoroughly accessible text Describes reflow and wave soldering in detail, including reflow soldering of SMT boards and the use of nitrogen blankets * Explains the setup, operation, and maintenance of a variety of soldering machines * Discusses theory, selection, and control met...

  15. 基于时间抽象状态机的AADL模型验证∗%Verification of AADL Models with Timed Abstract State Machines

    Institute of Scientific and Technical Information of China (English)

    杨志斌; 胡凯; 赵永望; 马殿富; Jean-Paul BODEVEIX

    2015-01-01

    This paper presents a formal verification method for AADL (architecture analysis and design language) models by TASM (timed abstract state machine) translation. The abstract syntax of the chosen subset of AADL and of TASM are given. The translation rules are defined clearly by the semantic functions expressed in a ML-like language. Furthermore, the translation is implemented in the model transformation tool AADL2TASM, which provides model checking and simulation for AADL models. Finally, a case study of space GNC (guidance, navigation and control) system is provided.%提出了一种基于时间抽象状态机(timed abstract state machine,简称TASM)的AADL(architecture analysis and design language)模型验证方法。分别给出了AADL子集和TASM的抽象语法,并基于语义函数和类ML的元语言形式定义转换规则。在此基础上,基于AADL开源建模环境OSATE(open source AADL tool environment)设计并实现了AADL模型验证与分析工具AADL2TASM,并基于航天器导航、制导与控制系统(guidance, navigation and control)进行了实例性验证。

  16. Time-Varying Total Stiffness Matrix of a Rigid Machine Spindle-Angular Contact Ball Bearings Assembly: Theory and Analytical/Experimental Verifications

    Directory of Open Access Journals (Sweden)

    Fawzi M.A. El-Saeidy

    2011-01-01

    Full Text Available A lagrangian formulation is presented for the total dynamic stiffness and damping matrices of a rigid rotor carrying noncentral rigid disk and supported on angular contact ball bearings (ACBBs. The bearing dynamic stiffness/damping marix is derived in terms of the bearing motions (displacements/rotations and then the principal of virtual work is used to transfer it from the bearing location to the rotor mass center to obtain the total dynamic stiffness/damping matrix. The bearing analyses take into account the bearing nonlinearities, cage rotation and bearing axial preload. The coefficients of these time-dependent matrices are presented analytically. The equations of motion of a rigid rotor-ACBBs assembly are derived using Lagrange's equation. The proposed analyses on deriving the bearing stiffness matrix are verified against existing bearing analyses of SKF researchers that, in turn, were verified using both SKF softwares/experiments and we obtained typical agreements. The presented total stiffness matrix is applied to a typical grinding machine spindle studied experimentally by other researchers and excellent agreements are obtained between our analytical eigenvalues and the experimental ones. The effect of using the total full stiffness matrix versus using the total diagonal stiffness matrix on the natural frequencies and dynamic response of the rigid rotor-bearings system is studied. It is found that using the diagonal matrix affects natural frequencies values (except the axial frequency and response amplitudes and pattern and causes important vibration tones to be missig from the response spectrum. Therefore it is recommended to use the full total stiffness matrix and not the diagonal matrix in the design/vibration analysis of these rotating machines. For a machine spindle-ACBBs assembly under mass unbalnce and a horizontal force at the spindle cutting nose when the bearing time-varying stiffness matrix (bearing cage rotation is considered

  17. Quick setup of unit test for accelerator controls system

    Energy Technology Data Exchange (ETDEWEB)

    Fu, W.; D' Ottavio, T.; Gassner, D.; Nemesure, S.; Morris, J.

    2011-03-28

    Testing a single hardware unit of an accelerator control system often requires the setup of a program with graphical user interface. Developing a dedicated application for a specific hardware unit test could be time consuming and the application may become obsolete after the unit tests. This paper documents a methodology for quick design and setup of an interface focused on performing unit tests of accelerator equipment with minimum programming work. The method has three components. The first is a generic accelerator device object (ADO) manager which can be used to setup, store, and log testing controls parameters for any unit testing system. The second involves the design of a TAPE (Tool for Automated Procedure Execution) sequence file that specifies and implements all te testing and control logic. The sting third is the design of a PET (parameter editing tool) page that provides the unit tester with all the necessary control parameters required for testing. This approach has been used for testing the horizontal plane of the Stochastic Cooling Motion Control System at RHIC.

  18. Narrow Artificial Intelligence with Machine Learning for Real-Time Estimation of a Mobile Agent’s Location Using Hidden Markov Models

    Directory of Open Access Journals (Sweden)

    Cédric Beaulac

    2017-01-01

    Full Text Available We propose to use a supervised machine learning technique to track the location of a mobile agent in real time. Hidden Markov Models are used to build artificial intelligence that estimates the unknown position of a mobile target moving in a defined environment. This narrow artificial intelligence performs two distinct tasks. First, it provides real-time estimation of the mobile agent’s position using the forward algorithm. Second, it uses the Baum–Welch algorithm as a statistical learning tool to gain knowledge of the mobile target. Finally, an experimental environment is proposed, namely, a video game that we use to test our artificial intelligence. We present statistical and graphical results to illustrate the efficiency of our method.

  19. Determination of efficiencies, loss mechanisms, and performance degradation factors in chopper controlled dc vehical motors. Section 2: The time dependent finite element modeling of the electromagnetic field in electrical machines: Methods and applications. Ph.D. Thesis

    Science.gov (United States)

    Hamilton, H. B.; Strangas, E.

    1980-01-01

    The time dependent solution of the magnetic field is introduced as a method for accounting for the variation, in time, of the machine parameters in predicting and analyzing the performance of the electrical machines. The method of time dependent finite element was used in combination with an also time dependent construction of a grid for the air gap region. The Maxwell stress tensor was used to calculate the airgap torque from the magnetic vector potential distribution. Incremental inductances were defined and calculated as functions of time, depending on eddy currents and saturation. The currents in all the machine circuits were calculated in the time domain based on these inductances, which were continuously updated. The method was applied to a chopper controlled DC series motor used for electric vehicle drive, and to a salient pole sychronous motor with damper bars. Simulation results were compared to experimentally obtained ones.

  20. Design and validation of a real-time spiking-neural-network decoder for brain-machine interfaces

    Science.gov (United States)

    Dethier, Julie; Nuyujukian, Paul; Ryu, Stephen I.; Shenoy, Krishna V.; Boahen, Kwabena

    2013-06-01

    Objective. Cortically-controlled motor prostheses aim to restore functions lost to neurological disease and injury. Several proof of concept demonstrations have shown encouraging results, but barriers to clinical translation still remain. In particular, intracortical prostheses must satisfy stringent power dissipation constraints so as not to damage cortex. Approach. One possible solution is to use ultra-low power neuromorphic chips to decode neural signals for these intracortical implants. The first step is to explore in simulation the feasibility of translating decoding algorithms for brain-machine interface (BMI) applications into spiking neural networks (SNNs). Main results. Here we demonstrate the validity of the approach by implementing an existing Kalman-filter-based decoder in a simulated SNN using the Neural Engineering Framework (NEF), a general method for mapping control algorithms onto SNNs. To measure this system’s robustness and generalization, we tested it online in closed-loop BMI experiments with two rhesus monkeys. Across both monkeys, a Kalman filter implemented using a 2000-neuron SNN has comparable performance to that of a Kalman filter implemented using standard floating point techniques. Significance. These results demonstrate the tractability of SNN implementations of statistical signal processing algorithms on different monkeys and for several tasks, suggesting that a SNN decoder, implemented on a neuromorphic chip, may be a feasible computational platform for low-power fully-implanted prostheses. The validation of this closed-loop decoder system and the demonstration of its robustness and generalization hold promise for SNN implementations on an ultra-low power neuromorphic chip using the NEF.

  1. The spectral imaging facility: Setup characterization

    Energy Technology Data Exchange (ETDEWEB)

    De Angelis, Simone, E-mail: simone.deangelis@iaps.inaf.it; De Sanctis, Maria Cristina; Manzari, Paola Olga [Institute for Space Astrophysics and Planetology, INAF-IAPS, Via Fosso del Cavaliere, 100, 00133 Rome (Italy); Ammannito, Eleonora [Institute for Space Astrophysics and Planetology, INAF-IAPS, Via Fosso del Cavaliere, 100, 00133 Rome (Italy); Department of Earth, Planetary and Space Sciences, University of California, Los Angeles, Los Angeles, California 90095-1567 (United States); Di Iorio, Tatiana [ENEA, UTMEA-TER, Rome (Italy); Liberati, Fabrizio [Opto Service SrL, Campagnano di Roma (RM) (Italy); Tarchi, Fabio; Dami, Michele; Olivieri, Monica; Pompei, Carlo [Selex ES, Campi Bisenzio (Italy); Mugnuolo, Raffaele [Italian Space Agency, ASI, Spatial Geodesy Center, Matera (Italy)

    2015-09-15

    The SPectral IMager (SPIM) facility is a laboratory visible infrared spectrometer developed to support space borne observations of rocky bodies of the solar system. Currently, this laboratory setup is used to support the DAWN mission, which is in its journey towards the asteroid 1-Ceres, and to support the 2018 Exo-Mars mission in the spectral investigation of the Martian subsurface. The main part of this setup is an imaging spectrometer that is a spare of the DAWN visible infrared spectrometer. The spectrometer has been assembled and calibrated at Selex ES and then installed in the facility developed at the INAF-IAPS laboratory in Rome. The goal of SPIM is to collect data to build spectral libraries for the interpretation of the space borne and in situ hyperspectral measurements of planetary materials. Given its very high spatial resolution combined with the imaging capability, this instrument can also help in the detailed study of minerals and rocks. In this paper, the instrument setup is first described, and then a series of test measurements, aimed to the characterization of the main subsystems, are reported. In particular, laboratory tests have been performed concerning (i) the radiation sources, (ii) the reference targets, and (iii) linearity of detector response; the instrumental imaging artifacts have also been investigated.

  2. Local search algorithms for a single-machine scheduling problem with positive and negative time-lags

    NARCIS (Netherlands)

    Hurink, Johann L.; Keuchel, J.

    Positive and negative time-lags are general timing restrictions between the starting times of jobs which have been introduced by Roy (C.R. Acad. Sci., 1959, T.248) in connection with the Metra Potential Method. Although very powerful, these relations have been considered only seldom in the

  3. MACHINING OPTIMISATION AND OPERATION ALLOCATION FOR NC LATHE MACHINES IN A JOB SHOP MANUFACTURING SYSTEM

    Directory of Open Access Journals (Sweden)

    MUSSA I. MGWATU

    2013-08-01

    Full Text Available Numerical control (NC machines in a job shop may not be cost and time effective if the assignment of cutting operations and optimisation of machining parameters are overlooked. In order to justify better utilisation and higher productivity of invested NC machine tools, it is necessary to determine the optimum machining parameters and realize effective assignment of cutting operations on machines. This paper presents two mathematical models for optimising machining parameters and effectively allocating turning operations on NC lathe machines in a job shop manufacturing system. The models are developed as non-linear programming problems and solved using a commercial LINGO software package. The results show that the decisions of machining optimisation and operation allocation on NC lathe machines can be simultaneously made while minimising both production cost and cycle time. In addition, the results indicate that production cost and cycle time can be minimised while significantly reducing or totally eliminating idle times among machines.

  4. Machine Learning

    Energy Technology Data Exchange (ETDEWEB)

    Chikkagoudar, Satish; Chatterjee, Samrat; Thomas, Dennis G.; Carroll, Thomas E.; Muller, George

    2017-04-21

    The absence of a robust and unified theory of cyber dynamics presents challenges and opportunities for using machine learning based data-driven approaches to further the understanding of the behavior of such complex systems. Analysts can also use machine learning approaches to gain operational insights. In order to be operationally beneficial, cybersecurity machine learning based models need to have the ability to: (1) represent a real-world system, (2) infer system properties, and (3) learn and adapt based on expert knowledge and observations. Probabilistic models and Probabilistic graphical models provide these necessary properties and are further explored in this chapter. Bayesian Networks and Hidden Markov Models are introduced as an example of a widely used data driven classification/modeling strategy.

  5. Laboratory setup for incremental forming at IPL

    DEFF Research Database (Denmark)

    Young, Dave; Andreasen, Jan Lasson

    and machining laboratories. A laboratory equipment was developed during spring 2004 with our Cincinatti CNC milling machine as basis. The first obstacle to overcome was to establish a possibility for running CNC programs larger than capacity of the memory in the CNC controller of the milling machine. A solution...... PC and CNC controller was purchased. In this process the agent Peter Jensen Phone 45 85 60 50 and consultant Per Kruse 48 18 48 28 from Camsys System was involved. In order to boost our starting up Dave Young a former student of Jack’s came and stayed with us during April-May 2004. The present report...... for generating tool paths using available CAD/CAM facilties 3. Handing over knowledge from Queen’s to the laboratory staff of IPL....

  6. Vehicle speed prediction via a sliding-window time series analysis and an evolutionary least learning machine: A case study on San Francisco urban roads

    Directory of Open Access Journals (Sweden)

    Ladan Mozaffari

    2015-06-01

    Full Text Available The main goal of the current study is to take advantage of advanced numerical and intelligent tools to predict the speed of a vehicle using time series. It is clear that the uncertainty caused by temporal behavior of the driver as well as various external disturbances on the road will affect the vehicle speed, and thus, the vehicle power demands. The prediction of upcoming power demands can be employed by the vehicle powertrain control systems to improve significantly the fuel economy and emission performance. Therefore, it is important to systems design engineers and automotive industrialists to develop efficient numerical tools to overcome the risk of unpredictability associated with the vehicle speed profile on roads. In this study, the authors propose an intelligent tool called evolutionary least learning machine (E-LLM to forecast the vehicle speed sequence. To have a practical evaluation regarding the efficacy of E-LLM, the authors use the driving data collected on the San Francisco urban roads by a private Honda Insight vehicle. The concept of sliding window time series (SWTS analysis is used to prepare the database for the speed forecasting process. To evaluate the performance of the proposed technique, a number of well-known approaches, such as auto regressive (AR method, back-propagation neural network (BPNN, evolutionary extreme learning machine (E-ELM, extreme learning machine (ELM, and radial basis function neural network (RBFNN, are considered. The performances of the rival methods are then compared in terms of the mean square error (MSE, root mean square error (RMSE, mean absolute percentage error (MAPE, median absolute percentage error (MDAPE, and absolute fraction of variances (R2 metrics. Through an exhaustive comparative study, the authors observed that E-LLM is a powerful tool for predicting the vehicle speed profiles. The outcomes of the current study can be of use for the engineers of automotive industry who have been

  7. T型管自动焊机适时控制系统设计%Design of Timely Controlling System of T-Shape Automatic Welding Machine

    Institute of Scientific and Technical Information of China (English)

    苗雨来; 梁楚华; 周建平; 高军义

    2012-01-01

    In order to improve the welding quality of T-shape automatic welding machine for the welding process, according to phenomenon of the actual welding path which can not fit the theoretical definition of the path,an optical detection system is researched and designed to achieve the timely detection of the actual weld location and feedback to achieve timely control purposes.The system is used to detect the actual location of horizontal pipe and vertical pipe deformation of T-shape work-piece which is mainly caused by punch accuracy or thermal deformation in the welding process ,and then achieve timely control function of the T梥hape automatic welding machine.The system has achieved good results in the production, ensuring the welding quality,and improves the welding efficiency of radiator pipe welding;it is a key technology for the development o/T-shape automatic welding machine.%为了提高T型管自动焊机的焊接质量,针对焊接过程中,实际焊接路径不能与理论定义路径吻合的问题,研究并设计出一套光电检测系统,用来实现对实际焊缝位置的适时检测与反馈,达到适时控制的目的.系统主要是对焊接过程中,由于打孔精度或者热变形等因素造成的T型管焊件横向管与纵向管变形后焊缝实际位置的适时检测,从而实现T型管自动焊机适时控制的功能.该系统在钢制散热器管道焊接生产中取得了良好的效果,很好的保证了焊接质量,并提高了焊接效率,是T型管自动焊机发展的一项关键技术,是T型管自动焊机发展的一项关键技术.

  8. Adapting machine learning techniques to censored time-to-event health record data: A general-purpose approach using inverse probability of censoring weighting.

    Science.gov (United States)

    Vock, David M; Wolfson, Julian; Bandyopadhyay, Sunayan; Adomavicius, Gediminas; Johnson, Paul E; Vazquez-Benitez, Gabriela; O'Connor, Patrick J

    2016-06-01

    Models for predicting the probability of experiencing various health outcomes or adverse events over a certain time frame (e.g., having a heart attack in the next 5years) based on individual patient characteristics are important tools for managing patient care. Electronic health data (EHD) are appealing sources of training data because they provide access to large amounts of rich individual-level data from present-day patient populations. However, because EHD are derived by extracting information from administrative and clinical databases, some fraction of subjects will not be under observation for the entire time frame over which one wants to make predictions; this loss to follow-up is often due to disenrollment from the health system. For subjects without complete follow-up, whether or not they experienced the adverse event is unknown, and in statistical terms the event time is said to be right-censored. Most machine learning approaches to the problem have been relatively ad hoc; for example, common approaches for handling observations in which the event status is unknown include (1) discarding those observations, (2) treating them as non-events, (3) splitting those observations into two observations: one where the event occurs and one where the event does not. In this paper, we present a general-purpose approach to account for right-censored outcomes using inverse probability of censoring weighting (IPCW). We illustrate how IPCW can easily be incorporated into a number of existing machine learning algorithms used to mine big health care data including Bayesian networks, k-nearest neighbors, decision trees, and generalized additive models. We then show that our approach leads to better calibrated predictions than the three ad hoc approaches when applied to predicting the 5-year risk of experiencing a cardiovascular adverse event, using EHD from a large U.S. Midwestern healthcare system.

  9. Street Ball, Swim Team and the Sour Cream Machine: A Cluster Analysis of out of School Time Participation Portfolios

    Science.gov (United States)

    Nelson, Ingrid Ann; Gastic, Billie

    2009-01-01

    Adolescents spend only a fraction of their waking hours in school and what they do with the rest of their time varies dramatically. Despite this, research on out-of-school time has largely focused on structured programming. The authors analyzed data from the Educational Longitudinal Study of 2002 (ELS:2002) to examine the out-of-school time…

  10. Dimensionamiento de lotes y programación de una máquina para múltiples productos con setup y escasez

    Directory of Open Access Journals (Sweden)

    Horacio Ocampo Azocar

    2014-08-01

    Full Text Available En este trabajo se desarrolla un procedimiento para resolver una extensión del problema clásico del lote económico y programación (ELSP, con múltiples productos y considerando tiempos de preparación dependientes de la secuencia (setup y satisfacción atrasada de la demanda en un entorno productivo de una máquina. El procedimiento utiliza una heurística de la literatura para generar secuencias de lotes de producción, las que son evaluadas mediante un modelo de optimización no lineal desarrollado por los autores que incorpora la satisfacción de demanda atrasada (backlogging y el cumplimiento de niveles de servicio, minimizando los costos de setup, de inventario y de atraso en un horizonte de tiempo. El método se ilustra mediante la resolución de un problema de tamaño reducido. This work develops a methodology to solve an extension of the Economic Lot Scheduling Problem (ELSP satisfying the demand for multiple products considering sequence dependent setup times and backlogging in a single machine. The fundamental problem is to determine the production sequence and lot size for each production run, in order to meet customer demand in a given planning horizon, minimizing setup, inventory and backlogging costs. An incremental heuristic procedure that interchange two and three lots to obtain the lot production sequence is applied. These lot sequences are evaluated with a nonlinear optimization model to determine the lot size for each lot of the sequence. The method is illustrated solving a small instance of the problem.

  11. Machine testning

    DEFF Research Database (Denmark)

    De Chiffre, Leonardo

    This document is used in connection with a laboratory exercise of 3 hours duration as a part of the course GEOMETRICAL METROLOGY AND MACHINE TESTING. The exercise includes a series of tests carried out by the student on a conventional and a numerically controled lathe, respectively. This document...

  12. Representational Machines

    DEFF Research Database (Denmark)

    Petersson, Dag; Dahlgren, Anna; Vestberg, Nina Lager

    to the enterprises of the medium. This is the subject of Representational Machines: How photography enlists the workings of institutional technologies in search of establishing new iconic and social spaces. Together, the contributions to this edited volume span historical epochs, social environments, technological...

  13. Machine protection for FLASH and the European XFEL

    Energy Technology Data Exchange (ETDEWEB)

    Froehlich, Lars

    2009-05-15

    The Free-Electron Laser in Hamburg (FLASH) and the future European X-Ray Free-Electron Laser (XFEL) are sources of brilliant extremeultraviolet and X-ray radiation pulses. Both facilities are based on superconducting linear accelerators (linacs) that can produce and transport electron beams of high average power. With up to 90 kW or up to 600 kW of power, respectively, these beams hold a serious potential to damage accelerator components. This thesis discusses several passive and active machine protection measures needed to ensure safe operation. At FLASH, dark current from the rf gun electron source has activated several accelerator components to unacceptable radiation levels. Its transport through the linac is investigated with detailed tracking simulations using a parallelized and enhanced version of the tracking code Astra; possible remedies are evaluated. Beam losses can lead to the demagnetization of permanent magnet insertion devices. A number of beam loss scenarios typical for FLASH are investigated with shower simulations. A shielding setup is designed and its efficiency is evaluated. For the design parameters of FLASH, it is concluded that the average relative beam loss in the undulators must be controlled to a level of about 10{sup -8}. FLASH is equipped with an active machine protection system (MPS) comprising more than 80 photomultiplier-based beam loss monitors and several subsystems. The maximum response time to beam losses is less than 4 {mu}s. Setup procedures and calibration algorithms for MPS subsystems and components are introduced and operational problems are addressed. Finally, an architecture for a fully programmable machine protection system for the XFEL is presented. Several options for the topology of this system are reviewed, with the result that an availability goal of at least 0.999 for the MPS is achievable with moderate hardware requirements. (orig.)

  14. Street ball, swim team and the sour cream machine: a cluster analysis of out of school time participation portfolios.

    Science.gov (United States)

    Nelson, Ingrid Ann; Gastic, Billie

    2009-10-01

    Adolescents spend only a fraction of their waking hours in school and what they do with the rest of their time varies dramatically. Despite this, research on out-of-school time has largely focused on structured programming. The authors analyzed data from the Educational Longitudinal Study of 2002 (ELS:2002) to examine the out-of-school time activity portfolios of 6,338 high school sophomores, accounting for time spent in school clubs and sports as well as 17 other activities. The analytical sample was balanced with respect to sex and racially and ethnically diverse: 49% female, 67% White, 10% Latino, 10% African American, and 6% Asian and Pacific Islander. Approximately 76% of the sample attended public schools, 30% were in the highest socioeconomic quartile, and 20% were in the lowest socioeconomic quartile. The authors identified five distinct out-of-school time activity portfolios based on a cluster analysis. The demographic profiles of students by portfolio type differed significantly with respect to sex, race/ethnicity, socioeconomic status, school type and location. Students by portfolio type also differed significantly in terms of measures of academic success, school behavior, victimization and perceptions of school climate, controlling for covariates. These findings underscore the importance of more complex considerations of adolescents' out-of-school time.

  15. The cold neutron tomography set-up at SINQ

    Science.gov (United States)

    Materna, T.; Baechler, S.; Jolie, J.; Masschaele, B.; Dierick, M.; Kardjilov, N.

    2004-06-01

    The cold neutron tomography station operated at SINQ (Paul Scherrer Institute, Switzerland) is reviewed. The high neutron flux together with a set-up based on a scintillator screen and a CCD camera yielded fast and effective results with resolution down to 250 μm: tomography of small samples (up to 2 cm large) could be performed in less than an hour. The use of a velocity selector improved the contrast discrimination and allows dichromatic tomography. The station is moving to the new research reactor FRM-II (Garching, Germany) where its performances will be increased by the availability of a 5-times-higher cold neutron flux.

  16. Femtosecond broadband fluorescence upconversion spectroscopy: Improved setup and photometric correction

    Energy Technology Data Exchange (ETDEWEB)

    Zhang, X.-X. [Photonics Center, College of Physical Science, Nankai University, Tianjin (China); Department of Chemistry, Humboldt Universitaet zu Berlin (Germany); Wuerth, C.; Resch-Genger, U. [Federal Institute for Materials Research and Testing, Berlin (Germany); Zhao, L. [Photonics Center, College of Physical Science, Nankai University, Tianjin (China); Ernsting, N. P.; Sajadi, M. [Department of Chemistry, Humboldt Universitaet zu Berlin (Germany)

    2011-06-15

    A setup for fluorescence upconversion spectroscopy (FLUPS) is described which has 80 fs temporal response (fwhm) for emission in the spectral range 425-750 nm. Broadband phase matching is achieved with tilted gate pulses at 1340 nm. Background from harmonics of the gate pulse is removed and sensitivity increased compared to previous designs. Photometric calibration of the upconversion process is performed with a set of fluorescent dyes. For Coumarin 153 in methanol the peak position, bandwidth, and asymmetry depending on delay time are reported.

  17. Femtosecond broadband fluorescence upconversion spectroscopy: Improved setup and photometric correction

    Science.gov (United States)

    Zhang, X.-X.; Würth, C.; Zhao, L.; Resch-Genger, U.; Ernsting, N. P.; Sajadi, M.

    2011-06-01

    A setup for fluorescence upconversion spectroscopy (FLUPS) is described which has 80 fs temporal response (fwhm) for emission in the spectral range 425-750 nm. Broadband phase matching is achieved with tilted gate pulses at 1340 nm. Background from harmonics of the gate pulse is removed and sensitivity increased compared to previous designs. Photometric calibration of the upconversion process is performed with a set of fluorescent dyes. For Coumarin 153 in methanol the peak position, bandwidth, and asymmetry depending on delay time are reported.

  18. Improved mortar set-up technique

    CSIR Research Space (South Africa)

    De Villiers, D

    2010-05-01

    Full Text Available www.csir.co.za Close Rage Reference Device (Prismatic Mirror) • Problems with aiming posts • Description of the Prismatic Mirror • Prismatic Mirror set-up • Passing adjustment bearings and paralleling • Mortar lay • First shot and small.... Prismatic Mirror (Close Rage Reference Device) Slide 16 © CSIR 2008 www.csir.co.za Prismatic Mirror (Close Rage Reference Device) Slide 17 © CSIR 2008 www.csir.co.za C2A1 Bearing Scale (Close Rage Reference...

  19. Recent IBA setup improvements in Chile

    Energy Technology Data Exchange (ETDEWEB)

    Miranda, P.A. [Departamento de Fisica, Facultad de Ciencias, Universidad de Chile, Casilla 653, Santiago 1 (Chile)]. E-mail: pmiranda@fisica.ciencias.uchile.cl; Chesta, M.A. [Departamento de Fisica, Facultad de Ciencias, Universidad de Chile, Casilla 653, Santiago 1 (Chile); Cancino, S.A. [Departamento de Fisica, Facultad de Ciencias, Universidad de Chile, Casilla 653, Santiago 1 (Chile); Morales, J.R. [Departamento de Fisica, Facultad de Ciencias, Universidad de Chile, Casilla 653, Santiago 1 (Chile); Dinator, M.I. [Departamento de Fisica, Facultad de Ciencias, Universidad de Chile, Casilla 653, Santiago 1 (Chile); Wachter, J.A. [Departamento de Fisica, Facultad de Ciencias, Universidad de Chile, Casilla 653, Santiago 1 (Chile); Tenreiro, C. [Facultad de Ingenieria, Campus Curico, Universidad de Talca (Chile)

    2006-07-15

    This paper describes the main characteristics of the ion beam facility based on a 3.75 MeV Van de Graaff accelerator model KN3750 of HVE at University of Chile. Recent setup improvements on three beam lines available, one dedicated for PIXE analyzes, one designed for RBS-PESA analyzes and a multipurpose vacuum chamber, as well as beam energy calibration experiments of the accelerator will be summarized. Current research activities are focused on the application of the different IBA techniques for the material, biological and environmental analysis. In addition, nuclear activation analysis and the study of nuclear reactions of astrophysical interest has begun to be developed as basic research.

  20. LDA optical setup using holographic imaging configuration

    Science.gov (United States)

    Ghosh, Abhijit; Nirala, A. K.

    2015-11-01

    This paper describes one of the possible ways for improving fringe quality at LDA measuring volume using a holographic imaging configuration consisting of a single hololens. For its comparative study with a conventional imaging configuration, a complete characterization of fringes formed at the measurement volume by both the configuration is presented. Results indicate the qualitative as well as quantitative improvement of the fringes formed at measurement volume by the holographic imaging configuration. Hence it is concluded that use of holographic imaging configuration for making LDA optical setup is a better choice than the conventional one.