ppxscal/embedding_network huggingface dataset:
Fine-grained authorization for job execution in the Grid: design and implementation: Research Articles
Authors: K. Keahey, V. Welch, S. Lang, B. Liu, S. Meder
Venue: Concurrency and Computation: Practice Experience (2004)

In this paper, we describe our work on enabling fine-grained authorization for resource usage and management. We address the need of virtual organizations to enforce their own polices in addition to those of the resource owners, with regards to both resource consumption and job management. To implement this design, we propose changes and extensions to the Globus Toolkit's version 2 resource management mechanism. We describe the prototype and policy language that we have designed to express fine-grained policies and present an analysis of our solution. Copyright &copy; 2004 John Wiley & Sons, Ltd.
Virtual pet: an exercise in XML & XSLT
Authors: Jeanine Meyer
Venue: Journal of Computing Sciences in Colleges (2004)

EXtensible Markup Language (XML) and eXtensible Stylesheet Language: Transformations (XSLT) are tools for creating and maintaining content-rich applications, such as Web documents. A virtual pet is a computer representation of a [simple] model of pet behavior incorporating mechanisms for owner actions. Starting with a HTML/JavaScript virtual dog script, the author describes the use of eXtended Markup Language (XML) and eXtended Stylesheet Language: Transformations (XSLT) to produce a generalized system for producing simulations. The project has been used in a course on creating user interfaces.
Derivatives of multidimensional Bernstein operators and smoothness
Authors: Feilong Cao
Venue: Journal of Approximation Theory (2005)

We characterize the directional derivatives of multidimensional Bernstein operators by a new measure of smoothness. This task is carried out by means of establishing the relation between the asymptotic behavior of the derivatives and the smoothness of the functions they approximate. The obtained results generalize the corresponding ones for univariate Bernstein operators.
System Capabilities, Requirements and Design of the GDL Gunfire Detection and Location System
Authors: Jamie Price, Carlos Maraviglia, William Seisler, Elmer Williams, Myron Pauli
Venue: Proceedings of the 33rd Applied Imagery Pattern Recognition Workshop (2004)

Using image processing techniques, the Gunfire Detection and Location (GDL) system detects gunfire and aims a suite of imagers at the muzzle flash point of origin. This detection and location function is critical for force and perimeter defense in densely populated areas as well as difficult operating environments such as a remote desert. This paper defines requirements of the GDL project. The GDL system is the result of research into using real-time image processing of mid-wave infrared imagery to detect gunfire and pin point its origin. Varieties of modern imagers are made available over the spectrum to aid an operator in assessing a detected signal. By using optical and acoustical methods, a design effort was launched to yield five vehicle based platforms. The hardware and algorithm used to implement the five basic functions is discussed in this paper. Issues such as component reliability, thermal issues, camera sensitivity operated during the daytime and nighttime, and optical design and bore sighting had to be united into a system designed to operate in the desert and powered from a High Mobility Multi-purpose Wheeled Vehicle (HMMWV). The design, construction and testing was conducted in nine months. The project has yielded a system architecture that will be further tested and refined in the next phase of this project. Experiences with the development phase of GDL and future directions are described in this paper.
A granulometric analysis of specular microscopy images of human corneal endothelia
Authors: V. Zapater, L. Martínez-Costa, G. Ayala
Venue: Computer Vision and Image Understanding (2005)

The inner layer of the human cornea, called the corneal endothelium, plays an important role in the maintenance of corneal transparency. Specular microscopy is the most widely used technique to study the corneal endothelium in vivo. Improvements in technology have allowed us to obtain good quality specular images, but the detection and quantification of small size-shape cell changes is not obvious, specially when the physician wants to evaluate endothelial cell changes after some surgical procedures. This paper proposes a methodology to analyze specular microscopy images. Every corneal endothelium is described by means of different cumulative distribution functions or some moments (mean, standard deviation, kurtosis, and skewness) of these distribution functions. These distributions are defined from different granulometries based on successive structural openings of the corneal endothelium. Changes in cell morphology are pointed out by comparing the cumulative distribution function (or the corresponding moments) of a given patient with the corresponding cumulative distribution functions (or their moments) of a group of age-matched controls. Different comparison procedures are given, providing us with different numerical evaluations of the corneal endothelium status. These new indices are compared with the classic descriptors used in commercial packages (density, hexagonality, and coefficient of variation of cell areas). Detailed analysis of different images of corneal endothelia are given using the classic and new indices jointly.
Utilizing context-awareness in office-type working life
Authors: Marika Tähti, Ville-Mikko Rautio, Leena Arhippainen
Venue: Proceedings of the 3rd international conference on Mobile and ubiquitous multimedia (2004)

