ppxscal/embedding_network huggingface dataset:
Robust object detection using a Radial Reach Filter (RRF)
Authors: Yutaka Satoh, Shun'ichi Kaneko, Yoshinori Niwa, Kazuhiko Yamamoto
Venue: Systems and Computers in Japan (2004)

In this paper the authors report on a new algorithm used to separate an object from its background using a background image. In the past, simple background subtraction has been used because of its low processing costs and ease of implementation. However, because this method depends solely on brightness patterns in the object and shadows, it has problems such as an inability to deal with poor lighting conditions and an inability to detect regions in which the brightness levels of the object and shadows are similar. In order to resolve these problems, in this paper the authors propose a new filter process called a Radial Reach Filter (RRF). The authors define a new statistic called a Radial Reach Correlation (RRC) used to determine on a pixel-by-pixel basis the similar and dissimilar areas between a background image and a current scene. They then evaluate the local texture at pixel-level resolution while reducing the effects of variations in lighting. In addition, by introducing a mechanism to adjust the defined region adaptively based on local characteristics of the background image, the authors are able to work with various shadows and objects in the scene. The authors perform a theoretical evaluation and experiments using real images to demonstrate the validity of their proposed method. &copy; 2004 Wiley Periodicals, Inc. Syst Comp Jpn, 35(10): 63&ndash;73, 2004; Published online in Wiley InterScience (). DOI 10.1002&sol;scj.10590
University of Durham: description of the LOLITA system as used in MUC-6
Authors: Richard Morgan, Roberto Garigliano, Paul Callaghan, Sanjay Poria, Mark Smith, Chris Cooper
Venue: Proceedings of the 6th conference on Message understanding (1995)

This document describes the LOLITA system and how it was extended to run the four MUC tasks, discusses the resulting system's performance on the required "walk-through" article, and then considers the performance of this system on the final evaluation set.
Recognition assistance treating errors in texts acquired from various recognition processes
Authors: Gábor Prószéky, Mátyás Naszódi, Balázs Kis
Venue: Proceedings of the 19th international conference on Computational linguistics - Volume 2 (2002)

Texts acquired from recognition sources---continuous speech/handwriting recognition and OCR---generally have three types of errors regardless of the characteristics of the source in particular. The output of the recognition process may be (1) poorly segmented or not segmented at all; (2) containing underspecified symbols (where the recognition process can only indicate that the symbol belongs to a specific group), e.g. shape codes; (3) containing incorrectly identified symbols. The project presented in this paper addresses these errors by developing of a unified linguistic framework called the MorphoLogic Recognition Assistant that provides feedback and corrections for various recognition processes. The framework uses customized morpho-syntactic and syntactic analysis where the lexicons and their alphabets correspond to the symbol set acquired from the recognition process. The successful framework must provide three services: (1) proper disambiguated segmentation, (2) disambiguation for underspecified symbols, (3) correction for incorrectly recognized symbols. The paper outlines the methods of morpho-syntactic and syntactic post-processing currently in use.
A general algorithm for output-sensitive visibility preprocessing
Authors: Samuli Laine
Venue: Proceedings of the 2005 symposium on Interactive 3D graphics and games (2005)

Occlusion culling based on precomputed visibility information is a standard method for accelerating the rendering in real-time graphics applications. In this paper we present a new general algorithm that performs the visibility precomputation for a group of viewcells in an output-sensitive fashion. This is achieved by exploiting the directional coherence of visibility between adjacent viewcells. The algorithm is independent of the underlying from-region visibility solver and is therefore applicable to exact, conservative and aggressive visibility solvers in both 2D and 3D.
Current demand balancing: a technique for minimization of current surge in high performance clock-gated microprocessors
Authors: Yiran Chen, Kaushik Roy, Cheng-Kok Koh
Venue: IEEE Transactions on Very Large Scale Integration (VLSI) Systems (2005)

