ppxscal/embedding_network huggingface dataset:
Competitive Time and Traffic Analysis of Position-Based Routing using a Cell Structure
Authors: Stefan Ruhrup, Christian Schindelhauer
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 12 - Volume 13 (2005)

We present a strategy for organizing the communication in wireless ad hoc networks based on a cell structure. We use the unit disk graph model and assume positioning capabilities for all nodes. The cell structure is an abstract view on the network and represents regions where nodes reside (node cells), regions that can be used for the communication flow (link cells) and regions that cannot be bridged due to the restricted transmission range (barrier cells). The cell structure helps to determine local minima for greedy forwarding and improves recovery from such minima, because for recovery all edges can be used in contrast to other topology-based rules that work only on a planar subgraph. For the analysis of position-based routing algorithms the measures time and traffic are based on the cell structure. The difficulty of exploring the network is expressed by the size of the barriers (number of cells in the perimeters). Exploration can be done in parallel, but with increasing traffic. We propose a comparative measure to assess both time and traffic, the combined comparative ratio, which is the maximum of the ratio of routing time and optimal time and the ratio of the traffic and the minimum exploration costs. While flooding and common single-path strategies have a linear ratio, we present a simple algorithm that has a sublinear combined comparative ratio of O(\sqrt h ), where h is the minimal hop distance between source and target.
Japanese case frame construction by coupling the verb and its closest case component
Authors: Daisuke Kawahara, Sadao Kurohashi
Venue: Proceedings of the first international conference on Human language technology research (2001)

This paper describes a method to construct a case frame dictionary automatically from a raw corpus. The main problem is how to handle the diversity of verb usages. We collect predicate-argument examples, which are distinguished by the verb and its closest case component in order to deal with verb usages, from parsed results of a corpus. Since these couples multiply to millions of combinations, it is difficult to make a wide-coverage case frame dictionary from a small corpus like an analyzed corpus. We, however, use a raw corpus, so that this problem can be addressed. Furthermore, we cluster and merge predicate-argument examples which does not have different usages but belong to different case frames because of different closest case components. We also report on an experimental result of case structure analysis using the constructed case frame dictionary.
Equivalence classes of matchings and lattice-square designs
Authors: William Y.-C. Chen, David C. Torney
Venue: Discrete Applied Mathematics (2005)

We enumerate nonisomorphic lattice-square designs yielded by a conventional construction. Constructed designs are specified by words composed from finite-field elements. These words are permuted by the isomorphism group in question. The latter group contains a direct-product subgroup, acting, respectively, upon the positions and identities of the finite-field elements. We review enumeration theory for such direct-product groups. This subgroup is a direct product of a hyperoctahedral and a dihedral group, with the orbits of the hyperoctahedral group, acting on the positions of the field elements, interpretable as perfect matchings. Thus, the enumeration of dihedral equivalence classes of perfect matchings provides an upper bound on the number of nonisomorphic, constructed designs. The full isomorphism group also contains non-direct-product elements, and the isomorphism classes are enumerated using Burnside's Lemma: counting the number of orbits of a normal subgroup fixed by the quotient group. This approach is applied to constructed lattice-square designs of odd, prime-power order ≤13.
Design and Implementation of Dynamic-Role Based Access Control Framework in Grid Environment
Authors: Chen Ying, Yang Shoubao, Guo Leitao, Liu Pengzhan, Shen Kai
Venue: Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume II - Volume 02 (2005)

Traditional RBAC has trouble in prohibiting cheat and changing roles of users as the amount of users and resources increase, while the trust management can establish trust relationships among entities in grid environment. So the Dynamic-Role Based Access Control framework assembles both of their merits and simplifies the administration of RBAC. An implementation is deployed in HanHai Grid environment.
Life on the edge: supporting collaboration in location-based experiences
Authors: Steve Benford, Duncan Rowland, Martin Flintham, Adam Drozd, Richard Hull, Josephine Reid, Jo Morrison, Keri Facer
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems (2005)

We study a collaborative location-based game in which groups of 'lions' hunt together on a virtual savannah that is overlaid on an open playing field. The game implements a straight-forward approach to location-based triggering in which players must be in the same spatial locale in order to share information and act together. Comparison of video recordings of physical play with system recordings of game events reveals subtle and complex interactions between highly dynamic player behavior and the underlying technology. While players exhibit a fluid approach to group formation, the system embodies a more rigid view, leading to difficulties with sharing context and coordinating actions, most notably when groups of players span virtual locale boundaries or initiate actions while on the move. We propose techniques for extending locales to support more flexible grouping and also discuss the broader implications of our findings for location-based applications in general.
Using a hash-based method for apriori-based graph mining
Authors: Phu Chien Nguyen, Takashi Washio, Kouzou Ohara, Hiroshi Motoda
Venue: Proceedings of the 8th European Conference on Principles and Practice of Knowledge Discovery in Databases (2004)

