ppxscal/embedding_network huggingface dataset:
Hybrid polymer/semiconductor microtubes: A new fabrication approach
Authors: C. Giordano, M. T. Todaro, M. Palumbo, L. Blasi, V. Errico, A. Salhi, A. Qualtieri, G. Gigli, A. Passaseo, M. De Vittorio
Venue: Microelectronic Engineering (2008)

In this contribution we show the fabrication of functional hybrid organic-semiconductor microtubes obtained by combining the self-rolling of In"0"."2Ga"0"."8As/GaAs layers with the deposition of polymer multilayers obtained by Layer-by-Layer (LbL) self-assembly. It was demonstrated that the polymer multilayers are compatible with the selective etching exploited for the channel formation and that reactivity to an external stimulus (e.g. pH) is maintained after the hybrid structure formation.
Network congestion avoidance strategy with particle filter
Authors: Xiaolong Qian, Yuanwei Jing, Jing Tian
Venue: Computer Communications (2008)

Based on the property of Markov chain for network data, a new estimator with particle filter is proposed for congestion control in this paper. The proposed scheme can predict the traffic patterns by the decision-making model. Compared with previous scheme based on fuzzy neural network, the proposed scheme can adaptively adjust the network rate in real-time and reduce the cell loss rate, so that it can efficiently avoid the traffic congestion. Simulation results are shown to be promising.
A bottom-up algorithm for query decomposition
Authors: Thi Thu Thuy Le, Dai Duong Doan, Virendrakumar C. Bhavsar, Harold Boley
Venue: International Journal of Innovative Computing and Applications (2008)

In order to access data from various data repositories, in Global-As-View approaches an input query is decomposed into several subqueries. Normally, this decomposition is based on a set of mappings, which describe the correspondence of data elements between a global schema and local ones. However, building mappings is a difficult task, especially when the number of participating local schemas is large. In our approach, an input query is automatically decomposed into subqueries without using mappings. An algorithm is proposed to transform a global path expression (e.g. an XPath query) into local path expressions executable in local schemas. This algorithm considers parts of a path expression from right to left, that is, the algorithm traverses from the bottom to the top of a schema tree depending on the structure of local schemas. Compared to top-down approaches, such as by Lausen and Marron, our algorithm can reduce the time for forming subqueries for local (e.g. XML) schemas to a large extent.
An Adaptive Approach to Manage the Number of Virtual Channels
Authors: Mohammad Mirza-Aghatabar, Somayyeh Koohi, Shaahin Hessabi, Dara Rahmati
Venue: Proceedings of the 22nd International Conference on Advanced Information Networking and Applications - Workshops (2008)

Network-on-Chip (NoC) is a precious approach to handle huge number of transistors by virtue of technology scaling to lower than 50nm. Virtual channels have been introduced in order to improve the performance according to a timing multiplexing concept in each physical channel. The incremental effect of virtual channels on power consumption has been shown in literatures.The issue of power saving has always been controversial to many designers. In this paper, we introduce a new technique which tries to adaptively mange the number of virtual channels in order to reduce the power consumption while not degrading the performance of the network without any reconfiguration. Our experimental results show the efficiency of our method in a torus topology under different traffic models and Duato routing algorithm with 49% and 30% power saving in the best and worst conditions, respectively.
Neural network based tire/road friction force estimation
Authors: Jadranko Matuško, Ivan Petrović, Nedjeljko Perić
Venue: Engineering Applications of Artificial Intelligence (2008)

This paper deals with the problem of robust tire/road friction force estimation. Availability of actual value of the friction force generated in contact between the tire and the road has significant importance for active safety systems in modern cars, e.g. anti-lock brake systems, traction control systems, vehicle dynamic systems, etc. Since state estimators are usually based on the process model, they are sensitive to model inaccuracy. In this paper we propose a new neural network based estimation scheme, which makes friction force estimation insensitive to modelling inaccuracies. The neural network is added to the estimator in order to compensate effects of the friction model uncertainties to the estimation quality. An adaptation law for the neural network parameters is derived using Lyapunov stability analysis. The proposed state estimator provides accurate estimation of the tire/road friction force when friction characteristic is only approximately known or even completely unknown. Quality of the estimation is examined through simulation using one wheel friction model. Simulation results suggest very fast friction force estimation and compensation of the changes of the model parameters even when they vary in wide range.
Comparison between several feature extraction/classification methods for mapping complicated agricultural land use patches using airborne hyperspectral data
Authors: S. Lu, K. Oki, Y. Shimizu, K. Omasa
Venue: International Journal of Remote Sensing (2007)

