ppxscal/embedding_network huggingface dataset:
Performance engineering for EA systems in next generation data centresPerformance engineering for EA systems in next generation data centres
Authors: Jerome Rolia, Ludmila Cherkasova, Richard Friedrich
Venue: Proceedings of the 6th international workshop on Software and performance (2007)

Software Performance Engineering (SPE) methods have been in use for over two decades as an approach to manage the risks of developing systems that fail to satisfy their performance requirements. In general, SPE advocates the use of performance oriented design principles to guide design decisions and predictive performance models to assess the performance impact of design alternatives. SPE methods have been used successfully to identify and overcome system design blunders early in the Information Technology (IT) project lifecycle before the blunders are built into a system and become expensive and time consuming to correct. While the methods have been used successfully in some IT project domains, they are not widely applied in the important domain of Enterprise Application (EA) systems. This experience paper considers the reasons for this and explores the role of SPE as new EA platform and data centre technologies become available.We find that many risks traditionally addressed by SPE have been mitigated by the nature of existing EA platforms, the nature of today's IT projects for EA, and an attention to business process modeling. Furthermore, the design and implementation of future EA systems will see some performance risks reduced even further by new EA and IT system management platforms for Next Generation Data Centres. However, we expect that the nature of EA systems to be built is becoming more complex. As a result some familiar performance risks will re-emerge along with new runtime risks. We believe that SPE methods can help to mitigate such risks and describe research challenges that must be addressed to make this a reality.
Voice over IP Fundamentals (2nd Edition) (Fundamentals)
Authors: Jonathan Davidson, James Peters, Manoj Bhatia, Satish Kalidindi, Sudipto Mukherjee
Venue:  (2006)

A systematic approach to understanding the basics of voice over IP Understand the basics of enterprise and public telephony networking, IP networking, and how voice is transported over IP networks Learn the various caveats of converging voice and data networks Examine the basic VoIP signaling protocols (H.323, MGCP/H.248, SIP) and primary legacy voice signaling protocols (ISDN, C7/SS7) Explore how VoIP can run the same applications as the existing telephony system but in a more cost-efficient and scalable manner Delve into such VoIP topics as jitter, latency, packet loss, codecs, QoS tools, and securityVoice over IP (VoIP) has become an important factor in network communications, promising lower operational costs, greater flexibility, and a variety of enhanced applications. To help you understand VoIP networks, Voice over IP Fundamentals provides a thorough introduction to the basics of VoIP.Voice over IP Fundamentals explains how a basic IP telephony infrastructure is built and works today, major concepts concerning voice and data networking, and transmission of voice over data networks. You'll learn how voice is signaled through legacy telephone networks, how IP signaling protocols are used to interoperate with current telephony systems, and how to ensure good voice quality using quality of service (QoS).Even though Voice over IP Fundamentals is written for anyone seeking to understand how to use IP to transport voice, its target audience comprises both voice and data networking professionals. In the past, professionals working in voice and data networking did not have to understand each other's roles. However, in this world of time-division multiplexing (TDM) and IP convergence, it is important to understand how these technologies work together. Voice over IP Fundamentals explains all the details so that voice experts can understand data networking and data experts can understand voice networking.The second edition of this best-selling book includes new chapters on the importance of billing and mediation in a VoIP network, security, and the common types of threats inherent when packet voice environments, public switched telephone networks (PSTN), and VoIP interoperate. It also explains enterprise and service-provider applications and services.ï¾
Re-parameterisation technique in algebraic numerical grid generation via subdivision schemes
Authors: C. Conti, R. Morandi
Venue: Applied Numerical Mathematics (2004)

In this paper we discuss a strategy for reducing the computational cost of a re-parameterisation procedure to be used in algebraic numerical grid generation. The re-parameterisation phase is based on a tensor product transformation following given directions. The free parameters in the tensor product are set by solving the discretization of an elliptic differential system of small size, via an iterative scheme, thus generating a grid conforming to the boundary of a prescribed domain with orthogonal inner grid cells and with almost constant aspect ratio. The bases involved in the tensor product are refinable, i.e., they can be written as linear combination of dilate of translates of their-self. This property allows us to use few iterations of the corresponding subdivision algorithm to produce a good parameter distribution.
Adobe Acrobat 8 Classroom in a Book
Venue:  (2007)

