ppxscal/embedding_network huggingface dataset:
Optical Flow Estimation and Segmentation of Multiple Moving Dynamic Textures
Authors: Rene Vidal, Avinash Ravichandran
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 2 - Volume 02 (2005)

We consider the problem of modeling a scene containing multiple dynamic textures undergoing multiple rigid-body motions, e.g., a video sequence of water taken by a rigidly moving camera. We propose to model each moving dynamic texture with a time varying linear dynamical system (LDS) plus a 2-D translational motion model. We first consider a scene with a single moving dynamic texture and show how to simultaneously learn the parameters of the time varying LDS as well as the optical flow of the scene using the so-called dynamic texture constancy constraint (DTCC). We then consider a scene with multiple non-moving dynamic textures and show that learning the parameters of each time invariant LDS as well as their region of support is equivalent to clustering data living in multiple subspaces. We solve this problem with a combination of PCA and GPCA. Finally, we consider a scene with multiple moving dynamic textures, and show how to simultaneously learn the parameters of multiple time varying LDS and multiple 2-D translational models, by clustering data living in multiple dynamically evolving subspaces. We test our approach on sequences of flowers, water, grass, and a beating heart.
Client Software Agents in FCVW
Authors: Elhadi Shakshuki, Ivan Tomek, Omkarnath Prabhu
Venue: Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume II - Volume 02 (2005)

Software agents are a rapidly developing field of Computer Science. The need for software agents is felt in various applications and environments. It has therefore become essential to study agents with respect to the various environments in which operate. MITR's CVW (Collaborative Virtual Workspace) is a collaborative virtual environment where agents can be created and perform important tasks for the user. CVW is very suitable for programming agents especially as they interact with objects, users, and virtual locations. This paper focuses on three types of agents programmed in FCVW (Federated CVW), our extension of CVW. These agents include observer, retriever, and garbage-collector agents. The observer's functions are to observe the behaviour of users, objects, and files. The retriever agent helps a user to find other users, objects and rooms within FCVW. The garbage-collector agent monitors files to inform the user about files on the basis of predefined dates.
Fast and learnable behavioral and cognitive modeling for virtual character animation: Research Articles
Authors: Jonathan Dinerstein, Parris K. Egbert, Hugo de Garis, Nelson Dinerstein
Venue: Computer Animation and Virtual Worlds (2004)

Behavioral and cognitive modeling for virtual characters is a promising field. It significantly reduces the workload on the animator, allowing characters to act autonomously in a believable fashion. It also makes interactivity between humans and virtual characters more practical than ever before. In this paper we present a novel technique where an artificial neural network is used to approximate a cognitive model. This allows us to execute the model much more quickly, making cognitively empowered characters more practical for interactive applications. Through this approach, we can animate several thousand intelligent characters in real time on a PC. We also present a novel technique for how a virtual character, instead of using an explicit model supplied by the user, can automatically learn an unknown behavioral&#x002F;cognitive model by itself through reinforcement learning. The ability to learn without an explicit model appears promising for helping behavioral and cognitive modeling become more broadly accepted and used in the computer graphics community, as it can further reduce the workload on the animator. Further, it provides solutions for problems that cannot easily be modeled explicitly. Copyright &copy; 2004 John Wiley & Sons, Ltd.
On the Transport Capacity of Gaussian Multiple Access and Broadcast Channels
Authors: G. A. Gupta, S. Toumpis, J. Sayir, R. R. Muller
Venue: Proceedings of the Third International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (2005)

We study the transport capacity of a Gaussian multiple access channel, which consists of a set of transmitters and a single receiver. The transport capacity is defined as the sum, over all transmitters, of the product of the transmission rate with a reward r(x), which is a function of the distance x between the transmitter and the receiver, and quantifies the usefulness of transmitting information over a distance x. Assuming that the sum of the transmitter powers is upper bounded, we present in closed form the optimal power allocation among the transmitters, that maximizes the transport capacity. We then present simple expressions for the optimal power allocation and induced transport capacity, as the number of transmitters approaches infinity. We also study the transport capacity of a Gaussian broadcast channel, which consists of a single transmitter and multiple receivers. Here, the transport capacity is defined as the sum, over all receivers, of the product of the transmission rate with a reward r(x). We determine in closed form the maximum possible transport capacity and the distribution of the available transmitter power among the receivers that achieves it. Although this result has already been reported in the literature, our derivation is shorter, and leads to simpler expressions. Our results can be used to gain intuition and develop good design principles in a variety of settings. For example, they apply to the uplink and downlink channel of cellular networks, and also to sensor networks which consist of multiple sensors that communicate with a single central station.
The complexity of the certification of properties of stable marriage
Authors: Daniel J. Dougherty, Stanley M. Selkow
Venue: Information Processing Letters (2004)

