ppxscal/embedding_network huggingface dataset:
Automated replay and failure detection for web applications
Authors: Sara Sprenkle, Emily Gibson, Sreedevi Sampath, Lori Pollock
Venue: Proceedings of the 20th IEEE/ACM international Conference on Automated software engineering (2005)

User-session-based testing of web applications gathers user sessions to create and continually update test suites based on real user input in the field. To support this approach during maintenance and beta testing phases, we have built an automated framework for testing web-based software that focuses on scalability and evolving the test suite automatically as the application's operational profile changes. This paper reports on the automation of the replay and oracle components for web applications, which pose issues beyond those in the equivalent testing steps for traditional, stand-alone applications. Concurrency, nondeterminism, dependence on persistent state and previous user sessions, a complex application infrastructure, and a large number of output formats necessitate developing different replay and oracle comparator operators, which have tradeoffs in fault detection effectiveness, precision of analysis, and efficiency. We have designed, implemented, and evaluated a set of automated replay techniques and oracle comparators for user-session-based testing of web applications. This paper describes the issues, algorithms, heuristics, and an experimental case study with user sessions for two web applications. From our results, we conclude that testers performing user-session-based testing should consider their expectations for program coverage and fault detection when choosing a replay and oracle technique.
Mod&egrave;le d'interaction mixte: la r&eacute;alit&eacute; mixte &agrave; la lumi&egrave;re des modalit&eacute;s d'interaction
Authors: Céline Coutrix, Laurence Nigay, Philippe Renevier
Venue: Proceedings of the 2nd French-speaking conference on Mobility and ubiquity computing (2005)

Mixed Reality seeks to smoothly link the physical and data processing (digital) environments. In recent years, mixed reality has been the subject of growing interest. Although mixed reality systems are becoming more prevalent, we still do not have a clear understanding of this interaction paradigm. This article introduces a new interaction model called Mixed Interaction model. It adopts a unifying point of view on mixed reality by considering the interaction modalities that are involved for defining mixed environments. This article presents the model after explaining its foundations, applies it to describe and compare existing systems and shows its generative power for designing new forms of mixed interaction.
Design for Verification with Dynamic Assertions
Authors: Peter C. Mehlitz, John Penix
Venue: Proceedings of the 29th Annual IEEE/NASA on Software Engineering Workshop (2005)

Completed design and implementation are often regarded as pre-requisites of any verification. While recent development methods establish testability as a design criterion, there is no corresponding design support for other verifi- cation methods like model checking and static analysis. Since these methods have inherent scalability problems, their application becomes more difficult where it is most needed - for complex systems. Our Design-for-Verification (D4V) approach attempts to close this gap using a variety of techniques, such as design patterns, APIs and source annotations. This paper presents a overview of D4V, and introduces Dynamic Assertions as one of the proposed D4V techniques. Dynamic Assertions are dedicated, non-intrusive check objects that are dynamically activated, evaluated and deactivated via assertions of their target objects. Since these check objects can have their own state, they can be used to verify a broad range of properties. Properties can be expressed in the target programming language, and checked in a testing environment. In addition, Dynamic Assertions can be configured via call contexts, making them suitable for connector-specific verification of component based systems.
Venture firms value analysis: a control rights allocation model
Authors: An Shi, Wang Jian, Zhao Zebin, He Lin
Venue: Proceedings of the IEEE International Conference on e-Business Engineering (2005)

The high risk and asymmetric information in venture investment make the allocation of control rights in venture firms a key to the success of that venture investment. Unlike previous studies, this paper defines the control right as the discrete variables in the zone of [0, 1]. In order to correctly evaluate investment opportunities and reasonably display the characteristics of phased investment, this paper analyzes the value of venture firms by using real options for different control rights allocation tactics. Regarded firm value as a restraint conditions, a decision-making model is established for quantative study on relationships between venture firm value and allocation of control rights. This paper not only provides the basis for venture capitalists and entrepreneurs to allocate control rights at venture firms and make decisions on investment, but also put forwards an evaluating method for venture firm value under different control rights allocation tactics. Computational experience demonstrates the solution process of the control rights allocation model presented in this paper.
Web Documents Clustering with Interest Links
Authors: Zifeng Cui, Baowen Xu, Weifeng Zhang, Junling Xu
Venue: Proceedings of the IEEE International Workshop (2005)

