ppxscal/embedding_network huggingface dataset:
Terrestrial laser scanner to detect landslide displacement fields: a new approach
Authors: G. Teza, A. Galgaro, N. Zaltron, R. Genevois
Venue: International Journal of Remote Sensing (2007)

A terrestrial laser scanner (TLS) allows the generation of a detailed model of a landslide surface. In this way, when two or more georeferenced models obtained by multi-temporal scans are available, the landslide displacement field can be computed. Nevertheless, such a computation is a relatively complex task because the recognition of correspondences among the multi-temporal models is required. The Iterative Closest Point (ICP) algorithm allows the alignment of two 3D objects having a common part by iterative shape matching. A new method for the automatic calculation of a landslide displacement field is presented here. It is based on a piecewise application of the ICP algorithm and is made possible by the robustness of this algorithm against noise and small morphological modifications. After a series of numerical experimentations, this method was successfully applied to two test sites located in the North-Eastern Italian Alps affected by high-risk landslides of the slump type (Perarolo di Cadore and Lamosano) with very different observational conditions.
The influence of the broadness of a query of a topic on its h-index: Models and examples of the h-index of n-grams
Authors: Leo Egghe, I. K. Ravichandra Rao
Venue: Journal of the American Society for Information Science and Technology (2008)

The article studies the influence of the query formulation of a topic on its h-index. In order to generate pure random sets of documents, we used N-grams (N variable) to measure this influence: strings of zeros, truncated at the end. The used databases are WoS and Scopus. The formula ${\rm{h = T}}^{{\textstyle{1 \over \alpha }}} $, proved in Egghe and Rousseau (2006) where T is the number of retrieved documents and &alpha; is Lotka's exponent, is confirmed being a concavely increasing function of T. We also give a formula for the relation between h and N the length of the N-gram: ${\rm{h = D10}}^{ - {\textstyle{{\rm{N}} \over \alpha }}} $ where D is a constant, a convexly decreasing function, which is found in our experiments. Nonlinear regression on ${\rm{h = T}}^{{\textstyle{1 \over \alpha }}} $ gives an estimation of &alpha;, which can then be used to estimate the h-index of the entire database (Web of Science [WoS] and Scopus): ${\rm{h = S}}^{{\textstyle{1 \over \alpha }}} $, where S is the total number of documents in the database. &copy; 2008 Wiley Periodicals, Inc.
Numerical Analysis in the Water Flowing Influence on the Temperature Distribution with a Water-Cooled Microwave Ablation Antenna
Authors: Qun Nan, Yulin Lu, Youjun Liu, Yi Zeng
Venue: Proceedings of the 2008 International Conference on BioMedical Engineering and Informatics - Volume 01 (2008)

This paper presented numerical analysis for microwave ablation therapy with a water-cooled antenna operating at 60W in the vitro. An axis symmetric finite element model was developed to simulate the temperature field, in which the influences of the water flow and heating time on the temperature distribution were investigated. Results show that the effect of water flow rate nearly made no difference on the ablation size under the three given water velocity and heating time can affect the ablation area evidently.
Solving multivariate linear recurrences in wedges (abstract only)
Authors: Marko Petkovsek
Venue: ACM Communications in Computer Algebra (2008)

Many problems of combinatorial enumeration can be reduced to solving multivariate linear recurrences with constant coefficients in wedge-like domains. We survey some results on existence and uniqueness of solutions to such recurrences, on the algebraic nature of their generating functions, and on the methods for solving the corresponding functional equations, in particular the so-called kernel method. We also present a prototype Mathematica package for for obtaining explicit solutions when these generating functions are algebraic of low degree.
Generalizing the PAC model: sample size bounds from metric dimension-based uniform convergence results
Authors: D. Haussler
Venue: Proceedings of the 30th Annual Symposium on Foundations of Computer Science (1989)

