ppxscal/embedding_network huggingface dataset:
RFID Business Aware Framework for Business Process in the EPC Network
Authors: Seongjin Kim, Mikyeong Moon, Seonghun Kim, Sunmee Yu, Keunhyuk Yeom
Venue: Proceedings of the 5th ACIS International Conference on Software Engineering Research, Management & Applications (2007)

Radio frequency identification (RFID) technology has been applied to many business areas to simplify complex processes and gain important benefits. To derive real benefit from RFID, the system must rapidly implement functions to process the large quantity of event data generated by RFID operations and should be configured dynamically for changing businesses. Consequently, developers are forced to implement systems to derive meaningful high-level events from simple RFID events and bind them to various business processes. Although applications could directly consume and act on RFID events, extracting the business rules from the business logic leads to better decoupling of the system, which consequentially increases maintainability. In this paper, we describe an RFID business aware framework for business process in the Electronic Product Code (EPC) network. The solutions and techniques presented in this paper are based on our experience of RFID middleware from the Logistics Information Technology project.
Solving Irregular Rotational Knapsack Problems
Authors: T. C. Martins, M. S. G. Tsuzuki
Venue: Proceedings of the Seventh International Conference on Intelligent Systems Design and Applications (2007)

This work deals with the problem of minimize the waste of space that occurs on a placement of a set of bi- dimensional items inside a bi-dimensional container with fixed dimensions. This problem is approached with an heuristic based on Simulated Annealing (SA), which is in- spired on the physic-chemical process that takes place dur- ing the recrystallization of a metal. Traditional "external penalization" techniques are avoided through the applica- tion of no fit polygons, that represents collision-free areas for each items before its placement. That gives to the pro- posed process a more universal character, as external pe- nalization is based on empiric parameters of great influ- ence on the optimization performance. The SA controls: the rotation and the placement. For each non placed items a limited depth binary search is performed to find a scale factor that when applied to the items, would allow it to be fitted on the container. The proposed process is suited for non-convex items and containers, and can be easily adapted for related problems, such as container size minimization. Some results are shown with irregular items, non convex items and containers.
Improving Test Pattern Compactness in SAT-based ATPG
Authors: Stephan Eggersglub, Rolf Drechsler
Venue: Proceedings of the 16th Asian Test Symposium (2007)

Automatic Test Pattern Generation (ATPG) is one of the core problems in testing of digital circuits. ATPG algorithms based on Boolean Satisfiability (SAT) turned out to be very powerful, due to recent advances in SATbased proof engines. SAT-based ATPG clearly outperforms classical approaches especially for hard-to-detect faults. But due to the SAT provers, a major drawback of the resulting test patterns is that a large number of input bits is specified. Thus, the resulting patterns are not well suited for test compaction and compression. In this paper we present techniques to increase the number of unspecified bits in test patterns generated by SAT-based ATPG tools. We make use of structural properties of the circuit and apply local don't cares. Experimental results on industrial designs show significant reductions of up to 97%.
Evolving Classifier Ensemble With Gene Expression Programming
Authors: Qu Li, Weihong Wang, Shanshan Han, Jianhong Li
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 03 (2007)

Gene expression programming (GEP) is a kind of genotype/ phenotype based Evolutionary Computation(EC) algorithm. GEP has been successfully applied in Data Mining( DM) fields such as regression, classification and association rules mining. Although GEP has been used as a raw DM tool in these fields, its potential to combine with DM techniques has not been well studied in both DM and EC fields. In this paper, two ensemble methods, namely bagging and boosting, together with other DM tools available in Weka platform, are applied to improve the learning ability of GEP classifiers. Results show that the two popular ensemble methods can improve classification accuracy of raw GEP classifiers. What's more, bagging outperforms boosting in GEP classifier learning.
Proceedings of the 2007 workshop on Peer-to-peer streaming and IP-TV
Venue: Applications, Technologies, Architectures, and Protocols for Computer Communication (2007)

Video delivery over the Internet has been historically a challenging problem in the Internet. Recently, we have witnessed a number of proposals that promise high-quality video streaming without the need for infrastructure support. Such proposals rely in P2P networks as their core delivery method. However, still in its infancy, both live and on-demand P2P streaming present many research challenges. This workshop will bring together researchers and practitioners in the field of P2P and IPTV video delivery networks to share their experiences and discuss the most pressing research challenges in the years to come. We have received 18 submissions from the US, Europe, and Asia. Each paper received at least three reviews from experts in the field. Based on the received reviews, the program committee selected 8 papers that will appear in the final program.
Diversified Test Methods for Local Control Units
Authors: C. Robach
Venue: IEEE Transactions on Computers (1975)

