ppxscal/embedding_network huggingface dataset:
INSCY: Indexing Subspace Clusters with In-Process-Removal of Redundancy
Authors: Ira Assent, Ralph Krieger, Emmanuel Müller, Thomas Seidl
Venue: Proceedings of the 2008 Eighth IEEE International Conference on Data Mining (2008)

Subspace clustering aims at detecting clusters in any subspace projection of a high dimensional space. As the number of projections is exponential in the number of dimensions, efficiency is crucial. Moreover, the resulting subspace clusters are often highly redundant, i.e. many clusters are detected multiply in several projections. We propose a novel index for efficient subspace clustering in a novel depth-first processing with in-process-removal of redundant clusters for better pruning. Thorough experiments on real and synthetic data show that INSCY yields substantial efficiency and quality improvements.
A well balanced fvm with scalar diffusion to hyperbolic balance laws
Authors: Antonio Domíguez Delgado
Venue: Proceedings of the 12th WSEAS international conference on Computers (2008)

The goal of this work is to extend a finite volume method with scalar diffusion to hyperbolic system of balance laws. This is made by reformulating the numerical scheme by adding a diffusive term to the numerical discretization of the source term in such a way that the obtained scheme is well-balanced for a wide range of stationary solutions of any hyperbolic systems with source term. The scheme is applied to Shallow Water Equations and the exact well-balanced property is established for the stationary solution of water at rest. Finally, some numerical tests are presented that exhibit the good performances of the scheme.
Scalable packet classification with controlled cross-producting
Authors: Pi-Chung Wang
Venue: Computer Networks: The International Journal of Computer and Telecommunications Networking (2009)

Packet classification is central among traffic classification techniques that categorize packets with a traffic descriptor or with user-defined criteria. This categorization may make information accessible for quality of service or security handling on the network. To make packet classification both fast and scalable, we propose a new algorithm that combines cross-producting with linear search. The new algorithm, Controlled Cross-producting, could improve the scalability of cross-producting significantly with respect to storage, while maintaining the search latency. In addition, we introduce several refinements and procedures for incremental update. We evaluate the performance of our scheme with filter databases of varying sizes and characteristics. Specifically, we experimented with 12 different types of filter databases, whose sizes vary from 16K to 128K. The experimental results demonstrate the feasibility and scalability of our scheme. A comparison with the prominent existing schemes further indicates that the proposed scheme takes less time and space.
Study on Parameter Distribution in Structure Reliability Analysis: Machine Learning Algorithm and Application
Authors: Yi Wan, Yangu Zhang
Venue: Proceedings of the 2009 Second International Workshop on Knowledge Discovery and Data Mining (2009)

The discrimination of parameter probability distribution type is the key to structure reliability analysis. A support vector machine (SVM) intelligent recognition model of probability distribution law is presented aiming at traditional method disadvantage. The intelligent recognition model of probability distribution is constructed by SVM algorithm realization, network design and feature extraction, inward stress probability distribution type of a stem structural member is recognized by the model, recognition result is Weibull distribution, SVM has a good generalization ability and clustering ability by comparison between network recognition result and regression analysis, the experiment result shows total recognition rate achieved 98.25%, it provides a good new method for structure reliability analysis.
Stellar Core Collapse: A Case Study in the Design of Numerical Algorithms for Scalable Radiation Hydrodynamics
Authors: Eric S. Myra, F. Douglas Swesty, Dennis C. Smolarski
Venue: Computing in Science and Engineering (2009)

The fields of radiation and hydrodynamics are time-honored disciplines in physics. However, it's only since the nuclear age that the importance of radiation hydrodynamics—a single field studying the interplay of radiation and material hydrodynamics together—has come into prominence. Similarly, it's only since the computer age that physically interesting problems in this field have become tractable. In this article, the authors discuss the process of building a model to study one of the fundamental problems of astrophysics: the supernova explosion of a massive star caused by the collapse of its core. An explanation for the mechanism of this explosion involves the interaction of material hydrodynamics and neutrino radiation.
Transient Stability Enhancement of Power Systems by Lyapunov-Based Recurrent Neural Networks UPFC Controllers
Authors: Chia-Chi Chu, Hung-Chi Tsai, Wei-Neng Chang
Venue: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences (2008)

