ppxscal/embedding_network huggingface dataset:
A model-driven approach to describe and predict the performance of composite services
Authors: Andrea D'Ambrogio, Paolo Bocciarelli
Venue: Proceedings of the 6th international workshop on Software and performance (2007)

Distributed applications are rapidly converging towards the adoption of a computing paradigm based on service-oriented architectures (SOA), according to which an application results from the composition of a set of services in execution on networked server hosts. In a SOA context, service providers are strategically interested both to describe the performance characteristics of offered services, to better qualify their offer and gain a significant advantage in the global marketplace, and to predict the level of performance that can be offered to service consumers when building composite web services that make use of services managed by various service providers. This paper introduces a model-driven approach for integrating performance prediction into service composition processes carried out by use of BPEL (Business Process Execution Language for Web Services). The proposed approach is founded on P-WSDL (Performance-enabled WSDL), a performance-oriented extension of WSDL, the language for describing the information about service capabilities and invocation mechanisms. P-WSDL is a lightweight WSDL extension for the description of performance characteristics of a web service. The approach is illustrated by use of an example application to a composite web service for travel planning.
A hybrid-Trefftz element containing an elliptic hole
Authors: Manicka Dhanasekar, Jianjun Han, Qinghua Qin
Venue: Finite Elements in Analysis and Design (2006)

Much work on special elements that simplify geometrical modelling of structures containing holes, cracks and/ or inclusions has been reported extensively in the literature. This paper presents a hybrid-Trefftz element containing elliptic hole formulated using Hellinger-Reissner principle by employing trial functions based on the mapping technique and the Cauchy integral method. The element presented in this paper could be regarded as an improved formulation over Piltner [Special finite elements with holes and internal cracks, Int. J. Numer. Methods Eng 21 (1985) 1471-1485] element because the chosen trail functions in this paper have provided relatively more stable solutions. The use of the element with other ordinary displacement-based finite elements has also yielded very accurate solutions even when very coarse meshes relative to the size of the elliptic hole have been used.
Oracle E-Business Suite Security, 1 edition
Authors: John Abel
Venue:  (2006)

Implement and Maintain Rock-Solid Security for Oracle E-Business SuiteSecure Oracle E-Business Suite within organizations and across the Internet using the in-depth guidance of this comprehensive volume. Oracle E-Business Suite Security covers everything from key infrastructure, technical, and functional information to cutting-edge auditing, cryptography, and VPD techniques. Real-world scenarios and insightful tips throughout illustrate how to hacker-proof, audit, and troubleshoot your system. Plus, you'll get critical information on international regulatory standards, access to online code, and a blueprint of deployment topology. Table of contentsChapter 1: Security Fundamentals for Oracle E-Business SuiteChapter 2: Oracle E-Business Suite Security InfrastructureChapter 3: Securing Oracle E-Business Suite Technical ComponentsChapter 4: Securing Oracle E-Business Suite Functional ComponentsChapter 5: Oracle 10g with Oracle E-Business SuiteChapter 6: Administration and MonitoringChapter 7: Deployment of Oracle E-Business SuiteAPPENDIX A: ORACLE E-BUSINESS SUITE SECURITY FEATURESINDEX 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
Rapid and brief communication: Face recognition based on 2D Fisherface approach
Authors: Xiao-Yuan Jing, Hau-San Wong, David Zhang
Venue: Pattern Recognition (2006)

