ppxscal/embedding_network huggingface dataset:
Hierarchical grid location management for large wireless Ad hoc networks
Authors: Sumesh J. Philip, Chunming Qiao
Venue: ACM SIGMOBILE Mobile Computing and Communications Review (2003)

Recently, a new family of protocols has been introduced for large scale ad hoc networks that make use of the approximate location of nodes in the network for geographic routing. Location management plays an important role in such protocols, and in this paper, we propose a deterministic hierachical scheme for managing the location information of nodes, and analyze the cost of such a scheme via probabilistic means and simulations. We find that the cost of hierarchical location management has an asymptotic overhead cost of O(&nu; N log 2N) for location registration, which is asymptotically lower than the location management overhead in protocols described in literature, and thus scales well with the increase in the number of nodes in the network.
Reducing Cognitive Load
Authors: Luz M. Quiroga, Martha E. Crosby, Marie K. Iding
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 5 - Volume 5 (2004)

This paper explores issues related to cognitive load in the contexts of learning, information filtering, user modeling, categorization and personal information organizing behavior. We incorporate expertise from the fields of information science, educational psychology and computer science to report research that can ultimately influence the design of personalizedadaptive systems.
When users push back: oppositional new media and community
Authors: Leah A. Lievrouw
Venue: Communities and Technologies (2003)

The progressive privatization of Internet infrastructure in the U.S. throughout the 1990s fostered the resurgence of a mass media-style "pipeline" model of online content distribution favored by the media and entertainment industries. Nonetheless, and despite various attempts at suppression by corporations and law enforcement, a diverse community of artists, activists and citizens has found the Web and related technologies to be effective media for expressing their ideas and interests. In this paper oppositional new media are examined as a means of response and resistance to a popular culture that many groups regard as dominated by consumerism, political apathy and cultural and economic oppression. Cases are presented to illustrate key genres of oppositional new media, including the responses of mainstream corporate, government and law- enforcement authorities. The paper concludes with an overview of characteristics of oppositional new media and their implications for establishing and maintining community.
Model-based Clustering with Soft Balancing
Authors: Shi Zhong, Joydeep Ghosh
Venue: Proceedings of the Third IEEE International Conference on Data Mining (2003)

Balanced clustering algorithms can be useful in a varietyof applications and have recently attracted increasing researchinterest. Most recent work, however, addressed onlyhard balancing by constraining each cluster to have equalor a certain minimum number of data objects. This paperprovides a soft balancing strategy built upon a soft mixture-of-models clustering framework. This strategy constrains the sum of posterior probabilities of object membership foreach cluster to be equal and thus balances the expectednumber of data objects in each cluster. We first derive softmodel-based clustering from an information-theoretic viewpointand then show that the proposed balanced clusteringcan be parameterized by a temperature parameter that controlsthe softness of clustering as well as that of balancing.As the temperature decreases, the resulting partitioning becomesmore and more balanced. In the limit, when temperaturebecomes zero, the balancing becomes hard and theactual partitioning becomes perfectly balanced. The effectivenessof the proposed soft balanced clustering algorithmis demonstrated on both synthetic and real text data.
Anti-run-dry algorithm for optimal control of playoutbuffers
Authors: Brita H. Hafskjold
Venue: Proceedings of the 1st international symposium on Information and communication technologies (2003)

Receiver playoutbuffers are required to smooth network delay variations for multimedia streams. The two most commonly used playoutbuffer algorithms are called Fixed Playout Delay, where all packets have the same end-to-end delay and Adaptive Playout Delay, which uses between-talk-spurt-adjustment, where a new value of end-to-end delay is calculated for each new talkspurt. For long talkspurts and for streaming of multimedia, within-talk-spurt-adjustment, where the playout speed is controlled, can give a lower mean end-to-end delay and fewer packets that are lost due to late arrivals. By the use of optimal control theory, a statistically optimal control of the playout speed can be calculated. Like other buffer control algorithms, the optimal control solution has no guarantee that the buffer will not run dry. This paper introduces an anti-run-dry algorithm that gives a controllable run dry probability. We demonstrate the performance of the anti-run-dry algorithm together with the optimal control algorithm by using a simulated network and a real Internet packet trace. This is compared to the performance of Adaptive Playout Delay and of one of the existing within-talkspurt-adjustment algorithms.
Cartels via the modiclus
Authors: Joachim Rosenmüller, Peter Sudhölter
Venue: Discrete Applied Mathematics (2004)

