ppxscal/embedding_network huggingface dataset:
Tourism and Travel Electronic Commerce in China
Authors: Yaobin Lu, Zhaohua Deng, Bin Wang
Venue: Electronic Markets (2007)

China, a fast-growing developing country, is one of the world's most popular tourism destinations because of its large number of historical and natural scenic attractions. With the development of the Internet, tourism and travel electronic commerce (e-commerce) have flourished in China, and the travel industry has experienced significant structural changes since 1999. This study examines how tourism and travel e-commerce boomed in China, how the tourism value chain has changed in the new environment, and the current status of China's tourism and travel e-commerce. Using data collected from 4,980 tourism and travel websites in China and the China Statistical Yearbook 2005, we examine the classification and functions of these websites. Our results suggest that travel agencies provide about half of the tourism and travel-related websites in China. Most websites still only provide general information, while some provide search, online reservation, and payment services. We also present results on our tourism and travel website consumer satisfaction survey, and discuss the factors affecting consumers' decision-making process in tourism and travel e-commerce and the future of the tourism and travel e-commerce in China.
A Distributed Shared Parallel IO System for HPC
Authors: Yufeng Guo, Qiong Li, Guangming Liu, Yusheng Cao, Lei Zhang
Venue: Proceedings of the Fifth International Conference on Information Technology: New Generations (2008)

The technology of parallel IO is one of the key technologies for high performance computer. Firstly, the IO system of the newest Top 500 typical machines will be introduced in this paper. Secondly, a new distributed shared parallel IO system for high performance computer (DSPIO) will be put forward, and some key technologies implemented in the system will be discussed. Finally, a prototype system is built. The experiment results show that this architecture can offer high IO bandwidth, good scalability, and suit for high performance computing very much.
Interlinking the Social Web with Semantics
Authors: Uldis Bojārs, John G. Breslin, Vassilios Peristeras, Giovanni Tummarello, Stefan Decker
Venue: IEEE Intelligent Systems (2008)

One of the most visible trends on the Web is the emergence of Social Web sites, which help people create and gather knowledge by simplifying user contributions via blogs, tagging and folksonomies, wikis, podcasts, and online social networks. Current online-community sites are isolated from one another, like islands in a sea. Various discussions might contain complementary knowledge and discussions—parts of the answer a person is looking for—but people participating in one discussion can't readily access information about related discussions elsewhere. The potential synergies among many sites, communities, and services are expensive to exploit, and their data are difficult and cumbersome to link and reuse. The main reason for this lack of interoperation is that for the most part in the Social Web, common standards still don't exist for knowledge and information exchange and interoperation. However, the Semantic Web effort aims to provide the tools needed to define extensible, flexible standards for this purpose. The Semantic Web technology stack is well defined, enabling the creation of metadata and associated vocabularies. The Semantic Web effort is in an ideal position to make Social Web sites interoperable. Applying Semantic Web frameworks including SIOC (Semantically Interlinked Online Communities) and FOAF (Friend-of-a-Friend) to the Social Web can lead to a Social Semantic Web, creating a network of interlinked and semantically rich knowledge. This article is part of a special issue called Semantic Web Update.
S3PR: Secure Serverless Search Protocols for RFID
Authors: Sheikh I. Ahamed, Farzana Rahman, Endadul Hoque, Fahim Kawsar, Tatsuo Nakajima
Venue: Proceedings of the 2008 International Conference on Information Security and Assurance (isa 2008) (2008)

For RFID tags to proliferate in our day to day life, they will have to offer practical, low cost and secured mechanisms for tag authentication which has been in the midst of researcher’s interest for almost a decade. One extension of RFID authentication is RFID tag searching, which has not been given much attention so far. But we firmly believe that in near future tag searching will be a significant issue. In this paper we propose a lightweight and serverless RFID tag searching protocol. This protocol can search a particular tag efficiently without server’s intervention. Furthermore they are secured against major security threats.
Recalling Leo
Authors: Vladimir Gurvich
Venue: Discrete Applied Mathematics (2008)

