ppxscal/embedding_network huggingface dataset:
Indexing Relational Database Content Offline for Efficient Keyword-Based Search
Authors: Qi Su, Jennifer Widom
Venue: Proceedings of the 9th International Database Engineering & Application Symposium (2005)

Information Retrieval systems such as web search engines offer convenient keyword-based search interfaces. In contrast, relational database systems require the user to learn SQL and to know the schema of the underlying data even to pose simple searches. We propose an architecture that supports highly efficient keyword-based search over relational databases: A relational database is "crawled" in advance, text-indexing virtual documents that correspond to interconnected database content. At query time, the text index supports keyword-based searches with interactive response, identifying database objects corresponding to the virtual documents matching the query. Our system, EKSO, creates virtual documents from joining relational tuples and uses the DB2 Net Search Extender for indexing and keyword-search processing. Experimental results show that index size is manageable and database updates (which are propagated incrementally as recomputed virtual documents to the text index) do not significantly hinder query performance. We also present a user study confirming the superiority of keyword-based search over SQL for a range of database retrieval tasks.
An Efficient Distributed Broadcasting Algorithm forWireless Ad Hoc Networks
Authors: Yamin Li, Shietung Peng, Wanming Chu
Venue: Proceedings of the Sixth International Conference on Parallel and Distributed Computing Applications and Technologies (2005)

In this paper, we propose a distributed broadcasting algorithm for wireless ad hoc networks. In the algorithm, an efficient strategy is used to determine the forward status of a node by just checking whether there exists a ring that contains all its neighbors. The proposed algorithm is more efficient than the existing broadcasting algorithms in the literatures. That is, the size of the forwarding nodes found by our algorithm is smaller and the running time is faster than other broadcasting algorithms. Reducing the number of forwarding nodes will decrease the probability of transmission collision, and hence improve the packet delivery ratio. The algorithm runs in O(d2) time, where d is the maximum node degree. The full coverage is not guaranteed but as shown by the simulation results, the probability of full coverages can be over 99 percent when the network contains 100 or more nodes.
High-speed cable-based robots with translational motion
Authors: Saeed Behzadipour
Venue:  (2005)

The development of a new class of high-speed cable-based manipulators is presented in this thesis and fundamental challenges specific to these manipulators are addressed. Cables are used in the architecture of these manipulators to provide kinematic constraints to lower the number of degrees of freedom and minimize the moving inertia. Five new designs of these manipulators are presented which provide pure translational motion in spatial and planar workspace. Since cables can only stand tensile forces, the rigidity of the cable-based manipulators becomes the most essential issue in their design and operation. To address this, a systematic approach to study the rigidity of these manipulators is developed. It is analytically proved that most of these manipulators stay rigid everywhere in their workspace under any external load using a spinal element that applies a constant pushing force on the end-effector. Geometry is used in this work to develop a modeling approach to investigate the ability of cable-based manipulators in the handling of payloads. Force and torque capacity of these manipulators are defined as the set of all forces and/or torques they can apply before losing their rigidity. Based on this, an optimum design procedure is developed for determining the pretension of the cables when a symmetric force/torque capacity is required. The stiffness and stability of cable-based manipulators are also studied. It is shown that the cables' pretension, necessary for the rigidity of these manipulators, affects the stiffness of the manipulator and hence, may result in their instability. The conditions under which the manipulator is stabilizable are derived. A stabilizable manipulator never becomes unstable due to increasing the pretension of the cables. Trajectory planning of cable-based manipulators is also investigated. A time-optimal trajectory is found considering the condition of the cable tensions. Time-optimal technique along with a non-optimal but more computationally efficient method for real-time trajectory planning are implemented and compared on DeltaBot. DeltaBot is a cable-based manipulator prototyped in this research. It has three translational degrees of freedom and is aimed at high-speed pick-and-place applications. DeltaBot is designed to be able to produce 4g of acceleration everywhere in its workspace in any direction on a pay load of 1kg. DeltaBot has been successfully tested for 120 cycles of pick-and-place operations per minute.
Context-aware, Ontology-based Recommendations
Authors: Christian Rack, Stefan Arbanowski, Stephan Steglich
Venue: Proceedings of the International Symposium on Applications on Internet Workshops (2006)

