ppxscal/embedding_network huggingface dataset:
Comparing Learning Attention Control in Perceptual and Decision Space
Authors: Maryam S. Mirian, Majid Nili Ahmadabadi, Babak N. Araabi, Ronald R. Siegwart
Venue: Attention in Cognitive Systems: 5th International Workshop on Attention in Cognitive Systems, WAPCV 2008 Fira, Santorini, Greece, May 12, 2008 Revised Selected Papers (2009)

The first question answered in this paper is whether or not learning attention control in the decision space is feasible and how to develop an online as well as interactive learning approach for such control in this space, in case of feasibility. Here, decision space is formed by the decision vector of the agents each has allowed to dynamically observe just a subset of all available sensors. Attention control in this new space means active and dynamic selection of these decision agents to contribute in making final decision. The second debate is verifying the advantages of attention control in decision space over that in perceptual space. According to the tight coupling of attention control and motor action selection, in order to answer above mentioned questions, attention control and motor action selection are formulated in a unified optimization problem and reinforcement learning is utilized to solve it. In addition to the theoretic comparison of learning attention control in perceptual and decision space in terms of computational complexity, two proposed approaches are tested on a simple traffic sign recognition task.
Sibling Distance for Rooted Labeled Trees
Authors: Taku Aratsu, Kouichi Hirata, Tetsuji Kuboyama
Venue: New Frontiers in Applied Data Mining: PAKDD 2008 International Workshops, Osaka, Japan, May 20-23, 2008. Revised Selected Papers (2009)

In this paper, we introduce a sibling distance &delta; s for rooted labeled trees as an L 1-distance between their sibling histograms, which consist of the frequencies of every pair of the label of a node and the sequence of labels of its children. Then, we show that &delta; s gives a constant factor lower bound on the tree edit distance &delta; such that &delta; s (T 1,T 2)&thinsp;&le;&thinsp;4&delta;(T 1,T 2). Next, we design the algorithm to compute the sibling histogram in O(n) time for ordered trees and in O(gn) time for unordered trees, where n and g are the number of nodes and the degree of a tree. Finally, we give experimental results by applying the sibling distance to glycan data.
Modified on-demand multicasting routing protocol for ad hoc networks
Authors: Amjad Hudaib, Khalid Kaabneh, Mohamad Qatawneh
Venue: WSEAS Transactions on Information Science and Applications (2009)

This paper proposes and simulates a new ad hoc multicasting routing protocol called Modified On-Demand Multicast Routing Protocol (MODMRP). The MODMRP is based on On-Demand Multicasting Routing Protocol (ODMRP). MODMRP suggests two approaches aimed to reduce the service traffic; the local detection of routes and the information usage on the channels condition during the route information update timer values. The goal of MODMRP is to improve packet delivery efficiency. Through a course of simulation experiments, the MODMRP is compared to the ODMRP in reference to number factors such as Ratio of Packets Delivery and transmission delays. The Simulation results show an increase in the percentage of delivered multicast datagram on an average of 2% and a routing overhead costs decreased on average of 20.5% when compared to ODMRP.
A new approach to secure logging
Authors: Di Ma, Gene Tsudik
Venue: ACM Transactions on Storage (TOS) (2009)

The need for secure logging is well-understood by the security professionals, including both researchers and practitioners. The ability to efficiently verify all (or some) log entries is important to any application employing secure logging techniques. In this article, we begin by examining the state of the art in secure logging and identify some problems inherent to systems based on trusted third-party servers. We then propose a different approach to secure logging based upon recently developed Forward-Secure Sequential Aggregate (FssAgg) authentication techniques. Our approach offers both space-efficiency and provable security. We illustrate two concrete schemes&mdash;one private-verifiable and one public-verifiable&mdash;that offer practical secure logging without any reliance on online trusted third parties or secure hardware. We also investigate the concept of immutability in the context of forward-secure sequential aggregate authentication to provide finer grained verification. Finally we evaluate proposed schemes and report on our experience with implementing them within a secure logging system.
Regularities in musical texts resulted from rank-frequency distribution of pitch
Authors: Zuzana Martináková-Rendekov&aacute
Venue: Proceedings of the 8th conference on Systems theory and scientific computation (2008)

