ppxscal/embedding_network huggingface dataset:
Fast All Nearest Neighbor Algorithms from Image Processing Perspective
Authors: Yuh-Rau Wang, Shi-Jinn Horng, Hung-Chang Chan
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01 (2005)

In this paper, we solve the k-dimensional all nearest neighbor (kD_ANN) problem, where k = 2 or 3, on a linear array with a reconfigurable pipelined bus system (LARPBS) from image processing perspective.Three scalable O(1) time algorithms are proposed, one for solving the Euclidean distance transform (EDT) problem and the other two for solving the all nearest neighbor (ANN) problem.First, for a two-dimensional (2D) binary image of size N x N, we devise an algorithm for solving the 2D_EDT problem using an LARPBS of size N^{2+¿} , where 0
A Generative Model of Human Hair for Hair Sketching
Authors: Hong Chen, Song Chun Zhu
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 2 - Volume 02 (2005)

Human hair is a very complex visual pattern whose representation is rarely studied in the vision literature despite its important role in human recognition. In this paper, we propose a generative model for hair representation and hair sketching, which is far more compact than the physically based models in graphics. We decompose a color hair image into three bands: a color band (a) (by Luv transform), a low frequency band (b) for lighting variations, and a high frequency band (c) for the hair pattern. Then we propose a three level generative model for the hair image (c). In this model, image (c) is generated by a vector field (d) that represents hair orientation, gradient strength, and directions; and this vector field is in turn generated by a hair sketch layer (e). We identify five types of primitives for the hair sketch each specifying the orientations of the vector field on the two sides of the sketch. With the five-layer representation (a-e) computed, we can reconstruct vivid hair images and generate hair sketches. We test our algorithm on a large data set of hairs and some results are reported in the experiments.
Debugging OWL ontologies
Authors: Bijan Parsia, Evren Sirin, Aditya Kalyanpur
Venue: Proceedings of the 14th international conference on World Wide Web (2005)

As an increasingly large number of OWL ontologies become available on the Semantic Web and the descriptions in the ontologies become more complicated, finding the cause of errors becomes an extremely hard task even for experts. Existing ontology development environments provide some limited support, in conjunction with a reasoner, for detecting and diagnosing errors in OWL ontologies. Typically these are restricted to the mere detection of, for example, unsatisfiable concepts. We have integrated a number of simple debugging cues generated from our description logic reasoner, Pellet, in our hypertextual ontology development environment, Swoop. These cues, in conjunction with extensive undo/redo and Annotea based collaboration support in Swoop, significantly improve the OWL debugging experience, and point the way to more general improvements in the presentation of an ontology to new users.
Prediction and Analysis of Rotor Tip-Clearance Flows using Large-Eddy Simulation
Authors: Donghyun You, Meng Wang, Parviz Moin, Rajat Mittal
Venue: Proceedings of the 2004 Users Group Conference (2004)

In order to analyze the dynamics of rotor tip-clearance flow and determine the underlying mechanism for the tip-leakage cavitation, a newly developed large-eddy simulation (LES) solver which combines an immersed-boundary method with a generalized curvilinearstructured grid has been employed. An analysis of the LES results has been performed to understand the mean flow field, turbulence characteristics, vortex dynamics, and pressure fluctuations in the turbomachinery cascade with tip gap. Based on thorough analysis of the flow field, a guideline for reducing viscous losses in the cascade is provided. Analyses of the energy spectra and space-time correlations of the velocity fluctuations suggest that the tip-leakage vortex is subject to pitchwise wandering motion. The largest pressure drop and most intense pressure fluctuations due to the formation of the tip-leakage vortex are found in the region where the tip-leakage vortex is strongest. The effects of tip-gap size and an end-wall groove on the tip-clearance vortical structures and on the velocity and pressure fields have been investigated to explore ways for minimizing the detrimental effects of cavitation. Attempts to investigate the vortex-rotor interaction and to enhance the LES capability for realistic rotors are also discussed.
Single-Row Transformation of Complete Graphs
Authors: Shaharuddin Salleh, Stephan Olariu, Bahrom Sanugi, Mohd Ismail Abd Aziz
Venue: The Journal of Supercomputing (2005)

A complete graph is a fully-connected graph where every node is adjacent to all other nodes in the graph. Very often, many applications in science and engineering are reducible to this type of graph. Hence, a simplified form of a complete graph contributes in providing the solutions to these problems. In this paper, we present a technique for transforming a complete graph into a single-row routing problem. Single-row routing is a classical technique in the VLSI design that is known to be NP-complete. We solved this problem earlier using a method called ESSR, and, the same technique is applied to the present work to transform a complete graph into its single-row routing representation. A parallel computing model is proposed which contributes in making the problem modular and scalable. We also discuss the application of this work on the channel assignment problem in the wireless cellular telephone networks.
Exploiting Barriers to Optimize Power Consumption of CMPs
Authors: Chun Liu, Anand Sivasubramaniam, Mahmut Kandemir, Mary Jane Irwin
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01 (2005)

