ppxscal/embedding_network huggingface dataset:
New item response model with parameters which explains learning process and the application
Authors: Fumito Osawa
Venue: Systems and Computers in Japan (2005)

This paper presents a new item response model for the response time data obtained by computer tests. The method is applied to real data. In order to handle a large amount of calculations, a new calculation method is devised. Based on the information content obtained as a result of analysis, tests with a time limit for each item and tests with a time limit for the whole test are compared and discussed. In tests with an overall time limit, untouched items may occur, depending on the time limit. Considering such a situation, a new calculation method for the information content is proposed and applied to the data. As regards tests with a time limit for each item, the change in the item characteristics with real time and the improvement of parameter estimation accuracy are investigated. &copy; 2004 Wiley Periodicals, Inc. Syst Comp Jpn, 36(1): 99&ndash;106, 2005; Published online in Wiley InterScience (). DOI 10.1002&sol;scj.20007
Polynomial time approximation schemes for base station coverage with minimum total radii
Authors: Nissan Lev-Tov, David Peleg
Venue: Computer Networks and ISDN Systems (2005)

This paper concerns a geometric disk problem motivated by base station placement issues arising in wireless network design. The problem requires covering a given set of clients by a collection of disks of variable radii around a given set of base station locations while minimizing the sum of radii. A polynomial time approximation scheme is presented for this problem.
Dynamosaics: Video Mosaics with Non-Chronological Time
Authors: Alex Rav-Acha, Yael Pritch, Dani Lischinski, Shmuel Peleg
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 1 - Volume 01 (2005)

With the limited field of view of human vision, our perception of most scenes is built over time while our eyes are scanning the scene. In the case of static scenes this process can be modeled by panoramic mosaicing: stitching together images into a panoramic view. Can a dynamic scene, scanned by a video camera, be represented with a dynamic panoramic video even though different regions were visible at different times? In this paper we explore time flow manipulation in video, such as the creation of new videos in which events that occurred at different times are displayed simultaneously. More general changes in the time flow are also possible, which enable re-scheduling the order of dynamic events in the video, for example. We generate dynamic mosaics by sweeping the aligned space-time volume of the input video by a time front surface and generating a sequence of time slices in the process. Various sweeping strategies and different time front evolutions manipulate the time flow in the video, enabling many unexplored and powerful effects, such as panoramic movies.
Space monitoring of floods in Kazakhstan
Authors: L. Spivak, O. Arkhipkin, V. Pankratov, I. Vitkovskaya, G. Sagatdinova
Venue: Mathematics and Computers in Simulation (2004)

Floods are considerable menace for a part of the population of Kazakhstan living on the banks of large rivers, such as Irtish, Ural, Tobol, Ishim, etc. During spring snow thawing the volume of flow in these rivers increases, sometimes more than 1000 times sharply. They frequently go out of the banks and flood large territories. The maximal hoisting of water recorded in the river Ural in 1942, when the water was pushed up by 10-11 m above the normal level. The economical damage from flooding is estimated hundreds of millions of tenge (millions dollars).
Cross-linguistic phoneme correspondences
Authors: Lynne Cahill, Carole Tiberius
Venue: Proceedings of the 19th international conference on Computational linguistics - Volume 2 (2002)

