ppxscal/embedding_network huggingface dataset:
Iterated Impact Dynamics of N-Beads on a Ring
Authors: Bryan Cooley, Paul K. Newton
Venue: SIAM Review (2005)

When N-beads slide along a frictionless hoop, their collision sequence gives rise to a dynamical system that can be studied via matrix products. It is of general interest to understand the distribution of velocities and the corresponding eigenvalue spectrum that a given collision sequence can produce. We formulate the problem for general N and state some basic theorems regarding the eigenvalues of the collision matrices and their products. The case of three beads of masses m1, m2, m3 is studied in detail. We exploit the fact that each collision sequence can be viewed as a billiard trajectory in a right triangle with non-standard reflection rules. Existence of families of periodic orbits are proven, and orbits that densely fill the triangle are computed. Eigenvalue distributions and position and velocity histograms are computed as a function of the restitution coefficient, both periodic and dense collision sequences are discussed, and a series of conjectures based on computational evidence are formulated. Comparisons are made between the eigenvalue distributions and autocorrelation matrices associated with dense trajectories generated from a chaotic collision sequence and spectra from matrix sequences generated from random orderings, and we describe how the three-bead system could be used as the basis for a random number generating algorithm that is computationally efficient.
Fuzzy Clustering with a Regularized Autoassociative Neural Network
Authors: Alejandro Bassi, Juan D. Velasquez, Hiroshi Yasuda
Venue: Proceedings of the Fourth International Conference on Hybrid Intelligent Systems (2004)

We propose a fuzzy clustering method that relies on an artificial neural network scheme based on an encoder-decoder architecture with autoassociative training. The encoder is designed to implement a set of competing fuzzy membership functions which are trained to fit the data so that the decoder reconstruction error is minimized. In order to enforce a suitable cluster partitioning and membership distribution, the critical factor of the method is an entropy based regularization that constrains the encoder outputs. We present the results of our approach applied to synthetic data sets featuring both disjoin and intersecting compact clusters.
Ethical design issues in cyberspace
Authors: Andries Barnard, Laurette Pretorius
Venue: Proceedings of the 4th international symposium on Information and communication technologies (2005)

In this paper we discuss the OSI model and an extension thereof, as well as an agent design framework as complementing design methodologies in cyberspace. We explore some ethical issues prevalent in the OSI model and its extension and in the agent design framework. We conclude that this model and framework may constitute complementary bases for exploring ethical design issues in cyberspace.
An introduction to producing surrealistic visualizations for physics, math, and computer science
Authors: Stuart L. Hutton, David L. Sonnier
Venue: Journal of Computing Sciences in Colleges (2005)

In this workshop, a lecture will be presented along with a demonstration of the basics of producing surrealistic visualization for instruction in Physics, Math, and Computer Science. The approach to be demonstrated involves use of a combination of software packages which are readily available, although not free. Topics to be covered include insertion of objects, shading of objects, formula morphing, text insertion, scene insertion and how to use a physics engine in order to provide active animation for the visualization. Rendering of constructed scenes into a completed movie file and compression into a format for efficient internet delivery will be shown.
A user-friendly marketing decision support system for the product line design using evolutionary algorithms
Authors: Georgia Alexouda
Venue: Decision Support Systems (2005)

A marketing decision support system (MDSS) is presented. It has a user-friendly and easy to learn menu driven interface. Its purpose is to assist a marketing manager in designing a line of substitute products. Optimal product line design is a very important marketing decision. The MDSS uses three different optimization criteria. It examines different scenarios using the "What if analysis". Also, it finds optimal solutions only for small sized problems using the complete enumeration method and near optimal solutions for real sized problems using evolutionary algorithms. The user is not forced to be familiar with the underlying models.
Resilient Localization for Sensor Networks in Outdoor Environments
Authors: YoungMin Kwon, Kirill Mechitov, Sameer Sundresh, Wooyoung Kim, Gul Agha
Venue: Proceedings of the 25th IEEE International Conference on Distributed Computing Systems (2005)

The process of computing the physical locations of nodes in a wireless sensor network is known as localization. Self-localization is critical for large-scale sensor networks because manual or assisted localization is often impractical due to time requirements, economic constraints or inherent limitations of deployment scenarios. We have developed a service for reliably localizing wireless sensor networks in environments conducive to ranging errors by using a custom hardware-software solution for acoustic ranging and a family of self-localization algorithms. The ranging solution improves on previous work, extending the practical measurement range threefold (20-30m) while maintaining a distance-invariant median measurement error of about 1% of maximum range (33cm). The localization scheme is based on least squares scaling with soft constraints. Evaluation using ranging results obtained from sensor network field experiments shows that the localization scheme is resilient against large-magnitude ranging errors and sparse range measurements, both of which are common in large-scale outdoor sensor network deployments.
Accessibility: a Web engineering approach
Authors: Peter Plessers, Sven Casteleyn, Yeliz Yesilada, Olga De Troyer, Robert Stevens, Simon Harper, Carole Goble
Venue: Proceedings of the 14th international conference on World Wide Web (2005)

