ppxscal/embedding_network huggingface dataset:
Mining software code repositories and bug databases using survival analysis models
Authors: Michael Wedel, Uwe Jensen, Peter Göhner
Venue: Proceedings of the Second ACM-IEEE international symposium on Empirical software engineering and measurement (2008)

Code repositories and bug databases contain valuable information about the process of software development. Typical studies correlate code properties with the number of faults in a software module to find error-prone modules. However, many studies do not regard the occurrence of faults over time, although the time information can be retrieved from bug databases. In order to overcome this problem, we suggest the application of survival analysis models, which are used in biostatistics and can handle time-dependent data. Because a large amount of raw data has to be evaluated statistically, we further discuss the automated retrieval and pre-processing of raw data from code repositories and bug databases.
A note on application of the method of supplementary variables to the analysis of a processor sharing system
Authors: S. F. Yashkov
Venue: Automation and Remote Control (2008)

We present a new proof of Theorem of 1989 about non-stationary (transient) distribution of the number of jobs in the M/G/1 queue with egalitarian processor sharing. To get this goal, we use the well-known method of supplementary variables. The complete proof of that non-trivial Theorem of 1989 (see Theorem 2.1) was first given in the author's monograph [12, §2.8] (1989) by means of essentially novel analytic method. Before appearing author's work, this problem had been considered from analytic viewpoint as insoluble one. In essence, Theorem 2.2 almost repeats Theorem 2.1, but with other proof. In Section 3, Theorem 2.2 is extended to the case of an M/G/1-EPS queue with catastrophes which appear according to a Poisson process.
Undominated VCG redistribution mechanisms
Authors: Mingyu Guo, Vincent Conitzer
Venue: Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 2 (2008)

Many important problems in multiagent systems can be seen as resource allocation problems. For such problems, the well-known Vickrey-Clarke-Groves (VCG) mechanism is efficient, incentive compatible, individually rational, and does not incur a deficit. However, the VCG mechanism is not (strongly) budget balanced: generally, the agents' payments will sum to more than 0. Very recently, several mechanisms have been proposed that redistribute a significant percentage of the VCG payments back to the agents while maintaining the other properties. This increases the agents' utilities. One redistribution mechanism dominates another if it always redistributes at least as much to each agent (and sometimes more). In this paper, we provide a characterization of undominated redistribution mechanisms. We also propose several techniques that take a dominated redistribution mechanism as input, and produce as output another redistribution mechanism that dominates the original. One technique immediately produces an undominated redistribution mechanism that is not necessarily anonymous. Another technique preserves anonymity, and repeated application results in an undominated redistribution mechanism in the limit. We show experimentally that these techniques improve the known redistribution mechanisms.
A study on daylighting for energy saving
Authors: Roberto Faranda, Kim Fumagalli
Venue: Proceedings of the 7th WSEAS International Conference on Application of Electrical Engineering (2008)

The energy consumption for lighting system of the buildings can catch up 50% of the total consumption. It often approaches that the artificial light also is used when is not necessary, for example in the schools or the offices. A possible method in order to reduce this energy consumption and therefore to reduce the energetic bill is the natural light. The netural light simulations about an office (by DIALux software) are shown in this paper. The artificial lighting system has been used also when the illuminance on the work area is not enough. In terms of energy saving we have obtained great results; in function of the direction of the window, the energy saving is between 40% and 50%.
Effective classification using feature selection and fuzzy integration
Authors: Nick J. Pizzi, Witold Pedrycz
Venue: Fuzzy Sets and Systems (2008)

Many classification problems involve features whose specificity demand some form of feature space transformation (preprocessing) coupled with post-processing consensus analysis in order to accomplish a successful discrimination between different classes. In this study, we present a new methodology, which systematically addresses these design classification issues. At the preprocessing phase we offer a new approach of stochastic feature selection. This type of feature selection, collates quadratically transformed feature subsets for presentation to a collection of respective classifiers. In the sequel, independent classification outcomes are aggregated through fuzzy integration. The motivation behind the proposed methodology is twofold. Often, only a subset of features possesses discriminatory power while the remainder has a tendency to confound the effectiveness of the underlying classifier. Quite commonly, classification based on some consensus of classification outcomes coming from a set of classifiers operating upon different feature subsets becomes more accurate than the classification results produced by any individual classifier. To illustrate this design methodology, we discuss a classification problem coming from software engineering. Here we are concerned with a dataset comprosed of features describing a collection of qualitative attributes of a software system. The experiments demonstrate that the aggregated classification results using fuzzy integration are superior to the predictions from the respective best single classifiers.
The DHCP Failover Protocol: A Formal Perspective
Authors: Rui Fan, Ralph Droms, Nancy Griffeth, Nancy Lynch
Venue: Proceedings of the 27th IFIP WG 6.1 international conference on Formal Techniques for Networked and Distributed Systems (2007)

