ppxscal/embedding_network huggingface dataset:
Industrial evaluation of a highly-accurate academic IR system
Authors: Tahia Infantes-Morris, Philip J. Bernhard, Kevin L. Fox, Gary J. Faulkner, Kristina Stripling
Venue: Proceedings of the twelfth international conference on Information and knowledge management (2003)

In this paper we report the results of an independent experimental evaluation of an information retrieval (IR) system developed at the Illinois Institute of Technology (IIT). The system, which is called the Advanced Information Retrieval Engine (AIRE), consists of a set of tools and utilities providing indexing, extraction, searching and visualization. We evaluated AIRE on three data sets from the Text REtrieval Conference (TREC) - TREC 8, 9 and 10. Overall, our results indicate that AIRE is a highly accurate IR system. Compared with results published by IIT, in our experiments AIRE consistently scored higher in recall. AIRE also scored higher in precision, but only for automatic tasks. In manual tasks, AIRE scored lower in precision in our experiments, but we attributed that to factors external to AIRE. Our final conclusion is that AIRE is a highly accurate IR system.
A predicative approach to the classification problem
Authors: Salvatore Caporaso, Emanuele Covino, Giovanni Pani
Venue: Journal of Functional Programming (2001)

We harmonize many time-complexity classes DTIMEF(f(n)) (f(n) &ges; n) with the PR functions (at and above the elementary level) in a transfinite hierarchy of classes of functions &Tscr;&alpha;. Class &Tscr;&alpha; is obtained by means of unlimited operators, namely: a variant &Pi; of the predicative or safe recursion scheme, introduced by Leivant, and by Bellantoni and Cook, if &alpha; is a successor; and constructive diagonalization if &alpha; is a limit. Substitution (SBST) is discarded because the time complexity classes are not closed under this scheme. &Tscr;&alpha; is a structure for the PR functions finer than &Escr;&alpha;, to the point that we have &Tscr;&epsi;0 = &Escr;3 (elementary functions). Although no explicit use is made of hierarchy functions, it is proved that f(n) &isin; &Tscr;&alpha; implies f(n) &les; nG&alpha;(n), where G&alpha; belongs to the slow growing hierarchy (of functions) studied, in particular, by Girard and Wainer.
Performance analysis of five interprocess communication mechanisms across UNIX operating systems
Authors: Patricia K. Immich, Ravi S. Bhagavatula, Ravi Pendse
Venue: Journal of Systems and Software (2003)

The availability of a variety of UNIX implementations necessitates the evaluation of their performance with respect to specific application characteristics. This paper concentrates on the performance evaluation of five different Interprocess Communication (IPC) mechanisms--pipes, FIFOs, messages, shared memory (with semaphores), and UNIX domain sockets. Benchmark programs were created for each mechanism, simulating a simple Producer/Consumer message transfer problem. Results were obtained for six UNIX releases--Linux 2.2.5-15, Linux 2.2.17, Linux 2.4.0-test9, RTLinux v2.3, FreeBSD 4.1, and FreeBSD 4.2. The UNIX source code was rigorously examined, and additional tests were created to determine implementation differences that would explain performance variations. Identified causes for performance differences include memory allocation schemes, transfer buffer sizes, data transfer mechanisms, locking mechanism implementations, and underlying code complexity. For all IPC mechanisms with the exception of shared memory, Linux 2.2.5-15 exhibited the best performance, followed by the remaining Linux kernels, with the FreeBSD releases finishing last. When compared against each other, pipes outperformed the other mechanisms. The developed benchmarks and ancillary tests attempt to isolate each aspect of the tested IPC mechanisms to facilitate a full understanding of IPC at the source code level.
Power efficient data gathering and aggregation in wireless sensor networks
Authors: Hüseyin Özgür Tan, Ibrahim Körpeoǧlu
Venue: ACM SIGMOD Record (2003)

