ppxscal/embedding_network huggingface dataset:
Mining Supplemental Frequent Patterns
Authors: Yintian Liu, Yingming Liu, Tao Zeng, Kaikuo Xu, Rong Tang
Venue: Proceedings of the 4th international conference on Advanced Data Mining and Applications (2008)

The process of resource distribution and load balance of a distributed P2P network can be described as the process of mining Supplement Frequent Patterns (SFPs) from query transaction database. With given minimum support (min_sup) and minimum share support (min_share_sup), each SFP includes a core frequent pattern (BFP) used to draw other frequent or sub-frequent items. A latter query returns a subset of a SFP as the result. To realize the SFPs mining, this paper proposes the structure of SFP-tree along with relative mining algorithms. The main contribution includes: (1) Describes the concept of Supplement Frequent Pattern; (2) Proposes the SFP-tree along with frequency-Ascending order header table FP-Tree (AFP-Tree) and Conditional Mix Pattern Tree (CMP-Tree); (3) Proposes the SFPs mining algorithms based on SFP-Tree; and (4) Conducts the performance experiment on both synthetic and real datasets. The result shows the effectiveness and efficiency of the SFPs mining algorithm based on SFP-Tree.
Alternative Dispute Resolution in Virtual Organizations
Authors: Jeremy Pitt, Daniel Ramirez-Cano, Lloyd Kamara, Brendan Neville
Venue: Engineering Societies in the Agents World VIII: 8th International Workshop, ESAW 2007, Athens, Greece, October 22-24, 2007, Revised Selected Papers (2008)

Networked systems are the driving force of modern business and commerce, underpinned by ideas such as agile enterprises, holonic manufacturing, and dynamic real-time supply chains. On occasions, the system operation will be sub-optimal or non-ideal, and disputes will occur between independent partners. It may be undesirable to resolve such disputes by recourse to law; preferably, the parties in dispute would settle the matter by themselves. Therefore, we develop an alternative dispute resolution (ADR) system for virtual organizations as a way of settling disputes internally. We provide a norm-governed specification of an ADR protocol which is, effectively, an intelligent agent-based autonomic system. We develop this specification in two ways: concretely, through description of the mechanisms underlying protocol operation; and abstractly, by considering how the specification addresses principles for jury trials.
LCA of the Various Vehicles in Environment and Safety Aspect
Authors: Kazuhiro Takeda, Shingo Sugioka, Yukiyasu Shimada, Takashi Hamaguchi, Teiji Kitajima, Tetsuo Fuchio
Venue: Proceedings of the 12th international conference on Knowledge-Based Intelligent Information and Engineering Systems, Part III (2008)

LCA (Life Cycle Assessment) about a FCV (Fuel Cell Vehicle) is performed regularly, but these studies have not considered closely enough the safety issues that are important for practical, everyday use. In this study, we considered the safety of the FCV, GV (Gasoline Vehicle), HEV (Hybrid Electric Vehicle) and EV (Electric Vehicle), and estimated the vehicles in relation to environment and safety. As a result of LCA, FCV may not have a higher environmental performance than the other vehicles in the whole life cycle. So, it is important for FCV to reduce platinum catalyst and select more cleanly hydrogen production processes. They were effective against improving an environmental performance of FCV, but the improved environmental performance was inferior to that of the other vehicles.
Ask for Examples
Authors: J. B. Rainsberger
Venue: IEEE Software (2007)

We must care about getting software features right, even when we think the customer is wrong. By asking for examples up front, we can shine a spotlight on misunderstandings before they have a chance to do much damage.
Implementation of Virtual Environment Using VIRTOOLS
Authors: Mustafa Agil Muhamad Balbed, Nazrita Ibrahim, Azmi Mohd Yusof
Venue: Proceedings of the 2008 Fifth International Conference on Computer Graphics, Imaging and Visualisation (2008)