Two different test methods, specific to two control mechanisms in a logic network are presented. These methods, in fact, correspond to two levels of complexity and therefore to two kinds of hardware realizations. The main considerations will be the following.
Evaluating MapReduce for Multi-core and Multiprocessor Systems
Authors: Colby Ranger, Ramanan Raghuraman, Arun Penmetsa, Gary Bradski, Christos Kozyrakis
Venue: Proceedings of the 2007 IEEE 13th International Symposium on High Performance Computer Architecture (2007)

This paper evaluates the suitability of the MapReduce model for multi-core and multi-processor systems. MapReduce was created by Google for application development on data-centers with thousands of servers. It allows programmers to write functional-style code that is automaticatlly parallelized and scheduled in a distributed system. We describe Phoenix, an implementation of MapReduce for shared-memory systems that includes a programming API and an efficient runtime system. The Phoenix run-time automatically manages thread creation, dynamic task scheduling, data partitioning, and fault tolerance across processor nodes. We study Phoenix with multi-core and symmetric multiprocessor systems and evaluate its performance potential and error recovery features. We also compare MapReduce code to code written in lower-level APIs such as P-threads. Overall, we establish that, given a careful implementation, MapReduce is a promising model for scalable performance on shared-memory systems with simple parallel code.
Towards automated consistency checks of product line requirements specifications
Authors: Kim Lauenroth, Klaus Pohl
Venue: Proceedings of the twenty-second IEEE/ACM international conference on Automated software engineering (2007)

A requirements specification for an individual software system should be consistent, i.e. free of contradictions. In product line engineering, the product line requirements specification comprises all the requirements common to all products of the product line as well as the variable requirements used to derive individual products from the product line. The set of requirements (common and all the variable ones) of a product line is typically inconsistent since variable requirements can contradict each other. This is not a problem as long as contradicting requirements are not included in a product derived from the product line. Thus, the set of requirements realized in each individual product has to be consistent. Employing techniques used in single system development to check the consistency of product line requirements will thus produce false positive results, since there can be contradiction in the product line requirements specification In this paper we first provide a concise definition of consistency for product line requirements specifications. Based on this definition, we define a formal framework for checking consistency of product line requirements specifications. Our framework supports consistency checks in the domain engineering process. In contrast to consistency checks in single system development, it tolerates certain types of inconsistencies caused by the variability of prod-uct line requirements.
Super-resolution mosaicing from MPEG compressed video
Authors: P. Krämer, O. Hadar, J. Benois-Pineau, J. -P. Domenger
Venue: Image Communication (2007)

In this paper we address the problem of mosaic construction from MPEG 1/2 compressed video for the purpose of video browsing. State-of-the-art mosaicing methods work on raw video, but most video content is available in compressed form such as MPEG 1/2. Applying these methods to compressed video requires full decoding which is very costly. The resulting mosaic is in general too large to display on the screen and is thus inappropriate for the purpose of video browsing. Therefore, we directly extract very low-resolution frames from MPEG 1/2 compressed video for the mosaic construction and then apply a super-resolution (SR) method based on iterative backprojections in order to increase the mosaic resolution and its visual quality. Global motion to be used in the SR method for aligning and warping the frames is estimated from motion information contained in the compressed stream. We also use the estimated global motion in the blur estimation and in the choice of the degradation model used for the restoration in the SR algorithm. The method for the SR mosaic construction from MPEG 1/2 compressed video that we present in this paper is less costly than mosaic construction from full decoded video. Furthermore, the resulting mosaic size is more appropriate for the purpose of video browsing.
Learning Overcomplete Spatiotemporal Bubbles from Natural Image Sequences
Authors: Libo Ma, Liqing Zhang
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 01 (2007)

Recently, bubble coding for natural image sequences has been proposed. This method unified three important statistical properties: sparseness, temporal coherence, and topographic dependencies. However, this approach does not consider the overcomplete case. It is widely believed that the overcomplete representation is more efficient than the complete representation. In this paper, we use Bayesian estimation to extend the bubble coding into overcomplete case. Based on a quasi-orthogonality in a high-dimensional space, the prior probability of the mixing matrix is derived. Instead of examining basis coefficient, we investigate the dot product between basis functions and whitened observed data vectors for their sparseness and the advantage in the Bayesian model. Based on the bubble detector definition, an approximation of the prior probability of this dot product is given. Simulation results suggest that the overcomplete bubble coding can be achieved by a Bayesian inference. The model is promising in a wide variety of applications, such as image processing and pattern recognition.
Autonomously semantifying wikipedia
Authors: Fei Wu, Daniel S. Weld
Venue: Proceedings of the sixteenth ACM conference on Conference on information and knowledge management (2007)

