ppxscal/embedding_network huggingface dataset:
Developing J2EE Applications with IBM WebSphere Studio
Authors: Jay Smith, Howard Kushner, David Rizor
Venue:  (2003)

:To succeed in today's challenging business environment, companies need software developers who can implement integrated enterprise-wide applications and satisfy the demands of customers whose needs continue to evolve. Not only can you become that enterprise developer, but you can also be certified by IBM in the greatest technology available to provide those solutions. Developed in cooperation with the team that created the exam, this book is the only certification study guide endorsed and recommended by IBM for test 287. It is designed to prepare you to fulfill the role of IBM Certified Enterprise Developer, supporting the jCert Enterprise Developer Job Role, which represents the highest level of Web and enterprise development. Howard Kushner has assembled a team of WebSphere experts from around the world. These experts have gathered and presented in this book a wealth of information you need to become certified. All of the contributors are experienced WebSphere developers and instructors with excellent track records of developing and delivering high quality education and superior products to WebSphere students and users. Stay abreast of the latest standards and tooling. This book examines the most recent version of J2EE (Version 1.3) and shows you how to take advantage of the rich set of features and functionality included in the WebSphere platform. It will guide you through the myriad of views and perspectives as well as the J2EE roles. With this information, you can build, test, assemble, and deploy enterprise applications the WebSphere way. In response to increasing scrutiny of enterprise application performance and the overwhelming demand for performance analysis, expanded coverage on application profiling and performance tuning is included. In addition, the book includes chapters on J2EE security and the J2EE Connection Architecture (JCA) for connecting to heterogeneous Enterprise Information Systems. By taking a logical progression throughout the book, the authors skillfully combine theory with examples to teach you the best practices in developing, testing, assembling, deploying, and managing enterprise applications. Later chapters build on and incorporate the principles presented earlier, so your understanding increases as you continue. A Test Yourself section at the end of each chapter helps you measure your progress and keeps you on track. The study guide provides authoritative coverage on all certification topics. This book is the equivalent of weeks of classroom training that would cost thousands of dollars and is just what you need to prepare for exam 287.
HCO-TERNARY: a FORTRAN code for calculating P-V-T-X properties and liquid vapor equilibria of fluids in the system H2O-CO2-CH4
Authors: David Nieva, Rosa María Barragán
Venue: Computers Geosciences (2003)

The equation of state (EOS) for the system H2O-CO2-CH4 was programmed in a FORTRAN code which allows for its utilization in several modes. In one mode, specifically designed for mathematical modeling of two-phase, two-component flow, the code accepts as independent variables (1) pressure and (2) the composition of the gas phase. Other modes allow for the calculation of phase equilibria and/or the molar volumes of H2O and binary mixtures, with pressure and temperature as the input variables (just pressure in the case of H2O). Another mode is used to calculate phase equilibria for ternary mixtures, with pressure, temperature and the mole fraction of water in the gas phase as input variables. The algorithms for automatic convergence utilized in each mode are described.The code was tested extensively against experimental data from the literature. Some of these data were applied in the development of the EOS, and others were published subsequently. Analyses of the performance of the code and EOS for the modes described above, in the range 50-1000°C, 0-1000bar, are presented. P-T-X regions of best applicability of the code and EOS are also identified.
The Aircraft Sequencing Problem
Authors: Torsten Fahle, Rainer Feldmann, Silvia Götz, Sven Grothklags, Burkhard Monien
Venue: Computer Science in Perspective: Essays Dedicated to Thomas Ottmann (2003)

In this paper we present different exact and heuristic optimization methods for scheduling planes which want to land (and start) at an airport-the Aircraft Sequencing Problem (ASP). We compare two known integer programming formulations with four new exact and heuristic solution methods regarding quality, speed and flexibility.
Tailoring Systems Engineering Processes for Integration of Research and Prototyping Activities
Authors: Andrew Tokmakoff, Alex Farkas, Sam Mosel
Venue: Proceedings of the 4th IEEE International Symposium and Forum on Software Engineering Standards (1999)

Many engineering processes exist in text books and industry or international standards. In practice, these processes are rarely recognised consistently and literally; typically, the engineering process is customised, tf not completely reworked, based on the circumstances and requirements of individual projects. One feature commonly lacking from many engineering processes is the formal capacity to develop prototypes in the early stages of a project. This task is useful for the purposes of generating customer feedback or for identibing, examining or mitigating risks that may be associated with a product, especially where the product concept is novel or not fully understood. This paper examines the engineering process employed on a project with which the authors were involved, and provides sufficient formal scope for research and prototyping activities in the engineering and development process.
Design and Development Assessment
Authors: Steven L. Cornford, Martin S. Feather, John C. Kelly, Timothy W. Larson, Burton Sigal, James D. Kiper
Venue: Proceedings of the 10th International Workshop on Software Specification and Design (2000)

