ppxscal/embedding_network huggingface dataset:
A generalized gamma software reliability model
Authors: Hiroyuki Okamura, Mitsuaki Ando, Tadashi Dohi
Venue: Systems and Computers in Japan (2007)

In this paper, the authors propose a generalized software reliability model based on a nonhomogeneous Poisson process (NHPP), on the assumption that software fault discovery times follow a generalized gamma distribution. The proposed model encompasses representative NHPP models developed before now and is also consistent with probabilistic debugging theory based on the concept of generalized order statistics. Furthermore, in this paper, the authors propose a parameter estimation method which combines the EM (Expectation-Maximization) algorithm and a heuristic solution method, as an effective parameter estimation method for the generalized gamma software reliability model. &copy; 2007 Wiley Periodicals, Inc. Syst Comp Jpn, 38(2): 81&ndash;90, 2007; Published online in Wiley InterScience (). DOI 10.1002&sol;scj.20350
Secrets of Videoblogging (Secrets of...)
Authors: Michael Verdi, Ryanne Hodson, Diana Weynand, Shirley Craig
Venue:  (2006)

Here's the perfect introduction to the art of the videoblog, or vlog, whatever your subject. Filled with both technical and creative tips, this fun, fast, full-color guide provides everything you need to get started vlogging. You'll learn: · How to find and keep track of your favorite videoblogs · How to create your own vlog under Windows or Mac OS X · Where to find free vlog-hosting services · Tips on lighting, shooting, sound, and video compression for vlogs · Where to download free, legal music for your vlog · How to build an audience with RSS feeds · And many more insider secrets Vlogging pioneers Michael Verdi and Ryanne Hodson are co-founders of NO DE101, an international network of videoblog classrooms, and FreeVlog.org, NO DE101's online equivalent. Verdi also vlogs at www.michaelverdi.com, while Hodson produces vlogs at http://ryanedit.blogspot.com and http://revlog.blogspot.com. Video training pioneers Diana Weynand and Shirley Craig are co-owners of Weynand Training International, an Apple Authorized Training Center that provides training services to the entertainment industry. They vlog at www.weynand.blogspot.com.
Easy iPod and iTunes (Easy)
Authors: Shelly Brisbin
Venue:  (2006)

Frustrated by the lack of instructions and documentation that came with your new iPod? Don't throw it out the window! Instead, consult Easy iPod and iTunes, a full-color, visually oriented book that covers iPod and iTunes usage from the beginner's point of view. With step-by-step instructions and visual elements on every page, you will go from opening the iPod box and installing its software, to ripping music in iTunes, syncing with the iPod and beyond. You will learn to work with music files, podcasts, audio books and Internet radio, and you'll discover the iTunes Music Store and how it works with iTunes and iPod. As long as you have a current model iPod (including the new Nano and video models), this book will work 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
Polymorphic higher-order recursive path orderings
Authors: Jean-Pierre Jouannaud, Albert Rubio
Venue: Journal of the ACM (JACM) (2007)

This article extends the termination proof techniques based on reduction orderings to a higher-order setting, by defining a family of recursive path orderings for terms of a typed lambda-calculus generated by a signature of polymorphic higher-order function symbols. These relations can be generated from two given well-founded orderings, on the function symbols and on the type constructors. The obtained orderings on terms are well founded, monotonic, stable under substitution and include &beta;-reductions. They can be used to prove the strong normalization property of higher-order calculi in which constants can be defined by higher-order rewrite rules using first-order pattern matching. For example, the polymorphic version of G&ouml;del's recursor for the natural numbers is easily oriented. And indeed, our ordering is polymorphic, in the sense that a single comparison allows to prove the termination property of all monomorphic instances of a polymorphic rewrite rule. Many nontrivial examples are given that exemplify the expressive power of these orderings. All have been checked by our implementation. This article is an extended and improved version of Jouannaud and Rubio [1999]. Polymorphic algebras have been made more expressive than in our previous framework. The intuitive notion of a polymorphic higher-order ordering has now been made precise. The higher-order recursive path ordering itself has been made much more powerful by replacing the congruence on types used there by an ordering on types satisfying some abstract properties. Besides, using a restriction of Dershowitz's recursive path ordering for comparing types, we can integrate both orderings into a single one operating uniformly on both terms and types.
Animation of open water phenomena with coupled shallow water and free surface simulations
Authors: Nils Thürey, Ulrich Rüde, Marc Stamminger
Venue: Proceedings of the 2006 ACM SIGGRAPH/Eurographics symposium on Computer animation (2006)