The aim of this study is to find the musicological explanation of the discovered fixed points and regularities in musical texts. In previous studies [7, 8, 9] the analysis based on rank-frequency distributions of tone pitches has been described and the following indicators: h-point and its angle, the a-indicator, the H-point and the H-coverage having an affinity to the golden section were tested. The analysis has been performed on more than two hundreds compositions written by 12 European composers from the Renaissance (Palestrina) to the 20th century (Ligeti). In this study we try to explain the results gained by mathematical and statistical methods and to find the musicological interpretation for them.
A Fast and Simple Algorithm for Computing Market Equilibria
Authors: Lisa Fleischer, Rahul Garg, Sanjiv Kapoor, Rohit Khandekar, Amin Saberi
Venue: Proceedings of the 4th International Workshop on Internet and Network Economics (2008)

We give a new mathematical formulation of market equilibria using an indirect utility function: the function of prices and income that gives the maximum utility achievable. The formulation is a convex program and can be solved when the indirect utility function is convex in prices. We illustrate that many economies including Homogeneous utilities of degree &alpha;&thinsp;&isin;&thinsp;[0,1] in Fisher economies &mdash; this includes Linear, Leontief, Cobb-Douglas Resource allocation utilities like multi-commodity flows satisfy this condition and can be efficiently solved. Further, we give a natural and decentralized price-adjusting algorithm in these economies. Our algorithm, mimics the natural t&acirc;tonnement dynamics for the markets as suggested by Walras: it iteratively adjusts a good's price upward when the demand for that good under current prices exceeds its supply; and downward when its supply exceeds its demand. The algorithm computes an approximate equilibrium in a number of iterations that is independent of the number of traders and is almost linear in the number of goods. Interestingly, our algorithm applies to certain classes of utility functions that are not weak gross substitutes.
A Method for Grouping Symbol Nodes of Group Shuffled BP Decoding Algorithm
Authors: Yoshiyuki Sato, Gou Hosoya, Hideki Yagi, Shigeichi Hirasawa
Venue: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences (2008)

In this paper, we propose a method for enhancing performance of a sequential version of the belief-propagation (BP) decoding algorithm, the group shuffled BP decoding algorithm for low-density parity-check (LDPC) codes. An improved BP decoding algorithm, called the shuffled BP decoding algorithm, decodes each symbol node in serial at each iteration. To reduce the decoding delay of the shuffled BP decoding algorithm, the group shuffled BP decoding algorithm divides all symbol nodes into several groups. In contrast to the original group shuffled BP, which automatically generates groups according to symbol positions, in this paper we propose a method for grouping symbol nodes which generates groups according to the structure of a Tanner graph of the codes. The proposed method can accelerate the convergence of the group shuffled BP algorithm and obtain a lower error rate in a small number of iterations. We show by simulation results that the decoding performance of the proposed method is improved compared with those of the shuffled BP decoding algorithm and the group shuffled BP decoding algorithm.
Parameterized complexity of finding regular induced subgraphs
Authors: Hannes Moser, Dimitrios M. Thilikos
Venue: Journal of Discrete Algorithms (2009)

The r-Regular Induced Subgraph problem asks, given a graph G and a non-negative integer k, whether G contains an r-regular induced subgraph of size at least k, that is, an induced subgraph in which every vertex has degree exactly r. In this paper we examine its parameterization k-Sizer-Regular Induced Subgraph with k as parameter and prove that it is W[1]-hard. We also examine the parameterized complexity of the dual parameterized problem, namely, the k-Almostr-Regular Graph problem, which asks for a given graph G and a non-negative integer k whether G can be made r-regular by deleting at most k vertices. For this problem, we prove the existence of a problem kernel of size O(kr(r+k)^2).
Computer Organization and Design, Fourth Edition, Fourth Edition: The Hardware/Software Interface (The Morgan Kaufmann Series in Computer Architecture and Design), 4th edition
Authors: David A. Patterson, John L. Hennessy
Venue:  (2008)