We discuss market games or linear production games with finite sets of players. The representing distributions of initial assignments are assumed to have disjoint carriers. Thus, the agents decompose into finitely many disjoint groups each of which hold a corner of the market. In such a market traditional solution concepts like the core tend to favor the short side of the market excessively. We exhibit a solution concept which is more sensitive with respect to the preventive power of the long side. Thereby, profits of the long side are now feasible. This concept is the modified nucleolus or modiclus. Within certain limits, it predicts cartelization and assigns a "fair share" for cartels on the long side of the market. Also, it organizes the internal distribution for a specific cartel according to the "contested garment solution" of Aumann-Maschler.
A bag of paths model for measuring structural similarity in Web documents
Authors: Sachindra Joshi, Neeraj Agrawal, Raghu Krishnapuram, Sumit Negi
Venue: Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining (2003)

Structural information (such as layout and look-and-feel) has been extensively used in the literatuce for extraction of interesting or relevant data, efficient storage, and query optimization. Traditionally, tree models (such as DOM trees) have been used to represent structural information, especially in the case of HTML and XML documents. However, computation of structural similarity between documents based on the tree model is computationally expensive. In this paper, we propose an alternative scheme for representing the structural information of documents based on the paths contained in the corresponding tree model. Since the model includes partial information about parents, children and siblings, it allows us to define a new family of meaningful (and at the same time computationally simple) structural similarity measures. Our experimental results based on the SIGMOD XML data set as well as HTML document collections from ibm.com, dell.com, and amazon.com show that the representation is powerful enough to produce good clusters of structurally similar pages.
Model Continuity to Support Software Development for Distributed Robotic Systems: A Team Formation Example
Authors: Xiaolin Hu, Bernard P. Zeigler
Venue: Journal of Intelligent and Robotic Systems (2004)

Modeling, design and testing of the software underlying distributed robotic systems is a challenging task, especially when a large number of mobile robots and task coordination are involved. Model continuity, the ability to use the same model of a system throughout its design phases, provides an effective way to manage this development complexity and maintain consistency of the software. In this paper, we describe the design and implementation of a team-formation multi-robot system. This is used as an example to demonstrate how a modeling and simulation environment, based on the DEVS formalism, can support model continuity in the design of distributed robotic systems. This example shows how the intelligent control models of the robots are first designed and tested via simulation and, when verified mapped to physical robots with DEVS-on-a-chip &ldquo;brains&rdquo; for execution.
Multipole-based preconditioners for large sparse linear systems
Authors: Sreekanth R. Sambavaram, Vivek Sarin, Ahmed Sameh, Ananth Grama
Venue: Parallel Computing (2003)

Dense operators for preconditioning sparse linear systems have traditionally been considered infeasible due to their excessive computational and memory requirements. With the emergence of techniques such as block low-rank approximations and hierarchical multipole approximations, the cost of computing and storing these preconditioners has reduced dramatically. This paper describes the use of multipole operators as parallel preconditioners for sparse linear systems. Hierarchical multipole approximations of explicit Green's functions are effective preconditioners due to their bounded-error properties. By enumerating nodes in proximity preserving order, one can achieve high parallel efficiency in computing matrix-vector products with these dense preconditioners. The benefits of the approach are illustrated on the Poisson problem and the generalized Stokes problem arising in incompressible fluid flow simulations. Numerical experiments show that the multipole-based techniques are effective preconditioners that can be parallelized efficiently on multiprocessing platforms.
Symmetric Codes over Rings
Authors: André Barbé, Fritz von Haeseler
Venue: SIAM Journal on Discrete Mathematics (2004)

