ppxscal/embedding_network huggingface dataset:
Geophysical wavelet library: Applications of the continuous wavelet transform to the polarization and dispersion analysis of signals
Authors: M. Kulesh, M. Holschneider, M. S. Diallo
Venue: Computers Geosciences (2008)

In the present paper, we consider and summarize applications of the continuous wavelet transform to 2C and 3C polarization analysis and filtering, modeling the dispersed and attenuated wave propagation in the time-frequency domain, and estimation of the phase and group velocity and the attenuation from a seismogram. Along with a mathematical overview of each of the presented methods, we show that all these algorithms are logically combined into one software package ''Geophysical Wavelet Library'' developed by the authors. The novelty of this package is that we incorporate the continuous wavelet transform into the library, where the kernel is the time-frequency polarization and dispersion analysis. This library has a wide range of potential applications in the field of signal analysis and may be particularly suitable in geophysical problems that we illustrate by analyzing synthetic, geomagnetic and real seismic data.
Probabilistic Routing with Multi-Copies in Delay Tolerant Networks
Authors: Ze Li, Haiying Shen
Venue: Proceedings of the 2008 The 28th International Conference on Distributed Computing Systems Workshops (2008)

Intermittently connected mobile networks don't have a complete path from a source to a destination at most of the time. Such an environment can be found in very sparse mobile networks where nodes meet only occasionally or in wireless sensor networks where nodes sleep most of the time to conserve energy. Current approaches in such networks are primarily based on two kinds of transmissions: multi-copy flooding scheme and single-copy forwarding scheme. However, they have either high overheads due to excessive transmission or long delays due to the possible incorrect choices during forwarding. In this paper, we propose a hybrid probabilistic routing algorithm using multi-copies called HUM, in which a packet is initially replicated to a certain number of nodes, which sequentially forward those packets to the destination node based on a probabilistic routing scheme. Simulations show that compared to Epidemic routing, Spray and wait routing, HUM routing scheme provides a nearly optimal delay performance with a stable packet arrive rate with the community mobility model.
Social Effects of Virtual Assistants. A Review of Empirical Results with Regard to Communication
Authors: Nicole C. Krämer
Venue: Proceedings of the 8th international conference on Intelligent Virtual Agents (2008)

Early as well as recent evaluation studies indicated that embodied conversational agents induce social reactions on the part of the user. When confronted with virtual agents, human participants show communication behaviors that are similar to those shown in human-to-human interaction. The paper gives a review on relevant research.
Data Randomization for Lightweight Secure Data Aggregation in Sensor Network
Authors: Abedelaziz Mohaisen, Ik Rae Jeong, Dowon Hong, Nam-Su Jho, Daehun Nyang
Venue: Proceedings of the 5th international conference on Ubiquitous Intelligence and Computing (2008)

Data aggregation is one of the main purposes for which sensor networks are developed. However, to secure the data aggregation schemes, several security-related issues have raised including the need for efficient implementations of cryptographic algorithms, secure key management schemes' design and many others. Several works has been introduced in this direction and succeeded to some extent in providing relatively efficient solutions. Yet, one of the questions to be answered is that, can we still aggregate the sensed data with less security-related computation while maintaining a marginal level of security and accuracy? In this paper, we consider data randomization as a possible approach for data aggregation. Since the individual single sensed record is not of a big concern when using data for aggregation, we show how data randomization can explicitly hide the exact single data records to securely exchange them between nodes. To improve the security and accuracy of this approach, we introduce a hybrid scheme that uses the cryptographic approach for a fraction of nodes. We study the efficiency of our schemes in terms of the estimate accuracy and the overhead.
Interaction styles in tools for developing virtual environments
Authors: Jesper Kjeldskov, Jan Stage
Venue: Virtual Reality (2008)

This article discusses and compares interaction styles in development tools for virtual environments (VE). The comparison relies on a qualitative empirical study of two development processes where a command language and a direct manipulation based tool were used to develop the same virtual environment application. The command language tool proved very flexible and facilitated an even distribution of effort and progress over time, but debugging and identification of errors was very difficult. Contrasting this, the direct manipulation tool enabled faster implementation of a first prototype but did not facilitate a shorter implementation process as a whole. On the basis of these findings, the strength and weaknesses of direct manipulation for developing virtual environment applications are explored further through a comparison with a successful direct manipulation tool for developing interactive multimedia applications. The comparisons are used to identify and emphasize key requirements for virtual environment development tool interface design.
Autonomous Model Learning for Reinforcement Learning
Authors: Michael Littman
Venue: Proceedings of the 2008 Fifth International Conference on Quantitative Evaluation of Systems (2008)

