ppxscal/embedding_network huggingface dataset:
Absolute Beginner's Guide to Microsoft Office Word 2003
Authors: Laura Acklen
Venue:  (2003)

Get up to speed on Word 2003's capabilities with concise, step-by-step tips from a Word expert!Finally, readers without any Word experience have a book that was created just for them! This book is written for the reader who may be using Word for the very first time. Everything a reader needs to learn how to use Word is right here, presented in an easy-to-follow format. Absolute Beginner's Guide to Microsoft Office Word 2003 takes the reader through the basics, from starting Word to creating, editing, and formatting documents. The reader will learn how to use Word's productivity tools, with lots of numbered steps to lead them through the process. Everything from styles to tables to clip art to charts is covered so when finished, the reader will feel confident about using Word's most powerful features.
Learnt inverse kinematics for animation synthesis
Authors: Eng-Jon Ong, Adrian Hilton
Venue: Graphical Models (2006)

Existing work on animation synthesis can be roughly split into two approaches, those that combine segments of motion-capture data, and those that perform inverse kinematics. In this paper, we present a method for performing animation synthesis of an articulated object (e.g. human body and a dog) from a minimal set of body joint positions, following the approach of inverse kinematics. We tackle this problem from a learning perspective. Firstly, we address the need for knowledge on the physical constraints of the articulated body, so as to avoid the generation of a physically impossible poses. A common solution is to heuristically specify the kinematic constraints for the skeleton model. In this paper however, the physical constraints of the articulated body are represented using a hierarchical cluster model learnt from a motion capture database. Additionally, we shall show that the learnt model automatically captures the correlation between different joints through simultaneous modelling of their angles. We then show how this model can be utilised to perform inverse kinematics in a simple and efficient manner. Crucially, we describe how IK is carried out from a minimal set of end-effector positions. Following this, we show how this "learnt inverse kinematics" framework can be used to perform animation syntheses on different types of articulated structures. To this end, the results presented include the retargeting of a flat surface walking animation to various uneven terrains to demonstrate the synthesis of a full human body motion from the positions of only the hands, feet and torso. Additionally, we show how the same method can be applied to the animation synthesis of a dog using only its feet and torso positions.
Novell Netware 5.x to 6 Upgrade Exam Cram 2
Authors: David Johnson, James E. Gaskin, Daniel Cheung, Ed Tittel
Venue:  (2003)

This certification permits NetWare 5.x Certified Novell Engineers (CNEs) to upgrade their credentials to NetWare 6. Individuals who hold CNE certification for any version of NetWare 5 can recertify for NetWare 6 by taking a single exam, 50-676: Upgrading to NetWare 6. This book focuses on exactly what readers need to get certified now - featuring test-taking strategies, time-saving study tips, and a special Cram Sheet that includes tips, acronyms, and memory joggers that are not available anywhere else. The Exam Cram2 series is the smartest, most efficient way to become certified! Each book is published under the direction of Series Editor Ed Tittel, the leading authority on certification and the founder of The Exam Cram Method™ series, and has also been deemed Cramsession™ Approved Study Material.The accompanying CD features PrepLogic™ Practice Tests, Preview Edition. This product includes one complete PrepLogic Practice Test with approximately the same number of questions found on the actual vendor exam. Each question contains full, detailed explanations of the correct and incorrect answers. The engine offers two study modes, Practice Test and Flash Review, full exam customization, and a detailed score report.
Rapid and Brief Communication: Subspace independent component analysis using vector kurtosis
Authors: Alok Sharma, Kuldip K. Paliwal
Venue: Pattern Recognition (2006)

This discussion presents a new perspective of subspace independent component analysis (ICA). The notion of a function of cumulants (kurtosis) is generalized to vector kurtosis. This vector kurtosis is utilized in the subspace ICA algorithm to estimate subspace independent components. One of the main advantages of the presented approach is its computational simplicity. The experiments have shown promising results in estimating subspace independent components.
A predictive bandwidth reservation scheme using mobile positioning and road topology information
Authors: Wee-Seng Soh, Hyong S. Kim
Venue: IEEE/ACM Transactions on Networking (TON) (2006)

