ppxscal/embedding_network huggingface dataset:
CoR2Ds
Authors: Chia Shen, Mark S. Hancock, Clifton Forlines, Frédéric D. Vernier
Venue: CHI '05 extended abstracts on Human factors in computing systems (2005)

We present a new popup widget, called CoR2Ds (Context-Rooted Rotatable Draggables), designed for multi-user direct-touch tabletop environments. CoR2Ds are interactive callout popup objects that are visually connected (rooted) at the originating displayed object by a semi-transparent colored swath. CoR2Ds can be used to bring out menus, display drilled-down or off-screen ancillary data such as metadata and attributes, as well as instantiate tools. CoR2Ds can be freely moved, rotated, and re-oriented on a tabletop display surface by fingers, hands, pointing devices (mice) or marking devices (such as a stylus or light pen). CoR2Ds address five issues for interaction techniques on interactive tabletop display surfaces: occlusion, reach, context on a cluttered display, readability, and concurrent/coordinated multi-user interaction. In this paper, we present the design, interaction and implementation of CoR2Ds. We also discuss a set of current usage scenarios.
Comparison of Web Services Technologies from a Developer's Perspective
Authors: Sanjay P. Ahuja, Raquel Clark
Venue: Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume II - Volume 02 (2005)

Two main technologies that stand out for the implementation of enterprise applications and web services are Sun Microsystems' Java 2 Enterprise Edition (J2EE) and Microsoft's .NET Framework. These two are competing to become the platform of choice for enterprise application and web services developers. Each platform provides specific development tools and APIs to assist developers. The purpose of this research is to provide an unbiased comparison of the two platforms based on their features and services offered from the viewpoint of developers in the context of building an enterprise or Web application from design right through to deployment.
A Cross-Layer Approach for Power-Performance Optimization in Distributed Mobile Systems
Authors: Shivajit Mohapatra, Radu Cornea, Hyunok Oh, Kyoungwoo Lee, Minyoung Kim, Nikil Dutt, Rajesh Gupta, Alex Nicolau, Sandeep Shukla, Nalini Venkatasubramanian
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 10 - Volume 11 (2005)

The next generation of mobile systems with multimedia processing capabilities and wireless connectivity will be increasingly deployed in highly dynamic and distributed environments for multimedia playback and delivery (e.g. video streaming, multimedia conferencing). The challenge is to meet the heavy resource demands of multimedia applications under the stringent energy, computational, and bandwidth constraints of mobile systems, while constantly adapting to the global state changes of the distributed environment. In this paper, we present our initiatives under the FORGE framework to address the issue of delivering high quality multimedia content in mobile environments. In order to cope with the resource intensive nature of multimedia applications and dynamically changing global state (e.g. node mobility, network congestion), an end-to-end approach to QoS aware power optimization is required. We present a framework for coordinating energy optimizing strategies across various layers of system implementation and functionality and discuss techniques that can be employed to achieve energy gains for mobile multimedia systems.
Locating causes of program failures
Authors: Holger Cleve, Andreas Zeller
Venue: Proceedings of the 27th international conference on Software engineering (2005)

Which is the defect that causes a software failure? By comparing the program states of a failing and a passing run, we can identify the state differences that cause the failure. However, these state differences can occur all over the program run. Therefore, we focus in space on those variables and values that are relevant for the failure, and in time on those moments where cause transitions occur---moments where new relevant variables begin being failure causes: "Initially, variable argc was 3; therefore, at shell_sort(), variable [2] was 0, and therefore, the program failed." In our evaluation, cause transitions locate the failure-inducing defect twice as well as the best methods known so far.
Storage-Based Intrusion Detection for Storage Area Networks (SANs)
Authors: Mohammad Banikazemi, Dan Poff, Bulent Abali
Venue: Proceedings of the 22nd IEEE / 13th NASA Goddard Conference on Mass Storage Systems and Technologies (2005)

Storage systems are the next frontier for providing protection against intrusion. Since storage systems see changes to persistent data, several types of intrusions can be detected by storage systems. Intrusion detection (ID) techniques can be deployed in various storage systems. In this paper, we study how intrusions can be detected at the block storage level and in SAN environments. We propose novel approaches for storagebased intrusion detection and discuss how features of state-of-the-art block storage systems can be used for intrusion detection and recovery of compromised data. In particular we present two prototype systems. First we present a real time intrusion detection system (IDS) which has been integrated within a storage management and virtualization system. In this system incoming requests for storage blocks are examined for signs of intrusions in real time. We then discuss how intrusion detection schemes can be deployed as an appliance loosely coupled with a SAN storage system. The major advantage of this approach is that it does not require any modification and enhancement to the storage system software. In this approach, we use the space and time efficient point-in-time copy operation provided by SAN storage devices. We also present performance results showing that the impact of ID on the overall storage system performance is negligible. Recovering data in compromised systems is also discussed.
Reducing the Power Consumption of FPGAs through Retiming
Authors: Robert Fischer, Klaus Buchenrieder, Ulrich Nageldinger
Venue: Proceedings of the 12th IEEE International Conference and Workshops on Engineering of Computer-Based Systems (2005)

