ppxscal/embedding_network huggingface dataset:
Proceedings of the Working Conference on Advanced Visual Interfaces
Authors: Maria De Marsico, Stefano Levialdi, Emanuele Panizzi
Venue: AVI (2002)

We are faced everyday with an enormous amount of information: from television, from the newspapers, from the web, at the same time we also own a number of personal gadgets: cellular phone, personal and portable computers, personal assistants...yet we have difficulties in filtering, highlighting and using the information we really need. When users search specific information on the web, very often they run into difficulties and find other types of data (perhaps even interesting) but different from the ones they were searching. In a world where communication is one of the most important issues for succeeding in life (sitting for exams, undergoing a hiring interview, writing reports and, above all, interacting with others) we all need good interfaces - not only between humans and programs, but more often than not, between different kinds of humans. The Mid-East crisis is a very good example, unfortunately. We have been organizing the AVI International Workshops having - at the back of our minds - the idea that no application program may be really successful if its corresponding interface is not geared towards human capabilities. Usability studies have proved, in a number of cases, that if the user does not participate in the design process of a system (and of its interface) it is very unlikely that such system will meet the user's needs. Due to such experience in the design and evaluation of interfaces, we feel that there are important issues to be discussed like the relevance of the cultural background of users, the different information interaction strategies, the conditions and constraints of attention focusing, the design and evaluation of visual tools for improving understandability, learnability and plain usage. The invited speakers of the AVI '02 edition in Trento are well known in the area of interface design and will provide us with their insight and forecasting of what is round the corner in the next years pertaining to the above subject. The accepted papers (less than one out of three) report on very recent work using a variety of technologies like virtual reality, information visualization, icon design...whilst the system papers that will be demonstrated give us a glance at potentially new applications for improving human computer interaction, for increasing multimodality and even pioneering musical interfaces.
Improving Relation Extraction by Exploiting Properties of the Target Relation
Authors: Eric Normand, Kevin Grant, Elias Ioup, John Sample
Venue: Proceedings of the 21st International Conference on Scientific and Statistical Database Management (2009)

In this paper we demonstrate and quantify the advantage gained by allowing relation extraction algorithms to make use of information about the cardinality of the target relation. The two algorithms presented herein differ only in their assumption about the nature of the target relation (one-to-many or many-to-many). The algorithms are tested on the same relation to show the degree of advantage gained by their differing assumptions. Comparison of the performance of the two algorithms on a one-to-many domain demonstrates the existence of several, previously undocumented behaviors which can be used to improve the performance of relation extraction algorithms. The first is a distinct, inverted u-shape in the initial portion of the recall curve of the many-to-many algorithm. The second is that, as the number of seeds increases, the rate of improvement of the two algorithms descreases to approach the rate at which new information is added via the seeds.
Ramsey numbers of sparse hypergraphs
Authors: David Conlon, Jacob Fox, Benny Sudakov
Venue: Random Structures Algorithms (2009)

We give a short proof that any k-uniform hypergraph H on n vertices with bounded degree &Delta; has Ramsey number at most c(&Delta;,k)n, for an appropriate constant c(&Delta;,k). This result was recently proved by several authors, but those proofs are all based on applications of the hypergraph regularity method. Here we give a much simpler, self-contained proof which uses new techniques developed recently by the authors together with an argument of Kostochka and R&ouml;dl. Moreover, our method demonstrates that, for k &ge; 4, $$c (\Delta, k) \leq 2^{2^{.^{.^{.^{2^{2\Delta}}}}}}$$, where the tower is of height k and the constant c depends on k. It significantly improves on the Ackermann-type upper bound that arises from the regularity proofs, and we present a construction which shows that, at least in certain cases, this bound is not far from best possible. Our methods also allows us to prove quite sharp results on the Ramsey number of hypergraphs with at most m edges. &copy; 2008 Wiley Periodicals, Inc. Random Struct. Alg., 2009 Supported by an NSF Graduate Research Fellowship and a Princeton Centennial Fellowship.
Combined one sense disambiguation of abbreviations
Authors: Yaakov HaCohen-Kerner, Ariel Kass, Ariel Peretz
Venue: Proceedings of the 46th Annual Meeting of the Association for Computational Linguistics on Human Language Technologies: Short Papers (2008)

A process that attempts to solve abbreviation ambiguity is presented. Various context-related features and statistical features have been explored. Almost all features are domain independent and language independent. The application domain is Jewish Law documents written in Hebrew. Such documents are known to be rich in ambiguous abbreviations. Various implementations of the one sense per discourse hypothesis are used, improving the features with new variants. An accuracy of 96.09% has been achieved by SVM.
An open source phylogenetic search and alignment package
Authors: Hyrum Carroll, Adam R. Teichert, Jonathan Krein, Kenneth Sundberg, Quinn Snell, Mark Clement
Venue: International Journal of Bioinformatics Research and Applications (2009)

