ppxscal/embedding_network huggingface dataset:
Integration process of visual and haptic information based on experiments about size perception of solid objects
Authors: Naohiro Fukumura, Shigenao Otane, Yoji Uno
Venue: Systems and Computers in Japan (2004)

When humans recognize external information, multiple kinds of sensory information are integrated and recognized in most cases. When a solid object is to be recognized, for example, not only visual information, but also somatosensory information and motor information obtained by actually grasping the object previously, are integrated for recognition. To investigate such integration processes for various kinds of sensory information in the brain, we performed some psychophysical experiments on the information processing involved in size perception of solid objects. First, an experiment on the estimation of object size by active finger movement and an experiment on the estimation of object size by passive finger movement were performed. The latter experiment revealed that even if the object size was the same, there was a large difference in the estimation of the object depending on the initial position at the start of estimation. It was also found that the difference in estimation was reduced if an opening-and-closing finger movement is performed immediately before estimation. Additional experiments were performed in order to investigate the factors that produce estimation difference from the viewpoint of the information transformation process. The results suggest that the difference originates from the module that calculates the inverse kinematics in order to compute the finger joint angle from the perceived size of the object. It is believed that the difference originates from redundancy in inverse kinematics. &copy; 2004 Wiley Periodicals, Inc. Syst Comp Jpn, 35(11): 24&ndash;38, 2004; Published online in Wiley InterScience (). DOI 10.1002&sol;scj.10399
Déjà vu, all over again
Authors: Tom Kean
Venue: IEEE Design Test (2005)

If you work in the same technical field long enough, you start to see history repeat itself: The more things change, the more they stay the same.
Experience in Implementing an HTTP Service Closure
Authors: Steven Schwartzberg, Alva Couch
Venue: Proceedings of the 18th USENIX conference on System administration (2004)

One ideal of configuration management is to specify only desired behavior in a high-level language, while an automatic configuration management system assures that behavior on an ongoing basis. We call a self-managing subsystem of this kind a closure. To better understand the nature of closures, we implemented an HTTP service closure on top of an Apache web server. While the procedure for building the server is imperative in nature, and the configuration language for the original server is declarative, the language for the closure must be transactional; i.e., based upon predictable and verifiable atomic changes in behavioral state. We study the desirable properties of such transactional configuration management languages, and conclude that these languages may well be the key to solving the change management problem for network configuration management.
Tree-decompositions of small pathwidth
Authors: Jan Arne Telle
Venue: Discrete Applied Mathematics (2005)

Motivated by the desire to speed up dynamic programming algorithms for graphs of bounded treewidth, we initiate a study of the tradeoff between width and pathwidth of tree-decompositions. We therefore investigate the catwidth parameter cat w (G) which is the minimum width of any tree-decomposition (T, X) of a graph G when the pathwidth pw(T) of the tree T is 1. The catwidth parameter lies between the treewidth and the pathwidth of the graph, tw(G) ≤ catw(G) ≤ pw(G), and just as treewidth relates to chordal graphs and pathwidth relates to interval graphs, catwidth relates to what we call catval graphs. We introduce the notion of an extended asteroidal triple (XAT) and characterize catval graphs as the XAT-free chordal graphs. We provide alternative characterizations of these graphs, show that there are graph classes for which the various parameters differ by an arbitrary amount, and consider algorithms for computing catwidth.
Digital Tapestry
Authors: Carsten Rother, Sanjiv Kumar, Vladimir Kolmogorov, Andrew Blake
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 1 - Volume 01 (2005)