The probably approximately correct (PAC) model of learning from examples is generalized. The problem of learning functions from a set X into a set Y is considered, assuming only that the examples are generated by independent draws according to an unknown probability measure on X*Y. The learner's goal is to find a function in a given hypothesis space of functions from X into Y that on average give Y values that are close to those observed in random examples. The discrepancy is measured by a bounded real-valued loss function. The average loss is called the error of the hypothesis. A theorem on the uniform convergence of empirical error estimates to true error rates is given for certain hypothesis spaces, and it is shown how this implies learnability. A generalized notion of VC dimension that applies to classes of real-valued functions and a notion of capacity for classes of functions that map into a bounded metric space are given. These measures are used to bound the rate of convergence of empirical error estimates to true error rates, giving bounds on the sample size needed for learning using hypotheses in these classes. As an application, a distribution-independent uniform convergence result for certain classes of functions computed by feedforward neural nets is obtained. Distribution-specific uniform convergence results for classes of functions that are uniformly continuous on average are also obtained.
Multi-Unit Auction Model Based on Loss Aversion
Authors: Guoqiang Xiong, Chunsheng Zhang
Venue: Proceedings of the First International Workshop on Knowledge Discovery and Data Mining (2008)

Based on the cost of internet auctions and the auctioneers' psychological loss aversion, we do a research on the decision-making of multiunit eauctions. The loss aversion psychology of auctioneers is drawn into the expected utility function model. Meantime, the function of the multiunit e-auctions, which reflects the multiunit e-auction of auctioneers' loss aversion, is established. Then an analysis of the static comparison is made to the influence of the loss aversion coefficient on the optimal length of auction, the number of optimal auction, as well as the prospective goal. Finally, several examples to analyze conclusions are given.
A Discrete/Continuous Model of Anti-HIV Response and Therapy
Authors: Paola Paci, Filippo Castiglione, Massimo Bernaschi, Valentina Baldazzi
Venue: Proceedings of the Tenth International Conference on Computer Modeling and Simulation (2008)

We present an immune system simulator based on a hybrid discrete/continuous approach. In particular, simulated lymphocytes, antigens and immunocomplexes are treated as stochastic discrete entities whereas interleukins, chemokines and in general small signalling molecules are described as continuous variables ruled by differential equations. The version of the model we present here is customized to reproduce the immune response to HIV and the effects of an anti-retroviral therapy. Our goal is to suggest new therapeutic strategies that can be tested in a computer.
Partitioning infinite trees
Authors: Peter Horak, Katherine Heinrich
Venue: Journal of Graph Theory (2000)

A graph G is bisectable if its edges can be colored by two colors so that the resulting monochromatic subgraphs are isomorphic. We show that any infinite tree of maximum degree &Delta; with infinitely many vertices of degree at least &Delta;&thinsp;-1 is bisectable as is any infinite tree of maximum degree &Delta;&thinsp;&le;&thinsp;4. Further, it is proved that every infinite tree T of finite maximum degree contains a finite subset E of its edges so that the graph T&thinsp;-&thinsp;E is bisectable. To measure how &ldquo;far&rdquo; a graph G is from being bisectable, we define c(G) to be the smallest number k&thinsp;>&thinsp;1 so that there is a coloring of the edges of G by k colors with the property that any two monochromatic subgraphs are isomorphic. An upper bound on c(G), which is in a sense best possible, is presented. &copy; 2000 John Wiley & Sons, Inc. J Graph Theory 34: 113&ndash;127, 2000
New upper bounds on the decomposability of planar graphs
Authors: Fedor V. Fomin, Dimitrios M. Thilikos
Venue: Journal of Graph Theory (2006)

It is known that a planar graph on n vertices has branch-width-tree-width bounded by $\alpha \sqrt {n}$. In many algorithmic applications, it is useful to have a small bound on the constant &alpha;. We give a proof of the best, so far, upper bound for the constant &alpha;. In particular, for the case of tree-width, &alpha;&thinsp;<&thinsp;3.182 and for the case of branch-width, &alpha;&thinsp;<&thinsp;2.122. Our proof is based on the planar separation theorem of Alon, Seymour, and Thomas and some min&ndash;max theorems of Robertson and Seymour from the graph minors series. We also discuss some algorithmic consequences of this result. &copy; 2005 Wiley Periodicals, Inc. J Graph Theory The first author is supported by Norges forskningsr&aring;d projects 162731-V00 and 160778-V30. The second author is supported by the Spanish CICYT project TIN-2004-07925 (GRAMMARS).
Output tracking for nonlinear non-minimum phase systems and application to PVTOL aircraft
Authors: Xinhua Wang, Geng Yang, Wenli Xu
Venue: International Journal of Systems Science (2008)

