ppxscal/embedding_network huggingface dataset:
A Versioning Scheme for Consistent Evolution of OO Applications
Authors: Umesh Bellur, Vallieswaran V
Venue: Proceedings of the XIII Asia Pacific Software Engineering Conference (2006)

Agile software development practices encourage the evolutionary paradigm of software construction. The result is a series of changes made to the code and designs starting from an initial version. However, rarely do designs keep pace with the changes in code - rather they are often outdated with the first few releases. The problem is only compounded by the various design representations that together comprise the design (state diagrams, class diagrams etc.). This adversely affects development since it is best to begin the process of evolution with the latest design representation that is consistent with the code since it provides a high level view of the system that is easy to understand. Such evolutionary practices therefore present three main challenges from a development environment perspective: (1) Consistency amongst different design representations (2) Traceability of design into code and vice versa (3) Versioning of designs along with code to maintain a consistent view of the application evolution. Our research presents solutions to all three issues starting from a relational meta-model of development and design entities. We have already published results that showcase our solution to the first two problems - in this paper we present an algorithm to version design and code so that the developer always sees a consistent snapshot and prove that this algorithm satisfies the safety requirements of consistency. We also outline an architecture rooted in the layered SCM model to support our versioning scheme.
Heavy-traffic approximations for linear networks operating under α-fair bandwidth-sharing policies
Authors: P. Lieshout, S. Borst, M. Mandjes
Venue: Proceedings of the 1st international conference on Performance evaluation methodolgies and tools (2006)

We consider the flow-level performance of a linear network supporting elastic traffic, where the service capacity is shared among the various classes of users according to a weighted alpha-fair policy. Assuming Poisson arrivals and exponentially distributed service requirements for each class, the dynamics of the user population may be described by a Markov process. While valuable stability results have been established for the family of alpha-fair policies, the distribution of the number of active users has remained intractable in all but a few special cases. In order to gain further insight in the flow-level performance in more general scenarios, we develop approximations for the mean number of users based on the assumption that one or two of the nodes experience heavy-traffic conditions.In case of just a single 'bottleneck' node, we exploit the fact that this node approximately behaves as a two-class Discriminatory Processor-Sharing model. In the case that there are two nodes critically loaded, we rely on the observation that the joint workload process at these nodes is asymptotically independent of the fairness coefficient alpha, provided all classes have equal weights. In particular, the distribution of the joint workload process is roughly equal to that for an unweighted Proportional Fair policy, which is exactly known. In both cases, the numbers of users at non-bottleneck nodes can be approximated by that in an M/M/1 queue with reduced service capacity. Extensive numerical experiments indicate that the resulting approximations tend to be reasonably accurate across a wide range of parameters, even at relatively moderate load values. The approximations for the mean number of users also provide useful estimates for the mean transfer delays and user throughputs.
A Test Suite for the Evaluation of Mobile Agent Platform Security
Authors: Axel Burkle, Barbara Essendorfer, Alice Hertel, Wilmuth Muller, Martin Wieser
Venue: Proceedings of the IEEE/WIC/ACM international conference on Intelligent Agent Technology (2006)

Agent mobility requires additional security measures. While the theoretical aspects of mobile agent security have been widely studied, there are few studies about the security levels of current agent platforms. In this paper, test cases are proposed to assess agent platform security. These tests focus on malicious agents trying to attack other agents or the agency. Currently, they have been carried out for two agent platforms: JADE and SeMoA. These tests show which of the known theoretical security problems are relevant in practice. Furthermore, they reveal how these problems are addressed by the respective platform and what security flaws are present.
Classroom goal structures for educational math game application
Authors: Fengfeng Ke
Venue: Proceedings of the 7th international conference on Learning sciences (2006)

This field study investigated the application of cooperative, competitive, and individualistic goal structures in classroom use of educational math games and its impact on students' math performance and math learning attitudes. 124 5th -grade students were recruited and randomly assigned to a Teams-Games-Tournament cooperative, interpersonal competitive, or individualistic gaming condition. A state-standards-based math exam and an inventory on attitudes toward mathematics were used in pretest and posttest. Students' gender, socio economic status, and prior math ability were examined as the moderating variables. Results indicated that gaming in cooperative goal structure was most effective in promoting positive math attitudes while classroom goal structure for gaming had no significant impact on students' math test performance. It was also found that students of different socio-economic statuses were influenced differently by the gaming conditions.
POLARMAP - Efficient Visualisation of High Dimensional Data
Authors: Frank Rehm, Frank Klawonn, Rudolf Kruse
Venue: Proceedings of the conference on Information Visualization (2006)

