ppxscal/embedding_network huggingface dataset:
A differential switched-capacitor amplifier with programmable gain and output offset voltage
Authors: Fabio Lacerda, Stefano Pietri, Alfredo Olmos
Venue: Proceedings of the 19th annual symposium on Integrated circuits and systems design (2006)

The design of a low-power differential Switched-Capacitor (SC) amplifier for processing a fully-differential input signal coming from a pressure sensor interface is reported. The circuit is intended to amplify the input signal, convert it to single ended mode and shift its output by an offset voltage; gain and output offset voltage are digitally programmable. The differential SC amplifier employs an Operational Transconductance Amplifier (OTA) error cancellation technique without requiring its output to slew to analog ground each cycle. Circuit topology is very insensitive to low OTA gain and allows attaining 9-bit linearity. A SC Common-Mode Feedback (CMFB) configuration with symmetric loading of the differential mode loop has been adopted to reduce charge injection and leakage current errors, as well as to settle faster than traditional CMFB circuits. The circuit has been successfully integrated into a SoC device which measures pressure sensor pre-processed signal with a 10-bit Analog-to-Digital Converter (ADC). Implemented in a standard 4-metal single-poly 0.25um CMOS process, the module occupies a silicon area of 0.115 mm2, operates down to 1.8V and its 3-V typical current consumption is 40uA.
An Adaptive Appearance Model Approach for Model-based Articulated Object Tracking
Authors: Alexandru O. Balan, Michael J. Black
Venue: Proceedings of the 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition - Volume 1 (2006)

The detection and tracking of three-dimensional human body models has progressed rapidly but successful approaches typically rely on accurate foreground silhouettes obtained using background segmentation. There are many practical applications where such information is imprecise. Here we develop a new image likelihood function based on the visual appearance of the subject being tracked. We propose a robust, adaptive, appearance model based on the Wandering-Stable-Lost framework extended to the case of articulated body parts. The method models appearance using a mixture model that includes an adaptive template, frame-to-frame matching and an outlier process. We employ an annealed particle filtering algorithm for inference and take advantage of the 3D body model to predict selfocclusion and improve pose estimation accuracy. Quantitative tracking results are presented for a walking sequence with a 180 degree turn, captured with four synchronized and calibrated cameras and containing significant appearance changes and self-occlusion in each view.
Value-Based Selection of Requirements Engineering Tool Support
Authors: Matthias Heindl, Franz Reinisch, Stefan Biffl, Alex Egyed
Venue: Proceedings of the 32nd EUROMICRO Conference on Software Engineering and Advanced Applications (2006)

In large software and systems engineering companies like Siemens PSE there are several requirements tools in use. There is no "one tool fits all projects/ departments" solution for requirements engineering due to the variety of departments and project types. Thus, project managers and requirements engineers usually face the problem of selecting the most suitable tool sets available for their given situation. In this paper, we report on a value-based requirements tool selection approach developed at PSE that helps to find the optimal tool support. This selection is based on rating the value contribution of suitablydefined tool features for the given project context. We conducted an initial feasibility study with a number of typical requirements tools at PSE. Main results were: The approach is straight-forward and seems to be a good means for project managers to compare requirements tools and select the most valuable tool for a particular project.
Cooperative multihop communication for underwater acoustic networks
Authors: Cecilia Carbonelli, Urbashi Mitra
Venue: Proceedings of the 1st ACM international workshop on Underwater networks (2006)

In this work, multi-hop cooperative schemes for underwater sensor networks are studied and shown to be highly energy efficient. Also, the signal model for a multipath channel is derived taking into account the interference from other nodes. It is shown that while the effects of uncompensated intersymbol interference (ISI) can be quite detrimental, the network exhibits enough robustness against multiuser interference.
Large harmonic sets of noncrossing edges for n randomly labeled vertices in convex position
Authors: József Balogh, Boris Pittel, Gelasio Salazar
Venue: Random Structures Algorithms (2007)

Consider a set of n points in the plane in convex position, where each point has an integer label from {0,1,...,n - 1}. This naturally induces a labeling of the edges: each edge (i,j) is assigned the label i + j, modulo n. We propose algorithms for finding large noncrossing harmonic matchings or paths, i.e., the matchings or paths in which no two edges have the same label. When the point labels are chosen uniformly at random, and independently of each other, our matching algorithm with high probability delivers a nearlyperfect matching, a matching of size n/2 - O(n1/3 lnn). We show that, in sharp contrast, a near-perfect path is unlikely: with high probability the length of the longest path is below 0.96n. In a series of computer experiments, one of our algorithms invariably found a path of length above 0.76n, and the likely path length for our empirically second best algorithm is proved to be above 0.66n. &copy; 2006 Wiley Periodicals, Inc. Random Struct. Alg., 2007Part of this research was done at the The Ohio State University, Columbus, Ohio
Design and Implementation of a Data Compression Scheme: A Partial Matching Approach
Authors: F. Choong, M. B. I. Reaz, T. C. Chin, F. Mohd-Yasin
Venue: Proceedings of the International Conference on Computer Graphics, Imaging and Visualisation (2006)

