ppxscal/embedding_network huggingface dataset:
Recovering Workflows from Multi Tiered E-commerce Systems
Authors: Maokeng Hung, Ying Zou
Venue: Proceedings of the 15th IEEE International Conference on Program Comprehension (2007)

A workflow is a computerized specification of a business process. A workflow describes how tasks are executed and ordered following business policies. E-commerce systems implement the workflows of the daily operations of an organization. Organizations must continuously modify their e-commerce systems in order to accommodate workflow changes. However, e-commerce systems are often designed and developed without referring to the workflows. Modifying e-commerce systems is a time consuming and error prone task. In order to correctly perform this task, developers require an in-depth understanding of multi tiered e-commerce systems and the workflows that they implement. In this paper, we present an approach which automatically recovers workflows from three tier e-commerce systems. Given the starting UI page of a particular workflow, the approach traces the flow of control throughout the different tiers of the e-commerce system in order to recover that workflow. We demonstrate the effectiveness of our approach through experiments on an open source e-commerce system.
Student Forum
Authors: Farnam Jahanian
Venue: Proceedings of the 37th Annual IEEE/IFIP International Conference on Dependable Systems and Networks (2007)

The Student Forum at DSN provides an opportunity for students currently working in the area of dependable computing to present and discuss their research objectives, approach and preliminary results. The Forum is centered on a conference track during which the selected student research papers are presented. Student Forum research papers are brief three-page single-authored presentations of ongoing research by graduate students.
A TDD approach to introducing students to embedded programming
Authors: James Miller, Michael Smith
Venue: ACM SIGCSE Bulletin (2007)

Learning embedded programming is a highly demanding exercise. The beginner is bombarded with complexity from the start: embedded production based around a myriad of C++ constructs with low-level elements integrated onto ever more complicated processor architectures. The picture is further compounded by tool support having unfamiliar roles and appearances from previous student experiences. This demanding situation often has the student bewildered; seeking for "a crutch" or the simplest way forward regardless of the overall consequences. To control this potentially chaotic picture, the instructor needs to introduce devices to combat this complexity. We argue that test driven development (TDD) should become the instructor's principal weapon in this fight. Reasons for this belief combined with our, and the students', experiences with this novel approach are discussed.
Task Selection in Multi-Agent Swarms using Adaptive Bid Auctions
Authors: Prithviraj Dasgupta, Matthew Hoeing
Venue: Proceedings of the First International Conference on Self-Adaptive and Self-Organizing Systems (2007)

In the recent past, emergent computing based selfadaptive systems such as multi-agent swarms have become an attractive paradigm for designing large-scale distributed systems. In this paper, we consider a multi-agent swarmbased system for performing tasks in a domain characterized by search and execute operations. Our main focus is on the task allocation problem among the swarm units in our system. The main contribution of this paper is a multiagent auction-based algorithm with dynamically adjustable bids that enables a swarm unit(agent) to plan its path efficiently while maintaining certain constraints on its cost and on the completion times of the tasks in the system. Experimental results of our algorithm within a simulated environment show that the auction-based algorithm performs significantly better than other heuristics-based strategies.
Performance Analysis of the Superpeer-based Two-layer P2P Overlay Network with the CBF Strategy
Authors: Kenichi Watanabe, Naohiro Hayashibara, Makoto Takizawa
Venue: Proceedings of the 27th International Conference on Distributed Computing Systems Workshops (2007)