Multidimensional scaling provides low-dimensional visualisation of high-dimensional feature vectors. This is a very important step in data preprocessing because it helps the user to appraise which methods to use for further data analysis. But a well known problem with conventionalMDS is the quadratic need of space and time. Beside this, a transformation of MDS must be completely recomputed if additional feature vectors have to be considered. The POLARMAP algorithm, presented in this paper, learns a function, similar to NeuroScale, but with lower computational costs, that maps high-dimensional feature vectors to a 2- dimensional feature space. With the obtained function even new feature vectors can be mapped to the target space.
Universal Data Forecasting with an Adaptive Approach and Seasonal Technique
Authors: Phayung Meesad, Tong Srikhacha
Venue: Proceedings of the International Conference on Computational Inteligence for Modelling Control and Automation and International Conference on Intelligent Agents Web Technologies and International Commerce (2006)

The main component of observation data includes both trend and seasonal effects. The represented equations of forecasting models like ARIMA seem to have too many explained parameters when we need more accuracy in time series prediction. To apply these elaborate and beautifully crafted techniques we require an advanced level of knowledge and sophistication only available from specialists. However, it is more suitable if one who does not familiar with complex forecasting models can use a simple equation like applied exponential smoothing model for forecasting. We propose a simple suitable model that can be applied to most kinds of data observation types with good prediction outcome. The proposed model can be applied to calculate in a simple spreadsheet which yields good short term prediction with low error rate.
An Efficient Reference-Based Approach to Outlier Detection in Large Datasets
Authors: Yaling Pei, Osmar R. Zaiane, Yong Gao
Venue: Proceedings of the Sixth International Conference on Data Mining (2006)

A bottleneck to detecting distance and density based outliers is that a nearest-neighbor search is required for each of the data points, resulting in a quadratic number of pairwise distance evaluations. In this paper, we propose a new method that uses the relative degree of density with respect to a fixed set of reference points to approximate the degree of density defined in terms of nearest neighbors of a data point. The running time of our algorithm based on this approximation is O(R_n log n) where n is the size of dataset and R is the number of reference points. Candidate outliers are ranked based on the outlier score assigned to each data point. Theoretical analysis and empirical studies show that our method is effective, efficient, and highly scalable to very large datasets.
A Link Adaptation Solution to IEEE 802.16d WMAN
Authors: Nai'an Liu, Dechun Sun, Wuqiang Li, Changxing Pei
Venue: Proceedings of the Seventh International Conference on Parallel and Distributed Computing, Applications and Technologies (2006)

IEEE 802.16d adopts HARQ (Hybrid Automatic Retransmission Request) and AMC (Automatic modulation and coding) as link adaptive mechanism. This paper proposes a link adaptive solution based on a simple but effective sliding window mechanism. Also a signal constellation rearrangement strategy is present to average out reliabilities of bits carried by repeatedly transmitted symbols over retransmissions in order that the receiver can gain better performance using Chase Combining.
Using pivots to index for support vector machine queries
Authors: Arun Qamra, Edward Y. Chang
Venue: Proceedings of the 2nd international workshop on Computer vision meets databases (2005)

In many data-mining applications, Support Vector Machines are used to learn query concepts, and then the learned SVM is used to find the corresponding best matches in a given dataset. When the dataset is large, naively scanning the entire dataset to find the instances with the highest classification scores is not practical. An indexing strategy is thus desirable for scalability. In contrast to queries in traditional similarity search scenarios which are in the form of an input space point, SVM queries are hyperplanes in a (kernel function induced) feature space, and the best matches are instances farthest from the hyperplane. Also, the kernel parameters used, and hence the feature space used, may vary with the query. These issues make the problem challenging. In this work, we propose an indexing strategy that uses pivots (selected using PCA or KPCA) to prune irrelevant instances from the dataset, and zoom in on a smaller candidate set, to efficiently answer SVM queries.
On the Prediction of Java Object Lifetimes
Authors: Hajime Inoue Darko Stefanovic, Stephanie Forrest
Venue: IEEE Transactions on Computers (2006)

Accurately predicting object lifetimes is important for improving memory management systems. Current garbage collectors make relatively coarse-grained predictions (e.g., "short-lived” versus "long-lived”) and rely on application-independent heuristics related to the local characteristics of an allocation. This paper introduces a prediction method which is fully precise and makes its predictions based on application-specific training rather than application-independent heuristics. By "fully precise” we mean that the granularity of predictions is equal to the smallest unit of allocation. The method described here is the first to combine high precision and efficiency in a single lifetime predictor. Fully precise prediction enables us, for the first time, to study zero-lifetime objects. The paper reports results showing that zero-lifetime objects comprise a significant fraction of object allocations in benchmark programs for the Java programming language and that they are correlated with their allocation context (the call stack and allocation site). Beyond zero-lifetime objects, the paper reports results on predicting longer lived objects, where, in some cases, it is possible to predict the lifetime of objects based on their allocation context (the call stack and allocation site) well. For the SPEC benchmark programs, the number of dynamically allocated objects whose call sites have accurate predictors ranges from 0.2 percent to 61 percent. This method could potentially improve the performance of garbage collectors. The paper proposes a death-ordered collector (DOC) and analyzes its implementation overheads and its best possible performance. The study shows how memory performance could be enhanced using the extra information provided by fully precise prediction.
On two DES implementations secure against differential power analysis in smart-cards
Authors: Jiqiang Lv
Venue: Information and Computation (2006)

