ppxscal/embedding_network huggingface dataset:
Flexible Workflow Driven Job Shop Manufacturing Execution and Automation Based on Multi Agent System
Authors: Yanli He, Haicheng Yang, Weiping He, Wei Zhang, Xinping He
Venue: Proceedings of the IEEE/WIC/ACM international conference on Intelligent Agent Technology (2006)

Manufacturing automation with adoptability to the changing environment is a competitive advantage for shop floors. This paper presents a flexible workflow enacted job shop manufacturing execution and automation system. The manufacturing process sequence of each part is modeled as an abstract workflow and each manufacturing job resulting in a batch of the part items is recognized as corresponding workflow instance. The production schedule is generated to establish executable workflow instances to be enacted by the workflow engine and executed by the resources in the shop floor. Agent technology is applied to construct the system to take the advantage of distributed system architecture, reactivity, adaptability and cooperation. The proposed system can help to achieve production efficiency without huge investment on industrial automation system. The system architecture and implementation methods are discussed with demonstration and the performance of manufacturing shop floor is enhanced after the application.
Structure and evolution of online social networks
Authors: Ravi Kumar, Jasmine Novak, Andrew Tomkins
Venue: Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining (2006)

In this paper, we consider the evolution of structure within large online social networks. We present a series of measurements of two such networks, together comprising in excess of five million people and ten million friendship links, annotated with metadata capturing the time of every event in the life of the network. Our measurements expose a surprising segmentation of these networks into three regions: singletons who do not participate in the network; isolated communities which overwhelmingly display star structure; and a giant component anchored by a well-connected core region which persists even in the absence of stars.We present a simple model of network growth which captures these aspects of component structure. The model follows our experimental results, characterizing users as either passive members of the network; inviters who encourage offline friends and acquaintances to migrate online; and linkers who fully participate in the social evolution of the network.
Production capacity analysis of a shock absorber assembly line using simulation
Authors: Nikhil S. Gujarathi, Rohit M. Ogale, Tarun Gupta
Venue: Proceedings of the 36th conference on Winter simulation (2004)

This paper reports findings of a study of shock absorber assembly line using computer simulation. The shock absorber assembly line feeds shockers to the motorcycle assembly line. The assembly line simulated in this project is located at an OEM for Bajaj Auto Ltd., the largest producers of scooters and motorcycles in India. In this paper, results of simulation are presented from two scenarios. The first is the original layout of the system. The second simulation is the suggested modifications. Data was gathered and evaluated to determine the necessary parameters to be used. The new demand required the OEM to increase its capacity by 200 shock absorbers per day. After implementing the proposed model the daily output increased by 435 shock absorbers. The highlights of our analysis was that this increase in production rate was achieved without any increase in direct labor, contributing to a gross increase in profit by 32%
A System Structure Design of Government's Information Resource Integration Based on Agent
Authors: Ning Wang, Liming Li, Shengju Han, Xin Ye, Jing Wang
Venue: Proceedings of the 2006 IEEE/WIC/ACM international conference on Web Intelligence and Intelligent Agent Technology (2006)

A new information resource integration system structure is proposed based on the analysis of the former information resource integration method, by adding Agent between business system and data center, and modifying the former mode of data center. After describing data exchange center, data exchange adapter, database, way of data circulating and so on, the design and the realization of the structure are introduced.
Schema update operations preserving the expressive power in XML databases
Authors: Kenji Hashimoto, Yasunori Ishihara, Toru Fujiwara
Venue: Proceedings of the 21st International Conference on Data Engineering Workshops (2005)

This paper proposes schema update operations preserving the expressive power in XML databases. XML documents are modeled as labeled ordered trees and schemas are modeled as regular tree grammars. Under these models, the notion of embeddability between tree languages is defined.We say that a schema G_2 has more expressive power than G_1 if the tree language generated by G_1 is embeddable in that generated by G-2. Then, four update operations on schemas are introduced. It is shown that the operations are sound with respect to preservation of the expressive power. Moreover, it is shown that the operations are also complete for local tree grammars, which correspond to DTDs.
Service-Oriented Security Architecture for CII based on Sensor Networks
Authors: Javier Lopez, Jose Antonio Montenegro, Rodrigo Roman
Venue: Proceedings of the Second International Workshop on Security, Privacy and Trust in Pervasive and Ubiquitous Computing (2006)