Airborne hyperspectral remote sensing was applied to agricultural land in the Miura Peninsula, near the metropolis of Tokyo in Japan. The study area is characterized by complicated land use patches, which is the general characteristic of most agricultural lands in Japan. Several feature extraction/classification methods were examined in classifying the land use and plant species. The results showed that decision boundary feature extraction (DBFE) was better than principal component analysis (PCA) as the feature extraction method. Moreover, the pre-classification process using NDVI that separates the whole study area into vegetated area and non-vegetated areas also improved the classification accuracy. After the pre-procedures, the land use and plant species were finally mapped by maximum likelihood classification (MLC) or extraction and classification of homogeneous objects (ECHO). The best kappa (overall accuracy) of classification was 0.914 (92.4%) and 0.924 (93.3%) for MLC and ECHO, respectively. The best accuracies of each category for the image were 79.5% to 100% for plant species (watermelon, pumpkin, marigold, grass and tree), 88.7% to 100% for soil types, 97.8% for concrete, and 99.4% for vinyl-mulches. Although, built-up area has low estimation accuracy, this did not affect the overall classification accuracy because it covers only a very small area.
Parameterized complexity of constraint satisfaction problems
Authors: Dániel Marx
Venue: Computational Complexity (2005)

We prove a parameterized analog of Schaefer's Dichotomy Theorem: we show that for every finite boolean constraint family ¿, deciding whether a formula containing constraints from ¿ has a satisfying assignment of weight exactly k is either fixed-parameter tractable (FPT) or W[1]-complete. We give a simple characterization of those constraints that make the problem fixed-parameter tractable. The special cases when the formula is restricted to be bounded occurrence, bounded treewidth, or planar are also considered: it turns out that in these cases the problem is in FPT for every constraint family ¿.
Guest editor introduction
Authors: Suman Banerjee
Venue: ACM SIGMOBILE Mobile Computing and Communications Review (2008)

Building complete systems and demonstrating that our research idea really works is always exciting. The goal of the ACM Mobicom 2007 Research Demonstrations was to foster this spirit of system building and prototyping. This year we introduced a new dimension to the research demonstration event --- the Student Demo Competition. This competition was open to any demonstration in which the lead participant was a student. The event generated quite a bit of excitement as the number of eligible student demonstration submissions was about 20 out of a total of 24 demos. This created a very exciting event on the day of the demo event, September 11, 2007. I would like to congratulate all the different participants of this event for a spectacular show.
Trafficking: design for the viral exchange of TV content on mobile phones
Authors: Richard Harper, Tim Regan, Shahram Izadi, Kharsim Al Mosawi, Mark Rouncefield, Simon Rubens
Venue: Proceedings of the 9th international conference on Human computer interaction with mobile devices and services (2007)

In this paper, we report, first of all, the discovery of a particular kind of emerging social practice involving the exchange of multimedia content on mobiles that we label 'trafficking'. Second, the iteration of a design solution to extend these practices to include the trafficking of broadcast TV content 'segments'. Third, the implications this had for basic assumptions in the interaction design afforded by the two primary OS's in the mobile handset domain. And, fourth, the legal and business inhibitors-enablers that affected not only this research but which are likely to affect all attempts to stretch the capacity of mobile devices and mobile interaction design to afford new ways of 'trafficking' multimedia content.
A multi-layer framework for puzzle-based denial-of-service defense
Authors: XiaoFeng Wang, Michael K. Reiter
Venue: International Journal of Information Security (2008)

Client puzzles have been advocated as a promising countermeasure to denial-of-service (DoS) attacks in recent years. However, how to operationalize this idea in network protocol stacks still has not been sufficiently studied. In this paper, we describe our research on a multi-layer puzzle-based DoS defense architecture, which embeds puzzle techniques into both end-to-end and IP-layer services. Specifically, our research results in two new puzzle techniques: puzzle auctions for end-to-end protection and congestion puzzles for IP-layer protection. We present the designs of these approaches and evaluations of their efficacy. We demonstrate that our techniques effectively mitigate DoS threats to IP, TCP and application protocols; maintain full interoperability with legacy systems; and support incremental deployment. We also provide a game theoretic analysis that sheds light on the potential to use client puzzles for incentive engineering: the costs of solving puzzles on an attackers&#x2019; behalf could motivate computer owners to more aggressively cleanse their computers of malware, in turn hindering the attacker from capturing a large number of computers with which it can launch DoS attacks.
Data mining on the cell broadband engine
Authors: Gregory Buehrer, Srinivasan Parthasarathy, Matthew Goyder
Venue: Proceedings of the 22nd annual international conference on Supercomputing (2008)