Peer-to-peer (P2P) systems are widely used in various types of applications. In this paper, we evaluate the superpeer-based two-layer (SBTL) P2P overlay network with the charge-based flooding (CBF) algorithm to detect target peers which have target files, proposed as our previous work. The SBTL P2P overlay network is composed of two layers, normal peer and superpeer layers which include normal peers and superpeers, respectively. Multiple normal peers with some common properties, e.g. peers which have replicas of a file, are interconnected with a superpeer. A collection of a superpeer and normal peers is referred to as a cluster. In a cluster, a normal peer tries to find a target peer which has a target file by itself without help of its superpeer. If no target peer is detected in the cluster, the normal peer asks the super-peer to find the target peer. Then, the superpeer forwards the request message to other superpeers by using a type of flooding algorithm named the CBF algorithm at the super-peer layer. We evaluate the SBTL P2P model in terms of the number of messages exchanged among peers and communication load compared with other models.
Multiple Bit Upset Tolerant Memory Using a Selective Cycle Avoidance Based SEC-DED-DAEC Code
Authors: Avijit Dutta, Nur A. Touba
Venue: Proceedings of the 25th IEEE VLSI Test Symmposium (2007)

Conventional error correcting code (ECC) schemes used in memories and caches cannot correct double bit errors caused by a single event upset (SEU). As memory density increases, multiple bit upsets in nearby cells become more frequent. A methodology is proposed here for deriving an error correcting code through heuristic search that can detect and correct the most likely double bit errors in a memory while minimizing the miscorrection probability of the unlikely double bit errors. A key feature of the proposed ECC is that it uses the same number of check bits as the conventional single error correcting/double error detecting (SEC-DED) codes commonly used, and has nearly identical syndrome generator/encoder area and timing overhead. Hence, there is very little additional cost to using the proposed ECC. The proposed ECC can be used instead of or in addition to bit interleaving to provide greater flexibility for optimizing a memory layout and/or provide better protection from multiple bit upsets. It is also useful for small memories, e.g., content addressable memory or register files, where interleaving is not possible.
A Spatial Communication Model for Ubiquitous Computing Services
Authors: Ichiro Satoh
Venue: Proceedings of the Fourth European Conference on Universal Multiservice Networks (2007)

The paper presents an approach for location-aware communications in ubiquitous computing environments. It is constructed on a symbolic location model, which links everyday objects, including non-smart objects and places, with counterpart objects, which are executable software components that are dynamically organized like a tree based on geographical containment, such as in a user-room-floor-building hierarchy. The approach enables physical entities and places to communicate with one another through their counterpart objects, even when the entities and places are not smart. It supports a mechanism to detect objects and communicate with them according to their locations. This paper presents the design for the approach and describes an implementation of it.
A Factorized Recursive Estimation of Structure and Motion from Image Velocities
Authors: Adel H. Fakih, John Zelek
Venue: Proceedings of the Fourth Canadian Conference on Computer and Robot Vision (2007)

We propose a new approach for the recursive estimation of structure and motion from image velocities. The estimation of structure and motion from image velocities is preferred to the estimation from pixel correspondences when the image displacements are small, since the former approach provides a stronger constraint being based on the instantaneous equation of rigid bodies motion. However the recursive estimation when dealing with image velocities is harder than its counterpart (in the case of pixel correspondences) since the number of points is usually larger and the equations are more involved. For this reason, in contrast to the case of point correspondences, the approaches presented so far are mostly limited to assuming a known 3D motion, or estimating the motion and structure independently. The approach presented in this paper introduces a factorized particle filter for estimating simultaneously the 3D motion and depth. Each particle consists of a 3D motion and a set of probability distributions of the depths of the pixels. The recursive estimation is done in three stages. (1) a resampling and a prediction of new samples; (2) a recursive filtering of the individual depths distributions performed using Extended Kalman Filters; and (3)finally a reweighting of the particles based on the image measurement. Results on simulation data show the efficiency of the approach. Future work will focus on incorporating an estimation of object boundaries to be used in a following regularization step.
Stability and Sensitivity of Optimization Problems with First Order Stochastic Dominance Constraints
Authors: Darinka Dentcheva, Rene´ Henrion, Andrzej Ruszczyn´ski
Venue: SIAM Journal on Optimization (2007)