A Lyapunov-based recurrent neural networks unified power flow controller (UPFC) is developed for improving transient stability of power systems. First, a simple UPFC dynamical model, composed of a controllable shunt susceptance on the shunt side and an ideal complex transformer on the series side, is utilized to analyze UPFC dynamical characteristics. Secondly, we study the control configuration of the UPFC with two major blocks: the primary control, and the supplementary control. The primary control is implemented by standard PI techniques when the power system is operated in a normal condition. The supplementary control will be effective only when the power system is subjected by large disturbances. We propose a new Lyapunov-based UPFC controller of the classical single-machine-infinite-bus system for damping enhancement. In order to consider more complicated detailed generator models, we also propose a Lyapunov-based adaptive recurrent neural network controller to deal with such model uncertainties. This controller can be treated as neural network approximations of Lyapunov control actions. In addition, this controller also provides online learning ability to adjust the corresponding weights with the back propagation algorithm built in the hidden layer. The proposed control scheme has been tested on two simple power systems. Simulation results demonstrate that the proposed control strategy is very effective for suppressing power swing even under severe system conditions.
Complete stability in multistable delayed neural networks
Authors: Chang-Yuan Cheng, Chih-Wen Shih
Venue: Neural Computation (2009)

We investigate the complete stability for multistable delayed neural networks. A new formulation modified from the previous studies on multistable networks is developed to derive componentwise dynamical property. An iteration argument is then constructed to conclude that every solution of the network converges to a single equilibrium as time tends to infinity. The existence of 3n equilibria and 2n positively invariant sets for the n-neuron system remains valid under the new formulation. The theory is demonstrated by a numerical illustration.
Real World Nikon Capture NX 2, 1 edition
Authors: Ben Long
Venue:  (2008)

Capture NX 2 from Nikon is a powerful image-editing application that lets photographers work with digital photographs with more speed and efficiency than other software programs. Its underlying technology gives photographers the ability to make selective corrections to an image with just one click. "Real World Capture NX 2," written by digital photography expert Ben Long, takes photographers behind the scenes to see how this innovative program works. Along the way, Ben offers valuable tips and techniques for getting the most out of the software and digital cameras.Novice and expert photographers alike will benefit from Capture NX 2. New users can make advanced image corrections without learning sophisticated masking techniques. Advanced users can perform the complex edits they are accustomed to making in other programs in fewer steps. Any image corrections made with Capture NX 2 are non-destructive, which means that the actual image data is unaltered and reversible until the photographer achieves the best results. Photographers who use Nikon cameras have access to special software features for working with raw, JPEG and TIFF images.
Predicate Abstraction in a Program Logic Calculus
Authors: Benjamin Weiß
Venue: Proceedings of the 7th International Conference on Integrated Formal Methods (2009)

Predicate abstraction is a form of abstract interpretation where the abstract domain is constructed from a finite set of predicates over the variables of the program. This paper explores a way to integrate predicate abstraction into a calculus for deductive program verification, where it allows to infer loop invariants automatically that would otherwise have to be given interactively. The approach has been implemented as a part of the KeY verification system.
Models for cell loading and product sequencing in labor-intensive cells
Authors: Gürsel A. Süer, Jeremy Cosner, Amanda Patten
Venue: Computers and Industrial Engineering (2009)

This paper focuses on cell loading issues and product sequencing in labor-intensive cells. In labor-intensive cells, there are usually more operators than number of operations and cells usually consists of simple and light-weight machines and equipment. A three-phase methodology is proposed to deal with this problem. The objectives considered are minimizing makespan, total machine requirements, and intra-cell manpower transfers. In the first phase, optimal manpower allocation to operations is determined for each product. Then, similarity among products is established based on the similarity of operator/machine levels. The second phase involves cell loading to minimize makespan and machine requirements. Two mathematical models are developed to accomplish these tasks. One mathematical model (model A) does not allow product splitting whereas model B allows product splitting. Finally, third phase treats the product sequencing problems as traveling salesman problem (TSP) where the objective is to minimize intra-cell manpower transfers. Experimentation is performed and the results are compared with those of a heuristic procedure developed earlier. The results show that model A or model B can be chosen over the heuristic procedure.
Performance Analysis of Caching Effect on Packet Processing in a Multi-threaded Processor
Authors: Miao Ju, Hao Che, Zhijun Wang
Venue: Proceedings of the 2009 WRI International Conference on Communications and Mobile Computing - Volume 02 (2009)

In this paper, we aim at analyzing how effective the caching technique is, in dealing with real-time packet processing through simulation studies. First of all, we introduce a fast multithreaded processor simulator. The simulator is applied to emulate the basic IP forwarding using Intel IXP1200 with the addition of caching. Our simulation results indicate that overall, caching can be an effective means to improve packet processing performance. However, we also note that, for large cache miss rates (e.g., 27.2%), caching can be ineffective, especially under stringent delay/loss constraints, and/or high time locality for cache misses. Our simulation results also indicate that the effectiveness of caching is sensitive to the actual delay/loss constraint. We also analyzed the reasons for these results in details. These observations provide significant insight as to how many threads should be configured in a processor where caching is employed to hide the memory access latency.
An Efficient Computational Technique for a System of Singularly Perturbed Initial Value Problems
Authors: Rajesh K. Bawa, Vinod Kumar
Venue: Numerical Analysis and Its Applications: 4th International Conference, NAA 2008, Lozenetz, Bulgaria, June 16-20, 2008. Revised Selected Papers (2009)

