ppxscal/embedding_network huggingface dataset:
Sentiment Mining in WebFountain
Authors: Jeonghee Yi, Wayne Niblack
Venue: Proceedings of the 21st International Conference on Data Engineering (2005)

WebFountain is a platform for very large-scale text analytics applications that allows uniform access to a wide variety of sources. It enables the deployment of a variety of document-level and corpus-level miners in a scalable manner, and feeds information that drives end-user applications through a set of hosted Web services. Sentiment (or opinion) mining is one of the most useful analyses for various end-user applications, such as reputation management. Instead of classifying the sentiment of an entire document about a subject, our sentiment miner determines sentiment of each subject reference using natural language processing techniques. In this paper, we describe the fully functional system environment and the algorithms, and report the performance of the sentiment miner. The performance of the algorithms was verified on online product review articles, and more general documents including Web pages and news articles.
Combining High Level Symptom Descriptions and Low Level State Information for Configuration Fault Diagnosis
Authors: Ni Lao, Ji-Rong Wen, Wei-Ying Ma, Yi-Min Wang
Venue: Proceedings of the 18th USENIX conference on System administration (2004)

Automatic fault diagnosis is an important problem for system management. In this paper, we combine high level symptom descriptions and low level state information to solve the system fault diagnosis problem. We extract state-symptom correlation information from knowledge sources in text format, and then use symptom similarity to rank the candidate system states. We apply the method to Windows Registry problems to help Product Support Service (PSS) engineers. Promising results with two different knowledge sources show the robustness of our method. Finally, we explain why this combination is successful and also discuss its limitations.
Performance Implications of Virtualization and Hyper-Threading on High Energy Physics Applications in a Grid Environment
Authors: Laura Gilbert, Jeff Tseng, Rhys Newman, Saeed Iqbal, Ronald Pepper, Onur Celebioglu, Jenwei Hsieh, Mark Cobban
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01 (2005)

The simulations used in the field of high energy physics are compute intensive and exhibit a high level of data parallelism. These features make such simulations ideal candidates for Grid computing. We are taking as an example the GEANT4 detector simulation used for physics studies within the ATLAS experiment at CERN. One key issue in Grid computing is that of network and system security, which can potentially inhibit the wide spread use of such simulations. Virtualization provides a feasible solution because it allows the creation of virtual compute nodes in both local and remote compute clusters, thus providing an insulating layer which can play an important role in satisfying the security concerns of all parties involved. However, it has performance implications. This study provides quantitative estimates of the virtualization and hyper-threading overhead for GEANT on commodity clusters. Results show that virtualization has less than 15% run-time overhead, and that the best run time (with the non-SMP licence of ESX VMware) is achieved by using one virtual machine per CPU. We also observe that hyper-threading does not provide an advantage in this application. Finally, the effect of virtualization on run-time, throughput, mean response time and utilization is estimated using simulations.
Web accessibility
Authors: Andrea Hamblin, Cousett Ruelas
Venue: Journal of Computing Sciences in Colleges (2004)

The Web Accessibility tutorial will provide hands-on training to participants on how to make an HTML web document accessible to users with various disabilities that might include visual impairments, deafness or partial deafness, mobility limitations, and learning disabilities such as dyslexia and Attention Deficit Disorder (ADD).
A multiple case study on the impact of pair programming on product quality
Authors: Hanna Hulkko, Pekka Abrahamsson
Venue: Proceedings of the 27th international conference on Software engineering (2005)