Stochastic modeling is an excellent way of capturing system dynamics so that alternative control strategies can be evaluated and compared. I will discuss attributes that make some problems amenable to autonomous learning of system dynamics. I will then present recent advances in my lab concerning the design of learning algorithms with formal learning-time guarantees in the "KWIK" (knows what it knows) formalism along with their implementation on robotic and software control problems.
The conclusion of contracts by software agents in the eyes of the law
Authors: Tina Balke, Torsten Eymann
Venue: Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 2 (2008)

Faced with the ongoing evolution of software agents from mere passive tools to e-tailers acting autonomously for their human owners (principals), new legal challenges appear on the agenda. One of them is the question, whether the traditional law of agency that regulates the legal issues arising from human agents constituting legal relations between their principal and a third party, is applicable for software agents as well. Based on the characteristics of software agents this paper examines approaches for a legal classification of software agents and thereby analyzes current legislation that deal with the conclusion of contracts by software agents. Finally, this paper addresses remaining legal questions and discusses proposed solutions.
Studies on Human Computer Interface Design of Chinese Mobile Phone Users
Authors: Xue-Min Zhang, Yong-Na Li, Fran C. Blumberg
Venue: Proceedings of the 7th international conference on Advances in Web Based Learning (2008)

In present paper, we briefly presented a series researches from our lab which investigated font size, different pairings of font and background color on Chinese users' ability to effectively read messages and navigate a Chinese mobile phone interface. The findings of the studies from our lab may generalize from mobile phone message reading and menu operation to other circumstances where there is a small screen interface, such as mobile web interfaces, palmtop computers, and electronic dictionaries and other mobile e-learning devices. The results had significant implications on interface design of mobile small screen devices and mobile e-learning devices.
The Stream Cipher HC-128
Authors: Hongjun Wu
Venue: New Stream Cipher Designs: The eSTREAM Finalists (2008)

We present the 128-bit version of the stream cipher HC-256.
Virtual routers on the move: live router migration as a network-management primitive
Authors: Yi Wang, Eric Keller, Brian Biskeborn, Jacobus van der Merwe, Jennifer Rexford
Venue: ACM SIGCOMM Computer Communication Review (2008)

The complexity of network management is widely recognized as one of the biggest challenges facing the Internet today. Point solutions for individual problems further increase system complexity while not addressing the underlying causes. In this paper, we argue that many network-management problems stem from the same root cause---the need to maintain consistency between the physical and logical configuration of the routers. Hence, we propose VROOM (Virtual ROuters On the Move), a new network-management primitive that avoids unnecessary changes to the logical topology by allowing (virtual) routers to freely move from one physical node to another. In addition to simplifying existing network-management tasks like planned maintenance and service deployment, VROOM can also help tackle emerging challenges such as reducing energy consumption. We present the design, implementation, and evaluation of novel migration techniques for virtual routers with either hardware or software data planes. Our evaluation shows that VROOM is transparent to routing protocols and results in no performance impact on the data traffic when a hardware-based data plane is used.
Interference suppression algorithms for tdma cellular systems
Authors: John J. Shynk
Venue:  (2008)

Cochannel interference (CCI) and intersymbol interference (ISI) degrade the performance of cellular communication systems. In this dissertation, we investigate adaptive beamforming algorithms to suppress CCI in time-division multiple-access (TDMA) systems. In one approach, we are interested in iterative weight refinement techniques where the beamformer weights are computed successively using re-encoded data. We also suggest a semi-blind algorithm using a modified least-squares (LS) cost function. In addition, adaptive filtered training sequences compensate for the sampling phase offset of cochannel signals. At low signal-to-interference ratios (SIRs), the performance of the semi-blind beamformer exceeds that of the beamformer using filtered training sequences; however, for high SIRs, the reverse occurs. In order to improve the beamformer performance without regard to SIRs, we propose a hybrid beamformer using re-encoded data, filtered training sequences, and the semi-blind algorithm. Furthermore, we extend these beamforming algorithms to channel equalizers to mitigate ISI. We also analyze their performance using a stochastic model based on Wiener filter theory. Finally, we evaluate various receivers incorporating the proposed beamformers and equalizers. In these receivers, the TDMA data are processed in several stages that include the following series of steps: frame synchronization, adaptive beamforming, signal demodulation, adaptive equalization, and decoding. The performance of the multistage receivers is evaluated using simulated and real TDMA data.
Accessible Tourism for the Disabled: Long Tail Theory
Authors: Yen-Chun Jim Wu, Ming Jen Cheng
Venue: Proceedings of the 1st world summit on The Knowledge Society: Emerging Technologies and Information Systems for the Knowledge Society (2008)

