ppxscal/embedding_network huggingface dataset:
Mobile Entities Computing: Models and Problems
Authors: Nicola Santoro
Venue: Proceedings of the 15th international colloquium on Structural Information and Communication Complexity (2008)

By mobile entity computing (MEC) we refer to the study of the computational and complexity issues arising in systems of autonomous computational entities located in a spatial universe ${\cal U}$ in which they can move. The entities have computational capabilities (i.e., storage and processing), can move in ${\cal U}$ (their movement is constrained by the nature of ${\cal U}$), exhibit the same behavior (i.e., execute the same protocol), and are autonomous in their actions (e.g., they are not directed by an external controller). Depending on the context, the entities are sometimes called agents, other times robots.Depending on the nature of ${\cal U}$, two different settings are identified. The first setting, sometimes called a graph world or discrete universe or netscape, is when the ${\cal U}$ is a simple graph and the entities can move from node to neighbouring node. An instance of such setting is that of mobile software agents in a network. The other setting, called sometimes continuous universe, is when ${\cal U}$ is a geometric space which the entities, endowed with wireless sensorial/communication capabilities, can perceive and can move in. Instances of such settings are autonomous mobile robots, and autonomous vehicular networks.These settings have been long the subject of separate intensive investigations in fields as diverse as AI, robotics, and software engineering, and only recently by the distributed computing community. Indeed, the use of mobile software agents is becoming increasingly popular when computing in networked environments, ranging from Internet to the Data Grid, both as a theoretical paradigm and as a system-supported programming platform but the theoretical research had focused mainly on the descriptive and semantic concerns. This situation has drastically changed in recent years, as an increasing number of algorithmic investigations have started to examine the setting. Similarly, in the last few years the problems related to the coordination and control of autonomous mobile robots have been investigated not only in the traditional fields of AI, robotics and control but also by researchers in distributed computing).In both settings, the research concern is on determining what tasks can be performed by the entities, under what conditions, and at what cost. In particular, a central question is to determine what minimal hypotheses allow a given problem to be solved.The purpose of this talk is to introduce the computational models and the fundamental problems in MEC; although the focus is on the discrete universe, several of the introduced concepts extend, mutata mutandis, to the continuous case.
Escaping a Dominance Region at Minimum Cost
Authors: Youngdae Kim, Gae-Won You, Seung-Won Hwang
Venue: Proceedings of the 19th international conference on Database and Expert Systems Applications (2008)

Skyline queries have gained attention as an effective way to identify desirable objects that are "not dominated" by another object in the dataset. From market perspective, such objects can be viewed as marketable, as each of such objects has at least one competitive edge against all the other objects, or not dominated. In other words, non-skyline objects are not marketable, as there always exists another product excelling in all the attributes. The goal of this paper is, for such non-skyline objects, to identify the cost-minimal enhancement to become a skyline point to gain marketability. More specifically, we abstract this problem as a mixed integer programming problem and develop a novel algorithm for efficiently identifying the optimal solution. Through extensive experiments using synthetic datasets, we show that our proposed framework is both efficient and scalable over extensive experiment settings.
Interface Challenges for Mobile Tutoring Systems
Authors: Quincy Brown, Frank J. Lee, Dario D. Salvucci, Vincent Aleven
Venue: Proceedings of the 9th international conference on Intelligent Tutoring Systems (2008)

Mobile devices used in education have the potential to provide learners with access to tutoring systems outside of the classroom or computer laboratory setting. To effectively deliver tutors on mobile devices, developers must consider the interface constraints imposed by the devices. The primary restriction is the small display available to users and the large amount of text and diagrams integral to desktop tutors. This paper describes two approaches to creating a mobile tutor interface and discusses the tradeoffs of each approach.
A few aspects concerning the technical solutions applied for control of excitation in synchronous generators across Romania
Authors: Flaviu M. Frigura-Iliasa, Marius Biriescu, Ioan Grando, Gheorghe Madescu, Martian Mot
Venue: Proceedings of the 10th WSEAS International Conference on Automatic Control, Modelling & Simulation (2008)

