ppxscal/embedding_network huggingface dataset:
A unified format for traces of peer-to-peer systems
Authors: Boxun Zhang, Alexandru Iosup, Pawel Garbacki, Johan Pouwelse
Venue: Proceedings of the 1st ACM workshop on Large-Scale system and application performance (2009)

Peer-to-Peer (P2P) systems have recently emerged as a scalable platform for which costs are shared between the system users. Today, P2P technology is serving millions of users world-wide, with applications such as file sharing, video streaming, grid computing, and massively multiplayer online games. Such diversity and scale pose important research and technical problems, which in turn require a much better understanding of the usage patterns and of the performance bottlenecks. However, the large amounts of P2P monitoring and measurement data that already exist have not been made public, for fear of lack of anonymity and in lack of a standard format. To address this problem, in this work we propose a unified format for workloads of P2P systems. Our format stores information coming from many types of P2P applications at several levels of detail, has a structure that balances generic and application-specific data, and protects the anonymity of the peers whose personal information was captured in monitoring and measurement data. Using two large traces taken from real P2P systems we show evidence of the usefulness of the proposed format, and substantiate the hope that our unified format has the potential to become a standard for sharing P2P traces.
The analysis of circuit breakers kinematics characteristics using the artificial neural networks
Authors: Maricel Adam, Adrian Baraboi, Catalin Pancu, Sorin Pispiris
Venue: WSEAS Transactions on Circuits and Systems (2009)

The paper presents the required parameters in the evaluation of the technical state for the High Voltage (HV) circuit breakers. It details some aspects regarding the influence of the kinematics characteristics to the circuit breakers performances. Also, it presents a possibility to use the artificial neural networks (ANN) in the analysis of the circuit breakers kinematics characteristics, in order to diagnostic their technical state. The required database necessary for learning of ANN has determined through the modelling of the mechanical system of movement transmission, using the systems of electrical nature, with RLC elements.
Incremental growth in modular neural networks
Authors: Christopher MacLeod, Grant Maxwell, Sethuraman Muthuraman
Venue: Engineering Applications of Artificial Intelligence (2009)

This paper outlines an algorithm for incrementally growing Artificial Neural Networks. The algorithm allows the network to expand by adding new sub-networks or modules to an existing structure; the modules are trained using an Evolutionary Algorithm. Only the latest module added to the network is trained, the previous structure remains fixed. The algorithm allows information from different data domains to be integrated into the network and because the search space in each iteration is small, large and complex networks with a modular structure can emerge naturally. The paper describes an application of the algorithm to a legged robot and discusses its biological inspiration.
Lists revisited: Cache-conscious STL lists
Authors: Leonor Frias, Jordi Petit, Salvador Roura
Venue: Journal of Experimental Algorithmics (JEA) (2009)

We present three cache-conscious implementations of STL standard compliant lists. Until now, one could either find simple doubly linked list implementations that easily cope with standard strict requirements, or theoretical approaches that do not take into account any of these requirements in their design. In contrast, we have merged both approaches, paying special attention to iterators constraints. In this article, the competitiveness of our implementations is evinced with an extensive experimental analysis. This shows, for instance, 5 to 10 times faster traversals and 3 to 5 times faster internal sort.
Grid Workflow Modeling for Remote Sensing Retrieval Service with Tight Coupling
Authors: Jianwen Ai, Yong Xue, Jie Guang, Yingjie Li, Ying Wang, Linyan Bai
Venue: Proceedings of the 9th International Conference on Computational Science (2009)

Grid computing technology is a new way for remotely sensed data processing. Tight-coupling remote sensing algorithms can't be scheduled by grid platform directly. Therefore, we need a interactive graphical tool to present the executing relationships of algorithms and to generate automatically the corresponding submitted description files for grid platform. In this paper we mainly discusses some application cases based on Grid computing for Geo-sciences and the application limit of Grid in remote sensing, and gives the method of Grid Workflow modeling for remote sensing. Then based on the modeling, we design a concrete example.
Fast communication: Improvement of empirical mode decomposition under low sampling rate
Authors: Zhengguang Xu, Benxiong Huang, Fan Zhang
Venue: Signal Processing (2009)

Empirical mode decomposition (EMD) is a new data analysis method which depends on the exact location of the extrema in the signal. Therefore, the available EMD algorithm only works under high sampling rate in order to find the extrema exactly. Fourier interpolation has been used to solve the problem. This paper discusses the error expression of Fourier interpolation and derives its error upper bound for general band-limited signals, which implies Fourier interpolation yields errors especially near the boundary when the signal is non-integer-period sampled. Motivated by this, a hybrid extrema estimation algorithm based on Fourier interpolation is proposed. Simulation results show that the hybrid algorithm is efficient in improving the performance of the EMD under low sampling rate.
Indexing uncertain data
Authors: Pankaj K. Agarwal, Siu-Wing Cheng, Yufei Tao, Ke Yi
Venue: Proceedings of the twenty-eighth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems (2009)