Two-dimensional (2D) discrimination analysis using methods such as 2D PCA and Image LDA is of interest in face recognition because it extracts discriminative features faster than one-dimensional (1D) discrimination analysis. However, existing 2D methods generally use more discriminative features and take longer to test than 1D methods. 2D PCA in particular cannot make full use of the Fisher discriminant criterion. Image LDA also has drawbacks in that it cannot perform 2D principal component analysis and discards components with poor discriminative capabilities. In addition, existing 2D methods cannot provide an automatic strategy to choose 2D principal components or discriminant vectors. In this paper, we propose 2D Fisherface, a novel discrimination approach that combines the two-stage ''PCA+LDA'' strategy and 2D discrimination techniques. It can extract face discriminative features by automatically selecting two-dimensional principal components and discriminant vectors. Using the AR database as the test data, it is shown that the proposed approach is faster and more effective than several representative 1D and 2D discrimination methods.
Stack splitting: a technique for efficient exploitation of search parallelism on share-nothing platforms
Authors: Enrico Pontelli, Karen Villaverde, Hai-Feng Guo, Gopal Gupta
Venue: Journal of Parallel and Distributed Computing (2006)

We study the problem of exploiting parallelism from search-based AI systems on share-nothing platforms, i.e., platforms where different machines do not have access to any form of shared memory. We propose a novel environment representation technique, called stack-splitting, which is a modification of the well-known stack-copying technique, that enables the efficient exploitation of or-parallelism from AI systems on distributed-memory machines. Stack-splitting, coupled with appropriate scheduling strategies, leads to reduced communication during distributed execution and effective distribution of larger grain-sized work to processors. The novel technique can also be implemented on shared-memory machines and it is quite competitive. In this paper we present a distributed implementation of or-parallelism based on stack-splitting including results. Our results suggest that stack-splitting is an effective technique for obtaining high performance parallel AI systems on shared-memory as well as distributed-memory multiprocessors.
Supply-chain simulation and analysis of petroleum refinery systems: a reusable template with incremental approach
Authors: Luiz Augusto G. Franzese, Marcelo Moretti Fioroni, Daniel Pablo Paz, Rui Carlos Botter, Carlos Alberto Gratti, Alberto Omar Martinez, Carlos Maria Bacigalupo
Venue: Proceedings of the 38th conference on Winter simulation (2006)

Simulation technology has been successfully applied in Supply Chain studies, mostly to assist onetime decisions, and rarely in recurrent situations. Several authors have chosen traditional approaches like developing simulators or developing templates for better modeling, facing pitfalls like lack or excess of detail, lack of flexibility of tools, how to continue to evolve models in a dynamic environment etc. This work addresses application of a systems approach to better describe and model complex processes. We also demonstrate how a combined approach of templates and simulators, described as incremental modeling, was used to create a refinery simulation toolset, and present results of an application at Petrobras Energia.
A question of semantics
Authors: Peter J. Denning
Venue: ACM SIGARCH Computer Architecture News (1978)

I have been following with some interest the "controversy" over stack architecture of computers. Jack Lipovski [CAN, February 1978] countered Forest Baskett's suggestion [CAN, December 1977] that register machines are the wave of the future. J. Keedy [CAN, February 1978] argues against G. Myers case against [CAN, August 1977].
Sets of permutaions that generate the symmetric group pairwise
Authors: Simon R. Blackburn
Venue: Journal of Combinatorial Theory Series A (2006)

The paper contains proofs of the following results. For all sufficiently large odd integers n, there exists a set of 2n-1 permutations that pairwise generate the symmetric group Sn. There is no set of 2n-1 + 1 permutations having this property. For all sufficiently large integers n with n ≡ 2 mod 4, there exists a set of 2n-2 even permutations that pairwise generate the alternating group An. There is no set of 2n-2 + 1 permutations having this property.
Gene subset selection in kernel-induced feature space
Authors: Satoshi Niijima, Satoru Kuhara
Venue: Pattern Recognition Letters (2006)

This paper proposes a new filter approach to gene subset selection for kernel-based classifiers. We derive kernel forms of several well-known class separability criteria, and gene subset selection based on the kernelized criteria is applied to microarray cancer classification problems. The performance of our proposed strategy is compared in experiments with those of the conventional filter approach as well as gene ranking methods.
Algorithms for dynamic multicast key distribution
Authors: Justin Goshi, Richard E. Ladner
Venue: Journal of Experimental Algorithmics (JEA) (2007)

