ppxscal/embedding_network huggingface dataset:
Interpolation procedure with jitter of Gaussian process at the output of the time varying system
Authors: V. A. Kazakov, J. A. Medina
Venue: Proceedings of the 9th WSEAS International Conference on International Conference on Automation and Information (2008)

We consider a non stationary Gaussian process formed at the output of a time varying system driven by white noise. The system is the usual RC integrated circuit. The main parameter of this system has a harmonic change. On the basis of the conditional mean rule we analyze Sampling Reconstruction Procedure (SRP) with jitter of the output process. The model of jitter is described by the beta distribution. The reconstruction algorithm is the interpolation. We obtain one of the principal SRP characteristics the error reconstruction function, when the reconstruction function is optimal.
Periodicity and Immortality in Reversible Computing
Authors: Jarkko Kari, Nicolas Ollinger
Venue: Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science (2008)

We investigate the decidability of the periodicity and the immortality problems in three models of reversible computation: reversible counter machines, reversible Turing machines and reversible one-dimensional cellular automata. Immortality and periodicity are properties that describe the behavior of the model starting from arbitrary initial configurations: immortality is the property of having at least one non-halting orbit, while periodicity is the property of always eventually returning back to the starting configuration. It turns out that periodicity and immortality problems are both undecidable in all three models. We also show that it is undecidable whether a (not-necessarily reversible) Turing machine with moving tape has a periodic orbit.
A Novel Combination of Answer Set Programming with Description Logics for the Semantic Web
Authors: Thomas Lukasiewicz
Venue: Proceedings of the 4th European conference on The Semantic Web: Research and Applications (2007)

We present a novel combination of disjunctive logic programs under the answer set semantics with description logics for the Semantic Web. The combination is based on a well-balanced interface between disjunctive logic programs and description logics, which guarantees the decidability of the resulting formalism without assuming syntactic restrictions. We show that the new formalism has very nice semantic properties. In particular, it faithfully extends both disjunctive programs and description logics. Furthermore, we describe algorithms for reasoning in the new formalism, and we give a precise picture of its computational complexity. We also provide a special case with polynomial data complexity.
A survey of certificateless encryption schemes and security models
Authors: Alexander W. Dent
Venue: International Journal of Information Security (2008)

This paper surveys the literature on certificateless encryption schemes. In particular, we examine the large number of security models that have been proposed to prove the security of certificateless encryption schemes and propose a new nomenclature for these models. This allows us to &#x201c;rank&#x201d; the notions of security for a certificateless encryption scheme against an outside attacker and a passive key generation centre, and we suggest which of these notions should be regarded as the &#x201c;correct&#x201d; model for a secure certificateless encryption scheme. We also examine the security models that aim to provide security against an actively malicious key generation centre and against an outside attacker who attempts to deceive a legitimate sender into using an incorrect public key (with the intention to deny the legitimate receiver that ability to decrypt the ciphertext). We note that the existing malicious key generation centre model fails to capture realistic attacks that a malicious key generation centre might make and propose a new model. Lastly, we survey the existing certificateless encryption schemes and compare their security proofs. We show that few schemes provide the &#x201c;correct&#x201d; notion of security without appealing to the random oracle model. The few schemes that do provide sufficient security guarantees are comparatively inefficient. Hence, we conclude that more research is needed before certificateless encryption schemes can be thought to be a practical technology.
Tailoring IT Support to Communities of Practice
Authors: William W. Agresti
Venue: IT Professional (2003)

Many organizations have benefited from recognizing communities of practice (COPs) operating in their midst.
VRTX: A Real-Time Operating System for Embedded Microprocessor Applications
Authors: James Ready
Venue: IEEE Micro (1986)

Programmers can speed the development of complex software for powerful 32-bit microprocessors by designing with reusable software components. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
An assessment of the utility of gis-based analysis to support the coordination of humanitarian assistance
Authors: John R. Harrald
Venue:  (2007)