The power quality is one of the main interests of producers, transporters and suppliers. In order to have a higher quality for the power produced by the synchronous hydro generators, using an adequate excitation system is essential. This paper shows a general overview of the main tasks which Romanian power producers have to accomplish today. It presents, also, some case studies concerning the existing technical solutions used for the excitation system of synchronous generators applied here, until now. The main goal of this paper is to present a general point of view regarding the actual situation in this area, to identify some solutions and tendencies concerning the updating of the existing generators, in order to accomplish all the European power standards and regulations. This study was made by the authors by taking in consideration opinions coming from the industrial environment.
A Watermarking Method with a New SS Technique
Authors: Kun Hua, Liang Pu
Venue: Proceedings of the 7th international conference on Computational Science, Part III: ICCS 2007 (2007)

Among numerous techniques of information concealment, Spread spectrum watermarking (SSW) has proved to yield improved results when robustness against attack is at a premium. SSW hides information which is called watermark by spreading its spectrum and then adding them to a host image as a watermarked image. Spreading spectrum is done by a pseudo-noise (PN) sequence. But in standard SSW approaches, receiver must use a separate channel to achieve PN sequence used at the transmitter for detecting hidden information. The unique PN sequence must have a low cross correlation and thereby can be duplicated easily by hostile attackers. In this paper a novel approach based on the unconventional Random Encoding Spread Spectrum is proposed for recovering the spreading sequence of watermark signal without any information from the transmitter. It is contributed a higher secure feature by using of the time-varying random encoded spread spectrum.
Formalization of petri nets with clocks
Authors: R. Uzal, D. Riesco, G. Montejano, G. Vilallonga, Narayan C. Debnath
Venue: Journal of Computational Methods in Sciences and Engineering (2005)

PN (PN) are tools for the analysis and design of concurrent systems. There is a formal theory, which supports PN. An extension of PN is Petri Nets with Clocks (PNwC). PNwC are useful to model systems with temporal requirements via specification of clocks, using temporal invariants for the places and temporal conditions in the transitions. Using invariants in places allows the specifications of hard deadlines constrains (upper bound constrains): when a deadline is reached the progress of time is blocked by the invariant and the action becomes urgent. An algorithm for the analysis of a PNwC has been proposed in [1]. The algorithm is oriented to the verification and correction of errors in the modelling of the time variable. The algorithm generates information about temporal unreachable states and process deadlocks with temporal blocks. Also, it corrects places invariants and transitions conditions. We present here a formalism for PNwC based on Timed Graphs. The analysis algorithm is presented here using the formalism. We show here how Petri Net theory can be joined with Timed Graph theory to construct a formalism, which supports a tool for the analysis of models of concurrent process with real time specification.
Security for a privacy augmented collaborative environment with a combined authentication scheme encapsulation
Authors: Geoff Skinner
Venue: Proceedings of the WSEAS International Conference on Applied Computing Conference (2008)

The uptake and utility of digital collaboration's continues to grow as organizaions are realizing the diverse range of benefits they provide to not only their organization as a whole but also to individual employees. However, like many information and communication technologies the implementation push often overshadows a proper evaluation of data security and information privacy risks that may be inherent with the technology. This paper details our ongoing research for addressing a number of authentication and personal entity identification issues encountered in digital collaborative architectures. We propose an authentication framework that uniquely combines both traditional and biometric methods of authentication with an additional novel audiovisual method of authentication. Further, the CASE (Combined Authentication Scheme Encapsulation) methodology provides an intuitive privacy protecting visual representation of a member entity's authentication methods, which is accessible by other member entities for help in assessing the risk of sharing 'sensitive' data with other collaboration entities.
Agreeable People Like Agreeable Virtual Humans
Authors: Sin-Hwa Kang, Jonathan Gratch, Ning Wang, James H. Watt
Venue: Proceedings of the 8th international conference on Intelligent Virtual Agents (2008)

