ppxscal/embedding_network huggingface dataset:
Data Set 203 a New High-Speed Voideband Modem
Authors: L. N. Holzman
Venue: Computer (1970)

The Data Set 203 permits the offering of a new Bell System service for voice-channel data transmission. The design is highly flexible and provides, by means of equipment options, the maximum voiceband data rates now practical over the telecommunications network. This paper describes the data set and discusses the theory of operation. The performance of the set at various data rates is also discussed.
Discovering Latent Structures: Experience with the CoIL Challenge 2000 Data Set
Authors: Nevin L. Zhang
Venue: Proceedings of the 7th international conference on Computational Science, Part IV: ICCS 2007 (2007)

We present a case study to demonstrate the possibility of discovering complex and interesting latent structures using hierarchical latent class (HLC) models. A similar effort was made earlier ?, but that study involved only small applications with 4 or 5 observed variables. Due to recent progress in algorithm research, it is now possible to learn HLC models with dozens of observed variables. We have successfully analyzed a version the CoIL Challenge 2000 data set that consists of 42 observed variable. The model obtained consists of 22 latent variables, and its structure is intuitively appealing.
New Global Asymptotic Stability Criterion for Uncertain Neural Networks with Time-Varying and Distributed Delays
Authors: Jiqing Qiu, Jinhui Zhang, Zhifeng Gao, Hongjiu Yang
Venue: Proceedings of the 4th international symposium on Neural Networks: Advances in Neural Networks (2007)

This paper investigates the problem of global asymptoticstability for a class of uncertain neural networks with time-varying and distributed delays. The uncertainties we considered in this paper are norm-bounded, and possibly time-varying. By Lyapunov-Krasovskii functional approach and S-procedure, a new stability criteria for the asymptotic stability of the system is derived in terms of linear matrix inequalities (LMIs). Two simulation examples are given to demonstrate the effectiveness of the developed techniques.
2-List-coloring planar graphs without monochromatic triangles
Authors: Carsten Thomassen
Venue: Journal of Combinatorial Theory Series B (2008)

We prove that, for every list-assignment of two colors to every vertex of any planar graph, there is a list-coloring such that there is no monochromatic triangle. This proves and extends a conjecture of B. Mohar and R. Skrekovski and a related conjecture of A. Kundgen and R. Ramamurthi.
Interoperable and Transparent Dynamic Deployment of Web Services for Service Oriented Grids
Authors: Michael Messig, Andrzej Goscinski
Venue: Proceedings of the 8th international conference on Computational Science, Part I (2008)

Dynamic deployment of Web services is a term used frequently when describing the selection and deployment of a service to a grid host. Although current grid systems (such as Globus) provide dynamic deployment, the requirements of the service being deployed are not considered. Therefore truly dynamic deployment cannot be achieved as the services deployed are restricted to the grid system used. We present a dynamic deployment mechanism as part of self configuration in a service oriented grid environment. The dynamic deployment mechanism takes the requirements of the service into consideration, including parameters such as the operating system required to execute the service, the required software libraries, any additional required software packages, price and Quality of Service (QoS) parameters.
An end-to-end routing protocol for peer-to-peer communication in wireless sensor networks
Authors: Ricardo Simón Carbajo, Meriel Huggard, Ciarán McGoldrick
Venue: Proceedings of the 6th workshop on Middleware for network eccentric and mobile applications (2008)

Interfacing Wireless Sensor Network (WSN) technologies with the Internet is a key requirement for making sensor data globally available. To this end, the authors have developed the TinyTorrents system; a peer-to-peer publishing and redundancy framework for the dissemination of sensor data in a reliable, redundant and self-consistent manner using torrent technology. TinyTorrents utilises a reactive routing protocol for WSNs which incorporates bidirectionality, reliability and generic communications modalities. In this paper the routing protocol, TinyHop, is presented. Tiny-Hop creates on-demand routes, is self managed and works in an end-to-end fashion. Any node in the mobile environment can establish communications with, and retrieve data from, any contactable node at any time. Thus any node can function as a base station or sink. Mobile elements (e.g. data mules) or static gateways can interconnect from different parts of the network, thereby balancing the traffic load and helping avoid network partition. The protocol has been implemented in TinyOS 2.0.2 and simulated in TOSSIM.
Cryptanalysis of Reduced-Round SMS4 Block Cipher
Authors: Lei Zhang, Wentao Zhang, Wenling Wu
Venue: Proceedings of the 13th Australasian conference on Information Security and Privacy (2008)