The classic textbook for computer systems analysis and design, Computer Organization and Design, has been thoroughly updated to provide a new focus on the revolutionary change taking place in industry today: the switch from uniprocessor to multicore microprocessors. This new emphasis on parallelism is supported by updates reflecting the newest technologies with examples highlighting the latest processor designs, benchmarking standards, languages and tools. As with previous editions, a MIPS processor is the core used to present the fundamentals of hardware technologies, assembly language, computer arithmetic, pipelining, memory hierarchies and I/O. Along with its increased coverage of parallelism, this new edition offers new content on Flash memory and virtual machines as well as a new and important appendix written by industry experts covering the emergence and importance of the modern GPU (graphics processing unit), the highly parallel, highly multithreaded multiprocessor optimized for visual computing.A new exercise paradigm allows instructors to reconfigure the 600 exercises included in the book to easily generate new exercises and solutions of their own. A CD provides a toolkit of simulators and compilers along with tutorials for using them as well as additional problems and solutions, and references.
Camera Break Detection by Partitioning of 2D Spatio-Temporal Images in MPEG Domain
Authors: C. W. Ngo, T. C. Pong, R. T. Chin
Venue: Proceedings of the IEEE International Conference on Multimedia Computing and Systems - Volume 2 (1999)

In this paper, we propose a new approach to detect camera cuts and wipes. The approach projects a video into two images representing the spatio-temporal continuity of a video life. Visually, these images are composed by regions of differen patterns, each region represents the temporal location of a shot. The shape of a region boundary inherently classifies cut and wipe, and most importantly, marks the start and end of a wipe sequence. We hence formulate algorithms to locate the color and texture discontinuities occurring at the boundaries of image regions.
Real-time creased approximate subdivision surfaces
Authors: Denis Kovacs, Jason Mitchell, Shanon Drone, Denis Zorin
Venue: Proceedings of the 2009 symposium on Interactive 3D graphics and games (2009)

We present an extension of recently developed Loop and Schaefer's approximation of Catmull-Clark surfaces (ACC) for surfaces with creases and corners which are essential for most applications. We discuss the integration of ACC into Valve's Source game engine and analyze performance of our implementation.
One in a million: picking the right patterns
Authors: Bj&#x00f6;rn Bringmann, Albrecht Zimmermann
Venue: Knowledge and Information Systems (2009)

Constrained pattern mining extracts patterns based on their individual merit. Usually this results in far more patterns than a human expert or a machine leaning technique could make use of. Often different patterns or combinations of patterns cover a similar subset of the examples, thus being redundant and not carrying any new information. To remove the redundant information contained in such pattern sets, we propose two general heuristic algorithms&#x2014;Bouncer and Picker&#x2014;for selecting a small subset of patterns. We identify several selection techniques for use in this general algorithm and evaluate those on several data sets. The results show that both techniques succeed in severely reducing the number of patterns, while at the same time apparently retaining much of the original information. Additionally, the experiments show that reducing the pattern set indeed improves the quality of classification results. Both results show that the developed solutions are very well suited for the goals we aim at.
A Reformulation-Linearization Technique (RLT) for semi-infinite and convex programs under mixed 0-1 and general discrete restrictions
Authors: Hanif D. Sherali, Warren P. Adams
Venue: Discrete Applied Mathematics (2009)

The Reformulation-Linearization Technique (RLT) provides a hierarchy of relaxations spanning the spectrum from the continuous relaxation to the convex hull representation for linear 0-1 mixed-integer and general mixed-discrete programs. We show in this paper that this result holds identically for semi-infinite programs of this type. As a consequence, we extend the RLT methodology to describe a construct for generating a hierarchy of relaxations leading to the convex hull representation for bounded 0-1 mixed-integer and general mixed-discrete convex programs, using an equivalent semi-infinite linearized representation for such problems as an intermediate stepping stone in the analysis. For particular use in practice, we provide specialized forms of the resulting first-level RLT formulation for such mixed 0-1 and discrete convex programs, and illustrate these forms through two examples.
Error-resilient motion estimation architecture
Authors: Girish Vishnu Varatkar, Naresh R. Shanbhag
Venue: IEEE Transactions on Very Large Scale Integration (VLSI) Systems (2008)

