ppxscal/embedding_network huggingface dataset:
Distributed Multi-stage Coding of Correlated Sources
Authors: Ankur Saxena, Kenneth Rose
Venue: Proceedings of the Data Compression Conference (2008)

This paper considers the problem of distributed scalable coding of correlated sources that are communicated to a central unit. The general setting is typically encountered in sensor networks. The conditions of communication channels between the sensor sources and fusion center may be time-varying and it is often desirable to guarantee a base layer of coarse information during channel fades. Specifically, we consider a multi-stage coding system to perform such distributed scalable coding of correlated sources. This problem poses new challenges. We show that mere extensions of distributed coding ideas to include multi-stage coding yield poor rate-distortion performance, due to underlying conflicts between the objectives of scalable and distributed coding. An appropriate systemparadigm is developed which allows such tradeoffs to be explicitly controlled within joint optimization of all the system components. We propose an iterative joint design technique and derive the necessary conditions for optimality which yield its update rules.Simulation results show substantial gains over single source (separate) multi-stage coding as well as naive extensions to incorporate scalability in distributed scalable coding schemes.
A novel ANN-based service selection model for ubiquitous computing environments
Authors: Haibin Cai, Fang Pu, Runcai Huang, Qiying Cao
Venue: Journal of Network and Computer Applications (2008)

How to choose an appropriate service from all the usable services regardless of user's location and heterogeneous architecture of underlying software and hardware infrastructure is the most important study content in ubiquitous computing domain. In order to overcome the shortcomings of blindness and randomicity in traditional and improved trust-mechanism-based service selection models, we propose a novel ANN-based (Artificial Neural Network) service selection model (called the ANNSS model). We adopt a novel method which according to the earlier information of the cooperation between the devices and the context information, an ANN-based evaluation standard for the service quality of service provider is given out so that user can acquire an effective guidance and choose the most appropriate service. At the same time, we improved the traditional BP algorithm based on three-term method (called the TTMBP algorithm) consisting of a learning rate (LR), a momentum factor (MF) and a proportional factor (PF) in order to satisfy the requirements of time issue in real-time system. The convergence speed and stability were enhanced by adding the proportional factor. The self-adjusting architecture method is adopted so that a moderate scale of neural network can be obtained. We have implemented the ANNSS algorithm in an actual power supply system for communication devices and fulfilled various simulations. The results of simulation show that the proposed service selection scheme is not only scalable but also efficient, and that the novel BP algorithm based on three-term has high convergence speed and good convergence stability. The novel service selection scheme superior to the traditional and improved trust-mechanism-based service selection scheme. The novel scheme can exactly choose a most appropriate service from many service providers and provide the most perfect service performance to users.
Geometry of possibility measures on finite sets
Authors: Tomáš Kroupa
Venue: International Journal of Approximate Reasoning (2008)

The paper presents a purely geometrical characterization of the convex set of probabilities dominated by a possibility measure on a finite set. It is demonstrated that the set of dominated probabilities can be represented as a very special kind of convex polyhedral set, the so-called simple polytope, which enhances performance of computational methods. A lower bound and a new upper bound for the number of extreme points are established. It is shown that the upper bound leads in some cases to a better estimate than the exponential bound appearing in the literature.
Literatronica: adaptive digital narrative
Authors: Juan B. Gutierrez, Mark C. Marino
Venue: Proceedings of the hypertext 2008 workshop on Creating out of the machine: hypertext, hypermedia, and web artists explore the craft (2008)

In this workshop we explore the Literatronica system in regards to the choices and decisions made by the technical architect of the system and by an author. The Literatronica system allows authors to create pieces of adaptive digital narrative, and provides an accessible web interface for readers. Digital narrative works could reconfigure themselves for the reader, leading every time to a potentially unique read. Literatronica works could not be reproduced on paper except, perhaps, as a reading path at a given moment.
Efficient assembly of social semantic networks
Authors: Benjamin Markines, Heather Roinestad, Filippo Menczer
Venue: Proceedings of the nineteenth ACM conference on Hypertext and hypermedia (2008)