Web documents clustering is a kind of effective web mining technique. This paper proposes a novel web documents clustering algorithm from the perspective of web usage through analyzing WWW Cache, in which web documents reflect user's recent interests. According to the rich semantic information embedded in hyperlinks in web documents, we first extracts hyperlinks from web documents and the web documents in WWW Cache is modeled as an undirected web graph in our approach. Then the clustering algorithm based on the web graph model is given. Finally, Experimental results verify that the algorithm is efficient and feasible.
Reliable Digital Circuits Design using Sigma-Delta Modulated Signals
Authors: Erik Schuler, Luigi Carro
Venue: Proceedings of the 20th IEEE International Symposium on Defect and Fault Tolerance in VLSI Systems (2005)

As the transistor gate length goes straightforward to the sub-micron dimension, the possibilities of occurrence of external interferences in these devices also increase. Moreover, the process variability will further degrade this scenario. The direct effect of such external and/or intrinsic interferences is, in many cases, the total mismatch between the desired answer of the system and the achieved answer resulting from single bit flips. This way, new techniques must be studied in order to guarantee the correct operation of these systems. This work presents the use of a totally digital sigma-delta modulator that is used to develop arithmetic operations, which are further used to develop a FIR filter. Simulations results show that, even with the insertion of a large amount of faults, one can still obtain a non-faulty behavior in the SNR of complex application.
Gaussian-type Quadrature Rules for Müntz Systems
Authors: Gradimir V. Milovanovic, Aleksandar S. Cvetkovic
Venue: SIAM Journal on Scientific Computing (2005)

A method for constructing the generalized Gaussian quadrature rules for Müntz polynomials on $(0,1)$ is given. Such quadratures possess several properties of the classical Gaussian formulae (for polynomial systems), such as positivity of the weights, rapid convergence, etc. They can be applied to the wide class of functions, including smooth functions, as well as functions with end-point singularities, such as those in boundary-contact value problems, integral equations with singular kernels, complex analysis, potential theory, etc. The constructive method is based on an application of orthogonal Müntz polynomials introduced by Badalyan [{\it Akad. Nauk Armyan. SSR. Izv. Fiz.-Mat. Estest. Tehn. Nauk}, 8 (1955), pp. 1--28; 9 (1956), pp. 3--22 (Russian; Armenian summary)] and studied intensively by Borwein, Erdélyi, and Zhang [{\it Trans. Amer. Math. Soc}., 342 (1994), pp. 523--542], as well as by Milovanovi&cacute; on a numerical procedure for evaluation of such polynomials with high precision [{\it Müntz orthogonal polynomials and their numerical evaluation}, in Applications and Computation of Orthogonal Polynomials, Internat. Ser. Numer. Math. 131, W. Gautschi, G. H. Golub, and G. Opfer, eds., Birkhäuser, Basel, 1999, pp. 179--194]. The method is numerically stable. Some numerical examples are included.
Uniting cartoon textures with computer assisted animation
Authors: William Van Haevre, Fabian Di Fiore, Frank Van Reeth
Venue: Proceedings of the 3rd international conference on Computer graphics and interactive techniques in Australasia and South East Asia (2005)