In this paper we study the synergy between user behavior, context data, and semantic information in order to enable future services to adapt to different situations based on the recommendations of a serviceindependent recommender. Therefore, we propose a system that delivers context-aware recommendations, which are based on provided feedback, context data, and an ontology-based content categorization scheme. We provide a detailed overview of the specification, a short description of a possible service scenario and a discussion of the results.
A modified mountain clustering algorithm
Authors: Miin-Shen Yang, Kuo-Lung Wu
Venue: Pattern Analysis Applications (2005)

In this paper, we modify the mountain method and then create a modified mountain clustering algorithm. The proposed algorithm can automatically estimate the parameters in the modified mountain function in accordance with the structure of the data set based on the correlation self-comparison method. This algorithm can also estimate the number of clusters based on the proposed validity index. As a clustering tool to a grouped data set, the modified mountain algorithm becomes a new unsupervised approximate clustering method. Some examples are presented to demonstrate this algorithm&#x2019;s simplicity and effectiveness and the computational complexity is also analyzed.
ExScal: Elements of an Extreme Scale Wireless Sensor Network
Authors: Anish Arora, Rajiv Ramnath, Emre Ertin, Prasun Sinha, Sandip Bapat, Vinayak Naik, Vinod Kulathumani, Hongwei Zhang, Hui Cao, Mukundan Sridharan, Santosh Kumar, Nick Seddon, Chris Anderson, Ted Herman, Nishank Trivedi, Chen Zhang, Mikhail Nesterenko, Romil Shah, Sandeep Kulkarni, Mahesh Aramugam, Limin Wang, Mohamed Gouda, Young-ri Choi, David Culler, Prabal Dutta, Cory Sharp, Gilman Tolle, Mike Grimmer, Bill Ferriera, Ken Parker
Venue: Proceedings of the 11th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (2005)

Project ExScal (for Extreme Scale) fielded a 1000+ node wireless sensor network and a 200+ node peer-to-peer ad hoc network of 802.11 devices in a 1.3km by 300m remote area in Florida, USA during December 2004. In comparison with previous deployments, the ExScal application is relatively complex and its networks are the largest ones of either type fielded to date. In this paper, we overview the key requirements of ExScal, the corresponding design of the hardware/software platform and application, and some results of our experiments.
Real 3G WCDMA Networks Performance Analysis
Authors: Nadjia Kara, Omneya Issa, Alain Byette
Venue: Proceedings of the The IEEE Conference on Local Computer Networks 30th Anniversary (2005)

Third generation (3G) technologies are becoming more widely deployed. However, a prerequisite for the successful deployment of such services is the measurement of practical performance characteristics offered by the underlying wireless network (e.g. 3G). This paper presents the results of a number of experiments aiming to identify the performance of a real WCDMA (Wideband Code Division Multiple Access) -based wireless network for different types of applications: FTP, HTTP, VoIP, and audio and video streaming. Moreover, the paper discusses the impact on the measured performance by assigning different QoS profiles to end-users. Based on the evaluation results, the paper provides a set of recommendations for both operators and service developers when designing and deploying applications on such wireless networks. These recommendations can also help researchers in accurately validating 3G wireless network research proposals.
Peer review and the planning process
Authors: Robert J. Robinson
Venue: ACM SIGUCCS Newsletter (1980)

ACM's Special Interest Group on University Computer Centers (SIGUCC) has instituted a program to foster peer reviews among computing centers. That program is conceived as giving external advice and guidance to computer center directors, and is an appropriate mechanism for certain classes of need. However, at SUNY - Albany peer or external review is used in quite a different way--one integrally bound to the planning process. This paper describes our strategy and methodology in that context.
Power-Constrained Hybrid BIST Test Scheduling in an Abort-on-First-Fail Test Environment
Authors: Zhiyuan He, Gert Jervan, Zebo Peng, Petru Eles
Venue: Proceedings of the 8th Euromicro Conference on Digital System Design (2005)

This paper presents a method for power-constrained system-on-chip test scheduling in an abort-on-first-fail environment where the test is terminated as soon as a fault is detected. We employ the defect probabilities of individual cores to guide the scheduling, such that the expected total test time is minimized and the peak power constraint is satisfied. Based on a hybrid BIST architecture where a combination of deterministic and pseudorandom test sequences is used, the power-constrained test scheduling problem can be formulated as an extension of the two-dimensional rectangular packing problem and a heuristic has been proposed to calculate the near optimal order of different test sequences. The method is also generalized for both test-per-clock and test-per-scan approaches. Experimental results have shown that the proposed heuristic is efficient to find a near optimal test schedule with a low computation overhead.
Gate-Induced Barrier Field Effect Transistor (GBFET) — A New Thin Film Transistor for Active Matrix Liquid Crystal Display Systems
Authors: Jayakumaran Sivagnaname, Hung C. Ngo, Kevin J. Nowka, Robert K. Montoye, Richard B. Brown
Venue: Proceedings of the 19th International Conference on VLSI Design held jointly with 5th International Conference on Embedded Systems Design (2006)