The goal of this paper is to perform simulations that capture fluid effects from small drops up to the propagation of large waves. To achieve this, we present a hybrid simulation method, that couples a two-dimensional shallow water simulation with a full three-dimensional free surface fluid simulation. We explain the approximations imposed by the shallow water model, and how to parametrize it according to the parameters of a 3D simulation. Each simulation is used to initialize double layered boundary conditions for the other one. The area covered by the 2D region can be an order of magnitude larger than the 3D region without significantly effecting the overall computation time. The 3D region can furthermore be easily moved within the 2D region during the course of the simulation. To achieve realistic results we combine our simulation method with a physically based model to generate and animate drops. For their generation we make use of the fluid turbulence model, and animate them with a simplified drag calculation. This allows simulations with relatively low resolutions.
IBM System P5 Approaches to 24x7 Availability Including Aix 5l (IBM Redbooks)
Venue:  (2006)

This IBM Redbook focuses on the technology, serviceability, and features that are used by the IBM eServer p5 and IBM System p5 servers, which allow you to make your server one of the most reliable and available parts of your IT infrastructure. This redbook explains how the server availability can be improved by: - Proper planning of the server environment and configuration - Understanding the role of the service processors and firmware components, and how they can be best configured and managed -Using high availability and redundancy features provided by the AIX 5L operating system and the Virtual IO server This redbook contains many detailed examples and step-by-step scenarios of usual server operation and maintenance tasks, such as the setup of redundant HMC and service processors, firmware upgrades, hot-addition of RIO drawers, or configuration of redundant Virtual IO servers. This redbook is intended for architects, specialists, and system administrators who are responsible for planning or developing an availability strategy for IBM System p servers. 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
Equilibria of a class of transport equations arising in congestion control
Authors: Francois Baccelli, Ki Baek Kim, David R. Mcdonald
Venue: Queueing Systems: Theory and Applications (2007)

This paper studies a class of transport equations arising from stochastic models in congestion control. This class contains two cases of loss models as particular cases: the rate-independent case where the packet loss rate is independent of the throughput of the flow and the rate-dependent case where it depends on it. This class of equations covers both the case of persistent and of non-persistent flows. For the first time, we give a direct proof of the fact that there is a unique density solving the associated differential equation. This density and its mean value are provided as closed form expressions.
Skeletonization based on error reduction
Authors: Paul Morrison, Ju Jia Zou
Venue: Pattern Recognition (2006)

The accuracy of a non-pixel-based skeletonization method is largely dependent on the contour information chosen as input. When using a Constrained Delaunay Triangulation to construct an object's skeleton, a number of contour pixels must be chosen as a basis for triangulation. This paper presents a new method of selecting these contour pixels. A new method for measuring skeletonization error is proposed, which quantifies the deviation of a skeleton segment from the true medial axis of a stroke in an image. The goal of the proposed algorithm is to reduce this error to an acceptable level, whilst retaining the superior efficiencies of previous non-pixel-based techniques. Experimental results show that the proposed method is adept at following the medial axis of an image, and is capable of producing a skeleton that is confirmed by a human's perception of the image. It is also computationally efficient and robust against noise.
From computer geometry to manufacturing algorithms
Authors: Elaine Cohen
Venue: Proceedings of the ninth ACM symposium on Solid modeling and applications (2004)

Abstractly, machining a shape is rather a simple task, that is, one is merely asked to subtractively metamorphose a superset of stock material into the ultimate shape of a given geometric model. In practice, however, there are a multitude of technical considerations that make automating this process rather a formidable and generally unsolved problem. This presentation will discuss some of the practical and technical considerations of machining a desired shape from a block of stock material. When a realistic cost function is introduced where literally &Scedil;time is money, T formulating a winning strategy for efficiently eliminating material while optimizing cutter path times as well as automatic tool changes becomes a complex matter involving much mathematical richness. Just as computer architecture affects computing complexity analysis, so machine tool architecture can significantly alter the cost functions and corresponding strategies of various manufacturing algorithms. Finally, the quality of the desired finish, the closeness of the approximation, as it were, has a major influence on what strategies emerge as superior. Further, new technologies are changing the fundamental cost functions so that new strategies are called for. Many examples and some video will be presented to illustrate the issues, especially in cases that may not be intuitive to the uninitiated. No prior manufacturing experience will be assumed for this talk.
Grid enabled sequential design and adaptive metamodeling
Authors: Wouter Hendrickx, Dirk Gorissen, Tom Dhaene
Venue: Proceedings of the 38th conference on Winter simulation (2006)