PSODA is a comprehensive phylogenetics package, including alignment, phylogenetic search under both parsimony and maximum likelihood, and visualisation and analysis tools. PSODA offers performance comparable to PAUP&lt;SUP align=right&gt;&#42;&lt;/SUP&gt; in an open source package that aims to provide a foundation for researchers examining new phylogenetic algorithms. A key new feature is PsodaScript, an extension to the nearly ubiquitous NEXUS format, that includes conditional and loop constructs; thereby allowing complex meta-search techniques like the parsimony ratchet to be easily and compactly implemented. PSODA promises to be a valuable tool in the future development of novel phylogenetic techniques. This paper seeks to familiarise researchers with PSODA and its features, in particular the internal scripting language, PsodaScript. PSODA is freely available from the PSODA.
RECM: Relational evidential c-means algorithm
Authors: Marie-Hélène Masson, Thierry Denux
Venue: Pattern Recognition Letters (2009)

A new clustering algorithm for proximity data, called RECM (relational evidential c-means) is presented. This algorithm generates a credal partition, a new clustering structure based on the theory of belief functions, which extends the existing concepts of hard, fuzzy and possibilistic partitions. Two algorithms, EVCLUS (Evidential Clustering) and ECM (evidential c-means) were previously available to derive credal partitions from data. EVCLUS was designed to handle proximity data, whereas ECM is a direct extension of fuzzy clustering algorithms for vectorial data. In this article, the relational version of ECM is introduced. It is compared to EVCLUS using various datasets. It is shown that RECM provides similar results to those given by EVCLUS. However, the optimization procedure of RECM, based on an alternate minimization scheme, is computationally much more efficient than the gradient-based procedure used in EVCLUS.
Explicit de-coupled group AOR method for solving elliptic partial differential equations
Authors: W. S. Yousif, M. Madalena Martins
Venue: Neural, Parallel Scientific Computations (2008)

The explicit group successive overrelaxation (EGSOR) methods which approximates the solution of the sparse linear systems derived from the discretisation of self-adjoint elliptic partial differential equations have been presented (Yousif & Evans, 1986) and it has been shown that these methods are faster and with a smaller computational effort in comparison with the implicit 1-line and 2-line block successive overrelaxation (SOR) iterative methods. Martins, Yousif and Evans (2002) introduced a new explicit 4-point group accelerated overrelaxation (EGAOR) iterative method and made a comparison with the point AOR method for the model problem showing its computational advantages. The aim of this paper is to present an explicit 4-point de-coupled group accelerated overrelaxation iterative (EDGAOR) method and to show that it is faster than the explicit 4-point group accelerated overrelaxation (EGAOR) iterative method.
Symmetric and Asymmetric Asynchronous Interaction
Authors: Rob van Glabbeek, Ursula Goltz, Jens-Wolfhard Schicke
Venue: Electronic Notes in Theoretical Computer Science (ENTCS) (2009)

We investigate classes of systems based on different interaction patterns with the aim of achieving distributability. As our system model we use Petri nets. In Petri nets, an inherent concept of simultaneity is built in, since when a transition has more than one preplace, it can be crucial that tokens are removed instantaneously. When modelling a system which is intended to be implemented in a distributed way by a Petri net, this built-in concept of synchronous interaction may be problematic. To investigate the problem we assume that removing tokens from places can no longer be considered as instantaneous. We model this by inserting silent (unobservable) transitions between transitions and their preplaces. We investigate three different patterns for modelling this type of asynchronous interaction. Full asynchrony assumes that every removal of a token from a place is time consuming. For symmetric asynchrony, tokens are only removed slowly in case of backward branched transitions, hence where the concept of simultaneous removal actually occurs. Finally we consider a more intricate pattern by allowing to remove tokens from preplaces of backward branched transitions asynchronously in sequence (asymmetric asynchrony). We investigate the effect of these different transformations of instantaneous interaction into asynchronous interaction patterns by comparing the behaviours of nets before and after insertion of the silent transitions. We exhibit for which classes of Petri nets we obtain equivalent behaviour with respect to failures equivalence. It turns out that the resulting hierarchy of Petri net classes can be described by semi-structural properties. In case of full asynchrony and symmetric asynchrony, we obtain precise characterisations; for asymmetric asynchrony we obtain lower and upper bounds. We briefly comment on possible applications of our results to Message Sequence Charts.
Collision Detection for Ubiquitous Parking Management Based on Multi-agent System
Authors: Romeo Mark Mateo, Young-Seok Lee, Jaewan Lee
Venue: Proceedings of the Third KES International Symposium on Agent and Multi-Agent Systems: Technologies and Applications (2009)

