ppxscal/embedding_network huggingface dataset:
Analyzing and enhancing the resilience of structured peer-to-peer systems
Authors: Shengquan Wang, Dong Xuan, Wei Zhao
Venue: Journal of Parallel and Distributed Computing (2005)

In this paper, we propose an approach to analyze the resilience of structured peer-to-peer (P2P) systems under failures. The approach is Markov-chain based, and can be applied to systems with relatively stable size and uniform distribution of nodes. We apply our approach to several well-known structured P2P systems. We find that different system features (types of neighbors of nodes) in P2P systems have different impacts on their resilience against failures. Following this observation, we propose to add some extra neighbor(s) to CAN using small-world model principles to form a so-called CAN-SW system. We then apply the proposed approach to analyze its resilience. We find that the performance is improved significantly, particularly, in terms of the average path length.
On advance reservation of heterogeneous network paths
Authors: Chiara Curti, Tiziana Ferrari, Leon Gommans, S. van Oudenaarde, Elisabetta Ronchieri, Francesco Giacomini, Cristina Vistoli
Venue: Future Generation Computer Systems (2005)

The availability of information about properties and status of resources is essential for Grid resource brokers. However, while abstractions of computing and storage resources already exist, the notion of Grid network resource is far from being understood today. As a result, the integration of advanced network services is still difficult when a Grid system spans large-scale heterogeneous network infrastructures. In this paper, we propose a single definition of a Grid network resource abstraction for multiple types of network connectivity. This abstraction was successfully implemented and tested in a network resource management prototype supporting a variety of network technologies.
A theory of error
Authors: Kellyann Geurts
Venue: Proceedings of the 5th conference on Creativity cognition (2005)

Ideas developed in A Theory of Error explore notions of art and corporality, and in particular art representing the brain and mechanisms of thought, reflections about exploring the creative process and considering thought when the brain is simulated through digital imaging.Using personal thought processes as a model, this project explores the creative process resulting from error. Error, not in the mechanical or technical sense, or even in the form of diagnosed mental conflicts, but discussed in terms of cognitive functioning.In this instance the conception of error may be referred to as unpredictable disturbances to thought patterns.Forming a theoretical background to the project are various interwoven theories from cognitive psychology, neuroscience, art and technology that examine the mechanisms of creativity in relation to mutation and disorder, chaos and abstraction [1].A Theory of Error is illustrated through visual metaphors, a weave of text and image, constructing a picture of a thought.
Modeling and control for a Gough-Stewart platform CNC machine
Authors: Yung Ting, Yu-Shin Chen, Ho-Chin Jar
Venue: Journal of Robotic Systems (2004)

In this paper, a complete dynamic model on task space for a 6 degrees of freedom (DOF) Gough-Stewart platform-type computer numerical control (CNC) machine is derived. The rotation terms of the legs are included for those inertia effects cannot be negligible in the machine tool applications. The formulation derived by means of the Euler-Lagrange method is convenient for designing the adaptive control law. Also, the average-type force model for end milling process is derived and included in the dynamic model and control. A composite adaptive control scheme is developed by use of filtering dynamics technique. An appropriate estimator gain is designed in the parameter adaptation law that is useful for estimating the selected important cutting parameters. Experimental results verify the proposed adaptive control scheme can achieve good tracking performance. &copy; 2004 Wiley Periodicals, Inc.
An Algorithm to Find Area and Area Based Feature of Image Objects and Its Application in Image Matching
Authors: M. Ashraful Amin, Nitin V. Afzulpurkar, Shamim Akhter
Venue: Proceedings of the Third International Conference on Image and Graphics (2004)

One of the important issues in image feature is the area of objects in the image. In this paper we propose an area finding algorithm to measure the area of an image object. This method finds the Area by polygonal approximation of image objects. A sequential fine-tuning of this polygon is used to estimate the actual area from polygon area. This area modification sequence is used as a topological description of an image object and used as feature in image matching.
Implementation of the web-based learning in PhD education
Authors: Valentina Terzieva, Katia Todorova, Lilia Simeonova
Venue: Proceedings of the 5th international conference on Computer systems and technologies (2004)