Data compression is an essential process due to the need to reduce the average time required to send messages and reduce the data size for storage purposes. There is a vital need for lossless compression especially for text and binary compression because it is important to ensure that the restructured text is identical to the original text. The predictive by partial matching (PPM) data compression scheme has set the performance standard in lossless compression throughout the past decade. PPM is chosen as it is capable of very good compression on a variety of data. In this paper, we present the realization of data compression using PPM on Altera FLEX10K FPGA device that allows for efficient hardware implementation. The PPM algorithm for binary data compression was successfully written and modeled in VHDL. The design is followed by the timing analysis and circuit synthesis for the validation, functionality and performance of the designated circuit which supports the practicality, advantages and effectiveness of the proposed hardware realization for the application. The designed was verified using both 16- bit input and 32-bit input. The hardware prototype utilized 1164 logic cells with a maximum system frequency of 95.3MHz.
Stochastic event capture using mobile sensors subject to a quality metric
Authors: Nabhendra Bisnik, Alhussein Abouzeid, Volkan Isler
Venue: Proceedings of the 12th annual international conference on Mobile computing and networking (2006)

Mobile sensors cover more area over a period of time than the same number of stationary sensors. However, the quality of coverage achieved by mobile sensors depends on the velocity, mobility pattern, number of mobile sensors deployed and the dynamics of the phenomenon being sensed. The gains attained by mobile sensors over static sensors and the optimal motion strategies for mobile sensors are not well understood. In this paper we consider the problem of event capture using mobile sensors. The events of interest arrive at certain points in the sensor field and fade away according to arrival and departure time distributions. An event is said to be captured if it is sensed by one of the mobile sensors before it fades away. For this scenario we analyze how the quality of coverage scales with the velocity, path and number of mobile sensors. We characterize the cases where the deployment of mobile sensors has no advantage over static sensors and find the optimal velocity pattern that a mobile sensor should adopt.We also present algorithms for two motion planning problems: (i) for a single sensor, what is the minimum speed and sensor trajectory required to satisfy a bound on event loss probability and (ii) for sensors with fixed speed, what is the minimum number of sensors required to satisfy a bound on event loss probability. When events occur only along a line or a closed curve our algorithms return optimal velocity for the minimum velocity problem. For the minimum sensor problem, the number of sensors used is within a factor two of the optimal solution. For the case where the events occur at arbitrary points on a plane we present heuristic algorithms for the above motion planning problems and bound their performance with respect to the optimal. The results of this paper have wide range of applications in areas like surveillance, wildlife monitoring, hybrid sensor networks and under-water sensor networks.
Tolerating Byzantine Faulty Clients in a Quorum System
Authors: Barbara Liskov, Rodrigo Rodrigues
Venue: Proceedings of the 26th IEEE International Conference on Distributed Computing Systems (2006)

Byzantine quorum systems have been proposed that work properly even when up to f replicas fail arbitrarily. However, these systems are not so successful when confronted with Byzantine faulty clients. This paper presents novel protocols that provide atomic semantics despite Byzantine clients. Our protocols prevent Byzantine clients from interfering with good clients: bad clients cannot prevent good clients from completing reads and writes, and they cannot cause good clients to see inconsistencies. In addition we also prevent bad clients that have been removed from operation from leaving behind more than a bounded number of writes that could be done on their behalf by a colluder. Our protocols are designed to work in an asynchronous system like the Internet and they are highly efficient. We require 3f +1 replicas, and either two or three phases to do writes; reads normally complete in one phase and require no more than two phases, no matter what the bad clients are doing. We also present strong correctness conditions for systems with Byzantine clients that limit what can be done on behalf of bad clients once they leave the system. Furthermore we prove that our protocols are both safe (they meet those conditions) and live.
Case Studies on the Support of Computer Managed Instruction Functionalities in e-Learning Systems
Authors: Gennaro Costagliola, Filomena Ferrucci, Vittorio Fuccella
Venue: Proceedings of the Sixth IEEE International Conference on Advanced Learning Technologies (2006)

The term Computer Managed Instruction (CMI) often refers to a set of functionalities which allow Learning Objects to be launched in the Learning Management System and to exchange data with it. A framework for the support of CMI Functionalities in Learning Management Systems, named CMIFramework, has been developed at the University of Salerno. In this paper we present two case studies concerning the adoption of CMI functionalities, using CMIFramework, in different e-learning contexts. Our present work is aimed at demonstrating the ease in using the framework and its power in solving several problems connected to the adoption of CMI functionalities.
EXTENT: fusing context, content, and semantic ontology for photo annotation
Authors: Edward Y. Chang
Venue: Proceedings of the 2nd international workshop on Computer vision meets databases (2005)