@?@?@?
A pairing SW implementation for Smart-Cards
Authors: Guido M. Bertoni, Luca Breveglieri, Liqun Chen, Pasqualina Fragneto, Keith A. Harrison, Gerardo Pelosi
Venue: Journal of Systems and Software (2008)

The aim of this work is to show the feasibility of the primitives of the identity based cryptosystems for applications in Smart-Cards. Several observations are applied to easily choose many supersingular elliptic curves over a prime field F"p,p>3,p=3mod4, in such a way that the size of the torsion subgroup, the curve order and the finite field characteristic are of minimal Hamming weight. We modify the Chudnovsky elliptic curve point representation to settle a dedicated coordinate system for pairings and to minimize the number of operations in the finite field. The encouraging timing results obtained for ST22 Smart-Card architecture show the feasibility of pairing primitives for embedded devices.
Applying dynamic reconfiguration for fault tolerance in fine-grained logic arrays
Authors: Peter Zipf
Venue: IEEE Transactions on Very Large Scale Integration (VLSI) Systems (2008)

This paper presents the realization of a fault tolerance technique for a dynamically reconfigurable array of programmable cells. The three parts of the technique, fault detection, fault reconfiguration, and fault recovery, are implemented completely in hardware and form a self-contained system. Each of the parts can be exchanged by an alternative implementation without affecting the remaining parts too much, thus making the concept adaptable to different reconfigurable circuits. A hardware realization for the core mechanism is discussed and a prototypical design of a field-programmable gate array implementing the complete system is described. The technological development towards nanoscale feature sizes and the growing influence of deep-submicrometer effects will result in an inherent unreliability of the individual components of future circuit implementations and a higher vulnerability towards external influences. The technique discussed can be used to exploit dynamic reconfiguration capabilities of programmable arrays to alleviate system vulnerability towards these effects and thus to enhance their overall reliability.
A MANET-centric solution for the application of NEMO in VANET using geographic routing
Authors: Roberto Baldessari, Wenhui Zhang, Andreas Festag, Long Le
Venue: Proceedings of the 4th International Conference on Testbeds and research infrastructures for the development of networks & communities (2008)

In this paper, we propose a novel solution for usage of the Network Mobility Basic Support protocol in vehicular ad hoc networks. The solution adopts geographical routing as a sub-IP ad hoc routing protocol and applies a standard NEMO Mobile Router on top. As a result, Internet access enhanced with IP mobility support is available via a multi-hop path towards an access point. Compared with other approaches, this solution allows for immediate adaptation of data routes to topology changes, as shown by the results of measurements conducted for high rate data traffic. The paper also analyzes the case of vehicular networks isolated from a network infrastructure and suggests basic strategies for the integrated support of connected and disconnected scenarios. Finally, selected items for further research in this area are suggested.
Data Sonification for Users with Visual Impairment: A Case Study with Georeferenced Data
Authors: Haixia Zhao, Catherine Plaisant, Ben Shneiderman, Jonathan Lazar
Venue: ACM Transactions on Computer-Human Interaction (TOCHI) (2008)

We describe the development and evaluation of a tool, iSonic, to assist users with visual impairment in exploring georeferenced data using coordinated maps and tables, augmented with nontextual sounds and speech output. Our in-depth case studies with 7 blind users during 42 hours of data collection, showed that iSonic enabled them to find facts and discover trends in georeferenced data, even in unfamiliar geographical contexts, without special devices. Our design was guided by an Action-by-Design-Component (ADC) framework, which was also applied to scatterplots to demonstrate its generalizability. Video and download is available at www.cs.umd.edu/hcil/iSonic/.
Extensions of simple component analysis and simple linear discriminant analysis using genetic algorithms
Authors: Robert Sabatier, Christelle Reynès
Venue: Computational Statistics Data Analysis (2008)