In this paper, we propose an energy-efficient motion estimation architecture. The proposed architecture employs the principle of error-resiliency to combat logic level timing errors that may arise in average-case designs in presence of process variations and/or due to overscaling of the supply voltage [voltage overscaling (VOS)] and thereby achieves power reduction. Error-resiliency is incorporated via algorithmic noise-tolerance (ANT). Referred to as input subsampled replica ANT (ISR-ANT), the proposed technique incorporates an input subsampled replica of the main sum-of-absolute-difference (MSAD) block for detecting and correcting errors in the MSAD block. Simulations show that the proposed technique can save up to 60% power over an optimal error-free system in a 130-nm CMOS technology. These power savings increase to 78% in a 45-nm predictive process technology. Performance of the ISR-ANT architecture in the presence of process variations indicates that average peak signal-to-noise ratio (PSNR) of the ISR-ANT architecture increases by up to 1.8 dB over that of the conventional architecture in 130-nm IBM process technology. Furthermore, the PSNR variation (σ/µ) is also reduced by 7 × over that of the conventional architecture at the slow corner while achieving a power reduction of 33%.
Comparing bibliometric country-by-country rankings derived from the Web of Science and Scopus: the effect of poorly cited journals in oncology
Authors: Carmen López-Illescas, Félix De Moya Anegón, Henk F. Moed
Venue: Journal of Information Science (2009)

This article addresses the robustness of country-by-country rankings according to the number of published articles and their average citation impact in the field oncology. It compares rankings based on bibliometric indicators derived from the Web of Science (WoS) with those calculated from Scopus. It is found that the oncological journals in Scopus not covered by WoS tend to be nationally oriented journals, i.e. they mainly serve a national research community, and play as of yet a more peripheral role in the international journal communication system. In expanding the set of WoS journals with Scopus journals not indexed for WoS, the countries that profit most in terms of percentage of published documents tend to show a decline in their average citation rate. This paradoxical finding is further explained by mathematical - statistical considerations, and interpreted as a short term effect. The paper discusses its implications for the construction of bibliometric indicators.
General visualization abstraction algorithm for geographic map-based human-robot interfaces
Authors: Curtis M. Humphrey, Julie A. Adams
Venue: Proceedings of the 4th ACM/IEEE international conference on Human robot interaction (2009)

This paper presents a novel visualization technique that provides integration, abstraction, and sharing of the information generated by remotely deployed robots or sensors. The General Visualization Abstraction (GVA) algorithm is designed to display the most useful information items at any moment by determining an importance value for each information item with a focus on two classes of information: historically relevant and currently relevant information, and novel and emerging information.
A Kind of Algorithms for Euclidean Distance-Based Outlier Mining and its Application to Expressway Toll Fraud Detection
Authors: Zhijun Huang, Chuangwen Xia
Venue: Proceedings of the 2009 International Asia Conference on Informatics in Control, Automation and Robotics (2009)

This paper present the concept of the outlier mining, discussed using Euclidean distance-based outlier mining to analyse the expressway toll to anti-defrauding, for to illustrate it, gived the example of toll collection’s man-day and nullah, analysed the toll collection data in Microsoft SQL Server, helped the toll check man to find outlied data, via emphases check on those outlier data, can fing the evidence for anti-defrauding; can offer proofe chain to treat with the defrauding things, this paper also analysed the strongpoint and the shortcoming of using the algorithms of Euclidean distance-based outlier to analyse the defrauding in highway toll collection.
Mobility handling in MAC for wireless ad hoc networks
Authors: Anjali Raja, Xiao Su
Venue: Wireless Communications Mobile Computing (2009)