This paper addresses the novel problem of automatically synthesizing an output image from a large collection of different input images. The synthesized image, called a digital tapestry, can be viewed as a visual summary or a virtual ýthumbnailý of all the images in the input collection. The problem of creating the tapestry is cast as a multi-class labeling problem such that each region in the tapestry is constructed from input image blocks that are salient and such that neighboring blocks satisfy spatial compatibility. This is formulated using a Markov Random Field and optimized via the graph cut based expansion move algorithm. The standard expansion move algorithm can only handle energies with metric terms, while our energy contains non-metric (soft and hard) constraints. Therefore we propose two novel contributions. First, we extend the expansion move algorithm for energy functions with non-metric hard constraints. Secondly, we modify it for functions with "almost" metric soft terms, and show that it gives good results in practice. The proposed framework was tested on several consumer photograph collections, and the results are presented.
Nonlinear Face Recognition Based on Maximum Average Margin Criterion
Authors: Baochang Zhang, Xilin Chen, Shiguang Shan, Wen Gao
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 1 - Volume 01 (2005)

This paper proposes a novel nonlinear discriminant analysis method named by Kernerlized Maximum Average Margin Criterion (KMAMC), which has combined the idea of Support Vector Machine with the Kernel Fisher Discriminant Analysis (KFD). We also use a simple method to prove the relationship between both kernel methods. The difference of KMAMC from traditional KFD methods include (1) the within-class and between-class scatter matrices are computed based on the support vectors instead of all the samples; (2) multiple centers are exploited instead of the single center in computing the two scatter matrices; (3) the discriminant criteria is formulated as subtracting the trace of within-class scatter matrix from that of the between-class scatter matrix, therefore, the tedious singularity problem is avoided. These features have made KMAMC more practical for real-world applications. Our experiments on two face databases, the FERET and CAS-PEAL face database, have illustrated its excellent performance compared with some traditional methods such as Eigenface, Fisherface, and KFD.
Dynamic paths in multi-domain optical networks for grids
Authors: S. van Oudenaarde, Z. Hendrikse, F. Dijkstra, L. Gommans, C. de Laat, R. J. Meijer
Venue: Future Generation Computer Systems (2005)

Many Grid applications require high bandwidth end-to-end connections between Grid resources in different domains. Fiber optic networks, owned by different providers, have to cooperate in a coordinated manner in order to provide an end-to-end connection. Currently, multi-domain optical network solutions require paper-based long-term contracts between administrative domains. This paper describes a solution for dynamically creating optical connections between different autonomous domains. This was implemented in the form of a Grid Service following the Open Grid Service Architecture. In our prototype, each switch belongs to a different network domain. Our Grid Service uses a toolkit based on the Generic Authorization, Authentication, and Accounting framework. This toolkit authorizes the use of optical infrastructure elements based on specific policies that are active within each domain. To complete our multi-domain authorization architecture, a Broker Service was also implemented. Our Broker Service interacts with the Grid Service instances to provide Grid application with a simplified way to set up end-to-end connections on demand.
Convex programming for scheduling unrelated parallel machines
Authors: Yossi Azar, Amir Epstein
Venue: Proceedings of the thirty-seventh annual ACM symposium on Theory of computing (2005)

We consider the classical problem of scheduling parallel unrelated machines. Each job is to be processed by exactly one machine. Processing job j on machine i requires time pij. The goal is to find a schedule that minimizes the lp norm. Previous work showed a 2-approximation algorithm for the problem with respect to the l∞ norm. For any fixed lp norm the previously known approximation algorithm has a performance of θ(p). We provide a 2-approximation algorithm for any fixed lp norm (p>1). This algorithm uses convex programming relaxation. We also give a √ 2-approximation algorithm for the l2 norm. This algorithm relies on convex quadratic programming relaxation. To the best of our knowledge, this is the first time that general convex programming techniques (apart from SDPs and CQPs) are used in the area of scheduling. We show for any given lp norm a PTAS for any fixed number of machines. We also consider the multidimensional generalization of the problem in which the jobs are d-dimensional. Here the goal is to minimize the lp norm of the generalized load vector, which is a matrix where the rows represent the machines and the columns represent the jobs dimension. For this problem we give a (d+1)-approximation algorithm for any fixed lp norm (p>1).
SRA: description of the SRA system as used for MUC-6
Authors: George R. Krupka
Venue: Proceedings of the 6th conference on Message understanding (1995)