Power consumption is an important concern for future billion transistor designs. This paper proposes a novel technique for optimizing the power consumption of chip-multiprocessors (CMPs) using an integrated hardware-software mechanism. By using a high level synchronization construct, called the barrier, our technique tracks the idle times spent by a processor waiting for other processors to get to the same point in the program. Using this knowledge, the frequency of the processors can be modulated to reduce/eliminate these idle times, thus providing power savings without compromising on performance. Using real applications from the SpecOMP suite, and a complete system CMP simulator, we demonstrate that this approach can provide as much as 40% power savings (and 32% on the average across five applications) with little impact on performance.
Morphing based on strain field interpolation: Research Articles
Authors: Han-Bing Yan, Shi-Min Hu, Ralph Martin
Venue: Computer Animation and Virtual Worlds (2004)

Strain fields provide a method of deformation measurement based on physics. Using these as a tool, we can analyze deformation of objects in a measurable way. We have developed a new morphing technique based on strain field interpolation. Shape shaking and squeezing, which often happen when using linear interpolation for morphing, do not arise in our approach. We have also developed a new method to create isomorphic meshes from corresponding objects in two images. Meshes generated by this method have much fewer triangles than other methods, which greatly decreases calculation loads in the morphing process. Copyright &copy; 2004 John Wiley & Sons, Ltd.
Traffic Aggregation Based SIP over MPLS Network Architecture
Authors: Bo Rong, Jacques Lebeau, Maria Bennani, Michel Kadoch, Ahmed K. Elhakeem
Venue: Proceedings of the 19th International Conference on Advanced Information Networking and Applications - Volume 1 (2005)

AbstractýThe next generation communication system will provide high quality multimedia service in a more flexible and intelligent manner. In this paper, we propose a new SIP over MPLS network architecture to achieve this goal. To integrate SIP protocol with the traffic engineering (TE) function of MPLS network seamlessly and facilitate SIP call setup, the SIP-MPLS traffic aggregation server (TA server) is highlighted in this new architecture. Furthermore, the call admission and bandwidth renegotiation algorithms running on the TA server are investigated carefully. We rely on OPNET simulation to assess the performance of our network architecture and the capability of different call admission and bandwidth re-negotiation algorithms. The simulation results show that the algorithm of TBCA-BP is a suitable candidate for accomplishing the call admission and bandwidth renegotiation task due to its satisfying performance, and our network architecture is able to shorten the SIP call setup delay greatly by using the TA server.
Malicious Behaviour in Content-Addressable Peer-to-Peer Networks
Authors: Thomas Reidemeister, Klemens Bohm, Paul A. S. Ward, Erik Buchmann
Venue: Proceedings of the 3rd Annual Communication Networks and Services Research Conference (2005)

Distributed Hash Tables (DHTs) promise to manage huge sets of key-value pairs in a Peer-to-Peer manner. The Content-Addressable Network (CAN) is a prominent variant of DHT. A critical challenge when designing a CAN, or indeed any DHT, is ensuring that all data items are accessible despite the presence of malicious and faulty peers. Such peers may hinder other peers in accessing the keys in various ways. In this paper we identify various types of attacks and propose, where possible, some countermeasures. To counter man-in-the-middle attacks we have developed a dynamically-adjustable multi-path routing algorithm. We evaluate the efficacy of our method both analytically and by simulation. For networks with less than 1% malicious peers we were able to reduce the effect of such attacks by 80%.
Feature congestion: a measure of display clutter
Authors: Ruth Rosenholtz, Yuanzhen Li, Jonathan Mansfield, Zhenlan Jin
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems (2005)

Management of clutter is an important factor in the design of user interfaces and information visualizations, allowing improved usability and aesthetics. However, clutter is not a well defined concept. In this paper, we present the Feature Congestion measure of display clutter. This measure is based upon extensive modeling of the saliency of elements of a display, and upon a new operational definition of clutter. The current implementation is based upon two features: color and luminance contrast. We have tested this measure on maps that observers ranked by perceived clutter. Results show good agreement between the observers' rankings and our measure of clutter. Furthermore, our measure can be used to make design suggestions in an automated UI critiquing tool.
Lowering power consumption in concurrent checkers via input ordering
Authors: Kartik Mohanram, Nur A. Touba
Venue: IEEE Transactions on Very Large Scale Integration (VLSI) Systems (2004)

