ppxscal/embedding_network huggingface dataset:
A class of stochastic optimization problems with one quadratic & several linear objective functions and extended portfolio selection model
Authors: Jiuping Xu, Jun Li
Venue: Journal of Computational and Applied Mathematics (2002)

In this paper a class of stochastic multiple-objective programming problems with one quadratic, several linear objective functions and linear constraints has been introduced. The former model is transformed into a deterministic multiple-objective nonlinear programming model by means of the introduction of random variables' expectation. The reference direction approach is used to deal with linear objectives and results in a linear parametric optimization formula with a single linear objective function. This objective function is combined with the quadratic function using the weighted sums. The quadratic problem is transformed into a linear (parametric) complementary problem, the basic formula for the proposed approach. The sufficient and necessary conditions for (properly, weakly) efficient solutions and some construction characteristics of (weakly) efficient solution sets are obtained. An interactive algorithm is proposed based on reference direction and weighted sums. Varying the parameter vector on the right-hand side of the model, the DM can freely search the efficient frontier with the model. An extended portfolio selection model is formed when liquidity is considered as another objective to be optimized besides expectation and risk. The interactive approach is illustrated with a practical example.
Designing Issues of Component-Based ZgisObjects
Authors: Tariq Rahim Soomro, Kaugen Zheng, Yunhe Pan
Venue: Proceedings of the Fourth International Conference on Computational Intelligence and Multimedia Applications (2001)

Geographical Information System (GIS) is widely recognized as a powerful and dynamictool that crosses the boundaries of disciplines and applications areas.This paper is written,keeping in view the importance of Components-based approach in the field of GIS and willdiscuss the designing issues of ZGisObjects, which is based on Component technology.ZGisObjects is component-based tool created in C++.It enable GIS developers to build theirown GIS applications quickly, easily and with little programming efforts.ZGisObjects alsoenabled the multimedia and 3-D map viewing facilities easily and quickly because it is basedon components, so that one or more component of ZGisObjects can be used individually orcollectively with other non-ZGisObjects components (e.g. Multimedia & 3-D Component).
The Mortar Finite Element Method for 3D Maxwell Equations: First Results
Authors: A. B F. Ben Belgacem
Venue:  (1999)

In the framework of domain decomposition, we extend the main ideas of the mortar element method to the numerical resolution of Maxwell''s equations (in wave form) by $H(\curl)$-conforming finite elements. The method we propose turns out to be a new nonconforming nonoverlapping domain decomposition method where nonmatching grids are allowed at the interfaces between subdomains. A model problem is considered, the convergence of the discrete approximation is analyzed and an error estimate is provided. The method is proven to be slightly sub-optimal with a loose of a factor $\sqrt{|\ln h|}$ with respect to the degree of polynomials. In order to achieve this convergence result we nevertheless need extra-regularity assumptions on the solution of the continuous problem. TEL:: 0382-505652 EMAIL:: annalisa@dimat.unipv.it
High-Radix Parallel VLSI Dividers without Using Quotient Digit Selection Tables
Authors: Takafumi Aoki, Kimihiko Nakazawa, Tatsuo Higuchi
Venue: Proceedings of the 30th IEEE International Symposium on Multiple-Valued Logic (2000)

This paper presents the design and evaluation of high-radix parallel dividers for high-speed signal and data processing applications. The presented divider designs are based on the unified high-radix division algorithm proposed by the authors. By prescaling the operands and converting the representation of each partial remainder into partially non-redundant representation, the quotient digit can be obtained directly from the integer part of the partial remainder without using quotient digit selection tables. Performance evaluation shows that the proposed radix-4 and radix-8 divider architectures achieve faster computation with less hardware complexity, in comparison with the binary counterparts. This paper also presents the experimental fabrication of the radix-4 divider in 0.35um CMOS technology.
Conditional Knowledge as a Basis for Distributed Simulation
Authors: K. M Chandy, Jay Misra
Venue:  (1987)

A goal of this paper is to explore different ways of implementing distributed simulations. Distributed simulation grew out of sequential simulation, and it is possible that the way we think about distributed simulation is unduly influenced by its sequential origins. To free ourselves from unnecessary restrictions on the way we design distributed simulations, in this paper we define the distributed simulation problem somewhat differently than in the literature. We propose the concepts of "knowledge" and "conditional knowledge", to help us obtain a general framework to reason about distributed simulations without too close a coupling with any specific implementation method. The framework appears helpful in designing new ways of distributed simulations. Empirical studies of distributed simulations report widely varying results: some studies report improvements in speed that are almost linearly proportional to the number of computers in the system, while other studies report that distributed simulation is even slower than sequential simulation. The framework proposed in this paper seems to help in explaining the wide differences observed in empirical studies. Using our framework, we attempt to suggest properties that efficient "general-purpose" distributed discrete-event simulations must have. The paper assumes little prior knowledge of the literature on simuIation or distributed systems. We hope that the paper will serve as a tutorial in addition to providing additional insight.
Least Change Secant Updates for Quasi-Newton Methods
Authors: John E. Dennis,  Jr., Robert B. Schnabel
Venue:  (1978)