Metamodeling is emerging as a valuable new tool in simulation: complex computer codes can be approximated by surrogate models (analytic, neural network, SVM, etc.) which can easily be evaluated on-the-fly. Adaptive modeling and sequential design further improve the performance of metamodeling frameworks. Grid computing quickly replaces regular cluster computing when it comes to complex calculations. Several efforts use grid computing to facilitate the exploration of simulator outputs. This contribution combines adaptive modeling and sequential design with distributed, grid-based techniques into one metamodeling framework.
Microsoft Expression Web On Demand
Authors: Steve Johnson
Venue:  (2007)

<>Microsoft® Expression®Web On DemandFOR THOSE WHO WOULD RATHER BE SHOWN HOW THAN TOLD HOWSEE HOW TO· Create Web sites using drag and drop controls· Employ Cascading Style Sheets formatting and management· Create Cascading Style Sheet layouts· Create a page design using layout tables· Create page transition effects and background sounds· Add interactive buttons and create hyperlinks· Create dynamic Web templates to reuse· Create forms to gather online information· Write, edit, and optimize code and scripts· Use IntelliSense to help reduce coding errors· Retrieve and present data from live RSS feeds· Integrate data from databases or XML data· Create dynamic Web content using ASP.NET technologyOn the WebThis book uses real world examples to give you a context in which to use the task. This book also includes workshops to help you put together individual tasks into projects. The Expression Web example files that you need for project tasks are available at www.perspection.comPerspection has written more than thirty-five books on a variety of computer software, including Microsoft Office 2007 and XP, Microsoft Windows Vista and XP, Apple Mac OS X Panther, Adobe Photoshop CS2, Macromedia Flash 8, Macromedia Director MX, and Macromedia Fireworks. In 1991, after working for Apple Computer and Microsoft, Steve Johnson founded Perspection, Inc. Perspection is committed to providing information and training to help people use software more effectively. Perspection has written more than 80 computer books, and sold more than 5 million copies. Introductionï¾ ï¾ ï¾ ï¾ ï¾ ï¾ ï¾ ï¾ 1ï¾ ï¾ ï¾ ï¾ ï¾ ï¾ ï¾ Getting Started with Expression Webï¾ ï¾ 2ï¾ ï¾ ï¾ ï¾ ï¾ ï¾ ï¾ Creating a Web Siteï¾ ï¾ ï¾ ï¾ ï¾ ï¾ ï¾ ï¾ ï¾ ï¾ ï¾ ï¾ ï¾ ï¾ ï¾ 3ï¾ ï¾ ï¾ ï¾ ï¾ ï¾ ï¾ Working with Web Pagesï¾ ï¾ ï¾ ï¾ ï¾ ï¾ ï¾ ï¾ ï¾ 4ï¾ ï¾ ï¾ ï¾ ï¾ ï¾ ï¾ Working with Web Page Textï¾ ï¾ ï¾ ï¾ ï¾ ï¾ ï¾ ï¾ ï¾ ï¾ ï¾ 5ï¾ ï¾ ï¾ ï¾ ï¾ ï¾ ï¾ Working with Web Page Graphicsï¾ ï¾ ï¾ ï¾ ï¾ ï¾ ï¾ ï¾ ï¾ ï¾ ï¾ ï¾ ï¾ ï¾ ï¾ ï¾ ï¾ 6ï¾ ï¾ ï¾ ï¾ ï¾ ï¾ ï¾ Adding Hyperlinks to Web Pagesï¾ ï¾ ï¾ ï¾ ï¾ ï¾ ï¾ ï¾ ï¾ 7ï¾ ï¾ ï¾ ï¾ ï¾ ï¾ ï¾ Adding Interactive Behaviorsï¾ ï¾ ï¾ ï¾ ï¾ ï¾ ï¾ ï¾ ï¾ ï¾ ï¾ ï¾ ï¾ ï¾ 8ï¾ ï¾ ï¾ ï¾ ï¾ ï¾ ï¾ Adding Tables and Layout Tablesï¾ ï¾ ï¾ ï¾ ï¾ ï¾ ï¾ ï¾ ï¾ ï¾ ï¾ ï¾ ï¾ ï¾ ï¾ ï¾ ï¾ ï¾ 9ï¾ ï¾ ï¾ ï¾ ï¾ ï¾ ï¾ Adding Frames and Bordersï¾ ï¾ ï¾ ï¾ ï¾ ï¾ ï¾ ï¾ ï¾ ï¾ ï¾ ï¾ ï¾ ï¾ ï¾ 10ï¾ ï¾ ï¾ ï¾ ï¾ Gathering User Input Using Formsï¾ ï¾ ï¾ ï¾ ï¾ ï¾ ï¾ ï¾ ï¾ ï¾ ï¾ ï¾ ï¾ ï¾ ï¾ ï¾ 11ï¾ ï¾ ï¾ ï¾ ï¾ Creating Styles and Layouts with CSSï¾ ï¾ ï¾ ï¾ ï¾ ï¾ ï¾ ï¾ ï¾ ï¾ 12ï¾ ï¾ ï¾ ï¾ ï¾ Publishing and Managing a Web Siteï¾ ï¾ ï¾ ï¾ ï¾ ï¾ ï¾ ï¾ ï¾ ï¾ 13ï¾ ï¾ ï¾ ï¾ ï¾ Customizing Expression Webï¾ ï¾ ï¾ ï¾ ï¾ ï¾ ï¾ ï¾ ï¾ ï¾ ï¾ ï¾ ï¾ ï¾ Indexï¾ ï¾ ï¾ ï¾ ï¾ ï¾ ï¾ ï¾ ï¾ ï¾ 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
Efficient generation of secure elliptic curves
Authors: Elisavet Konstantinou, Yannis C. Stamatiou, Christos Zaroliagis
Venue: International Journal of Information Security (2006)

