ppxscal/embedding_network huggingface dataset:
New Anonymity Notions for Identity-Based Encryption
Authors: Malika Izabachène, David Pointcheval
Venue: Formal to Practical Security: Papers Issued from the 2005-2008 French-Japanese Collaboration (2009)

Identity-based encryption is a very convenient tool to avoid key management. Recipient-privacy is also a major concern nowadays. To combine both, anonymous identity-based encryption has been proposed. This paper extends this notion to stronger adversaries (the authority itself). We discuss this new notion, together with a new kind of non-malleability with respect to the identity, for several existing schemes. Interestingly enough, such a new anonymity property has an independent application to password-authenticated key exchange. We thus come up with a new generic framework for password-authenticated key exchange, and a concrete construction based on pairings.
Subspace sums for extracting non-random data from massive noise
Authors: Anne M. Denton
Venue: Knowledge and Information Systems (2009)

An algorithm is introduced that distinguishes relevant data points from randomly distributed noise. The algorithm is related to subspace clustering based on axis-parallel projections, but considers membership in any projected cluster of a given side length, as opposed to a particular cluster. An aggregate measure is introduced that is based on the total number of points that are close to the given point in all possible 2 d projections of a d-dimensional hypercube. No explicit summation over subspaces is required for evaluating this measure. Attribute values are normalized based on rank order to avoid making assumptions on the distribution of random data. Effectiveness of the algorithm is demonstrated through comparison with conventional outlier detection on a real microarray data set as well as on time series subsequence data.
The Separation Property Enhancement of Liquid State Machine by Particle Swarm Optimization
Authors: Jiangshuai Huang, Yongji Wang, Jian Huang
Venue: Proceedings of the 6th International Symposium on Neural Networks: Advances in Neural Networks - Part III (2009)

The separation property of Liquid State Machine (LSM) is a key for its power of computing, but the weights and delays of the inter-connections in the spiking neural circuit are usually randomly created and kept unchanged, which hinders the performance of the LSM greatly. In this paper, particle swarm optimization (PSO) was applied to optimize the weights and delays of the circuit so as to enhance the separation property of the LSM. Separation of random spike trains and Fisheriris data-set classification experiments are done by the optimized circuit. Demonstration examples show that the PSO can enlarge the separation property of the circuit greatly compared to the normal Hebbian-learning algorithm and enhance the computing ability of LSM.
Eye gaze in virtual environments: evaluating the need and initial work on implementation
Authors: Norman Murray, Dave Roberts, Anthony Steed, Paul Sharkey, Paul Dickerson, John Rae, Robin Wolff
Venue: Concurrency and Computation: Practice Experience (2009)

For efficient collaboration between participants, eye gaze is seen as being critical for interaction. Video conferencing either does not attempt to support eye gaze (e.g. AcessGrid) or only approximates it in round table conditions (e.g. life size telepresence). Immersive collaborative virtual environments represent remote participants through avatars that follow their tracked movements. By additionally tracking people's eyes and representing their movement on their avatars, the line of gaze can be faithfully reproduced, as opposed to approximated. This paper presents the results of initial work that tested if the focus of gaze could be more accurately gauged if tracked eye movement was added to that of the head of an avatar observed in an immersive VE. An experiment was conducted to assess the difference between user's abilities to judge what objects an avatar is looking at with only head movements being displayed, while the eyes remained static, and with eye gaze and head movement information being displayed. The results from the experiment show that eye gaze is of vital importance to the subjects correctly identifying what a person is looking at in an immersive virtual environment. This is followed by a description of the work that is now being undertaken following the positive results from the experiment. We discuss the integration of an eye tracker more suitable for immersive mobile use and the software and techniques that were developed to integrate the user's real-world eye movements into calibrated eye gaze in an immersive virtual world. This is to be used in the creation of an immersive collaborative virtual environment supporting eye gaze and its ongoing experiments. Copyright &copy; 2009 John Wiley & Sons, Ltd.
Technical communique: A note on connectivity of multi-agent systems with proximity graphs and linear feedback protocol
Authors: Zhendong Sun, Jie Huang
Venue: Automatica (Journal of IFAC) (2009)

In this note, we investigate the possibility of simplifying the connectivity verification for multi-agent systems with proximity graphs and the linear feedback protocol. A Lyapunov-like approach is developed for analyzing the monotonicity of the largest edge length in the network. Based on this approach, we provide an initial-connectivity-based sufficient condition for dynamic connectivity. In particular, when each initial node degree is not less than three fourth of the graph order, initial network connectivity implies dynamic connectivity.
Managing layout constraints in a platform for customized multimedia content packaging
Authors: Alexander Kröner, Patrick Brandmeier, Thomas Rist
Venue: Proceedings of the working conference on Advanced visual interfaces (2002)