Shannon suggested investigating a binary multiplying channel and asked for a maximal uniquely decodable symmetric code. Motivated by his example, we define such a code, called a Shannon set, for an arbitrary ring. We investigate the Shannon sets for the rings $\F_q^{n\times n}$ for $n\in\N$, and the rings $\Z_m=\Z/(m\Z)$ for $m\in \N$.
System Design Using Kahn Process Networks: The Compaan/Laura Approach
Authors: Todor Stefanov, Claudiu Zissulescu, Alexandru Turjan, Bart Kienhuis, Ed Deprettere
Venue: Proceedings of the conference on Design, automation and test in Europe - Volume 1 (2004)

New emerging embedded system platforms in the realm of high-throughput multimedia, imaging, and signal processing will consist of multiple microprocessors and reconfigurable components. One of the major problems is how to program these platforms in a systematic and automated way so as to satisfy the performance need of applications executed on these platforms.In this paper, we present our system design approach as an efficient solution to this programming problem. We show how for an application written in Matlab, a Kahn Process Network specification can automatically be derived and systematically mapped onto a target platform composed of a microprocessor and an FPGA. Furthermore, we illustrate how the mapping approach is applied on a real-life example, namely an M-JPEG encoder.
IF-THEN-ELSE considered harmful
Authors: Gerald M. Weinberg, Dennis P. Geller, Thomas W. S. Plum
Venue: ACM SIGPLAN Notices (1975)

Although the if-then-else construct for flow of control is simple in some senses, and certainly superior to unrestricted GO TO logic, the indefinite replication of this structure leads to undesireable program constructs. Other, more extensible control structures may be added to programming languages, while regulating the unrestricted use of if-then-else, in such a way as to reduce the complexity of programs.
Mobility and the first responder
Authors: Steve Sawyer, Andrea Tapia, Leonard Pesheck, John Davenport
Venue: Communications of the ACM (2004)

Supporting secure wireless access to databases via public telecommunications infrastructure.
Trim Bit Setting of Analog Filters Using Wavelet-Based Supply Current Analysis
Authors: Swarup Bhunia, Arijit Raychowdhury, Kaushik Roy
Venue: Proceedings of the conference on Design, automation and test in Europe - Volume 1 (2004)

Wavelet transform has the property of resolving signal in both time and frequency unlike Fourier transform. In this work, we show that time-domain information obtained from wavelet analysis of supply current can be used to efficiently trimanalog filters. The pole/zero locations in the frequency response of analog filters shift due to change in component values with process variations. Wavelet analysis of supply current can be a promising alternative to test frequency specification of analog filters, since it needs only one test stimulus and is virtually unaffected by transistor threshold variation. Simulation results on two test circuits demonstrate that we can estimate pole/zero shift with less than 3% error.
A Scalable ODC-Based Algorithm for RTL Insertion of Gated Clocks
Authors: Pietro Babighian, Luca Benini, Enrico Macii
Venue: Proceedings of the conference on Design, automation and test in Europe - Volume 1 (2004)

This paper describes a new automatic clock-gating extraction working at the RT-level. The key features of our approach are: (i) Seamless merging with existing industrial design flows and commercial tools; (ii) High scalability to deal with large circuits; (iii) Improved quality of results with respect to available commercial tools; (iv) Smaller and well-controled overhead in speed and area. Experimental results, on a set of industrial RTL designs, demonstrate the viability and practical impact of our approach.
Multi-Project Management in Software Engineering Using Simulation Modelling
Authors: Bengee Lee, James Miller
Venue: Software Quality Control (2004)

