ppxscal/embedding_network huggingface dataset:
Active kernel learning
Authors: Steven C. H. Hoi, Rong Jin
Venue: Proceedings of the 25th international conference on Machine learning (2008)

Identifying the appropriate kernel function/matrix for a given dataset is essential to all kernel-based learning techniques. A number of kernel learning algorithms have been proposed to learn kernel functions or matrices from side information (e.g., either labeled examples or pairwise constraints). However, most previous studies are limited to "passive" kernel learning in which side information is provided beforehand. In this paper we present a framework of Active Kernel Learning (AKL) that actively identifies the most informative pairwise constraints for kernel learning. The key challenge of active kernel learning is how to measure the informativeness of an example pair given its class label is unknown. To this end, we propose a min-max approach for active kernel learning that selects the example pair that results in a large classification margin regardless of its assigned class label. We furthermore approximate the related optimization problem into a convex programming problem. We evaluate the effectiveness of the proposed algorithm by comparing it to two other implementations of active kernel learning. Empirical study with nine datasets on semi-supervised data clustering shows that the proposed algorithm is more effective than its competitors.
Throughput and Energy-Efficiency-Aware Protocol for Ultrawideband Communication in Wireless Sensor Networks: A Cross-Layer Approach
Authors: Qingchun Ren, Qilian Liang
Venue: IEEE Transactions on Mobile Computing (2008)

In this paper, we propose an efficient MAC protocol: throughput maximized MAC protocol (TM-MAC), inspired by the availability that a number of ultra wideband (UWB) transmission parameters can be tuned to better match the requirements of data flow. In TM-MAC, we implement concurrent multiuser access scheme instead of mutual exclusion method such as TDMA and random access. For multiuser interference, we establish a model to adaptively adjust the data transmission rate to generate the expected signal to interference noise ratio (SINR) at the receiver side for reliable communications. We also analyze the relationship among the theoretical maximum channel capacity, achievable maximum channel capacity and data transmission rate. According to network topology, TM-MAC re-divides each piconet into several subsets, in which communication pairs can make communication simultaneously and achieve the maximum throughput using the highest data rate. In subset formation, we propose a general analytical framework that captures the unique characteristics of shared wireless channel and throughput variance, as well as allows the modeling of a large class of systemwide throughput maximization via the specification of per-link utilization function. For algorithm essential parameters design, we consider the influence of traffic type on the system performance. Simulation results show that our algorithm can maximize throughput to achieve short latency.
Nanoindentation testing of SU-8 photoresist mechanical properties
Authors: A. T. Al-Halhouli, I. Kampen, T. Krah, S. Büttgenbach
Venue: Microelectronic Engineering (2008)

In this work, quasi-static and dynamic tests for the mechanical properties of SU-8 using a nanomechanical triboindenter were performed. Load-displacement data for the indenter as it is driven into and withdrawn from the photoresist patterns are reported. Berkovich-shaped indenter was used in the experimental measurements of the following mechanical properties: reduced elastic modulus, hardness, energy storage modulus and energy loss modulus. The Young's modulus of the SU-8 photoresist was also determined.
GeoLife: Managing and Understanding Your Past Life over Maps
Authors: Yu Zheng, Longhao Wang, Ruochi Zhang, Xing Xie, Wei-Ying Ma
Venue: Proceedings of the The Ninth International Conference on Mobile Data Management (2008)

The increasing popularity of GPS device has boosted many applications where more and more GPS logs have been accumulating continuously. Managing and understanding the collected GPS data are two important issues for these applications. On one hand, by indexing the increasing GPS data, we can provide effective retrieval method for users to find the corresponding GPS data interests them. On the other hand, by understanding user’s GPS data, we are more likely to enable novel services which would stimulate people’s passion on contributing GPS data in turn. However, so far, GPS data are still used directly without much understanding. In our project, referred to as GeoLife, we focus on visualization, organization, fast retrieval, and effective understanding of GPS track logs for both personal and public use. It not only provides a powerful platform for people to effectively manage their GPS data but also help them well understand a person’s past experience from GPS data.
On Self-Indexing Images - Image Compression with Added Value
Authors: Veli Mäkinen, Gonzalo Navarro
Venue: Proceedings of the Data Compression Conference (2008)

