ppxscal/embedding_network huggingface dataset:
Why Secure Applications Are Difficult to Write
Authors: James Whittaker
Venue: IEEE Security and Privacy (2003)

The authors discuss software security as an awareness issue, because software that is unaware of its potential vulnerabilities has no chance of being secure. Only by being aware of potential threats and using vigilant defensive countermeasures can we hope to write secure applications, and we can only achieve security through awareness and understanding of these issues.
The Effects of Singular Value Decomposition on Collaborative Filtering
Authors: Michael H. Pryor
Venue:  (1998)

As the information on the web increases exponentially, so do the efforts to automatically filter out useless content and to search for interesting content. Through both explicit and implicit actions, users define where their interests lie. Recent efforts have tried to group similar users together in order to better use this data to provide the best overall filtering capabilities to everyone. This thesis discusses ways in which linear algebra, specifically the singular value decomposition, can be used to augment these filtering capabilities to provide better user feedback. The goal is to modify the way users are compared with one another, so that we can more efficiently predict similar users. Using data collected from the PhDs.org website, we tested our hypothesis on both explicit web page ratings and implicit visits data.
Nonphotorealistic Rendering of Medical Volume Data
Authors: Feng Dong, Gordon J. Clapworthy, Hai Lin, Meleagros A. Krokos
Venue: IEEE Computer Graphics and Applications (2003)

A new technique called volumetric hatching visualizes medical data using pen-and-ink illustrations. Pen-and-ink illustrations are widely used to portray anatomy in, for example, medical textbooks. Generating such images from medical data provides an alternative form of medical visualization, offering better medical understanding. While most existing pen-and-ink illustration techniques work on surface models, the distinctive feature of this work is that the hatching is based directly on volume data. As with conventional volume rendering, data beneath the surface of the objects influences the results of volumetric hatching, and it is thus suitable for subjects not well represented by a few isosurfaces.
Professional C#: 2nd Edition, 2 edition
Authors: Simon Robinson, Karli Watson, Burton Harvey, Jay Glynn, Christian Nagel
Venue:  (2002)

:This book is for C and C++ programmers looking to move their skill set into web development, Visual Basic programmers looking for a more powerful language and ASP developers who are interested in what C# has to offer. The only requirement is that you are an experienced developer, familiar with at least one other high level language used on Windows - either C++, VB or J++.
Probabilistic term variant generator for biomedical terms
Authors: Yoshimasa Tsuruoka, Jun'ichi Tsujii
Venue: Proceedings of the 26th annual international ACM SIGIR conference on Research and development in informaion retrieval (2003)

This paper presents an algorithm to generate possible variants for biomedical terms. The algorithm gives each variant its generation probability representing its plausibility, which is potentially useful for query and dictionary expansions. The probabilistic rules for generating variants are automatically learned from raw texts using an existing abbreviation extraction technique. Our method, therefore, requires no linguistic knowledge or labor-intensive natural language resource. We conducted an experiment using 83,142 MEDLINE abstracts for rule induction and 18,930 abstracts for testing. The results indicate that our method will significantly increase the number of retrieved documents for long biomedical terms.
RESPONSES OF A FINITE BAFFLED PLATE SUBJECT TO TURBULENT AND MEAN FLOW EXCITATIONS
Authors: Sean F. Wu, Lucio Maestrello
Venue:  (1993)

