ppxscal/embedding_network huggingface dataset:
A Trust Management Model for Virtual Communities
Authors: Meng Kui, Wang Yue, Zhang Xu, Xiao Xiaochun, Zhang Gengdu
Venue: Proceedings of the The Fifth International Conference on Computer and Information Technology (2005)

Virtual community is becoming a significant component in today's world of open, decentralized networks. Trust management mechanism is crucial to fertilize the development of the virtual community. After the analysis of the features of virtual community, and various approaches for trust management model, we present a novel trust management model for virtual communities which depends on both process-based and institutional-based trust production. We propose some effective methods to address or alleviate some typical problems in virtual community trust management, such as the feedback incentive problem and malicious or false feedback problem. Our approach satisfies the time-dependence, history-dependence, and subjectivity properties of trust, especially the temporal feature of trust, and is suitable to the virtual community.
Multi-Layer Neural Networks with Improved Learning Algorithms
Authors: Michael Negnevitsky
Venue: Proceedings of the Digital Image Computing on Techniques and Applications (2005)

The most popular training method for multi-layer feed-forward networks has traditionally been the error back-propagation algorithm. This algorithm has proved to be slow in its convergence to the error minimum, thus several methods of accelerating learning using back-propagation have been developed. These include using hyperbolic tangent activation functions, momentum, adaptive learning rates and fuzzy control of the learning parameters. These methods will be looked at in this paper.
Myriad: scalable VR via peer-to-peer connectivity, PC clustering, and transient inconsistency
Authors: Benjamin Schaeffer, Peter Brinkmann, George Francis, Camille Goudeseune, Jim Crowell, Hank Kaczmarski
Venue: Proceedings of the ACM symposium on Virtual reality software and technology (2005)

Distributed scene graphs are important in virtual reality, both in collaborative virtual environments and in cluster rendering. In Myriad, individual scene graphs form a peer-to-peer network whose connections filter scene graph updates and create flexible relationships between scene graph nodes in the various peers. Modern scalable visualization systems often feature high intracluster throughput, but collaborative virtual environments (VEs) over a WAN share data at much lower rates, complicating the use of one scene graph system across the whole application. To avoid these difficulties, Myriad uses fine-grained sharing, whereby sharing properties of individual scene graph nodes can be dynamically changed from C++ and Python, and transient inconsistency, which relaxes resource requirements in collaborative VEs. A test application, WorldWideCrowd, implements these methods to demonstrate collaborative prototyping of a 300-avatar crowd animation viewed on two PC-cluster displays and edited on low-powered laptops, desktops, and even over a WAN.
Accurate repeat finding and object skipping using fingerprints
Authors: Cormac Herley
Venue: Proceedings of the 13th annual ACM international conference on Multimedia (2005)

This paper introduces a novel and very accurate segmentation algorithm. It is very efficient and consumes less than 10% of CPU on a simple desktop PC to segment a stream in real-time. It operates on an audio stream, or on the audio portion of a audio-visual stream. It is very accurate: it accurately detects the positions and durations of objects on an over-the-air broadcast television signal, and songs on both FM and internet radio stations (as checked against labeled ground truth streams). The algorithm does not require any prior information or training. We detail the system design and present results of segmenting broadcast streams.
Developing inclusive e-learning and e-entertainment to effectively accommodate learning difficulties
Authors: Anthony Savidis, Constantine Stephanidis
Venue: Issue 83 (September 2005) (2005)

The requirement for e-inclusion of software applications and services relates to the employment of appropriate development strategies so as to accomplish accessibility and increased interaction quality at deployment time. Effectively, inclusive e-learning is the outcome from the application of e-inclusion design and implementation methods in the context of e-learning systems.
Warped Image restoration with Applications to Digital Libraries
Authors: Li Zhang, Chew Lim Tan
Venue: Proceedings of the Eighth International Conference on Document Analysis and Recognition (2005)

