ppxscal/embedding_network huggingface dataset:
Customizable Software Retrieval Facility for Mobile Computers Using Agents
Authors: Eduardo Mena, Arantza Illarramendi, Alfredo Goñi
Venue: Proceedings of the Seventh International Conference on Parallel and Distributed Systems: Workshops (2000)

Two tasks that entail a certain degree of difficulty when dealing with computers are retrieving and installing new software. Therefore, the need arises to provide users with tools that help them retrieve the necessary software and install it. In the context of mobile computers, those tasks acquire a special relevance due to their limited resources (memory, disk space, autonomy, etc.).In this paper, we present a software retrieval service that provides mobile computer users with mechanisms to select and retrieve the selected software in an easy and efficient way. Although this service can be used for fixed computers it puts special emphasis on optimizing the use of battery and wireless communications. The implementation of that software retrieval service is based on agent technology.
A simple architecture for ATM switching systems
Authors: Wang-Jiunn Cheng, Wen-Tsuen Chen
Venue: Proceedings of the Fourteenth Annual Joint Conference of the IEEE Computer and Communication Societies (Vol. 3)-Volume - Volume 3 (1995)

Proposes a new self-routing ATM switch. The switch is constructed based on a banyan network in which each inter-stage link is dilated by the stage number power of 2, each dilated link is concentrated from 2/sup d+1/ to 2/sup d/ multiple paths after stage d, and a new proposed shared-link design is used to reduce the cell blocking probabilities yielded by the concentration. By the scheme of interleaving the dilation, concentration, and sharing idle links after stage d, the new network has the advantages: (1) the delay-throughput performance is approximately the same as that of a knockout network with 2/sup d/ output links per output concentrator under the uniform traffic; (2) the hardware cost of network is of O(d2/sup d/nlogn)/spl ap/O(nlogn) as d is small; (3) the self-routing mechanism is very simple and identical to that of a banyan network; and (4) it is very feasible in VLSI design that only three simple and regular CMOS chips are enough to construct any size of ATM switch.
Ray Shooting Amidst Convex Polygons in 2D
Authors: K P Agarwal, Micha Sharir
Venue:  (1993)

We consider the problem of ray shooting in a two dimensional scene consisting of $m$ convex polygons with a total of $n$ edges. We present a data structure that requires $O(mn\log m)$ space and preprocessing time and that answers a ray shooting query in $O(\log^2 m \log^2 n)$ time. If the polygons are pairwise disjoint, the space and preprocessing time can be improved to $O((m^2 + n)\log m)$ and $O((m^2 + n \log n)\log m)$ respectively. Our algorithm also works for a collection of disjoint simple polygons. We also show that if we allow only $O(n)$ space, a ray shooting query among a collection of disjoint simple polygons can be answered in time $O(\left\lceil\: m/\sqrt{n}\: \right\rceil^{1+\varepsilon} \log^2 n)$ time, for any $\varepsilon < 0$.
On Minimizing the Number of Multiplications Necessary for Matrix Multiplication
Authors: John E. Hopcroft, Leslie R Kerr
Venue:  (1969)

This paper develops an algorithm to multiply a px2 matrix by a 2xn matrix in $\lceil (3pn+max(n,p))/2 \rceil$ multiplications for matrix multiplication without commutativity. The algorithm minimizes the number of multiplications for matrix multiplication without commutativity for the special cases p=1 or 2, n=1,2, $\cdots$ and p = 3, n = 3. It is shown that with commutativity fewer multiplications are required.
Automatic Detection of C{\tt ++}Programming Errors: Initial Thoughts on a {\sf lint{\tt ++}}
Authors: Scott Meyers, Moises Lejter
Venue:  (1991)

In this paper we argue that there is sufficient experience with C++ to justify the development of a tool that examines C++ programs for the presence of likely programmer errors, and we describe a number of common mistakes that could be detected by such a tool. We show that such a tool would be both straightforward to develop and efficient to apply. We also discuss how such a tool could be extended to detect violations of design constraints expressed in some as-yet-to-be-developed C++ metalanguage.
Certifying Information Flow Properties of Programs: An Axiomatic Aproach
Authors: Gregory R. Andrews, Richard P. Reitman
Venue:  (1978)

