ppxscal/embedding_network huggingface dataset:
Knowledge-Based Road Traffic Monitoring
Authors: Antonio Fernández-Caballero, Francisco J. Gómez, Juan López-López
Venue: Proceedings of the 2nd international work-conference on Nature Inspired Problem-Solving Methods in Knowledge Engineering: Interplay Between Natural and Artificial Computation, Part II (2007)

This article presents a knowledge-based application to study and analyze traffic behavior on major roads, using as the main surveillance artefact a video camera mounted on a relatively high place with a significant image analysis field. The system described presents something new which is the combination of both traditional traffic monitoring systems, that is, monitoring to get information on different traffic parameters and monitoring to detect accidents automatically. Therefore, we present a system in charge of compiling information on different traffic parameters. It also has a surveillance module, which can detect a wide range of the most significant incidents on a freeway or highway.
The Synchronization Problem for Strongly Transitive Automata
Authors: Arturo Carpi, Flavio D'Alessandro
Venue: Proceedings of the 12th international conference on Developments in Language Theory (2008)

The synchronization problem is investigated for a new class of deterministic automata called strongly transitive. An extension to unambiguous automata is also considered.
Calculation of Dynamic Pore Pressure in Stone Column Composite Foundation
Authors: H. R. Zhang, Y. M. Zhang
Venue: Proceedings of the 7th international conference on Computational Science, Part III: ICCS 2007 (2007)

For typical initial and boundary conditions, a group of general solutions for the generation and dissipation of excess pore water pressure in stone column composite foundation under coupling action of dynamic and static loads have been developed by separation of variables and Green functions to the control differential equations. In the control equation, the pore pressure increasing ratio is expressed as the function of depth and time. A special solution is obtained to zero initial condition and upper boundary pervious, based on an existing dynamic pore pressure calculation model. The numerical example shows that the effect of seepage of the stone column is prominent.
Forostar: A System for GIR
Authors: Simon Overell, João Magalhães, Stefan Rüger
Venue: Evaluation of Multilingual and Multi-modal Information Retrieval: 7th Workshop of the Cross-Language Evaluation Forum, CLEF 2006, Alicante, Spain, September 20-22, 2006, Revised Selected Papers (2007)

We detail our methods for generating and applying co-occurrence models for the purpose of placename disambiguation. We explain in detail our use of co-occurrence models for placename disambiguation using a model generated from Wikipedia. The presented system is split into two stages: a batch text geographic indexer and a real time query engine. Four alternative query constructions and six methods of generating a geographic index are compared. The paper concludes with a full description of future work and ways in which the system could be optimised.
Toward Supporting Collaborative Discussion in an Ill-Defined Domain
Authors: Amy Ogan, Erin Walker, Vincent Aleven, Chris Jones
Venue: Proceedings of the 9th international conference on Intelligent Tutoring Systems (2008)

It is important to investigate what tutoring paradigms are appropriate for ill-defined domains. We focus on teaching intercultural competence, where asynchronous online discussion is a typical instructional task. We explore two methods of assessing student contributions and delivering feedback: an adaptive support system that provides individual feedback, and a peer moderator from the class supported by adaptive assistance.
Searching with Document Space Adapted Ontologies
Authors: Stein L. Tomassen
Venue: Proceedings of the 1st world summit on The Knowledge Society: Emerging Technologies and Information Systems for the Knowledge Society (2008)

An increasing number of recent information retrieval systems make use of ontologies to help the users clarify their information needs and come up with semantic representations of documents. In this paper, we present an approach that utilizes ontologies to enhance the effectiveness of large-scale search systems for the Web. We describe how these systems can be enriched with adapted ontologies to provide an in-depth understanding of the user's needs. The ontology concepts are adapted to the domain terminology by computing a feature vector for each concept. We explain how these feature vectors are constructed and finally evaluate the approach.
Automotive system security: challenges and state-of-the-art
Authors: R. R. Brooks, S. Sander, J. Deng, J. Taiber
Venue: Proceedings of the 4th annual workshop on Cyber security and information intelligence research: developing strategies to meet the cyber security and information intelligence challenges ahead (2008)