In this paper, we consider a class of multi-input multi-output (MIMO) nonlinear non-minimum phase systems. For such nonlinear system, an output tracking control approach based on decomposition is presented and applied to a planar vertical takeoff and landing (PVTOL) aircraft. The external dynamics of the system can be separated into minimum-phase and non-minimum-phase parts. The internal dynamics of the system is separated to linear part and nonlinear part, and the linear part of the internal dynamics is only related with the non-minimum phase part of the external dynamics and the states of itself. Consequently, two low-dimensional controllers are designed separately to stabilize the two subsystems, and make the overall closed-loop system stable in spite of the existence of disturbances. Through this method, the design of the controller parameters is very simple. The theoretical results are confirmed by computer simulations.
A Peer-to-Peer Service Platform Architecture for Extended Home Services
Authors: Il-Woo Lee, Moon-Ok Choi, Ho-Jin Park
Venue: Proceedings of the Seventh International Conference on Networking (2008)

Presently, the various Peer-to-Peer (P2P) services are developed and it is provided. P2P service user terminals include the service platform which is subordinate in the application service. In the specific terminal, in case it attempts in order to use the other service, the service platform installation related to the target service has to be separately carried out. P2P service platform of the general purpose has to be provided in order to use the various services. We proposed an infrastructure and service platform for P2P based virtual overlay network.
Simulating (log/sup c/n)-wise independence in NC
Authors: B. Berger, J. Rompel
Venue: Proceedings of the 30th Annual Symposium on Foundations of Computer Science (1989)

A general framework is developed for removing randomness from randomized NC algorithms whose analysis uses only polylogarithmic independence. Previously, no techniques were known to determinize those RNC algorithms depending on more than constant independence. One application of the techniques is an NC algorithm for the set discrepancy problem, which can be used to obtain many other NC algorithms, including a better NC edge-coloring algorithm. As another application an NC algorithm for the hypergraph coloring problem is provided.
Efficient guaranteed disk request scheduling with fahrrad
Authors: Anna Povzner, Tim Kaldewey, Scott Brandt, Richard Golding, Theodore M. Wong, Carlos Maltzahn
Venue: ACM SIGOPS Operating Systems Review (2008)

Guaranteed I/O performance is needed for a variety of applications ranging from real-time data collection to desktop multimedia to large-scale scientific simulations. Reservations on throughput, the standard measure of disk performance, fail to effectively manage disk performance due to the orders of magnitude difference between best-, average-, and worst-case response times, allowing reservation of less than 0.01% of the achievable bandwidth. We show that by reserving disk resources in terms of utilization it is possible to create a disk scheduler that supports reservation of nearly 100% of the disk resources, provides arbitrarily hard or soft guarantees depending upon application needs, and yields efficiency as good or better than best-effort disk schedulers tuned for performance. We present the architecture of our scheduler, prove the correctness of its algorithms, and provide results demonstrating its effectiveness.
Capacity-based compressed mode control algorithm for inter-system measurements in UMTS system
Authors: ChengTa Chang, ChingYao Huang, ChiehYuan Ho
Venue: Wireless Networks (2008)

The Inter-system handover between UMTS and GSM is one of the key features in the third generation UMTS cellular system. The compressed mode, with variable transmission gaps and power levels, is standardized to support the inter-frequency/system handover. In this article, a capacity-based compressed mode algorithm which considers potential impacts on the capacity and the priority of operating the compressed mode measurement is proposed to reduce the use of system resources while maintaining the UMTS-to-GSM border-cell handover quality. The performance of the proposed algorithm will be studied based on UMTS simulation platform.
Performance analysis of connection oriented services with Book-Ahead reservations in Internet Protocol optical networks
Authors: Qiang Song, Zhaoming Li, Ibrahim Habib
Venue: International Journal of Autonomous and Adaptive Communications Systems (2008)

