ppxscal/embedding_network huggingface dataset:
The Design of Autonomous Mobile Predator and Prey Robots
Authors: Ahmet Bindal, Sean Jit, Allan Simpson
Venue: Proceedings of the Sixth International Conference on Computational Intelligence and Multimedia Applications (2005)

The objective of this manuscript is to implement autonomous, mobile predator and prey robots "stalking" and "fleeing" in an open field, respectively. This work is composed of three major components: algorithm development to produce autonomous predator and prey robot behaviors, architecting a multi-chip embedded system that simultaneously processes video, AM and IR data packets while controlling servo motors for locomotion, and multi-level system testing. Each robot consists of a camera with a co-processor, an IR transmitter (if predator) or receiver (if prey), an AM transmitter/receiver, four proximity sensors, and a microcontroller. The predator camera detects the color of a prey robot and tracks it after the startup. The prey camera sees the attacking predators and configures multiple escape routes during the attack. The IR transmitter creates the sense of "predator scent" for the prey; prey robots flee from the region as soon as they detect predators¿ IR transmission. The AM transmitter/receiver combination establishes the communication link between the predators to capture a prey, and between the preys to synchronize a group motion. The proximity sensors are used for obstacle detection. The microcontroller collects sensory input data and controls the predator and prey robots in the field.
Proceedings of the 20th IEEE/ACM international Conference on Automated software engineering
Venue: Automated Software Engineering (2005)

Welcome to Long Beach and the 20th IEEE/ACM International Conference on Automated Software Engineering. This year the conference is being held in North America in Long Beach, California. In addition to an exciting conference, we hope you enjoy the sunshine and numerous sites and activities available in the area.The Automated Software Engineering (ASE) conference is the major conference concerning the theory and practice of automating the software development process. The conference was formerly known as the "Knowledge-Based Software Engineering" conference (KBSE). The name was changed to "Automated Software Engineering" in 1997. At the same time, the conference was expanded to encourage world-wide participation and a broader set of scientific communities, including those concerned with automation of formal methods, software process, human-computer interaction, requirements engineering, reverse engineering, testing, verification and validation. The conference also continued to include participation of communities emphasizing the use of artificial intelligence and knowledge-based methods in software engineering. The ASE conference series has become a venue in which scientists exchange ideas about foundations, tools, techniques and applications of automated software engineering technology, including brand new technologies as well as reports of experience in applying technologies to practical problems.The papers appearing in these proceedings were subjected to a rigorous and highly selective reviewing process. A total of 291 papers were submitted to the conference. Each paper was reviewed by at least 3 members of the Program Committee. The committee accepted 28 for presentation as talks and publication as full papers, and 35 for presentation as posters and publication as short papers.In addition to the technical papers, the conference includes a doctoral symposium, tool demonstrations and tutorials. Several workshops are also co-located with ASE 2005, including: the Workshop on Software Security Assurance Tools, Techniques, and Metrics (SSATTM), the 3rd International Workshop on Traceability in Emerging Forms of Software Engineering (TEFSE'05); and the Workshop on Software Certificate Management (SoftCeMent'05).
A Quantitative Supplement to the Definition of Software Quality
Authors: Kiumi Akingbehin
Venue: Proceedings of the Third ACIS Int'l Conference on Software Engineering Research, Management and Applications (2005)

This paper proposes a new quantitative definition for software quality. The definition is based on the Taguchi philosophy for assessing and improving the quality of manufacturing processes. The Taguchi approach, originally developed for manufacturing processes, define quality in terms of "loss imparted to society" by a product after delivery of the product to the end user. To facilitate the use of the Taguchi definition, several "loss functions" have been developed. These loss functions allow quality to be quantitatively measured in monetary values (e.g. US dollars). To illustrate the application of the Taguchi definition to a software product, examples that utilize some of the loss functions are presented. The proposed definition of software quality shows good correlation to other popular qualitative and quantitative definitions for software quality.
Host-based detection of worms through peer-to-peer cooperation
Authors: David J. Malan, Michael D. Smith
Venue: Proceedings of the 2005 ACM workshop on Rapid malcode (2005)

We propose a host-based, runtime defense against worms that achieves negligible risk of false positives through peer-to-peer cooperation. We view correlation among otherwise independent peers' behavior as anomalous behavior, indication of a fast-spreading worm. We detect correlation by exploiting worms' temporal consistency, similarity (low temporal variance) in worms' invocations of system calls. We evaluate our ideas on Windows XP with Service Pack 2 using traces of nine variants of worms and twenty-five non-worms, including ten commercial applications and fifteen processes native to the platform. We find that two peers, upon exchanging snapshots of their internal behavior, defined with frequency distributions of system calls, can decide that they are, more likely than not, executing a worm between 76% and 97% of the time. More importantly, we find that the probability that peers might err, judging a non-worm a worm, is negligible.
Simulation and optimization techniques in scheduling farm operations
Authors: E. van Elderen
Venue: ACM SIGSIM Simulation Digest (1978)

