ppxscal/embedding_network huggingface dataset:
Secure sharing between untrusted users in a transparent source/binary deployment model
Authors: Eelco Dolstra
Venue: Proceedings of the 20th IEEE/ACM international Conference on Automated software engineering (2005)

The Nix software deployment system is based on the paradigm of transparent source/binary deployment: distributors deploy descriptors that build components from source, while client machines can transparently optimise such source builds by downloading pre-built binaries from remote repositories. This model combines the simplicity and flexibility of source deployment with the efficiency of binary deployment. A desirable property is sharing of components: if multiple users install from the same source descriptors, ideally only one remotely built binary should be installed. The problem is that users must trust that remotely downloaded binaries were built from the sources they are claimed to have been built from, while users in general do not have a trust relation with each other or with the same remote repositories.This paper presents three models that enable sharing: the extensional model that requires that all users on a system have the same remote trust relations, the intensional model that does not have this requirement but may be suboptimal in terms of space use, and the mixed model that merges the best properties of both. The latter two models are achieved through a novel technique of hash rewriting in content-addressable component stores, and were implemented in the context of the Nix system.
Low-complexity near-maximum-likelihood multiuser detection and ldpc channel coding
Authors: Dimitris A. Pados
Venue:  (2005)

In digital communication systems, maximum likelihood (ML) multiuser detection and decoding of linear block codes translate to similar basic combinatorial optimization problems with complexity exponential in the number of users or code size, respectively. Development of low-complexity high-performance sub-optimum solutions is of great practical interest. In this dissertation, we establish that the performance of the ML optimum multi-user detector can be approached efficiently and effectively as follows. First, we use a multiuser zero-forcing or minimum-mean-square-error (MMSE) linear filter as a pre-processor. The output magnitudes of the pre-processor, when properly scaled, provide a reliability measure for each user bit decision. Then, we produce and execute an ordered reliability-based error search sequence of length linear in the number of users which returns the most likely user bit vector among all visited options. Extensive simulation studies support these theoretical developments and indicate that the error performance of the optimum and the proposed detector are nearly indistinguishable over the whole pre-detection signal-to-noise ratio (SNR) range of practical interest. A low-complexity algorithm for the decoding of low-density parity-check (LDPC) codes is also developed. The algorithm is oriented specifically toward the low cost&mdash;yet effective&mdash;decoding of (high rate) finite geometry LDPC codes. The decoding procedure updates the hard-decision received vector iteratively in search of a valid codeword in the vector space. Only one bit is changed in each iteration and the bit selection criterion combines the number of failed checks and the reliability of the received bits. Prior knowledge of the signal amplitude and noise power is not required. An optional mechanism to avoid infinite loops in the search is also proposed. The algorithm achieves an appealing trade-off between performance and complexity for finite geometry LDPC codes. In addition, some new properties of generalized polygon LDPC codes are reported. We show formally that when the diameter is four or six or eight all codewords have even Hamming weight. When the generalized polygon has in addition equal number of points and lines, we see that the non-regular polygon based code construction has minimum distance that is higher at least by two in comparison with the dual regular polygon code of the same rate and length. A new minimum distance bound is presented for these codes. Finally, we prove that all codes derived from finite classical generalized quadrangles are quasi-cyclic and give the explicit size of circulant blocks in the parity check matrix.
Coordinated Robust Routing by Dual Cluster Heads in Layered Wireless Sensor Networks
Authors: Mei Yang, Jianping Wang, Zhenguo Gao, Yingtao Jiang, Yoohwan Kim
Venue: Proceedings of the 8th International Symposium on Parallel Architectures,Algorithms and Networks (2005)

In this paper, we propose the coordinated robust routing (CRR) scheme to address the fault tolerance requirements in the layered wireless sensor networks. In the proposed scheme, the robust routing trees are constructed coordinately from the most outward layer all the way to the sink node. The coordination is achieved by selecting two dedicated cluster heads for every two clusters in one layer. The problem of selecting dual cluster heads is formulated as a transportation problem, which can be solved using network flow algorithms. By having two cluster heads for every cluster pair, the CRR scheme helps to achieve fault tolerance and energy efficiency with low degree of network redundancy as well as low inter-packet delay. The performance of the CRR scheme in terms of delay, energy consumption, and network lifetime has been confirmed through simulations and compared with the single cluster head scheme.
Application of Uncertain Variables to Planning Resource Allocation in a Class of Research Projects
Authors: D. Orski
Venue: Proceedings of the 18th International Conference on Systems Engineering (2005)