We present a novel method to create perpetual animations from a small set of given keyframes. Existing approaches either are limited to re-sequencing large amounts of existing image/video data, or to interpolating vector based drawings.Our approach benefits from several ideas and techniques from video textures, computer-assisted animation and motion graphs. It combines the re-sequencing of existing material with the automatic generation of new data. Furthermore, the animator can interfere with the animation process at each arbitrary moment.First, a given set of keyframes is used to automatically generate a set of in-betweens. The amount of in-betweens required, depends on a distance metric preventing possible visual discontinuities. Next, an optimised cost graph is derived from the generated frames, indicating for all keyframes how many steps are required to travel from one keyframe to another. Finally, by rearranging the generated sets of in-betweens according to the cost graph, new animations can be synthesised from the generated data.The resulting animations are smooth, broader than the input data and require no postprocessing.
Improving APS with Anchor Selection in Anisotropic Sensor Networks
Authors: King-Yip Cheng, Vincent Tam, King-Shan Lui
Venue: Proceedings of the Joint International Conference on Autonomic and Autonomous Systems and International Conference on Networking and Services (2005)

Sensor networks are useful for environmental monitoring, military applications, disaster management, etc. In many applications, sensors are supposed to know their geographic locations. Some localization methods of sensor networks have been developed. In these methods, nodes equipped with special hardware to obtain precise location information, namely the anchor nodes, are employed to derive the locations of other nodes. Most of the existing work focus on increasing the accuracy in position estimation by using different heuristic-based or mathematical techniques. In this paper, we show that selection of anchor nodes is a significant factor to the problem. We first demonstrate that using all anchor nodes does not give the most precise position. We then identify criteria of selecting "good" anchor nodes to achieve more accurate position estimation in anisotropic sensor networks. We develop a simple heuristicbased algorithm to select "good" anchor nodes and evaluate its performance using simulations.
Risk analysis and sensitivity analysis: antithesis or synthesis?
Authors: Jack P. C. Kleijnen
Venue: ACM SIGSIM Simulation Digest (1983)

If a dynamic model assumes parameters constant over time, then the posterior mean (i.e. the mean conditional on specific values of these parameters) is relevant. Since parameters are unknown, they must be estimated. Sensitivity analysis quantifies the effects of incorrectly specified values of the parameters. If these effects are important then additional information on the parameters might be collected; otherwise robust solutions are to be sought. If these options do not work then risk analysis can quantify the probability of specific outputs, incorporating the probability distribution of the estimated parameters. Sensitivity analysis changes the values of parameters systematically, whereas risk analysis samples the parameter values. Simple queuing and econometric examples illustrate the two approaches.
Computer game-flow design
Authors: M. J. Taylor, D. Gresty, M. Baskett
Venue: Computers in Entertainment (CIE) (2006)

Computer games are a rapidly growing segment of the entertainment industry. Design and development of modern computer games can be a complex activity involving many participants from a variety of disciplines. However, computer game design approaches typically appear to be less formalised than those used for other types of software systems. In this article we describe an approach to computer game-flow design intended for the design of individual game levels within a computer game and demonstrate its application in practice.
Analysis of the Suzuki-Kasami Algorithm with SAL Model Checkers
Authors: Kazuhiro Ogata, Kokichi Futatsugi
Venue: Proceedings of the The Fifth International Conference on Computer and Information Technology (2005)

We report on a case study in which SAL model checkers have been used to analyze the Suzuki-Kasami distributed mutual exclusion algorithm with respect to the mutual exclusion property and the lockout freedom property. SAL includes five different model checkers. In the case study, we have used two model checkers SMC (Symbolic Model Checker) and infBMC (infinite Bounded Model Checker). SMC has concluded that a finite-state model of the algorithm has the mutual exclusion property, but has found counterexample to the lockout freedom property. The counterexample has led to one possible modification that makes the algorithm lockout free. We have also used infBMC to prove that an infinite-state model of the algorithm has the mutual exclusion property by k-induction.
Evaluating the XCS learning classifier system in competitive simultaneous learning environments
Authors: Neera P. Sood, Ashley G. Williams, Kenneth A. De Jong
Venue: Proceedings of the 2005 workshops on Genetic and evolutionary computation (2005)