Planning a farm concerns the selection of activities, crops and cattle (what to grow), the selection of machinery, tractors, equipment and installations and the scheduling of operations (how to produce). A sequence of operations is needed to achieve the final products or materials; for example, mown alfalfa needs field drying, windrowing, baling and storing. From one material, alfalfa on a field, two others result, bales in the store and a field with aftermath for a next cut or a field needing soil cultivation for growing another crop next year. The operations are performed by gangs consisting of men, tractors and equipment. Only some gangs can operate simultaneously due to the limited number of men, tractors and equipment. There exists a finite set of combinations consisting of the gangs operating simultaneously. The weather influences directly or indirectly the possibility to perform operations by the moisture content of the soil (trafficability) or of the processed material itself, for example, alfalfa hay for baling may not be too wet.
Factors governing the consumption of explicit knowledge
Authors: Kevin C. Desouza, Yukika Awazu, Yun Wan
Venue: Journal of the American Society for Information Science and Technology (2006)

Knowledge management as a field continues to receive resounding interest from scholars. While we have made progress in many areas of knowledge management, we are yet to understand what factors contribute to employee usage of knowledge artifacts. A field study of 175 employees in a software engineering organization was conducted to understand factors that govern consumption of explicit knowledge. We assert that the decision to consume knowledge can be framed as a problem of risk evaluation. Specifically, there are two sources of risk a consumer must evaluate prior to knowledge consumption&mdash;risk from the knowledge producer and risk from the knowledge product. We find support for the factors of perceived complexity, perceived relative advantage, and perceived risk as they relate to intentions to consuming knowledge. &copy; 2006 Wiley Periodicals, Inc.
Technical writing
Authors: Joe Rigo
Venue: ACM SIGDOC Asterisk Journal of Computer Documentation (1982)

This article does nothing to advance the leading edge of system documentation. With luck, however, it may be useful to a few people. 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
On LUT Cascade Realizations of FIR Filters
Authors: Tsutomu Sasao, Yukihiro Iguchi, Takahiro Suzuki
Venue: Proceedings of the 8th Euromicro Conference on Digital System Design (2005)

This paper first defines the n-input q-output WS function, as a mathematical model of the combinational part of the distributed arithmetic of a finite impulse response (FIR) filter. Then, it shows a method to realize theWS function by an LUT cascade with k-input q-output cells. Furthermore, it 1) shows that LUT cascade realizations require much smaller memory than the single ROM realizations; 2) presents new design method for a WS function by arithmetic decomposition, and 3) shows design results of FIR filters using FPGAs with embedded memories.
Sketch Grammars: A Formalism for Describing and Recognizing Diagrammatic Sketch Languages
Authors: Gennaro Costagliola, Vincenzo Deufemia, Michele Risi
Venue: Proceedings of the Eighth International Conference on Document Analysis and Recognition (2005)

Sketch-based user interfaces are increasingly common and are being built for a variety of different disciplines. However, at present the implementation of sketch recognizers is quite time consuming since they are mostly based on specific techniques, as opposed to several other fields such as textual/visual languages and speech recognition, which benefit from the availability of compiler generation techniques and tools. This paper proposes a grammar formalism, namely Sketch Grammars (SkGs), for describing both the shape of the symbols' language and the syntax of sketch languages. Recognizers are automatically generated from the sketch grammar descriptions.
From Intent Reducts for Attribute Implications to Approximate Intent Reducts for Association Rules
Authors: Zhipeng Xie, Zongtian Liu
Venue: Proceedings of the The Fifth International Conference on Computer and Information Technology (2005)

Automatic extraction of data dependencies or regularities from historical data is of great importance in practice. Concept lattice could serve as a common framework for such tasks. To deal with two typical kinds of data dependencies, attribute implications and association rules, this paper presents the de?nitions of intent reducts and approximate intent reducts, as the theoretical foundation for extracting these two kinds of knowledge. Algorithms for calculating them are developed. We also given out the methods for extracting attribute implications and association rules. The results provide a better understanding of attribute implications, association rules, and concept lattices.
Low Cost Object Identification in RFID via Dynamic Markov Chain & Two Time Scale SPSA
Authors: Shweta Singh
Venue: Proceedings of the International Symposium on Applications on Internet Workshops (2006)

