ppxscal/embedding_network huggingface dataset:
Statistical tools for regional data analysis using GIS
Authors: Konstantin Krivoruchko, Carol A. Gotway, Alex Zhigimont
Venue: Proceedings of the 11th ACM international symposium on Advances in geographic information systems (2003)

A GIS provides a powerful collection of tools for the management, visualization and analysis of spatial data. These tools can be even more powerful when they are integrated with statistical methods for spatial data analysis and many GIS users are requesting this integration. The Geostatistical Analyst extension to ArcGIS was developed to integrate statistical methods with GIS tools for mapping and modeling spatially continuous data such as temperature or pollution. However, many GIS applications involve data that are aggregated over geographic regions and the analysis of this type of spatial data poses additional challenges. In this paper, we illustrate several different analytical goals that commonly arise in applications based on regional data. Many of these require a measure of local spatial dependence and this is commonly based on Moran's I index of spatial association. However, as we describe in this paper, other measures that more explicitly take into account the aggregated nature of the data may be preferred. Using county-level crime data in California we show how many different statistical methods for regional data analysis can be implemented within a GIS to provide a powerful set of interactive, analytical tools uniquely suited to the goals of regional analysis.
Weak ties in networked communities
Authors: Andrea Kavanaugh, Debbie Denise Reese, John M. Carroll, Mary Beth Rosson
Venue: Communities and Technologies (2003)

Communities with high levels of social capital are likely to have a higher quality of life than communities with low social capital (Coleman, 1988, 1990; Putnam, 1993, 2000). This is due to the greater ability of such communities to organize and mobilize effectively for collective action because they have high levels of social trust, social networks, and well-established norms of mutuality (the major features of social capital). Communities with 'bridging' social capital (weak ties across groups) as well as 'bonding' social capital (strong ties within groups) are the most effective in organizing for collective action (Granovetter, 1973; Putnam, 2000). People who belong to multiple groups act as bridging ties Simmel [1908] 1950; Wellman, 1988). When people with bridging ties use communication media, such as the Internet, they enhance their capability to educate community members, and organize, as needed, for collective action. This paper summarizes evidence from stratified household survey data in Blacksburg, Virginia showing that people with weak (bridging) ties across groups have higher levels of community involvement, civic interest and collective efficacy than people without bridging ties to groups. Moreover, heavy Internet users with bridging ties have higher social engagement, use the Internet for social purposes, and have been attending more local meetings and events since going online than heavy Internet users with no bridging ties. These findings may suggest that the Internet - in the hands of bridging individuals -- is a tool for maintaining social relations, information exchange, and increasing face-to-face interaction, all of which help to build both bonding and bridging social capital in communities.
Using eye movements to determine referents in a spoken dialogue system
Authors: Ellen Campana, Jason Baldridge, John Dowding, Beth Ann Hockey, Roger W. Remington, Leland S. Stone
Venue: Proceedings of the 2001 workshop on Perceptive user interfaces (2001)

Most computational spoken dialogue systems take a "literary" approach to reference resolution. With this type of approach, entities that are mentioned by a human interactor are unified with elements in the world state based on the same principles that guide the process during text interpretation. In human-to-human interaction, however, referring is a much more collaborative process. Participants often under-specify their referents, relying on their discourse partners for feedback if more information is needed to uniquely identify a particular referent. By monitoring eye-movements during this interaction, it is possible to improve the performance of a spoken dialogue system on referring expressions that are underspecified according to the literary model. This paper describes a system currently under development that employs such a strategy.
New unsupervised clustering algorithm for large datasets
Authors: William Peter, John Chiochetti, Clare Giardina
Venue: Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining (2003)

A fast and accurate unsupervised clustering algorithm has been developed for clustering very large datasets. Though designed for very large volumes of geospatial data, the algorithm is general enough to be used in a wide variety of domain applications. The number of computations the algorithm requires is ~ O(N), and thus faster than hierarchical algorithms. Unlike the popular K-means heuristic, this algorithm does not require a series of iterations to converge to a solution. In addition, this method does not depend on initialization of a given number of cluster representatives, and so is insensitive to initial conditions. Being unsupervised, the algorithm can also "rank" each cluster based on density. The method relies on weighting a dataset to grid points on a mesh, and using a small number of rule-based agents to find the high density clusters. This method effectively reduces large datasets to the size of the grid, which is usually many orders of magnitude smaller. Numerical experiments are shown that demonstrate the advantages of this algorithm over other techniques.
Golden Path Analyzer: using divide-and-conquer to cluster Web clickstreams
Authors: Kamal Ali, Steven P. Ketchpel
Venue: Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining (2003)

