ppxscal/embedding_network huggingface dataset:
Odin: Team VictorTango's entry in the DARPA Urban Challenge
Authors: Andrew Bacha, Cheryl Bauman, Ruel Faruque, Michael Fleming, Chris Terwelp, Charles Reinholtz, Dennis Hong, Al Wicks, Thomas Alberi, David Anderson, Stephen Cacciola, Patrick Currier, Aaron Dalton, Jesse Farmer, Jesse Hurdus, Shawn Kimmel, Peter King, Andrew Taylor, David Van Covern, Mike Webster
Venue: Journal of Field Robotics (2008)

The DARPA Urban Challenge required robotic vehicles to travel more than 90 km through an urban environment without human intervention and included situations such as stop intersections, traffic merges, parking, and roadblocks. Team VictorTango separated the problem into three parts: base vehicle, perception, and planning. A Ford Escape outfitted with a custom drive-by-wire system and computers formed the basis for Odin. Perception used laser scanners, global positioning system, and a priori knowledge to identify obstacles, cars, and roads. Planning relied on a hybrid deliberative-reactive architecture to analyze the situation, select the appropriate behavior, and plan a safe path. All vehicle modules communicated using the JAUS (Joint Architecture for Unmanned Systems) standard. The performance of these components in the Urban Challenge is discussed and successes noted. The result of VictorTango's work was successful completion of the Urban Challenge and a third-place finish. &copy; 2008 Wiley Periodicals, Inc.
A 5 GHz CMOS low power down-conversion mixer for wireless LAN applications
Authors: Shaikh K. Alam, Joanne DeGroat
Venue: Proceedings of the 5th WSEAS International Conference on Circuits, Systems, Electronics, Control & Signal Processing (2006)

This paper describes a 1.5-V 5 GHz I/Q down conversion mixer in a 0.18-µm CMOS process. The mixer achieves a conversion gain of 12.7 dB within 1-dB compression point (iCP1dB) of -15.83 dBm. It also achieves a double side band (DSB) NF of 13.5 dB. The mixer's IIP3 is -5.94 dBm. The mixer consumes only 5.72 mA of current from a 1.5-V power supply.
Microsoft Word 2007 Formatting (Intermediate) Quick Reference Guide
Authors: Beezix Inc
Venue:  (2007)

Laminated quick reference guide showing step-by-step instructions and shortcuts for how to use formatting features of Microsoft Office Word 2007 at the intermediate level. The following topics are covered: Showing the Ruler; Setting, Moving, Removing Tabs; Clearing Tab Settings; Setting Tabs with Leaders; Disabling Automatic Formatting; Using the Indent Markers; Using Easy Indent; Creating Bulleted, Numbered, and Multi-Level Lists. Paragraph Breaks vs. Line Breaks; Paragraph Spacing; Line Spacing; Clearing Formatting; Changing Default Font; Using Quick Styles; Using Themes to Format the Document; Creating a Text Box. Inserting a Table; Inserting Rows and Columns within a Table; Changing Column Widths; Merging and Splitting Cells; Centering a Table within the Margins; Changing Text Direction; Moving the Table; Wrapping Text around Tables; Adding Space within a Table; Paragraph/Cell Borders and Shading. Finding and Replacing Text; and Finding and Replacing Text Attributes. Also includes: Lists of Table Selection Shortcuts and Formatting Shortcuts. This guide is suitable as a training handout, or simply an easy to use reference guide, for any type of user.
Robust audio watermarking for copyright protection
Authors: Serap Kirbiz, Bilge Gunsel, Yusuf Yaslan
Venue: Proceedings of the 4th WSEAS International Conference on Signal Processing, Computational Geometry & Artificial Vision (2004)

This paper introduces an audio watermark encoding system that is robust to commonly used audio compression techniques such as MP3, AAC and OGG. The watermark is embedded by applying MPEG Layer 2 Model 2 psychoacoustic masking in an iterative way. The decoding is performed by using a correlation based blind decoding algorithm supported via a wavelet denoising module. Unlike most of the existing methods, the developed watermarking algorithm controls decoding errors at encoding stage, therefore guarantees 100% decoding accuracy on digital records. It does not require the original audio for decoding and robust to channel noise as well as changes in the sampling rate.
Information retrieval on bug locations by learning co-located bug report clusters
Authors: Ing-Xiang Chen, Hojun Jaygarl, Cheng-Zen Yang, Ping-Jung Wu
Venue: Proceedings of the 31st annual international ACM SIGIR conference on Research and development in information retrieval (2008)

