ppxscal/embedding_network huggingface dataset:
Microsoft Office Automation with Visual FoxPro
Authors: Tamar E. Granor, Della Martin
Venue:  (2002)

:Visual FoxPro developers are used to building large, complex applications using only VFP as their programming environment. But Windows users are demanding moreintegration with other applications such as the Microsoft Office suitWord, Excel, PowerPoint and Outlook. Visual FoxPro can be used to automateeither visually or behind the scenesany task or process that you could do manually in Office, plus much more. In Microsoft Office Automation with Visual FoxPro, users learn how to create powerful applications that span the entire Office suite, using Visual FoxPro in the drivers seat.
Sams Teach Yourself Macromedia Dreamweaver MX Application Development in 21 Days, 2 edition
Authors: John Ray
Venue:  (2002)

:In just 21 days, you can gain all the knowledge and skills necessary to develop sophisticated, interactive Web applications and sites with Dreamweaver MX, the powerful Web site editor and development tool from Macromedia. Dreamweaver MX allows Web site developers and designers to visually create and edit data-driven Web applications on multiple server platforms, including ColdFusion, ASP, and JSP. Sams Teach Yourself Dreamweaver MX Application Development in 21 Days shows both beginners and intermediate-level developers how they can increase their productivity with the help of Dreamweaver MX's visual authoring tools. No previous programming experience required. By following the 21 carefully organized lessons in this book, anyone can learn the basics of Dreamweaver MX application development. Learn at your own pace. You can work through each chapter sequentially to make sure you thoroughly understand all of the concepts and methodologies. Or you can focus on specific lessons to learn the techniques that interest you most. Test your knowledge. Each chapter ends with a Workshop section, which is filled with questions, answers, and exercises for further study. 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
Global solution to a nonlinear phase transition model with dissipation
Authors: Elena Bonetti
Venue:  (2001)

A nonlinear system of PDE''s describing phase transition is considered in accordance with a recent dissipative model proposed by Fr\''emond, in which, in particular, the power of interior forces depends on microscopic movements. Existence of a global solution is proved for the resulting initial and boundary value problem through a fixed point argument. Moreover, an uniqueness result is established for a slightly simplified version of the system. TEL:: 0382-505631 EMAIL:: bonetti@dimat.unipv.it
Dual Variable Metric Algorithms for Constrained Optimization
Authors: Shih Han
Venue:  (1975)

We present a class of algorithms for solving constrained optimization problems. In the algorithm non-negatively constrained quadratic programming subproblems are iteratively solved to obtain estimates of Lagrange multipliers and with these estimates a sequence of points which converges to the solution is generated. To achieve a superlinear rate of convergence the matrix appearing in the subproblem is required to be an approximate inverse of the Hessian of the Lagrangian. Some well-known variable metric updates such as the BFGS update are employed to generate the matrix and the resulting algorithm converges locally with a superlinear rate. When the penalty Lagrangian developed by Hestenes, Powell and Rockafellar is incorporated in the algorithm, it turns out to be closely related to the recently developed the method of multipliers. Unlike the method of multipliers, our algorithm possesses a superlinear rate of convergence even without requiring a penalty parameter goint to infinity and therefore avoids the numerical instability so caused.
MANTEMA: A Software Maintenance Methodology Based on the ISO/IEC 12207 Standard
Authors: Macario Polo, Mario Piattini, Francisco Ruiz, Coral Calero
Venue: Proceedings of the 4th IEEE International Symposium and Forum on Software Engineering Standards (1999)

The maintenance of information systems is one of the greatest problems in the software life cycle: It is the most conflictive, costliest, less planificable; and the process requiring the most resources. In spite of this reality, most organizations do not possess methodologies for software maintenance. These facts, key to the imperative need of controlling the maintenance process, have carried us to propose a maintenance methodology. In this paper an adjustment of the ISO/IEC 12207 standard for the processes of the ltfe cycle maintenance is presented. This methodology is being used by Atos ODS, one of the most important European consultants on software outsourcing and maintenance.
Arrays, bounded quantification and iteration in logic and constraint logic programming
Authors: Krzysztof R. Apt
Venue:  (1995)

We claim that programming within the logic programming paradigm suffers from lack of attention given to iteration and arrays. To convince the reader about their merits we present several examples of logic and constraint logic programs which use iteration and arrays instead of explicit recursion and lists. These programs are substantially simpler than their counterparts written in the conventional way. They are easier to write and to understand, are guaranteed to terminate and their declarative character makes it simpler to argue about their correctness. Iteration is implemented by means of bounded quantification.
Interactive Visualization of Agent Societies
Authors: Claudio Delrieux, Fernando Tohme
Venue: Proceedings of the Fourth International Conference on Computational Intelligence and Multimedia Applications (2001)