Masking is one of the efficient and easily implemented countermeasures to protect cryptographic algorithms in such resource limited environments as smart-cards from differential power analysis as well as simple power analysis that were first introduced by Kocher et al. in 1999. To defend differential power analysis attacks, Akkar and Giraud presented a Transformed Masking Method and applied it to DES implementation in 2001. Unfortunately, in 2003, Akkar and Goubin showed a superposition attack that actually is a high-order differential power analysis attack on Akkar and Giraud's DES implementation using Transformed Masking Method, and finally they presented a DES implementation using their proposed Unique Masking Method to defend any order differential power analysis attacks, which was later improved by Akkar, Bévan and Goubin in 2004. In this paper, by exploiting a new artifice to classify the electric consumption curves, we show that Akkar, Bévan and Goubin's improved DES implementation using Unique Masking Method is still vulnerable to a high-order differential power analysis attack. Besides, we find it is also vulnerable to a superposition attack. We also present four new differential power analysis attacks on Akkar and Giraud's DES implementation using Transformed Masking Method.
Monte Carlo methods for American options
Authors: Russel E. Caflisch, Suneal Chaudhary
Venue: Proceedings of the 36th conference on Winter simulation (2004)

We review the basic properties of American options and the difficulties of applying Monte Carlo valuation to American options. Recent progress on the Least Squares Monte Carlo (LSM) method is described, including the use of quasi-random sequences in LSM. A particle approach to evaluation of American options is formulated. Conclusions and prospects for future research are discussed.
The control of dynamic regimes of the rhythm within Feigenbaum scenario of route to chaos
Authors: O. P. Skljarov, T. N. Bortnik
Venue: Proceedings of the 2003 International Conference on Physics and Control - Volume 2 (2003)

Dynamics of rate and rhythm traced in speech during correction of a stuttering is submitted in this paper. The various strategy of correction of a stuttering in dependence of behavior of rate and rhythm are detected. This trajectory has conforming to a modification of rate and a rhythm during correction. Two basic strategy are a method of "pulled speech" and the method "tunnel passage". Combination of these strategy has allowed to increase efficacy of correction of a stuttering. The outcomes are interpreted in the terms response-contingent feed-back reacting in Hopfield network. Both strategy take the explanation within the framework of the theory of control of dynamic regimes of a rhythm within Feigenbaum scenario of route to chaos.
Improving Churn Resistance of P2P Data Stores Based on the Hypercube
Authors: Dietrich Fahrenholtz, Volker Turau
Venue: Proceedings of the Proceedings of The Fifth International Symposium on Parallel and Distributed Computing (2006)

P2P data stores excel if availability of inserted data items must be guaranteed. Their inherent mechanisms to counter peer population dynamics make them suitable for a wide range of application domains. This paper presents and analyzes the fusion maintenance operation. It aims at reorganizing parts of our P2P data store in case the peer population shrinks so much that data availability is threatened. To this end, we present a formal cost model that peers use to estimate the optimal invocation point of a fusion. Finally, we present experimental results that validate our cost model by simulating various network conditions.
Synchronous + Concurrent + Sequential = Earlier than + Not later than
Authors: Gabriel Juhas, Robert Lorenz, Sebastian Mauser
Venue: Proceedings of the Sixth International Conference on Application of Concurrency to System Design (2006)

In this paper, we show how to obtain causal semantics distinguishing "earlier than" and "not later than" causality between events from algebraic semantics of Petri nets. Janicki and Koutny introduced so called stratified order structures (so-structures) to describe such causal semantics. To obtain algebraic semantics, we redefine our own algebraic approach generating rewrite terms via partial operations of synchronous composition, concurrent composition and sequential composition. These terms are used to produce so-structures which define causal behavior consistent with the (operational) step semantics. For concrete Petri net classes with causal semantics derived from processes minimal so-structures obtained from rewrite terms coincide with minimal so-structures given by processes. This is demonstrated exemplarily for elementary nets with inhibitor arcs.
A Quantitive Context Model of Software Process Patterns and Its Application Method
Authors: Jiakuan Ma, Yasha Wang
Venue: Proceedings of the Sixth International Conference on Quality Software (2006)