In many problems involving the solution of a system of nonlinear equations, it is necessary to keep an approximation to the Jacobian matrix which is updated at each iteration. Computational experience indicates that the best updates are those that minimize some reasonable measure of the change to the current Jacobian approximation subject to the new approximation obeying a secant condition and perhaps some other approximation properties such as symmetry. In this paper we extend the affine case of a theorem of Cheney and Goldstein on proximity maps of convex sets to show that a generalization of the symmetrization technique of Powell always generates least change updates. This generalization has such broad applicability that we obtain an easy unified derivation of all the most successful updates. Furthermore, our techniques apply to interesting new cases such as when the secant condition might be inconsistent with some essential approximation property like sparsity. We also offer advice on how to choose the properties which are to be incorporated into the approximations and how to choose the measure of changes to be minimized.
Reliability of traffic management applications based on digital short-range communications
Authors: C. Wietfeld
Venue: Proceedings of the 2nd International Computer Performance and Dependability Symposium (IPDS '96) (1996)

In this paper, the performance of short-range vehicle-roadside communication systems, which support RTTT (Road Traffic & Transport Telematics) services, is analysed. After introducing general communication requirements of RTTT applications in a road traffic environment, a short overview about the current status of the Dedicated Short-Range Communications DSRC prENV draft standards developed within CEN TC 278/ISO TC 204 will be given. Analytical techniques (Markov Chain modelling) will be introduced to demonstrate their capability to support the optimal choice of selected system parameters. In order to analyse the overall reliability of the communication system, the concept of the performance evaluation of vehicle-roadside systems based on integrated models of mobility, channel characteristics and communication protocols will be introduced. Simulation results based on an implementation of a high priority interactive service (Automatic Fee Collection) combined with an additional broadcast-oriented service (Dynamic Route Guidance) are analysed in detail (transaction failure rate, used length of the communication zone, interference between different applications, etc.). Optimal choices of system parameters such as antenna configurations are presented. The results show, that DSRC systems are able to provide multiple RTTT services using the same DSRC link to make best use of the available system capacity and to enhance the benefits for potential users.
A Model for Reasoning About Persistence and Causation
Authors: Thomas Dean, Keiji Kanazawa
Venue:  (1989)

In this paper, we describe a model of causal reasoning that accounts for knowledge concerning cause-and-effect relationships and knowledge concerning the tendency for propositions to persist or not as a function of time passing. Our model has a natural encoding in the form of a network representation for probabilistic models. We explore the computational properties of our model by considering recent advances in computing the consequences of models encoded in this network representation.
Performance Debugging Based on Scalability Analysis
Authors: Takashi Suzuoka, Jaspal Subhlok, Thomas Gross
Venue:  (1994)

This paper presents scalability as a basis for profiling and performance debugging of parallel programs, as only the purely scalable code runs efficiently in parallel. The approach is based on separating scalable and various kinds of non-scalable parts of a program, identifying the reasons for non-scalability, and focusing the programmer''s attention on why and where non-scalable execution is occurring. We specifically address parallel programs that are generated by a parallelizing compiler, and use compiler information to divide the execution times into logical categories that are meaningful to the programmer. We have designed and implemented a profiler that is integrated with a compiler for a variant of High Performance Fortran. The profiler classifies the execution cycles into ten categories that are easily understood by the user in terms of the source program. The paper includes two examples that demonstrate how the data reported by the profiler is used to identify and resolve performance bugs in parallel programs.
Framework for Power Aware Remote Processing: Design and Implementation of a Dynamic Power Estimation Unit
Authors: Gerald Kaefer, Josef Haid, Bernd Hofer, Gerhard Schall, Reinhold Weiss
Venue: Proceedings of the 5th IEEE International Symposium on Wearable Computers (2001)

In this paper we present a "Framework for Power Aware Remote Processing" to minimize the energy consumption of mobile devices transparently. The main difference to remote processing frameworks already published consists in a novel integrated dynamic Power Estimation Unit. This is a adaptive power consumption estimator, which estimates the energy consumption of software and system components. Based on the estimated power consumption an intelligent power manager migrates software components from the mobile device to remote machines, thus reducing the energy consumption of the mobile device
Advances in the Characterization of Three-Dimensional Surface Roughness
Authors: Liam Blunt, Xiangqian Jiang
Venue:  (2003)

:This book has been prepared with the support of the European Community's Directorate General XII and represents the culmination of research conducted by 11 international partners as part of an European Union-funded project. The aim of the project is to inform standards bodies of the possibilities that exist for a new international standard covering the field of 3D surface characterization.
Risk-averse auction agents
Authors: Yaxin Liu, Richard Goodwin, Sven Koenig
Venue: Proceedings of the second international joint conference on Autonomous agents and multiagent systems (2003)

Auctions are an important means for purchasing material in the era of e-commerce. Research on auctions often studies them in isolation. In practice, however, auction agents are part of complete supply-chain management systems and have to make the same decisions as their human counterparts. To address this issue, we generalize results from auction theory in three ways. First, auction theory provides the optimal bidding function for the case where auction agents want to maximize the expected profit. Since companies are often risk-averse, we derive a closed form of the optimal bidding function for auction agents that maximize the expected utility of the profit for concave exponential utility functions. Second, auction theory often assumes that auction agents know the bidder's valuation of an auctioned item. However, the valuation depends on how the item can be used in the production process. We therefore develop theoretical results that enable us to integrate our auction agents into production-planning systems to derive the bidder's valuation automatically. Third, auction theory often assumes that the probability distribution over the competitors' valuations of the auctioned item is known. We use simulations of the combined auction- and production-planning system to obtain crude approximations of these probability distributions automatically. The resulting auction agents are part of a complete supply-chain management system and seamlessly combine ideas from auction theory, utility theory, and dynamic programming.
Self-organising impact boundaries in ageless aerospace vehicles
Authors: Howard Lovatt, Geoff Poulton, Don Price, Mikhail Prokopenko, Philip Valencia, Peter Wang
Venue: Proceedings of the second international joint conference on Autonomous agents and multiagent systems (2003)

Self-monitoring, self-repairing aerospace vehicles require modular, flexible and adaptive sensing and communication networks. In general, a modular (multi-cellular) sensing and communication network is expected to detect and react to impact location, energy and damage over a wide range of impacts. It is critical that global response emerges as a result of interactions involving transfer of information embedded locally, avoiding single points-of-failure. This work presents mechanisms ensuring self-organisation of autonomous cells into robust and continuously connected impact boundaries. The spatiotemporal stability is demonstrated for a variety of cell shapes in a dynamic environment with varying energy dissipation and damage probability models.
A Floating-Point ADC with Variable Gain Pipeline Stages
Authors: Paavo J. Kosonen
Venue: Analog Integrated Circuits and Signal Processing (2003)

Typically an automatic gain control (AGC) amplifier is needed in a receiver to control the amplitude of the signal at the input of the ADC. To get rid of the AGC, a floating-point pipelined analog-to-digital converter (FP-ADC), which consists of variable gain stages, is presented. The frontend pipeline stages of the ADC use a larger gain if the value of the signal is small. If the value of the signal is large, they act as typical pipeline stages. Thus, the small values of the signal are converted using higher resolution than larger values. The dynamic range of the ADC is increased and a separate AGC is not needed.
Verifying Safety Properties Using Non-deterministic Infinite-state Automata
Authors: Nils Klarlund, Fred B. Schneider
Venue:  (1989)

A new class of infinite-state automata, called safety automata, is introduced. Any safety property can be specified by using such an automaton. Sound and complete proof obligations for establishing that an implementation satisfies the property specified by a safety automaton are given.
Separation of the Exchange-Correlation Potential into Exchange plus Correlation: an Optimized Effective Potential Approach
Authors: Claudia Filippi, C. J. Umrigar, Xavier Gonze
Venue:  (1996)

Most approximate exchange-correlation functionals used within density functional theory are constructed as the sum of two distinct contributions for exchange and correlation. Separating the exchange component from the entire functional is useful since, for exchange, exact relations exist under uniform density scaling and spin scaling. In the past, accurate exchangecorrelation potentials have been generated from essentially exact densities but they have not been correctly decomposed into their separate exchange and correlation components (except for two-electron systems). Using a recently proposed method, equivalent to the solution of an optimized effective potential problem with the corresponding orbitals replaced by the exact Kohn-Sham orbitals, we obtain the separation according to the density functional theory definition. We compare the results for the Ne and Be atoms with those obtained by the previously used appromixate separation scheme.
Reexecution in Abstract Interpretation of Prolog
Authors: Baudouin L Charlier, Pascal Van Hentenryck
Venue:  (1992)

Logic programming, because of referential transparency, enjoys the property that a goal may be reexecuted arbitrarily often without affecting the meaning of the program. This property, although not interesting computationally in general, can be exploited in abstract interpretation to improve the accuracy of the analysis, as noted by Bruynooghe. In this paper, we study reexecution from its theoretical foundations to its experimental evaluation. We define a new abstract semantics for Prolog that incorporates the notion of reexecution, and we study its correctness and precision properties. A fixpoint algorithm to compute (parts of) the abstract semantics is then presented. The accuracy and efficiency of the algorithm is evaluated experimentally on two abstract domains, a simple domain and an elaborate domain, and compared with conventional approaches. The experimental results indicate that (1) reexecution can provide significant gain in accuracy at a very reasonable computation cost and that (2) reexecution on a simple domain is a versatile alternative to the standard approach on a more sophisticated domain.
Density-based unsupervised classification for remote sensing
Authors: Cees H.M. Kemenade, J. A. L Poutre, R. J. Mokken
Venue:  (1998)

Most image classification methods are supervised and use a parametric model of the classes that have to be detected. The models of the different classes are trained by means of a set of training regions that usually have to be marked and classified by a human interpreter. Unsupervised classification methods are data-driven methods that do not use such a set of training samples. Instead, these methods look for (repeated) structures in the data.
A Secure and Open Mobile Agent Programming Environment
Authors: Paolo Bellavista, Antonio Corradi, Cesare Stefanelli
Venue: Proceedings of the The Fourth International Symposium on Autonomous Decentralized Systems (1999)

The Mobile Agent technology is suitable for applications in open, distributed and heterogeneous environments such as the Internet and the Web, because it can overcome some limits of traditional approaches. The paper describes a Secure and Open Mobile Agent (SOMA) programming environment with two main design objectives that are security and interoperability. On the one hand, SOMA is based on a thorough security model and provides a wide range of tools and mechanisms to build and enforce flexible security policies. On the other hand, the SOMA framework can interoperate with different application components designed with different programming styles. SOMA grants interoperability by closely considering compliance with CORBA, the most diffused standard in the area of Object-Oriented components. SOMA has been adopted as a platform to develop several distributed applications in the area of network and systems management, CSCW, and distributed and heterogeneous information systems.
An Empirical Comparison of Modularity of Procedural and Object-oriented Software
Authors: Lisa K. Ferrett, Jeff Offutt
Venue: Proceedings of the Eighth International Conference on Engineering of Complex Computer Systems (2002)

A commonly held belief is that applications written in aobject-oriented languages are more modular than thosewritten in procedural languages. This paper presentsresults from an experiment that examines this hypothesis.Open source and industrial program modules written inthe procedural languages of Fortran and C werecompared with open source program modules written inthe object-oriented languages of C++ and Java. Themetrics examined in this study were lines of code permodule and number of parameters per module. Theresults of the investigation support the hypothesis. Themodules of the object-oriented programs were found to behalf the size of those of the procedural programs and theaverage number of parameters per module for the object-orientedprograms was approximately half that of theprocedural programs. Thus the object-oriented programswere twice as modular as the procedural programs. Anunexpected result was that the C++ programs were foundto be no more modular than the C programs.
Electrical and Thermal Analysis for System-in-a-Package (SiP) Implementation Platform
Authors: Michael Wang, Katsuharu Suzuki, Wayne Dai
Venue: Proceedings of the 4th International Symposium on Quality Electronic Design (2003)

This paper presents an electrical and thermalperformance analysis of System-in-a-Package (SiP)memory/logic implementation platform based on Chip-Laminate-Chip (CLC) technology. Internal IO interfaceinside CLC module has been modeled and compared withStack-Chip (SC) implementation. Thermal analysis,including comparison against Stack-Chip and System-on-a-Chip (SoC) is also presented. It is demonstrated thatCLC technology provides significant performanceadvantage over conventional SiP technologies and hasgreat impact on future system-level integration.
A Congestion Control Mechanism Supporting QoS Requirements
Authors: Wanming Luo, Chuang Lin, Baoping Yan
Venue: Proceedings of the 2001 International Conference on Computer Networks and Mobile Computing (ICCNMC'01) (2001)

Most of existed congestion control work are suitable for the best effort flows, but not for the flows with quality of services (Qos) requirements. In this paper, by adopting equation-based congestion Control (EBRC) for differentiated services instead oftraditional TCP congestion control for best-effort services, a new congestion control mechanism support QoS requirements can be achieved.Three parts which the mechanism consists of are sender functionality, packet loss control mechanism inrouters and receiver functionality.The details of design and implementation within this mechanism are investigated.
Representing Relationships and Their Semantic Partiions as First-class Objects
Authors: David Edmond, Mike P. Papazoglou, Mark McLoughlin
Venue:  (1993)

Object-oriented data models have proven to be popular tools for developing complex database applications since they provide expressive modelling power, which allows us to naturally model real- world entities and semantics. However, typically the modelling of inter-object associations has been implementation oriented and consequently their semantics have been either suppressed or completely lost. In this paper we present an extension to object-oriented data models in which relationships are expressed as objects in their own right, possessing properties which allow them to naturally express associations between objects. Our approach allows us to divide relationships into coherent object partitions to which we can attach further distinguishable properties. This mechanism can be used to implement dynamic and temporal properties and aspects of relationships which are essential to the modelling of large and complex systems.