ppxscal/embedding_network huggingface dataset:
Radio link enhancement using an open flexible protocol stack framework: Research Articles
Authors: Tim Farnham
Venue: Wireless Communications Mobile Computing (2005)

This paper explores radio link enhancement utilising dynamic run-time software download and configuration. In particular, the insertion of virtual medium access control (MAC), hybrid automatic repeat request (ARQ) and compression enhancement layers are considered in this paper. This is made possible with a flexible protocol stack framework, which permits the insertion of protocol layers and configuring them in a platform-independent manner. A general purpose central processing unit (CPU) environment is used in order to assess performance and power consumption of this proposed approach. The results presented indicate that there are scenarios in which this approach is attractive and that execution environment optimisations for performing generic protocol functions can increase the applicability to more scenarios.Currently protocols, and in particular link layer protocols, are designed to support specific traffic and underlying radio propagation characteristics and network topologies that are expected to be observed in a range of deployment scenarios in a manner that is determined at a system design time. As a result, this leads to many different solutions that are tailored to the particular and quite specific requirements such as short range personal area networks (PAN) based on bluetooth or ultra wide band (UWB), local area networks (LAN) based on 802.11 and of course many wide area cellular networks. These solutions cannot be changed to support traffic characteristics and radio performance observed in scenarios that were not envisaged at the time of standardisation. Hence, many new releases of standards are generated to incorporate these new and often optional features that often cannot be used because not all devices support these features. A flexible protocol stack framework has been proposed to provide the ability to insert and configure new software protocol implementations at run time. The overall benefit of this is that new optional features can be exploited before or without standardisation. In addition, dynamic optimisation can be performed to tailor the protocol configuration to specific scenarios and adapt to the changing radio environment. Copyright &copy; 2005 John Wiley & Sons, Ltd.
Symbolic additive decomposition of rational functions
Authors: S. P. Polyakov
Venue: Programming and Computing Software (2005)

The problem of additive decomposition of rational functions minimizing the degree of the remainder's denominator with the additional minimization of the degree of the remainder's numerator is considered. An algorithm that solves this problem under certain additional assumptions is proposed. This algorithm is implemented in Maple.
Shotgun cloning of transposon insertions in the genome of Caenorhabditis elegans: Short Communications
Authors: Alexander M. van der Linden, Ronald H. A. Plasterk
Venue: Comparative and Functional Genomics (2004)

We present a strategy to identify and map large numbers of transposon insertions in the genome of Caenorhabditis elegans. Our approach makes use of the mutator strain mut-7, which has germline-transposition activity of the Tc1&#x002F;mariner family of transposons, a display protocol to detect new transposon insertions, and the availability of the genomic sequence of C. elegans. From a pilot insertional mutagenesis screen, we have obtained 351 new Tc1 transposons inserted in or near 219 predicted C. elegans genes. The strategy presented provides an approach to isolate insertions of natural transposable elements in many C. elegans genes and to create a large-scale collection of C. elegans mutants. Copyright &copy; 2004 John Wiley & Sons, Ltd.
Web data extraction based on partial tree alignment
Authors: Yanhong Zhai, Bing Liu
Venue: Proceedings of the 14th international conference on World Wide Web (2005)

This paper studies the problem of extracting data from a Web page that contains several structured data records. The objective is to segment these data records, extract data items/fields from them and put the data in a database table. This problem has been studied by several researchers. However, existing methods still have some serious limitations. The first class of methods is based on machine learning, which requires human labeling of many examples from each Web site that one is interested in extracting data from. The process is time consuming due to the large number of sites and pages on the Web. The second class of algorithms is based on automatic pattern discovery. These methods are either inaccurate or make many assumptions. This paper proposes a new method to perform the task automatically. It consists of two steps, (1) identifying individual data records in a page, and (2) aligning and extracting data items from the identified data records. For step 1, we propose a method based on visual information to segment data records, which is more accurate than existing methods. For step 2, we propose a novel partial alignment technique based on tree matching. Partial alignment means that we align only those data fields in a pair of data records that can be aligned (or matched) with certainty, and make no commitment on the rest of the data fields. This approach enables very accurate alignment of multiple data records. Experimental results using a large number of Web pages from diverse domains show that the proposed two-step technique is able to segment data records, align and extract data from them very accurately.
A New Real Time Object Segmentation and Tracking Algorithm and its Parallel Hardware Architecture
Authors: Mahmound Meribout, Mamoru Nakanishi
Venue: Journal of VLSI Signal Processing Systems (2005)

