ppxscal/embedding_network huggingface dataset:
Mastering SIMULINK
Authors: James B. Dabney, Thomas L. Harman
Venue:  (2003)

:This book provides a comprehensive tutorial on the use of SIMULINK to model dynamical systems.Introducing the complete process of building and running SIMULINK models, this book also presents real-world applications of SIMULINK. Provides a brief tutorial on using block diagrams to represent dynamical systems and covers the mechanics of building SIMULINK models and discusses the use of SIMULINK to model continuous systems. It also covers a number of important modeling topics, including scalar linear systems; vector techniques; nonlinear systems; discretetime systems; and masked subsystems. It explains how to build hierarchical models using subsystems and discusses how to use SIMULINK's callback function capabilities to build custom graphical user interfaces and to create graphical animations. Covers SIMULINK analysis tools which allow users to run a SIMULINK model from within a MATLAB environment. Discusses building graphical animations using S-files or in the Animation Toolbox.
Exact Analysis of Exact Change
Authors: Pat Frankel
Venue: Proceedings of the Fifth Israel Symposium on the Theory of Computing Systems (ISTCS '97) (1997)

We consider the k-payment problem: given a total budget of N units, the problem is to represent this budget as a set of coins, so that any k exact payments of total value at most N can be made using k disjoint subsets of the coins. The goal is to minimize the number of coins for any given N and k, while allowing the actual payments to be made on-line, namely without the need to know all payment requests in advance. The problem is motivated by the electronic cash model, where each coin is a long bit sequence, and typical electronic wallets have only limited storage capacity. The k-payment problem has additional applications in other resource-sharing scenarios. Our results include a complete characterization of the k-payment problem as follows. First, we prove a necessary and sufficient condition for a given set of coins to solve the problem. Using this characterization, we prove that the number of coins in any solution to the k-payment problem is at least k H_{N/k}, where H_n denotes the nth element in the harmonic series. This condition can also be used to efficiently determine k (the maximal number of exact payments) which a given set of coins allows in the worst case. Secondly, we give an algorithm which produces, for any N and k, a solution with minimal number of coins. In the case that all denominations are available, the algorithm finds a coin allocation with at most (k+1)H_{N/(k+1)} coins. (Both upper and lower bounds are the best possible.) Finally, we show how to generalize the algorithm to the case where some of the denominations are not available. 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
Some Proofs of Transforms
Authors: Earlin D. Lutz
Venue:  (1989)

Three simple examples of data refinement-replacement of an abstract program fragment and its variables by a more concrete fragment and variables-are presented in the Polya transform notation. Correctness of each transformation is derived using the formulations of Prinz-Gries, Morris, and Chen/Udding, which are formally equivalent but require different proof strategies. This allows comparison of the three formulations based on ease of use. 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
The Application of Variational Inequalities to Complementarity Problems and Existence Theorems
Authors: Jorge J. More
Venue:  (1971)

If $F : C \rightarrow R^{n}$ is a continuous (nonlinear) mapping on a closed, convex subset $C$ of $R^{n}$, it is shown that very weak coercivity conditins on $F$ guarantee the existence of a solution $x^{*} in $C$ to the variational inequality $(x-x^{*}, Fx^{*}) \geq 0$ for each $x$ in $C$. By restricting the shape of $C$, it is shown that $x^{*}$ solves different problems, and in each case we are able to obtain new existence results. If $C$ is a cone $K$, the $x^{*}$ is a solution to the complementarity problem: Find an $x^{*}$ in $K$ such that $Fx^{*}$ belongs to the polar of $K$ and $(x^{*}, Fx^{*})=0$. In this case it is possible to generalize some of the feasibility results available in the linear theory and to give an iterative scheme for finding $x^{*}. If $C$ is similar to a simplex then $x^{*}$ turns out to be a solution of nonlinear inequalities in the preorder induced by a cone, while if $C$ or $K$ is $R^{n}$, then $Fx^{*} =0$.
Using Speculation to Reduce Server Load and Service Time on the WWW
Authors: Azer Bestavros
Venue:  (1995)

Abstract Speculative service implies that a client''s request for a document is serviced by sending, in addition to the document requested, a number of other documents that the server speculates will be requested by the client in the near future. This speculation is based on statistical information that the server maintains for each document it serves. The notion of speculative service is analogous to prefetching, which is used to improve cache performance in distributed/parallel shared memory systems, with the exception that servers (not clients) control when and what to prefetch. Using trace simulations based on the logs of our departmental HTTP server http://cs-www.bu.edu, we show that both server load and service time could be reduced considerably, if speculative service is used. This is above and beyond what is currently achievable using client-side caching and server-side dissemination. We identify a number of parameters that could be used to fine-tune the level of speculation performed by the server based on the level of lookahead, the state of the network, the tradeoffs between bulk and individual transmission of documents, and the relative popularity of documents, among other factors.
Megagate ASICs for the Thuraya Satellite Digital Signal Processor
Authors: David A. Sunderland, Gary L. Duncan, Brad J. Rasmussen, Harry E. Nichols, Daniel T. Kain, Brian A. Clebowicz
Venue: Proceedings of the 3rd International Symposium on Quality Electronic Design (2002)

Boeing Satellite Systems and IBM have designed and fabricated a set of ASIC chip types to perform computation-intensive digital signal processing (DSP) functions on board geosynchronous satellites of the Thuraya mobile communications system. Preparation for this application required comprehensive review of the reliability and space-worthiness of the underlying process and packaging technology. First-pass success on all nine million-plus-gate ASIC designs required extensive model-based simulation and verification. These technologies allowed a four-fold increase in the computational power of the DSP unit over previous systems based on radiation-hardened ASICs, while simultaneously decreasing the number of ASICs required by another factor of five. The first Thuraya satellite is on-orbit, and the whole communications system is performing flawlessly.
MCSE Self-Paced Training Kit (Exam 70-293): Planning and Maintaining a Microsoft Windows Server 2003 Network Infrastructure
Authors: Craig Zacker, Microsoft Corporation
Venue:  (2003)

Announcing an all-new MCSE TRAINING KIT designed to help maximize your performance on Exam 70-293, a core exam for the new Windows Server 2003 certification. This kit packs the tools and features exam candidates want most-including in-depth, self-paced training; rigorous, objective-by-objective review; exam tips from expert, exam-certified authors; and a robust testing suite. It also provides real-world scenarios, case studies, and troubleshooting labs for the skills and expertise you need on the job. Focusing on how to plan and implement a Windows Server 2003 network infrastructure, this official study guide covers topics such as server roles and security, infrastructure planning/design, routing and remote access, server availability, network security planning, and security infrastructure management. Ace your exam preparation and ramp up quickly on Windows Server 2003 by working at your own pace through the lessons, hands-on exercises, and practice tests. The Readiness Review Suite on CD, featuring advanced technology from MeasureUp, provides 425 challenging questions for in-depth self-assessment and practice. Choose timed or untimed testing mode, generate random tests, or focus on discrete objectives or chapters, and get detailed explanations for right and wrong answers-including pointers back to the book for further study. You also get a 180-day evaluation version of Windows Server 2003 software and a 15 percent exam discount voucher-making this kit an exceptional value and a great career investment.
Solving a Two-Dimensional Helmholtz Problem Using Algebraic Multigrid
Authors: Petr Vanek, Jan Mandel, Marian Brezina
Venue:  (1997)

An algebraic multigrid method with two levels is applied to the solution of the Helmholtz equation in a first order least squares formulation, discretized by Q1 finite elements with reduced integration. Smoothed plane waves in a fixed set of directions are used as the coarse level basis functions. The method is used to investigate numerically the sensitivity of the scattering problem to a change of the shape of the scatterer.
ON THE DAUBECHIES-BASED WAVELET DIFFERENTIATION MATRIX
Authors: Leland Jameson
Venue:  (1993)

The differentiation matrix for a Daubechies-based wavelet basis will be constructed and `superconvergence'' will be proven. That is, it will be proven that under the assumption of periodic boundary conditions that the differentiation matrix is accurate of order 2M, even though the approximation subspace can represent exactly only polynomials up to degree M-1, where M is the number of vanishing moments of the associated wavelet. It will be illustrated that Daubechies-based wavelet methods are equivalent to finite difference methods with grid refinement in regions of the domain where small-scale structure is present.
Graph Bipartition with Hereditary Properties
Authors: Zverovich I. E.
Venue:  (2000)

A hereditary class $P$ is called {\it finitely generated} if the set of all minimal forbidden induced subgraphs for $P$ is finite. For a pair of hereditary classes $P$ and $Q$, we define a hereditary class $P * Q$ of all graphs $G$ which have a partition $A \cup B = V(G)$ such that $G(A) \in P$ and $G(B) \in Q$ ($G(X)$ is the subgraph of $G$ induced by $X \subseteq V(G)$). We investigate the problem of recognizing finitely generated classes of the form $P * Q$. We use the following model. Let $H^0$ and $H^1$ be hypergraphs with the same vertex set $V$. The ordered pair $H = (H^0, H^1)$ is called a {\em bihypergraph}. A bihypergraph $H = (H^0, H^1)$ is called {\em bipartite} if there is an ordered partition $V^0 \cup V^1 = V(H)$ such that $V^i$ is stable in $H^i$, $i = 0, 1$. If the maximum cardinality of hyperedges in $H$ is at most $r$ and every $k$-subset of $V(H)$ contains at least one hyperedge then $H \in C(k, r)$. We prove that there exists a finite number of minimal non-bipartite bihypergraphs in $C(k, r)$ (when $k$ and $r$ are fixed). Let $P$ and $Q$ be hereditary classes of graphs. Suppose that the stability number $\alpha (H)$ is bounded above for all $H \in P$, and the clique number $\omega (H)$ is bounded above for all $H \in Q$. An ordered partition $A \cup B = V(G)$ is called a {\it ramseian $P * Q$-partition} if $G(A) \in P$ and $G(B) \in Q$. Let ${\rm Ramsey}(P * Q)$ be the set of all graphs which have a ramseian $P * Q$-partition. Generalizing a result of Gy\''arf\''as \cite{Gyarfas98}, we prove that if both $P$ and $Q$ are finitely generated then ${\rm Ramsey}(P * Q)$ is also finitely generated. In particular, every class of $(\alpha, \beta)$-polar graphs (which are generalizations of split graphs) has a finite forbidden induced subgraph characterization. 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
Rapidly Rotating Polytropes in General Relativity
Authors: Gregory B. Cook, Stuart L. Shapiro, Saul A. Teukolsky
Venue:  (1993)

We construct an extensive set of equilibrium sequences of rotating polytropes in general relativity. We determine a number of important physical parameters of such stars, including maximum mass and maximum spin rate. The stability of the configurations against quasi-radial perturbations is diagnosed. Two classes of evolutionary sequences of fixed rest mass and entropy are explored: normal sequences which behave very much like Newtonian evolutionary sequences, and supramassive sequences which exist solely because of relativistic effects. Dissipation leading to loss of angular momentum causes a star to evolve in a quasi-stationary fashion along an evolutionary sequence. Supramassive sequences evolve towards eventual catastrophic collapse to a black hole. Proir to collapse, the star must spin up as it loses angular momentum, an effect which may provide an observational precursor to gravitational collapse to a black hole. Keywords: pulsars, stars, neutron, rotation
Decoder-Based Multi-Context Interconnect Architecture
Authors: Andrea Lodi, Luca Ciccarelli, Andrea Cappelli, Fabio Campi, Mario Toma
Venue: Proceedings of the IEEE Computer Society Annual Symposium on VLSI (ISVLSI'03) (2003)

Multi-context FPGAs are a convenient solution for runtime reconfiguration, but they suffer from large area occupation. This is mainly due to programmable interconnect configuration memories which need to be replicated asmany times as the number of contexts. To overcome thislimitation a new decoder-based interconnect architecture isproposed. Dramatic improvements in terms of area and delay with respect to previous approaches are presented, suchthat multi-context FPGAs can finally become a viable solution for next generation configurable devices.
Safety Without Stuttering
Authors: Bowen Alpern, Alan J. Demers, Fred B. Schneider
Venue:  (1985)

A new formalization of safety properties is given. The formalization agrees with the informal definition that a safety property stipulates that some ``bad thing'''' doesn''t happen during execution for properties that are not invariant under stuttering, as well as for properties that are.
On the graphic matroid parity problem
Authors: Zoltán Szigeti
Venue: Journal of Combinatorial Theory Series B (2003)

A relatively simple proof is presented for the min-max theorem of Lovász on the graphic matroid parity problem.
Microwave Tomography of Lossy Objects from Monostatic Measurements
Authors: Emanuele Salerno
Venue:  (1998)

This paper addresses the problem of microwave tomographic imaging of dielectric objects. We first recall the Fourier relationship between Born approximation far-field scattering and the complex permittivity of a lossy scatterer illuminated by a plane-wave uniform radiation, and describe a monostatic multifrequency measurement system. We then propose a data preprocessing strategy, which permits a projected Landweber tomographic reconstruction scheme to be applied. It is assumed that the object under test has a finite extent, and its permittivity is not a function of the frequency of the probing radiation. The complex permittivity of a lossy object is always frequency dependent, but if our hypotheses are verified the proposed preprocessing can eliminate this dependence, thus making our multifrequency measurements suitable for simultaneous exploitation. Finally, we outline the reconstruction technique and show the results of some simulated experiments. We also show that the Landweber method can be applied to measurements on lossy as well as lossless materials, except for cases of limited-angle data, where in the lossy case more restrictive conditions are to be met. TEL:: +39 050 593518 EMAIL:: salerno@iei.pi.nr.it
A necessary and sufficient condition for the existence of a path factor every component of which is a path of length at least two
Authors: Atsushi Kaneko
Venue: Journal of Combinatorial Theory Series B (2003)

A P≥3-factor F of a graph G is a spanning subgraph of G such that every component of F is a path of length at least two. Let R be a factor-critical graph with at least three vertices, that is, for each x ∈ V(R), R - x has a 1-factor (i.e., a perfect matching). Set V(R) = {x1, ...,xn}. Add new vertices {v1, ..., vn} to R together with the edges xivi, 1 ≤ i ≤ n. The resulting graph H is called a sun. (Note that degH vi = 1 for all i, 1≤i≤n.) K1 and K2, i.e., the complete graphs with one and two vertices, respectively, are also called suns. Then let C be the set of all suns. A sun component of a graph is a component which belongs to C. Let cs(G) denote the number of sun components of G. We prove that a graph G has a P≥3-factor if and only if cs(G - S)≤2|S|, for every subset S of V(G).
Reasoning and Experimenting within Zadeh''s Fuzzy Propositional Logic
Authors: Umberto Straccia
Venue:  (2000)

We present several decision algorithms within the fuzzy propositional logic based on Zadeh''s implication operator $p\rightarrow q =\max\{1-p, q\}$, deciding both the fuzzy SAT problem as well as the best truth value bound problem, \ie\ compute the best truth value bounds of a proposition with respect to a theory. Further, we evaluate all the algorithms by adapting and extending the well know methods for evaluating SAT decision algorithms. We show that both problems present the typical easy-hard-easy pattern.
Providing architectural support for expert systems
Authors: Peter C. J. Graham
Venue: ACM SIGARCH Computer Architecture News (1984)

Many current expert systems are constructed in a rule based fashion. That is, using a series of rules or productions which implement the reasoning logic of the system. While such an approach is well suited to the task of building expert systems, it is not well suited to their implementation via conventional Von-Neumann architectures.What is required is an architecture which is more appropriate for evaluating and executing rules. Such a machine requires the ability to perform many small, heterogenous operations in parallel. A dataflow machine provides just such an ability and there is a natural mapping which may be exploited from rules to a series of dataflow templates.
Deceit: A Flexible Distributed File System
Authors: Alexander Siegel, Kenneth P. Birman, Keith Marzullo
Venue:  (1989)

Deceit, a distributed file system being developed at Cornell, focuses on flexible file semantics in relation to efficiency, scalability, and reliability. Deceit servers are interchangeable and collectively provide the illusion of a single, large server machine to any clients of the Deceit service. Non-volatile replicas of each file are stored on a subset of the file servers. The user is able to set parameters on a file to achieve different levels of availability, performance, and one-copy serializability. Deceit also supports a file version control mechanism. In contrast with many recent DFS efforts, Deceit can behave like a plain Sun Network File System server and can be used by any NFS client without modifying any client software. The current Deceit prototype uses the ISIS Distributed Programming Environment for all communication and process group management, an approach that reduces system complexity and increases system robustness.
A Generic Approach to the Formal Specification of Requirements
Authors: Christian Peper, Reinhard Gotzhein, Martin Kronenburg
Venue: Proceedings of the 1st International Conference on Formal Engineering Methods (1997)

A generic approach to the formal specification of system requirements is presented. It is based on a pool of requirement patterns, which are related to design patterns well-known in object-oriented software development. The application of such patterns enhances the reusability and genericity as well as the intelligibility of the formal requirement specification. The approach is instantiated by a tailored real-time temporal logic and by selecting building automation systems as application domain. With respect to this domain, the pattern discovery and reuse tasks are explained and illustrated, and a set of typical requirement patterns is presented. The approach has the potential of reducing the effort to formally specify system requirements.
Exploiting Multiple Levels of Parallelism in OpenMP: A Case Study
Authors: Eduard Ayguade, Xavier Martorell, Jesus Labarta, Marc Gonzalez, Nacho Navarro
Venue: Proceedings of the 1999 International Conference on Parallel Processing (1999)

Most current shared-memory parallel programming environments are based on thread packages that allow the exploitation of a single level of parallelism. These thread packages do not enable the spawning of new parallelism from a previously activated parallel region. Current initiatives (like OpenMP) include in their definition the exploitation of multiple levels of parallelism through the nesting of parallel constructs.This paper analyzes the requirements towards an efficient multi-level parallelization and reports some conclusions gathered from the experience in the parallelization of two benchmark applications. The underlying system is based on: i) an OpenMP compiler which accepts some extensions to the original definition and ii) a user-level threads library that supports the exploitation of both fine-grain and multi-level parallelism.
Numerical Solution of Hamilton-Jacobi-Bellman Equations by an Upwind Finite Volume Method
Authors: S. Wang, L. S. Jennings, K. L. Teo
Venue: Journal of Global Optimization (2003)

In this paper we present a finite volume method for solving Hamilton-Jacobi-Bellman(HJB) equations governing a class of optimal feedback control problems. This method is based on a finite volume discretization in state space coupled with an upwind finite difference technique, and on an implicit backward Euler finite differencing in time, which is absolutely stable. It is shown that the system matrix of the resulting discrete equation is an M-matrix. To show the effectiveness of this approach, numerical experiments on test problems with up to three states and two control variables were performed. The numerical results show that the method yields accurate approximate solutions to both the control and the state variables.
Vision-Based Pose Computation: Robust and Accurate Augmented Reality Tracking
Authors: Jun Park, Bolan Jiang, Ulrich Neumann
Venue: Proceedings of the 2nd IEEE and ACM International Workshop on Augmented Reality (1999)

Vision-based tracking systems have advantages for augmented reality (AR) applications. Their registration can be very accurate, and there is no delay between the motions of real and virtual scene elements. However, vision-based tracking often suffers from limited range, intermittent errors, and dropouts. These shortcomings are due to the need to see multiple calibrated features or fiducials in each frame. To address these shortcomings, features in the scene can be dynamically calibrated and pose calculations can be made robust to noise and numerical instability. In this paper, we survey classic vision-based pose computations and present two methods that offer increased robustness and accuracy in the context of real-time AR tracking.