This paper presents an efficient and scalable technique for lowering power consumption in checkers used for concurrent error detection. The basic idea is to exploit the functional symmetry of concurrent checkers with respect to their inputs, and to order the inputs such that switching activity (and hence power consumption) in the checker is minimized. The inputs of the checker are usually driven by the outputs of the function logic and check symbol generator logic--spatial correlations between these outputs are analyzed to compute an input order that minimizes power consumption. The reduction in power consumption comes at no additional impact to area or performance and does not require any alteration to the design flow. It is shown that the number of possible input orders increases exponentially in the number of inputs to the checker. As a result, the computational cost of determining the optimum input order can be very expensive as the number of inputs to the checker increases. This paper presents a very effective technique to build a reduced cost function to solve the optimization problem to find a near optimal input order. It scales well with increasing number of inputs to the checker, and the computational costs are independent of the complexity of the checker. Experimental results demonstrate that a reduction in power consumption of 16% on the average for several types of checkers can be obtained using the proposed technique.
Connectivity&ndash;splitting models for survivable network design
Authors: Anantaram Balakrishnan, Thomas L. Magnanti, Prakash Mirchandani
Venue: Networks (2004)

The survivable network design &lpar;SND&rpar; problem seeks a minimum-cost robust network configuration that provides a specified number of alternate &lpar;edge-disjoint&rpar; paths between nodes of the network. For this problem, we present a family of new mixed-integer programming formulations whose associated linear programming relaxations can be tighter than that of the usual cutset formulation. The new formulations, called connectivity-splitting models, strengthen the cutset formulation by splitting the connectivity requirements across critical cutsets &lpar;with crossing requirements of at least two&rpar; into two separate requirements and strengthening the connectivity constraints across regular cutsets &lpar;with crossing requirements of one&rpar;. As special cases of this broad modeling approach, we obtain three intuitive versions of the model. A connectivity-peeling version peels off the lowest connectivity level, a connectivity-dividing version divides the connectivity requirements for all critical cutsets, and an access-completion version separates the design decisions for critical cutsets from those for regular cutsets. These stronger formulations motivate several SND combinatorial heuristics and facilitate the analysis of their worst-case performance. Our bounds on the heuristic costs relative to the optimal values of the integer program and the linear programming relaxation of our tighter formulation are stronger than some previously known performance bounds for combinatorial heuristics. &copy; 2003 Wiley Periodicals, Inc.
On the core of the multicommodity flow game
Authors: Evangelos Markakis, Amin Saberi
Venue: Decision Support Systems (2005)

In the work of Papadimitriou [C.H. Papadimitriou, Algorithms, games, and the internet. In Annual ACM Symposium on the Theory of Computing (2001) pp. 749-753], he proposed a game theoretic framework for analyzing incentive issues in Internet routing. In particular, he defined the following coalitional game: Given a network with a multicommodity flow satisfying node capacity and demand constraints, the payoff of a node is the total flow originated or terminated at it. A payoff allocation is in the core of the game if and only if there is no subset of nodes that can increase their payoff by seceding from the network. We answer one of the open problems in the work of Papadimitriou [C.H. Papadimitriou, Algorithms, games, and the internet. In Annual ACM Symposium on the Theory of Computing (2001) pp. 749-753] by proving that for any network, the core is non-empty in both the transferable (where the nodes can compensate each other with side payments) and the non-transferable case. In the transferable case, we show that such an allocation can be computed in polynomial time. We also generalize this result to the case where a strictly concave utility function is associated with each commodity.
An Interactive Scalable Multimedia Streaming Scheme for VBR-Encoded Videos
Authors: Md. H. Kabir, Eric G. Manning, Gholamali C. Shoja
Venue: Proceedings of the 3rd Annual Communication Networks and Services Research Conference (2005)

The standard frame sequence of an MPEG encoded video stream is suitable for normal playback. However, its inter-frame dependency makes it difficult to use it for interactive playback modes, such as play backward, jump or fast forward/backward. A scalable streaming system is required to serve videos to a large number of clients and it should share a single server stream among many clients. However, different interactive clients generally ask for different playback sequences. Hence, their streams cannot be grouped and served together by a single server stream. Therefore, as the frequency of interaction increases, an ordinary scalable streaming service becomes a non-scalable service. In this paper, we have proposed an improved proxy-based streaming scheme over the Internet. We have used video segmentation and hybridtemporal-data-partition scalable video encoding to create suitable playback sequence for interactive playback modes. We have used prefix and smoothing buffers at the proxy to make our scheme scalable. Simulation results show that our streaming scheme remains fully scalable even when all the clients are highly interactive. By using certain part of the available server-proxy network bandwidth and proxy buffers, our streaming scheme can support large numbers of clients. As the level of interaction increases the relative bandwidth and the buffer requirement decreases.
GAZELLE: an interactive graphic logic design system
Authors: W. H. Sass
Venue: ACM SIGDA Newsletter (1974)