Modern automobiles are, among other things, sophisticated local area networks connecting multiple embedded computers. It is not rare for vehicles to be communications hubs with multiple wireless connections. Wireless connections may be with other vehicles, local infrastructure, or corporate servers. Some high profile research into the information security of automotive applications has been done. This research has been piece-meal, looking for vulnerabilities in specific implementations of isolated applications. Although most of this work concentrates on car theft, modern automotive systems are subject to a much wider range of potential abuses. We use the term automotive system to be inclusive, since, in addition to the automobile itself, applications like VANETs (ex. vehicle ad hoc networks), and online services (ex. On-Star, remote diagnostics) are subject to compromise. In this work, we consider the automotive system stakeholders and assets they need to protect. We use this security information to help map the automotive security research literature onto the taxonomy CERT uses to describe on-line security incidents, in order to find which threats are not being adequately addressed.
BOGENVI: A Biomedical Ontology for Modelling Gene*Environment Interactions on Intermediate Phenotypes in Nutrigenomics Research
Authors: Antonio Fabregat, Elisabet Barrera, María Arregui, Olga Portolés, Dolores Corella, Oscar Coltell
Venue: Proceedings of the 2008 21st IEEE International Symposium on Computer-Based Medical Systems (2008)

Nutritional Genomics is demanding computing models and technological platforms in order to support acquisition, storage, management and presentation of all the information generated coming from heterogeneous sources: genotypes, environmental factors (diet and other life-style factors) and phenotypes (intermediate and final phenotypes). Our aim is to build a biomedical ontology in order to modelling gene*environment interactions on intermediate phenotypes by means of formalising and integrating genomic, environmental and phenotypic data, in the field of research on Nutritional Genomics applied to cardiovascular diseases and associated phenotypes. This ontology is part of a Health Information System based on Web engineering technologies, architectures and services, and integrating several data types to support Nutritional Genomics research in cardiovascular diseases.
A Set-Based Particle Swarm Optimization Method
Authors: Christian B. Veenhuis
Venue: Proceedings of the 10th international conference on Parallel Problem Solving from Nature: PPSN X (2008)

The representation used in Particle Swarm Optimization (PSO) is an n-dimensional vector. If you want to apply the PSO method, you have to encode your problem as fix-sized vector. But many problem domains have solutions of unknown sizes as for instance in data clustering where you often don't know the number of clusters in advance.In this paper a set-based PSO is proposed which replaces the position and velocity vectors by position and velocity sets realizing this way a PSO with variable length representation. All operations of the PSO update equations are redefined in an appropriate manner. Additionally, an operator reducing set bloating effects is introduced.The presented approach is applied to well-known data clustering problems and performs better as other algorithms on them.
A Kernel-Based Technique for Direction-of-Change Financial Time Series Forecasting
Authors: Andrew Skabar
Venue: Proceedings of the 8th international conference on Computational Science, Part II (2008)

This paper presents a generative approach to direction-of-change time series forecasting. Kernel methods are used to estimate densities for the distribution of positive and negative returns, and these distributions are then combined to produce probability estimates for return forecasts. An advantage of the technique is that it involves very few parameters compared to regression-based approaches, the only free parameters being those that control the shape of the windowing kernel. A special form is proposed for the kernel covariance matrix. This allows recent data more influence than less recent data in determining the densities, and is important in preventing overfitting. The technique is applied to predicting the direction of change on the Australian All Ordinaries Index over a 15 year out-of-sample period.
Virtualization as an enabler for security in mobile devices
Authors: Jörg Brakensiek, Axel Dröge, Martin Botteck, Hermann Härtig, Adam Lackorzynski
Venue: Proceedings of the 1st workshop on Isolation and integration in embedded systems (2008)