Berners-Lee's compelling vision of a Semantic Web is hindered by a chicken-and-egg problem, which can be best solved by a bootstrapping method - creating enough structured data to motivate the development of applications. This paper argues that autonomously "Semantifying Wikipedia" is the best way to solve the problem. We choose Wikipedia as an initial data source, because it is comprehensive, not too large, high-quality, and contains enough manually-derived structure to bootstrap an autonomous, self-supervised process. We identify several types of structures which can be automatically enhanced in Wikipedia (e.g., link structure, taxonomic data, infoboxes, etc.), and we describea prototype implementation of a self-supervised, machine learning system which realizes our vision. Preliminary experiments demonstrate the high precision of our system's extracted data - in one case equaling that of humans.
Study of Models Clustering and its Application to Ensemble Learning
Authors: Kai Li, Lijuan Cui
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 03 (2007)

Clustering technique is an important tool for data analysis and has a promising prospect in data mining, pattern recognition, etc. Usually, objects in clustering analysis are of vectors, which consist of some features. They may be represented as points in Euclidean space. However, in some tasks, objects in clustering analysis may be some abstract models other than data points, for example neural networks, decision trees, support vector machines, etc. By defining the extended distance (in real tasks, there are some different definition forms about distance), clustering method is studied for the abstract data objects. Framework of clustering algorithm for objects of models is presented. As its application, a method for improving diversity of ensemble learning with neural networks is investigated. The relations between the number of clusters in clustering analysis, the size of ensemble learning, and performance of ensemble learning are studied by experiments.
Running the Windows P2P Infrastructure on Mobile Phones
Authors: Ulrich Mueller, Matt Young, Alain Gefflaut
Venue: Proceedings of the Seventh IEEE International Conference on Peer-to-Peer Computing (2007)

The recent desktop versions of Windows (XP SP2 and Vista) include a Peer-to-Peer (P2P) infrastructure that simplifies the development and deployment of true P2P applications. We have ported the latest version of this infrastructure to Windows Embedded CE 5.0, which is the underlying OS for Windows Mobile 5.0. To our knowledge, this is the first native implementation of a P2P infrastructure for Windows Mobile. This paper provides a short overview of the infrastructure and design considerations when running P2P applications on mobile phones. For demonstration purposes, we have developed a community-based photo sharing and chat application that solely uses the P2P infrastructure for communication. We will demonstrate the ease of creating P2P communities in an ad-hoc manner, and the interoperability between Windows Mobile and Windows Vista.
Special Feature: An On-Line Data Entry System for Hand-Printed Characters*
Authors: H. D. Crane
Venue: Computer (1977)

The primary method of entering large amounts of routinely produced, hand-printed data into computer systems is via manual keyboards. Manual retranscription, however, entails a number of disadvantages such as extra cost, delays, and errors.
On Detecting Total or Partial Symmetry of Switching Functions
Authors: S. R. Das, C. L. Sheng
Venue: IEEE Transactions on Computers (1971)

This note presents a method for identifying total or partial symmetry of switching functions based on the application of the principle of residue test by numerical methods. The invariance of a switching function under a single interchange of two variables can be readily detected from the equality of some of the residues of expansion about these two variables. This procedure of detecting invariance is directly applied for the identification of total or partial symmetry of a switching function whose variables of symmetry may be either all unprimed (or all primed), mixed, or of multiform nature.
A Comment on "Variable-Range Transmission Power Control in Wireless Ad Hoc Networks"
Authors: Chun-Hao Yang Kuo-Feng Ssu
Venue: IEEE Transactions on Mobile Computing (2007)

Correction to equation (24) in"Variable-Range Transmission Power Control in Wireless Ad Hoc Networks"
ROC analysis in ordinal regression learning
Authors: Willem Waegeman, Bernard De Baets, Luc Boullart
Venue: Pattern Recognition Letters (2008)

Nowadays the area under the receiver operating characteristics (ROC) curve, which corresponds to the Wilcoxon-Mann-Whitney test statistic, is increasingly used as a performance measure for binary classification systems. In this article we present a natural generalization of this concept for more than two ordered categories, a setting known as ordinal regression. Our extension of the Wilcoxon-Mann-Whitney statistic now corresponds to the volume under an r-dimensional surface (VUS) for r ordered categories and differs from extensions recently proposed for multi-class classification. VUS rather evaluates the ranking returned by an ordinal regression model instead of measuring the error rate, a way of thinking which has especially advantages with skew class or cost distributions. We give theoretical and experimental evidence of the advantages and different behavior of VUS compared to error rate, mean absolute error and other ranking-based performance measures for ordinal regression. The results demonstrate that the models produced by ordinal regression algorithms minimizing the error rate or a preference learning based loss, not necessarily impose a good ranking on the data.
A Marked Point Process of Rectangles and Segments for Automatic Analysis of Digital Elevation Models
Authors: Mathias Ortner, Xavier Descombe, Josiane Zerubia
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2008)