This dissertation investigated if Geographic Information Systems (GIS)-based analysis can have a decisive influence upon the coordination of international humanitarian assistance. Utility was assessed through a series of case studies demonstrating the application of GIS-based analysis to facilitate coordination of recent or potential humanitarian interventions. Six major categories of analysis were investigated: (1) queries and measurement, (2) transformation, (3) optimization, (4) geostatistics, (5) geovisualization, and (6) hypothesis testing and simulation. The researcher adopted the sequential exploratory method (i.e. mixed method) approach, which involved qualitative and quantitative research phases designed to elicit the opinion of humanitarian professionals from around the world. This statistically-representative sample population was then used to test a set of research hypotheses. Based upon the quantitative results, it was possible to conclude that GIS-based analysis can have a decisive impact upon the coordination of humanitarian assistance. GIS appears to offer substantial utility beyond its cartographic applications, particularly for applications such as Site Selection, Geovisualization, Vulnerability Estimation, Cluster Analysis and Range Analysis. This utility assessment, while very encouraging, does not necessarily demonstrate the feasibility of GIS-based analysis. Therefore continued research and experimentation is recommended to ensure the provision of pragmatic and decisive GIS-based analysis during UN-led humanitarian interventions.
Processing Aggregate Queries on Spatial OLAP Data
Authors: Kenneth Choi, Wo-Shun Luk
Venue: Proceedings of the 10th international conference on Data Warehousing and Knowledge Discovery (2008)

Spatial OLAP refers to the confluence of two technologies: spatial data management and OLAP for non-spatial data. An example query on spatial OLAP data is to find the total amount of gas sold within a period of time, of certain type of gas, to a certain type of customers, by gas stations located within a query window on a map. A framework has been established in [8], which converts this query into a set of queries for a general-purpose ROLAP system. However, there has been little done at the query optimization level, once they are submitted to the OLAP system. In this paper, we develop and implement 3 query processing strategies of very different nature on our experimental MOLAP system. Detailed experimental performance data are presented, using a real-life spatial database with 1/3 million of spatial objects.
Content Determination of Proteins in Milk Powder Using Short-Wave Near-Infrared Spectroscopy
Authors: Di Wu, Shuijuan Feng, Xiaojing Chen, Haiqing Yang, Yong He
Venue: Proceedings of the 2008 Congress on Image and Signal Processing, Vol. 5 - Volume 05 (2008)

Short-wave near-infrared (SWNIR) technique was applied to determine the protein contents in milk powder. NIR spectra in the 800-1025nm region of 350 milk powder samples were analyzed. Based on the whole SWNIR spectra, least-square support vector machine (LS-SVM) obtained the best performance than partial least squares (PLS). Determination coefficient for prediction (Rp2) and root mean square error of prediction (RMSEP) were 0.98 and 0.23, respectively. Loading weights and regression coefficients of PLS and LS-SVM were used to determine the sensitive bands for protein content, as 906, 949, 987, 1002, and 1025nm. Based on these sensitive bands, Rp2 of 0.977 and RMSEP of 0.178 were obtained. It is concluded that some wavelengths at short-wave NIR region can be used to predict protein content in milk powder.
Overview of the CLEF 2007 Multilingual Question Answering Track
Authors: Danilo Giampiccolo, Pamela Forner, Jesús Herrera, Anselmo Peñas, Christelle Ayache, Corina Forascu, Valentin Jijkoun, Petya Osenova, Paulo Rocha, Bogdan Sacaleanu, Richard Sutcliffe
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)

The fifth QA campaign at CLEF [1], having its first edition in 2003, offered not only a main task but an Answer Validation Exercise (AVE) [2], which continued last year's pilot, and a new pilot: the Question Answering on Speech Transcripts (QAST) [3, 15]. The main task was characterized by the focus on cross-linguality, while covering as many European languages as possible. As novelty, some QA pairs were grouped in clusters. Every cluster was characterized by a topic (not given to participants). The questions from a cluster possibly contain co-references between one of them and the others. Finally, the need for searching answers in web formats was satisfied by introducing Wikipedia as document corpus. The results and the analyses reported by the participants suggest that the introduction of Wikipedia and the topic related questions led to a drop in systems' performance.
An Improved Security Bound for HCTR
Authors: Debrup Chakraborty, Mridul Nandi
Venue: Fast Software Encryption: 15th International Workshop, FSE 2008, Lausanne, Switzerland, February 10-13, 2008, Revised Selected Papers (2008)

HCTR was proposed by Wang, Feng and Wu in 2005. It is a mode of operation which provides a tweakable strong pseudorandom permutation. Though HCTR is quite an efficient mode, the authors showed a cubic security bound for HCTR which makes it unsuitable for applications where tweakable strong pseudorandom permutations are required. In this paper we show that HCTR has a better security bound than what the authors showed. We prove that the distinguishing advantage of an adversary in distinguishing HCTR and its inverse from a random permutation and its inverse is bounded above by 4.5 ¿ 2/2 n , where n is the block-length of the block-cipher and ¿ is the number of n-block queries made by the adversary (including the tweak).
A Criterion for Learning the Data-Dependent Kernel for Classification
Authors: Jun-Bao Li, Shu-Chuan Chu, Jeng-Shyang Pan
Venue: Proceedings of the 3rd international conference on Advanced Data Mining and Applications (2007)