The "Gazelle" system is composed of a group of programs developed as tools* to aid the design engineer in the creation, simulation, analysis and test generation of digital logic. Gazelle is designed for use on an IBM 1130 computing system running under the "GLEAM" (Reference #1) multitask operating system. An IBM 2250 display console provides the engineer with the ability to interface with the computer in his development and simulation of a logic circuit.
A Toolkit for Automatically Constructing Outdoor Radio Maps
Authors: Kay Connelly, Yong Liu, Dan Bulwinkle, Adam Miller, Ian Bobbitt
Venue: Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume II - Volume 02 (2005)

Outdoor location systems based on Wireless Access Point (WAP) signal strength must either know the exact location of the WAPs in order to use a triangulation algorithm, or must construct a radiomap of the signal strengths. While the radio-map technique increases accuracy and can accommodate a wireless network that is not owned by any one entity, conventional methods for constructing a radio-map are labor-intensive and impractical in such environments. We introduce a toolkit for automatically constructing outdoor radio-maps. Our toolkit can easily be carried by delivery personnel and security guards during their normal work duties to obtain signal readings. The scattered data readings are then fed into an interpolation algorithm to construct a more complete grid that can be used as the radio-map.
Adaptive filtering of advertisements on web pages
Authors: Babak Esfandiari, Richard Nock
Venue: Special interest tracks and posters of the 14th international conference on World Wide Web (2005)

We present a browser extension to dynamically learn to filter unwanted images (such as advertisements or flashy graphics) based on minimal user feedback. To do so, we apply the weighted majority algorithm using pieces of the Uniform Resource Locators of such images as predictors. Experimental results tend to confirm that the accuracy of the predictions converges quickly to very high levels.
Rapidly Mixing Random Walks on Hypercubes with Application to Dynamic Tree Evolution
Authors: Keqin Li
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01 (2005)

In many tree-structured parallel computations, the size and shape of a tree that represents a parallel computation is unpredictable at compile-time. The tree evolves gradually during the course of the computation. When such an application is executed on a static network, the dynamic tree evolution problem is to distribute the tree nodes to the processors of the network such that all the processors receive roughly the same amount of load and that communicating nodes are assigned to neighboring processors. The main contribution of the paper is to describe a simple randomwalk-based asymptotically optimal dynamic tree evolution algorithm on hypercubes and analyze the speed at which the performance ratio converges to the optimal. Our strategy is to prove that the Markov chain of the random walk on a hypercube is rapidly mixing.
Further decomposition of the pseudoinverse and eigensystem of a Hermitian persymmetric matrix
Authors: Marvin J. Goldstein
Venue: ACM SIGNUM Newsletter (1978)

It is known that the computation of the pseudoinverse or eigensystem of a Hermitian persymmetric matrix decomposes into the corresponding computation for a real symmetric matrix of the same order. Herein it is shown that the decomposition proceeds further if the real symmetric matrix is of special form.
Signaled Step Size for Downlink Power Control of Dedicated Channels in UTRA TDD
Authors: Janne Kurjenniemi, Otto Lehtinen, Tapani Ristaniemi
Venue: Wireless Personal Communications: An International Journal (2004)

This paper discusses downlink inner loop power control of dedicated channels in UTRA TDD. The current UTRA TDD downlink power control is similar to one in UTRA FDD mode, that comprises of closed inner loop and quality based outer loop. However, due to the time division feature and associated fexibility with asymmetry of TDD, the inner loop can not react as fast as in FDD and it is affected by rapid changes in environment. Therefore, the effect of the inner loop algorithm to the performance of UTRA TDD network is studied in this paper. Especially, the use of asymmetric step sizes for "power up" and "power down" commands is evaluated in contrast to the conventional symmetric power adjustment. Since it would be beneficial for the downlink inner loop power control to reach the target SIR as fast as possible, the power control step size based on the difference between the UE measured SIR and target SIR would be the most desirable power adjustment. Since the effectiveness of this type of an algorithm depends on available signaling bandwidth that is used, a study is carried out to find the tradeoff between the signaling bandwidth and related network performance.
Looking for cancer clues in publicly accessible databases: Conference Reviews
Authors: Djamel Medjahed, Peter F. Lemkin, Gary W. Smythers, David J. Munroe
Venue: Comparative and Functional Genomics (2004)

What started out as a mere attempt to tentatively identify proteins in experimental cancer-related 2D-PAGE maps developed into VIRTUAL2D, a web-accessible repository for theoretical pI&#x002F;MW charts for 92 organisms. Using publicly available expression data, we developed a collection of tissue-specific plots based on differential gene expression between normal and diseased states. We use this comparative cancer proteomics knowledge base, known as the tissue molecular anatomy project (TMAP), to uncover threads of cancer markers common to several types of cancer and to relate this information to established biological pathways. Copyright &copy; 2004 John Wiley & Sons, Ltd.This article is a US Government work and is in the public domain in the USA.