ppxscal/embedding_network huggingface dataset:
Trust Building Among Strangers
Authors: Teck-Hua Ho, Keith Weigelt
Venue: Management Science (2005)

The trust-building process is basic to social science. We investigate it in a laboratory setting using a novel multistage trust game where social gains are achieved if players trust each other in each stage. In each stage, also, players have an opportunity to appropriate these gains or be trustworthy by sharing them. Players are strangers because they do not know the identity of others and they will not play them again. Thus, there is no prospect of future interaction to induce trusting behavior, and we study the trust-building process where there is little scope for social relations and networks.Standard game theory, which assumes all players are opportunistic and untrustworthy and thus should have zero trust for others, is used to construct a null hypothesis. We test whether people are trusting or trustworthy and examine how inferring the intentions of those who trust affects trustworthiness. We also investigate the effect of stake on trust, and study the evolution of trust.Results show subjects exhibit some degree of trusting behavior, although a majority of them are not trustworthy and claim the entire social gain. Players are more reluctant to trust in later stages than in earlier ones and are more trustworthy if they are certain of the trustee's intention. Surprisingly, subjects are more trusting and trustworthy when the stake size increases. Finally, we find the subpopulation that invests in initiating the trust-building process modifies its trusting behavior based on the relative fitness of trust.
Proof of a conjecture on unimodality
Authors: Yi Wang, Yeong-Nan Yeh
Venue: European Journal of Combinatorics (2005)

Let P(x) be a polynomial of degree m, with nonnegative and nondecreasing coefficients. We settle the conjecture that for any positive real number d, the coefficients of P(x + d) form a unimodal sequence, of which the special case d being a positive integer has already been asserted in a previous work. Further, we explore the location of modes of P(x + d) and present some sufficient conditions on m and d for which P(x + d) has the unique mode [m-d/d+1].
GE NLToolset: MUC-4 test results and analysis
Authors: Lisa Rau, George Krupka, Paul Jacobs, Ira Sider, Lois Childs
Venue: Proceedings of the 4th conference on Message understanding (1992)

This paper reports on the GE NLTOOLSET customization effort for MUC-4, and analyzes the results of the TST3 and TST4 runs.
A Framework Focus on Configuration Modeling and Integration with Transparent Persistence
Authors: Ivan Diaz, Juan Tourino, Jesus Salceda, Ramon Doallo
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 18 - Volume 19 (2005)

Computer networks and large-scale systems are growing and becoming increasingly hard to manage, specially in the software front, but also in hardware, and their management information more complicated and hard to integrate in a seamless manner. This paper presents a framework that a) allows the extraction of configuration from its original format, b) models it (including relations and inheritance) via the CIM object-oriented information model, and c) persists and retrieves configuration transparently, independently of the repository, and retaining schema constraints. These steps are facilitated by standard, declarative XSLT templates that allow fast and natural adaptation to new configuration domains, allowing the integration and representation of all configuration information.
Enforcing Messaging Security Policies
Authors: Jaromir Likavec, Stephen D. Wolthusen
Venue: Proceedings of the Third IEEE International Workshop on Information Assurance (2005)

A system for enforcing messaging security policies for both store and forward and streaming messaging protocols on COTS operating system platforms is described. Messaging protocols are subjected to interception, transformation, and filtering based on dynamically configurable security policies. Transformations include the automatic policy-based application of cryptographic confidentiality, integrity, and authenticity mechanisms and filtering primarily based on Bayesian analysis. The system provides a low cost, fine granularity compartmentalization mechanism for secure environments as well as for sensitive butunclassified environments using COTS operating systems and application programs without affecting user or application behavior in which the mediation of access to key material and messaging provides protection against malware and insider attacks.
An Intelligent Model for Reconstruction of Stance Time from Faulty Gait Recording
Authors: J. Kamruzzaman, R. Begg
Venue: Proceedings of the Fourth International Conference on Hybrid Intelligent Systems (2004)

