ppxscal/embedding_network huggingface dataset:
From discrepancy to declustering: Near-optimal multidimensional declustering strategies for range queries
Authors: Chung-Min Chen, Christine T. Cheng
Venue: Journal of the ACM (JACM) (2004)

Declustering schemes allocate data blocks among multiple disks to enable parallel retrieval. Given a declustering scheme D, its response time with respect to a query Q, rt(Q), is defined to be the maximum number of data blocks of the query stored by the scheme in any one of the disks. If |Q| is the number of data blocks in Q and M is the number of disks, then rt(Q) is at least &lceil;|Q|/M&rceil;. One way to evaluate the performance of D with respect to a set of range queries Q is to measure its additive error---the maximum difference of rt(Q) from &lceil;|Q|/M&rceil; over all range queries Q &isin; Q.In this article, we consider the problem of designing declustering schemes for uniform multidimensional data arranged in a d-dimensional grid so that their additive errors with respect to range queries are as small as possible. It has been shown that for a fixed dimension d &ge; 2, any declustering scheme on an Md grid, a grid with length M on each dimension, will always incur an additive error with respect to range queries of &Omega;(log M) when d = 2 and &Omega;(logd&minus;1/2 M) when d > 2.Asymptotically optimal declustering schemes exist for 2-dimensional data. However, the best general upper bound known so far for the worst-case additive errors of d-dimensional declustering schemes, d &ge; 3, is O(Md&minus;1), which is large when compared to the lower bound. In this article, we propose two declustering schemes based on low-discrepancy points in d-dimensions. When d is fixed, both schemes have an additive error of O(logd&minus;1 M) with respect to range queries, provided that certain conditions are satisfied: the first scheme requires that the side lengths of the grid grow at a rate polynomial in M, while the second scheme requires d &ge; 2 and M = pt where d &le; p &le; C, C a constant, and t is a positive integer such that t(d &minus; 1) &ge; 2. These are the first multidimensional declustering schemes with additive errors proven to be near optimal.
Why the newspaper has a great user interface
Authors: Win Treese
Venue: netWorker (2003)

While reading The Wall Street Journal this morning, I found myself thinking about the flood of information I get electronically. In many ways, reading the newspaper is still a more pleasant experience than sorting through (virtual) piles of e-mail, newsgroups, online forums, Web sites, and other Internet information sources. Can more of the lessons of newspaper design be applied to online information tools?
The Grid Enterprise &mdash; Structuring the Agile Business of the Future
Authors: T. Boden
Venue: BT Technology Journal (2004)

Information technology (IT) spending remains depressed as organisations look to exploit their existing systems, squeezing out the last drops of benefit to bolster their financial cases. However, at some point the law of diminishing returns will cut in as infrastructure gets older and the needs of business agility stretch the bounds of existing systems. As a result, companies will start to look for the next wave of technology that will help them both upgrade their capacity and improve their agility.Many analysts have identified grid computing and Web Services as the core technologies to support this wave, variously describing it as &lsquo;organic IT&rsquo; and the &lsquo;real-time enterprise&rsquo;. However, there is a broader convergence of both these two technologies with the techniques of business process management that appears to offer even greater benefit.This paper examines the drivers of organisational agility and the corresponding demands on a Web Services-based infrastructure. It identifies the shortfall in current Web Services solutions and highlights how a service-oriented architecture can overcome them. It extends this architecture to incorporate both business process management and grid computing and concludes by deriving a future form for the truly agile enterprise.
About the possibility of applying the neuron networks for determining the parameters of uniaxial films on the basis of the ellipsometric measurements
Authors: Michal M. Karpuk
Venue: Proceedings of the international conference on Computational methods in sciences and engineering (2003)

The problem of definition of parameters of thin anisotropic films used in a microelectronics on the basis of ellipsometrical measuring is explored. The method of definition of parameters of films with use of neuron networks is offered. The networks is trained in space of acceptable values of parameters of layered system. The algorithm of tutoring of a network grounded on a rule Widrow-Hoff. At tutoring the error of experimental data's was taken into account. The neuron networks is applied for definition of parameters of uniaxial films of Langmuir-Blodgett dimethy1-3,4:9,10-perylene-bis(dicarboximide). The network has shown high performance, the results coincide with obtained other methods. The network can be applied for examination of layered systems.
The digital space shuttle, 3D graphics, and knowledge management
Authors: Julian E Gómez, Paul J. Keller
Venue: ACM SIGGRAPH 2003 Sketches Applications (2003)

