ppxscal/embedding_network huggingface dataset:
A Development Process for Self-adapting Service Oriented Applications
Authors: M. Autili, L. Berardinelli, V. Cortellessa, A. Marco, D. Ruscio, P. Inverardi, M. Tivoli
Venue: Proceedings of the 5th international conference on Service-Oriented Computing (2007)

Software services in the near ubiquitous future will need to cope with variability, as they are deployed on an increasingly large diversity of computing platforms, operate in different execution environments, and communicate through Beyond 3G (B3G) networks. Heterogeneity of the underlying communication and computing infrastructure, physical mobility of platform devices, and continuously evolving requirements claim for services to be adaptable according to the context changes without degrading their quality. Supporting the development and execution of software services in this setting raises numerous challenges that involve languages, methods and tools. However these challenges taken in isolation are not new in the service domain. Integrated solutions to these challenges are the main targets of the IST PLASTIC project.In this paper we introduce the PLASTIC development process model for self-adapting context-aware services, in which we propose model-based solutions to address the main issues of this domain in a comprehensive way. We instantiate the process model by providing methodologies to generate Quality of Service models and adaptable code from UML service models. All these methodologies are supported by an integrated framework which is based on an UML profile that we have defined for the PLASTIC domain.
A Unified Audit Expression Model for Auditing SQL Queries
Authors: Vikram Goyal, S. K. Gupta, Anand Gupta
Venue: Proceeedings of the 22nd annual IFIP WG 11.3 working conference on Data and Applications Security (2008)

A privacy auditing framework for Hippocratic databases accepts an administrator formulated audit expression and returns all suspicious user queries that satisfy the given constraints in that audit expression. Such an expression should be expressive, precise, unambiguous and flexible to describe various characteristics of a privacy violation such as target data (sensitive data subject to disclosure review), suspicion notion, authorized privacy policy parameters through which the violation is possible, and time duration of the privacy violation. Earlier proposed audit expression models for the auditing are not flexible and do not specify suspicion notion with in the audit expression for the auditing of past user accesses. We propose a unified model for an audit expression which can specify earlier proposed audit expressions along with different suspicion notions. The model includes (i) a suspicion notion model which unifies earlier proposed suspicion notions, and (ii) mechanisms to specify data versions.
A Linear-Scaling Approach to Speaker Variability in Poly-segmental Formant Ensembles
Authors: Frantz Clermont
Venue: Speaker Classification II: Selected Projects (2007)

A linear-scaling approach is introduced for handling acoustic-phonetic manifestations of inter-speaker differences. The approach is motivated (i) by the similarity commonly observed amongst formant-frequency patterns resulting from different speakers' productions of the same utterance, and (ii) by the fact that there are linear-scaling properties associated with similarity. In methodological terms, formant patterns are obtained for a set of segments selected from a fixed utterance, which we call poly-segmental formant ensembles. Linear transformations of these ensembles amongst different speakers are then sought and interpreted as a set of scaling relations. Using multi-speaker data based on Australian English "hello", it is shown that the transformations afford a significant reduction of inter-speaker dissimilarity by inverse similarity. The proposed approach is thus able to unlock regularity in formant-pattern variability from speaker to speaker, without prior knowledge of the exact causes of the speaker differences manifested in the data at hand.
Vector Conception of Technical Systems' Dependability
Authors: Lech Bukowski, Jerzy Feliks
Venue: Proceedings of the 2008 19th International Conference on Systems Engineering (2008)

The paper concerns the conception of vector evaluation of technical systems' dependability. It was proposed to rank the terms concerning the basic features of systems' performances. For the evaluation of the indicators, it was proposed to apply linguistic measures, quantified in various ways depending on the type of the system.
Fixpoint Semantics and Completeness of the Computational Model for Fuzzy Linguistic Logic Programming
Authors: Van Hung Le, Fei Liu, Dinh Khang Tran
Venue: Proceedings of the 4th international conference on Intelligent Computing: Advanced Intelligent Computing Theories and Applications - with Aspects of Artificial Intelligence (2008)