Wide circuit implementation of Limited Switch Dynamic Logic (LSDL), a high performance logic circuit, with a modified pseudo-nMOS style load has been studied in this paper. A conventional two levels of 8-way mux implementation and a wide 64-way mux implementation of the 64-bit rotator circuit were used in the analysis. The resultant wide circuit implementation consumes less power, maintains robustness to noise and power rail bounce and reduces the pipeline depth to a single stage. The effect of process variation on circuit performance is evaluated. Based on the analysis, a new circuit style known as hybrid LSDL has been proposed.
Optimizing computer imagery for more effective visual communication
Authors: Bruce Gooch
Venue:  (2005)

Computers are becoming faster, smaller, and more interconnected, creating a shift in their primary function from computation to communication. This trend is exemplified by ubiquitous devices such as cellular phones with cameras, personal digital assistants with video, information displays in automobiles, and computer screens in elevators and refrigerators. At the same time, progress in networking and storage technologies allows large quantities of image and video data to be provided whenever desired. Rapid advances in technology allow computer screens to be filled with complex information at real-time rates. Simulations that once required supercomputers are commonly run on desktop applications. While the computer industry has produced faster processors, larger disk drives, and higher memory capacity, these advances do little to help people understand the meaning and representation of data. This lack of understanding stems from the fact machines process data in numerical form, while humans comprehend visual data more easily. As communication infrastructure and viewing situations become more plentiful, we need imagery that facilitates visual communication across a wide range of display devices. In addition, producing effective and expressive visual content currently requires considerable artistic skill and can consume days. The goal of my research is to develop new algorithms and user interfaces that enhance visual communication, while making it fast and easy to generate compelling content. My research combines concepts and methods from visual art, perceptual psychology, information processing and cognitive science to facilitate users in creating, understanding, and interpreting computer imagery. In conformance to these goals, my research includes retargeting large images for smaller displays by maximizing the recognizability of more important features in the retargeted images, and generating new file icons that better reveal the files' intent or purpose. This dissertation presents three techniques for automatically retargeting imagery to smaller displays and desktop interfaces: (1) An image retargeting method for adapting photographs to smaller display sizes. (2) A technique for generating more meaningful desktop file icons. (3) A vector graphics approach for retargeting animation and informational images to smaller display sizes.
A topology-preserving polygonal simplification using vertex clustering
Authors: Takayuki Kanaya, Yuji Teshima, Ken-ichi Kobori, Koji Nishio
Venue: Proceedings of the 3rd international conference on Computer graphics and interactive techniques in Australasia and South East Asia (2005)

Product developers have used a lot of polygon data, approximated from 3D-CAD data, as a collaboration tool on the Internet. It is difficult to deal with this data for example with respect to transmission, computational cost, or rendering, so simplification algorithms are required for data compression. In general, a vertex-clustering algorithm in simplification algorithms is very fast, although it has the problem that topology information is not preserved and for some applications, such as 3D-CAD, it is important to preserve topology information. We define topology information in this paper as genus on the polyhedron and 2-manifold. In this paper, we propose a topology-preserving simplification method using a depth-first search tree on a vertex-clustering algorithm. Our method does not lose the advantage that vertex-clustering algorithms are fast yet it solves the problem of lost topology information. Experimental results show that this method is effective and is easily adapted to space division algorithms of other vertex-clustering algorithms
Push-Style Guidance System for Technical Document Writing
Authors: Koichi Tanigaki, Takashi Hirano, Yasuhiro Okada
Venue: Proceedings of the Eighth International Conference on Document Analysis and Recognition (2005)

