ppxscal/embedding_network huggingface dataset:
Holonic Simulation of a Design System for Performance Analysis
Authors: Richard Sohnius, Eyck Jentzsch, Wolf-Ekkehard Matzke
Venue: Proceedings of the 3rd international conference on Industrial Applications of Holonic and Multi-Agent Systems: Holonic and Multi-Agent Systems for Manufacturing (2007)

In this paper, we present our approach to assess the performance of an engineering design system in the field of microelectronics using a holonic simulation. Instead of measuring some input and output parameters of the system and applying some metrics to them as common performance assessment approaches do, we build a model of the entire system and simulate the course of the design process using a multi agent system. The performance metrics are then applied to the detailed results of this simulation. The main focus of this paper thereby lies in the simulation part of the approach which we designed to have two parts: a planning phase and an execution phase.
Optimization of Simple Tabular Reduction for Table Constraints
Authors: Christophe Lecoutre
Venue: Proceedings of the 14th international conference on Principles and Practice of Constraint Programming (2008)

Table constraints play an important role within constraint programming. Recently, many schemes or algorithms have been proposed to propagate table constraints or/and to compress their representation. We show that simple tabular reduction (STR), a technique proposed by J. Ullmann to dynamically maintain the tables of supports, is very often the most efficient practical approach to enforce generalized arc consistency within MAC. We also describe an optimization of STR which allows limiting the number of operations related to validity checking or search of supports. Interestingly enough, this optimization makes STR potentially r times faster where r is the arity of the constraint(s). The results of an extensive experimentation that we have conducted with respect to random and structured instances indicate that the optimized algorithm we propose is usually around twice as fast as the original STR and can be up to one order of magnitude faster than previous state-of-the-art algorithms on some series of instances.
Making an Agreement in an Order-Heterogeneous Group
Authors: Ailixier Aikebaier, Tomoya Enokido, Makoto Takizawa
Venue: Proceedings of the 2nd international conference on Network-Based Information Systems (2008)

In traditional agreement protocols of multiple peer processes (peers), every peer just aims at agreeing on one value out of values shown by the peers. In meetings of human societies, agreement procedures are so flexible that persons can change their opinions and can use various types of agreement conditions. We already discuss E- and P-precedent relations v 1 $\rightarrow_i^E$ v 2 and v 1 $\rightarrow_i^P$ v 2 on values v 1 and v 2 of a peer p i , which show that p i can take v 2 after taking v 1 and prefers v 1 to v 2, respectively. If a peer autonomously takes values only based on its precedent relations, the peers might not make an agreement even if the values satisfy the agreement condition. We discuss what previous values the peer can take again an order-heterogenous system where some pair of peers have different precedent relations. In this paper, we discuss a cut, i.e. a satisfiable set of previous values in a history of values which the peers have so far taken, in addition for each peer to taking a new value at each round.
Interest Point Detectors for Visual SLAM
Authors: Óscar Martínez Mozos, Arturo Gil, Monica Ballesta, Oscar Reinoso
Venue: Current Topics in Artificial Intelligence: 12th Conference of the Spanish Association for Artificial Intelligence, CAEPIA 2007, Salamanca, Spain, November 12-16, 2007. Selected Papers (2007)

In this paper we present several interest points detectors and we analyze their suitability when used as landmark extractors for vision-based simultaneous localization and mapping (vSLAM). For this purpose, we evaluate the detectors according to their repeatability under changes in viewpoint and scale. These are the desired requirements for visual landmarks. Several experiments were carried out using sequence of images captured with high precision. The sequences represent planar objects as well as 3D scenes.
Global model for rapid and easy learning 2007 - 2020
Authors: Vinko Vidučic
Venue: Proceedings of the 7th WSEAS International Conference on Artificial intelligence, knowledge engineering and data bases (2008)