In this article, we study the impact of supporting connection-oriented services in Internet Protocol (IP) optical networks. We consider two types of services: (a) Book-Ahead (BA) reservations and (b) Immediate Request ones. We propose a heuristic First Available Shortest Path (FASP) algorithm for BA reservation subject to quality of service constraints such as minimising call blocking rate while maximising the utilisation of the network's assets. The efficiency of the algorithm is assessed via comparisons vs. those of an Integer Linear Programming (ILP) algorithm, the standard Shorted Path First algorithm (SPF) and Shortest-Widest Path algorithm (SWP). Our simulation results show that the FASP has a blocking probability that is close to the ILP algorithm as the number of wavelength per link is more than 10, and FASP also shows better performance than both the SPF and the SWP, for a representative set of topologies, under a representative set of traffic conditions. We, then, focus on the performance analysis of using FASP for BA reservations to identify the operating regions where cost is minimised and revenue is maximised. By introducing different classes of BA services, revenues can be increased under certain operating conditions.
A Robust Method for Multiple Face Tracking Using Kalman Filter
Authors: Zaheer Shaik, Vijayan Asari
Venue: Proceedings of the 36th Applied Imagery Pattern Recognition Workshop (2007)

A robust method for tracking faces of multiple people moving in a scene using Kalman filter is proposed in this paper. To distinguish faces of people during partial occlusion the proposed method uses the non-parametric cloth distribution. To overcome the problem of total occlusion, faces are tracked using the values generated by Kalman prediction algorithm. The size, top-left coordinate and velocity of motion of the detected face being the parameters of the Kalman vector; the predicted values are used to locate faces in the next frame. The faces are redetected and the templates are updated at discrete time intervals when the similarity measures, between the faces detected and respective face templates, are less than a preset threshold. Skin segmentation based face detection makes the algorithm computationally simple, and updating the face template makes it invariant to pose changes. The proposed method is experimented to be invariant to lightning conditions, change of pose, and works well in the case of partial and total occlusion for a short period.
Efficient Management of Semi-Persistent Data for the Evolving Web
Authors: Kai Cheng, Xiaodong You, Yanchun Zhang
Venue: Proceedings of the 22nd International Conference on Advanced Information Networking and Applications - Workshops (2008)

The web is an information repository that grows and evolves fast. Traditional data management systems are based on a persistence model that are not suited for management of web data. In this paper, we propose a semi-persistence model to capture the evolving nature of the web. By semi-persistence, we mean data with relaxed persistence requirement where obsolete data may be moved to somewhere or removed implicitly and autonomously. In a semi-persistent data management system, data and the associated statistics have to be maintained efficiently to support trend-report queries and age estimation. We propose a space-efficient data structure, called Moving Bloom Filters (MBF) to maintain time-sensitive statistics of underlying data. The preliminary experiments show that the optimized MBF achieves considerable improvement on space usage while maintaining the same precise estimation of frequency statistics.
An investigation of the state formation and transition limitations for prediction problems in recurrent neural networks
Authors: Angel Kennedy, Cara MacNish
Venue: Proceedings of the thirty-first Australasian conference on Computer science - Volume 74 (2008)

Recurrent neural networks are able to store information about previous as well as current inputs. This "memory" allows them to solve temporal problems such as language recognition and sequence prediction, and provide memory elements for larger cognitive networks. It is generally understood that there is an (increasing) relationship between the number of nodes (and connections) in a network, the capabilities of the network, and the amount of training required. However the specifics of this relationship are less well understood. In particular, given that the state of a recurrent network is encoded as a real-valued vector of activation levels, even for small networks there are infinitely many states to choose from. What then determines, or limits, the capabilities of the network? In this paper we use dynamical systems techniques to examine this question in regard to temporal lag. We show that for simple delay problems that the network is unable to solve, the system is able to learn sufficient state representations, but appears to be unable to create transitions that allow it to access those states in the correct order (or equivalently, is unable to arrange its states to suit the transitions that it can support).
On characterization of linear phase nonuniform filter banks
Authors: Sanjay Nalbalwar, S. D. Joshi, R. K. Patney
Venue: Signal Processing (2008)