The paper concerns research projects composed of tasks that must be performed in a sequence. Execution time of each task depends on an amount of a resource allocated to this task and is described by an expert in a form of inequality with unknown parameter. All unknown parameters are assumed to be values of uncertain variables characterized by certainty distributions. The paper contains formulation and solution of the knowledge-based resource allocation problem, an example illustrating the presented approach, and analysis of quality of expert's knowledge.
Machine Experiments and Theoretical Modelling: from Cybernetic Methodology to Neuro-Robotics
Authors: Guglielmo Tamburrini, Edoardo Datteri
Venue: Minds and Machines (2005)

Cybernetics promoted machine-supported investigations of adaptive sensorimotor behaviours observed in biological systems. This methodological approach receives renewed attention in contemporary robotics, cognitive ethology, and the cognitive neurosciences. Its distinctive features concern machine experiments, and their role in testing behavioural models and explanations flowing from them. Cybernetic explanations of behavioural events, regularities, and capacities rely on multiply realizable mechanism schemata, and strike a sensible balance between causal and unifying constraints. The multiple realizability of cybernetic mechanism schemata paves the way to principled comparisons between biological systems and machines. Various methodological issues involved in the transition from mechanism schemata to their machine instantiations are addressed here, by reference to a simple sensorimotor coordination task. These concern the proper treatment of ceteris paribus clauses in experimental settings, the significance of running experiments with correct but incomplete machine instantiations of mechanism schemata, and the advantage of operating with real machines ??? as opposed to simulated ones ??? immersed in real environments.
A Hierarchical Nonparametric Discriminant Analysis Approach for a Content-Based Image Retrieval System
Authors: Kien-Ping Chung, Chun Che Fun
Venue: Proceedings of the IEEE International Conference on e-Business Engineering (2005)

This paper proposes a Hierarchical Nonparmetric Discriminant Analysis (HNDA) content-based image retrieval (CBIR) system for E-Business applications. It has the potential to become an important and integral component for future e-Business applications. Developments in CBIR have drawn interest from many researchers and practitioners in recent years. The challenge is how to retrieve the most appropriate or relevant images at the fastest speed. To increase the retrieval speed, most of the systems pre-process the stored images and extract out the essential features. Such scheme only works well for the server type database system. Such approach is not feasible for systems that analyze images in real-time. In this paper, hierarchical multi-layer statistical discriminant framework is proposed. The system is able to select the most appropriate features by analyzing the newly received images, and then apply a Relevance Feedback (RF) approach to improve the retrieval accuracy. As the number of features being analyzed is less, an improvement in performance is achieved.
High performance MPI-2 one-sided communication over InfiniBand
Authors: Weihang Jiang, Jiuxing Liu, Hyun-Wook Jin, D. K. Panda, W. Gropp, R. Thakur
Venue: Proceedings of the 2004 IEEE International Symposium on Cluster Computing and the Grid (2004)

Many existing MPI-2 one-sided communication implementations are built on top of MPI send/receive operations. Although this approach can achieve good portability, it suffers front high communication overhead and dependency on remote process for communication progress. To address these problems, we propose a high performance MPI-2 one-sided communication design over the InfiniBand Architecture. In our design, MPI-2 one-sided communication operations such as MPI-Put, MPI-Get and MPI-Accumulate are directly mapped to InfiniBand Remote Direct Memory Access (RDMA) operations. Our design has been implemented based on MPICH2 over InfiniBand. We present detailed design issues for this approach and perform a set of microbenchmarks to characterize different aspects of its performance. Our performance evaluation shows that compared with the design based on MPI send/receive, our design can improve throughput up to 77%, and reduce latency and synchronization overhead up to 19% and 13%, respectively. Under certain process skew, the bad impact can be significantly reduced by new design, from 41% to nearly 0%. It also can achieve better overlap of communication and computation.
Automatic Segmentation and Recognition of Bank Cheque Fields
Authors: Vamsi K. Madasu, Brian C. Lovell
Venue: Proceedings of the Digital Image Computing on Techniques and Applications (2005)

This paper describes a novel method for automatically segmenting and recognizing the various information fields present on a bank cheque. The uniqueness of our approach lies in the fact that it doesn't necessitate any prior information and requires minimum human intervention. The extraction of segmented fields is accomplished by means of a connectivity based approach. For the recognition part, we have proposed four innovative features, namely; entropy, energy, aspect ratio and average fuzzy membership values. Though no particular feature is pertinent in itself but a combination of these is used for differentiating between the fields. Finally, a fuzzy neural network is trained to identify the desired fields. The system performance is quite promising on a large dataset of real and synthetic cheque images.
Scheduling Algorithms for Meet Row Constraint
Authors: Gang Tu, Wan-hua Cao, Fu-min Yang
Venue: Proceedings of the 11th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (2005)

