ppxscal/embedding_network huggingface dataset:
Searching and navigating petabyte-scale file systems based on facets
Authors: Jonathan Koren, Andrew Leung, Yi Zhang, Carlos Maltzahn, Sasha Ames, Ethan Miller
Venue: Proceedings of the 2nd international workshop on Petascale data storage: held in conjunction with Supercomputing '07 (2007)

As users interact with file systems of ever increasing size, it is becoming more difficult for them to familiarize themselves with the entire contents of the file system. In petabyte-scale systems, users must navigate a pool of billions of shared files in order to find the information they are looking for. One way to help alleviate this problem is to integrate navigation and search into a common framework. One such method is faceted search. This method originated within the information retrieval community, and has proved popular for navigating large repositories, such as those in e-commerce sites and digital libraries. This paper introduces faceted search and outlines several current research directions in adapting faceted search techniques to petabyte-scale file systems.
A method for transferring retrieval scores between collections with non-overlapping vocabularies
Authors: Fernando D. Diaz
Venue: Proceedings of the 31st annual international ACM SIGIR conference on Research and development in information retrieval (2008)

We present a method for projecting retrieval scores across two corpora with a shared, parallel corpus.
Boundedness of a batch gradient method with penalty for feedforward neural networks
Authors: Huisheng Zhang, Wei Wu, Mingchen Yao
Venue: Proceedings of the 12th WSEAS International Conference on Applied Mathematics (2007)

This paper considers a batch gradient method with penalty for training feedforward neural networks. The role of the penalty term is to control the magnitude of the weights and to improve the generalization performance of the network. An usual penalty is considered, which is a term proportional to the norm of the weights. The boundedness of the weights of the network is proved. The boundedness is assumed as a precondition in an existing convergence result, and thus our result improves this convergence result.
Automated design of tunable impedance matching networks for reconfigurable wireless applications
Authors: Arthur Nieuwoudt, Jamil Kawa, Yehia Massoud
Venue: Proceedings of the 45th annual Design Automation Conference (2008)

In this paper, we develop a generalized automated design methodology for tunable impedance matching networks in reconfigurable wireless systems. The method simultaneously determines the fixed and tunable/switchable circuit element values in an arbitrary-order canonical filter for a general set of performance constraints over a discrete or continuous set of operating frequencies and source/load impedances. To solve the filter design problem, we combine deterministic nonlinear constrained optimization using Sequential Quadratic Programming with a systematic constraint relaxation approach to facilitate convergence. Using the proposed methodology, we successfully generate three different reconfigurable impedance matching networks with performance requirements that would be difficult to realize using manual design techniques.
Exceptional Sets and Fiber Products
Authors: Andrew J. Sommese, Charles W. Wampler
Venue: Foundations of Computational Mathematics (2008)

Exceptional sets where fibers have dimensions higher than the generic fiber dimension are of interest in mathematics and in application areas, such as the theory of overconstrained mechanisms.We show that fiber products promote such sets to become irreducible components, whereupon they can be found using techniques from numerical algebraic geometry for computing the irreducible decomposition. However, such a decomposition may contain components other than the exceptional loci we seek. We show that each irreducible component of the exceptional loci gives rise to a main component in a fiber product of sufficiently high order, and we give procedures for identifying these components. The methods are illustrated by finding the rulings of a general quadricin C3.
Induced matching extendable graphs
Authors: Yuan Jinjiang
Venue: Journal of Graph Theory (1998)