The object of analysis in this paper was "Global Model For Rapid And Easy Learning 2007 - 2020". In order to define main characteristics and determinants of maritime tourism the model of growth was used. Evaluation and analysis of relevant variables and resulting rates of growth had a purpos of scientificaly based formulation of the results of easy and fast learning. The main scientific hypothesis is confirmed through the direct rates of growth of the model variables. In such way scientificaly based confirmation of the hypothesis is provided. Namely, it is confirmed that based on scientific comprehension about easy and fast learning it is possible to suggest a new "Global Model For Rapid And Easy Learning 2007-2020".
Barendregt's Variable Convention in Rule Inductions
Authors: Christian Urban, Stefan Berghofer, Michael Norrish
Venue: Proceedings of the 21st international conference on Automated Deduction: Automated Deduction (2007)

Inductive definitions and rule inductions are two fundamental reasoning tools in logic and computer science. When inductive definitions involve binders, then Barendregt's variable convention is nearly always employed (explicitly or implicitly) in order to obtain simple proofs. Using this convention, one does not consider truly arbitrary bound names, as required by the rule induction principle, but rather bound names about which various freshness assumptions are made. Unfortunately, neither Barendregt nor others give a formal justification for the variable convention, which makes it hard to formalise such proofs. In this paper we identify conditions an inductive definition has to satisfy so that a form of the variable convention can be built into the rule induction principle. In practice this means we come quite close to the informal reasoning of "pencil-and-paper" proofs, while remaining completely formal. Our conditions also reveal circumstances in which Barendregt's variable convention is not applicable, and can even lead to faulty reasoning.
Drug Discovery as an Example of Literature-Based Discovery
Authors: Marc Weeber
Venue: Computational Discovery of Scientific Knowledge: Introduction, Techniques, and Applications in Environmental and Life Sciences (2007)

Since Swanson's introduction of literature-based discovery in 1986, new hypotheses have been generated by connecting disconnected scientific literatures. In this paper, we present the general discovery model and show how it can be used for drug discovery research. We have developed a discovery support tool that employs Natural Language Processing techniques to extract biomedical concepts from Medline titles and abstracts. Using semantic knowledge, the user, typically a biomedical scientist, can efficiently filter out irrelevant information. This chapter provides an algorithmic description of the system and presents a potential drug discovery. We conclude by discussing the current and future status of literature-based discovery in the biomedical research domain.
New comparison and oscillation theorems for second-order half-linear dynamic equations on time scales
Authors: Baoguo Jia, Lynn Erbe, Allan Peterson
Venue: Computers Mathematics with Applications (2008)

Let T be a time scale (i.e., a closed nonempty subset of R) with supT=+~. Consider the second-order half-linear dynamic equation (r(t)(x^@D(t))^@a)^@D+p(t)x^@a(@s(t))=0, where r(t)>0,p(t) are continuous, @!"t"""0^~(r(t))^-^1^@a@Dt=~, @a is a quotient of odd positive integers. In particular, no explicit sign assumptions are made with respect to the coefficient p(t). We give conditions under which every positive solution of the equations is strictly increasing. For @a=1, T=R, the result improves the original theorem [see: [Lynn Erbe, Oscillation theorems for second-order linear differential equation, Pacific J. Math. 35 (2) (1970) 337-343]]. As applications, we get two comparison theorems and an oscillation theorem for half-linear dynamic equations which improve and extend earlier results. Some examples are given to illustrate our theorems.
Compiler-Assisted Application-Level Checkpointing for MPI Programs
Authors: Xuejun Yang, Panfeng Wang, Hongyi Fu, Yunfei Du, Zhiyuan Wang, Jia Jia
Venue: Proceedings of the 2008 The 28th International Conference on Distributed Computing Systems (2008)

