ppxscal/embedding_network huggingface dataset:
Stereoscopic video images for telerobotic applications
Authors: Manuel Ferre, Rafael Aracil, Manuel Navas
Venue: Journal of Robotic Systems (2005)

This article addresses the use of stereoscopic images in teleoperated tasks. Depth perception is a key point in the ability to skillfully manipulate in remote environments. Displaying three-dimensional images is a complex process but it is possible to design a teleoperation interface that displays stereoscopic images to assist in manipulation tasks. The appropriate interface for image viewing must be chosen and the stereoscopic video cameras must be calibrated so that the image disparity is natural for the observer. Attention is given to the calculation of stereoscopic image disparity, and suggestions are made as to the limits within which adequate stereoscopic image perception takes place. The authors have designed equipment for image visualization in teleoperated systems. These devices are described and their performance evaluated. Finally, an architecture for the transmission of stereoscopic video images via network is proposed, which in the future will substitute for current image processing devices. &copy; 2005 Wiley Periodicals, Inc.
Transformational question-answering (TQA) system: IBM, Yorktown Heights
Authors: F. J. Damerau, S. R. Petrick, M. Pivovonsky, W. J. Plath
Venue: Issue 79 (January 1982) (1982)

The Transformational Question Answering (TQA) system, formerly known as REQUEST [1,2,3], is an experimental natural English query system that has been under development since the early 1970s. Its syntactic analyzer is based upon transformational grammar [4,5,6,7], and its semantic interpreter makes use of a Knuth attribute grammar [8,9]. The combination of these components provides sufficient generality, convenience, and efficiency to implement a broad range of linguistic models. The particular model which was developed is closest to the generative semantics variety of transformational grammar.
CISCO networking academy program
Authors: Dragostina Grancharova
Venue: Proceedings of the 5th international conference on Computer systems and technologies (2004)

Changing the Way People Learn. The Cisco Networking Academy Program is a comprehensive e-learning program, which provides students with the Internet technology skills essential in a global economy. The Networking Academy program delivers Web-based content, online assessment, student performance tracking, hands-on-labs, instructor training and support, and preparation for industry standard certifications.
Real-time relief mapping on arbitrary polygonal surfaces
Authors: Fábio Policarpo, Manuel M. Oliveira, João L. D. Comba
Venue: Proceedings of the 2005 symposium on Interactive 3D graphics and games (2005)

This paper presents a technique for mapping relief textures onto arbitrary polygonal models in real time. In this approach, the mapping of the relief data is done in tangent space. As a result, it can be applied to polygonal representations of curved surfaces producing correct self-occlusions, interpenetrations, shadows and per-pixel lighting effects. The approach can be used to consistently add surface details to geometric models undergoing deformations, such as in the case of animated characters commonly found in games. The technique uses an inverse formulation (i.e., pixel driven) based on an efficient ray-height-field intersection algorithm implemented on the GPU. It supports extreme close-up views of the surfaces, mip mapping and anisotropic texture filtering. Also, contrary to high-dimensional representations of surface details, the low memory requirements of the proposed technique do not restrict its use to tiled textures.
An Intelligent Tutoring System for Program Semantics
Authors: Steve Barker, Paul Douglas
Venue: Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume I - Volume 01 (2005)

In this paper, we describe an item of e-learning software that is intended to help students taking university computer science courses to understand the fundamentals of logic programming and deductive database semantics. The software is implemented in PROLOG and empowers students to explore their understanding of the semantics of logic programs and deductive databases. The software is also able to intelligently diagnose student misconceptions and includes a number of example programs/databases that permit students to test their understanding. We describe the development and evaluation of the software, and we present details of the analysis of the results of our investigation into the effectiveness of our elearning tool. The results of our field study of the e-learning tool suggests that it of value in helping students to understand program and database semantics.
Story driven modeling: a practical guide to model driven software development
Authors: Albert Zündorf
Venue: Proceedings of the 27th international conference on Software engineering (2005)

The Rational Unified Process lacks practical guidance for the development of object oriented applications. Model Driven Software Development (MDD) proposes to do most of these development steps at the model level of abstraction. This tutorial takes the MDD idea and examplifies such a development process. The tutorial guides the user from textual requirements descriptions through UML scenario modeling to the derivation of test case specifications, class diagrams and UML behavior models and finally to the implementation of the desired system. The tutorial employs a running example that allows to illustrate the modeling activities for each development phase and the guidelines for each modeling step. We discuss how existing CASE tools may be used in such an approach and how the Fujaba environment supports our development process.
Book review: 1-2-3 Release 2.2 Business Applications by Thomas Miezejeski (Que Corporation, 1989)
Venue: ACM SIGSMALL/PC Notes (1991)