Interesting program properties other than functional correctness can be addressed and proved using axiomatic logic. An information flow logic that defines the flow semantics of a parallel programming language is presented. Proofs in this logic can be used to certify programs with respect to information security policies. The flow logic can also be combined with correctness logics to form even more powerful deductive systems. Keywords and phrases: Information flow, computer security, policy certification, program validation, proof rules, concurrency, synchronization.
The Design and Implementation of Electrically Heated Clothing
Authors: Kari Kukkonen
Venue: Proceedings of the 5th IEEE International Symposium on Wearable Computers (2001)

Modern fibre and textile materials and miniaturised electronic components enable implementation of smart clothes that enhance or augment the functionality of the ordinary clothing. Smart clothes together with palm top computers comprise applications that have an easy to use user interface. This paper describes the design and implementation of the electrically heated clothing prototype. The purpose of the prototype is to study the possibilities to augment usage temperature range of the clothing by providing an additional electrical heating option. A palm top computer based user interface is also presented and compared to other alternatives. Some disadvantages and improvements are also discussed.
Ciw Server Administrator Study Guide, 1 edition
Authors: James Stanger, Alan Grayson
Venue:  (2002)

:Here's the book you need to prepare for Exam 1D0-450, CIW Server Administrator. This Study Guide provides: In-depth coverage of official exam objective groups Practical information on managing Hundreds of challenging review questions, in the book and on the CD Leading-edge exam preparation software, including a testing engine and electronic flashcards Authoritative coverage of all exam topics, including: Creating password policies and permissions Implementing the Domain Name System (DNS) Selecting and implementing popular web servers Performing Secure Sockets Layer (SSL) transactions Analyzing server and service logs Evaluating system performance Configuring and managing news servers and e-mail servers Featured on the CD The enclosed CD is packed with vital preparation tools and materials, beginning with the Sybex EdgeTest testing engine for the exam. Loaded with hundreds of practice questions, it lets you test yourself chapter by chapter or according to objective areas. You'll also find electronic flashcards for PCs and Palm handhelds, along with two bonus exams that will help you prepare for the test. Also included is a complete electronic version of the book. About the Authors James Stanger, Master CIW Administrator, has over seven years experience in the IT industry. He has worked for ProsoftTraining as Course Director for the CIW Server Administrator and CIW Security Professional certifications since 1999. Alan Grayson has six years experience in the IT industry and is a CIW instructor currently teaching at Mercer University in Macon, Georgia.
Realtime Personal Positioning System for Wearable Computers
Authors: Hisashi Aoki, Bernt Schiele, Alex Pentland
Venue: Proceedings of the 3rd IEEE International Symposium on Wearable Computers (1999)

Context awareness is an important functionality for wearable computers. In particular, the computer should know where the person is in the environment. This paper proposes an image sequence matching technique for the recognition of locations and previously visited places. As in single word recognition in speech recognition, a dynamic programming algorithm is proposed for the calculation of the similarity of different locations. The system runs on a stand alone wearable computer such as a Libretto PC. Using a training sequence a dictionary of locations is created automatically. These locations are then be recognized by the system in realtime using a hat-mounted camera.
A Systolic Architecture for Almost Linear-Time Solution of the Symmetric Eigenvalue Problem
Authors: Richard P. Brent, Franklin T. Luk
Venue:  (1982)

An algorithm is presented for computing the eigenvalues and eigenvectors of an n x n real symmetric matrix. The algorithm is essentially a Jacobi method implemented on a two-dimensional systolic array of $O(n^{2})$ processors with nearest-neighbor communication between processors. The speedup over the serial Jacobi method is $\Theta(n^{2})$, so the algorithm converges to working accuracy in time $O(nS))$, where $S$ is the number of sweeps (typically $S \leq 10)$. Key Words and Phrases: Eigenvalue decomposition, real symmetric matrices, Hermitian matrices, Jacobi method, linear-time computation, systolic arrays, VLSI, real-time computation.
Building a Cyclic q-Clan
Authors: Stan E. Payne, Tim Penttila, Gordon F. Royle
Venue:  (1996)