No Acrobat user can afford to miss a beat in his or her production and business task workflow--which makes mastering new versions of key tools like Acrobat a problem. Realizing that the users Acrobat 8 is designed for--creative professionals, business users, and technical and engineering professionals --aren't going to interrupt their work schedules to take a class in the software, Adobe has brought the classroom to them in this handy, comprehensive book. Through a series of self-paced lessons (each of which builds on the last and includes hands-on projects that the reader can create using the files on the CD-ROM), this guide acquaints users with all of Acrobat 8's regular and industrial-strength features for creating, reviewing, editing, commenting on, restructuring, and preflighting PDF files, as well as new features in Acrobat 8: securing private information with new redaction tools; creating dynamic and interactive forms; saving PDF files as Word documents; automatically archiving your Outlook emails to PDF; using newly enhanced reviewing and sharing options, and more. Professional tips and techniques are scattered throughout. 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
Fabrication of a polymeric tapered HARMs array utilizing a low-cost nickel electroplated mold insert
Authors: In-Hyouk Song, Yoonyoung Jin, Pratul K. Ajmera
Venue: Microsystem Technologies (2006)

A simple low-cost technique has been developed to fabricate a mold insert for replicating polymeric tapered high aspect ratio microstructures. A backside exposure technique is used to first obtain a tapered sidewall structure as an electroplating mold in SU-8 photoresist on a glass wafer. Nickel electroplating is utilized to form the mold insert. The lowest average surface roughness of the nickel mold insert on the side that interfaces with the glass wafer during electroplating is measured to be 7.02&#x00a0;nm. A novel technique involving use of titanium putty is introduced here to reduce cost and effort required to fabricate the mold insert. Replication of tapered microstructures in polymeric materials utilizing the fabricated mold insert is demonstrated here in polydimethylsiloxane by a direct molding process and in polymethyl methacrylate by hot embossing. The fabrication details for the mold insert are described. Advantages and disadvantages of the use of titanium putty for achieving superior metal surface finish are given.
Multiuser interior design over the internet
Authors: Yen-Chun Lin, Chen-Chuan Pan, Jhih-En Kuo
Venue: Proceedings of the 38th conference on Winter simulation (2006)

This paper presents a Web-based interior design application named Multiuser Interior Design (MID). We use technologies from virtual reality (VR), the Web, and database to implement MID. It allows users to operate in the VR fashion, interacting with objects in the 3D, virtual space. Users need only a Web browser to view and elaborate designs, examine furniture, place purchase orders, etc. MID contains many useful functions and features Web-based multiuser collaboration. We introduce the user-interface and main functions of MID that users will operate. The technical aspect of MID, including software architecture and underlying technologies, is also presented. MID can be easily modified for other purposes; only information-related portions need modification, and the other portions serve as reusable framework.
A fast finite-state relaxation method for enforcing global constraints on sequence decoding
Authors: Roy W. Tromble, Jason Eisner
Venue: Proceedings of the main conference on Human Language Technology Conference of the North American Chapter of the Association of Computational Linguistics (2006)

We describe finite-state constraint relaxation, a method for applying global constraints, expressed as automata, to sequence model decoding. We present algorithms for both hard constraints and binary soft constraints. On the CoNLL-2004 semantic role labeling task, we report a speedup of at least 16x over a previous method that used integer linear programming.
Blackberry Hacks
Authors: Dave Mabe
Venue:  (2005)

The BlackBerry has become an invaluable tool for those of us who need to stay connected and in the loop. But most people take advantage of only a few features that this marvelous communications device offers. What if you could do much more with your BlackBerry than just web surfing and email? BlackBerry Hacks will enhance your mobile computing with great tips and tricks. You'll learn that the BlackBerry is capable of things you never thought possible, and you'll learn how to make it an even better email and web workhorse: Get the most out of the built-in applications Take control of email with filters, searches, and more Rev up your mobile gaming--whether you're an arcade addict or poker pro Browse the web, chat over IM, and keep up with news and weblogs Work with office documents, spell check your messages, and send faxes Become more secure, lock down your BlackBerry and stash secure information somewhere safe Manage and monitor the BlackBerry Enterprise Server (BES) and Mobile Data System (MDS) Create web sites that look great on a BlackBerry Develop and deploy BlackBerry applications Whether you need to schedule a meeting from a trade show floor, confirm your child's next play date at the park, or just find the show times and secure movie tickets while at dinner, this book helps you use the remarkable BlackBerry to stay in touch and in-the-know--no matter where you are or where you go. 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
Extending WHIRL with background knowledge for improved text classification
Authors: Sarah Zelikovitz, William W. Cohen, Haym Hirsh
Venue: Information Retrieval (2007)