This is a book and disk set that provides templates of spreadsheets for Lotus 1-2-3 release 2.2 or 2.01. Some advanced features such as linking worksheets require release 2.2. These templates cover 13 accounting and business applications. The reader should have an intermediate to advanced knowledge of the 1-2-3 program and be familiar with accounting principles. Some of the templates contain macros and some contain custom menus. Some would need to be modified to be able to be used effectively in a business environment. They demonstrate the concepts and principles of the application but additional information for your particular business would need to be added to be practical and useful. Each worksheet can be used by itself or they can be used in combinations, an area where release 2.2's file linking is a benefit. 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
Fault-Hamiltonicity of Hypercube-Like Interconnection Networks
Authors: Jung-Heum Park, Hee-Chul Kim, Hyeong-Seok Lim
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01 (2005)

We call a graph G to be f-fault hamiltonian (resp. f-fault hamiltonian-connected) if there exists a hamiltonian cycle (resp. if each pair of vertices are joined by a hamiltonian path) in G\F for any set F of faultry elements with |F| ¿ f.In this paper, we deal with the graph G¿ and G¿ with n vertices each by n pairwise nonadjacent edges joining vertices in G¿ and vertices in G¿.Provided each G_i is f-fault hamiltonian-connected and f + 1-fault hamiltonian, 0 ¿ i ¿ 3, we show that G¿ ¿ G¿.Many interconnection networks such as hypercube-like interconnection networks can be represented in the form of G¿ ¿ ¿ connecting two lower dimensional networks G¿ and G¿.Applying our main results to a subclass of hypercube-like interconnection networks, called restricted HL-graphs, which include twisted cubes, crossed cubes, multiply twisted cubes, Möbius cubes, Mcubes, and generalized twisted cubes, we show that every restricted HL-graph of degree m(¿ 3) is m - 3-fault hamiltonian-connected and m - 2-fault hamiltonian.
Scheme of modeling and lifecycle in the development of Information Systems in Publishing Activity (ISPA)
Authors: Ivelin Mihailov
Venue: Proceedings of the 5th international conference on Computer systems and technologies (2004)

In the process of Information systems (IS) development in some of the spheres of social life, system analysts and software developers face difficulties caused by the specifics of the object sphere where a new IS has to be built or an existing one to be improved. This paper makes an attempt to:&bull;Systematize Lifecycle activities of Information systems in publishing activity (ISPA);&bull;Suggest a scheme for ISPA modeling;&bull;Suggest an ISPA Lifecycle model.
Dynamically Loadable Protocol Stacks: A Message Parser--Generator Implementation
Authors: Seng Kee Tan, Yu Ge, Kean Soon Tan, Chee Wei Ang, Nirmalya Ghosh
Venue: IEEE Internet Computing (2004)

Current network protocol implementations have their respective specifications embedded in their code. The network protocol stack is commonly modeled on the state machine and message parsing/generating functionalities. This article presents a different protocol design model. The model supports dynamically loadable protocol stacks, which are platform and language-independent. The model consists of a protocol engine and a set of protocol description rules. The engine utilizes the description rules for setting up the protocol stack dynamically. This approach is similar to the concept of script and script interpreter except that the protocol engine can dynamically set up the necessary instances of the protocol concerned. To exemplify the concept, we have successfully implemented the proposed model for a JAIN SIP stack to realize a totally dynamically loadable protocol.
A Multiresolution Time Domain Approach to RF Image Formation
Authors: Robert J. Bonneau
Venue: Proceedings of the 33rd Applied Imagery Pattern Recognition Workshop (2004)

Conventional image formation approaches rely on frequency domain Fourier methods to create images of objects. Most rely on integrating spatial resolution in the Fourier domain and do not accurately factor in the spatial aperture function to create an image because of the uniform spatial sampling necessary for the Fourier transform. We propose a multiresolution approach based on a Greens function inverse scattering method that allows us to solve for the object function directly in the time domain thereby allowing a more accurate rendering of the object in question.
On the effectiveness of prefetching and reuse in reducing L1 data cache traffic: a case study of Snort
Authors: G. Surendra, Subhasis Banerjee, S. K. Nandy
Venue: Proceedings of the 3rd workshop on Memory performance issues: in conjunction with the 31st international symposium on computer architecture (2004)

Reducing the number of data cache accesses improves performance, port efficiency, bandwidth and motivates the use of single ported caches instead of complex and expensive multi-ported ones. In this paper we consider an intrusion detection system as a target application and study the effectiveness of two techniques - (i) prefetching data from the cache into local buffers in the processor core and (ii) load Instruction Reuse (IR) - in reducing data cache traffic. The analysis is carried out using a microarchitecture and instruction set representative of a programmable processor with the aim of determining if the above techniques are viable for a programmable pattern matching engine found in many network processors. We find that IR is the most generic and efficient technique which reduces cache traffic by up to 60%. However, a combination of prefetching and IR with application specific tuning performs as well as and sometimes better than IR alone.
Improving recommendation lists through topic diversification
Authors: Cai-Nicolas Ziegler, Sean M. McNee, Joseph A. Konstan, Georg Lausen
Venue: Proceedings of the 14th international conference on World Wide Web (2005)