For q = 2e letC be a q-clan whose associated generalized quadrangle GQ of order (q2, q) admits a collineation that acts as a cycle of length q + 1 on the lines through the special point (i). With some natural additional assumptions on the action of on certain subquadrangles of order q i.e., on the associated ovals, the q-clan C can be constructed from one carefully chosen matrix in C and the action of . With the help of computer computations this approach is used to construct new examples with q = 4 for k = 5, k = 6, k = 7 and k = 8. We conjecture that these examples belong to a new infinite family.
On Fibonacci search method with k-Lucas numbers
Authors: Bünyamin Yildiz, Erdal Karaduman
Venue: Applied Mathematics and Computation (2003)

In this paper, using k-Lucas numbers instead of conventional Fibonacci numbers and conventional Lucas numbers, we have made more improvements on location of the intervals containing optimal point in the classical Fibonacci search algorithm. For that aim, using a well known test function in Optimization Theory, a computer program was developed in MAPLE to examine this idea. It was shown that the our method is giving better results than the previous method in the sense that converging the optimal point more rapidly.
Performance Comparison of Location Areas and Reporting Centers Under Aggregate Movement Behavior Mobility Models
Authors: Huanjing Wang, Guangbin Fan, Jingyuan Zhang
Venue: Proceedings of the 2002 International Conference on Parallel Processing (2002)

Location management deals with how to track mobile users within the cellular network. It consists of two basic operations: location update and paging. The total location management cost is the sum of the location update cost and the paging cost. Location Areas and Reporting Centers are two popular location management schemes. The motivation for the study is the observation that the location update cost difference between the Reporting Centers scheme and the Location Areas scheme is small whereas the paging cost in the Reporting Centers scheme is larger than that in the Location Areas scheme. The papercompares the performance of the Location Areas scheme and the Reporting Centers scheme under aggregate movement behavior mobility models by simulations. Simulation results show that the Location Areas scheme performs about the same as the Reporting Centers scheme in two extreme cases, that is, when a few cells or almost all cells are selected as the reporting cells. However, the Location Areas scheme outperforms the Reporting Centers scheme at the 100% confidence level with all call-to-mobility ratios when the reporting cells divide the whole service area into several regions.
Algorithms for Iterative Array Multiplication
Authors: Shinji Nakamura
Venue:  (1986)

Algorithms for the parallel multiplication of two n bit binary numbers by an iterative array of logic cells are discussed. The regular interconnection structures of the multiplier array cell elements, which are ideal for VLSI implementation, are described. The speed and hardware complexity of two new iterative array algorithms, both of which require n cell delays for one n by n bit multiplication, are compared with a straight-forward iterative array algorithm having a 2n cell delay and its higher radix version having an n cell delay.
Composite primal/dual &#x221A;3-subdivision schemes
Authors: Peter Oswald, Peter Schröder
Venue: Computer Aided Geometric Design (2003)

We present new families of primal and dual subdivision schemes for triangle meshes and √3-refinement. The proposed schemes use two simple local rules which cycle between primal and dual meshes a number of times. The resulting surfaces become very smooth at regular vertices if the number of cycles is ≥ 2. The C1-property is violated only at low-valence irregular vertices, and can be restored by slight modifications of the local rules used.As a generalization, we introduce a wide class of composite subdivision schemes suitable for arbitrary topologies and refinement rules. A composite scheme is defined by a simple upsampling from the coarse to a refined topology, embedded into a cascade of geometric averaging operators acting on coarse and/or refined topologies. We propose a small set of such averaging rules (and some of their parametric extensions) which allow for the switching between control nets associated with the same or different topologic elements (vertices, edges, faces), and show a number of examples, based on triangles, that the resulting class of composite subdivision schemes contains new and old, primal and dual schemes for √3-refinement as well as for quadrisection. As a common observation from the examples considered, we found that irregular vertex treatment is necessary only at vertices of low valence, and can easily be implemented by using generic modifications of some elementary averaging rules.
A Visualization System for Web Local Search
Authors: B. Buttarazzi
Venue: Proceedings of the International Conference on Information Visualisation (2000)