We present a formal specification and analysis of a fault-tolerant DHCP algorithm, used to automatically configure certain host parameters in an IP network. Our algorithm uses ideas from an algorithm presented in [5], but is considerably simpler and at the same time more structured and rigorous. We specify the assumptions and behavior of our algorithm as traces of Timed Input/Output Automata, and prove its correctness using this formalism. Our algorithm is based on a composition of independent subalgorithms solving variants of the classical leader election and shared register problems in distributed computing. The modularity of our algorithm facilitates its understanding and analysis, and can also aid in optimizing the algorithm or proving lower bounds. Our work demonstrates that formal methods can be feasibly applied to complex real-world problems to improve and simplify their solutions.
Efficient Algorithms for Fixed-Precision Instances of Bin Packing and Euclidean TSP
Authors: David R. Karger, Jacob Scott
Venue: Proceedings of the 11th international workshop, APPROX 2008, and 12th international workshop, RANDOM 2008 on Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques (2008)

This paper presents new, polynomial time algorithms for Bin Packing and Euclidean TSP under fixed precision. In this model, integers are encoded as floating point numbers, each with a mantissa and an exponent. Thus, an integer i with $i = a_i2^{t_i}$ has mantissa a i and exponent t i . This natural representation is the norm in real-world optimization. A set of integers I has L-bit precision if $\max_{i \in I} a_i. In this framework, we show an exact algorithm for Bin Packing and an FPTAS for Euclidean TSP which run in time poly(n) and poly(n + log1/¿), respectively, when L is a fixed constant. Our algorithm for the later problem is exact when distances are given by the L 1 norm. In contrast, both problems are strongly NP-Hard (and yield PTASs) when precision is unbounded. These algorithms serve as evidence of the significance of the class of fixed precision polynomial time solvable problems. Taken together with algorithms for the Knapsack and Pm||C max problems introduced by Orlin et al., [10] we see that fixed precision defines a class incomparable to polynomial time approximation schemes, covering at least four distinct natural NP-hard problems.
RSA with CRT: A New Cost-Effective Solution to Thwart Fault Attacks
Authors: David Vigilant
Venue: Proceeding sof the 10th international workshop on Cryptographic Hardware and Embedded Systems (2008)

Fault attacks as introduced by Bellcore in 1996 are still a major threat toward cryptographic products supporting RSA signatures. Most often on embedded devices, the public exponent is unknown, turning resistance to fault attacks into an intricate problem. Over the past few years, several techniques for secure implementations have been published, all of which suffering from inadequacy with the constraints faced by embedded platforms. In this paper, we introduce a novel countermeasure mechanism against fault attacks in RSA signature generation. In the restricted context of security devices where execution time, memory consumption, personalization management and code size are strong constraints, our countermeasure is simply applicable with a low computational complexity. Our method extends to all cryptosystems based on modular exponentiation.
Multilevel Task Partition Algorithm for Parallel Simulation of Power System Dynamics
Authors: Wei Xue, Shanxiang Qi
Venue: Proceedings of the 7th international conference on Computational Science, Part I: ICCS 2007 (2007)

Nowadays task partition for parallel computing is becoming more and more important. Particular in power system dynamic simulation, it is critical to design an efficient partition algorithm to reduce the communication and balance the computation load [1]. This paper presents a novel multilevel partition scheme based on the graph partition algorithm. By introducing regional characteristic into the partition, improving the weights of nodes and edges, proposing an objective function to evaluate the partition results and some other schemes, we can efficiently improve the defects in the traditional partition methods. With 12 CPUs for a large scale power system with 10188 nodes, the parallel efficiency with our new algorithm was 63% higher than that with METIS, a well-known program used for partitioning graphs. The proposed algorithm will satisfy the requirement for large scale power grid dynamic simulation.
Video conducting the olympic games 2008: the iTV field trial of the EU-IST project LIVE
Authors: Carmen Mac Williams, Richard Wages
Venue: Proceedings of the 3rd international conference on Digital Interactive Media in Entertainment and Arts (2008)

The EU IP project LIVE investigates novel iTV formats, production methods and tools for staging of live media events in a professional broadcast environment. The vision of LIVE is to change the role of the traditional live TV Director to become a future Video Conductor communicating in real-time with his audience. The concept of "video conducting" can be likened to a modern day operatic performance on screen. To deliver live stage performances the Conductor must in real-time direct the actors on stage, the orchestra in the pit, and respond to the audience's mood to ensure a quality of drama. In the upcoming field trial of LIVE the public Austrian TV Station ORF will video conduct the Olympic Games 2008 in a closed wall IPTV environment for 500 test end users.
An Access Control Model in Lager-Scale P2P File Sharing Systems
Authors: Yue Guang-Xue, Yu Fei, Chen Li-Ping, Chen Yi-Jun
Venue: Proceedings of the 7th international conference on Computational Science, Part IV: ICCS 2007 (2007)