Currently, the vast majority of web sites do not support accessibility for visually impaired users. Usually, these users have to rely on screen readers: applications that sequentially read the content of a web page in audio. Unfortunately, screen readers are not able to detect the meaning of the different page objects, and thus the implicit semantic knowledge conveyed in the presentation of the page is lost. One approach described in literature to tackle this problem, is the Dante approach, which allows semantic annotation of web pages to provide screen readers with extra (semantic) knowledge to better facilitate the audio presentation of a web page. Until now, such annotations were done manually, and failed for dynamic pages. In this paper, we combine the Dante approach with a web design method, WSDM, to fully automate the generation of the semantic annotation for visually impaired users. To do so, the semantic knowledge gathered during the design process is exploited, and the annotations are generated as a by-product of the design process, requiring no extra effort from the designer.
An Effective Algorithm for the Futile Questioning Problem
Authors: Anja Remshagen, Klaus Truemper
Venue: Journal of Automated Reasoning (2005)

In the futile questioning problem, one must decide whether acquisition of additional information can possibly lead to the proof of a conclusion. Solution of that problem demands evaluation of a quantified Boolean formula at the second level of the polynomial hierarchy. The same evaluation problem, called Q-ALL SAT, arises in many other applications. In this paper, we introduce a special subclass of Q-ALL SAT that is at the first level of the polynomial hierarchy. We develop a solution algorithm for the general case that uses a backtracking search and a new form of learning of clauses. Results are reported for two sets of instances involving a robot route problem and a game problem. For these instances, the algorithm is substantially faster than state-of-the-art solvers for quantified Boolean formulas.
Mobility improves coverage of sensor networks
Authors: Benyuan Liu, Peter Brass, Olivier Dousse, Philippe Nain, Don Towsley
Venue: Proceedings of the 6th ACM international symposium on Mobile ad hoc networking and computing (2005)

Previous work on the coverage of mobile sensor networks focuses on algorithms to reposition sensors in order to achieve a static configuration with an enlarged covered area. In this paper, we study the dynamic aspects of the coverage of a mobile sensor network that depend on the process of sensor movement. As time goes by, a position is more likely to be covered; targets that might never be detected in a stationary sensor network can now be detected by moving sensors. We characterize the area coverage at specific time instants and during time intervals, as well as the time it takes to detect a randomly located stationary target. Our results show that sensor mobility can be exploited to compensate for the lack of sensors and improve network coverage. For mobile targets, we take a game theoretic approach and derive optimal mobility strategies for sensors and targets from their own perspectives.
Human and social factors of software engineering
Authors: Michael John, Frank Maurer, Bjørnar Tessem
Venue: Proceedings of the 27th international conference on Software engineering (2005)

No abstract available
A design of flash memory file system for embedded systems
Authors: Noritaka Ishizumi, Keizo Saisho, Akira Fukuda
Venue: Systems and Computers in Japan (2004)

Flash memory, which has advantages of nonvolatility, high density, little power consumption, and low cost, has been employed as memory device for small and portable embedded devices. Flash memory, however, is slower in writing data compared with volatile semiconductor memory such as DRAM, and requires a time-consuming block erase operation for data rewriting. The block erase operation should be avoided as far as possible because there is a limit in the number of erases. In this paper, a file system for flash memory that realizes high-speed data access and high durability is proposed, and designed and implemented. Specifically speaking, the life of flash memory is prolonged by using linked lists for file management to avoid concentration of rewriting on specific erase blocks. Furthermore, write operations are speeded-up by writing only the difference in update, and the number of block erase operations is reduced by updating links through appending operations. The result of experiments showed that concentration of block erase operations on specific blocks, which is normal in conventional table management methods, could be avoided by using linked lists for file management. Appending operations produced little degradation of storage usage even if the file size was fairly smaller compared with the size of an erase block. However, there were cases where multiple garbage collections were required in file writing, and it took several times longer than usual cases. Thus, it is necessary to improve file writing for practical application. &copy; 2003 Wiley Periodicals, Inc. Syst Comp Jpn, 35(1): 91&ndash;100, 2004; Published online in Wiley InterScience (). DOI 10.1002&sol;scj.1227
Tone Reproduction: A Perspective from Luminance-Driven Perceptual Grouping
Authors: Hwann-Tzong Chen, Tyng-Luh Liu, Tien-Lung Chang
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 2 - Volume 02 (2005)

