ppxscal/embedding_network huggingface dataset:
Secure Execution of Java Applets Using a Remote Playground
Authors: Dahlia Malkhi, Michael K. Reiter
Venue: IEEE Transactions on Software Engineering (2000)

Mobile code presents a number of threats to machines that execute it. We introduce an approach for protecting machines and the resources they hold from mobile code and describe a system based on our approach for protecting host machines from Java 1.1 applets. In our approach, each Java applet downloaded to the protected domain is rerouted to a dedicated machine (or set of machines), the playground, at which it is executed. Prior to execution, the applet is transformed to use the downloading user's web browser as a graphics terminal for its input and output and so the user has the illusion that the applet is running on her own machine. In reality, however, mobile code runs only in the sanitized environment of the playground, where user files cannot be mounted and from which only limited network connections are accepted by machines in the protected domain. Our playground thus provides a second level of defense against mobile code that circumvents language-based defenses. The paper presents the design and implementation of a playground for Java 1.1 applets and discusses extensions of it for other forms of mobile code, including Java 1.2.
Respiratory system inertance: investigation in a physical inertance model
Authors: Volker Kessler, José Ramirez, Günther Braun, Georg Mols, Josef Guttmann
Venue: Technology and Health Care (2000)

For analysis of respiratory system mechanics the very complex structure of the respiratory system is strongly simplified to a simple resistance-compliance-model. While for most patients this simplification seems sufficient, in patients with pulmonary disease this model is inappropriate. Additionally, to regional inhomogeneity throughout the lung, large volume accelerations due to the strongly decreased respiratory system compliance together with a mass increase of the patients lungs, i.e. an increased respiratory system inertance I_{\mathrm{rs}}, result in a significant inertive pressure contribution. The aim of this study was to develop a physical inertance model, and its description by conventional methods of respiratory monitoring. Its parameters are adjustable within the physiological range, with I_{\mathrm{rs}} between 0.06 and 0.2 mbar&middot;s^{2}&middot;l^{-1}. The model proved well with static and dynamic analysis of respiratory system parameters. Using our physical model it is possible to evaluate new methods of respiratory monitoring and to investigate experimentally the interrelationship of respiratory system parameters.
Design Theory and Performance of 1-GHz CMOS Downconversion and Upconversion Mixers
Authors: Kwok-Kei Kan, Dongsheng Ma, Kin-Chung Mak, Howard C. Luong
Venue: Analog Integrated Circuits and Signal Processing (2000)

A CMOS mixer topology capable of both downconversion and upconversion mixing for use in integrated wireless transceivers is presented. The mixing is based on two cross-coupled differential pairs as commutators with two source-followers as current modulators. Independence of the input and output bandwidths allows this topology to be optimized separately for either downconversion or upconversion mixer. The prototypes of both upconversion and downconversion mixers, optimized for linearity and realized in 0.8 &mu;m CMOS technology, have been demonstrated to fully operate at 1 GHz with good linearity and low power consumption. In addition, another mixer, optimized for noise figure and realized in 0.5 &mu;m CMOS technology, has been designed to achieve a NF of around 12 dB.
A language extension for graph processing and its formal semantics
Authors: Terrence W. Pratt, Daniel P. Friedman
Venue: Communications of the ACM (1971)

A simple programming language &ldquo;extension,&rdquo; Graspe, for processing directed graphs is defined. Graspe consists of a type of directed graph data structure and a set of primitive operations for manipulating these structures. Graspe may be most easily implemented by embedding it in a host language. Emphasis is placed both on Graspe itself and on its method of definition. Commonly, the definition of a language involves definition of the syntactic elements and explanation of the meaning to be assigned them (the semantics). The definition of Graspe here is solely in terms of its semantics; that is, the data structures and operations are defined precisely but without assignment of a particular syntactic representation. Only when the language is implemented is assignment of an explicit syntax necessary. An example of an implementation of Graspe embedded in Lisp is given as an illustration. The advantages and disadvantages of the definition of a language in terms of its semantics are discussed.
Algorithm 811: NDA: algorithms for nondifferentiable optimization
Authors: Ladislav Lukšan, Jan Vlček
Venue: ACM Transactions on Mathematical Software (TOMS) (2001)