In lager-scale P2P file sharing systems, peers often must interact with unknown or unfamiliar peers without the benefit of trusted third parties or authorities to mediate the interactions. The decentralized and anonymous characteristics of P2P environments make the task of controlling access to sharing information more difficult. In this paper, we identify access control requirements and propose a trust based access control framework for P2P file-sharing systems. The model integrates aspects of trust and recommendation, fairness based participation schemes and access control schemes.
Certified Size-Change Termination
Authors: Alexander Krauss
Venue: Proceedings of the 21st international conference on Automated Deduction: Automated Deduction (2007)

We develop a formalization of the Size-Change Principle in Isabelle/HOL and use it to construct formally certified termination proofs for recursive functions automatically.
A Support Vector Method for Estimating Joint Density of Medical Images
Authors: Jesús Serrano, Pedro J. García-Laencina, Jorge Larrey-Ruiz, José-Luis Sancho-Gómez
Venue: Proceedings of the 2nd international work-conference on Nature Inspired Problem-Solving Methods in Knowledge Engineering: Interplay Between Natural and Artificial Computation, Part II (2007)

Human learning inspires a large amount of algorithms and techniques to solve problems in image understanding. Supervised learning algorithms based on support vector machines are currently one of the most effective methods in machine learning. A support vector approach is used in this paper to solve a typical problem in image registration, this is, the joint probability density function estimation needed in the image registration by maximization of mutual information. Results estimating the joint probability density function for two CT and PET images demonstrate the proposed approach advantages over the classical histogram estimation.
Wavelet Noise Reduction Based on Energy Features
Authors: Guoyi Fu, Ali Hojjat, Alan Colchester
Venue: Proceedings of the 5th international conference on Image Analysis and Recognition (2008)

This paper proposes a new algorithm based on energy features for noise reduction using wavelets. The device noise profile is obtained by the noise images taken from the imaging device so that it can represent the device's noise in multi-scale and multi-band. The energy feature takes advantage of the inter-scale relationship and spatial relationship of wavelet transformation. The wavelet coefficients are shrunk by the likelihood of noise or signal based on its energy level. The de-noised images are obtained by wavelet reconstruction. The results and comparison against common used methods show that the performance of our method is very promising despite simple structure.
Nyström methods and singular second-order differential equations
Authors: David Benko, Daniel C. Biles, Mark P. Robinson, John S. Spraker
Venue: Computers Mathematics with Applications (2008)

Chawla, Jain and Subramanian studied the application of Nystrom methods to a class of singular initial value problems. Following their approach, we generalize this class by applying the Nystrom method to the initial value problem for an equation of the form y^''+p(t)y^'+q(t,y(t))=0,t@?(0,1] where p has a certain specified type of singularity and q is sufficiently differentiable, and then we determine the order of convergence. This is followed by computational evidence.
Animated Impostors Manipulation for Real-Time Display in Games Design
Authors: Youwei Yuan, Lamei Yan
Venue: Proceedings of the 3rd international conference on Technologies for E-Learning and Digital Entertainment (2008)

This paper describes a system platform for animated impostors manipulation for real-time display in games design. Our "agent common environment" provides built-in commands for perception and for acting, while the in-between step of reasoning and behavior computation is defined through an external, extendible, and parameterized collection of behavioral plug-ins. Finally we introduce concrete case studies that demonstrate the effectiveness of our approach.
Antichain-Based Universality and Inclusion Testing over Nondeterministic Finite Tree Automata
Authors: Ahmed Bouajjani, Peter Habermehl, Lukáš Holík, Tayssir Touili, Tomáš Vojnar
Venue: Proceedings of the 13th international conference on Implementation and Applications of Automata (2008)

We propose new antichain-based algorithms for checking universality and inclusion of nondeterministic tree automata (NTA). We have implemented these algorithms in a prototype tool and our experiments show that they provide a significant improvement over the traditional determinisation-based approaches. We use our antichain-based inclusion checking algorithm to build an abstract regular tree model checking framework based entirely on NTA. We show the significantly improved efficiency of this framework through a series of experiments with verifying various programs over dynamic linked tree-shaped data structures.
Regularized Knowledge-Based Kernel Machine
Authors: Olutayo O. Oladunni, Theodore B. Trafalis
Venue: Proceedings of the 7th international conference on Computational Science, Part I: ICCS 2007 (2007)