The extraordinary growth of the Information Society is originating a high dependency on ICT. This provokes that those strongly interrelated technological infrastructures, as well as the information systems that underpin them, become highly critical, since their disruption would lead to high economical, material and, sometimes, human loss. As a consequence, the protection of these Critical Information Infrastructures is becoming a major objective for governments and companies. In this paper, we give an overview of the main challenges and open research issues on Critical Information Infrastructure security, and introduce an on-going research project that, using wireless sensor networks as an underlying technology, is dealing with those problems. Our research project focuses on the development of protection, control, evaluation, maintenance and verification mechanisms, integrated into a secure service-oriented architecture.
An Energy-Efficient Redundant Nodes Tree Mechanism for Wireless Sensor Networks
Authors: Zhang zhenjiang, Liu yun
Venue: Proceedings of the International Conference on Systems and Networks Communication (2006)

Wireless sensor nodes are tiny and energy limited, so the enhancement of lifetime of sensor networks is an open issues which relates to energy balance and energy saving. In this paper, we propose an energy-efficient redundant nodes tree (EERNT) mechanism in which the redundant nodes in each cluster can be used to relay information to the base-station. The principle is that the redundant nodes relay tree is constructed according to the position of the redundant nodes and all the information received by the cluster heads is sent to the closest redundant node of the EERNT. The selected redundant node transmits the information to the base-station by the relaying of EERNT. Simulation results show that EERNT can improve the lifetime of wireless sensor networks efficiently under the condition that the nodes are distributed comparatively dense and the networks have redundant nodes in most clusters.
CREW: A Gossip-based Flash-Dissemination System
Authors: Mayur Deshpande, Bo Xing, Iosif Lazardis, Bijit Hore, Nalini Venkatasubramanian, Sharad Mehrotra
Venue: Proceedings of the 26th IEEE International Conference on Distributed Computing Systems (2006)

In this paper, we explore a new form of dissemination called Flash Dissemination that involves dissemination of fixed, rich information to a large number of recipients in as short a time as possible. Key characteristics of Flash Dissemination include unpredictability in its need, scalability to large number of recipients and autonomic performance in highly heterogenous and failureprone environments. Previous work either addresses large content delivery in heterogenous networks or fault-tolerant dissemination of (streaming) events. We investigate a peer-based approach using foundations from broadcast networks, gossip theory and random networks. In this paper, we propose CREW (Concurrent Random Expanding Walkers), a scalable, lightweight, and autonomic gossip-based protocol. CREW is also explicitly designed to maximize the speed of dissemination using adaptive and intelligent intra and inter node concurrency. We implemented CREW on top of a scalable middleware environment and compared it to optimized implementations of popular gossip and peer-based systems. Our experiments show that CREW outperforms both traditional gossip and current large content dissemination systems, across a wide range of comparative metrics, even though its design is counterintuitive from a systems perspective.
Genetic algorithm-based performance analysis of self-excited induction generator
Authors: Y. N. Anagreh, I. S. Al-Kofahi
Venue: International Journal of Modelling and Simulation (2006)

This paper presents the implementation of a genetic algorithm to evaluate the performance of a self-excited induction generator under different operating conditions. Unlike with conventional methods of analysis, with the proposed method detailed mathematical derivations for each set of unknown parameters are not required; instead the same equation is optimized irrespective of the unknown parameters. Moreover, accurate selection of initial estimates is not needed. The other important feature of the proposed approach is the possibility of determining more than two unknowns in one solution. The present approach is validated by experimental test results.
ClustDB: A High-Performance Tool for Large Scale Sequence Matching
Authors: Jurgen Kleffe, Friedrich Moller, Burghardt Wittig
Venue: Proceedings of the 17th International Conference on Database and Expert Systems Applications (2006)

High throughput sampling of expressed sequence tags (ESTs) has generated huge collections of transcripts that are difficult to compare with each other using existing tools for sequence matching. The major problem is lack of computer memory. We therefore present a new exact and memory efficient algorithm for the simultaneous identification of matching substrings in large sets of sequences. Its application to more than six million human ESTs in Genbank of date 2005-04-06, counting more than 3.3 billion base pairs, takes less than four hours to find all more than seven million clusters of multiple substrings of at least 50 nucleotides in length, say, by using a standard PC with 2 GB of RAM, 2.8 GHz processor speed. The corresponding program ClustDB is able to handle at least eight times more data than VMATCH, the most memory efficient exact software known today. Our program is freely available for academic use. Contact: juergen.kleffe@charite.
Self-checking instructions: reducing instruction redundancy for concurrent error detection
Authors: Sumeet Kumar, Aneesh Aggarwal
Venue: Proceedings of the 15th international conference on Parallel architectures and compilation techniques (2006)