We would like to evaluate the XCS [1] Learning Classifier System (LCS [2]) to see if it can be applied to a specific aviation industry problem. We are interested in seeing whether it can offer an accessible representation model and evolve feasible strategies to predict future demand patterns endogenously, and in parallel with the supply side simulation.
Adaptive Soft Bid Determination in Bidding Strategies for Continuous Double Auctions
Authors: Huiye Ma, Ho-fung Leung
Venue: Proceedings of the 17th IEEE International Conference on Tools with Artificial Intelligence (2005)

There are several bidding strategies proposed in the literature for agents in Continuous Double Auctions (CDAs). For most bidding strategies, the asks or bids determined are hard and cannot be compromised. However, for human traders, we notice that the decisions are usually soft and adaptive in different situations. Therefore, we believe that integrating softness and adaptivity into the bidding strategies can enhance the performance of agents. Experimental results confirm that when agents using different bidding strategies make adaptive and soft compromise in various situations, their performance is improved significantly in general. In order to guide agents to adopt soft asks or bids in dynamic and unknown markets, an adaptive mechanism is proposed to adjust the degree of softness of soft asks or bids according to the realtime market context. Experiments results show that agents adopting the adaptive mechanism generally outperform the corresponding agents without the adaptive mechanism.
Unifier: unifying cache management and communication buffer management for PVFS over InfiniBand
Authors: Jiesheng Wu, P. Wyckoff, D. Panda, R. Ross
Venue: Proceedings of the 2004 IEEE International Symposium on Cluster Computing and the Grid (2004)

The advent of networking technologies and high performance transport protocols facilitates the service of storage over networks. However, they pose challenges in integration and interaction among storage server application components and system components. In this paper, we put forward a component, called Unifier, to provide more efficient integration and better interaction among these components. Unifier has three notable features: (1) Unifier integrates cache management and communication buffer management; it offers a single copy data sharing among all components in a server application safely and concurrently; (2) it reduces memory registration and deregistration costs to enable applications to take full advantage of RDMA operations; (3) it provides means to achieve adaptation, application-specific optimization, and better cooperation among different components. This work presents the design and implementation of Unifier. This component has been deployed and evaluated in a version of PVFS1 implemented over InfiniBand. Experimental results show performance improvements between 30% and 70% over other approaches. Better scalability is also achieved by the PVFS I/O servers.
An Interactive 3D Integration of Parallel Coordinates and Star Glyphs
Authors: Elena Fanea, Sheelagh Carpendale, Tobias Isenberg
Venue: Proceedings of the Proceedings of the 2005 IEEE Symposium on Information Visualization (2005)

Parallel Coordinates are a powerful method for visualizing multidimensional data but, when applied to large data sets, they become cluttered and difficult to read. Star Glyphs, on the other hand, can be used to display either the attributes of a data item or the values across all items for a single attribute. Star Glyphs may readily provide a quick impression; however, since the full data set will require multiple glyphs, overall readings are more difficult. We present Parallel Glyphs, an interactive integration of the visual representations of Parallel Coordinates and Star Glyphs that utilizes the advantages of both representations to offset the disadvantages they have separately. We discuss the role of uniform and stepped colour scales in the visual comparison of non-adjacent items and Star Glyphs. Parallel Glyphs provide capabilities for focus-in-context exploration using two types of lenses and interactions specific to the 3D space.
On Understanding of Transient Interdomain Routing Failures
Authors: Feng Wang, Lixin Gao, Jia Wang, Jian Qiu
Venue: Proceedings of the 13TH IEEE International Conference on Network Protocols (2005)