Multi-project management is crucial in Software Engineering as it draws the resources from common pools, affects the completion date of other projects, determines the priority of use of resources among various projects, involves the judgment of multi-tasking of a common resource, and eventually, determines the success or failure of the projects. Hence, this paper argues that a formal simulation model using System Dynamics principles should be built to study the dynamics of software multi-project management. However, System Dynamics modelling by itself lacks the capability to construct the multi-project network, and thus confines the use of simulation in a single project environment. Thus, this paper is proposing an integration of the System Dynamics model with a multi-project network constructing method, called Critical Chain Project Management (CCPM). CCPM, not only constructs the network, but also recognizes the interdependencies of the multiple projects. However, the combination of these two principles does not simulate unexpected situations, change of policies and strategies that may be encountered during the project development. Hence, a Scenario model is proposed to be integrated with the System Dynamics and CCPM. With such integration, the project manager can identify the restraining factors in various possible scenarios in the multi-project environment, and provide feasible solutions to the senior management.
Towards digital narrative for children: from education to entertainment, a historical perspective
Authors: Krystina Madej
Venue: Computers in Entertainment (CIE) (2003)

Narrative is central to human experience, and a key way that experience is made meaningful. Education and entertainment have both played a significant part in the evolution of children's narrative. In its liminal state during the 1500s, children's print narrative was primarily educational. Locke's theories of education in the 1700s encouraged "children playing and doing as children," and narrative slowly moved towards being entertaining as well as educational. Not until the 1800s, with the stories of Lewis Carroll, was narrative created solely for the entertainment of children. Throughout its development it has provided a way for shaping children's experience, reflecting how they fit into their society, and helping them construct meaning for themselves. As narrative evolved to find its rightful place in the mix of technology, education, and entertainment within children's print culture, so it is evolving within the rapidly developing digital environment. Authors, publishers, and producers are responsible for understanding how children respond to a digital environment, and for making the digital narrative a positive experience. This paper presents the history of children's literature as it has developed from oral tradition through print and now into digital environments. It draws parallels, particularly between education and entertainment, in children's print narratives and similar (but more rapid) developments in the evolution of digital narratives. In doing so, it aims to encourage a more positive attitude to the significant opportunities new technologies offer for reshaping the way in which narrative for children is conceived and presented so that it continues in its time honored role of constructing meaning in their lives.
Applying data mining to software maintenance records
Authors: Jelber Sayyad Shirabad, Timothy C. Lethbridge, Stan Matwin
Venue: Proceedings of the 2003 conference of the Centre for Advanced Studies on Collaborative research (2003)

In a system maintained over a long time period, as is the case for legacy software, there will be many unknown and non-trivial relationships among components. Finding such hidden relationships may help software engineers in their maintenance activities. In this paper we present an approach whereby we mine software update records to find relationships between files that are changed together. The generalized models we present as results are obtained by using features extracted from different sources of knowledge such as source code and problem reports. The predictive quality of some of the generated models suggest that they can be deployed to be used in a real world setting. The paper also includes the results of analyzing the structure of some of the best models obtained.
The insulation sequence of a graph
Authors: Elena Grigorescu
Venue: Discrete Applied Mathematics (2004)

In a graph G, a k-insulated set S is a subset of the vertices of G such that every vertex in S is adjacent to at most k vertices in S, and every vertex outside S is adjacent to at least k + 1 vertices in S. The insulation sequence i0, i1, i2,... of a graph G is defined by setting ik equal to the maximum cardinality of a k-insulated set in G. We determine the insulation sequence for paths, cycles, fans, and wheels. We also study the effect of graph operations, such as the disjoint union, the join, the cross product, and graph composition, upon k-insulated sets. Finally, we completely characterize all possible orderings of the insulation sequence, and prove that the insulation sequence is increasing in trees.
The SPRING Hand: Development of a Self-Adaptive Prosthesis for Restoring Natural Grasping
Authors: M. C. Carrozza, C. Suppo, F. Sebastiani, B. Massa, F. Vecchi, R. Lazzarini, M. R. Cutkosky, P. Dario
Venue: Autonomous Robots (2004)

