188 resultados para VENDING MACHINES
Resumo:
Association rule mining is one technique that is widely used when querying databases, especially those that are transactional, in order to obtain useful associations or correlations among sets of items. Much work has been done focusing on efficiency, effectiveness and redundancy. There has also been a focusing on the quality of rules from single level datasets with many interestingness measures proposed. However, with multi-level datasets now being common there is a lack of interestingness measures developed for multi-level and cross-level rules. Single level measures do not take into account the hierarchy found in a multi-level dataset. This leaves the Support-Confidence approach, which does not consider the hierarchy anyway and has other drawbacks, as one of the few measures available. In this chapter we propose two approaches which measure multi-level association rules to help evaluate their interestingness by considering the database’s underlying taxonomy. These measures of diversity and peculiarity can be used to help identify those rules from multi-level datasets that are potentially useful.
Resumo:
This paper presents a new multi-scale place recognition system inspired by the recent discovery of overlapping, multi-scale spatial maps stored in the rodent brain. By training a set of Support Vector Machines to recognize places at varying levels of spatial specificity, we are able to validate spatially specific place recognition hypotheses against broader place recognition hypotheses without sacrificing localization accuracy. We evaluate the system in a range of experiments using cameras mounted on a motorbike and a human in two different environments. At 100% precision, the multiscale approach results in a 56% average improvement in recall rate across both datasets. We analyse the results and then discuss future work that may lead to improvements in both robotic mapping and our understanding of sensory processing and encoding in the mammalian brain.
Resumo:
Invited Lecture for Interdisciplinary seminar, Yale School of Architecture. Seminar investigates architectural techniques of affect; topics included Adrian Stokes, Freud on aggression, Spinoza, German aesthetics, viscerality, Guattari and “concrete machines”; Other Invited guests: Peggy Deamer, Brian Massumi, Gary Genosko, Ernst Prelinger, Elizabeth Grosz, Ed Mitchell.
Resumo:
MapReduce is a computation model for processing large data sets in parallel on large clusters of machines, in a reliable, fault-tolerant manner. A MapReduce computation is broken down into a number of map tasks and reduce tasks, which are performed by so called mappers and reducers, respectively. The placement of the mappers and reducers on the machines directly affects the performance and cost of the MapReduce computation in cloud computing. From the computational point of view, the mappers/reducers placement problem is a generation of the classical bin packing problem, which is NP-complete. Thus, in this paper we propose a new heuristic algorithm for the mappers/reducers placement problem in cloud computing and evaluate it by comparing with other several heuristics on solution quality and computation time by solving a set of test problems with various characteristics. The computational results show that our heuristic algorithm is much more efficient than the other heuristics and it can obtain a better solution in a reasonable time. Furthermore, we verify the effectiveness of our heuristic algorithm by comparing the mapper/reducer placement for a benchmark problem generated by our heuristic algorithm with a conventional mapper/reducer placement which puts a fixed number of mapper/reducer on each machine. The comparison results show that the computation using our mapper/reducer placement is much cheaper than the computation using the conventional placement while still satisfying the computation deadline.
Resumo:
Server consolidation using virtualization technology has become an important technology to improve the energy efficiency of data centers. Virtual machine placement is the key in the server consolidation technology. In the past few years, many approaches to the virtual machine placement have been proposed. However, existing virtual machine placement approaches consider the energy consumption by physical machines only, but do not consider the energy consumption in communication network, in a data center. However, the energy consumption in the communication network in a data center is not trivial, and therefore should be considered in the virtual machine placement. In our preliminary research, we have proposed a genetic algorithm for a new virtual machine placement problem that considers the energy consumption in both physical machines and the communication network in a data center. Aiming at improving the performance and efficiency of the genetic algorithm, this paper presents a hybrid genetic algorithm for the energy-efficient virtual machine placement problem. Experimental results show that the hybrid genetic algorithm significantly outperforms the original genetic algorithm, and that the hybrid genetic algorithm is scalable.
Resumo:
This paper presents a study done into the effectiveness of using local acceleration measurements vs. remote angle measurements in providing stabilising control via SVCs following large disturbances. The system studied was an analogue of the Queensland-New South Wales Interconnection (QNI) and involved the control of an existing Static Var Compensators (SVC) at Sydney West. This study is placed in the context of wide area controls for large systems using aggregated models for groups of machines.
Resumo:
Low speed rotating machines which are the most critical components in drive train of wind turbines are often menaced by several technical and environmental defects. These factors contribute to mount the economic requirement for Health Monitoring and Condition Monitoring of the systems. When a defect is happened in such system result in reduced energy loss rates from related process and due to it Condition Monitoring techniques that detecting energy loss are very difficult if not possible to use. However, in the case of Acoustic Emission (AE) technique this issue is partly overcome and is well suited for detecting very small energy release rates. Acoustic Emission (AE) as a technique is more than 50 years old and in this new technology the sounds associated with the failure of materials were detected. Acoustic wave is a non-stationary signal which can discover elastic stress waves in a failure component, capable of online monitoring, and is very sensitive to the fault diagnosis. In this paper the history and background of discovering and developing AE is discussed, different ages of developing AE which include Age of Enlightenment (1950-1967), Golden Age of AE (1967-1980), Period of Transition (1980-Present). In the next section the application of AE condition monitoring in machinery process and various systems that applied AE technique in their health monitoring is discussed. In the end an experimental result is proposed by QUT test rig which an outer race bearing fault was simulated to depict the sensitivity of AE for detecting incipient faults in low speed high frequency machine.
Resumo:
The work of Gilles Deleuze has influenced an increasing number of music scholars and practicing musicians, particularly those interested in experimental, electronic and popular music. This is despite the notoriously complex nature of his writings, and the specialised theoretical vocabulary that he employs. This thesis both demystifies some of the key terms and concepts of this vocabulary, before demonstrating how Deleuze’s ideas may be put to work in new and fruitful ways; this is achieved with specific reference to the relationships that music has with thought, time and machines. In Chapter 1, Deleuze’s understanding of the power of thought is examined, in particular his approach to communication, transcendence and immanence, and the “powers of thought.” Each of these concepts helps us to understand Deleuze’s work within broad problem of how to think about music immanently: that is, how to maintain that thought and music are both immanent aspects of life and experience. Chapter 2 examines time within a Deleuzian framework, linking his work on cinema with the concept of the “refrain”; both of these areas prove crucial to his understanding of music, as seen in Deleuze’s approach to the work of Varese, Messiaen, and Boulez. In addition, Deleuze’s understanding of time proves fruitful in examining various aspects of music production, as seen in contemporary electronic dance music. Finally, Chapter 3 looks at the concept of the machine, as developed by Deleuze and Guattari, with reference to the sorts of “machinic” connections that a Deleuzian approach encourages us to seek out in music. Once again, examples from contemporary electronic music are presented, in relation to the notions of becoming and subjectivity. Throughout these chapters, Deleuze’s broad understanding of philosophy as the “creation of concepts” is deployed. This means introducing new ideas and specific types of music that encourage creative and novel engagements with the study of music.
Resumo:
The University of Queensland (UQ) has extensive laboratory facilities associated with each course in the undergraduate electrical engineering program. The laboratories include machines and drives, power systems simulation, power electronics and intelligent equipment diagnostics. A number of postgraduate coursework programs are available at UQ and the courses associated with these programs also use laboratories. The machine laboratory is currently being renovated with i-lab style web based experimental facilities, which could be remotely accessed. Senior level courses use independent projects using laboratory facilities and this is found to be very useful to improve students' learning skill. Laboratory experiments are always an integral part of a course. Most of the experiments are conducted in a group of 2-3 students and thesis projects in BE and major projects in ME are always individual works. Assessment is done in-class for the performance and also for the report and analysis.
Resumo:
The placement of the mappers and reducers on the machines directly affects the performance and cost of the MapReduce computation in cloud computing. From the computational point of view, the mappers/reducers placement problem is a generalization of the classical bin packing problem, which is NP-complete. Thus, in this paper we propose a new heuristic algorithm for the mappers/reducers placement problem in cloud computing and evaluate it by comparing with other several heuristics on solution quality and computation time by solving a set of test problems with various characteristics. The computational results show that our heuristic algorithm is much more efficient than the other heuristics. Also, we verify the effectiveness of our heuristic algorithm by comparing the mapper/reducer placement for a benchmark problem generated by our heuristic algorithm with a conventional mapper/reducer placement. The comparison results show that the computation using our mapper/reducer placement is much cheaper while still satisfying the computation deadline.
Resumo:
MapReduce is a computation model for processing large data sets in parallel on large clusters of machines, in a reliable, fault-tolerant manner. A MapReduce computation is broken down into a number of map tasks and reduce tasks, which are performed by so called mappers and reducers, respectively. The placement of the mappers and reducers on the machines directly affects the performance and cost of the MapReduce computation. From the computational point of view, the mappers/reducers placement problem is a generation of the classical bin packing problem, which is NPcomplete. Thus, in this paper we propose a new grouping genetic algorithm for the mappers/reducers placement problem in cloud computing. Compared with the original one, our grouping genetic algorithm uses an innovative coding scheme and also eliminates the inversion operator which is an essential operator in the original grouping genetic algorithm. The new grouping genetic algorithm is evaluated by experiments and the experimental results show that it is much more efficient than four popular algorithms for the problem, including the original grouping genetic algorithm.
Resumo:
Effective machine fault prognostic technologies can lead to elimination of unscheduled downtime and increase machine useful life and consequently lead to reduction of maintenance costs as well as prevention of human casualties in real engineering asset management. This paper presents a technique for accurate assessment of the remnant life of machines based on health state probability estimation technique and historical failure knowledge embedded in the closed loop diagnostic and prognostic system. To estimate a discrete machine degradation state which can represent the complex nature of machine degradation effectively, the proposed prognostic model employed a classification algorithm which can use a number of damage sensitive features compared to conventional time series analysis techniques for accurate long-term prediction. To validate the feasibility of the proposed model, the five different level data of typical four faults from High Pressure Liquefied Natural Gas (HP-LNG) pumps were used for the comparison of intelligent diagnostic test using five different classification algorithms. In addition, two sets of impeller-rub data were analysed and employed to predict the remnant life of pump based on estimation of health state probability using the Support Vector Machine (SVM) classifier. The results obtained were very encouraging and showed that the proposed prognostics system has the potential to be used as an estimation tool for machine remnant life prediction in real life industrial applications.
Resumo:
This study presents an acoustic emission (AE) based fault diagnosis for low speed bearing using multi-class relevance vector machine (RVM). A low speed test rig was developed to simulate the various defects with shaft speeds as low as 10 rpm under several loading conditions. The data was acquired using anAEsensor with the test bearing operating at a constant loading (5 kN) andwith a speed range from20 to 80 rpm. This study is aimed at finding a reliable method/tool for low speed machines fault diagnosis based on AE signal. In the present study, component analysis was performed to extract the bearing feature and to reduce the dimensionality of original data feature. The result shows that multi-class RVM offers a promising approach for fault diagnosis of low speed machines.
Resumo:
Rolling Element Bearings (REBs) are vital components in rotating machineries for providing rotating motion. In slow speed rotating machines, bearings are normally subjected to heavy static loads and a catastrophic failure can cause enormous disruption to production and human safety. Due to its low operating speed the impact energy generated by the rotating elements on the defective components is not sufficient to produce a detectable vibration response. This is further aggravated by the inability of general measuring instruments to detect and process the weak signals at the initiation of the defect accurately. Furthermore, the weak signals are often corrupted by background noise. This is a serious problem faced by maintenance engineers today and the inability to detect an incipient failure of the machine can significantly increases the risk of functional failure and costly downtime. This paper presents the application of noise removal techniques for enhancing the detection capability for slow speed REB condition monitoring. Blind deconvolution (BD) and adaptive line enhancer (ALE) are compared to evaluate their performance in enhancing the source signal with consequential removal of background noise. In the experimental study, incipient defects were seeded on a number of roller bearings and the signals were acquired using acoustic emission (AE) sensor. Kurtosis and modified peak ratio (mPR) were used to determine the detectability of signal corrupted by noise.
Resumo:
This paper presents a novel control strategy for velocity tracking of Permanent Magnet Synchronous Machines (PMSM). The model of the machine is considered within the port-Hamiltonian framework and a control is designed using concepts of immersion and invariance (I&I) recently developed in the literature. The proposed controller ensures internal stability and output regulation, and it forces integral action on non-passive outputs.