The convergence time of the interdomain routing protocol, BGP, can last as long as 30 minutes [14, 15]. Yet, routing behavior during BGP route convergence is poorly understood. BGP can experience transient loss of reachability during route convergence. We refer to this transient loss of reachability during route convergence as transient routing failure. Transient routing failures can lead to end-toend forwarding failures. Furthermore, the prolonged routing failures can make deploying applications such as voiceover- IP and interactive games infeasible. In this paper, we study the extent to which transient interdomain routing failures occur in the Internet and the duration that these failures can last through both analysis and measurement. We first present a formal model that captures the transient behavior of the interdomain routing protocol. We derive suf- ficient conditions for and an upper bound for the duration of transient routing failures. Furthermore, we demonstrate the occurrence and duration of transient routing failures in the Internet through measurement. We find that majority of transient failures occur under the commonly applied routing policy setting, and popular and unpopular prefixes can experience transient failures.
Performance Modeling and Tuning Strategies of Mixed Mode Collective Communications
Authors: Meng-Shiou Wu, Ricky A. Kendall, Kyle Wright, Zhao Zhang
Venue: Proceedings of the 2005 ACM/IEEE conference on Supercomputing (2005)

On SMP clusters, mixed mode collective MPI communications, which use shared memory communications within SMP nodes and point-to-point communications between SMP nodes, are more efficient than conventional implementations. In a previous study, we proposed several new methods that made mixed mode collective communications significantly faster than the pure point-to-point ones. However, the optimal performance required the tuning of many parameters, which was done by testing every possible setting and was very time consuming. In this study, we propose a new performance model that considers the special characteristics of mixed mode collective communications. The model provides good predictions to reduce most settings without testing by execution. It considers both shared-memory and point-to-point communications, while existing performance models only consider the point-to-point ones. Based on this model, we develop a number of tuning strategies that reduce the overall tuning time to only 10% of previous tuning time.
Robust one-class clustering using hybrid global and local search
Authors: Gunjan Gupta, Joydeep Ghosh
Venue: Proceedings of the 22nd international conference on Machine learning (2005)

Unsupervised learning methods often involve summarizing the data using a small number of parameters. In certain domains, only a small subset of the available data is relevant for the problem. One-Class Classification or One-Class Clustering attempts to find a useful subset by locating a dense region in the data. In particular, a recently proposed algorithm called One-Class Information Ball (OC-IB) shows the advantage of modeling a small set of highly coherent points as opposed to pruning outliers. We present several modifications to OC-IB and integrate it with a global search that results in several improvements such as deterministic results, optimality guarantees, control over cluster size and extension to other cost functions. Empirical studies yield significantly better results on various real and artificial data.
On the optimal distribution of sensors in a random field
Authors: Xin Zhang, Stephen B. Wicker
Venue: ACM Transactions on Sensor Networks (TOSN) (2005)

This article considers the problem of distributing sensors to observe a random field while meeting a series of energy and coverage constraints. In the network under consideration, N identical sensors are to be distributed, with each sensor sending data to a single fusion center at a fixed rate &Delta; R. The problem of sensor allocation to the coverage area is reduced to the problem of allocating sensors to cells by first partitioning the coverage field into cells, and then assuming that sensors in the same cells make the same observations. It is shown that the resulting sensor allocation problem is equivalent to a discrete form of the rate allocation problem, a well-known problem in the field of information theory. General guidelines for solving this problem are provided.
A rigorous approach for proving model refactorings
Authors: Rohit Gheyi, Tiago Massoni, Paulo Borba
Venue: Proceedings of the 20th IEEE/ACM international Conference on Automated software engineering (2005)

Both model and program refactorings are usually proposed in an ad hoc way because it is difficult to prove that they are sound with respect to a formal semantics. In this paper, we propose guidelines on how to rigorously prove model refactorings for Alloy, a formal object-oriented modeling language. We use the Prototype Verification System (PVS) to specify and prove the soundness of the transformations. Proposing refactorings in this way can facilitate not only design, but also improve the quality of refactoring tools.
Implementation of consensus-based hybrid recommendation in different web-based systems
Authors: Janusz Sobecki
Venue: Proceedings of the 5th International Conference on Intelligent Systems Design and Applications (2005)

Hybrid recommendation enables overcoming disadvantages of the basic recommendation methods: demographic, collaborative and content-based. In this paper the consensus-based hybrid recommendation is presented. Then some examples of its implementation to different web-based systems are shown.