The problem of discovering frequent subgraphs of graph data can be solved by constructing a candidate set of subgraphs first, and then, identifying within this candidate set those subgraphs that meet the frequent subgraph requirement. In Apriori-based graph mining, to determine candidate subgraphs from a huge number of generated adjacency matrices is usually the dominating factor for the overall graph mining performance since it requires to perform many graph isomorphism tests. To address this issue, we develop an effective algorithm for the candidate set generation. It is a hash-based algorithm and was confirmed effective through experiments on both real-world and synthetic graph data.
Insights and perspectives on physical synthesis
Authors: Shankar Krishnamoorthy
Venue: Proceedings of the 2005 international symposium on Physical design (2005)

The advent of 90nm and 65nm technology nodes caused design teams to face a concurrent "3-on-1" assault of massive designs, significant increase in functional requirements, and substantial process modeling complexities. While existing solutions have done well in carving out their niches by solving just one of these three challenges, they impose significant user intervention and manual iterations for the rest. The current crop of EDA tools were not developed to handle the 50M-gate capacity offered by a 90nm die. The sheer complexity of the design functionality coupled with process variations has proven them inadequate for design closure. Finally, the lack of implicit support for variability routinely produces chips with sub-optimal yield. New approaches to achieve closure for multi-million gate designs, with rapid execution times, and accurate modeling of pervasive process effects are needed for these technology nodes. We will discuss the salient engineering and technological challenges of building such a system and provide insights into design trade-offs that will help us achieve this seemingly "holy grail" of digital physical design.
Exploring the Energy-Time Tradeoff in High-Performance Computing
Authors: Feng Pan, Vincent W. Freeh, Daniel M. Smith
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 11 - Volume 12 (2005)

High-performance computing is and has always been performance oriented. However, a consequence of the push towards maximum performance is increased energy consumption, especially at supercomputing centers. Moreover, as peak performance is rarely attained, some of this energy consumption results in little or no performance gain. In addition, large energy consumption costs the government a significant amount of money and wastes natural resources. This paper investigates the tradeoff between energy and performance. Through the use of processors that support frequency and voltage scaling, we measured the performance and energy consumption of programs from three popular benchmark sets. We took multiple measurements for each program using different frequency and voltage settings. Results show that for many programs, a significant decrease in energy is possible with a small increase in time. We believe that this justifies further investigation into parallel HPC (e.g., MPI) applications.
Delegation Depth Control in Trust-Management System
Authors: Fan Hong, Xian Zhu, Shaobin Wang
Venue: Proceedings of the 19th International Conference on Advanced Information Networking and Applications - Volume 2 (2005)

Trust management system has been a promising approach to solve the access control problems in distributed systems. Delegation is a core concept in it and needs to be limited with respect to depth. In this paper, some different delegation depth control approaches in current trust management system are discussed. Then RT+0 is introduced, which incorporates the integer delegation depth control into RT0. The RT+0 credential adds to RT0 depth value, which provides a more expressive power. The changed semantics is formally defined by a translation from credential to Datalog rules. The computational complexity analysis is given and it shows that the semantics is also algorithmically tractable.
Optimality of Stasis and Small Switching Cycles in Planar Systems with Two-Valued Controls
Authors: Stewart D. Johnson
Venue: SIAM Journal on Control and Optimization (2005)

For planar ($x\in{\Bbb R}^2$) control systems $x'=f(x,\mu)$ with a two-valued control $\mu\in\{\mu_1,\mu_2\}$ we consider small cycles created by rapidly switching between the two control values. A two-cycle is a periodic cycle on which the periodic control changes value twice in one period. Stasis is a relaxed (i.e., probabilistic) control $\mu_{\hbox{\scriptsize{r}}}$ with a fixed point (called a stasis point) $x_{\hbox{\scriptsize{r}}}$ where $0=f(x_{\hbox{\scriptsize{r}}},\mu_{\hbox{\scriptsize{r}}})= \int f(x_{\hbox{\scriptsize{r}}},\mu)\;d\mu_{\hbox{\scriptsize{r}}}$. Generically, stasis points can be approximated by two-cycles, and every two-cycle must contain a stasis point. Also generically, stasis points form curves (called stasis curves). The unit metric on these curves parameterize families of small two-cycles near the stasis curve. Under general conditions, we show that average performance is differentiable with respect to this parameterization, and thus necessary conditions for optimality of small two-cycles versus stasis can be explicitly calculated.
Fourth-order problems with nonlinear boundary conditions
Authors: Daniel Franco, Donal O'Regan, Juan Perán
Venue: Journal of Computational and Applied Mathematics (2005)

