ppxscal/embedding_network huggingface dataset:
Analysis of the reliability of a subset of change metrics for defect prediction
Authors: Raimund Moser, Witold Pedrycz, Giancarlo Succi
Venue: Proceedings of the Second ACM-IEEE international symposium on Empirical software engineering and measurement (2008)

In this paper, we describe an experiment, which analyzes the relative importance and stability of change metrics for predicting defects for 3 releases of the Eclipse project. The results indicate that out of 18 change metrics 3 metrics contain most information about software defects. Moreover, those 3 metrics remain stable across 3 releases of the Eclipse project. A comparative analysis with the full model shows that the prediction accuracy is not too much affected by using a subset of 3 metrics and the recall even improves.
Characterizing and predicting the I/O performance of HPC applications using a parameterized synthetic benchmark
Authors: Hongzhang Shan, Katie Antypas, John Shalf
Venue: Proceedings of the 2008 ACM/IEEE conference on Supercomputing (2008)

The unprecedented parallelism of new supercomputing platforms poses tremendous challenges to achieving scalable performance for I/O intensive applications. Performance assessments using traditional I/O system and component benchmarks are difficult to relate back to application I/O requirements. However, the complexity of full applications motivates development of simpler synthetic I/O benchmarks as proxies to the full application. In this paper we examine the I/O requirements of a range of HPC applications and describe how the LLNL IOR synthetic benchmark was chosen as suitable proxy for the diverse workload. We show a procedure for selecting IOR parameters to match the I/O patterns of the selected applications and show it can accurately predict the I/O performance of the full applications. We conclude that IOR is an effective replacement for full-application I/O benchmarks and can bridge the gap of understanding that typically exists between stand-alone benchmarks and the full applications they intend to model.
Reputation, Trust and Recommendation Systems in Peer-to-Peer Systems
Authors: Boaz Patt-Shamir
Venue: Proceedings of the 15th international colloquium on Structural Information and Communication Complexity (2008)

The Internet has brought about the notion of peer-to-peer computing, whose reliance on a central authority (let alone a central server) is minimal. It seems fair to say that one of the Great Promises of the Internet is that such unmoderated direct interaction between users will reduce much of the traditional overhead due to the "man in middle" taking his share: either financially (in the context of e-commerce) or conceptually (in the context of opinion shaping, say). The flip side of this prospect, of course, is the danger that the system will deteriorate into a lawless jungle: some users in a peer-to-peer system, possibly coordinated, might exploit honest users to their advantage, since it appears that there is no effective way to enforce rules in this game.
Operationalisation of Norms for Electronic Institutions
Authors: Huib Aldewereld, Frank Dignum, Andrés García-Camino, Pablo Noriega, Juan Antonio Rodríguez-Aguilar, Carles Sierra
Venue: Coordination, Organizations, Institutions, and Norms in Agent Systems II: AAMAS 2006 and ECAI 2006 International Workshops, COIN 2006 Hakodate, Japan, May 9, 2006 Riva del Garda, Italy, August 28, 2006. Revised Selected Papers (2007)

Agent-mediated electronic institutions belong to a new and promising field where interactions among agents are regulated by means of a set of explicit norms. Current implementations of such open-agent systems are, however, mostly using constraints on the behaviour of the agents, thereby severely limiting the autonomy of the agents. In this paper we propose an extension to electronic institutions to allow for a flexible enforcement of norms, and manners to help overcome the difficulties of translating abstract norms for the use of implementation.
General Euler Diagram Generation
Authors: Peter Rodgers, Leishi Zhang, Andrew Fish
Venue: Proceedings of the 5th international conference on Diagrammatic Representation and Inference (2008)