High power dissipation is one of the major disadvantages of FPGAs. A main part of the power consumed is caused by glitches. This paper analyzes the effect of retiming to reduce the power dissipation of a XilinxVirtex-II FPGA. The authors introduce a method to insert staging registers into large designs, that are constructed from a high abstraction level language algorithmic description. Results obtained by measurements suggest a high potential for power savings through retiming.
A Million-Fold Speed Improvement in Genomic Repeats Detection
Authors: John W. Romein, Jaap Heringa, Henri E. Bal
Venue: Proceedings of the 2003 ACM/IEEE conference on Supercomputing (2003)

This paper presents a novel, parallel algorithm for generating top alignments. Top alignments are used for finding internal repeats in biological sequences like proteins and genes. Our algorithm replaces an older, sequential algorithm (Repro), which was prohibitively slow for sequence lengths higher than 2000. The new algorithm is an order of magnitude faster (O(n3) rather than O(n4)). The paper presents a three-level parallel implementation of the algorithm: using SIMD multimedia extensions found on present-day processors (a novel technique that can be used to parallelize any application that performs many sequence alignments), using shared-memory parallelism, and using distributed-memory parallelism. It allows processing the longest known proteins (nearly 35000 amino acids). We show exceptionally high speed improvements: between 548 and 889 on a cluster of 64 dual-processor machines, compared to the new sequential algorithm. Especially for long sequences, extreme speed improvements over the old algorithm are obtained.
ACM SIGGRAPH user experience initiatives
Authors: Barbara Helfer
Venue: CHI '05 extended abstracts on Human factors in computing systems (2005)

There has been a substantial growth in the number of educational and networking opportunities for professionals in the computer graphics and related fields in the last three years. One of the fastest areas of growth is in the field of computer user experience and the development of cultural communities through the advent of portal technologies, blogs, and wikis.
Illumination Invariant Faces
Authors: Rajkiran Gottumukkal, Vijayan K. Asari
Venue: Proceedings of the 33rd Applied Imagery Pattern Recognition Workshop (2004)

We create a model of joint color changes in face images due to lighting variations. This is done by observing how colors of an individuals face with fixed pose and expression are mapped to new colors under different lighting conditions. One of the challenges we are dealing with in this work is that the scenes are not constant for different lighting. Hence we cannot observe the joint color changes of the scenes. However all the scenes have a human subject with approximately frontal pose, so we use the color changes observed on a human subjects face to learn the color mapping. The joint color mappings are represented in a low dimensional subspace obtained using Singular Value Decomposition (SVD). Using these maps the detected face from a new image can be transformed to appear as if taken under canonical lighting condition.
WWW at 15 years: looking forward
Authors: Tim Berners-Lee
Venue: Proceedings of the 14th international conference on World Wide Web (2005)

The key property of the WWWW is its universality: One must be able to access it whatever the hardware device, software platform, and network one is using, and despite the disabilities one might have, and whether oner is in a "developed" or "developing" country; it must support information of any language, culture, quality, medium, and field without discrimination so that a hypertext link can go anywhere; it must support information intended for people, and that intended for machine processing. The Web architecture incorporated various choices which support these axes of universality.Currently the architecture and the principles are being exploited in the recent Mobile Web initiative in W3C to promote content which can be accessed optimally from conventional computers and mobile devices. New exciting areas arise every few months as possible Semantic Web flagship applications. As new areas burst forth, the fundamental principles remain important and are extended and adjusted. At the same time, the principles of openness and consensus among international stakeholders which the WWW consortium employs for new technology are adjusted, but ever-important.
Connection between orthogonal polynomials on the unit circle and bounded interval
Authors: E. Berriochoa, A. Cachafeiro, J. García-Amor
Venue: Journal of Computational and Applied Mathematics (2005)

In this paper we establish the connection between measures on a bounded interval and on the unit circle by a transformation related with the Szegö classical transformation. We transform a measure on the interval [-1, 1] into a measure on [0,2π] in the same form in which the orthogonality measure of the Chebyshev polynomials of fourth kind becomes the Lebesgue measure. We relate the sequences of orthogonal polynomials with respect to both measures and we also relate the coefficients of the three-term recurrence relation with the Schur parameters. When the measures belong to the Szegö class, we study the asymptotic behavior of the orthogonal polynomials on the interval, outside the support of the measure, as well as inside.We also transform the generalized polynomials and we study the orthogonality properties of the new polynomials, obtaining new interesting results, and finally we solve two inverse problems connected with the transformation studied.
Discovering neighborhoods of spam web sites
Authors: Meredith Beaton
Venue: Journal of Computing Sciences in Colleges (2005)