In this paper, we propose an integrated architectural and physical planning approach to minimize the current surge in high-performance clock-gated microprocessors. In our approach, we use priority assignment optimization (PAO) and dynamic functional unit (FU) selection (DFS) to balance current demand in the floorplan. Two complementary methods--FU ordering with submodule design and issue pattern management--are also proposed to enhance the above techniques. Experimental results show that at the 0.18-µm technology node, the PAO can reduce the peak noise by 11.75% and consequently, the decoupling capacitance (Decap) requirement by 24.22% without any degradation in instructions per cycle (IPC). Moreover, an enhanced DFS reduces the peak noise by 13.39% as well as Decap requirement by 29.58%. Experiments at the 90-nm technology node show that our methodology can further reduce the peak noise and the Decap requirement by 16.57% and 44.85% with PAO, or 18.16% and 47.58% with DFS. We also show that our approach does not increase the clock period for 0.18-µm technology and beyond.
Proof of Conjectures on the True Dimension of Some Binary Goppa Codes
Authors: P. Véron
Venue: Designs, Codes and Cryptography (2005)

There is a classical lower bound on the dimension of a binary Goppa code. We survey results on some specific codes whose dimension exceeds this bound, and prove two conjectures on the true dimension of two classes of such codes.
Evaluation of Advanced TCP Stacks in the iSCSI Environment using Simulation Model
Authors: Girish Motwani, K. Gopinath
Venue: Proceedings of the 22nd IEEE / 13th NASA Goddard Conference on Mass Storage Systems and Technologies (2005)

Enterprise storage demands have overwhelmed traditional storage mechanisms and have led to the development of Storage Area Networks (SANs). This has resulted in the design of SCSI transport protocols that encapsulate SCSI commands and data for transfer over the network. Fiber channel protocol was the first such protocol that used Gigabit per second speed links to carry SCSI commands and data over long distances. However, with the emergence of Gigabit Ethernet and the iSCSI (Internet SCSI) protocol that maps the SCSI block oriented storage data over TCP/IP and enables storage devices to be accessed over standard Ethernet based TCP/IP networks, reduction in costs and a unified network infrastructure can be achieved. The iSCSI data flow is regulated by the TCP congestion control algorithm. The standard TCP Reno congestion control algorithm substantially under utilizes the network bandwidth over high speed connections for most applications. To address this limitation of TCP, variants of the TCP congestion control algorithm, designed for high bandwidth networks, such as FAST TCP, BIC-TCP, H-TCP, and Scalable TCP have been proposed. We use simulations and experiments to compare the performance of these TCP variants in an iSCSI environment. Our results indicate that H-TCP outperforms the other TCP variants in an iSCSI environment. However H-TCP results in unfair sharing of network bandwidth when simultaneous multiple flows exist. Performance obtained using BIC-TCP is only second to that using H-TCP and it is relatively fairer as compared to H-TCP.
Active networks
Authors: Bishal Thapa
Venue: Journal of Computing Sciences in Colleges (2005)

We examined a collection of problems relating to mobile and ubiquitous computing. This project allowed me to develop my interest in computer networks and apply mathematical ideas from graph theory and topology. Having done some previous work in a team-project where we developed an ad-hoc routing protocol, I wanted to move along with doing a research on self-assembly and self-organization of active networks.
Coverage of Formal Properties Based on a High-Level Fault Model and Functional ATPG
Authors: Franco Fummi, Graziano Pravadelli, Franco Toto
Venue: Proceedings of the 10th IEEE European Symposium on Test (2005)

The use of model checking to validate descriptions of digital systems lacks a coverage metrics. If the set of formal properties defined to prove the correctness of the design is incomplete, the verification can lead to a false sense of security. This paper refines, extends, and compares with other symbolic approaches, a methodology to estimate the incompleteness of formal properties, which exploits a high-level fault model and functional ATPG.
A Web Recommendation System Based on Maximum Entropy
Authors: Xin Jin, Bamshad Mobasher, Yanzan Zhou
Venue: Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume I - Volume 01 (2005)