Defining proper process is an important way of improving software quality and development productivity. However, software process design is a common issue faced by many organizations. The introduction of process patterns provides an effective solution to the challenge. In previous studies, natural language is commonly employed to describe the context of process patterns, which not only decreases the accuracy of pattern selection made by users, but also goes against the implementation of computer aided experience extraction. Aiming at such a problem, we propose in this paper a quantitive context model of software process patterns and its corresponding application method. A concrete example is also presented in order to further illuminate our idea,. In the end, we briefly introduce the relative tool support in PKUPM (PeKing University Project Management).
A MAP solution to off-line segmentation of signals
Authors: P. M. Djuric
Venue: Proceedings of the Acoustics, Speech, and Signal Processing,1994. on IEEE International Conference - Volume 04 (1994)

A new criterion for off-line segmentation of signals is proposed. The derivation is general in the sense that it is valid for signals that are parameterized by linear or nonlinear functions embedded in additive noise, be it non-white or non-Gaussian. In addition, a penalty function is developed whose terms are easily justified and interpreted. As a special case, a criterion for segmentation of polynomial signals in white Gaussian noise is analyzed and compared with the AIC and MDL. The simulation results show that our criterion markedly outperforms its popular counterparts.
Facial Composite System Using Genetic Algorithm
Authors: Mayada F. Abdul Halim, Hussein Hamdi Al-Fiadh
Venue: Proceedings of the International Conference on Computer Graphics, Imaging and Visualisation (2006)

Although humans have excellent facial recognition ability, it is widely recognized that they often have great difficulty recalling facial characteristics in sufficient detail to produce an accurate composite. In this paper, we propose a newly facial composite system -to be coined as Genetic-based Facial Composite System- GFCS- that depends on genetic algorithm as a facial search method. The system consists of two main activities. In the first activity (database preparation), a number of steps are applied to extract face parts from the database image. While in the second activity (facial composite reconstruction), genetic algorithm is used for reconstructing facial composite image seemed likeness to eye witness facial image. Moreover, GFCS provides utility tools to enhance the resulted facial composite image. The results from using GFCS clarified that the system is successful in producing a good likeness to a witness mental image.
DAG Synchronization Constraint Language for Business Processes
Authors: Qinyi Wu, Akhil Sahai
Venue: Proceedings of the The 8th IEEE International Conference on E-Commerce Technology and The 3rd IEEE International Conference on Enterprise Computing, E-Commerce, and E-Services (2006)

Correct synchronization among activities is critical in a business process. Current workflow languages such as BPEL specify the control flow of processes explicitly. However, their procedural style may cause inflexibility and tangled code. We propose DSCL (Dag-acyclic-graph Synchronization Constraint Language) to achieve three desirable properties for a synchronization modeling language: declarative syntax, fine granularity and validation support. Instead of composing service out of structured constructs, DSCL declaratively describe the synchronization constraints in three basic relations on activity states. The state relationships collectively determine the execution order of activities in a composite process. The relationships are automatically translated into Petri Nets and simulated in the CPN/Tools, from which several correctness criteria can be validated for the composite process. We illustrate the advantages of DSCL with a Purchasing workflow example from BPEL 1.0 specification, and verify its correctness using CPN/Tools.
Special purpose correlation functions for improved signal detection and parameter estimation
Authors: D. Nelson
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1993. ICASSP-93 Vol 4., 1993 IEEE International Conference on - Volume 04 (1993)

A compilation of several correlation functions which were developed by the author and have been used for several years in signal analysis applications is given. The affine invariant pseudometric is a correlation function normalized to be independent of power, DC bias, and phase rotation. It was developed to track radar video sync pulses. It has recently been successfully used to track glottal pulses in voiced speech. The cross-power spectrum represents a significant improvement over standard power-spectral methods for recovering weak stationary tones in noise. The harmonic rejecting correlation function is a variant of the Wigner transform which resolves fundamentals from harmonic and subharmonic features produced by periodic waveforms. Each of these algorithms has been tested and used on a variety of data. Most importantly, for each of the methods described here, closed form solutions are derived, which enable easy implementations.
Analysis of the Optimal Inspection and Maintenance Policy for the Deteriorating System with Phase-Type Approximation
Authors: Guo Bo, Cheng Zhijun
Venue: Proceedings of the International Conference on Computational Inteligence for Modelling Control and Automation and International Conference on Intelligent Agents Web Technologies and International Commerce (2006)

The optimal model of inspection and maintenance for the deteriorating system is presented with the semi- Markov decision process. Since the sojourn time of deteriorating state, inspection interval and maintenance time are the stochastic variables which follow the general distribution, the phase-type approach is proposed to preserve the analytical tractability of the transition probability matrix. To solve the problem that the PH distribution changes the state space of system, the value iteration algorithm for the semi-Markov decision process is improved to get the optimal inspection and maintenance policy. In the process of iteration, the decision of policy within the subset is restrict to be the same. With this policy the long-run average cost rate of system is minimized. Finally, the numerical example is put forward to illustrate the implementation of the model and iteration algorithm.