A promising approach to customize the delivery of multimedia content is based on methods for compiling content packages from repositories of existing media assets, such as text paragraphs and images. Since the authors of media assets may have specified layout preferences for their assets neither knowing in which package these assets eventually will occur, nor knowing the personal layout preferences of all potential customers, layout conflicts, such as incompatible style attributes, are preprogrammed when packages are compiled on the fly by an automated system. In this contribution we present a constraint-based approach for resolving layout conflicts in automatically compiled content packages. Depending on the number and nature of the layout constraints to be considered, many eligible layout styles may exist. In fact, the exploration of a style solution space creates a problem on its own. Therefore, we are also investigating clustering and visualization techniques to assist a system administrator in the exploration of the solution space. The work has been conducted in the context of the EU funded project IMAGEN which aims at the development of an integrated set of tools for the customized publication and distribution of multimedia content.
On the collective sort problem for distributed tuple spaces
Authors: Matteo Casadei, Mirko Viroli, Luca Gardelli
Venue: Science of Computer Programming (2009)

In systems coordinated with a distributed set of tuple spaces, it is crucial to assist agents in retrieving the tuples they are interested in. This can be achieved by sorting techniques that group similar tuples together in the same tuple space, so that the position of a tuple can be inferred by similarity. Accordingly, we formulate the collective sort problem for distributed tuple spaces, where a set of agents is in charge of moving tuples up to a complete sort has been reached, namely, each of the N tuple spaces aggregate tuples belonging to one of the N kinds available. After pointing out the requirements for effectively tackling this problem, we propose a self-organizing solution resembling brood sorting performed by ants. This is based on simple agents that perform partial observations and accordingly take decisions on tuple movement. Convergence is addressed by a fully adaptive method for simulated annealing, based on noise tuples inserted and removed by agents on a need basis so as to avoid sub-optimal sorting. Emergence of sorting properties and scalability are evaluated through stochastic simulations.
Addressing researchers' needs through the data curation profile
Authors: Jake Carlson, Deborah Leiter
Venue: Proceedings of the 9th ACM/IEEE-CS joint conference on Digital libraries (2009)

This poster describes a study currently in progress that seeks to identify and address the needs of researchers from multiple disciplines in managing, curating and preserving their data. One output of this study, which is still in its early stages, will be the "data curation profile," a methodological tool designed to enable the comparison of needs across disciplines and help librarians build digital libraries that accurately reflect and address the needs of data producers.
Application of RBF Network Based on Immune Algorithm to Predicting of Wastewater Treatment
Authors: Hongtao Ye, Fei Luo, Yuge Xu
Venue: Proceedings of the 6th International Symposium on Neural Networks: Advances in Neural Networks - Part III (2009)

Wastewater treatment is a nonlinear, time-varing and time- delay process. It is difficult to establish exact mathematic model. A novel radial basis function (RBF) neural network model based on immune algorithm (IA) is presented in this paper. It combines the merits of IA and neural network. The IA is used to determine the hidden layer clustering centers of RBF neural network. The wastewater treatment process is established with the novel RBF neural network. Simulation results prove that the method has the advantages of less computation and higher precision.
Strategic Resource Dynamics of Manufacturing Firms
Authors: Shekhar Jayanthi, Aleda V. Roth, Mehmet M. Kristal, Lauren Carter-Roth Venu
Venue: Management Science (2009)

We conceptualize strategic decision-making processes within a manufacturing firm as streams of resources allocated to short-and long-term changes. The analogous ecological model, referred to as the Lotka-Volterra model, captures this dynamic tension between decisions made by the firm and its manufacturing operations. This representation leads to evolutionarily stable manufacturing strategies (ESMSs), which contribute to a firm's competitive advantage in different ways. Using a random sample of 30 firms from the U.S. semiconductor industry, we estimate parameters of the model and arrive at four ESMSs or strategic manufacturing groups that reflect theoretically and empirically distinctive adaptation patterns through their dynamic resource allocations. We observe that a majority of the firms were classified in one of the four groups, with relatively fewer firms in the other three. Notably, our classification based on ecology models agrees well with taxonomies in manufacturing and business strategy theory. Furthermore, our analysis shows significant differences among manufacturing practices and competitive capabilities of the four strategic groups. Managerially, these insights could provide the foundation to implement strategic changes that enable firms to leapfrog from one ESMS to another. This study also paves the way for development of a meso theory of the dynamics of manufacturing strategy.
Image Denoising by Harmonic Mean Curvature Flow
Authors: Mourad Zéraï
Venue: Proceedings of the Second International Conference on Scale Space and Variational Methods in Computer Vision (2009)