This paper describes a novel algorithm and deployed system Golden Path Analyzer (GPA) that analyzes clickstreams of people trying to complete the same task on a website. It finds the shortest, successful paths taken by users - 'golden paths' - and uses these as seeds for clickstream clusters. Other users are assigned to a cluster if their clickstream is a supersequence of the golden path. The advantages of this approach are that the resulting clusters are easily comprehended, they are few in number, correspond to semantically different strategies used by the users, and jointly partition all the clickstreams. GPA's key contribution over prior work in process funnels is that by not excluding users that make diversions from the golden path, GPA is able to assign more users to fewer clusters. Another key contribution is to use actual full clickstreams as cluster seeds to which supersequences of other users are added. Golden paths correspond to complete clickstreams that are based on actual user page transitions. GPA is particularly useful for site designers to improve processes such as shopping, returns and registration. Its analyses identify which web pages cause many users to deviate from a golden path, which links distract users and the percentage of users taking each golden path. GPA has demonstrated value on more than twenty client projects in diverse industries.
On the existence of a new family of Diophantine equations for &#x03A9;
Authors: Toby Ord, Tien D. Kieu
Venue: Fundamenta Informaticae (2002)

We show how to determine the k-th bit of Chaitin's algorithmically random real number Ω solving k instances of the halting problem. From this we then reduce the problem of determining the k-th bit of Ω to determining whether a certain Diophantine equation with two parameters, k and N, has solutions for an odd or an even number of values of N. We also demonstrate two further examples of Ω in number theory: an exponential Diophantine equation with a parameter k which has an odd number of solutions iff the k-th bit of Ω is 1, and a polynomial of positive integer variables and a parameter k that takes on an odd number of positive values if the k-th bit of Ω is 1.
Nonlinear instability in multiple time stepping molecular dynamics
Authors: Qun Ma, Jesús A. Izaguirre, Robert D. Skeel
Venue: Proceedings of the 2003 ACM symposium on Applied computing (2003)

This paper discusses additional stability limitations of multiple time stepping (MTS) integrators for molecular dynamics (MD) that attempt to bridge time scales. In particular, it is shown that when constant-energy (NVE) simulations of Newton's equations of motion are attempted using the Verlet-I/r-RESPA/Impulse, there are nonlinear instabilities when the longest step size is one third and possibly one fourth of the period(s) of the fastest motion(s) in the system. This is demonstrated both thorough the analysis of a nonlinear model problem and through a through set of numerical simulations.
Concept framework for audio information retrieval: ARF
Authors: Guo Hui Li, De Feng Wu, Jun Zhang
Venue: Journal of Computer Science and Technology (2003)

The majority of researches on content-based retrieval focused on visual media. However audio is also an important medium and information carrier from the viewpoint of human auditory perception, so it is needed to retrieve for audio collection. Audio is handled by conventional methods as an opaque stream medium, which is not suitable for information retrieval by its content. In fact, audio carries rich aural information with the form of speech, musical, and sound effects, so it could be retrieved based on its aural content, such as acoustic features, musical melodies and associated semantics. In this paper, a concept framework (ARF) for content-based audio retrieval is proposed from systematic perspectives, which describes audio content model, audio retrieval architecture and audio query schemes. Audio contents are represented by a hierarchical model and a set of formal descriptions from physical to acoustic to semantic level, which depict acoustic features, logical structure and semantics of audio and audio objects. The architecture consisting of audio meta-database, populating and accessing modules presents a system structure view of audio information retrieval. The query schemes give generalized approaches and modes concerning how users deliver audio information needs to audio collections. Finally, an audio retrieval example implemented is used to explain and specify the application of the components in the proposed ARF.
Edge-isoperimetric problems for Cartesian powers of regular graphs
Authors: Sergei L. Bezrukov, Robert Elsässer
Venue: Theoretical Computer Science (2003)

We consider an edge-isoperimetric problem (EIP) on the Cartesian powers of graphs. One of our objectives is to extend the list of graphs for whose Cartesian powers the lexicographic order provides nested solutions for the EIP. We present several new classes of such graphs that include as special cases all presently known graphs with this property. Our new results are applied to derive best possible edge-isoperimetric inequalities for the Cartesian powers of arbitrary regular, resp. regular bipartite, graphs with a high density.
Reset Careabouts in a SoC Design
Authors: Subrangshu Das, Subash Chandar, Ashutosh Tiwari
Venue: Proceedings of the 17th International Conference on VLSI Design (2004)