In an erroneous footfall ground-reaction force-time recording, which may occur for people with disabilities or frail elderly individuals, the stance time (ST) can be either corrupted or missing. Previous methods to estimate missing ST requires force-time data from multiple force platforms and are affected by inter-step variability. This paper presents a model based on Support Vector Machine (SVM) that is capable of estimating the missing ST from the available vertical force-timing characteristics with significantly high accuracy. The model was built using features taken from a data set of 466 sample trials of 27 subjects. A test on 40 sample trials drawn from all the subjects revealed an average prediction accuracy of 96.63% (±2.89%). In one-fourth of the test trials, the prediction error was within 1.0%. The model achieves considerable improvement over an Artificial Neural Network based model built and tested on the same data set. The effect of kernel function parameters and ¿-insensitive loss function on prediction error is also analysed and presented.
Robust interpretation of user requests for text retrieval in a multimodal environment
Authors: Alexandra Klein, Estela Puig-Waldmüller, Harald Trost
Venue: Proceedings of the 19th international conference on Computational linguistics - Volume 2 (2002)

We describe a parser for robust and flexible interpretation of user utterances in a multi-modal system for web search in newspaper databases. Users can speak or type, and they can navigate and follow links using mouse clicks. Spoken or written queries may combine search expressions with browser commands and search space restrictions. In interpreting input queries, the system has to be fault-tolerant to account for spontanous speech phenomena as well as typing or speech recognition errors which often distort the meaning of the utterance and are difficult to detect and correct. Our parser integrates shallow parsing techniques with knowledge-based text retrieval to allow for robust processing and coordination of input modes. Parsing relies on a two-layered approach: typical meta-expressions like those concerning search, newspaper types and dates are identified and excluded from the search string to be sent to the search engine. The search terms which are left after preprocessing are then grouped according to co-occurrence statistics which have been derived from a newspaper corpus. These co-occurrence statistics concern typical noun phrases as they appear in newspaper texts.
Tactile Change Detection
Authors: Alberto Gallace, Hong Z. Tan, Charles Spence
Venue: Proceedings of the First Joint Eurohaptics Conference and Symposium on Haptic Interfaces for Virtual Environment and Teleoperator Systems (2005)

Interest in the use of tactile information displays has grown rapidly in recent years. However, relatively little research has been conducted to explore any cognitive and/or attentional limitations that may be inherent when using the body as a receptor surface for the transmission of information. In the present study, participants attempted to detect changes to tactile patterns presented sequentially on the body surface. The patterns consisted of 1-3 vibrotactile stimuli presented for 200ms with a blank interstimulus interval of 800ms. The pattern of tactile stimulation was repeatedly changed (alternating between two different patterns) on 50% of the trials, while no change occurred on the remaining trials. The results showed that participants often failed to detect the changes to the consecutively-presented tactile patterns. This finding may reflect a tactile equivalent of the phenomenon of change blindness reported in previous visual studies. The implications of these finding for human tactile interface design are discussed.
Strong formulations for network design problems with connectivity requirements
Authors: Thomas L. Magnanti, S. Raghavan
Venue: Networks (2005)

The network design problem with connectivity requirements &lpar;NDC&rpar; includes as special cases a wide variety of celebrated combinatorial optimization problems including the minimum spanning tree, Steiner tree, and survivable network design problems. We develop strong formulations for two versions of the edge-connectivity NDC problem: unitary problems requiring connected network designs, and nonunitary problems permitting nonconnected networks as solutions. We &lpar;1&rpar; present a new directed formulation for the unitary NDC problem that is stronger than a natural undirected formulation; &lpar;2&rpar; project out two classes of valid inequalities&mdash;partition inequalities, and combinatorial design inequalities&mdash;that generalize known classes of valid inequalities for the Steiner tree problem to the unitary NDC problem; and &lpar;3&rpar; show how to strengthen and direct nonunitary problems. Our results provide a unifying framework for strengthening formulations for NDC problems, and demonstrate the power of flow-based formulations for network design problems with connectivity requirements. &copy; 2005 Wiley Periodicals, Inc. NETWORKS, Vol. 45&lpar;2&rpar;, 61&ndash;79 2005
Individually adaptive learning management system project
Authors: Kancho Ivanov, Svetoslav Zabunov
Venue: Proceedings of the 5th international conference on Computer systems and technologies (2004)