We say that a simple graph G is induced matching extendable, shortly IM-extendable, if every induced matching of G is included in a perfect matching of G. The main results of this paper are as follows: (1) For every connected IM-extendable graph G with |V(G)| &ge; 4, the girth g(G) &le; 4. (2) If G is a connected IM-extendable graph, then |E(G)| &ge; ${3\over 2}|V(G)| - 2$; the equality holds if and only if G &cong; T &times; K2, where T is a tree. (3) The only 3-regular connected IM-extendable graphs are Cn &times; K2, for n &ge; 3, and C2n(1, n), for n &ge; 2, where C2n(1, n) is the graph with 2n vertices x0, x1, &hellip;, x2n-1, such that xixj is an edge of C2n(1, n) if either |i - j| &equiv; 1 (mod 2n) or |i - j| &equiv; n (mod 2n). &copy; 1998 John Wiley & Sons, Inc. J. Graph Theory 28: 203&ndash;213, 1998
Mixed spectral method for three-dimensional exterior problems using spherical harmonic and generalized Laguerre functions
Authors: Zhong-Qing Wang, Ben-Yu Guo, Wei Zhang
Venue: Journal of Computational and Applied Mathematics (2008)

In this paper, we develop the mixed spectral method for three-dimensional exterior problems, using spherical harmonic and generalized Laguerre functions. Some basic approximation results are established. The mixed spectral schemes are proposed for two model problems. Their convergences are proved. Numerical results demonstrate the efficiency of this new approach.
2SNP: Scalable Phasing Method for Trios and Unrelated Individuals
Authors: Dumitru Brinza, Alexander Zelikovsky
Venue: IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB) (2008)

