ppxscal/embedding_network huggingface dataset:
Constructing Platform Independent Models of Web Application
Authors: Chengwan He, Fei He, Keqing He, Wenjie Tu
Venue: Proceedings of the IEEE International Workshop (2005)

Web application has some interesting and special characteristics, such as complicated structure and variety of the implementation method, etc. So its model is generally very difficult to be reused. This paper proposes a platform independent web application modeling method based on template role model and MDA (Model Driven Architecture). The basic idea of this method is to build template role models of application, and to map role model to class model through the rules of role composition and assignment, which can improve the reusability of models at different level of abstraction. Finally an example applying this method to a simplified enterprise project management information system modeling and the research direction of perfecting this method are provided.
Atomic Wedgie: Efficient Query Filtering for Streaming Times Series
Authors: Li Wei, Eamonn Keogh, Helga Van Herle, Agenor Mafra-Neto
Venue: Proceedings of the Fifth IEEE International Conference on Data Mining (2005)

In many applications it is desirable to monitor a streaming time series for predefined patterns. In domains as diverse as the monitoring of space telemetry, patient intensive care data, and insect populations, where data streams at a high rate and the number of predefined patterns is large, it may be impossible for the comparison algorithm to keep up. We propose a novel technique that exploits the commonality among the predefined patterns to allow monitoring at higher bandwidths, while maintaining a guarantee of no false dismissals. Our approach is based on the widely used envelope-based lower bounding technique. Extensive experiments demonstrate that our approach achieves tremendous improvements in performance in the offline case, and significant improvements in the fastest possible arrival rate of the data stream that can be processed with guaranteed no false dismissal.
Geometry-Driven Photorealistic Facial Expression Synthesis
Authors: Qingshan Zhang Zicheng Liu, Baining Guo, Demetri Terzopoulos, Heung-Yeung Shum
Venue: IEEE Transactions on Visualization and Computer Graphics (2006)

Expression mapping (also called performance driven animation) has been a popular method for generating facial animations. A shortcoming of this method is that it does not generate expression details such as the wrinkles due to skin deformations. In this paper, we provide a solution to this problem. We have developed a geometry-driven facial expression synthesis system. Given feature point positions (the geometry) of a facial expression, our system automatically synthesizes a corresponding expression image that includes photorealistic and natural looking expression details. Due to the difficulty of point tracking, the number of feature points required by the synthesis system is, in general, more than what is directly available from a performance sequence. We have developed a technique to infer the missing feature point motions from the tracked subset by using an example-based approach. Another application of our system is expression editing where the user drags feature points while the system interactively generates facial expressions with skin deformation details.
A Monte Carlo approach for the solution of the simple quadratic and cubic self-avoiding random walk
Authors: Buddy L. Myers, Norbert L. Enrick, Richard T. Redmond, John H. Lindgren
Venue: ACM SIGSIM Simulation Digest (1983)

A procedure for virtually memory-free Monte-Carlo simulation of the self-avoiding random walk (SAW) in a two-dimensional network and in a simple cubic lattice has been developed. It is highly efficient in yielding values of the intrachain meansquare end-to-end distance <r2n> for chains up to n = 1000 and n = 400 steps, for the two and three-dimensional cases respectively. The number <u>N</u> of walks per each chain of <u>n</u> steps involved n = 500 to N = 3000.
Fixing Number of Floors for Virtual Voice-Only Conference - an Empirical Study
Authors: R. Venkatesha Prasad, H. N. Shankar, Przemyslaw Pawelczak, H. S. Jamadagni
Venue: Proceedings of the Seventh IEEE International Symposium on Multimedia (2005)

For efficient Computer Supported Cooperative Work (CSCW) audio conferencing is an essential component where video and text are add-ons. The specifications for enabling CSCW over Internet are incomplete if they are blind to actual conduct of participants. Indeed, a blind conference mimics quite closely a virtual voice-only conference. In this paper, we analyze the results of sessions of face-to-face blind conversations and gain penetrating insights. In particular, we focus on the impact of users' behavior on the design of a scalable architecture for virtual voice-only conferencing over VoIP and arrive at a meaningful number of floors for such conferences. We also present the features and the requirements for the proposed service.
Improved Geometric Feature Graph: A Script Independent Representation of Word Images for Compression, and Retrieval
Authors: Gaurav Harit, Richa Jain, Santanu Chaudhury
Venue: Proceedings of the Eighth International Conference on Document Analysis and Recognition (2005)