The problem of guaranteeing "meet row n in m" weakly hard real-time constraint is addressed in this paper. The paper first analyzes characters of µ-pattern and gives out the definition of "unsatisfied µ-pattern". Then, it enumerates and proves several properties of unsatisfied µ-pattern. According to the properties, length of unsatisfied µ-pattern can indicate whether the µ-pattern satisfies the meet row constraint, therefore, a scheduling algorithm named Meet Row Algorithm is presented based on the properties. Meet Row Algorithm tries to find out the probabilities of tasks breaking constraints and increase task¿s priority in advance. Simulation results show that Meet Row Algorithm is better than other scheduling algorithms for meet row constraints and can largely decrease the worst-case computation time of real-time tasks.
The national science foundation and support for social science computing
Authors: Ronald E. Anderson
Venue: ACM SIGSOC Bulletin (1974)

Nearly two years ago, I spent several months working as a Professional Assistant in the Office of Computing Activities at the National Science Foundation in Washington, D.C. Although my assignment was to develop a concept for a program on "Computer Impact on Society", I had opportunity to become familiar with some of the projects supported in the area of computer applications for the social sciences. Actually I was already familiar with most of the projects that had been supported. However, the work assignment enabled me to have an expanded and slightly different perspective on these projects. 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
Early-AIM: An Approach for Identifying Aspects in Requirements
Authors: Americo Sampaio, Awais Rashid, Paul Rayson
Venue: Proceedings of the 13th IEEE International Conference on Requirements Engineering (2005)

Identifying aspects at an early stage helps to achieve separation of crosscutting concerns in the initial system analysis, instead of deferring such decisions to later stages of design and code, and thus, having to perform costly refactorings. This paper describes the Early-AIM approach that utilises corpus-based natural language processing (NLP) techniques to effectively enable the identification and modelling of early aspects in a semi-automated way.
Using Learning Algorithms to Improve Corner Detection
Authors: Tristrom Cooke, Robert Whatmough
Venue: Proceedings of the Digital Image Computing on Techniques and Applications (2005)

This paper discusses some preliminary results obtained using learning algorithms to improve the detection ability of various corner detectors. Two main problems are considered. The first problem concerns the Harris detector, which is defined using a Gaussian weighting function. A genetic algorithm is described for modifying this function to optimise the corner detection performance. The second problem concerns methods for combining corner detectors. An attempt is made to find the best combination using supervised classification techniques.
A Nash game algorithm for SIR-based power control in 3G wireless CDMA networks
Authors: Sarah Koskie, Zoran Gajic
Venue: IEEE/ACM Transactions on Networking (TON) (2005)

We propose a new algorithm for distributed power control in cellular communication systems. We define a cost for each mobile that consists of a weighted sum of power and square of signal-to-interference ratio (SIR) error and obtain the static Nash equilibrium for the resulting costs. The algorithm requires only interference power measurements and/or SIR measurements from the base station and converges even in cases where limits on available power render the target SIRs unattainable. Examples generated using realistic data demonstrate that, in demanding environments, the Nash equilibrium power provides substantial power savings as compared to the power balancing algorithm while reducing the achieved SIR only slightly. Additional simulations show that the benefit of the Nash equilibrium power control over the power balancing solution increases as the receiver noise power or number of users in the cell increases. The algorithm has the advantage that it can be implemented distributively. An additional benefit of the algorithm is that, based on their chosen cost function, mobiles may choose to "opt out," i.e., stop transmitting, if they determine that the power required to achieve their SIR objectives is more expensive to them than not transmitting at all.
Crowd and group animation
Authors: Daniel Thalmann, Christophe Hery, Seth Lippman, Hiromi Ono, Stephen Regelous, Douglas Sutton
Venue: ACM SIGGRAPH 2004 Course Notes (2004)

A continuous challenge for special effects in movies is the production of realistic virtual crowds, in terms of rendering and behavior. This course will present state-of-the-art techniques and methods. The course will explain in details the different approaches to create virtual crowds: particle systems with flocking techniques using attraction and repulsion forces, copy and pasting techniques, agent-based methods. The architecture of software tools will be presented including the MASSIVE software used for the Lord of the Ring trilogy.The course will explore essential aspects to the generation of virtual crowds. In particular, it will present the aspects concerning information (intentions, status and knowledge), behavior (innate, group, complex and guided) and control (programmed, autonomous and guided). It will emphasize essential concepts like sensory input (vision, audition, tactile), versatile motion control, artificial intelligence level, and rendering techniques.The course will also presents the new challenge in the production of realtime crowds for games, VR systems for training and simulation and crowds in Augmented Reality applications for cultural Heritage (like adding virtual audience in Roma or Greek theaters).The course will be illustrated with a lot of examples from recent movies (Star Wars, Jurassic Park, Lord of the Ring, Shrek2) and real-time applications in Emergency situations and Cultural Heritage.
Making soccer kicks better: a study in particle swarm optimization
Authors: Namrata Khemka, Christian Jacob, Gerald Cole
Venue: Proceedings of the 2005 workshops on Genetic and evolutionary computation (2005)