This study explored associations between the five-factor personality traits of human subjects and their feelings of rapport when they interacted with a virtual agent or real humans. The agent, the Rapport Agent, responded to real human speakers' storytelling behavior, using only nonverbal contingent (i.e., timely) feedback. We further investigated how interactants' personalities were related to the three components of rapport: positivity, attentiveness, and coordination. The results revealed that more agreeable people showed strong self-reported rapport and weak behavioral-measured rapport in the disfluency dimension when they interacted with the Rapport Agent, while showing no significant associations between agreeableness and self-reported rapport, nor between agreeableness and the disfluency dimension when they interacted with real humans. The conclusions provide fundamental data to further develop a rapport theory that would contribute to evaluating and enhancing the interactional fidelity of an agent on the design of virtual humans for social skills training and therapy.
Accurate closed-form approximation for pricing Asian and basket options
Authors: Jinke Zhou, Xiaolu Wang
Venue: Applied Stochastic Models in Business and Industry (2008)

By approximating the distribution of the sum of correlated lognormals with some log-extended-skew-normal distribution, we present closed-form approximation formulae for pricing both Asian and basket options. Numerical comparison shows that our formulae provide both computational simplicity and accuracy. Copyright &copy; 2008 John Wiley & Sons, Ltd.
Metadata Creation in Socio-semantic Tagging Systems: Towards Holistic Knowledge Creation and Interchange
Authors: Roy Lachica, Dino Karabeg
Venue: Scaling Topic Maps: Third International Conference on Topic Maps Research and Applications, TMRA 2007 Leipzig, Germany, October 11-12, 2007 Revised Selected Papers (2008)

Fuzzzy.com, a social bookmarking website has been developed to study collaborative creation of semantics. In a shared online space, users of Fuzzzy continuously create metadata bottom-up by categorizing (tagging) favourite hyperlinks (bookmarks). The semantic network of tags created by users evolves into a people's fuzzy common ontology ("folktology"). We discuss several social and cognitive aspects of Topic Maps technology and scalability by analyzing the use of the system. We further argue that holistic knowledge creation and interchange is highly needed. Our results from Fuzzzy suggest that this can be realized by connecting distributed knowledge centric communities of dedicated users within specific domains.
Research on Personalized Topic Distillation Algorithm
Authors: Kai-zhong Jiang, Zhao Lu, Yu Yan, Jun-zhong Gu
Venue: Proceedings of the 2008 The Third International Multi-Conference on Computing in the Global Information Technology (iccgi 2008) (2008)

This paper focuses on personalized information retrieval which is a research focus in Web Information Service, and it’s the key technology of enhance retrieval quality. As a user concept map composed of some concepts that extended from user queries based on user interests description, it's the embodiment of user's true intention. Each concept weight in the concept map is defined as a probability, and the whole weighted concept map can reflect the intensity distribution of user interests in the field. Thus semantic similarity and algorithm of two concepts can be defined with concept weight. In this paper, we proposes an improving approach of HITS algorithm with the topological structure of concept map. Experiment shows the algorithm is effective and feasible, and it can improve the quality of web search engines efficiently.
A Parallel DNA Algorithm Using a Microfluidic Device to Build Scheduling Grids
Authors: Marc García-Arnau, Daniel Manrique, Alfonso Rodríguez-Patón
Venue: Proceedings of the 2nd international work-conference on The Interplay Between Natural and Artificial Computation, Part I: Bio-inspired Modeling of Cognitive Tasks (2007)

Microfluidic systems, which constitute a miniaturization of a conventional laboratory to the dimensions of a chip, are expected to become the key support for a revolution in the world of biology and chemistry. This article proposes a parallel algorithm that uses DNA and such a distributed microfluidic device to generate scheduling grids in polynomial time. Rather than taking a brute force approach, the algorithm presented here uses concatenation and separation operations to gradually build the DNA strings that represent a Multiprocessor Task scheduling problem grids. The microfluidic device used makes for an autonomous system, also enabling it to solve the problem without the need of external control.
Face Manifold Analysis Based on LFA Features
Authors: JiangFeng Chen, BaoZong Yuan
Venue: Proceedings of the 2008 Congress on Image and Signal Processing, Vol. 4 - Volume 04 (2008)