VRML is one of the most common and popular virtual reality development tools available in the market. This low end product is widely used in school or college. High end product such as Sense8, EON, Cartia and many others have been in the market for quite number of years. These applications have been popularly used in the big industries such as medical, automobile and infrastructure design. However, for our purpose of environment visualization and immersion, Virtools development kit was used. The main focus of this paper is to describe the approach used in producing an immersive and interactive 3D environment used to treat acrophobia. The 3D environment consists of a busy city surrounded by tall buildings. The advantages and benefit of using Virtools as virtual reality development tool is then explained.
Automatic Generation of Textual Summaries from Neonatal Intensive Care Data
Authors: François Portet, Ehud Reiter, Jim Hunter, Somayajulu Sripada
Venue: Proceedings of the 11th conference on Artificial Intelligence in Medicine (2007)

Intensive care is becoming increasingly complex. If mistakes are to be avoided, there is a need for the large amount of clinical data to be presented effectively to the medical staff. Although the most common approach is to present the data graphically, it has been shown that textual summarisation can lead to improved decision making. As the first step in the BabyTalk project, a prototype is being developed which will generate a textual summary of 45 minutes of continuous physiological signals and discrete events (e.g.: equipment settings and drug administration). Its architecture brings together techniques from the different areas of signal analysis, medical reasoning, and natural language generation. Although the current system is still being improved, it is powerful enough to generate meaningful texts containing the most relevant information. This prototype will be extended to summarize several hours of data and to include clinical interpretation.
Pool-Based Agnostic Experiment Design in Linear Regression
Authors: Masashi Sugiyama, Shinichi Nakajima
Venue: Proceedings of the European conference on Machine Learning and Knowledge Discovery in Databases - Part II (2008)