A novel criterion, namely Maximum Margin Criterion (MMC), is proposed for learning the data-dependent kernel for classification. Different kernels create the different geometrical structures of the data in the feature space, and lead to different class discrimination. Selection of kernel influences greatly the performance of kernel learning. Optimizing kernel is an effective method to improve the classification performance. In this paper, we propose a novel kernel optimization method based on maximum margin criterion, which can solve the problem of Xiong's work [1] that the optimal solution can be solved by iteration update algorithm owing to the singular problem of matrix. Our method can obtain a unique optimal solution by solving an eigenvalue problem, and the performance is enhanced while time consuming is decreased. Experimental results show that the proposed algorithm gives a better performance and a lower time consuming compared with Xiong's work.
Formalization of Continuous Probability Distributions
Authors: Osman Hasan, Sofiène Tahar
Venue: Proceedings of the 21st international conference on Automated Deduction: Automated Deduction (2007)

Continuous probability distributions are widely used to mathematically describe random phenomena in engineering and physical sciences. In this paper, we present a methodology that can be used to formalize any continuous random variable for which the inverse of the cumulative distribution function can be expressed in a closed mathematical form. Our methodology is primarily based on the Standard Uniform random variable, the classical cumulative distribution function properties and the Inverse Transform method. The paper includes the higher-order-logic formalization details of these three components in the HOL theorem prover. To illustrate the practical effectiveness of the proposed methodology, we present the formalization of Exponential, Uniform, Rayleigh and Triangular random variables.
MetaCoDe: A Lightweight UMLS Mapping Tool
Authors: Thierry Delbecque, Pierre Zweigenbaum
Venue: Proceedings of the 11th conference on Artificial Intelligence in Medicine (2007)

In the course of our current research on automatic information extraction from medical electronic literature, we have been facing the need to map big corpora onto the concepts of the UMLS Metathesaurus, both in French and in English. In order to meet our specific needs in terms of processing speed, we have developed a lightweight UMLS tagger, MetaCoDe, that processes large text collections at an acceptable speed, but at the cost of the sophistication of the treatments. In this paper, we describe MetaCoDe and evaluate its quality, allowing potential users to balance the gain in speed against the loss in quality.
On the Ky Fan inequality and some of its applications
Authors: J. L. Díaz-Barrero, J. J. Egozcue, J. Gibergans-Báguena
Venue: Computers Mathematics with Applications (2008)

In this paper, by applying Jensen's inequality for convex functions, a generalization of the Ky Fan discrete multivariate inequality is obtained and some of its applications are also given.
Policy Gradient Critics
Authors: Daan Wierstra, Jürgen Schmidhuber
Venue: Proceedings of the 18th European conference on Machine Learning (2007)

We present Policy Gradient Actor-Critic (PGAC), a new model-free Reinforcement Learning (RL) method for creating limited-memory stochastic policies for Partially Observable Markov Decision Processes (POMDPs) that require long-term memories of past observations and actions. The approach involves estimating a policy gradient for an Actor through a Policy Gradient Critic which evaluates probability distributions on actions. Gradient-based updates of history-conditional action probability distributions enable the algorithm to learn a mapping from memory states (or event histories) to probability distributions on actions, solving POMDPs through a combination of memory and stochasticity. This goes beyond previous approaches to learning purely reactive POMDP policies, without giving up their advantages. Preliminary results on important benchmark tasks show that our approach can in principle be used as a general purpose POMDP algorithm that solves RL problems in both continuous and discrete action domains.
Mobile Filtering for Error-Bounded Data Collection in Sensor Networks
Authors: Dan Wang, Jianliang Xu, Jiangchuan Liu, Feng Wang
Venue: Proceedings of the 2008 The 28th International Conference on Distributed Computing Systems (2008)

In wireless sensor networks, filters, which suppress data update reports within predefined error bounds, effectively reduce the traffic volume for continuous data collection. All prior filter designs, however, are stationary in the sense that each filter is attached to a specific sensor node and remains stationary over its lifetime. In this paper, we propose mobile filter, a novel design that explores migration of filters to maximize overall traffic reduction. A mobile filter moves upstream along the data collection path, with its residual size being updated according to the collected data. Intuitively, this migration extracts and relays unused filters, leading to more proactive suppressing of update reports. We start by presenting an optimal filter migration algorithm for a chain topology. The algorithm is then extended to general multi-chain and tree topologies. Extensive simulations demonstrate that, for both synthetic and real data traces, the mobile filtering scheme significantly reduces data traffic and extends network lifetime against a state-of-the-art stationary filtering scheme.
Cooperative Cache-Based Data Access in Ad Hoc Networks
Authors: Guohong Cao, Liangzhong Yin, Chita R. Das
Venue: Computer (2004)

