ppxscal/embedding_network huggingface dataset:
Termination Analysis of Java Bytecode
Authors: Elvira Albert, Puri Arenas, Michael Codish, Samir Genaim, Germán Puebla, Damiano Zanardini
Venue: Proceedings of the 10th IFIP WG 6.1 international conference on Formal Methods for Open Object-Based Distributed Systems (2008)

Termination analysis has received considerable attention, traditionally in the context of declarative programming, and recently also for imperative languages. In existing approaches, termination is performed on source programs. However, there are many situations, including mobile code, where only the compiled code is available. In this work we present an automatic termination analysis for sequential Java Bytecode programs. Such analysis presents all of the challenges of analyzing a low-level language as well as those introduced by object-oriented languages. Interestingly, given a bytecode program, we produce a constraint logic program, CLP, whose termination entails termination of the bytecode program. This allows applying the large body of work in termination of CLP programs to termination of Java bytecode. A prototype analyzer is described and initial experimentation is reported.
A Spatio-morphological Modelling for Spread Predicting
Authors: Christine Voiron-Canicio
Venue: Proceeding sof the international conference on Computational Science and Its Applications, Part I (2008)

The purpose of this paper is to present a new modelling approach which deals with the spatial spreading of built-up areas, on a local or regional scale. Our spatial modelling is similar to cellular automata but differs in the use of image processing method and mathematical morphology algorithms. In this model, the spatial spread process depends on both proximity and morphology of the built-up areas located in a space whose configuration also determines the shape of the spatial spread. These features explain the "spatio morphological" qualifier given to this model. This paper firstly presents the spatio-morphological modelling approach and the steps used to simulate the spatial extension of built-up areas. Secondly, this model is applied to the coast of Languedoc in a Southern region of France subjected to a strong residential pressure.
Combining the vortex-in-cell and parallel fast multipole methods for efficient domain decomposition simulations
Authors: Roger Cocle, Grégoire Winckelmans, Goéric Daeninck
Venue: Journal of Computational Physics (2008)

A new combination of vortex-in-cell and parallel fast multipole methods is presented which allows to efficiently simulate, in parallel, unbounded and half-unbounded vortical flows (flows with one flat wall). In the classical vortex-in-cell (VIC) method, the grid used to solve the Poisson equation is typically taken much larger than the vorticity field region, so as to be able to impose suitable far-field boundary conditions and thus approximate the truly unbounded (or half-unbounded) flow; an alternative is to assume periodicity. This approach leads to a solution that depends on the global grid size and, for large problems, to unmanageable memory and CPU requirements. The idea exploited here is to work on a domain that contains tightly the vorticity field and that can be decomposed in several subdomains on which the exact boundary conditions are obtained using the parallel fast multipole (PFM) method. This amounts to solving a 3-D Poisson equation without requiring any iteration between the subdomains (e.g., no Schwarz iteration required): this is so because the PFM method has a global view of the entire vorticity field and satisfies the far-field condition. The solution obtained by this VIC-PFM combination then corresponds to the simulation of a truly unbounded (or half-unbounded) flow. It requires far less memory and leads to a far better computational efficiency compared to simulations done using either (1) the VIC method alone, or (2) the vortex particle method with PFM solver alone. 3-D unbounded flow validation results are presented: instability, non-linear evolution and decay of a vortex ring (first at a moderate Reynolds number using the sequential version of the method, then at a high Reynolds number using the parallel version); instability and non-linear evolution of a two vortex system in ground effect. Finally, a space-developing simulation of an aircraft vortex wake in ground effect is also presented.
Locating zigbee® nodes using the ti®s cc2431 location engine: a testbed platform and new solutions for positioning estimation of wsns in dynamic indoor environments
Authors: Stefano Tennina, Marco Di Renzo, Fabio Graziosi, Fortunato Santucci
Venue: Proceedings of the first ACM international workshop on Mobile entity localization and tracking in GPS-less environments (2008)

