ppxscal/embedding_network huggingface dataset:
Discovery of Time-Series Motif from Multi-Dimensional Data Based on MDL Principle
Authors: Yoshiki Tanaka, Kazuhisa Iwamoto, Kuniaki Uehara
Venue: Machine Learning (2005)

Recently, the research on efficient extraction of previously unknown, frequently appearing patterns in a time-series data has received much attention. These patterns are called `motifs'. Motifs are useful for various time-series data mining tasks. In this paper, we propose a motif discovery algorithm to extract a motif that represents a characteristic pattern of the given data based on Minimum Description Length (MDL) principle. In addition, the algorithm can extract motifs from multi-dimensional time-series data by using Principal Component Analysis (PCA). In experimental evaluation, we show the efficiency of the motif discovery algorithm, and the usefulness of extracted motifs to various data mining tasks.
Transaction Mechanism Design in Decentralized Computational Market
Authors: Fu Qianfei, Yang Shoubao, Li Maosheng, Zhu Junmao
Venue: Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume I - Volume 01 (2005)

Based on Utility and Mechanism Design theory, this paper describes grid resources trade and allocation mechanism in Decentralized Computational Market, focusing on the design of double auction and aggregate market mechanism. Double auction mechanism employs decentralized architecture in decision making. The price fluctuates according to the wave of supply & demand of the market and the participants' bid strategy. Comparatively, there has little participants' influence in aggregate market mechanism; the price is determined by the central price setup system. Although presenting higher performance, aggregate market mechanism sacrifices interest of the bargainers. The simulations of single type commodity (CPU slices) market illustrate validity of the two kinds of trade mechanism. Comparing analysis is explicated from the view of transaction price, deal amount and the utility increment.
Combinations of multivariate averages
Authors: F. Dai, Z. Ditzian
Venue: Journal of Approximation Theory (2004)

Rate of approximation of combinations of averages on the spheres is shown to be equivalent to K-functionals yielding higher degree of smoothness. Results relating combinations of averages on rims of caps of spheres are also achieved.
Improving Performance of Virtual Reality Applications Through Parallel Processing
Authors: Leonidas Deligiannidis, Robert J. Jacob
Venue: The Journal of Supercomputing (2005)

DLoVe (Distributed Links over Variables evaluation) is a new model for specifying and implementing virtual reality and other next-generation or "non-WIMP" user interfaces. Our approach matches the parallel and continuous structure of these interfaces by combining a data-flow or constraint-like component with an event-based component for discrete interactions. Moreover, because the underlying constraint graph naturally lends itself to parallel computation, DLoVe provides for the constraint graph to be partitioned and executed in parallel across several machines, for improved performance. With our system, one can write a program designed for a single machine but can execute it in a distributed environment with minor code modifications. The system also supports mechanics for implementing or transforming single user programs into multi-user programs. We present experiments demonstrating how DLoVe improves performance by dramatically increasing the validity of the rendered frames. We also present performance measures to measure statistical skew in the frames, which we believe is more suitable for interactive systems than traditional measures of parallel systems, such as throughput or frame rate, because they fail to capture the freshness of each rendered frame.
A SIFT Descriptor with Global Context
Authors: Eric N. Mortensen, Hongli Deng, Linda Shapiro
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 1 - Volume 01 (2005)

Matching points between multiple images of a scene is a vital component of many computer vision tasks. Point matching involves creating a succinct and discriminative descriptor for each point. While current descriptors such as SIFT can find matches between features with unique local neighborhoods, these descriptors typically fail to consider global context to resolve ambiguities that can occur locally when an image has multiple similar regions. This paper presents a feature descriptor that augments SIFT with a global context vector that adds curvilinear shape information from a much larger neighborhood, thus reducing mismatches when multiple local descriptors are similar. It also provides a more robust method for handling 2D nonrigid transformations since points are more effectively matched individually at a global scale rather than constraining multiple matched points to be mapped via a planar homography. We have tested our technique on various images and compare matching accuracy between the SIFT descriptor with global context to that without.
Lower Bounds from Tile Covers for the Channel Assignment Problem
Authors: J. C. M. Janssen, T. E. Wentzell, S. L. Fitzpatrick
Venue: SIAM Journal on Discrete Mathematics (2005)

A method to generate lower bounds for the channel assignment problem is given. The method is based on the reduction of the channel assignment problem to a problem of covering the demand in a cellular network by preassigned blocks of cells called tiles. This tile cover approach is applied to networks with a cosite constraint and two different constraints between cells. A complete family of lower bounds is obtained, which include a number of new bounds that improve or include almost all known clique bounds. When applied to an example from the literature, the new bounds give better results.
HoverCam: interactive 3D navigation for proximal object inspection
Authors: Azam Khan, Ben Komalo, Jos Stam, George Fitzmaurice, Gordon Kurtenbach
Venue: Proceedings of the 2005 symposium on Interactive 3D graphics and games (2005)

We describe a new interaction technique, called HoverCam, for navigating around 3D objects at close proximity. When a user is closely inspecting an object, the camera motions needed to move across its surface can become complex. For tasks such as 3D painting or modeling small detail features, users will often try to keep the camera a small distance above the surface. To achieve this automatically, HoverCam intelligently integrates tumbling, panning, and zooming camera controls into a single operation. This allows the user to focus on the task at hand instead of continuously managing the camera position and orientation. In this paper we show unique affordances of the technique and define the behavior and implementation of HoverCam. We also show how the technique can be used for navigating about data sets without well-defined surfaces such as point clouds and curves in space.
Approximation of Discrete Phase-Type Distributions
Authors: Claudia Isensee, Graham Horton
Venue: Proceedings of the 38th annual Symposium on Simulation (2005)

The analysis of discrete stochastic models such as generally distributed stochastic Petri nets can be done using state space-based methods. The behavior of the model is described by a Markov chain that can be solved mathematically. The phase-type distributions that are used to describe non-Markovian distributions have to be approximated. An approach for the fast and accurate approximation of discrete phase-type distributions is presented. This can be a step towards a practical state space-based simulation method, whereas formerly this approach often had to be discarded as unfeasible due to high memory and runtime costs. Discrete phases also fit in well with current research on proxel-based simulation. They can represent infinite support distribution functions with considerably fewer Markov chain states than proxels. Our hope is that such a combination of both approacheswill lead to a competitive simulation algorithm.
Maximizing the overlap of two planar convex sets under rigid motions
Authors: Hee-Kap Ahn, Otfried Cheong, Chong-Dae Park, Chan-Su Shin, Antoine Vigneron
Venue: Proceedings of the twenty-first annual symposium on Computational geometry (2005)

Given two compact convex sets P and Q in the plane, we compute an image of P under a rigid motion that approximately maximizes the overlap with Q. More precisely, for any ε > 0, we compute a rigid motion such that the area of overlap is at least 1 - ε times the maximum possible overlap. Our algorithm uses O(1/ε) extreme point and line intersection queries on P and Q, plus O((1/ε2) log(1/ε)) running time. If only translations are allowed, the extra running time reduces to O((1/ε) log(1/ε)). If P and Q are convex polygons with n vertices in total, the total running time is O((1/ε) log n + (1/ε2) log(1/ε)) for rigid motions and O((1/ε) log n + (1/ε) log(1/ε)) for translations.
Realization of multi-agent planning system for autonomous spacecraft
Authors: Xu Rui, Cui Pingyuan, Xu Xiaofei
Venue: Advances in Engineering Software (2005)

To achieve fully autonomy of deep space spacecraft, onboard planning is a crucial technology. Though, lots of successful applications about it in spacecraft operations have recently been used in real or experimental flight, the inherent distribution and concurrency of the spacecraft subsystem was not taken into consideration. To improve the efficiency of planning system, a multi-agent planning system (MAPS) of autonomous spacecraft is proposed in this paper. MAPS subdivides the search space into some small ones and every PA manages and operates in its own space. With the help of planning manager agent (PMA), all of the planning agents communicate and cooperate with each other to produce partial plan which satisfied all the constraints of the system. To be capable of describing simultaneous activity, continue time, resource and temporal constraints in MAPS, a new planning formal model is given firstly. As the application of this architecture, an MAPS prototype system for deep spacecraft, which is realized with Java language, is designed.
An Image-Guided Heuristic for Planning an Exhaustive Enumeration
Authors: Joselito J. Chua, Asha Rao
Venue: Proceedings of the Fourth International Conference on Hybrid Intelligent Systems (2004)

This paper proposes a heuristic for planning a distributed search that yields an exhaustive enumeration. The paper is motivated by the need to search for binary extremal self-dual codes. The proposed technique represents the search space as an image. A partial image is obtained by a preliminary sampling of the search space. We propose an image restoration algorithm which can be applied on the partial image in order to identify regions of interest, and prioritize the search accordingly. Experimental results show that the technique can guide the search effectively.
Genetic algorithms for integrated preventive maintenance planning and production scheduling for a single machine
Authors: N. Sortrakul, H. L. Nachtmann, C. R. Cassady
Venue: Computers in Industry (2005)

Despite the inter-dependent relationship between them, production scheduling and preventive maintenance planning decisions are generally analyzed and executed independently in real manufacturing systems. This practice is also found in the majority of the studies found in the relevant literature. In this paper, heuristics based on genetic algorithms are developed to solve an integrated optimization model for production scheduling and preventive maintenance planning. The numerical results on several problem sizes indicate that the proposed genetic algorithms are very efficient for optimizing the integrated problem.
A convergence theory for an overlapping Schwarz algorithm using discontinuous iterates
Authors: Jung-Han Kimn
Venue: Numerische Mathematik (2005)

A new type of overlapping Schwarz methods, using discontinuous iterates, is constructed by modifying the classical overlapping Schwarz algorithm. This new algorithm allows for discontinuous iterates across the artificial interface. For Poisson&#x2019;s equation, this algorithm can be considered as an overlapping version of Lions&#x2019; Robin iteration method for which little is known concerning the rate of convergence. Since overlap improves the performance of the classical algorithms considerably, the existence of a uniform convergence factor is the fundamental question for our algorithm. A new theory using Lagrange multipliers is developed and conditions are found for the existence of an almost uniform convergence factor for the dual variables, which implies rapid convergence of the primal variables, in the two overlapping subdomain case. Our result also shows a relation between the boundary conditions of the given problem and the artificial interface condition. Numerical results for the general case with cross points are also presented. They indicate possible extensions of our results to this more general case.
Planar tilings by polyominoes, polyhexes, and polyiamonds
Authors: Glenn C. Rhoads
Venue: Journal of Computational and Applied Mathematics (2005)

Using computer programs, we enumerate and classify the tiling behavior of small polyominoes (n ≤ 9), polyhexes (n ≤ 7), and polyiamonds (n ≤ 10). For tiles that tile the Euclidean plane, we give diagrams illustrating how they tile. We also show several larger tiles whose minimal fundamental domain in any admitted (periodic) tiling is significantly larger than for any previously known tile.
Storage and the network
Authors: Win Treese
Venue: netWorker (2005)

For as long as I can remember---and probably since the invention of the computer---there have been two rules about storage space for computer data: You never have enough of it, and if you have more, it's not connected to the right computer. Somehow this seems to be true even with the incredible increases in the capacity of disk drives, with retail prices in the neighborhood of 50 cents per gigabyte.
On the performance of additive increase multiplicative decrease (AIMD) protocols in hybrid space-terrestrial networks
Authors: Chunmei Liu, Eytan Modiano
Venue: Computer Networks and ISDN Systems (2005)

It is well known that TCP does not perform well in networks with large propagation delay and high link loss probability, which are typical in hybrid space-terrestrial networks. Implementing Automatic-Repeat-Request (ARQ) retransmission over satellite links in hybrid networks has been proposed to enhance TCP performance by hiding the link losses from TCP. This paper analyzes the impact of implementing ARQ over satellite links on TCP performance. In particular, this paper focuses on the window flow control mechanism of TCP, and provides an exact model for a hybrid space-terrestrial system with transport layer Additive-Increase-Multiplicative-Decrease (AIMD) protocols and satellite link layer ARQ. Both Go-Back-N (GBN) and Selective-Repeat (SRP) are considered, and the delay of acknowledgements (ACKs) of ARQ are taken into account. The numerical solutions for the throughput as a function of different protocol and packet loss parameters are presented. Both the analysis and numerical results show that in most cases, implementing ARQ over satellite links can significantly improve TCP performance, and that proper choices of the protocol parameters can significantly improve the system performance as well. Although the paper focuses on hybrid space-terrestrial networks, the analysis and results are also applicable to other networks with large bandwidth-delay product and one error-prone bottleneck link.
High Performance Computing Environments Without the Fuss: The Bootable Cluster CD
Authors: Sarah M. Diesburg, Paul A. Gray, David Joiner
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 13 - Volume 14 (2005)

This paper confronts the issue of bringing high performance computing (HPC) education to those who do not have access to a dedicated clustering environments in an easy, fully-functional, inexpensive manner through the use of the "Bootable Cluster CD" (BCCD). As an example, many primarily undergraduate institutions (PUI's) do not have the facilities, time, or money to purchase hardware, maintain user accounts, configure software components, and keep ahead of the latest security advisories for a dedicated clustering environment. The BCCD project's primary goal is to support an instantaneous, drop-in distributed computing environment. A consequence of providing such an environment is the ability to promote the education of high performance computing issues at the undergraduate level through the ability to turn an ordinary lab of networked workstations temporarily into a non-invasive, fully-functional clustering classroom. The BCCD itself is a self-contained clustering environment in a bootable CD format. Using the BCCD, students, educators and researchers are able to gain insight into configuration, utilization, troubleshooting, debugging, and administration issues uniquely associated with parallel computing in a live, easy to use "drop-in" clustering environment. As the name implies, the BCCD provides a full, cohesive clustering environment running GNU/Linux when booted from the CDROM drives of networked workstations.
Balancing strategic interests and technological requirements for mobile services
Authors: Timber Haaker, Edward Faber, Harry Bouwman
Venue: Proceedings of the 6th international conference on Electronic commerce (2004)

Designing business models for mobile services is a complex undertaking because it requires multiple actors to balance different design requirements. A business model can be seen as a blueprint of four interrelated components or domains: service, technology, organization and finance domain. Little attention has been paid to how these different domains are related to one another. This knowledge is needed to enhance our understanding of what constitutes a viable business model. In this paper the interdependencies between two of these domains, namely organization and technology domain, are explored by analyzing critical design issues in business models for mobile services, i.e. partner selection, network openness, network governance, and network complexity in the organization domain, and security, quality of service, management of service profiles, system integration and accessibility in the technology domain. A causal framework is developed, which links these critical design issues to expected network value and business model viability.
Storage declaration in the hardware description language ERES
Authors: Rudolf Gardill, Rainer Klar
Venue: ACM SIGDA Newsletter (1979)

The CHDL ERES is a register-transfer-language providing a nonprocedural description of hardware. This paper presents a short introduction to ERES and the description of registers, transfers and timing constraints. A global method for declaring storages is shown, which allows the modelling of multiple access as well as horizontal or vertical access.
Multi-objective learning control for robotic manipulator
Authors: Khin Kyu Kyu Win, Chien-Chern Cheah
Venue: Journal of Robotic Systems (2004)

Several types of learning controllers have been proposed in the literature to improve the tracking performance of robot manipulators. In most cases, the learning algorithms emphasize mainly on a single objective of learning a desired motion of the end-effector. In some applications, more than one objective may be specified at the same time. For example, a robot may be required to follow a desired trajectory (primary objective) and at the same time avoid an obstacle (secondary objective). Thus, multi-objective learning control can be more effective to realize the collision-free tasks. In this paper, a multi-objective learning control problem is formulated and solved. In the proposed learning control system, the primary objective is to track a desired end-effector's motion and several secondary objectives can be specified for the desired orientation and for obstacles avoidance. To avoid obstacles in the workspace, a new learning concept called &ldquo;region learning control&rdquo; is also proposed in this paper. The proposed learning controllers do not require the exact knowledge of robot kinematics and dynamics. Sufficient condition is presented to guarantee the convergence of the learning system. The proposed learning controllers are applied to a four-link planar redundant manipulator and simulation results are presented to illustrate the performance. &copy; 2004 Wiley Periodicals, Inc.
Exploring practical limitations of TCP over transatlantic networks
Authors: Antony Antony, Johan Blom, Cees de Laat, Jason Lee
Venue: Future Generation Computer Systems (2005)

Tomorrow's large physics and astronomy projects will require to transport tremendous amounts of data over long distances in near real time. Traditional TCP implementations have severe problems in reaching the necessary performance. In the recent past, researchers have shown that TCP implementations can be scaled to achieve multi-gigabit per second speeds over high-bandwidth high-delay networks. The ability of TCP to scale to high speeds opens possibilities for very large data transfers over vast distances. We analyze here whether TCP can fulfill this task and what problems we are faced with. We also examine TCP in the context of dedicated links (Lambdas).
Offshore outsourcing: impact on CS/IS curriculum
Authors: Clifton Dunn, Mustafa Kamal, Ernest Ferguson, Sri Siva
Venue: Journal of Computing Sciences in Colleges (2004)

In November 2002 Forrester Research report [6] predicted that at least 3.3 million white-collar jobs and $136 billion in wages are expected to shift overseas by 2015, of which nearly one million would be IT-related. This was brought closer home when headlines in the Kansas City Star detailed the extensive layoffs of Sprint IT employees due to outsourcing [7]. According to Evans Data Corporation, 4.0% of outsourcing work was done offshore a year ago while 9.6% of outsourcing work is done offshore today [1]. The U.S. Bureau of Labor Statistics reported that 2.1% of U.S. computer and math workers were unemployed as of July 2000. That number had risen to 5.6% by July 2003 [1].
Data dissemination in mobile peer-to-peer networks
Authors: Thomas Repantis, Vana Kalogeraki
Venue: Proceedings of the 6th international conference on Mobile data management (2005)

In this paper we propose adaptive content-driven routing and data dissemination algorithms for intelligently routing search queries in a peer-to-peer network that supports mobile users. In our mechanism nodes build content synopses of their data and adaptively disseminate them to the most appropriate nodes. Based on the content synopses, a routing mechanism is being built to forward the queries to those nodes that have a high probability of providing the desired results. Our simulation results show that our approach is highly scalable and significantly improves resources usage by saving both bandwidth and processing power.