We study the problem of multicast key distribution for group security. Secure group communication systems typically rely on a group key, which is a secret shared among the members of the group. This key is used to provide privacy by encrypting all group communications. Because groups can be large and highly dynamic, it becomes necessary to change the group key in a scalable and secure fashion when members join and leave the group. We present a series of algorithms for solving this problem based on key trees. The algorithms attempt to minimize the worst-case communication cost of updates by maintaining balanced key tree structures. We focus on the trade-off between the communication cost because of the structure of the tree and that due to the overhead of restructuring the tree to maintain its balanced structure. The algorithms are analyzed for worst-case tree structure bounds and evaluated empirically via simulations.
CWSP Certified Wireless Security Professional Official Study Guide (Exam PW0-200), Second Edition, 2 edition
Authors: Tom Carpenter, Grant Moerschel, Richard Dreger
Venue:  (2006)

The ONLY official study guide for the industry-standard wireless security certification exam Cowritten by the creators of the exam and leading experts in wireless security, CWSP Certified Wireless Security Professional Official Study Guide, Second Edition, offers complete coverage of all the objectives for the vendor-neutral wireless network certification that focuses on the technologies behind the brands. The fully integrated study system includes notes that reinforce and teach practical skills, step-by-step exercises, chapter self-tests, and more than 150 practice exam questions. Table of contentsChapter 1: Wireless LAN Auditing ToolsChapter 2: Gathering InformationChapter 3: Unauthorized AccessChapter 4: Denial of ServiceChapter 5: Legal IssuesChapter 6: General Security PolicyChapter 7: Functional Policy: Guidelines & BaselinesChapter 8: Functional Policy: Design & ImplementationChapter 9: Functional Policy: Physical Security & Social EngineeringChapter 10: Securing the EnterpriseChapter 11: AuthenticationChapter 12: Authentication Framework ComponentsChapter 13: EncryptionChapter 14: WEP & WPAChapter 15: IEEE 802.11iChapter 16: Encrypting Wireless Data with VPN TechnologiesChapter 17: Wireless Monitoring and ProtectionChapter 18: Centralized WLAN Architecture: WLAN SwitchesGLOSSARYINDEX
A new approach for parallel steady-state simulations
Authors: Ming-hua Hsieh
Venue: Proceedings of the 38th conference on Winter simulation (2006)

We propose a new procedure for building confidence interval estimators of steady-state parameters in discrete event simulations. The procedure uses parallel processors to generate independent replications and constructs the confidence interval estimator by solving a generalized least square problem. The most appealing theoretical feature of the proposed procedure is that the precision of the resulted estimator can be improved by simply increasing the number of processors (or independent replications) while the simulated time length is fixed on an appropriate level on each processor. Experiments conducted on M/M/1 queue waiting time processes in heavy traffic confirm this theoretical property.
Sams Teach Yourself Office Productivity All in One
Authors: Greg Perry
Venue:  (2003)

Find all the answers to a Microsoft Office userï¾¿s questions in one big, easy-to-use book. Sams Teach Yourself Office Productivity All in One is designed to teach the new computer user how to get the most out of an Office productivity suite. It does not assume the reader wants to learn how to use just one product, but covers multiple products and technologies together in a logical fashion. Topics covered include: Word Letters and Documents, Excel Spreadsheets, PowerPoint Presentations, Outlook Email, FrontPage Web Sites, and Personal Finance. If you are a beginning Office user who wants to buy one, single book to help you better use your computer and accomplish a broad range of computer activities Sams Teach Yourself Office Productivity All in One is the book for you! 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
Specifying and Implementing Constraints in GIS--with Examples from a Geo-Virtual Reality System
Authors: Jildou Louwsma, Sisi Zlatanova, Ron Lammeren, Peter Oosterom
Venue: Geoinformatica (2006)