One of the continuing challenges of education is enabling those who attempt to improve teaching and learning to take advantage of the rapidly changing new environment created by information and communication technologies. To do so, educators should engage in re-assessing learning and teaching practices and use new technologies to enhance educational process and support collaboration. This paper has tried to clarify the nature and concept of web-based learning and some of the issues and implications of the learning and teaching within a web-based learning environment.
Data exchange: getting to the core
Authors: Ronald Fagin, Phokion G. Kolaitis, Lucian Popa
Venue: ACM Transactions on Database Systems (TODS) (2005)

Data exchange is the problem of taking data structured under a source schema and creating an instance of a target schema that reflects the source data as accurately as possible. Given a source instance, there may be many solutions to the data exchange problem, that is, many target instances that satisfy the constraints of the data exchange problem. In an earlier article, we identified a special class of solutions that we call universal. A universal solution has homomorphisms into every possible solution, and hence is a &ldquo;most general possible&rdquo; solution. Nonetheless, given a source instance, there may be many universal solutions. This naturally raises the question of whether there is a &ldquo;best&rdquo; universal solution, and hence a best solution for data exchange. We answer this question by considering the well-known notion of the core of a structure, a notion that was first studied in graph theory, and has also played a role in conjunctive-query processing. The core of a structure is the smallest substructure that is also a homomorphic image of the structure. All universal solutions have the same core (up to isomorphism); we show that this core is also a universal solution, and hence the smallest universal solution. The uniqueness of the core of a universal solution together with its minimality make the core an ideal solution for data exchange. We investigate the computational complexity of producing the core. Well-known results by Chandra and Merlin imply that, unless P &equals; NP, there is no polynomial-time algorithm that, given a structure as input, returns the core of that structure as output. In contrast, in the context of data exchange, we identify natural and fairly broad conditions under which there are polynomial-time algorithms for computing the core of a universal solution. We also analyze the computational complexity of the following decision problem that underlies the computation of cores: given two graphs G and H, is H the core of G? Earlier results imply that this problem is both NP-hard and coNP-hard. Here, we pinpoint its exact complexity by establishing that it is a DP-complete problem. Finally, we show that the core is the best among all universal solutions for answering existential queries, and we propose an alternative semantics for answering queries in data exchange settings.
The effect of the Harvard architecture on the teaching of assembly language
Authors: Ward Douglas Maurer
Venue: Journal of Computing Sciences in Colleges (2005)

We present here the description of a first assembly language course which uses chips with a modified Harvard architecture, rather than the usual von Neumann architecture. This means that instruction and data memory are separate, allowing instruction sizes to be unrestricted to multiples of 8. These are microcontroller chips, which are the ones in cars, toys, appliances, and the like. There are more of them today than any other computer, which motivates our interest in teaching them. Also, unlike most computers, they are programmed in assembly language more commonly today than in any other way.
Constructing three-dimensional discrete Voronoi diagrams by the incremental method and application to self-organizing maps
Authors: Takayasu Fuchida, Masayuki Kashima, Hirofumi Nakamura, Kunihiko Mori, Sadayuki Murashima
Venue: Systems and Computers in Japan (2005)

We propose an algorithm to construct a three-dimensional (3D) discrete Voronoi diagram using the incremental method on a digitized space and apply it to measure the topology preservation rate of self-organizing maps. The 3D discrete Voronoi diagram needs many pixels and requires much memory and much time to calculate. In this sense, the fast 3D version of the incremental method on a digitized space is useful. Recently, studies of self-organizing feature maps have made it clear that a close relationship exists between feature extraction and the obtaining of masked Delaunay triangulation of input data. Thus, the Voronoi division is becoming an indispensable technique for the study of self organizing feature maps. &copy; 2005 Wiley Periodicals, Inc. Syst Comp Jpn, 36(5): 55&ndash;67, 2005; Published online in Wiley InterScience (). DOI 10.1002&sol;scj.20205
Use of Support Vector Machines and Neural Network in Diagnosis of Neuromuscular Disorders
Authors: Nihal Fatma Güler, Sabri Koçer
Venue: Journal of Medical Systems (2005)