Extensions of Simple Component Analysis are proposed. Two methods are obtained: a new Simple Component Analysis and a Simple Linear Discriminant Analysis. These two methodologies use Genetic Algorithms, optimize a criterion (derived from the usual method) and add constraints. The objective is to obtain loadings constituted of a small number of integers determining blocks of variables. The programs implementing the methods have been developed using the R^(C) language. Four applications are made and show a good robustness of the algorithms and a proximity to the optimal solution (from the usual PCA and LDA).
Is it DSS or OLTP: automatically identifying DBMS workloads
Authors: Said Elnaffar, Pat Martin, Berni Schiefer, Sam Lightstone
Venue: Journal of Intelligent Information Systems (2008)

The type of the workload on a database management system (DBMS) is a key consideration in tuning the system. Allocations for resources such as main memory can be very different depending on whether the workload type is Online Transaction Processing (OLTP) or Decision Support System (DSS). A DBMS also typically experiences changes in the type of workload it handles during its normal processing cycle. Database administrators must therefore recognize the significant shifts of workload type that demand reconfiguring the system in order to maintain acceptable levels of performance. We envision intelligent, autonomic DBMSs that have the capability to manage their own performance by automatically recognizing the workload type and then reconfiguring their resources accordingly. In this paper, we present an approach to automatically identifying a DBMS workload as either OLTP or DSS. Using data mining techniques, we build a classification model based on the most significant workload characteristics that differentiate OLTP from DSS and then use the model to identify any change in the workload type. We construct and compare classifiers built from two different sets of workloads, namely the TPC-C and TPC-H benchmarks and the Browsing and Ordering profiles from the TPC-W benchmark. We demonstrate the feasibility and success of these classifiers with TPC-generated workloads and with industry-supplied workloads.
Hierarchical hybrid grids: achieving TERAFLOP performance on large scale finite element simulations
Authors: B. Bergen, G. Wellein, F. Hülsemann, U. Rüde
Venue: International Journal of Parallel, Emergent and Distributed Systems (2007)

The design of the hierarchical hybrid grids (HHG) framework is motivated by the desire to achieve high performance on large-scale, parallel, finite element simulations on super computers. In order to realize this goal, careful analysis of the low-level, computationally intensive algorithms used in implementing the library is necessary. This analysis is primarily concerned with identifying and removing bottlenecks that limit the serial performance of multigrid component algorithms such as smoothing and residual error calculation. To aid in this investigation, two metrics have been developed: the balance metric (BM), and the loads per miss metric (LPMM). Each of these metrics makes assumptions about the interaction of various data structures and algorithms with the underlying memory subsystems and processors of the architectures on which they are implemented. Applying these metrics generates performance predictions that can then be compared to measured results to determine the actual characteristics of an algorithm/data structure on a given platform. This information can then be used to increase performance. In this paper, we first present an overview of the HHG framework. Next, we introduce the details of the two performance metrics. These metrics are then applied to three different data structures used to implement a Gauß-Seidel smoothing algorithm. Performance results and an interpretation of the underlying interactions of the data structures with several relevant supercomputing architectures are given. Finally, we present a brief discussion of some performance results of the HHG framework, followed by some concluding remarks.
Improving web-query processing through semantic knowledge
Authors: Jordi Conesa, Veda C. Storey, Vijayan Sugumaran
Venue: Data Knowledge Engineering (2008)

Although search engines are very useful for obtaining information from the World Wide Web, users still have problems obtaining the most relevant information when processing their web queries. Prior research has attempted to use different types of knowledge to improve web querying processing with various levels of success. This research presents a methodology for processing web queries that employs semantic knowledge about different application domains from ResearchCyc, as well as linguistic knowledge from WordNet. An analysis of different queries from different application domains using the semantic and linguistic knowledge illustrates how more relevant results can be obtained.
Improving urban classification through fuzzy supervised classification and spectral mixture analysis
Authors: J. Tang, L. Wang, S. W. Myint
Venue: International Journal of Remote Sensing (2007)