Emerging microarray technologies allow affordable typing of very long genome sequences. A key challenge in analyzing of such huge amount of data is scalable and accurate computational inferring of haplotypes (i.e., splitting of each genotype into a pair of corresponding haplotypes). In this paper, we first phase genotypes consisting only of two SNPs using genotypes frequencies adjusted to the random mating model and then extend phasing of two-SNP genotypes to phasing of complete genotypes using maximum spanning trees. Runtime of the proposed 2SNP algorithm is $O(nm (n + \log m)$, where n and m are the numbers of genotypes and SNPs, respectively, and it can handle genotypes spanning entire chromosomes in a matter of hours.On datasets across 23 chromosomal regions from HapMap[11], 2SNP is several orders of magnitude faster than GERBIL and PHASE while matching them in quality measured by the number of correctly phased genotypes, single-site and switching errors. For example the 2SNP software phases entire chromosome ($10^5$ SNPs from HapMap) for 30 individuals in 2 hours with average switching error 7.7%.We have also enhanced 2SNP algorithm to phase family trio data and compared it with four other well-known phasing methods on simulated data from [15]. 2SNP is much faster than all of them while loosing in quality only to PHASE. 2SNP software is publicly available at http://alla.cs.gsu.edu/~software/2SNP.
Replication of nanostructures on microstructures by intermediate film mold inserted hot embossing process
Authors: Hyun Sup Lee, Tai Hun Kwon, Jong Hyun Kim, Suk Sang Chang
Venue: Microsystem Technologies (2008)

The present study proposes a simple method to replicate nano/micro combined multiscale structures using an intermediate film mold and anodic aluminum oxide (AAO) nanomold in hot embossing process. The proposed method is simply to add an intermediate film mold with microscale thru-hole patterns to the ordinary mold system, on which nanostructures are patterned, in the hot embossing process. The intermediate film mold is inserted between polymer substrate and AAO nanomold. During the hot embossing process, the polymer first fills microscale thru-hole patterns in the intermediate film mold and subsequently fills nanopores in AAO nanomold, resulting in the nano/micro combined structures. The intermediate film molds, which have microscale thru-hole patterns were fabricated by micro-milling, laser ablation, etching methods and/or LIGA process. The nano/micro combined structures were successfully replicated by the proposed method.
Predicate Detection Modality and Semantics in Three Partially Synchronous Models
Authors: Chunbo Chu, Monica Brockmeyer
Venue: Proceedings of the Seventh IEEE/ACIS International Conference on Computer and Information Science (icis 2008) (2008)

Predicate detection addresses the challenge of monitoring the state of a distributed system. This research is the first step to explore predicate detection with partial synchrony assumptions. We study the observability of computation and focus on predicate detection semantics in three partially synchronous models. A framework of the behavior of predicate detection is established in terms of partial synchrony, modalities permitted and the best detection semantics. This work forms a conceptualization of the problem space and leads to disciplined approaches to predicate detection in realistic systems by identifying the strongest possible semantics for each modality and partial synchrony assumption.
Slack allocation techniques for intra-path load balancing
Authors: Kartik Gopalan, Tzi-cker Chiueh, Yow-Jian Lin
Venue: Journal of High Speed Networks (2007)

Network resource provisioning techniques need to perform both inter-path and intra-path load balancing to maximize the network's resource usage efficiency while supporting end-to-end QoS guarantees. This paper focuses on the intra-path load balancing problem: How to partition the end-to-end QoS requirement of an aggregate network flow along the links of a given path such that the deviation in the loads on these links is as small as possible? We propose a set of new algorithms, called Load-balancing Slack Allocation (LSA), to solve this QoS partitioning problem for unicast and multicast traffic. The key concept in the LSA algorithms is the notion of slack, which quantifies the flexibility available in partitioning the end-to-end QoS requirement across the links of a selected path or tree. We show that one can improve network resource usage efficiency by carefully selecting a slack partition that explicitly balances the loads on the underlying links. These algorithms can simultaneously partition multiple QoS requirements such as delay and delay violation probability bounds. A detailed simulation study demonstrates that, compared with previous approaches, the LSA algorithms can increase the total number of long-term flows that can be provisioned along a network path by up to 1.2 times for deterministic and 2.8 times for statistical delay guarantees.
Towards Real-Time Information Processing of Sensor Network Data Using Computationally Efficient Multi-output Gaussian Processes
Authors: M. A. Osborne, S. J. Roberts, A. Rogers, S. D. Ramchurn, N. R. Jennings
Venue: Proceedings of the 7th international conference on Information processing in sensor networks (2008)

In this paper, we describe a novel, computationally efficient algorithm that facilitates the autonomous acquisition of readings from sensor networks (deciding when and which sensor to acquire readings from at any time), and which can, with minimal domain knowledge, perform a range of information processing tasks including modelling the accuracy of the sensor readings, predicting the value of missing sensor readings, and predicting how the monitored environmental variables will evolve into the future. Our motivating scenario is the need to provide situational awareness support to first responders at the scene of a large scale incident, and to this end, we describe a novel iterative formulation of a multi-output Gaussian process that can build and exploit a probabilistic model of the environmental variables being measured (including the correlations and delays that exist between them). We validate our approach using data collected from a network of weather sensors located on the south coast of England.
Wide dynamic range CMOS pixels with reduced dark current
Authors: Bhaskar Choubey, Steve Collins
Venue: Analog Integrated Circuits and Signal Processing (2008)

The sensitivity of logarithmic pixels at low light levels is limited by the dark current that flows through the load transistor in the pixel in addition to the photocurrent. This dark current also degrades the performance of cameras containing these pixels by increasing the residual fixed pattern noise following fixed pattern noise correction. The performance of logarithmic pixels will therefore be improved if the dark current can be reduced. A review of the sources of dark current has led to the design of a new layout for a logarithmic pixel. Results are reported that show that this layout significantly reduces the dark current in the pixel. In addition, a simple change to the bias voltages applied to the proposed pixel means that the new layout can simultaneously exhibit a linear response at low light levels and a logarithmic response at higher light levels. Experimental results from both modes of operations are presented.
Rightshore!: Successfully Industrialize SAP Projects Offshore, 1 edition
Authors: Anja Hendel, Wolfgang Messner, Frank Thun, Anja Hendel, Wolfgang Messner, Frank Thun
Venue:  (2008)

At a time when business demands urge companies to innovate and CIOs face increasing cost pressures, offshore delivery offers the opportunity to industrialize the implementation processes for system harmonization, consolidation, and enhancement, thereby realizing substantial cost savings and quality improvements. Rightshore - a registered trademark of Capgemini - is about organizing the distributed delivery process that embraces on-site, nearshore and offshore services. This book describes successful global delivery models utilizing industrialized methods to deliver SAP projects from India. While the first part is devoted to management concepts, service offerings and the peculiarities of working together with India, the second part features eight case studies from different industries and from around the world describing how India delivery centers have been successfully deployed in SAP development projects.
A novel admission control mechanism in GMPLS-based IP over optical networks
Authors: Hichem Ayed Harhira, Samuel Pierre
Venue: Computer Networks: The International Journal of Computer and Telecommunications Networking (2008)

With the migration of real-time and high-priority traffic in IP networks, dynamic admission control mechanisms are very important in high-capacity networks where IP and optical technologies have converged with a GMPLS-based control-plane. In this paper proposes, we propose an integrated multilayer traffic engineering framework that considers both physical and logical (optical layer) topologies for dynamically admitting new label switched paths (LSPs) in GMPLS networks. The dynamic admission control mechanism is based on an optimal resolution of an integer linear programming model that takes into account both lightpaths availability, wavelength continuity and routing constraints. In order to minimize LSPs set up delays, this mechanism first considers the logical topology (set of lightpaths) that is already in place before setting up a new lightpath for the incoming LSP, resulting in an additional set up signaling delay. When tested by simulations, results confirm that the proposed formulation effectively improves the network performance by reducing the connection blocking rate, while guaranteeing strict delay and noise constraints.
Sampling rate conversion for linear canonical transform
Authors: Juan Zhao, Ran Tao, Yue Wang
Venue: Signal Processing (2008)

The linear canonical transform (LCT) has been shown to be a powerful tool for optics and signal processing. This paper investigates the sampling rate conversion problem in the LCT domain. Firstly, the discrete-time LCT is introduced and the formulas of interpolation and decimation in the LCT domain are derived. Then, based on the sampling theorem expansion in the LCT domain, the formulas of sampling rate conversion by real factors for the LCT in time domain are proposed. The spectral analysis of sampling rate conversion by real factors in the LCT domain is also illustrated. The sampling rate conversion theories in the Fourier domain and the fractional Fourier domain are shown to be special cases of the achieved results. The simulations verify the effectiveness of the obtained results.
Provenance Tracking and Querying in the ViroLab Virtual Laboratory
Authors: Bartosz Balis, Marian Bubak, Michal Pelczar, Jakub Wach
Venue: Proceedings of the 2008 Eighth IEEE International Symposium on Cluster Computing and the Grid (2008)

We present an approach to provenance tracking and querying which enables end-users to construct complex queries over provenance records. The use of ontologies for modeling provenance, data and applications enables query construction in an end-user oriented manner, i.e. by using terms of the scientific domain familiar to end users, instead of complex query languages. In addition, our ontologies contain mappings to underlying data models and sources. This allows to construct queries over provenance which additionally explore the structure of data items in the provenance records (e.g. experiment input or output data), combining requests to provenance and data repositories.
A high-level clustering algorithm targeting dual Vdd FPGAs
Authors: Rajarshi Mukherjee, Song Liu, Seda Ogrenci Memik, Somsubhra Mondal
Venue: ACM Transactions on Design Automation of Electronic Systems (TODAES) (2008)

Recent advanced power optimizations deployed in commercial FPGAs, laid out a roadmap towards FPGA devices that can be integrated into ultra low power systems. In this article, we present a high-level design tool to support the process of mapping an application onto a FPGA device with dual supply voltages. Our main contribution in this paper is an algorithm, which creates voltage scaling ready clusters by utilizing the timing slack available in the designs. We propose to first create clusters of CLBs within a given CLB-level netlist. This clustering algorithm intends to group chains of CLBs possessing similar amounts of timing slack along their critical path together. Once these clusters are identified, they are placed onto respective Vdd partitions on the device. We have evaluated different dual Vdd fabrics and the potential gain in power consumption is explored. When a subset of the logic blocks on the device can be driven by low Vdd levels (either with a dedicated low Vdd supply or with a programmable selection between low and high Vdd levels for these blocks) this affects placement and routing. As a result the maximum frequency of the designs may be affected. In order to evaluate the overall impact of creating voltage islands, we measured the Energy-Delay Product for our benchmark designs. We observed that the Energy-Delay product can be decreased by 26.9&percnt; when the placement of the designs into different voltage levels is guided by our clustering algorithm.
Schemes and the IP-graph
Authors: Rachel Camina
Venue: Journal of Algebraic Combinatorics: An International Journal (2008)

We consider the common-divisor graph of the set of valencies of a naturally valenced scheme, where scheme is defined in the sense of P.-H. Zieschang. We prove structural results about this graph, and thus give restrictions on the set of natural numbers that can occur as the set of valencies of a naturally valenced scheme.
An Algorithm for Rn Constrained Global Optimization Based on Filled Function Method
Authors: Weixiang Wang, Youlin Shang
Venue: Proceedings of the First International Workshop on Knowledge Discovery and Data Mining (2008)

Many aspects in the study of the development and the use of advanced information technologies and systems involves constrained global optimization. In this paper, a filled function with one parameter is proposed for escaping the current local minimizer. Then a new algorithm for obtaining a global optimizer is presented. Using this method, a global minimizer can be obtained just by searching for local optimizers of the original problem and some certain unconstrained optimization problems. The numerical results show the efficiency of this method.
Minimum flow maximum residual routing in LEO satellite networks using routing set
Authors: Roy Kucukates, Cem Ersoy
Venue: Wireless Networks (2008)

Satellite networks are used as backup networks to the terrestrial communication systems. In this work, we tried to find a routing strategy over dynamic satellite systems to better utilize the capacity of the network. The satellite networks are not affected by natural disasters, therefore they can be used widely during and after disasters. The Minimum Flow Maximum Residual (MFMR) routing algorithm over the Routing Set boundaries is proposed in order to better utilize the capacity of the system by distributing the load over the shortest path alternatives of the system. We assumed the satellite network as having finite states and formulated the problem by using Finite State Automation concept along with earth-fixed cell strategy by using a virtual satellite network model. The routing problem in satellite networks is previously studied in the literature and it is conjectured that the problem is NP-Hard. The online and offline problems are stated and the MFMR algorithm is described in detail. The algorithm is compared with alternatives by simulating the network on Opnet Modeler. Finally, the performance analysis of different scenarios is given in this work.
Alert propagation in mobile ad hoc networks
Authors: Wenbo He, Ying Huang, Klara Nahrstedt, Whay C. Lee
Venue: ACM SIGMOBILE Mobile Computing and Communications Review (2008)

Intrusion/misbehavior detection and response are two important components for defending against various attacks in mobile ad hoc networks. Unfortunately, there is a gap between local intrusion/misbehavior detection and network-wide response in such networks. To bridge this gap, alert propagation, aiming to spread alert messages to the whole network upon detection of malicious/abnormal activity, is a viable solution but has been overlooked.
Protein Structure Computation
Authors: Gwyn Skone, Stephen Cameron
Venue: Proceedings of the 2007 Frontiers in the Convergence of Bioscience and Information Technologies (2007)

The field of protein structure representation and manipulation has received a great amount of interest during the past fifteen years. Research has come from the biochemical, medical, and physical sciences, in particular for the development of rational drug discovery methods. One of the most significant problems is that of docking: identifying automatically whether two molecules might bind to each other is of central importance to the development of novel medicinal compounds. We present a summary of protein computation principles in the context of an implementation of the well-established FFT docking algorithm.
A Distributed and Adaptive Revocation Mechanism for P2P Networks
Authors: Thibault Cholez, Isabelle Chrisment, Olivier Festor
Venue: Proceedings of the Seventh International Conference on Networking (2008)

With the increasing deployment of P2P networks, supervising the malicious behaviours of participants, which degrade the quality and performance of the overall delivered service, is a real challenge. In this paper, we propose a fully distributed and adaptive revocation mechanism based on the reputation of the peers. The originality of our approach is that the revocation is integrated in the core of the P2P protocol and does not need complex consensus and cryptographic mechanisms, hardly scalable. The reputation criteria evolve with the contribution of a peer to the network in order to highlight and help fight against selfish or malicious behaviours. The preliminary results show that the user perceived delays are not highly impacted and that our solution is resistant to reputation and revocation attacks.