In this study the performance of support vector machine (SVM)and back-propagation neural network were applied to analyze the classification of the electromyogram (EMG) signals obtained from normal, neuropathy and myopathy subjects. By using autoregressive (AR) modeling, AR coefficients were obtained from EMG signals. Moreover, the support vector machine and artificial neural network (ANN) were used as base classifiers. The AR coefficients were benefited as inputs for SVM and ANN. Besides, these coefficients were tested both in ANN and SVM. The results show that SVM has high anticipation level in the diagnosis of neuromuscular disorders. It is proved that its test performance is high compared with ANN.
Mixture Trees for Modeling and Fast Conditional Sampling with Applications in Vision and Graphics
Authors: Frank Dellaert, Vivek Kwatra, Sang Min Oh
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 1 - Volume 01 (2005)

We introduce mixture trees, a tree-based data-structure for modeling joint probability densities using a greedy hierarchical density estimation scheme. We show that the mixture tree models data efficiently at multiple resolutions, and present fast conditional sampling as one of many possible applications. In particular, the development of this data-structure was spurred by a multi-target tracking application, where memory-based motion modeling calls for fast conditional sampling from large empirical densities. However, it is also suited to applications such as texture synthesis, where conditional densities play a central role. Results will be presented for both these applications.
An approach of visual motion analysis
Authors: Alberto Sanfeliu, Juan J. Villanueva
Venue: Pattern Recognition Letters (2005)

In this article, we describe some aspects of the Visual Motion Analysis, where the focus is on the techniques applied in tracking tasks. First we present a Motion Analysis and Recognition (MAR) framework and then we describe methods at two levels of this framework: Image level and 2D level. We explain techniques of motion analysis using single and multiple cues, describing in the last case several cue integration techniques for robust tracking. In order to illustrate the methods, we show several examples of tracking.
The round complexity of two-party random selection
Authors: Saurabh Sanghvi, Salil Vadhan
Venue: Proceedings of the thirty-seventh annual ACM symposium on Theory of computing (2005)

We study the round complexity of two-party protocols for generating a random n-bit string such that the output is guaranteed to have bounded bias (according to some measure) even if one of the two parties deviates from the protocol (even using unlimited computational resources). Specifically, we require that the output's statistical difference from the uniform distribution on zon is bounded by a constant less than 1.We present a protocol for the above problem that has 2 log*n+O(1) rounds, improving a 2n-round protocol that follows from the work of Goldreich, Goldwasser, and Linial (FOCS'91). Like the GGL protocol, our protocol actually provides a stronger guarantee, ensuring that the output lands in any set T⊆zon of density μ with probability at most O(√μ+δ), where δ is an arbitarily small constant.We then prove a matching lower bound, showing that any protocol guaranteeing bounded statistical difference requires at least log*n - log* log*n-O(1) rounds. As far as we know, this is the first nontrivial lower bound on the round complexity of random selection protocols (of any type) that does not impose additional constraints (e.g. on communication or "simulatability").We also state several results for the case when the output's bias is measured by the maximum multiplicative factor by which a party can increase the probability of a set T ⊆ zon.
Skinning Windows XP
Authors: Joe Habraken
Venue:  (2005)

