ppxscal/embedding_network huggingface dataset:
Combination Diagnosis Based on Genetic Algorithm for Rotating Machinery
Authors: Wei Dou, Zhan-sheng Liu, Dong-hua Wang
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 04 (2007)

This paper presents the combination diagnosis method based on genetic algorithm for rotating machinery according to the limitation that any single fault feature or any single diagnosis method can not achieve the accurate diagnosis result in whole diagnosis state space. This method can effectively use all kinds of different characteristic fault features and diagnosis methods and then bring into play their advantage, so that the accurate rate is improved. This paper combines neural network diagnosis method with artificial immune diagnosis method using genetic algorithm according to different features. Then each diagnosis method displays its advantage in its optimal space. Wavelet Packet "energy" feature and Bispectrum feature are used for training two diagnosis methods. Genetic algorithm is adopted to optimize diagnosis combination weight matrix. The instance diagnosis result of rotating machinery shows that this combination diagnosis method can effectively improve the accurate rate of fault diagnosis and diagnosis system robustness. Moreover, this method can be applied in fault diagnosis for other machinery.
Evolution of neural networks for classification and regression
Authors: Miguel Rocha, Paulo Cortez, José Neves
Venue: Neurocomputing (2007)

Although Artificial Neural Networks (ANNs) are important data mining techniques, the search for the optimal ANN is a challenging task: the ANN should learn the input-output mapping without overfitting the data and training algorithms may get trapped in local minima. The use of Evolutionary Computation (EC) is a promising alternative for ANN optimization. This work presents two hybrid EC/ANN algorithms: the first evolves neural topologies while the latter performs simultaneous optimization of architectures and weights. Sixteen real-world tasks were used to test these strategies. Competitive results were achieved when compared with a heuristic model selection and other Data Mining algorithms.
Temperature-Aware Compilation for VLIWProcessors
Authors: Benjamin Carrion Schafer, Yongho Lee, Taewhan Kim
Venue: Proceedings of the 13th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (2007)

Very Long Instruction Word Processors (VLIW) allow to execute multiple instructions in parallel. At the same time VLIWcompilers optimize the source code for maximum performance by grouping as many instructions in parallel as possible. This work addresses the problem of thermal- awareness in VLIW compilers with a temperature control and reduction techniques with an objective of minimizing the peak temperature in the VLIW processor's functional units. We present a main approach and compare it with a technique that inserts NOPs in the assembly code to allow the hottest units to cool down. The main technique, called temperature-aware instruction binding technique TempIB, effectively binds the instructions executed in parallel to the coolest possible functional units for a given fixed schedule. It generates, for each instruction in a scheduled instruction word, a priority queue of the coolest functional units that can execute the instruction, and rebinds it to the coolest possible unit, considering the temperature as well as the power consumed by the instruction. From experimentation using a set of benchmark designs, it is confirmed that our temperature reduction technique is effective, lowering down the peak temperature of the initial design by up to 13.82% by TempIB.
Performance Evaluation
Authors: R. R. Shirley
Venue: Computer (1972)

The Performance Evaluation Subcommittee of the Technical Committee on Computer Architecture sponsored a workshop at Argonne National Laboratories in October 1971. This issue is in part a result of that workshop. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Application Briefs
Authors: E. S. Joline
Venue: IEEE Computer Graphics and Applications (1981)

Traffic congestion is a major factor in the deterioration of our downtown urban areas, contributing to the migration of residents and shoppers to the suburbs and the relocation of businesses to more accessible locations. The US Department of Transportation has identified automated guideway transit systems, particularly shuttle-loop systems, as a research and development area that has great potential for solving circulation problems in high-density areas. To develop and evaluate this technology, the Urban Mass Transportation Administration is going forward with a number of programs, such as the Downtown People Mover project. UMTA is providing technical assistance in the implementation of DPMs in several cities, to demonstrate the benefits of such systems. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Semantic Interoperability Between Relational Database Systems
Authors: Quang Trinh, Ken Barker, Reda Alhajj
Venue: Proceedings of the 11th International Database Engineering and Applications Symposium (2007)

Relational DataBase Systems (RDBSs) are well-known and widely used in many organizations, however, semantic conflicts between the participating RDBSs must be resolved before data can be exchanged between them. Semantic resolution between the RDBSs is extremely difficult to address mainly because participating RDBSs are designed and built independently. Furthermore, individual RDBSs are likely to evolve over time and the changes must be reconciled dynamically. In this paper, we describe an approach to resolve the semantic conflicts between RDBSs automatically while allowing the individual RDBSs to evolve. Relational DataBase Ontology (RDBO) is created and used to ensure the semantic descriptions of the individual RDBSs are conformed to a set of vocabularies, structures, and restrictions. We show how a modified reasoning engine is used to validate and infer additional semantic relationships from the existing relationships. We also show how terms defined in different database ontologies are compared to each other semantically using semantic weights and our modified reasoning engine. As a result, RDBSs can interoperate with each other seamlessly and at the correct level of semantics defined in their ontologies.
WSNet -- WineCellar An Evolutionary Wireless Sensor Network to Monitor Wine-Cellars
Authors: Nuno Costa, Filipa Ferreira, Nelia Santos, Antonio Pereira
Venue: Proceedings of the Second International Conference on Systems and Networks Communications (2007)