Pair programming is a programming technique in which two programmers use one computer to work together on the same task. There is an ongoing debate over the value of pair programming in software development. The current body of knowledge in this area is scattered and unorganized. Review shows that most of the results have been obtained from experimental studies in university settings. Few, if any, empirical studies exist, where pair programming has been systematically under scrutiny in real software development projects. Thus, its proposed benefits remain currently without solid empirical evidence. This paper reports results from four software development projects where the impact of pair programming on software product quality was studied. Our empirical findings appear to offer contrasting results regarding some of the claimed benefits of pair programming. They indicate that pair programming may not necessarily provide as extensive quality benefits as suggested in literature, and on the other hand, does not result in consistently superior productivity when compared to solo programming.
On the end-to-end call acceptance and the possibility of deterministic QoS guarantees in ad hoc wireless networks
Authors: S. Sriram, T. Bheemarjuna Reddy, B. S. Manoj, C. Siva Ram Murthy
Venue: Proceedings of the 6th ACM international symposium on Mobile ad hoc networking and computing (2005)

The issue of providing Quality of Service (QoS) guarantees in an Ad~hoc wireless network is a very challenging problem. In this paper, we make the following contributions: (i) analytically derive bounds for the end-to-end call acceptance rate using existing queueing theory methods, (ii) study the impact of the routing scheme on the end-to-end call acceptance rate, and (iii) propose a differentiated services scheme for deterministically providing QoS guarantees.Unlike existing studies which analyze the transport capacity, we focus on the end-to-end call acceptance. The framework that we assume is that of a TDMA-based Ad~hoc wireless network. The routing scheme employed influences the end-to-end call acceptance of the network. The metrics that we consider are the call acceptance probability and the system saturation probability (i.e., the probability that the network is in a state in which every new call is rejected). We derive general bounds on the call acceptance and the system saturation for the case of differentiated-classes of users in the network. These bounds indicate the number of calls of the highest priority class that can be admitted into the network.Simulation studies were carried out to study the effect of load, hopcount, and the influence of the routing protocol on the call acceptance. The increase in the call acceptance rate with the introduction of load-balancing highlights the importance of load-balancing in enhancing the system performance. From these studies, we arrive at the following results: (i) load-balancing leads to significant improvement in the end-to-end call acceptance rate, and is an important factor in attaining the maximum end-to-end call acceptance rate in a given network and (ii) it is indeed possible to provide deterministic QoS guarantees for a designated set of nodes which are characterized by "deterministic guarantee limit".
Knowledge-based architectural adaptation management for self-adaptive systems
Authors: John C. Georgas
Venue: Proceedings of the 27th international conference on Software engineering (2005)

Self-adaptive systems continually evaluate and modify their own behavior to meet changing demands. An important element in the construction of architecture-based self-adaptive software is the specification of adaptation policy: this extended abstract presents an overview of work towards basing such specification on architecture-centric knowledge-based policies. This approach leverages techniques from the artificial intelligence field to explicitly represent adaptation policy at the architectural level, providing for strong decoupling between policy specification and architectural compositions, and supports dynamic runtime policy evolution promoting reuse potential and runtime flexibility.
The Design of the OpenSTARS Adaptive Analyzer for Real-Time Distributed Systems
Authors: Kevin Bryan, Tiegeng Ren, Jiangyin Zhang, Lisa DiPippo, Victor Fay-Wolfe
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 2 - Volume 03 (2005)

This paper describes the design of the OpenSTARS real-time analysis tool. The paper focuses on criteria for a good analysis tool including correctness, performance/scalability, flexibility, and extensibility. Several leading real-time analysis tools are surveyed and several problems with the tools under these criteria are identified. The paper then presents the basic components and operation of OpenSTARS and how its design addresses these problems.
iPACKMAN: high-quality, low-complexity texture compression for mobile phones
Authors: Jacob Ström, Tomas Akenine-Möller
Venue: Proceedings of the ACM SIGGRAPH/EUROGRAPHICS conference on Graphics hardware (2005)

We present a novel texture compression scheme, called iPACKMAN, targeted for hardware implementation. In terms of image quality, it outperforms the previous de facto standard texture compression algorithms in the majority of all cases that we have tested. Our new algorithm is an extension of the PACKMAN texture compression system, and while it is a bit more complex than PACKMAN, it is still very low in terms of hardware complexity.
GE-CMU: description of the SHOGUN system used for MUC-5
Authors: Paul S. Jacobs, George Krupka, Lisa Rau, Michael L. Mauldin, Teruko Mitamura, Tsuyoshi Kitani, Ira Sider, Lois Childs
Venue: Proceedings of the 5th conference on Message understanding (1993)