SMS4 is a 128-bit block cipher used in the WAPI standard. WAPI is the Chinese national standard for securing Wireless LANs. Since the specification of SMS4 was not released until January 2006, there have been only a few papers analyzing this cipher. In this paper, firstly we present a kind of 5-round iterative differential characteristic of SMS4 whose probability is about 2¿ 42. Then based on this kind of iterative differential characteristic, we present a rectangle attack on 16-round SMS4 and a differential attack on 21-round SMS4. As far as we know, these are the best cryptanalytic results on SMS4.
Human-Robot Lunar Exploration: Pressurized vs. Unpressurized Rovers
Authors: C. Weisbin, J. Mrozinski, H. Hua, K. Shelton, J. H. Smith, A. Elfes, W. Lincoln, V. Adumitroaie, R. Silberg
Venue: Proceedings of the 2008 19th International Conference on Systems Engineering (2008)

A study is conducted to determine the relative productivity of employing two pressurized or two unpressurized robotic rovers with two teams of astronauts to accomplish a group of activities on the Moon. An automated planning tool is used to calculate the optimal sequence of events, given an objective function and sets of assumptions and constraints. For the mission scenario studied, a pair of pressurized rovers is shown to be about 7 times as productive as a pair of unpressurized rovers when calculating benefits divided by marginal operational costs. This is primarily due to a constraint that limits astronauts to a maximum of 8 hours per day in space suits. The unpressurized rovers require the astronauts to wear space suits at all times, severely limiting the distance they can travel from the lander-habitat; the pressurized rovers permit the astronauts to remove their suits while driving, monitoring robotic activities, and resting between work periods.
Efficient Handling of Relational Database Combinatorial Queries Using CSPs
Authors: Malek Mouhoub, Chang Feng
Venue: Proceedings of the 21st international conference on Industrial, Engineering and Other Applications of Applied Intelligent Systems: New Frontiers in Applied Artificial Intelligence (2008)

A combinatorial query is a request for tuples from multiple relations that satisfy a conjunction of constraints on tuple attribute values. Managing combinatorial queries using the traditional database systems is very challenging due to the combinatorial nature of the problem. Indeed, for queries involving a large number of constraints, relations and tuples, the response time to satisfy these queries becomes an issue. To overcome this difficulty in practice we propose a new model integrating the Constraint Satisfaction Problem (CSP) framework into the database systems. Indeed, CSPs are very popular for solving combinatorial problems and have demonstrated their ability to tackle, in an efficient manner, real life large scale applications under constraints. In order to compare the performance in response time of our CSP-based model with the traditional way for handling combinatorial queries and implemented by MS SQL Server, we have conducted several experiments on large size databases. The results are very promizing and show the superiority of our method comparing to the traditional one.
Multi-Attribute Non-initializing Texture Reconstruction Based Active Shape Model (MANTRA)
Authors: Robert Toth, Jonathan Chappelow, Mark Rosen, Sona Pungavkar, Arjun Kalyanpur, Anant Madabhushi
Venue: Proceedings of the 11th international conference on Medical Image Computing and Computer-Assisted Intervention - Part I (2008)