The purpose of this study is to propose a completely barrier-less, or "accessible," tourism platform and makes suggestions to facilitate the current travel information for the disabled persons. It then applies Long Tail theory's three forces and nine "rules" in making assessments and creating an accessible tourism communication network to connect upstream and downstream travel agency. After collating the opinions of scholars specialized in the tourismsector and travel agents interviewed through semi-open questions, the study investigates the Long Tail theory's suitability and applicability to the tourism industry. This study then thoroughly explores the topic of accessible tourism and proposes concrete suggestions and frameworks for such travel need. It also sets up an accessible tourism communications network, contributing a real platform that travel agents can refer to as they take their first steps to provide travel packages that accommodate the needs of the disabled.
Locks Considered Harmful: A Look at Non-traditional Synchronization
Authors: Michel Raynal
Venue: Proceedings of the 6th IFIP WG 10.2 international workshop on Software Technologies for Embedded and Ubiquitous Systems (2008)

This paper considers the implementation of concurrent objects in systems prone to asynchrony and process failures. It first shows that lock-based solutions have drawbacks that can make them redhibitory for systems deployed in very demanding environments, such as embedded systems. Then, considering the adaptive renaming problem as a paradigm of coordination and synchronization problems, the paper investigates wait-free implementations of an adaptive renaming object (wait-free means that these implementations do not rest on locks or waiting loops). This problem consists in assigning new distinct names (to the subset of processes that want to acquire a new name) in such a way that the new name space be as small as possible.The best that can be done in asynchronous systems prone to process crashes, and where the processes communicate only through read/write atomic registers, is a new naming space of size M = 2p ¿ 1, where p is the number of processes that want to acquire a new name (whatever the number of processes in the system). An algorithm providing such an optimal renaming space is described. Then, it is shown how the use of "additional power" such as appropriate failure detectors, or synchronization primitives stronger than read/write operations, allows to bypass the 2p ¿ 1 lower bound.
Real-Time Railway Network Simulator "KUTTY"
Authors: A. Tomoeda, M. Komatsu, I. Y. Yoo, M. Uchida, R. Takayama, K. Nishinari
Venue: Proceedings of the 8th international conference on Cellular Automata for Reseach and Industry (2008)

In the railway transportation service, on-time operation of trains is quite important for customers. However, once an accident on a route occurs, on-time operation becomes difficult due to a change in the flow of passengers which is caused by the interruption. Thus, the real-time railway simulation tool plays a significant role to estimate the changing flow of passengers. In this paper, we propose real-time Tokyo Metro Railway Network simulation tool "KUTTY" and by using this simulator we can immediately estimate a change in the flow of passengers even if an accident occurs at the busiest area. Moreover, we have found that our homogenization system eases congestion in crowded area more than the conventional method.
Sensor Node Localization Using Uncontrolled Events
Authors: Ziguo Zhong, Dan Wang, Tian He
Venue: Proceedings of the 2008 The 28th International Conference on Distributed Computing Systems (2008)

Many event-driven localization methods have been proposed as low cost, energy efficient solutions for wireless senor networks. In order to eliminate the requirement of accurately controlled events in existing approaches, we present a practical design using totally uncontrolled events for stationary sensor node positioning. The novel idea of this design is to estimate both the event generation parameters and the location of each sensor node by processing node sequences easily obtained from uncontrolled event distribution. To demonstrate the generality of our design, both straight-line scan and circular wave propagation events are addressed in this paper, and we evaluated our approach through theoretical analysis, extensive simulation and a physical test bed implementation with 41 MICAz motes. The evaluation results illustrate that with only randomly generated events, our solution can effectively localize sensor nodes with excellent flexibility while adding no extra cost at the resource constrained sensor node side. In addition, localization using uncontrolled events provides a nice potential option of achieving node positioning through natural ambient events.
Edge Detection Based on Mathematical Morphology and Iterative Thresholding
Authors: Xiangzhi Bai, Fugen Zhou
Venue: Computational Intelligence and Security: International Conference, CIS 2006, Guangzhou, China, November 3-6, 2006, Revised Selected Papers (2007)

Edge detection is a crucial and basic tool in image segmentation. The key of edge detection in gray image is to detect more edge details, reduce the noise impact to the largest degree, and threshold the edge image automatically. According to this, a novel edge detection method based on mathematic morphology and iterative thresholding is proposed in this paper. A modified morphological transform through regrouping the priorities of several morphological transforms based on contour structuring elements is realized first, and then an edge detector is defined by using the multi-scale operation of the modified morphological transform to detect the gray-scale edge map. Finally, a new iterative thresholding algorithm is applied to obtain the binary edge image. Comparative study with other morphological methods reveals its superiority over de-noising capacity, edge details protection and un-sensitivity to the shape of the structuring elements.
High-radix interconnection networks
Authors: William J. Dally
Venue:  (2008)