This architecture paper presents EXTENT, a probabilistic framework that uses influence diagrams to fuse metadata of multiple modalities for photo annotation. EXTENT fuses contextual information (location, time, and camera parameters), photo content (perceptual features), and semantic ontology in a synergistic way. It uses causal strengths to encode causalities between variables, and between variables and semantic labels. Through a landmark-recognition case study, we show that EXTENT can provide high-quality annotation, substantially better than any traditional unimodal methods.
Analysis of iSCSI target software
Authors: Fujita Tomonori, Ogawara Masanori
Venue: Proceedings of the international workshop on Storage network architecture and parallel I/Os (2004)

We analyzed the design and performance of iSCSI storage systems, built into general purpose operating systems. Our experiments revealed that a storage system that uses specialized functions, in conjunction with the modified operating system, outperforms a storage system that only uses the standard functions provided by the operating system. However, our results also show that careful design enables the latter approach to provide a comparable performance to that of the former, in common workloads.
Aerospace Integrated Research Systems
Authors: Sang Boem Lim, Joobum Kim, Nam Gyu Kim, June H. Lee, Chongam Kim, Yoonhee Kim
Venue: Proceedings of the 2006 International Conference on Hybrid Information Technology - Volume 01 (2006)

Recently, people move their interest from developing single middleware to integration of those middleware and operations. One way to integrate Grid middleware and provide easy to use environment to application research scientists is using a portal. In this paper, we will discuss how to develop a wind tunnel simulation service that will be used by aerospace community by using this portal technology. Two main philosophies of such architecture are reusability and user-friendliness. Each part of our system can be re-used without any major difficulties. And since we have developed this system user in mind we try to make as easy as possible to use. Aerospace research scientists are actively involved from the beginning when we design overall architecture and design user interface of each step.
Automatic Traffic Balance Algorithm Based on Traffic Engineering
Authors: Dengyin Zhang, Zhiyun Tang, Ruchuan Wang
Venue: Journal of Network and Systems Management (2006)

Routing protocols can decide for data packets which route is reachable and co-optimal, and may cause data packets to swarm into certain links, thus causing congestion on those links. General traffic engineering (GTE) technology provides ER-LSP/CR-LSP in MPLS networks to avoid this kind of congestion. However, GTE takes only the current data flow into account and establishes an ER-LSP/CR-LSP for this current data flow in order to guarantee QoS. Although this could resolve the issue raised by routing protocols, it may also waste some resource. In this article we focus on optimization of traffic engineering and propose an automatic traffic balance algorithm based on GTE technology.
A Data Mining Approach Based on Grey Prediction Model in Web Environment
Authors: Hui Peng
Venue: Proceedings of the Second International Conference on Semantics, Knowledge, and Grid (2006)

This paper proposes a prediction approach that combines grey prediction model with three-layer computing architecture in Web environment. It presents a refined prediction formula to enhance the scalability and usage scope of the Web prediction systems. It layouts a three layer architecture for the Web prediction system to reduce the network traffic and maintain load balance. A traffic decision support system is presented to illustrate the proposed approach.
Characterization of the data access behavior for TPC-C traces
Authors: R. Bonilla-Lucas, P. Plachta, A. Sachedina, D. Jimenez-Gonzalez, C. Zuzarte, J.-L. Larriba-Pey
Venue: Proceedings of the 2004 IEEE International Symposium on Performance Analysis of Systems and Software (2004)

In this paper, we look into the characteristics of the reference stream of TPC-C workloads from the buffer pool point of view. We analyze a trace coming from DB2 UDB version 8.1 fix pack 4 and compare it to a trace from DB2 UDB version 8.1 GA. We perform three types of analysis. A static analysis of the number of reads and writes for index and data pages. We conclude that index pages receive less references than data pages by are more frequently accessed individually. Then, we analyze how DB2 processes access those pages. Index pages have more references than data pages when accessed by more than one process. Finally, we understand the accesses along the life of a page. We conclude that there is a significant burstiness in the reference stream, where, each burst is caused by one process.
Qualitative discrete event simulation
Authors: Yen-Ping Leow-Sehwail, Ricki G. Ingalls
Venue: Proceedings of the 37th conference on Winter simulation (2005)