We present four basic Fortran subroutines for nondifferentiable optimization with simple bounds and general linear constraints. Subroutine PMIN, intended for minimax optimization, is based on a sequential quadratic programming variable metric algorithm. Subroutines PBUN and PNEW, intended for general nonsmooth problems, are based on bundle-type methods. Subroutine PVAR is based on special nonsmooth variable metric methods. Besides the description of methods and codes, we propose computational experiments which demonstrate the efficiency of this approach.
Multiobjective query optimization
Authors: Christos H. Papadimitriou, Mihalis Yannakakis
Venue: Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems (2001)

The optimization of queries in distributed database systems is known to be subject to delicate trade-offs. For example, the Mariposa database system allows users to specify a desired delay-cost tradeoff (that is, to supply a decreasing function u(d), specifying how much the user is willing to pay in order to receive the query results within time d); Mariposa divides a query graph into horizontal &ldquo;strides,&rdquo; analyzes each stride, and uses a greedy heuristic to find the &ldquo;best&rdquo; plan for all strides. We show that Mariposa's greedy heuristic can be arbitrarily far from the desired optimum. Applying a recent approach in multiobjective optimization algorithms to this problem, we show that the optimum cost-delay trade-off (Pareto) curve in Mariposa's framework can be approximated fast within any desired accuracy. We also present a polynomial algorithm for the general multiobjective query optimization problem, which approximates arbirarily well the optimum cost-delay tradeoff (without the restriction of Mariposa's heuristic stride subdivision).
Specialists preparation on computer directions at the Kharkov State Technical University of Radioelectronics (abstract only)
Authors: Michael Bondarenko, Gennady Krivouila
Venue: Proceedings of the symposium on Contemporary computing in Ukraine (2000)

The problems of multilevel preparation of the specialists on computer directions and organizations of such preparation at the Kharkov technical university were considered. The list of the specialities and specializations of computer directions, feature of subjects activity formation and concept of the specialists preparation on the information protection was described.
Simplicial Properties of the Set of Planar Binary Trees
Authors: Alessandra Frabetti
Venue: Journal of Algebraic Combinatorics: An International Journal (2001)

Planar binary trees appear as the the main ingredient of a new homology theory related to dialgebras, cf.(J.-L. Loday, i>C.R. Acad. Sci. Paris 321 (1995), 141&ndash;146.) Here I investigate the simplicial properties of the set of these trees, which are independent of the dialgebra context though they are reflected in the dialgebra homology.The set of planar binary trees is endowed with a natural (almost) simplicial structure which gives rise to a chain complex. The main new idea consists in decomposing the set of trees into classes, by exploiting the orientation of their leaves. (This trick has subsequently found an application in quantum electrodynamics, c.f. (C. Brouder, &ldquo;On the Trees of Quantum Fields,&rdquo; Eur. Phys. J. C12, 535&ndash;549 (2000).) This decomposition yields a chain bicomplex whose total chain complex is that of binary trees. The main theorem of the paper concerns a further decomposition of this bicomplex. Each vertical complex is the direct sum of subcomplexes which are in bijection with the planar binary trees. This decomposition is used in the computation of dialgebra homology as a derived functor, cf. (A. Frabetti, &ldquo;Dialgebra (co) Homology with Coefficients,&rdquo; Springer L.N.M., to appear).
An interference matching technique for inducing abstractions
Authors: Frederick Hayes-Roth, John McDermott
Venue: Communications of the ACM (1978)

A method for inducing knowledge by abstraction from a sequence of training examples is described. The proposed method, interference matching, induces abstractions by finding relational properties common to two or more exemplars. Three tasks solved by a program that uses an interference-matching algorithm are presented. Several problems concerning the description of the training examples and the adequacy of interference matching are discussed, and directions for future research are considered.
Confidence Interval Estimation for Inequality Indices of the GiniFamily
Authors: Paola Palmitesta, Corrado Provasi, Cosimo Spera
Venue: Computational Economics (2000)

In this paper we present some nonparametric bootstrap methods to construct distribution-free confidence intervals for inequality indices belonging to the Gini family. These methods have a coverage accuracy better than that obtained with the asymptotic distribution of their natural estimators, typically the standard normal. The coverage performances of these methods are evaluated for the index R by Gini with a Monte Carlo experiment on samples simulated from the Dagum income model (Type I), which is usually used to describe the income distribution.
The information environments program - a new design based IT degree
Authors: Michael Docherty, Peter Sutton, Margot Brereton, Simon Kaplan, Allison Brown
Venue: Proceedings of the Australasian conference on Computing education (2000)

The University of Queensland has recently established a new design-focused, studio-based IT degree at a new &ldquo;flexible-learning&rdquo; campus. The Bachelor of Information Environments degree integrates the core subjects of the Bachelor of Information Technology degree along with a stream of design-based subjects covering Visual Thinking, Human Computer Interaction, Interactive Multimedia and Interaction Design. The core of the degree is the studio-stream, modelled on the architectural studio, in which students undertake open-ended design projects every semester. Studio-based learning immerses the students in the learning experience and involves teamwork, collaborative learning, interactive problem solving, presentations, and peer review. The studio projects also require the students to apply knowledge and skills gained in other subjects in new contexts, hence integrating and reinforcing previous learning. This paper describes the degree program, its curriculum and rationale, and reports on experiences in the first year of delivery.
Optimal Information Gathering on the Internet with Time and Cost Constraints
Authors: Oren Etzioni, Steve Hanks, Tao Jiang, Omid Madani
Venue: SIAM Journal on Computing (2000)

The World Wide Web provides access to vast amounts of information, but content providers are considering charging for the information and services they supply. Thus the consumer may face the problem of balancing the benefit of asking for information against the cost (in terms of both money and time) of acquiring it. We study information-gathering strategies that maximize the expected value to the consumer. In our model there is a single information request, which has a known benefit to the consumer. To satisfy the request, queries can be sent simultaneously or in sequence to any of a finite set of independent information sources. For each source we know the monetary cost of making the query, the amount of time it will take, and the probability that the source will be able to provide the requested information. A policy specifies which sources to contact at which times, and the expected value of the policy can be defined as some function of the likelihood that the policy will yield an answer, the expected benefit, and the monetary cost and time delay associated with executing the policy. The problem is to find an expected-value-maximizing policy.We explore four variants of the objective function V: (i) V consists only of the benefit term subject to threshold constraints on both total cost and total elapsed time, (ii) V is linear in the expected total cost of the policy subject to the constraint that the total elapsed time never exceeds some deadline, (iii) V is linear in the expected total elapsed time subject to the constraint that the total cost never exceeds some threshold, and (iv) V is linear in the expected total monetary cost and the expected time delay of the policy. The problems of devising an optimal querying policy for all four variants and approximating an optimal querying policy for variants (iii) and (iv) are shown to be NP-hard. For (i), and with a mild simplifying assumption for (iii), we give a fully polynomial time approximation scheme. For (ii), we consider batched querying policies, and design an O(n2) time approximation algorithm with ratio $\frac{1}{2}$ and a polynomial time approximation scheme for optimal single-batch policies, and an O(kn2) time approximation algorithm with ratio $\frac{1}{5}$ for optimal k-batch policies.
Availability, accessibility and use of information technologies in Nigerian federal agencies: a preliminary survey
Authors: M. A. Tiamiyu
Venue: Information Technology for Development (2000)

This paper assesses the availability, accessibility and use of information technology equipment in Nigerian federal government agencies based on a survey of 119 personnel of ministries, parastatals and government-controlled banks who participated in various training programmes of the Nigerian National Centre for Economic Management and Administration during 1997. The survey revealed that in spite of the 1988 Civil Service Reforms that was expected to institutionalize modern information processing cultures in the agencies, there appears to be inadequate levels of availability and accessibility of modern IT components in the agencies. There were also substantial gaps between perception of need and actual opportunity to use some of the IT components in the agencies. Although government-owned banks had higher availability and accessibility of various IT components than ministries and parastatals, the gap was not as large as one would have expected in view of differences in the resources and business environments of the banks compared the ministries and parastatals. The study showed that most Nigerian government agencies were in Nolan's initiation, or at best, early contagion stages of computerization.
Detection of text captions in compressed domain video
Authors: Yi Zhang, Tat-Seng Chua
Venue: Proceedings of the 2000 ACM workshops on Multimedia (2000)

In this paper, we propose a new method for detecting text captions in MPEG video stream. It is based on the observation that text captions in video frames typically possess high contrast against the background for them to be visible. The method operates on DCT coefficients in MPEG domain. The main contribution of this work is in developing a binarzied contrast feature domain in which the presence of text in video frames can be highlighted. A weighting function is defined to deduce the probability of a text frame. From the set of representative text frames located, further techniques are developed to outline, segment, and recognise text captions. The techniques have been tested on commercial and news videos from the MPEG7 data set and local TCS news video. The results demonstrate that our approach is effective in detecting and locating text captions in general video.
Simultaneous Exact Controllability and Some Applications
Authors: Marius Tucsnak, George Weiss
Venue: SIAM Journal on Control and Optimization (2000)

We study the exact controllability of two systems by means of a common finite-dimensional input function, a property called simultaneous exact controllability. Most of the time we consider one system to be infinite-dimensional and the other finite-dimensional. In this case we show that if both systems are exactly controllable in time T 0 and the generators have no common eigenvalues, then they are simultaneously exactly controllable in any time T >T0. Moreover, we show that similar results hold for approximate controllability. For exactly controllable systems we characterize the reachable subspaces corresponding to input functions of class H1 and H2. We apply our results to prove the exact controllability of a coupled system composed of a string with a mass at one end. Finally, we consider an example of two infinite-dimensional systems: we characterize the simultaneously reachable subspace for two strings controlled from a common end. The result is obtained using a recent generalization of a classical inequality of Ingham.
Computers and urban society
Authors: Gerald M. Sturman
Venue: Communications of the ACM (1972)

This brief survey of the use of computers in urban society covers the broad range of activities found in any city. The future scope of applications is limited only by the imagination and inventiveness of future system designers, programmers, analysts, and decision makers. The computer can be, if properly used, with respect for human dignity and civil liberty, a significant factor in improving the efficiency of the urban process. It is expected that the benefits of such computer usage will outweigh the costs and that we may look forward to an expansion of such usage.
A 10 bit Current-Mode CMOS A/D Converter with a Current Predictor and a Modular Current Reference
Authors: Soung Hoon Shim, Kwang Sub Yoon
Venue: Analog Integrated Circuits and Signal Processing (2000)

This paper describes a 10 bit CMOS current-mode A/D converter with a current predictor and a modular current reference circuit. A current predictor and a modular current reference circuit are employed to reduce the number of comparator and reference current mirrors and consequently to decrease a power dissipation. The 10 bit current-mode A/D converter is fabricated by the 0.6 &mu;m n-well double poly/triple metal CMOS technology. The measurement results show the input current range of 16&ndash;528 &mu;A, DNL and INL of &plusmn;0.5 LSB and &plusmn;1.0 LSB, conversion rate of 10 M samples, and power dissipation of 94.4 mW with a power supply of 5 V. The effective chip area excluding the pads is 1.8 mm&times;2.4 mm.
Automated complexity analysis based on ordered resolution
Authors: David Basin, Harald Ganzinger
Venue: Journal of the ACM (JACM) (2001)

We define order locality to be a property of clauses relative to a term ordering. This property generalizes the subformula property for proofs where the terms appearing in proofs can be bounded, under the given ordering, by terms appearing in the goal clause. We show that when a clause set is order local, then the complexity of its ground entailment problem is a function of its structure (e.g., full versus Horn clauses), and the ordering used. We prove that, in many cases, order locality is equivalent to a clause set being saturated under ordered resolution. This provides a means of using standard resolution theorem provers for testing order locality and transforming non-local clause sets into local ones. We have used the Saturate system to automatically establish complexity bounds for a number of nontrival entailment problems relative to complexity classes which include polynomial and exponential time and co-NP.
Optimizing locality for ODE solvers
Authors: Thomas Rauber, Gudula Rüger
Venue: Proceedings of the 15th international conference on Supercomputing (2001)

Runge-Kutta methods are popular methods for the solution of systems of ordinary differential equations and are provided by many scientific libraries. The performance of Runge-Kutta methods does not only depend on the specific application problem to be solved but also on the characteristics of the target machine. For processors with memory hierarchy, the locality of data referencing pattern has a large impact on the efficiency of a program. In this paper, we describe program transformations for Runge-Kutta methods resulting in programs with improved locality behavior. The transformations are based on properties of the solution method but are independent from the specific application problem or the specific target machine, so that the resulting implementation is suitable as library function. We show that the locality improvement leads to performance gains on different target machines. We also demonstrate how the locality of memory references can be further increased by exploiting the dependence structure of the right hand side function of specific ordinary differential equations.
Exception Handling in Workflow Management Systems
Authors: Claus Hagen, Gustavo Alonso
Venue: IEEE Transactions on Software Engineering (2000)

Fault tolerance is a key requirement in Process Support Systems (PSS), a class of distributed computing middleware encompassing applications such as workflow management systems and process centered software engineering environments. A PSS controls the flow of work between programs and users in networked environments based on a ¿metaprogram¿ (the process). The resulting applications are characterized by a high degree of distribution and a high degree of heterogeneity (properties that make fault tolerance both highly desirable and difficult to achieve.) In this paper, we present a solution for implementing more reliable processes by using exception handling, as it is used in programming languages, and atomicity, as it is known from the transaction concept in database management systems. The paper describes the mechanism incorporating both transactions and exceptions and presents a validation technique allowing to assess the correctness of process specifications.
Some Prominent Characteristics of the Modified Elliptic Low-Pass Function
Authors: J. C. Ahn, C. H. Yun, S. W. Choi, D. Y. Kim, D. H. Rho
Venue: Analog Integrated Circuits and Signal Processing (1999)

A modified elliptic low-pass filter function with progressively diminishing ripples in both the passband and the stopband is proposed and analyzed. The modified elliptic function is realizable by the passive doubly-terminated ladder network for the order n even or odd, thus lending themselves amenable to high-quality low-sensitivity active RC or switched capacitor filters through the simulation techniques. Besides the passive ladder network realization, the modified elliptic function has improved characteristics both in the frequency domain and the time domain as compared with the classical elliptic function. In addition, the modified function exhibits better magnitude sensitivity properties than the classical function.
On the use of words and n-grams for Chinese information retrieval
Authors: Jian-Yun Nie, Jiangfeng Gao, Jian Zhang, Ming Zhou
Venue: Proceedings of the fifth international workshop on on Information retrieval with Asian languages (2000)

In the processing of Chinese documents and queries in information retrieval (IR), one has to identify the units that are used as indexes. Words and n-grams have been used as indexes in several previous studies, which showed that both kinds of indexes lead to comparable IR performances. In this study, we carry out more experiments on different ways to segment documents and queries, and to combine words with n-grams. Our experiments show that a combination of the longest-matching algorithm with single characters is the best choice.