Recently, high resolution digital cameras have made the digitization process more flexible and convenient than traditional scanning technology. Therefore, document image analysis techniques need lo be extended to handle images captured using ordinary hand-held cameras under an uncontrolled environment. In this paper, we propose an image restoration technique that corrects various warping distortions such as rolling curl, binding curl and fold distortions in camera images of geometrically distorted documents. Our goal is to restore these arbitrarily warped document images to a planar shape so as to facilitate OCR. Our method uses Spline interpolation technique based on a ruled surface model constructed from text lines in the 2 0 document image. Comparisons on OCR performance using Microsoff imaging software with two existing methods show an encouraging improvement in terms of recall and precision. The OCR precision on the corrected images using our method is improved up to 21.8% comparing to original images with a resolution of 3 megapixels.
A First Step Towards Call Survivability in Cellular Networks
Authors: Zahid Anwar, William Yurcik, Salman Baset, Henning Schulzrinne, Roy H. Campbell
Venue: Proceedings of the The IEEE Conference on Local Computer Networks 30th Anniversary (2005)

Despite recent advancements in cellular phone network infrastructure, survivability of the calls is still an open issue. Important business calls and tele-conferences cannot benefit from mobility because landlines are preferred owing to their reliability and tolerance to failures. In this paper, we present a framework to improve call survivability by monitoring the user's location and intimating him about the possibility of loss of connectivity, interference, and room schedules that might disrupt conversation. In addition, if a call drops because of unforeseeable circumstances like battery failure or cell-phone damage then the call is switched to the nearest available device capable of streaming voice.
Iterative Mining Translations from the Web
Authors: Fang Li, Shuangqing Yuan, Huanye Sheng
Venue: Proceedings of the International Workshop on Challenges in Web Information Retrieval and Integration (2005)

Multilingual translations play a vital role multilingual or cross-lingual information retrieval and extraction. In this paper, we describe a new method mine translations from bilingual web pages based on our former research. Two new features are introduced, one is the iterative mining process in order to increase the number of translation pairs; the other is the filtering step which deletes language-specific prefix and postfix in hyperlinks. Experiments show that the precision has been greatly improved due to the filtering step and the number of translation pairs increased after six iterations.
Analysis of local operators applied to discrete tracking problems
Authors: Karsten Weicker
Venue: Soft Computing - A Fusion of Foundations, Methodologies and Applications (2005)