The Digital Shuttle is a knowledge management project that seeks to define symbiotic relationships between 3D graphics and formal knowledge representations (ontologies). 3D graphics provides geometric and visual content, in 2D and 3D CAD forms, and the capability to display systems knowledge. Because the data is so heterogeneous, and the interrelated data structures are complex, 3D graphics combined with ontologies provides mechanisms for navigating the data and visualizing relationships.
Analyzing High-Dimensional Data by Subspace Validity
Authors: Amihood Amir, Reuven Kashi, Nathan S. Netanyahu, Daniel Keim, Markus Wawryniuk
Venue: Proceedings of the Third IEEE International Conference on Data Mining (2003)

We are proposing a novel method that makes it possibleto analyze high dimensional data with arbitrary shapedprojected clusters and high noise levels. At the core of ourmethod lies the idea of subspace validity. We map the datain a way that allows us to test the quality of subspaces usingstatistical tests. Experimental results, both on synthetic andreal data sets, demonstrate the potential of our method.
Content-based retrieval in hybrid peer-to-peer networks
Authors: Jie Lu, Jamie Callan
Venue: Proceedings of the twelfth international conference on Information and knowledge management (2003)

Hybrid peer-to-peer architectures use special nodes to provide directory services for regions of the network ("regional directory services"). Hybrid peer-to-peer architectures are a potentially powerful model for developing large-scale networks of complex digital libraries, but peer-to-peer networks have so far tended to use very simple methods of resource selection and document retrieval. In this paper, we study the application of content-based resource selection and document retrieval to hybrid peer-to-peer networks. The directory nodes that provide regional directory services construct and use the content models of neighboring nodes to determine how to route query messages through the network. The leaf nodes that provide information use content-based retrieval to decide which documents to retrieve for queries. The experimental results demonstrate that using content-based retrieval in hybrid peer-to-peer networks is both more accurate and more efficient for some digital library environments than more common alternatives such as Gnutella 0.6.
GRACE: an autonomous robot for the AAAI Robot challenge
Authors: Reid Simmons, Dani Goldberg, Adam Goode, Michael Montemerlo, Nicholas Roy, Brennan Sellner, Chris Urmson, Alan Schultz, Myriam Abramson, William Adams, Amin Atrash, Magda Bugajska, Michael Coblenz, Matt MacMahon, Dennis Perzanowski, Ian Horswill, Robert Zubek, David Kortenkamp, Bryn Wolfe, Tod Milam, Bruce Maxwell
Venue: AI Magazine (2003)

In an attempt to solve as much of the AAAI Robot Challenge as possible, five research institutions representing academia, industry, and government integrated their research into a single robot named GRACE. This article describes this first-year effort by the GRACE team, including not only the various techniques each participant brought to GRACE but also the difficult integration effort itself.
Flexible Fault Tolerance in Configurable Middleware for Embedded Systems
Authors: Kevin Dorow
Venue: Proceedings of the 27th Annual International Conference on Computer Software and Applications (2003)

MicroQoSCORBA (MQC) is a middlewareplatform that focuses on embedded applications byproviding a very fine level of configurability of itsinternal orthogonal components. Using thisconfigurability, a developer can generate a customizedmiddleware instantiation that is tailored to both therequirements and constraints of a specific embeddedapplication and the embedded hardware.One of the key components provided by MQC isa set of fault-tolerant mechanisms, which allow forsupport of applications that require a higher level ofreliability. This document provides a detaileddescription of the algorithms and protocols selected forthese mechanisms, along with a discussion of theirimplementation and incorporation into the MQCplatform.
Collaborative Multiagent Adaptation for Business Environmental Scanning Through the Internet
Authors: Rey-Long Liu
Venue: Applied Intelligence (2004)

Businesses should promptly respond to their dynamic environments. Environmental scanners are thus essential for the businesses to discover and monitor environmental information of interest (IOI). In this paper, we explore user-centered, continuous and resource-bounded environmental scanning (UCRES). Upon receiving information preferences of managers, new IOI should be continuously detected in a timely and complete manner without consuming too much resource (e.g. bandwidths of computer networks and services of information servers). We develop a multiagent framework AESA to tackle the challenges of UCRES. Each agent is a simple entity. All agents collaboratively adapt their population and resource consumption to several dynamic aspects of UCRES: information preferences of individual users, resource limitation of environmental scanning, distribution of IOI in the environments, and update behaviors of the IOI. The delivery of AESA to businesses may constantly provide a larger amount of important and timely IOI without exhausting the Intranet and the Internet communities.
Conceptual-Level Log Analysis for the Evaluation of Web Application Quality
Authors: Piero Fraternali, Maristella Matera, Andrea Maurino
Venue: Proceedings of the First Conference on Latin American Web Congress (2003)