The companies and individuals who attempt to have higher visibility on the Web by manipulating both the content of HTML pages and their hyperlinks in order to boost their ranking in a search result are called "web spammers," and their Web sites "web spam sites." The methods used by spammers often force them to create hundreds, if not thousands, of Web sites and Web pages that are linked together into carefully woven networks (or, in essence, neighborhoods) in order to fool search engines. Although it is subjective to the user whether or not a given spam site is trustworthy, we have developed an algorithm that, given a spam site, can produce the densely connected neighborhood surrounding the site. This poster paper presents this algorithm, our implementation of it, our results and future work.
Survey and Review
Authors: Randy Leveque, Section Editor
Venue: SIAM Review (2005)

NO DATA
Goal-centric traceability for managing non-functional requirements
Authors: Jane Cleland-Huang, Raffaella Settimi, Oussama BenKhadra, Eugenia Berezhanskaya, Selvia Christina
Venue: Proceedings of the 27th international conference on Software engineering (2005)

This paper describes a Goal Centric approach for effectively maintaining critical system qualities such as security, performance, and usability throughout the lifetime of a software system. In Goal Centric Traceability (GCT) non-functional requirements and their interdependencies are modeled as softgoals in a Softgoal Interdependency Graph (SIG). A probabilistic network model is then used to dynamically retrieve links between classes affected by a functional change and elements within the SIG. These links enable developers to identify potentially impacted goals; to analyze the level of impact on those goals; to make informed decisions concerning the implementation of the proposed change; and finally to develop appropriate risk mitigating strategies. This paper also reports experimental results for the link retrieval and illustrates the GCT process through an example of a change applied to a road management system.
Note on the KPK-table size
Authors: H. J. Messerschmidt
Venue: Issue 69 (January 1980) (1980)

Ever since Clark's memorable work on perfect chess endgames, (Clark, 1977) considerable attention has been given to constructing tables to play various basic endgames perfectly. Since these tables are quite large, it is obviously important to keep the size to the absolute practical minimum without complicating the construction or usage.
Behaviour, realism and immersion in games
Authors: Kevin Cheng, Paul A. Cairns
Venue: CHI '05 extended abstracts on Human factors in computing systems (2005)

Immersion is recognised as an important element of good games. However, it is not always clear what is meant by immersion. Earlier work has identified possible barriers to immersion including a lack of coherence between different aspects of the game. Building on this work, we designed an experiment to examine people's expectations of how a game should behave and what would happen if that behaviour was deliberately made to be incoherent. The idea then is to understand immersion through seeing how immersion can be broken. The main manipulation was to alter the behaviour and realism of the graphics in the course of a simple game situation. Surprisingly, results indicated that participants could be so immersed within a simple environment such that even significant changes in behaviour had little effect on the level of immersion. In some cases, the attempted disruptions went completely unnoticed. These results suggest that immersion within an application can overcome effects which are completely against user expectations.
Minimum model semantics for logic programs with negation-as-failure
Authors: Panos Rondogiannis, William W. Wadge
Venue: ACM Transactions on Computational Logic (TOCL) (2005)

We give a purely model-theoretic characterization of the semantics of logic programs with negation-as-failure allowed in clause bodies. In our semantics, the meaning of a program is, as in the classical case, the unique minimum model in a program-independent ordering. We use an expanded truth domain that has an uncountable linearly ordered set of truth values between False (the minimum element) and True (the maximum), with a Zero element in the middle. The truth values below Zero are ordered like the countable ordinals. The values above Zero have exactly the reverse order. Negation is interpreted as reflection about Zero followed by a step towards Zero; the only truth value that remains unaffected by negation is Zero. We show that every program has a unique minimum model MP, and that this model can be constructed with a TP iteration which proceeds through the countable ordinals. Furthermore, we demonstrate that MP can alternatively be obtained through a construction that generalizes the well-known model intersection theorem for classical logic programming. Finally, we show that by collapsing the true and false values of the infinite-valued model MP to (the classical) True and False, we obtain a three-valued model identical to the well-founded one.
Book review: Using Dollars and Sense® Macintosh Version by Mark K. Bilbo (Que Corporation, 1989)
Venue: ACM SIGSMALL/PC Notes (1990)