Virtualization, a well established technology in the desktop and server domain, is currently investigated and analyzed with respect to its potential within mobile devices. The paper argues that mobile devices, which are targeting a completely open setup (e.g. Linux based), are facing severe security challenges. Thus, virtualization will be discussed as an enabler for security in mobile devices. Virtualization approaches and elements are discussed in detail taking this use case and existing limitations of mobile embedded devices into account.
Augmenting Word Space Models for Word Sense Discrimination Using an Automatic Thesaurus
Authors: Hiram Calvo
Venue: Proceedings of the 6th international conference on Advances in Natural Language Processing (2008)

This paper presents an algorithm for Word Sense Discrimination that divides the global representation of a word into a number of classes by determining for any two occurrences whether they belong to the same sense or not. We rely on the notion that words that are used in similar contexts will have the same or a closely related meaning, thus, given a target word, we group its dependency co-occurrences in a Word Space Model. Each cluster represents a distinct meaning or sense of that word. We experiment with augmenting the bag of words of each cluster of co-occurrences, the dictionary of sense definition, and augmenting both. Then we count the number of intersections of each word of the bag of clustered senses and the bag of the dictionary of senses following the Lesk method. We find an increase in recall and a decrease in precision when augmenting. However, the best resulting F-measure is for the option of augmenting the both dictionary of senses and the bag of words from the clusters.
Annals: How the First Issue Came to Be
Authors: Bernard A. Galler
Venue: IEEE Annals of the History of Computing (2004)

In this retrospective, the Annals' first editor in chief looks back at how the journal came to fruition: who was involved, what the environment was like, and some of the initial considerations and challenges.
A systematic modelling and simulation approach for JIT performance optimisation
Authors: Y. G. Sandanayake, C. F. Oduoza, D. G. Proverbs
Venue: Robotics and Computer-Integrated Manufacturing (2008)

Robust computer aided simulation and modelling tools help to visualise, analyse and optimise complex production processes with a reasonable amount of time and investment. A review of the literature shows that simulation and modelling have not been extensively applied in just-in-time (JIT) manufacturing environments. Also there remains a lack of a comprehensive mechanism to identify the most significant JIT drivers for the purpose of system process optimisation. The prime objective of this study is to close this gap by applying computer based simulation tools and linear mathematical modelling to identify the impact of selected key JIT parameters on performance in an automotive component-manufacturing environment. Research shows that variables such as inconsistent task distribution, variation on operator performance, misconception of total quality management philosophy and lack of set-up time elimination plans disrupt ideal JIT production. In this study, ProModel simulation and modelling software is used to model and simulate different experimental scenarios in order to understand and quantify the impact of selected input key JIT variables on objective functions (i.e. process time and takt time). The outcome is a robust mathematical model that highlights the significance of JIT drivers in the manually operated mixed-model assembly lines.
Managing Requirements for Medical IT Products
Authors: Stewart A. Higgins, Maurice de Laat, Paul M. C. Gieles, Emilienne M. Geurts
Venue: IEEE Software (2003)

The authors have built a process, supported by tools, in which they capture and refine requirements as they come in. In this way, they pool requirements ready for allocation to release projects. They publish requirements valid for the next release project in a document for that release. In this process, requirements analysts work closely with requirements stakeholders.
Optimum shape in brick masonry arches under dynamic loads
Authors: Kaveh Kumarci, Arash Ziaie, Mehran Koohikamali, Arash Kiyoumarsi
Venue: Proceedings of the 10th WSEAS International Conference on Automatic Control, Modelling & Simulation (2008)

