ppxscal/embedding_network huggingface dataset:
Input Window Size and Neural Network Predictors
Authors: R. J. Frank, N. Davey, S. P. Hunt
Venue: Proceedings of the IEEE-INNS-ENNS International Joint Conference on Neural Networks (IJCNN'00)-Volume 2 - Volume 2 (2000)

Neural Network approaches to time series prediction are briefly discussed, and the need to specify an appropriately sized input window identified. Relevant theoretical results from dynamic systems theory are briefly introduced, and heuristics for finding the correct embedding dimension, and thence window size, are discussed. The method is applied to two time series and the resulting generalization performance of the trained feed-forward neural network predictors is analyzed. It is shown that the heuristics can provide useful information in defining the appropriate network architecture.
Computing the Cholesky Factorization Using a Systolic Architecture
Authors: Richard P. Brent, Franklin T. Luk
Venue:  (1982)

This note concerns the computation of the Cholesky factorization of a symmetric and positive definite matrix on a systolic array. We use the special properties of the matrix to simplify the algorithm and the corresponding architecture given by Kung and Leiserson.
New Self-Checking Circuits by Use of Berger-Codes
Authors: A. Morozov, V. V. Saposhnikov, Vl. V. Saposhnikov, M. Gössel
Venue: Proceedings of the 6th IEEE International On-Line Testing Workshop (IOLTW) (2000)

In this paper, a new approach for concurrent checking by Berger codes is proposed. We modify a subset of outputs of the original circuit by adding modulo 2 the outputs of a complementary circuit. In the error free case, the unmodified outputs together with their corresponding modified outputs are elements of a Berger code. The number of outputs of the original circuit does not increase. Compared to the traditional method of concurrent checking by Berger codes, a smaller checker is needed.
Partial Plan Recognition with Incomplete Information
Authors: Jung-Jin Lee, Robert McCartney
Venue: Proceedings of the 3rd International Conference on Multi Agent Systems (1998)

This work explores the benefits of using user models for plan recognition problems in a real-world application. Self-interested agents are designed for the prediction of resource usage in the UNIX domain using a stochastic approach to automatically acquire regularities of user behavior. Both sequential information from the command sequence and relational information such as system's responses and arguments to the commands are considered to typify a user's behavior and intentions. Issues of ambiguity, distraction and interleaved execution of user behavior are examined and taken into account to improve the probability estimation in hidden Markov models.
Architectural bias in recurrent neural networks: fractal analysis
Authors: Peter Tiňo, Barbara Hammer
Venue: Neural Computation (2003)

We have recently shown that when initialized with "small" weights, recurrent neural networks (RNNs) with standard sigmoid-type activation functions are inherently biased toward Markov models; even prior to any training, RNN dynamics can be readily used to extract finite memory machines (Hammer & Tino, 2002; Tino, Cernanský, & Benusková, 2002a, 2002b). Following Christiansen and Chater (1999), we refer to this phenomenon as the architectural bias of RNNs. In this article, we extend our work on the architectural bias in RNNs by performing a rigorous fractal analysis of recurrent activation patterns. We assume the network is driven by sequences obtained by traversing an underlying finite-state transition diagram--a scenario that has been frequently considered in the past, for example, when studying RNN-based learning and implementation of regular grammars and finite-state transducers. We obtain lower and upper bounds on various types of fractal dimensions, such as box counting and Hausdorff dimensions. It turns out that not only can the recurrent activations inside RNNs with small initial weights be explored to build Markovian predictive models, but also the activations form fractal clusters, the dimension of which can be bounded by the scaled entropy of the underlying driving source. The scaling factors are fixed and are given by the RNN parameters.
Representations of Graphs on a Cylinder
Authors: Roberto Tamassia, Ioannis G. Tollis
Venue:  (1989)

We present a complete characterization of the class of graphs that admit a {\em cylindric visibility representation}, where vertices are represented by intervals parallel to the axis of the cylinder and the edges correspond to visible intervals. Moreover, we give linear-time algorithms for testing the existence of and constructing such a representation. Important applications of cylindric visibility representations can be found in the layout of regular VLSI circuits, such as linear systolic arrays and bit-slice architectures. Also, we present alternative ``dual'''' characterizations of the graphs that admit visibility representations in the plane and in the cylinder. It is interesting to observe that neither of these two classes is contained in the other, although they have a nonempty intersection.
Performance analysis of mean internodal distance of connective semi-random networks
Authors: S. Shiokawa, I. Sasase
Venue: Proceedings of the Fourteenth Annual Joint Conference of the IEEE Computer and Communication Societies (Vol. 1)-Volume - Volume 1 (1995)

One of important properties of a multihop network is the mean internodal distance for evaluating transmission delay. The connective semi-random network achieves a smaller mean internodal distance than other networks. However, the results have only been obtained by computer simulation and no theoretical analysis has been performed. In this paper, we theoretically analyze the mean internodal distance of a connective semi-random network. Moreover, we also theoretically analyze a restricted connective semi-random network whose network connective probability is larger than that of a conventional connective semi-random network. It is shown that the theoretical analyzed results agree well with the simulated results in a conventional model and our model with small restriction. The influence of restriction on the mean internodal distance becomes small as the number of outgoing links per node becomes large.
PS2 Secret Codes 2003
Authors: G. Bart
Venue:  (2002)

:BradyGames' PS2 Secret Codes 2003 reveals all the essential codes, cheats, hidden menus, and more for the hottest PS2 games on the market. Some of the games covered in this guide are Tony Hawk's Pro Skater 4, Mat Hoffman's Pro BMX 2, The Mark of Kri, Grand Theft Auto: Vice City, and other hot PS2 titles! Gamers thrive on codes and cheats that help them uncover extra lives, hidden menus, invincibility, and all-new gameplay modes. There are hundreds of games covered and hundreds of codes revealed in this handy pocket guide. 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
Exploiting query history for document ranking in interactive information retrieval
Authors: Xuehua Shen, Cheng Xiang Zhai
Venue: Proceedings of the 26th annual international ACM SIGIR conference on Research and development in informaion retrieval (2003)

In this poster,we incorporate user query history, as context information, to improve the retrieval performance in interactive retrieval. Experiments using the TREC data show that incorporating such context information indeed consistently improves the retrieval performance in both average precision and precision at 20 documents.
Functional safety of a theatre stage machinery control system
Authors: Michael J. Bauer
Venue: Proceedings of the seventh Australian workshop conference on Safety critical systems and software 2002 - Volume 15 (2003)

Computer technology has the potential to significantly reduce the risks associated with scenery motion in live theatre, as well as enhancing the spectacle of performance. The industry is becoming more concerned about safety standards compliance. IEC 61508 is emerging as the universally favoured standard for functional safety of stage machinery control systems.
Flexible Exception Handling in the OPERA Process Support System
Authors: Claus Hagen, Gustavo Alonso
Venue: Proceedings of the The 18th International Conference on Distributed Computing Systems (1998)

Exceptions are one of the most pervasive problems in process support systems. In installations expected to handle a large number of processes, having exceptions is bound to be a normal occurrence. Any programming tool intended for large, complex applications has to face this problem. However, current process support systems, despite their orientation towards complex, distributed, and heterogeneous applications, provide almost no support for exception handling. This paper shows how flexible mechanisms for failure handling are incorporated into the OPERA process support system using a combination of programming language concepts and transaction processing techniques. The resulting mechanisms allow the construction of fault-tolerant workflow processes in a transparent and flexible way while ensuring reusability of workflow components.
Engineering a customizable intermediate representation
Authors: K. Palacz, J. Baker, C. Flack, C. Grothoff, H. Yamauchi, J. Vitek
Venue: Proceedings of the 2003 workshop on Interpreters, virtual machines and emulators (2003)

The Ovm framework is a set of tools and components for building language runtimes. We present the intermediate representation and software design patterns used throughout the framework. One of the main themes in this work has been to support experimentation with new linguistic constructs and implementation techniques. To this end, framework components were designed to be parametric with respect to the instruction set on which they operate. We argue that our approach eases the task of writing new components without sacrificing efficiency.
Time-dependent and materially non-linear analysis of concrete structures
Authors: J. Pencik
Venue: Proceedings of the sixth conference on Computational structures technology (2002)

Today it is possible to use for structures analyses lots of computational systems based on the Finite Elements Method. These systems mostly included finite elements, which can be used for materially non-linear analyses of steel structures. For analysis of composite structures are being developed special finite elements. The article describes special finite elements for analysis of composite structures with respect to material non-linearity. Further is described the plane beam finite element derivation including the induction of material models that can be used for analysis.
Emergent properties of referral systems
Authors: Pinar Yolum, Munindar P. Singh
Venue: Proceedings of the second international joint conference on Autonomous agents and multiagent systems (2003)

Agents must decide with whom to interact, which is nontrivial when no central directories are available. A classical decentralized approach is referral systems, where agents adaptively give referrals to one another. We study the emergent properties of referral systems, especially those dealing with their quality, efficiency, and structure. Our key findings are (1) pathological graph structures can emerge due to some neighbor selection policies and (2) if these are avoided, quality and efficiency depend on referral policies. Further, authorities emerge automatically and the extent of their relative authoritativeness depends on the policies.
Model Fermion Monte Carlo with Correlated Pairs
Authors: Malvin H. Kalos
Venue:  (1995)

The issues that prevent the development of efficient and stable algorithms for fermion Monte Carlo in continuum systems are reexamined with special reference to the implications of the "plus/minus" symmetry. This is a property of many algorithms that use signed walkers, namely that the dynamics are unchanged when the signs of the walkers are interchanged. Algorithms that obey this symmetry cannot exhibit the necessary stability. Specifically, estimates of the overlap with any antisymmetric test function cannot be bounded away from zero in the limit of many iterations. Within the framework of a diffusion Monte Carlo treatment of the Schroedinger equation, it is shown that this symmetry is easily broken for pairs of walkers while at the same time preserving the correct marginal dynamics for each member of the pair. The key is to create different classes of correlations between members of pairs and to use (at least) two distinct correlations for a pair and for the same pair with the signs exchanged. The ideas are applied successfully for a class of simple model problems in two dimensions.
A Real Time Decision Support System for Monitoring and Management of a Complex Object Using Parallel Processing
Authors: Alexander P. Eremeyev, Vadim N. Vagin
Venue: Proceedings of the 2002 IEEE International Conference on Artificial Intelligence Systems (ICAIS'02) (2002)

This paper describes designing the dynamic decision support systems (DDSS) of a semiotic type. DDSS of such type is oriented towards open and dynamic problem domains and it is defined by the set of various models. The example of a DDSS prototype for monitoring andmanagement of a nuclear power block, implemented on the basis of the tools G2+GDA using parallel processing, is given. This work was supported by the Russian Fund of Fundamental Researches (project 02-07-90042).
Modelling of nonlinear behaviour of masonry structures: phenomenological approach
Authors: J. B. Colliat, L. Davenne, A. Ibrahimbegović
Venue: Proceedings of the sixth conference on Computational structures technology (2002)

This paper deals with modeling of mechanical behavior of masonry walls submitted to in-plane loading. The adopted strategy consists of modelling separately the appropriate local failure mechanisms of brick units and mortar joints. A particular attention is dedicated to brick crushing mechanisms which were captured with strong displacement discontinuities within the framework of incompatible mode method. A perfect plasticity model including dilatancy has been employed for the joints modeling. This model has been compared with two experimental results. We show that we are able to well reproduce the global behavior of such structure (stiffness and peak load) and thus construct reliable predictive model of the masonry walls by using only the experimental characteristics of their components.
A theoretical model for optimization of rolling schedule procedure parameters in ERP systems
Authors: Xue Bai, Qidong Cao, Steve Davis
Venue: The Korean Journal of Computational Applied Mathematics (2003)

The rolling schedule procedure has been an important part of the Enterprise Resource Planning (ERP) systems. The performance of production planning in an ERP system depends on the selection of the three parameters in rolling schedule procedure: frozen interval, replanning interval, and planning horizon (forecast window). This research investigated, in a theoretical approach, the combined impact of selections of those three parameters. The proven mathematical theorems provided guidance to reduction of instability (nervousness) and to seek the optimal balance between stability and responsiveness of ERP systems, Further the theorems are extended to incorporate the cost structure.
A Z-based Approach to Specifying and Analyzing Complex Systems
Authors: J.-M. Bruel, R. France, A. Benzekri
Venue: Proceedings of the 2nd IEEE International Conference on Engineering of Complex Computer Systems (1996)

The difficult task of developing safety-critical systems requires the use of methods and tools that allow developers to manage inherent complexity and to meticulously specify, implement, and analyze desired behavior. Development environments based on formal specification techniques supported by CASE tools can facilitate quality development of such systems. In this paper we present our proposed environment for the development of high-assurance systems. The environment provides CASE support for developing and analyzing graphical and formal representations of system structure and behavior. We illustrate the use of the environment with a traffic control system.
On the Complexity of Quantum ACC
Authors: Frederic Green, Steven Homer, Christopher Pollett
Venue:  (2000)

Abstract For any q < 1, let MOD_q be a quantum gate that determines if the number of 1''s in the input is divisible by q. We show that for any q,t < 1, MOD_q is equivalent to MOD_t (up to constant depth). Based on the case q=2, Moore has shown that quantum analogs of AC^(0), ACC[q], and ACC, denoted QAC^(0)_wf, QACC[2], QACC respectively, define the same class of operators, leaving q < 2 as an open question. Our result resolves this question, implying that QAC^(0)_wf = QACC[q] = QACC for all q. We also prove the first upper bounds for QACC in terms of related language classes. We define classes of languages EQACC, NQACC (both for arbitrary complex amplitudes) and BQACC (for rational number amplitudes) and show that they are all contained in TC^(0). To do this, we show that a TC^(0) circuit can keep track of the amplitudes of the state resulting from the application of a QACC operator using a constant width polynomial size tensor sum. In order to accomplish this, we also show that TC^(0) can perform iterated addition and multiplication in certain field extensions.
Multipacket Routing on Rings
Authors: Fillia Makedon, Adononios Simvonis
Venue:  (1991)

We study multipacket routing problems. We divide the multipacket routing problem into two classes, namely, distance limited and bisection limited routing problems. Then, we concentrate on rings of processors. Having a full understanding of the multipacket routing problem on rings is essential before trying to attack the problem for the more general case of r-dimensional meshes and tori. We prove a new lower bound of 2n/3 routing steps for the case of distance limited routing problems. We also give an algorithm that tightens this lower bound. For bisection limited problems, we present an algorithm that completes the routing in near optimal time.
50 Fast Final Cut Pro 3 Techniques
Authors: Tim Meehan
Venue:  (2003)

:If you dream of producing great video, great effects, and great fun with your Macintosh and your camcorder, Tim Meehan wrote this book for you. Along with the basics about batch capturing and color correction, he'll show you ways to spice up your videos with atmospheric effects, super-fast motion, or 50-foot house pets. Whether you're a creative professional or amateur videographer, you'll learn new tricks and have fun doing 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
An analysis and application of distributed constraint satisfaction and optimization algorithms in sensor networks
Authors: Weixiong Zhang, Zhao Xing, Guandong Wang, Lars Wittenburg
Venue: Proceedings of the second international joint conference on Autonomous agents and multiagent systems (2003)

This research is motivated by a distributed scheduling problem in distributed sensor networks, in which computational resources are scarce. To cope with limited computational resources and restricted real-time requirement, it is imperative to apply distributed algorithms that have low overhead on resource requirement and high anytime performance. In this paper, We study distributed stochastic algorithm (DSA) and distributed breakout algorithm (DBA), two distributed algorithms developed earlier for distributed constraint satisfaction problems. We experimentally investigate their properties and compare their performance using our distributed scheduling problem as a benchmark. We first formulate the scheduling problem as a distributed multi-coloring problem. We then experimentally show that the solution quality and communication cost of DSA exhibit phase-transition or threshold behavior, in that the performance degenerates abruptly and dramatically when the degree of parallel executions of distributed agents increases beyond some critical value. The results show that when controlled properly, DSA is superior to DBA, having better or competitive solution quality and significantly smaller communication cost than DBA. Therefore, DSA is the algorithm of choice for our distributed scan scheduling problem.
A Comparison of Approaches to Reuse Investment Analysis
Authors: John Favaro
Venue: Proceedings of the 4th International Conference on Software Reuse (1996)

Reuse economics has been the subject of vigorous study over the past several years. Although significant progress has been made in the areas of reuse metrics and cost estimation, much work to date in reuse investment analysis has not always reflected accepted mainstream financial analysis practices. This paper compares several approaches that have been described in the reuse literature, points out known problems and indicates remedies.
Direct Dynamics Simulations
Authors: William L. Hase, Kihyung Song, Mark S. Gordon
Venue: Computing in Science and Engineering (2003)

With today's improved computers, scientists can obtain the potential energy gradient for a classical trajectory by solving the time-independent Schrödinger equation at each numerical integration step. The practicality of this approach—called a direct dynamics simulation is enhanced by its use of linear scaling and semiempirical electronic structure methods.
'Bad Practice' or 'Bad Methods' " Are Software Engineering and Ethnographic Discourses Incompatible?
Authors: Kari Rönkkö, Olle Lindeberg, Yvonne Dittrich
Venue: Proceedings of the 2002 International Symposium on Empirical Software Engineering (2002)

Organizational problems in industry have evoked increased interest in empirical methodologies in the broader software engineering community. In this article ethnography and its relation to software engineering is addressed. Until now sociologists have performed the majority of ethnographic studies on software development. But how useful are these studies for software engineering? Ethnography emphasizes the members' point of view in order to understand the social. Studies from the members' perspective can be interpreted, as revealing bad methods' that do not work in complex work situations. From a software engineering point of view, theyjust as easy point to the opposite as bad practice', bad application of existing methods. The objective of this paper is to promote ethnography and its contribution to software engineering by revealing the different research attitudes of ethnographers and software engineers. Possibilities how to combine ethnographic studies with software method improvement are indicated.
Necessary and Sufficient Conditions of Existence of Extreme Distributions F5 &ndash; F7 in the Generalized Chebyshev Inequalities Problem. Part II
Authors: L. S. Stoikova
Venue: Cybernetics and Systems Analysis (2003)

The optimization problem for a linear functional on the set of distribution functions with two fixed power moments is considered. New criteria are proposed for the existence of the extreme distributions, on which a linear functional may take on the extremum value.