In cellular networks, an important practical issue is how to limit the handoff dropping probability efficiently. One possible approach is to perform dynamic bandwidth reservation based on mobility predictions. With the rapid advances in mobile positioning technology, and the widespread availability of digital road maps previously designed for navigational devices, we propose a predictive bandwidth reservation scheme built upon these timely opportunities. In contrast to the common practice of utilizing only incoming handoff predictions at each cell to compute the reservations, our scheme is more efficient as it innovatively utilizes both incoming and outgoing handoff predictions; it can meet the same target handoff dropping probability by blocking fewer new calls. The individual base stations are responsible for the computations, which are shown to be simple enough to be performed in real-time. We evaluate the scheme via simulation, along with five other schemes for comparison. Simulation results show that those schemes that rely on positioning information are significantly more efficient than those that do not. Our scheme's additional use of the road topology information further improves upon this advantage, bringing the efficiency closer to the bound set by a benchmark scheme that assumes perfect knowledge about future handoffs.
A Modified Generalized Hough Transform for Image Search
Authors: Preeyakorn Tipwai, Suthep Madarasmi
Venue: IEICE - Transactions on Information and Systems (2007)

We present the use of a Modified Generalized Hough Transform (MGHT) and deformable contours for image data retrieval where a given contour, gray-scale, or color template image can be detected in the target image, irrespective of its position, size, rotation, and smooth deformation transformations. Potential template positions are found in the target image using our novel modified Generalized Hough Transform method that takes measurements from the template features by extending a line from each edge contour point in its gradient direction to the other end of the object. The gradient difference is used to create a relationship with the orientation and length of this line segment. Potential matching positions in the target image are then searched by also extending a line from each target edge point to another end along the normal, then looking up the measurements data from the template image. Positions with high votes become candidate positions. Each candidate position is used to find a match by allowing the template to undergo a contour transformation. The deformed template contour is matched with the target by measuring the similarity in contour tangent direction and the smoothness of the matching vector. The deformation parameters are then updated via a Bayesian algorithm to find the best match. To avoid getting stuck in a local minimum solution, a novel coarse-and-fine model for contour matching is included. Results are presented for real images of several kinds including bin picking and fingerprint identification.
SPSA algorithms with measurement reuse
Authors: Mohammed Shahid Abdulla, Shalabh Bhatnagar
Venue: Proceedings of the 38th conference on Winter simulation (2006)

Four algorithms, all variants of Simultaneous Perturbation Stochastic Approximation (SPSA), are proposed. The original one-measurement SPSA uses an estimate of the gradient of objective function L containing an additional bias term not seen in two-measurement SPSA. As a result, the asymptotic covariance matrix of the iterate convergence process has a bias term. We propose a one-measurement algorithm that eliminates this bias, and has asymptotic convergence properties making for easier comparison with the two-measurement SPSA. The algorithm, under certain conditions, outperforms both forms of SPSA with the only overhead being the storage of a single measurement. We also propose a similar algorithm that uses perturbations obtained from normalized Hadamard matrices. The convergence w.p. 1 of both algorithms is established. We extend measurement reuse to design two second-order SPSA algorithms and sketch the convergence analysis. Finally, we present simulation results on an illustrative minimization problem.
(2D)2LDA: An efficient approach for face recognition
Authors: S. Noushath, G. Hemantha Kumar, P. Shivakumara
Venue: Pattern Recognition (2006)

Although 2DLDA algorithm obtains higher recognition accuracy, a vital unresolved problem of 2DLDA is that it needs huge feature matrix for the task of face recognition. To overcome this problem, this paper presents an efficient approach for face image feature extraction, namely, (2D)^2LDA method. Experimental results on ORL and Yale database show that the proposed method obtains good recognition accuracy despite having less number of coefficients.
Increasing web accessibility by automatically judging alternative text quality
Authors: Jeffrey P. Bigham
Venue: Proceedings of the 12th international conference on Intelligent user interfaces (2007)