The focus of this paper is to reduce the cost of RFID systems when the full blown model of RFID is not cost effective. The question of low cost approach comes into picture when we are more concerned with using this technique as a simple identity information collector, and embedding it into the existing IT system with minimum disruption. Our proposed scheme is an enhanced anti-collision scheme which not only claims but also proves that cost involved in RFID tag collision can be reduced and also the throughput can be increased by adopting the so designed model of communication. The model is basically the combination of slotted aloha and two time scale SPSA. Finally the mathematical results have been obtained by programmatically simulating the above designed model.
Equipping the Reflexion Method with Automated Clustering
Authors: Andreas Christl, Rainer Koschke, Margaret-Anne Storey
Venue: Proceedings of the 12th Working Conference on Reverse Engineering (2005)

A significant aspect in applying the Reflexion Method is the mapping of components found in the source code onto the conceptual components defined in the hypothesized architecture. To date, this mapping is established manually, which requires a lot of work for large software systems. In this paper, we present a new approach, in which clustering techniques are applied to support the user in the mapping activity. The result is a semi-automated mapping technique that accommodates the automatic clustering of the source model with the user's hypothesized knowledge about the system's architecture. This paper describes also a case study in which our semi-automated mapping technique has been applied successfully to extend a partial map of a real-world software application.
Service Registration and Discovery in a Domain-Oriented UDDI Registry
Authors: Jiamao Liu, Ning Gu, Yuwei Zong, Zhigang Ding, Quan Zhang
Venue: Proceedings of the The Fifth International Conference on Computer and Information Technology (2005)

As a part of Web services triangle architecture, UDDI Registry takes on the task of service registration and discovery, which plays an important role in the open, distributed and dynamic Web services environment. However, the current UDDI Registries cannot meet the needs of practical applications. This paper proposes a domain-oriented UDDI Registry architecture and addresses some new concepts such as service property schema, service relationship and service constraint. Compared with other extended UDDI Registries, this architecture can improve the usability and operability of UDDI Registry a great deal, fulfill the requirements of some applications more friendly and thus is very suitable for some specific domains.
Reliable Estimation of Influence Fields for Classification and Tracking in Unreliable Sensor Networks
Authors: Sandip Bapat, Vinodkrishnan Kulathumani, Anish Arora
Venue: Proceedings of the 24th IEEE Symposium on Reliable Distributed Systems (2005)

The influence field of an object, a commonly exploited feature in science and engineering applications, is the region where the object is detectable by a given sensing modality. Being spatially distributed, this feature allows us to tradeoff nodal computation with network communication. By the same token, not only is its calculation subject to nodal failures and false detections, but also to channel fading and channel contention. In this paper, we study how to accurately and efficiently estimate the influence fields of objects in such an unreliable setting and how this reliable estimation of influence fields can be used to classify and track different types of objects. We derive, for node and network fault models, the necessary nodal density for reliably estimating the influence fields so that objects can be classi- fied and tracked. We present four algorithmic techniques: Temporal Aggregation, Probabilistic Reporting, Temporal Segregation and Spatial Reconstruction, to deal with cases where the effective network density differs from this minimum. We provide corroboration of our analysis through field experiments with Mica2 sensor nodes wherever appropriate. Finally, we demonstrate how these results and techniques were applied to achieve reliable and efficient classi- fication and tracking in a fielded system f 90 Mica2 sensor nodes that we called "A Line In The Sand".
Helping Small Companies Assess Software Processes
Authors: Christiane Gresse von Wangenheim, Alessandra Anacleto, Clenio F. Salviano
Venue: IEEE Software (2006)

Developing and applying guidance for ISO/IEC 15504-conformant process assessments in small software companies, the authors enhanced existing assessment methods by considering the organization as a whole. They tailored the assessment to business factors, such as the company's product, revenue, services, and implementation strategies, as well as its process maturity and growth stage.
Generating MPEG-21 BSDL Descriptions Using Context-Related Attributes
Authors: Davy De Schrijver, Wesley De Neve, Koen De Wolf, Rik Van de Walle
Venue: Proceedings of the Seventh IEEE International Symposium on Multimedia (2005)

In order to efficiently deal with the heterogeneity in the current and future multimedia ecosystem, it is necessary that content can be adapted in a format-agnostic manner. A first step toward a solution, able to fulfill the just mentioned requirement, is to rely on a scalable video codec and to describe the high-level structure of the resulting bitstreams in such a way that every terminal can understand it, in particular by using XML. This paper describes how such descriptions can be generated by making use of the media format independent BintoBSD tool of the MPEG-21 BSDL standard. However, regarding the current status of BSDL, it is impossible to create a description in real time and to keep the generation speed constant over the complete sequence. In this paper, we describe a number of extensions and algorithmic modifications that make it possible to generate a description of a bitstream in real time and at a constant speed. Our approach results in a significant reduction of the original execution times (up to 99% for the H.264/AVC coding format) and in a constant memory usage.
Picard---Fuchs Equations and Gauss---Manin Systems with a View Towards the Riemann---Hilbert Problem
Authors: Antoine Douai
Venue: Journal of Dynamical and Control Systems (2005)