This article presents a project of a generalized and intelligent learning management system. The whole project is organized upon the circular information flow between the system and the learner. The main feature of the system is its adaptability to the individual learner with the goal to maximize learning process results. This aim defines three major units of the system: Tracking subsystem, Individualizing subsystem, and Adaptation subsystem. They are situated sequentially along the information stream. The result of the work is the definition of a complete individually adaptive learning management system (IALMS).
Coherent signal-subspace processing of acoustic vector sensor array for DOA estimation of wideband sources
Authors: Huawei Chen, Junwei Zhao
Venue: Signal Processing (2005)

This paper deals with the estimation of the direction of arrival (DOA) for wideband coherent sources using acoustic vector sensor array. By extending the idea of wideband focusing into acoustic vector sensor array processing, a wideband DOA estimation approach based on coherent signal-subspace processing is developed for acoustic vector sensor array. Finally, simulation results are presented, to compare the proposed method with its counterpart based on acoustic pressure sensor array, the advantages of the proposed algorithm are identified.
Elsewhere
Venue: IEEE Internet Computing (2003)

Review of Internet stories in Computer Society, IEEE, and trade press. 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
Concurrent urban legends: Research Articles
Authors: Peter A. Buhr, Ashif S. Harji
Venue: Concurrency and Computation: Practice Experience (2005)

This discussion addresses a number of urban legends about concurrency in an attempt to separate the myth from the fact. These legends are as follows: concurrent = parallel; coroutining = concurrency; synchronization = mutual exclusion; Dekker < Peterson; concurrency = library; inheritance anomaly = major concurrency problem; signalling = hints; spurious wakeup = efficiency. Identifying and understanding the fundamental concepts underlying concurrency is essential to the field. Equally important is not to confuse sequential and concurrent concepts. Finally, approaches based solely on efficiency are insufficient to justify a weak or difficult to use concurrent concept or construct. Copyright &copy; 2005 John Wiley & Sons, Ltd.
Magister-P; a 6-URS parallel haptic device with open control architecture
Authors: Jose M. Sabater, Jose M. Azorin, Rafael Aracil, Roque J. Saltaren
Venue: Robotica (2005)

This paper presents a new haptic device based on a parallel structure that can be used as a master interface in a teleoperation or haptic control architecture. The basic idea of a haptic device is to serve force and&#x002F;or position reflection to the operator; at the same time that is being used by the human operator to input the required commands. The original mechanical structure of the presented system implies important advantages over other existing devices. The mechanism is a modification of the 6-d.o.f. Gough platform where the linear actuators have been replaced by cable-driven pantographs. Avoiding the use of reduction gears by means of cable transmission allows a wide sensing bandwidth. Some experimental indices comparing the performance of the presented device are presented. The paper shows the geometrical model and the kinematic analysis used on the control algorithms of this interface. The hardware and software architectures used on the system, and the control schemes implemented on a multi-axis board, are detailed. This setup provides an open control architecture that allows the implementation and experimentation of several bilateral control schemes. The integration of the haptic device in a teleoperation simulator is shown. This simulator includes virtual robotic slaves and its dynamic interaction with the virtual environment. Finally, the results obtained in the virtual objects manipulation experiments are shown. A classical force-position bilateral control scheme was used for these experiments.
A Roadmap of Financial Measures for IT Project ROI
Authors: Jeanette Nasem Morgan
Venue: IT Professional (2005)