Recent advances in compressed data structures have led to the new concept of self-indexing; it is possible to represent a sequence of symbols compressed in a form that enables fast queries on the content of the sequence. This paper studies different analogies of self-indexing on images. First, we show that a key ingredient of many self-indexes for sequences, namely the wavelet tree, can be used to obtain both lossless and lossy compression with random access to pixel values. Second, we show how to use self-indexes for sequences as a black-box to provide self-indexes for images with filtering-type query capabilities. Third, we develop a tailor-made self-index for images by showing how to compress two-dimensional suffix arrays. Experimental results are provided to compare the compressibility to standard compression methods.
Small sample improvements in the threshold cointegration test using residual-based moving block bootstrap
Authors: Zheng Yang, Zheng Tian, Zixia Yuan
Venue: Mathematics and Computers in Simulation (2008)

A residual-based moving block bootstrap procedure for testing the null hypothesis of linear cointegration versus cointegration with threshold effects is proposed. When the regressors and errors of the models are serially and contemporaneously correlated, our test compares favourably with the SupLM test proposed by Gonzalo and Pitarakis. Indeed, shortcomings of the former motivated the development of our test. The small sample performance of the bootstrap test is investigated by Monte Carlo simulations, and the results show that the test performs better than the SupLM test.
Simulation environment for selected parts of artificial life domain
Authors: K. Kohout, P. Nahodil
Venue: Proceedings of the 5th WSEAS International Conference on Computational Intelligence, Man-Machine Systems and Cybernetics (2006)

Our research is focused on the simulation of agent - animate. The architecture of these agents is mainly inspired by nature and therefore they are sometimes called artificial creatures. The main contribution of this paper is the description of designed simulation environment architecture for the Artificial Life (ALife) domain. It was named the World of Artificial Life (WAL). Our platform incorporates results of research in the domain of hybrid agent architectures. Based on this results it focuses on the proposal and implementation of the simulation environment. First, we formulate the problem we were solving and the important goals, then we present our proposal for the simulator, followed by brief overview of achieved results.
A low-power transmission-gate-based 16-bit multiplier for digital hearing aids
Authors: Flavio Carbognani, Felix Buergin, Norbert Felber, Hubert Kaeslin, Wolfgang Fichtner
Venue: Analog Integrated Circuits and Signal Processing (2008)

The most widespread 16-bit multiplier architectures are compared in terms of area occupation, dissipated energy, and EDP (Energy-Delay Product) in view of low-power low-voltage signal processing for digital hearing aids and similar applications. Transistor-level simulations including back-annotated wire parasitics confirm that the propagation of glitches along uneven and re-convergent paths results in large unproductive node activity. Because of their shorter full-adder chains, Wallace-tree multipliers indeed dissipate less energy than the carry-save (CSM) and other traditional array multipliers (6.0 µW/MHz versus 10.9 µW/MHz and more for 0.25 µm CMOS technology at 0.75 V). By combining the Wallace-tree architecture with transmission gates (TGs), a new approach is proposed to improve the energy efficiency further (3.1 µW/MHz), beyond recently published low-power architectures. Besides the reduction of the overall capacitance, minimum-sized transmission gate full-adders act as RC-low-pass filters that attenuate undesired switching. Finally, minimum size TGs increase the V dd to ground resistance, hence decreasing leakage dissipation (0.55 nW versus 0.84 nW in CSM and 0.94 nW in Wallace).
Calendar for everything: browse and search for personal archive on calendar
Authors: Satoshi Nakamura
Venue: Proceedings of the 2nd international conference on Ubiquitous information management and communication (2008)

The amount of personal content is increasing significantly. Consequently, it has become difficult for people to manage this content in their personal archives. As a result, almost all personal content has become dead storage. We have developed browsing and searching techniques based on a calendar interface with a personal archive and developed a system that recommends personal content. The combination of these techniques and system allows content to be retrieved from a user's personal archive.
The maximal function on spaces that lie between L∞ and BMO
Authors: Caroline Sweezy
Venue: Proceedings of the 10th WSEAS International Conference on APPLIED MATHEMATICS (2006)

