ppxscal/embedding_network huggingface dataset:
A Binding Framework Using the Dynamic Component Exchange Technique for Heterogeneous Services
Authors: Gwyduk Yeom, Jeonggeum Lee, Choong Kyo Jeong, Youngkon Lee
Venue: Proceedings of the 5th ACIS International Conference on Software Engineering Research, Management & Applications (2007)

In this work, we present a component based dynamic services binding that supports making devices into services and integration of standard services. We have also implemented our framework on a small device equipped on a robot and demonstrated various interactions between our system and other services or devices. This framework defines and implements standardized interfaces to support various standard service platforms in a way that service platforms can be added or removed dynamically at runtime using the component exchange technique. Our work develops low-level device capabilities into public services that are readily integrated into existing high-level services.
Component-Based Hardware/Software Co-Simulation
Authors: Ping Hang Cheung, Kecheng Hao, Fei Xie
Venue: Proceedings of the 10th Euromicro Conference on Digital System Design Architectures, Methods and Tools (2007)

Developing highly efficient and reliable embedded systems demands hardware/software (HW/SW) co-design and, therefore, co-simulation. In order to be highly configurable, embedded systems are increasingly component-based in both hardware and software. In this paper, we present a novel approach to hardware/software co-simulation of component-based embedded systems. Our approach features a component model which unifies hardware and software component models with the concept of bridge component. Bridge components raise the level of abstraction for designing HW/SW interfaces. Their specifications are used to configure the co-simulators. Our approach has been applied to co-simulation of sensor system instances included in the TinyOS distribution. The case studies have demonstrated that our approach is readily applicable to real-world embedded systems and reduces co-simulation complexities.
Annotated Databases for the Recognition of Screen-Rendered Text
Authors: S. Wachenfeld, H.-U. Klein, X. Jiang
Venue: Proceedings of the Ninth International Conference on Document Analysis and Recognition - Volume 01 (2007)

The recognition of screen-rendered text is a novel task. It is performed e.g. by translation tools which allow users to click on any text on the screen and give a translation. Also some commercial OCR programs start to address the prob- lem of reading screenshots. Optical character recognition on screen-shot images can be very challenging due to very small and smoothed fonts. In order to build and compare recognition approaches for screen-rendered text, the avail- ability of standard databases is a fundamental prerequisite. In this paper two freely available databases are presented, one that consists of annotated screenshot images of 28 080 single characters and another holding 400 words extracted from documents plus 2 400 generated isolated words. Both databases include meta-information such as x-height, font type, style and rendering conditions. At the example of a de- veloped recognition system, it is shown how these databases can serve for training, testing and optimization.
An Evaluation of Slicing Algorithms for Concurrent Programs
Authors: Dennis Giffhorn, Christian Hammer
Venue: Proceedings of the Seventh IEEE International Working Conference on Source Code Analysis and Manipulation (2007)

Program slicing is a program-reduction technique for extracting statements that may influence other statements. While there exist efficient algorithms to slice sequential programs precisely, there are only two algorithms for precise slicing of concurrent interprocedural programs with recursive procedures. We implemented both algorithms for Java, applied several new optimizations and examined their precision and runtime behavior. We compared these results with two further algorithms which trade precision for speed. We show that one algorithm may produce incorrect slices and that precise slicing of concurrent programs is very expensive in terms of computation time.
A Method for Finding Implicating Rules Based on the Genetic Algorithm
Authors: Zhou Jun, Li Shu-you, Mei Hong-yan, Liu Hai-xia
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 03 (2007)

In information system, some rules have implicating relations (called implicating rules), but some rules have not. An approach of finding implicating rules based on the genetic algorithm is proposed. Some properties of independence and correlation of descriptions are discussed. It can obtain directly the implicating rules (including the positive and negative rules) with the correlation of two descriptions according to strength of implication defined in this paper. At the same time, an algorithm for finding optimized rules based on genetic algorithm is presented. By it, the problem of efficiency of finding rules is solved. At last, the efficiency and practicability of the method are illustrated by the experiment results.
Model, Design, and Evaluation of a Compiler for a Parallel Processing Environment
Authors: J. -L. Baer
Venue: IEEE Transactions on Software Engineering (1977)

The problem of designing compilers for a multiprocessing environment is approached. We show that by modeling an existing sequential compiler, we gain an understanding of the modifications necessary to transform the sequential structure into a pipeline of processes. The pipelined compiler is then evaluated through measurements and simulation. Properties of the model, a generalized Petri Net, are also discussed.
Parameterized Models for Facial Animation
Authors: F. I. Parke
Venue: IEEE Computer Graphics and Applications (1982)