Most of the researchers and designers of WSN-based parking management system used wireless sensors to detect the car presence in automating the parking system. However, the problem of car-to-car collisions in the parking system was not discussed by these researches where the position details of cars are important to analyze the collision event. This paper presents the ubiquitous parking management system (UPMS) where the sensors are used to detect car presence and designed in multi-agent system to disseminate efficiently the information through the system. The proposed system uses a location technique based on RSS which is processed in multi-lateration method to know the position details of the cars. Also, the car active RFID (CARFID) is equipped with vibration sensors to detect the car collision event. The system verifies the collision event in the proposed oriented bounded box (OBB) intersection test. Experiment shows that the collision detection is more accurate if more wireless sensors are used in our proposed technique.
Supporting Learning Design via dynamic generation of learning routes in ADAPTAPlan
Authors: Olga C. Santos, Jesus G. Boticario
Venue: Proceeding of the 2007 conference on Artificial Intelligence in Education: Building Technology Rich Learning Contexts That Work (2007)

The design phase on the life cycle of the eLearning process is currently one of the main bottle necks in adaptive systems. To facilitate this process and reduce the design effort our approach focuses on providing dynamic assistance to some of the author's tasks that strongly depend on data coming from users' interactions. In particular, ADAPTAPlan project is developing a system where the learning route of a student is dynamically built from the combination of user modelling and scheduling techniques making a pervasive use of educational standards (IMS). The author is requested to provide simple information about the course structure, pedagogy and restrictions and the system utilize this information together with the user model to generate a personalize IMS-LD course flow suited to that learner. Since the output is given in a standardized format, the course can be run in any standard based learning environment. This approach will be tested on a real course, “How to teach online”, within the UNED's program for ongoing education and open courses.
Security-oriented program transformations
Authors: Munawar Hafiz, Ralph E. Johnson
Venue: Proceedings of the 5th Annual Workshop on Cyber Security and Information Intelligence Research: Cyber Security and Information Intelligence Challenges and Strategies (2009)

Security experts generally believe that, "security cannot be added on, it must be designed from the beginning" [1]. This is because the typical way of improving system security by patches is ad hoc and has not produced good results. My work shows that retrofitting security does not need to be a massive reengineering effort, nor does it need to be ad hoc. Security solutions can be added through systematic, general purpose security-oriented program transformations. I have been maintaining a catalog of security-oriented program transformations; so far the catalog contains forty two transformations. These transformations improve the traditional approaches of security engineering and keep software secure in the face of new security threats.
Automatic Translation from Textual Representations of Laws to Formal Models through UML
Authors: Pietro Mercatali, Francesco Romano, Luciano Boschi, Emilio Spinicci
Venue: Proceeding of the 2005 conference on Legal Knowledge and Information Systems: JURIX 2005: The Eighteenth Annual Conference (2005)

A combination of UML and text mining, or more in general Information Extraction, can provide a valuable help to people involved in research about the linguistic structure of statutes, and, as a side effect, can be the seed for a new generation of applications in the legal domain. In particular, in this paper we present LexLooter, a prototype for amendments modelling and legislative text coordination based on UML and Natural Language Processing.
Agent-Based and Population-Based Simulation of Displacement of Crime (extended abstract)
Authors: Tibor Bosse, Charlotte Gerritsen, Mark Hoogendoorn, S. Waqar Jaffry, Jan Treur
Venue: Proceeding of the 2008 conference on ECAI 2008: 18th European Conference on Artificial Intelligence (2008)

Within Criminology, the process of crime displacement is usually explained by referring to the interaction of three types of agents: criminals, passers-by, and guardians. Most existing simulation models of this process are agent-based. However, when the number of agents considered becomes large, population-based simulation has computational advantages over agent-based simulation. This paper presents both an agent-based and a population-based simulation model of crime displacement, and reports a comparative evaluation of the two models. In addition, an approach is put forward to analyse the behaviour of both models by means of formal techniques.
Norm-based behaviour modification in BDI agents
Authors: Felipe Meneguzzi, Michael Luck
Venue: Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems - Volume 1 (2009)

While there has been much work on developing frameworks and models of norms and normative systems, consideration of the impact of norms on the practical reasoning of agents has attracted less attention. The problem is that traditional agent architectures and their associated languages provide no mechanism to adapt an agent at runtime to norms constraining their behaviour. This is important because if BDI-type agents are to operate in open environments, they need to adapt to changes in the norms that regulate such environments. In response, in this paper we provide a technique to extend BDI agent languages, by enabling them to enact behaviour modification at runtime in response to newly accepted norms. Our solution consists of creating new plans to comply with obligations and suppressing the execution of existing plans that violate prohibitions. We demonstrate the viability of our approach through an implementation of our solution in the AgentSpeak(L) language.
A specification language for information security policies
Authors: Juan Manuel Garcia
Venue: Proceedings of the international conference on Computational and information science 2009 (2009)

