ppxscal/embedding_network huggingface dataset:
Learning to exploit dynamics for robot motor coordination
Authors: Michael T. Rosenstein
Venue:  (2003)

Humans exploit dynamics&mdash;gravity, inertia, joint coupling, elasticity, and so on&mdash;as a regular part of skillful, coordinated movements. Such movements comprise everyday activities, like reaching and walking, as well as highly practiced maneuvers as used in athletics and the performing arts. Robots, especially industrial manipulators, instead use control schemes that ordinarily cancel the complex, nonlinear dynamics that humans use to their advantage. Alternative schemes from the machine learning and intelligent control communities offer a number of potential benefits, such as improved efficiency, online skill acquisition, and tracking of nonstationary environments. However, the success of such methods depends a great deal on structure in the form of simplifying assumptions, prior knowledge, solution constraints and other heuristics that bias learning. My premise for this research is that crude kinematic information can supply the initial knowledge needed for learning complex robot motor skills&mdash;especially skills that exploit dynamics as humans do. This information is readily available from various sources such as a coach or human instructor, from theoretical analysis of a robot mechanism, or from conventional techniques for manipulator control. In this dissertation I investigate how each type of kinematic information can facilitate the learning of efficient &ldquo;dynamic&rdquo; skills. This research is multidisciplinary with contributions along several dimensions. With regard to biological motor control, I demonstrate that motor synergies, i.e. functional units that exploit dynamics, evolve when trial-and-error learning is applied to a particular model of motor skill acquisition. To analyze the effects of velocity on dynamic skills and motor learning, I derive an extension to the notion of dynamic manipulability that roboticists use to quantify a robot's capabilities before specification of a task. And along the machine learning dimension, I develop a supervised actor-critic architecture for learning a standard of correctness from a conventional controller while improving upon it through trial-and-error learning. Examples with both simulated and real manipulators demonstrate the benefits that this research holds for the development of skillful, coordinated robots.
Creating intranets for management and collaboration in federal agencies
Authors: Julianne G. Mahler, Priscilla M. Regan
Venue: Managing IT in government business & communities (2003)

This chapter briefly examines government interest in intranets, describes the experiences of six federal government agencies in developing agency-wide intranets, and identifies and analyzes trends in intranet use, sources of growth, and impediments to further development. The six agencies are: the Department of Transportation, the Department of Housing and Urban Development, the Environmental Protection Agency, the General Services Administration, the Department of Commerce, and the Department of Justice. The case studies reveal six overall trends in intranet use and development including the importance of upper management support in planning and launching and the importance of marketing in ensuring staff use. The authors conclude that intranets offer more potential for enhancing communication and management and that further development of intranets is likely.
An object oriented design for the visualization of multi-variable data objects
Authors: Jean M. Favre, James Hahn
Venue: Proceedings of the conference on Visualization '94 (1994)

This paper presents an object-oriented system design supporting the composition of scientific data visualization techniques based on the definition of hierarchies of typed data objects and tools. Traditional visualization systems focus on creating graphical objects which often cannot be re-used for further processing. Our approach provides objects of different topological dimension to offer a natural way of describing the results of visualization mappings. Serial composition of data extraction tools is allowed, while each intermediate visualization object shares a common description and behavior. Visualization objects can be re-used, facilitating the data exploration process by expanding the available analysis and correlation functions provided. This design offers an open-ended architecture for the development of new visualization techniques. It promotes data and software re-use, eliminates the need for writing special purpose software and reduces processing requirements during interactive visualization sessions.
Isolation of machine dependencies in Euclid
Authors: Edward G. Aseltine, Henry Spencer
Venue: ACM SIGPLAN Notices (1978)

The programming language Euclid was designed for programming such software as operating system kernels, I/O routines, and storage allocators. These applications require access to low level machine details. Euclid makes a serious effort to limit machine dependencies and to isolate them in readily identifiable sections of code. This paper surveys the machine dependencies of Euclid and assesses the effectiveness of the isolation mechanisms.
On minimal disjoint degenerations for preprojective representations of quivers
Authors: Klaus Bongartz, Thomas Fritzsche
Venue: Mathematics of Computation (2003)

We derive a root test for degenerations as described in the title. In the case of Dynkin quivers this leads to a conceptual proof of the fact that the codimension of a minimal disjoint degeneration is always one. For Euclidean quivers, it enables us to show a periodic behaviour. This reduces the classification of all these degenerations to a finite problem that we have solved with the aid of a computer. It turns out that the codimensions are bounded by two. Somewhat surprisingly, the regular and preinjective modules play an essential role in our proofs.
Auto-generation of topic hierarchies for web images from users' perspectives
Authors: Pu-Jen Cheng, Lee-Feng Chien
Venue: Proceedings of the twelfth international conference on Information and knowledge management (2003)