The lack of appropriate alternative text for web images remains a problem for blind users and others accessing the web with non-visual interfaces. The content contained within web images is vital for understanding many web sites but the majority are assigned either inaccurate alternative text or none at all. The capability to automatically judge the quality of alternative text has the promise to dramatically improve the accessibility of the web by bringing intelligence to three categories of interfaces: tools that help web authors verify that they have provided adequate alternative text for web images, systems that automatically produce and insert alternative text for web images, and screen reading software. In this paper we describe a classifier capable of measuring the quality of alternative text given only a few labeled training examples by automatically considering the image context.
K42: building a complete operating system
Authors: Orran Krieger, Marc Auslander, Bryan Rosenburg, Robert W. Wisniewski, Jimi Xenidis, Dilma Da Silva, Michal Ostrowski, Jonathan Appavoo, Maria Butrico, Mark Mergen, Amos Waterland, Volkmar Uhlig
Venue: Proceedings of the 1st ACM SIGOPS/EuroSys European Conference on Computer Systems 2006 (2006)

K42 is one of the few recent research projects that is examining operating system design structure issues in the context of new whole-system design. K42 is open source and was designed from the ground up to perform well and to be scalable, customizable, and maintainable. The project was begun in 1996 by a team at IBM Research. Over the last nine years there has been a development effort on K42 from between six to twenty researchers and developers across IBM, collaborating universities, and national laboratories. K42 supports the Linux API and ABI, and is able to run unmodified Linux applications and libraries. The approach we took in K42 to achieve scalability and customizability has been successful.The project has produced positive research results, has resulted in contributions to Linux and the Xen hypervisor on Power, and continues to be a rich platform for exploring system software technology. Today, K42, is one of the key exploratory platforms in the DOE's FAST-OS program, is being used as a prototyping vehicle in IBM's PERCS project, and is being used by universities and national labs for exploratory research. In this paper, we provide insight into building an entire system by discussing the motivation and history of K42, describing its fundamental technologies, and presenting an overview of the research directions we have been pursuing.
Efficient hardware checkpointing: concepts, overhead analysis, and implementation
Authors: Dirk Koch, Christian Haubelt, Jürgen Teich
Venue: Proceedings of the 2007 ACM/SIGDA 15th international symposium on Field programmable gate arrays (2007)

Progress in reconfigurable hardware technology allows the implementation of complete SoCs in today's FPGAs. In the context design for reliability, software checkpointing is an effective methodology to cope with faults. In this paper, we systematically extend the concept of checkpointing known from software systems to hardware tasks running on reconfigurable devices. We will classify different mechanisms for hardware checkpointing and present formulas for estimating the hardware overhead. Moreover, we will reveal a tool that takes over the burden of modifying hardware modules for checkpointing. Post-synthesis results of applying our methodology to different hardware accelerators will be presented and the results will be compared with the theoretical estimations.
Analysis of peer-to-peer file dissemination
Authors: Jochen Mundinger, Richard Weber, Gideon Weiss
Venue: ACM SIGMETRICS Performance Evaluation Review (2006)

In recent years, overlay networks have proven a popular way of disseminating potentially large files from a single server S to a potentially large group of N end users via the Internet. A number of algorithms and protocols have been suggested, implemented and studied. In particular, much attention has been given to peer-to-peer (P2P) systems such as BitTorrent [5], Slurpie [20], SplitStream [4], Bullet [11] and Avalanche [6]. The key idea is that the file is divided into M parts of equal size and that a given user may download any one of these - or, for Avalanche, linear combinations of these - either from the server or from a peer who has previously downloaded it.
Connected & manifold Sierpinsky polyhedra
Authors: Vinod Srinivasan, Ergun Akleman
Venue: Proceedings of the ninth ACM symposium on Solid modeling and applications (2004)