Querying uncertain data has emerged as an important problem in data management due to the imprecise nature of many measurement data. In this paper we study answering range queries over uncertain data. Specifically, we are given a collection P of n points in R, each represented by its one-dimensional probability density function (pdf). The goal is to build an index on P such that given a query interval I and a probability threshold τ, we can quickly report all points of P that lie in I with probability at least τ. We present various indexing schemes with linear or near-linear space and logarithmic query time. Our schemes support pdf's that are either histograms or more complex ones such as Gaussian or piecewise algebraic. They also extend to the external memory model in which the goal is to minimize the number of disk accesses when querying the index.
Temperature Control in Cement Rotary Kiln with Neural Network-Based Heuristic Dynamic Programming
Authors: Xiaofeng Lin, Tangbo Liu, Deguang Cao, Qingbao Huang
Venue: Proceedings of the 6th International Symposium on Neural Networks: Advances in Neural Networks - Part II (2009)

During the production process of modern cement industry, the rotary kiln is the key equipment .The temperature of cement rotary kiln is a large lag, large inertia, complex nonlinear controlled object. There are many external factors influencing the temperature, and there exist coupling and uncertainties among various factors. Approximate Dynamic Programming (ADP) is an on line control approach that based on actual data rather than on the accurate mathematical model of the controlled object. Through technical studies on the cement rotary kiln, this paper proposes to control the temperature of rotary kiln by using Heuristic Dynamic Programming (HDP) which is a type of ADP. A simulation of the cement rotary kiln is carried out using Matlab. The simulation results show that the HDP controller has good performance. It is possible to keep the temperature of sintering zone stable in a certain range, and the temperature can meet the requirements of cement clinker production.
Office 2007: Top 100 Simplified Tips & Tricks
Authors: Kate Shoup
Venue:  (2007)

You already know Office 2007 basics. Now youre ready to move to the next level, and this book gives you clear, illustrated instructions for 125 tasks that reveal cool secrets, teach timesaving tricks, and explain great tips guaranteed to make you more productive with Office 2007. With minimal text and maximum illustrations, a task-oriented, step-by-step approach, self-contained, two-page lessons for each task, and navigational aids that connect the instructions to their illustrations, its a no-nonsense way to advance your Office skills. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Design an on-line information center for industrial design
Authors: Manlai You, Li-Min Chen, Lung-Hsing Kuo, Hung-Jen Yang
Venue: Proceedings of the 8th Wseas international conference on Telecommunications and informatics (2009)

The purpose of this study was to propose a layout of an on-line information center for industrial design. Based upon literature review, the major component was revealed. The design information center should be a multimedia database which was designed to support the activities of industrial product designers globally. In this study, user data services were created. The multimedia data types, user interface issues, database construction, and intended audience were discussed. This paper provides a general outline of designing an on-line information center for industrial design. Its aims and objectives, the innovative application of technology, and the underlying network structures were also proposed.
The impact of divorce precedents on the Japanese divorce rate
Authors: Kei Sakata, C. R. McKenzie
Venue: Mathematics and Computers in Simulation (2009)

This paper undertakes a time series analysis of the Japanese divorce rate using annual data over the period 1964-2006. One of the key innovations of the paper is to use court decisions on divorce disputes to construct an index that seeks to measure how the probability of success in a divorce suit has changed over time. The computed index suggests that if it is the culpable party lodging the divorce suit, the probability of the suit being successful has clearly increased over time. The probability of winning a divorce suit appears to be an important factor in explaining the long-run rise in the Japanese divorce rate. The divorce rate also appears to be counter-cyclical.
Covariance estimation in full- and reduced-dimensionality image classification
Authors: John A. Robinson
Venue: Image and Vision Computing (2009)

This paper introduces an estimation technique for covariance matrices. The method differs from previous estimators in specifying an application-dependent cost function, regularizing all classes in the same way then compensating for volume distortions via scale parameters, and allowing m-fold rather than leave-one-out cross-validation. It provides a systematic basis for parameter estimation in high-dimensional spaces, where there are inevitably far too few training samples for reliable parameter estimates from sample statistics only. This is demonstrated with standard classifiers using normal models in the high dimensional space of appearance-based image processing. When the models are trained with the new technique, face classification performance is significantly better than with unregularized covariances and with earlier regularized estimators. Dimensionality reduction is also improved when it uses a covariance structure estimated with the method.
Proceedings of the 46th Annual Meeting of the Association for Computational Linguistics on Human Language Technologies: Student Research Workshop
Venue: Human Language Technology Conference (2008)