On an information system, a security policy specifies constraints on resources accessed by processes and information flow among them, and also constraints on external access by outsiders. In order to enforce an information security policy, system administrators face two main problems: First, security policy is often stated informally, leading to ambiguity, inconsistency and incompleteness, and in second place, security policy constraints must be translated on several low level specifications such as operating system access control rules, firewall filtering rules, etc. Is a difficult task to verify if those low level specifications actually enforce the security policy. In this paper we present an information security specification based on process calculus which could be translated to low level specifications.
Enabling end-user driven business process composition through programming by example in a Collaborative Task management system
Authors: Todor Stoitsev, Stefan Scheidl, Felix Flentge, Max Muhlhauser
Venue: Proceedings of the 2008 IEEE Symposium on Visual Languages and Human-Centric Computing (2008)

Letting end users tailor business processes can result in business process management support, which is better turned to users’ needs and organizational changes. However, such tailoring requires not only the users’ domain expertise but also advanced skills in computer use, which business users mostly lack. The paper presents the design of the Collaborative Task Manager (CTM) prototype which overcomes this limitation and enables end users to become informed participants in business process composition. CTM uses enterprise-wide “programming by example” by exposing common functionalities for personal task management to the end users and tracking their activities to generate end-to-end process execution examples on a central instance. These can be adapted and reused for ad-hoc process support or exported to formal process models, which enables tailoring as collaboration between business users, end-user tailors and developers. The paper finally reports on trial usage of the tool at a partner company.
Real-Time Delay Estimation Based on Delay History
Authors: Rouba Ibrahim, Ward Whitt
Venue: Manufacturing Service Operations Management (2009)

Motivated by interest in making delay announcements to arriving customers who must wait in call centers and related service systems, we study the performance of alternative real-time delay estimators based on recent customer delay experience. The main estimators considered are: (i) the delay of the last customer to enter service (LES), (ii) the delay experienced so far by the customer at the head of the line (HOL), and (iii) the delay experienced by the customer to have arrived most recently among those who have already completed service (RCS). We compare these delay-history estimators to the standard estimator based on the queue length (QL), commonly used in practice, which requires knowledge of the mean interval between successive service completions in addition to the QL. We characterize performance by the mean squared error (MSE). We do an analysis and conduct simulations for the standard GI/M/s multiserver queueing model, emphasizing the case of large s. We obtain analytical results for the conditional distribution of the delay given the observed HOL delay. An approximation to its mean value serves as a refined estimator. For all three candidate delay estimators, the MSE relative to the square of the mean is asymptotically negligible in the many-server and classical heavy-traffic (HT) limiting regimes.
Computer vision system for human anthropometric parameters estimation
Authors: Ivo Stancic, Tamara Supuk, Mojmil Cecic
Venue: WSEAS TRANSACTIONS on SYSTEMS (2009)

In this paper we have proposed and evaluated a new method for human anthropometric parameters estimation. Method is planed to be simple and fast, thus suited for examiners with no experience in the anthropometric measurements. An anthropometric data obtained by this method, segments masses and lengths, are primarily used for biomechanics applications, but could be adapted to other fields, as well. Estimates of segment inertial properties are frequently based on data and procedures developed for human cadavers in whom inertial properties have been measured directly, using complicated and time consuming procedures. For that reason, we have designed a measurement system that consists of singe digital camera, PC and requires simple experimental set-up with a few considerations. Proposed method comes with some disadvantages, due to which it could be rather used as an estimation tool than as a highly-precise measurement procedure of anthropometric parameters. Measurement using proposed method is completely contactless with the subject, which result in minimizing examiners physical intervention and considerable reduction of time required for measurements. Therefore, measurement procedure is adopted to be executed on a large number of subjects in short time. An algorithm was developed that creates 3D model of the human body using only data obtained from 2D subject's image, and ellipses as basic building objects. Finally, results of anthropometric body parameters obtained for three subjects were compared with referent anthropometric data and manual measurement.
Optimal age-replacement time with minimal repair based on cumulative repair cost limit and random lead time
Authors: Yu-Hung Chien, Shey-Huei Sheu, Chin-Chih Chang
Venue: International Journal of Systems Science (2009)

In this article, we consider an age-replacement model with minimal repair based on a cumulative repair cost limit and random lead time for replacement delivery. A cumulative repair cost limit policy uses information about a system's entire repair cost history to decide whether the system is repaired or replaced; a random lead time models delay in delivery of a replacement once it is ordered. A general cost model is developed for the average cost per unit time based on the stochastic behaviour of the assumed system, reflecting the costs of both storing a spare and of system downtime. The minimum-cost policy time is derived, its existence and uniqueness is shown, and structural properties are presented. Various special cases are included. Because the framework and analysis are general, the proposed model extends several existing results. Finally, a numerical example is provided for illustration.