We propose a noise-removal method for vector-valued images by considering the negative gradient flow (the biharmonic map heat flow) of the intrinsic Bi-energy on Riemannian manifold of non-positive curvature. This method represents a natural generalization of both harmonic maps and minimal immersions. It is derived by finding the critical point of the variational problem associated to the integral of the squared norm of the tension-field (Bi-harmonic map) or of the mean curvature vector field (Bi-minimal immersion). In local coordinates, this method yields a fourth order non-linear system of PDE's that we, numerically, solve by an explicit finite difference method. Experiments on real color-image endowed with the Helmholtz and Stiles metrics show that the proposed method is effective, accurate and highly robust. 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
Utility Ontology Development with Formal Concept Analysis
Authors: Gaihua Fu, Anthony G. Cohn
Venue: Proceeding of the 2008 conference on Formal Ontology in Information Systems: Proceedings of the Fifth International Conference (FOIS 2008) (2008)

Although it is well recognised that ontologies have an important role to play in data integration, the lack of established ontologies in domains of interest often makes ontology-based integration a difficult task. Previous research on ontology design methodologies shows that manual construction of ontologies is a complex process and it is very hard for a designer to develop a consistent ontology. This paper contributes a formal and semi-automated approach for the development of ontologies in the utility infrastructure domain. It arises from a practical industrial problem of integrating the vast network of underground asset records. These asset records are typically autonomous, i.e. owned and maintained by individual organisations, and are encoded in an uncoordinated way, i.e. without consideration of interoperability with other utility information systems. The proposed approach is based on formal concept analysis (FCA) which is a mathematical approach for abstracting from attribute-based object descriptions. This paper describes techniques developed to support utility ontology development, with a focus on resolving implicit and mismatch data. Some experiments have been carried out to construct a utility ontology with data from utility companies. Though issues addressed in the paper arise in utility ontology development, we anticipate that they should be interesting and relevant to other application domains.
Mean Field Approximation of the Policy Iteration Algorithm for Graph-based Markov Decision Processes
Authors: Nathalie Peyrard, Régis Sabbadin
Venue: Proceeding of the 2006 conference on ECAI 2006: 17th European Conference on Artificial Intelligence August 29 -- September 1, 2006, Riva del Garda, Italy (2006)

In this article, we consider a compact representation of multidimensional Markov Decision Processes based on Graphs (GMDP). The states and actions of a GMDP are multidimensional and attached to the vertices of a graph allowing the representation of local dynamics and rewards. This approach is in the line of approaches based on Dynamic Bayesian Networks. For policy optimisation, a direct application of the Policy Iteration algorithm, of exponential complexity in the number of nodes of the graph, is not possible for such high dimensional problems and we propose an approximate version of this algorithm derived from the GMDP representation. We do not try to approximate directly the value function, as usually done, but we rather propose an approximation of the occupation measure of the model, based on the mean field principle. Then, we use it to compute the value function and derive approximate policy evaluation and policy improvement methods. Their combination yields an approximate Policy Iteration algorithm of linear complexity in terms of the number of nodes of the graph. Comparisons with the optimal solution, when available, and with a naive short-term policy demonstrate the quality of the proposed procedure.
Web application by South African health institutions
Authors: Mandlenkosi Victor Gwetu
Venue: Proceedings of the 2009 Annual Conference of the Southern African Computer Lecturers' Association (2009)

The World Wide Web (WWW) is one of the fastest growing technologies today. The content and design of websites has generally evolved over the years to create a cyberspace with greater information diversity as well as a wider spectrum of functionalities. The contribution of this paper lies primarily in the area of application of the WWW, specifically by South African health institutions. In this paper the researcher investigated how these institutions are utilizing the WWW and sought to find out whether as a provider of essential services to society, health organizations are taking advantage of the web by using its interactivity features. By developing a framework to enable the study of both content and interactivity features of these websites, the study was able to find out to what extent web technologies were being utilized and for what purposes. Findings are presented and recommendations made on gaps in possible utilizations of the web by health organizations, based on results from the study.
A first-principles study of the structural and electronic properties of III-V/thermal oxide interfaces
Authors: M. Scarrozza, G. Pourtois, M. Houssa, M. Caymax, A. Stesmans, M. Meuris, M. M. Heyns
Venue: Microelectronic Engineering (2009)

A theoretical study of the structural and electronic properties of the interfaces between a set of III-V compound semiconductors of technological interest and their native oxides is reported. First-principles techniques have been applied to model the reaction of oxidation of the GaAs(001)-@b2(2x4) surface and to generate a set of representative models of the atomic structure of a thermally grown GaAs/native oxide interface. The obtained models have been extended to the InAs/ and In"0"."5Ga"0"."5As/native oxide interfaces case. The impact of indium on both the structural changes occurring during the oxidation of the substrate and the resulting electronic properties has been quantified.
Embedding Intelligence into EDA Tools
Authors: Ankur Agarwal, Ravi Shankar, A. S. Pandya
Venue: Proceeding of the 2006 conference on Integrated Intelligent Systems for Engineering Design (2006)

