ppxscal/embedding_network huggingface dataset:
Where Is Client/Server Software Headed?
Authors: Ted G. Lewis
Venue: Computer (1995)

Business software applications account for more than half of the industrial software pie, so it's not surprising that these applications are occupying the thoughts of IT managers, programmers, and analysts. These experts are thinking about them in terms of distributed computing. In its present-day form, distributed computing is actually client/server computing, which is just a step toward the decentralized, peer-to-peer collaborative computing utopia to come in the 21st century. The article outlines information technology as it evolved from the days of centralized mainframes to desktop PCs, and relates the impact on programmers of the new development technologies that accompanied the evolution. Several promising software ideas are examined, especially distributed software that's affecting everyone in computing because it is the economic engine propelling all software, and its underlying infrastructure called middleware. Middleware is key to the fortunes of software manufacturers because it will become the infrastructure of all applications, from home computers to large-scale enterprise computers. The two approaches discussed here are OLE/COM from Microsoft and Opendoc/DSOM from Component Integration Laboratories. In examining the driving forces behind industrial software and its ongoing evolution, the article defines a taxonomy for distributed computing, looks at the interoperability issues, explains the role of object technology, and describes the possible eventual outcome of client/server computing.
Toward Quantum Computation: A Five-Qubit Quantum Processor
Authors: Matthias Steffen, Lieven M. K. Vandersypen, Isaac L. Chuang
Venue: IEEE Micro (2001)

Quantum physics presents intriguing possibilities for achieving computational gains after conventional miniaturization reaches its limits. Accordingly, we describe a nuclear magnetic-resonance quantum computer demonstrating a quantum algorithm that exponentially outperforms classical algorithms.
Definitional Interpreters for Higher-Order Programming Languages
Authors: John C. Reynolds
Venue: Higher-Order and Symbolic Computation (1998)

Higher-order programming languages (i.e., languages in which procedures or labels can occur as values) are usually defined by interpreters that are themselves written in a programming language based on the lambda calculus (i.e., an applicative language such as pure LISP). Examples include McCarthy&lsquo;s definition of LISP, Landin&lsquo;s SECD machine, the Vienna definition of PL/I, Reynolds&lsquo; definitions of GEDANKEN, and recent unpublished work by L. Morris and C. Wadsworth. Such definitions can be classified according to whether the interpreter contains higher-order functions, and whether the order of application (i.e., call by value versus call by name) in the defined language depends upon the order of application in the defining language. As an example, we consider the definition of a simple applicative programming language by means of an interpreter written in a similar language. Definitions in each of the above classifications are derived from one another by informal but constructive methods. The treatment of imperative features such as jumps and assignment is also discussed.
Boundary treatment for virtual leaf surfaces
Authors: Birgit I. Loch, John A. Belward, Jim S. Hanan
Venue: Proceedings of the 1st international conference on Computer graphics and interactive techniques in Australasia and South East Asia (2003)

When working on fitting leaf surfaces for use with virtual plant models [Room et al. 1996] we encountered the unsatisfactory situation of receiving a smooth surface model that is bounded by a piecewise linear curve. To smooth the boundary, we fit a parametric piecewise cubic curve through the boundary data points and extend the surface to the new boundary curve. This method will aid us in the representation of leaf surfaces with arbitrary boundaries in future.
Pilot-Symbol-Aided 16PSK and 16QAM for Digital Land Mobile Radio Systems
Authors: H. K. Lau, S. W. Cheung
Venue: Wireless Personal Communications: An International Journal (1998)

The paper proposes a novel pilot-symbol-aided (PSA) technique for fading compensation of digital signals in the mobile environments. In a PSA system, the data sequence at the transmitter is divided into frames of data. A pilot symbol from a known pseudoradom-symbol sequence is inserted periodically into a frame of data symbol for transmission. In a conventional PSA-receiver, these pilot symbols are extracted from the received signal and used to estimate the effects of signal distortion introduced in the fading channel. The resultant estimates are then used to correct the distortion effects in the received data frames. In the paper, a novel estimation technique that uses the data symbols as well as the pilot symbols is proposed. The technique has the major advantages of simple implementation and short storage-delay time. Results are presented in a series of computer-simulation tests. These assess the effectiveness of the estimation technique on the BER performances of a 16-ary phase-shift keyed (16PSK) and a 16-ary quadrature-amplitude modulated (16QAM) signals in the frequency-selective and frequency-nonselective Rayleigh fading channels. The channels are corrupted by co-channel interference or additive white Gaussian noise. Results of differential-detected 16PSK and star-16QAM signals are also presented for comparison. It has been shown that, the use of PSA technique can significantly improve the bit-error-rate performances of the systems, relative to those using differential detection.
Feature Interactions and Formal Specifications in Telecommunications
Authors: Pamela Zave
Venue: Computer (1993)