We develop a new method of lower and upper solutions for a fourth-order nonlinear boundary value problem where the differential equation has dependence on all lower-order derivatives. Our boundary conditions are nonlinear. We will assume the functions that define the nonlinear boundary conditions are either monotone or nonmonotone. As a result we obtain existence principles which improve recent results in the literature.
The open agent society as a platform for the user-friendly information society
Authors: Jeremy Pitt
Venue: AI Society (2005)

A thematic priority of the European Union&#x2019;s Framework V research and development programme was the creation of a user-friendly information society which met the needs of citizens and enterprises. In practice, though, for example in the case of on-line digital music, the needs of citizens and enterprises may be in conflict. This paper proposes to leverage the appearance of &#x2018;intelligence&#x2019; in the platform layer of a layered communications architecture to avoid such conflicts in similar applications in the future. The key idea is that if the intelligence is encapsulated in an agent, then the agents should be organized as a society, and then the rules of the society can be used to ensure &#x2018;responsible&#x2019; behaviour. We discuss how an agent society can be used to regulate behaviour in future information trading scenarios, and conclude that this approach offers a &#x2018;third way&#x2019; which can satisfy the (reasonable) needs of both citizens and enterprises in the user-friendly information society.
Determining the Geometry of Boundaries of Objects from Medial Data
Authors: James Damon
Venue: International Journal of Computer Vision (2005)

We consider a region ¿ in R2 or R3 with generic smooth boundary B and Blum medial axis M, on which is defined a multivalued "radial vector field" U from points x on M to the points of tangency of the sphere at x with B. We introduce a "radial shape operator" Srad and an "edge shape operator" SE which measure how U bends along M. These are not traditional differential geometric shape operators, nonetheless we derive all local differential geometric invariants of B from these operators.This allows us to define from (M, U) a "geometric medial map" on M which corresponds, via a "radial map" from M to B, to the differential geometric properties of B. The geometric medial map also includes a description of the relative geometry of B. This is defined using the "relative critical set" of the radius function r on M. This set consists of a network of curves on M which describe where B is thickest and thinnest. It is computed using the covariant derivative of the tangential component of the unit radial vector field.We further determine how these invariants are related to the differential geometric invariants of M and how these invariants change under deforming diffeomorphisms of M.
A probabilistic model for Latent Semantic Indexing: Research Articles
Authors: Chris H. Q. Ding
Venue: Journal of the American Society for Information Science and Technology (2005)

Latent Semantic Indexing (LSI), when applied to semantic space built on text collections, improves information retrieval, information filtering, and word sense disambiguation. A new dual probability model based on the similarity concepts is introduced to provide deeper understanding of LSI. Semantic associations can be quantitatively characterized by their statistical significance, the likelihood. Semantic dimensions containing redundant and noisy information can be separated out and should be ignored because their negative contribution to the overall statistical significance. LSI is the optimal solution of the model. The peak in the likelihood curve indicates the existence of an intrinsic semantic dimension. The importance of LSI dimensions follows the Zipf-distribution, indicating that LSI dimensions represent latent concepts. Document frequency of words follows the Zipf distribution, and the number of distinct words follows log-normal distribution. Experiments on five standard document collections confirm and illustrate the analysis. &copy; 2005 Wiley Periodicals, Inc.
Physical objects linked to audio sources: phicon+earcon=phearcon
Authors: Sylvain Daudé, Laurence Nigay
Venue: Proceedings of the 1st French-speaking conference on Mobility and ubiquity computing (2004)

This article introduces a new kind of interface, the Phearcons, which are physical objects linked to audio sources that are spatialized according to the objects position and represent information sources. We aim at designing and developing a platfrom called Phearcons for specifying and running such interfaces. This article provides design rules as well as a process for the specification and implementation of such a platform.
Iterative design of robust controllers under unknown bounded perturbation norms
Authors: V. F. Sokolov
Venue: Automation and Remote Control (2005)