Bug locating usually involves intensive search activities and incurs unpredictable cost of labor and time. An issue of information retrieval on bug locations is particularly addressed to facilitate identifying bugs from software code. In this paper, a novel bug retrieval approach with co-location shrinkage (CS) is proposed. The proposed approach has been implemented in open-source software projects collected from real-world repositories, and consistently improves the retrieval accuracy of a state-of-the-art Support Vector Machine (SVM) model.
Incremental planarity testing
Authors: G. Di Battista
Venue: Proceedings of the 30th Annual Symposium on Foundations of Computer Science (1989)

The incremental planarity testing problem consists of performing the following operations on a planar graph G with n vertices: (1) testing whether a new edge can be added to G so that the resulting graph is itself planar; (2) adding vertices and edges such that planarity is preserved. An efficient technique for incremental planarity testing that uses O(n) space and supports tests and insertion of vertices and edges in O(log n) time is presented. The bounds for queries and vertex insertions are worst case, and the bound for edge insertions is amortized.
Complexity analysis of a decentralised graph colouring algorithm
Authors: K. R. Duffy, N. O'Connell, A. Sapozhnikov
Venue: Information Processing Letters (2008)

Colouring a graph with its chromatic number of colours is known to be NP-hard. Identifying an algorithm in which decisions are made locally with no information about the graph's global structure is particularly challenging. In this article we analyse the complexity of a decentralised colouring algorithm that has recently been proposed for channel selection in wireless computer networks.
Proceedings of the 2008 workshop on Immersive projection technologies/Emerging display technologiges
Venue: International Conference on Computer Graphics and Interactive Techniques (2008)

Welcome to the Emerging Displays Technologies Workshop 2008. After the first successful co-location with SIGGRAPH in 2007, this one continues the trend, looking forward to another successful year. This time the workshop was extended to two days due to the inclusion of the Immersive Display Projection Technology (IPT) workshop. We bring to you an exciting and interesting program that covers new display technologies, new uses of EDT, and new techniques to run displays more efficiently. EDT brings a selection of the best research and practices in display technology currently happening around the world. Furthermore, EDT brings two panels of experts that will discuss the upcoming trends in display technology and that will engage the audience to also share their ideas during the discussion. We hope you find EDT motivating, engaging, and informative. Welcome to EDT 2008!
Efficient algorithms for counting parameterized list H-colorings
Authors: Josep Díaz, Maria Serna, Dimitrios M. Thilikos
Venue: Journal of Computer and System Sciences (2008)

We study the fixed parameter tractability of the counting version of a parameterization of the restrictive list H-coloring problem. The parameterization is defined by fixing the number of preimages of a subset C of the vertices in H through a weight assignment K on C. We show the fixed parameter tractability of counting the number of list (H,C,K)-colorings, for the case in which (H,C,K) is simple. We introduce the concept of compactor and a new algorithmic technique, compactor enumeration, that allow us to design fixed parameter algorithms for parameterized counting problems.
Performance prediction of component- and pattern-based middleware for distributed systems
Authors: Shruti Gorappa
Venue: Proceedings of the 4th on Middleware doctoral symposium (2007)

Design patterns, components, and frameworks have been successfully used to build various distributed real-time, and embedded (DRE) systems such as high-performance servers, telecommunication systems, and control systems. An application developer may choose from several approaches to implement a distributed application and the choice of design patterns and their configuration can impact the overall performance of the system. Unlike components, design patterns are often descriptions of a programming approach and need to be reified for each application. However, some core pattern implementations can often be reused across applications, if they can be correctly configured to meet application requirements. Currently, there is no general way to quantify the performance of components and design pattern implementations across various dimensions such as throughput, response time, and scalability. The overall performance of applications that are composed from pre-coded components and patterns can be inferred using analytical techniques by modeling the behavior of the individual components. In particular, while we know from experience that patterns exhibit various tradeoffs in terms of performance and complexity; we would like to explore these tradeoffs in a formal way. Toward this goal, we make the following contributions in this thesis: 1) we develop analytical models for various design patterns using queuing models, 2) we present a technique to analyze the performance of combinations of design patterns as observed in real-world applications, and 3) we validate the models using empirical measurements.
Proof Search and Counter Model of Positive Minimal Predicate Logic
Authors: Tao Xue, Qichao Xuan
Venue: Electronic Notes in Theoretical Computer Science (ENTCS) (2008)