We address the tone reproduction problem by integrating local adaptation with global-contrast consistency. Many previous works have tried to compress high-dynamic-range (HDR) luminances into a displayable range in imitation of the local adaptation mechanism of human eyes. Nevertheless, while the realization of local adaptation is not theoretically defined, exaggerating such effects often causes unnatural global contrasts. We propose a luminance-driven perceptual grouping process to derive a sparse representation of HDR luminances, and use the grouped regions to approximate local properties of luminances. The advantage of incorporating a sparse representation is twofold: We can simulate local adaptation based on region information, and subsequently apply piecewise tone mappings to monotonize the relative brightness over only a few perceptually significant regions. Our experimental results show that the proposed framework gives a good balance in preserving local details and maintaining global contrasts of HDR scenes.
Home Networking Simplified
Authors: Jim Doherty, Neil Anderson
Venue:  (2005)

An illustrated home networking handbook for the everyday userBuilding a network doesn't have to be all work and no play-it can actually be fun! Home Networking Simplified is an illustrated home-networking book for everyone from Grandma Mary to your tech-savvy teenage neighbor.Home Networking Simplified gives you the most basic need-to-know info and then teaches you how to get the most out of your home network: Learn the basics of home networking, from connecting to the Internet to connecting your computers Create a basic home network Grow and update your network with confidence Secure your home network and protect yourself from hackers and viruses Go wireless to put your computers where you want them-not just where cables reach Learn about the latest technologies, emerging trends, and coolest toysWhether you're a newbie, a geek, or someone in-between, Home Networking Simplified helps you harness the power of home networking.Debugged by The Geek SquadThis book is part of the Networking Technology Series from Cisco Press®, the only authorized publisher for Cisco Systems®.
Solving ODEs and DDEs with residual control
Authors: L. F. Shampine
Venue: Applied Numerical Mathematics (2005)

We first consider the numerical integration of ordinary differential equations (ODEs) with Runge-Kutta methods that have continuous extensions. For some methods of this kind we develop robust and inexpensive estimates of both the local error and the size of the residual. We then develop an effective program, ddesd, to solve delay differential equations (DDEs) with time- and state-dependent delays. To get reliable results for these difficult problems, the code estimates and controls the size of the residual. The user interface of ddesd makes it easy to formulate and solve DDEs, even those with complications like event location and restarts.
Accurate and Efficient Stereo Processing by Semi-Global Matching and Mutual Information
Authors: Heiko Hirschmuller
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 2 - Volume 02 (2005)

This paper considers the objectives of accurate stereo matching, especially at object boundaries, robustness against recording or illumination changes and efficiency of the calculation. These objectives lead to the proposedSemi-Global Matching method that performs pixelwise matching based on Mutual Information and the approximation of a global smoothness constraint. Occlusions are detected and disparities determined with sub-pixel accuracy. Additionally, an extension for multi-baseline stereo images is presented. There are two novel contributions. Firstly, a hierarchical calculation of Mutual Information based matching is shown, which is almost as fast as intensity based matching. Secondly, an approximation of a global cost calculation is proposed that can be performed in a time that is linear to the number of pixels and disparities. The implementation requires just 1 second on typical images.
Towards Composable and Extensible Network Simulation
Authors: Hung-Ying Tyan, Ahmed Sobeih, Jennifer C. Hou
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 10 - Volume 11 (2005)

In this paper, we present the design methodology, and the software architecture, of J-Sim, an open-source network simulation/emulation environment that has been developed, in part, under the support of the NSF Next Generation Software program. We first give an overview of the component-based software architecture, called the autonomous component architecture (ACA), that is used as the underlying architecture for J-Sim. Then we describe how we lay a generalized packetbased network simulation framework, called Extensible Internetworking Framework (INET), on top of ACA. Both the ACA and the INET have been implemented in Java. The resulting codes, along with an essential suite of network protocols and compoents (for the Internet best-effort/integrated services/differentiated services architecture) its extension for wireless and sensor networks, and a scripting framework and GUI interfaces, is called J-Sim. To demonstrate the composability and extensibility of J-Sim, we elaborate on how we model in J-Sim several different network architectures, namely the Differentiated Services (diffserv) architecture, the Multiprotocol Label Switching (MPLS) architecture, and the wireless sensor network architecture.
WISDOM: Web Intrapage Informative Structure Mining Based on Document Object Model
Authors: Hung-Yu Kao Jan-Ming Ho, Ming-Syan Chen
Venue: IEEE Transactions on Knowledge and Data Engineering (2005)