Social bookmarks allow Web users to actively annotate individual Web resources. Researchers are exploring the use of these annotations to create implicit links between online resources. We define an implicit link as a relationship between two online resources established by the Web community. An individual may create or reinforce a relationship between two resources by applying a common tag or organizing them in a common folder. This has led to the exploration of techniques for building networks of resources, categories, and people using the social annotations. In order for these techniques to move from the lab to the real world, efficient building and maintenance of these potentially large networks remains a major obstacle. Methods for assembling and indexing these large networks will allow researchers to run more rigorous assessments of their proposed techniques. Toward this goal we explore an approach from the sparse matrix literature and apply it to our system, GiveALink.org. We also investigate distributing the assembly, allowing us to grow the network with the body of resources, annotations, and users. Dividing the network is effective for assembling a global network where the implicit links are dependent on global properties. Additionally, we explore alternative implicit link measures that remove global dependencies and thus allow for the global network to be assembled incrementally, as each participant makes independent contributions. Finally we evaluate three scalable similarity measures, two of which require a revision of the data model underlying our social annotations.
Combinational Logic Circuit Protection Using Customized Error Detecting and Correcting Codes
Authors: Avijit Dutta, Abhijit Jas
Venue: Proceedings of the 9th international symposium on Quality Electronic Design (2008)

Detecting and correcting errors in logic circuits is much more difficult than in memories. While concurrent error detection and correction mechanisms can be efficiently incorporated in memories due to their regular structure, logic circuits present a much greater challenge because of their irregular structure. One approach to handle the problems arising due to soft errors is to detect the errors using a concurrent error detection (CED) circuitry that monitors the circuit output for the occurrence of an error. Once the error is detected the system can recover and hence prevent a failure. While operating in an environment with high soft error rate and for systems with a stringent reliability and availability requirement, error detection alone may not be sufficient. While triple modular redundancy (TMR) can mask all single faults, the overhead can be unacceptably high for the targeted applications. This paper presents a low-overhead non-intrusive technique to detect and correct the most likely soft errors using customized ad-hoc error detecting and correcting (EDAC) linear block codes. Employing the proposed EDAC scheme can dramatically reduce the failure rate and increase the mean time to failure (MTTF) for logic circuits with limited overhead. For certain types of applications e.g., network servers, query servers, etc., with high availability and low cost requirements, the proposed approach could be very useful. The linearity property of the codes allows for efficient synthesis of the parity prediction logic. The experimental results demonstrate the effectiveness of the proposed scheme.
Modeling and Verifying Time Sensitive Security Protocols with Constraints
Authors: Ti Zhou, Mengjun Li, Zhoujun Li, Huowang Chen
Venue: Electronic Notes in Theoretical Computer Science (ENTCS) (2008)

This paper researches the characteristic of time sensitive protocols and presents a method with simple operations to verify protocols with time stamps and avoid false attacks. Firstly, an extension of @p calculus is given to model a time sensitive security protocol. And then, by appending linear arithmetic constraints to the Horn logic model, the extended Horn logic model of security protocols and the modified-version verification method with time constraints are represented. All operations and the strategy of verification are defined for our constraints system. Thirdly, a method is given to determine whether the constraints has a solution or not. Finally, as a result of an experiment, Denning-Sacco protocol with time stamps is verified. The experiment shows that our approach is an innovative and effective method on verifying time sensitive security protocols.
Incentives for Opportunistic Networks
Authors: Jussi Kangasharju, Andreas Heinemann
Venue: Proceedings of the 22nd International Conference on Advanced Information Networking and Applications - Workshops (2008)

Ad hoc networks and peer-to-peer systems typically require many users to participate, to leverage the full benefits of the system. In this paper we consider incentives for opportunistic networks. As an example, consider an electronic coupon system, where providers send out coupons, which are passed from user to user. Users receive bonus points for each redemption to encourage participation. We define a general model for such bonus point -based coupon schemes and derive an optimal strategy to allow a user to determine how many bonus points she should ask for when passing the coupon. We also show that our optimal strategy is very robust against all other user strategies, and that there is a strong incentive for users to follow our optimal strategy.
Keynote 1 - Strong Programming Model for Strong Weak Mobility: The ProActive Parallel Suite
Authors: Denis Caromel
Venue: Proceedings of the The Ninth International Conference on Mobile Data Management (2008)

ProActive is a Java library (Source code under GPL license) for parallel, distributed, and concurrent computing, also featuring mobility and security in a uniform framework. ProActive aimed at simplifying the programming of applications that are distributed on Local Area Network (LAN), on cluster of workstations, or large scale Grids. ProActive promotes a strong NoC approach, Network On Ship, to cope seamlessly with both distributed and shared-memory multi-core machines. A theoretical foundation ensures constant behavior, whatever the environment.ProActive features location tracking of moving objects, together with a strong programming model that makes it very suitable for global computinginfrastructure.Interactive and graphical GUI of the ProActive Parallel Suite will also be presented during the talk.
Proceedings of the 5th ACM/IEEE International Workshop on Projector camera systems
Venue: International Conference on Computer Graphics and Interactive Techniques (2008)