This paper presents a context-aware mobile application for office-type working purposes. Via the user tests we have evaluated if this kind of application can support worker's daily life. In the experiments we had real users in real working environment. Our investigation illustrates that workers could utilize context-aware features to ease up their working routines such as keeping presentations. The results of this paper can help designers and developers to envision and implement future ubiquitous devices and environments.
Interacting Multiple Model Particle Filter to Adaptive Visual Tracking
Authors: Jianyu Wang, Debin Zhao, Wen Gao, Shiguang Shan
Venue: Proceedings of the Third International Conference on Image and Graphics (2004)

Visual tracking could be formulated as a state estimation problem of target representation based on observations in image sequences. Approaching visual tracking problem in the Bayesian filter framework, how to sample the state evolution model to generate hypothesis of high confidence level is a critical factor. In this paper, we introduce an Interacting Multiple Model Estimation (IMME) framework for adaptive visual tracking. The essence of the IMME framework is that the state is estimated by integrating several different models in parallel and by interacting among those modelsý estimates probabilistically. Based on the IMME framework, we propose a new variation of particle filter named Interacting Multiple Model Particle Filter (IMMPF), in which the hypotheses can be sampled from several different state evolution models adaptively. Experiments show that, when compared with the standard particle filter, the IMMPF generates better hypotheses resulting in better tracking results, especially when the target behaves along several motion modes randomly.
Schema mediation for large-scale semantic data sharing
Authors: Y. Halevy, G. Ives, Dan Suciu, Igor Tatarinov
Venue: The VLDB Journal &mdash; The International Journal on Very Large Data Bases (2005)

Intuitively, data management and data integration tools should be well suited for exchanging information in a semantically meaningful way. Unfortunately, they suffer from two significant problems: they typically require a common and comprehensive schema design before they can be used to store or share information, and they are difficult to extend because schema evolution is heavyweight and may break backward compatibility. As a result, many large-scale data sharing tasks are more easily facilitated by non-database-oriented tools that have little support for semantics.The goal of the peer data management system (PDMS) is to address this need: we propose the use of a decentralized, easily extensible data management architecture in which any user can contribute new data, schema information, or even mappings between other peers&#x2019; schemas. PDMSs represent a natural step beyond data integration systems, replacing their single logical schema with an interlinked collection of semantic mappings between peers&#x2019; individual schemas.This paper considers the problem of schema mediation in a PDMS. Our first contribution is a flexible language for mediating between peer schemas that extends known data integration formalisms to our more complex architecture. We precisely characterize the complexity of query answering for our language. Next, we describe a reformulation algorithm for our language that generalizes both global-as-view and local-as-view query answering algorithms. Then we describe several methods for optimizing the reformulation algorithm and an initial set of experiments studying its performance. Finally, we define and consider several global problems in managing semantic mappings in a PDMS.
New Results on Codes with Covering Radius 1 and Minimum Distance 2
Authors: Patric R. Östergård, Jörn Quistorff, Alfred Wassermann
Venue: Designs, Codes and Cryptography (2005)

The minimal cardinality of a q-ary code of length n and covering radius at most R is denoted by Kq(n, R); if we have the additional requirement that the minimum distance be at least d, it is denoted by Kq(n, R, d). Obviously, Kq(n, R, d) ¿ Kq(n, R). In this paper, we study instances for which Kq(n,1,2) > Kq(n, 1) and, in particular, determine K4(4,1,2)=28 > 24=K4(4,1).
Design and optimization of MOS current mode logic for parameter variations
Authors: Hassan Hassan, Mohab Anis, Mohamed Elmasry
Venue: Integration, the VLSI Journal (2005)

An automated optimization-based design strategy is proposed for MOS current mode logic (MCML) circuits to overcome the complexities of the design procedure. The proposed design methodology determines the values of the design variables that achieve minimum power dissipation while attaining the required performance. Furthermore, comprehensive analytical formulations of the design parameters associated with MCML circuits are presented to provide guidelines for MCML designers. The proposed design methodology has the advantages of speed, accuracy, and ability to include a large number of parameters in the design problem. Moreover, a formulation for the impact of parameter variations on MCML operation is presented. The proposed strategy is used to design two popular circuits in a 0.18 µm CMOS technology, namely; the ring oscillator and clock distribution network drivers with an average error from the required performance within 8%. The dependence of the circuit parameters on parameter variations is used with the design methodology to redesign the same circuits while considering parameter variations. Furthermore, the impact of parameter variations as technology scales down is investigated to highlight the importance of designing for variability in future CMOS technologies.
ENCAST: Energy-Critical Node Aware Spanning Tree for Sensor Networks
Authors: Shoudong Zou, Ioanis Nikolaidis, Janelle J. Harms
Venue: Proceedings of the 3rd Annual Communication Networks and Services Research Conference (2005)