We give some lower bounds on the certificate complexity of some problems concerning stable marriage, answering a question of Gusfield and Irving.
On the problem of creation of the pattern computer
Authors: V. Yu. Meitus
Venue: Cybernetics and Systems Analysis (2005)

The problem of creation of a new class of computers called pattern computers is considered. These computer systems are based on the concept of representation of information on their environment in the form of patterns. These computers also process data represented in the form of patterns. Patterns correspond to objects of the world, can support data interchange with one another, and can interact with one another, whereas pattern computers model these activities. A version of description of patterns and examples of representations of patterns are proposed.
Degree Bounds to Find Polynomial Solutions of Parameterized Linear Difference Equations in &#x03a0;&#x03a3;-Fields
Authors: Carsten Schneider
Venue: Applicable Algebra in Engineering, Communication and Computing (2005)

An important application of solving parameterized linear difference equations in &#x03a0;&#x03a3;-fields, a very general class of difference fields, is simplifying and proving of nested multisum expressions and identities. Together with other reduction techniques described elsewhere, the algorithms considered in this article can be used to search for all solutions of such difference equations. More precisely, within a typical reduction step one often is faced with subproblems to find all solutions of linear difference equations where the solutions live in a polynomial ring. The algorithms under consideration deliver degree bounds for these polynomial solutions.
Multiple path-based approach to image-based street walkthrough: Research Articles
Authors: Dong Hoon Lee, Soon Ki Jung
Venue: Computer Animation and Virtual Worlds (2005)

Image-based rendering for walkthrough in the virtual environment has many advantages should over the geometry-based approach, due to the fast construction of the environment and photo-realistic rendered results. In image-based rendering technique, rays from a set of input images are collected and a novel view image is rendered by the resampling of the stored rays. Current such techniques, however, are limited to a closed capture space. In this paper, we propose a multiple path-based capture configuration that can handle a large-scale scene and a disparity-based warping method for novel view generation. To acquire the disparity image, we segment the input image into vertical slit segments using a robust and inexpensive way of detecting vertical depth discontinuity. The depth slit segments, instead of depth pixels, reduce the processing time for novel view generation. We also discuss a dynamic cache strategy that supports real-time walkthroughs in large and complex street environments. The efficiency of the proposed method is demonstrated with several experiments. Copyright &copy; 2005 John Wiley & Sons, Ltd.
Pedestrian Detection in Crowded Scenes
Authors: Bastian Leibe, Edgar Seemann, Bernt Schiele
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 address the problem of detecting pedestrians in crowded real-world scenes with severe overlaps. Our basic premise is that this problem is too difficult for any type of model or feature alone. Instead, we present a novel algorithm that integrates evidence in multiple iterations and from different sources. The core part of our method is the combination of local and global cues via a probabilistic top-down segmentation. Altogether, this approach allows to examine and compare object hypotheses with high precision down to the pixel level. Qualitative and quantitative results on a large data set confirm that our method is able to reliably detect pedestrians in crowded scenes, even when they overlap and partially occlude each other. In addition, the flexible nature of our approach allows it to operate on very small training sets.
Work-Conserving Tandem Queues
Authors: Chia-Li Wang, Ronald W. Wolff
Venue: Queueing Systems: Theory and Applications (2005)

Consider a tandem queue of two single-server stations with only one server for both stations, who may allocate a fraction ¿ of the service capacity to station 1 and 1¿¿ to station 2 when both are busy. A recent paper treats this model under classical Poisson, exponential assumptions.Using work conservation and FIFO, we show that on every sample path (no stochastic assumptions), the waiting time in system of every customer increases with ¿. For Poisson arrivals and an arbitrary joint distribution of service times of the same customer at each station, we find the average waiting time at each station for ¿ = 0 and ¿ = 1. We extend these results to k ¿ 3 stations, sample paths that allow for server breakdown and repair, and to a tandem arrangement of single-server tandem queues.
Detecting chaotic structures in noisy pulse trains based on interspike interval reconstruction
Authors: Takashi Kanamaru, Masatoshi Sekine
Venue: Biological Cybernetics (2005)

The nonlinear prediction method based on the interspike interval (ISI) reconstruction is applied to the ISI sequence of noisy pulse trains and the detection of the deterministic structure is performed. It is found that this method cannot discriminate between the noisy periodic pulse train and the noisy chaotic one when noise-induced pulses exist. When the noise-induced pulses are eliminated by the grouping of ISI sequence with the genetic algorithm, the chaotic structure of the chaotic firings becomes clear, and the noisy chaotic pulse train could be discriminated from the periodic one.
A hardware/software codesign approach for programmable IO devices
Authors: Kuan Jen Lin, Shih Hao Huang, Shih Wen Chen
Venue: Proceedings of the 15th ACM Great Lakes symposium on VLSI (2005)