When you pick out something to wear in the morning, you choose the clothes that best fit your mood and personality that day. Same with the music we listen to and even the cars we drive. We instinctively surround ourselves with the things that are reflective of our personalities, so why not our computers? Skinning Windows XP will show you how to take the Microsoft Windows Graphical User Interface to a whole new visual and functional level. Through step-by-step instructions, you will learn how to customize your Windows XP theme, icons and backgrounds using skinning software. Not sure what skinning software is or where to find it? You'll learn about that, too. You will become familiar with the Windows desktop structure and components and learn how to alter the elements to create a personalized desktop experience. Along with a 16-page, full-color insert with before and after shots of skins for inspiration, Skinning Windows XP will help you technologically express yourself.
Optimization in GCC
Authors: M. Tim Jones
Venue: Linux Journal (2005)

Want to shrink your program's memory requirements, run time or both?
A software tool for automating the design of robot fuzzy force controllers
Authors: K. Burn, G. Home, M. Short, R. Bicker
Venue: Robotica (2005)

This paper describes a software tool to automate a design method for robotic fuzzy force control. The original method was developed to ensure robust and stable force control in situations where environmental stiffness at the robot&#x002F;task interface is unknown, obviating the use of fixed-gain controllers. It did, however, involve a manual design process requiring significant knowledge of control theory and fuzzy logic. This process has been automated in the form of a Windows-based application, requiring minimal user inputs and incorporating an automatic tuning technique for improved performance in the final controller application. Results obtained from an experimental robot are presented.
Analyzing norm emergence in communal sharing via agent-based simulation
Authors: Setsuya Kurahashi, Takao Terano
Venue: Systems and Computers in Japan (2005)

This paper analyzes how the communal sharing norms of the community function in the information society, by using an agent-based simulation of an artificial society. Our simulator TRURL consists of a set of agents provided with individual functions of decision-making and communication. Furthermore, the mechanisms for social evolution by genetic algorithm and a solution search function are prepared. Studies of the emergence and functions of the communal sharing norm have been presented in sociopsychology, using evolutionary game simulations. Interesting phenomena such as the collapse or persistence of norm have been reported. According to the analysis of the net news society in this paper, considering information as property, it is concluded that the appearance of free riders does not lead to the collapse of norms. &copy; 2005 Wiley Periodicals, Inc. Syst Comp Jpn, 36(6): 102&ndash;112, 2005; Published online in Wiley InterScience (). DOI 10.1002&sol;scj.10111
A Conceptual Model for Distributed Aspect-Oriented Software Architectures
Authors: Nour Ali, Isidro Ramos, Jose Angel Carsi
Venue: Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume II - Volume 02 (2005)

Distribution has become a fundamental requirement for information systems and not an auxiliary. We believe it is important to consider distribution from early stages of the life cycle of software development and deal with distribution at a high abstraction level. This paper, presents a conceptual model for specifying software architectures of distributed information systems. The conceptual model is defined by combining the Aspect-Oriented Software Development (AOSD) and the Component-Based Software Development (CBSD). The distribution conceptual model is explained by presenting its AOSD perspective and the CBSD perspective. The AOSD perspective of the conceptual model describes the mobile and replication behaviour of an architectural element by introducing a distribution aspect and a replication aspect. The architectural perspective (CBSD perspective) of the distribution model allows specification of the distributed communication of the architectural elements of a software architecture.
Visualization-enabled multi-document summarization by Iterative Residual Rescaling
Authors: Rie Ando, Branimir Boguraev, Roy Byrd, Mary Neff
Venue: Natural Language Engineering (2005)

This paper describes a novel approach to multi-document summarization, which explicitly addresses the problem of detecting, and retaining for the summary, multiple themes in document collections. We place equal emphasis on the processes of theme identification and theme presentation. For the former, we apply Iterative Residual Rescaling (IRR); for the latter, we argue for graphical display elements. IRR is an algorithm designed to account for correlations between words and to construct multi-dimensional topical space indicative of relationships among linguistic objects (documents, phrases, and sentences). Summaries are composed of objects with certain properties, derived by exploiting the many-to-many relationships in such a space. Given their inherent complexity, our multi-faceted summaries benefit from a visualization environment. We discuss some essential features of such an environment.
iTPS: an improved location discovery scheme for sensor networks with long-range beacons
Authors: Andrew Thaeler, Min Ding, Xiuzhen Cheng
Venue: Journal of Parallel and Distributed Computing (2005)