Welcome to the ACL-08: HLT Student Research Workshop! The Student Research Workshop is now an established tradition at ACL conferences and provides a venue for student researchers investigating topics in Computational Linguistics and Natural Language Processing to present their work and receive feedback. New this year was encouraging researchers in Information Retrieval to be involved, both reviewers and authors. We received a total of 27 submissions coming from 11 different countries, and accepted 12 of them. 5 will be presented orally, and 7 as posters, during a common poster session with the main conference. A total of 61 students and senior researchers agreed to serve on the program committee, which allowed us to assign 5 reviewers per paper. We would like to thank the reviewers for understanding the spirit of the Student ResearchWorkshop and giving careful and constructive reviews. We hope their comments will be helpful to all the students who submitted their work. All presenters received financial support from the U.S. National Science Foundation to assist them in their travel to Columbus.
Triangular representation of Fornasini---Marchesini systems
Authors: Chen Dubi
Venue: Multidimensional Systems and Signal Processing (2009)

We further develop the study of Fornasini---Marchesini linear systems with upper triangular state operators, addressing the problem of constructing a triangular Fornasini---Marchesini model equivalent (under a proper definition) to a given system. In particular, we are interested in the problem of determining when such a system can be constructed, without losing the information about the state of the original system.
Reliability issues and modeling of Flash and post-Flash memory (Invited Paper)
Authors: Daniele Ielmini
Venue: Microelectronic Engineering (2009)

Flash memory, in particular NAND, has been an enabling technology for portable applications for the last two decades. The strength of Flash is its excellent scaling capability, allowing an ever increasing density at a decreasing cost and maintained reliability. However, the geometrical scaling of the cell exacerbates charge loss and fluctuation effects. On the other hand, new post-Flash memory technologies are being proposed, with different storage concepts and reliability physics. This review discusses the major reliability issues for Flash, with emphasis on the physical mechanisms and modeling. The reliability of charge trap and resistive memories, such as phase change and resistive switching memories, is addressed.
Change Management with Dynamic Object Roles and Overloading Views
Authors: Radosław Adamus, Edgar Głowacki, Tomasz Serafiński, Kazimierz Subieta
Venue: Proceeding of the 2005 conference on Software Engineering: Evolution and Emerging Technologies (2005)

Database applications are an area of very specific requirements with respect to change introduction. New requirements on a database may require database schema modification or new ontology assumed for existing database entities. Such new requirements may involve necessity of changes in thousands of places of all the applications that dependent on the previous version of the database schema and ontology. In the paper we propose to relax the difficulties with the change of a database schema and ontology through two kinds of generic features that can be introduced to the object-oriented database model and to OODBMS: (1) dynamic object roles that simplify schema evolution, and (2) updateable overloading database views that introduce additional semantics to already existing semantics of database entities. The paper follows the Aspect-Oriented Programming idea, but with respect to situations that appear in database applications.
Constraint relaxation in approximate linear programs
Authors: Marek Petrik, Shlomo Zilberstein
Venue: Proceedings of the 26th Annual International Conference on Machine Learning (2009)

Approximate Linear Programming (ALP) is a reinforcement learning technique with nice theoretical properties, but it often performs poorly in practice. We identify some reasons for the poor quality of ALP solutions in problems where the approximation induces virtual loops. We then introduce two methods for improving solution quality. One method rolls out selected constraints of the ALP, guided by the dual information. The second method is a relaxation of the ALP, based on external penalty methods. The latter method is applicable in domains in which rolling out constraints is impractical. Both approaches show promising empirical results for simple benchmark problems as well as for a realistic blood inventory management problem.
Roles and norms for programming agent organizations
Authors: Nick Tinnemeier, Mehdi Dastani, John-Jules Meyer
Venue: Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems - Volume 1 (2009)

We present a programming language for implementing multiagent systems consisting of a set of individual agents that interact with a computational organization specified in terms of roles, norms and sanctions. We provide an operational semantics of the language that can serve as a basis for the implementation of organizational platforms. The view on roles is motivated by four key properties we deem important for an efficient implementation of agent organizations.
The influence of different sources of errors when applying BEM to the compressible fluid flow around obstacles
Authors: Grecu Luminita
Venue: Proceedings of the 10th WSEAS international conference on Mathematical and computational methods in science and engineering (2008)