Intelligent use of the many diverse forms of data available on the Internet requires new tools for managing and manipulating heterogeneous forms of information. This paper uses WHIRL, an extension of relational databases that can manipulate textual data using statistical similarity measures developed by the information retrieval community. We show that although WHIRL is designed for more general similarity-based reasoning tasks, it is competitive with mature systems designed explicitly for inductive classification. In particular, WHIRL is well suited for combining different sources of knowledge in the classification process. We show on a diverse set of tasks that the use of appropriate sets of unlabeled background knowledge often decreases error rates, particularly if the number of examples or the size of the strings in the training set is small. This is especially useful when labeling text is a labor-intensive job and when there is a large amount of information available about a particular problem on the World Wide Web.
Multi-user Synchronisation in ad hoc OFDM-based Wireless Personal Area Networks
Authors: Víctor P. Jiménez, Ana García Armada
Venue: Wireless Personal Communications: An International Journal (2007)

In this paper, a procedure for dealing with the multi-user synchronisation problem in Orthogonal Frequency Division Multiple Access (OFDMA)-based systems for ad hoc environments is proposed and analysed. We show with this novel approach that it is possible to re-use much of the already extent literature for single-user synchronisation in OFDM and apply it to multi-user ad hoc scenarios. Also a distributed version of the procedure is proposed in order to fairly share out the power consumption among all the devices. The proposed procedure makes use of higher layer capabilities in a cross-layer design and it does not incur too much complexity or power. This issue is specially critical in wireless heterogeneous ad hoc networks where devices can be very limited in terms of transmission and/or computational power.
High-Performance Training of Conditional Random Fields for Large-Scale Applications of Labeling Sequence Data
Authors: Xuan-Hieu Phan, Le-Minh Nguyen, Yasushi Inoguchi, Susumu Horiguchi
Venue: IEICE - Transactions on Information and Systems (2007)

Conditional random fields (CRFs) have been successfully applied to various applications of predicting and labeling structured data, such as natural language tagging & parsing, image segmentation & object recognition, and protein secondary structure prediction. The key advantages of CRFs are the ability to encode a variety of overlapping, non-independent features from empirical data as well as the capability of reaching the global normalization and optimization. However, estimating parameters for CRFs is very time-consuming due to an intensive forward-backward computation needed to estimate the likelihood function and its gradient during training. This paper presents a high-performance training of CRFs on massively parallel processing systems that allows us to handle huge datasets with hundreds of thousand data sequences and millions of features. We performed the experiments on an important natural language processing task (text chunking) on large-scale corpora and achieved significant results in terms of both the reduction of computational time and the improvement of prediction accuracy.
An approach to ontology-aided performance engineering through NFR framework
Authors: Pere P. Sancho, Carlos Juiz, Ramon Puigjaner, Lawrence Chung, Nary Subramanian
Venue: Proceedings of the 6th international workshop on Software and performance (2007)

In this article we intend to make an attempt to formalize the Software Performance Engineering Body of Knowledge (SPEBoK) by means of the formal semantics of an ontology written in OWL. We do not claim that our SPEBoK is complete nor the information contained correct. Rather we propose the structure of an ontological database to contain it. This structure allows the Performance Engineering issues to be related among themselves and even to other non-functional requirements with which they may interact. Our work uses the NFR Framework.
Enhancing business process management with simulation optimization
Authors: Jay April, Marco Better, Fred Glover, James Kelly, Manuel Laguna
Venue: Proceedings of the 38th conference on Winter simulation (2006)

A growing number of business process management software vendors are offering simulation capabilities to extend their modeling functions and enhance their analytical proficiencies. Simulation is promoted to enable examination and testing of decisions prior to actually making them in the "real" environment. In this paper, we illustrate how to optimize simulation models, by presenting two examples of simulation optimization using OptQuest&reg;. In the first case, we construct a discrete event simulation model of a hospital emergency room to determine a configuration of resources that results in the shortest average cycle time for patients. In the second case, we develop a simulation model to minimize staffing levels for personal claims processing in an insurance company. We then summarize some of the most relevant approaches that have been developed for the purpose of optimizing simulated systems and conclude with a metaheuristic black box approach that leads the field of practical applications.
IBM Bladecenter 4gb San Solution
Venue:  (2006)

