ppxscal/embedding_network huggingface dataset:
What is connected by mutual gaze?: user's behavior in video-mediated communication
Authors: Naoki Mukawa, Tsugumi Oka, Kumiko Arai, Masahide Yuasa
Venue: CHI '05 extended abstracts on Human factors in computing systems (2005)

Video-mediated communication systems such as teleconferencing and videophone have become popular. As with face-to-face communication, non-verbal cues such as gaze, facial expression, head orientation and gestures in visual systems play an important role. Existing systems, however, do not support mutual gaze because the lay-out of the camera and monitor is restricted. Thus, conversations using visual systems differ from those in face-to-face communication. This paper clarifies the problems of the video-mediated system, specifically for comparing the system with communication using eye-contact and with communication using no-eye-contact. This study focuses on the protocol of opening communication, e.g. establishment of a visual-audio link, person identification and confirmation of the acceptance of conversation. We conducted experiments using the two systems. Analysis of recorded video sequences revealed that the system using communication with eye-contact induced behavior similar to the system using face-to-face communication.
Designing Efficient Java Communications on Clusters
Authors: Guillermo L. Taboada, Juan Tourino, Ramon Doallo
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 5 - Volume 06 (2005)

This paper aims at designing communication strategies for parallel and distributed Java applications to obtain higher degrees of performance on clusters. Several specific approaches exist to increase the efficiency of Java communications, specially of high level APIs like RMI, although their applicability is relatively limited on clusters, since the development of high performance solutions on clusters usually involves the use of the basic Java Socket interface. This paper examines the current outlook of Java Socket optimisations involving both native and Java side issues in order to make a design proposal named Java Fast Sockets. We have accomplished a thorough analysis of the effects of the suggested configurations and implementations on our Scalable Coherent Interface (SCI) testbed cluster. This evaluation has demonstrated that Java communication performance on clusters can compete with native performance.
Programmatic semantics for natural language interfaces
Authors: Hugo Liu, Henry Lieberman
Venue: CHI '05 extended abstracts on Human factors in computing systems (2005)

An important way of making interfaces usable by non-expert users is to enable the use of natural language input, as in natural language query interfaces to databases, or MUDs and MOOs. When the subject matter is about procedures, however, we have discovered that interfaces can take advantage of what we call Programmatic Semantics, procedural relations that can be inferred from the linguistic structure. Roughly, nouns can be interpreted as data structures; verbs are functions; adjectives are properties. Some linguistic forms imply conditionals, loops, and recursive structures.We illustrate the principles of Programmatic Semantics with a description of Metafor, a "brainstorming" editor for programs, analogous to an outlining tool for prose writing. Metafor interactively converts English sentences to partially specified program code, to be used as "scaffolding" for a more detailed program. A user study showed that Metafor is capable of capturing enough Programmatic Semantics to facilitate non-programming users and beginners' conceptualization of programming problems.
Some higher-order multi-point boundary value problem at resonance
Authors: Zengji Du, Xiaojie Lin, Weigao Ge
Venue: Journal of Computational and Applied Mathematics (2005)