The feature-interaction problem found in complex software systems that support telecommunications is reviewed. The relationship between feature interactions and formal specifications is examined. Several important ways telecommunications has evolved beyond plain old telephone service (POTS) are described. It is shown how many feature interactions can be eliminated by applying known techniques of formal specification. A glossary that explains telecommunications terms not defined in the text and acronyms used throughout the article is included.
The Multi-Hour Bandwidth Packing Problem with Response Time Guarantees
Authors: Ali Amiri
Venue: Information Technology and Management (2003)

This paper deals with the multi-hour bandwidth packing problem in telecommunication networks. The problem consists of selecting calls from a list of requests with time varying traffic conditions to be routed on an arc-capacitated network in order to maximize profit. Response time to users is considered by specifying an upper limit on the queueing delay in the network. The paper represents a significant improvement over previous research by presenting a unified model of the problem that considers all possible paths for each call, allows the traffic requirements of the calls to vary over the busy-hours of the day and integrates quality of service to users. A mathematical programming formulation for the problem is presented. A Lagrangean relaxation based heuristic solution procedure is developed. The results of extensive computational experiments over a wide range of problem structures indicate that the procedure is both efficient and effective.
Trend is Toward Less Copyright Protection
Venue: IEEE Software (1993)

The cases of Whelan Associates vs. Jaslow Dental Laboratory, Computer Associates International Inc. vs. Altai, and Apple Computer Inc. vs. Microsoft Inc. are discussed to illustrate trends suggesting that software protection is shrinking, although that could result in the development of more program applications. The traditional and emerging standards of applying copyright protection to software are reviewed.
A parallel genetic algorithm to solve the set-covering problem
Authors: Mauricio Solar, Víctor Parada, Rodrigo Urrutia
Venue: Computers and Operations Research (2002)

This work presents a parallel genetic algorithm (PGA) model to solve the set-covering problem (SCP). Experimental results obtained with a binary representation of the SCP, show that-in terms of the number of generations (computational time) needed to achieve solutions of an acceptable quality-PGA performs better than the sequential model. This comportment can be explained principally because, the PGA of p nodes-each one with its corresponding local population PL-behaves like a sequential GA with a global population, PG, of the same size, which it-the sequential GA-has the great disadvantage of having to completely evaluate in each generation. Not so the PGA, which only evaluates a pth part of the PG.
Consistent Schema Version Removal: An Optimization Technique for Object-Oriented Views
Authors: Viviane M. Crestana-Jensen, Amy J. Lee, Elke A. Rundensteiner
Venue: IEEE Transactions on Knowledge and Data Engineering (2000)

Powerful solutions enabling interoperability must allow applications to evolve and requirements of shared databases to change, while minimizing such changes on other integrated applications. Several approaches, such as the transparent schema evolution system (TSE) by Ra et al., schema versions by Lautemann, and integrated views by Bertino, have been proposed to make interoperability possible by using object-oriented techniques. These approaches may generate a large number of schema versions over time resulting in an excessive build-up of classes and underlying object instances, not all being necessarily still in use. This results in degradation of system performance due to the view maintenance and the storage overhead costs. In this paper, we address the problem of removing obsolete view schemas. We characterize four potential problems of schema consistency that could be caused by removal of a single derived class. We demonstrate that schema version removal is sensitive to the order in which individual classes are processed, and present a formal dependency model that captures all dependencies between classes as logic clauses and manipulates them to make decisions on class deletions and nondeletions while guaranteeing the consistency of the schema. We have also developed and proven consistent a dependency graph (DG) representation of the formal model. Lastly, we present a cost model for evaluating alternative removal patterns on DG to assure selection of the optimal solution. The proposed techniques have been implemented in our Schema View Removal (SVR) tool. Lastly, we report experimental findings for applying our techniques for consistent schema version removal on the MultiView/TSE system.
A Modified Barrier-Augmented Lagrangian Method for Constrained Minimization
Authors: D. Goldfarb, R. Polyak, K. Scheinberg, I. Yuzefovich
Venue: Computational Optimization and Applications (1999)