This work presents a new HW/SW codesign approach for programmable controllers (ICs or IPs) managing IO devices. A novel cost function is defined to evaluate a device driver's performance and formulate its exact minimization as a zero-one integer linear programming problem. The cost function is used to explore the design trade-off between the code performance of a device driver and the number of programmable registers in an IO controller. This work proposes a heuristic algorithm based on the cost function, which iteratively minimizes the software cost until the hardware constraint is violated. The proposed algorithm was implemented in C language and evaluated with a set of real devices. Compared with original designs, the proposed approach can obtain design alternatives that reduce both software and hardware costs.
SOFTENIT: a methodology for boosting the software content of system-on-chip designs
Authors: Abhishek Mitra, Marcello Lajolo, Kanishka Lahiri
Venue: Proceedings of the 15th ACM Great Lakes symposium on VLSI (2005)

Embedded software is a preferred choice for implementing system functionality in modern System-on-Chip (SoC) designs, due to the high flexibility, and lower engineering costs provided by software over hardware. With continuous improvements in embedded processor performance, many system functions, which have traditionally been implemented using dedicated hardware (such as those with real-time performance requirements), are becoming potential candidates for software implementation. For complex SoCs containing many different components, identifying such functions (or hardware blocks), and re-implementing them as embedded software, is a labor-intensive, manual, and error-prone process. In this paper we present techniques for the transformation of behaviors of selected hardware blocks into equivalent software implementations. In particular, we describe Softenit, a methodology for "softening" of SoC hardware, that takes as input, a partitioned and mapped system description, and generates a modified system architecture in which the fraction of system functionality implemented using embedded software is significantly boosted. Application of this methodology to an IEEE 802.11 MAC processor design demonstrates that it can be used to generate new, "softened" system architectures, that yield large reductions in hardware complexity, while satisfying performance requirements, at very low computational cost.
Verifiable Threshold Sharing of a Large Secret Safe-Prime
Authors: Maged Hamada Ibrahim
Venue: Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume I - Volume 01 (2005)

Verifiable secret sharing schemes (VSS) are schemes for the purpose of ensuring that the players are sharing a unique secret and this secret is the secret originally distributed by the dealer if the dealer was honest. However, such schemes do not ensure that the shared secret has any special characteristics (such as being a prime, safe prime or being with a specific bit-length). In this paper, we introduce a secret sharing scheme to allow a set of players to have confidence that they are sharing a large secret prime. Next, we introduce another scheme that allows the players to have confidence that they are sharing a large secret safe prime. Finally we give a subroutine that allows the players to ensure thatthe shared primes are of the appropriate bit-length. What we have in mind is to add fault-tolerance property to the recent all honest RSA function sharing protocol of [Fast Fully Distributed and Threshold RSA Function Sharing, in Proceedings of the Information Systems: New Generations (ISNG-2004)].
A role for Pareto optimality in mining performance data: Research Articles
Authors: Joël M. Malard
Venue: Concurrency and Computation: Practice Experience (2005)

Improvements in performance modeling and identification of computational regimes within software libraries is a critical first step in developing software libraries that are truly agile with respect to the application as well as to the hardware. It is shown here that Pareto ranking, a concept from multi-objective optimization, can be an effective tool for mining large performance datasets. The approach is illustrated using software performance data gathered using both the public domain LAPACK library and an asynchronous communication library based on IBM LAPI active message library. Copyright &copy; 2005 John Wiley & Sons, Ltd.
The (gradually) changing face of state IT jobs
Authors: Suzanne D. Pawlowski, Pratim Datta, Andrea L. Houston
Venue: Communications of the ACM (2005)

Working for the state once meant long hours, low pay, and lots of red tape. That picture has certainly changed in recent years, as state governments plan to compete with the private sector for top IT talent.
Reachability Analysis over Term Rewriting Systems
Authors: Guillaume Feuillade, Thomas Genet, Valérie Viet Triem Tong
Venue: Journal of Automated Reasoning (2004)

This paper surveys some techniques and tools for achieving reachability analysis over term rewriting systems. The core of those techniques is a generic tree automata completion algorithm used to compute in an exact or approximated way the set of descendants (or reachable terms). This algorithm has been implemented in the \textsf{Timbuk} tool. Furthermore, we show that many classes with regular sets of descendants of the literature corresponds to specific instances of the tree automata completion algorithm and can thus be efficiently computed by \textsf{Timbuk} . An extension of the completion algorithm to conditional term rewriting systems and some applications are also presented.
Communication and security extensions for a ubiquitous mobile agent system (UbiMAS)
Authors: Faruk Bagci, Holger Schick, Jan Petzold, Wolfgang Trumler, Theo Ungerer
Venue: Proceedings of the 2nd conference on Computing frontiers (2005)