This paper deals with the existence of solutions for the following nth order multi-point boundary value problem at resonance x(n)(t) = f(t, x(t), x'(t),..., x(n-1)(t)) + e(t), t ∈ (0, 1), x(0) = Σi=1m-2 αix(ξi), x'(0) =...= x(n-2) (0) = 0, x(1) = x(η), where f : [0, 1] × Rn → R is a continuous function, e ∈ L1[0, 1], αi ∈ R(1 ≤ i ≤ m - 2), 0 < ξ1 < ξ2 < ... < ξm-2 < 1 and 0 < ξ < 1. An existence theorem is obtained by using the coincidence degree theory of Mawhin.
Helping users avoid bugs in GUI applications
Authors: Amir Michail, Tao Xie
Venue: Proceedings of the 27th international conference on Software engineering (2005)

In this paper, we propose a method to help users avoid bugs in GUI applications. In particular, users would use the application normally and report bugs that they encounter to prevent anyone -- including themselves -- from encountering those bugs again. When a user attempts an action that has led to problems in the past, he/she will receive a warning and will be given the opportunity to abort the action -- thus avoiding the bug altogether and keeping the application stable. Of course, bugs should be fixed eventually by the application developers, but our approach allows application users to collaboratively help each other avoid bugs -- thus making the application more usable in the meantime. We demonstrate this approach using our "Stabilizer" prototype. We also include a preliminary evaluation of the Stabilizer's bug prediction.
Designing high performance data access systems: invited talk abstract
Authors: Andrew Hanushevsky, Bill Weeks
Venue: Proceedings of the 5th international workshop on Software and performance (2005)

In this talk, I discuss practical approaches to designing high performance data access systems and how design choices impact performance measurement methodology. The xrootd data access system is used as an example of how far the performance curve can be pushed, invariable tradeoffs that occur, and when one should stop pursuing the ultimate ideal.
Based on HMM and SVM Multilayer Architecture Classifier for Chinese Sign Language Recognition with Large Vocabulary
Authors: Jianjun Ye, Hongxun Yao, Feng Jiang
Venue: Proceedings of the Third International Conference on Image and Graphics (2004)

This paper has put forward a new architecture classifier method for Chinese sign language recognition (CSLR) to improve the performance of recognition. It is a signer-independent method, to recognize Chinese Sign Language with large vocabulary using multilayer architecture classifier and making use of the advantages both of HMM (Hidden Markov Model) and SVM(Support Vector Machines). Because HMM is good at dealing with sequential inputs, while SVM shows superior performance in classifying with good generalization properties especially for limited samples. Therefore, they can be combined to yield a better and effective multilayer architecture classifier. We apply SVMs to resolve the uncertainty of the remaining which are in confusable sets after the first-stage HMM-based recognizer. And the confusable sets would be updated dynamically according to the results of a recognition performance to optimize the discernment performance next time. Experimental results proved that it is an effective method for CSLR with large vocabulary
A Public Mesh Watermarking Algorithm Based on Addition Property of Fourier Transform
Authors: Li Li, Zhigeng Pan, David Zhang
Venue: Proceedings of the Third International Conference on Image and Graphics (2004)

This paper presents a public mesh watermarking algorithm. First, the resultant watermarked image minus the original image is the watermark information. According to the addition property of the Fourier transform, a change of spatial domain will cause a change in the frequency domain. Then, the watermark information is scaled down and embedded in one part of the x-coordinate of the original mesh. Finally, the x-coordinate of the test mesh is amplified before extraction. Experimental results prove that our algorithm is resistant to a variety of attacks without the need for any preprocessing.
Fast quantum byzantine agreement
Authors: Michael Ben-Or, Avinatan Hassidim
Venue: Proceedings of the thirty-seventh annual ACM symposium on Theory of computing (2005)

We present a fast quantum Byzantine Agreement protocol that can reach agreement in O(1) expected communication rounds against a strong full information, dynamic adversary, tolerating up to the optimal t‹n3 faulty players in the synchronous setting, and up to t‹n4 faulty players for asynchronous systems. This should be contrasted with the known classical synchronous lower bound of Ω(√ nlog n) [3] when t=(n).
Over-Zealous Security Administrators Are Breaking the Internet
Venue: Proceedings of the 16th USENIX conference on System administration (2002)

As the security threats on the Internet are becoming more prevalent, firewalls and other forms of protection are becoming more commonplace. Unfortunately, improperly configured firewalls can cause a variety of problems. One particularly nasty problem is when a firewall administrator chooses to use - or continue using - Path MTU Discovery (a good choice in most situations), but blocks packets required for the protocol to work: ICMP type 3 code 4 packets. This problem, the Path MTU Discovery Black Hole, has been discussed many times before. However with under- 1500 MTU protocols such as PPPoE becoming common for both home and business high-speed connections, this problem is affecting more people than ever before.
Using Generative Design Patterns to Develop Network Server Applications
Authors: Zhuang Guo, Jonathan Schaeffer, Duane Szafron, Patrick Earl
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 4 - Volume 05 (2005)

Design patterns are generic solutions to recurring software design problems. The Correct Object-Oriented Patternbased Parallel Programming System (CO¿P¿S) uses design pattern templates to generate code for design patterns. CO¿P¿S has been used to generate small parallel and sequential applications. This research evaluates the utility and performance of CO¿P¿S on larger network server applications. The Network Server design pattern template is introduced, which significantly eases the complexities involved in network server application development. The Network Server is highly configurable and suitable for the construction of a large variety of network server applications, with a diverse range of functionality and performance requirements. In this paper we highlight a generated Web server with performance comparable to Apache.
A Unified Grid Query Service for Grid Resource Brokers
Authors: Leena Al-Hussaini, Andrew Wendelborn, Paul Coddington
Venue: Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume II - Volume 02 (2005)

Resource Brokers on the Grid consult a number of distributed information services to select the best data source and/or computational resource based on user requirements. The consultation task increases the design complexity of Resource Brokers. This work is the first attempt to unify the distributed grid information services in one framework. The Grid Query Service (GQS) is composed of information services layered on OGSA-DAI Grid services, which are generic data access and integration services. Grid Resource Brokers can consult just one service, the GQS service, to obtain indexed information about grid resources.
Objective Function Features Providing Barriers to Rapid Global Optimization
Authors: M. Locatelli, G. R. Wood
Venue: Journal of Global Optimization (2005)

The purposes of this discussion paper are twofold. First, features of an objective function landscape which provide barriers to rapid finding of the global optimum are described. Second, stochastic algorithms are discussed and their performance examined, both theoretically and computationally, as the features change. The paper lays a foundation for the later findings paper.
Exception handling in workflow-driven Web applications
Authors: Marco Brambilla, Stefano Ceri, Sara Comai, Christina Tziviskou
Venue: Proceedings of the 14th international conference on World Wide Web (2005)

As the Web becomes a platform for implementing B2B applications, the need arises of Web conceptual models for describing Web oriented workflow applications implementing business processes. In this context, new problems about process correctness arise, due to the loose control of Web applications upon the behavior of their Web clients. Indeed, incoherent user's behavior can lead to inconsistent processes.This paper presents a high level approach to the management of exceptions that occur during the execution of processes on the Web. We present a classification of exceptions that can be raised inside workflow-driven Web applications, and recovery policies to retrieve coherent status and data after an exception. We devise these concepts at high level and then we exploit them using a Web modeling language (WebML) that in turn provides development facilities like automatic code generation, validation of hypertext models, and so on. An industrial implementation experience is briefly presented too.
GE: description of the NLTooLSET system as used for MUC-3
Authors: George Krupka, Paul Jacobs, Lisa Rau, Lucja Iwańska
Venue: Proceedings of the 3rd conference on Message understanding (1991)

The GE NLTooLSET is a set of text interpretation tools designed to be easily adapted to new domains. This report summarizes the system and its performance on the MUC-3 task.
A new methodology for representation of TCP performance in multiconnection environments
Authors: Eva González-Parada, J. M. Cano-García, A. Díaz-Estrella
Venue: ACM SIGCOMM Computer Communication Review (2005)

This paper presents a new methodology for graphical representation of TCP performance, either in simulation or real tests, for scenarios where many connections carrying different amounts of data coexist simultaneously. The methodology is based on statistical evaluation of the connections' goodput and graphical representation of the results using three plotting styles, each optimized for a different analysis. The suitability of this methodology has been proven by analysing the performance of different TCP versions and configurations in a web-browsing simulated scenario.
Scalefactor Based Bit Shift FGS Audio Coding
Authors: Fang-Chu Chen, Te-Ming Chiu
Venue: Proceedings of the 19th International Conference on Advanced Information Networking and Applications - Volume 2 (2005)

In this paper, a method for applying psychoacoustic effects into the reformation of an MPEG-4 Bit Sliced Arithmetic Coded (BSAC) scalable audio bitstream is presented. The method is to rearrange the compressed information based on the scalefactors calculated by the psychoacuostics model in order to reflect the different subjective significance of the compressed data. At low bit rate it improves the coding efficiency by a considerable amount.
Handling Asymmetry in Power Heterogeneous Ad Hoc Networks: A Cross Layer Approach
Authors: Vasudev Shah, Srikanth Krishnamurthy
Venue: Proceedings of the 25th IEEE International Conference on Distributed Computing Systems (2005)

Power heterogeneous ad hoc networks are characterized by link layer asymmetry: the ability of lower power nodes to receive transmissions from higher power nodes but not vice versa. This not only poses challenges at the routing layer, but also results in an increased number of collisions at the MAC layer due to high power nodes initiating transmissions while low power communications are in progress. Previously proposed routing protocols for handling unidirectional links largely ignore MAC layer dependencies. In this paper, we propose a cross layer framework that effectively improves the performance of the MAC layer in power heterogeneous ad hoc networks. In addition, our approach seamlessly supports the identification and usage of unidirectional links at the routing layer. The framework is based on intelligently propagating low power MAC layer control messages to higher power nodes so as to preclude them from initiating transmissions while the low power communications are in progress within their sensing range. The integrated approach also constructs reverse tunnels to bridge unidirectional links thereby facilitating their effective usage at the routing layer. Extensive simulations are performed to study the proposed framework in various settings. The use of our framework improves the overall throughput of the power heterogeneous network by as much as 25 % over traditional layered approaches. In summary, our framework offers a simple, yet effective and viable approach for media access control and to support routing in power heterogeneous ad hoc networks.
Ken Robinson on Telecom Policy
Authors: Ubiquity staff
Venue: Ubiquity (2005)

Ken Robinson is a communications attorney in Washington, having worked at the Departments of Justice and Commerce, the FCC, and the Office of Telecommunications Policy during the Nixon Administration. He is editor of the weekly publication 'Telecommunications Policy Review.'
On structurally testing Java programs effectively
Authors: N. Malevris
Venue: Proceedings of the 3rd international symposium on Principles and practice of programming in Java (2004)

Software testing remains the basic means of locating errors in program code. Although there is no single testing method that can isolate all sources of errors, practitioners usually adhere to these techniques in order to establish a high level of confidence at the predelivery phase. Structural testing constitutes the most popular dynamic testing method that exercises the software with test data. Most commercial tools employ this technique as the basis in order to establish a level of confidence in the software under test. In this paper a method to perform structural testing effectively is presented which also reduces the incidence of infeasible paths.
Two attacks on a user friendly remote authentication scheme with smart cards
Authors: Kuo-Feng Hwang, I-En Liao
Venue: ACM SIGOPS Operating Systems Review (2005)

Recently, Wu and Chieu proposed a user-friendly remote authentication scheme with smart card. In their scheme, the users can choose and change their passwords freely. However, their scheme is insecure. In this paper, we propose two attacks on their scheme.
Recognition of Middle Age Persian Characters Using a Set of Invariant Moments
Authors: S. Alirezaee, H. Aghaeinia, M. Ahmadi, K. Faez
Venue: Proceedings of the 33rd Applied Imagery Pattern Recognition Workshop (2004)

In this paper, recognition of ancient middle Persian documents is studied. Our major attention has been focused on feature extraction and classification. A set of Invariant moments has been selected as the features and the Minimum Mean Distance (three versions of which that is called MMD1, MMD2, MMD3), KNN and Parzen as the classifier. Preprocessing is also considered in this paper which allows, the effects of under sampling (resolution pyramids), smoothing, and thinning be investigated. The algorithm has been tested not only on the original and smoothed images but also on the skeletonized and under sampled version of the text under test. The results show an acceptable recognition rate with the selected features with the proposed processing for the middle age Persian. The best-achieved classification rates are 95% and 90.5% for smoothed and original character images respectively. It was interesting to note that KNN and MMD2 classifiers yielded better recognition rate.
C++ Primer (4th Edition)
Authors: Stanley B. Lippman, Josée Lajoie, Barbara E. Moo
Venue:  (2005)

This popular tutorial introduction to standard C++ has been completely updated, reorganized, and rewritten to help programmers learn the language faster and use it in a more modern, effective way.Just as C++ has evolved since the last edition, so has the authors' approach to teaching it. They now introduce the C++ standard library from the beginning, giving readers the means to write useful programs without first having to master every language detail. Highlighting today's best practices, they show how to write programs that are safe, can be built quickly, and yet offer outstanding performance. Examples that take advantage of the library, and explain the features of C++, also show how to make the best use of the language. As in its previous editions, the book's authoritative discussion of fundamental C++ concepts and techniques makes it a valuable resource even for more experienced programmers.Program Faster and More Effectively with This Rewritten Classic Restructured for quicker learning, using the C++ standard library Updated to teach the most current programming styles and program design techniques Filled with new learning aids that emphasize important points, warn about common pitfalls, suggest good programming practices, and provide general usage tips Complete with exercises that reinforce skills learned Authoritative and comprehensive in its coverageThe source code for the book's extended examples is available on the Web at the address below.
Architectural support for protecting user privacy on trusted processors
Authors: Youtao Zhang, Jun Yang, Yongjing Lin, Lan Gao
Venue: ACM SIGARCH Computer Architecture News (2005)

Recently proposed trusted processor model is a promising model for building secure applications. While effective designs have been proposed for protecting data confidentiality and data integrity in such environments, an important security criterion -- user privacy is usually neglected in current designs. Due to the increasing concern of privacy protection in the Internet era, such deficiency can hinder the adoption of the new model.In this paper, we identify the threat model to user privacy and propose a new scheme for user privacy protection. In addition to providing the same ability in protecting data confidentiality and data integrity, the new scheme effectively protects user privacy and only introduces very low overhead.
From StoCharts to MoDeST: a comparative reliability analysis of train radio communications
Authors: Holger Hermanns, David N. Jansen, Yaroslav S. Usenko
Venue: Proceedings of the 5th international workshop on Software and performance (2005)

StoCharts have been proposed as a UML statechart extension for performance and dependability evaluation, and have been applied in the context of train radio reliability assessment to show the principal tractability of realistic cases with this approach. In this paper, we extend on this bare feasibility result in two important directions. First, we sketch the cornerstones of a mechanizable translation of StoCharts to MoDeST. The latter is a process algebra-based formalism supported by the MOTOR/M&Ouml;BIUS tool tandem. Second, we exploit this translation for a detailed analysis of the train radio case study.
ICUIS: A Rule-Based Intelligent ICU Information System
Authors: Yu Fan, Hongyan Li
Venue: Proceedings of the IDEAS Workshop on Medical Information Systems: The Digital Hospital (2004)

In the modern Intensive Care Unit, the high quality management of the patients' data produced by the medical devices is seriously important for improving the treating quality. Besides, since the data in ICU is often multiple, continuous, rapid and time-varying, a data stream processing module should be used to manage, store and display the patient data. ICUIS, a J2EE based ICU information system, imports rule mechanism as well as data stream processor to automatically manage the patient data, and can not only gather the sampling data to record the daily condition of a patient, but also send out an alarm according to the rule when an exceptional data occurs. This paper introduces the rule model, representing language, state conversion and processing flow in the system. ICUIS is different from the other systems because of its following characteristics: rule based intellectualized monitoring and alarming, powerful data stream management, patient-dependent information managements, and the expansibility and adaptability supported by J2EE platform and component-based architecture.