Spanning trees rooted at a sink node are often employed for data collection in sensor networks. The nodeýs double task of sensing and forwarding traffic from other nodes results in energy depletion which is dependent on the constructed spanning tree. The approach taken in this paper is to extend the lifetime of a sensor network by judiciously recalculating the data collection tree to adjust it pro-actively before nodes fail due to total energy depletion. The proposed scheme attempts to make energy-critical nodes leaf nodes, or, as a last resort, to balance the traffic load handled by them. Additionally, an exponentially decaying threshold is used for adaptively characterizing nodes as critical. Simulations demonstrate significantly improved network lifetime but also point to the need to carefully set the thresholds for characterizing nodes as critical.
It's the FCC on the line
Authors: Meg McGinity Shannon
Venue: Communications of the ACM (2005)

Indecency is just one channel of a post-Powell FCC show.
Minimal-change integrity maintenance using tuple deletions
Authors: Jan Chomicki, Jerzy Marcinkowski
Venue: Information and Computation (2005)

We address the problem of minimal-change integrity maintenance in the context of integrity constraints in relational databases. We assume that integrity-restoration actions are limited to tuple deletions. We focus on two basic computational issues: repair checking (is a database instance a repair of a given database?) and consistent query answers [in: ACM Symposium on Principles of Database Systems (PODS), 1999, 68] (is a tuple an answer to a given query in every repair of a given database?). We study the computational complexity of both problems, delineating the boundary between the tractable and the intractable cases. We consider denial constraints, general functional and inclusion dependencies, as well as key and foreign key constraints. Our results shed light on the computational feasibility of minimal-change integrity maintenance. The tractable cases should lead to practical implementations. The intractability results highlight the inherent limitations of any integrity enforcement mechanism, e.g., triggers or referential constraint actions, as a way of performing minimal-change integrity maintenance.
An empirical evaluation of internet latency expansion
Authors: Hui Zhang, Ashish Goel, Ramesh Govindan
Venue: ACM SIGCOMM Computer Communication Review (2005)

The Internet's latency expansion determines the asymptotic performance of large-scale distributed systems (such as Peer-to-Peer systems), but previous studies on the Internet have defined expansion in terms of router-level hops. In this paper, we empirically determine the Internet's latency expansion characteristics using measurements from two different Internet topology datasets. Our results show that the Internet router-level topology exhibits a power-law latency expansion, in contrast to its exponential expansion rate in terms of hops.
An Improved Two-Step Approach to Hallucinating Faces
Authors: Yang Li, Xueyin Lin
Venue: Proceedings of the Third International Conference on Image and Graphics (2004)

Face hallucination is to synthesize a high-resolution facial image from a low-resolution input. In this paper, we present a new two-step approach to hallucinating faces motivated by the two-step algorithm of Liu et al. First, a linear relationship between both high-resolution and low-resolution facial images is established by applying PCA on both of them, and the global image, which is similar to the original high-resolution image, is reconstructed under a MAP criterion. Second, a linear model between the residual image (the difference between the original image and the global image) and the low-resolution residual image (the difference between the low-resolution input and the manually down-sampled global image) are built, and, following a MRF prior, the optimal residual image is estimated under a MAP criterion again. Experiments demonstrate that our approach can be applied to yield 4-8 fold super-resolution with high-quality hallucinated results.
Efficient browsing of digital libraries with the support of will-be-relevant information
Authors: Yanhua Qu, Keizo Sato, Makoto Nakashima, Tetsuro Ito
Venue: Systems and Computers in Japan (2004)

This paper discusses a method of efficient browsing in digital libraries arranged so that similar documents are placed close to each other. The basic idea is that some relevant documents exhibit a high similarity to the query, and some other relevant documents exhibit a high similarity to documents that the user has already judged to be relevant. Based on this idea, a general efficient browsing method is presented in which the system successively learns the results of relevance judgments by the user and suggests the relevance of the document to be examined in the following stage. A control procedure for browsing is derived in which the whole image of the document arrangement is revealed, while repeatedly performing browsing for various queries. The effectiveness of the proposed method was evaluated experimentally through comparison to the conventional method using ranking lists. Considering its use on the Internet, a navigator for browsing has also been designed. &copy; 2004 Wiley Periodicals, Inc. Syst Comp Jpn, 35(4): 36&ndash;48, 2004; Published online in Wiley InterScience (). DOI 10.1002&sol;scj.10080
Optimizing disk storage to support statistical analysis operations
Authors: Allen Parrish, Susan Vrbsky, Brandon Dixon, Weigang Ni
Venue: Decision Support Systems (2005)