Financial and project management techniques, such as activity-based costing, are keycomponents for implementing large-scale IT projects.
Sensitive information: A review and research agenda: Research Articles
Authors: E. Dale Thompson, Michelle L. Kaarst-Brown
Venue: Journal of the American Society for Information Science and Technology (2005)

A basic challenge for intelligence and security informatics is exploring the ways in which humans categorize or classify &ldquo;sensitive&rdquo; information. Research and practice support the critical nature of categorization frameworks, yet there are a number of different ways humans conceptualize sensitive information. In this paper we review some of the dilemmas associated with classification of sensitive information, present different classification approaches, and then identify alternative propositions related to factors that influence judgments about degree of sensitivity. We conclude with directions for future research. &copy; 2005 Wiley Periodicals, Inc.
Testing monotone high-dimensional distributions
Authors: Ronitt Rubinfeld, Rocco A. Servedio
Venue: Proceedings of the thirty-seventh annual ACM symposium on Theory of computing (2005)

A monotone distribution P over a (partially) ordered domain has P(y) ≥ P(x) if y ≥ x in the order. We study several natural problems of testing properties of monotone distributions over the n-dimensional Boolean cube, given access to random draws from the distribution being tested. We give a poly(n)-time algorithm for testing whether a monotone distribution is equivalent to or ε-far (in the L1 norm) from the uniform distribution. A key ingredient of the algorithm is a generalization of a known isoperimetric inequality for the Boolean cube. We also introduce a method for proving lower bounds on testing monotone distributions over the n-dimensional Boolean cube, based on a new decomposition technique for monotone distributions. We use this method to show that our uniformity testing algorithm is optimal up to polylog(n) factors, and also to give exponential lower bounds on the complexity of several other problems (testing whether a monotone distribution is identical to or ε-far from a fixed known monotone product distribution and approximating the entropy of an unknown monotone distribution).
Book review: The Intemet Quickstart by Mary Ann Spike and Todd Spike (Que 1994)
Venue: ACM SIGICE Bulletin (1995)

The reviewers have a positive impression of the book. The material is well organized and presented in a clear fashion without the introduction of undo detail prior to being necessary.
A method of generating seamless texture using GA
Authors: Tatsumi Yamada, Akihiko Hashimoto, Fumio Adachi, Katsunori Shimohara, Yukio Tokunaga
Venue: Systems and Computers in Japan (2004)

This paper proposed a method of generating seamless textures by means of a genetic algorithm (GA). When the texture of a large region is built up from textures in regions of finite size, textural discontinuities usually arise at the boundaries between these regions. A seamless texture is one in which such discontinuities do not occur. A fractal method has been proposed for the generation of seamless textures, but in that method it is difficult to predict what seamless texture will be generated. Pattern generation cannot be controlled in such a way that a texture similar to an already generated seamless texture will be produced. In this paper an attempt is made to solve this problem by applying the GA to texture generation, yielding seamless textures that are similar to seamless textures previously generated. This method can also be used to generate multiple seamless textures. By using the proposed method, a texture with a user-selected pattern can be generated from simultaneously displayed seamless textures. In addition, to avoid monotonous behavior due to the arrangement of textures of a single kind, a method of generating seamless textures with the same boundary but with different internal pattern (group texture) is proposed. &copy; 2004 Wiley Periodicals, Inc. Syst Comp Jpn, 35(2): 91&ndash;99, 2004; Published online in Wiley InterScience (). DOI 10.1002&sol;scj.1229
Link-layer salvaging for making routing progress in mobile ad hoc networks
Authors: Chansu Yu, Kang G. Shin, Lubo Song
Venue: Proceedings of the 6th ACM international symposium on Mobile ad hoc networking and computing (2005)