In this paper, we present time-based positioning scheme (iTPS), a purely localized location detection scheme for sensor networks with long-range beacons. iTPS relies on time difference of arrival (TDoA) of radio frequency (RF) signals measured locally at each sensor to detect range differences from the sensor to four base stations. These range differences are combined to estimate the sensor location through trilateration. iTPS is an improvement over TPS (Cheng et al., IEEE INFOCOM, 2004), which produces two ambiguous position estimates when sensors are close to any base station. iTPS substantially reduces the number of ambiguous estimates and can improve accuracy. Features of iTPS include low communication overhead for sensors, no requirements for time synchronization, low computational overhead due to simple algebraic operations, and high scalability. We conduct extensive simulation to test iTPS and compare it with TPS. The obtained results show that iTPS is an efficient and effective scheme for location discovery in sensor networks with long-range beacon stations.
Simulating the establishment of trust infrastructures in multi-agent systems
Authors: Wiebe K. Wiechers, Semir Daskapan, Willem G. Vree
Venue: Proceedings of the 6th international conference on Electronic commerce (2004)

In this paper we present and simulate a new approach for creating trusted infrastructures within multi agent systems. This bootstrapping protocol initializes a disordered space by turning it into an organized, redundant hierarchical structure, headed by elected security distribution centers with a pool of successors in case of a failure. A simulation was creates of the establishment of this hierarchy to judge both the resulting structure and the process of creation in a varying environment. Networks are tested of different scale, type and topology, with different numbers of malicious agents, intent on disrupting the bootstrapping process.
Concurrent analogue fault simulation, the equation formulation aspect: Research Articles
Authors: Vančo B. Litovski, Ivan V. Litovski, Mark Zwoliński
Venue: International Journal of Circuit Theory and Applications (2004)

Fault simulation is an essential tool for developing test patterns for circuits. Because the potential number of faults in a circuit is potentially very large, computational efficiency is an important consideration. In the digital domain, concurrent fault simulation is well-established as an efficient tool. For analogue circuits, fault simulation is often performed by repeated insertion of possible faults and resimulation of the circuit. Consequently, methods for efficient concurrent analogue fault simulation are attracting attention. A review of existing methods of concurrent analogue fault simulation shows that most are based on a similar fundamental perturbation of the original fault-free circuit equations, although the methods differ in the procedure applied after the circuit equations are formulated. We develop here a comprehensive set of element stamps, describing faulty elements, enabling effective and routine equation formulation for faulty circuits. These may be used no matter what method of fault simulation is later applied. These stamps are used in a new technique for concurrent analogue fault simulation, based on modified nodal analysis. A significant improvement in efficiency, compared with other methods, is demonstrated. Copyright &copy; 2004 John Wiley & Sons, Ltd.
Distributed Topology Control of Wireless Networks
Authors: Vivek S. Borkar, D. Manjunath
Venue: Proceedings of the Third International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (2005)

We propose and analyze a distributed control law that will maintain prescribed local properties of a wireless ad hoc network in the presence of node mobility, MAC layer power control and link fades. The control law uses a simple and intuitive power adaptation mechanism. We consider as an example the topology requirement of maintaining the out degrees of each node at prescribed values and keeping the in degree close to the out degree. The topology objective is achieved by adapting the transmission power based only on local information. This power adaptation algorithm is analyzed using the o.d.e. approach to stochastic approximation. Simulation results verify the analysis and demonstrate its effectiveness. We also study the ability of the proposed objective to maintain connectivity. Although many heuristics are described in the literature to maintain local topological properties, the algorithm proposed in this paper is the first one that has proven convergence properties.