Data stored in spreadsheets and relational database tables can be viewed as "worksheets" consisting of rows and columns, with rows corresponding to records. Correspondingly, the typical practice is to store the data on disk in row major order. While this practice is reasonable in many cases, it is not necessarily the best practice when computation is dominated by column-based statistics. This short note discusses the performance tradeoffs between row major and column major storage of data in the context of statistical data analysis. A comparison of a software package utilizing column major storage and one using row major storage confirms our results.
Load and Network Aware Query Routing for Information Integration
Authors: Wen-Syan Li, Vishal S. Batra, Vijayshankar Raman, Wei Han, K. Selcuk Candan, Inderpal Narang
Venue: Proceedings of the 21st International Conference on Data Engineering (2005)

Current federated systems deploy cost-based query optimization mechanisms; i.e., the optimizer selects a global query plan with the lowest cost to execute. Thus, cost functions influence what remote sources (i.e. equivalent data sources) to access and how federated queries are processed. In most federated systems, the underlying cost model is based on database statistics and query statements; however, the system load of remote sources and the dynamic nature of the network latency in wide area networks are not considered. As a result, federated query processing solutions can not adapt to runtime environment changes, such as network congestion or heavy workloads at remote sources. We present a novel system architecture that deploys a Query Cost Calibrator to calibrate the cost function based on system load and network latency at the remote sources and consequently indirectly "influences" query routing and load distribution in federated information systems.
Multi-unit auctions with budget-constrained bidders
Authors: Christian Borgs, Jennifer Chayes, Nicole Immorlica, Mohammad Mahdian, Amin Saberi
Venue: Proceedings of the 6th ACM conference on Electronic commerce (2005)

We study a multi-unit auction with multiple bidders, each of whom has a private valuation and a budget. The truthful mechanisms of such an auction are characterized, in the sense that, under standard assumptions, we prove that it is impossible to design a non-trivial truthful auction which allocates all units, while we provide the design of an asymptotically revenue-maximizing truthful mechanism which may allocate only some of the units. Our asymptotic parameter is a budget dominance parameter which measures the size of the budget of a single agent relative to the maximum revenue. We discuss the relevance of these results for the design of Internet ad auctions.
Portfolio Investment with the Exact Tax Basis via Nonlinear Programming
Authors: Victor DeMiguel, Raman Uppal
Venue: Management Science (2005)

Computing the optimal portfolio policy of an investor facing capital gains tax is a challenging problem: because the tax to be paid depends on the price at which the security was purchased (the tax basis), the optimal policy is path dependent and the size of the problem grows exponentially with the number of time periods. Dammon et al. (2001, 2002, 2004), Garlappi et al. (2001), and Gallmeyer et al. (2001) address this problem byapproximating the exact tax basis by the weighted average purchase price. Our contribution is threefold. First, we show that the structure of the problem has several attractive features that can be exploited to determine the optimal portfolio policy using theexact tax basis via nonlinear programming. Second, we characterize the optimal portfolio policy in the presence of capital gains tax when using theexact tax basis. Third, we show that the certainty equivalent loss from using the average tax basis instead of the exact basis is very small: it is typically less than 1% for problems with up to 10 periods, and this result is robust to the choice of parameter values and to the presence of transaction costs, dividends, intermediate consumption, labor income, tax reset provision at death, and wash-sale constraints.
The Distinctiveness, Detectability, and Robustness of Local Image Features
Authors: Gustavo Carneiro, Allan D. Jepson
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 2 - Volume 02 (2005)

We introduce a new method that characterizes typical local image features (e.g., SIFT [9], phase feature [3]) in terms of their distinctiveness, detectability, and robustness to image deformations. This is useful for the task of classifying local image features in terms of those three properties. The importance of this classification process for a recognition system using local features is as follows: a) reduce the recognition time due to a smaller number of features present in the test image and in the database of model features; b) improve the recognition accuracy since only the most useful features for the recognition task are kept in the model database; and c) increase the scalability of the recognition system given the smaller number of features per model. A discriminant classifier is trained to select well behaved feature points. A regression network is then trained to provide quantitative models of the detection distributions for each selected feature point. It is important to note that both the classifier and the regression network use image data alone as their input. Experimental results show that the use of these trained networks not only improves the performance of our recognition system, but it also significantly reduces the computation time for the recognition process.
The Pontryagin Maximum Principle and Transversality Conditions for a Class of Optimal Control Problems with Infinite Time Horizons
Authors: Sergei M. Aseev, Arkady V. Kryazhimskiy
Venue: SIAM Journal on Control and Optimization (2004)

This paper suggests some further developments in the theory of first-order necessary optimality conditions for problems of optimal control with infinite time horizons. We describe an approximation technique involving auxiliary finite-horizon optimal control problems and use it to prove new versions of the Pontryagin maximum principle. Special attention is paid to the behavior of the adjoint variables and the Hamiltonian. Typical cases, in which standard transversality conditions hold at infinity, are described. Several significant earlier results are generalized.