In this paper we present MANTRA (Multi-Attribute, Non-Initializing, Texture Reconstruction Based Active Shape Model) which incorporates a number of features that improve on the the popular Active Shape Model (ASM) algorithm. MANTRA has the following advantages over the traditional ASM model. (1) It does not rely on image intensity information alone, as it incorporates multiple statistical texture features for boundary detection. (2) Unlike traditional ASMs, MANTRA finds the border by maximizing a higher dimensional version of mutual information (MI) called combined MI (CMI), which is estimated from kNN entropic graphs. The use of CMI helps to overcome limitations of the Mahalanobis distance, and allows multiple texture features to be intelligently combined. (3) MANTRA does not rely on the mean pixel intensity values to find the border; instead, it reconstructs potential image patches, and the image patch with the best reconstruction based on CMI is considered the object border. Our algorithm was quantitatively evaluated against expert ground truth on almost 230 clinical images (128 1.5 Tesla (T) T2 weighted in vivo prostate magnetic resonance (MR) images, 78 dynamic contrast enhanced breast MR images, and 21 3T in vivo T1-weighted prostate MR images) via 6 different quantitative metrics. Results from the more difficult prostate segmentation task (in which a second expert only had a 0.850 mean overlap with the first expert) show that the traditional ASM method had a mean overlap of 0.668, while the MANTRA model had a mean overlap of 0.840.
The Principles of Large-Scale Computing Machines
Authors: John Von Neumann
Venue: IEEE Annals of the History of Computing (1981)

The following paper was one of many seminal works on computing prepared by John von Neumann. This specific paper formed the basis for an article that appears in von Neumann's Collected Works (Vol. V), edited by A. H. Taub and published in 1963 by Pergamon Press. Coauthored by Herman H. Goldstine and von Neumann, the article in the volume is a much expanded version of the following paper.
Scene Change Detection Using a Local Detection Tree and Clustering in Ubiquitous Environment
Authors: Shin Seong-Yoon, Lee Jong-Chan, Baek Seong-Eun, Kang Oh-Hyong, Shin Jung-Hoon, Rhee Yang-Won
Venue: Proceedings of the international conference on Computational Science and Its Applications, Part II (2008)

Processing of video data is embossed very importantly in ubiquitous environment. This paper proposes a Scene Change Detection method using the local decision tree and clustering. The local decision tree detects cluster boundaries wherein local scenes occur, in such a way as to compare time similarity distributions among the difference values between detected scenes and their adjacent frames, and group an unbroken sequence of frames with similarities in difference value into a cluster unit. In other words, the local decision tree method is used to detect local scenes from a cluster segmentation unit.
Processing Top-k Queries in Distributed Hash Tables
Authors: Reza Akbarinia, Esther Pacitti, Patrick Valduriez
Venue: Proceedings of the 13th European international conference on Parallel Processing (2007)

Distributed Hash Tables (DHTs) provide a scalable solution for data sharing in large scale distributed systems, e.g. P2P systems. However, they only provide good support for exact-match queries, and it is hard to support complex queries such as top-k queries. In this paper, we propose a family of algorithms which deal with efficient processing of top-k queries in DHTs. We evaluated the performance of our solution through implementation over a 64-node cluster and simulation. Our performance evaluation shows very good performance, in terms of communication cost and response time.
Origami, Eleusis, and the Soma Cube: Martin Gardner's Mathematical Diversions, 1 edition
Authors: Martin Gardner
Venue:  (2008)

Martin Gardner continues to delight readers in Origami, Eleusis, and the Soma Cube, which is the second volume in the new Cambridge series, The New Martin Gardner Mathematical Library, based off his enormously popular Scientific American columns. He introduces young and old readers alike to the Generalized Ham Sandwich Theorem, origami, digital roots, magic squares, the mathematics of cooling coffee, the induction game of Eleusis, Dudeney puzzles, the maze at Hampton Court Palace, and many more mathematical puzzles and principles. Now the author, in consultation with experts, has added updates to all the chapters, including new game variations, mathematical proofs, and other developments and discoveries, to challenge and fascinate a new generation of readers.
A Comparative Study of Remote Controls for Digital TV Receivers
Authors: Jane Lessiter, Jonathan Freeman, Andrea Miotto, Eva Ferrari
Venue: Proceedings of the 6th European conference on Changing Television Environments (2008)