Some research efforts have shown that face images possibly reside on a nonlinear sub-manifold. Based on the Laplacian Eigen map, Laplacianfaces method was proposed. Laplacianfaces explicitly considers the manifold structure of the face image. To avoid the singular problem, Laplacianfaces method first project the image vectors to PCA subspaces. PCA produces global non-topographic linear filters. In this paper, we propose a novel approach. LFA instead of PCA is applied contrast with Laplacianfaces. LFA can capture local characteristics with little lose of global information and present an effective low dimensional representation of images. By combining LFA and LPP, the new algorithm outperforms than Laplacianfacesand has explicit significance, which is shown by a series of experiments.
Energy conservative algorithm for numerical solution of ODEs initial value problems
Authors: E. Miletics
Venue: Journal of Computational Methods in Sciences and Engineering (2005)

The numerical treatment of the ODE initial value problems is an intensively researched field. Recently the qualitative algorithms, such as monotonicity and positivity preserving algorithms are in the focus of investigation. For the dynamical systems the energy conservative algorithms are very important. In the case of Hamiltonian system the symplectic algorithms are very effective. This kind of algorithm is not adaptive, but doubtless they are powerful. The high-efficiency computers and the computer algebraic software systems allow us to create efficient adaptive energy conservative numerical algorithm for solving ODE initial value problems. In this article an adaptive numerical-analytical algorithm is suggested which very effectively can be applied for Hamiltonian systems, but the idea of construction can be adaptable for other initial value problems too, where there are some quantity preserved in time. The idea and the efficiency of the proposed algorithm will be presented by simple examples, such as the Lotka-Volterra and linear oscillator problems.
Benefits and drawbacks of software platforms used in cooperative ship design practice
Authors: Marina Z. Solesvik, Sylvia Encheva
Venue: Proceedings of the WSEAS International Conference on Applied Computing Conference (2008)

This paper focuses on collaborative models for vessel design where special attention is paid to the features of inter-organizational and intra-organizational collaboration. Organization of cooperative work during the design process and application of computer-aided collaborative tools are illustrated through case studies.
Non-commutative System of Fuzzy Interval Logic Generated by the Checklist Paradigm Measure m3 Containing Early Zadeh Implication
Authors: Eunjin Kim, Ladislav J. Kohout
Venue: Proceedings of the 12th international Fuzzy Systems Association world congress on Foundations of Fuzzy Logic and Soft Computing (2007)

This paper continues investigation of systems of fuzzy interval logics based on the Checklist Paradigm semantics of Bandler and Kohout [1] [2]. While the early papers dealt with checklist paradigm based interval systems containing commutative AND and OR, this paper is the fifth in the series of papers in which we have been describing the systems in which these connective types are non-commutative. In the present paper we investigate non-commutative interval system generated from implication operators based on the Checklist Paradigm measure m 3 of Bandler and Kohout. This system includes the well-known Early Zadeh implication operator (PLY) which is not contrapositive. While the commutative systems can be sufficiently characterized by an 8-element group of transformations, the non-commutative systems require the 16 element group ${\mathcal S}_{2 \times 2 \times 2 \times 2}$.
On Approximate Representation of Type-2 Fuzzy Sets Using Triangulated Irregular Network
Authors: Long Thanh Ngo, Long Pham The, Phuong Hoang Nguyen, Kaoru Hirota
Venue: Proceedings of the 12th international Fuzzy Systems Association world congress on Foundations of Fuzzy Logic and Soft Computing (2007)