Recent developments in processor, memory and radio technology have enabled wireless sensor networks which are deployed to collect useful information from an area of interest. The sensed data must be gathered and transmitted to a base station where it is further processed for end-user queries. Since the network consists of low-cost nodes with limited battery power, power efficient methods must be employed for data gathering and aggregation in order to achieve long network lifetimes.In an environment where in a round of communication each of the sensor nodes has data to send to a base station, it is important to minimize the total energy consumed by the system in a round so that the system lifetime is maximized. With the use of data fusion and aggregation techniques, while minimizing the total energy per round, if power consumption per node can be balanced as well, a near optimal data gathering and routing scheme can be achieved in terms of network lifetime.So far, besides the conventional protocol of direct transmission, two elegant protocols called LEACH and PEGASIS have been proposed to maximize the lifetime of a sensor network. In this paper, we propose two new algorithms under name PEDAP (Power Efficient Data gathering and Aggregation Protocol), which are near optimal minimum spanning tree based routing schemes, where one of them is the power-aware version of the other. Our simulation results show that our algorithms perform well both in systems where base station is far away from and where it is in the center of the field. PEDAP achieves between 4x to 20x improvement in network lifetime compared with LEACH, and about three times improvement compared with PEGASIS.
A Web Mining Approach for Finding Expertise in Research Areas
Authors: Quan Thanh Tho, Siu Cheung Hui, A. C. M. Fong
Venue: Proceedings of the 2003 International Conference on Cyberworlds (2003)

Finding expertise in a research area helps researchersto know whom are the experts working on the researcharea. This paper proposes a web mining approach forfinding expertise in scientific research areas. In thisapproach, Indexing Agents search and downloadscientific publications from web sites that typicallyinclude academic web pages, then they extract citationsand store them in a Web Citation Database. In addition,researcher information is also saved into the ResearcherDatabase. Data mining techniques are applied to the WebCitation Database on citation keywords and authors toform document clusters and author clusters. The Multi-Clusteringtechnique is proposed to mine the combinedinformation of document clusters and author clusters forinformation on expertise in specified research areas.
Energy efficient wireless packet scheduling and fair queuing
Authors: Vijay Raghunathan, Saurabh Ganeriwal, Mani Srivastava, Curt Schurgers
Venue: ACM Transactions on Embedded Computing Systems (TECS) (2004)

As embedded systems are being networked, often wirelessly, an increasingly larger share of their total energy budget is due to the communication. This necessitates the development of power management techniques that address communication subsystems, such as radios, as opposed to computation subsystems, such as embedded processors, to which most of the research effort thus far has been devoted. In this paper, we present techniques for energy efficient packet scheduling and fair queuing in wireless communication systems. Our techniques are based on an extensive slack management approach that dynamically adapts the output rate of the system in accordance with the input packet arrival rate. We use a recently proposed radio power management technique, dynamic modulation scaling (DMS), as a control knob to enable energy-latency trade-offs during wireless packet transmission. We first analyze a single input stream scenario, and describe a rate adaptation technique that results in significantly lower energy consumption (reductions of up to 10 &times;), while still bounding the resulting packet delays. By appropriately setting the various parameters of our algorithm, the system can be made to traverse the energy-latency-fidelity trade-off space. We extend our techniques to a multiple input stream scenario, and present E2WFQ, an energy efficient version of the weighted fair queuing (WFQ) algorithm for fair packet scheduling. Simulation results show that large energy savings can be obtained through the use of E2WFQ, with only a small, bounded increase in worst case packet latency. Further, our results demonstrate that E2WFQ does not adversely affect the throughput allocation (and hence, fairness) of WFQ.
A Dialog Control Framework for Hypertext-Based Applications
Authors: Matthias Book, Volker Gruhn
Venue: Proceedings of the Third International Conference on Quality Software (2003)