There are subspaces of BMO(Rn), BMO(r), 1≤r≤∞, introduced in [S] and defined by the growth condition, sup1≤p<∞{1/p1k(supQ(1/|Q| ∫Q|f(x)-fQ|pdx)1/p)}≤C0<∞. These spaces are shown to have rearrangement invariant hulls that are similar to the space weak L∞, which was defined by Bennett, DeVore and Sharpley. It is proved that the Hardy-Littlewood maximal operator, if it is finite a.e., takes BMO(r) into itself, with norm boundedness.
Regular &omega;-Languages Defined by Finite Extended Spiking Neural P Systems
Authors: Rudolf Freund, Marion Oswald
Venue: Fundamenta Informaticae (2008)

We investigate finite extended spiking neural P systems as acceptors for infinite sequences of symbols 1 and 0, i.e., of &omega;-words over {0, 1}. We show that regular &omega;-languages over {0, 1} can be characterized by deterministic/non-deterministic finite extended spiking neural P systems accepting &omega;-words in specific modes with respect to the infinite sequence of states the finite extended spiking neural P systems go through during the accepting computations.
Optimal determination of partial transmission ratios of three-step helical gearboxes with second-step double gear-sets for minimal gearbox length
Authors: Vu Ngoc Pi
Venue: Proceedings of the 2nd WSEAS International Conference on Computer Engineering and Applications (2008)

In this paper, a study on the applications of the optimization and regression techniques for optimal determination of partial ratios of three-step helical gearboxes with second-step double gear-sets in order to get minimal gearbox length is presented. In the study, from the moment equilibrium condition of a mechanic system including three gear units and their regular resistance condition, an optimization problem for getting minimal gearbox length was performed. In addition, by using regression analysis technique, explicit models for calculating the partial ratios of the gearboxes were proposed. The models allow calculating the ratios accurately and simply.
The use of digital aerial photography and CORINE-derived methodology for monitoring recent and historic changes in land cover near UK Natura 2000 sites for the BIOPRESS project
Authors: A. G. Thomson, S. J. Manchester, R. D. Swetnam, G. M. Smith, R. A. Wadsworth, S. Petit, F. F. Gerard
Venue: International Journal of Remote Sensing (2007)

BIOPRESS-Linking pan-European land cover change to pressures on biodiversity-is a European Community Framework 5 project, which aims to develop a standardised product that will link quantified historical (1950-2000) land cover change to pressures on biodiversity. It exploits archived historic and recent aerial photographs (a data source that has remained consistent over the last 60 years) to assess land cover change around Natura 2000 sites within 30×30 km windows and 15×2 km transects. The CORINE (Coordination of Information on the Environment) land cover mapping methodology has been adapted for use with aerial photographs. Sample sites are mapped to CORINE Land Cover (CLC) classes, and then backdated to assess change. Results from eight UK transects (and associated windows) are presented. Changes in land cover classes are interpreted as pressures: urbanisation, intensification, abandonment, afforestation, deforestation and drainage. Urbanisation was the major pressure in all but two transects (both in the uplands), and intensification was of similar importance in most transects. Afforestation was a significant pressure in two transects. In six out of the eight transects, annual change was greater in the 1990-2000 period than in the 1950-1990 period. The methodology has been demonstrated to provide quantitative results of long-term land cover change in the UK rural landscape at a spatial scale that is relevant to management decisions. The methods are transferable and applicable to a wide range of landscape studies.
Efficient distributed bandwidth management for MPLS fast reroute
Authors: Dongmei Wang, Guangzhi Li
Venue: IEEE/ACM Transactions on Networking (TON) (2008)