In this paper, we propose an approach to automatically generating a Yahoo!-like topic hierarchy for organizing Web images from users' perspectives. Relatively little effort has been devoted towards providing such a taxonomy simultaneously considering users' image requests for semantic and visual information. Based on the characteristic that a Web-image query may be refined by various attributes, the proposed approach hierarchically groups similar queries from search engine logs into topic classes at different semantic levels. The generated topic hierarchy has the advantages of organizing image data from users' perspectives for browsing, searching, annotation and users' needs analysis.A series of experiments have been conducted on real-world image search engine logs. Experimental results show that the proposed approach is feasible to generate topic hierarchies for Web images. Moreover, the generated hierarchy has been successfully applied to analysis of users' search interests, which have more focuses on some specific domains when compared with document requests.
On Poisson&ndash;Dirichlet Limits for Random Decomposable Combinatorial Structures
Authors: Richard Arratia, A. D. Barbour, Simon Tavaré
Venue: Combinatorics, Probability and Computing (1999)

We prove a joint local limit law for the distribution of the r largest components of decomposable logarithmic combinatorial structures, including assemblies, multisets and selections. Our method is entirely probabilistic, and requires only weak conditions that may readily be verified in practice.
AlgoVista: an algorithmic search tool in an educational setting
Authors: Christian Collberg, Stephen G. Kobourov, Suzanne Westbrook
Venue: ACM SIGCSE Bulletin (2004)

A?goVista is a web-based search engine that assists programmers to find algorithms and implementations that solve specific problems. The search engine is not keyword based but rather requires users to provide (input ? output) samples that describe the behavior of their needed algorithm. The system is easy to use. To search for a particular algorithm or classify a combinatorial structure a user simply draws the query in a drawing pane on a web browser. The result of the search is a list of links to web resources describing or providing implementations of the algorithm.A?goVista has many interesting applications in an educational setting. The search engine can help research students classify obscure problems and locate algorithms that would otherwise be hard to find in textbooks. Students can also add calls in their own programs to A?goVista's database of executable problem specifications in order to dynamically check the correctness of their programs. Finally, instructors can use A?goVista to set novel assignments in algorithms and data structures classes.This paper briefly describes A?goVista and reports on its use in two algorithms and theory classes, one at the undergraduate and one at the graduate level.
Utilizing Statistical Characteristics of N-grams for Intrusion Detection
Authors: Li Zhuowei, Amitabha Das, Sukumar Nandi
Venue: Proceedings of the 2003 International Conference on Cyberworlds (2003)

Information and infrastructure security is a serious issueof global concern. As the last line of defense for securityinfrastructure, intrusion detection techniques are paidmore and more attention. In this paper, one anomaly-basedintrusion detection technique (ScanAID: StatisticalChAracteristics of N-grams for Anomaly-based IntrusionDetection) is proposed to detect intrusive behaviors in acomputer system. The statistical properties in sequencesof system calls are abstracted to model the normal behaviorsof a privileged process, in which the model is characterizedby a vector of anomaly values of N-grams. With areasonable definition of efficiency parameter, the length ofan N-gram and the size of the training dataset are optimizedto get an efficient and compact model. Then, with the optimalmodeling parameters, the flexibility and efficiency ofthe model are evaluated by the ROC curves. Our experimentalresults show that the proposed statistical anomalydetection technique is promising and deserves further research(such as applying it to network environments).
Embedded image transmission over block fading channels
Authors: John C. Kieffer
Venue:  (2003)

Motivated by the progress in the area of embedded image compression, adaptive modulation, and diversity techniques; we propose the problem of embedded image transmission over block fading channels. The objective of embedded image transmission is to have progressive image reconstruction at the output of wireless link according to the user's individual requirements. Our transmission strategy includes three subsystems: embedded image compression with wavelet P&barbelow;ixel C&barbelow;lassification A&barbelow;nd S&barbelow;orting to provide the embedding property; forward transmission with adaptive modulation or time diversity to improve the link spectral efficiency, and enhanced feedback retransmission to guarantee the transmission reliability with limited delay. Throughout this thesis, we emphasize the essential role of known information for embedded image compression; forward transmission, and feedback retransmission. The concepts of classification and sorting are proposed to better understand the previous and current works. Dualities in source coding and channel coding, including models, known information, and classification, accompany the descriptions of system design and performance analysis. There are two main contributions in this thesis. One is a new embedded image compression algorithm based on wavelet pixel classification and sorting; which is able to provide quality or spatial scalability with flexible complexity. The other is adaptive modulation over correlated block fading channels based on partial channel state information at transmitter, where the prediction loss due to delayed feedback is sensitive to channel fading; channel correlation, and target reliability of forward transmission.
Wave motion in infinite inhomogeneous waveguides
Authors: I. Špacapan, M. Premrov
Venue: Advances in Engineering Software (2003)