Parameterized models can produce realistic, manipulable images of human faces with a surprisingly small number of parameters.
The Harmonious Evolution of Ethnic Group Algorithm
Authors: Hao Chen, Du-Wu Cui, Xue Li, Zhan-Min Wang
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 04 (2007)

Enlightened by organization and generation mode of human society, the ethnic group evolution algorithm (EGEA), whose population is formed of several ethnic groups, is proposed. The ethnic groups, classified by the behavioral similarity of elite individuals, represent the possible evolution trends in population, while the matrimony operator is used to control the competition and generation process of ethnic group and promote schema exchange among ethnic groups that ensure the inheritance and development of ethnic group as well as keep the diversity and validity of population and improve the search efficiency of EGEA. The simulation tests of function optimization show that the EGEA can restrain premature convergence phenomenon effectively during the evolutionary process while increasing the convergence speed greatly.
A Cross-Layer Design for End-to-End On-Demand Bandwidth Allocation in Infrastructure Wireless Mesh Network
Authors: Hong Lu, Steve Liu, Anxiao (Andrew) Jiang
Venue: Proceedings of the International Conference on Wireless Algorithms,Systems and Applications (2007)

Wireless mesh networks have gained significant academic and industry attentions in the recent years. Supporting quality of service in wireless mesh networks is a n important and challenging task which involves both medium access control and network layer design. I n this paper, we investigate the problem of end-to-end on-demand bandwidth allocation in infrastructure wireless mesh networks. We formulate it as a combinatorial optimization problem, and prove that it is NPhard. We present a polynomial time 2-approximation algorithm, MCRS(minimum consumption routing and scheduling), based o n the concepts of consumption level for routing and bottom set for scheduling. Comprehensive simulation results show that MCRS achieves better performance than traditional methods based o n minimum hop routing.
Support for Distributed Transactions in the TABS Prototype
Authors: A. Z. Spector
Venue: IEEE Transactions on Software Engineering (1985)

The TABS prototype is an experimental facility that provides operating system-level support for distributed transactions that operate on shared abstract types. The facility is designed to simplify the construction of highly available and reliable distributed applications. This paper describes the TABS system model, the TABS prototype's structure, and certain aspects of its operation. The paper concludes with a discussion of the status of the project and a preliminary evaluation.
A methodology for ERP misfit analysis
Authors: Jen-Her Wu, Shin-Shing Shin, Michael S. H. Heng
Venue: Information and Management (2007)

Commercial off-the-shelf ERP systems have been adopted by many large companies to support their inter- and intra-business processes. Midsize market firms are now also investing their use. However, research has indicated that about three quarters of attempted ERP projects are unsuccessful: a common problem encountered in adopting ERP software has been the issue of fit or alignment. This paper presents an ERP selection methodology, grounded in task-technology fits theory, for measuring, at a high-level, the misfit between ERP candidates and the enterprise's requirements ex-ante implementation. With this approach, organizations can more easily and systematically determine the locations of possible misfit and their degree of importance, thereby understanding the risk in their implementing an ERP. Our research thus contributes practical solutions to the problem of misfit analysis and ERP package selection.
Device and architecture concurrent optimization for FPGA transient soft error rate
Authors: Yan Lin, Lei He
Venue: Proceedings of the 2007 IEEE/ACM international conference on Computer-aided design (2007)

Late CMOS scaling reduces device reliability, and existing work has studied the permanent SER (soft error rate) for configuration memory in FPGA extensively. In this paper, we show that continuous CMOS scaling dramatically increases the significance of FPGA chip-level transient soft errors in circuit elements other than configuration memory, and transient SER can no longer be ignored. We then develop an efficient, yet accurate, transient SER evaluation method, called trace based methodology, considering logic, electrical and latch-window maskings. By collecting traces on logic probability and sensitivity and re-using these traces for different device settings, we finally perform device and architecture concurrent optimization considering hundreds of device and architecture combinations. Compared to the commonly used FPGA architecture and device settings, device and architecture concurrent optimization can reduce the transient SER by 2.8X and reduce the product of energy, delay and transient SER by 1.8X.
A Case-Based Reasoning Approach for Invoice Structure Extraction
Authors: H. Hamza, Y. Belaid, A. Belaid
Venue: Proceedings of the Ninth International Conference on Document Analysis and Recognition - Volume 01 (2007)