In this paper, we propose a Web recommendation system based on a maximum entropy model. Under the maximum entropy principle, multiple sources of knowledge about users' navigational behavior in a Web site can be seamlessly combined to discover usage patterns and to automatically generate the most effective recommendations for new users with similar profiles. In this paper we integrate the knowledge from page-level clickstream statistics about users' past navigations with the aggregate usage patterns discovered through Web usage mining. Our experiment results show that our method can achieve better prediction accuracy when compared to standard recommendation approaches, while providing a better interpretation of Web users' diverse navigational behaviors.
Visualizing Tree Structures in Genetic Programming
Authors: Jason M. Daida, Adam M. Hilss, David J. Ward, Stephen L. Long
Venue: Genetic Programming and Evolvable Machines (2005)

This paper presents methods to visualize the structure of trees that occur in genetic programming. These methods allow for the inspection of structure of entire trees even though several thousands of nodes may be involved. The methods also scale to allow for the inspection of structure for entire populations and for complete trials even though millions of nodes may be involved. Examples are given that demonstrate how this new way of "seeing" can afford a potentially rich way of understanding dynamics that underpin genetic programming. The examples indicate further studies that might be enabled by visualizing structure at these scales.
Bounding vertex coloring by truncated multistage branch and bound
Authors: Massimiliano Caramia, Paolo Dell'Olmo
Venue: Networks (2004)

In this article we design a truncated enumerative algorithm based on branch and bound rules embedded in a multistage scheme that allows iterative visits of subgraphs. The algorithm is designed to find lower bounds on the chromatic number of graphs, and, by means of simple coloring extension rules, it is often capable of finding optimal solutions. In this issue we obtain a very promising result: our algorithm was able to solve benchmarks DSJC125&lowbar;5, DSJC125&lowbar;9, DSJC250&lowbar;1, DSJR500&lowbar;1c, and DSJR500&lowbar;5, which had not previously been solved. Furthermore, we show how our method can be employed in finding upper bounds on the chromatic number, and thus, we compare the upper bound&ndash;lower bound gaps so obtained with those achieved by known exact algorithms. The comparison highlights that in more than half of the tested benchmarks the gap obtained by our algorithm was lower than that obtained by a recent branch and cut method and by the well-known DSATUR algorithm. To provide a deeper analysis we finally compare the upper bounds found by the proposed algorithm on the same benchmarks with the best heuristic solutions known in the open literature. Also, in this case, the proposed truncated branch and bound was often able to outperform these heuristic solutions. &copy; 2004 Wiley Periodicals, Inc. NETWORKS, Vol. 44&lpar;4&rpar;, 231&ndash;242 2004
The Grid-DBMS: Towards Dynamic Data Management in Grid Environments
Authors: Giovanni Aloisio, Massimo Cafaro, Sandro Fiore, Maria Mirto
Venue: Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume II - Volume 02 (2005)

Nowadays many data grid applications need to manage and process a huge amount of data distributed across multiple grid nodes and stored into heterogeneous databases. Grids encourage the publication of scientific data in a more open manner than is currently the case, and many e-Science projects have an urgent need to interconnect legacy and independently operated databases through a set of data access and integration services. In the data grid area a set of dynamic and adaptive services could address specific issues related to automatic data management aiming at both providing high performance and fully exploiting a grid infrastructure. In this paper we introduce the Grid-DBMS concept, a framework for dynamic data management in grid environments, highlighting its requirements, architecture, components and services.
Adding structure to unstructured peer-to-peer networks: the use of small-world graphs
Authors: Shashidhar Merugu, Sridhar Srinivasan, Ellen Zegura
Venue: Journal of Parallel and Distributed Computing (2005)