This paper describes the GE-CMU TIPSTER/SHOGUN system as configured for the TIP-STER 24-month (MUC-5) benchmark, and gives details of the system's performance on the selected Japanese and English texts. The SHOGUN system is a distillation of some of the key ideas that emerged from previous benchmarks and experiments, emphasizing a simple architecture in which the focus is on detailed corpus-based knowledge. This design allowed the project to meet its goal of achieving advances in coverage and accuracy while showing consistently good performance across languages and domains.
The atomic manifesto: a story in four quarks
Authors: Cliff Jones, David Lomet, Alexander Romanovsky, Gerhard Weikum, Alan Fekete, Marie-Claude Gaudel, Henry F. Korth, Rogerio de Lemos, Eliot Moss, Ravi Rajwar, Krithi Ramamritham, Brian Randell, Luis Rodrigues
Venue: ACM SIGOPS Operating Systems Review (2005)

This paper is based on a five-day workshop on "Atomicity in System Design and Execution" that took place in Schloss Dagstuhl in Germany [5] in April 2004 and was attended by 32 people from different scientific communities. The participants included researchers from the four areas of&bull; database and transaction processing systems,&bull; fault tolerance and dependable systems,&bull; formal methods for system design and correctness reasoning, and&bull; to a smaller extent, hardware architecture and programming languages.
Tlib-a library to support programming with hierarchical multi-processor tasks
Authors: Thomas Rauber, Gudula Rünger
Venue: Journal of Parallel and Distributed Computing (2005)

The paper considers the modular programming with hierarchically structured multi-processor tasks on top of SPMD tasks for distributed memory machines. The parallel execution requires a corresponding decomposition of the set of processors into a hierarchical group structure onto which the tasks are mapped. The result is a multi-level group SPMD computation model with varying processor group structures. The advantage of this kind of mixed task and data parallelism is a potential to reduce the communication overhead and to increase scalability. We present a runtime library to support the coordination of hierarchically structured multi-processor tasks. The library exploits an extended parallel group SPMD programming model and manages the entire task execution including the dynamic hierarchy of processor groups. The library is built on top of MPI, has an easy-to-use interface, and leads to only a marginal overhead while allowing static planning and dynamic restructuring.
Channel estimation and interference suppression for uplink CDMA mobile communication systems: Research Articles
Authors: Zi-Wei Zheng, Zhi-Xing Yang, Yi-Sheng Zhu, Chang-Yong Pan
Venue: Wireless Communications Mobile Computing (2004)

Wireless communications for mobile telephone and data transmission is currently undergoing very rapid development. Code division multiple-access (CDMA) implemented with direct sequence spread spectrum signaling is among the most promising multiplexing technologies for cellular telecommunications services. In this paper, jointly period inserted pilot symbols assisted recursive (PIPSAR) channel estimation and interference suppression techniques are proposed for uplink CDMA mobile communication systems. The uplink CDMA mobile communication system model is described in the form of space-time domain through antenna array and multipath expression. Interference suppression is achieved by using adaptive minimum mean squared error (MMSE) digital filters that span several successive received chip oversampling vectors of a symbol interval. PIPSAR techniques are used to estimate channel parameters. The correlation between the successive periods is considered to further improve the performance of the proposed scheme. Analysis and simulations are used to evaluate the performance of the proposed scheme. Copyright &copy; 2004 John Wiley & Sons, Ltd.
(Δ --k)-critical graphs
Authors: Babak Farzad, Michael Molloy, Bruce Reed
Venue: Journal of Combinatorial Theory Series B (2005)