Fuzzy linguistic logic programming, which is a result of integrating hedge algebras and fuzzy logic programming, is proposed to facilitate the representation and reasoning on knowledge expressed in natural language, in which vague sentences are usually given a degree of truth stated in linguistic terms rather than a number, and linguistic hedges are very often used. To compute the truth value of a query, a computational model which directly manipulates linguistic terms is provided. The computational model has been proved to be sound. This paper presents a fixpoint semantics for fuzzy linguistic logic programs and based on it proves the completeness of the computational model.
An Operational Real-Time Ocean Sensor Network in the Gulf of Maine
Authors: Neal R. Pettigrew, Collin S. Roesler, Francois Neville, Heather E. Deese
Venue: GeoSensor Networks: Second International Conference, GSN 2006, Boston, MA, USA, October 1-3, 2006, Revised Selected and Invited Papers (2008)

The Gulf of Maine Ocean Observing System (GoMOOS) was established in the summer of 2001 as a prototype real-time observing system that now includes eleven solar-powered buoys with physical and optical sensors, four shore-based long-range HF radar surface current systems, circulation and wave models, satellite observations, and hourly web delivery of data.The Gulf of Maine is a harsh operational environment. Its winter storms pose severe challenges including the build up of sea ice on buoy sensors, superstructure, and solar panels, and in summer its productive waters present severe biofouling problems that can affect the optical sensors. The periods of most difficult operations often coincide with periods of greatest data value in terms of marine safety, search and rescue, and monitoring biological productivity. GoMOOS scientists and engineers continue to refine system designs and operational procedures to moderate the environmental stresses on the sensors and systems.
Spectral structure of the equilateral triangle I: Lamé's formulas
Authors: Brian J. McCartin
Venue: Proceedings of the American Conference on Applied Mathematics (2008)

Lamé's formulas for the eigenvalues and eigenfunctions of the Laplacian on an equilateral triangle with either Dirichlet or Neumann boundary conditions are reviewed. The eigenfunctions are shown to form a complete orthonormal system. Various properties of the spectrum and nodal/antinodal lines are explored.
A Computational Framework to Integrate Different Semantic Resources
Authors: Qiang Zhou
Venue: Proceedings of the 11th international conference on Text, Speech and Dialogue (2008)

In recent years, many large-scale semantic resources have been built in the NLP community, but how to apply them in real text semantic parsing is still a big problem. In this paper, we propose a new computational framework to deal with this problem. Its key parts are a lexical semantic ontology (LSO) representation to integrate abundant information contained in current semantic resources, and a LSO schema to automatically reorganize all this semantic knowledge in a hierarchical network. We introduce an algorithm to build the LSO schema by a three-step procedure: to build a knowledge base of lexical relationship, to accumulate all information in it to generate basic LSO nodes, and to build a LSO schema through hierarchical clustering based on different semantic relatedness measures among them. The preliminary experiments have shown promising results to indicate its computability and scaling-up characteristics. We hope it can play an important role in real world semantic computation applications.
Simulating Complex Calcium-Calcineurin Signaling Network
Authors: Jiangjun Cui, Jaap A. Kaandorp
Venue: Proceedings of the 8th international conference on Computational Science, Part III (2008)

Understanding of processes in which calcium signaling is involved is of fundamental importance in systems biology and has many applications in medicine. In this paper we have studied the particular case of the complex calcium-calcineurin-MCIP-NFAT signaling network in cardiac myocytes, the understanding of which is critical for treatment of pathologic hypertrophy and heart failure. By including some most recent experimental findings, we constructed a computational model totally based on biochemical principles. The model can correctly predict the mutant (MCIP1¿ / ¿) behavior under different stress such as PO (pressure overload) and CaN* (activated calcineurin) overexpression.
Ant Colony Optimization and the Single Round Robin Maximum Value Problem
Authors: David C. Uthus, Patricia J. Riddle, Hans W. Guesgen
Venue: Proceedings of the 6th international conference on Ant Colony Optimization and Swarm Intelligence (2008)