Coupling controllable light with light sensing devices facilitates a wide range of applications, including 3D scanning, flexible display walls, novel display interaction, reflectance field capture, optical communication, and artistic creations. While the term "projector-camera" is used, such systems encompass any approach that employs a controllable light-source, from LEDs to an array of light projectors, with a light sensing device, ranging from simple photo-sensors to an array of high-resolution wide-field-of-view cameras. The PROCAMS workshop series serves as an annual gathering place for researchers and practitioners who use, build, and design projector-camera systems for a wide variety of applications and purposes. The workshop accepts papers, posters, and demos on all topics relating to projector-camera systems. This year PROCAMS'08 is to be co-located with SIGGRAPH'08 in Los Angeles. Previous PROCAMS workshops have been held in conjunction with the annual conference on Computer Vision and Pattern Recognition (CVPR). The use of projector-camera systems, however, spans a number of disciplines including computer vision, computer graphics, HCI, and display technology. By locating at SIGGRAPH'08, our aim is to involve a broader range of perspectives towards applications, research problems, and challenges faced by projector-camera systems designers and practitioners.
Feature extraction using constrained maximum variance mapping
Authors: Bo Li, De-Shuang Huang, Chao Wang, Kun-Hong Liu
Venue: Pattern Recognition (2008)

In this paper, an efficient feature extraction method named as constrained maximum variance mapping (CMVM) is developed. The proposed algorithm can be viewed as a linear approximation of multi-manifolds learning based approach, which takes the local geometry and manifold labels into account. The CMVM and the original manifold learning based approaches have a point in common that the locality is preserved. Moreover, the CMVM is globally maximizing the distances between different manifolds. After the local scatters have been characterized, the proposed method focuses on developing a linear transformation that can maximize the dissimilarities between all the manifolds under the constraint of locality preserving. Compared to most of the up-to-date manifold learning based methods, this trick makes contribution to pattern classification from two aspects. On the one hand, the local structure in each manifold is still kept; on the other hand, the discriminant information between manifolds can be explored. Finally, FERET face database, CMU PIE face database and USPS handwriting data are all taken to examine the effectiveness and efficiency of the proposed method. Experimental results validate that the proposed approach is superior to other feature extraction methods, such as linear discriminant analysis (LDA), locality preserving projection (LPP), unsupervised discriminant projection (UDP) and maximum variance projection (MVP).
A generalization of Haussler's convolution kernel: mapping kernel
Authors: Kilho Shin, Tetsuji Kuboyama
Venue: Proceedings of the 25th international conference on Machine learning (2008)

Haussler's convolution kernel provides a successful framework for engineering new positive semidefinite kernels, and has been applied to a wide range of data types and applications. In the framework, each data object represents a finite set of finer grained components. Then, Haussler's convolution kernel takes a pair of data objects as input, and returns the sum of the return values of the predetermined primitive positive semidefinite kernel calculated for all the possible pairs of the components of the input data objects. On the other hand, the mapping kernel that we introduce in this paper is a natural generalization of Haussler's convolution kernel, in that the input to the primitive kernel moves over a predetermined subset rather than the entire cross product. Although we have plural instances of the mapping kernel in the literature, their positive semidefiniteness was investigated in case-by-case manners, and worse yet, was sometimes incorrectly concluded. In fact, there exists a simple and easily checkable necessary and sufficient condition, which is generic in the sense that it enables us to investigate the positive semidefiniteness of an arbitrary instance of the mapping kernel. This is the first paper that presents and proves the validity of the condition. In addition, we introduce two important instances of the mapping kernel, which we refer to as the size-of-index-structure-distribution kernel and the editcost-distribution kernel. Both of them are naturally derived from well known (dis)similarity measurements in the literature (e.g. the maximum agreement tree, the edit distance), and are reasonably expected to improve the performance of the existing measures by evaluating their distributional features rather than their peak (maximum/minimum) features.
An FPGA-based face detector using neural network and a scalable floating point unit
Authors: Yongsoon Lee, Seok-Bum Ko
Venue: Proceedings of the 5th WSEAS International Conference on Circuits, Systems, Electronics, Control & Signal Processing (2006)