Every graph G of maximum degree Δ is (Δ + 1)-colourable and a classical theorem of Brooks states that G is not Δ-colourable iff G has a (Δ + 1)-clique or Δ = 2 and G has an odd cycle. Reed extended Brooks' Theorem by showing that if Δ(G) ≥ 1014 then G is not (Δ - 1)-colourable iff G contains a Δ-clique. We extend Reed's characterization of (Δ - 1)-colourable graphs and characterize (Δ - 2), (Δ - 3), (Δ - 4) and (Δ - 5)-colourable graphs, for sufficiently large Δ, and prove a general structure for graphs with χ close to Δ. We give a linear time algorithm to check the (Δ - k)-colourability of a graph, for sufficiently large Δ and any constant k.
An overview of the HORNE logic programming system
Authors: Alan M. Frisch, James F. Allen, Mark Giuliano
Venue: Issue 84 (April 1983) (1983)

HORNE is a PROLOG-based logic-programming system embedded in LISP. Programming in HORNE involves a careful mixture of logic programming and LISP programming. Since the summer of 1981, HORNE has been continually evolving from its origin HCPRVR (Chester, 1979). The main implementation is in FRANZ LISP on a VAX; a scaled-down implementation also exists in UCI LISP on a PDP-10. Today, HORNE bears little resemblance to HCPRVR; the primary similarity being the manner of embedding logic in LISP and the LISP-logic interface. This paper conveys the flavor of the current state of the system sacrificing detail and completeness for succinctness and simplicity. After a brief overview of the basic system, this paper highlights those aspects of HORNE that differ from more conventional PROLOG systems. We assume that the reader is familiar with the rudiments of PROLOG and LISP. A more thorough account of the system may be found in the "Horne User's Manual" (Allen and Frisch, 1982).
Enhancing Network Security By Preventing User-Initiated Malware Execution
Authors: John V. Harrison
Venue: Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume II - Volume 02 (2005)

Although organizations have invested significant resources in security hardware, software and training to implement a strategy known as "defense in depth", the attacks they experience are increasing in number, sophistication and cost of recovery and litigation. One difficult class of attack to defend against is user-initiated malicious software (malware) execution. User-initiated malware penetrates the security perimeter with assistance provided, either intentionally or unintentionally, by and enterprise's end users. These users assist the attacker by downloading malware from a web site, invoking malware arriving as e-mail attachments and introducing malware inside the perimeter via the unauthorized use of foreign media, e.g., floppy disks, CD-ROMs, or unauthorized media devices, e.g., USB drives, or unauthorized wireless networking hardware. In this paper, we describe characteristics of the most widely used defense techniques for the blocking of user-initiated malware and why these techniques are insufficient. We then introduce a module verification strategy that will eliminate, or at least severely reduce, this problem by extending the classic "defense in depth" network security strategy. We then describe how the augmentation of a standard operating system loader to include references to a database of cryptographic hashes of module executables can be used to implement this strategy. Finally, we describe our efforts towards the creation of a prototype system that implements the module verification strategy.
Generalized principal component beamformer for communication systems
Authors: Mehrzad Biguesh, Shahrokh Valaee, Benoît Champagne
Venue: Signal Processing (2005)

The contribution of this paper is two-fold. First, we introduce a generalized principal component (GPC) beamforming technique for reduced rank processing that allows a trade-off between interference and noise reduction via the introduction of a control parameter, ε. Three variants of the GPC beamformer corresponding to ε = 1 (called T1 beamformer), ε = 0.5 (called T2 beamformer) and ε = 0 (called T3 beamformer), which maximize the signal-to-interference ratio, the signal-to-interference plus noise ratio, and the signal-to-noise ratio at the array output respectively, are considered in detail. The second contribution of this paper is to compare the robustness between the reduced rank and full rank beamformers. We use analytical studies and computer simulations to show that the T2 and T3 beamformers are robust against calibration and/or pointing errors.
Reconstructing collections of arbitrary curves
Authors: Tobias Lenz
Venue: Proceedings of the twenty-first annual symposium on Computational geometry (2005)