SRA used the combination of two systems for the MUC-6 tasks: NameTag&trade;, a commercial software product that recognizes proper names and other key phrases in text; and HASTEN, an experimental text extraction system that has been under development for only one year. For the Named Entity task, SRA adapted a subset of NameTag's capabilities to the MUC-6 specification. For the Template Element task, SRA fed the full results of NameTag into HASTEN, which performed additional processing to extract and generate the organization and person templates. For the Scenario Template task, SRA fed NameTag's results into HASTEN, which used its full extraction capabilities to extract and generate the management succession templates. Figure 1 illustrates the contribution of each system to the MUC-6 tasks. Due to the relative complexity of the scenario template task, this paper will focus on HASTEN and the experimental results for scenario extraction, and will provide brief descriptions of NameTag and the other tasks.
A Self-Managed Predicate-Based Cache
Authors: Yaomin Fu, Peter Bodorik, Dawn Jutla
Venue: Proceedings of the 3rd Annual Communication Networks and Services Research Conference (2005)

Caching is used externally to DB systems to cache data retrieved from a DB in order to reduce delays associated with the network data transfer and to reduce the load on the DB servers. In-memory predicate caches manage data in units that are described by queriesý predicates. A self-managed cache utilizes only information that it can garner from queries issued by the applications and replies from the server. We use multiple buffers in a self-managed memory predicate cache. Management of storage is performed using classification of queries based on their join predicates ¿ each class of queries is assigned a separate buffer. We propose an allocation strategy to assign the limited memory space to the multiple buffers and evaluate the proposed scheme using the TPC-W benchmark.
Recursive approach of optimal Kalman filtering problem for multiparameter singularly perturbed systems
Authors: H. Mukaidani
Venue: International Journal of Systems Science (2005)

In this paper, the optimal Kalman filtering problem for multiparameter singularly perturbed systems is considered. In order to obtain the filter gain, the solution of the multiparameter algebraic Riccati equations (MAREs) is needed. The main contributions in this paper are to propose a new recursive algorithm for solving the MARE and to establish sufficient conditions related to the convergence property of the proposed algorithm. Using the recursive algorithm, it is shown that the solution of the MARE converges to a positive semidefinite stabilizing solution with the rate of convergence of O(||µ||i). Moreover, it is proved that the mean square error via the proposed high-order filter attain, the O(||µ||2i+1) approximation compared with the optimal filter.
Graphics matter: a case study of mobile phone keypad design for chinese input
Authors: Min Lin, Andrew Sears
Venue: CHI '05 extended abstracts on Human factors in computing systems (2005)

Developing more effective and efficient Chinese character input methods has the potential to help Chinese mobile phone users (currently 320 millions) input text messages. iTAP(R) supports input based on the writing structure of Chinese characters. Current keypad graphics include three items: digits (0-9), letters (A-Z), and symbols that represent the minimum writing units of Chinese characters (strokes). Our study revealed the difficulties of mapping these strokes to individual keys using the current symbols. We present a case study illustrating the user-centered redesign of these symbols. The new symbols allow for faster entry speeds and lower error rates as compared to the current commercial solution. Results with our solution were also favorable when compared to Pinyin, a popular cross-cultural solution relying on the Roman alphabet. The new design is in the process of being integrated into commercial mobile phones for users who would prefer native input methods for Chinese.
Supporting user-subjective categorization with self-organizing maps and learning vector quantization
Authors: Dina Goren-Bar, Tsvi Kuflik
Venue: Journal of the American Society for Information Science and Technology (2005)