In this paper, we apply the ant colony optimization metaheuristic to the Single Round Robin Maximum Value Problem, a problem from sports scheduling. This problem contains both feasibility constraints and an optimization goal. We approach this problem using a combination of the metaheuristic with backtracking search. We show how using constraint satisfaction techniques can improve the hybrid's performance. We also show that our approach performs comparably to integer programming and better than tabu search when applied to the Single Round Robin Maximum Value Problem.
Using Paralinguistic Cues in Speech to Recognise Emotions in Older Car Drivers
Authors: Christian Jones, Ing-Marie Jonsson
Venue: Affect and Emotion in Human-Computer Interaction: From Theory to Applications (2008)

Interactive speech based systems are moving into the car since speech interactions are considered less detrimental to the driver than interactions with a display. The introduction of in-car speech-based interactions highlights the potential influence of linguistic and paralinguistic cues such as emotion. Emotions direct and focus people's attention on objects and situations, and affects performance, judgment and risk-taking. All of these properties are crucial for driving where the smallest slip-up can have grave repercussions. Emotional cues in a car-voice, paired with the emotional state of the driver, have been found to influence driving performance. This initiated the design of an in-car driver emotion detection and response system. Results show that the in-car system can recognise and track changes in the emotional state of the driver. This study considers older drivers who often feel both unsafe and insecure due to concerns about declining abilities and in particular vision.
Shedding Light on Creativity: The History of Photography
Authors: Michael Lesk
Venue: IEEE Security and Privacy (2004)

One argument for copyright extension is that people are more willing to invest in activities that can gain intellectual property protection. Yet, every day, copyright protection keeps libraries from preserving or distributing works. This article looks at some historical examples to explore whether protection makes it more or less likely that someone will undertake the effort and expense to preserve intellectual property.
Exploiting the Power of GPUs for Asymmetric Cryptography
Authors: Robert Szerwinski, Tim Güneysu
Venue: Proceeding sof the 10th international workshop on Cryptographic Hardware and Embedded Systems (2008)

Modern Graphics Processing Units (GPU) have reached a dimension with respect to performance and gate count exceeding conventional Central Processing Units (CPU) by far. Many modern computer systems include --- beside a CPU --- such a powerful GPU which runs idle most of the time and might be used as cheap and instantly available co-processor for general purpose applications.In this contribution, we focus on the efficient realisation of the computationally expensive operations in asymmetric cryptosystems on such off-the-shelf GPUs. More precisely, we present improved and novel implementations employing GPUs as accelerator for RSA and DSA cryptosystems as well as for Elliptic Curve Cryptography (ECC). Using a recent Nvidia 8800GTS graphics card, we are able to compute 813 modular exponentiations per second for RSA or DSA-based systems with 1024 bit integers. Moreover, our design for ECC over the prime field P-224 even achieves the throughput of 1412 point multiplications per second.
Blind Multiuser Detection Based on Affine Projection Algorithm for MC-CDMA Uplink
Authors: Zheng-Qiang Wang, Ming Zhao
Venue: Proceedings of the 2008 Second International Conference on Genetic and Evolutionary Computing (2008)

A proved affine projection algorithm (APA) is proposed for Uplink asynchronous multicarrier code-division multiple-access (MC-CDMA) systems with multipath Rayleigh-fading channel. The proposed technique is totally blind, i.e., the channel estimation of desired user (the spreading code is known) is carried out by subspace separation, which doesn't need the rank estimation in the first step, then the result is put into the Proved Affine Projection Filter as a parameter. During the update of the weight vector, the APA filter extracts the parameters of blind channel estimation, suppresses multiple access interference (MAI) and recovers the information of desired user. The effectiveness of the proposed blind approach is demonstrated by computer simulation results, which show that it assures satisfactory performances in severe near-far scenarios, while its performances close to those of non-blind minimum-mean-square error (NB-MMSE) receiver.
Agents Deliberating over Action Proposals Using the ProCLAIM Model
Authors: Pancho Tolchinsky, Katie Atkinson, Peter Mcburney, Sanjay Modgil, Ulises Cortés
Venue: Proceedings of the 5th international Central and Eastern European conference on Multi-Agent Systems and Applications V (2007)