Advances in VLSI technology have enabled designersto integrate more functionality in one chip. One of themajor design complexities arising from this is defining thereset architecture for a SoC, especially when there aremultiple clock domains. Incorrect assumptions oroverlooked issues might cause silicon bugs requiringcostly re-spins or even worse to a missed opportunity.In this paper, various careabouts that help achievefirst pass silicon success as well as reduced verificationand manufacturing test generation effort with respect tothe reset signal and the reset state are described.
A Cooperative Two-Tier Framework for Efficient Routing in MANET
Authors: Xin Jin, Hongbo Wang, YaoXue Zhang
Venue: Proceedings of the 2003 International Conference on Computer Networks and Mobile Computing (2003)

Mobile Ad hoc Networks (MANET) is a collection of randomly moving wireless devices within a particular area. Unlike in cellular networks, there are no fixed base-stations to support routing and mobility management. Further more, many resources such as power energy and bandwidth are very limited in MANET. Concentrating on these problems, we present acooperative two-tier framework. The framework contains two algorithms, SSCA and DSRU. SSCA is mainly responsible for topology management, and DSRU is responsible for the routing update. SSCA is a GPS based clustering mechanism. By predicting the next location of mobile node with its historic trajectory, it adjusts the node's transmit power in advance, and controls all nodes in suitable size clusters. Based on the clusters, DSRU is proposed in order to control the routing overhead while gets relatively exact global topology information. Experiment on the GloMoSim simulator shows that the framework proposed in this paper results in a notablereduction both in energy consumption and in routing overhead, and a notable improvement in network throughput, especially for the networks composed of high-speed mobile hosts.
For a morphology of interaction
Authors: Flo Menezes
Venue: Organised Sound (2002)

In mixed electroacoustic music it is common to find the erroneous conception according to which interaction should base itself exclusively on the fusion between instrumental writing and electronic devices, whereas the contrast between these sound spheres is as significant as the fusional states. Although fusion may be seen as the most important ingredient for an efficacious compositional strategy concerning interaction, it is actually through contrast that the identities of spectral transfers in mixed composition can be evaluated by the listener. This text intends to introduce a discussion about the many possibilities offered by the morphology of interaction between acoustic sources and electroacoustic resources and structures. In this sense it tries to identify intermediate types between the extremes of pure fusion and pure contrast, which can be established by the composer that sees in interactive music one of the most advantageous poetic realms of electroacoustic music.
Multivariate quadratic forms of random vectors
Authors: René Blacher
Venue: Journal of Multivariate Analysis (2003)

We obtain the distribution of the sum of n random vectors and the distribution of their quadratic forms: their densities are expanded in series of Hermite and Laguerre polynomials. We do not suppose that these vectors are independent. In particular, we apply these results to multivariate quadratic forms of Gaussian vectors. We obtain also their densities expanded in Mac Laurin series or in the form of an integral. By this last result, we introduce a new method of computation which can be much simpler than the previously known techniques. In particular, we introduce a new method in the very classical univariate case. We remark that we do not assume the independence of normal variables.
On Task Scheduling Accuracy: Evaluation Methodology and Results
Authors: Oliver Sinnen, Leonel Sousa
Venue: The Journal of Supercomputing (2004)

Many heuristics based on the directed acyclic graph (DAG) have been proposed for the static scheduling problem. Most of these algorithms apply a simple model of the target system that assumes fully connected processors, a dedicated communication sub-system and no contention for the communication resources. Only a few algorithms consider the network topology and the contention for the communication resources. This article evaluates the accuracy of task scheduling algorithms and thus the appropriateness of the applied models. An evaluation methodology is proposed and applied to a representative set of scheduling algorithms. The obtained results show a significant inaccuracy of the produced schedules. Analyzing these results is important for the development of more appropriate models and more accurate scheduling algorithms.
Should We Expect Less Price Rigidity in the Digital Economy?
Authors: Robert J. Kauffman, Dongwon Lee
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 7 - Volume 7 (2004)

Price rigidity in firms, industries and the economy as a whole is a topic of long-standing interest among scholars of many disciplines such as economics and marketing. Today, however, information technology is increasingly changing the process by which strategic pricing decisions in firms are made and implemented in business operations. This creates the impetus for developing a more substantial managerial understanding of firm pricing processes in the presence of information technology. In the 1990s, technology-driven pricing was largely the domain of the airlines, hotels and rental car companies -- with the practice of revenue yield management. However, now it is possible for bricks-and-clicks firms, and even traditional retailers, to implement systems that permit significant adjustments to be made to prices in situations where menu costs previously made rapid price changes difficult to achieve in an economical way. The paper draws upon theoretical perspectives that are largely new to the field of Information Systems, but that offer rich opportunities for theory-building and empirical research in settings that will be of high interdisciplinary interest.
Pen-based, mobile decision support in healthcare
Authors: Richard N. Shiffman, Bryant T. Karras, Sujai Nath, Laura Engles-Horton, Geoffrey J. Corb
Venue: ACM SIGBIO Newsletter (1999)