Multiprocessor system on chip (MpSoC) platform has set a new innovative trend for the system-on-chip (SoC) design. Demanding Quality of Service (QOS) and performance metrics are leading to the adoption of a new design methodology for MpSoC. These will have to be built around highly scalable and reusable architectures that yield high speed at low cost and high energy efficiency for a variety of demanding applications. Designing such a system, in the presence of such aggressive QOS and Performance requirements, is an NP-complete problem. In this paper, we present the application of genetic algorithms to system level design flow to provide best effort solutions for two specific tasks, viz.., performance tradeoff and task partitioning.
Community portals for architecture-based middleware P2P
Authors: André Marcelo Panhan, Eder Ignatowicz, Leonardo S. Mendes
Venue: Proceedings of the 10th Annual International Conference on Digital Government Research: Social Networks: Making Connections between Citizens, Data and Government (2009)

In this paper we present an architecture based on 4-layer MVC model and a use of a P2P middleware to build a Community Portal to Digital Cities. This portal supports a community interconnection of the various segments of society. It is established in a middleware to P2P networks, and based on a 4-layer MVC model, the typical MVC (Model, View, Controller).
Tangential cover for thick digital curves
Authors: Alexandre Faure, Lilian Buzer, Fabien Feschet
Venue: Pattern Recognition (2009)

The recognition of digital shapes is a deeply studied problem. The arithmetical framework, initiated by Reveilles [Geometrie discrete, calcul en nombres entiers et algorithmique, These d'Etat, 1991], provides a powerful theoretical basis, as well as many algorithms to deal with digital objects. The tangential cover, first presented in Feschet and Tougne [Optimal time computation of the tangent of a discrete curve: application to the curvature, in: G. Bertrand, M. Couprie, L. Perroton (Eds.), 8th Discrete Geometry for Computer Imagery, Lecture Notes in Computer Science, vol. 1568, Springer, Berlin, 1999, pp. 31-40] and Feschet [Canonical representations of discrete curves, Pattern Anal. Appl. 8(1-2) (2005) 84-94] is a useful tool for representing geometric digital primitives. It computes the set of all maximal segments of a digital curve and permits either to obtain minimal length polygonalization or asymptotic convergence of tangents estimations. Nevertheless, the arithmetical approach does not tolerate the introduction of irregularities, which are however inherent to the acquisition of digital shapes. The present paper is an extension of Faure and Feschet [Tangential cover for thick digital curves, in: D. Coeurjolly, I. Sivignon, L. Tougne, F. Dupont (Eds.), DGCI 2008, Lecture Notes in Computer Science, vol. 4992, Springer, Berlin, 2008, pp. 358-369], in which we propose a new definition for a class of the so-called ''thick digital curves'' that applies well to a large class of digital object boundaries. We then propose an extension of the tangential cover to thick digital curves and provide an algorithm with an O(nlogn) time complexity, where n denotes the number of points of specific subparts of the thick digital curve. In order to keep up with this low complexity, some critical points must be taken into account. We describe all required implementation details in this paper.
Image Quality Assessment Using Phase Spectrum Correlation
Authors: Przemysław Skurowski, Aleksandra Gruca
Venue: Proceedings of the International Conference on Computer Vision and Graphics: Revised Papers (2008)

This paper presents the method of evaluating the image quality using similarity of images phase spectrum. The authors introduce phase correlation coefficient as an objective measure of an image quality index which is compared to the subjective distortion evaluation using stimulus impairment scale. Artificially distorted images produced by proportional mixing of images phase spectra with a noise were used for testing purposes. The results are the mean correlation coefficient values related to the mean opinion score grades. The obtained relation between human responses and phase correlation is linear.
Adaptation of Eikonal Equation over Weighted Graph
Authors: Vinh-Thong Ta, Abderrahim Elmoataz, Olivier Lézoray
Venue: Proceedings of the Second International Conference on Scale Space and Variational Methods in Computer Vision (2009)

In this paper, an adaptation of the eikonal equation is proposed by considering the latter on weighted graphs of arbitrary structure. This novel approach is based on a family of discrete morphological local and nonlocal gradients expressed by partial difference equations (PdEs). Our formulation of the eikonal equation on weighted graphs generalizes local and nonlocal configurations in the context of image processing and extends this equation for the processing of any unorganized high dimensional discrete data that can be represented by a graph. Our approach leads to a unified formulation for image segmentation and high dimensional irregular data processing.