In the last years various practical appliances of sensor networks have been emerged. Most of them are focused on environmental data gathering. This paper presents a practical and evolutionary wireless sensor network project used to (but not specific to) monitor wine-cellars. This project will be developed and deployed based on incremental prototypes. These prototypes constitute the different steps to reach the final system. Using this type of approach, our team aims to get two distinct objectives: on the one hand to get the final system ready to be used to monitor environmental characteristics of wine-cellars, during the aging phase of the wine, but on the other hand to collect information about the different techniques and methods to get the job of environmental data gathering done. The purpose of this second objective is to compare, evaluate and propose enhancements to the existing data gathering techniques and probably to propose new efficient and robust methods. In this paper we present the first prototype (or the first step) of the WSNet-WineCellar project. In this primary prototype we are experimenting and evaluate the existing "off the shelf" software and hardware to develop data gathering applications in wireless sensor networks.
Analysis of Regularized Least Square Algorithms with Beta-Mixing Input Sequences
Authors: Luoqing Li, Bin Zou
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 01 (2007)

The generalization performance is the important property of learning machines. It has been shown previously by Vapnik, Cucker and Smale, et.al. that, the empirical risks of learning machines based on an i.i.d. sequence must uniformly converge to their expected risks as the number of samples approaches infinity. This paper considers regularization schemes associated with the least square loss and reproducing kernel Hilbert spaces. It develops a theoretical analysis of generalization performances of regularized least squares on reproducing kernel Hilbert spaces for supervised learning with beta-mixing input sequences.
DISSECT A Symbolic Evaluation and Program Testing System
Authors: W. E. Howden
Venue: IEEE Transactions on Software Engineering (1978)

The basic features of the DISSECT symbolic testing tool are described. Usage procedures are outlined and the special advantages of the tool are summarized. Cost estimates for using the tool are provided and the results of experiments to determine its effectiveness are included. The background and history of the development of the tool are outlined. The availability of the tool is described and a listing of reference materials is included.
The application of clustering analysis for the critical areas on TFT-LCD panel
Authors: Kun-Lin Hsieh
Venue: Expert Systems with Applications: An International Journal (2008)

For thin film transistor-liquid crystal displays (TFT-LCD) factories in Taiwan, yield performance had become as an important competitiveness determinant during the competitive environment. As we known, the market for LCDs has grown at over 20% on average per annum and the downward pricing trend had also promoted LCD applications. However, only few studies were proposed to address the related issues for process analysis in TFT-LCD industry from the viewpoint of systems. Particularly, the defect status (i.e. abnormal position) on TFT-LCD panel may represent the clustering effect when there are many defect counts on it. Hence, performing the clustering analysis for those abnormal positions will be an important issue to be addressed in TFT-LCD process. In this study, we will propose an approach incorporating fuzzy adaptive resonance theory (Fuzzy ART) and stepwise regression techniques to achieve such process analysis. Besides, an illustrative case owing to TFT-LCD manufacturer at Tainan Science Park in Taiwan will be applied to verifying the rationality and feasibility of our proposed procedure.
BddCut: Towards Scalable Symbolic Cut Enumeration
Authors: Andrew C. Ling, Jianwen Zhu, Stephen D. Brown
Venue: Proceedings of the 2007 Asia and South Pacific Design Automation Conference (2007)

While the covering algorithm has been perfected recently by the iterative approaches, such as DAOmap and IMap, its application has been limited to technology mapping. The main factor preventing the covering problem's migration to other logic transformations, such as elimination and resynthesis region identification found in SIS and FBDD, is the exponential number of alternative cuts that have to be evaluated. Traditional methods of cut generation do not scale beyond a cut size of 6. In this paper, a symbolic method that can enumerate all cuts is proposed without any pruning, up to a cut size of 10. We show that it can outperform traditional methods by an order of magnitude and, as a result, scales to 100K gate benchmarks. As a practical driver, the covering problem applied to elimination is shown where it can not only produce competitive area, but also provide more than 6x average runtime reduction of the total runtime in FBDD, a BDD based logic synthesis tool with a reported order of magnitude faster runtime than SIS and commercial tools with negligible impact on area.
A New Approach for Multi-device User Interface Design
Authors: Xudong Lu, Jiancheng Wan, Lei Lu
Venue: Proceedings of the 2007 IFIP International Conference on Network and Parallel Computing Workshops (2007)