Constraints are important elements of every modelling process, but until now they have been treated in an ad hoc manner, depending on the specific application domain and the capabilities of the tools used. In GIS and GeoVR applications, constraints are conditions which always have to be valid (true) within the model populated with real geographic object instances. This paper argues that constraints should form a systematic part of the object class definition, similar to other aspects of the definition, viz. attributes, methods and relationships. Also, the implementation of constraints in all GIS and GeoVR subsystems (at front-end, database and exchange (I/O) level) should be derived automatically from the constraints specified by the framework. The paper therefore puts forward a framework for modelling constraints comprising (1) a classification and clarification of constraints, (2) a formal description using the unified modelling language/object constraint language (UML/OCL) and (3) implementation characteristics. The components of the framework are illustrated and applied to SALIX-2, a geo-virtual reality (GeoVR) landscape modelling system.
Rapid and brief communication: Null Foley-Sammon transform
Authors: Yue-Fei Guo, Lide Wu, Hong Lu, Zhe Feng, Xiangyang Xue
Venue: Pattern Recognition (2006)

In this paper, an important conclusion for linear discriminant analysis is proved: in the case of the small sample size, (number-of-classes-1) null projection directions (NPDs) do exist, on which, the within-class distance equals zero and the between-class distance is positive. The Null Foley-Sammon Transform (NFST), which is constituted by NPDs, is also proposed. Its effectiveness is evidenced by experiments on face recognition.
A model-driven approach to performability analysis of dynamically reconfigurable component-based systems
Authors: Vincenzo Grassi, Raffaela Mirandola, Antonino Sabetta
Venue: Proceedings of the 6th international workshop on Software and performance (2007)

Dynamic reconfiguration techniques appear promising to build component-based (C-B) systems for application domains that have strong adaptability requirements, like the mobile and the service-oriented computing domains. However, introducing dynamic reconfiguration features into a C-B application makes even more challenging the design and verification of functional and non functional requirements. Our goal is to support the model-based analysis of the effectiveness of reconfigurable C-B applications, with a focus on the assessment of the non-functional performance and reliability attributes. As a first step towards this end, we address the issue of selecting suitable analysis models for reconfigurable systems, suggesting to this end the use of joint performance and reliability (performability) models. Furthermore, we propose a model-driven approach to automatically transform a design model into an analysis model. For this purpose, we build on the existence of intermediate languages that have been proposed to facilitate this transformation and we extend one of them, to capture the core features (from a performance/reliability viewpoint) of a dynamically reconfigurable C-B system. Finally, we illustrate by a simple application example the main steps of the proposed approach.
Selecting Weapon System Using Relative Distance Metric Method
Authors: Jing-Rong Chang, Ching-Hsue Cheng, Kuo-Hsiang Teng, Chen-Yi Kuo
Venue: Soft Computing - A Fusion of Foundations, Methodologies and Applications (2007)

This paper proposes a new fuzzy ranking method named relative distance metric method, which can overcome some of the shortcomings for previous ranking methods and select the best alternative in selecting weapon systems. There are two objectives in this paper. Firstly, we propose a new ranking method and compare our method with other methods by many examples. The second objective is applying the proposed method to rank the best self-propelled Howitzers and main battle tanks.
Apple Pro Training Series: Soundtrack Pro (Apple Pro Training)
Authors: Mary Plummer
Venue:  (2005)

Soundtrack Pro, Apple's exciting sound design software, is the newest member of the Final Cut Pro Studio digital video suite-And whether you're musically impaired or musically gifted, the Soundtrack Pro guide will help you get up to speed quickly. In this Apple-certified book/DVD combo, readers will find a complete, self-paced course in all aspects of Soundtrack Pro. Author Mary Plummer guides you through the secrets of editing, repairing, mixing, and arranging multi-track audio files, as well as how to create original soundtracks, score to video, add effects, and more. Step-by-step exercises and lesson files will have readers taking advantage of Soundtrack's thousands of audio loops to create perfectly synched scores in no time. Also included are dozens of advanced sound editing tips for professional users who want to take their video, DVD, and Web projects to the next level. 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
Performance evaluation of spectral procedures for simulation analysis
Authors: Emily K. Lada, James R. Wilson
Venue: Proceedings of the 38th conference on Winter simulation (2006)