This paper presents a knowledge-based kernel classification model for binary classification of sets or objects with prior knowledge. The prior knowledge is in the form of multiple polyhedral sets belonging to one or two classes, and it is introduced as additional constraints into a regularized knowledge-based optimization problem. The resulting formulation leads to a least squares problem that can be solved using matrix or iterative methods. To evaluate the model, the experimental laminar turbulent flow data and the Reynolds number equation used as prior knowledge were used to train and test the proposed model.
The digital constitutional state: Democracy and law in the information society
Authors: Mark Bovens, Eugène Loos
Venue: Information Polity (2002)

What are the consequences of the ongoing process of informatisation for the democratic constitutional state? To answer this question a topical perspective of the constitutional state is provided. In this perspective, the constitutional state is portrayed as a 'house', an edifice to which new storeys and rooms have been added and furnished over the course of centuries. Each storey of this edifice originated as a result of the major societal transitions that occurred during previous centuries. The majority of western societies are currently once again in the throes of yet another such transition, namely from an industrial to an information society. The possible consequences of this newest transition for the constitutional state, are reviewed on the basis of four important features of the information society (deterritorialisation, turbulence, horizontalisation and dematerialisation). Renovation, the simple adaptation of the house to the needs of the information society will suffice in a number of cases. Innovation is called for in some respects: deterritorialisation of democracy, horizontalisation of the constitutional state and the development of transparency as a new supporting topos.
Constructing Brezing-Weng Pairing-Friendly Elliptic Curves Using Elements in the Cyclotomic Field
Authors: Ezekiel J. Kachisa, Edward F. Schaefer, Michael Scott
Venue: Proceedings of the 2nd international conference on Pairing-Based Cryptography (2008)

We describe a new method for constructing Brezing-Weng-like pairing-friendly elliptic curves. The new construction uses the minimal polynomials of elements in a cyclotomic field. Using this new construction we present new "record breaking" families of pairing-friendly curves with embedding degrees of k ¿ {16,18,36,40}, and some interesting new constructions for the cases k ¿ {8,32}.
Industrial deployment of multi-agent technologies: review and selected case studies
Authors: Michal Pĕchouček, Vladimír Mařík
Venue: Autonomous Agents and Multi-Agent Systems (2008)

This paper reports on industrial deployment of multi-agent systems and agent technology. It provides an overview of several application domains and an in-depth presentation of four specific case studies. The presented applications and deployment domains have been analyzed. The analysis indicates that despite strong industrial involvement in this field, the full potential of the agent technology has not been fully utilized yet and that not all of the developed agent concepts and agent techniques have been completely exploited in industrial practice. In the paper, the key obstacles for wider deployments are listed and potential future challenges are discussed.
HEMET: Mathematical model of biochemical pathways for simulation and prediction of HEpatocyte METabolism
Authors: C. De Maria, D. Grassini, F. Vozzi, B. Vinci, A. Landi, A. Ahluwalia, G. Vozzi
Venue: Computer Methods and Programs in Biomedicine (2008)

Many computer studies and models have been developed in order to simulate cell biochemical pathways. The difficulty of integrating all the biochemical reactions that occur in a cell in a single model is the main reason for the poor results in the prediction and simulation of cell behaviour under different chemical and physical stimuli. In this paper we have translated biochemical reactions into differential equations for the development of modular model of metabolism of a hepatocyte cultured in static and standard conditions (in a plastic multiwell placed in an incubator at 37^oC with 5% of CO"2). Using biochemical equations and energetic considerations a set of non-linear differential equations has been derived and implemented in Simulink^(R). This set of equations mimics some of the principal metabolic pathways of biomolecules present in the culture medium. The software platform developed is subdivided into separate modules, each one describing a different metabolic pathway; they constitute a library which can be used for developing new modules and models to project, predict and validate cell behaviour in vitro.
Face Feature Extraction Using Elliptical Model Based Background Deletion and Generalized FEM
Authors: Yun-Su Chung, Sung-Uk Jung, Young-Lae Bae, Ki-Young Moon
Venue: Proceedings of the 2007 Third International IEEE Conference on Signal-Image Technologies and Internet-Based System (2007)

This paper addresses a new face feature extraction method using elliptical model based background deletion and the generalized facial energy map (FEM). First of all, the method utilizes the elliptical model of a face to get a good normalized face image. This elliptical model based approach, thus, can easily delete the background region of high complexity. Next, the method generates a generalized FEM from the transformed data set of normalized face images. Finally, the coefficients of DCT, potentially containing important meanings, are extracted with the above generalized FEM, and are analyzed by using LDA. Experimental results show that the method effectively extracts feature vectors with reasonable time complexity, and has good recognition performance.