An assessment methodology is described and illustrated. This methodology separates assessment into the following phases (1) Elicitation of requirements; (2) Elicitation of failure modes and their impact (risk of loss of requirements); (3) Elicitation of failure mode mitigations and their effectiveness (degree of reduction of failure modes); (4) Calculation of outstanding risk considering the mitigations. This methodology, with accompanying tool support, has been applied to assist in planning the engineering development of advanced technologies. Design assessment featured prominently in these applications. The overall approach is also applicable to development assessment (of the development process to be followed to implement the design). Both design and development assessments are demonstrated on hypothetical scenarios based on the workshop's TRMCS case study. TRMCS information has been entered into the assessment support tool, and serves as illustration throughout.
Finding Your Roots Online
Authors: Nancy L. Hendrickson
Venue:  (2003)

:The Internet gives you access to more records, resources and fellow family historians than ever before. Finding Your Roots Online helps you zero in on the information that's both trustworthy and accurate. You'll learn where and how to find valuable genealogical information, ensure its reliability, and use it to take your research in surprising new directions. Nancy Hendrickson's structured, easy-to-follow approach covers the basics of sound genealogical research then helps you find your way around the Internet, efficiently and effectively. You'll also find page after page of tips and techniques for organizing your computer research. 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
Role-based access control on the web using LDAP
Authors: Joon S. Park, Gail-Joon Ahn, Ravi Sandhu
Venue: Proceedings of the fifteenth annual working conference on Database and application security (2001)

This paper gives a framework for how to leverage Lightweight Directory Access Protocol (LDAP) to implement Role-based Access Control (RBAC) on the Web in the server-pull architecture. LDAP-based directory services have recently received much attention because they can support object-oriented hierarchies of entries in which we can easily search and modify attributes over TCP/IP. To implement RBAC on the Web, we use an LDAP directory server as a role server that contains users' role information. The role information in the role server is referred to by Web servers for access control purposes through LDAP in a secure manner (over SSL). We provide a comparison of this work to our previous work, RBAC on the Web in the user-pull architecture.
Foundation Swift 3D for Flash MX
Authors: Kris Honeycutt, Kristopher Honeycutt, William McBee, Dave Sharek, Bill Spencer
Venue:  (2002)

:Foundation Swift 3D is the ultimate guide to out of the box 3D design. Combining simple but professional 3D editing techniques with a full guide to using Swift 3D in object construction, animation, enhancement, and production, Foundation Swift 3D also features a chapter on transferring your projects into Flash MX. Foundation Swift 3D really does unlock the power of 3D on your desktop. It covers all you need to know, before you need to know it, backing up every piece of theory with solid practical tutorials. With a case study running the length of the book and organized so you get practical, hands-on experience of everything that you learn, this book will bring you all that this new, and unparalleled version of Swift 3D has to offer. Developed in association with Electric Rain, the makers of Swift 3D, Foundation Swift 3D contains all the insider information, tips, tricks, and techniques that you would expect from a book written and reviewed by Swift 3D v3's Support Manager, Documentation Writer, beta testers and developers, and moderators of support forums. Whether you're entirely new to Swift 3D v3, have some experience of an earlier version, or have used v3 extensively, this book is packed with essential information from the true luminaries of the Swift 3D world that will extend your knowledge to true professional level. With Foundation Swift 3D, your world is just a few chapters away!
On Planning: What is to be Done?
Authors: Bruce R Donald
Venue:  (1987)