We analyze the stability and sensitivity of stochastic optimization problems with stochastic dominance constraints of first order. We consider general perturbations of the underlying probability measures in the space of regular measures equipped with a suitable discrepancy distance. We show that the graph of the feasible set mapping is closed under rather general assumptions. We obtain conditions for the continuity of the optimal value and upper-semicontinuity of the optimal solutions, as well as quantitative stability estimates of Lipschitz type. Furthermore, we analyze the sensitivity of the optimal value and obtain upper and lower bounds for the directional derivatives of the optimal value. The estimates are formulated in terms of the dual utility functions associated with the dominance constraints.
An new method used in HMM for modeling frame correlation
Authors: Guo Qing
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 01 (1999)

We present a novel method to incorporate temporal correlation into a speech recognition system based on conventional hidden Markov model (HMM). In this new model the probability of the current observation not only depends on the current state but also depends on the previous state and the previous observation. The joint conditional probability density (PD) is approximated by a non-linear estimation method. As a result, we can still use the mixture Gaussian density to represent the joint conditional PD for the principle of any PD can be approximated by the mixture Gaussian density. The HMM incorporated temporal correlation by the non-linear estimation method, which we called FC HMM does not need any additional parameters and it only brings a little additional computing quantity. The results of the experiment show that the top 1 recognition rate of FC HMM has been raised by 6 percent compared to the conventional HMM method.
Design of a Haptic Zoom: levels and steps
Authors: Mounia Ziat, Olivier Gapenne, John Stewart, Charles Lenay, Jerome Bausse
Venue: Proceedings of the Second Joint EuroHaptics Conference and Symposium on Haptic Interfaces for Virtual Environment and Teleoperator Systems (2007)

When the subjects handle a haptic zoom (kinaesthetic zoom through a sensory substitution device), they don't have any difficulty to make the distinction between a zoom-in and a zoom-out and this, while basing themselves on the number of pins activated under the finger. In a similar way to the visual zoom, the haptic zoom-in gives them access to the detail and to position themselves with precision on the object whereas the haptic zoom-out, less used, is used only to benefit of a global perception in order to better centre themselves on the objects present in the perception space. The second result underlines that the subjects do not handle more than 25 levels and this, even if they have the possibility of handling more (100 or 1000).
Conversion efficiency enhancement of AlGaAs quantum well solar cells
Authors: J. C. Rimada, L. Hernández, J. P. Connolly, K. W. J. Barnham
Venue: Microelectronics Journal (2007)

The quantum efficiency and photocurrent for AlGaAs quantum well solar cell is calculated and compared with experimental results obtaining good agreement. The conversion efficiency as a function of Al composition in barriers and wells is presented showing that there is a wide range of Al composition barrier and Al composition well where the QWSC efficiency is always higher than corresponding homogeneous p-i-n cell without quantum wells. We also show that for up to 15 wells in the intrinsic region an efficiency enhancement for the QWSC over the baseline cell is obtained.
Detection Methods of Dynamic Spammers' Behavior
Authors: Radoslaw Brendel, Henryk Krawczyk
Venue: Proceedings of the 2nd International Conference on Dependability of Computer Systems (2007)

E-mailing as one of the most popular Internet communication service is very prone to spamming, i.e. the process of flooding our mailboxes with unsolicited messages. Every day, separating good messages from those coming from spammers we waste time and resources. It is urgent to find out an effective method of fighting with spam that should take into account not only the currently used spammers' methods but also dynamic aspects of constantly changing spammers' behavior. The paper presents an on-line e-mails classification method that assesses every incoming e-mail as spam, non-spam or leaves it unclassified. The method uses various types of users' email communication graphs built from mail servers log files. Additionally the method uses comparative procedures that let us take into account dynamic aspects of spam process by the analysis of the predefined graphs built for consecutive periods of time. It is also presented how this method can and should be combined with today most efficient spam fighting methods using heavy content-based analysis tools. It is pointed out why these two methods should be considered as combined ones.
Hidden Markov models based on multi-space probability distribution for pitch pattern modeling
Authors: K. Tokuda
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 01 (1999)