Cross-linguistic phoneme correspondences, or metaphonemes, can be defined across languages which are relatively closely related in exactly the same way as correspondences can be defined for dialects, or accents, of a single language (e.g. O'Connor, 1973; Fitt, 2001). In this paper we present the theory of metaphonemes, comparing them with traditional archi- and morphophonemes as well as with similar work using "keysymbols" done for accents of English. We describe the metaphoneme inventory defined for Dutch, English and German, comparing the results for vowels and consonants. We also describe some of the unexpected information that arose from the analysis of cognate forms we undertook to find the metaphoneme correspondences.
SRI International: description of the TACITUS system as used for MUC-3
Authors: Jerry R. Hobbs
Venue: Proceedings of the 3rd conference on Message understanding (1991)

TACITUS is a system for interpreting natural language texts that has been under development since 1985. It has a preprocessor and postprocessor currently tailored to the MUC-3 application. It performs a syntactic analysis of the sentences in the text, using a fairly complete grammar of English, producing a logical form in first-order predicate calculus. Pragmatics problems are solved by abductive inference in a pragmatics, or interpretation, component.
Efficient Wait-Free Implementation of Multiword LL/SC Variables
Authors: Prasad Jayanti, Srdjan Petrovic
Venue: Proceedings of the 25th IEEE International Conference on Distributed Computing Systems (2005)

Since the design of lock-free data structures often poses a formidable intellectual challenge, researchers are constantly in search of abstractions and primitives that simplify this design. The multiword LL/SC object is such a primitive: many existing algorithms are based on this primitive, including the nonblocking and wait-free universal constructions [1], the closed objects construction [4] and the snapshot algorithms [12, 13]. In this paper, we consider the problem of implementing a W-word LL/SC object shared by N processes. The previous best algorithm, due to Anderson and Moir [1], is time optimal (LL and SC operations run in O(W) time), but has a space complexity of O(N²W). We present an algorithm that uses novel buffer management ideas to cut down the space complexity by a factor of N to O(NW), while still being time optimal.
On non-uniform multicommodity buy-at-bulk network design
Authors: Moses Charikar, Adriana Karagiozova
Venue: Proceedings of the thirty-seventh annual ACM symposium on Theory of computing (2005)

We study the multicommodity buy-at-bulk network design problem in which we seek to design a network that satisfies the demands between terminals from a given set of source-sink pairs. The key characteristic of this problem is the fact that the cost functions associated with the edges of the graph are sub-additive monotone and hence experience economies of scale. In the non-uniform case, each edge has its own cost function -- possibly different from other edges. Special cases of this problem have been studied extensively: there are approximation algorithms when the edge cost functions are identical or when all source-sink pairs share the same source. We present the first non-trivial approximation algorithm for the general case. Our algorithm is an extremely simple randomized greedy algorithm and has an approximation guarantee of exp(O√ln n ln ln n)) when the instance has at most n source-sink pairs with unit demands. In the case of general demands, this yields an approximation factor of exp(O √ln N ln ln N)), where N is the sum of all demands.
Robust Detection and Recognition of Buildings in Urban Environments from LADAR Data
Authors: R. Madhavan, T. Hong
Venue: Proceedings of the 33rd Applied Imagery Pattern Recognition Workshop (2004)

Successful Unmanned Ground Vehicle (UGV) navigation in urban areas requires the competence of the vehicle to cope with Global Positioning System (GPS) outages and/or unreliable position estimates due to multipathing. At the National Institute of Standards and Technology (NIST) we are developing registration algorithms using LADAR (LAser Detection And Ranging) data to cope with such scenarios. In this paper, we present a Building Detection and Recognition (BDR) algorithm using LADAR range images acquired from UGVs towards reliable and efficient registration. We verify the proposed algorithms using field data obtained from a Riegl LADAR range sensor mounted on a UGV operating in a variety of unknown urban environments. The presented results show the robustness and efficacy of the BDR algorithm.
Replay Detection in Broadcasting Sports Video
Authors: Xiaofeng Tong, Hanqing Lu, Qingshan Liu, Hongliang Jin
Venue: Proceedings of the Third International Conference on Image and Graphics (2004)

An effective replay detection method for broadcasting sports videos is proposed in this paper. The algorithm is composed of logos detection and replay recognition. Firstly, a logo-template is automatically extracted from logo-transition at the beginning of a video. It is further used to detect the other logos in the same video. Then, with taking logos as boundaries, the video can be divided into replay and non-replay segments. To identify replay segments, an SVM classifier with mid-level features is utilized. Experiments demonstrate the effectiveness of this method.
Template design for information extraction
Authors: Boyan Onyshkevych
Venue: Proceedings of the 5th conference on Message understanding (1993)

The design of the template for an information extraction application (or exercise) reflects the nature of the task and therefore crucially affects the success of the attempt to capture information from text. This paper addresses the template design requirement by discussing the general principles or desiderata of template design, object-oriented vs. flat template design, and template definition notation, all reflecting the results and lessons learned in the TIPSTER/MUC-5 template definition effort which is explicitly discussed in a Case Study in the last section of this paper.
The ABACUS Architectural Approach to Computer-Based System and Enterprise Evolution
Authors: Kyle Dunsire, Tim O'Neill, Mark Denford, John Leaney
Venue: Proceedings of the 12th IEEE International Conference and Workshops on Engineering of Computer-Based Systems (2005)

The enterprise computer-based systems employed by the organisations of today can be extremely complex. Not only do they consist of countless hardware and software products from many varied sources, but they often span continents, piggybacking on public networks. These systems are essential for undertaking business and general operations in the modern environment, and yet the ability of organisations to control their evolution is questionable. The emerging practice of enterprise architecture seeks to control that complexity through the use of a holistic and top-down perspective. However, the toolsets already in use, are very much bottom-up by nature. To overcome the limitations of current enterprise architecture practices, the authors propose the use of the ABACUS methodology and toolset. The authors conclude that by using ABACUS to analyse software and enterprise systems, architects can guide the design and evolution of architectures based on quantifiable non-functional requirements. Furthermore, hierarchical 3D visualisation provides a meaningful and intuitive means for conceiving and communicating complex architectures.
PS language definition
Authors: Portia Isaacson
Venue: ACM SIGDA Newsletter (1974)