In this paper, we present a subdivision-inspired scheme to construct generalized Sierpinski polyhedron. Unlike usual Sierpinski polyhedra construction schemes, which create either an infinite set of disconnected tetrahedra or a non-manifold polyhedron, our robust construction scheme creates one connected and manifold polyhedron. Moreover, unlike the original schemes, this new scheme can be applied to any manifold polyhedral mesh and based on the shape of this initial polyhedra a large variety of Sierpinski polyhedra can be obtained. Our basic scheme can be viewed as applying simplest subdivision scheme [23] to an input polyhedron, but retaining old vertices. The porous structure is then obtained by removing the refined facets of the simplest subdivision.
Creative Projects with Logic Audio (Creative Projects)
Authors: Keith Gemmell
Venue:  (2003)

Whether you are interested in composing soundtracks, jingles, or just some catchy tunes, author Keith Gemmell will help you develop the skills you need to get the most out of your software. Test your developing skills along the way as you complete projects such as building assigned compositions from scratch, editing your audio, and producing a readable score and parts. Projects build upon each other as you work your way through the book. Covering everything from the creative process of developing your musical idea to shaping it and taking it through the final production process, “Creative Projects with Logic Audio” is all you need to turn your ideas into an awesome reality! Features Project-based book and CD make learning the creative possibilities of Logic Audio easy and enjoyable Teaches users how to sequence, record and mix effectively Provides instruction on how to compose for film or TV using Logic Audio 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
Design and fabrication of a SU-8 based electrostatic microactuator
Authors: Wen Dai, Kun Lian, Wanjun Wang
Venue: Microsystem Technologies (2006)

Comb-drive microactuator is widely used in MEMS devices and traditionally is made of silicon as structural material using silicon-based fabrication technology. Recent development in UV lithography of SU-8 has made it possible to fabricate the ultra high aspect ratio microstructures with excellent sidewall quality. In this paper, we report a low cost alternative to the silicon-based comb drive by using cured SU-8 polymer as structural material. The microactuator was designed to have a integrated structure without assembly or bonding. A unique integration fabrication process was successfully developed based on UV lithography of SU-8 and selectively metallizing SU-8 polymer structures. Preliminary experimental results have proved the feasibility of the microactuator and the fabrication technology.
A distributed simulation approach for modeling and analyzing systems of systems
Authors: Abeer Sharawi, Serge N. Sala-Diakanda, Adam Dalton, Sergio Quijada, Nabeel Yousef, Luis Rabelo, José Sepúlveda
Venue: Proceedings of the 38th conference on Winter simulation (2006)

Certain business objectives cannot be met without the interaction and communication between different systems. An interesting concept called system of systems (SoS), which aims to describe this interaction between systems has been gaining attention in the last few years. In this paper an extensive review of the literature is performed to capture the main characteristics associated to this concept in order to propose a new, more complete definition. This paper also proposes the use of distributed simulation through the High Level Architecture (HLA) rules to model and simulate systems of systems. We illustrate our idea with two different examples, a simplified supply chain network of a computer assembly and an aircraft initial sizing scenarios. The paper concludes with a discussion of some of the significant advantages distributed simulation could offer over traditional simulation for the analysis of such complex systems.
Fuzzy-logic-based decision-making system for stock allocation in a distribution supply chain: Research Articles
Authors: Ying Xie, Dobrila Petrovic
Venue: International Journal of Intelligent Systems in Accounting and Finance Management (2006)

Stock allocation in a distribution supply chain (DSC) means that the warehouse has to determine quantities of the available stock to be delivered to each retailer. Different allocation rules have been developed with various aims. In this paper, a new fuzzy-logic-based decision-making system for stock allocation (DMS&lowbar;SA) is presented, and the objective is to achieve the target DSC fill rate whilst incurring an acceptable total holding cost, or to achieve the target holding cost whilst with a certain level of fill rate. It is shown how DMS&lowbar;SA can be extended to be applied to a multi-echelon DSC. Copyright &copy; 2007 John Wiley & Sons, Ltd.
Solving the volume integral equations of electromagnetic scattering
Authors: Matthys M. Botha
Venue: Journal of Computational Physics (2006)