This paper discusses a hidden Markov model (HMM) based on multi-space probability distribution (MSD). The HMMs are widely-used statistical models to characterize the sequence of speech spectra and have successfully been applied to speech recognition systems. From these facts, it is considered that the HMM is useful for modeling pitch patterns of speech. However, we cannot apply the conventional discrete or continuous HMMs to pitch pattern modeling since the observation sequence of the pitch pattern is composed of one-dimensional continuous values and a discrete symbol which represents "unvoiced". MSD-HMM includes discrete HMMs and continuous mixture HMMs as special cases, and further can model the sequence of observation vectors with variable dimension including zero-dimensional observations, i.e., discrete symbols. As a result, MSD-HMMs can model pitch patterns without heuristic assumption. We derive a reestimation algorithm for the extended HMM and show that it can find a critical point of the likelihood function.
Monitoring Architecture for Lawful Interception in VoIP Networks
Authors: Balamurugan Karpagavinayagam, Radu State, Olivier Festor
Venue: Proceedings of the Second International Conference on Internet Monitoring and Protection (2007)

Lawful Interception is one of the main provisions needed for the security agencies to monitor a suspect or deal with criminal activities. The implementation of this was easy in the traditional telephone networks, because of its centralized administration. However this has become a tedious job with the emergence of VoIP technologies where voice traffic is carried over IP. In this paper, we discuss the challenges and propose a monitoring architecture for Lawful Interception on VoIP networks based on SIP. We also explain how this can be achieved from the existing prutocols and solutions like NETCONF and RBAC model. Finally, we present our prototype implementation of the Lawful Interception, the limitations and the difficulties that we found.
Learning ergonomics by doing job analysis
Authors: V. A. Petrushin
Venue: Proceedings of the 26th Annual Frontiers in Education - Volume 01 (1996)

This paper describes the pedagogical principles, structure and functionality of a class of multimedia learning environments designed for learning manufacturing in general and ergonomics in particular. It also presents the Ergonaut environment, which is intended for acquiring the knowledge and skills necessary to conduct ergonomic job analysis. The environment is an open one allowing the learner to explore and experiment with the resources and problems included. A rich set of tools and reference sources are provided in a manner similar to what the real world practicing ergonomist encounters. The learner is assigned a role on a simulated ergonomics team and must interact with and solicit help from other members of the ream in order to solve the problem completely. Explicit support is provided for the learning activities through scaffolding of the complete analysis/solution procedure, identification of learning needs, and reflective articulation. Throughout the learning process the learner constructs his or her own case library of problems and solutions which serve as the basis for reflecting on what has been learned and for future reference. Progress and actions are monitored to infer the student knowledge state and provide intelligent assistance when requested.
The effect of language model probability on pronunciation reduction
Authors: D. Jurafsky
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 200. on IEEE International Conference - Volume 02 (2001)

We investigate how the probability of a word affects its pronunciation. We examined 5618 tokens of the 10 most frequent (function) words in Switchboard and 2042 tokens of content words whose lexical form ends in a t or d. Our observations were drawn from the phonetically hand-transcribed subset of the Switchboard corpus, enabling us to code each word with its pronunciation and duration. Using linear and logistic regression to control for contextual factors, we show that words which have a high unigram, bigram, or reverse bigram (given the following word) probability are shorter, more likely to have a reduced vowel, and more likely to have a deleted final t or d. These results suggest that pronunciation models in speech recognition and synthesis should take into account word probability given both the previous and following words, for both content and function words.
CSBase: A Framework for Building Customized Grid Environments
Authors: Maria Julia de Lima, Cristina Ururahy, Ana Lucia de Moura, Taciana Melcop, Carlos Cassino, Marcelo N. dos Santos, Bruno Silvestre, Valeria Reis, Renato Cerqueira
Venue: Proceedings of the 15th IEEE International Workshops on Enabling Technologies: Infrastructure for Collaborative Enterprises (2006)