Future computers will be integrated in objects of everyday life. The number of processors in the environment will increase and data will be distributed over different nodes. New classes of information and devices will appear, i.e. data will be catched from environmental sensors and will be used for context extraction. The amount of new devices and services makes an efficient use by centralized systems very difficult.Mobile agents provide an eminent method by virtualizing the user and performing actions on her behalf. They offer a possibility to encapsulate information of a person and her preferences, likings, and habits and perform location-based services of the ubiquitous system in the name of the user. This paper presents a mobile agent system application, where a mobile user-agent follows the user while she moves in the physical space. The user-agent knows personal information and communicates with service-agents in the name of its user to perform special tasks. Because of the personal data security and privacy are major concerns of such an agent system. The paper describes the communication of agents and agent nodes and focuses on the security extensions required by this approach
A user-centered approach to visualizing network traffic for intrusion detection
Authors: John R. Goodall, A. Ant Ozok, Wayne G. Lutters, Penny Rheingans, Anita Komlodi
Venue: CHI '05 extended abstracts on Human factors in computing systems (2005)

Intrusion detection (ID) analysts are charged with ensuring the safety and integrity of today's high-speed computer networks. Their work includes the complex task of searching for indications of attacks and misuse in vast amounts of network data. Although there are several information visualization tools to support ID, few are grounded in a thorough understanding of the work ID analysts perform or include any empirical evaluation. We present a user-centered visualization based on our understanding of the work of ID and the needs of analysts derived from the first significant user study of ID. The tool presents analysts with both 'at a glance' understanding of network activity, and low-level network link details. Results from preliminary usability testing show that users performed better and found easier those tasks dealing with network state in comparison to network link tasks.
Star splaying: an algorithm for repairing delaunay triangulations and convex hulls
Authors: Richard Shewchuk
Venue: Proceedings of the twenty-first annual symposium on Computational geometry (2005)

Star splaying is a general-dimensional algorithm that takes as input a triangulation or an approximation of a convex hull, and produces the Delaunay triangulation, weighted Delaunay triangulation, or convex hull of the vertices in the input. If the input is "nearly Delaunay" or "nearly convex" in a certain sense quantified herein, and it is sparse (i.e. each input vertex adjoins only a constant number of edges), star splaying runs in time linear in the number of vertices. Thus, star splaying can be a fast first step in repairing a high-quality finite element mesh that has lost the Delaunay property after its vertices have moved in response to simulated physical forces. Star splaying is akin to Lawson's edge flip algorithm for converting a triangulation to a Delaunay triangulation, but it works in any dimensionality.
Static and dynamic distance metrics for feature-based code analysis
Authors: W. Eric Wong, Swapna Gokhale
Venue: Journal of Systems and Software (2005)

In this paper we present metrics to determine the distance between the features of a software system. Such a measurement can elucidate how features of the system being examined are close to each other. We first use an execution slice-based technique to identify a set of code (basic blocks in our case) that is used to implement each feature. Then, depending on whether the execution frequency of each block is considered during the construction of such sets of code, a static as well as a dynamic distance is computed for each pair of features. These two types of distance differ in that the former computes the distance between two features only by how these features are implemented in the system, while the latter also takes into account how each feature is executed based on a user's operational profile. In other words, the static distance quantitatively gives the closeness of two features from the system implementation point of view, whereas the dynamic distance presents such closeness from the users' execution point of view. To illustrate the use of our metrics, we report a case study on a Symbolic Hierarchical Automated Reliability and Performance Evaluator (SHARPE). The results of our study suggest that the distance metrics discussed in this paper can provide a good measurement, in a quantitative way, of how close two program features are. Such information can also serve as a good start to understanding how a modification made to one feature is likely to affect other features.
Bounded-depth circuits: separating wires from gates
Authors: Michal Koucký, Pavel Pudlák, Denis Thérien
Venue: Proceedings of the thirty-seventh annual ACM symposium on Theory of computing (2005)

We develop a new method to analyze the flow of communication in constant-depth circuits. This point of view allows usto prove new lower bounds on the number of wires required to recognize certain languages. We are able to provide explicit languages that can be recognized by AC0 circuits with O(n) gates but not with O(n) wires, and similarly for ACC0 circuits. We are also able to characterize exactly the regular languages that can be recognized with O(n) wires, both in AC0 and ACC0 framework.