In this paper, we analyze and describe the achievable performance of a Wireless Sensor Network (WSN) testbed platform, which has been deployed at the Center of Excellence DEWS (University of L'Aquila, Italy) for positioning applications, and which is implemented using CC2431 sensor nodes developed by Texas Instruments® (TI)/Chipcon. In particular, we will report on an extensive campaign of measurements aiming at analyzing the performance of the CC2431's hardware location-finder engine when localization needs to be performed in a realistic and dynamic indoor propagation environment. Experimental results will show that the need of site-specific parameters for the correct operation of the location engine may severely reduce the localization accuracy of the system in dynamic environments. A simple solution to counteract this problem will also be introduced, and the related improvement will be quantified via experiments.
Introducing complete graphs in molecular connectivity studies
Authors: Lionello Pogliani
Venue: Journal of Computational Methods in Sciences and Engineering (2005)

The mathematical model of the molecular polarizability of fifty-four organic compounds, of the lattice enthalpy of twenty metal halides, and of the partition coefficient of twenty-five organic compounds has been used to test four different complete graph, K$_p$, conjectures for the core electrons of any atom with principal quantum number n &ges; 2. Medium-sized sets of molecular connectivity and molecular pseudoconnectivity indices based on these four K$_p$ conjectures have been used as basis indices to model the three different properties of the three classes of compounds. The odd complete graph conjecture for the core electrons gives rise to an optimal model for the three properties. Within the frame of this odd complete graph conjecture two different algorithms to derive the basis indices, can be used. One algorithm defines a single-odd valence delta number, &delta;$^v$ (q = 1), while the other algorithm defines a double-odd valence delta number, &delta;$^v$ (q = p). The valence delta number, &delta;$^{v}$, is the main parameter of the molecular connectivity and pseudoconnectivity basis indices.
New Cycle-Lane Project: A Participative Approach
Authors: Marco Rotonda, Massimiliano Petri
Venue: Proceeding sof the international conference on Computational Science and Its Applications, Part I (2008)

As pointed out from some analysis about Italian urban mobility and its environmental management, in the complexity of the actual analysis a shadow exists always: the demand view, the citizen's preferences. The methodology presented tries to answer this last problem and tries to introduce a new element: the reconstruction of a general urban mobility description, searching to reply to some questions as: How much important is the cycle mobility? How does the citizen determine the right means of transport? How much important in the choose of transport means is the activity localization in the city?
On the Addition of Recurrent Configurations of the Sandpile-Model
Authors: Matthias Schulz
Venue: Proceedings of the 8th international conference on Cellular Automata for Reseach and Industry (2008)

The sandpile model, introduced by Bak, Tang and Wiesenfeld in 1987, is the standard example for a dynamic model showing Self-Organized Criticality (SOC). Also, it has many nice algebraic properties; for example, there is a set of configurations which is a group with a certain naturally defined addition.We look at elements c, d of this group and try to find out how long it takes to naively compute the sum c ¿ d. While we can easily give an upper bound, it is harder to find a lower bound. We prove some facts about the number of topplings (elementary operations) that have to be performed during the addition of two elements of the group and give a heuristic for quickly finding local minima. 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
Learning Style as a Parameter in a Unified e-Learning System Architecture: The Adaptive Diagnosis
Authors: Sotirios Botsios, Dimitrios Georgiou
Venue: Proceedings of the 5th international conference on Adaptive Hypermedia and Adaptive Web-Based Systems (2008)

Adaptation and personalization services in e-learning environments are considered the turning point of recent research efforts, as the "one-size-fits-all" approach has some important drawbacks, from the educational point of view. Adaptive Educational Hypermedia Systems in World Wide Web became a very active research field and the need for standardization arose, as the continually augmenting research efforts lacked the interoperability dimension. To this end, we propose an adaptive hypermedia educational system architecture strongly coupled to existing standards that overcomes the above mentioned weakness. Part of such architecture is the development of diagnostic tools capable to recognize certain learner's characteristics to the purpose of providing learning material tailored to the learner's specific needs in an asynchronous learning environment. This paper describes Learning Style diagnosis which can be approached either by the use of probabilistic expert systems or by the use of fuzzy systems.
Bisimilar Finite Abstractions of Interconnected Systems
Authors: Yuichi Tazaki, Jun-Ichi Imura
Venue: Proceedings of the 11th international workshop on Hybrid Systems: Computation and Control (2008)

This paper addresses the design of approximately bisimilar finite abstractions of systems that are composed of the interconnection of smaller subsystems. First, it is shown that the ordinary notion of approximate bisimulation does not preserve the interconnection structure of the concrete model. Next, a new definition of approximate bisimulation that is compatible with interconnection is proposed. Based on this definition of approximate bisimulation, the design of interconnection-compatible finite abstractions of linear subsystems is discussed.
A Method of X-Ray Image Recognition Based on Fuzzy Rule and Parallel Neural Networks
Authors: Dongmei Liu, Zhaoxia Wang
Venue: Proceedings of the 4th international symposium on Neural Networks: Part II--Advances in Neural Networks (2007)

The detection of explosives and illicit material in passengers' luggage for the purpose of station security is an important area in public traffic security. This paper presents a method for X-ray image recognition based on fuzzy rule and parallel neural networks. Neural networks have been widely used in various fields. However, the computing efficiency decreases rapidly if the scale of neural network increases. In this paper, a new method of X-ray image recognition based on the fuzzy-neuron system is proposed. In fuzzy rules method, a test pattern may belong to several classes with different degrees. A neural networks classifier is just for one class and used to make sure if the pattern is really belonged to that class based on fuzzy rules, they are combined to obtain the recognition result. From the experience results, the new method performs well.
A method for measuring work interference in surgical teams
Authors: A. N. Healey, S. Olsen, R. Davis, C. A. Vincent
Venue: Cognition, Technology and Work (2008)

To enhance surgical systems we need to manage the performance of the teams that comprise them. To do this we must measure the properties and processes of teams and account for the demands and conditions of their work. Recent research shows that observation is a potentially valuable method of measurement, but its potential application in surgery remains unclear. In this study of laparoscopic cholecystectomy, an observer applied observational measures of teamwork in the operating theatre and recorded intra-operative interference from observed distraction and interruption. Results showed that it was feasible to observe a broad scope of teamwork and to reveal the frequency and source of work interference. However, the measures were necessarily selective and so limited in their analysis of the conditions and events that might interfere with the collective work in surgery. Such measures may however prove useful when applied in conjunction with other methods of measurement and utilised as performance feedback data.
Capacity pricing mechanism for wafer fabrication
Authors: Shu-Hsing Chung, Amy H. I. Lee, Chun-Ying Huang, Chia-Chien Chuang
Venue: Computers and Industrial Engineering (2008)

Wafer fabrication is perhaps the most capital-intensive and technology-intensive industry. Due to customer demand uncertainty, the wafer fabrication industry in Taiwan became dramatically competitive. Emergency orders demanded from customers may exist for the need of time-to-market. How to respond to emergency orders from customers, to analyze the impact to production and cost, and to design an appropriate order acceptance plan, have become an important task for enterprises in pursuing higher service quality and ultimate profit maximization. In this paper, we propose a capacity pricing mechanism to evaluate the impacts of emergency orders. The mechanism is constructed under the circumstances that master production scheduling (MPS), capacity requirement planning (CRP), and data for manufacturing costs are known. Through production planning and profit analysis, the mechanism can analyze pricing factors including the process plans of products, priority levels of products, urgency of orders, and number of layers of poly and metal, so as to reflect the length of cycle time, waiting-time savings, impact to cycle time variance of all orders, and usage amount of critical resources. The capacity price for each product type under each priority level can be determined as a result.
A Place Judgment System Based on an Association Mechanism for Natural Language Interaction
Authors: Seiji Tsuchiya, Eriko Yoshimura, Ren Fuji, Hirokazu Watabe, Tsukasa Kawaoka
Venue: Proceedings of the 12th international conference on Knowledge-Based Intelligent Information and Engineering Systems, Part I (2008)

We are conducting research aiming to develop new interfaces that follow the mechanism of human communication, particularly focusing on human common sense. In this paper, we propose a technique which is able to associate the person and thing existing in the place and the event done on the place from the word expressing the place based on an association mechanism. F-mesure of the place subject and place object was 88.0%, and 84.3% respectively. The average of F-mesure of both was 86.2%. This result shows that the place judgment system has achieved a judgment similar human's sense.
Automatic Straight Line Detection through Fixed-Point BYY Harmony Learning
Authors: Jinwen Ma, Lei Li
Venue: Proceedings of the 4th international conference on Intelligent Computing: Advanced Intelligent Computing Theories and Applications - with Aspects of Theoretical and Methodological Issues (2008)

Straight line detection in a binary image is a basic but difficult task in image processing and machine vision. Recently, a fast fixed-point BYY harmony learning algorithm has been established to efficiently make model selection automatically during the parameter learning on Gaussian mixture. In this paper, we apply the fixed-point BYY harmony learning algorithm to learning the Gaussians in the dataset of a binary image and utilize the major principal components of the covariance matrices of the estimated Gaussians to represent the straight lines in the image. It is demonstrated well by the experiments that this fixed-point BYY harmony learning approach can both determine the number of straight lines and locate these straight lines accurately in a binary image.
Property Preservation along Embedding of Biological Regulatory Networks
Authors: Mbarka Mabrouki, Marc Aiguier, Jean-Paul Comet, Pascale Gall
Venue: Proceedings of the 3rd international conference on Algebraic Biology (2008)

In the course of understanding biological regulatory networks (BRN), scientists usually start by studying small BRNs that they believe to be of particular importance to represent a biological function, and then, embed them in the whole network. Such a reduction can lead to neglect relevant regulations and to study a network whose properties can be very different from the properties of this network viewed as a part of the whole. In this paper we study, from a logical point of view, the preservation of properties inherited from small BRNs. The signature of BRN, constituted by a graph, is one of the distinctive features on which embeddings can be defined which leads us to give a first condition on the subgraphs ensuring the preservation of properties of the embedded graphs.
Modeling Business Process Availability
Authors: Nikola Milanovic, Bratislav Milic, Miroslaw Malek
Venue: Proceedings of the 2008 IEEE Congress on Services - Part I (2008)

In the world where on-demand and trustworthy service delivery is one of the main preconditions for successful business, availability of the services and business processes is of the paramount importance and cannot be compromised. We present a framework for modeling business process availability that takes into account services, the underlying ICT-infrastructure and people. Based on a fault model, we develop the methodology to map dependencies between ICT-components, services and business processes. The mapping enables us to model and analytically assess steady-state, interval and user perceived availability at all levels, up to the level of the business process.
Symbolic mathematical computing of bifurcations in dynamical systems
Authors: Jose C. Valverde, Fernando L. Pelayo, Juan A. Martinez, Juan J. Miralles
Venue: Journal of Computational Methods in Sciences and Engineering (2004)

In this paper we present a specific software package to bifurcation analysis. Specifically for locating fixed points of maps defined on R and their variation with respect to parameters. Also this program allows both detecting and analyzing bifurcations under higher order conditions. We deal mainly with discrete-time systems and give only brief remarks on the continuous time case.
Conceptual Design Knowledge Management Based on Rule and User's Feedback
Authors: ZhenQiang Bao, Lei Guo, Hui Zhong, Rong Luo
Venue: Proceedings of the 2008 Second International Conference on Genetic and Evolutionary Computing (2008)

The paper concentrates on the issue how to get the answer to provide knowledge support with available knowledge of concept design for the problem cases. First, a method based on the rules and feedbacks from users is offered for concept-designing. User's feedback is integrated with case-based reasoning (CBR). This method can improve effect and precision of knowledge support for problem cases. Function unit and restriction matrix are used in the process of integration. Then, information of user's feedback is analyzed for improving the product quality. At last, this paper presents a system framework and analyzes the practical flow of the module. And the framework is verified by an example.
Assessing methods for the evaluation of the configuration space for planar revolute manipulators
Authors: R. Theron, V. Moreno, B. Curto, F. J. Blanco
Venue: Journal of Computational Methods in Sciences and Engineering (2004)

In this abstract it is presented the assesment of two different methods devoted to the evaluation of the configuration space for planar revolute manipulators. The formalism proposed in [3] for the evaluation of the C-space, when applied to planar revolute manipulators, is compared to a new method, which provides both better results and a way to generalize the evaluation for any kind of robotic structure.
Activities Prediction of Drug Molecules by Using the Optimal Ensemble Based on Uniform Design
Authors: Yue Liu, Yafeng Yin, Zaixia Teng, Qi Wu, Guozheng Li
Venue: Proceedings of the 4th international conference on Intelligent Computing: Advanced Intelligent Computing Theories and Applications - with Aspects of Theoretical and Methodological Issues (2008)

Neural network ensemble is a powerful tool for simulating the quantitative structure activity relationship in drug discovery because of its high generalization ability. However, the architecture of the ensemble and the training parameters of individual neural networks are closely relative to the generalization performance of the ensemble and the convenience of the creation of the ensemble. This paper proposes a novel creation algorithm for neural network ensemble, which employs uniform design to guide users to design the ensemble architecture and adjust the training parameters of individual neural networks. In addition, this algorithm is applied to produce neural network ensemble for predicting activities of drug molecules, which is a convenient way to achieve better results than commonly used bagging methods.
Is an OWL ontology adequate for foreign software agents communication?
Authors: Jesús Bermúdez, Alfredo Goñi, Arantza Illarramendi, Simone Santini
Venue: Applied Ontology (2007)

This paper presents a formal ontology which intends to facilitate interoperability among agents belonging to software agent systems that use different agent communication languages. The followed design criteria for building the ontology are an elaboration on the &ldquo;illocutionary force-plus-content&rdquo; framework of speech acts theory. The ontology is specified in OWL. Reasons are presented through the paper why, in our opinion, an ontology based on speech acts theory and specified in a DL-based language is adequate for formal agent communication. The ontology is divided into three layers: upper, standards and applications, grouping classes by different levels of abstraction. The formalism used in the specification of classes allows automated reasoning for locating classes in the taxonomy and recognizing individuals of classes.
Scalable Byzantine Fault Tolerant Public Key Authentication for Peer-to-Peer Networks
Authors: Ruichuan Chen, Wenjia Guo, Liyong Tang, Jianbin Hu, Zhong Chen
Venue: Proceedings of the 14th international Euro-Par conference on Parallel Processing (2008)

Peer-to-Peer (P2P) communication model has the potential to harness huge amounts of resources. However, due to the self-organizing and self-maintaining nature, current P2P networks suffer from various kinds of attacks. Public key authentication can provide a fundamental building block for P2P communication security. In this paper, we propose a scalable Byzantine fault tolerant public key authentication scheme for P2P networks, in which each participating peer dynamically maintains a trusted group to perform distributed challenge-response authentication without centralized infrastructure. To guarantee the authentication correctness, we additionally present a complementary trusted group maintenance scheme. The experimental results demonstrate that our authentication scheme can work in various different P2P scenarios effectively and efficiently.