Due to importance and application of arches in historical structures, arch shape optimization has been discussed. The objective of this study is to determine brick masonry arches under dynamic loads. In this paper, considerable attention is given to arches, their importance, modeling stages, dynamic analysis and arch optimization using ANSYS11 software. A multiple stage analysis framework was conducted for semicircular arch: 1- The study of optimum shape for semicircular arch on the base of minimize of arch weight. 2- Determination of linear and nonlinear analysis limits by increase of density. 3- The study of optimum shape in semicircular arch by linear and nonlinear analysis. All of these stages have been conducted for obtuse angel arches, (steep, normal and diminished), four- centered pointed arch, tudor arch, ogee arch, equilateral arch, catenary arch, lancet arch, four-centered arch (normal, diminished and steep). The main purpose has been study of arch optimum shape in three spans (4, 5 and 6m) for minimize of weight: Finally, according to the results, the optimum shape in arches under dynamic load has been determined.
Elementary Differential Calculus on Discrete and Hybrid Structures
Authors: Howard A. Blair, David W. Jakel, Robert J. Irwin, Angel Rivera
Venue: Proceedings of the international symposium on Logical Foundations of Computer Science (2007)

We set up differential calculi in the Cartesian-closed category CONV of convergence spaces. The central idea is to uniformly define the 3-place relation __ is a differential of __ at __ for each pair of convergence spaces X,Y in the category, where the first and second arguments are elements of Hom(X,Y) and the third argument is an element of X, in such a way as to (1) obtain the chain rule, (2) have the relation be in agreement with standard definitions from real and complex analysis, and (3) depend only on the convergence structures native to the spaces X and Y. All topological spaces and all reflexive directed graphs (i.e. discrete structures) are included in CONV. Accordingly, ramified hybridizations of discrete and continuous spaces occur in CONV. Moreover, the convergence structure within each space local to each point, individually, can be discrete, continuous, or hybrid.
Fitting a Step Function to a Point Set
Authors: Hervé Fournier, Antoine Vigneron
Venue: Proceedings of the 16th annual European symposium on Algorithms (2008)

We consider the problem of fitting a step function to a set of points. More precisely, given an integer k and a set P of n points in the plane, our goal is to find a step function f with k steps that minimizes the maximum vertical distance between f and all the points in P. We first give an optimal ¿(n logn) algorithm for the general case. In the special case where the points in P are given in sorted order according to their x-coordinates, we give an optimal ¿(n) time algorithm. Then, we show how to solve the weighted version of this problem in time O(n log4 n). Finally, we give an O(n h 2 logh) algorithm for the case where h outliers are allowed, and the input is sorted. The running time of all our algorithms is independent of k.
An online artistic game: the 12 labors of the internet user
Authors: Serge Bouchardon
Venue: Proceedings of the 3rd international conference on Digital Interactive Media in Entertainment and Arts (2008)

The 12 Labors of the Internet User is an online artistic game in which the internet user is regarded as the Hercules of the Internet. This work draws upon the mythology of everyday life insofar as our daily activities can be transformed into a myth. It is consequently a question of experiencing technology in an epic - but also humoristic -- mode.
Strategyproof deterministic lotteries under broadcast communication
Authors: Alon Altman, Moshe Tennenholtz
Venue: Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 3 (2008)

The design of deterministic and fair mechanisms for selection among a set of self-motivated agents based solely on these agents' input is a major challenge in multiagent systems. This challenge is especially difficult when the agents can only communicate via a broadcast channel. We propose the notion of selection games: a special case of zero-sum games where the only possible outcomes are selections of a single agent among the set of agents. We assume the lack of an external coordinator, and therefore we focus on mechanisms which have a solution where the agents play weakly dominant strategies. Our first major result shows that dominated strategies could be added to any selection mechanism, so that the resulting mechanism becomes quasi-symmetric. For fairness, we require the mechanism to be non-imposing; that is, the mechanism should allow any agent to be selected in such a solution. We first show that such mechanisms do not exist when there are two or three agents in the system. However, surprisingly, we show that such mechanisms exist when there are four or more agents. Moreover, in our second major result, we show that there exist selection mechanisms that implement any distribution over the agents, when the agents play mixed dominant strategies. These results also have significance for electronic commerce, ranking systems, and social choice.
Brain Fiber Architecture, Genetics, and Intelligence: A High Angular Resolution Diffusion Imaging (HARDI) Study
Authors: Ming-Chang Chiang, Marina Barysheva, Agatha D. Lee, Sarah Madsen, Andrea D. Klunder, Arthur W. Toga, Katie L. Mcmahon, Greig I. Zubicaray, Matthew Meredith, Margaret J. Wright, Anuj Srivastava, Nikolay Balov, Paul M. Thompson
Venue: Proceedings of the 11th international conference on Medical Image Computing and Computer-Assisted Intervention - Part I (2008)