Web visualization systems are widely used in browsing or viewing search engine results. In the case of web local search tool, however the browsing paradigm is combined with searching paradigm, thus requiring dynamic visualization methods. We describe an example of visualization system that is an extension of a common JavaScript used as a website map. It is interfaced with a Java-based local search tool named VSEARCH. Our system provides an easy-to-integrate mechanism to implement information visualization techniques like node coloring.
Perturbations of curvatures flow in a hyperbolic space
Authors: Nassar H. Abdel-All, H. N. Abd-Ellah
Venue: Applied Mathematics and Computation (2003)

A representation of a special type of the variational problem on a surface immersed in a hyperbolic space is given. The perturbations of the mean curvature functional are studied. For this study, the corresponding frames are constructed and the polar surfaces of a given surface is established. The technique adapted here is based on Cartan's methods of moving frames, exterior differential forms and the group of motions [Result. Math. 39 (2001) 1; Tensor. N.S. 51 (3) (1992) 224; Tensor. N.S. 59 (1998) 36; Collect. Math., universtat de Barcelona 45 (1994) 153].
Separating Text and Background in Degraded Document Images " A Comparison of Global Threshholding Techniques for Multi-Stage Threshholding
Authors: Graham Leedham, Saket Varma, Anish Patankar, Venu Govindarayu
Venue: Proceedings of the Eighth International Workshop on Frontiers in Handwriting Recognition (IWFHR'02) (2002)

Before any processing of the textual content of a document image can be performed the text must be separated from the background of the image. Several thresholding algorithms have previously been proposed and are widely used in document processing. None have been shown effective at thresholding difficult documents where the background and foreground are nonuniform. In this paper we investigate the use of three global thresholding algorithms (Otsu's, Kapur's entropy and Solihin's quadratic integral ratio (QIR)) as the first stage in a multi-stage thresholding algorithm for use in degraded document images. It is concluded that Otsu's and Kapur's algorithms do not work well for difficult documents as they tend to over-threshold the image, thus losing much of the useful information. The QIR algorithm is more accurate in separating the foreground and background in these images, leaving a range of undecided, fuzzy, pixels for later processing in a subsequent stage.
A variation on the PDP 11
Authors: Hal W. Jennings
Venue: ACM SIGARCH Computer Architecture News (1978)

This paper discusses some pros and cons of the very popular mini computer, the PDP 11, and suggests a variation on its architecture. The new architecture evolves through a few phases. The end result is a processer with variable length and width operands. This is particularly useful to support vector oriented languages such as APL.This processor has never been implemented and there are no plans to do so. There would be much more design work to do. It was originally intended to be implementable with a bit sliced microprocessor.
Improving branch prediction by dynamic dataflow-based identification of correlated branches from a large global history
Authors: Renju Thomas, Manoj Franklin, Chris Wilkerson, Jared Stark
Venue: Proceedings of the 30th annual international symposium on Computer architecture (2003)

Deep pipelines and fast clock rates are necessitating the development of high accuracy, multi-stage branch predictors for future processors. Such a predictor uses a collection of predictors, each of which provides its predictions at a different stage of the pipeline front-end. A simple 1-cycle latency line predictor provides predictions in the first stage, followed in a couple of stages later by predictions from a more accurate global predictor. Finally, one or two stages later, a highly accurate corrector predictor selectively corrects the global predictor's prediction. As the corrector predictor has the final say, its accuracy must be very high. The focus of this paper is to propose and evaluate techniques to build high-accuracy corrector predictors.Our techniques rely on using a long global history, and identifying correlated branches in this history by using runtime dataflow information. In particular, we identify for each dynamic branch a set of branches called "affectors", which control the computation that affect that branch's outcome. We propose efficient hardware structures to track dataflow and to identify the affector branches for each dynamic branch; the hardware overhead for identifying affectors for all dynamic branches from a 64 branch global history is only 312 bytes. We then propose two prediction schemes that put to use the affector branch information. Experimental studies show that adding an 8KB corrector predictor (that uses affector information) to a 16KB perceptron predictor (total size 24.2KB) reduces the average misprediction rate for 12 benchmarks from 6.3% to 5.7%, an improvement achieved only by a 64KB perceptron predictor.
Hierarchical test coverage
Authors: A. Herbert
Venue: Proceedings of the 1996 IEEE International Verilog HDL Conference (IVC '96) (1996)

The IOX productivity enhancement required to produce submicron, System On Silicon (SOS) products will come from high level synthesis and design reuse. SOS products will have an infrastructure which preserves the hierarchical structure of the original conceptual thinking. Time to market and quality goals will require the use of previously created and optimized tests for embedded subsystems. Production tests for embedded subsystems will be abstracted from the hierarchical structure of the SOS product. The solution presented describes a method for encapsulating hierarchical information within a test program. A tester architecture to facilitate hierarchical testing is also presented.
Macroscopic Quantitative Observation of Multi-Robot Behavior
Authors: Masahiro Kinoshita, Michiko Watanabe, Takashi Kawakami, Hiroshi Yokoi, Yokoi Kakazu
Venue: Proceedings of the Fourth International Conference on Computational Intelligence and Multimedia Applications (2001)

It is very difficult to estimate behaviors of multiple autonomous robots or mutualinteractions of them in real time.Therefore, we propose a quantitative observationapproach of multiple robots behaviors.This approach introduces thermodynamicmacroscopic state values to the multi-robot systems.The advantage of this approach is that it enables to observe the behaviors of autonomous robots in real world can bemapped to characteristic values in another conceptual state space.Thermodynamicmacroscopic state values, such as temperature, pressure and entropy, are defined inmobile robots systems.In our definition, each mobile robot is supposed a particle inthermodynamic systems.The experiment shows that the states of robots system can be classified by thermodynamic macroscopic state value.This verifies that the macroscopic quantitative observation is efficient and applicable to control multi-robot systems.
Teaching Students to Design Secure Systems
Authors: Jim Davis, Melissa Dark
Venue: IEEE Security and Privacy (2003)

The authors look more closely at determining an appropriate scope and sequence for information assurance (IA) and briefly describe a project whose goal is the articulation of an IA curriculum.
Using SICStus Objects in the design of Graphical User Interfaces
Authors: Thomas Sjöland
Venue:  (1992)

The functionalities of SICStus Objects, a system allowing object oriented programming in SICStus Prolog are shown and an example is presented: support software for building graphical user interfaces. This text assumes a basic knowledge about Prolog programming in SICStus Prolog and some intuition about object oriented programming. SICStus Objects was implemented as an embedded language in SICStus Prolog by Seif Haridi and Kent Boortz. SICStus Prolog is developed and maintained by Mats Carlsson, Stefan Andersson and Kent Boortz at SICS with support from Ellemtel Utvecklings AB.
Intelligent product mix and material match in electronics manufacturing
Authors: Sk Ahad Ali, Robert de Souza, Zahid Hossain
Venue: Neural, Parallel Scientific Computations (2003)

Genetic Algorithms (GA) are innovative search algorithms based on natural phenomena whose main advantages lie in solving mostly high complex problems. This paper provides how a conventional GA can effectively solve the Product Mix and Material Match problem. Some novel ideas in chromosome representation and evaluation are also addressed. This GA approach produces good results with fast convergence speed at the shop floor level, which is verified and validated via real world applications. The product mix and material match approach may help the manager to control the production of electronics manufacturing to meet the customer's demand.
Applying the Take-Grant Protection Model
Authors: Matt Bishop
Venue:  (1990)

The Take-Grant Protection Model has in the past been used to model multilevel security hierarchies and simple protection systems. The models are extended to include theft of rights and sharing of information, and additional security policies are examined. The analysis suggests that in some cases the basic rules of the Take-Grant Protection Model should be augmented to represent the policy properly; when appropriate, such modifications are made and their effects with respect to the policy and its Take-Grant representations are discussed 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