ppxscal/embedding_network huggingface dataset:
A spreadsheet approach to information visualization
Authors: E. H. -H. Chi, P. Barry, J. Riedl, J. Konstan
Venue: Proceedings of the 1997 IEEE Symposium on Information Visualization (InfoVis '97) (1997)

In information visualization, as the volume and complexity of the data increases, researchers require more powerful visualization tools that enable them to more effectively explore multidimensional datasets. We discuss the general utility of a novel visualization spreadsheet framework. Just as a numerical spreadsheet enables exploration of numbers, a visualization spreadsheet enables exploration of visual forms of information. We show that the spreadsheet approach facilitates certain information visualization tasks that are more difficult using other approaches. Unlike traditional spreadsheets, which store only simple data elements and formulas in each cell, a visualization spreadsheet cell can hold an entire complex data set, selection criteria, viewing specifications, and other information needed for a full-fledged information visualization. Similarly, inter-cell operations are far more complex, stretching beyond simple arithmetic and string operations to encompass a range of domain-specific operators. We have built two prototype systems that illustrate some of these research issues. The underlying approach in our work allows domain experts to define new data types and data operations, and enables visualization experts to incorporate new visualizations, viewing parameters, and view operations.
Video Composition by Spatiotemporal Object Segmentation, 3D-Structure and Tracking
Venue: Proceedings of the 1999 International Conference on Information Visualisation (1999)

In this paper a stereo vision based system for composition of natural and computer generated images is presented. The system focuses on the solution of four essential tasks in computer vision: disparity estimation, object segmentation, modeling and tracking. These tasks are performed in direct interaction with each other using novel and available multiview analysis techniques and conventional computer graphics algorithms. The system is assessed by processing natural video sequences. Selected results are reported in the paper.
The Hidden Layer Associative Memory Model of Hippocampus
Authors: Winfried A. Fellenz, John G. Taylor
Venue: Proceedings of the IEEE-INNS-ENNS International Joint Conference on Neural Networks (IJCNN'00)-Volume 2 - Volume 2 (2000)

A recent model for fast associative memory [3] has shown to be an efficient solution to the storage of binary patterns and the recall from incomplete input. We extend this model to include more biological realistic constraints to serve as a model for the hippocampus. Among the constraints considered, are the limited overall connectivity between the neurons and the distributed processing in a sequence of layered topographically connected maps? Although not all biophysical and modulatory effects from various sources have been incorporated in to the present model, the emergent computational function of the hippocampus as a fast storage mechanism with reliable retrieval and pattern completion abilities from partial cues is the main subject of our study. We will show that the proposed multiple layer mechanism employing a sparse code and a k-winner-take-all mechanism for the storage and retrieval of binary patterns can be matched to the functional layers of the hippocampus, thereby predicting computational roles for each map and an overall processing principle.
Single Machine Scheduling of Unit-time Jobs with Controllable Release Dates
Authors: T.C. Edwin Cheng, Natalia V. Shakhlevich
Venue: Journal of Global Optimization (2003)

The paper presents a bicriterion approach to solve the single-machine scheduling problem in which the job release dates can be compressed while incurring additional costs. The two criteria are the makespan and the compression cost. For the case of equal job processing times, an O(n4) algorithm is developed to construct integer Pareto optimal points. We discuss how the algorithm developed can be modified to construct an &epsiv;-approximation of noninteger Pareto optimal points. The complexity status of the problem with total weighted completion time criterion is also established.
Mobile Agent Messaging Models
Authors: Dwight Deugo
Venue: Proceedings of the Fifth International Symposium on Autonomous Decentralized Systems (2001)

It is not easy to make the decision of which messaging model to use in a mobile agent system. There are many different models to choose from and there are many forces influencing each model. In this paper, we discuss five messaging models: Home-Proxy, Follower-Proxy, Email, Blackboard and Broadcast. We overview the forces that are the most important to all models and identify to what extent the forces influence the models. Our findings suggest that one should not use the Forwarder-Proxy model to build mobile agent systems. Instead, one should use the Blackboard approach, especially when agents require only anonymous messaging. In the case when anonymous messages can't be used, your choice of model can be the Home-Proxy model, the Email model or the Broadcast model depending on which forces are more important to your application.
The Totem Redundant Ring Protocol
Authors: R. R. Koch, L. E. Moser, P. M. Melliar-Smith
Venue: Proceedings of the 22 nd International Conference on Distributed Computing Systems (ICDCS'02) (2002)

Group communication protocols greatly simplify the design of fault-tolerant distributed systems. Most of those protocols focus on node redundancy rather than on network redundancy. The Totem Redundant Ring Protocol allows the use of multiple redundant local-area networks. The partial or total failure of a network remains transparent to the application processes. The distributed system remains operational while an administrator reacts to an alarm raised by the Totem Redundant Ring Protocol. The user can choose between active, passive and active-passive replication of the network.
A Practical User Mobility Prediction Algorithm for Supporting Adaptive QoS in Wireless Networks
Authors: Jonathan Chan, Aruna Seneviratne
Venue: Proceedings of the 7th IEEE International Conference on Networks (1999)

A number of user mobility prediction algorithms have been reported in the literature. These may be used for resource reservation and service pre-configuration/ adaptation in future wireless networks to provide QoS guarantees. However, our analysis of some of these techniques using measured cellular performance shows that these models do not accurately represent the mobility patterns of users. As a result, resource reservation schemes need to reserve excessive resources, and the pre-configuration/ adaptation does not work well. To over come this, we propose an adaptive user mobility prediction algorithm that limits the reservation and configuration procedure to a subset of cells around the user. The viability and effectiveness of the proposed scheme is then demonstrated through a simulation based on measured data.
Utilizing Desktop Virtual Reality to Enhance Visualization: Applied Projects from the Department of Computer Graphics
Venue: Proceedings of the 1999 International Conference on Information Visualisation (1999)

Virtual reality technologies provide a unique method for enhancing user visualization of complex three-dimensional objects and environments. By experience and environmental interaction, users can more readily perceive the dimensional relationships of objects typically portrayed via static multiview or pictorial representations. Until recently, many of the VR technologies required significant computing power for adequate delivery and provided realism that is often less than actual. Alternatively, video-based VR technologies overcome the two major limitations of true three-dimensional VR technologies - computing horsepower and realism. The focus of this contribution is to provide background information on VR technology for the improvement of spatial abilities, describe the advantages of video-based VR technologies, and provide examples showing how video-based VR can be used to enhance visualization in education and training.
Analytic expressions for rate and CV of a type I Neuron driven by white Gaussian noise
Authors: Benjamin Lindner, André Longtin, Adi Bulsara
Venue: Neural Computation (2003)

We study the one-dimensional normal form of a saddle-node system under the influence of additive gaussian white noise and a static "bias current" input parameter, a model that can be looked upon as the simplest version of a type I neuron with stochastic input. This is in contrast with the numerous studies devoted to the noise-driven leaky integrate-and-fire neuron. We focus on the firing rate and coefficient of variation (CV) of the interspike interval density, for which scaling relations with respect to the input parameter and noise intensity are derived. Quadrature formulas for rate and CV are numerically evaluated and compared to numerical simulations of the system and to various approximation formulas obtained in different limiting cases of the model. We also show that caution must be used to extend these results to the Θ neuron model with multiplicative gaussian white noise. The correspondence between the first passage time statistics for the saddle-node model and the Θ neuron model is obtained only in the Stratonovich interpretation of the stochastic Θ neuron model, while previous results have focused only on the Ito interpretation. The correct Stratonovich interpretation yields CVs that are still relatively high, although smaller than in the Ito interpretation; it also produces certain qualitative differences, especially at larger noise intensities. Our analysis provides useful relations for assessing the distance to threshold and the level of synaptic noise in real type I neurons from their firing statistics. We also briefly discuss the effect of finite boundaries (finite values of threshold and reset) on the firing statistics.
Implementing Agglomerative Hierarchic Clustering Algorithms for Use in Document Retrieval
Authors: Ellen M. Voorhees
Venue:  (1986)

Searching hierarchically clustered document collections can be effective, but creating the cluster hierarchies is expensive since there are both many documents and many terms. However, the information in the document-term matrix is sparse: documents are usually indexed by relatively few terms. This paper describes the implementations of three agglomerative hierarchic clustering algorithms that exploit this sparsity so that collections much larger than the algorithms'' worst case running times would suggest can be clustered. The implementations described in the paper have been used to cluster a collection of 12,000 documents.
A System for new event detection
Authors: Thorsten Brants, Francine Chen, Ayman Farahat
Venue: Proceedings of the 26th annual international ACM SIGIR conference on Research and development in informaion retrieval (2003)

We present a new method and system for performing the New Event Detection task, i.e., in one or multiple streams of news stories, all stories on a previously unseen (new) event are marked. The method is based on an incremental TF-IDF model. Our extensions include: generation of source-specific models, similarity score normalization based on document-specific averages, similarity score normalization based on source-pair specific averages, term reweighting based on inverse event frequencies, and segmentation of the documents. We also report on extensions that did not improve results. The system performs very well on TDT3 and TDT4 test data and scored second in the TDT-2002 evaluation.
Paradigm-Oriented Distributed Computing Using Mobile Agents
Authors: Hairong Kuang, Lubomir F. Bic, Michael B. Dillencourt
Venue: Proceedings of the The 20th International Conference on Distributed Computing Systems ( ICDCS 2000) (2000)

We describe the implementation underlying an environment for distributed computing that uses the concept of well-known paradigms. The main advantage of paradigm-oriented distributed computing is that the user only needs to specify application-specific sequential code, while the underlying infrastructure takes care of the parallelization and distribution.The main features of the proposed approach, called PODC, which differentiate it from other approaches, are the following: (1) It is intended for loosely coupled network environments, not specialized multiprocessors; (2) it is based on an infrastructure of mobile agents; (3) it supports programming in C, rather than a functional or special-purpose language, and (4) it provides a Web-based interactive graphics interface through which programs are constructed, invoked, and monitored.The three paradigms presently supported in PODC are the bag-of-tasks, the branch-and-bound, and genetic programming. We describe their implementation and performance within the mobile agent-based PODC environment.
A Decoupled Scheduled Dataflow Multithreaded Architecture
Authors: Krishna M. Kavi, Hyong-Shik Kim, Joseph Arul, Ali R. Hurson
Venue: Proceedings of the 1999 International Symposium on Parallel Architectures, Algorithms and Networks (1999)

In this paper we propose a new approach to building multithreaded uniprocessors that become building blocks in high-end computing architectures. Our innovativeness stems from a multithreaded architecture with non-blocking threads where all memory accesses are decoupled from the thread execution. Data is pre-loaded into the thread context (registers), and all results are post-stored after the completion of the thread execution. The decoupling of memory accesses from thread execution requires a separate unit to perform the necessary pre-loads and post-stores, and to control the allocation of hardware thread contexts to enabled threads. This separation facilitates for achieving high locality and minimizing the impact of distribution and hierarchy in large memory systems. The non-blocking nature of threads eliminates the need for thread switching, thus improving the overhead in scheduling threads. The functional execution paradigm eliminates complex hardware required for scheduling instructions for modern superscalar architectures. We will present our preliminary results obtained from Monte Carlo simulations of the proposed architectural features.
A Quadratically-Convergent Algorithm for the Linear Programming Problem with Lower and Upper Bounds
Authors: Thomas F. Coleman, Yuying Li
Venue:  (1990)

We present a new algorithm to solve linear programming problems with finite lower and upper bounds. This algorithm generates an infinite sequence of points guaranteed to converge to the solution; the ultimate convergence rate is quadratic. The algorithm requires the solution of a linear least squares problem at each iteration it is similar in this respect to recent interior point and "Karmarkar-like" methods. However, the algorithm does not require feasibility of the iterates; instead, monotonic decrease of an augmented linear l1 function is maintained. A penalty parameter is not required. This method is particularly attractive for large-scale problems in that the number of iterations required to obtain high accuracy is relatively insensitive to problem size and is typically quite small. We provide results of numerical experiments.
Bigram-Based Post-Processing for On-Line Handwriting Recognition Using Correctness Evaluation
Authors: Akira Nakamura, Hiromitsu Kawajiri
Venue: Proceedings of the Eighth International Workshop on Frontiers in Handwriting Recognition (IWFHR'02) (2002)

An approach to bigram-based linguistic processing for on-line handwriting text recognition is described. A probability of correctness for each recognition result is derived from a feature set which consists of bigram probabilities and recognition scores. Using the probability of correctness, the number of candidates accepted to the post-processing step and the weight value balancing recognition scores with bigram scores are adaptively controlled. The proposed method is evaluated in experiments using HANDS-kuchibue on-line handwrittencharacter database. Results show that the method is effective in reducing candidates, improving accuracy, and saving computational costs.
A polynomial-time algorithm for deciding bisimilation equivalence of normed Basic Parallel Processes
Authors: Yoram Hirshfeld, Mark Jerrum, Faron Moller
Venue:  (1994)

A polynomial-time algorithm is presented for deciding bisimulation equivalence of so-called Basic Parallel Processes: multisets of elementary processes combined by a commitative parallel-composition operator.
Ensuring consistency in the joint beliefs of interacting agents
Authors: Shamimabi Paurobally, Jim Cunningham, Nicholas R. Jennings
Venue: Proceedings of the second international joint conference on Autonomous agents and multiagent systems (2003)

Agent interaction in realistic applications is subject to many forms of uncertainty -- including information and network uncertainty, trust of and conflicts with other participants, lack of stability in a deal and risks about agreements and commitments. However, one of the most common forms of uncertainty occurs when a group has divergent beliefs about the interaction they are engaged in -- some agents believe an agreement has been reached, while others believe it has been rejected or that they are still bargaining. Such misunderstandings can arise because of loss of network performance, spurious connections, message loss or delays. Against this background, this paper develops synchronisation protocols for a group of agents to attain the same beliefs about an interaction, independent of the reliability of the underlying communication layer. This paper includes and proves theorems about a group's mutual beliefs, on which the safety of an interaction relies. Specifically, protocols for message exchange and belief revision and the reasoning for reachability of states during interactions are presented. Each protocol is proved to show that an increasing level of mutual and consistent belief is reached, thereby guaranteeing an interaction's integrity.
Citrix Metaframe XP: Advanced Technical Design Guide, Including Feature Release 1, 1 edition
Authors: Brian S. Madden
Venue:  (2002)

:Citrix MetaFrame XP: Advanced Technical Design Guide, tells you what you need to know. It tells you how Citrix MetaFrame XP really works, and it tackles the tough design problems. This book is written from experience. This book is a collection of thoughts based on years of experience working with Citrix technologies and products. Each chapter is written like a white paper. While some chapters build upon knowledge and theories from previous chapters, there is no reason that they must be read in order  allowing readers to dive into their most challenge scenarios first. The entire book is solutions-oriented, with a rich, cross-referenced index. The book is Citrix MetaFrame XP: Advanced Technical Design Guide. Citrix MetaFrame XP focuses on MetaFrame XP with or without Feature Release 1, covering both versions extensively. It is not a Microsoft Windows manual. It does not teach Active Directory or NDS. It teaches MetaFrame XP. Advanced: This book does not insult the reader by explaining non-MetaFrame related basics such as what the OSI model is or what how SCSI works. This book assumes that the reader has a solid computing foundation upon which MetaFrame XP knowledge can be built. Technical: This book is a technical guide. It does not talk about the culture of computing or how to manage projects. While both of these are important for successful MetaFrame implementations, there are many other books that cover those topics thoroughly. This book covers the ins and outs of the technology of MetaFrame XP. Design: This book focuses on how MetaFrame XP environments should be designed. It helps the reader understand why certain design points need to be made, and what all of the options are. Guide: The contents of this book are based on the authors experience. Through that the author guides the reader through the decisions, design points, and considerations that must be made in order to successfully deploy and operate Citrix MetaFrame XP.
Direct method for reliability computation ofk-out-of-n: G systems
Authors: G. Arulmozhi
Venue: Applied Mathematics and Computation (2003)

A k-out-of-n: G system has n independent non-identical components; the system fails if any k components fail. This paper gives simple and efficient computational method for determining the system reliability of k out of n systems having unequal and equal reliabilities for components. In both the cases, for a given n and k the system reliability is product of only pi values where as in all the other existing methods system reliability is product of pi and qi values.
Every 3-connected distance claw-free graph is Hamilton-connected
Authors: Rao Li, R. H. Schelp
Venue: Discrete Mathematics (2003)

A graph G is said to be distance claw-free (in DC) if for each vertex v in V(G) the independence number of the subgraph of G induced by the set of vertices at distance i from v is at most 2 for each i ≥ 0. It is shown that every 3-connected graph in DC is hamilton-connected, answering affirmatively a question of Shepherd.
Instantiation of Confidence Factors in Expert Systems
Authors: L A Nigrin
Venue:  (1990)

We present algorithms to instantiate confidence factors in expert systems, given that the logical operators are already instantiated. We show that $nk$ carefully selected input-output behaviors are sufficient to characterize a system with $n$ inputs and a discrete alphabet of size $k$. If an oracle is allowed, we present an algorithms to synthesize the confidence factors in $O(n^2)$ time with $nk$ calls to the oracle. If the alphabet is continuous, then $2n$ input-output behaviors are sufficient to characterize the system, and we can find the correct confidence factors in $O(n)$ time with $2n$ calls to the oracle. We also consider the case where we must satisfy an arbitrary set of input-output behaviors by instantiating the confidence factors. We present an algorithm to solve the problem in this case, but also show that this problem is NP-Complete, by transforming the satisfiability problem to it. 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
Document retrieval from user-selected web sites
Authors: Ulrich Bohnacker, Ingrid Renz
Venue: Proceedings of the 26th annual international ACM SIGIR conference on Research and development in informaion retrieval (2003)

We present a new tool for gathering textual information according to a query (texts) on arbitrary web sites specified by an information-seeking user. This tool is helpful in any knowledge-intensive area. Its technology is based on the vector space model with optimized feature definition. .
DVD Studio Pro for Macintosh: Visual Quick Pro Guide
Authors: Martin Sitter
Venue:  (2002)

:For a few years now, Apple has made waves with their revolutionary digital video editing packages, such as iMovie and Final Cut Pro. But now Apple hastaken the DV revolution even further with its new DVD Studio Pro software,which makes it easy for anyone to create and burn their own DVDs on theMacintosh desktop. It's ideal for anybody who wants to output their video projects to DVD discs, including independent filmmakers, video professionals, corporate trainers, and event videographers.Busy professionals will appreciate the practical format of DVD Studio for Macintosh: Visual QuickPro Guide. Each task is broken down into concise step-by-step instructions, illustrated with plenty of informative screenshots. All the exciting features in DVD Studio Pro merit in-depth treatment: menu creation, chapter markers, scripting, MPEG encoding, asset organization, linking, and output formatting are all clearly explained.