The analysis of wave motion in infinite homogeneous waveguides, having a complicated cross-section and/or an irregular inclusion, is a rather difficult task for the majority of available methods, especially when striving for accurate results. In contrast, this presented procedure performed in the frequency domain, is simple to apply. It yields correct results because the radiation conditions are considerably accurately satisfied, and it offers a clear parametric insight into wave motion. This procedure uses the FE modelling of an analysed section of the waveguide. It is based on the decomposition of wave motion, distinguishing propagating and non-propagating wavemodes by solving the eigenvalue problem. The presented examples demonstrate the effectiveness of this procedure, whilst a comparison between computed and analytical results demonstrates its accuracy.
Inference of transcriptional regulation relationships from gene expression data
Authors: Andrew T. Kwon, Holger H. Hoos, Raymond Ng
Venue: Proceedings of the 2003 ACM symposium on Applied computing (2003)

We propose a new method for finding potential regulatory relationships between pairs of genes from microarray time series data and apply it to expression data for cell-cycle related genes in yeast. We compare our algorithm, dubbed the event method, with the earlier correlation method and the edge detection method by Filkov et al. When tested on known transcriptional regulation genes, all three methods are able to find similar numbers of true positives. The results indicate that our algorithm is able to identify true positive pairs that are different from those found by the two other methods. We also compare the correlation and the event methods using synthetic data and find that typically, the event method obtains better results.
Modeling player session times of on-line games
Authors: Francis Chang, Wu-chang Feng
Venue: Proceedings of the 2nd workshop on Network and system support for games (2003)

One of the most important aspects in determining the global traffic characteristics of on-line games is to model the traffic behavior of the client. While modeling the client ON-OFF times in web traffic has allowed researchers to generate accurate fractal models of aggregate web traffic, similar work has not yet been done for the domain of games. Previous work in client traffic behavior has shown that clients consume a nearly constant amount of resources when they are on. However, the distribution of the length of ON times for clients has not yet been established [1]. In this paper, we study the player session time distribution over a one-week trace of a popular on-line game server. Our results indicate that the session ON times of game clients steeply decays over time, with a knee at about 15--30 minutes. In addition, we show that the session time PDF can be fitted accurately with a Weibull distribution with parameters (&beta; = 0.5, &eta; = 20, and &gamma; = 0), a result that diverges from previous studies of player session times [2].
Anomalous temperature dependence of the conductivity of nanoporous ITO films
Authors: I. A. Ryzhikov, A. A. Pukhov, A. S. Il'in, N. P. Glukhova, K. N. Afanasiev, A. S. Ryzhikov
Venue: Microelectronic Engineering (2003)

Conductivity of thin (∼200 nm) Indium Tin Oxide (TTO) films with pore size ∼2-3 nm demonstrates anomalous temperature behavior. After every heating-cooling cycle conductivity of the films reduced nearly irreversible. After exposing to the air conductivity increased to no more than 10 percent. We explain the effect by combination of water and oxygen adsorption and desorption from the surface and diffusion in the pores. Under heating electron-donor H2O molecules desorb and concentration of charge careers decreases respectively. Histeresis of temperature of conductivity can be related with electron-acceptor oxygen occupying adsorption sites of desorbed water molecules. These effects were never observed previously and result from the porous structure of the films.
Requirements Development in Loosely Coupled Systems: Building a Knowledge Management System with Schools
Authors: Andreas Breiter
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 1 - Volume 1 (2004)

The diffusion of computers, local area networks and Internet connections in schools and the increase of instructional software and online resources is a challenge for the school system.Appropriate tools to store, access, distribute and to use those resources in schools are still in their infancy. In order to understand why schools as learning institutions are struggling with knowledge exchange, existing models for knowledge management will be described and adopted to the school context. Based on this framework, the specific functional requirements for of key stakeholders in schools are derived. In order to integrate the requirements into system development for a computer-based knowledge management system, a participatory design process was initiated with three schools. The empirical findings during the process of requirement analysis are documented, focusing on key organizational aspects in schools. Based on empirical evidence, it is suggested that participatory design can be used not only as a method for user-oriented system development but also as a catalyst for reflecting the new role of technology for teaching and learning within an organizational change process.
Coding for Fast Access to Image Regions Defined by Pixel Range
Authors: Amir Said, Sehoon Yea, William A. Pearlman
Venue: Proceedings of the Conference on Data Compression (2004)