In this paper we propose a dialogue game for agents to deliberate over a proposed action. The agents' dialogue moves are defined by a structured set of argument schemes and critical questions (CQs). Thus, a dialogue move is an instantiated scheme (i.e. an argument) or a CQ (i.e. a challenge on the argument instantiated in the scheme). The proposed dialogue game formalises the protocol based exchange of arguments defined in the ProCLAIM model. This model provides a setting for agents to deliberate over whether, given the arguments for and against, a proposed action is justified or not.
An Efficient, and Fast Convergent Algorithm for Barrier Options
Authors: Tian-Shyr Dai, Yuh-Dauh Lyuu
Venue: Proceedings of the 3rd international conference on Algorithmic Aspects in Information and Management (2007)

A barrier option is an option whose payoff depends on whether the price path of the underlying asset ever reaches certain predetermined price levels called the barriers. A single- (double-) barrier option is a barrier option with one (two, respectively) barrier(s). No simple and exact closed-form pricing formula for double-barrier options has been reported in the literature. This paper proposes a novel tree model that can price both single- and double-barrier options efficiently and accurately. This tree model achieves the high efficiency by combinatorial techniques and numerical accuracy by hitting the barriers exactly. Numerical experiments are given to verify the superiority of our method.
Reasoning about Typicality in Preferential Description Logics
Authors: Laura Giordano, Valentina Gliozzi, Nicola Olivetti, Gian Luca Pozzato
Venue: Proceedings of the 11th European conference on Logics in Artificial Intelligence (2008)

In this paper we propose a nonmonotonic extension of the Description Logic $\mathcal{ALC}$ for reasoning about prototypical properties and inheritance with exception. The logic is built upon a previously introduced (monotonic) logic , that is obtained by adding a typicality operator T to $\mathcal{ALC}$. The operator T is intended to select the "most normal" or "most typical" instances of a concept, so that knowledge bases may contain subsumption relations of the form"T(C) is subsumed by P", expressing that typical C-members have the property P. In order to perform nonmonotonic inferences, we define a "minimal model" semantics for . The intuition is that preferred, or minimal models are those that maximise typical instances of concepts. By means of we are able to infer defeasible properties of (explicit or implicit) individuals. We also present a tableau calculus for deciding entailment.
Access to Mathematics in Web Resources for People with a Visual Impairment
Authors: Martyn Cooper, Tim Lowe, Mary Taylor
Venue: Proceedings of the 11th international conference on Computers Helping People with Special Needs (2008)

This paper discusses issues in the representation of mathematics within web resources and how this affects access for people with a visual impairment. Firstly it outlines the distance and open learning context at the Open University and the needs of people with a visual impairment. The paper then describes and discusses different approaches to making maths online accessible to people with a visual impairment. Two key projects at the Open University are outlined and some reflections made on future directions for the work.
Load-Balancing for a Block-Based Parallel Adaptive 4D Vlasov Solver
Authors: Olivier Hoenen, Eric Violard
Venue: Proceedings of the 14th international Euro-Par conference on Parallel Processing (2008)

This work is devoted to the numerical resolution of the 4D Vlasov equation using an adaptive mesh of phase space. We previously proposed a parallel algorithm designed for distributed memory architectures. The underlying numerical scheme makes possible a parallelization using a block-based mesh partitioning. Efficiency of this algorithm relies on maintaining a good load balance at a low cost during the whole simulation. In this paper, we propose a dynamic load balancing mechanism based on a geometric partitioning algorithm. This mechanism is deeply integrated into the parallel algorithm in order to minimize overhead. Performance measurements on a PC cluster show the good quality of our load balancing and confirm the pertinence of our approach.
Adaptive Encoding: How to Render Search Coordinate System Invariant
Authors: Nikolaus Hansen
Venue: Proceedings of the 10th international conference on Parallel Problem Solving from Nature: PPSN X (2008)