The presented alg rithm rec nstructs collections of arbitrary curves (open, closed, smooth, with corners, with or without intersections). The algorithm is very simple and short and follows a novel and simple greedy strategy. The corner and intersection points are not required to but allowed to be in the sample. The described method works for curves in any dimension d asymptotically in O (n2-1/d) time with involved data structures. Experiments show already a good performance with a very simple kd-tree structure.
A research of merging regions through isophotes analysis
Authors: Seung Soo Lee, Jeong A. Lee, Chang Choon Park
Venue: Proceedings of the 2004 international symposium on Information and communication technologies (2004)

If the areas existing in an object are composed of different color sets, the applicable object is segmented into independent areas so it gets to lose the meaning as an object. Therefore, it is required to selectively apply other information on the areas in addition to color information. Based on this methodology, this study, in addition to color information, has also analysed the shape of isophotes that connect equivalence of brightness as a way of expressing cubic effect. And, through the analysed information, it has judges independence or dependence of the areas, and then, proposed a way of object isolation through significant regional matching of an object.
Design of a Wearable Haptic Interface for Precise Finger Interactions in Large Virtual Environments
Authors: Florian Gosselin, Tanguy Jouan, Julien Brisset, Claude Andriot
Venue: Proceedings of the First Joint Eurohaptics Conference and Symposium on Haptic Interfaces for Virtual Environment and Teleoperator Systems (2005)

In this article, we present a new wearable haptic interface developed at CEA-LIST for precise finger interactions within virtual reality applications in large environments. The hand movements are tracked using a stereoscopic visual tracking system, allowing large movements in free space. Moreover, the device integrates two three degrees of freedom with force feedback robots associated with index and thumb fingers, allowing virtual objects fine manipulation. Finally, a two degrees of freedom tactile actuator is integrated under the pulp of each fingertip in order to improve the high frequency response of the haptic interface and to provide information on the texture and the shape of the virtual objects manipulated.
ACM Member Dissertations
Authors: Lewis Johnson
Venue: ACM SIGART Bulletin (1991)

In the last decade, many Intelligent Tutoring Systems (ITSs) have been built, but few people use them. One reason is that the "theory of tutoring" represented in these systems is often based on researchers' intuitive theories of tutoring rather than on empirical data that describes true tutoring expertise. Very little empirical data exist for one ndash;on ndash;one tutoring, however, and methods for increasing this body of knowledge are not well ndash;defined. Thus, the goals of this dissertation research were the following:
The effects of task complexity and time availability limitations on human performance in database query tasks
Authors: Heikki Topi, Joseph S. Valacich, Jeffrey A. Hoffer
Venue: International Journal of Human-Computer Studies (2005)

Prior research on human ability to write database queries has concentrated on the characteristics of query interfaces and the complexity of the query tasks. This paper reports the results of a laboratory experiment that investigated the relationship between task complexity and time availability, a characteristic of the task context not investigated in earlier database research, while controlling the query interface, data model, technology, and training. Contrary to expectations, when performance measures were adjusted by the time used to perform the task, time availability did not have any effects on task performance while task complexity had a strong influence on performance at all time availability levels. Finally, task complexity was found to be the main determinant of user confidence. The implications of these results for future research and practice are discussed.
Partially ordered epochs for thread-level speculation
Authors: Braxton Thomason, Craig Chase
Venue: Proceedings of the 2nd conference on Computing frontiers (2005)

Thread-Level Speculation TLS) can be used to exploit parallelism in programs where static analysis fails. When a dependence violation is dynamically detected, the violating thread is rolled-back and restarted. However, we believe that for many applications, the restrictions imposed by referencing the sequential execution model to interpret dependence ordering will unnecessarily throttle parallelism. In this paper, we consider the possibility that the application requires that threads merely be partially ordered. We analyze the sufficient conditions for TLS to produce semantically correct results with this relaxed constraint. We apply our methodology, which we call Partially-Ordered Thread-level Speculation POTS), to priority-based scheduling and graph search algorithms and demonstrate that such a methodology still yields semantically correct execution while yielding substantially more parallelism than TLS