Application-level checkpointing can decrease the overhead of fault tolerance by minimizing the amount of checkpoint data. However this technique requires the programmer to manually choose the critical data that should be saved. In this paper, we firstly propose a live-variable analysis method for MPI programs. Then, we provide an optimization method of datasaving for application-level checkpointing based on the analysis method. Based on the theoretical foundation, we implement a source-to-source precompiler (ALEC) to automate application-level checkpointing. Finally, we evaluate the performance of five FORTRAN/MPI programs which are transformed and integrated checkpointing features by ALEC on a 512-CPU cluster system. The experimental results show that i) the application-level checkpointing based on live-variable analysis for MPI programs can efficiently reduce the amount of checkpoint data, thereby decrease the overhead of checkpoint and restart; ii) ALEC is capable of automating application-level checkpointing correctly and effectively.
Locality-Based Server Profiling for Intrusion Detection
Authors: Robert Lee, Sheau-Dong Lang
Venue: Proceedings of the IEEE ISI 2008 PAISI, PACCF, and SOCO international workshops on Intelligence and Security Informatics (2008)

Detection of intrusion on network servers plays an ever more important role in network security. This paper investigates whether analysis of incoming connection behavior for properties of locality can be used to create a normal profile for network servers. Intrusions can then be detected due to their abnormal behavior. Experiments show that connections to a typical network server do in fact exhibit locality, and attacks can be detected through their violation of locality.
The Extension of the Van Der Pauw Method to Anisotropic Media
Authors: Jonas Kleiza, Mifodijus Sapagovas, Vytautas Kleiza
Venue: Informatica (2007)

The method for calculating the specific conductivity tensor of an anisotropically conductive medium, proposed in this paper, distinguishes itself by the simplicity of physical measurements: it suffices to make an equally thick rectangle-shaped sample with four electrodes fixed on its sides and to take various measurements of current intensity and differences of potentials. The necessary mathematical calculations can be promptly performed, even without using a complex computing technique. The accuracy of the results obtained depends on the dimensions of the sample and on the ratios of the conductivity tensor components.
H-BayesClust: A New Hierarchical Clustering Based on Bayesian Networks
Authors: Morteza Haghir Chehreghani, Hassan Abolhassani
Venue: Proceedings of the 3rd international conference on Advanced Data Mining and Applications (2007)

Clustering is one of the most important approaches for mining and extracting knowledge from the web. In this paper a method for clustering the web data is presented which using a Bayesian network, finds appropriate representatives for each of the clusters. Having those representatives, we can create more accurate clusters. Also the contents of the web pages are converted into vectors which firstly, the number of dimensions is reduced, and secondly the orthogonality problem is solved. Experimental results show about the high quality of the resultant clusters.
Composing Web Services in an Open World: QoS Issues
Authors: Albert Benveniste
Venue: Proceedings of the 2008 Fifth International Conference on Quantitative Evaluation of Systems (2008)

Orchestrating Web services has become the method of choice for building new services on top of existing ones, e.g., for business processes. Languages and methods have been developed and are now getting widely used, BPEL being the typical instance. When exposing the profile of a Web service, QoS parameters are typically specified. Besides security aspects, QoS involves a variety of parameters related to performance as well as quality of the returned data. How QoS should be handled in this context is the subject of my talk. A number of novel and not so well identified issues occur that make this topic deviating from QoS for networks in a substantial way. Firstly, since Web services aim at hiding details for the external world, no information regarding the infrastructure or resources supporting a Web service are exposed. This prevents from using classical resource based performance models; so contracts are preferred instead. A second important feature is that, unlike in networks, the control in orchestrations may depend on the carried data. Consequently performance and data interfere. These and other features make the subject of QoS for composite Web services a novel area offering plenty of non standard issues that I shall discuss.
Information Assurance in Critical Infrastructures via Wireless Sensor Networks
Authors: Michele Albano, Stefano Chessa, Roberto Di Pietro
Venue: Proceedings of the 2008 The Fourth International Conference on Information Assurance and Security (2008)