Visualization of the dynamic behavior in complex system is an efficient way to facilitateAnalysis and decision making.Complexity itself entails several difficulties to find an adequate visual representation of the relevant features of the system's dynamics.Forthis reason, in this work we explore the elaboration of interactive interfaces for the visualization of the behavior of complex systems.In particular, we pursue the representation of the dynamics of a society of intensional agents.These agents exhibit an individually simple behavior, but together experiment a collective complexbehavior.We established an experimentation protocol aimed to verify an hypothesisabout the long term evolution of the system.We show how our visualization toolis helpful in understanding and interpreting these results.
Characterizing the flow equivalent trees of a network
Authors: David Hartvigsen
Venue: Discrete Applied Mathematics (2003)

Consider a connected graph G with positive edge capacities. Gomory and Hu (J. SIAM 9 (1961) 551) showed that there always exists a tree T with positive edge capacities, on the same node set as G, such that the max flow value between any pair of nodes in G is the same as the max flow value between the corresponding pair of nodes in T. Such a tree is called a flow equivalent tree for G and need not be unique. In this paper, we present a "compact" (i.e., polynomial size) characterization of the collection of all flow equivalent trees for a graph G. We also present a polynomial time algorithm for recognizing such representations.
An Interrupt Based Organization for Management Information Systems
Authors: Howard L. Morgan
Venue:  (1969)