The STI Cell Broadband Engine architecture represents an interesting design point along the spectrum of chipsets with multiple processing elements. In this article we investigate key mining tasks such as clustering, classification, anomaly detection and PageRank on the Cell along the axes of performance, programming complexity and algorithm design. As part of our comparative analysis we juxtapose these algorithms with similar ones implemented on state-of-the-art uniprocessor and multicore architectures. For the workloads that are more oating point intensive, and where data is accessed in a streaming fashion the Cell processor is up to seven times faster than competing technologies, when the underlying algorithm uses the hardware efficiently. However, when required to write in a non-streaming fashion, as with PageRank, the processor is up to twenty times slower than competing processors. An outcome of our benchmark study, beyond the results on these particular algorithms is that we answer several higher level questions, which are designed to provide a fast and reliable estimate to application designers for how well other workloads will scale on the Cell.
Remote sensing of urban vegetation life form by spectral mixture analysis of high-resolution IKONOS satellite images
Authors: J. Nichol, M. S. Wong
Venue: International Journal of Remote Sensing (2007)

This paper evaluates the techniques of linear spectral unmixing (LSU), comparing high-and medium-resolution images for their ability to obtain separate estimates of tree and grassy surfaces in urban areas. It demonstrates that, unlike on medium-resolution images, tree and grassy surfaces each constitute distinct endmembers on high-resolution images. This is because at high resolution, shadows in the urban scene approximate pixel size and therefore can be separately masked, thus avoiding the spectral similarities between shadow and tree canopies on the one hand, and low albedo surfaces on the other. In this study, the ability to mask shadow on IKONOS VHR images removes these spectral overlaps. Spatial autocorrelation, applied to find the characteristic scale lengths of vegetated patches in the study area, demonstrated that at the 4 m spatial resolution of IKONOS almost two thirds of pixels would be mixed, and at the 20 m resolution of SPOT all pixels would be mixed. Accuracies of the tree and grass fractions were found to be very high in the case of IKONOS, with 87% confidence that both the grass and tree fractions within each pixel were within 10% of the actual amount. The somewhat lower accuracy for SPOT supports previous studies based on medium-resolution sensors, which have noted that trees do not constitute an endmember.
Extracting entity-relationship diagram from a table-based legacy database
Authors: Dowming Yeh, Yuwen Li, William Chu
Venue: Journal of Systems and Software (2008)

Current database reverse engineering researches presume that the information regarding semantics of attributes, primary keys, and foreign keys in database tables is complete. However, this may not be the case. In a recent DBRE effort to derive a data model from a table-based database system, we find the data content of many attributes are not related to their names at all. In this paper, we present a process that extracts an extended entity-relationship diagram from a table-based database with little descriptions for the fields in its tables and no description for keys. The primary inputs of our approach are system display forms, table schema and data instance. We utilize screen displays to construct form instances. Secondly, code analysis and data analysis involving comparisons of fields and decomposition of fields are applied to extract attribute semantics from forms and table schemas, followed by the determination of primary keys, foreign keys and constraints of the database system. In the final step of conceptualization, with the processes of table mergence and relationship identification, an extended ER diagram is successfully extracted in a case study.
Algorithms for updating Huffman codes
Authors: Yasser El-Sonbaty, Nahla Belal
Venue: Proceedings of the 7th WSEAS International Conference on Applied Mathematics (2005)

Given a list W = [w1,..., wn] of n positive symbol weights, and a list L = [l1,.....,ln] of n corresponding integer codeword lengths, it is required to find the new list L when a new value x is inserted in or when an existing value is deleted from the list of weights W. The presented algorithm uses the given information about the weights and their corresponding levels in order to perform the required update. No other knowledge about the original Huffman Tree is assumed to be known. Instead of rebuilding the Huffman Tree, the new algorithm redistributes the weights among the levels to obtain the new Huffman Code. In many special cases, the updated Huffman Code can be generated with lower complexity than reconstructing the Huffman Tree from scratch by efficiently using the information of weights and their levels. In this paper, we present an updating algorithm that requires a linear complexity in many practical cases rather than the O(n log n) needed for reconstructing the Huffman Tree. We also give practical O(n log n) implementations for our algorithms.
Dynamic service selection in workflows using performance data
Authors: David W. Walker, Lican Huang, Omer F. Rana, Yan Huang
Venue: Scientific Programming (2007)

An approach to dynamic workflow management and optimisation using near-realtime performance data is presented. Strategies are discussed for choosing an optimal service (based on user-specified criteria) from several semantically equivalent Web services. Such an approach may involve finding "similar" services, by first pruning the set of discovered services based on service metadata, and subsequently selecting an optimal service based on performance data. The current implementation of the prototype workflow framework is described, and demonstrated with a simple workflow. Performance results are presented that show the performance benefits of dynamic service selection. A statistical analysis based on the first order statistic is used to investigate the likely improvement in service response time arising from dynamic service selection.
Camera Phones: A Snapshot of Research and Applications
Authors: Franklin Reynolds
Venue: IEEE Pervasive Computing (2008)