In this paper, a parameter-uniformly convergent computational technique for a system of singularly perturbed initial value problems, which is applied on a piecewise uniform Shishkin mesh is presented. Numerical experiments are carried out on some test problems which shows almost second order uniform convergence, confirming the efficiency of the proposed technique.
Reo Connectors as Coordination Artifacts in 2APL Systems
Authors: Farhad Arbab, Lăcrămioara Aştefănoaei, Frank S. Boer, Mehdi Dastani, John-Jules Meyer, Nick Tinnermeier
Venue: Proceedings of the 11th Pacific Rim International Conference on Multi-Agents: Intelligent Agents and Multi-Agent Systems (2008)

Communication is an important topic in multi-agent systems. Reo is a channel-based exogenous coordination model which can be used not only for the communication, but also for the coordination of individual agents. 2APL is an agent-oriented programming language where at the multi-agent level one can specify for individual agents which external environments they have access to. In this paper, we understand Reo networks as specific environments for 2APL agents and we focus on the integration of Reo networks into the 2APL platform. We show how Reo networks can be used to coordinate the behaviour of individual agents by means of an auction example.
Applying REC analysis to ensembles of particle filters
Authors: Alo&#x00ed;sio Carlos de Pina, Gerson Zaverucha
Venue: Neural Computing and Applications (2009)

Particle filters (PF) are sequential Monte Carlo methods based in the representation of probability densities with mass points. Although currently most researches involving time series forecasting use the traditional methods, particle filters can be applied to any state-space model and generalize the traditional Kalman filter methods, providing better results. Furthermore, it is well-known that for classification and regression tasks ensembles achieve better performances than the algorithms that compose them. Therefore, it is expected that ensembles of time series predictors can provide even better results than particle filters. The regression error characteristic (REC) analysis is a powerful technique for visualization and comparison of regression models. The objective of this work is to advocate the use of REC curves in order to compare traditional Kalman filter methods with particle filters and analyze their use in ensembles, which can achieve a better performance.
Direct Forcing for Lagrangian Rigid-Fluid Coupling
Authors: Markus Becker, Hendrik Tessendorf, Matthias Teschner
Venue: IEEE Transactions on Visualization and Computer Graphics (2009)

We propose a novel boundary handling algorithm for particle-based fluids. Based on a predictor-corrector scheme for both velocity and position, one- and two-way coupling with rigid bodies can be realized. The proposed algorithm offers significant improvements over existing penalty-based approaches. Different slip conditions can be realized and non-penetration is enforced. Direct forcing is employed to meet the desired boundary conditions and to ensure valid states after each simulation step. We have performed various experiments in 2D and 3D. They illustrate one- and two-way coupling of rigid bodies and fluids, the effects of hydrostatic and dynamic forces on a rigid body as well as different slip conditions. Numerical experiments and performance measurements are provided.
Preliminary results on nb-feb, a synchronization primitive for parallel programming
Authors: Phuong Hoai Ha, Philippas Tsigas, Otto J. Anshus
Venue: Proceedings of the 14th ACM SIGPLAN symposium on Principles and practice of parallel programming (2009)

We introduce a non-blocking full/empty bit primitive, or NB-FEB for short, as a promising synchronization primitive for parallel programming on may-core architectures. We show that the NB-FEB primitive is universal, scalable and feasible. NB-FEB, together with registers, can solve the consensus problem for an arbitrary number of processes (universality). NB-FEB is combinable, namely its memory requests to the same memory location can be combined into only one memory request, which consequently mitigates performance degradation due to synchronization "hot spots" (scalability). Since NB-FEB is a variant of the original full/empty bit that always returns a value instead of waiting for a conditional flag, it is as feasible as the original full/empty bit, which has been implemented in many computer systems (feasibility).
Empirical Performance Models for Java Workloads
Authors: Pradeep Rao, Kazuaki Murakami
Venue: Proceedings of the 22nd International Conference on Architecture of Computing Systems (2009)