We present and analyze an interior-exterior augmented Lagrangian method for solving constrained optimization problems with both inequality and equality constraints. This method, the modified barrier&mdash;augmented Lagrangian (MBAL) method, is a combination of the modified barrier and the augmented Lagrangian methods. It is based on the MBAL function, which treats inequality constraints with a modified barrier term and equalities with an augmented Lagrangian term. The MBAL method alternatively minimizes the MBAL function in the primal space and updates the Lagrange multipliers. For a large enough fixed barrier-penalty parameter the MBAL method is shown to converge Q-linearly under the standard second-order optimality conditions. Q-superlinear convergence can be achieved by increasing the barrier-penalty parameter after each Lagrange multiplier update. We consider a dual problem that is based on the MBAL function. We prove a basic duality theorem for it and show that it has several important properties that fail to hold for the dual based on the classical Lagrangian.
Managing Domain-Specific, Product-Line Development
Authors: Randall R. Macala, Lynn D. Stuckey,  Jr., David C. Gross
Venue: IEEE Software (1996)

Product-line development seeks to achieve reuse across a domain, or family, of systems. Product-line development separates the software-development process into two separate life cycles: domain engineering, which aims to create reusable assets, and application engineering, which fields systems using those assets. We used product-line development on a $14 million demonstration project to develop real-time training systems for flight crews.Our project was part of the US Department of Defense's Software Technology for Adaptable, Reliable Systems project. Our domain was Air Vehicle Training Systems, and our first product was the T-34C Flight Instrument Trainer. The project had two phases. In the first phase, a small team was to domain-engineer a slice of the AVTS domain. Following a successful readiness review, in phase two a larger team was to develop the AVTS domain in full so that it was capable of supporting the development of a specific product, the T-34C Flight Instrument Trainer.Our project was a technical success. The goals identified in the restructured project were met or exceeded with fewer resources than promised. The project remains one that is "management challenged": Managers are challenged to change the organizational concepts of procuring, contracting, developing, and maintaining software-intensive systems.We learned that product-line development demands careful strategic planning, a mature development process, and the ability to overcome organizational resistance.
Interactive Problem Solving Using Task Configuration and Control
Authors: Elaine Kant
Venue: IEEE Expert: Intelligent Systems and Their Applications (1988)

The author focuses on computer support for data interpretation as an example of interactive problem-solving. She describes Config, a task representation and control system that solves the immediate interactive data interpretation problem and provides a framework for general interactive problem solving and automatic programming. To specify standard programming constructs, Config's task representation allows task modules to be connected by control flows and dataflows. The representation also enables a task to acquire date from sources other than previously run tasks. In addition, the task control system permits users to interact easily with tasks. Users can graphically display and manipulate module configurations and histories.
Using Formal Specifications for Functional Validation of Hardware Designs
Authors: Kanna Shimizu, David L. Dill
Venue: IEEE Design Test (2002)

Many of today's digital circuit designs depend on the tight integration of multiple design modules. These modules, designed by different engineers, interact via an interface, such as a bus or IP core interface. The interface is of utmost importance because it is where the variousdesigners' conceptions come together. If designers do not uniformly interpret the interface specification, modules will not meld together easily or will behave incorrectly when connected.Therefore, the interface protocols must be clearly defined so that the designers canview the expectedmodulebehaviorconsistently. Furthermore, theprotocolmustbethoroughlydebugged a d solid, because so much of the module design depends on it.
Controlling FD and MVD Inferences in Multilevel Relational Database Systems
Authors: T. -A. Su, G. Ozsoyoglu
Venue: IEEE Transactions on Knowledge and Data Engineering (1991)

The authors investigate the inference problems due to functional dependencies (FD) and multivalued dependencies (MVD) in a multilevel relational database (MDB) with attribute and record classification schemes, respectively. The set of functional dependencies to be taken into account in order to prevent FD-compromises is determined. It is proven that incurring minimum information loss to prevent compromises is an NP-complete problem. An exact algorithm to adjust the attribute levels so that no compromise due to functional dependencies occurs is given. Some necessary and sufficient conditions for MVD-compromises are presented. The set of MVDs to be taken into account for controlling inferences is determined. An algorithm to prevent MVD-compromises in a relation with conflict-free MVDs is given.
WDM/SCM multiple access protocol with high throughput and low packet delay for passive double star networks
Authors: Jintae Yu, Myungmoon Lee, Yongbum Kim, Yongwon Lee, Sangrok Lee, Lynn Choi, Jinwoo Park
Venue: Computer Networks: The International Journal of Computer and Telecommunications Networking (2002)

This paper investigates a hybrid wavelength division multiplexing (WDM) multiple access protocol combining the advantages of preallocation and reservation-based schemes using a subcarrier multiplexing (SCM) technique for passive double star optical networks. We include a node-grouping scheme in the proposed protocol to increase channel utilization and to reduce sensitivity to queueing delay time and propagation delay time. All nodes in a network are connected through passive star sub-hub forming multiple groups, and the groups are then connected through a central passive star hub resulting in a passive double star network. Each group is pre-assigned a WDM channel as its home channel, and a specific SCM channel identifies each node. In the proposed protocol, the frame is divided into slots corresponding to the number of groups, not the number of nodes. The reduced number of slots results in reduction of queueing delay time. Furthermore, additional reduction in the propagation delay time of the control packets is achieved by limiting the propagation paths of the control packets to the roundtrip between source nodes and sub-hub in a double star network.
Approximate Gradient Methods in Policy-Space Optimization of Markov Reward Processes
Authors: Peter Marbach, John N. Tsitsiklis
Venue: Discrete Event Dynamic Systems (2003)