Over the past twenty years, the pin bandwidth available to a chip has increased by approximately an order of magnitude every five years&mdash;a rate very similar to Moore's Law. This increasing pin bandwidth can be effectively utilized by creating high-radix routers with large number of skinny ports instead of low-radix routers with fat ports. The use of high-radix routers leads to lower cost and better performance, but high-radix networks present many difficult challenges. This thesis explores challenges in scaling to high-radix routers, including topology, routing, and router microarchitecture.Topology is a critical aspect of any interconnection network as it sets performance bounds and determines the cost of the network. This thesis presents a cost-efficient high-radix topology referred to as the flattened butterfly topology which exploits the availability of high-radix routers. Compared to a folded-Clos topology, the flattened butterfly provides approximately 2&times; reduction in cost per performance on balanced traffic while maintaining the same cost per performance on adversarial traffic pattern. Given the topology, routing determines the path between the source and its destination. Proper routing is required to exploit the path diversity available in a high-radix network and we discuss the advantages of using adaptive routing in high-radix networks as well as how non-minimal routing is critical to properly exploiting the flattened butterfly topology.Conventional microarchitectures do not scale to high radix since the complexity of the allocators in the routers scale quadratically with the radix. This thesis presents a hierarchical router organization that results in a distributed, complexity-effective microarchitecture and maintains high performance. As a case study, the implementation of this microarchitecture in the Cray YARC router with 64 ports will also be presented.With the recent increase in the number of cores on a single-chip, the on-chip interconnection network that connects the on-chip cores and memory together will become more critical in determining the overall performance and cost of the entire chip. In the last part of this thesis, we expand the use of high-radix routers to on-chip networks and show how high-radix routers and the flattened butterfly topology can be mapped to on-chip networks.
Distance Geographic Learning Based on Collaborative Virtual Environment
Authors: Wenhang Li, Jianhua Gong, Daojun Wang, Mingxiang Huang, Jieping Zhou
Venue: Proceedings of the 7th international conference on Computational Science, Part III: ICCS 2007 (2007)

Although collaborative e-learning has been applied in many fields, it is rarely reported in geographic education. This paper describes one prototype of collaborative virtual geographic education environment (CVGEE). The prototype, developed using Java and Java 3D, provides one immersive 3-dimensional environment and many virtual teaching methods including virtual geographic environment, virtual geographic process. Teachers and learners can discuss with each other in a social way by combination virtualization and reality. Group learning and normal teacher-learner relationship can then be realized in CVGEE. An experiment was conducted to test the functions of the CVGEE prototype.
User Interface Personalization for the WWW Using Adaptive Browsing Shortcuts
Authors: Michail Salampasis, Christos Kouroupetroglou, Constantinos Delistavrou
Venue: Proceedings of the 2008 Panhellenic Conference on Informatics (2008)

Intelligent adaptive user interfaces have been long explored as a promising technique to solve problems due to the complexity of modern user interfaces. These problems can occur in various application settings such as accessing the Web from small screen devices, over a Telephone Based Interface or disabled people accessing the WWW using specialised voice web browsers. In this paper we present Adaptive Browsing Shortcuts (ABS), a user interface personalisation mechanism that can be applied in the WWW and which is based on simple and continuous user modelling and monitoring. We discuss various personalisation methods that can be developed upon the idea of ABS and we present an application which utilises browsing shortcuts to increase navigability and information seeking performance of blind people using voice web browsers. Results from user studies are reported which consistently indicate that ABS could provide effective user interface personalisation based on solid user and interaction modelling.
VIM: Taming Software with Hardware
Authors: Mark Halpern
Venue: Computer (2003)

The programming world generally agrees that software should never be written more than once. The author proposes something more radical: Much software doesn't need to be written even once--particularly software devoted to the task of memory management.By giving programmers so much physical memory that they can proceed as if they were working with infinite memory, virtual infinite memory could make all the software dedicated to this task unnecessary. If successfully implemented, this would give applications a practically limitless amount of real memory.
An Algebraic Substructuring Method for High-Frequency Response Analysis of Micro-systems
Authors: Jin Hwan Ko, Zhaojun Bai
Venue: Proceedings of the 7th international conference on Computational Science, Part I: ICCS 2007 (2007)

High-frequency response analysis (Hi-FRA) is required to predict the resonant behavior of modern microsystems operated over a high frequency range. Algebraic substructuring (AS) method is a powerful numerical technique for FRA. However, the existing AS method is developed for low-FRA, say over the range 1Hz---2KHz. In this work, we extend the AS method for FRA over a given frequency range [¿ min ,¿ max ]. Therefore, it can be efficiently applied to systems operated at high frequency, say over the range 1MHz---2MHz. The success of the proposed method is demonstrated by Hi-FRA of a microgyroscope.