In this work we present topic diversification, a novel method designed to balance and diversify personalized recommendation lists in order to reflect the user's complete spectrum of interests. Though being detrimental to average accuracy, we show that our method improves user satisfaction with recommendation lists, in particular for lists generated using the common item-based collaborative filtering algorithm.Our work builds upon prior research on recommender systems, looking at properties of recommendation lists as entities in their own right rather than specifically focusing on the accuracy of individual recommendations. We introduce the intra-list similarity metric to assess the topical diversity of recommendation lists and the topic diversification approach for decreasing the intra-list similarity. We evaluate our method using book recommendation data, including offline analysis on 361, !, 349 ratings and an online study involving more than 2, !, 100 subjects.
ENEP: an interactive program for solving one-dimensional continuum mechanical problems using a graphic terminal (abstract)
Authors: Arne Sundström, Lars Westerling
Venue: ACM SIGNUM Newsletter (1975)

ENEP is a one-dimensional finite-difference Lagrangian code for calculating transient motion of various types of continua, including elastic-plastic media, high explosives, gases, and inviscid fluids. The program is interactive and written in Fortran at the Swedish National Defence Research Institute (FOA) for a PDP-10 (DEC System 10) computer with a TEKTRONIX 4012 Graphic Terminal. The program can only treat problems in one space coordinate, including however both plane, cylindrical, and spherical symmetry. The region of integration can be composed of up to 10 sub-regions with materials of different types, and the physical boundary conditions available are free or fixed boundary, a prescribed boundary velocity or a prescribed boundary pressure. Initially, each material may have a prescribed velocity or be at rest.
Internal firm rating model
Authors: Anatoliy Antonov, Yanka Yanakieva, Snezhina Petrova
Venue: Proceedings of the 5th international conference on Computer systems and technologies (2004)

Internal Rating Models are intended to evaluate the rating of counterparts using set of objective data and subjective criteria. The paper considers a firm rating model and its implementation using a rule-based approach and the CLIPS language to script the programming interface and the business logic. The script is interpreted by C++ application.
Acceleration of sweep-line technique by employing smart quicksort
Authors: David Podgorelec, Gregor Klajnšek
Venue: Information Sciences&mdash;Informatics and Computer Science: An International Journal (2005)

Quicksort is usually the best practical choice for sorting because it is, on average, remarkably efficient. Unfortunately, this popular algorithm has a significant drawback: the slowest performance is obtained in the simplest cases when input data are already initially sorted or only a slight perturbation occurs. In this paper, we propose a combination of quicksort and a new algorithm, which shows excellent time performance in sorting such crucial data arrays, and which is not much slower than quicksort in random cases. Our work was inspired by problems met when sorting polygon vertices in the sweep-line algorithms of computational geometry and, therefore, we have named the new algorithm 'vertex sort'. It splits the input array into three sub-arrays. Two of them are already sorted, and the third one is handled iteratively. A simple test decides whether to continue recursively with vertex sort or to employ quicksort in the second iteration. In this way, we achieve a situation where the worst case time complexity does not exceed the running times of quicksort, but the simplest cases are handled much faster (in linear time) than random cases. We have named the combined algorithm "smart quicksort' because of this desired property. In the last part of the paper, we prove its efficiency by employing it in a well-known sweep-line-based polygon triangulation algorithm.
Guided Sampling via Weak Motion Models and Outlier Sample Generation for Epipolar Geometry Estimation
Authors: Liran Goshen, Ilan Shimshoni
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 1 - Volume 01 (2005)

The problem of automatic robust estimation of the epipolar geometry in cases where the correspondences are contaminated with a high percentage of outliers is addressed. This situation often occurs when the images have undergone a significant deformation, either due to large rotation or wide baseline of the cameras. An accelerated algorithm for the identification of the false matches between the views is presented. The algorithm generates a set of weak motion models (WMMs). Each WMM roughly approximates the motion of correspondences from one image to the other. The algorithm represents the distribution of the median of the geometric distances of a correspondence to the WMMs as a mixture model of outlier correspondences and inlier correspondences. The algorithm generates an outlier correspondence sample from the data. This sample is used to estimate the outlier rate and to estimate the outlier pdf. Using these two pdfs the probability that each correspondence is an inlier is estimated. These probabilities enable to guide the sampling. In the RANSAC process this guided sampling accelerates the search process. The resulting algorithm when tested on real images achieves a speedup of between one or two orders of magnitude!
Machine mathematics: Problems and prospects
Authors: I. N. Molchanov
Venue: Cybernetics and Systems Analysis (2005)