Hypertext-based user interfaces have become attractivefor many distributed applications today, but they do notreach the usability level of window-based UIs. Because ofinsufficient dialog control logic, they cannot managenested and hierarchical dialog structures that users havecome to expect from window-based UIs. We thereforepresent a framework that implements a dialog controllogic capable of handling complex, nested dialogstructures, and introduce a notation and an XML-basedlanguage for specifying such dialog structures. Keyconcepts are the encapsulation of multiple dialog steps incontext-independent dialog modules that can be nestedarbitrarily, and the specification of multiple device-specificinteraction patterns for a single device-independentapplication logic. The framework allowsblack box reuse, leaving only the implementation of theapplication logic, the design of the user interface and thespecification of the dialog flow to application developers.
Incorporating Workflow Interference in Facility Layout Design: The Quartic Assignment Problem
Authors: Wen-Chyuan Chiang, Panagiotis Kouvelis, Timothy L. Urban
Venue: Management Science (2002)

Although many authors have noted the importance of minimizing workflow interference in facility layout design, traditional layout research tends to focus on minimizing the distance-based transportation cost. This paper formalizes the concept of workflow interference from a facility layout perspective. A model, formulated as a quartic assignment problem, is developed that explicitly considers the interference of workflow. Optimal and heuristic solution methodologies are developed and evaluated.
Designing and evaluating learning objects for introductory programming education
Authors: Peter Chalk, Claire Bradley, Poppy Pickard
Venue: ACM SIGCSE Bulletin (2003)

We described a new approach to solving the problem of teaching first year software development, using web-based multimedia learning objects (LOs), which include student interaction, animation and self-assessment. A variety of evaluation techniques have been applied, including student questionnaires and interviews and server-side tracking. Results from the first semester are very encouraging and student performance has improved.
Negative pseudo-relevance feedback in content-based video retrieval
Authors: Rong Yan, Alexander G. Hauptmann, Rong Jin
Venue: Proceedings of the eleventh ACM international conference on Multimedia (2003)

Video information retrieval requires a system to find information relevant to a query which may be represented simultaneously in different ways through a text description, audio, still images and/or video sequences. We present a novel approach that uses pseudo-relevance feedback from retrieved items that are NOT similar to the query items without further inquiring user feedback. We provide insight into this approach using a statistical model and suggest a score combination scheme via posterior probability estimation. An evaluation on the 2002 TREC Video Track queries shows that this technique can improve video retrieval performance on a real collection. We believe that negative pseudo-relevance feedback shows great promise for very difficult multimedia retrieval tasks, especially when combined with other different retrieval algorithms.
Bare-hand human-computer interaction
Authors: Christian von Hardenberg, François Bérard
Venue: Proceedings of the 2001 workshop on Perceptive user interfaces (2001)

In this paper, we describe techniques for barehanded interaction between human and computer. Barehanded means that no device and no wires are attached to the user, who controls the computer directly with the movements of his/her hand.Our approach is centered on the needs of the user. We therefore define requirements for real-time barehanded interaction, derived from application scenarios and usability considerations. Based on those requirements a finger-finding and hand-posture recognition algorithm is developed and evaluated.To demonstrate the strength of the algorithm, we build three sample applications. Finger tracking and hand posture recognition are used to paint virtually onto the wall, to control a presentation with hand postures, and to move virtual items on the wall during a brainstorming session. We conclude the paper with user tests, which were conducted to prove the usability of bare-hand human computer interaction.
Weaving stories in digital media: when Spielberg makes home movies
Authors: Brett Adams, Svetha Venkatesh
Venue: Proceedings of the eleventh ACM international conference on Multimedia (2003)