This IBM Redbook focuses on the 4Gb end-to-end Fibre Channel (FC) SAN solution for the IBM BladeCenter in the small to mid-sized businesses (SMB) and enterprise workgroup market. In this redbook, we discuss the elements for constructing a BladeCenter SAN environment. We talk about the supported FC daughter cards, FC switch modules, external FC switches, and storage systems used in our lab environment. These items were used to construct an OEM environment to demonstrate the use of our storage vendor products and the interoperability of the IBM BladeCenter FC switch modules. This redbook discusses the prerequisites, the installation, and the configuration of QLogic, McData, and Brocade switch modules in a homogeneous environment, as well as heterogeneous environments. 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
Vectorized image segmentation via trixel agglomeration
Authors: Lakshman Prasad, Alexei N. Skourikhine
Venue: Pattern Recognition (2006)

We present a broad algorithmic framework for transforming an image comprised of pixels into a vectorized image segmented into polygons that can be subsequently used in image analysis, understanding, and high-level representation. We introduce a new entity-the trixel-that is an adaptive, local, triangular unit of region-contour picture description. Adjacent trixels are merged based on certain elementary heuristic criteria of perceptual organization, modeled as geometric filters on trixel edges. The connected components of a trixel grouping graph, with vertices representing trixels and edges between vertices corresponding to merged adjacent trixels, yield polygons that segment the image.
Observations on determinization of Büchi automata
Authors: Christoph Schulte Althoff, Wolfgang Thomas, Nico Wallmeier
Venue: Theoretical Computer Science (2006)

The two determinization procedures of Safra and Muller-Schupp for Büchi automata are compared, based on an implementation in a program called OmegaDet.
Incorporating speaker and discourse features into speech summarization
Authors: Gabriel Murray, Steve Renals, Jean Carletta, Johanna Moore
Venue: Proceedings of the main conference on Human Language Technology Conference of the North American Chapter of the Association of Computational Linguistics (2006)

We have explored the usefulness of incorporating speech and discourse features in an automatic speech summarization system applied to meeting recordings from the ICSI Meetings corpus. By analyzing speaker activity, turn-taking and discourse cues, we hypothesize that such a system can outperform solely text-based methods inherited from the field of text summarization. The summarization methods are described, two evaluation methods are applied and compared, and the results clearly show that utilizing such features is advantageous and efficient. Even simple methods relying on discourse cues and speaker activity can outperform text summarization approaches.
Data representations and generalization error in kernel based learning machines
Authors: Nicola Ancona, Rosalia Maglietta, Ettore Stella
Venue: Pattern Recognition (2006)

This paper focuses on the problem of how data representation influences the generalization error of kernel based learning machines like support vector machines (SVM) for classification. Frame theory provides a well founded mathematical framework for representing data in many different ways. We analyze the effects of sparse and dense data representations on the generalization error of such learning machines measured by using leave-one-out error given a finite amount of training data. We show that, in the case of sparse data representations, the generalization error of an SVM trained by using polynomial or Gaussian kernel functions is equal to the one of a linear SVM. This is equivalent to saying that the capacity of separating points of functions belonging to hypothesis spaces induced by polynomial or Gaussian kernel functions reduces to the capacity of a separating hyperplane in the input space. Moreover, we show that, in general, sparse data representations increase or leave unchanged the generalization error of kernel based methods. Dense data representations, on the contrary, reduce the generalization error in the case of very large frames. We use two different schemes for representing data in overcomplete systems of Haar and Gabor functions, and measure SVM generalization error on benchmarked data sets.
Bias correction of cross-validation criterion based on Kullback-Leibler information under a general condition
Authors: Hirokazu Yanagihara, Tetsuji Tonda, Chieko Matsumoto
Venue: Journal of Multivariate Analysis (2006)

This paper deals with the bias correction of the cross-validation (CV) criterion to estimate the predictive Kullback-Leibler information. A bias-corrected CV criterion is proposed by replacing the ordinary maximum likelihood estimator with the maximizer of the adjusted log-likelihood function. The adjustment is just slight and simple, but the improvement of the bias is remarkable. The bias of the ordinary CV criterion is O(n-1), but that of the bias-corrected CV criterion is O(n-2). We verify that our criterion has smaller bias than the AIC, TIC, EIC and the ordinary CV criterion by numerical experiments.
Two's-complement multiplication
Authors: A. E. Sheue
Venue: ACM SIGMICRO Newsletter (1979)

Two's complement multiplication, defined in terms of adds, subtracts, and shifts, is derived from a novel expression relating a two's-complement number and its integer interpretation. Although the derived algorithm is considered well known, the derivation itself is believed to be original and easily grasped. Implementation of the algorithm in terms of computer arithmetic is shown to be safe from overflow except for the case when the multiplier is 10...0 (max. negative). In this case, the resulting product will have the proper magnitude but the wrong algebraic sign. The implementation can, however, be modified to handle this special case properly.