This study was designed to explore the usability of three remote controls that operate a specific digital set top box (Logik LDR V3) amongst consumers who may have more difficulty than most in accessing and using digital television equipment. Participants were UK consumers (a) aged over 75 years with various sensory, physical and/or cognitive impairment, (b) aged under 45 years with learning difficulties, and (c) aged under 45 years without any sensory, physical or cognitive impairment. Using a repeated measures design, participants were asked to perform a series of everyday tasks using remote controls with digital television equipment. Subjective and objective data were collected to explore how intuitive and desirable the remote controls were, and how well subjective preferences related to objective performance data. The study provides evidence that user interfaces that meet the UK Digital TV receiver recommendations (V1.3) for digital terrestrial television (section 5: remote controls) better meet the needs of consumers likely to face difficulty using digital television equipment.
Minimizing Total Completion Time in Two-Machine Flow Shops with Exact Delays
Authors: Yumei Huo, Haibing Li, Hairong Zhao
Venue: Proceedings of the 2nd international conference on Combinatorial Optimization and Applications (2008)

We study the problem of minimizing total completion time in the two-machine flow shop with exact delay model. This problem is a generalization of the no-wait flow shop problem which is known to be strongly NP-hard. Our problem has many applications but little results are given in the literature so far. We focus on permutation schedules. We first prove that some simple algorithms can be used to find the optimal schedules for some special cases. Then for the general case, we design some heuristics as well as metaheuristics whose performance are shown to be very well by computational experiments.
Self-consistent MPI-IO Performance Requirements and Expectations
Authors: William D. Gropp, Dries Kimpe, Robert Ross, Rajeev Thakur, Jesper Larsson Träff
Venue: Proceedings of the 15th European PVM/MPI Users' Group Meeting on Recent Advances in Parallel Virtual Machine and Message Passing Interface (2008)

We recently introduced the idea of self-consistent performance requirements for MPI communication. Such requirements provide a means to ensure consistent behavior of an MPI library, thereby ensuring a degree of performance portability by making it unnecessary for a user to perform implementation-dependent optimizations by hand. For the collective operations in particular, a large number of such rules could sensibly be formulated, without making hidden assumptions about the underlying communication system or otherwise constraining the MPI implementation. In this paper, we extend this idea to the realm of parallel I/O (MPI-IO), where the issues are far more subtle. In particular, it is not always possible to specify performance requirements without making assumptions about the implementation or without a priori knowledge of the I/O access pattern. For such cases, we introduce the notion of performance expectations, which specify the desired behavior for good implementations of MPI-IO. I/O performance requirements as well as expectations could be automatically checked by an appropriate benchmarking tool.
Distinct types of hubs in human dynamic networks
Authors: Eiko Yoneki, Pan Hui, Jon Crowcroft
Venue: Proceedings of the 1st Workshop on Social Network Systems (2008)

The emergence of Delay Tolerant Networks (DTNs) has culminated in a new generation of wireless networking. New communication paradigms using dynamic interconnectedness as people encounter each other lead towards a world where digital traffic flows. We focus on human-to-human communication in such environments, which exhibits the characteristics of social networks. Among various social contexts, we examine hubs in dynamic human networks. Hubs are highly connected nodes within the network. This paper describe hubs in time-dependent netwowrks and two distinct types of hubs: party and date hubs from real world connectivity traces.
Anomalous Diffusion and L&eacute;vy Flights in a Two-Dimensional Time Periodic Flow
Authors: S. Espa, A. Cenedese
Venue: Journal of Visualization (2005)