In this paper, we discuss a new representation scheme for word images which exploits the structural features. The word image features are represented in the form of a graph called as the Geometric Feature Graph (GFG). The GFG is encoded in the form of a string which serves as a compressed representation of the word image skeleton. We demonstrate reconstruction, and retrieval of word images for 3 different scripts using the GFG string.
Toward QoS Analysis of Adaptive Service-Oriented Architecture
Authors: Tong Gao, Hui Ma, I-Ling Yen, Farokh Bastani, Wei-Tek Tsai
Venue: Proceedings of the IEEE International Workshop (2005)

Service-oriented architecture provides a framework for achieving static/dynamic reconfigurability. When system requirements change, new composition of services can be determined to satisfy the new requirements. However, analysis is required to make appropriate service selections and service configurations. In this paper, we discuss the development of QoS-based analysis techniques and tools to facilitate composition decision making.
Evolving General Term-Weighting Schemes for Information Retrieval: Tests on Larger Collections
Authors: Ronan Cummins, Colm O'Riordan
Venue: Artificial Intelligence Review (2005)

Term-weighting schemes are vital to the performance of Information Retrieval models that use term frequency characteristics to determine the relevance of a document. The vector space model is one such model in which the weights assigned to the document terms are of crucial importance to the accuracy of the retrieval system. This paper describes a genetic programming framework used to automatically determine term-weighting schemes that achieve a high average precision. These schemes are tested on standard test collections and are shown to perform as well as, and often better than, the modern BM25 weighting scheme. We present an analysis of the schemes evolved to explain the increase in performance. Furthermore, we show that the global (collection wide) part of the evolved weighting schemes also increases average precision over idf on larger TREC data. These global weighting schemes are shown to adhere to Luhn's resolving power as middle frequency terms are assigned the highest weight. However, the complete weighting schemes evolved on small collections do not perform as well on large collections. We conclude that in order to evolve improved local (within-document) weighting schemes it is necessary to evolve these on large collections
Additive Schwarz methods for the Crouzeix-Raviart mortar finite element for elliptic problems with discontinuous coefficients
Authors: Talal Rahman, Xuejun Xu, Ronald Hoppe
Venue: Numerische Mathematik (2005)

In this paper, we propose two variants of the additive Schwarz method for the approximation of second order elliptic boundary value problems with discontinuous coefficients, on nonmatching grids using the lowest order Crouzeix-Raviart element for the discretization in each subdomain. The overall discretization is based on the mortar technique for coupling nonmatching grids. The convergence behavior of the proposed methods is similar to that of their closely related methods for conforming elements. The condition number bound for the preconditioned systems is independent of the jumps of the coefficient, and depend linearly on the ratio between the subdomain size and the mesh size. The performance of the methods is illustrated by some numerical results.
Bias-stress-induced evolution of the dielectric properties of porous-ULK/copper advanced interconnects
Authors: C. Guedj, X. Portier, F. Mondon, V. Arnal, J. F. Guillaumond, L. Arnaud, J. P. Barnes, V. Jousseaume, A. Roule, S. Maitrejean, L. L. Chapelon, G. Reimbold, J. Torres, G. Passemard
Venue: Microelectronic Engineering (2005)

The dielectric properties of porous ULK/Cu interconnects designed for sub 65 nm nodes are degraded at high bias-stress. The resulting increase of dielectric constant and defect density can be estimated from the Poole-Frenkel modeling of the leakage currents above 1 MV/cm. More generally, the porous SiCOH dielectric materials showing this transport mechanism appear to be inherently less reliable when their initial k value is the lowest. This trend is obviously a major issue for further downscaling developments of porous ULK/Cu interconnects.
An efficient method for simplifying support vector machines
Authors: DucDung Nguyen, TuBao Ho
Venue: Proceedings of the 22nd international conference on Machine learning (2005)

In this paper we describe a new method to reduce the complexity of support vector machines by reducing the number of necessary support vectors included in their solutions. The reduction process iteratively selects two nearest support vectors belonging to the same class and replaces them by a newly constructed vector. Through the analysis of relation between vectors in the input and feature spaces, we present the construction of new vectors that requires to find the unique maximum point of a one-variable function on the interval (0, 1), not to minimize a function of many variables with local minimums in former reduced set methods. Experimental results on real life datasets show that the proposed method is effective in reducing number of support vectors and preserving machine's generalization performance.
Autolocker: synchronization inference for atomic sections
Authors: Bill McCloskey, Feng Zhou, David Gay, Eric Brewer
Venue: Conference record of the 33rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages (2006)