Formulations for predicting dynamic and acoustic responses of a finite plate flush-mounted on an infinite baffle subject to turbulent and mean flow excitations are presented. In deriving these formulations, the effects of stretching due to in-plane force and coupling between structural vibration and acoustic radiation are taken into account. The resulting equation governing plate vibration contains cubic nonlinearities. To obtain an approximate solution, the plate flexural displacement is expanded into orthogonal base functions. The unknown coefficients associated with base functions are determined by solving a set of coupled nonlinear integral equations using Galerkin''s method. A stability analysis is given using the basic existence-uniqueness theorem. In particular, stable conditions for a linearized system are obtained using the Routh algorithm. It is shown that structural instabilities can be induced by fluid loading and mean flow. Two unstable mechanisms are found to be attributable to added damping and stiffness due to acoustic radiation. The effect of added damping increases linearly, while that of added stiffness increases quadratically with the Mach number of mean flow. Finally, the cross-power spectral density functions of plate flexural vibration and radiated acoustic pressure are derived and expressed in terms of the cross-power spectral density function of turbulent flow.
On Parallel Edges in Cycles
Authors: Boros E., Gurvich V.
Venue:  (1999)

Let $n\leq N$ be positive integers. We consider the problem of finding an $n$-cycle with no parallel edges in a perfect $N$-gon in the Euclidian plane. We prove that there exist no such $n$-cycle if and only if $N=n$ and even. And we show by construction that for every other pair $(N,n)$, $N \geq n \geq 3$, such an $n$-cycle exists.
Boxed iterations
Authors: D. J. Hartfiel
Venue: Applied Mathematics and Computation (2003)

This paper concerns iterations xk+1 = Axk + b, where A is an n × n matrix and b an n × 1 vector. After each iteration, the result is projected into a box, after which another iteration takes place. Convergence and behavior of such maps is shown. And, the iteration is considered when the matrix A and vector b are allowed to fluctuate.
Hot Spot Recovery in Object-Oriented Software with Inheritance and Composition Template Methods
Authors: Reinhard Schauer, Sébastien Robitaille, François Martel, Rudolf K. Keller
Venue: Proceedings of the IEEE International Conference on Software Maintenance (1999)

The success of an object-oriented software development project highly depends on how well the designers can capture the Hot Spots of the application domain, that is, those aspects that should be kept flexible to accommodate reuse and change. Yet, all too often, Hot Spots are hardly documented, and over years of software evolution, the source code that reifies them becomes increasingly entangled with the application specific code. This blurring of the flexible with the rigid parts makes an application hard to maintain, prone to unexpected change impact, and immobile for reuse in related areas. In this paper, we apply SPOOL, our prototype environment for reverse engineering, to the recovery of Hot Spots in C++ software. We base the technique for Hot Spot recovery on the design concept of template methods. We present the approach and the interactive analysis capabilities of SPOOL to visualize, browse, and inspect Hot Spots in both separate and contextual form. The findings are validated based on two industrial systems.
GestureWrist and GesturePad: Unobtrusive Wearable Interaction Devices
Authors: Jun Rekimoto
Venue: Proceedings of the 5th IEEE International Symposium on Wearable Computers (2001)