Information assurance in critical infrastructure is an issue that has been addressed generally focusing on real-time or quasi real-time monitoring of the critical infrastructure; so that action could be undertaken when anomalies arise, to avoid more severe consequences to the infrastructure. In this paper, we relax the hypothesis of intervening when anomalies are detected: we focus on sensed data survivability. Specifically, we study this problem in a specific critical infrastructure: pipelines. The problem we introduce is how to place sensors in such a way that the sensed data related to the monitoring of the pipeline will survive even in presence of a partial destruction of the infrastructure.The contributions of this paper are twofold. First, we introduce the problem of sensed data survivability in critical infrastructure. In this framework, the goal is to have the sensed data to survive to the infrastructure failure, so that the phenomena that lead to the failure could be better understood and possibly tackled in similar deployment. Second, we provide a model that allows to produce an optimal network topology with respect to the level of information assurance desired, while satisfying deployment constraints, such as available bandwidth and available energy of the sensors. We believe that the work addressed in this paper could foster further research in the field of information assurance in critical infrastructure.
Profile Management Framework Based on Web Services for Providing Personalized Services
Authors: Kyung-Sik Kim, Jae-Dong Lee
Venue: Proceedings of the 2008 International Conference on Convergence and Hybrid Information Technology (2008)

In this paper, we propose the efficient profile management method to provide personalized services to user. To personalized services, the profile should be configured various user related information, be exchanged among user device, profile repository, and service server according to periodic, aperiodic, and events, and be provided to service providers who use them for personalized services. To solve these problems, we configure the profile with various user related information that use the Web Services to exchange profiles among client device, profile repository, and services server. We also apply metadata and dynamic configuration techniques for efficient profile management. As a result of performance evaluation, the proposed techniques in profile management framework are efficient to manage the profiles.
Seeing the Forest Through the Trees: Learning a Comprehensible Model from an Ensemble
Authors: Anneleen Assche, Hendrik Blockeel
Venue: Proceedings of the 18th European conference on Machine Learning (2007)

Ensemble methods are popular learning methods that usually increase the predictive accuracy of a classifier though at the cost of interpretability and insight in the decision process. In this paper we aim to overcome this issue of comprehensibility by learning a single decision tree that approximates an ensemble of decision trees. The new model is obtained by exploiting the class distributions predicted by the ensemble. These are employed to compute heuristics for deciding which tests are to be used in the new tree. As such we acquire a model that is able to give insight in the decision process, while being more accurate than the single model directly learned on the data. The proposed method is experimentally evaluated on a large number of UCI data sets, and compared to an existing approach that makes use of artificially generated data.
Construct Teacher Community in E-Learning System
Authors: Bin Li, Congwu Tao, Fei Li
Venue: Proceedings of the 7th international conference on Advances in Web Based Learning (2008)

At present, most universities had completed the basic facilities and services of Information and Communication Technology (ICT), and installed e-learning system. What should be done to facilitate teachers' transition to employ ICT to their new teaching practices? We believe that virtual communities for Teacher Professional development (TPD) and socialization are supposed to be an excellent solution. We also deem that e-learning system could be a place for TPD as well as assisting teaching. In this paper, we present our past attempts, and the rationale behind the design of the Zjiao.Com virtual community.
Automatic Analyses of Cohesion and Coherence in Human Tutorial Dialogues During Hypermedia: A Comparison among Mental Model Jumpers
Authors: Moongee Jeon, Roger Azevedo
Venue: Proceedings of the 9th international conference on Intelligent Tutoring Systems (2008)

We analyzed cohesion and coherence in tutorial dialogues from 66 think-aloud transcripts collected from a human tutorial dialogue study which investigated the effect of tutoring on middle and high school students' learning about the circulatory system with hypermedia [1]. Our findings showed that there were significant differences in the tutorial dialogues of Jumpers (i.e., those who showed significant pretest-posttest mental model shifts about the science topic) versus No-jumpers (i.e., those who showed no significant shifts) in the semantic/conceptual similarity, readability scores, incidence scores of causal verbs and causal connectives, and turn length. We argue that the semantic/conceptual similarity of the discourse, causal verbs/causal connectives, and longer turns primarily facilitated the improvement in Jumpers' mental models and deep learning.
Contextual QR Codes
Authors: José Rouillard
Venue: Proceedings of the 2008 The Third International Multi-Conference on Computing in the Global Information Technology (iccgi 2008) (2008)