The last few years has brought a number of changes to the digital system designer's parts inventory - mainly the addition of large scale integration components such as memories and processors. The solution of an information processing problem involves making the right choices from the variety of components offered and designing the hardware/software interface mechanisms between the components. Methods of simulating this new generation of digital systems are needed as tools. The demands placed on such a tool are great: it must (1) facilitate modeling of a digital system at various levels of architectural detail; (2) allow within a single model two components at quite different specification levels; (3) as a design progresses, allow replacement of models by more detailed models; (4) facilitate modeling of all types of components - hardware, firmware, and software; and (5) have a readily changeable parts library. PS is a tool for simulation of digital systems which meets these demands. In addition PS is designed to case the problem of communicating hardware/software mechanisms between people by automatically producing pictures of a system in its various states. These pictures can be used as a means of describing the system. The models produced by PS are called picture-system models [1, 2, 3].
Improving UML's definition of the use-case class
Authors: Sadahiro Isoda
Venue: Systems and Computers in Japan (2005)

UML is shown to contain two defects concerning the use-case class that originated in OOSE. These defects are: (1) the use-case class and its instances are unusually defined, and (2) a conjecture that is against the definition of a use case is introduced without any reason. These defects have been causing unnecessary confusion in UML's specification of the use-case class. An object-oriented real-world model is built that represents a typical situation of the employment of a use case in the analysis and design stages, and then another specification of the use-case class is constructed, which successfully solves the problems. &copy; 2005 Wiley Periodicals, Inc. Syst Comp Jpn, 36(6): 14&ndash;25, 2005; Published online in Wiley InterScience (). DOI 10.1002&sol;scj.20305
A complex Jacobi iterative method for the indefinite Helmholtz equation
Authors: G. Ronald Hadley
Venue: Journal of Computational Physics (2005)

An iterative procedure is described for the solution of the indefinite Helmholtz equation that is a two-step generalization of classic Jacobi iteration using complex iteration parameters. The method converges for well-posed problems at a rate dependent only upon the grid size, wavelength and the effective absorption seen by the field. The use of a simple Jacobi preconditioner allows the solution of 3D problems of interest in waveguide optics in reasonable runtimes on a personal computer with memory usage that scales linearly with the number of grid points. Both the iterative method and the preconditioner are fully parallelizable.
Review of "Boolean Functions and Computation Models by Peter Clote and Evangelos Kranakis", Springer-Verlag, 2002
Authors: R. Gregory Taylor
Venue: ACM SIGACT News (2004)

This wide-ranging monograph covers a number of research areas including Boolean functions and Boolean circuit families, propositional proof systems, sequential and parallel models of computation, and function algebras. If anything links them all together, it is surely complexity.
A Trust-Region Method for Nonlinear Bilevel Programming: Algorithm and Computational Experience
Authors: Benoît Colson, Patrice Marcotte, Gilles Savard
Venue: Computational Optimization and Applications (2005)

We consider the approximation of nonlinear bilevel mathematical programs by solvable programs of the same type, i.e., bilevel programs involving linear approximations of the upper-level objective and all constraint-defining functions, as well as a quadratic approximation of the lower-level objective. We describe the main features of the algorithm and the resulting software. Numerical experiments tend to confirm the promising behavior of the method.
Terrorist detection system
Authors: Yuval Elovici, Abraham Kandel, Mark Last, Bracha Shapira, Omer Zaafrany, Moti Schneider, Menahem Friedman
Venue: Proceedings of the 8th European Conference on Principles and Practice of Knowledge Discovery in Databases (2004)

Terrorist Detection System (TDS) is aimed at detecting suspicious users on the Internet by the content of information they access. TDS consists of two main modules: a training module activated in batch mode, and an on-line detection module. The training module is provided with web pages that include terror related content and learns the typical interests of terrorists by applying data mining algorithms to the training data. The detection module performs real-time monitoring on users traffic and analyzes the content of the pages they access. An alarm is issued upon detection of a user whose content of accessed pages is "too" similar to typical terrorist content. TDS feasibility was tested in a network environment. Its detection rate was better than the rate of a state of the art Intrusion Detection System based on anomaly detection.
Ant colony system with communication strategies
Authors: Shu-Chuan Chu, John F. Roddick, Jeng-Shyang Pan
Venue: Information Sciences&mdash;Informatics and Computer Science: An International Journal (2004)

In this paper an ant colony system (ACS) with communication strategies is developed. The artificial ants are partitioned into several groups. Seven communication methods for updating the pheromone level between groups in ACS are proposed and work on the traveling salesman problem using our system is presented. Experimental results based on three well-known traveling salesman data sets demonstrate the proposed ACS with communication strategies are superior to the existing ant colony system (ACS) and ant system (AS) with similar or better running times.
Towards Complete Generic Camera Calibration
Authors: Srikumar Ramalingam, Peter Sturm, Suresh K. Lodha
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 1 - Volume 01 (2005)