Most of the emerging content-based multimedia technologies are based on efficient methods to solve machine early vision tasks. Among other tasks, object segmentation is perhaps the most important problem in single image processing. The solution of this problem is the key technology of the development of the majority of leading-edge interactive video communication technology and telepresence systems. The aim of this paper is to present a robust framework for real-time object segmentation and tracking in video sequences taken simultaneously from different perspectives. The other contribution of the paper is to present a new dedicated parallel hardware architecture. It's composed of a mixture of Digital Signal Processing (DSP) and Field Programmable Gate Array (FPGA) technologies and uses the Content Addressable Memory (CAM) as a main processing unit. Experimental results indicate that small amount of hardware can deliver real-time performance and high accuracy. This is an improvement over previous systems, where execution time of the second-order using a greater amount of hardware has been proposed.
Texture sprites: texture elements splatted on surfaces
Authors: Sylvain Lefebvre, Samuel Hornus, Fabrice Neyret
Venue: Proceedings of the 2005 symposium on Interactive 3D graphics and games (2005)

We present a new interactive method to texture complex geometries at very high resolution, while using little memory and without the need for a global planar parameterization. We rely on small texture elements, the texture sprites, locally splatted onto the surface to define a composite texture. The sprites can be arbitrarily blended to create complex surface appearances. Their attributes (position, size, texture id) can be dynamically updated, thus providing a convenient framework for interactive editing and animated textures. We demonstrate the flexibility of our method by creating new surface aspects difficult to achieve with other methods.Each sprite is described by a small set of attributes which is stored in a hierarchical structure surrounding the object's surface. The patterns supported by the sprites are stored only once. The whole data structure is compactly encoded into GPU memory. At run time, it is accessed by a fragment program which computes the final appearance of a surface point from all the sprites covering it. The overall memory cost of the structure is very low compared to the resulting texturing resolutions. Rendering is done in real-time. The resulting texture is linearly interpolated and filtered.
Book review: Basic Category Theory fox Computer Scientists by Benjamin C. Pierce (MIT Press, 1991)
Venue: ACM SIGART Bulletin (1992)

"Basic Category Theory for Computer Scientists," by Benjamin C. Pierce, is an excellent introduction of the branch of mathematics called category theory, and its application to computer science. As the title suggests, this book covers the basics of category theory, and presupposes no prior knowledge of it. The author motivates the development of category theory with examples from computer science, rather than the mathematical examples found in the standard mathematical treatises on category theory.
Computer understanding of descriptive contexts: U. of Central Florida
Authors: Fernando Gomez
Venue: Issue 79 (January 1982) (1982)

I am concerned with the development of a theory of computer comprehension of descriptive contexts. By "descriptive contexts" I refer to the language of scientific books, text books, of this text etc. An important characteristic of these contexts is the predominance of descriptive predicates and verbs (verbs such as "contain", "refer", "Consist of", ...) over action verbs. In the distinction performative vs. declarative, descriptive texts clearly fall in the declarative side. Most of the best work on natural language has dealt with contexts in which the computer understanding depends on the meaning of the action verbs and the human actions (plans, goals) indicated by them. This work has had very little bearing on a theory of computer understanding of descriptive contexts. One of the main tenets of my research is that descriptive contexts call for different theoretical ideas from those proposed for the understanding of human actions, although there are some points of contact.
Technical Reports
Authors: Steve Pemberton
Venue: ACM SIGCHI Bulletin (1993)

The following list of papers/reports are available on-line and will be sent via Email upon request to: sajja@central.cis.upenn.edu
Research in natural language processing: U. of California at Berkeley
Authors: Robert Wilensky
Venue: Issue 79 (January 1982) (1982)

Research at Berkeley concerns a variety of topics involving Artificial Intelligence and natural language processing. This work includes the development of theories of how humans perform tasks requiring intelligence, and the testing and development of these theories by the construction of computer simulations. The following is a brief description of individual research projects.
Computational studies of formal theories of natural language: Oregon State University
Authors: Douglas Moran
Venue: Issue 79 (January 1982) (1982)

This research is oriented towards the development of process versions of descriptive theories of natural language. Present investigations are concentrating on the family of formal theories known as Montague Grammar, and especially on those derived from PTQ [4]. These theories are the subject of active investigation by both linquists and philosophers, and the fundamental characteristics of these theories make them computationally attractive.
Evaluating Image Retrieval
Authors: Nikhil V. Shirahatti, Kobus Barnard
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 1 - Volume 01 (2005)