This paper describes a method for rendering search coordinate system independent, Adaptive Encoding. Adaptive Encoding is applicable to any iterative search algorithm and employs incremental changes of the representation of solutions. One attractive way to change the representation in the continuous domain is derived from Covariance Matrix Adaptation (CMA). In this case, adaptive encoding recovers the CMA evolution strategy, when applied to an evolution strategy with cumulative step-size control. Consequently, adaptive encoding provides the means to apply CMA-like representation changes to any search algorithm in the continuous domain. Experimental results confirm the expectation that CMA-based adaptive encoding will generally speed up a typical evolutionary algorithm on non-separable, ill-conditioned problems by orders of magnitude.
Apperance-Based Tracking and Face Identification in Video Sequences
Authors: José Miguel Buenaposada, Juan Bekios, Luis Baumela
Venue: Proceedings of the 5th international conference on Articulated Motion and Deformable Objects (2008)

We present a technique for face recognition in videos. We are able to recognise a face in a video sequence, given a single gallery image. By assuming that the face is in an approximately frontal position, we jointly model changes in facial appearance caused by identity and illumination. The identity of a face is described by a vector of appearance parameters. We use an angular distance to measure the similarity of faces and a probabilistic procedure to accumulate evidence for recognition along the sequence. We achieve 93.8% recognition success in a set of 65 sequences of 6 subjects from the LaCascia and Sclaroff database.
Geographical Information Services: A UK perspective on the development of interorganisational information services
Authors: Pauline Pollard
Venue: Information Polity (2000)

This paper describes the development of the National Land Information Services, the overall aim of which is to improve the management of land and property by linking details of land ownership, value and use at the level of the individual land parcel with topographical, utility, environmental and socio-economic data which can be accessed by government, business and citizens through electronic systems. The paper analyses the role of the UK geographical information policy network in developing this system. It shows how the policy network is open to information-mediated change to enable the development of this system and change power relationships within the network.
Function Finding Based on Gene Expression Programming
Authors: Haifang Mo, Jiangqing Wang, Jun Qin, Lishan Kang
Venue: Proceedings of the 2008 Second International Conference on Genetic and Evolutionary Computing (2008)

This paper proposes a new evolution algorithm, M_GEP, based on the concept of multi-gene chromosome in gene expression programming. The algorithm has two characters: (1) a chromosome is composed of more than one gene; (2) the sub-genes are linked together according to the linking gene which may conclude more than one kind of function. We give two examples, whose results show that the models set up by M_GEP are better than the models set up by GEP.
Statistical Simulation: Adding Efficiency to the Computer Designer's Toolbox
Authors: Lieven Eeckhout, Sebastien Nussbaum, James E. Smith, Koen De Bosschere
Venue: IEEE Micro (2003)

Statistical simulation enables quick and accurate design decisions in the early stages of computer design, at the processor and system levels. It complements detailed but slower architectural simulations, reducing total design time and cost.
Sorting Concepts by Priority Using the Theory of Monotone Systems
Authors: Ants Torim, Karin Lindroos
Venue: Proceedings of the 16th international conference on Conceptual Structures: Knowledge Visualization and Reasoning (2008)

Formal concept analysis is a powerful tool for conceptual modeling and knowledge discovery. As size of a concept lattice can easily get very large, there is a need for presenting information in the lattice in a more compressed form. We propose a novel method MONOCLE for this task that is based on the theory of monotone systems. The result of our method is a sequence of concepts, sorted by "goodness" thus enabling us to select a subset and a corresponding sub-lattice of desired size. That is achieved by defining a weight function that is monotone, correlated with area of data table covered and inversely correlated to overlaps of concepts. We can also use monotone systems theory of "kernels" to detect good cut-off points in the concept sequence. We apply our method to social and economic data of two Estonian islands and show that results are compact and useful.