Wireless Sensor Networks (WSNs) are becoming popular in a wide variety of applications. In a WSN, sensor nodes can be static or mobile, depending on applications. Handling mobility in a sensor network can pose interesting challenges in sensor protocol design, and special algorithms are needed to adapt to mobility in the network. In this paper, we survey the current state of art in handling mobility in sensor networks. We first study how mobility affects the design of different layers in the sensor network architecture, and then take a closer look at mobility handling in the MAC layer. We also describe the results of simulations that we conducted to compare and analyze existing mobility-aware MAC protocols. Finally, we discuss open issues in dealing with mobility in sensor networks. Copyright &copy; 2008 John Wiley & Sons, Ltd.
Applications of the figure-8 satellite system
Authors: Masato Tanaka, Kazuhiro Kimura Seiichiro Kawase Hiromitsu Wakana
Venue: Space Communications (2000)

The figure-8 satellite (quasi-zenithal satellite) system is a satellite constellation consisting of three or more satellites placed in inclined geo-synchronous circular orbits with an identical inclination of around 45 degrees. At any time, at least one of the three satellites is moving near the zenith view from Japan. The sub-satellite point traces a so-called &lsquo;figure of eight&rsquo; locus on the ground, elongating in the north-south direction with an arbitrary point on the equator in the center. The figure-8 satellite system has several potential applications including mobile satellite communications at a high-elevation angle, dual use of the same frequency between geostationary satellites and figure-8 satellites in fixed-satellite services, satellite-based positioning, and observation of the polar region. This paper describes applications of the figure-8 satellite system. In particular, the applicability of the satellite system to mobile satellite communications is shown by the experimental results of tests using the COMETS satellite.
Weaknesses and improvement of Wang et al.'s remote user password authentication scheme for resource-limited environments
Authors: Hao-Rung Chung, Wei-Chi Ku, Maw-Jinn Tsaur
Venue: Computer Standards Interfaces (2009)

Recently, Wang et al. showed that two new verifier-free remote user password authentication schemes, Ku-Chen's scheme and Yoon et al.'s scheme, are vulnerable to an off-line password guessing attack, a forgery attack, and a denial-of-service attack, and then proposed an improved scheme for the real application in resource-limited environments. Unfortunately, we find that Wang et al.'s scheme is still vulnerable to an impersonation attack and an off-line password guessing attack. In addition, Wang et al.'s scheme is not easily reparable and is unable to provide perfect forward secrecy. Finally, we propose an improved scheme with better security strength.
Comparison of Bayesian priors for highly reliable limit models
Authors: Roy R. Creasey,  Jr., K. Preston White,  Jr., Linda B. Wright, Cheryl F. Davis
Venue: Proceedings of the 40th Conference on Winter Simulation (2008)

Limit standards are probability interval requirements for proportions. Simulation literature has focused on finding the confidence interval of the population proportion, which is inappropriate for limit standards. Further, some Frequentist approaches cannot be utilized for highly reliable models, or models which produce no or few non-conforming trials. Bayesian methods provide approaches that can be utilized for all limit standard models. We consider a methodology developed for Bayesian reliability analysis, where historical data is used to define the a priori distribution of proportions p, and the customer desired a posteriori maximum probability is utilized to determine sample size for a replication.
Sets with type-2 operations
Authors: Carol L. Walker, Elbert A. Walker
Venue: International Journal of Approximate Reasoning (2009)

The algebra of truth values of type-2 fuzzy sets consists of all mappings of the unit interval to itself, with type-2 operations that are convolutions of ordinary max and min operations. This paper is concerned with a special subalgebra of this truth value algebra, namely the set of nonzero functions with values in the two-element set {0,1}. This algebra can be identified with the set of all non-empty subsets of the unit interval, but the operations are not the usual union and intersection. We give simplified descriptions of the operations and derive the basic algebraic properties of this algebra, including the identification of its automorphism group. We also discuss some subalgebras and homomorphisms between them and look briefly at t-norms on this algebra of sets.