We summarize an experimental performance evaluation of WASSP and the Heidelberger-Welch (HW) algorithm, two sequential spectral procedures for steady-state simulation analysis. Both procedures approximate the log-smoothed-periodogram of the batch means after suitable data-truncation to eliminate the effects of initialization bias, finally delivering a confidence-interval estimator for the mean response that satisfies user-specified half-length and coverage-probability requirements. HW uses a Cram&eacute;r-von Mises test for initialization bias based on the method of standardized time series; and then HW fits a quadratic polynomial to the batch-means log-spectrum. In contrast WASSP uses the von Neumann randomness test and the Shapiro-Wilk normality test to obtain an approximately stationary Gaussian batch-means process whose log-spectrum is approximated via wavelets. Moreover, unlike HW, WASSP estimates the final sample size required to satisfy the user's confidence-interval requirements. Regarding closeness of conformance to both confidence-interval requirements, we found that WASSP outperformed HW in the given test problems.
Parity graph-driven read-once branching programs and an exponential lower bound for integer multiplication
Authors: Beate Bollig, Stephan Waack, Philipp Woelfel
Venue: Theoretical Computer Science (2006)

Branching programs are a well-established computation model for Boolean functions, especially read-once branching programs have been studied intensively. Exponential lower bounds for read-once branching programs are known for a long time. On the other hand, the problem of proving superpolynomial lower bounds for parity read-once branching programs is still open. In this paper restricted parity read-once branching programs are considered and an exponential lower bound on the size of the so-called well-structured parity graph-driven read-once branching programs for integer multiplication is proven. This is the first strongly exponential lower bound on the size of a parity nonoblivious read-once branching program model for an explicitly defined Boolean function. In addition, more insight into the structure of integer multiplication is yielded.
Automating Microsoft Access with VBA (Business Solutions)
Authors: Mike Gunderloy, Susan Sales Harkins
Venue:  (2004)

Provides a thorough introduction to programming Microsoft Access 2003 using Visual Basic for Applications (VBA). Take advantage of VBA's capabilities with this book's instruction for customizing Access database applications to meet business needs. Developers save money by using VBA instead of building custom database applications from the ground up. Written by an Access MVP, this book teaches readers to use VBA with Microsoft Access to modify the data object model.
A rule-based approach for robust clump splitting
Authors: S. Kumar, S. H. Ong, S. Ranganath, T. C. Ong, F. T. Chew
Venue: Pattern Recognition (2006)

This paper presents a robust rule-based approach for the splitting of binary clumps that are formed by objects of diverse shapes and sizes. First, the deepest boundary pixels, i.e., the concavity pixels in a clump, are detected using a fast and accurate scheme. Next, concavity-based rules are applied to generate the candidate split lines that join pairs of concavity pixels. A figure of merit is used to determine the best split line from the set of candidate lines. Experimental results show that the proposed approach is robust and accurate.
Skype(TM): The Definitive Guide
Authors: Harry Max, Taylor Ray
Venue:  (2006)

Learn how to make free phone calls to more than 75 million people, and dirt-cheap phone calls to practically everyone else, anywhere on Earth! You can do it with Skype. This book will help you get started fast, with any computer: Windows, Mac, Linux, even Pocket PC. Then, take Skype to the limit, with SkypeIn, SkypeOut, instant messaging, secure file transfer, even video calling. Set up and customize Skype in just minutes Take Skype on the road--avoid expensive hotel phones and international calls Transform your PC into a state-of-the-art Skype videophone Troubleshoot Skype connections and audio quality Discover even more ways to save money, simplify life, even build your business!Written by Skype insiders, this is the only official guide to Skype. It's up-to-date, easy-to-use, quick, simple . . . and above all, FUN!Bonus coverage for more experienced users: Skype architecture, security, and advanced configuration.