The use of computers has become well established throughout the business enterprise; but computer usage within the health care sector has lagged, particularly for automation of interactions between individual clinicians and their patients. A number of factors have contributed to this including difficulties in representing medical knowledge in computer-processible formats, the limited application of standards for data recording and transmission, and problems in human-computer interaction.A major obstacle to the use of computers in medicine has been the stationary nature of desktop computers. Most clinicians are mobile knowledge workers who need access to information across a wide variety of settings: in offices, exam rooms, emergency departments, hospitals, nursing homes and at home. Within each setting, there is concern that a large box on the consultation desk may interfere with communication between clinicians and patients. Moreover, many physicians do not have keyboard skills. Even for those who can type, keyboard data entry---concomitant with interviewing and examination-- is difficult. To overcome these obstacles, our group at the Yale Center for Medical Informatics has developed systems that operate on small, mobile platforms and accept pen-based data entry.We recognized early on that systems would have to be integrated tightly with clinical workflow and provide benefits to offset the inconvenience associated with their use. Clinical workflow refers to the complex interacting tasks performed by clinicians as they go about their daily work and to the corresponding information flows that are generated. A particular interest has been in providing clinical decision support at the point-of-care. We have extracted knowledge from evidence-based clinical practice guidelines and embedded it in mobile, pen-based systems that inform decision making by clinicians.
Nontangency-Based Lyapunov Tests for Convergence and Stability in Systems Having a Continuum of Equilibria
Authors: Sanjay P. Bhat, Dennis S. Bernstein
Venue: SIAM Journal on Control and Optimization (2003)

This paper focuses on the stability analysis of systems having a continuum of equilibria. Two notions that are of particular relevance to such systems are convergence and semistability. Convergence is the property whereby every solution converges to a limit point that may depend on the initial condition. Semistability is the additional requirement that all solutions converge to limit points that are Lyapunov stable. We give new Lyapunov-function-based results for convergence and semistability of nonlinear systems. These results do not make assumptions of sign definiteness on the Lyapunov function. Instead, our results use a novel condition based on nontangency between the vector field and invariant or negatively invariant subsets of the level or sublevel sets of the Lyapunov function or its derivative and represent extensions of previously known stability results involving semidefinite Lyapunov functions. To illustrate our results we deduce convergence and semistability of the kinetics of the Michaelis--Menten chemical reaction and the closed-loop dynamics of a scalar system under a universal adaptive stabilizing feedback controller.
On the use of shape grammars as expert systems for geometry-based engineering design
Authors: Manish Agarwal, Jonathan Cagan
Venue: Artificial Intelligence for Engineering Design, Analysis and Manufacturing (2000)

Production systems have traditionally been used in engineering to aid the designer in generating designs in domains not significantly influenced by geometry. However, in geometric-based domains such as mechanical engineering, their popularity has been limited. This work proposes the use of shape grammars as the framework for engineering expert systems. Shape grammars are shown to have all the generation and analysis capabilities of traditional production systems, while being able to represent knowledge about both the functionality and the form of a product. Additionally, the parametric nature of shape grammars, their ability to deal with physical form rather than abstract elements, and their ability to recognize emergent shapes give them significant advantages over traditional production systems for geometry-based engineering design.
Redundancy, Repair, and Test Features of a 90nm Embedded SRAM Generator
Authors: Rob Aitken, Neeraj Dogra, Dhrumil Gandhi, Scott Becker
Venue: Proceedings of the 18th IEEE International Symposium on Defect and Fault Tolerance in VLSI Systems (2003)

Today's System on Chip (SoC) designs can use hundreds of embedded memories. Most of these are created by automated generators, which must produce a wide variety of configurations while retaining essential capabilities in area, performance, power and testability. Redundancy, repair, and test issues in the context of memory generators are more complex than they are in the context of individual embedded memories, or even internally developed memories.
Scaling and Renormalization in Fault-Tolerant Quantum Computers
Authors: Maxim Raginsky
Venue: Quantum Information Processing (2003)

This work is concerned with phrasing the concepts of fault-tolerant quantum computation within the framework of disordered systems, Bernoulli site percolation in particular. We show how the so-called &ldquo;threshold theorems&rdquo; on the possibility of fault-tolerant quantum computation with constant error rate can be cast as a renormalization (coarse-graining) of the site percolation process describing the occurrence of errors during computation. We also use percolation techniques to derive a trade-off between the complexity overhead of the fault-tolerant circuit and the threshold error rate.PACS: 03.67.Pp; 03.67.Lx