The ''small-world'' graph structure is pervasive and is observed to arise ''without-design'' or ''naturally'' in many practical systems such as the World Wide Web. In contrast to natural systems, overlay networks provide an opportunity to design structure. We seek the advantages of designing overlay topologies with small-world properties to support file sharing in peer-to-peer networks. We focus on two metrics of performance: (a) search protocol performance, a local gain perceived directly by peer-to-peer network users and (b) network utilization, a global property that is of interest to network service providers. We propose a class of overlay topologies and show, by simulation, that a particular topology instance of this class where every node has many close neighbors and few random neighbors (i.e., a small-world graph) exhibits very good properties. In this overlay topology, the chances of locating files are high, and the nodes where these files are found are, on average, close to the query source. This improvement in search protocol performance is achieved while decreasing the traffic load on the links in the underlying network. We propose a simple greedy algorithm to construct such overlay topologies where each node operates independently and in a decentralized manner to select its neighbors.
Course Module: Formal Technical Reviews
Authors: Gregory W. Hislop
Venue: Proceedings of the 18th Conference on Software Engineering Education & Training (2005)

This paper describes a SWENET course module on formal technical reviews. The module provides an overview of software reviews, walkthroughs and inspections. It then focuses in more detail on formal technical reviews as an example of one review approach. The module is intended to provide about two hours of class lecture material and can be used in combination with an exercise that would take two to three hours. The module includes instructor tips, sample exercise instructions, and presentation slides.
Ubiquitous Mobility in Clinical Healthcare
Authors: Christopher Pavlovski, HeeSam Kim, David Wood
Venue: Proceedings of the IDEAS Workshop on Medical Information Systems: The Digital Hospital (2004)

This paper sets out a solution for providing physicians and nurses with access to a number of health care information systems whilst mobile in two clinical settings. Firstly supporting physicians whilst mobile within a hospital, and secondly whilst external to the hospital environment. This provides physicians with ubiquitous mobility in clinical healthcare. We first present results of our mobile health care solution that provided hospital professionals with access to patient data using a personal digital assistant (PDA) over a wireless local area network. We then extend our experiences of the eHospital solution together with several other projects that combine the use of a PDA over a GSM/CDMA mobile network for real-time access to information systems. By extending our experiences, we present our proven reference architecture for a secure enterprise mobile healthcare solution for hospital physicians and nurses. The solution furnishes access to several medical information systems whilst supporting a capability to roam within and outside the hospital environment. We accomplish this with seamless roaming between the 802.11 and GSM/CDMA mobile networks.
Demo: mobile database administrator-MDBA
Authors: Fernando Siqueira, Angelo Brayner
Venue: Proceedings of the 6th international conference on Mobile data management (2005)

Increasingly advances in mobile computing are allowing development of the applications for ubiquitous computing environment. Ubiquitous computing represents the concepts of computing everywhere, making computing and communication essentially transparent for users. This paper presents the MDBA (Mobile Data Base Administrator), a context-aware tool for remote data base administration that is executed in mobile devices. The MDBA enables database administrators (DBAs) to perform their tasks by automatically identifying databases and the wireless communication structure of a given ubiquitous computational environment. Therefore, the MDBA tool provides database administration services anywhere and anytime. Furthermore, the MDBA enables DBAs to manage databases residing in mobile hosts or fixed hosts.
QoS-Aware Software Components
Authors: Daniel A. Menasce
Venue: IEEE Internet Computing (2004)

In previous columns, Iýve discussed some of the challenges in quality of service (QoS) for Web services and the computation of response time in composite Web services. In this installment, I address the more general issue of QoS in service-oriented component-based distributed systems.
A Framework for Partitioning Computational Intensive Applications in Hybrid Reconfigurable Platforms
Authors: M. D. Galanis, A. Milidonis, G. Theodoridis, D. Soudris, C. E. Goutis
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 3 - Volume 04 (2005)

In this paper, we describe a prototype software framework that implements a formalized methodology for partitioning computational intensive applications between reconfigurable hardware blocks of different granularity. A hybrid granularity reconfigurable generic architecture is considered for this methodology, so as the methodology is applicable to a large variety of hybrid reconfigurable architectures. Although, the proposed framework is parametrical in respect to the mapping procedures to the fine- and coarse-grain reconfigurable units, we provide mapping algorithms for these types of hardware. The experimental results show the effectiveness of the functionality partitioning framework. We have validated the framework using two real-world applications, an OFDM transmitter and a JPEG encoder. For the OFDM transmitter, a maximum clock cycles decrease of 82% relative to an all fine-grain mapping solution is achieved. The performance improvement for the JPEG is 44%.
A remeshing approach to multiresolution modeling
Authors: Mario Botsch, Leif Kobbelt
Venue: Proceedings of the 2004 Eurographics/ACM SIGGRAPH symposium on Geometry processing (2004)