So far, conceptual modeling of Web applications has been used primarily in the upper part of the life cycle, as a driver for system analysis. Little attention has been put on exploiting the conceptual models developed during analysis for application evaluation, maintenance andevolution. This paper illustrates an approach for integrating the use of conceptual models in the lower part of the application life cycle, by exploiting them in quality analysis and usage evaluation. A prototype tool for supporting the described evaluation activities is also presented.
Differences in spiking patterns among cortical neurons
Authors: Shigeru Shinomoto, Keisetsu Shima, Jun Tanji
Venue: Neural Computation (2003)

Spike sequences recorded from four cortical areas of an awake behaving monkey were examined to explore characteristics that vary among neurons. We found that a measure of the local variation of interspike intervals, Lv, is nearly the same for every spike sequence for any given neuron, while it varies significantly among neurons. The distributions of Lv values for neuron ensembles in three of the four areas were found to be distinctly bimodal. Two groups of neurons classified according to the spiking irregularity exhibit different responses to the same stimulus. This suggests that neurons in each area can be classified into different groups possessing unique spiking statistics and corresponding functional properties.
Efficient spill code for SDRAM
Authors: V. Krishna Nandivada, Jens Palsberg
Venue: Proceedings of the 2003 international conference on Compilers, architecture and synthesis for embedded systems (2003)

Processors such as StrongARM and memory such as SDRAM enable efficient execution of multiple loads and stores in a single instruction. This is particularly useful in connection with register allocation where spill code may need to save and restore multiple registers. Until now, there has been no effective strategy for utilizing this to its full potential. In this paper we investigate the use of SDRAM for optimization of spill code. The core of the problem is to arrange the variables in the spill area such that loading to and storing from the SDRAM is optimally efficient. We show that the problem is NP-complete and present a method based on integer linear programming (ILP) to solve the problem. We have implemented our approach as an additional phase in a gcc-based compiler for the StrongARM core of Intel's IXP--1200 network processor. Our optimizer, SLA (stack location allocator), rearranges the scalar variables so that memory accesses can be made cheaper. Our experimental results show that our ILP-based method is efficient and that the code generated for our benchmarks runs 0.8--15.1% faster than the code produced by the original compiler with --O2 optimization. Our SLA phase is guaranteed to not deteriorate the execution-time performance and can be configured such as not to increase the code size.
Diagnosing crosstalk faults algorithm design and analysis in a class of dilated re-arrangeable photonic switching networks
Authors: I-Shyan Hwang
Venue: Information Sciences&mdash;Informatics and Computer Science: An International Journal (2003)

Optical multistage interconnection networks (OMINs), based on 2 × 2 directional coupler photonic switches, play a significant role in all-optical lightwave networks. Space dilation reduces the native effect of switch crossover. This paper presents two types of dilated re-arrangeable networks extended from dilated blocking networks: a class of two cascaded dilated blocking networks, such as dilated_blocking_network- dilated_blocking_network architectures, and the other type can be extended from the dilated blocking networks, i.e. horizontal cascading (HC) or vertical stacking (VS). Optical crosstalk, an underestimated problem in OMINs, is the effect of undesirable coupling of signals between paths within a directional coupler due to its rapid aging. A switch is faulty if it causes excessive crosstalk in excess of a given threshold. Diagnosing faulty switch is essential issue in OMINs. Previous work [Inform. Sci.: Int. J. 124 (2000) 59] has developed the appropriate diagnostic algorithm for dilated blocking photonic networks. This paper devises diagnostic algorithms for dilated re-arrangeable networks, which benefits from [Inform. Sci.: Int. J. 124 (2000) 59]. The proposed algorithm is also verified in this paper.
Removing Edges Can Increase the Average Number of Colours in the Colourings of a Graph
Authors: Michele Mosca
Venue: Combinatorics, Probability and Computing (1998)