Today, most document categorization in organizations is done manually. We save at work hundreds of files and e-mail messages in folders every day. While automatic document categorization has been widely studied, much challenging research still remains to support user-subjective categorization. This study evaluates and compares the application of self-organizing maps (SOMs) and learning vector quantization (LVQ) with automatic document classification, using a set of documents from an organization, in a specific domain, manually classified by a domain expert. After running the SOM and LVQ we requested the user to reclassify documents that were misclassified by the system. Results show that despite the subjective nature of human categorization, automatic document categorization methods correlate well with subjective, personal categorization, and the LVQ method outperforms the SOM. The reclassification process revealed an interesting pattern: About 40% of the documents were classified according to their original categorization, about 35% according to the system's categorization (the users changed the original categorization), and the remainder received a different (new) categorization. Based on these results we conclude that automatic support for subjective categorization is feasible; however, an exact match is probably impossible due to the users' changing categorization behavior.
Assessing the scalability of component-based frameworks: the CADENUS case study
Authors: S. D'Antonio, M. Esposito, S. P. Romano, G. Ventre
Venue: ACM SIGMETRICS Performance Evaluation Review (2004)

This paper proposes an approach to scalability analysis of component-based systems. A theoretical model of the orchestrated behavior of a system's components is developed and potential bottlenecks are identified. The model is derived by performing an analysis of the average number of messages that each involved entity has to deal with, i.e. receive, elaborate and possibly forward. By appropriately setting the various model parameters, it is possible to evaluate a system's behavior in a number of different scenarios. The model itself is based upon a queuing network paradigm, whereby each component is associated with a "service centre" characterized by specific values of both the message arrival rate and the service time: based on such values, the utilization coefficient of the service centers is computed and the potential bottlenecks are identified. The queuing network model is also exploited to evaluate the performance of the overall system under various configurations. The proposed approach is introduced and developed by taking the CADENUS system as a running example. CADENUS is a component-based framework designed and developed within a recent IST project, whose main goal resides in the provisioning of Premium IP services by means of an effective application of the so-called mediation paradigm.
From gridmap-file to VOMS: managing authorization in a Grid environment
Authors: R. Alfieri, R. Cecchini, V. Ciaschini, Luca dell'Agnello, Á Frohner, K. Lőrentey, F. Spataro
Venue: Future Generation Computer Systems (2005)