This book describes in rigorous detail how to use one of the premier financial management software packages in the industry today. The Dollars and Sense package is specifically aimed at the person who wants assistance in managing his/her personal finances. The accounting rules are all aimed at what is called a "cash" basis. Business frequently use an "accrual" basis where money is committed when a transaction is agreed to rather than when the funds are received. This package specifically states it is not designed for that purpose. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Performance characterization of decentralized algorithms for replica selection in distributed object systems
Authors: Ceryen Tan, Kevin Mills
Venue: Proceedings of the 5th international workshop on Software and performance (2005)

Designers of distributed systems often rely on replicas for increased robustness, scalability, and performance. Replicated server architectures require some technique to select a target replica for each client transaction. In this paper, we use simulation to characterize performance (response time, selection error, probability of server overload) for four common replica-selection algorithms (random, greedy, partitioned, weighted) when applied in a decentralized form to client queries in a distributed object system deployed on a local network. We introduce two new selection algorithms (balanced and balanced-partitioned) that give improved performance over the more common algorithms. We find the weighted algorithm performs best among the common algorithms and the balanced algorithm performs best among all those we considered. Our findings should help designers of distributed object systems to make informed decisions when choosing among available replica-selection algorithms.
A CAC Scheme for Multimedia Applications Based on Fuzzy Logic
Authors: Leonard Barolli, Mimoza Durresi, Kaoru Sugita, Arjan Durresi, Akio Koyama
Venue: Proceedings of the 19th International Conference on Advanced Information Networking and Applications - Volume 1 (2005)

The purpose of admission control is to support the Quality of Service (QoS) demands of real time applications via resource reservation. In order to deal with admission control for high-speed networks, in a previous work we proposed a fuzzy based admission control scheme which is flexible and adaptive and makes an intelligent decision for call acceptance. In the previous work, we considered only two indicators for QoS and congestion control. However, for multimedia applications more QoS and CC parameters should be considered. In this paper, we extend our previous work by proposing two additional schemes which are integrated in the previous scheme. The new scheme is called Fuzzy Admission Control for Multimedia applications (MFAC). In this paper, we introduce the conventional admission control schemes and give some simulation results of their performance. We explain the proposed MFAC scheme and present the design of Fuzzy QoS Controller (FQC) and Fuzzy Congestion Controller (FCC). The performance of the new scheme and the comparison with conventional ones is for the future work.
Using qualitative studies to improve the usability of an EMR
Authors: Alan F. Rose, Jeffrey L. Schnipper, Elyse R. Park, Eric G. Poon, Qi Li, Blackford Middleton
Venue: Journal of Biomedical Informatics (2005)

The adoption of electronic medical records (EMRs) and user satisfaction are closely associated with the system's usability. To improve the usability of a results management module of a widely deployed web-based EMR, we conducted two qualitative studies that included multiple focus group and field study sessions. Qualitative research can help focus attention on user tasks and goals and identify patterns of care that can be visualized through task modeling exercises. Findings from both studies raised issues with the amount and organization of information in the display, interference with workflow patterns of primary care physicians, and the availability of visual cues and feedback. We used the findings of these studies to recommend design changes to the user interface of the results management module.
Experiences in code migration from main applications to J2EE servers
Authors: Pat Shuff, Michael Bolton
Venue: Proceedings of the 2004 international symposium on Information and communication technologies (2004)

From July through December of 2003, we migrated and stressed tested a Java program to facilitate web authentication for a user community of about fifty thousand students, staff, and faculty. We initially started with some simple Java code and migrated it into an application server framework. During this process we were required to change out code, design new testing methodologies, and change our understanding of Java performance and tuning. In the end our resulting product had the ability to support up to three hundred authentications per minute, guarantee concurrency on requests, and built the foundation to scale across multiple hardware servers as well as multiple synchronized application servers.
Feature extraction of finger vein patterns based on iterative line tracking and its application to personal identification
Authors: Naoto Miura, Akio Nagasaka, Takafumi Miyatake
Venue: Systems and Computers in Japan (2004)

The research group of which the authors are members has proposed a scheme based on finger vein patterns as a scheme of biometric identification utilizing biological information. Since the finger vein images taken to obtain finger vein patterns are obtained by irradiating the fingers with infrared rays, fluctuations in brightness due to variations in the light power or the thickness of the finger occur. This paper proposes a scheme for extracting global finger vein patterns by iteratively tracking local lines from various positions to robustly extract finger vein patterns from such unclear images. The proposed scheme is robust against brightness fluctuations as compared with the conventional feature extraction schemes and the results of evaluating the proposed scheme by applying it to a personal identification system showed an effective error rate of 0.145&percnt;. &copy; 2004 Wiley Periodicals, Inc. Syst Comp Jpn, 35(7): 61&ndash;71, 2004; Published online in Wiley InterScience (). DOI 10.1002&sol;scj.10596