The movement to multi-core processors increases the need for simpler, more robust parallel programming models. Atomic sections have been widely recognized for their ease of use. They are simpler and safer to use than manual locking and they increase modularity. But existing proposals have several practical problems, including high overhead and poor interaction with I/O. We present pessimistic atomic sections, a fresh approach that retains many of the advantages of optimistic atomic sections as seen in "transactional memory" without sacrificing performance or compatibility. Pessimistic atomic sections employ the locking mechanisms familiar to programmers while relieving them of most burdens of lock-based programming, including deadlocks. Significantly, pessimistic atomic sections separate correctness from performance: they allow programmers to extract more parallelism via finer-grained locking without fear of introducing bugs. We believe this property is crucial for exploiting multi-core processor designs.We describe a tool, Autolocker, that automatically converts pessimistic atomic sections into standard lock-based code. Autolocker relies extensively on program analysis to determine a correct locking policy free of deadlocks and race conditions. We evaluate the expressiveness of Autolocker by modifying a 50,000 line high-performance web server to use atomic sections while retaining the original locking policy. We analyze Autolocker's performance using microbenchmarks, where Autolocker outperforms software transactional memory by more than a factor of 3.
Adaptive Clustering: Obtaining Better Clusters Using Feedback and Past Experience
Authors: Abraham Bagherjeiran, Christoph F. Eick, Chun-Sheng Chen, Ricardo Vilalta
Venue: Proceedings of the Fifth IEEE International Conference on Data Mining (2005)

Adaptive clustering uses external feedback to improve cluster quality; past experience serves to speed up execution time. An adaptive clustering environment is proposed that uses Q-learning to learn the reward values of successive data clusterings. Adaptive clustering supports the reuse of clusterings by memorizing what worked well in the past. It has the capability of exploring multiple paths in parallel when searching for good clusters. In a case study, we apply adaptive clustering to instance-based learning relying on a distance function modification approach. A distance function adaptation scheme that uses external feedback is proposed and compared with other distance function learning approaches. Experimental results indicate that the use of adaptive clustering leads to significant improvements of instance-based learning techniques, such as k-nearest neighbor classifiers. Moreover, as a by-product a new instance-based learning technique is introduced that classifies examples by solely using cluster representatives; this technique shows high promise in our experimental evaluation.
On the Introduction of an Agile, Temporary Workforce into a Tandem Queueing System
Authors: David L. Kaufman, Hyun-Soo Ahn, Mark E. Lewis
Venue: Queueing Systems: Theory and Applications (2005)

We consider a two-station tandem queueing system where customers arrive according to a Poisson process and must receive service at both stations before leaving the system. Neither queue is equipped with dedicated servers. Instead, we consider three scenarios for the fluctuations of workforce level. In the first, a decision-maker can increase and decrease the capacity as is deemed appropriate; the unrestricted case. In the other two cases, workers arrive randomly and can be rejected or allocated to either station. In one case the number of workers can then be reduced (the controlled capacity reduction case). In the other they leave randomly (the uncontrolled capacity reduction case). All servers are capable of working collaboratively on a single job and can work at either station as long as they remain in the system. We show in each scenario that all workers should be allocated to one queue or the other (never split between queues) and that they should serve exhaustively at one of the queues depending on the direction of an inequality. This extends previous studies on flexible systems to the case where the capacity varies over time. We then show in the unrestricted case that the optimal number of workers to have in the system is non-decreasing in the number of customers in either queue.
Use of Verification for Testing and Debugging of Complex Reactive Systems
Authors: Mark Trakhtenbrot
Venue: Proceedings of the Third IEEE International Conference on Software Engineering and Formal Methods (2005)

Safety-critical reactive systems are characterized by a complex behavior, making their testing and debugging a very difficult task. Observed incorrect behavior might be hard to reproduce: even small changes in order or in time at which input events occur may have a significant impact on system reaction. The challenge is how to utilize (typically, partial) information about failed system run to reproduce and localize the problem. For statechart-based models of reactive systems, it is shown how testing and model checking can be combined to reproduce errors observed during execution of code generated from model. This approach is based on the use of Statemate ModelChecker tool. The main idea is to use the available knowledge about "irreproducible" run that violates system property P, in order to properly set up verification for reachability of not P. A realistic Rail Cross Control example is used to illustrate the approach.
Application based resource allocation policies in multiservice networks
Authors: Vladica Stanisic
Venue:  (2005)