In this paper, we introduce two input devices for wearable computers, called GestureWrist and GesturePad. Both devices allow users to interact with wearable or nearby computers by using gesture-based commands. Both are designed to be as unobtrusive as possible, so they can be used under various social contexts. The first device, called GestureWrist, is a wristband-type input device that recognizes hand gestures and forearm movements. Unlike DataGloves or other hand gesture-input devices, all sensing elements are embedded in a normal wristband. The second device, called GesturePad, is a sensing module that can be attached on the inside of clothes, and users can interact with this module from the outside. It transforms conventional clothes into an interactive device without changing their appearance.
Scalable and Efficient Update Dissemination for Distributed Interactive Applications
Authors: Tianying Chang, George Popescu, Chris Codella
Venue: Proceedings of the 22 nd International Conference on Distributed Computing Systems (ICDCS'02) (2002)

Distributed interactive applications such as multiplayer games will become increasingly popular in wide area distributed systems. To provide the response time desired by users despite high and unpredictable communication latency in such systems, shared objects will be replicated orcached by clients that participate in the applications. Any updates to the shared objects will have to be disseminated to clients that actually use the objects to maintain consistency. We address the problem of efficient and scalable update dissemination in an environment where client interests can change dynamically and the number of multicast channels available for update dissemination is limited. We present a heuristic based algorithm that can group objectsand clients in a way that it handles limited bandwidth resources. We show that our algorithm can produce better results than several algorithms that have been developed in the past for update dissemination.
Research on cluster of workstations
Authors: Dingxing Wang, Weimin Zheng, Jianxin Xiong
Venue: Proceedings of the 1997 International Symposium on Parallel Architectures, Algorithms and Networks (1997)

Cluster of Workstations is becoming an important kind of parallel computing platform. Two issues are essential for promoting the popularization of COW: high-performance communication mechanism and powerful programming environment. In this paper we present our research work on COW, which aims at giving a practical solution to the above issues. In order to build a high performance communication system, we design a reduced communication protocol in addition to making use of high-speed network hardware. Based on PVM, we implement a practical programming environment which include parallel compiling systems, parallel debugger, load balancing tool and execution fault recovery tool. Some performance results are given in this paper.
Generalized whist tournament designs
Authors: R. Julian R. Abel, Norman J. Finizio, Malcolm Greig, Scott J. Lewis
Venue: Discrete Mathematics (2003)

In this study a new class of tournament designs is introduced. In particular, each game of the tournament involves several (two or more) teams competing against one another. The tournament is also required to satisfy certain balance conditions that are imposed on each pair of players. These balance conditions are related to both the total number of players on each team and the number of teams in each game. In one sense, these balance conditions represent a generalization of the balance requirements for whist tournaments although the games in a whist tournament involve, exclusively, two two-player teams. Several techniques for constructing these new tournament designs are developed and theorems guaranteeing infinite classes of such designs are proven.
Experiences with Software MPEG-2 Video Decompression on an SMP PC
Authors: Aravind Bala, Darshat Shah, Wu-chi Feng, D. K. Panda
Venue: Proceedings of the 1998 International Conference on Parallel Processing Workshops (1998)

Software implementations of MPEG decompressionprovide flexibility but at the cost of being CPU intensive.In this paper, we describe our results from implementinga two process MPEG-2 video decompression algorithmin software on a dual processor SMP machine. Ourapproach attempts to decompose the video decodingprocess into functional (rather than spatial) sub-tasks.This approach will allow us to more naturally extendthe MPEG-2 video decompression to work with NOWtechnologies. We have tried out two different approaches,one using shared memory and the other usingthreads to parallelize the MPEG decoding process ona dual processor SMP system. Our results indicatethat the common myth of "MPEG decoding is memorybottlenecked" is false. In particular, our results showthat a speedup of upto 1.7 is obtainable by using asimple functional decomposition of the MPEG decoder.
Toward Successful Personal Work and Relations - Applying a Yin/Yang Model for Classification and Synthesis
Authors: Angela Sodan
Venue:  (2001)

For personal work and relations to be successful, a number of different psycho-social qualities are required. We postulate that all qualities exist in dual form, i.e. as pairs of opposite and complementary aspects which are further differentiable into two typical classes. In ancient philosophies, these are known as Yin/Yang and they appear in neuropsychology as the laterality of the brain''s hemispheres. Using Yin/Yang classes enables us to keep the discussion largely non-sex-specific. Both neuropsychology and philosophy consider the full development and proper synthesis of both aspects be required for an individual to fully exploit his/her creative potential. Focusing on science and engineering, we discuss relevant pairs of qualities and their ideal synthesis. Furthermore, we propose a model of fractal Yin/Yang nesting and explain by this theory personal differences and the sex-relatedness.
Linux For Dummies, 5 edition
Authors: Dee-Ann LeBlanc
Venue:  (2003)

:Covers the essentials that first-time Linux users need to know about installing and using Linux on their desktop. Topics include preparing your PC for Linux, installing, connecting to a network or the Internet, working with the GNOME interface, playing media files, and working with the file system.Covers specialized uses of Linux including using Linux as a server as well as an embedded or turnkey system, a supercomputer, a real-time controller. Covers the latest tools for browsing the Internet, being productive, and keeping your connection secure.Series features: Includes the simple and fun reference style that has made the For Dummies series a favorite for over 200, 000 first-time Linux users.ABOUT THE CD-ROMTwo CDs included with this book contain the latest distribution of Red Hat Linux.
Resolving Conflicts with Committing Transactions in Distributed Real-time Databases
Authors: Kam-yiu Lam, Jiannong Cao, Chung-leung Pang, Sang H. Son
Venue: Proceedings of the Third IEEE International Conference on Engineering of Complex Computer Systems (1997)

In a distributed real-time database system, if data conflicts occur between executing and committing transactions, the performance can be severely affected. In this paper, we propose an approach, called deadline driven conflict resolution (DDCR), which integrates concurrency control and commitment management in resolving data conflicts between executing and committing transactions, while at the same time maintaining the schedules to be serializable. With DDCR, many of the data conflicts can be alleviated, and concurrent execution of transactions is allowed to access data items being held by committing transactions. The impact of temporary failures occurred during the commitment of a transaction on other transactions is reduced by reversing the dependencies between the transactions. Simulation experiments have been performed and the results show that DDCR can significantly improve the system performance especially when the duration for the voting phase is long.
Theoretical and numerical study of shell intermediate states on particular toroidal and cylindrical problems
Authors: Lourenco Beirao da Veiga
Venue:  (2001)

We introduce, and numerically solve for decreasing thicknesses, particular toroidal and cylindrical shell problems which hold, due to load irregularity, an intermediate asymptotic behaviour. The numerical results are compared with those obtained applying a very recent asymptotic shell classification theory. Finally, we examine a local energy oscillation effect, with thickness-dependent frequency, that was found in all the problems treated. 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
Consideration to Computer Generated Force for Defence Systems
Authors: H. Akimoto, K. Ono, K. Kayama, K. Kawano, M. Yoshida
Venue: Proceedings of the Fourth International Conference on Computational Intelligence and Multimedia Applications (2001)

Now days, military training needs effective ways especially in country that has feweropportunities to train the forces using real entities.Considering this situation, virtual training system is one of solutions to bring up the military skill.The virtual training is based on simulation techniques to cope with variant battle situations.This paper introduces CGF (Computer Generated Forces ) that gives trainers variant situations in combat training.In the simulation, CGF acts as self-adjusting force against the trainer 's entity control action.Here, the entity expresses weapons.Here, construction of CGF applied simulation is discussed and some examples are introduced.
The XMLSPY Handbook
Authors: Larry Kim
Venue:  (2002)

:This is it -- the only XMLSPY reference book authorized by Altova, Inc. Written by a top XML "spy," it reveals all the secrets of this award-winning XML development environment, already used by more than 1 million registered users worldwide. Learn to create and validate documents, design XML Schemas and WSDL files, and build and debug XSLT stylesheets. Whether you're new to the Spy world or a veteran seeking faster, easier ways to build XML applications, this is the definitive handbook and the official textbook for XMLSPY training and certification.
Specification of Lexicon Structure
Authors: Simonetta Montemagni, Vito Pirrelli, Nicoletta Calzolari, Antonio Sanfilippo, Ted Briscoe, John Carroll, Glenn Carroll, Mats Rooth, Greg Grafenstette
Venue:  (1997)

The present deliverable overviews scope and type of the lexical information which will be aimed at in the phase of (semi)automatic acquisition of linguistic knowledge from text corpora (SPARKLE wp''s 5,6,7 and 8). The information is expressed here in the SPARKLE Description Language for Lexical Representation (hereafter S-DL), a lean, language-independent format for lexical encoding whose specifications are included as a part of this deliverable. It should be emphasised, incidentally, that, for the purposes of the project, information content matters more than format: this justifies our choice of a comparatively simple and flexible format for lexicon encoding, expressive enough to describe the entire range of acquired lexical information with a minimum formal apparatus. In some cases, this might have been achieved at the expenses of elegance and readability. TEL:: +39 50 560481
Formulae for Performance Optimization and Their Applications to Interconnect-Driven Floorplanning
Venue: Proceedings of the 3rd International Symposium on Quality Electronic Design (2002)

As the process technology advances into the deep submicron era, interconnect plays a dominant role in determining circuit performance. Buffer insertion/sizing and wire sizing are the most effective and popular techniques to reduce interconnect delay and are traditionally applied to post-layout optimization. As the SIA technology roadmap predicts, however, the number of interconnections among different blocks and that of buffers inserted in a chip for performance optimization will grow dramatically [17, 18]. It is obviously infeasible to insert/size hundreds of thousands buffers or wires during the post-layout stage when most routing regions are occupied.Therefore, it is critical to incorporate buffer-block and wire-size planning into floorplanning to ensure timing closure and design convergence.In this paper, we first derive continuous buffer insertion/sizing and wire sizing formulae for performance optimization under a more accurate wire model, and then apply the formulae to interconnect-driven floorplanning that considers not only the buffer-block planning addressed in [7], but also wire-size planning.Experimental results show that our approach achieves an average success rate of 93% of nets meeting timing constraints and consumes an average extra area of only 0.8% over the given floorplan, compared with the average success rate of 73% and extra area of 1.20% resulted from recent work in [7].
Supercomputing with VLSI
Authors: Swaminathan Manohar
Venue:  (1988)

Supercoprocessors (SCPs), highly parallel VLSI architectures tuned to solving a specific problem class, are shown to provide a means of cost-effective supercomputing. The use of a collection of such SCPs is advanced as a cost-effective supercomputing alternative. A methodology for building SCPs for different computation-intensive problems is described: two pragmatic constraints, namely problem-size independence and a limited-bandwidth constraint, are imposed on special-purpose architectures; a simple but powerful model of computation is used to derive general upper bounds on the speedup obtainable using such architectures. It is shown that bounds established by other authors for matrix multiplication and sorting, using problem-specific approaches, can be derived very simply using this model. Poisson Engine-I (PE-I), a prototype SCP, is a system for solving the Laplace equation using the finite difference approximation. Previous solutions for this problem either assumed the availability of unlimited number of processors or used complex processors with local memories. In contrast, PE-I uses a novel approach: asynchronous iteration methods are implemented using a fixed-size, synchronous array of simple processing elements. This results in a scalable, high-performance system with a rich set of solution algorithms. The simplicity of PE-I enables its throughput to be determined using analytical means. This is complemented by two software tools, PES and SPEC, which together make possible a comprehensive study and analysis of PE-I. The results obtained from these tools, combined with a detailed presentation of the implementation aspects of PE-I, show that, even with a moderate number of chips, PE-I can deliver throughputs greater than a billion operations per second. Architectural and algorithmic extensions to PE-I are briefly considered: the solution of a wider class of PDEs and the use of more sophisticated algorithms like the multigrid method are some of the issues addressed. The SCP methodology is applied to the problems of matrix-multiplication and sorting. For sorting, an SCP with superlinear speedup is outlined. For the matrix problem, the architecture and implementation details of SMP are described in detail. SMP, realized with about fifty chips using current technology, is capable of throughputs greater than 150 Mflops, and is also unique in being optimal with respect to the lower bound derived using the SCP model. 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
Reliability of a commercial telecommunications system
Authors: M. Kaaniche, K. Kanoun
Venue: Proceedings of the The Seventh International Symposium on Software Reliability Engineering (1996)

Analyzes data collected on a commercial telecommunications system and summarizes some of the lessons learned from this study. The data correspond to failure and fault information recorded during system validation and operation: 3,063 trouble reports, corresponding to a five-year period during which five versions of the system have been developed and more than 100 systems have been introduced in the field. The failure information includes software failures as well as hardware failures due to design faults.