This paper shows the use of case-based reasoning (CBR) for invoice structure extraction and analysis. This method, called CBR-DIA (CBR for Document Invoice Analysis), is adaptive and does not need any previous training. It analyses a document by retrieving and analysing similar documents or elements of documents (cases) stored in a database. The retrieval step is performed thanks to graph comparison techniques like graph probing and edit dis- tance. The analysis step is done thanks to the information found in the nearest retrieved cases. Applied on 950 in- voices, CBR-DIA reaches a recognition rate of 85.29% for documents of known classes and 76.33% for documents of unknown classes.
Pallino: automation to support regression test selection for cots-based applications
Authors: Jiang Zheng, Laurie Williams, Brian Robinson
Venue: Proceedings of the twenty-second IEEE/ACM international conference on Automated software engineering (2007)

Software products are often built from commercial-off-the-shelf (COTS) components. When new releases of these components are made available for integration and testing, source code is usually not provided by the vendors. Various regression test selection techniques have been developed and have been shown to be cost effective. However, the majority of these test selection techniques rely on source code for change identification and impact analysis. In our research, we have evolved a regression test selection (RTS) process called Integrated - Black-box Approach for Component Change Identification (I-BACCI) for COTS-based applications. I-BACCI reduces the test suite based upon changes in the binary code of the COTS component using the firewall regression test selection method. In this paper, we present the Pallino tool. Pallino statically analyzes binary code to identify the code change and the impact of these changes. Based on the output of Pallino and the original test suit, testers can determine the regression test cases needed to cover the application glue code which is affected by the changed areas in the new version of the COTS component. Three case studies, examining a total of fifteen component releases, were conducted on ABB internal products. With the help of Pallino, RTS via the I-BACCI process can be completed in about one to two person hours for each release of the case studies. The total size of application and component for each release is about 340 830 KLOC. Pallino is extensible and can be modified to support other RTS methods for COTS components. Currently, Pallino works on components in Common Object File Format or Portable Executable formats
A Tool for Enterprise Architecture Analysis
Authors: Pontus Johnson, Erik Johansson, Teodor Sommestad, Johan Ullberg
Venue: Proceedings of the 11th IEEE International Enterprise Distributed Object Computing Conference (2007)

The discipline of enterprise architecture advocates the use of models to support decision-making on enterprise-wide information system issues. In order to provide such support, enterprise architecture models should be amenable to analyses of various properties, as e.g. the availability, performance, interoperability, modifiability, and information security of the modeled enterprise information systems. This paper presents a software tool for such analyses. The tool guides the user in the generation of enterprise architecture models and subjects these models to analyses resulting in quantitative measures of the chosen quality attribute. The paper describes and exemplifies both the architecture and the usage of the tool.
Enhancements and Ontological Use of ISO-10303 (STEP) to Support the Exchange of Parameterised Product Data Models
Authors: Franz Maier, Markus Stumptner
Venue: Proceedings of the Seventh International Conference on Intelligent Systems Design and Applications (2007)

The ISO-10303 standard, called STEP, originated in 1984 and published in 1994, has been adopted by many in- dustries including shipbuilding, aerospace and automotive. This paper throws new light on the well established stan- dard by investigating the suitability of STEP to support the exchange of parameterised models between CAD systems. The paper points out how design intent, i.e. parameters, constraints and constructional history of a model, can be transferred to another system and it explains why the new enhancements of STEP which were published recently are able to ease the migration of a STEP-based model. The implications of these enhancements on the integration of the automotive design environment are outlined shortly and provide a showcase of these refinements. 1
Providing voice connectivity to rural India using WiMAX: issues and solution
Authors: Abhijit Lele, Mayank Raj, Debabrata Das
Venue: Proceedings of the 2007 workshop on Networked systems for developing regions (2007)

The need of emerging markets telecom, specifically in the Indian telecom scenario, WiMAX is being looked as a broadband access solution ahead of LTE and other competing technologies due its long range and high bandwidth. Voice Over IP (VoIP) will potentially be the killer application for emerging market like India. In this paper we propose a Kiosk based WiMAX infrastructure model to provide voice connectivity to rural Indian villages. In the proposed kiosk model, plain old telephones are connected to a WiMAX subscriber station using Foreign Exchange Subscriber and a Media Gateway. The novelty of the kiosk based infrastructure models is that it has low deployment cost from a service provider perspective, and almost negligible equipment cost for the end user. In order to make the kiosk based model economically sustainable, the number of simultaneous voice calls that can be supported over the WiMAX subscriber stations needs to be maximized. To this end, the paper proposes a Dynamic Frame Profile algorithm to maximize the number of VoIP calls supported over a single subscriber station. A performance evaluation of the the proposed Dynamic Frame Profile algorithm is also carried out to study its effectiveness and reported in this paper.
Using CAD Tools in the Design of CRISP
Authors: David Ditzel, Alan Berenbaum
Venue: IEEE Design Test (1987)