We consider a discrete time, finite state Markov reward process that depends on a set of parameters. We start with a brief review of (stochastic) gradient descent methods that tune the parameters in order to optimize the average reward, using a single (possibly simulated) sample path of the process of interest. The resulting algorithms can be implemented online, and have the property that the gradient of the average reward converges to zero with probability 1. On the other hand, the updates can have a high variance, resulting in slow convergence. We address this issue and propose two approaches to reduce the variance. These approaches rely on approximate gradient formulas, which introduce an additional bias into the update direction. We derive bounds for the resulting bias terms and characterize the asymptotic behavior of the resulting algorithms. For one of the approaches considered, the magnitude of the bias term exhibits an interesting dependence on the time it takes for the rewards to reach steady-state. We also apply the methodology to Markov reward processes with a reward-free termination state, and an expected total reward criterion. We use a call admission control problem to illustrate the performance of the proposed algorithms.
Playstation Pocket Power Guide: Unauthorized
Authors: Prima Publishing, Prima Creative Services
Venue:  (1997)

:This guide covers the hottest Playstation games! Alundra, Crash Bandicoot 2, Fighting Force, G-Police, Jersey Devil, MDK, Nightmare Creatures, One, Tomb Raider II, and many more!
Modeling of supercritical extraction of mannitol from plane tree leaf
Authors: S. M. Ghoreishi, S. Sharifi
Venue: Iranian Journal of Science and Technology (2002)

The objective of this study was to investigate the theoretical feasibility of using supercritical fluid extraction of Mannitol from plane tree leaf as an alternative technology in the pharmaceutical industry. Simulation of an extraction column using dense liquid and supercritical carbon dioxide was modeled involving partial differential equations, using orthogonal collocation on finite elements. The important solvent extraction parameters such as the partition coefficient, mass transfer coefficient, dispersion coefficient, molecular diffusion and extraction efficiency (the amount of Mannitol extracted versus the amount of solvent used) were investigated as a function of the dimensionless Reynolds and Peclet numbers in order to optimize the extraction column geometry and the carbon dioxide operating conditions.Results demonstrate that the supercritical extraction is a viable technique for Mannitol production and that the process conditions for a large commercial extraction system do not require a high temperature in order to obtain high extraction efficiency. However, at low pressure, the solubility of the Mannitol in carbon dioxide would limit the success of the extraction process and at very high pressures the extraction technique may not be economically feasible. To investigate the authenticity of the mathematical model, the experimental data for the desorption of hexachlorobenzene from soil was compared with the theoretical results of this research. The model is able to predict the experimental data quite well without any adjustable parameters.
Exploiting syntactic analysis of queries for information retrieval
Authors: Markus Mittendorfer, Werner Winiwarter
Venue: Data Knowledge Engineering (2002)

Up to now, the results of applying sophisticated NL techniques to information retrieval (IR) have been mostly disappointing. Our research aims at investigating in detail the role of syntactic analysis in IR and at finding answers to the question why it works better for some queries and worse for others. The final goal is a hybrid algorithm that selectively applies syntactic analysis to certain classes of queries while relying on standard statistical techniques otherwise.
A Dynamic Manifestation Approach for Providing Universal Access to Digital Library Objects
Authors: Nabil R. Adam, Vijayalakshmi Atluri, Igg Adiwijaya, Sujata Banerjee, Richard Holowczak
Venue: IEEE Transactions on Knowledge and Data Engineering (2001)

Digital libraries are concerned with the creation and management of information sources, the movement of information across global networks, and the effective use of this information by a wide range of users. A digital library is a vast collection of objects that are of multimedia nature, e.g., text, video, images, and audio. Users wishing to access the digital library objects may possess varying capabilities, preferences, domain expertise, and may use different information appliances. Facilitating access to complex multimedia digital library objects that suits the users' requirements is known as universal access. In this paper, we present an object manifestation approach in which digital library objects automatically manifest themselves to cater to the users' capabilities and characteristics. We provide a formal framework, based on Petri nets, to represent the various components of the digital library objects, their modality and fidelity, and the playback synchronization relationships among them. We develop methodologies for object delivery without any deadtime under network delays.