Cooperative caching, in which multiple nodes share and coordinate cached data, is widely used to improve Web performance in wired networks. However, resource constraints and node mobility have limited the application of these techniques in ad hoc networks.The authors propose caching techniques that use the underlying routing protocols to overcome these constraints and further improve performance.
Molecular Structure Elucidation Using Ant Colony Optimization: A Preliminary Study
Authors: Caroline Farrelly, Douglas B. Kell, Joshua Knowles
Venue: Proceedings of the 6th international conference on Ant Colony Optimization and Swarm Intelligence (2008)

Identifying the structure of unknown molecules is an important activity in the pharmaceutical industry where it underpins the production of new drugs and the analysis of complex biological samples. We present here a new method for automatically identifying the structure of an unknown molecule from its nuclear magnetic resonance (NMR) spectrum. In the technique, an ant colony optimization algorithm is used to search iteratively the highly-constrained space of feasible molecular structures, evaluating each one by reference to NMR information on known molecules stored (in a raw form) in a database. Unlike existing structure elucidation systems, ours: does not need prior training or use spectrum prediction; does not rely on expert rules; and avoids enumeration of all possible candidate structures. We describe the important elements of the system here and include results on a preliminary test set of molecules. Whilst the results are currently too limited to allow parameter studies or comparison to other methods, they nevertheless indicate the system is working acceptably and shows considerable promise.
Large-Scale Industrial Positioning and Location Tracking Are We There Yet?
Authors: Werner Kurschl, Wolfgang Gottesheim, Stefan Mitsch, Rene Prokop, Johannes Schönböck, Wolfgang Beer
Venue: Proceedings of the 2008 7th International Conference on Mobile Business (2008)

The tracking of objects and humans has recently received a lot of attention as a tool to improve business processes,occupational safety and public safety. Employers and legislators are extremely interested in improving occupational safety as numerous internal executive decrees as well as safety laws suggest. Nevertheless, a recent report on industrial injuries shows that despite remarkable declines over the last ten years further improvement can be achieved with new approaches which are less expensive, more convenient, and truly ubiquitous. The question arises, however, as to whether these available technologies are really feasible in terms of accuracy, usability, cost, and ubiquity. In fact, our analysis of numerous theoretical approaches has revealed several shortcomings in their actual use, especially in harsh industrial environments. In this paper we present the requirements for a largearea industrial location tracking system for improving ccupational safety. We discuss current research and evaluate how well these systems meet crucial requirements.
Adequate Condensed Representations of Patterns
Authors: Arnaud Soulet, Bruno Crémilleux
Venue: Proceedings of the 2008 European Conference on Machine Learning and Knowledge Discovery in Databases - Part I (2008)

Patterns are at the core of the discovery of a lot of knowledge from data but their uses are limited due to their huge number and their mining cost. During the last decade, many works addressed the concept of condensed representation w.r.t. frequency queries. Such representations are several orders of magnitude smaller than the size of the whole collections of patterns, and also enable us to regenerate the frequency information of any pattern. Equivalence classes, based on the Galois closure, are at the core of the pattern condensed representations. However, in real-world applications, interestingness of patterns is evaluated by various many other user-defined measures (e.g., confidence, lift, minimum). To the best of our knowledge, these measures have received very little attention. The Galois closure is appropriate to frequency based measures but unfortunately not to other measures.
A Cultural Algorithm for Scheduling of Hydro Producer in the Power Market
Authors: Xiaohui Yuan, Hao Nie, Li He, Cailin Li, Yongchuan Zhang
Venue: Proceedings of the 2008 Second International Conference on Genetic and Evolutionary Computing (2008)

This paper proposes an enhanced cultural algorithm to solve the profit-based optimal self-scheduling of a hydro producer in the electricity market. In the proposed method, differential evolution is embedded into cultural algorithm as its population space and situational and normative knowledge sources in belief space are applied to influence the variation operator of differential evolution. Furthermore, it uses three simple selection criteria based on feasibility to handle constraints effectively. Finally, self-scheduling of a hydro producer with four cascaded hydro plants along a river basin is used to illustrate the feasibility and effectiveness of the proposed method.