Time-harmonic electromagnetic scattering by inhomogeneous, three-dimensional structures within a free space environment can be described by electric- and magnetic field, volume integral equations involving the free space Green function. A comprehensive set of Galerkin projection formulations (also known as moment methods) for the numerical solution of these equations is presented, together with comparative numerical results. Such formulations are widely used for particle scattering analysis, optical near field calculation, etc. Results are obtained with higher-order, divergence-and curl-conforming basis functions on iso-parametric, tetrahedral meshes. The results demonstrate that all formulations converge with similar accuracy in the case of an analytically-solvable test problem. When modeling flux densities as solution variables, it is argued that solenoidal function spaces should be used, rather than the standard divergence-conforming function spaces; this assertion is supported by the results. Some of the formulations involve solving for curl-conforming fields; such fields can be discretized with fewer unknowns than divergence-conforming ones, implying lower computational costs. Additionally, some formulations yield system matrices which are approximately halfway sparse, meaning that computational costs will be down by a factor of 2 when iterative solvers are employed, which is the case for the widely-used fast methods.
On the two-dimensional Marcinkiewicz means with respect to Walsh-Kaczmarz system
Authors: K. Nagy
Venue: Journal of Approximation Theory (2006)

In this paper we prove that the maximal operator of the Marcinkiewicz means of two-dimensional integrable functions with respect to the Walsh-Kaczmarz system is of weak type (1, 1). Moreover, the Marcinkiewicz means Mnf converge to f almost everywhere, for any integrable function f.
The SIGMAP-UW nonlinear programming symposium
Authors: Michael Grigoriadis
Venue: Issue 16 (April 1974) (1974)

BALAS, GON: INTERSECTION CUTS FOR NONCONVEX PROGRAMMING. MONDAY, P.M.: A new class of intersection cuts is discussed, which is applicable to a large variety of nonconvex programming problems, like linearly constrained quadratic programs, separable programs, linear programs with disjunctive or other logical constraints, and of course integer programs. These cutting planes subsume or dominate many of those proposed earlier, and are easier to generate. When used in a branch and bound context, they yield stronger bounds than the ones currently in use.
MCSD .NET Solution Architectures Exam Cram 2 (Exam 70-300)
Authors: Randy Cornish, Don Pavoni, Thomas Moore, Eric Rockenbach, Ed Tittel
Venue:  (2003)

MCSD Analyzing Requirements and Defining .NET Solution Architectures Exam Cram 2 (Exam 70-300) helps you pass the 70-300 exam, which is a core exam in the MCSD .NET track and measures the ability to analyze requirements and define Microsoft .NET solution architectures. This exam is extremely tricky, widely considered the most difficult of any MCSD exams because of its emphasis on case studies as well as its demand that candidates have at least two years of hands-on experience. This book is not intended to teach new material. Instead, it assumes that you have a solid foundation of knowledge but could use a refresher on important concepts, as well as a guide to exam topics and objectives. The book features test-taking strategies, time-saving study tips, and a special Cram Sheet that includes tips, acronyms, and memory joggers not available anywhere else! The Cram Sheet is especially useful for last-minute review before the test begins.The CD features PrepLogicï¾¿ Practice Tests, Preview Edition. This product includes one complete PrepLogic Practice Test with approximately the same number of questions found on the actual vendor exam. Each question contains full, detailed explanations of the correct and incorrect answers. The engine offers two study modes, Practice Test and Flash Review, full exam customization, and a detailed score report.The best-selling Exam Cram 2 series is supported online at examcram.com, offering industry news, study tips, practice questions, and discussion forums. Each book is published under the direction of Series Editor Ed Tittel, the leading authority on IT certification. This book has been subjected to rigorous technical review by a team of industry experts, ensuring content is superior in both coverage and technical accuracy, and has earned the distinction of Cramsessionï¾¿ Approved Study Material.