Computer simulation is a useful tool for investigating mathematical models of human muscle movement. These, in turn, can be used to help design equipment for sports activities. One biomechanics example is the simulation of a high-speed soccer kick. We used an evolutionary algorithm, based on a particle swarm optimizer, to adjust muscle control parameters for a soccer kick. In this paper we describe our implementation of the soccer kick project, followed by our successful experiments performed with the soccer kick.
Design, Implementation, and Performance of an Extensible Toolkit for Resource Prediction in Distributed Systems
Authors: Peter A. Dinda
Venue: IEEE Transactions on Parallel and Distributed Systems (2006)

RPS is a publicly available toolkit that allows a practitioner to straightforwardly create flexible online and offline resource prediction systems in which resources are represented by independent, periodically sampled, scalar-valued measurement streams. The systems predict the future values of such streams from past values and are composed at runtime out of a large and extensible set of communicating components that are in turn constructed using RPS's extensible sensor, prediction, wavelet, and communication libraries. This paper describes the design, implementation, and performance of RPS. We have used RPS extensively to evaluate predictive models and build online prediction systems for host load, Windows performance data, and network bandwidth. The computation and communication overheads involved in such systems are quite low.
Synchronous Testing of Multimodal Systems: An Operational Profile-Based Approach
Authors: Laya Madani, Catherine Oriat, Ioannis Parissis, Jullien Bouchet, Laurence Nigay
Venue: Proceedings of the 16th IEEE International Symposium on Software Reliability Engineering (2005)

In this paper we present a method for automatically testing interactive multimodal systems¹. The proposed approach was originally dedicated to synchronous programming which is mainly used for real-time systems. Nevertheless, the behaviour of real-time systems, consisting of cycles starting by reading an external input and ending by issuing an output, is to a certain extent similar to the one of interactive systems. So considered, this paper investigates the use of the Lutess testing environment dedicated to synchronous software for automatically testing multimodal interactive (not necessarily real-time) systems. More precisely, we focus on test data generation based on operational profiles. The main benefit of this approach is that it increases the ability to automatically test an interactive system over long input sequences, according to various use profiles.
Asymptotic Determination of the Last Packing Number of Quadruples
Authors: L. Ji
Venue: Designs, Codes and Cryptography (2006)

A 3-(n,4,1) packing design consists of an n-element set X and a collection of 4-element subsets of X, called blocks, such that every 3-element subset of X is contained in at most one block. The packing number of quadruples d(3,4,n) denotes the number of blocks in a maximum 3-(n,4,1) packing design, which is also the maximum number A(n,4,4) of codewords in a code of length n, constant weight 4, and minimum Hamming distance 4. In this paper the last packing number A(n,4,4) for n¿ 5(mod 6) is shown to be equal to Johnson bound $J(n,4,4)(=\lfloor\frac{n}{4}\lfloor\frac{n-1}{3}\lfloor\frac{n-2}{2}\rfloor\rfloor\rfloor)$ with 21 undecided values n=6k+5, k¿{m: m is odd , 3¿ m¿ 35, m¿ 17,21}¿ {45,47,75,77,79,159}.
Evolving object oriented agent programs in Robocup domain
Authors: David E. Suárez, Julián Y. Olarte, Sergio A. Rojas
Venue: Proceedings of the 2005 workshops on Genetic and evolutionary computation (2005)

This paper describes the application of object oriented genetic programming to the automatic generation of agents under the Object Oriented Paradigm. To generate the agent programs code, we evolve concurrently the methods that represent the agent-environment interaction. We use like terminals and operations the objects that correspond to the context elements. This study uses the simulation league of the Robot World Cup (Robocup) like a testing environment. The fitness function used evaluates the behavior of agent player in several levels that indicates the learning progress. The experimental results indicate that is possible the agent programs evolution under the Object Oriented Paradigm.
Consideration of UMTS-WLAN Seamless Handover
Authors: Hyeyeon Kwon, Kwang-Ryul Jung, Aesoon Park, Jae-Cheol Ryou
Venue: Proceedings of the Seventh IEEE International Symposium on Multimedia (2005)

By mutual complemented reason of wide coverage and high data transmission, the integration and handover of 3G network and WLAN is regarded as an important function for 3G beyond (B3G) mobile communication systems. The seamless mobility is one of the basic requirements for handover between these heterogeneous networks. In this paper, we present a seamless handover mechanism for UMTS and WLAN within the framework of handover architecture, IP mobility and authentication mechanism. Firstly, we review the 3GPP-speciJic integration architecture of UMTS and WLAN, WLAN UE-initiated tunnel mechanism, IP mobility and authentication mechanisms of both networks. Then we propose the conJiguration of Mobile IPv6 based UMTS-WLAN overlay network and the security mechanism for reducing the handover delay. Lastly we show the operation of seamless handover in our proposed network model.