Providing a thorough mathematical foundation, multiresolution modeling is the standard approach for global surface deformations that preserve fine surface details in an intuitive and plausible manner. A given shape is decomposed into a smooth low-frequency base surface and high-frequency detail information. Adding these details back onto a deformed version of the base surface results in the desired modification. Using a suitable detail encoding, the connectivity of the base surface is not restricted to be the same as that of the original surface. We propose to exploit this degree of freedom to improve both robustness and efficiency of multiresolution shape editing.In several approaches the modified base surface is computed by solving a linear system of discretized Laplacians. By remeshing the base surface such that the Voronoi areas of its vertices are equalized, we turn the unsymmetric surface-related linear system into a symmetric one, such that simpler, more robust, and more efficient solvers can be applied. The high regularity of the remeshed base surface further removes numerical problems caused by mesh degeneracies and results in a better discretization of the Laplacian operator.The remeshing is performed on the low-frequency base surface only, while the connectivity of the original surface is kept fixed. Hence, this functionality can be encapsulated inside a multiresolution kernel and is thus completely hidden from the user.
Not a mellifluous march to maturity
Authors: Shane Greenstein
Venue: IEEE Micro (2005)

A couple years ago, former Hewlett-Packard CEO Carly Fiorina proposed merging Hewlett-Packard and Compaq, even in the face of opposition from the HP heirs. She argued that the maturity of the computer market necessitated such a change. More recently, Oracle CEO Larry Ellison foresaw maturation in his market. It too was justification (in his eyes) for his hostile takeover of PeopleSoft.
Enterprise access policy enforcement for applications through hybrid models and XSLT technologies
Authors: Ramaswamy Chandramouli
Venue: Proceedings of the 6th international conference on Electronic commerce (2004)

E-government systems like web portals provide various services to citizens. Information handled in these e-government systems are subject to multiple laws encompassing privacy, non-disclosure (confidentiality) and integrity policies. Hence the protection means for regulating access to this information should be policy driven. Policy-based access control is one such protection approach and has been incorporated into Enterprise Security Management (ESM) solutions. However, the existing ESM solutions have their limitations in entitlements (authorizations or permissions) specification, policy specification and policy verification capabilities. Further there is lack of transparency with respect to the process of mapping enterprise-level authorizations to individual application-level (target system-level) entitlements. To address these deficiencies, we developed E-PBAC, a framework and an associated set of tools as an ESM solution. E-PBAC uses XML to encode entitlement specifications based on a hybrid access control model that combines the Role-based Access Control Model (RBAC) and Domain Type Enforcement Model (DTE). It uses XSLT to encode policy rules and uses XSLT processor to perform policy verification as well as to map entitlements to various target systems.
A Real-Time Image Recognition System for Tiny Autonomous Mobile Robots
Authors: Stefan Mahlknecht, Roland Oberhammer, Gregor Novak
Venue: Real-Time Systems (2005)

Intelligent sensors for mobile robots play an important role in many technical applications. In this paper a real-time image recognition system for a tiny autonomous mobile robot is presented, capable of detecting objects in real-time at a frame rate of up to 60 frames/s. The image recognition module has very low power consumption of less than 250 mW and fits into a package of only 35 × 35 mm including a CMOS camera and a low power, high performance signal processor. We propose an object recognition algorithm that is optimized for deeply embedded systems used in energy and performance constrained devices. The algorithm is based on a combination of edge and color detection and uses a fixed model for each object to be recognized. Results of the ball recognition application show that its relative polar coordinates are found within 11 ms.