We address the problem of batch active learning (or experiment design) in regression scenarios, where the best input points to label is chosen from a `pool' of unlabeled input samples. Existing active learning methods often assume that the model is correctly specified, i.e., the unknown learning target function is included in the model at hand. However, this assumption may not be fulfilled in practice (i.e., agnostic) and then the existing methods do not work well. In this paper, we propose a new active learning method that is robust against model misspecification. Simulations with various benchmark datasets as well as a real application to wafer alignment in semiconductor exposure apparatus illustrate the usefulness of the proposed method.
A Computational Model of Cortico-Striato-Thalamic Circuits in Goal-Directed Behaviour
Authors: N. Serap Şengör, "Ozkan Karabacak, Ulrich Steinmetz
Venue: Proceedings of the 18th international conference on Artificial Neural Networks, Part II (2008)

A connectionist model of cortico-striato-thalamic loops unifying learning and action selection is proposed. The aim in proposing the connectionist model is to develop a simple model revealing the mechanisms behind the cognitive process of goal directed behaviour rather than merely obtaining a model of neural structures. In the proposed connectionist model, the action selection is realized by a non-linear dynamical system, while learning that modifies the action selection is realized similar to actor-critic model of reinforcement learning. The task of sequence learning is solved with the proposed model to make clear how the model can be implemented.
Path partitions of hypercubes
Authors: Petr Gregor, Tomáš Dvořák
Venue: Information Processing Letters (2008)

A path partition of a graph G is a set of vertex-disjoint paths that cover all vertices of G. Given a set P={{a"i,b"i}}"i"="1^m of pairs of distinct vertices of the n-dimensional hypercube Q"n, is there a path partition {P"i}"i"="1^m of Q"n such that a"i and b"i are endvertices of P"i? Caha and Koubek showed that for 6m==3, there is a balanced set P in Q"n such that 2m-e=n, but no path partition with endvertices prescribed by P exists.
Automatic Neural Net Design by Means of a Symbiotic Co-evolutionary Algorithm
Authors: Elisabet Parras-Gutierrez, Víctor M. Rivas, Maria Jose Jesus
Venue: Proceedings of the 3rd international workshop on Hybrid Artificial Intelligence Systems (2008)

One of the most important issues that must be taken in mind to optimize the design and the generalization abilities of trained artificial neural networks (ANN) is the architecture of the net. In this paper Symbiotic_RBF is proposed, a method to do automatically the process to design models for classification using symbiosis. For it, there are two populations who evolve together by means of coevolution. One of the populations is the method EvRBF, which provides the design of radial basis function neural nets by means of evolutionary algorithms. The second population evolves sets of parameters for the method EvRBF, being every individual of the population a configuration of parameters for the method. Thus, the main goal of Symbiotic_RBF is to find a suitable configuration of parameters necessary for the method EvRBF, which is adapted automatically to every problem.
Polarizabilities of amino acid residues
Authors: Marcel Swart, Jaap G. Snijders, Piet Th. van Duijnen
Venue: Journal of Computational Methods in Sciences and Engineering (2004)

Over the last couple of years, it has been shown that Time Dependent Density Functional Theory (TD-DFT) is able to predict accurately and efficiently the polarizability of molecules, when using appropriate exchange-correlation potentials and (large) basis sets. In a previous paper, we compared the accuracy of the predicted mean polarizabilities of 15 organic molecules with experiment, and with two other computational methods: the Restricted Hartree-Fock (RHF) method and the Direct Reaction Field (DRF) approach, the first of which is ignored in this paper. The (empirical) DRF approach however was shown to give comparable accuracies to TD-DFT with the values computed in just a few seconds. In this paper, we use TD-DFT to compute molecular polarizabilities of the twenty amino acid residues, and compare them with the results obtained with the DRF approach. Although the mean absolute deviation of the DRF values from the TD-DFT values is reasonable (7%), it is more than two times the accuracy normally found with the DRF approach. Therefore we decided to optimize the atomic parameters for these systems, and found after optimization, a good agreement with the TD-DFT values (mean absolute deviation 1.0%). As the TD-DFT calculations were necessarily obtained with two additional hydrogens to saturate the backbone bonds, the molecular value of the polarizability of the amino acid residues is overestimated by the TD-DFT calculations. Therefore, the DRF approach (with the newly optimized atomic parameters) has been used to get the actual polarizabilities of the amino acid residues.
Modeling the Transient Response of a Hysteretic Medium: A Signal Processing Approach
Authors: Sunil Bhooshan, Vinay Kumar, S. Mukerjee
Venue: Proceedings of the 2008 Congress on Image and Signal Processing, Vol. 5 - Volume 05 (2008)

BH curves are nonlinear relationships between the magnetic induction and magnetic field, and it is required to model the ferromagnetic materials in connection with electromagnetic fields. In this paper we will try to model this nonlinear curve using the principles of signal processing. This model is able to predict the value of B(t) for any given H(t).
Competitive Weighted Matching in Transversal Matroids
Authors: Nedialko B. Dimitrov, C. Greg Plaxton
Venue: Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part I (2008)

Consider a bipartite graph with a set of left-vertices and a set of right-vertices. All the edges adjacent to the same left-vertex have the same weight. We present an algorithm that, given the set of right-vertices and the number of left-vertices, processes a uniformly random permutation of the left-vertices, one left-vertex at a time. In processing a particular left-vertex, the algorithm either permanently matches the left-vertex to a thus-far unmatched right-vertex, or decides never to match the left-vertex. The weight of the matching returned by our algorithm is within a constant factor of that of a maximum weight matching.
On Defuzzification of Interval Type-2 Fuzzy Sets
Authors: Janusz T. Starczewski
Venue: Proceedings of the 9th international conference on Artificial Intelligence and Soft Computing (2006)

In the paper the defuzzification of interval type-2 fuzzy sets is studied. The standard K-M type-reduction method and the uncertainty bounds approximate type-reduction are compared with the classical defuzzification of averaged type-1 fuzzy sets.
Palantir: enhancing configuration management systems with workspace awareness to detect and resolve emerging conflicts
Authors: Andre Van Hoek
Venue:  (2008)

Software development requires multiple developers to work in concert on highly interdependent tasks and artifacts, which makes coordination a crucial part of any software development process. Coordination breakdowns are responsible for a wide variety of software conflicts that, in turn, lead to cost overruns and project delays. This dissertation focuses on those software conflicts that arise because of parallel development during the implementation phase. More specifically, it focuses on direct conflicts (when the same artifact is concurrently modified by multiple developers) and indirect conflicts (changes in one artifact negatively affecting concurrent changes in another artifact) as they arise when developers work together using a configuration management system. Our work is based on the insight that the use of current configuration management systems has the undesired side effect of isolating developers in their private workspaces. As a result, they remain unaware of emerging conflicts until changes are complete and have to be brought together, build, and tested. Conflicts are therefore detected much later in time. Direct conflicts are detected when a developer checks-in their changes. Indirect conflicts are detected even later, during a build failure, an integration failure, or as a bug after deployment. This dissertation presents our approach towards mitigating the effects of software conflicts by: (1) enabling developers to detect emerging conflicts (both direct and indirect), while conflicts are still small in size and relatively innocuous, and (2) thereby providing the developers the opportunity to self-coordinate to either avoid the conflict altogether or resolve it easily. The contributions of this dissertation are threefold. First, it frames our approach in a novel framework that provides a historical perspective on the evolution of coordination technologies and the underlying coordination paradigms that these technologies follow. Second, it verifies the technical feasibility of our approach through the implementation of our research prototype, Palantir. Third, it presents quantitative evidence of the benefits of Palantir in the detection and the resolution of a larger number of conflicts through controlled user experiments. Specifically, our experiments show statistical evidence of the benefits of Palantir in facilitating users to: (1) detect conflicts early, (2) detect and resolve a larger number of conflicts, and (3) self-coordinate amongst each other.
On Evaluation of Response Cost for Intrusion Response Systems
Authors: Natalia Stakhanova, Chris Strasburg, Samik Basu, Johnny S. Wong
Venue: Proceedings of the 11th international symposium on Recent Advances in Intrusion Detection (2008)

In this work we present a structured and consistent methodology for evaluating cost of intrusion responses. The proposed approach provides consistent basis for response evaluation across different systems while incorporating security policy and properties of specific system environment. The advantages of the proposed cost model were evaluated via simulation process.
djbdns: more than just a mouthful of consonants
Authors: Cory Wright
Venue: Linux Journal (2008)

Upgrade from BIND to djbdns.
Cortical Surface Thickness as a Classifier: Boosting for Autism Classification
Authors: Vikas Singh, Lopamudra Mukherjee, Moo K. Chung
Venue: Proceedings of the 11th international conference on Medical Image Computing and Computer-Assisted Intervention - Part I (2008)

We study the problem of classifying an autistic group from controls using structural image data alone, a task that requires a clinical interview with a psychologist. Because of the highly convoluted brain surface topology, feature extraction poses the first obstacle. A clinically relevant measure called the cortical thickness has shown promise but yields a rather challenging learning problem --- where the dimensionality of the distribution is extremely large and the training set is small. By observing that each point on the brain cortical surface may be treated as a "hypothesis", we propose a new algorithm for LPBoosting (with truncated neighborhoods) for this problem. In addition to learning a high quality classifier, our model incorporates topological priors into the classification framework directly --- that two neighboring points on the cortical surface (hypothesis pairs) must have similar discriminative qualities. As a result, we obtain not just a label { + 1, ¿ 1} for test items, but also an indication of the "discriminative regions" on the cortical surface. We discuss the formulation and present interesting experimental results.
Friends Forever: Social Relationships with a Fuzzy Agent-Based Model
Authors: Samer Hassan, Mauricio Salgado, Juan Pavon
Venue: Proceedings of the 3rd international workshop on Hybrid Artificial Intelligence Systems (2008)

Sociological research shows that friendship and partner choice tend to reveal a bias toward social similarity. These relations are ruled by the so called "proximity principle" which states that the more similar two individuals are, the more likely they will become friends. However, proximity, similarity or friendship are concepts with blurred edges and grades of membership (acquaintances, friends, couples). Therefore, in order to model the friendship dynamics we work on an Agent-Based Model that already manages the social relationships, together with demographics and evolutionary crossover. To introduce these theoretical concepts we decided to fuzzify the system, explaining the process in detail. Thus, we end up with fuzzy sets and operations, a fuzzy friendship relationship, and a logistic function for its evolution.
Chattering Laptops
Authors: Tuomas Aura, Janne Lindqvist, Michael Roe, Anish Mohammed
Venue: Proceedings of the 8th international symposium on Privacy Enhancing Technologies (2008)

Mobile computer users often have a false sense of anonymity when they connect to the Internet at cafes, hotels, airports or other public places. In this paper, we analyze information leaked by mobile computers to the local access link when they are outside their home domain. While most application data can be encrypted, there is no similar protection for signaling messages in the lower layers of the protocol stack. We found that all layers of the protocol stack leak various plaintext identifiers of the user, the computer and their affiliations to the local link, which a casual attacker can observe. This violates the user's sense of privacy and may make the user or computer vulnerable to further attacks. It is, however, not possible to disable the offending protocols because many of them are critical to the mobile user experience. We argue that the most promising solutions to the information leaks are to filter outbound data, in particular name resolution requests, and to disable unnecessary service discovery depending on the network location. This is because most information leaks result from failed attempts by roaming computers to connect to services that are not available in the current access network.
Simulation and optimization of Westinghouse cycles
Authors: Miroslava Smitkova, Frantisek Janíček
Venue: Proceedings of the 10th WSEAS International Conference on Mathematical Methods and Computational Techniques in Electrical Engineering (2008)

Nowadays, hydrogen is industrially produced mainly from fossil fuels by natural gas steam reforming, coal gasification and as by-product of naphtha reforming. Next step of research topic of hydrogen production from renewable sources is utilization of power from solar, wind or water energy and its accumulation in form of hydrogen. This paper deals with the one of most promising water splitting thermo-chemical cycle - Westinghouse cycle. Simulation and optimization of the WH cycle was preformed and obtained results are reported.
Attribute Reduction of Rough Set Based on Particle Swarm Optimization with Immunity
Authors: Weihua Lin, Yonggang Wu, Dianhui Mao, Yan Yu
Venue: Proceedings of the 2008 Second International Conference on Genetic and Evolutionary Computing (2008)

Since the amount of spatial data grows rapidly during recent years, high dimensionality of the domain attributes presents a further obstacle for a number of rule-induction algorithms that would have the potential for automating knowledge acquisition. This paper attempts to tackle the problem by attribute reduction. Firstly, the problem of attribute reduction can be converted into a 0-1 combinatorial optimization problem after the theory of rough set are introduced. Secondly, a binary particle swam optimization algorithm with immunity (BPSOI) is proposed to deal with the problem. Thirdly, an experiment of attribute reduction by constructing data is presented, which indicates that the new algorithm is a very effective method to solve the problem of attribute reduction. Therefore, the new algorithm can improve the efficiency of attribute reduction by a long way, which is employed to remove the redundant and information-poor attributes in the field of knowledge discovered or data mining.
Robust and efficient plan recognition for dynamic multi-agent teams
Authors: Gita Sukthankar, Katia Sycara
Venue: Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 3 (2008)

This paper addresses the problem of plan recognition for multi-agent teams. Complex multi-agent tasks typically require dynamic teams where the team membership changes over time. Teams split into subteams to work in parallel, merge with other teams to tackle more demanding tasks, and disband when plans are completed. We introduce a new multi-agent plan representation that explicitly encodes dynamic team membership and demonstrate the suitability of this formalism for plan recognition. From our multi-agent plan representation, we extract local temporal dependencies that dramatically prune the hypothesis set of potentially-valid team plans. The reduced plan library can be efficiently processed to obtain the team state history. Naive pruning can be inadvisable when low-level observations are unreliable due to sensor noise and classification errors. In such conditions, we eschew pruning in favor of prioritization and show how our scheme can be extended to rank-order the hypotheses. Experiments show that this robust pre-processing approach ranks the correct plan within the top 10%, even under conditions of severe noise.