The aim of this paper is to present some aspects about different sources of errors that appear when BEM is used, and their influence on the numerical solution's accuracy. The study is focused on the errors that appear when BEM is used to solve the problem of the compressible fluid flow around obstacles. Numerical solutions are compared with analytical solutions in order to check their accuracy. Some techniques to minimize the errors in order to get better numerical results are discussed too.
A framework for testing query transformation rules
Authors: Hicham G. Elmongui, Vivek Narasayya, Ravishankar Ramamurthy
Venue: Proceedings of the 35th SIGMOD international conference on Management of data (2009)

In order to enable extensibility, modern query optimizers typically leverage a transformation rule based framework. Testing individual rule correctness as well as correctness of rule interactions is crucial in verifying the functionality of a query optimizer. While there has been a lot of work on how to architect optimizers for extensibility using a rule based framework, there has been relatively little work on how to test such optimizers. In this paper we present a framework for testing query transformation rules which enables: (a) efficient generation of queries that exercise a particular transformation rule or a set of rules and (b) efficient execution of corresponding test suites for correctness testing.
Fast Dejittering for Digital Video Frames
Authors: Mila Nikolova
Venue: Proceedings of the Second International Conference on Scale Space and Variational Methods in Computer Vision (2009)

We propose several very fast algorithms to restore jittered digital video frames (their rows are shifted) in one iteration. The restored row shifts minimize non-smooth and possibly non-convex local criteria applied on the second-order differences between consecutive rows. We introduce specific error measures to assess the quality of dejittering. Our algorithms are designed for gray-value, color and noisy images. Some of them can be considered as parameter-free. They outperform by far the existing algorithms both in quality and in speed. They are a crucial step towards real-time dejittering of digital video.
Systems of variational inclusion problems and differential inclusion problems with applications
Authors: Lai-Jiu Lin
Venue: Journal of Global Optimization (2009)

In this paper, we study the existence theorems of systems of variational inclusion problems. From these existence results, we study the existence theorems of systems of variational differential inclusion problems, mathematical program with systems of variational inclusion constraints, and mathematical program with systems of equilibrium constraints.
Multidimensional object based image sequences segmentation
Authors: George Petrov, Panayot Iliev, Plamen Tzvetkov
Venue: Proceedings of the 8th WSEAS international conference on Artificial intelligence, knowledge engineering and data bases (2009)

This paper presents a complex statistical approach for object based motion image segmentation. The experimental results prove that the relationship between statistical characteristics of the 3D and 4D image entropy sequences and process of motion estimation is a guarantee for creating reliable and high precision dynamic scene segmentation and description system. Using 2D and 3D multistage entropy functions analysis provides us better way to reduce sequence channels for tracking moving objects and background. Vector based approach is used for object detection inside image sequences. This way we provide necessary information for object based video compression format that can be used in most security and military systems.
On Decidability of LTL+Past Model Checking for Process Rewrite Systems
Authors: Mojmír Křetínský, Vojtěch Řehák, Jan Strejček
Venue: Electronic Notes in Theoretical Computer Science (ENTCS) (2009)

The paper [Bozzelli, L., M. Kretinsky, V. Rehak and J. Strejcek, On decidability of LTL model checking for process rewrite systems, in: FSTTCS 2006, LNCS 4337 (2006), pp. 248-259] shows that the model checking problem for (weakly extended) Process Rewrite Systems and properties given by LTL formulae with temporal operators strict eventually and strict always is decidable. The same paper contains an open question whether the problem remains decidable even if we extend the set of properties by allowing also past counterparts of the mentioned operators. The current paper gives a positive answer to this question.
Human Expert Modelling Using Numerical Linear Algebra: a Heavy Industry Case Study
Authors: Pavel Praks, Jindřich Černohorský, Radim Briš
Venue: Proceeding of the 2007 conference on Information Modelling and Knowledge Bases XVIII (2007)

The article describes our experience with a method for an automatic identification of image semantic, which is applied to the coking plant Mittal Steel Ostrava, the Czech Republic. The image retrieval algorithm is based on Latent Semantic Indexing (LSI) and involves Singular Value Decomposition of a document matrix. Our case study indicates feasibility of the presented approach as a tool for modelling of human expert behaviour in hard industry environment.
A Hopfield Network for the Portfolio Selection Problem
Authors: Alberto Fernández, Sergio Gómez
Venue: Proceeding of the 2005 conference on Artificial Intelligence Research and Development (2005)

Given a set of available assets, the portfolio selection problem consists in finding out the best way of investing a particular amount of money in the assets. Some heuristic methods based on evolutionary algorithms, tabu search and simulated annealing have been developed in the past. Here we present a Hopfield neural network model to solve the portfolio selection problem, comparing the new results to those obtained with the other heuristic methods.