With reducing feature size, increasing chip capacity, and increasing clock speed, microprocessors are becoming increasingly susceptible to transient (soft) errors. Redundant multi-threading (RMT) is an attractive approach for concurrent error detection. However, redundant thread execution has a significant impact on performance and energy consumption in the chip.In this paper, we propose reducing instruction redundancy (the instructions that are redundantly executed) as a means to mitigate the performance and energy impact of redundancy. In this paper, we experiment with an decoupled RMT approach where the frontend pipeline stages are protected through error codes, while the backend pipeline stages are protected through redundant execution. In this approach, we define two categories of instructions—self-checking and semi self-checking instructions. Self checking instructions are those instructions whose results are checked for any errors when their "main" copies are executed. These instructions are not redundantly executed. Semi self-checking instructions are those instructions for which a major part of their results is checked when the "main" copies are executed, and the remaining part of the instructions is checked using a small amount of additional hardware. Reducing instruction redundancy with this approach has the same fault coverage as the base architecture where all the instructions are redundantly executed. The techniques are evaluated in terms of their performance, power, and vulnerability impact on the RMT processor. Our experiments show that the techniques reduce instruction redundancy by about 58% and recover about 51% of the performance lost due to redundant execution. Our techniques also recover about 40% of the energy consumption increase in the key data-path structures.
Web Resource Monitoring Based on Common Information Model
Authors: Hongyan Mao, Linpeng Huang, Minglu Li
Venue: Proceedings of the 2006 IEEE Asia-Pacific Conference on Services Computing (2006)

The monitoring of resources is a crucial issue for the high-performance of web computing, and the scheduling strategies, the management of resources, and the performance analysis are dependent on the monitoring data. The traditional monitoring solution does not provide a unified and consistent model to the devices, resources and services of heterogeneous environments. In this paper a novel monitoring approach is proposed based on the common information model CIM. CIM defines a basic meta-model, syntax for the description of managed object and hierarchical structure of generic object classes. The monitoring system RMCS is given that integrates and extends the existing monitoring system to gather and retrieve the monitoring information. The CIM-based method addresses the variety and heterogeneity of resources in object-oriented way that the monitoring resource is regarded as a class or object. The RMCS enables administrators and users define a wide variety of resources, customize the monitoring parameters and the display way. The experiments show that this monitoring approach provides the scalable and flexible capabilities, and satisfies the web application requirements.
Comparison Study on SVD-Based Face Classification
Authors: Yong Xu, Yingnan Zhao
Venue: Proceedings of the 2006 International Conference on Intelligent Information Hiding and Multimedia (2006)

In this paper, a novel SVD-based method is developed to classify face images. The experimental results show that the novel method outperforms the existing SVD-based face recognition methods. In addition, we investigate the performances on face recognition of singular values, left and right singular vectors generated from SVD and assess the existing SVD-based face recognition methods. It appears that by compared with singular values and singular vectors, SVD-based reconstruction images are more useful in classifying face images. In practice, through the SVD-based image reconstruction process, we may weaken the side effects on face classification of varying imaging conditions and facial expressions.
A Self-adaptive Ant Colony Algorithm for Phylogenetic Tree Construction
Authors: Jing Guo, Ling Chen, Ling Qin, Chao Wang
Venue: Proceedings of the 2006 International Conference on Hybrid Information Technology - Volume 01 (2006)

To solve the phylogenetic tree construction problem, a new method using adaptive ant colony algorithm based on the equilibrium of the ant distribution is presented. Before the problem is solved by the developed ant colony optimization, the input species were represented using a fully-connected graph built according to the evolutionary distance between each pair of species. The process of constructing a phylogenetic tree uses a pheromone graph. The information weight of the pheromone graph is adaptively updated according to the pheromone left by ants in their seeking process. The algorithm dynamically adjusts the influence of each ant to the trail information updating and the selected probability of the path according to the equilibrium of the ant distribution. The phylogenetic tree constructing method proposed here is tested using some test cases to compare its results with that of the Neighbor-Joining (NJ) programs in the PHYLIP software package and the TSP-Approach. Experimental results show that our algorithm is easier to implement and more efficient.
Identification of biRFSA languages
Authors: Michel Latteux, Aurélien Lemay, Yves Roos, Alain Terlutte
Venue: Theoretical Computer Science (2006)

The task of identifying a language from a set of its words is not an easy one. For instance, it is not feasible to identify regular languages in the general case. Therefore, looking for subclasses of regular languages that can be identified in this framework is an interesting problem. One of the most classical identifiable classes is the class of reversible languages, introduced by D. Angluin, also called bideterministic languages as they can be represented by deterministic automata (DFA) whose reverse is also deterministic. Residual finite state automata (RFSA) on the other hand is a class of non-deterministic automata that shares some properties with DFA. In particular, DFA are RFSA and RFSA can be much smaller. We study here learnability of the class of languages that can be represented by biRFSA: RFSA whose reverse are RFSA. We prove that this class is not identifiable in general but we present two subclasses that are learnable, the second one being identifiable in polynomial time.
On-line 3D surface measurement of iron ore green pellets
Authors: Matthew J. Thurley
Venue: Proceedings of the International Conference on Computational Inteligence for Modelling Control and Automation and International Conference on Intelligent Agents Web Technologies and International Commerce (2006)