Java is widely deployed on a variety of processor architectures. Consequently, an understanding of microarchitecture level Java performance is critical to optimize current systems and to aid design and development of future processor architectures for Java. Although this is facilitated by a rich set of processor performance counters featured on several contemporary processors, complex processor microarchitecture structures and their interactions make it difficult to relate observed events to overall performance. This, coupled with the complexities associated with running Java over a virtual machine, further aggravates the situation. This paper explores and evaluates the effectiveness of empirical modeling for Java workloads. Our models use statistical regression techniques to relate overall Java system performance to various observed microarchitecture events and their interactions. Multivariate adaptive regression splines effectively capture non-linear and non-monotonic associations between the response and predictor variables. Our models are interpretable, easy to construct and exhibit high correlation/low errors between predicted and measured performance. Furthermore, empirical models afford additional insights into the characteristics of Java performance and the use of statistical techniques throughout this study allow us to assign confidence levels to our estimates of performance.
A Survey of Web Research in Argentina
Authors: Gustavo Rossi
Venue: Proceedings of the 2008 Latin American Web Conference (2008)

In this paper we survey current research on Web issues in Argentina. We first describe briefly the current situation in computer science research and next we outline which are the most outstanding achievements in this area. Using the research areas in W3C conferences we describe the current projects, research groups and trends.
Implementing Distinctive Behavior for Conversational Agents
Authors: Maurizio Mancini, Catherine Pelachaud
Venue: Gesture-Based Human-Computer Interaction and Simulation: 7th International Gesture Workshop, GW 2007, Lisbon, Portugal, May 23-25, 2007, Revised Selected Papers (2009)

We aim to define conversational agents exhibiting distinctive behavior. To this aim we provide a small set of parameters to allow one to define behavior profiles and then leave to the system the task of animating the agents. Our approach is to manipulate the behavior tendency of the agents depending on their communicative intention and emotional state. In this paper we define the concepts of Baseline and Dynamicline. The Baseline of an agent is defined as a set of fixed parameters that represent the personalized agent behavior, while the Dynamicline is a set of parameters that derive both from the Baseline and the current communicative intention and emotional state.
Using Bloom Filters for Large Scale Gene Sequence Analysis in Haskell
Authors: Ketil Malde, Bryan O'Sullivan
Venue: Proceedings of the 11th International Symposium on Practical Aspects of Declarative Languages (2009)

Analysis of biological data often involves large data sets and computationally expensive algorithms. Databases of biological data continue to grow, leading to an increasing demand for improved algorithms and data structures. Despite having many advantages over more traditional indexing structures, the Bloom filter is almost unused in bioinformatics. Here we present a robust and efficient Bloom filter implementation in Haskell, and implement a simple bioinformatics application for indexing and matching sequence data. We use this to index the chromosomes that make up the human genome, and map all available gene sequences to it. Our experiences with developing and tuning our application suggest that for bioinformatics applications, Haskell offers a compelling combination of rapid development, quality assurance, and high performance.
An agent-oriented mobile payment system secured using a biometrics approach
Authors: Huiqi Lu, Frederic Claret-Tournier, Chris R. Chatwin, Rupert C. D. Young, Zhongming Liu
Venue: International Journal of Agent-Oriented Software Engineering (2009)

The significant market growth of mobile commerce brings challenges for individuals, society and technology. The creation and maintenance of secure identities for online payment has emerged as an important priority for business and consumers. In order to address some of these challenges, an agent-oriented Biometric Mobile Payment (BMP) system is developed to provide a platform-independent payment system compatible with mobile phones. This system combines two elements: a mobile two-dimensional barcode reader and a Mobile Biometric Identification (MBI) system. In this application, mobile phone users can use the two-dimensional barcode reader to scan the barcodes of products or a bill that they would like to purchase or pay, and make payments via the mobile phone using the MBI system. By using this approach, fraud committed by impostors and the risks for financial institutions and mobile phone operators can be greatly reduced. By adopting the agent-oriented system design, the MBI system and mobile two-dimensional barcode reader can be used as stand-alone tools or they can collaborate seamlessly as a BMP system. The reusability of the software agents also allows more applications to use the MBI and BMP systems in future applications.
Engaging middle school teachers and students with alice in a diverse set of subjects
Authors: Susan H. Rodger, Jenna Hayes, Gaetjens Lezin, Henry Qin, Deborah Nelson, Ruth Tucker, Mercedes Lopez, Stephen Cooper, Wanda Dann, Don Slater
Venue: Proceedings of the 40th ACM technical symposium on Computer science education (2009)

This paper describes the integration of the Alice 3D virtual worlds environment into a diverse set of subjects in middle school, including the development of tutorials, example worlds and lesson plans. In the summer of 2008 our experiences with middle school teachers included three-weeks of training in Alice and guidance in the development of lesson plans. Our experiences with middle school students involved two one-week summer camps of instruction in Alice. We found both the teachers and the students strongly engaged with Alice. The teachers created lesson plans with Alice worlds to interactively teach a topic and other lesson plans in which students build an Alice world on a particular topic either from scratch or using a template world. The students in the Alice camps had both instruction in Alice and free time to develop Alice worlds of their choice. We found that the students used a large variety of basic Alice concepts and computer science concepts in the worlds they built in their free time.