In many cryptographic applications it is necessary to generate elliptic curves (ECs) whose order possesses certain properties. The method that is usually employed for the generation of such ECs is the so-called Complex Multiplication method. This method requires the use of the roots of certain class field polynomials defined on a specific parameter called the discriminant. The most commonly used polynomials are the Hilbert and Weber ones. The former can be used to generate directly the EC, but they are characterized by high computational demands. The latter have usually much lower computational requirements, but they do not directly construct the desired EC. This can be achieved if transformations of their roots to the roots of the corresponding (generated by the same discriminant) Hilbert polynomials are provided. In this paper we present a variant of the Complex Multiplication method that generates ECs of cryptographically strong order. Our variant is based on the computation of Weber polynomials. We present in a simple and unifying manner a complete set of transformations of the roots of a Weber polynomial to the roots of its corresponding Hilbert polynomial for all values of the discriminant. In addition, we prove a theoretical estimate of the precision required for the computation of Weber polynomials for all values of the discriminant. We present an extensive experimental assessment of the computational efficiency of the Hilbert and Weber polynomials along with their precision requirements for various discriminant values and we compare them with the theoretical estimates. We further investigate the time efficiency of the new Complex Multiplication variant under different implementations of a crucial step of the variant. Our results can serve as useful guidelines to potential implementers of EC cryptosystems involving generation of ECs of a desirable order on resource limited hardware devices or in systems operating under strict timing response constraints.
Scalable FPGA/ASIC Implementation Architecture for Parallel Table-Lookup-Coding Using Multi-Ported Content Addressable Memory
Authors: Takeshi Kumaki, Yutaka Kono, Masakatsu Ishizaki, Tetsushi Koide, Hans Jürgen Mattausch
Venue: IEICE - Transactions on Information and Systems (2007)

This paper presents a scalable FPGA/ASIC implementation architecture for high-speed parallel table-lookup-coding using multi-ported content addressable memory, aiming at facilitating effective table-lookup-coding solutions. The multi-ported CAM adopts a Flexible Multi-ported Content Addressable Memory (FMCAM) technology, which represents an effective parallel processing architecture and was previously reported in [1]. To achieve a high-speed parallel table-lookup-coding solution, FMCAM is improved by additional schemes for a single search mode and counting value setting mode, so that it permits fast parallel table-lookup-coding operations. Evaluation results for Huffman encoding within the JPEG application show that a synthesized semi-custom ASIC implementation of the proposed architecture can already reduce the required clock-cycle number by 93% in comparison to a conventional DSP. Furthermore, the performance per area unit, measured in MOPS/mm2, can be improved by a factor of 3.8 in comparison to parallel operated DSPs. Consequently, the proposed architecture is very suitable for FPGA/ASIC implementation, and is a promising solution for small area integrated realization of real-time table-lookup-coding applications.
The challenges of open-world software
Authors: Carlo Ghezzi
Venue: Proceedings of the 6th international workshop on Software and performance (2007)