In this paper, a condition termed as linear phase condition (LPC), which ensures that the filters of a nonuniform filter bank are linear phase, is presented. It is observed that the proposed LPC is also applicable to the uniform filter bank case. Further, the utility of this LPC to find (i) necessary restrictions on the filters lengths, (ii) the number of symmetric and antisymmetric filters in the filter bank and (iii) filter bank decimation factors is also investigated. The results obtained for the different cases are also presented in the form of tables. These tables will facilitate the design of nonuniform filter bank by ruling out the non-solvable cases and by reducing the search space, thus saving the designers' precious time.
Analysis of high resolution MOMS cloud scenes for CLOUDMAP validation
Authors: A. Drescher
Venue: International Journal of Remote Sensing (2007)

CLOUDMAP applied stereo registration and differential spectroscopy in the A-band of molecular oxygen as new observation methods of clouds, provided by existing or new instruments on polar orbiting satellites with 250 to 1000 m pixel size, comparable to the cloud mean size. Cloud coverage within pixel can only be estimated from spectral effects. High resolution stereoscopic cloud images with 18 m pixel size obtained by the German Modular Opto-electronic Multi-spectral Scanner (MOMS) on the Russian space station MIR over crossing areas with the polar orbiting satellites at small time delays were provided for CLOUDMAP as 3D reference data within the sub-pixel scale of the CLOUDMAP sensors. The main product is an Apparent Stereoscopic Cloud Height (ASCH) with a systematic error resulting from the cloud drift component in the ground track direction of MOMS. Estimates of cloud shadow height and shadow drift were applied to correct for this effect. The cloud data evaluation was based on software of DLR for surface photogrammetry. Cloud to shadow matching was accomplished with radiometric inverted cloud shadow regions. The validation of the applied procedures was based upon the redundancy of the results of different stereo pairs and upon an independent evaluation of the along and cross track components of the cloud and shadow parallaxes.
Defining an agenda for human-centered computing
Authors: Andrew Sears, Jonathan Lazar, Ant Ozok, Gabriele Meiselwitz
Venue: Issue 91 (June 2008) (2008)

Two workshops sponsored by the National Science Foundation (NSF) were held in September 2006 at NSF headquarters in Arlington, Virginia, with the goal of identifying important and emerging research areas and trends in Human-Centered Computing (HCC). In this article we report on these workshops, each of which was attended by about 30 prominent researchers in the area.
Reducing the Cluster Overhead by Selecting Optimal and Stable Cluster Head through Genetic Algorithm
Authors: S. Muthuramalingam, R. Malarvizhi, R. Veerayazhini, R. Rajaram
Venue: Proceedings of the 2008 Second Asia International Conference on Modelling & Simulation (AMS) (2008)

This paper proposes an idea for selecting cluster heads which are not only stable but also reduces the overhead in maintaining the cluster architecture. Cluster maintenance overheads can be minimized by minimizing the number of generated clusters and the variance of the number of cluster members. The goal is to provide a generic and stable cluster structure for the upper layers. The optimization is done through genetic algorithm.
DiMaC: a system for cleaning disguised missing data
Authors: Ming Hua, Jian Pei
Venue: Proceedings of the 2008 ACM SIGMOD international conference on Management of data (2008)

In some applications such as filling in a customer information form on the web, some missing values may not be explicitly represented as such, but instead appear as potentially valid data values. Such missing values are known as disguised missing data, which may impair the quality of data analysis severely. The very limited previous studies on cleaning disguised missing data highly rely on domain background knowledge in specific applications and may not work well for the cases where the disguise values are inliers. Recently, we have studied the problem of cleaning disguised missing data systematically, and proposed an effective heuristic approach [2]. In this paper, we describe a demonstration of DiMaC, a <u>Di</u>sguised <u>M</u>issing D<u>a</u>ta <u>C</u>leaning system which can find the frequently used disguise values in data sets without requiring any domain background knowledge. In this demo, we will show (1) the critical techniques of finding suspicious disguise values; (2) the architecture and user interface of DiMaC system; (3) an empirical case study on both real and synthetic data sets, which verifies the effectiveness and the efficiency of the techniques; (4) some challenges arising from real applications and several direction for future work.