In this paper we describe research aimed at enabling amateur video makers to improve both the technical quality and communicative capacity of their work. Motivated by the recognition that untold hours of home video are simply abandoned after capture, we have formulated the problem as one of defining the what and how of footage capture.We have implemented a framework that answers the first problem, the what, by means of the age-old communicative powers of Story; the second problem, the how, is addressed by means of well documented aesthetic principles that constitute the film profession, which impact both technical and cinematic considerations for a given project.We provide a brief overview of the process, beginning with the narrative template, embodying a chosen story, through the principal phases of generating a storyboard, directing, and editing, resulting in the finished product. We demonstrate the interplay of narrative, purpose for the production, and aesthetic agents, and their influence on the automatically generated storyboard with examples.
Optimal via-shifting in channel compaction
Authors: Yang Cai, D. F. Wong
Venue: Proceedings of the conference on European design automation (1990)

We study the problem of shifting vias to obtain more compactable two-layer channel routing solutions. Let S be a grid-based two-layer channel routing solution. Let vc be the number of grid points on column c that are occupied by vias. Let wc be the number of grid points on column c that are occupied by horizontal wires. We define the height of a column c to be the quantity hc= Avc + Bwc + C, where A, B, C are some design rule dependent constants. A column is said to be critical if it is a column with maximum height. Let Hs be the height of the critical column(s) in S. In general, Hs is a good measure of the channel height after compaction. We show that the problem of shifting vias to minimize Hs can be solved optimally in polynomial time. The complexity of our optimal via-shifting algorithm is O(WL(V+L)log2(V+L)) where W, L, and V are the number of tracks in S, the number of columns in S, and the number of vias in S, respectively.
A decision support system for multiattribute utility evaluation based on imprecise assignments
Authors: Antonio Jiménez, Sixto Ríos-Insua, Alfonso Mateos
Venue: Decision Support Systems (2003)

This paper describes a decision support system based on an additive or multiplicative multiattribute utility model for identifying the optimal strategy. This is intended to allay many of the operational difficulties involved in assessing and using multiattribute utility functions. The system admits imprecise assignments for weights and utilities and uncertainty in the multiattribute strategies, which can be defined in terms of ranges for each attribute instead of single values. Inputs can be subjected to different sensitivity analyses, permitting users to test the robustness of the ranking of the strategies and gain insight into and confidence about the final solution. An application of the system to the restoration of a contaminated lake is illustrated throughout the paper.
Extending MFC Applications with the .NET Framework
Authors: Tom Archer, Nishant Sivakumar
Venue:  (2003)

“To anyone looking to augment their existing MFC code base and knowledge with the powerful .NET classes-which provide such capabilities as disconnected data, in-memory database (IMDB), regular expressions, and data encryption-Tom Archer's book has it all.” -Erik Westermann, Lead Architect, Eidenai InnovationsExtending MFC Applications with the .NET Framework is the first book to show MFC developers how to boost productivity by incorporating .NET functionality into existing MFC applications. Tom Archer clearly illustrates how using the .NET Base Class Library (BCL)-to complement or replace MFC classes when there is a clear advantage-enables MFC developers to create elegant and robust Windows applications in the most efficient way possible.Each chapter begins with an introduction that explains the technology, outlines its benefits, lists its pragmatic business uses, and summarizes the required syntax. As is an Archer trademark, this information is solidified with hands-on, practical demo applications.This book answers the questions MFC developers have about .NET, including: What are the key issues when combining MFC and Managed Extensions? Page 15 How can Regular Expressions be used to parse a document for multiple complex pattern types, such as email addresses? Page 84 How can hash codes be used to validate users without storing passwords? Page 161 How can MFC applications maintain data stored in XML format? Page 274 Once an ADO.NET DataSet is filled, how can the data be searched, sorted, and filtered? Page 336 What technique is used for reading image data from a database using ADO.NET classes? Page 363 What are the options for handling disconnected data concurrency issues? Page 396 How can Remoting be used to pass MFC objects between applications? Page 460The CD-ROM supplies the complete downloadable source code, working samples, and test code from the book, as well as several productivity-enhancing utilities such as a Visual Studio .NET Custom AppWizard. 032117352XB11142003
A Unified Design Space for Regular Parallel Prefix Adders
Authors: Matthew M. Ziegler, Mircea R. Stan
Venue: Proceedings of the conference on Design, automation and test in Europe - Volume 2 (2004)