It was conjectured by Bartels and Welsh [1] that removing an edge from an n-vertex graph G will not increase the average number of colours in the proper colourings of G if k=n colours are available. This paper shows that for all n>3, and for each k&isin;{3, 4, &hellip;, &lfloor;(3n&minus;6)&#x002F;2&rfloor;}, there is a graph on n vertices with an edge whose removal increases the average number of colours in the k-colourings, thus disproving the conjecture.
Pseudotriangulations from Surfaces and a Novel Type of Edge Flip
Authors: Oswin Aichholzer, Franz Aurenhammer, Hannes Krasser, Peter Brass
Venue: SIAM Journal on Computing (2003)

We prove that planar pseudotriangulations have realizations as polyhedral surfaces in three-space. Two main implications are presented. The spatial embedding leads to a novel flip operation that allows for a drastic reduction of flip distances, especially between (full) triangulations. Moreover, several key results for triangulations, like flipping to optimality, (constrained) Delaunayhood, and a convex polytope representation, are extended to pseudotriangulations in a natural way.
Analysis and evaluation of mobile IPv6 handovers over wireless LAN
Authors: Nicolas Montavont, Thomas Noël
Venue: Mobile Networks and Applications (2003)

In this paper, we analyze the IPv6 handover over wireless LANs. Mobile IPv6 is designed to manage mobile nodes movements between wireless IPv6 networks. Nevertheless, a mobile node cannot receive IP packets on its new point of attachment until the handover completes. Therefore, a number of extensions to Mobile IPv6 have been proposed to reduce the handover latency and the number of lost packets. We focus on Fast Mobile IPv6 which is an extension of Mobile IPv6 that allows the use of L2 triggers to anticipate the handover. We compare the handover latency in four specific cases: basic Mobile IPv6, the forwarding method of Mobile IPv6, the Anticipated method, and the Tunnel-Based Handover. The results of the handover latency are calculated with the L2 properties of IEEE 802.11b. In particular, we take into account the L2 handover for different configurations of the wireless network.
A case study of three organizations' plans to facilitate the adoption, diffusion, and infusion of computer technology in the workplace
Authors: Lynn Davie
Venue:  (2003)

This study investigates the processes involved in the introduction of computer technology in the workplace. It examines the extent to which the designer considers end users' needs in the design process in integrating computer technology in the workplace. To investigate this phenomenon, 17 participants representing three organizations were interviewed. These respondents were part of teams responsible for the implementation of computer technology. A case study method was used in which multiple sites were examined to gain insights from those responsible for the adoption of computer technology. Data were gathered using semi-structured interview questions. The researcher conducted the interviews. The interviews were audiotaped and transcribed verbatim for analysis. Analysis of the data shows that the participants used a variety of approaches to make decisions concerning computer technology adoption in the workplace. The organizations' structure, culture, and management style, and the wider social and national culture influenced how computer technology was adopted, diffused and infused within the workplace. While the organizations investigated in this study were highly hierarchical, a flattened organizational structure was present when decisions about computer technology were made. An open, participatory, democratic management style favoring collaboration and teamwork was chiefly used. The management, including upper management and the Information Technology management, and the employees worked together to facilitate the various processes. The utilization of a user-participatory approach to decision making reflected a socio-technical approach to computer technology adoption, diffusion, and infusion. The organizations with a greater network of support approached the adoption and diffusion processes in a formalized way. The culture of the organization also affects the organization structure and the management style used during the acquisition of computer technology. The utilization of a user-participatory approach to decision making improves how the employees feel about the organization, and in turn the culture has an effect on the diffusion and infusion of computer technology. A &ldquo;Social Interactive Approach to the Implementation of Computer Technology&rdquo; is recommended to practitioners in the field of computer technology adoption, diffusion and infusion. This is a holistic and flexible approach that utilizes both the social architectures of the organization, as well as the wider social framework in which the user and the organization are situated.
Iris Compression for Cryptographically Secure Person Identification
Authors: Daniel Schonberg, Darko Kirovski
Venue: Proceedings of the Conference on Data Compression (2004)

In this paper we propose EyeCerts, a biometric system for identification of people whichachieves off-line verification of certified, cryptographically secure documents. An EyeCertis a printed document which certifies the association of a given text with a biometricfeature - a compressed version of a human iris in this work. As a central component ofthe yeCert system, we present an iris analysis technique that extracts and compressesthe unique features of a given iris using limited storage. The compressed features shouldbe at maximal distance with respect to a reference iris image database. The iris analysisalgorithm performs several steps in three main phases: (i) it detects the human iris, (ii) itconverts the isolated iris using a modified Fourier-Mellin transform into a standard domainwhere the common radial patterns of the human iris are concisely represented, and (iii)it optimally selects, aligns, and near-optimally compresses the most distinctive transformcoefficients for each individual user. Using a low quality imaging system (sub-US$100) anddeveloped and readily available low complexity processing techniques, the overall systemis shown to have probabilities of false negative and false positive on the order of 10-5.
Dependency detection in MobiMine: a systems perspective
Authors: Sweta Pittie, Hillol Kargupta, Byung-Hoon Park
Venue: Information Sciences&mdash;Informatics and Computer Science: An International Journal (2003)

This paper considers the problem of detecting dependencies among data streams and presenting the results in a mobile data mining system. It particularly focuses on the systems issues addressed by MobiMine, a system for mining financial data streams from PDAs. It presents an overview of the MobiMine, explains the two algorithmic techniques (correlation and conditional probability rules) used for detecting dependencies between a pair of stocks, identifies the systems challenges, and offers solutions. The paper also presents experimental results supporting MobiMine's scalable performance.