In this paper, we suggest research directions in domain-independent planning, addressing several open problems. In particular, we present: A modal truth criterion for the planning of overlapping actions with multiple agents. A ``reduction'''' of planning in time to classical planning and a discussion of the relative power of the two methods. A formal framework towards describing planners with partial deductive closure (derived side effects). A discussion of failure analysis, error diagnosis, and recovery in domain-independent planning. An exploration of mathematical models of time (and space) proposed in naive physics. A discussion of the relative difficulty of classical planning, versus planning with a dense model of time.
Low Degree Algorithms for Computing and Checking Gabriel Graphs
Authors: Giuseppe Liotta
Venue:  (1996)

In the context of robust computational geometry we focus on the problem of computing and checking Gabriel graphs with algorithms that are not affected by degenaracies and have low arithmetic demand. A simple and practical linear-time algorithm is presented that constructs the Gabriel Graph of a finite point set on the plane from its Delaunay diagram. The degree of the algorithm, i.e.\ a measure of the arithmetic precision required to carry out exact computations, is evaluated and proved to be optimal. The problem of certifying the correctness of an algorithm that computes the Gabriel graph is also investigated and an otpimal degree procedure is proposed.
Interactive visual exploration for knowledge discovery on the Web
Authors: R. Oxman
Venue: Proceedings of the IEEE Conference on Information Visualisation (1997)

Presents a conceptual structure for the organization and representation of textual and visual information on the World Wide Web. A generic conceptual structure is proposed which contributes to new forms of visual navigation and interactivity within large collections of textual and visual data. This can assist in the exploration, discovery and extraction of relevant information. An application of the approach is illustrated in the domain of design which is characterized by large amounts of unstructured and poorly organized information of project descriptions.
Building Voronoi Diagrams for Convex Polygons in Linear Expected Time
Authors: L. P Chew
Venue:  (1990)

Let P be a list of points in the plane such that the points of P taken in order form the vertices of a convex polygon. We introduce a simple, linear expected-time algorithm for finding the Voronoi diagram of the points in P. Unlike previous results on expected-time algorithms for Voronoi diagrams, this method does not require any assumptions about the distribution of points. With minor modifications, this method can be used to design fast algorithms for certain problems involving unrestricted sets of points. For example, fast expected-time algorithms can be designed to delete a point from a Voronoi diagram, to build an order k Voronoi diagram for an arbitrary set of points, and to determine the smallest enclosing circle for points at the vertices of a convex hull.
Proceedings of the 26th annual international ACM SIGIR conference on Research and development in informaion retrieval
Venue: Annual ACM Conference on Research and Development in Information Retrieval (2003)

Welcome to Toronto! We are pleased to host the Annual International ACM SIGIR Conference on its second visit to Canada. The tutorials, keynote speech, papers, posters, demos and workshops to be given over the next five days represent current techniques, challenges, and advances in information retrieval.Since the 8th SIGIR Conference in Montreal, 1985, information retrieval applications have become ubiquitous. It is difficult to imagine using a personal computer, a library, the web, or a peer-to-peer file sharing system without relying on the results of information retrieval research. At the same time it is easy to observe limitations in the tools we use and to imagine how they might be improved. These observations provide the impetus for current and future research.Toronto, Canada's largest city with a population of 2.5 million, is home to virtually all of the world's cultural groups, boasting safe and clean streets, first class entertainment, fine dining, major league sports, parks, and recreation facilities. It may surprise you that Toronto is also a major centre for television and movie production, third in North America after Los Angeles and New York. "Chicago" -winner of six Academy Awards including Best Picture - was filmed here.
Understanding the End-to-End Performance Impact of RED in a Heterogeneous Environment
Authors: Yin Zhang, Lili Qiu
Venue:  (2000)

Random Early Detection (RED) is the recommended active queue management scheme for rapid deployment throughout the Internet. As a result, there have been considerable research efforts in studying the performance of RED. However, previous studies have often focused on relatively homogeneous environment. The effects of RED in a heterogeneous environment are not thoroughly understood. In this paper, we use extensive simulations to explore the interaction between RED and various types of heterogeneity, as well as the impact of such interaction on the user-perceived end-to-end performance. Our results show that overall RED improves performance at least for the types of heterogeneity we have considered.
An Approach to Designing Intelligent Decision-Making Support Systems on the Basis of the Logic-Semiotic Apparatus
Authors: Elena Y. Golovina
Venue: Proceedings of the 2002 IEEE International Conference on Artificial Intelligence Systems (ICAIS'02) (2002)

An approach to designing intelligent decision-making support systems is proposed, and the logic-semiotic apparatus underlying them was described. An example of constructing the control model of a robot is presented. The tools for developing intelligent decision-making support systems are described. 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
Sensitivity Analysis of Reliability and Performability Measures for Multiprocessor Systems
Authors: T J Blake, L A Reibman, S K Trivedi
Venue:  (1987)

Traditional evaluation techniques for multiprocessor systems use Markov chains and Markov reward models to compute measures such as mean time to failure, reliability, performance, and performability. In this paper, we discuss the extension of Markov models to include parametric sensitivity analysis. Using such analysis, we can guide system optimization, identify parts of a system model sensitive to error, and find system reliability and performability bottlenecks. As an example we consider three models of a 16 processor, 16 memory system. A network provides communication between the processors and the memories. Two crossbar-network models and the Omega network are considered. For these models, we examine the sensitivity of the mean time to failure, unreliability, and performability to changes in component failure rates. We use the sensitivities to identify bottlenecks in the three system models.
Composing Approximated Algorithms Based on Hopfield Neural Network for Building a Resource-Bounded Scheduler
Authors: Jean-Michel Gallone, Francois Charpillet
Venue: Proceedings of the 8th International Conference on Tools with Artificial Intelligence (1996)

In previous work, we have studied the Hopfield Artificial Neural Network model and its use for solving a particular scheduling problem: tasks with release times, deadlines and computation times to be scheduled on several uniform machines. We presented an iterative approach based on Hopfield Networks which enables resource-bounded reasoning. We have validated our approach on a great number of randomly generated examples. Results are be tter than an efficient scheduling heuristics when no timing constraint exists and our system is able to adapt its behavior when timing constraints are impo sed by the application. In this paper, we extend this work by studying the incidence of the different kinds of approximations on the processing time and on the success rate, so as to decide what sequence of activations for the contract will be likely to give the best success rate.
MAGNA - A DPE-based Platform for Mobile Agents in Electronic Service Markets
Authors: Sven Krause, Flavio Morais de Assis Silva, Thomas Magedanz, Radu Popescu-Zeletin, Orandi Mina Falsarella, Carlos Raul Arias Mendez
Venue: Proceedings of the 3rd International Symposium on Autonomous Decentralized Systems (1997)

Driven by technological advancements, market growth and deregulation, the global telecommunications environment is rapidly changing its face towards a highly dynamic open environment, where a multitude of competing and/or cooperating service providers offer a steadily growing number of increasingly powerful communication and information services. Due to the number of relevant stake holders, this environment is characterized by great technological and organizational diversity. The need for integration, ubiquitous service access and rapid service provisioning requires an open, universal service platform which supports both, telecommunications and management applications. The development of such a platform based on the concept of distributed processing environments (DPEs) has been a major research area for some time now, and has also yielded important results (e.g. CORBA, TINA). However, since DPEs are based on the centralized client/server paradigm, they are relatively inflexible, and do not adapt well to rapidly changing, or customer-specific requirements. An entirely different platform approach is based on the application of agent technology. Of particular interest are mobile agents, autonomous and thus intelligent software entities, which may roam the network in the course of performing their designated tasks. Due to their inherent autonomy and mobility they offer new opportunities for the provisioning of services in the emerging electronic service markets. The prerequisite for the execution of mobile intelligent agents in distributed service environments is the provision of a distributed agent environment platform. Since both, distributed processing-based and agent-based service provisioning have their specific advantages, such a platform should support both paradigms. This paper provides an overview of the mobile agent architecture MAGNA, and the accompanying agent platform. Both are currently under development by GMD FOKUS in the context of the MAGNA project. The distributed agent environment provided by the MAGNA platform is based on current DPE concepts and technologies. It therefore enables coexistence and integration of distributed and agent-based implementations of telecommunications and management applications.
Numerical Transient Analysis of Markov Models
Authors: Andrew Reibman, Kishor Trivedi
Venue:  (1987)

We consider the numerical evaluation of Markov model transient behavior. Our research is motivated primarily by computer system dependability modeling. Other application areas include finite-capacity queueing models, closed queueing networks, and inventory models. We focus our attention on the general problem of finding the state probability vector of a large, continuous-time, discrete-state Markov chain. Two computational approaches are examined in detail: Uniformization and numerical linear multi-step methods for ordinary differential equation solution. In general, Uniformization provides greater accuracy but deals poorly with stiffness. A special stable ordinary differential equation solver deals well with stiffness, but it provides increased accuracy only at much greater cost. Examples are presented to illustrate the behavior of the techniques discussed as a function of model size, model stiffness, increased accuracy requirements, and mission time.
Complex Preferences for the Integration of Neural Codes
Authors: Christo Panchev, Stefan Wermter
Venue: Proceedings of the IEEE-INNS-ENNS International Joint Conference on Neural Networks (IJCNN'00)-Volume 2 - Volume 2 (2000)

This paper presents a complex preference framework of integrating pulsed neural networks into neural/symbolic hybrid approaches. In particular, we introduce an interpretation of neural codes as multidimensional complex neural preferences and preference classes, which allow the integration of knowledge from different neural and symbolic models. We define some basic operations on complex preferences and preference classes that allow them to be directly integrated in to symbolic models. Furthermore, we show the interpretation of mean firing rate, time-to-first-spike, synchrony and phase codes as complex neural preferences and the interpretation of the operations on preference classes of these codes. T o the best of our knowledge this is the first work that addresses the integration of pulsed neural networks in to hybrid approaches, in particular the symbolic interpretation and simultaneous processing of mean firing rate and pulse coding schemes in a preferences framework.