This paper describes CSBase, a framework that allows the development of customized grid environments. CSBase provides end-users with a simplified access to grid resources and applications. Although all CSBase instances share some common services, such as user and algorithm management services, each instance has its own web interface and specialized applications and services. CSBase is based on the experience gathered from projects developed by our research group in collaboration with industrial partners. This paper also describes some of these projects.
O(n)-Time and O(log n)-Space Image Component Labeling with Local Operations on SIMD Mesh Connected Computers
Authors: Hongchi Shi, Gerhard X. Ritter
Venue: Proceedings of the 1993 International Conference on Parallel Processing - Volume 03 (1993)

A new parallel algorithm for image component labeling with local operators on SIMD mesh connected computers is presented, providing a positive answer to the open question posed by several researchers whether there exists an O(n)-time and O(log n)-space local labeling algorithm on SIMD mesh connected computers. The algorithm uses a pipeline mechanism with stack-like data structures to achieve the lower bound of O(n) in time complexity and O(log n) in space complexity. Furthermore, the algorithm has very small multiplicative constants in its complexities.
Closed-form 2D angle estimation with arbitrary sampling lattices over a circular aperture
Authors: J. Ramos
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 05 (1996)

Simultaneous estimation of the azimuth and elevation arrival angle of each of a number of co-channel signals incident upon an array of antennas is addressed. A new closed-form algorithm that works for filled circular arrays (FCAs) with any sampling lattice is developed. Although based on TLS-ESPRIT, the algorithm does not require arrays exhibiting translational symmetry. The only constraint imposed on the array for the algorithm to perform properly is that the spacing between adjacent sensors across the aperture be roughly a half-wavelength or less on average. A set of ESPRIT-like equations with unknowns are of the form sin(/spl theta//sub i/)e/sup j/spl phi/i/, where /spl theta//sub i/ and /spl phi//sub i/ are the elevation and azimuth of the i-th source, respectively, is constructed by means of linear combinations of the received signals exploiting a recurrence property satisfied by Bessel functions. Simulations verifying the efficacy of the algorithm in conjunction with rectangular, hexagonal, polar raster, and random sampling lattices have been performed. An illustrative simulation is presented and compared with performance predicted by theoretical analysis.
WiDS: an integrated toolkit for distributed system development
Authors: Shiding Lin, Aimin Pan, Zheng Zhang, Rui Guo, Zhenyu Guo
Venue: Proceedings of the 10th conference on Hot Topics in Operating Systems - Volume 10 (2005)

Faced with a proliferation of distributed systems in research and production groups, we have devised the WiDS ecosystem of technologies to optimize the development and testing process for such systems. WiDS optimizes the process of developing an algorithm, testing its correctness in a debuggable environment, and testing its behavior at large scales in a distributed simulation. We have developed many distributed protocols and systems using WiDS, including a large-scale backup service that is robust enough to be deployed. We have also used WiDS to perform ultra-large scale (>1million instances) simulation of a production protocol. In this paper, we describe the principles and design of WiDS, share the lessons that we learned, and discuss on-going research that will further reduce programming and debugging difficulties of distributed systems.
Supernodal Sparse Cholesky Factorization on Distributed-Memory Multiprocessors
Authors: Kalluri Eswar, P. Sadayappan, Chua-Huang Huang, V. Visvanathan
Venue: Proceedings of the 1993 International Conference on Parallel Processing - Volume 03 (1993)

The concept of supernodes has been widely used in the design of algorithms for the solution of sparse linear systems of equations. This paper discusses the use of supernodes in the design of algorithms for sparse Cholesky factorization on distributed-memory multiprocessors. A new algorithm that is communication efficient, has good load balance, and benefits significantly from supernodes is presented.