We study Abelian integrals associated with a tame polynomial function and their Picard---Fuchs equations using the theory of algebraic Gauss---Manin systems. Especially, we look for a basis of the Petrov module, in which the Picard---Fuchs equations become as simple as possible. As an application, we discuss the related Riemann---Hilbert problem and prove that it has a positive answer under some conditions. In this case, we compute the Jordan normal form of the residue matrices of the corresponding Fuchsian system in terms of local data.
An Integrated ECC and Redundancy Repair Scheme for Memory Reliability Enhancement
Authors: Chin-Lung Su, Yi-Ting Yeh, Cheng-Wen Wu
Venue: Proceedings of the 20th IEEE International Symposium on Defect and Fault Tolerance in VLSI Systems (2005)

With the fast development pace of deep submicron technology, the size and density of semiconductor memory grows rapidly. However, keeping a high level of yield and reliability for memory products is more and more difficult. Both the redundancy repair and ECC techniques have been widely used for enhancing the yield and reliability of memory chips. Specifically, the redundancy repair and ECC techniques are conventionally used to repair or correct the hard faults and soft errors, respectively. In this paper, we propose an integrated ECC and redundancy repair scheme for memory reliability enhancement. Our approach can identify the hard faults and soft errors during the memory normal operation mode, and repair the hard faults during the memory idle time as long as there are unused redundant elements. We also develop a method for evaluating the memory reliability. Experimental results show that the proposed approach is effective, e.g., the MTTF of an 32× 64 memory is improved by 1,412 hours (7.1%) with our integrated ECC and repair scheme.
A Threshold Neuron Model Based on the Processing of Difference Slices
Authors: T. B. Martynyuk
Venue: Cybernetics and Systems Analysis (2005)

A mathematical model of neurons for multilayer neural networks is proposed. An algorithm of parallel summation of numbers stored in a array with the use of the principle of difference slices is considered. The possibility of overlapping of the operations of summation of numbers of an array and comparison of partial sums with an external threshold is shown.
Small bisimulations for reasoning about higher-order imperative programs
Authors: Vasileios Koutavas, Mitchell Wand
Venue: Conference record of the 33rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages (2006)

We introduce a new notion of bisimulation for showing contextual equivalence of expressions in an untyped lambda-calculus with an explicit store, and in which all expressed values, including higher-order values, are storable. Our notion of bisimulation leads to smaller and more tractable relations than does the method of Sumii and Pierce [31]. In particular, our method allows one to write down a bisimulation relation directly in cases where [31] requires an inductive specification, and where the principle of local invariants [22] is inapplicable. Our method can also express examples with higher-order functions, in contrast with the most widely known previous methods [4, 22, 32] which are limited in their ability to deal with such examples. The bisimulation conditions are derived by manually extracting proof obligations from a hypothetical direct proof of contextual equivalence.
A Service-Oriented Framework for Networked Appliances to Achieve Appliance Interoperability and Evolution in Home Network System
Authors: Hiroshi Igaki, Masahide Nakamura, Ken-ichi Matsumoto
Venue: Proceedings of the Eighth International Workshop on Principles of Software Evolution (2005)

In the next-generation home network systems(HNS), interoperability among multi-vendor appliances is a challenging issue to implement value-added integrated services. This paper presents a service-oriented framework to enable both evolution of HNS and the appliance interoperability. The key idea is to construct the integrated services by combining the existing services deployed by the appliances. This allows to eliminate the reference model, which had been an obstacle of the evolution of the HNS.
Adaptive sampling and modeling of analog circuit performance parameters with pseudo-cubic splines
Authors: R. Vemuri, G. Wolfe
Venue: Proceedings of the 2004 IEEE/ACM International conference on Computer-aided design (2004)

Many approaches to analog performance parameter macro modeling have been investigated by the research community. These models are typically derived from discrete data obtained from circuit simulation using numerous input combinations of component sizes for a given circuit topology. The simulations are computationally intensive, therefore it is advantageous to reduce the number of simulations necessary to build an accurate macro model. We present a new algorithm for adaptively sampling multi-dimensional black box functions based on Duchon pseudo-cubic splines. The splines readily and accurately model high dimensional functions based on discrete unstructured data and require no tuning of parameters as seen in many other interpolation methods. The adaptive sampler, in conjunction with pseudo-cubic splines, is used to accurately model various analog performance parameters for an operational amplifier topology using fewer sample points than traditional gridded and quasi-random sampling methodologies.