A programming structure, language constructs, and supervisorry system organization are proposed for the design and coding of large shared data base systems. The bases for this organization are a generalized interrupt structure and the newly introduced concept of ``file tagging'''', which is the process of associating program structures and interrupt generating conditions with items in the data base. An algorithm for resolving conflicts which arise in scheduling the interrupt processing routines is presented. DPL, a programming language and supervisory system in which these concepts are implemented, is used to illustrate the new organization which is proposed for management information systems. Keywords and phrases: management information systems, integrated data processing, supervisors, interrupts, monitoring systems, supervisory systems, interrupt scheduling, parallel processing.
Mathematical Programming Models for Environmental Quality Control
Authors: Harvey J. Greenberg
Venue:  (1995)

This paper surveys the use of mathematical programming models for controlling environmental quality. The scope includes air, water and land quality, stemming from the first works in the 1960''s. It also includes integrated models, generally that are economic equilibrium models that have an equivalent mathematical program or use mathematical programming to compute a fixed point. A primary goal of this survey is to identify interesting research avenues for people in mathematical programming with an interest in applying it to help control our environment with as little economic sacrifice as possible.
Analytical investigations of the effects of tension slab reinforcement in cantilever beams
Authors: M. B. H. Emara
Venue: Proceedings of the sixth conference on Computational structures technology (2002)

In this paper nonlinear finite element analyses have been performed on a set of reinforced concrete T-beams with the slab in tension (hogging moments). The purpose here was to investigate the influence of the tension slab reinforcement on increasing the beam's flexural capacity and changing the beam's mode of failure. The parameters investigated included the flange width, percentage longitudinal reinforcement in the slab, the beam's flexural reinforcement and displacements restraint (boundary conditions) in both the longitudinal and transverse directions. Elements' strains, nodal deflections, ultimate sectional capacities and modes of failure were determined for the beams.The study revealed that increasing the slab's tension reinforcement significantly increased the flexural capacities of the beams and influenced the mode of failure. However, it had little effect on the deflections at service load levels and at ultimate.
A Pseudo-Global Optimization Approach with Application to the Design of Containerships
Authors: Hanif D. Sherali, Vikram Ganesan
Venue: Journal of Global Optimization (2003)

In this paper, we present a new class of pseudo-global optimization procedures for solving formidable optimization problems in which the objective and/or constraints might be analytically complex and expensive to evaluate, or available only as black-box functions. The proposed approach employs a sequence of polynomial programming approximations that are constructed using the Response Surface Methodology (RSM), and embeds these within a branch-and-bound framework in concert with a suitable global optimization technique. The lower bounds constructed in this process might only be heuristic in nature, and hence, this is called a pseudo-global optimization approach. We develop two such procedures, each employing two alternative branching techniques, and apply these methods to the problem of designing containerships. The model involves five design variables given by the design draft, the depth at side, the speed, the overall length, and the maximum beam. The constraints imposed enforce the balance between the weight and the displacement, a required acceptable length to depth ratio, a restriction on the metacentric height to ensure that the design satisfies the Coast Guard wind heel criterion, a minimum freeboard level as governed by the code of federal regulations (46 CFR 42), and a lower bound on the rolling period to ensure sea-worthiness. The objective function seeks to minimize the required freight rate that is induced by the design in order to recover capital and operating costs, expressed in dollars per metric ton per nautical mile. The model formulation also accommodates various practical issues in improving the representation of the foregoing considerations, and turns out to be highly nonlinear and nonconvex. A practical test case is solved using the proposed methodology, and the results obtained are compared with those derived using a contemporary commercialized design optimization tool. The prescribed solution yields an improved design that translates to an estimated increase in profits of about &dollar;18.45 million, and an estimated 27% increase in the return on investment, over the life of the ship.
Evolutionary Multi-Level Network Synthesis in Given Design Style
Authors: T. Luba, C. Moraga, S. Yanushkevich, M. Opoka, V. Shmerko
Venue: Proceedings of the 30th IEEE International Symposium on Multiple-Valued Logic (2000)

This paper extends the technique of evolutionary network design. We study evolutionary network design strategy from the position of design style.A hypothesis under investigation is that the uncertainty of a total search space (the space of all possible network solutions) through evolutionary network design is removed faster if this space is partitioned into subspaces. This idea has been realized through a parallel window-based scanning of these subspaces. Such a window is determined by the parameters of a multi-level network architecture in a given design style. Our approach allows to synthesize networks with more than two hundred quaternary gates. Moreover, we show that information theoretical interpretation of the evolutionary process is useful, in particular, in partitioning of network space and measuring of fitness function.The experimental data with 6-input quaternary and 11-inputs binary benchmarks demonstrate the efficiency of our program, EvoDesign, and an improvement against the recently obtained results.
Identification of the Drift Coefficient of a Fokker-Plank Equation from the Moment Dicretization of Its Stationary Solution
Authors: Gabriele Inglese
Venue:  (1995)

The following contains mathematical formulae and symbols that may become distorted in ASCII text format. This paper is concerned with the problem of recovering the drift coefficient (symbol) of a Fokker-Plank diffusion equation from the knowledge of its stationary solution (symbol). Since (symbol) is proportional to the logarithmic derivative of (symbol), such a problem turns out to be severely ill-posed. A regularization method based on the moment discretization of (symbol) is proposed. Keywords: Identification problems for PDE, numerical differentiation, maximum entropy solutions of finite moment problems.
Graph-theoretic analysis of structured peer-to-peer systems: routing distances and fault resilience
Authors: Dmitri Loguinov, Anuj Kumar, Vivek Rai, Sai Ganesh
Venue: Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications (2003)

This paper examines graph-theoretic properties of existing peer-to-peer architectures and proposes a new infrastructure based on optimal diameter de Bruijn graphs. Since generalized de Bruijn graphs possess very short average routing distances and high resilience to node failure, they are well suited for structured peer-to-peer networks. Using the example of Chord, CAN, and de Bruijn, we first study routing performance, graph expansion, and clustering properties of each graph. We then examine bisection width, path overlap, and several other properties that affect routing and resilience of peer-to-peer networks. Having confirmed that de Bruijn graphs offer the best diameter and highest connectivity among the existing peer-to-peer structures, we offer a very simple incremental building process that preserves optimal properties of de Bruijn graphs under uniform user joins/departures. We call the combined peer-to-peer architecture ODRI -- Optimal Diameter Routing Infrastructure.
Generating Test Cases from an OO Model with an AI Planning System
Authors: Michael Scheetz, Anneliese von Mayrhauser, Robert France, Eric Dahlman, Adele E. Howe
Venue: Proceedings of the 10th International Symposium on Software Reliability Engineering (1999)

Black box test generation needs a model of the system under test to describe what is to be tested. Testing criteria and test objectives define how it is to be tested. We explain how to represent a system under test via UML models. We derive test objectives from the UML models and use the objectives and the models to generate test cases by mapping them into a problem description for an AI Planner. The planner uses the problem description to generate a test suite that satisfies the UML-derived test objectives.
Microsoft Office 2003 Resource Kit
Venue:  (2003)

The definitive reference for deploying and supporting Microsoft Office 2003 Editions straight from the source. Get detailed technical guidance plus essential tools on CD, all designed to help save time and reduce ownership and support costs. 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
Holistic Object-Oriented Modelling of Distributed Automotive Real-Time Control Applications
Authors: Jakob Axelsson
Venue: Proceedings of the 2nd IEEE International Symposium on Object-Oriented Real-Time Distributed Computing (1999)

The automotive industry has been late in introducing object-oriented (OO) analysis, design, and programming, compared to many other businesses. This is partly due to the fact that OO programming has been considered too expensive in terms of computational resources, but also because there are elements in the application functions for which OO methods do not give sufficient support. Nevertheless, OO techniques provide many advantages, and in this paper we discuss how they can be used for automotive real-time control applications. The suggested approach is holistic in the following respects: it treats functionality on the vehicle level rather than on individual control units; it includes both the embedded system and its environment; and it considers both hardware and software.
On efficient fixed-parameter algorithms for weighted vertex cover
Authors: Rolf Niedermeier, Peter Rossmanith
Venue: Journal of Algorithms (2003)

We investigate the fixed-parameter complexity of WEIGHTED VERTEX COVER. Given a graph G = (V, E), a weight function ω: V → R+, and k ∈ R+, WEIGHTED VERTEX COVER (WVC for short) asks for a vertex subset C ⊆ V of total weight at most k such that every edge of G has at least one endpoint in C. WVC and its natural variants are NP-complete. We observe that, when restricting the range of ω to positive integers, the so-called INTEGER-WVC can be solved as fast as unweighted VERTEX COVER. Our main result is that if the range of ω is restricted to positive reals ≥ 1, then so-called REAL-WVC can be solved in time O(1.3954k + k|V|). By way of contrast, unless P = NP, the problem is not fixed-parameter tractable if arbitrary weights > 0 are allowed. Using dynamic programming, at the expense of exponential memory use, we can improve the running time of REALWVC to O(1.3788k + k|V|). The same technique applied to a known algorithm yields the so far fastest algorithm for unweighted VERTEX COVER, running in time O(1.2832kk + k|V|).
A Simplified Technique for Hidded-Line Elimination in Terrains
Authors: Franco P. Preparata, Jeffrey S Vitter
Venue:  (1992)

In this paper we give a practical and efficient output-sensitive algorithm for constructing the display of a polyhedral terrain. It runs in $O((d + n) log^2 n)$ time and uses $O(n alpha(n))$ space, where $d$ is the size of the final display, and $alpha(n)$ is a (very slowly growing) functional inverse of Ackermann''s function. Our implementation is especially simple and practical, because we try to take full advantage of the specific geometrical properties of the terrain. The asymptotic speed of our algorithm has been improved upon theoretically by other authors, but at the cost of higher space usage and/or high overhead and complicated code. Our main data structure maintains an implicit representation of the convex hull of a set of points that can be dynamically updated in $O(log^2 n)$ time. It is especially simple and fast in our application since no rebalancing operations are required in the tree.
Tomorrow''s Digital Hardware will be Asynchronous and Verified
Authors: Alain J. Martin
Venue:  (1993)

Encouraged by the results of almost a decade of research and experimentation, we claim that tomorrow''s design methods for digital VLSI will be based on a concurrent programming approach to high-level synthesis, asynchronous techniques, and correctness-preserving program transformations.
The Diogenes Design Methodology: Toward Automatic Physical Layout
Authors: L A Rosenberg
Venue:  (1986)

The DIOGENES methodology produces designs for fault-tolerant VLSI processor arrays in two stages: First, the desired array is viewed as an undirected graph and is {\em embedded in a book}; this stage has been well studied. Then, the book embedding is converted to an efficient fault-tolerant layout of the array; this stage is the topic of the current paper. We describe here three projects aimed at (semi-) automatically producing efficient fault-tolerant DIOGENES layouts from given book embeddings. The first project seeks algorithms that optimally (relative to the maximum-delay cost measure and an average-delay cost measure) assign the $m$ vertices of the embedded graph to the $n$ fault-free processors (PEs) that have been fabricated. The second project studies the effect of the physical layout format of the PEs on the run-time efficiency of the final array. The third project seeks algorithms for producing logic designs of the configuration network automatically from the given book embedding. We give an overview of all three projects here, as well as a detailed report on the first project, which has been completed. This first project has produced algorithms that concentrate on different cost measures and/or make different assumptions about the structure of the array or the physical layout format of the PEs. The run-times of the algorithms range from $T(m,n)~=~0(m \cdot (n-m) ^ 2 )$ for the most general algorithms to $T(m,n)~=~0(MAX \{ m,n-m \} \cdot log MIN \{ m,n-m \} )$ for an algorithm that makes assumptions about both array structure and physical format.
Deciding in Partitionable Networks
Authors: Roy Friedman, Idit Keidar, Dalia Malki, Ken Birman, Danny Dolev
Venue:  (1995)

Motivated by Chandra and Toueg''s work, we study decision protocols in a model that closely approximates ``real'''' distributed systems. Our results show how the weakest failure detector and associated consensus algorithm can be adapted to a network in which omission failures can occur during periods when processes suspect one-another as faulty. For protocols in which a majority subset of the participants can reach decisions on behalf of the system as a whole, we also characterize a series of stages that necessarily arise during execution. Jointly, these findings establish a direct relationship between an extended version of the three-phase commit protocol, which makes progress even when a traditional three-phase commit would block, and the consensus protocol of Chandra and Toueg. Although we do not explore the linkage here, our results should also be applicable to other agreement protocols for systems of this sort, such as leader election and dynamic group membership.