As service providers move more applications to their IP/MPLS (Multiple Protocol Label Switching [1]) backbone networks, rapid restoration upon failure becomes more and more crucial. Recently MPLS fast reroute has attracted lots of attention as it was designed to meet the needs of real-time applications, such as voice over IP. MPLS fast reroute achieves rapid restoration by computing and signaling backup label switched path (LSP) tunnels in advance and re-directing traffic as close to failure point as possible. To provide a guarantee of bandwidth protection, extra bandwidth has to be reserved on backup paths. Using path merging technique as described in IETF RFC 4090 only, the network is able to share some bandwidth on common links among backup paths of the same service LSP, i.e., so-called intra-sharing. But no solution is provided on how to share bandwidth among backup paths of different service LSPs, i.e., so-called inter-sharing. In this paper, we provide an efficient distributed bandwidth management solution. This solution allows bandwidth sharing among backup paths of the same and different service LSPs, i.e., both intra-sharing and inter-sharing, with a guarantee of bandwidth protection for any single node/link failure. We also propose an efficient algorithm for backup path selection with the associated signaling extensions for additional information distribution and collection. To evaluate our schemes, we compare them via simulation with the basic MPLS fast reroute proposal, IETF RFC 4090, on two networks. Our simulation results show that using our bandwidth management scheme can significantly reduce restoration overbuild from about 250% to about 100%, and our optimized backup path selection can further reduce restoration overbuild to about 60%.
On decomposing a graph into nontrivial bonds
Authors: Sean McGuinness
Venue: Journal of Graph Theory (2000)

We show that for every 2-connected bipartite graph which is not a multiple edge and which has no K5-minor there is an edge-disjoint collection of nontrivial bonds (i.e., not stars) which partition the edges of the graph. &copy; 2000 John Wiley & Sons, Inc. J Graph Theory 35: 109&ndash;127, 2000
A new vegetation index based on the universal pattern decomposition method
Authors: Lifu Zhang, S. Furumi, K. Muramatsu, N. Fujiwara, M. Daigo, Liangpei Zhang
Venue: International Journal of Remote Sensing (2007)

This study examined a new vegetation index, based on the universal pattern decomposition method (VIUPD). The universal pattern decomposition method (UPDM) allows for sensor-independent spectral analysis. Each pixel is expressed as the linear sum of standard spectral patterns for water, vegetation and soil, with supplementary patterns included when necessary. Pattern decomposition coefficients for each pixel contain almost all the sensor-derived information, while having the benefit of sensor independence. The VIUPD is expressed as a linear sum of the pattern decomposition coefficients; thus, the VIUPD is a sensor-independent index. Here, the VIUPD was used to examine vegetation amounts and degree of terrestrial vegetation vigor; VIUPD results were compared with results by the normalized difference vegetation index (NDVI), an enhanced vegetation index (EVI) and a conventional vegetation index based on pattern decomposition (VIPD). The results showed that the VIUPD reflects vegetation and vegetation activity more sensitively than the NDVI and EVI.
Discovering Inter-Domain Paths between Hepatitis C Virus NS5A and Human Liver Proteins
Authors: Guang-Zheng Zhang, Kyungsook Han
Venue: Proceedings of the 2007 Frontiers in the Convergence of Bioscience and Information Technologies (2007)

In contrast to the abundant data on hepatitis C virus (HCV) and human protein sequences, little is known about the interactions between HCV and human proteins. Hence, discovering binding domain pairs or inter-domain paths at the residue level is of general importance in the study of the interactions between HCV and human proteins. In this study, we analyzed all known binding domain pairs of HCV proteins and human liver proteins, and discovered 10 potential inter-domain paths between HCV NS5A protein and six human liver proteins. This informative result will dramatically narrow the search space of human liver proteins interacting with HCV NS5A protein. Supplementary data are available at http://hiv1.hpid.org/Pathway suppl 01.htm and http://hiv1.hpid.org/Pathway suppl 02.htm.
A Reinforcement Learning Approach to Interval Constraint Propagation
Authors: Frédéric Goualard, Christophe Jermann
Venue: Constraints (2008)