QR Codes (2D barcodes) are used to encode and decode data at a rapid rate. Using camera phones to read two dimensional barcodes for various purposes is currently a popular topic in both research and in practical applications. But until now, the information provided by QR Codes was solely static. What you see is exactly what was encoded. This paper proposes the notion of contextual QR Codes that merge a public QR Code and private information, in order to provide data related to a particular context. For example, a public tag will be decoded and translated into "Good evening John Smith" or "Bonjour Jean Dupond", if the system is able to obtain data such as the name of the user, the language used on the machine (English or French for instance) and the moment when the interaction takes place.
Equivalence Learning in Protein Classification
Authors: Attila Kertész-Farkas, András Kocsor, Sándor Pongor
Venue: Proceedings of the 5th international conference on Machine Learning and Data Mining in Pattern Recognition (2007)

We present a method, called equivalence learning, which applies a two-class classification approach to object-pairs defined within a multi-class scenario. The underlying idea is that instead of classifying objects into their respective classes, we classify object pairs either as equivalent (belonging to the same class) or non-equivalent (belonging to different classes). The method is based on a vectorisation of the similarity between the objects and the application of a machine learning algorithm (SVM, ANN, LogReg, Random Forests) to learn the differences between equivalent and non-equivalent object pairs, and define a unique kernel function that can be obtained via equivalence learning. Using a small dataset of archaeal, bacterial and eukaryotic 3-phosphoglycerate-kinase sequences we found that the classification performance of equivalence learning slightly exceeds those of several simple machine learning algorithms at the price of a minimal increase in time and space requirements.
On representations of 2-increasing binary aggregation functions
Authors: Fabrizio Durante, Susanne Saminger-Platz, Peter Sarkoci
Venue: Information Sciences: an International Journal (2008)

In this paper, we provide two different representations of 2-increasing binary aggregation functions by means of their lower and upper margins and a suitable copula.
Searchling: User-Centered Evaluation of a Visual Thesaurus-Enhanced Interface for Bilingual Digital Libraries
Authors: Amy Stafford, Ali Shiri, Stan Ruecker, Matthew Bouchard, Paras Mehta, Karl Anvik, Ximena Rossello
Venue: Proceedings of the 12th European conference on Research and Advanced Technology for Digital Libraries (2008)

In this paper, we describe a qualitative user study of Searchling --- an experimental visual interface that allows users to leverage a bilingual thesaurus for query formulation and enhancement. The design of Searchling is based on theories of thesaurus-based interface design from Shiri et al. [1], combined with the principles of rich-prospect browsing [2]. The Searchling interface provides the user with three working spaces on one screen: the Thesaurus space, Query space, and Document space. We interviewed 15 graduate and faculty researchers at the University of Alberta, who carried out three structured tasks in a thinkaloud protocol, with simultaneous audio recording and screen capture. These participants identified a number of significant advantages to the researcher provided by Searchling, including the value of having an interface that could help with identifying search terms, suggesting preferred terms, and giving bilingual search support. They also suggested areas for future improvement, primarily related to our assumption that common knowledge of thesauri would be sufficient to make the various features clear if they were described using standard vocabulary from the thesaurus field.
Designing convivial digital cities
Authors: Patrice Caire
Venue: Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems: doctoral mentoring program (2008)

Concepts, models and theories from the social sciences are studied in multi-agent systems to regulate or control interactions among agents. Examples of social concepts studied in multi-agent systems are societies, coalitions, organizations, institutions, norms, power, and trust [4]. We argue in our thesis that this list should be extended with a social-cognitive concept concerned with agent interaction which is used frequently in the social sciences, and has been discussed in applications of multi-agent systems where artificial and human agents interact like ambient intelligence, social intelligence design, digital cities and virtual communities. This concept is called conviviality.