We consider the problem of calibrating a highly generic imaging model, that consists of a non-parametric association of a projection ray in 3D to every pixel in an image. Previous calibration approaches for this model do not seem to be directly applicable for cameras with large fields of view and non-central cameras. In this paper, we describe a complete calibration approach that should in principle be able to handle any camera that can be described by the generic imaging model. Initial calibration is performed using multiple images of overlapping calibration grids simultaneously. This is then improved using pose estimation and bundle adjustment-type algorithms. The approach has been applied on a wide variety of central and non-central cameras including fisheye lens, catadioptric cameras with spherical and hyperbolic mirrors, and multi-camera setups. We also consider the question if non-central models are more appropriate for certain cameras than central models.
A Cordic-Based Processor Extension for Scalar and Vector Processing
Authors: R. Farivar, M. Fazeli, H. Sarbazi-Azad
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 13 - Volume 14 (2005)

Trigonometric calculations play a significant role in scientific and multimedia applications. Such applications usually use vectors of data, thus it is essential to use SIMD-based computing for them. State of the art processors such as Pentium family processors have SIMD capabilities, MMX, SSE and SSE2 to name a few. But these extensions usually come short of performing trigonometric functions calculation. This paper presents a CORDIC-based vector processor extension to accelerate trigonometric calculations. The suggested architecture works with a vector of data, as well as scalar data. This architecture has been Synthesized both for FPGA and ASIC and the results have shown a significant improvement in throughput over conventional processors.
Fast Blind Equalization Using Complex-Valued MLP
Authors: Rajoo Pandey
Venue: Neural Processing Letters (2005)

The blind equalizers based on complex valued feedforward neural networks, for linear and nonlinear communication channels, yield better performance as compared to linear equalizers. The learning algorithms are, generally, based on stochastic gradient descent, as they are simple to implement. However, these algorithms show a slow convergence rate. In the blind equalization problem, the unavailability of the desired output signal and the presence of nonlinear activation functions make the application of recursive least squares algorithm difficult. In this letter, a new scheme using recursive least squares algorithm is proposed for blind equalization. The learning of weights of the output layer is obtained by using a modified version of constant modulus algorithm cost function. For the learning of weights of hidden layer neuron space adaptation approach is used. The proposed scheme results in faster convergence of the equalizer.
Support for Efficiently Processing Complex Queries over a P2P Substrate
Authors: Pedro Furtado
Venue: Proceedings of the 19th International Conference on Advanced Information Networking and Applications - Volume 2 (2005)

Recently, there has been some research emphasis on strategies to improve query functionality in Distributed Hash-Table-based (DHT) Peer-to-Peer (P2P) systems, but no approach was able to define how complex schemas and queries can be implemented efficiently on top of it. In this paper we propose a Peer Partitioned Data Management System (PPDM) for schema definition and query processing. We introduce "Schema Spaces" that allows complex schemas to be defined over a convenient set of nodes and define how simple and more complex schemas and queries are handled by the PPDM, laying the foundations for complex data management over P2P.
Binary refactoring: improving code behind the scenes
Authors: Eli Tilevich, Yannis Smaragdakis
Venue: Proceedings of the 27th international conference on Software engineering (2005)

We present Binary Refactoring: a software engineering technique for improving the implementation of programs without modifying their source code. While related to regular refactoring in preserving a program's functionality, binary refactoring aims to capture modifications that are often applied to source code, although they only improve the performance of the software application and not the code structure. We motivate binary refactoring, present a binary refactoring catalogue, describe the design and implementation of BARBER---our binary refactoring browser for Java, and demonstrate the usefulness of binary refactoring through a series of benchmarks.
Car racing through the streets of the web: a high-speed 3D game over a fast synchronization service
Authors: Stefano Cacciaguerra, Stefano Ferretti, Marco Roccetti, Matteo Roffilli
Venue: Special interest tracks and posters of the 14th international conference on World Wide Web (2005)

The growth of the Internet brought a new age for game developers. New exciting, highly interactive Massively Multiplayer Online Games (MMOGs) may be now deployed on the Web, thanks to new scalable distributed solutions and amazing 3D graphics systems plugged directly into standard browsers. Along this line, taking advantage of a mirrored game server architecture, we developed a 3D car racing multiplayer game for use over the Web, freely inspired to Armagetron. Game servers are kept synchronized through the use of a fast synchronization scheme which is able to drop obsolete game events to uphold the playability degree while preserving the game state consistency. Preliminary results confirm that smart 3D spaces may be created over the Web where the magic of gaming is reproduced for the pleasure of a huge number of players. This result may be obtained only by converging highly accurate event synchronization technologies with 3D scene graph based rendering software.