Grids are potentially composed of several thousands of users from different institutions sharing their computing resources (or using resources provided by third parties). Controlling access to these resources is a difficult problem, as it depends on the policies of the organizations the users belong to and of the resource owners. Moreover, a simple authorization implementation, based on a direct user registration on the resources, is not applicable to a large scale environment. In this paper, we describe the solution to this problem developed in the framework of the European DataGrid [M. Draoli, G. Mascari, R. Piccinelli, Project Presentation, DataGrid-11-NOT-0103-_1] and DataTAG [http://www.datatag.org/] projects: the Virtual Organization Membership Service (VOMS) [R. Alfieri, et al., Managing Dynamic User Communities in a Grid of Autonomous Resources, TUBT005, in: Proceedings of the CHEP 2003, 2003]. VOMS allows a fine grained control of the use of the resources both to the users' organizations and to the resource owners.
Radon-Based Structure from Motion without Correspondences
Authors: Ameesh Makadia, Christopher Geyer, Shankar Sastry, Kostas Daniilidis
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 1 - Volume 01 (2005)

We present a novel approach for the estimation of 3Dmotion directly from two images using the Radon transform. We assume a similarity function defined on the cross-product of two images which assigns a weight to all feature pairs. This similarity function is integrated over all feature pairs that satisfy the epipolar constraint. This integration is equivalent to filtering the similarity function with a Dirac function embedding the epipolar constraint. The result of this convolution is a function of the five unknownmotion parameters with maxima at the positions of compatible rigid motions. The breakthrough is in the realization that the Radon transform is a filtering operator: If we assume that images are defined on spheres and the epipolar constraint is a group action of two rotations on two spheres, then the Radon transform is a convolution/correlation integral. We propose a new algorithm to compute this integral from the spherical harmonics of the similarity and Dirac functions. The resulting resolution in the motion space depends on the bandwidth we keep from the spherical transform. The strength of the algorithm is in avoiding a commitment to correspondences, thus being robust to erroneous feature detection, outliers, and multiple motions. The algorithm has been tested in sequences of real omnidirectional images and it outperforms correspondence-based structure from motion.
Evaluation of a compiler with user-selectable execution strategies for parallel recursion
Authors: Yasuharu Mizutani, Daisuke Nakajima, Noriyuki Fujimoto, Kenichi Hagihara
Venue: Systems and Computers in Japan (2004)

The strategy of evenly distributing processors to each recursive call and the strategy of performing dynamic load-balancing exist as strategies for executing parallel recursions. There are cases in which an execution strategy efficient for a certain parallel recursive algorithm is not efficient for another parallel recursive algorithm depending on the operation of the parallel recursion algorithm. In addition, there are cases in which the execution efficiency decreases due to overparallelization of recursive calls due to factors such as the communication efficiency of a parallel computing environment. On the one hand, it is not easy for a compiler to analyze these factors mechanically from source programs of a parallel recursive algorithm, select an optimal execution strategy, and suppress overparallelization. In general, in many cases, a programmer understands parallel recursive algorithms and can predict which execution strategy is suitable for the algorithm. Thus, if a programmer can specify a parallel recursive execution strategy or specify a decision to suppress overparallelization, parallel recursive algorithms can be executed efficiently. This paper proposes a strategy for a programmer to clearly designate information useful for efficiently executing parallel recursion. In addition, it shows differences in the performance of various execution strategies of parallel recursive algorithms and shows the usefulness of a programmer having the capability to select an execution strategy. &copy; 2004 Wiley Periodicals, Inc. Syst Comp Jpn, 35(9): 92&ndash;103, 2004; Published online in Wiley InterScience (). DOI 10.1002&sol;scj.10009
Fermilab's Multi-Petabyte Scalable Mass Storage System
Authors: Gene Oleynik, Bonnie Alcorn, Wayne Baisley, Jon Bakken, David Berg, Eileen Berman, Chih-Hao Huang, Terry Jones, Robert D. Kennedy, Alexander Kulyavtsev, Alexander Moibenko, Timur Perelmutov, Don Petravick, Vladimir Podstavkov, George Szmuksta, Michael Zalokar
Venue: Proceedings of the 22nd IEEE / 13th NASA Goddard Conference on Mass Storage Systems and Technologies (2005)

Fermilab provides a multi-Petabyte scale mass storage system for High Energy Physics (HEP) Experiments and other scientific endeavors. We describe the scalability aspects of the hardware and software architecture that were designed into the Mass Storage System to permit us to scale to multiple petabytes of storage capacity, manage tens of terabytes per day in data transfers, support hundreds of users, and maintain data integrity. We discuss in detail how we scale the system over time to meet the ever-increasing needs of the scientific community, and relate our experiences with many of the technical and economic issues related to scaling the system. Since the 2003 MSST conference, the experiments at Fermilab have generated more than 1.9 PB of additional data. We present results on how this system has scaled and performed for the Fermilab CDF and D0 Run II experiments as well as other HEP experiments and scientific endeavors.
A Timing-Accurate HW/SW Co-Simulation of an ISS with SystemC
Authors: Luca Formaggio, Franco Fummi, Graziano Pravadelli
Venue: Proceedings of the international conference on Hardware/Software Codesign and System Synthesis: 2004 (2004)

The paper presents a system level co-simulation methodology for modeling, validating, and analyzing the performance of embedded systems. The proposed solution relies on the integration between an instruction set simulator (ISS) and the SystemC simulation kernel. In this way, the ISS is used to abstract the model of the real programmable device where the SW should run, while SystemC is used to model HW components that interact with the SW. A correct validation of such an architecture is infeasible without taking care of timing information. Thus, the paper proposes an effective timing synchronization mechanism, which uses timing information of an ISS (or a board) to synchronize the SystemC simulation.