We present a comprehensive strategy for evaluating image retrieval algorithms. Because automated image retrieval is only meaningful in its service to people, performance characterization must be grounded in human evaluation. Thus we have collected a large data set of human evaluations of retrieval results, both for query by image example and query by text. The data is independent of any particular image retrieval algorithm and can be used to evaluate and compare many such algorithms without further data collection. The data and calibration software are available on-line (http://kobus.ca/research/data). We develop and validate methods for generating sensible evaluation data, calibrating for disparate evaluators, mapping image retrieval system scores to the human evaluation results, and comparing retrieval systems. We demonstrate the process by providing grounded comparison results for several algorithms.
Effective Instruction Prefetching via Fetch Prestaging
Authors: Ayose Falcon, Alex Ramirez, Mateo Valero
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01 (2005)

As technological process shrinks and clock rate increases, instruction caches can no longer be accessed in one cycle. Alternatives are implementing smaller caches (with higher miss rate) or large caches with a pipelined access (with higher branch misprediction penalty). In both cases, the performance obtained is far from the obtained by an ideal large cache with one-cycle access. In this paper we present Cache Line Guided Prestaging (CLGP), a novel mechanism that overcomes the limitations of current instruction cache implementations. CLGP employs prefetching to charge future cache lines into a set of fast prestage buffers. These buffers are managed efficiently by the CLGP algorithm, trying to fetch from them as much as possible. Therefore, the number of fetches served by the main instruction cache is highly reduced, and so the negative impact of its access latency on the overall performance. With the best CLGP configuration using a 4 KB I-cache, speedups of 3.5% (at 0.09µm) and 12.5% (at 0.045µm) are obtained over an equivalent Fetch Directed Prefetching configuration, and 39% (at 0.09µm) and 48% (at 0.045µm) over using a pipelined instruction cache without prefetching. Moreover, our results show that CLGP with a 2.5 KB of total cache budget can obtain a similar performance than using a 64 KB pipelined I-cache without prefetching, that is equivalent performance at 6.4X our hardware budget.
Compatibility Between Shared Variable Valuations in Timed Automaton Network Model-Checking
Authors: Zhao Jianhua, Zhou Xiuyi, Li Xuandong, Zheng Guoliang
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 2 - Volume 03 (2005)

Many real-time systems are modelled as timed automaton networks, which are parallel compositions of timed automata. Those timed automata interact with each other through shared variables and/or communication channels. In the literate, symbolic states with different shared variable valuations are treated as distinct ones. This paper presents a compatibility relation between shared variable valuations. Using this relation, the reachability analysis algorithm can avoid exploring all the states with different shared variable valuations. An algorithm is presented in this paper to detect compatible shared variable valuations. A compact data structure is also proposed to record the shared variable valuation sets found by this algorithm. Based on these results, an optimized reachability analysis algorithm is presented. Case studies show that our technique improves the space-efficiency of reachability analysis significantly.
Secure and Efficient Key Management in Mobile Ad Hoc Networks
Authors: Bing Wu, Jie Wu, Eduardo B. Fernandez, Spyros Magliveras
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 17 - Volume 18 (2005)

In mobile ad hoc networks, due to unreliable wireless media, host mobility and lack of infrastructure, providing secure communications is a big challenge in this unique network environment. Usually cryptography techniques are used for secure communications in wired and wireless networks. The asymmetric cryptography is widely used because of its versatileness (authentication, integrity, and confidentiality) and simplicity for key distribution. However, this approach relies on a centralized framework of public key infrastructure (PKI). The symmetric approach has computation efficiency, yet it suffers from potential attacks on key agreement or key distribution. In fact, any cryptographic means is ineffective if the key management is weak. Key management is a central aspect for security in mobile ad hoc networks. In mobile ad hoc networks, the computational load and complexity for key management is strongly subject to restriction of the node's available resources and the dynamic nature of network topology. In this paper, we propose a secure and efficient key management framework (SEKM) for mobile ad hoc networks. SEKM builds PKI by applying a secret sharing scheme and an underlying multicast server group. In SEKM, the server group creates a view of the certification authority (CA) and provides certificate update service for all nodes, including the servers themselves. A ticket scheme is introduced for efficient certificate service. In addition, an efficient server group updating scheme is proposed.
Experiences implementing efficient Java thread serialization, mobility and persistence
Authors: S. Bouchenak, D. Hagimont, S. Krakowiak, N. De Palma, F. Boyer
Venue: Software&mdash;Practice Experience (2004)

Today, mobility and persistence are important aspects of distributed computing. They have many fields of use such as load balancing, fault tolerance and dynamic reconfiguration of applications. In this context, Java provides many useful mechanisms for the mobility of code via dynamic class loading, and the mobility or persistence of data via object serialization. However, Java does not provide any mechanism for the mobility&sol;persistence of computation &lpar;i.e. threads&rpar;.We designed and implemented a new mechanism, called Java thread serialization, that is used to build thread mobility or thread persistence. Therefore, a running Java thread can, at an arbitrary state of its execution, migrate to a remote machine where it resumes its execution, or be checkpointed on disk for possible subsequent recovery. With our services, migrating a thread is simply performed by the call of our go primitive, and checkpointing&sol;recovering a thread is performed by the call of our store and load primitives.Several projects have recently addressed the issue of Java thread serialization, e.g. Sumatra, Wasp, JavaGo, Brakes, JavaGoX, Merpati. Some of them have attempted to minimize the overhead incurred by the thread serialization mechanism on thread performance, but none of them has been able to completely avoid this overhead.We propose a generic Java thread serialization mechanism that does not impose any performance overhead on serialized threads. This is achieved thanks to the use of type inference and dynamic de-optimization techniques. In this paper, we describe the design and implementation details of our thread serialization prototype in Sun Microsystems' JDK. We report on experiments conducted with our prototype, present a comparative performance evaluation of the main thread serialization techniques, and confirm the elimination of the performance overhead with our thread serialization mechanism. Copyright &copy; 2003 John Wiley & Sons, Ltd.
An adaptative visual device to assist patients affected by visual scotoma
Authors: Anne-Catherine Scherlen, Vincent Gautier
Venue: Proceedings of the 15th French-speaking conference on human-computer interaction on 15eme Conference Francophone sur l'Interaction Homme-Machine (2003)

The presence of a central visual scotoma disrupts recognition and any visual identification. The current visual apparatus (lens) obliges the patient to develop a new referential visual to investigate differently the visual information but regrettably they are not very successful. In this project, we elaborated an innovative adaptive optical device. Adaptive, because it is no longer the patient who has to adapt himself to his handicap but the device which is going to adapt its environment to his visual needs in real time. We suggest synchronizing eye movement and availability of the visual information by unmasking the visual information present under the scotoma. Our result shows that the subject is disrupted during the reading with the presence of the scotoma when more than 6 letters are masked. Beyond, we improve significantly the speed of reading according to the unmasking principle.A new proposal for the unmasking of information by respecting the cognitive and linguistic cues of the text is the object of the continuity of this project.
Making Search Efficient on Gnutella-Like P2P Systems
Authors: Yingwu Zhu, Xiaoyu Yang, Yiming Hu
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01 (2005)

Leveraging the state-of-the-art information retrieval (IR) algorithms like VSM and relevance ranking algorithm, we present GES, an efficient IR system built on top of Gnutellalike P2P networks. The key idea is that GES employs a distributed, content-based, and capacity-aware topology adaptation algorithm to organize nodes (each of which is represented by a node vector) into semantic groups. The intuition behind this design is that semantically associated nodes within a semantic group tend to be relevant to the same queries. Given a query, GES uses a capacity-aware search protocol based on semantic groups and selective one-hop node vector replication, to direct the query to the most relevant nodes which are responsible for the query, thereby achieving high recall with probing only a small faction of nodes. Moreover, GES adopts automatic query expansion techniques to improve quality of search results, and it is the first work to show that node vector size plays a very important role in system performance. The experimental results show that GES is very efficient, and even outperforms the centralized node clustering system like SETS.
Project Erde
Authors: Emmon Johnson, Matthew Becker, Christopher Spahn
Venue: Journal of Computing Sciences in Colleges (2005)

We designed a program that will be able to identify minerals, rocks, and fossils based on information that the user inputs into the program. We are calling this program Erde MRFD (Mineral, Rock, Fossil Database) after Erde, the Germanic goddess of the Earth. The program will have specific search criteria for each type of search. The mineral, rock, and fossil databases will be upgradeable so that if a new mineral, rock, or fossil is discovered, the user will be able to add it to the appropriate database.
CX-DIFF: a change detection algorithm for XML content and change visualization for WebVigiL
Authors: Jyoti Jacob, Alpa Sachde, Sharma Chakravarthy
Venue: Data Knowledge Engineering (2005)

The World Wide Web is an omni-present and ever-expanding source of data. The exponential increase of information on the web has affected the manner in which it is accessed, disseminated and delivered. The emphasis has shifted from mere viewing of information to efficient retrieval and monitoring of selective changes to information content. Hence, an effective monitoring system for change detection and notification based on user-profile is needed. WebVigiL is a general-purpose, active capability-based information monitoring and notification system for HTML and XML documents. It handles specification, management, and propagation of customized changes as requested by a user. A novel aspect of WebVigiL is its ability to detect customized changes on the content of the document. This paper deals with change detection to XML documents, and change visualization in WebVigiL. The ordered tree property of an XML document is exploited for change detection. In this paper, we propose an algorithm to handle customized change detection to the contents of XML documents based on user-intent. In addition, an optimization to this algorithm is presented that has a better performance with certain desired characteristics. We also discuss various change visualization schemes to display the changes computed by WebVigiL. We highlight the change presentation in WebVigiL and briefly describe the rest of the system.