A large number of heterogeneous and computing devices, such as PCs, PDAs, and cell phones, nowadays are used to access the same information. Currently, designers designing such multi-device user interfaces have to design a UI separately for each device, which is a time consuming and error prone activity. This paper discusses our approach to the multi-device interface development. We describe how abstract UI descriptions with FMP model. We also discuss how get adaptive presentational models for various devices with UI templates and UI design patterns help. Lastly, with code generate tool help, concrete user interfaces are generated.
A Game-Theoretic Framework for Bandwidth Attacks and Statistical Defenses
Authors: Mark E. Snyder, Ravi Sundaram, Mayur Thakur
Venue: Proceedings of the 32nd IEEE Conference on Local Computer Networks (2007)

We introduce a game-theoretic framework for reasoning about bandwidth attacks, a common form of distributed denial of service (DDoS) attacks. In particular, our traffic injection game models the attacker as a rational but limited-resource entity who uses limited knowledge of traffic patterns to launch IP spoofing based bandwidth attacks on a server. We model the defender as a coarse-grained, relative volume based statistical filter. We analyze the effectiveness of the defender against the attacker by analyzing the payoffs of various strategies in the traffic injection game. Furthermore, we analyze how these payoffs change in the presence of random noise. Our results show that there is potential for using statistical methods for creating defense mechanisms that can detect a DDoS attack and that even when an attacker has a priori knowledge of the expected traffic volume for the dimension and divisions employed in the attack, the attack traffic can still be exposed to the defender.
Workshop Report: The New and the Not So New
Authors: M. F. Slana
Venue: Computer (1978)

Memory updating was one theme of the sixth annual workshop of the IEEE Computer Society's Technical Committee on Computer Elements, held last June in Vail, Colorado. As is traditional with many Computer Society workshops, this report is a collection of unattributed comments from individual workshop attendees whose anonymity was preserved in order to encourage a candid exchange of points of view.
Test Data Generation from UML State Machine Diagrams using GAs
Authors: Chartchai Doungsa-ard, Keshav Dahal, Alamgir Hossain, Taratip Suwannasart
Venue: Proceedings of the International Conference on Software Engineering Advances (2007)

Automatic test data generation helps testers to validate software against user requirements more easily. Test data can be generated from many sources; for example, experience of testers, source program, or software specification. Selecting a proper test data set is a decision making task. Testers have to decide what test data that they should use, and a heuristic technique is needed to solve this problem automatically. In this paper, we propose a framework for generating test data from software specifications. The selected specification is Unified Modeling Language (UML) state machine diagram. UML state machine diagram describes a system in term of state which can be changed when there is an action occurring in the system. The generated test data is a sequence of these actions. These sequences of action help testers to know how they should test the system. The quality of generated test data is measured by the number of transitions which is fired using the test data. The more transitions test data can fire, the better quality of test data is. The number of coverage transitions is also used as a feedback for a heuristic search for a better test set. Genetic algorithms (GAs) are selected for searching the best test data. Our experimental results show that the proposed GA-based approach can work well for generating test data for some types of UML state machine diagrams. Keywords- Test data generation, UML state machine diagram, Genetic algorithm.
SIP-based Group Service Improvement in CDMA2000 Network
Authors: Peng Yang, Hui Deng, Yuanchen Ma, Satoshi Yoshizawa
Venue: Proceedings of the The 2007 International Conference on Next Generation Mobile Applications, Services and Technologies (2007)

SIP-based multi-party conference service (MPCS) of IETF is adopted by 3GPP2 as conferencing solution. In MPCS, the service content received by multiple participants is the same. So, it is better to use multicast to support MPCS in 3G network, where air resources are limited. In 3GPP2, broadcast multicast service (BCMCS) is standardized allowing optimization of air resources for delivery of uniform content to multiple access terminals in CDMA2000 communication system. In this paper, a new solution is proposed, wherein service mapping is set up between BCMCS and MPCS in CDMA2000 network. By utilizing BCMCS, the radio and access network's resources of the CDMA systems could be saved for MPCS.
Using Cluster Similarity to Detect Natural Cluster Hierarchies
Authors: GuangHui Yan, ZhanHuai Li
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 02 (2007)