This paper proposes a design work support system called "push-style guidance system". The system automatically presents some advisory information that helps designers to write technical documents. When the designer adds or revises text on word processor, the text line is immediately sent to the knowledge server with its document structure information, which indicates the location of the text in the document. The server reconstructs the current contents of the document by combining the text lines based on the document structure information. The server analyzes the reconstructed document contents, and evaluates the conformity of preserved guidance generation rules to select appropriate ones. From the selected rules, guidance information is generated and is sent back to the word processor. This enables the simultaneous presentation of information appropriate to the written contents in progress. We have developed a prototype system and evaluated the appropriateness of provided guidance information in a task of writing specifications about electric circuits. Experimental results show that the proposed system performs better than naive systems.
Physical placement driven by sequential timing analysis
Authors: A. P. Hurst, P. Chong, A. Kuehlmann
Venue: Proceedings of the 2004 IEEE/ACM International conference on Computer-aided design (2004)

Traditional timing-driven placement considers only combinational delays and does not take into account the potential of subsequent sequential optimization steps. As a result, the potential of re-balancing path delays through post-placement applications of clock skew scheduling and in-place retiming cannot be fully realized. In this paper we describe a new placement algorithm that is based on a tight integration of sequential timing analysis in the inner loop of an analytic solver. Instead of minimizing the maximum path delay, our approach minimizes the maximum mean delay on any circuit loop, thus enabling the full optimization potential of clock skew scheduling and in-place retiming. We present two versions of the new algorithm: one approximates sequential criticality and weights wires accordingly (Cong and Lim, 2000), the other extends this with the inclusion of explicit wire-length constraints for loops that limit the final clock period. Our algorithms are implemented using a hybrid, GORDlAN-style sequence of analytical placement steps interleaved with cell partitioning (Kleinhans et al., 1988). Our experiments on a set of large industrial designs demonstrate that the presented placement algorithm can minimize the contribution of interconnection delays to the clock period on average by 23.5% compared to a solution based on combinational delays.
Playas: homeland mirage
Authors: Jack Stenner, Andruid Kerne, Yauger Williams
Venue: Proceedings of the 13th annual ACM international conference on Multimedia (2005)

This paper describes an interactive installation that addresses issues of presence and absence by creating a virtualized representation of the abandoned town, Playas, New Mexico. This town is slated for conversion into an anti-terrorism training facility by New Mexico Tech University in conjunction with the United States Department of Homeland Security. Using the metaphor of the mirage, the work functions as a critique of our understanding of "reality.
A Novel Context Matching Based Technique for Web Document Retrieval
Authors: John Zakos, Brijesh Verma
Venue: Proceedings of the Eighth International Conference on Document Analysis and Recognition (2005)

This paper presents a novel context matching technique for the retrieval of web documents. The aim of the technique is to dynamically generate a contextbased measure of document term significance during retrieval that can be used as a substitute or cocontributor of the term frequency measure. Unlike term frequency, which relies on a term to occur multiple times within a document to be considered significant, context matching is based on the notion that if a term in a given document occurs in that document in the context of the query, then that term is deemed to be significant. Context matching has the ability to potentially determine a term to be significant even if it occurs only once in a large document. The proposed technique has been implemented and the experiments were conducted using a TREC benchmark database. A comparative analysis shows that context matching significantly improves retrieval effectiveness and outperforms previously published results.
Colour constancy theories in the real world
Authors: Florian Ciurea
Venue:  (2004)

In recent years, several methods to solve the colour constancy problem have been introduced and studied. Colour constancy is an important area in machine vision: it provides a visual system with the capability to compensate for the effect of illumination in a scene. The colours we humans perceive are not easily expressible by a physical apparatus, which is in fact more sensitive to changes in illumination conditions. The human visual system is able to make several compensations and adjustments to ambient illumination conditions, so that we perceive illuminant-independent descriptors of the scene. This thesis represents a series of experimental approaches to the colour constancy problem. An important part focuses on discussions and concrete implementations of the well-known and controversial Retinex model for human vision and application of the method on real images and choosing its parameters. The Retinex theory of human vision represents an important contribution in colour vision with strong implications in the colour constancy problem. Although the theory has been around for more than three decades, the lack of an efficient implementation and analysis of the effect of its parameters has raised many discussions and scepticism. This part of the thesis provides some common ground in further investigations into the Retinex theory. A novel method for acquiring a large database for colour constancy research is presented, along with direct applications with improvements to the colour by correlation method. A large image database for colour constancy provides sufficient data to compute some meaningful statistics with respect to the interaction between the colours observed in the world and the actual measured illuminants in which these colours are recorded. The use of these statistics in the Bayesian approach improves the performance of the colour by correlation method for colour constancy. Another application is in the form of testing the effectiveness on real images of a recently introduced theory for colour constancy using the redness-luminance correlation in scenes.