A suboptimal robust controller for a multidimensional linear stationary nominal system with output- and control-operator perturbations and a bounded external perturbation is designed. Perturbation norms (weights) are assumed to be unknown and estimated from measurement data. The quality index of the closed-loop control system is taken to be the worst ¿¿-norm for the output of the system in the class of admissible perturbations. The quality index for systems in the class of linear stationary stabilizing controllers is a fractional linear function of induced norms of transfer matrices of the closed-loop system and perturbation norms. The classical design of suboptimal robust controllers under known perturbation norms is reduced to a standard ¿1-optimization problem, and optimal estimation of unknown perturbation norms is reduced to a linear programming problem. Therefore, the iterative sequential method of controller design and perturbation norm estimation is used as a heuristic method for designing suboptimal robust controllers under unknown perturbation norms. Modeling results corroborate the effectiveness of this method.
A New Incremental Watermarking Based on Dual-Tree Complex Wavelet Transform
Authors: Joong-Jae Lee, Won Kim, Na-Young Lee, Gye-Young Kim
Venue: The Journal of Supercomputing (2005)

This paper proposes a new incremental watermarking technique, which is robust for affine transformation and time-varying according to the degree of distortion, using Dual-Tree Complex Wavelet Transform (DT-CWT). At the embedding step, the proposed algorithm inserts a given watermark into the phase components of a transformed image by DT-CWT. At the extracting step, the algorithm incrementally compares the extracted with the original watermark using correlation from lowest to highest level. The proposed technique through performance evaluation displays that it was more robust in geometric distortions than a conventional CWT-based watermarking.
A Prototype Processing-In-Memory (PIM) Chip for the Data-Intensive Architecture (DIVA) System
Authors: Jaffrey Draper, J. Tim Barrett, Jeff Sondeen, Sumit Mediratta, Chang Woo Kang, Ihn Kim, Gokhan Daglikoca
Venue: Journal of VLSI Signal Processing Systems (2005)

The Data-Intensive Architecture (DIVA) system employs Processing-In-Memory (PIM) chips as smart-memory coprocessors. This architecture exploits inherent memory bandwidth both on chip and across the system to target several classes of bandwidth-limited applications, including multimedia applications and pointer-based and sparse-matrix computations. The DIVA project has built a prototype development system using PIM chips in place of standard DRAMs to demonstrate these concepts. We have recently ported several demonstration kernels to this platform and have exhibited a speedup of 35X on a matrix transpose operation.This paper focuses on the 32-bit scalar and 256-bit WideWord integer processing components of the first DIVA prototype PIM chip, which was fabricated in TSMC 0.18 ¿m technology. In conjunction with other publications, this paper demonstrates that impressive gains can be achieved with very little "smart" logic added to memory devices. A second PIM prototype that includes WideWord floating-point capability is scheduled to tape out in August 2003.
Theoretical Analysis on Reconstruction-Based Super-Resolution for an Arbitrary PSF
Authors: Masayuki Tanaka, Masatoshi Okutomi
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 2 - Volume 02 (2005)

This study presents and proves a condition number theorem for super-resolution (SR). The SR condition number theorem provides the condition number for an arbitrary space-invariant point spread function (PSF) when using aninfinite number of low resolution images. A gradient restriction is also derived for maximum likelihood (ML) method. The gradient restriction is presented as an inequality which shows that the power spectrum of the PSF suppresses the spatial frequency component of the gradient of ML cost function. A Box PSF and a Gaussian PSF are analyzed with the SR condition number theorem. Effects of the gradient restriction on super-resolution results are shown using synthetic images.
Secure and Safety-Critical vs. Insecure, Non Safety-Critical Embedded Systems: Do They Require Completely Different Design Approaches?
Venue: Proceedings of the international conference on Hardware/Software Codesign and System Synthesis: 2004 (2004)

As we move forward into the era of ubiquitous pervasive computing, the design of secure safety-critical systems will become increasingly complex. For example, future automobiles will become the ultimate mobile wireless device containing a distributed network with multiple vendor software and hardware. However the carýs embedded software which is expected to increase in size by 100 fold, will create a significant impact on the overall system safety. Furthermore wireless communications may create the possibility of terrorists or attackers gaining control of the automobile, hence security is also an important issue. How will designers cope with this complexity while at the same time ensure safety and security? Will new design approaches be required? Or can current design methodologies be used with new metrics, safety and security? This panel will bring together experts from the safety-critical industry, security industry, and experts from the insecure non-safety critical industry.
HELLO CENTRAL: AN OBJECT-ORIENTED DATA BROWSER
Authors: Hans Brunner, Steve Fogel, Robert Cuthbertson, Randall Sparks
Venue: ACM SIGCHI Bulletin (1991)

"U S WEST HELP" is a function provided by U S WEST Operator Services to facilitate contact between callers seeking information and the most appropriate point of response within U S WEST's 14-state region. The primary challenge in designing a user interface for these employees is to bridge the gap between the general public's conception of U S WEST's products, services, and pertinent functions and the way in which this information is structured and stored in one or more relational databases.