CRISP is a high-performance 32-bit RISC microprocessor that uses 172,163 transistors in a 1.75?m CMOS technology. The largechip size of 10.35 mmx 12.23 mm and complexity of the design required an extensive top-down approach in a set of integrateddesign tools. CAD tools ranged from an instruction set interpreter to detailed timing simulation. Practical problems encounteredinclude communication among different tools and limits on process size, file size, and total compute time. Use of both symboliccompaction and physical layout, while improving initial efficiency, created problems later in the design.
Efficient computation of current flow in signal wires for reliability analysis
Authors: Kanak Agarwal, Frank Liu
Venue: Proceedings of the 2007 IEEE/ACM international conference on Computer-aided design (2007)

Electromigration (EM) and self-heating are critical reliability concerns for metal wires in high performance designs. EM reliability rules for a VLSI technology are typically expressed in terms of average, root-mean-square and peak current limits for each metal layer in the technology. To ensure EM reliability of a design, current flowing through each wire segment in the design should not violate the EM reliability rules. In this work, we present closed-from analytical models for efficient computation of average, root-mean-square and peak currents through any element in an arbitrary RC tree. The proposed models are validated against SPICE simulations for several RC nets extracted from an industrial ASIC design. The results show that the models exhibit very good accuracy with a mean error of only 3.1% in root-mean-square and 0.2% in average current estimation.
Iterative Locality Preserving Projection for Image Retrieval
Authors: Jidong Zhao, Ke Lu, Yue Wu
Venue: Proceedings of the Fourth International Conference on Image and Graphics (2007)

Recently there has been considerable interest in subspace learning for efficient multimedia information retrieval. The typical subspace learning for discovering the intrinsic geometrical structure include Principal Component Analysis (PCA) and Locality Preserving Projections (LPP). PCA discover the global Euclidean structure while LPP discovers the local manifold structure. LPP is based on a nearest neighbor graph which models the local geometrical structure of the image manifold. However, such a graph can not always accurately estimate the intrinsic manifold structure. In this paper, we propose a novel algorithm called Iterative Locality Preserving Projections (ILPP). ILPP iteratively updates the nearest neighbor graph, so that it can better model the intrinsic manifold structure. We compared our algorithm with PCA and LPP on the COREL image database. Experimental results show that our algorithm outperforms PCA and LPP for image retrieval.
Special Feature An Introduction to Algorithm Design
Authors: J. L. Bentley
Venue: Computer (1979)

Fast algorithms dramatically decrease run time for certain tasks. Designing them offers not only the promise of better performance but also a better understanding of the problems underlying all computational tasks.
Data mining approaches for modeling complex electronic circuit design activities
Authors: Yongjin Kwon, Olufemi A. Omitaomu, Gi-Nam Wang
Venue: Computers and Industrial Engineering (2008)

A printed circuit board (PCB) is an essential part of modern electronic circuits. It is made of a flat panel of insulating materials with patterned copper foils that act as electric pathways for various components such as ICs, diodes, capacitors, resistors, and coils. The size of PCBs has been shrinking over the years, while the number of components mounted on these boards has increased considerably. This trend makes the design and fabrication of PCBs ever more difficult. At the beginning of design cycles, it is important to estimate the time to complete the steps required accurately, based on many factors such as the required parts, approximate board size and shape, and a rough sketch of schematics. Current approach uses multiple linear regression (MLR) technique for time and cost estimations. However, the need for accurate predictive models continues to grow as the technology becomes more advanced. In this paper, we analyze a large volume of historical PCB design data, extract some important variables, and develop predictive models based on the extracted variables using a data mining approach. The data mining approach uses an adaptive support vector regression (ASVR) technique; the benchmark model used is the MLR technique currently being used in the industry. The strengths of SVR for this data include its ability to represent data in high-dimensional space through kernel functions. The computational results show that a data mining approach is a better prediction technique for this data. Our approach reduces computation time and enhances the practical applications of the SVR technique.
A flexible mechanism for dialogue design
Authors: Guido Boella, Jelle Gerbrandy, Joris Hulstijn
Venue: Proceedings of the 11th conference on Theoretical aspects of rationality and knowledge (2007)

In this paper is we apply insights from mechanism design to the design of agent interaction protocols. We show how this allows us a more flexible approach to the design of agent interaction protocols. By way of an analysis of a dialogue game from the literature we show how a protocol with many constraints on the moves allowed can be replaced by one in which we relax the rules, but make stronger assumptions on the type of participant that is involved in the dialogue. We can then use techniques from game theory and mechanism design to show that many of the constraints in the original protocol can be derived as properties of rational behavior.