This article investigates various local operators in a discrete (1, &#x03bb;)-setting applied to tracking problems, a specific class of non-stationary problems. In the first instance, the influence of operator properties on the tracking performance is examined. Both the enforcement of bigger steps and, especially, directed mutations are found to increase the tracking accuracy considerably. For the examination of highly time restricted problems, a correlation between the population size and the severity of the problem dynamics is assumed. Relatively large population sizes are found to be advantageous if the number of evaluations has a big influence on the severity. All results are obtained using a fixpoint analysis of a worst-case model as well as simulations within a two-dimensional Markov model.
Context-driven smart authoring of multimedia content with xSMART
Authors: Ansgar Scherp, Susanne Boll
Venue: Proceedings of the 13th annual ACM international conference on Multimedia (2005)

In recent years, many highly sophisticated multimedia authoring tools have been developed. Up to today, these system's integration of the targeted user context, however, is limited. With our Context-aware Smart Multimedia Authoring Tool (xSMART) we developed a semi-automatic authoring tool that integrates the targeted user context into the different authoring steps and exploits this context to guide the author through the content authoring process. The design of xSMART allows that it can be extended and customized to the requirements of a specific domain by domain-specific wizards. These wizards realize the user interface that meets best the domain-specific requirements and effectively supports the domain experts in creating their content targeted at a specific user context.
A Fixed-Distribution PAC Learning Theory for Neural FIR Models
Authors: Kayvan Najarian
Venue: Journal of Intelligent Information Systems (2005)

The PAC learning theory creates a framework to assess the learning properties of static models. This theory has been extended to include learning of modeling tasks with m-dependent data given that the data are distributed according to a uniform distribution. The extended theory can be applied for learning of nonlinear FIR models with the restriction that the data are unformly distributed.In this paper, The PAC learning scheme is extended to deal with any FIR model regardless of the distribution of the data. This fixed-distribution m-dependent extension of the PAC learning theory is then applied to the learning of FIR three-layer feedforward sigmoid neural networks.
TCP-PARIS: a Parallel Download Protocol for Replicas
Authors: Roger P. Karrer, Edward W. Knightly
Venue: Proceedings of the 10th International Workshop on Web Content Caching and Distribution (2005)

Parallel download protocols have the potential to reduce file download time and to achieve a server-side load balancing in replica systems, such as peer-to-peer networks, content distribution networks and mirrored servers, by simultaneously establishing connections to multiple replicas and downloading disjoint file parts in parallel. This paper presents TCP-PARIS, a novel parallel download protocol from multiple replicas to one receiver. Because the ideal partitioning of the transfer volume from each server is a dynamic and a difficult-to-predict function of network conditions, server load and data size, TCP-PARIS uses the stream segmentation of TCP and congestion window information to continuously adapt the assigned volume to each server in proportion to the bandwidth-delay product to best approximate the optimal data partitioning. Analytical results, simulation and Internet experiments with a transport-layer implementation characterize the performance and the resource requirements of TCP-PARIS and allow a comparison with related protocols. Extensive simulations with varying network and application parameters show download time reductions of up to 52% compared to single-flow downloads and up to 52% compared to related protocols.
Anecdotes
Authors: Laurie Robertson
Venue: IEEE Annals of the History of Computing (2005)

Reflections on the Difference EngineAndrew BoothDoron Swade's description of the reconstruction of Babbage's Difference Engine at the Science Museum in London prompted some questions: Why didn't Babbage use binary arithmetic? Why didn't Babbage use the electromagnetic relay, which Morse had already invented? These lead to a description of the ARC relay machine at the University of London and to a brief account of its simultaneous carry that gave Babbage such problems. The Founders of the ACM Eric A. Weiss This article provides brief sketches of the eight men who founded the ACM in 1947, along with their backgrounds and later careers. The article also includes the 1972 Silver Anniversary speech by the singular founder, Edmund. C. Berkeley, and discusses its immediate consequences.
A taxonomy approach to simulation model documentation
Authors: Harold Joseph Highland
Venue: ACM SIGSIM Simulation Digest (1979)

In preparing this presentation I find myself in the ineluctable position of an applications-oriented practioners espousing a pedogical approach to simulation model documentation. Although theoretically cloistered in an academic environment, my teaching is applications-oriented and not theoretical, a reflection not only of my industrial background but also my lack of a formal theoretical education in computer science.
Robust A Posteriori Error Estimates for Stationary Convection-Diffusion Equations
Authors: R. Verfürth
Venue: SIAM Journal on Numerical Analysis (2005)

We analyze a posteriori error estimators for finite element discretizations of convection-dominated stationary convection-diffusion equations using locally refined, isotropic meshes. The estimators are based on either the evaluation of local residuals or the solution of discrete local problems with Dirichlet or Neumann boundary conditions. All estimators yield global upper and lower bounds for the error measured in a norm that incorporates the standard energy norm and a dual norm of the convective derivative. They are fully robust in the sense that the ratio of the upper and lower bounds is uniformly bounded with respect to the size of the convection. The estimates are also uniform with respect to the size of the zero-order reaction term and also hold for the limit case of vanishing reaction.
A Component-Based Approach for Integrating Mobile Agents Into the Existing Web Infrastructure
Authors: Haeng-Kon Kim
Venue: Proceedings of the Third ACIS Int'l Conference on Software Engineering Research, Management and Applications (2005)

Mobile agents provide a new abstraction for deploying functionality over the existing internet infrastructure. In the MA(Mobile Agents) framework there are no agent platforms. Instead applications become agent-enabled by using simple JavaBeans components. In this paper we present an architecture that allows currently available web servers to become capable of sending and receiving agents in an easy way. By using this approach, existing web infrastructure can be maintained, while gaining a whole new potential by being able to make use of agent technology. Our approach involves wrapping the components inside a Java servlet that can be included in any web server supporting the Servlet Specification. This servlet enables the servers to receive and send agents that can query local information, and also enables the agents to behave as servlets themselves. We currently have used the framework with several existing commercial web servers, inclusively having the security mechanisms of the framework correctly running and integrated with the security architecture of the server.
An Appropriate Boolean Query Reformulation Interface for Information Retrieval Based on Adaptive Generalization
Authors: Masaharu YOSHIOKA, Makoto HARAGUCHI
Venue: Proceedings of the International Workshop on Challenges in Web Information Retrieval and Integration (2005)

When implementing an IR system that can support comprehensive searches from a wide variety of documents, it is crucial to have a mechanism for selecting appropriate query formulations. For this purpose, many IR systems can modify query terms by estimating the user's information need. However, because modified query terms are usually represented in a complicated form, it is difficult to judge how appropriate they are. In this research, we assume all relevant documents should contain words that correspond to concepts that the user would like to retrieve. Therefore, a Boolean query formula is one good way to represent a user's information need with high readability. To find the required concepts in a relevant document set, we have previously proposed a new IR system that calculates appropriate generalized concepts to represent the user's need. In this study, we implement a user interface that supports reformulation of IR queries by using abstract concepts.
Teaching introductory sociology: paradigms, methodologies, and interactive computing
Venue: ACM SIGSOC Bulletin (1976)

In most departments of sociology, it is often difficult to find instructors willing to teach the introductory course. With recent development of the field, it may become difficult to find instructors able to teach it. Not only is the field and its knowledge growing rapidly, but it is undergoing division into distinct sub-disciplines, each of which must be taken into account in any representative introduction to the discipline. This difficulty--the multi-paradigm nature of current sociology--is the subject of this report, which describes a project that attempts a computer-based solution to the problems facing introductory course instructors.
Formal Fault Tree Analysis of State Transition Systems
Authors: Jianwen Xiang, Kazuhiro Ogata
Venue: Proceedings of the Fifth International Conference on Quality Software (2005)

Fault Tree Analysis (FTA) is a traditional deductive safety analysis technique that is applied during the system design stage. However, traditional FTA does not consider transitions between states, and it is difficult to decompose complex system fault events that are composed of multiple normal components' states rather than individual component failures. To solve these problems, we first propose two different fault events of fault trees, and then present a formal fault tree construction model by introducing the concept of transition rules for event decomposition, in which the semantics of gates and minimal cut sets of fault trees are revised compared with traditional FTA.
Interactive Service Composition in SEWSIP
Authors: YANG Wenjun, LI Juanzi, WANG Kehong
Venue: Proceedings of the IEEE International Workshop (2005)

SOC (Service-Oriented Computing) is the new emerging paradigm for distributed computing and e-business processing, whose vision is to integrate autonomic web services as distributed components into a complicated application. Current composed service processes are mostly generated in the syntactic level and in a manual way. The limitation of such a rigid approach is that it does not allow businesses to dynamically change partners and services [1]. Some semi-automatic web service composition frameworks are present based on both semantic match-making and process recommendation in terms of semantic description of user requirements and concrete web services. However, two problems need to be crossed over in these frameworks. How to design the activities in the process with the exact clarity that can be bound to concrete web service, and how to deal with the problem that the output message type of the preceding service is subtly heterogeneous with the input one of the subsequent service? This paper addresses these two problems and proposes a solution in SEWSIP, a semantic-based web service integration platform. A hierarchical activity mechanism used to control activity clarity and a message transforming mechanism used to eliminate message type heterogeneity, are mainly discussed.
Authoring tools for adaptive learning designs in computer-based education
Authors: Adriana J. Berlanga, Francisco J. García
Venue: Proceedings of the 2005 Latin American conference on Human-computer interaction (2005)

A challenging topic in computer-based education is to develop authoring tools that support the creation of personalized learning designs that, on one hand, do not prescribe any learning approach and, on the other, guarantee the reusability and exchangeability of those learning designs. In this paper we argue that Adaptive Educational Hypermedia Systems (AEHS) can employ the IMS Learning Design (IMS LD) specification as a notational method. In such way, that teachers and designers will have freedom for designing personalized learning flows that are interoperable and reusable. To support our reasoning, first, we briefly explain AEHS and their characteristics. Then, we introduce the learning design concept and the IMS LD specification. Subsequently, we present an authoring tool we are developing to define learning designs with adaptive characteristics for AEHS and, subsequently, we illustrate their definition by means of a study case. Afterwards, we point out the strengths and weakness of utilizing IMS LD in AEHS, and finally, we expose conclusions and further work.
Cognitive impairments, information technology systems and the workplace
Authors: Cathy Bodine
Venue: Issue 83 (September 2005) (2005)

21.3 million Americans have some form of cognitive disability and a large majority of these individuals are working age adults (Braddock, 2005). Cognitive impairment, often labeled as a "hidden disability" is loosely defined as a disability that affect's an individuals awareness; memory; and ability to learn, process information, communicate and make decisions. "Cognition" refers to "understanding," the ability to comprehend what one sees and hears, and to infer information from social cues and body language. Persons with cognitive impairments have difficulty learning new things, expressing themselves through spoken or written language, and making generalizations from one situation to another (Davis, 2000).
Efficient Geometric Algorithms for Parsing in Two Dimensions
Authors: Percy Liang, Mukund Narasimhan, Michael Shilman, Paul Viola
Venue: Proceedings of the Eighth International Conference on Document Analysis and Recognition (2005)

Grammars are a powerful technique for modeling and extracting the structure of documents. One large challenge, however, is computational complexity. The computational cost of grammatical parsing is related to both the complexity of the input and the ambiguity of the grammar. For programming languages, where the terminals appear in a linear sequence and the grammar is unambiguous, parsing is O(N). For natural languages, which are linear yet have an ambiguous grammar, parsing is O(N3). For documents, where the terminals are arranged in two dimensions and the grammar is ambiguous, parsing time can be exponential in the number of terminals. In this paper we introduce (and unify) several types of geometrical data structures which can be used to significantly accelerate parsing time. Each data structure embodies a different geometrical constraint on the set of possible valid parses. These data structures are very general, in that they can be used by any type of grammatical model, and a wide variety of document understanding tasks, to limit the set of hypotheses examined and tested. Assuming a clean design for the parsing software, the same parsing framework can be tested with various geometric constraints to determine the most effective combination.
Optimization of Global Interconnects in High Performance VLSI Circuits
Authors: Min Tang, Jun-Fa Mao
Venue: Proceedings of the 19th International Conference on VLSI Design held jointly with 5th International Conference on Embedded Systems Design (2006)

This paper presents a novel methodology of global interconnect optimization for high performance integrated circuits. The impacts of interconnect width and spacing on various performances such as delay, power dissipation and chip area are analyzed. A tradeoff exists between delay and power dissipation of global interconnects with repeaters insertion. Optimum line width is determined by the minimum delay-power product which is defined as a figure of merit (FOM). As the silicon area and wireability of chip are taken into account, the delay-power-area product is introduced as another FOM to optimize the global interconnects. Optimizations of global interconnect size with different scenarios are applied for various International Technology Roadmap for Semiconductor technology nodes.