One of the main consequences of chaos is that transport is enhanced with respect to the fluid at rest, where only molecular diffusion is present. Considering long times and spatial scales much larger than the length scale of the velocity field, particles typically diffuse with a diffusion constant, usually much bigger than the molecular one. Nevertheless there are some important physical systems in which the particle motion is not a normal diffusive process: in such a case one speaks of anomalous diffusion. In this paper, anomalous diffusion is experimentally studied in an oscillating two-dimensional vortex system. In particular, scalar enhanced diffusion due to the synchronization between different characteristic frequencies of the investigated flow (i.e., resonance) is investigated. The flow has been generated by applying an electromagnetic forcing on a thin layer of an electrolyte solution and measurements are made through image analysis. In particular, by using the Feature Tracking (FT) technique, we are able to obtain a large amount of Lagrangian data (i.e., the seeding density can be very high and trajectories can be followed for large time intervals) and transport can be characterized by analyzing the growth of the variance of particle displacements versus time and the dependence of the diffusion coefficient on the flow characteristic frequencies.
Human Sensibility Evaluation Using Neural Network and Multiple-Template Method on Electroencephalogram (EEG)
Authors: Dongjun Kim, Seungjin Woo, Jeongwhan Lee, Kyeongseop Kim
Venue: Proceedings of the 4th international symposium on Neural Networks: Part II--Advances in Neural Networks (2007)

This study presents a human sensibility evaluation method using neural network and multiple-template method on electroencephalogram (EEG). For our research objective, 10-channel EEG signals are collected from the healthy subjects. After the necessary preprocessing is performed on the acquired signals, the various EEG parameters are estimated and their discriminating performance is evaluated in terms of pattern classification capability. In our study, Linear Prediction (LP) coefficients are utilized as the feature parameters extracting the characteristics of EEG signal, and a multi-layer neural network is evaluated for indicating the degree of human sensibility. Also, the estimation for human comfortableness is performed by varying temperature and humidity environment factors and our results showed that our proposed scheme achieved the good performance for evaluating human sensibility.
Bilingual Word Association Networks
Authors: Uta Priss, L. John Old
Venue: Proceedings of the 15th international conference on Conceptual Structures: Knowledge Architectures for Smart Applications (2007)

Bilingual word association networks can be beneficial as a tool in foreign language education because they show relationships among cognate words of different languages and correspond to structures in the mental lexicon. This paper discusses possible technologies that can be used to generate and represent word association networks.
An agent harms a victim: A functional magnetic resonance imaging study on specific moral emotions
Authors: Gayannée Kédia, Sylvie Berthoz, Michele Wessa, Denis Hilton, Jean-Luc Martinot
Venue: Journal of Cognitive Neuroscience (2008)

The statement: “An agent harms a victim,” depicts a situation that triggers moral emotions. Depending on whether the agent and the victim are the self or someone else, it can lead to four different moral emotions: self-anger (“I harm myself”), guilt (“I harm someone”), other-anger (“someone harms me”), and compassion (“someone harms someone”). In order to investigate the neural correlates of these emotions, we examined brain activation patterns elicited by variations in the agent (self vs. other) and the victim (self vs. other) of a harmful action. Twenty-nine healthy participants underwent functional magnetic resonance imaging while imagining being in situations in which they or someone else harmed themselves or someone else. Results indicated that the three emotional conditions associated with the involvement of other, either as agent or victim (guilt, other-anger, and compassion conditions), all activated structures that have been previously associated with the Theory of Mind (ToM, the attribution of mental states to others), namely, the dorsal medial prefrontal cortex, the precuneus, and the bilateral temporo-parietal junction. Moreover, the two conditions in which both the self and other were concerned by the harmful action (guilt and other-anger conditions) recruited emotional structures (i.e., the bilateral amygdala, anterior cingulate, and basal ganglia). These results suggest that specific moral emotions induce different neural activity depending on the extent to which they involve the self and other.
A Model of Facial Expression for 3D Avatar
Authors: Zhen Liu
Venue: Proceedings of the 7th international conference on Computational Science, Part III: ICCS 2007 (2007)

Modeling 3D avatar is very useful in e-learning software, a believable 3D avatar can have complex facial expression, and how to construct complex facial expression is a very interesting topic. The concept of emotion vector is presented. Emotion state of a 3D avatar can be transformed to an emotion vector that is calculated by basic emotion vector. The concept of expression vector is established, expression can be transformed to expression vector that is calculated by basic expression vector. Emotion mapping is set up from emotion vector space to expression vector space. A preliminary experiment is carried on microcomputer.