IEEE 802.11 MAC, called the Distributed Coordination Function (DCF), employs carrier sensing to effectively avoid collisions, but this makes it difficult to maximally reuse the spatial spectral resource available for exposed terminals. This paper proposes a new MAC algorithm, called Multiple Access with Salvation Army (MASA), which adopts less sensitive carrier sensing to promote more spatial reuse of the channel. However, this may result in a higher collision probability. MASA alleviates this problem by adaptively adjusting the communication distance via "packet salvaging" at the MAC layer. Extensive simulation based on the ns-2 has shown MASA to offer as much as 25% higher packet delivery rate and 27% higher throughput than the DCF with the CBR (constant bit rate) and TCP traffic, respectively. In particular, a significant reduction in packet delay, 86% and 70% lower packet delay with the CBR and TCP traffic, makes MASA suitable for delay-sensitive applications. For practicality, we discuss the implementation of MASA based on the DCF specification.
Virtual museums for all: employing game technology for edutainment
Authors: George Lepouras, Costas Vassilakis
Venue: Virtual Reality (2004)

Museums have started to realise the potential of new technologies for the development of edutainment content and services for their visitors. Virtual reality technologies promise to offer a vivid, enjoyable experience to the museums guests, but the cost in time, effort and resources can prove to be overwhelming. In this paper, we propose the use of 3D game technologies for the purpose of developing affordable, easy to use and pleasing virtual environments. To this end, we present a case study based on an already developed version of a virtual museum and a newly implemented version that uses game technologies. The informal assessment indicates that game technologies can offer a prominent and viable solution to the need for affordable desktop virtual reality systems.
Software reuse guidelines
Authors: Muthu Ramachandran
Venue: ACM SIGSOFT Software Engineering Notes (2005)

In this paper, we discuss the general area of software development for reuse and reuse guidelines. We identify, in detail, language-oriented and domain-oriented guidelines whose effective use affects component reusability. This paper also proposes a tool support which can provide advise and can generate reusable components automatically and it is based on domain knowledge (reuse guidelines represented as domain knowledge).
Robust Centerline Extraction Framework Using Level Sets
Authors: M. Sabry Hassouna, Aly A. Farag
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 1 - Volume 01 (2005)

In this paper, we present a novel framework for computing centerlines for both 2D and 3D shape analysis. The framework works as follows: an object centerline point is selected automatically as the point of global maximum Euclidean distance from the boundary, and is considered a point source (PS) that transmits a wave front that evolves over time and traverses the object domain. The front propagates at each object point with a speed that is proportional to its Euclidean distance from the boundary. The motion of the front is governed by a nonlinear partial differential equation whose solution is computed efficiently using level set methods. Initially, the PS transmits a moderate speed wave to explore the object domain and extract its topological information such as merging and extreme points. Then, it transmits a new front that is much faster at centerline points than non central ones. As a consequence, centerlines intersect the propagating fronts at those points of maximum positive curvature. Centerlines are computed by tracking them, starting from each topological point until the PS is reached, by solving an ordinary differential equation using an efficient numerical scheme. The proposed method is computationally inexpensive, handles efficiently objects with complex topology, and computes centerlines that are centered, connected, one point thick, and less sensitive to boundary noise. In addition, the extracted paths form a tree graph without additional cost. We have extensively validated the robustness of the proposed method both quantitatively and qualitatively against several 2D and 3D shapes.
Web Caching in Broadcast Mobile Wireless Environments
Authors: Dimitrios Katsaros, Yannis Manolopoulos
Venue: IEEE Internet Computing (2004)

Effectively exploiting available communication bandwidth and client resources is vital in wireless mobile environments. One technique for doing so is client-side data caching, which helps reduce latency and conserve network resources.The SliCache generic self-tunable cache-replacement policy addresses these issues by using intelligent slicing of the cache space and novel methods for selecting which objects to purge. Performance evaluations show that SliCache improves mobile clients' access to Web objects compared to other common policies.
Review of "Types and Programming Languages by Benjamin C. Pierce"; The MIT Press, 2002
Authors: Mats Kindahl
Venue: ACM SIGACT News (2005)

Type systems and type checking are playing an increasingly important role in the development of programming languages. Almost every programming language developed today are developed with type systems as an integral part of the language.