A real world system is full of uncertainties and more than often the parameters, processes or events under study are poorly understood. In order to study a real world system, we often have to make a set of assumptions about how it works using statistical, mathematical or logical relationships. Qualitative discrete event simulation involves the development of simulation models which require less assumptions, less data requirements and yet more robust. This paper presents the concepts involved in the development and implementation of qualitative discrete event simulation models and algorithms.
A Two - Phase Distributed Reconfiguration Algorithm for Node Failures in IP-Over-WDM Networks
Authors: N. Sreenath, Balaji Palanisamy
Venue: Proceedings of the International Conference on Systems and Networks Communication (2006)

In Wavelength Routed Wavelength Division Multiplexing (WR-WDM) networks, a set of lightpaths (all-optical communication paths) defines the virtual topology. Internet Protocol (IP) makes use of virtual topology to route its traffic in the optical form. In the event of a node failure, the virtual topology may be partitioned so that a set of nodes may not be able to communicate with another set of nodes. The failure may also affect the objective function value leading to decreased network performance. In such a case, it may be indispensable that the connectivity in the virtual topology is restored and the network performance is improved in terms of objective function value. Hence, it may be necessary to alter the existing virtual topology. Altering of a virtual topology is called as virtual topology reconfiguration. In this paper, we propose a two-phase distributed algorithm for virtual topology reconfiguration in the event of a node failure. The algorithm restores the failed connectivity during phase I. Phase II of the algorithm improves the network performance by bringing down the objective function value of the network.
Robust Scene Categorization by Learning Image Statistics in Context
Authors: Jan C. van Gemert, Jan-Mark Geusebroek, Cor J. Veenman, Cees G. M. Snoek, Arnold W. M. Smeulders
Venue: Proceedings of the 2006 Conference on Computer Vision and Pattern Recognition Workshop (2006)

We present a generic and robust approach for scene categorization. A complex scene is described by proto-concepts like vegetation, water, fire, sky etc. These proto-concepts are represented by low level features, where we use natural images statistics to compactly represent color invariant texture information by a Weibull distribution. We introduce the notion of contextures which preserve the context of textures in a visual scene with an occurrence histogram (context) of similarities to proto-concept descriptors (texture). In contrast to a codebook approach, we use the similarity to all vocabulary elements to generalize beyond the code words. Visual descriptors are attained by combining different types of contexts with different texture parameters. The visual scene descriptors are generalized to visual categories by training a support vector machine. We evaluate our approach on 3 different datasets: 1) 50 categories for the TRECVID video dataset; 2) the Caltech 101-object images; 3) 89 categories being the intersection of the Corel photo stock with the Art Explosion photo stock. Results show that our approach is robust over different datasets, while maintaining competitive performance.
VAMNET: the functional approach to distributed programming
Authors: Stefan Bosse
Venue: ACM SIGOPS Operating Systems Review (2006)

This article gives a design overview of a new reliable distributed operating system environment, combining the world of functional and distributed programming using a virtual machine approach for hiding system dependencies, offering rapid prototyping facilities. The basic operating system concepts used are derived from the Amoeba operating system by Andrew Tanenbaum and his work group, developed 20 years ago. VAMNET is not only a native operating system. It is a hybrid solution for expanding widely used operating systems like UNIX with a distributed execution environment.
From Inclusive Guidance To Inclusive Online Teaching Practice - A Tool To Help Plan For Student Diversity
Authors: Emma Bradburn, Elaine Pearson
Venue: Proceedings of the Sixth IEEE International Conference on Advanced Learning Technologies (2006)

Academics need to be aware of the diverse needs of students and the potential barriers to inclusion that their teaching practices may have to certain groups of students. To support student diversity effectively the right level of guidance needs to be provided. It is proposed that a planning tool can provide such guidance by raising awareness of barriers and providing advice on anticipatory measures to fulfill the needs of students
Particle Swarm Optimization of Feed-Forward Neural Networks with Weight Decay
Authors: Marcio Carvalho, Teresa B. Ludermir
Venue: Proceedings of the Sixth International Conference on Hybrid Intelligent Systems (2006)

Training neural networks is a complex task of great importance in problems of supervised learning. In this work we analyze the use of the Particle Swarm Optimization algorithm and the cooperative variant with the weight decay mechanism for neural network training aiming better generalization performances. For evaluating these algorithms we apply them to benchmark classification problems of the medical field. The results showed that the weight decay mechanism implemented improved the mean generalization control of the two algorithms in all the tested problems.
Identification and Error Analysis in Frequency Domain
Authors: Lianming Sun, Akira Sano
Venue: Proceedings of the First International Conference on Innovative Computing, Information and Control - Volume 1 (2006)

The identification algorithm and error analysis are considered in frequency domain by using discrete Fourier transform and spectral analysis. A simple algorithm to estimate the signal spectra is proposed and the property of the estimation is analyzed. The feature of the proposed algorithms is that they can be implemented very easily and the information of model structure is not necessary.