This paper presents an algorithm of proof search for positive formulas in minimal predicate logic. It is based on the LJB deduction system introduced in [Dowek, G. and Y. Jiang, Eigenvariables, bracketing and the decidability of positive minimal predicate logic, Theoretical Computer Science 360 (2006), pp. 193-208]. The algorithm returns a deduction tree, and hence a proof, when the formula is provable, and a counter-model will be constructed when the formula is unprovable. The soundness and the completeness are proved.
Supporting document management by using RFID technology
Authors: Thierry Bodhuin, Rosa Preziosi, Maria Tortorella
Venue: International Journal of Internet Protocol Technology (2007)

A transition from traditional paper documents to digital ones is taking place, and standard ways for electronically managing documents are experimented. However, documents having legal value cannot be completely replaced by digital ones and must be kept in paper format. The authors claim that the adoption of RFID technology in an organisation helps to link, track and identify paper documents, and allows capturing additional data regarding the organisation information system and enriching the set of information produced by a traditional document management system. This paper presents an approach for building an RFID document management service.
Research on the eXpressDSP-Compliant Algorithms
Authors: Yun Wu, Yong Zhao, Jianshi Li
Venue: Proceedings of the First International Workshop on Knowledge Discovery and Data Mining (2008)

Digital signal processor (DSP) algorithms are sets of rules that specifies the order and form of arithmetic operations that are used on specified sets of data. The implementation of these DSP algorithms is often very different from one application system to another because systems have, for example, different memory management policies and I/O handling mechanisms. This paper targets these algorithms and assists the reader with making the algorithms compliant with the TMS320 DSP algorithm standard [1] which is part of TI's eXpressDSPTM technology initiative. Finally, the authors briefly introduced DSP architecture optimization for DSP algorithms.
A Multi-Lingual Translation System For Real-World Images
Authors: Erhan Önal, Noe Lopez-Benitez
Venue: Journal of Integrated Design Process Science (2006)

Translating text in real-world images presents several challenges such as text detection, text extraction, recognition, and translation. A multi-lingual translation system must take fundamental differences between the characteristics of different alphabets such as Latin, Cyrillic, Chinese, Korean, and Arabic into account. The system presented in this paper can extract text from real-world images with appropriate heuristics for these alphabets, as well as de-skew, binarize, recognize, and translate them. OCR is utilized to recognize the text, and the translation is employed using Translation Memory and Machine Translation. Experiments were also conducted to determine the most suitable segmentation and binarization algorithms for translation.
Collaborative OpenSocial Network Dataset Based Email Ranking and Filtering
Authors: Ismael Rivera, Myriam Mencke, Juan Miguel Gomez, Giner Alor-Hernandez, Angel Garcia-Crespo
Venue: Proceedings of the Third International Conference on Systems (2008)

Social Networks have experienced a meteoric rise recently. They provide a number of functionalities such as network of friends or business contacts listings, content-sharing, profile surfing, discussion and messaging tools. Interoperability among Social Networks being a key challenge, the Google-powered OpenSocial alliance has partly solved it and unveiled a new breed of strategies to gather data from SocialNetwork users. In this paper, we build on the OpenSocial functionality and combine it with filtering and ranking algorithm to enhance email management.
Evaporation based micro pump integrated into a scanning force microscope probe
Authors: F. Heuck, T. Hug, T. Akiyama, P. L. T. M. Frederix, A. Engel, A. Meister, H. Heinzelmann, N. F. de Rooij, U. Staufer
Venue: Microelectronic Engineering (2008)