Many technical imaging applications, like coding "images" of digital elevation maps, require extractingregions of compressed images in which the pixel values are within a pre-defined range, and there is a need forcoding methods that allow finding these regions efficiently, without having to decompress the whole image.We present a series of techniques to solve this problem. First, we show that many of the linear transformscommonly used for image compression can be used for that purpose by proving that the inclusion of nonlinearfactors (like minimum or maximum pixel value in a block) does not render the transformation irreversible, andcan be made to have very limited impact on the compression efficiency. For example, we show how the "DC"coefficient of an 8 x 8 discrete cosine transform (DCT) can be replaced by the minimum or maximum in the8 x 8 block. This result is valid for a large set of transforms, including the DCT, Walsh-Hadamard, and dyadicHaar transforms, and valid for any type of order-statistic filter output. Next, we show the results also apply tothe quantized transform coe±cient cases as well as integer-to-integer transforms. Finally, we study the choicesfor coding the minimum and maximum values simultaneously, while providing quick access to pixel range and efficient compression.
D-Ants: savings based ants divide and conquer the vehicle routing problem
Authors: Marc Reimann, Karl Doerner, Richard F. Hartl
Venue: Computers and Operations Research (2004)

This paper presents an algorithm that builds on the Savings based Ant System presented in [Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 2002), Morgan Kaufmann, San Francisco, 2002] and enhances its performance in terms of computational effort. This is achieved by decomposing the problem and solving only the much smaller subproblems resulting from the decomposition.The computational study and statistical analysis conducted both on standard benchmark problem instances as well as on new large scale Vehicle Routing Problem instances will show that the approach does not only improve the efficiency, but also improves the effectiveness of the algorithm leading to a fast and powerful problem solving tool for real world sized Vehicle Routing Problems.
Incumbent Entry into New Market Niches: The Role of Experience and Managerial Choice in the Creation of Dynamic Capabilities
Authors: Andrew A. King, Christopher L. Tucci
Venue: Management Science (2002)

Increasingly, technological innovation creates markets for new products and services. To survive, firms must respond to these new markets. How do firms develop the capabilities necessary to succeed in such changing conditions? Some suggest that experience with previous entry builds such capabilities. Others suggest that capabilities arise from experience producing and selling to existing markets. The role of managers is also debated. Some argue that experience with existing markets causes managers to miss entry opportunities. Others argue that managers enter new markets when their firm possesses the experience needed to compete effectively.In this paper, we explore these issues by investigating entry patterns in the disk-drive industry. We investigate the effect of experience in existing markets and experience with previous market entry. We find that experience in previous markets increased the probability that a firm would enter a new market. We show that this experience had greater value if the firm entered the new market. We infer that managers chose to enter these markets to obtain this increase in value.
Fault-tolerant platforms for automotive safety-critical applications
Authors: M. Baleani, A. Ferrari, L. Mangeruca, A. Sangiovanni-Vincentelli, Maurizio Peri, Saverio Pezzini
Venue: Proceedings of the 2003 international conference on Compilers, architecture and synthesis for embedded systems (2003)

Fault-tolerant electronic sub-systems are becoming a standard requirement in the automotive industrial sector as electronics becomes pervasive in present cars. We address the issue of fault tolerant chip architectures for automotive applications. We begin by reviewing fault-tolerant architectures commonly used in other industrial domains where fault-tolerant electronics has been a must for a number of years, e.g., the aircraft manufacturing industrial sector. We then proceed to investigate how these architecture could be implemented on a single chip and we compare them with a metric that combines traditional terms such as cost, performance and fault coverage with flexibility, i.e. the ability of adapting to changing requirements and capturing a wide range of applications, an emerging criterion for platform design. Finally, we describe in some details a cost effective dual lock-step platform that can be used as a single fail-operational unit or as two fail-silent channels trading fault-tolerance for performance.
On a Result of Lemke and Kleitman
Authors: Tristan Denley
Venue: Combinatorics, Probability and Computing (1997)

Lemke and Kleitman [2] showed that, given a positive integer d and d (necessarily non-distinct) divisors of d a1, &hellip;, ad there exists a subset Q &sube; {1, &hellip;, d} such that d = &sum;i&isin;Qai answering a conjecture of Erdo&Prime;s and Lemke. Here we extend this result, showing that, provided &sum;p&#x007C;d1&#x002F;p &le; 1 (where the sum is taken over all primes p), there is some collection from a1, &hellip;, ad which both sum to d and which can themselves be ordered so that each element divides its successor in the order. Furthermore, we shall show that the condition on the prime divisors is in some sense also necessary.
Numerical integration of a size-structured cell population model in an environment of changing substrate concentration
Authors: O. Angulo, J. C. López-Marcos
Venue: Proceedings of the international conference on Computational methods in sciences and engineering (2003)

We formulate a new numerical method based on integration along characteristics curves to solve a size-structured cell population model in an environment with an evolutionary resource concentration. Numerical simulations are also reported in order to show that the approximations converge to the solution of the continuous problem. Also, we show their fine behaviour to study the dynamics of the considered problem.