When solving systems of nonlinear equations with interval constraint methods, it has often been observed that many calls to contracting operators do not participate actively to the reduction of the search space. Attempts to statically select a subset of efficient contracting operators fail to offer reliable performance speed-ups. By embedding the recency-weighted average Reinforcement Learning method into a constraint propagation algorithm to dynamically learn the best operators, we show that it is possible to obtain robust algorithms with reliable performances on a range of sparse problems. Using a simple heuristic to compute initial weights, we also achieve significant performance speed-ups for dense problems.
Application of binary logistic regression analysis and its validation for landslide susceptibility mapping in part of Garhwal Himalaya, India
Authors: J. Mathew, V. K. Jha, G. S. Rawat
Venue: International Journal of Remote Sensing (2007)

Landslides cause heavy damage to property and infrastructure, in addition to being responsible for the loss of human lives, in many parts of the Himalaya. It is possible to take appropriate management measures to reduce the risk from potential landslide hazard with the help of landslide hazard zonation (LHZ) maps. The present work is an attempt to utilize binary logistic regression analysis for the preparation of a landslide susceptibility map for a part of Garhwal Himalaya, India, which is highly prone to landslides, by taking the geological, geomorphological and topographical parameters into consideration. Remote sensing and the geographic information system (GIS) were found to be very useful in the input database preparation, data integration and analysis stages. The coefficients of the predictor variables are estimated using binary logistic regression analysis and are used to calculate the landslide susceptibility for the entire study area within a GIS environment. The receiver operator characteristic curve analysis gives 88.7% accuracy for the developed model.
A Communication-Efficient Distributed Clustering Algorithm for Sensor Networks
Authors: Amirhosein Taherkordi, Reza Mohammadi, Frank Eliassen
Venue: Proceedings of the 22nd International Conference on Advanced Information Networking and Applications - Workshops (2008)

Sensor networks usually generate continuous stream of data over time. Clustering sensor data as acore task of mining sensor data plays an essential role in analytical applications of sensor networks. Although several algorithms have been proposed to address the problem of distributed clustering, in the domain of sensor networks these algorithms face major new challenges such as limited communication bandwidth and constraints in power supply, and storage resources. Moreover, previous studies about clustering in sensor networks have mostly focused on clustering sensor nodes and designing better network topology for the purpose of energy conservation rather than clustering sensor data for future analytical purposes. In this paper a communication efficient distributed algorithm is proposed for clustering sensory data. This approach addresses the limited bandwidth issue through summarized transmissions. Furthermore, communication efficiency of the algorithm contributes to reduced power consumption. Time efficiency of the algorithm is evaluated through simulation experiments and the results are presented.
The chow parameters problem
Authors: Ryan O'Donnell, Rocco A. Servedio
Venue: Proceedings of the 40th annual ACM symposium on Theory of computing (2008)

In the 2nd Annual FOCS (1961), C. K. Chow proved that every Boolean threshold function is uniquely determined by its degree-0 and degree-1 Fourier coefficients. These numbers became known as the Chow Parameters. Providing an algorithmic version of Chow's theorem --- i.e., efficiently constructing a representation of a threshold function given its Chow Parameters --- has remained open ever since. This problem has received significant study in the fields of circuit complexity, game theory and the design of voting systems, and learning theory. In this paper we effectively solve the problem, giving a randomized PTAS with the following behavior: Theorem: Given the Chow Parameters of a Boolean threshold function f over n bits and any constant ε > 0, the algorithm runs in time O(n2 log2 n) and with high probability outputs a representation of a threshold function f' which is ε-close to f. Along the way we prove several new results of independent interest about Boolean threshold functions. In addition to various structural results, these include the following new algorithmic results in learning theory (where threshold functions are usually called "halfspaces"): An ~O(n2)-time uniform distribution algorithm for learning halfspaces to constant accuracy in the "Restricted Focus of Attention" (RFA) model of Ben-David et al. [3]. This answers the main open question of [6]. An O(n2)-time agnostic-type learning algorithm for halfspaces under the uniform distribution. This contrasts with recent results of Guruswami and Raghavendra [21] who show that the learning problem we solve is NP-hard under general distributions. As a special case of the latter result we obtain the fastest known algorithm for learning halfspaces to constant accuracy in the uniform distribution PAC learning model. For constant ε our algorithm runs in time ~O(n2), which substantially improves on previous bounds and nearly matches the Ω(n2) bits of training data that any successful learning algorithm must use.