A micro pump was integrated into a scanning force microscope probe for circulating liquid through its hollow cantilever and tip. The interior cross section of the cantilever was 2.25@mmx3.75@mm. All fluidic parts were made of SiO"2, while the tip apex was made of Si"3N"4. The key fabrication techniques were silicon wafer bonding and wet-oxidation. The pumping mechanism was relying on the enhanced evaporation at an enlarged water/air interface at the exit of the microchannel. Capillary forces continuously wetted this interfacial area, thus drawing the liquid through the system. At room temperature, a pump rate of 11pls^-^1 was experimentally evaluated. The observed temperature dependence of the pump rate could be qualitatively understood by a plain model calculation.
Hybrid Logics and Model Checking: A Recipe for Query Processing in Location-Aware Environments
Authors: Christian Hoareau, Ichiro Satoh
Venue: Proceedings of the 22nd International Conference on Advanced Information Networking and Applications (2008)

We introduce a novel approach to handle location-dependent query processing in location-aware environments. We define a hybrid logic-based query language by building a semantic model that benefits from the well-founded model checking techniques. Our language is defined by four modal operators; it can express common location-dependent queries, and has the ability to deal with relative locations. A prototype implementation of the query engine is also presented and will be discussed.
Computing the indices of Sturm-Liouville eigenvalues for coupled boundary conditions (the EIGENIND-SLP codes)
Authors: Guixia Wang, Zhong Wang, Hongyou Wu
Venue: Journal of Computational and Applied Mathematics (2008)

The main purpose of the EIGENIND-SLP codes is to compute the indices of known eigenvalues of self-adjoint Sturm-Liouville problems with coupled boundary conditions (BCs). The spectrum of the problems can be unbounded from both below and above. Using some recent theoretical results, the computation is converted to that of the indices of the same eigenvalues for appropriate separated BCs, and is then carried out in terms of the Prufer angle. The algorithm so generated and its implementation are discussed, and numerous examples are presented to illustrate the theoretical results and various aspects of the implementation.
Borealis-R: a replication-transparent stream processing system for wide-area monitoring applications
Authors: Jeong-Hyon Hwang, Sanghoon Cha, Uǧur Cetintemel, Stan Zdonik
Venue: Proceedings of the 2008 ACM SIGMOD international conference on Management of data (2008)

Borealis-R is a replication-based system for both fast and highly-available processing of data streams over wide-area networks. In Borealis-R, multiple operator replicas send outputs to downstream replicas, allowing each replica to use whichever data arrives first. To further reduce latency, replicas run without coordination, possibly processing data in different orders. Despite this flexibility, Borealis-R guarantees that applications always receive the same results as in the non-replicated, failure-free case. In addition, Borealis-R deploys replicas at select network locations to effectively improve performance as well as availability. We demonstrate the strengths of Borealis-R using a live wide-area monitoring application. We show that Borealis-R outperforms previous solutions in terms of latency and that it uses system resources efficiently by carefully deploying and discarding replicas.
Power minimization strategy in MOS transistors using quasi-floating-gate
Authors: Anand Paul, A. Ebenezer Jeyakumar, P. N. Neelakantan
Venue: Proceedings of the 2nd WSEAS International Conference on Electronics, Control and Signal Processing (2003)

The current trend for today's computing products has been mobile technology solutions. These products include cellular phones, laptop computers, personal digital assistants (PDA), and more. In order to provide reliable computing and communication devices such as the ones listed above, the components necessary to construct these devices must be designed for a low-power environment. This implies that the supply voltage and supply currents must be lowered to realize longer battery life and thus consumer approval. A novel design technique for closed-loop amplifier circuits, suited to very low supply voltages, is proposed. This paper will show a method known as Quasi-Floating-Gate (QFG) MOS transistors that allows the operation of amplifier circuits at very low supply voltages. QFG transistors are particularly suitable to applications involving closed-loop amplifier circuits based on multiple-input capacitive dividers. QFG transistors have noticeable gains over current floating-gate MOS transistors in that floating-gate MOS structures are subject to Gain-Bandwidth product degradation and large initial floating gate charge. The applications presented in this paper are vital for the mobile system environment. Included herein are a programmable gain inverting amplifier, a sample and hold circuit, and a digital-to-analog converter, which are all composed of QFG input pair transistors. Each circuit will be discussed in detail as well as the building blocks for these circuits, including the QFG transistor.
XML Information Retrieval Based on Tree Matching
Authors: Mohamed Benaouicha, Mohamed Tmar, Mohand Boughanem, Mohamed Abid
Venue: Proceedings of the 15th Annual IEEE International Conference and Workshop on the Engineering of Computer Based Systems (2008)