The type-2 fuzzy sets was extended of original fuzzy sets and there are many researches related to type-2 fuzzy sets and fuzzy logic systems (FLS), recently. The paper deals with the approximate presentation of type-2 fuzzy sets and operations by using triangulated irregular networks (TIN). TIN usually used to represent approximate 3-D surfaces with applications in computer graphics. By using TINs and half-edge structure, authors proposed representation and operations of type-2 fuzzy sets based on this approach. Some results compared with original approaches are shown to confirm the approach be good and correctly.
Morpho Challenge Evaluation Using a Linguistic Gold Standard
Authors: Mikko Kurimo, Mathias Creutz, Matti Varjokallio
Venue: Advances in Multilingual and Multimodal Information Retrieval: 8th Workshop of the Cross-Language Evaluation Forum, CLEF 2007, Budapest, Hungary, September 19-21, 2007, Revised Selected Papers (2008)

In Morpho Challenge 2007, the objective was to design statistical machine learning algorithms that discover which morphemes (smallest individually meaningful units of language) words consist of. Ideally, these are basic vocabulary units suitable for different tasks, such as text understanding, machine translation, information retrieval, and statistical language modeling. Because in unsupervised morpheme analysis the morphemes can have arbitrary names, the analyses are here evaluated by a comparison to a linguistic gold standard by matching the morpheme-sharing word pairs. The data sets were provided for four languages: Finnish, German, English, and Turkish and the participants were encouraged to apply their algorithm to all of them. The results show significant variance between the methods and languages, but the best methods seem to be useful in all tested languages and match quite well with the linguistic analysis.
A New Prompt Algorithm for Removing Bowtie Effect of MODIS L1B Data
Authors: Liangming Liu, Xiongfei Wen, Xinyi Dong, Qiangling Dai
Venue: Proceedings of the 2008 Congress on Image and Signal Processing, Vol. 4 - Volume 04 (2008)

A new algorithm for removing Bowtie effect of Moderate resolution Imaging Spectrometer (MODIS) data without utilizing the ephemeris data is proposed in this paper. Based on a thoroughly study of the observation characteristics of MODIS, and a comprehensive comparison and evaluation among the existing algorithms for removing Bowtie effect, the new algorithm is derived with correlation coefficient method from the disciplinarian exhibited by the experiments in China, United States and Australia (mainly with MODIS data of 500 meters resolution), it turned out a second order polynomial describes the disciplinarian well. The results demonstrate that, without ephemeris data, the new algorithm is able to eliminate the Bowtie effect of MODIS L1B data effectively with no information lost.
Towards the Design of a Scalable Email Archiving and Discovery Solution
Authors: Frank Wagner, Kathleen Krebs, Cataldo Mega, Bernhard Mitschang, Norbert Ritter
Venue: Proceedings of the 12th East European conference on Advances in Databases and Information Systems (2008)

In this paper we propose a novel approach to specialize a general purpose Enterprise Content Management (ECM) System into an Email Archiving and Discovery (EAD) System. The magnitude and range of compliance risks associated with the management of EAD is driving investment in the development of more effective and efficient approaches to support regulatory compliance, legal discovery and content life-cycle needs. Companies must recognize and address requirements like legal compliance, electronic discovery, and document retention management. What is needed today are EAD systems capable to process very high message ingest rates, support distributed full text indexing, and allow forensic search such to support litigation cases. All this must be provided at lowest cost with respect to archive management and administration. In our approach we introduce a virtualized ECM repository interface where the key content repository components are wrapped into a set of tightly coupled Grid service entities, such to achieve scale-out on a cluster of commodity blade hardware that is automatically configured and dynamically provisioned. By doing so we believe, we can leverage the strength of Relational Database Management Systems and Full Text Indexes in a managed clustered environment with minimal operational overhead.
Adaptive Self-feeding Natural Language Generator Engine
Authors: Jovan David Rebolledo Méndez, Kenji Nakayama
Venue: Proceedings of the 8th international conference on Intelligent Virtual Agents (2008)

A Natural Language Generation (NLG) engine is proposed based on the combination of NLG and Expert Systems. The combination of these techniques paves the way to employ user defined behaviors in virtual worlds as inputs to an expert system. Adaptive Algorithms can then be used to retrieve information from the Internet to give feedback to the user via the NLG engine. The combination of these AI techniques can bring about some benefits such as believability in the interaction between AI-driven and human-driven avatars in virtual worlds.