To increase the commercial value and accessibility of pages, most content sites tend to publish their pages with intrasite redundant information, such as navigation panels, advertisements, and copyright announcements. Such redundant information increases the index size of general search engines and causes page topics to drift. In this paper, we study the problem of mining intrapage informative structure in news Web sites in order to find and eliminate redundant information. Note that intrapage informative structure is a subset of the original Web page and is composed of a set of fine-grained and informative blocks. The intrapage informative structures of pages in a news Web site contain only anchors linking to news pages or bodies of news articles. We propose an intrapage informative structure mining system called WISDOM (Web Intrapage Informative Structure Mining based on the Document Object Model) which applies Information Theory to DOM tree knowledge in order to build the structure. WISDOM splits a DOM tree into many small subtrees and applies a top-down informative block searching algorithm to select a set of candidate informative blocks. The structure is built by expanding the set using proposed merging methods. Experiments on several real news Web sites show high precision and recall rates which validates WISDOM's practical applicability.
Optimal parallel algorithm for the knapsack problem without memory conflicts
Authors: Ken-Li Li, Ren-Fa Li, Qing-Hua Li
Venue: Journal of Computer Science and Technology (2004)

The knapsack problem is well known to be NP-complete. Due to its importance in cryptosystem and in number theory, in the past two decades, much effort has been made in order to find techniques that could lead to practical algorithms with reasonable running time. This paper proposes a new parallel algorithm for the knapsack problem where the optimal merging algorithm is adopted. The proposed algorithm is based on an EREW-SIMD machine with shared memory. It is proved that the proposed algorithm is both optimal and the first without memory conflicts algorithm for the knapsack problem. The comparisons of algorithm performance show that it is an improvement over the past researches.
Consistent Code Generation from UML Models
Authors: Quan Long, Zhiming Liu, Xiaoshan Li, He Jifeng
Venue: Proceedings of the 2005 Australian conference on Software Engineering (2005)

Relational Calculus of Object Systems (rCOS) is an OO-language which is equipped with an observation-oriented semantics and a refinement calculus based on the Hoare and Heýs Unifying Theories of Programming (UTP). In this paper, we give syntactic definitions for class diagrams and sequence diagrams in UML 2.0. Based on these definitions, we give an algorithm for checking the consistency of a class diagram and a sequence diagram. Furthermore, we develop an algorithm to generate rCOS code from any given consistent class diagram and sequence diagram.
Requester-centered composition of business processes from internal and external services
Authors: Günter Preuner, Michael Schrefl
Venue: Data Knowledge Engineering (2005)

Successful processing of an organization's business cases often requires the execution of external (web) services that must be performed next to the organization's internal business processes. External services may be single activities or, more often, processes with arbitrary complexity.An organization usually handles its business cases in a similar way, i.e., requests the same or similar external services. In order to support automatization of process execution, a composite process should be defined that provides a complete overview of overall processing at different levels of detail and allows to control processing of business cases at runtime, i.e., to invoke activities in external services where necessary and to observe processing at service providers' sites as far as supported by the services. For properly combining services, interrelationships between them must be identified.This paper presents formal correctness criteria for composite services with respect to the definition of the involved services and introduces a method for defining correct composite services.
Least privilege and privilege deprivation: towards tolerating mobile sink compromises in wireless sensor networks
Authors: Wensheng Zhang, Hui Song, Sencun Zhu, Guohong Cao
Venue: Proceedings of the 6th ACM international symposium on Mobile ad hoc networking and computing (2005)

Mobile sinks are needed in many sensor network applications for efficient data collection, data querying, localized sensor reprogramming, identifying and revoking compromised sensors, and other network maintenance. Employing mobile sinks however raises a new security challenge: if a mobile sink is given too many privileges, it will become very attractive for attack and compromise. Using a compromised mobile sink, an adversary may easily bring down or even take over the sensor network. Thus, security mechanisms that can tolerate mobile sink compromises are essential. In this paper, based on the principle of least privilege, we first propose several efficient schemes to restrict the privilege of a mobile sink without impeding its capability of carrying out any authorized operations for an assigned task. To further reduce the possible damages caused by a compromised mobile sink, we then propose efficient message forwarding schemes for depriving the privilege assigned to a compromised mobile sink immediately after its compromise has been detected. Through detailed analysis and simulations, we show that our schemes are secure and efficient, and are highly practical for sensor networks consisting of the current generation of sensors.