Software has been evolving from pre-defined, monolithic, centralized architectures to decentralized, distributed, dynamically composed federations of components whose goal is to provide useful services. Software processes have been evolving along similar lines, from pre-specified sequential work- flows to decentralized and multi-organization endeavors. The organizations to which software solutions are targeted have also been evolving from highly structured to agile and networked enterprises. All this is affecting the way software is engineered (i.e., conceived, architected, and produced).Software applications increasingly live in an open world: They are embedded in dynamically evolvable environments and must adapt to continuous and even unpredictable change. Accordingly, software architectures need to evolve dynamically and must support reconfiguration and self-organizing features to respond to change requirements. Programming languages and their underlying support infrastructure, in turn, must provide specific features to support this level of dynamism. The traditional approaches followed to ensure software quality, which focus exclusively on pre-runtime validation, are inadequate in this new context. Continuous validation becomes necessary: validation must extend to after the system is deployed and running.The talk surveys the main architectural styles that support dynamic software compositions, the language and infrastructure requirements, and provides a view of the validation process for dynamically evolvable software systems.
A comparison of two compound critiquing systems
Authors: James Reilly, Jiyong Zhang, Lorraine McGinty, Pearl Pu, Barry Smyth
Venue: Proceedings of the 12th international conference on Intelligent user interfaces (2007)

Compound critiques allow users to simultaneously express directional preferences over several product attributes. Presenting the user with compound critiques is not a new idea. The original Find-Me Systems (e.g., Car Navigator) showed static compound critiques; they didn't change irrespective of user preferences or the product availability. Recently, a number of techniques for dynamically generating compound critiques have been proposed. While these techniques have been evaluated in isolation, to date no direct comparison of these (in terms of their interfacing characteristics and recommendation performance) has been reported. Motivated by this, our research groups have come together to carry out this comparison for the approaches we each take. The user study platform that we have developed facilitates the comparison of various critiquing based recommenders. In this paper we report the first set of results from a comprehensive real-user evaluation of two dynamic compound critique systems using this evaluation platform.
CCNP CIT Exam Certification Guide (CCNP Self-Study, 642-831), Second Edition
Authors: Amir Ranjbar
Venue:  (2003)

Prepare for the new CCNP 642-831 CIT Exam with the official test preparation guide Learn the troubleshooting and support topics for the new Cisco CCNP 642-831 CIT exam with the only official preparation book Practice with more than 200 test questions, including simulation-based questions on the enclosed CD-ROM Prepare for the CCNP CIT exam with proven learning tools from the No. 1 selling Exam Certification Guide Series from Cisco PressCCNP CIT Exam Certification Guide (CCNP Self-Study) is a comprehensive study tool for preparing for the new CCNP 642-831 CIT exam. This book is the second edition of the best-selling preparation title for the CCNP CIT exam from Cisco Press, also authored by Amir Ranjbar.Comprehensive coverage of all exam topics ensures readers will arrive at a complete understanding of what they need to master to succeed on the exam. This book follows a logical organization of the CCNP CIT exam objectives, and is written in a modular, small-chapter format that breaks the elements into easy-to-absorb parts. It also contains the other valuable learning elements of an Exam Certification Guide from Cisco Press that ensure concept comprehension and retention. These include pre- and post-chapter quizzes, foundational review sections, scenario-based exercises, and a CD-ROM testing engine with more than 200 questions, including simulation-based questions like on the actual exam.The organization of this edition has been radically altered to align with the new CIT objectives that focus on troubleshooting methodologies to resolve problems at the Physical, Data Link, Network, Transport, and Application layers of the OSI Model.
Show Me Microsoft FrontPage 2003
Authors: Steve Johnson
Venue:  (2003)

For those who would rather be shown how than told howSee how to: Use FrontPage tools for planning and creating a Web site Use dynamic Web templates to create a professional Web site Include interactive buttons with rollover effects Create customized data views Publish and maintain a Web site Format and enhance Web pages Gather user input with forms Give a Web site a professional look Administer your web site 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