Efficient and reliable bandwidth allocation is one of the most important open issues in the management of networks that aim to offer a guaranteed Quality of Service. The bandwidth allocation problem becomes more difficult in multi-service networks, where a large variety of different applications, each one with different requirements in terms of bandwidth, duration or delay, information loss use the network infrastructure simultaneously. Most of the previous work has analyzed bandwidth allocation policies under the context of resolving conflicts due to dynamics of user requests without taking network availability, user mobility, or the delivery (i.e., physical environment) conditions into account. Since static bandwidth allocation policies lack adaptive mechanisms to combat these dynamics in the network and improve bandwidth utilization, we believe that a more flexible service model which allows variable QoS is needed. Adaptive resource management coupled with dynamic load balancing aims at decreasing the possibility of congestion and maintaining high resource utilization, under transient traffic variations and node/link failure. We have formulated preemption algorithms and criteria for optimization by preemption algorithms, studied existing algorithms and investigated sub-optimal preemption algorithms with random selection of connections to be rerouted. We have also performed numerical and simulation comparisons of re-routing algorithms by analyzing their performance on a single link, dynamic setting and in a full network environment with a heterogeneous traffic mix. In order to account for the users application type, QoS requirements and quantify users' value we have introduced a utility-based QoS model. We have investigated network utilization, QoS observed by the customers, and revenue generation perspectives for different utility-quantified bandwidth allocation schemes. We have presented approximate analytical tools to obtain blocking probabilities in a multi rate multi class system, where users of the same class can have different resource requirements. We have evaluated the blocking probabilities for a single link case and validated our approach through the simulation of such a system. Also we have expanded our single link model to calculate blocking probabilities for a multihop path, when the offered traffic of each source destination pair along the path is known.
A Fuzzy Logic Approach for Aircraft Evacuation Modelling
Authors: Minesh Poudel, F Mora Camino, M. de Coligny, J. A. Thiongly
Venue: Proceedings of the 18th International Conference on Systems Engineering (2005)

Aircraft evacuation effectiveness is a critical issue for passenger's safety with large aircraft. New aircraft must comply with maximum exit time limits. To validate the aircraft evacuation system design and procedures, demonstration according to many different scenarios have been performed in the past. But more recently numerical simulation tools have been developed to avoid the limitations inherent to real demonstrations. One of the main difficulties encountered by numerical simulation of evacuation operation is related with the modelling of passenger's behaviour, which is influenced by a complex mixture of socio-psychological and physical factors. This is the main point discussed in this paper.
Spider Cursor: a simple versatile interaction tool for data visualization and exploration
Authors: Rosane Minghim, Haim Levkowitz, Luis Gustavo Nonato, Lionis Watanabe, Veridiana Salvador, Hélio Lopes, Sinésio Pesco, Geovan Tavares
Venue: Proceedings of the 3rd international conference on Computer graphics and interactive techniques in Australasia and South East Asia (2005)

We present Spider Cursor, an exploration tool for geometric models that has proven useful in analyzing data coming from various sources. The Spider Cursor is simple to learn and use, and is useful to help extract various types of relationships present in the data. Additionally, it implements a dual presentation mode, in which visual and aural attributes are used to represent information. A cursor in the shape of a spider runs on top of a surface, helping location of information at neighboring points of the geometry. That can be used for data analysis as well as model manipulations (such as cuts and marks). Sound is employed to display complementary and supplementary information as well as to help define orientation. This paper describes the basic concepts of the Spider Cursor, and illustrates its use by giving examples of applications.
Policy transfer with a relational learning classifier system
Authors: Drew Mellor
Venue: Proceedings of the 2005 workshops on Genetic and evolutionary computation (2005)

Policy transfer occurs when a system transfers a policy learnt for one task to another task with little or no retraining, and allows a system to perform robustly and learn efficiently, especially when the new task is more complex than the original task. In this paper we report on work in progress into policy transfer using a relational learning classifier system. The system, FOX-cs, uses a high level relational language (a subset first order logic) in combination with a P-learning technique adapted for Xcs and its derivatives. FOX-CS achieved successful policy transfer in two blocks world tasks, stacking and onab, by learning a policy that was independent of the number of blocks, thus avoiding the prohibitive training times that would normally arise due to the exponential explosion in the number of states as the number of blocks increases.