Commercially available prosthetic hands are simple grippers with one or two degrees of freedom; these pinch type devices have two rigid fingers in opposition to a rigid thumb. This paper focuses on an innovative approach for the design of a myoelectric prosthetic hand. The new prosthesis features underactuated mechanisms in order to achieve a natural grasping behavior and a good distribution of pinching forces. In this paper it is shown that underactuation allows reproducing most of the grasping behaviors of the human hand, without augmenting the mechanical and control complexity.
Restricted t-matchings in bipartite graphs
Authors: András Frank
Venue: Discrete Applied Mathematics (2003)

Given a simple bipartite graph G and an integer t ≥ 2, we derive a formula for the maximum number of edges in a subgraph H of G so that H contains no node of degree larger than t and H contains no complete bipartite graph Kt,t as a subgraph. In the special case t = 2 this fomula was proved earlier by Király (Square-free 2-matching in bipartite graphs, Technical Report of Egerváry Research Group, TR-2001013, November 1999 (www.cs.elte.hu/egres)), sharpening a result of Hartvigsen (in: G. Cornuejols, R. Burkard, G.J. Woeginger (Eds.), Integer Programming and Combinatorial Optimization, Lecture Notes in Computer Science, Vol. 1610, Springer, Berlin, 1999, pp. 234-240). For any integer t ≥ 2, we also determine the maximum number of edges in a subgraph of G that contains no complete bipartite graph, as a subgraph, with more than t nodes. The proofs are based on a general min-max result of Frank and Jordán (J. Combin. Theory Ser. B 65(1) (1995) 73) concerning crossing bi-supermodular functions.
Blind Multiuser Detection in Multirate CDMA Based on Cyclic LMS Adaptation
Authors: Stefano Buzzi, Vikram Krishnamurthy, Marco Lops, H. Vincent Poor
Venue: Wireless Personal Communications: An International Journal (2003)

The problem of blind adaptive multiuser detection in multirate CDMA systems is considered. Indeed, since symbol detection in multirate CDMA systems requires periodically time-varying processing of the observables, classical LMS and RLS adaptive algorithms, which assume that the solution to be tracked is time-invariant or slowly time-varying, are not suited for blind adaptive multiuser detection in a multirate system. While a cyclic RLS algorithm has recently appeared in the literature, this paper focuses on the development of LMS-based cyclic filtering algorithms. In particular, cyclic versions of the standard LMS algorithm, of the LMS algorithm with iterate averaging and of the LMS algorithm with adaptive step-size are derived. Interestingly, the last two algorithms are shown to exhibit a convergence speed close to that of the cyclic RLS procedure, but with an order of magnitude lower computational complexity. An adaptive procedure for the automatic selection of the algorithm periodicity is also presented, which is based on a minimum mean-output-energy criterion, and that obviates the need for knowledge of the transmitted data-rates from the interfering signals. Moreover, the case of known multipath fading channels is also examined. In particular, it is shown that the proposed cyclic LMS algorithms can be used to achieve RLS-like performance also in the presence of multipath distortion. Extensive computer simulation results, along with some analytical convergence results, confirm that the proposed algorithms are effective and achieve very satisfactory performance.
An Eigenspace Projection Clustering Method for Inexact Graph Matching
Authors: Terry Caelli, Serhiy Kosinov
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2004)

Abstract--In this paper, we show how inexact graph matching (that is, the correspondence between sets of vertices of pairs of graphs) can be solved using the renormalization of projections of the vertices (as defined in this case by their connectivities) into the joint eigenspace of a pair of graphs and a form of relational clustering. An important feature of this eigenspace renormalization projection clustering (EPC) method is its ability to match graphs with different number of vertices. Shock graph-based shape matching is used to illustrate the model and a more objective method for evaluating the approach using random graphs is explored with encouraging results.