This work presents a framework for automatic feature extraction from images using stochastic geometry. Features in images are modeled as realizations of a spatial point process of geometrical shapes. This framework allows the incorporation of a priori knowledge on the spatial repartition of features. More specifically, we present a model based on the superposition of a process of segments and a process of rectangles. The former is dedicated to the detection of linear networks of discontinuities, while the latter aims at segmenting homogeneous areas. An energy is defined, favoring connections of segments, alignments of rectangles, as well as a relevant interaction between both types of objects. The estimation is performed by minimizing the energy using a simulated annealing algorithm.The proposed model is applied to the analysis of Digital Elevation Models (DEMs). These images are raster data representing the altimetry of a dense urban area. We present results on real data provided by the IGN (French National Geographic Institute) consisting in low quality DEMs of various types.
A Framework for Design and Analysis of Asymmetric Fingerprinting Protocols
Authors: Geong Sen Poh, Keith M. Martin
Venue: Proceedings of the Third International Symposium on Information Assurance and Security (2007)

We propose a framework for the design and analysis of asymmetric fingerprinting protocols. By fitting existing approaches within this framework we are able to highlight strategic differences in design techniques. We then illus- trate how the framework can be used to derive new models, which in turn lead to asymmetric fingerprinting schemes with new properties.
The Definition Mechanism for Standard PL/I
Authors: M. Marcotty
Venue: IEEE Transactions on Software Engineering (1977)

The mechanism used to define the programming language PL/I in the recently adopted American National Standard is presented. This method provides a rigorous though semiformal specification of the language. If uses the model of translation of programs into an abstract form to define the context-free and context-sensitive syntax. The semantics are defined by the interpretation of the abstract form of the program on a hypothetical machine. The method and metalanguage are presented along with several small examples to illustrate the definition technique's features. The complete definition process is shown by the definition of a small example language.
Template based High Performance ALE-TSOAP Message Communication
Authors: Suhyun Kim, Daeyoung Kim, Jongwoo Sung, Tomas Sanchez Lopez
Venue: Proceedings of the 5th ACIS International Conference on Software Engineering Research, Management & Applications (2007)

Recently, the RFID technology has become essential for ubiquitous computing. As the deployment of mega SCM (Supply Chain Management) environments starts at the largest companies in the distribution industry, efforts tend to concentrate on a variety of performance improvements for the RFID middleware aiming to give quality of service for large RFID-data transmission. Web services, cornerstone of the RFID networks, require high performance, security and extensibility. Since SOAP (Simple Object Access Protocol) inherits the poor performance of XML, it is not easy for the RFID middleware to support high performance web services. The ALE (Application Level Event) communication interface from the RFID middleware sends a response message. Its serialization, which includes the conversion of common language runtime objects to the XML documents and streams and packing of this data into a message buffer, has been proven as the bottleneck for SOAP's poor performance. In this paper, we propose ALE-TSOAP, based on ALE templates, that provides an increase in the performance of the RFID middleware when generating response messages. We analyze SOAP messages to classify the various ALE template formats, to design and implement our ALE templates and, finally, to evaluate the performance of the ALE-TSOAP processing. The use of ALE-TSOAP does not change the SOAP protocol or the ALE communication interface of the RFID middleware. Through our experiments, we observed that our approach obtains up to a 197.8% performance gain by only using ALE templates for the serialization of SOAP message.
Testability Analysis Based on the Identification of Testable Blocks with Predefined Properties
Authors: Jaroslav Skarvada, Tomas Herrman, Zdenek Kotasek
Venue: Proceedings of the 10th Euromicro Conference on Digital System Design Architectures, Methods and Tools (2007)

In the paper, the methodology of testability analysis based on the concept of testable blocks is presented. In the methodology the power consumption during test application is also taken into account. For this purpose, power estimation tool was developed and implemented. Integration of the developed software into the professional design flow is described. Experimental results gained as a consequence of applying the methodology on both benchmark and practical designs are demonstrated. The intensions for future research are presented.
A Bipolar 16K ROM Utilizing Schottky Diode Cells
Authors: J. F. Gunn
Venue: Computer (1977)

As bipolar circuits assume more of a role in microprocessor oriented systems, it becomes advantageous to extend the application of bipolar technology to a large mask programmable ROM. This paper will describe a 16K bipolar ROM, organized as 2K x 8 bits, which utilizes for its basic memory cell a simple and compact Schottky diode.