Ongoing research into an industrial prototype 3D imaging and analysis system is presented for non-contact measurement of the size of iron ore green pellets on the conveyor belt. The imaging hardware has been installed at a pellet production plant and captures 3D surface data of pellets on the conveyor belt. Segmentation methods based on mathematical morphology are applied to the 3D surface data to identify individual pellets. Pellet sizing based on the segmented 3D surface data has been performed and demonstrates a correlation with pellet sieve size.
Color-Based Signal Light Tracking in Real-Time Video
Authors: Mahipal Reddy Yelal, Sreela Sasi, Glenn R. Shaffer, Ajith K. Kumar
Venue: Proceedings of the IEEE International Conference on Video and Signal Based Surveillance (2006)

Tracking or detecting the position and color of signal lights has an important role in transport industry. Auto detection of signal light colors and their position using computer vision techniques provides or acts as a proof against a fraudulent claim losses. The current technology, such as vehicle mounted recording system, provides event recognition videos and the cause behind an accident. But it does not provide the complete information about color associated with signal lights. The detection of the color of a signal light under different illuminations is a critical issue. In this research, an intelligent method for tracking color of signal lights using La*b* color model combined with contour tracking is proposed. This research finds application in transportation, law enforcement and insurance claims. The system increases the efficiency of the accident investigation process and reduces the economic loss associated with automobile accidents of all types.
Training linear SVMs in linear time
Authors: Thorsten Joachims
Venue: Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining (2006)

Linear Support Vector Machines (SVMs) have become one of the most prominent machine learning techniques for high-dimensional sparse data commonly encountered in applications like text classification, word-sense disambiguation, and drug design. These applications involve a large number of examples n as well as a large number of features N, while each example has only s << N non-zero features. This paper presents a Cutting Plane Algorithm for training linear SVMs that provably has training time 0(s,n) for classification problems and o(sn log (n))for ordinal regression problems. The algorithm is based on an alternative, but equivalent formulation of the SVM optimization problem. Empirically, the Cutting-Plane Algorithm is several orders of magnitude faster than decomposition methods like svm light for large datasets.
Activity in pervasive computing project-based science classrooms
Authors: Jeff Spitulnik, Michele Wisnudel Spitulnik, Elizabeth Finkel
Venue: Proceedings of the 1996 international conference on Learning sciences (1996)

Project-Based Science (PBS) is an educational paradigm supported by recent developments in learning and motivation theory that suggest learning may be facilitated through meaningful and inquiry-oriented activities (Blumenfeld, et al., 1991). Project-based science learning environments produce communities rich with activities that enable students to explore and construct understandings and meanings in science. These socially-situated activities lead to the development of a unique culture with its own set of values, meanings, and practices presumably centered around learning and doing science (Latour & Woolgar, 1979; Lave & Wenger, 1991; Ruopp, 1993). In PBS classrooms, students actively construct their knowledge during projects consisting of: 1) a question or problem that serves to organize and drive activities; 2) a series of products that address the question or problem; 3) students engaging in authentic investigations; 4) communities of students, teachers, and members of society engaging in discourse about the problem as well as collaborating together; and 5) the use of cognitive tools, including portable computers, Internet information and communications, modeling and simulation software, page layout and presentation tools, and hypermedia construction kits.
Active citizenship through technology: collaboration, connection, and civic participation
Authors: Clement Chau, Ashima Mathur, Marina Bers
Venue: Proceedings of the 7th international conference on Learning sciences (2006)

This poster presents results from a workshop, Active Citizenship through Technology, with eighteen college freshmen. Participants collaboratively designed a virtual college campus by researching information online, interviewing faculty and administrators, using graphics programs, and designing a campus with our software Zora. Zora, an Identity Construction Environment, was purposefully created to encourage participants to explore issues of identity, decision-making, and personal values. Results showed that participants engaged in meaningful deliberation about issues related to college life.
Copyright
Venue: Proceedings of the 2004 IEEE International Symposium on Performance Analysis of Systems and Software (2004)

The following topics are dealt with: performance analysis of systems and software; benchmarking and workload characterization; simulation; architecture and performance evaluation; memory and caches; Java; and power estimation and reduction. 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