The study implemented an FPGA-based face detector using Neural Networks and a scalable Floating Point arithmetic Unit (FPU). The FPU provides dynamic range and reduces the bit of the arithmetic unit more than fixed point method does. These features led to reduction in the memory so that it is efficient for neural networks system with large size data bits. The arithmetic unit occupies 39∼45% of the total neural networks system area. Therefore bits reduction is needed not only for memory but also for a FPU and system size. Reduction from FPU 32 bits (IEEE 754 single precision) to 16 bits reduced the size of memory and arithmetic units by 50%, having only 1.25% deterioration in the detection rate. In order to determine the least and acceptable bits of the FPU, we examined how representation errors affect a detection rate through the MRRE. The scalable FPU and the error analysis may be useful to determine the details, especially area and speed of FPU for the embedded neural network system.
Inapproximability of pure nash equilibria
Authors: Alexander Skopalik, Berthold Vöcking
Venue: Proceedings of the 40th annual ACM symposium on Theory of computing (2008)

The complexity of computing pure Nash equilibria in congestion games was recently shown to be PLS-complete. In this paper, we therefore study the complexity of computing approximate equilibria in congestion games. An alpha-approximate equilibrium, for α > 1, is a state of the game in which none of the players can make an α-greedy step, i.e., an unilateral strategy change that decreases the player's cost by a factor of at least α. Our main result shows that finding an α-approximate equilibrium of a given congestion game is sc PLS-complete, for any polynomial-time computable α > 1. Our analysis is based on a gap introducing PLS-reduction from FLIP, i.e., the problem of finding a local optimum of a function encoded by an arbitrary circuit. As this reduction is tight it additionally implies that computing an α-approximate equilibrium reachable from a given initial state by a sequence of α-greedy steps is PSPACE-complete. Our results are in sharp contrast to a recent result showing that every local search problem in PLS admits a fully polynomial time approximation scheme. In addition, we show that there exist congestion games with states such that any sequence of α-greedy steps leading from one of these states to an α-approximate Nash equilibrium has exponential length, even if the delay functions satisfy a bounded-jump condition. This result shows that a recent result about polynomial time convergence for α-greedy steps in congestion games satisfying the bounded-jump condition is restricted to symmetric games only.
AS Alliance in Inter-Domain Routing
Authors: Xiangjiang Hu, Peidong Zhu, Kaiyu Cai, Zhenghu Gong
Venue: Proceedings of the 22nd International Conference on Advanced Information Networking and Applications - Workshops (2008)

The inter-domain routing system is the critical infrastructure of the Internet. For this complex macrosystem, improving the ability of self-organization and cooperation is more adapted to the solid growth of the scale to the center-control. In this work a novel notion of ‘AS Alliance’ is introduced, which is a group of self organized AS that can work together for some common profit. Based on it, two enhanced mechanism for BGP are proposed. The security enhanced mechanism has very low cost of certificate management and good scalability. While the stability enhanced mechanism has better isolation property.
Study of location management for next generation personal communication networks
Authors: Teerapat Sanguankotchakorn, Panuvit Wibullanon
Venue: Proceedings of the 4th WSEAS International Conference on Telecommunications and Informatics (2005)

The main target of location management is to maintain location of users while minimizing the system operation. The process consists of location update, paging, and database consideration. The location update and paging manages the user-network interaction cost as low as possible, while the database maintains user data and manages these data transferred efficiently. This research studies the scheme combining Velocity Paging (VP) and Timer-based update strategy with Distributed Database (DDB), comparing to the standard strategy, Location Area scheme (LA) with Centralized Database (CDB). The VP scheme estimates the paging area by the user's velocity and the time span from the last registration. In Timer-based update scheme, Mobile Terminal (MT) updates its location when the timer exceeds the Time Threshold. The performance evaluation of location update, paging, and database is achieved. In LA scheme, a good selection of location area assignment can minimize the total cost. However, when the user's behaviors change, the previous assignment cannot be optimum any more. For VP with Timer-based update scheme, a good selection of Time Threshold can minimize the total cost. Additionally, the Time Threshold can be adapted, according to user's behaviors, to minimize the cost. Meanwhile, the Distributed Database (DDB) can manage the data transferred more efficiently than the Centralized Database (CDB).
Relating documents via user activity: the missing link
Authors: Elin Rønby Pedersen, David W. McDonald
Venue: Proceedings of the 13th international conference on Intelligent user interfaces (2008)

In this paper we describe a system for creating and exposing relationships between documents: a user's interaction with digital objects (like documents) is interpreted as links - to be discovered and maintained by the system. Such relationships are created automatically, requiring no priming by the user. Using a very simple set of heuristics, we demonstrate the uniquely useful relationships that can be established between documents that have been touched by the user. Furthermore, this mechanism for relationship building is media agnostic, thus discovering relationships that would not be found by conventional content based approaches. We describe a proof-of-concept implementation of this basic idea and discuss a couple of natural expansions of the scope of user activity monitoring.