The integration of programmable smart phones with smart cameras has enabled new applications, ranging from video conferencing to digital photography to various smart sensors and even augmented reality.
An H-based FEM-BEM formulation for a time dependent eddy current problem
Authors: Salim Meddahi, Virginia Selgas
Venue: Applied Numerical Mathematics (2008)

In this paper, we study a time-dependent eddy current problem posed in the whole space. We prove that the problem has a well-posed weak formulation. We also show that the latter formulation admits a well-posed saddle point structure when the constraint satisfied by the magnetic field in the dielectric medium is handled by means of a Lagrange multiplier. Furthermore, we provide a BEM-FEM formulation of the problem that leads to a semi-discrete Galerkin scheme based on Nedelec's edge elements and Raviart-Thomas elements. Finally, we analyze the asymptotic behavior of the error in terms of the mesh size parameter.
Semisupervised learning from dissimilarity data
Authors: Michael W. Trosset, Carey E. Priebe, Youngser Park, Michael I. Miller
Venue: Computational Statistics Data Analysis (2008)

The following two-stage approach to learning from dissimilarity data is described: (1) embed both labeled and unlabeled objects in a Euclidean space; then (2) train a classifier on the labeled objects. The use of linear discriminant analysis for (2), which naturally invites the use of classical multidimensional scaling for (1), is emphasized. The choice of the dimension of the Euclidean space in (1) is a model selection problem; too few or too many dimensions can degrade classifier performance. The question of how the inclusion of unlabeled objects in (1) affects classifier performance is investigated. In the case of spherical covariances, including unlabeled objects in (1) is demonstrably superior. Several examples are presented.
Internet Alley: High Technology in Tysons Corner, 1945-2005 (Lemelson Center Studies in Invention and Innovation)
Authors: Paul E. Ceruzzi
Venue:  (2008)

Much of the world's Internet management and governance takes place in a corridor extending west from Washington, DC, through northern Virginia toward Washington Dulles International Airport. Much of the United States' military planning and analysis takes place here as well. At the center of that corridor is Tysons Corner--an unincorporated suburban crossroads once dominated by dairy farms and gravel pits. Today, the government contractors and high- tech firms--companies like DynCorp, CACI, Verisign, and SAIC--that now populate this corridor have created an "Internet Alley" off the Washington Beltway. In Internet Alley, Paul Ceruzzi examines this compact area of intense commercial development and describes its transformation into one of the most dynamic and prosperous regions in the country. Ceruzzi explains how a concentration of military contractors carrying out weapons analysis, systems engineering, operations research, and telecommunications combined with suburban growth patterns to drive the region's development. The dot-com bubble's burst was offset here, he points out, by the government's growing national security-related need for information technology. Ceruzzi looks in detail at the nature of the work carried out by these government contractors and how it can be considered truly innovative in terms of both technology and management. Today in Tysons Corner, clusters of sleek new office buildings housing high-technology companies stand out against the suburban landscape, and the upscale Tysons Galleria Mall is neighbor to a government-owned radio tower marked by a sign warning visitors not to photograph or sketch it. Ceruzzi finds that a variety of perennially relevant issues intersect here, making it both a literal and figurative crossroads: federal support of scientific research, the shift of government activities to private contractors, local politics of land use, and the postwar movement from central cities to suburbs.
Alternative approach to continuous-time stochastic systems definition
Authors: René Arnošt, Pavel Žampa
Venue: Proceedings of the 4th WSEAS International Conference on Systems Theory and Scientific Computation (2004)

This paper is based on an alternative approach to system theory and deals with an original definition of continuous-time models of discrete-time causal systems, namely with the definition of continuous-time stochastic systems. Despite the general system theory has been intensively studied since 1960's, none of the developed theories has been fully accepted by professional community up to now. The alternative system theory is based on quite new system paradigms consequent upon attentive observations and results in an axiomatic system theory with correctly and unambiguously defined notions.
Improving interaction with virtual globes through spatial thinking: helping users ask "why?"
Authors: Johannes Schöning, Brent Hecht, Martin Raubal, Antonio Krüger, Meredith Marsh, Michael Rohs
Venue: Proceedings of the 13th international conference on Intelligent user interfaces (2008)

Virtual globes have progressed from little-known technology to broadly popular software in a mere few years. We investigated this phenomenon through a survey and discovered that, while virtual globes are en vogue, their use is restricted to a small set of tasks so simple that they do not involve any spatial thinking. Spatial thinking requires that users ask "what is where" and "why"; the most common virtual globe tasks only include the "what". Based on the results of this survey, we have developed a multi-touch virtual globe derived from an adapted virtual globe paradigm designed to widen the potential uses of the technology by helping its users to inquire about both the "what is where" and "why" of spatial distribution. We do not seek to provide users with full GIS (geographic information system) functionality, but rather we aim to facilitate the asking and answering of simple "why" questions about general topics that appeal to a wide virtual globe user base.