Euler diagrams are a natural method of representing set-theoretic data and have been employed in diverse areas such as visualizing statistical data, as a basis for diagrammatic logics and for displaying the results of database search queries. For effective use of Euler diagrams in practical computer based applications, the generation of a diagram as a set of curves from an abstract description is necessary. Various practical methods for Euler diagram generation have been proposed, but in all of these methods the diagrams that can be produced are only for a restricted subset of all possible abstract descriptions.We describe a method for Euler diagram generation, demonstrated by implemented software, and illustrate the advances in methodology via the production of diagrams which were difficult or impossible to draw using previous approaches. To allow the generation of all abstract descriptions we may be required to have some properties of the final diagram that are not considered nice. In particular we permit more than two curves to pass though a single point, permit some curve segments to be drawn concurrently, and permit duplication of curve labels. However, our method attempts to minimize these bad properties according to a chosen prioritization.
Representing Concepts in Time
Authors: Martin Raubal
Venue: Proceedings of the international conference on Spatial Cognition VI: Learning, Reasoning, and Talking about Space (2008)

People make use of concepts in all aspects of their lives. Concepts are mental entities, which structure our experiences and support reasoning in the world. They are usually regarded as static, although there is ample evidence that they change over time with respect to structure, content, and relation to real-world objects and processes. Recent research considers concepts as dynamical systems, emphasizing this potential for change. In order to analyze the alteration of concepts in time, a formal representation of this process is necessary. This paper proposes an algebraic model for representing dynamic conceptual structures, which integrates two theories from geography and cognitive science, i.e., time geography and conceptual spaces. Such representation allows for investigating the development of a conceptual structure along space-time paths and serves as a foundation for querying the structure of concepts at a specific point in time or for a time interval. The geospatial concept of `landmark' is used to demonstrate the formal specifications.
Improved Bounds on the Linear Complexity of Keystreams Obtained by Filter Generators
Authors: Nicholas Kolokotronis, Konstantinos Limniotis, Nicholas Kalouptsidis
Venue: Information Security and Cryptology: Third SKLOIS Conference, Inscrypt 2007, Xining, China, August 31 - September 5, 2007, Revised Selected Papers (2007)

Binary sequences generated by nonlinearly filtering maximal length sequences with period 2 n ¿ 1 are studied in this paper. We focus on the particular class of normal filters and provide improved lower bounds on the linear complexity of generated keystreams. This is achieved by first proving properties of a special class of determinants which are associated to linearized polynomials over finite fields of characteristic 2 and then by applying the above to simplify generalizations of the root presence test.
Macro-micro Interlocked Simulation for Multiscale Phenomena
Authors: Kanya Kusano, Shigenobu Hirose, Toru Sugiyama, Shinichiro Shima, Akio Kawano, Hiroki Hasegawa
Venue: Proceedings of the 7th international conference on Computational Science, Part I: ICCS 2007 (2007)

A new methodology for the simulation of multiscale pro-cesses, called Macro-Micro Interlocked (MMI) Simulation, is introduced. The MMI simulation is carried out by the two-way connection of different numerical models, which may handle macroscopic and microscopic dynamics, respectively. The MMI simulation are applied to several multiscale phenomena, for instance, cloud formation, gas detonation, and plasma dynamics. The results indicate that the MMI simulation provide us an effective and prospective framework for multiscale simulation.
The Influence of Gender and Involvement Level on the Perceived Credibility of Web Sites
Authors: Susan Ferebee
Venue: Proceedings of the 3rd international conference on Persuasive Technology (2008)

This article discusses the influence of interaction effects of gender and enduring involvement level on the perceived credibility of Web sites. This article discusses results that show that the interaction effect between enduring involvement and gender significantly influence the perceived credibility of Web sites.
SCALAR: Scalable Data Lookup and Replication Framework for Mobile Ad-hoc Networks
Authors: Emre Atsan, Oznur Ozkasap
Venue: Proceedings of the 2008 The 28th International Conference on Distributed Computing Systems Workshops (2008)

Data replication protocols proposed for MANETs are often prone to the scalability problems due to their definitions or underlying routing protocols they are based on. In particular, they exhibit poor performance when the network size is scaled up. However,scalability is an important criterion for several MANET applications. We propose a scalable and reactive data replication approach, named SCALAR, combined with a low-cost data lookup protocol. SCALAR is a virtual backbone based solution, in which thenetwork nodes construct a connected dominating set based on network topology graph. Extensive simulations are performed to analyze and compare the behavior of this framework. It is demonstrated as an efficient solution for high-density, high-load, large scale mobile ad hoc networks.
Virtual Camera Tools for an Image2Video Application
Authors: Fernando Barreiro Megino, José M. Martínez Sánchez, Víctor Valdés López
Venue: Proceedings of the 2008 Ninth International Workshop on Image Analysis for Multimedia Interactive Services (2008)

This paper proposes a set of virtual camera tools developed as a part of an image to video system, oriented to the adaptation of large images to be viewed on small displays without a significant loss of information. This transmoding system automates the process of scrolling and zooming through an image with a minimal user interaction by simulating a virtual camera movement through the picture. The process is automatic and the user interaction will be limited to establish some preferences on the video generation. The focus of this article is the presentation of the algorithms designed to obtain smooth, user-customizable camera movements.
Evolutionary Methods for Designing Neuro-fuzzy Modular Systems Combined by Bagging Algorithm
Authors: Marcin Gabryel, Leszek Rutkowski
Venue: Proceedings of the 9th international conference on Artificial Intelligence and Soft Computing (2006)

In this paper we present the problem of designing modular systems combined with the Bagging Algorithm. As component classifiers the Mamdani-type neuro fuzzy-systems are applied and trained using evolutionary methods. Experimental investigations presented in this paper include the classification performed by the modular system built by means of classic Bagging algorithm and its modified version which assigns evolutionary chosen weights to base classifiers.
Design of DNA Sequence Based on Improved Genetic Algorithm
Authors: Bin Wang, Qiang Zhang*, Rui Zhang
Venue: Proceedings of the 4th international conference on Intelligent Computing: Advanced Intelligent Computing Theories and Applications - with Aspects of Theoretical and Methodological Issues (2008)

DNA computing is a new method that uses biological molecule DNA as computing medium and biochemical reaction as computing tools. The design of DNA sequence plays an important role in improving the reliability of DNA computation. The sequence design is an approach of the control, which aims to design of DNA sequences satisfying some constraints to avoid such unexpected molecular reactions .To deal these constraints ,we convert the design of DNA sequences into a multi-objective optimize problems, and then an example is illustrated to show the efficiency of our method given here.
Self-organized Complex Neural Networks through Nonlinear Temporally Asymmetric Hebbian Plasticity
Authors: Hideyuki Kato, Tohru Ikeguchi
Venue: Proceedings of the 18th international conference on Artificial Neural Networks, Part I (2008)

Triggered by recent experimental results, the spike-timing-dependent plasticity (STDP) has been widely analyzed in the neuroscience. In this paper, we analyzed how spatial structure of neural networks will be organized through the STDP. In the experiments, we did use additive and multiplicative STDP rules as well as a nonlinear temporally asymmetric Hebbian rule. As a result, if the additive rule is applied, neural networks exhibit small-world properties. On the other hand, in the case of the multiplicative rule, the small-world networks are not constructed. In addition, we also found that the small-world properties of the neural networks become higher if the STDP rule is less dependent on current synaptic weights.
A Hybrid Intelligent Algorithm for the Vehicle Routing with Time Windows
Authors: Qiuwen Zhang, Tong Zhen, Yuhua Zhu, Wenshuai Zhang, Zhi Ma
Venue: Proceedings of the 4th international conference on Intelligent Computing: Advanced Intelligent Computing Theories and Applications - with Aspects of Theoretical and Methodological Issues (2008)

Vehicle routing problems (VRP) arise in many real-life applications within transportation and logistics. This paper considers vehicle routing models with time windows and its hybrid intelligent algorithm. Vehicle routing problem with time windows (VRPTW) is an NP-complete optimization problem. The objective of VRPTW is to use a fleet of vehicles with specific capacity to serve a number of customers with fixed demand and time window constraints. A hybrid intelligent algorithm base on dynamic sweep and ant colony algorithm (DSACA-VRPTW) is proposed to solve this problem. Firstly, each ant's solution might be improved by dynamic sweep algorithm. Then a new improved ant colonies technique is proposed for it. Finally, Solomon's benchmark instances (VRPTW 100-customer) are tested for the algorithm and shows that the DSACA is able to find solutions for VRPTW.
Robust Collaborative Optimization of a Multi-finger Micro-accelerometer Based on Genetic Algorithm
Authors: Yuming Yuan, Wenhui Fan, Wei Wang, Huiui Liu
Venue: Proceedings of the 2008 Second International Conference on Genetic and Evolutionary Computing (2008)

Multi-finger Micro-accelerometer are micro electro mechanical systems (MEMS) devices based on IC technology and micro-machining technology, which are widely implemented both in military and civilian fields. Robust Collaborative Optimization (RCO) method is built based on CO method. The research establishes the RCO Model based on genetic algorithm for the problem, and proposes a MATLAB program to calculate it, which eliminate the coupling of the system and minimize the fluctuations of the system objective function, so as to obtain the stable and optimal solution for the system. The results are compared and analyzed to validate the effectiveness of RCO method and MATLAB program. The research analyzes the cause and effect of variable quantity magnitude difference problem encountered in the process, and proposes weight variation method to improve, which eliminates the impact of the problem.
Optimal Agreement in a Scale-Free Network Environment
Authors: Shu-Ching Wang, Kuo-Qin Yan, Mao-Lun Chiang
Venue: Informatica (2006)

Generally, the task in a distributed system must achieve an agreement. It requires a set of processors to agree on a common value even if some components are corrupted. There are significant studies on this agreement problem in a regularized network environment, such as the Fully Connected, BroadCast and MultiCast Networks. Recently, many large complex networks have emerged and displayed a scale-free feature, which influences the system to reach a common value differently. Unfortunately, existing agreement protocols and results cannot cope with the new network environment and the agreement problem thus needs to be revisited. In this paper, we propose a new agreement protocol to adapt to the scale-free network environment and derive its bound of allowable faulty TMs with two rounds of message exchange. We have proved the correctness of this protocol and analyzed its complexity. It is observed that the scale-free network with the proposed agreement protocol can tolerate more faulty TMs than the networks based on previous studies.
View-dependent dynamics of articulated bodies
Authors: Sujeong Kim Stephane Redon Young J. Kim
Venue: Computer Animation and Virtual Worlds (2008)

We propose a method for view-dependent simplification of articulated-body dynamics, which enables an automatic trade-off between visual precision and computational efficiency. We begin by discussing the problem of simplifying the simulation based on visual criteria, and show that it raises a number of challenging questions. We then focus on articulated-body dynamics simulation, and propose a semi-predictive approach which relies on a combination of exact, a priori error metrics computations, and visibility estimations. We suggest several variants of semi-predictive metrics based on hierarchical data structures and the use of graphics hardware, and discuss their relative merits in terms of computational efficiency and precision. Finally, we present several benchmarks and demonstrate how our view-dependent articulated-body dynamics method allows an animator (or a physics engine) to finely tune the visual quality and obtain potentially significant speed-ups during interactive or off-line simulations. Copyright &copy; 2008 John Wiley & Sons, Ltd.
The performance of the M/G/1 queue under the dyadic Min(N,D)-policy and its cost optimization
Authors: Ho Woo Lee, Won Joo Seo
Venue: Performance Evaluation (2008)

In this paper, we consider the M/G/1 queueing system under the Min(N,D)-policy in which the idle server resumes its service if either N customers accumulate in the system or the total backlog of the service times of the waiting customers exceeds D, whichever occurs first. We first analyze the queue length, the workload and the waiting time. Then, we consider two linear cost models (one based on the mean workload and the other based on the mean queue length) and compare the optimal Min(N,D)-policy with the optimal N-policy and the optimal D-policy.
Pearson-based mixture model for color object tracking
Authors: W. Ketchantang, S. Derrode, L. Martin, S. Bourennane
Venue: Machine Vision and Applications (2008)

To track objects in video sequences, many studies have been done to characterize the target with respect to its color distribution. Most often, the Gaussian mixture model (GMM) is used to represent the object color density. In this paper, we propose to extend the normality assumption to more general families of distributions issued from the Pearson&#x2019;s system. Precisely, we propose a method called Pearson mixture model (PMM), used in conjunction with Gaussian copula, which is dynamically updated to adapt itself to the appearance change of the object during the sequence. This model is combined with Kalman filtering to predict the position of the object in the next frame. Experimental results on gray-level and color video sequences show tracking improvements compared to classical GMM. Especially, the PMM seems robust to illumination variations, pose and scale changes, and also to partial occlusions, but its computing time is higher than the computing time of GMM.
Residual Filter for Improving Coding Performance of Noisy Video Sequences
Authors: Won Seon Song, Seong Soo Lee, Min-Cheol Hong
Venue: Proceedings of the 3rd Iberian conference on Pattern Recognition and Image Analysis, Part II (2007)

This paper addresses a low complexity residual filter to improve the coding performance of noisy video sequences. The additive noise decreases the coding efficiency and results in unpleasant coding artifacts due to higher frequency components. By incorporating local statistics and quantization parameter into filtering process, the spurious noise is significantly attenuated and coding efficiency is improved for given quantization step size. In addition, in order to reduce the complexity of the residual filter, the simplified local statistics and quantization parameter induced by analyzing H.264/AVC transformation and quantization processes are introduced. The simulation results show the capability of the proposed algorithm.
Preserving Source-Location Privacy in Energy-Constrained Wireless Sensor Networks
Authors: Jianbo Yao, Guangjun Wen
Venue: Proceedings of the 2008 The 28th International Conference on Distributed Computing Systems Workshops (2008)

As wide applications of wireless sensor networks, privacy concerns have emerged as the main obstacle to success. When wireless sensor networks are used to monitor sensitive objects, the privacy about monitored object' locations becomes an important issue. When a sensor node reports a monitored object to base station by sending a series of packets through multiple hops, an adversary may trace back the source's location. Flooding-based phantom has a problem that message latencies become larger and energy costs become higher for protecting source-location privacy. In this paper, DROW (Directed Random Walk) is proposed to make it difficult for an adversary to backtrack hop-by-hop to the origin of the sensor communication. In DROW, the source sensor sends out a packet, the packet is unicasted to its parent node. When intermediate node receives a packet, it forwards to one of its parent nodes in a directed random fashion. Compared to Flooding-based phantom, DROW has smaller message latencies and lower energy costs. Especially, DROW has better safety period when intermediate node has multi-parent node.
Gesture Based Interface for Crime Scene Analysis: A Proposal
Authors: Andrea F. Abate, Maria Marsico, Stefano Levialdi, Vincenzo Mastronardi, Stefano Ricciardi, Genoveffa Tortora
Venue: Proceedings of the international conference on Computational Science and Its Applications, Part II (2008)

Within crime scene analysis, a framework providing interactive visualization and gesture based manipulation of virtual objects, while still seeing the real environment, seems a useful approach for the interpretation of cues and for instructional purposes as well. This paper presents a framework providing a collection of techniques to enhance reliability, accuracy and overall effectiveness of gesture-based interaction, applied to an interactive interpretation and evaluation of a crime scene in an augmented reality environment. The interface layout is visualized via a stereoscopic see-through capable Head Mounted Display (HMD), projecting graphics in the central region of the user's field of view, floating in a close-at-hand volume. The interaction paradigm concurrently exploits both hands to perform precise manipulation of 3D models of objects, eventually present on the crime scene, or even distance/angular measurements, allowing to formulate visual hypothesis with the lowest interaction effort. A real-time adaptation of interaction to the user's needs is performed by monitoring hands and fingers' dynamics, in order to allow both complex actions (like the above mentioned manipulation or measurement) and conventional keyboard-like operations.