This paper presents an information retrieval model in XML documents based on tree matching. Queries and documentsare represented by extended trees. Therefore only one level separates between each node and its indirect descendants. This allows to compare easily structural constraints of the user query and the document structure with flexibility. Thus document fragments (elements) returned in response to the query are the most similar ones to the query tree.
Study on the Knowledge Visualization and Creation Supported Kmap Platform
Authors: Zhang Yongjin, He Xinyan, Xie Jiancang, Wang Zhiguo
Venue: Proceedings of the First International Workshop on Knowledge Discovery and Data Mining (2008)

With the development of knowledge management, knowledge now becomes the key competitiveness of enterprises and organizations, how to do knowledge acquisition and creation efficiently becomes very important. Considering that most knowledge is implicit, based on the SECI knowledge transformation model, utilizes knowledge visualization technology, we developed a platform which supports acquisition of explicit knowledge, and helps to externalize implicit knowledge to explicit "new knowledge, and takes knowledge map as the carrier to encourage knowledge delivery, sharing and creation, so to improve the key competitiveness of enterprises and organizations.
Better lower bounds on detecting affine and spherical degeneracies
Authors: J. Erickson, R. Seidel
Venue: Proceedings of the 1993 IEEE 34th Annual Foundations of Computer Science (1993)

We show that in the worst case, /spl Omega/(n/sup d/) sidedness queries are required to determine whether a set of n points in R/sup d/ is affinely degenerate, i.e., whether it contains d+1 points on a common hyperplane. This matches known upper bounds. We give a straightforward adversary argument, based on the explicit construction of a point set containing /spl Omega/(n/sup d/) "collapsible" simplices, any one of which can be made degenerate without changing the orientation of any other simplex. As an immediate corollary, we have an /spl Omega/(n/sup d/) lower bound on the number of sidedness queries required to determine the order type of a set of n points in R/sup d/. Using similar techniques, we also show that /spl Omega/(n/sup d+1/) in-sphere queries are required to decide the existence of spherical degeneracies in a set of n points in R/sup d/.
How Many Test Patterns are Useless?
Authors: François-Fabien Ferhani, Nirmal R. Saxena, Edward J. McCluskey, Phil Nigh
Venue: Proceedings of the 26th IEEE VLSI Test Symposium (2008)

Studies by previous researchers using production test data reported that not all the production test patterns applied detected defective chips. Researchers found that 70% to 90% of their production test patterns seemed useless because these patterns detected no defective chips and they could therefore be removed without impacting test quality. Previous researchers qualitatively explained this finding by a lack of correlation between test metrics and defect coverage. Notwithstanding the lack of correlation between test metrics and defect coverage, in this paper we develop a simple statistical model that relates the expected number of useless patterns to the production yield, the defect coverage characteristics, and the number of tested chips. This model demonstrates that for practical values of production yield, defect coverage and number of chips tested, a significant fraction of test patterns will be useless. We validated this statistical model by comparing its results with actual production testing data.
A recovery mechanism for errors caused by a late subjob in a system handling SLA-based Grid workflows
Authors: Dang Minh Quan, Jorn Altmann
Venue: International Journal of Web and Grid Services (2008)

Supporting SLAs (Service Level Agreements) for Grid-based workflows requires providing mechanisms for handling errors (i.e., the failures of subjobs). In the context of this paper, we propose an error recovery mechanism which can handle one failed subjob of a workflow. The error recovery mechanism has a maximum of three phases, depending on the impact of the error. In each phase, we use a dedicated algorithm to remap the subjobs of the workflow to the resources. The main contributions of the paper are the error recovery mechanism for SLA-based workflows and the mapping algorithm G-map, which is used in the first phase of the recovery mechanism. The G-map remaps the groups of subjobs, which are directly affected by an error. The efficiency of the proposed algorithm is validated through simulation results.