In this study, a fuzzy-spectral mixture analysis (fuzzy-SMA) model was developed to achieve land use/land cover fractions in urban areas with a moderate resolution remote sensing image. Differed from traditional fuzzy classification methods, in our fuzzy-SMA model, two compulsory statistical measurements (i.e. fuzzy mean and fuzzy covariance) were derived from training samples through spectral mixture analysis (SMA), and then subsequently applied in the fuzzy supervised classification. Classification performances were evaluated between the 'estimated' landscape class fractions from our method and the 'actual' fractions generated from IKONOS data through manual interpretation with heads-up digitizing option. Among all the sub-pixel classification methods, fuzzy-SMA performed the best with the smallest total_MAE (MAE, mean absolute error) (0.18) and the largest Kappa (77.33%). The classification results indicate that a combination of SMA and fuzzy logic theory is capable of identifying urban landscapes at sub-pixel level.
Trust-based evolutionary game model assisting AODV routing against selfishness
Authors: K. Komathy, P. Narayanasamy
Venue: Journal of Network and Computer Applications (2008)

Self-organizing networks such as wireless ad hoc networks present a number of problems and paradoxes towards trustworthiness and consistency of the network. Lack of cooperation between nodes drastically brings down the throughput of the network. Selfish behavior of the nodes is one of the issues, which deter the trust among them. This paper explores the multiple modes to build trust and proposes an effective, dynamic and distributed framework using evolutionary game theory. Strategic, non-cooperative and evolutionary game theory has been utilized to model the dynamic behavior of selfish nodes in a self-policing ad hoc network. AODV routing assisted by the proposed game model enlightens a cogent scenario, which demonstrates that it can stimulate cooperation among selfish nodes, albeit without negotiations. The proposed model encompasses two distinct modes to learn and predict the behavior of neighbors namely deterministic and random. Deterministic mode is a generic one which helps to analyze the behavior of the network for standard strategic patterns whereas the random strategy profiles are explored using randomized analysis based on genetic algorithm. This paper investigates the simulated results for the two methods and asserts that if nodes use evolved strategies and trust evaluation mechanism, then the model supports in accomplishing the cooperation level to reach the maximum possible.
A stochastic control model for optimal timing of climate policies
Authors: O. Bahn, A. Haurie, R. Malhamé
Venue: Automatica (Journal of IFAC) (2008)

A stochastic control model is proposed as a paradigm for the design of optimal timing of greenhouse gas (GHG) emission abatement. The resolution of uncertainty concerning climate sensitivity and the technological breakthrough providing access to a carbon-free production economy are modeled as controlled stochastic jump processes. The optimal policy is characterized using the dynamic programming solution to a piecewise deterministic optimal control problem. A numerical illustration is developed with a set of parameters calibrated on recently proposed models for integrated assessment of climate policies. The results are interpreted and the insights they provide on the timing issue of climate policy are discussed.
Shape-preserving C1 Hermite interpolants generated by a Gori-Pitolli subdivision scheme
Authors: Francesca Pelosi, Paul Sablonnière
Venue: Journal of Computational and Applied Mathematics (2008)

In this paper we present a method for the construction of C^1 Hermite interpolants obtained from a particular family of refinable spline functions introduced by Gori and Pitolli. They constitute a one-parameter subfamily of the Hermite interpolants generated by the general Merrien's subdivision scheme. We compare this family to the other one-parameter subfamily studied by Merrien and Sablonniere and Lyche and Merrien on the solution of two-points Hermite interpolation problems with arbitrary monotonicity or convexity constraints.
Graph partitioning into isolated, high conductance clusters: theory, computation and applications to preconditioning
Authors: Ioannis Koutis, Gary L. Miller
Venue: Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures (2008)