We consider sparsity, fanout, and radix as three dimensions in the design space of regular parallel prefix adders and present a unified formalism to describe such structures.
Context, Ontology and Portfolio: Key Concepts for a Situational Awareness Knowledge Portal
Authors: Marlène Gauvin, Anne-Claire Boury-Brisset, Alain Auger
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 4 - Volume 4 (2004)

The vision leading the development of a Situational Awareness Knowledge Portal to support the Canadian National Defence Command Center in monitoring and directing Strategic-level Operations is to provide each individual with a customized, mission-oriented knowledge desktop that gives access to the right information from multiple sources in the context of thework and contributes to the building and sharing of the "collective battlespace knowledge". The approach lays on three intertwined fundamental concepts, namely Context, Ontology and Portfolio. The delimitation of the work into well-scoped portfolios allows, to a certain extent, to confine the knowledge handled. The exploitation of this knowledge using appropriate domain ontologies will make it feasible to provide contextual assistance in various ways to the work performed within portfolios, and accordingly to user/group preferences. This paper formalizes these concepts and their interrelationships.
Software Documentation-Driven Manufacturing
Authors: Luqi, X Liang, L. Zhang, V. Berzins
Venue: Proceedings of the 27th Annual International Conference on Computer Software and Applications (2003)

'Manufacturing in the Computer' denotes the virtualmanufacturing vision that fabrication/assembly of anyproduct can be simulated in a computer by a powerfulmodeling and simulation environment. This paper presentsthe DDM approach, documentation-driven manufacturing toaddress the problem of engineering such an environment.The key to DDM is the creation and application of theengineering repository (ER) that supports multiple views formodeling and simulating virtual production in the computerand model control of physical production in the factory,respectively. Both virtual view and physical view are heededfor manufacturing under the support of the ER. The ERtangibly documents virtual parts and make them wellorganized for use by 'iteration-to-maturity' in the computer.It also provides a means for driving the virtual productionfrom one stage to another throughout the manufacturingprocess, and for converting documents between virtual viewand physical view representation to manage and control thephysical production.
Experience based sampling technique for multimedia analysis
Authors: Jun Wang, Mohan S. Kankanhalli
Venue: Proceedings of the eleventh ACM international conference on Multimedia (2003)

We present a novel experience based sampling or experiential sampling technique which has the ability to focus on the analysis's task by making use of the contextual information from the environment. In this technique, sensor samples are used to gather information about the current environment and attention samples are used to represent the current state of attention. The task-attended samples are inferred from experience and maintained by a sampling based dynamical system. The multimedia analysis task can then focus on the attention samples only. Moreover, past experiences and the current environment can be used to adaptively correct and tune the attention. Experimental results have been presented to demonstrate the efficacy of our technique.
On the Cost-Quality Tradeoff in Topology-Aware Overlay Path Probing
Authors: Chiping Tang, Philip K. McKinley
Venue: Proceedings of the 11th IEEE International Conference on Network Protocols (2003)

Path probing is essential to maintaining an efficient overlay network topology. However, the cost of a full-scale probing is as high as O(n2), which is prohibitive in large-scale overlay networks. Several methods have been proposed to reduce probing overhead, although at a cost in terms of probing completeness. In this paper, an orthogonal solution is proposed that trades probing overhead for estimation accuracy in sparse networks such as the Internet. The proposed solution uses network-level path composition information (for example, as provided by a topology server) to infer path quality without full-scale probing. The inference metrics include latency, loss rate and available bandwidth. This approach is used to design several probing algorithms, which are evaluated through analysis and simulation. The results show that the proposed method can significantly reduce probing overhead while providing bounded quality estimations for all n × (n - 1) overlay paths. The solution is well suited to medium-scale overlay networks in the Internet. In other environments, it can be combined with extant probing algorithms to further improve performance.