We developed an analysis pipeline enabling population studies of HARDI data, and applied it to map genetic influences on fiber architecture in 90 twin subjects. We applied tensor-driven 3D fluid registration to HARDI, resampling the spherical fiber orientation distribution functions (ODFs) in appropriate Riemannian manifolds, after ODF regularization and sharpening. Fitting structural equation models (SEM) from quantitative genetics, we evaluated genetic influences on the Jensen-Shannon divergence (JSD), a novel measure of fiber spatial coherence, and on the generalized fiber anisotropy (GFA; [1]) a measure of fiber integrity. With random-effects regression, we mapped regions where diffusion profiles were highly correlated with subjects' intelligence quotient (IQ). Fiber complexity was predominantly under genetic control, and higher in more highly anisotropic regions; the proportion of genetic versus environmental control varied spatially. Our methods show promise for discovering genes affecting fiber connectivity in the brain.
Applying Rough Sets to Data Tables Containing Missing Values
Authors: Michinori Nakata, Hiroshi Sakai
Venue: Proceedings of the international conference on Rough Sets and Intelligent Systems Paradigms (2007)

Rough sets are applied to data tables containing missing values. Discernibility and indiscernibility between a missing value and another value are considered simultaneously. A family of possible equivalence classes is obtained, in which each equivalence class has the possibility that it is an actual one. By using the family of possible equivalence classes, we can derive lower and upper approximations, even if the approximations are not obtained by previous methods.Furthermore, the lower and upper approximations coincide with those obtained from methods of possible worlds.
The effects of fuzzy forecasting models on supply chain performance
Authors: Hakan Tozan, Ozalp Vayvay
Venue: Proceedings of the 9th WSEAS International Conference on Fuzzy Systems (2008)

One of the important activities which directly affect the supply chain performance is the demand forecasting. But selection of the appropriate forecasting model that best fits the demand pattern is not an easy decision. This paper analyze the effects of fuzzy linear regression, fuzzy time series and fuzzy grey GM (1,1) forecasting models on supply chain performance quantifying the demand variability through the stages.
One-Way Signature Chaining: a new paradigm for group cryptosystems
Authors: Amitabh Saxena, Ben Soh
Venue: International Journal of Information and Computer Security (2008)

In this paper, we describe a new cryptographic primitive called (One-Way) Signature Chaining. Signature chaining is essentially a method of generating a chain of signatures on the same message by different users. Each signature acts as a 'link' of the chain. The one-way-ness implies that the chaining process is one-way in the sense that more links can be easily added to the chain. However, it is computationally infeasible to remove any intermediate links without removing all the links. The signatures so created are called chain signatures (CS). We give precise definitions of Chain Signatures and discuss some applications in trust transfer. We then present a practical construction of a CS scheme that is secure (in the random oracle model) under the Computational Diffie-Hellman (CDH) assumption in bilinear maps.
Formal Model for Contract Negotiation in Knowledge-Based Virtual Organizations
Authors: Mikołaj Zuzek, Marek Talik, Tomasz Świerczyński, Cezary Wiśniewski, Bartosz Kryza, Łukasz Dutka, Jacek Kitowski
Venue: Proceedings of the 8th international conference on Computational Science, Part III (2008)

In this paper we propose a formal model which supports the process of setting up a Virtual Organization by means of allowing contract negotiation between parties pariticipating in such VO. The negotiated contract is used to configure the necessary Grid middleware components for the purpose of contract enforcement during the lifetime of the Virtual Organization. We present a brief overview of the framework and discuss in detail the formal model underlying the process of contract negotiation and how the ontological description of the domains related to given VO supports this process.