"Pitfalls" are considered that arise during the implementation of theoretically justified algorithms of computational mathematics in solving scientific and technical problems and lead to computer solutions that have no physical meaning.
An interaction model for livestock farming and steppe ecosystem
Authors: S. Demberel, Nicholas N. Olenev, Igor G. Pospelov
Venue: Mathematics and Computers in Simulation (2004)

This work builds a macro model for livestock farming based on aggregation of initial micro description for rational control of total number of vintage livestock (age cohorts). Solution of an optimal problem for cohort total number of livestock gives the age limit for animals, the volume of the credits for the farm, the speed of slaughter, and the conditions on purchase of young animals. The integral equation for the equilibrium price of young animals is obtained. A steppe ecosystem model based on carbon cycle is constructed. The model takes into account some external influences. It is taken into account that the maintenance of animals damages the nature. Numerical experiments on the obtained ecological-economic model with the rational expectations are done by high performance computing on MVS 1000M at Joint Supercomputing Center (Moscow). On the basis of a base scenario the developments of processes in several alternatives are built and calculated. One scenario demonstrates a regime in which the area of natural pastures is reduced by the virtue of external human activity.
Creating a video device application
Authors: Kevin Septor
Venue: Journal of Computing Sciences in Colleges (2004)

A video device, such as a webcam or video capture card, has the capability to be used in may ways, such as for watching television, recording video, and behaving like a security camera. However, the video hardware and device driver the operating system uses to access it are only capable of delivering raw frames of video. A user space application is necessary for exploiting the capabilities of such a device beyond reading sequential frames of video. This research explores the requirements for a powerful video device application, and introduces a program that aims to fulfill these goals.
Information society revisited: from vision to reality
Authors: Bill Martin
Venue: Journal of Information Science (2005)

In this article a range of national and international policies, many tied to electronic business and electronic government initiatives, are reviewed from the much older perspective of the Information Society. As a concept, the Information Society has retained a form of residual currency but while not quite dormant, it has been overshadowed by what are essentially techno-economic New Economy perspectives. Although these techno-economic priorities can be viewed as contributing to the ultimate development of an Information Society, this contribution continues to fall somewhat short of what would be deemed sufficient. The shortfalls are particularly evident in the case of socially disadvantaged members of the community. In reviewing such developments mainly in Europe but with examples drawn from elsewhere, progress towards Information Society status is assessed in a social context that illustrates the gap that exists between aspiration and achievement in this regard.
Motion Segmentation of Multiple Translating Objects Using Line Correspondences
Authors: Fanhuai Shi, Jianhua Wang, Jing Zhang, Yuncai Liu
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 1 - Volume 01 (2005)

We present an algebraic approach to multibody motion segmentation from line correspondences. Given three perspective views containing multiple linearly moving objects, we demonstrate that after applying a polynomial embedding to the line correspondences, they became related by the so-called multibody line constrain of translational motions. We show how to linearly estimate the multibody trifocal epipole from line-line-line correspondences. The individual trifocal epipoles are then obtained from the derivatives of the multibody line constraint (up to an unknown factor). Given normalized trifocal epipoles, we can use any special clustering technique to obtain the clustering of the motions and the correspondences. The limitations of the proposed algorithm are also discussed. Experimental results on synthetic and real dynamic scenes are presented.
Luna: a flexible Java protection system
Authors: Chris Hawblitzel, Thorsten von Eicken
Venue: Proceedings of the 5th symposium on Operating systems design and implementationDue to copyright restrictions we are not able to make the PDFs for this conference available for downloading (2002)

Extensible Java systems face a difficult trade-off between sharing and protection. On one hand, Java's ability to run different protection domains in a single virtual machine enables domains to share data easily and communicate without address space switches. On the other hand, unrestricted sharing blurs the boundaries between protection domains, making it difficult to terminate domains and enforce restrictions on resource usage. Existing solutions to these problems restrict sharing in an ad-hoc fashion, ruling out many desirable programming styles.This paper presents an extension to Java's type system that systematically addresses the issues of data sharing, revocation, thread control, and resource control. Multiple tasks running in a single virtual machines share data using special remote pointers, which have different types from local pointers. The distinction between local and remote pointers allows the Java runtime system to mediate the communication between tasks without slowing down operations on ordinary pointers. The extensions to Java are implemented by a system called Luna, based on the Guavac and Marmot compilers, extended with special optimizations to support both fast inter-task communication and dynamic access control. The paper describes two applications written in Luna: a simple extensible web server, and an extension of the Squid web cache to support dynamic content generation.