Clustering is the process of partitioning a set of patterns into disjoint and homogeneous meaningful groups (clusters) among which there exist more or less similarities and hi- erarchies. Accordingly, customer will have difficult to in- terpret and describe these large amounts of initial cluster results and hierarchies among them. Therefore, it is very valuable to analyze these similarities and construct hier- archy structures of the cluster results based on the sim- ilarities. The statistical cluster methods, the grid-based and density-based cluster methods and the model-based cluster algorithms are unfit for this post-processing cluster problem. Furthermore, this problem becomes more intri- cate in data stream environment for the constraint of single scan of stream data and the need of incremental cluster- ing. Based on multifractal theory, the Fractal-based Clus- ter Hierarchy Optimization (FCHO) algorithm is proposed, which integrate the cluster similarity with the cluster shape and the cluster distribution to construct cluster hierarchy tree from the disjoint initial clusters. The algorithm pro- posed is easy to realize, simple to understand and parame- ter self-adaptive. The elementary time-space complexity is presented and the experimental results using synthetic and real life data set show the performance and the effectivity of FCHO algorithm.
How can we overcome both side channel analysis and fault attacks on RSA-CRT?
Authors: Chong Hee Kim, Jean-Jacques Quisquater
Venue: Proceedings of the Workshop on Fault Diagnosis and Tolerance in Cryptography (2007)

RSA cryptosystem is one of the most widely used algorithms nowadays. However when it is implemented in embedded devices such as smart cards, it can be vulnerable to power analysis attacks and fault attacks. To defeat all known side channel attacks and fault attacks, several countermeasures should be used together. However due to the low computation capability of the embedded devices, we have to find the best solution or combination among countermeasures. Furthermore, we should be careful since a countermeasure may produce another new vulnerability such as Yen et. al.'s safe-error attack in a simple power analysis (SPA) countermeasure. In 2005, Giraud proposed a scheme secure against simple power analysis as well as fault attack (FA). Afterwards, Fumaroli and Vigilant proposed an exponentiation algorithm secure against differential power analysis (DPA) as well as simple power analysis and fault attack with almost 1.5 times increase in time complexity compared to Giraud's. To the authors' best knowledge, it was a first trial to prevent SPA, DPA, and FA simultaneously on exponentiation with one solution. In this paper we show Fumaroli and Vigilant's scheme can be broken by fault attacks and propose a direction to construct efficient countermeasures secure against all known side channel analyses and fault attacks on RSA-CRT with low time complexity.
Audio feature interactions in Voice-over-IP
Authors: Pamela Zave
Venue: Proceedings of the 1st international conference on Principles, systems and applications of IP telecommunications (2007)

In telecommunications, audio signaling is the use of the audio channel for signaling and user-interface purposes. When features use audio signaling, and are assembled in a pipes-and-filters configuration, there is a potential for undesirable feature interactions. This paper analyzes the potential feature interactions. It proposes a method for eliminating some of them, as well as directions for future work on the remaining interactions. The method can be implemented in SIP, using compositional patterns of signaling that will work correctly regardless of how many features are active.
Interactions due to body forces in generalized thermo-elasticity III
Authors: S. K. Roychoudhuri, Nupur Bandyopadhyay
Venue: Computers Mathematics with Applications (2007)

The generalized thermo-elasticity theory III is employed to study thermo-elastic interactions in a homogeneous isotropic unbounded solid due to distributed continuous and instantaneous body forces. The solutions are derived by using a Laplace transform on time and then a Fourier transform on space. It is found that the interactions consist of a wave part traveling with the speed of the dilatational wave and a diffusive part. For continuous body forces, both temperature and deformation are continuous at the elastic dilatational wave front, while the stress suffers finite discontinuity at this location. For instantaneous body forces, both deformation and temperature suffer finite discontinuities at the elastic wave front, while stress exhibits delta function discontinuity resulting from the Dirac delta function at this location. All the fields suffer exponential attenuation at the elastic wave front and the attenuation is influenced by thermo-elastic coupling and thermal diffusivity of the medium. The results achieved in the present analysis are compared to those obtained by using generalized thermo-elasticity theory II without energy dissipation and other generalized theories. Lastly, numerical results applicable to a copper-like material are presented in order to illustrate the analytical result.
On Generating Multipliers for a Cellular Fast Fourier Transform Processor
Authors: W. R. Cyre
Venue: IEEE Transactions on Computers (1972)

One possible hardware implementation for the fast Fourier transform (FFT) of 2m samples is to have 2m-1 cells, each of which performs two of the necessary computations during each of the m passes through the processor. But in each of these m passes, each of the 2m-1cells may require a different multiplier coefficient for its computations. The two most obvious solutions are costly. The m
Constrained curve drawing using trigonometric splines having shape parameters
Authors: N. Choubey, A. Ojha
Venue: Computer-Aided Design (2007)

The problem of drawing a smooth obstacle avoiding curve has attracted the attention of many people working in the area of CAD/CAM and its applications. In the present paper we propose a method of constrained curve drawing using certain C^1-quadratic trigonometric splines having shape parameters, which have been recently introduced in [Han X. Quadratic trigonometric polynomial curves with a shape parameter. Computer Aided Geometric Design 2002;19:503-12]. Besides this, we have also presented a simpler approach for studying the approximation properties of the trigonometric spline curves.