We consider the problem of decomposing a weighted graph with n vertices into a collection P of vertex disjoint clusters such that, for all clusters C ε P, the graph induced by the vertices in C and the edges leaving C, has conductance bounded below by φ. We show that for planar graphs we can compute a decomposition P such that |P| n/ρ, where ρ is a constant, in O(log n) parallel time with O(n) work. Slightly worse guarantees can be obtained in nearly linear time for graphs that have fixed size minors or bounded genus. We show how these decompositions can be used in the first known linear work parallel construction of provably good preconditioners for the important class of fixed degree graph Laplacians. On a more theoretical note, we present upper bounds on the Euclidean distance of eigenvectors of the normalized Laplacian from the space of vectors which consists of the cluster-wise constant vectors scaled by the square roots of the total incident weights of the vertices.
Modelling the performance characteristics of radial active magnetic bearings: comparison of 2-D and 3-D finite element method and reluctance network method
Authors: Janne Nerg, Riku Pöllänen
Venue: Proceedings of the 9th International Conference on Circuits (2005)

Comparison of the accuracy of different numerical computation methods in calculating the performance characteristics of radial active magnetic bearings is presented. It is shown that when the magnetic cores of the stator and the rotor remain at the linear region of the core materials magnetization curve, the two-dimensional approaches, i.e. 2-D finite element method and reluctance network method, are valid. However, these methods neglect the end-field effects, which deteriorates their accuracy especially when the rotor and the stator core are saturated. In order to accurately cover the whole operation range of radial active magnetic bearings 3-D finite element method should be used.
Generating Minimum Transitivity Constraints in P-time for Deciding Equality Logic
Authors: Mirron Rozanov, Ofer Strichman
Venue: Electronic Notes in Theoretical Computer Science (ENTCS) (2008)

In a CAV'05 paper [Meir, O. and O. Strichman, Yet another decision procedure for equality logic, in: K. Etessami and S. Rajamani, editors, Proc. 17^t^h Intl. Conference on Computer Aided Verification (CAV'05), Lect. Notes in Comp. Sci. 3576 (2005), pp. 307-320] we introduced a new decision procedure for Equality Logic: each equality predicate is encoded with a Boolean variable, and then a set of transitivity constraints are added to compensate for the loss of transitivity of equality. The constraints are derived by analyzing Contradictory Cycles: cycles in the equality graph with exactly one disequality. Such a cycle is called constrained under a formula @f if @f is not satisfied with an assignment of true to all equality edges and false to the disequality edge. While we proved in [Meir, O. and O. Strichman, Yet another decision procedure for equality logic, in: K. Etessami and S. Rajamani, editors, Proc. 17^t^h Intl. Conference on Computer Aided Verification (CAV'05), Lect. Notes in Comp. Sci. 3576 (2005), pp. 307-320] that it is sufficient to constrain all simple contradictory cycles, we left open the question of how to find the necessary constraints in polynomial time. Instead, we showed two possible compromises: an exponential algorithm, or, alternatively, a polynomial approximation that constrains all contradictory cycles rather than only the simple ones. In this article we show a polynomial algorithm that constrains only the simple contradictory cycles.
Building User Confidence in RFID Technology for Mobile and Retail Environments
Authors: Himanshu Pagey
Venue: Proceedings of the 22nd International Conference on Advanced Information Networking and Applications - Workshops (2008)

RFID technology has made great advancements in supply chain since last 4 years but its use in retail (aka post point of sale) domain has been marred with controversies due to privacy issues. These issues arise because passive tags respond to any interrogating reader. In future, mobile RFID readers will be as ubiquitous as cell phones. Some of them would be embedded in cell phones. This will further exacerbate privacy issues and will slow down this technology`s deployment in the retail domain. The work in this paper aims to instill consumer confidence by protecting them from “competitive marketing” and “preference” threats by presenting a scalable architecture to prevent unauthorized reading of RFID tags in retail and mobile environments. The architecture restricts the readers in these environments to read only “approved” tags. The paper mulls formation of a central regulatory entity to certify readers and to monitor their behavior upon deployment.