text:
Evaluation of Anonymized ONS Queries
Garcia-Alfaro, Joaquin; Kranakis, Evangelos
Electronic Product Code (EPC) is the basis of a pervasive infrastructure for the automatic identification of objects on supply chain applications (e.g., pharmaceutical or military applications). This infrastructure relies on the use of the (1) Radio Frequency Identification (RFID) technology to tag objects in motion and (2) distributed services providing information about objects via the Internet. A lookup service, called the Object Name Service (ONS) and based on the use of the Domain Name System (DNS), can be publicly accessed by EPC applications looking for information associated with tagged objects. Privacy issues may affect corporate infrastructures based on EPC technologies if their lookup service is not properly protected. A possible solution to mitigate these issues is the use of online anonymity. We present an evaluation experiment that compares the of use of Tor (The second generation Onion Router) on a global ONS/DNS setup, with respect to benefits, limitations, and latency.
Private Queries and Trajectory Anonymization: a Dual Perspective on Location Privacy
Directory of Open Access Journals (Sweden)
Gabriel Ghinita
Full Text Available The emergence of mobile devices with Internet connectivity (e.g., Wi-Fi and global positioning capabilities (e.g., GPS have triggered the widespread development of location-based applications. For instance, users are able to ask queries about points of interest in their proximity. Furthermore, users can act as mobile sensors to monitor traffic flow, or levels of air pollution. However, such applications require users to disclose their locations, which raises serious privacy concerns. With knowledge of user locations, a malicious attacker can infer sensitive information, such as alternative lifestyles or political affiliations. Preserving location privacy is an essential requirement towards the successful deployment of location-based services (LBS. Currently, two main LBS use scenarios exist: in the first one, users send location-based queries to an un-trusted server, and the privacy objective is to protect the location of the querying user. In the second setting, a trusted entity, such as a telephone company, gathers large amounts of location data (i.e., trajectory traces and wishes to publish them for data mining (e.g., alleviating traffic congestion. In this case, it is crucial to prevent an adversary from associating trajectories to user identities. In this survey paper, we give an overview of the state-of-the-art in location privacy protection from the dual perspective of query privacy and trajectory anonymization. We review the most prominent design choices and technical solutions, and highlight their relative strengths and weaknesses.
On Backward-Style Anonymity Verification
Kawabe, Yoshinobu; Mano, Ken; Sakurada, Hideki; Tsukada, Yasuyuki
Many Internet services and protocols should guarantee anonymity; for example, an electronic voting system should guarantee to prevent the disclosure of who voted for which candidate. To prove trace anonymity, which is an extension of the formulation of anonymity by Schneider and Sidiropoulos, this paper presents an inductive method based on backward anonymous simulations. We show that the existence of an image-finite backward anonymous simulation implies trace anonymity. We also demonstrate the anonymity verification of an e-voting protocol (the FOO protocol) with our backward anonymous simulation technique. When proving the trace anonymity, this paper employs a computer-assisted verification tool based on a theorem prover.
Motwani, Rajeev
In this paper we consider the problem of anonymizing datasets in which each individual is associated with a set of items that constitute private information about the individual. Illustrative datasets include market-basket datasets and search engine query logs. We formalize the notion of k-anonymity for set-valued data as a variant of the k-anonymity model for traditional relational datasets. We define an optimization problem that arises from this definition of anonymity and provide a constant factor approximation algorithm for the same. We evaluate our algorithms on the America Online query log dataset.
Ranking Queries on Uncertain Data
Hua, Ming
Uncertain data is inherent in many important applications, such as environmental surveillance, market analysis, and quantitative economics research. Due to the importance of those applications and rapidly increasing amounts of uncertain data collected and accumulated, analyzing large collections of uncertain data has become an important task. Ranking queries (also known as top-k queries) are often natural and useful in analyzing uncertain data. Ranking Queries on Uncertain Data discusses the motivations/applications, challenging problems, the fundamental principles, and the evaluation algorith
Anonymous communication networks protecting privacy on the web
Peng, Kun
In today's interactive network environment, where various types of organizations are eager to monitor and track Internet use, anonymity is one of the most powerful resources available to counterbalance the threat of unknown spectators and to ensure Internet privacy.Addressing the demand for authoritative information on anonymous Internet usage, Anonymous Communication Networks: Protecting Privacy on the Web examines anonymous communication networks as a solution to Internet privacy concerns. It explains how anonymous communication networks make it possible for participants to communicate with
Anonymous Fingerprinting Based on Electronic Cash
Institute of Scientific and Technical Information of China (English)
CHENXiaofeng; ZHANGFangguo; WANGJilin; WANGYumin
A new anonymous fingerprinting protocol based on the principle of electronic cash is proposed in this paper.Redistributing a data item is equal to doublespending electronic cash.Contrasting with the previous coin-based anonymous fingerprinting protocol,we use the real electronic cash to trace traitors instead of the "coins" which serve only as a cryptographic primitive and have no monetary value,so it is easily understood and the bank does not need key-distribution and registration to prepare the "coina".
User perspectives on query difficulty
DEFF Research Database (Denmark)
Lioma, Christina; Larsen, Birger; Schütze, Hinrich
difficult for the system to address? (2) Are users aware of specific features in their query (e.g., domain-specificity, vagueness) that may render their query difficult for an IR system to address? A study of 420 queries from a Web search engine query log that are pre-categorised as easy, medium, hard by...
Digital anonymity on the internet : new rules for anonymous electronic transactions? an exploration of the private law implications of digital anonymity
Grijpink, J.H.A.M.; Prins, C.
This article sets out the most important conclusions of the first stage of a study into the dimensions of digital anonymity. It is intended to set out the problem, make people aware of the intricacies of the problem and thus stimulate the debate on useful legal structures for anonymity. The article focuses on Holland's private law dimensions, addressing situations where consumers want to purchase anonymously on the Internet.
An Anonymous Authenticated Protocol Based on Zero Knowledge Proof
Directory of Open Access Journals (Sweden)
Chao Jing
Full Text Available With the rapid development of the Internet, anonymity and privacy protection in many applications of the scene is critical. The anonymous authentication means that the server cant know the users identity when they are communicating with each other. In this paper, based on the Wangs zero knowledge proof scheme of possessing a digital signature, we propose a new anonymous authentication scheme. Compared with the Cui-Caos anonymous authentication protocol based on the ring signature, our scheme has two advantages. First, we dont need to know all users public keys. And then our scheme reduces the communication traffic largely. We also discuss the security attributes of our new scheme which are authentication, anonymity and unlinkablity. And then we introduce a concrete application of our scheme. Finally, we make a conclusion of this paper.
On the Utility of Anonymized Flow Traces for Anomaly Detection
Burkhart, Martin; May, Martin
The sharing of network traces is an important prerequisite for the development and evaluation of efficient anomaly detection mechanisms. Unfortunately, privacy concerns and data protection laws prevent network operators from sharing these data. Anonymization is a promising solution in this context; however, it is unclear if the sanitization of data preserves the traffic characteristics or introduces artifacts that may falsify traffic analysis results. In this paper, we examine the utility of anonymized flow traces for anomaly detection. We quantitatively evaluate the impact of IP address anonymization, namely variations of permutation and truncation, on the detectability of large-scale anomalies. Specifically, we analyze three weeks of un-sampled and non-anonymized network traces from a medium-sized backbone network. We find that all anonymization techniques, except prefix-preserving permutation, degrade the utility of data for anomaly detection. We show that the degree of degradation depends to a large exten...
Comments on "Anonymous reviewers" ["Anonymous reviews: Self-serving, counterproductive, and unacceptable"
Robinove, Charles J.
Mryl Beck's Forum article denouncing anonymous reviews (Eos, 1 July 2003) is right on the money. Perhaps he read my letter in Applied Physics in 1990 also denouncing anonymous reviews.Some years ago, I received an anonymous review of a paper I had submitted for journal publication. The reviewer raised such interesting questions that I wanted to discuss them with him. I phoned the editor of the journal and asked if he would tell me the name of the reviewer. He politely declined, but when I told him I thought I recognized the handwriting of the reviewer and named him, he relented and said I was correct! I called the reviewer and he was generous enough to spend a wonderful hour on the phone with me discussing the paper. The paper was published with great consideration given to his ideas, much to its betterment. Now that's a reviewer whose interest is in improving the paper and helping the author, not just showing how smart he is or slapping down a junior colleague. The AGU motto,"unselfish cooperation in research," can be well exemplified by those who wish to help rather than to tear down.
Path querying system on mobile devices
Lin, Xing; Wang, Yifei; Tian, Yuan; Wu, Lun
Traditional approaches to path querying problems are not efficient and convenient under most circumstances. A more convenient and reliable approach to this problem has to be found. This paper is devoted to a path querying solution on mobile devices. By using an improved Dijkstra's shortest path algorithm and a natural language translating module, this system can help people find the shortest path between two places through their cell phones or other mobile devices. The chosen path is prompted in text of natural language, as well as a map picture. This system would be useful in solving best path querying problems and have potential to be a profitable business system.
Search Result Diversification Based on Query Facets
Institute of Scientific and Technical Information of China (English)
胡莎; 窦志成; 王晓捷; 继荣
In search engines, different users may search for different information by issuing the same query. To satisfy more users with limited search results, search result diversification re-ranks the results to cover as many user intents as possible. Most existing intent-aware diversification algorithms recognize user intents as subtopics, each of which is usually a word, a phrase, or a piece of description. In this paper, we leverage query facets to understand user intents in diversification, where each facet contains a group of words or phrases that explain an underlying intent of a query. We generate subtopics based on query facets and propose faceted diversification approaches. Experimental results on the public TREC 2009 dataset show that our faceted approaches outperform state-of-the-art diversification models.
Evaluating SPARQL queries on massive RDF datasets
Al-Harbi, Razen
Distributed RDF systems partition data across multiple computer nodes. Partitioning is typically based on heuristics that minimize inter-node communication and it is performed in an initial, data pre-processing phase. Therefore, the resulting partitions are static and do not adapt to changes in the query workload; as a result, existing systems are unable to consistently avoid communication for queries that are not favored by the initial data partitioning. Furthermore, for very large RDF knowledge bases, the partitioning phase becomes prohibitively expensive, leading to high startup costs. In this paper, we propose AdHash, a distributed RDF system which addresses the shortcomings of previous work. First, AdHash initially applies lightweight hash partitioning, which drastically minimizes the startup cost, while favoring the parallel processing of join patterns on subjects, without any data communication. Using a locality-aware planner, queries that cannot be processed in parallel are evaluated with minimal communication. Second, AdHash monitors the data access patterns and adapts dynamically to the query load by incrementally redistributing and replicating frequently accessed data. As a result, the communication cost for future queries is drastically reduced or even eliminated. Our experiments with synthetic and real data verify that AdHash (i) starts faster than all existing systems, (ii) processes thousands of queries before other systems become online, and (iii) gracefully adapts to the query load, being able to evaluate queries on billion-scale RDF data in sub-seconds. In this demonstration, audience can use a graphical interface of AdHash to verify its performance superiority compared to state-of-the-art distributed RDF systems.
Theoretical Results on De-Anonymization via Linkage Attacks
Directory of Open Access Journals (Sweden)
Martin M. Merener
Full Text Available Consider a database D with records containing history of individuals' transactions, that has been de-identified, i.e., the variables that uniquely associate records with individuals have been removed from the data. An adversary de-anonymizes D via a linkage attack if using some auxiliary information about a certain individual in the database, it can determine which record of D corresponds to such individual. One example of this is given in the article Robust De-anonymization of Large Sparse Datasets, by Narayanan and Shmatikov [19], which shows that an anonymized database containing records with ratings of different movies rented by customers of Netflix, could in fact be de-anonymized using very little auxiliary information, even with errors. Besides the heuristic de-anonymization of the Netflix database, Narayanan and Shmatikov provide interesting theoretical results about database de-anonymization that an adversary can produce under general conditions. In this article we revisit these theoretical results, and work them further. Our first contribution is to exhibit different simple cases in which the algorithm Scoreboard, meant to produce the theoretical de-anonymization in [19], fails to do so. By requiring 1-sim to be a pseudo-metric, and that the algorithm producing the de-anonymization outputs a record with minimum support among the candidates, we obtain and prove deanonymization results similar to those described in [19]. We then consider a new hypothesis, motivated by the fact (observed in heuristic de-anonymizations that when the auxiliary information contains values corresponding to rare attributes, the de-anonymization achieved is stronger. We formalize this using the notion on long tail [4], and give new theorems expressing the level of de-anonymization in terms of the parameters of the tail of the database D. The improvement in the deanonymization is reflected in the fact that when at least one value in the auxiliary information
On the Feasibility of (Practical Commercial Anonymous Cloud Storage
Directory of Open Access Journals (Sweden)
Tobias Pulls
Full Text Available Current de facto standard payment and billing models for commercial cloud storage services provide a plethora of information to the cloud provider about its clients. This leads to a hostile environment when seen from a privacy perspective. Motivated by recently leaked facts about large scale governmental surveillance efforts as well as the lack of privacy-preserving measures in existing commercial cloud storage services, in this paper, we investigate the feasibility of so called anonymous cloud storage services which require user payment (which we call commercial anonymous cloud storage. Anonymity in this context can be seen as the absence of information to uniquely identify a provider's client that is storing and manipulating data at the provider while at the same time still allowing fair billing, for both, the clients and the cloud provider. Although encrypting data prior to outsourcing helps to protect data privacy and can be achieved without the cloud provider's consent, the issues we are interested in, do not seem to be achievable that easily. However, while various measures for the latter issue, i.e., realizing access privacy, have been studied in the past, the role of privacy in context of billing and payment for cloud storage has, until now, remained unexplored. We therefore introduce an abstract model for commercial cloud storage services to define various types of anonymous cloud storage, study several payment and billing models for cloud storage services and their impact on the anonymity of the service's clients. Moreover, we discuss several solutions to provide anonymity within the different models. Our findings highlight the importance of anonymous payment for the practical deployment of commercial privacy-friendly cloud storage services. Furthermore, we provide directions for future work in some settings, i.e., when anonymous payment is not available, as interesting open challenges.
Location Prediction Based on Transition Probability Matrices Constructing from Sequential Rules for Spatial-Temporal K-Anonymity Dataset.
Zhang, Haitao; Chen, Zewei; Liu, Zhao; Zhu, Yunhong; Wu, Chenxue
Spatial-temporal k-anonymity has become a mainstream approach among techniques for protection of users' privacy in location-based services (LBS) applications, and has been applied to several variants such as LBS snapshot queries and continuous queries. Analyzing large-scale spatial-temporal anonymity sets may benefit several LBS applications. In this paper, we propose two location prediction methods based on transition probability matrices constructing from sequential rules for spatial-temporal k-anonymity dataset. First, we define single-step sequential rules mined from sequential spatial-temporal k-anonymity datasets generated from continuous LBS queries for multiple users. We then construct transition probability matrices from mined single-step sequential rules, and normalize the transition probabilities in the transition matrices. Next, we regard a mobility model for an LBS requester as a stationary stochastic process and compute the n-step transition probability matrices by raising the normalized transition probability matrices to the power n. Furthermore, we propose two location prediction methods: rough prediction and accurate prediction. The former achieves the probabilities of arriving at target locations along simple paths those include only current locations, target locations and transition steps. By iteratively combining the probabilities for simple paths with n steps and the probabilities for detailed paths with n-1 steps, the latter method calculates transition probabilities for detailed paths with n steps from current locations to target locations. Finally, we conduct extensive experiments, and correctness and flexibility of our proposed algorithm have been verified. PMID:27508502
[Self-disclosure on the Internet: the effects of anonymity of the self and the other].
Sato, Hirotsune; Yoshida, Fujio
The effects of anonymity on self-disclosure were investigated in a CMC (computer-mediated communication) situation by separately manipulating the anonymity of the self and the other. It was hypothesized that anonymity of the self would enhance disclosure, whereas anonymity of the other would decrease it. Female undergraduate students (n = 60) were randomly assigned to a 2 (self: anonymous or non-anonymous) x 2 (other: anonymous or non-anonymous) experimental design. The anonymity of the self and the other was manipulated in the profile, such as the photo, name, and sex of the self or the other, on the computer screen. The results indicated that anonymity of the self decreased the feeling of anxiety, but had no effect on disclosure, whereas anonymity of the other decreased the feeling of closeness and decreased the intimacy of disclosure. PMID:18402057
Implementing Graph Pattern Queries on a Relational Database
Energy Technology Data Exchange (ETDEWEB)
Kaplan, I L; Abdulla, G M; Brugger, S T; Kohn, S R
When a graph database is implemented on top of a relational database, queries in the graph query language are translated into relational SQL queries. Graph pattern queries are an important feature of a graph query language. Translating graph pattern queries into single SQL statements results in very poor query performance. By taking into account the pattern query structure and generating multiple SQL statements, pattern query performance can be dramatically improved. The performance problems encountered with the single SQL statements generated for pattern queries reflects a problem in the SQL query planner and optimizer. Addressing this problem would allow relational databases to better support semantic graph databases. Relational database systems that provide good support for graph databases may also be more flexible platforms for data warehouses.
Query Expansion Based on Clustered Results
Liu, Ziyang; Chen, Yi
Query expansion is a functionality of search engines that suggests a set of related queries for a user-issued keyword query. Typical corpus-driven keyword query expansion approaches return popular words in the results as expanded queries. Using these approaches, the expanded queries may correspond to a subset of possible query semantics, and thus miss relevant results. To handle ambiguous queries and exploratory queries, whose result relevance is difficult to judge, we propose a new framework for keyword query expansion: we start with clustering the results according to user specified granularity, and then generate expanded queries, such that one expanded query is generated for each cluster whose result set should ideally be the corresponding cluster. We formalize this problem and show its APX-hardness. Then we propose two efficient algorithms named iterative single-keyword refinement and partial elimination based convergence, respectively, which effectively generate a set of expanded queries from clustered r...
Research on Deep Web Query Interface Clustering Based on Hadoop
Baohua Qiang; Rui Zhang; Yufeng Wang; Qian He; Wei Li; Sai Wang
How to cluster different query interfaces effectively is one of the most core issues when generating integrated query interface on Deep Web integration domain. However, with the rapid development of Internet technology, the number of Deep Web query interface shows an explosive growth trend. For this reason, the traditional stand-alone Deep Web query interface clustering approaches encounter bottlenecks in terms of time complexity and space complexity. After further study of the Hadoop distrib...
Research on Anonymization and De-anonymization in the Bitcoin System
ShenTu, QingChun; Yu, JianPing
The Bitcoin system is an anonymous, decentralized crypto-currency. There are some deanonymizating techniques to cluster Bitcoin addresses and to map them to users' identifications in the two research directions of Analysis of Transaction Chain (ATC) and Analysis of Bitcoin Protocol and Network (ABPN). Nowadays, there are also some anonymization methods such as coin-mixing and transaction remote release (TRR) to cover the relationship between Bitcoin address and the user. This paper studies an...
Query Representation with Global Consistency on User Click Graph
Zhang, Daqiang; Zhu, Rongbo; Men, Shuqiqiu; Raychoudhury, Vaskar
Extensive research has been conducted on query log analysis. A query log is generally represented as a bipartite graph on a query set and a URL set. Most of the traditional methods used the raw click frequency to weigh the link between a query and a URL on the click graph. In order to address the disadvantages of raw click frequency, researchers proposed the entropy-biased model, which incorporates raw click frequency with inverse query frequency of the URL as the weighting scheme for query r...
On-Line Anonymity: A New Privacy Battle in Cyberspace.
Lee, Laurie Thomas
States that lawsuits are being filed that challenge anonymity and freedom of speech in cyberspace--is there a right to online anonymity? Examines the debate and issues associated with anonymous communications in cyberspace. Explores the "right of informational privacy" as it pertains to anonymity. Suggests some regulatory approaches for addressing…
A Fast Survey on Methods for Classification Anonymity Requirements
Kharaji, Morteza Yousefi; Rizi, Fatemeh Salehi
Anonymity has become a significant issue in security field by recent advances in information technology and internet. The main objective of anonymity is hiding and concealing entities privacy inside a system. Many methods and protocols have been proposed with different anonymity services to provide anonymity requirements in various fields until now. Each anonymity method or protocol is developed using particular approach. In this paper, first, accurate and perfect definitions of privacy and a...
Context-Free Path Queries on RDF Graphs
Zhang, Xiaowang; Feng, Zhiyong; Wang, Xin; Rao, Guozheng
A navigational query on a graph database returns binary relations over the nodes of the graph. Recently, regular expression-based path query languages are popular in expressing navigational queries on RDF graphs. It is natural to replace regular expressions by context-free grammar so that the power of current regular expression-based path query languages would be increased since regular expressions are strictly subsumed in context-free grammar. In this paper, we present context-free path quer...
Complex transitive closure queries on a fragmented graph
Houtsma, Maurice A.W.; Apers, Peter M.G.; Ceri, Stefano; Abiteboul, Serge; Kanellakis, Paris C.
In this paper we study the reformulation of transitive closure queries on a fragmented graph. We split a query into several subqueries, each requiring only a fragment of the graph. We prove this reformulation to be correct for shortest path and bill of material queries. Here we describe the reformul
A Framework for WWW Query Processing
Wu, Binghui Helen; Wharton, Stephen (Technical Monitor)
Query processing is the most common operation in a DBMS. Sophisticated query processing has been mainly targeted at a single enterprise environment providing centralized control over data and metadata. Submitting queries by anonymous users on the web is different in such a way that load balancing or DBMS' accessing control becomes the key issue. This paper provides a solution by introducing a framework for WWW query processing. The success of this framework lies in the utilization of query optimization techniques and the ontological approach. This methodology has proved to be cost effective at the NASA Goddard Space Flight Center Distributed Active Archive Center (GDAAC).
Effects of data anonymization by cell suppression on descriptive statistics and predictive modeling performance.
Ohno-Machado, Lucila; Vinterbo, Staal; Dreiseitl, Stephan
Protecting individual data in disclosed databases is essential. Data anonymization strategies can produce table ambiguation by suppression of selected cells. Using table ambiguation, different degrees of anonymization can be achieved, depending on the number of individuals that a particular case must become indistinguishable from. This number defines the level of anonymization. Anonymization by cell suppression does not necessarily prevent inferences from being made from the disclosed data. P...
Practical System for Querying Encrypted Data on the Cloud
Directory of Open Access Journals (Sweden)
Parul Upadhyaya
Full Text Available This paper proposes, compares and analyses query optimization techniques to securely query encrypted databases. Such querying capability is becoming increasingly relevant as individuals and enterprises move their data to the cloud. The schemes discussed delve into various design issues like speed, scalability and efficiency that are encountered in the context querying encrypted data that is on the cloud. We determine the exact differences in terms of the nature, scenario and behavior amongst the different approaches in between the existing probable solution and our solution that can be applied to the querying problem.
Quantum election scheme based on anonymous quantum key distribution
International Nuclear Information System (INIS)
An unconditionally secure authority-certified anonymous quantum key distribution scheme using conjugate coding is presented, based on which we construct a quantum election scheme without the help of an entanglement state. We show that this election scheme ensures the completeness, soundness, privacy, eligibility, unreusability, fairness, and verifiability of a large-scale election in which the administrator and counter are semi-honest. This election scheme can work even if there exist loss and errors in quantum channels. In addition, any irregularity in this scheme is sensible. (general)
Multidimensional Data Querying on Tree-Structured Overlay
Institute of Scientific and Technical Information of China (English)
XU Lizhen; WANG Shiyuan
Multidimensional data query has been gaining much interest in database research communities in recent years, yet many of the existing studies focus mainly on centralized systems.A solution to querying in Peer-to-Peer(P2P) environment was proposed to achieve both low processing cost in terms of the number of peers accessed and search messages and balanced query loads among peers.The system is based on a balanced tree structured P2P network.By partitioning the query space intelligently, the amount of query forwarding is effectively controlled, and the number of peers involved and search messages are also limited.Dynamic load balancing can be achieved during space partitioning and query resolving.Extensive experiments confirm the effectiveness and scalability of our algorithms on P2P networks.
Path-based Queries on Trajectory Data
DEFF Research Database (Denmark)
Krogh, Benjamin Bjerre; Pelekis, Nikos; Theodoridis, Yannis;
In traffic research, management, and planning a number of path-based analyses are heavily used, e.g., for computing turn-times, evaluating green waves, or studying traffic flow. These analyses require retrieving the trajectories that follow the full path being analyzed. Existing path queries cannot...... sufficiently support such path-based analyses because they retrieve all trajectories that touch any edge in the path. In this paper, we define and formalize the strict path query. This is a novel query type tailored to support path-based analysis, where trajectories must follow all edges in the path...... a specific path by only retrieving data from the first and last edge in the path. To correctly answer strict path queries existing network-constrained trajectory indexes must retrieve data from all edges in the path. An extensive performance study of NETTRA using a very large real-world trajectory data set...
The effect of query complexity on Web searching results
Directory of Open Access Journals (Sweden)
B.J. Jansen
Full Text Available This paper presents findings from a study of the effects of query structure on retrieval by Web search services. Fifteen queries were selected from the transaction log of a major Web search service in simple query form with no advanced operators (e.g., Boolean operators, phrase operators, etc. and submitted to 5 major search engines - Alta Vista, Excite, FAST Search, Infoseek, and Northern Light. The results from these queries became the baseline data. The original 15 queries were then modified using the various search operators supported by each of the 5 search engines for a total of 210 queries. Each of these 210 queries was also submitted to the applicable search service. The results obtained were then compared to the baseline results. A total of 2,768 search results were returned by the set of all queries. In general, increasing the complexity of the queries had little effect on the results with a greater than 70% overlap in results, on average. Implications for the design of Web search services and directions for future research are discussed.
Anonymity in the Wild: Mixes on unstructured networks
Nagaraja, Shishir
As decentralized computing scenarios get ever more popular, unstructured topologies are natural candidates to consider running mix networks upon. We consider mix network topologies where mixes are placed on the nodes of an unstructured network, such as social networks and scale-free random networks. We explore the efficiency and traffic analysis resistance properties of mix networks based on unstructured topologies as opposed to theoretically optimal structured topologies, under high latency conditions. We consider a mix of directed and undirected network models, as well as one real world case study -- the LiveJournal friendship network topology. Our analysis indicates that mix-networks based on scale-free and small-world topologies have, firstly, mix-route lengths that are roughly comparable to those in expander graphs; second, that compromise of the most central nodes has little effect on anonymization properties, and third, batch sizes required for warding off intersection attacks need to be an order of ma...
On the query complexity of finding a local maximum point
Rastsvelaev, A.L.; Beklemishev, L.D.
We calculate the minimal number of queries sufficient to find a local maximum point of a functiun on a discrete interval for a model with M parallel queries, M≥1. Matching upper and lower bounds are obtained. The bounds are formulated in terms of certain Fibonacci type sequences of numbers.
External Data Structures for Shortest Path Queries on Planar Digraphs
DEFF Research Database (Denmark)
Arge, Lars; Toma, Laura
In this paper we present space-query trade-offs for external memory data structures that answer shortest path queries on planar directed graphs. For any S = Ω(N 1 + ε) and S = O(N2/B), our main result is a family of structures that use S space and answer queries in O(N2/ S B) I/Os, thus obtaining...... optimal space-query product O(N2/B). An S space structure can be constructed in O(√S · sort(N)) I/Os, where sort(N) is the number of I/Os needed to sort N elements, B is the disk block size, and N is the size of the graph.......In this paper we present space-query trade-offs for external memory data structures that answer shortest path queries on planar directed graphs. For any S = Ω(N 1 + ε) and S = O(N2/B), our main result is a family of structures that use S space and answer queries in O(N2/ S B) I/Os, thus obtaining...
Grust, Torsten; Scholl, Marc H.
The construction of a declarative query engine for a DBMS includes the challenge of compiling algebraic queries into efficient execution plans that can be run on top of the persistent storage. This work pursues the goal of employing foldr-build deforestation for the derivation of efficient streaming programs - programs that do not allocate intermediate data structures to perform their task - from algebraic (combinator) query plans. The query engine is based on the insertion representation of ...
Blink and it's done: Interactive queries on very large data
Agarwal, Sameer; Iyer, Anand P.; Panda, Aurojit; Mozafari, Barzan; Stoica, Ion; Madden, Samuel R.
In this demonstration, we present BlinkDB, a massively parallel, sampling-based approximate query processing framework for running interactive queries on large volumes of data. The key observation in BlinkDB is that one can make reasonable decisions in the absence of perfect answers. BlinkDB extends the Hive/HDFS stack and can handle the same set of SPJA (selection, projection, join and aggregate) queries as supported by these systems. BlinkDB provides real-time answers along with statistical...
On the Definitions of Anonymity for Ring Signatures
Ohkubo, Miyako; Abe, Masayuki
This paper studies the relations among several definitions of anonymity for ring signature schemes in the same attack environment. It is shown that one intuitive and two technical definitions we consider are asymptotically equivalent, and the indistinguishability-based technical definition is the strongest, i. e., the most secure when achieved, when the exact reduction cost is taken into account. We then extend our result to the threshold case where a subset of members cooperate to create a signature. The threshold setting makes the notion of anonymity more complex and yields a greater variety of definitions. We explore several notions and observe certain relation does not seem hold unlike the simple single-signer case. Nevertheless, we see that an indistinguishability-based definition is the most favorable in the threshold case. We also study the notion of linkability and present a simple scheme that achieves both anonymity and linkability.
The retrieval effectiveness of search engines on navigational queries
Lewandowski, Dirk
Purpose - To test major Web search engines on their performance on navigational queries, i.e. searches for homepages. Design/methodology/approach - 100 real user queries are posed to six search engines (Google, Yahoo, MSN, Ask, Seekport, and Exalead). Users described the desired pages, and the results position of these is recorded. Measured success N and mean reciprocal rank are calculated. Findings - Performance of the major search engines Google, Yahoo, and MSN is best, with around 90 perce...
Study on consistent query answering in inconsistent databases
Institute of Scientific and Technical Information of China (English)
XIE Dong; YANG Luming
Consistent query answering is an approach to retrieving consistent answers over databases that might be inconsistent with respect to some given integrity constraints The approach is based on a concept of repair.This paper surveys several recent researches on obtaining consistent information from inconsistent databases,such as the underlying semantic model,a number of approaches to computing consistent query answers and the computational complexity of this problem.Furthermore,the work outlines potential research directions in this area.
Data Processing on Database Management Systems with Fuzzy Query
Şimşek, Irfan; Topuz, Vedat
In this study, a fuzzy query tool (SQLf) for non-fuzzy database management systems was developed. In addition, samples of fuzzy queries were made by using real data with the tool developed in this study. Performance of SQLf was tested with the data about the Marmara University students' food grant. The food grant data were collected in MySQL database by using a form which had been filled on the web. The students filled a form on the web to describe their social and economical conditions for the food grant request. This form consists of questions which have fuzzy and crisp answers. The main purpose of this fuzzy query is to determine the students who deserve the grant. The SQLf easily found the eligible students for the grant through predefined fuzzy values. The fuzzy query tool (SQLf) could be used easily with other database system like ORACLE and SQL server.
gSketch: On Query Estimation in Graph Streams
Zhao, Peixiang; Wang, Min
Many dynamic applications are built upon large network infrastructures, such as social networks, communication networks, biological networks and the Web. Such applications create data that can be naturally modeled as graph streams, in which edges of the underlying graph are received and updated sequentially in a form of a stream. It is often necessary and important to summarize the behavior of graph streams in order to enable effective query processing. However, the sheer size and dynamic nature of graph streams present an enormous challenge to existing graph management techniques. In this paper, we propose a new graph sketch method, gSketch, which combines well studied synopses for traditional data streams with a sketch partitioning technique, to estimate and optimize the responses to basic queries on graph streams. We consider two different scenarios for query estimation: (1) A graph stream sample is available; (2) Both a graph stream sample and a query workload sample are available. Algorithms for differen...
Who Goes There? Staying Anonymous on the Internet
Descy, Don E.
Privacy is a thing of the past. Monitoring is everywhere. If one is looking at this online, the author is sure that lots of information has been stored and linked to anyone about that action. Nevertheless, at least people can try to play with "their" minds and surf the web anonymously. In this article, the author discusses ways to try to hide…
Baker, Robert
In 'New Threats to Academic Freedom' Francesca Minerva argues that anonymity for the authors of controversial articles is a prerequisite for academic freedom in the Internet age. This argument draws its intellectual and emotional power from the author's account of the reaction to the on-line publication of ' After-birth abortion: why should the baby live?'--an article that provoked cascades of hostile postings and e-mails. Reflecting on these events, Minerva proposes that publishers should offer the authors of controversial articles the option of publishing their articles anonymously. This response reviews the history of anonymous publication and concludes that its reintroduction in the Internet era would recreate problems similar to those that led print journals to abandon the practice: corruption of scholarly discourse by invective and hate speech, masked conflicts of interest, and a diminution of editorial accountability. It also contends that Minerva misreads the intent of the hostile e-mails provoked by 'After-birth abortion,' and that ethicists who publish controversial articles should take responsibility by dialoguing with their critics--even those whose critiques are emotionally charged and hostile. PMID:24724540
... Banners Site Help What's New Welcome to Alcoholics Anonymous ® NEED HELP WITH A DRINKING PROBLEM? If you ... drinking problem, wish to learn more about Alcoholics Anonymous or want to find A.A. near you, ...
On the Feasibility of (Practical) Commercial Anonymous Cloud Storage
Tobias Pulls; Daniel Slamanig
Current de facto standard payment and billing models for commercial cloud storage services provide a plethora of information to the cloud provider about its clients. This leads to a hostile environment when seen from a privacy perspective. Motivated by recently leaked facts about large scale governmental surveillance efforts as well as the lack of privacy-preserving measures in existing commercial cloud storage services, in this paper, we investigate the feasibility of so called anonymous clo...
Query Translation on the Fly in Deep Web Integration
Institute of Scientific and Technical Information of China (English)
JIANG Fangjiao; JIA Linlin; MENG Xiaofeng
To facilitate users to access the desired information,many researches have dedicated to the Deep Web (i.e. Web databases) integration. We focus on query translation which is an important part of the Deep Web integration. Our aim is to construct automatically a set of constraints mapping rules so that the system can translate the query from the integrated interface to the Web database interfaces based on them. We construct a concept hierarchy for the attributes of the query interfaces, especially, store the synonyms and the types (e.g. Number, Text, etc.) for every concept.At the same time, we construct the data hierarchies for some concepts if necessary. Then we present an algorithm to generate the constraint mapping rules based on these hierarchies. The approach is suitable for the scalability of such application and can be extended easily from one domain to another for its domain independent feature. The results of experiment show its effectiveness and efficiency.
Li, Xingan
While information systems provide modern society with great convenience, it also poses new problems in maintaining social order. One of its negative influences is the anonymity of cyberspace, which makes identity tracing a noteworthy predicament which poses obstacles in detection and investigations. It has been found that cyber anonymity has critical impacts on criminal motivation, and the phenomena of victimization, and should be tackled on different layers including technology and law enfor...
Quantum anonymous ranking based on the Chinese remainder theorem
Lin, Song; Guo, Gong-De; Huang, Feng; Liu, Xiao-Fen
In this paper, an efficient quantum anonymous ranking protocol with single particles is proposed. A semitrusted server is introduced to help multiple users achieve this secure task. At the end of the protocol, each user can obtain the rankings of his private data, and keep these data secret. The Chinese remainder theorem is utilized to reduce the level of signal particles and to improve the efficiency of the presented protocol. Meanwhile, a secret transmission order of the signal particles is used to keep the traveling particles secure. Finally, we discuss the security of this protocol and prove it to be secure against certain common attacks under ideal conditions.
Efficient Path Query and Reasoning Method Based on Rare Axis
Institute of Scientific and Technical Information of China (English)
姜洋; 冯志勇; 王鑫马晓宁
A new concept of rare axis based on statistical facts is proposed, and an evaluation algorithm is designed thereafter. For the nested regular expressions containing rare axes, the proposed algorithm can reduce its evaluation complexity from polynomial time to nearly linear time. The distributed technique is also employed to construct the navigation axis indexes for resource description framework (RDF) graph data. Experiment results in DrugBank and BioGRID show that this method can improve the query efficiency significantly while ensuring the accuracy and meet the query requirements on Web-scale RDF graph data.
On a Fuzzy Algebra for Querying Graph Databases
Pivert, Olivier; Thion, Virginie; Jaudoin, Hélène; Smits, Grégory
International audience This paper proposes a notion of fuzzy graph database and describes a fuzzy query algebra that makes it possible to handle such database, which may be fuzzy or not, in a flexible way. The algebra, based on fuzzy set theory and the concept of a fuzzy graph, is composed of a set of operators that can be used to express preference queries on fuzzy graph databases. The preferences concern i) the content of the vertices of the graph and ii) the structure of the graph. In a...
Public Forum Help Seeking: the Impact of Providing Anonymity on Student Help Seeking Behavior
Barnes, David J.
Public Forum Help Seeking: The Impact of Providing Anonymity on Student Help Seeking Behaviour David J. Barnes Published in Computer Based Learning in Science '99, Editor Graham M. Chapman, ISBN 80-7042-144-4. Conference Proceedings of CBLIS '99, Twente University, Enschede, the Netherlands, 2nd July - 6th July 1999. Abstract We investigate the impact of providing anonymity to a group of undergraduate Computing students, in order to encourage them to seek help for course related questions. We...
On (dynamic) range minimum queries in external memory
DEFF Research Database (Denmark)
Arge, L.; Fischer, Johannes; Sanders, Peter; Sitchinava, Nodari
We study the one-dimensional range minimum query (RMQ) problem in the external memory model. We provide the first space-optimal solution to the batched static version of the problem. On an instance with N elements and Q queries, our solution takes Θ(sort(N + Q)) = Θ( N+QB log M /B N+QB ) I....../O complexity and O(N + Q) space, where M is the size of the main memory and B is the block size. This is a factor of O(log M /B N) improvement in space complexity over the previous solutions. We also show that an instance of the batched dynamic RMQ problem with N updates and Q queries can be solved in O ( N...
To Speak or Not to Speak: Developing Legal Standards for Anonymous Speech on the Internet
Directory of Open Access Journals (Sweden)
Tomas A. Lipinski
Full Text Available This paper explores recent developments in the regulation of Internet speech, in specific, injurious or defamatory speech and the impact such speech has on the rights of anonymous speakers to remain anonymous as opposed to having their identity revealed to plaintiffs or other third parties. The paper proceeds in four sections. First, a brief history of the legal attempts to regulate defamatory Internet speech in the United States is presented. As discussed below this regulation has altered the traditional legal paradigm of responsibility and as a result creates potential problems for the future of anonymous speech on the Internet. As a result plaintiffs are no longer pursuing litigation against service providers but taking their dispute directly to the anonymous speaker. Second, several cases have arisen in the United States where plaintiffs have requested that the identity of an anonymous Internet speaker be revealed. These cases are surveyed. Third, the cases are analyzed in order to determine the factors that courts require to be present before the identity of an anonymous speaker will be revealed. The release is typically accomplished by the enforcement of a discovery subpoena instigated by the party seeking the identity of the anonymous speaker. The factors courts have used are as follows: jurisdiction, good faith (both internal and external, necessity (basic and sometimes absolute, and at times proprietary interest. Finally, these factors are applied in three scenarios--e-commerce, education, and employment--to guide institutions when adopting policies that regulate when the identity of an anonymous speaker--a customer, a student or an employee--would be released as part of an internal initiative, but would nonetheless be consistent with developing legal standards.
Private database queries based on counterfactual quantum key distribution
Zhang, Jia-Li; Guo, Fen-Zhuo; Gao, Fei; Liu, Bin; Wen, Qiao-Yan
Based on the fundamental concept of quantum counterfactuality, we propose a protocol to achieve quantum private database queries, which is a theoretical study of how counterfactuality can be employed beyond counterfactual quantum key distribution (QKD). By adding crucial detecting apparatus to the device of QKD, the privacy of both the distrustful user and the database owner can be guaranteed. Furthermore, the proposed private-database-query protocol makes full use of the low efficiency in the counterfactual QKD, and by adjusting the relevant parameters, the protocol obtains excellent flexibility and extensibility.
Design of a Visual Query Language for Geographic Information System on a Touch Screen
Wu, Siju; Otmane, Samir; Moreau, Guillaume; Servieres, Myriam
This paper presents two spatial query methods for a Geographic Information System (GIS) that runs on a touch screen. On conventional GIS interfaces SQL is used to construct spatial queries. However keyboard typing proves to be inefficient on touch screens. Furthermore, SQL is not an easy-learning language, especially for novices to GIS. To simplify query construction, firstly we have designed a map interaction based query method (MIBQM). This method allows users to make simple queries by sele...
Protecting whistle-blowers: Anonymity on the internet
International Nuclear Information System (INIS)
Even though strict legislation exists in many countries, it appears that the next few years should be a golden opportunity for groups to successfully monitor and publish the activity of the nuclear states, and human right violations through use of the Internet. The reasons for this are: 1. The Internet is becoming widespread even in repressive regimes; 2. Software is available to either hide messages from others or hide the mailers account; 3. Information from sites in other countries can be easily obtained to be read inside repressive regimes from the Internet. In this regard It is suggested the Pugwash or a similar organization should set up either an anonymous account to receive information or maybe use a more heavily protected cyperpunk remailer. Such an ability would hopefully prompt more people to notify treaty violations
On Statistical Query Sampling and NMR Quantum Computing
Blum, A S; Blum, Avrim; Yang, Ke
We introduce a ``Statistical Query Sampling'' model, in which the goal of an algorithm is to produce an element in a hidden set $Ssubseteqbit^n$ with reasonable probability. The algorithm gains information about $S$ through oracle calls (statistical queries), where the algorithm submits a query function $g(cdot)$ and receives an approximation to $Pr_{x in S}[g(x)=1]$. We show how this model is related to NMR quantum computing, in which only statistical properties of an ensemble of quantum systems can be measured, and in particular to the question of whether one can translate standard quantum algorithms to the NMR setting without putting all of their classical post-processing into the quantum system. Using Fourier analysis techniques developed in the related context of {em statistical query learning}, we prove a number of lower bounds (both information-theoretic and cryptographic) on the ability of algorithms to produces an $xin S$, even when the set $S$ is fairly simple. These lower bounds point out a difficu...
Lower Bounds on Quantum Query Complexity
P. Hoyer; R. Spalek
Shor's and Grover's famous quantum algorithms for factoring and searching show that quantum computers can solve certain computational problems significantly faster than any classical computer. We discuss here what quantum computers cannot do, and specifically how to prove limits on their computation
Research on Extension of Sparql Ontology Query Language Considering the Computation of Indoor Spatial Relations
Li, C.; Zhu, X.; Guo, W.; Liu, Y.; Huang, H.
A method suitable for indoor complex semantic query considering the computation of indoor spatial relations is provided According to the characteristics of indoor space. This paper designs ontology model describing the space related information of humans, events and Indoor space objects (e.g. Storey and Room) as well as their relations to meet the indoor semantic query. The ontology concepts are used in IndoorSPARQL query language which extends SPARQL syntax for representing and querying indoor space. And four types specific primitives for indoor query, "Adjacent", "Opposite", "Vertical" and "Contain", are defined as query functions in IndoorSPARQL used to support quantitative spatial computations. Also a method is proposed to analysis the query language. Finally this paper adopts this method to realize indoor semantic query on the study area through constructing the ontology model for the study building. The experimental results show that the method proposed in this paper can effectively support complex indoor space semantic query.
On performing semantic queries in small devices
Costea, C.; Petrovan, A.; Neamţ, L.; Chiver, O.
The sensors have a well-defined role in control or monitoring industrial processes; the data given by them can generate valuable information of the trend of the systems to which they belong, but to store a large volume of data and then analysis offline is not always practical. One solution is on-line analysis, preferably as close to the place where data have been generated (edge computing). An increasing amount of data generated by a growing number of devices connected to the Internet resulted in processing data sensors to the edge of the network, in a middle layer where smart entities should interoperate. Diversity of communication technologies outlined the idea of using intermediate devices such as gateways in sensor networks and for this reason the paper examines the functionality of a SPARQL endpoint in the Raspberry Pi device.
Anonymity, Deindividuation and Aggression.
Baron, Robert S.
Several writers suggest that reducing one's sense of individuality reduces social restraints. The author suggests that the effect of uniformity of appearance on aggression is unclear when anonymity is held constant. This poses a problem of interpretation given that a distinction must be made between lack of individuality and anonymity. One must…
Open Access and Database Anonymization an Open Source Procedure Based on an Italian Case Study
Leschiutta, Luca; Futia, Giuseppe
The only method, believed to be compliant to privacy laws, to open a database that contains personal data is anonymization. This work is focused on a car accidents database case study and on the Italian DP law. Database anonymization is described from a procedural point of view and it is explained how it is possible to complete the whole process relying solely on widespread open-source software applications. The proposed approach is empirical and is founded on the letter of the Italian privac...
Query optimization for graph analytics on linked data using SPARQL
Energy Technology Data Exchange (ETDEWEB)
Hong, Seokyong [Oak Ridge National Lab. (ORNL), Oak Ridge, TN (United States); Lee, Sangkeun [Oak Ridge National Lab. (ORNL), Oak Ridge, TN (United States); Lim, Seung -Hwan [Oak Ridge National Lab. (ORNL), Oak Ridge, TN (United States); Sukumar, Sreenivas R. [Oak Ridge National Lab. (ORNL), Oak Ridge, TN (United States); Vatsavai, Ranga Raju [Oak Ridge National Lab. (ORNL), Oak Ridge, TN (United States)
Triplestores that support query languages such as SPARQL are emerging as the preferred and scalable solution to represent data and meta-data as massive heterogeneous graphs using Semantic Web standards. With increasing adoption, the desire to conduct graph-theoretic mining and exploratory analysis has also increased. Addressing that desire, this paper presents a solution that is the marriage of Graph Theory and the Semantic Web. We present software that can analyze Linked Data using graph operations such as counting triangles, finding eccentricity, testing connectedness, and computing PageRank directly on triple stores via the SPARQL interface. We describe the process of optimizing performance of the SPARQL-based implementation of such popular graph algorithms by reducing the space-overhead, simplifying iterative complexity and removing redundant computations by understanding query plans. Our optimized approach shows significant performance gains on triplestores hosted on stand-alone workstations as well as hardware-optimized scalable supercomputers such as the Cray XMT.
Molina-Jimenez, C.; Marshall, L.
Anonymizers based on mix computers interposed between the sender and the receiver of an e-mail message have been used in the Internet for several years by senders of e-mail messages who do not wish to disclose their identity. Unfortunately, the degree of anonymity provided by this paradigm is limited and fragile. First, the messages sent are not truly anonymous but pseudo-anonymous since one of the mixes, at least, always knows the sender's identity. Secondly, the strength of the system to protect the sender's identity depends on the ability and the willingness of the mixes to keep the secret. If the mixes fail, the sender/'s anonymity is reduced to pieces. In this paper, we propose a novel approach for sending truly anonymous messages over the Internet where the anonymous message is sent from a PDA which uses dynamically assigned temporary, non-personal, random IP and MAC addresses. Anonymous E-cash is used to pay for the service.
A Personalization Recommendation Method Based on Deep Web Data Query
Tao Tan; Hongjun Chen
Deep Web is becoming a hot research topic in the area of database. Most of the existing researches mainly focus on Deep Web data integration technology. Deep Web data integration can partly satisfy people's needs of Deep Web information search, but it cannot learn users' interest, and people search the same content online repeatedly would cause much unnecessary waste. According to this kind of demand, this paper introduced personalization recommendation to the Deep Web data query, propo...
Impact of Anonymity on Information Sharing through Internal Psychological Processes: A Case of South Korean Online Communities
Ho Lee; Jaewon Choi; Kyung Kyu Kim; Ae Ri Lee
Many web users post their opinions and information without revealing their identities (i.e., demographics, social standing, and/or expertise); anonymity has become a common form of information exchange in online communities such as social media sites and Internet forums. In the meantime, negative social consequences have resulted from anonymous activities in online communities. Existing literature reports largely mixed results about the impact of online anonymity on online community outcomes....
Adding query privacy to robust DHTs
DEFF Research Database (Denmark)
Backes, Michael; Goldberg, Ian; Kate, Aniket;
Interest in anonymous communication over distributed hash tables (DHTs) has increased in recent years. However, almost all known solutions solely aim at achieving sender or requestor anonymity in DHT queries. In many application scenarios, it is crucial that the queried key remains secret from in...
The Framework for Approximate Queries on Simulation Data
Energy Technology Data Exchange (ETDEWEB)
Abdulla, G; Baldwin, C; Critchlow, T; Kamimura, R; Lee, B; Musick, R; Snapp, R; Tang, N
AQSim is a system intended to enable scientists to query and analyze a large volume of scientific simulation data. The system uses the state of the art in approximate query processing techniques to build a novel framework for progressive data analysis. These techniques are used to define a multi-resolution index, where each node contains multiple models of the data. The benefits of these models are two-fold: (1) they are compact representations, reconstructing only the information relevant to the analysis, and (2) the variety of models capture different aspects of the data which may be of interest to the user but are not readily apparent in their raw form. To be able to deal with the data interactively, AQSim allows the scientist to make an informed tradeoff between query response accuracy and time. In this paper, we present the framework of AQSim with a focus on its architectural design. We also show the results from an initial proof-of-concept prototype developed at LLNL. The presented framework is generic enough to handle more than just simulation data.
Implementation of federated query processing on Linked Data
Zhou Y; S. De; Moessner K.
As the number of Linked Data sets increases with more and more interconnections defined between them, querying a single data set is no longer enough for users who need data from mixed domains. The requirement to query data from different data sets motivates the research into federated queries. Network latency is one of the key factors which affect the performance of a federated query. The influence of network latency can be minimised by decreasing the number of remote requests, which is relat...
Multiple Query Evaluation Based on an Enhanced Genetic Algorithm.
Tamine, Lynda; Chrisment, Claude; Boughanem, Mohand
Explains the use of genetic algorithms to combine results from multiple query evaluations to improve relevance in information retrieval. Discusses niching techniques, relevance feedback techniques, and evolution heuristics, and compares retrieval results obtained by both genetic multiple query evaluation and classical single query evaluation…
Directory of Open Access Journals (Sweden)
Garima Mahajan
Full Text Available Query processing is an important concern in the field of distributed databases. The main problem is when a query can be decomposed into sub-queries that require operations at geographically separated databases, determine the sequence and the sites for performing this set of operations such that the operating cost (communication cost and processing cost for processing this query is minimized. The problem is complicated by the fact that query processing not only depends on the operations of the query, but also on the parameter values associated with the query. Distributed query processing is an important factor in the overall performance of a distributed database system.
ADQUEX: Adaptive Processing of Federated Queries over Linked Data based on Tuple Routing
Beiranvand, Amin; Ghadiri, Nasser
Due to the distribution of linked data across the web, the methods that process federated queries through a distributed approach are more attractive to the users and have gained more prosperity. In distributed processing of federated queries, we need methods and procedures to execute the query in an optimal manner. Most of the existing methods perform the optimization task based on some statistical information, whereas the query processor does not have precise statistical information about th...
What's in a Name? Some Reflections on the Sociology of Anonymity.
Marx, Gary T.
Presents seven types of identity knowledge. Identifies major rationales and contexts for anonymity and identifiability and suggests a principle which holds that those who use pseudonyms on the Internet in personal communications are obliged to indicate they are doing so. Suggests 13 procedural questions to guide the development and assessment of…
The Impact of Anonymous and Assigned Use of Student Response Systems on Student Achievement
Poole, Dawn
This study examined the impact of two approaches to use of student response systems (SRSs) on achievement in a study designed to better understand effective use of the devices. One condition was anonymous use of SRSs, in which graduate students selected a random clicker when entering the classroom. The second condition assigned devices to students…
Evaluating XML-Extended OLAP Queries Based on a Physical Algebra
DEFF Research Database (Denmark)
Yin, Xuepeng; Pedersen, Torben Bach
is desirable. In this paper, we extend previous work on the logical federation of OLAP and XML data sources by presenting a simplified query semantics,a physical query algebra and a robust OLAP-XML query engine.Performance experiments with a prototypical implementation suggest that the performance for OLAP...
Datta, Anwitaman
In this paper we introduce a novel gossiping primitive to support privacy preserving data analytics (PPDA). In contrast to existing computational PPDA primitives such as secure multiparty computation and data randomization based approaches, the proposed primitive `anonymous gossiping' is a communication primitive for privacy preserving personalized information aggregation complementing such traditional computational analytics. We realize this novel primitive by composing existing gossiping mechanisms for peer sampling & information aggregation and onion routing technique for establishing anonymous communication. This is more an `ideas' paper, rather than providing concrete and quantified results.
Sassone, Vladimiro; Hamadou, Sardaouna; Yang, Mu
Anonymity is a security property of paramount importance, as we move steadily towards a wired, online community. Its import touches upon subjects as different as eGovernance, eBusiness and eLeisure, as well as personal freedom of speech in authoritarian societies. Trust metrics are used in anonymity networks to support and enhance reliability in the absence of verifiable identities, and a variety of security attacks currently focus on degrading a user's trustworthiness in the eyes of the other users. In this paper, we analyse the privacy guarantees of the Crowds anonymity protocol, with and without onion forwarding, for standard and adaptive attacks against the trust level of honest users.
An Anonymity Revocation Technology for Anonymous Communication
Antoniou, Giannakis; Batten, Lynn; Parampalli, Udaya
A number of privacy-enhancing technologies (PETs) have been proposed in the last three decades offering unconditional communication anonymity to their users. Unconditional anonymity can, however, be a security threat because it allows users to employ a PET in order to act maliciously while hiding their identity. In the last few years, several technologies which revoke the identity of users who use PETs have been proposed. These are known as anonymity revocation technologies (ARTs). However, the construction of ARTs has been developed in an ad hoc manner without a theoretical basis outlining the goals and underlying principles. In this chapter we present a set of fundamental principles and requirements for construction of an ART, identifying the necessary features. We then propose an abstract scheme for construction of an ART based on these features.
Web Database Query Interface Annotation Based on User Collaboration
Institute of Scientific and Technical Information of China (English)
LIU Wei; LIN Can; MENG Xiaofeng
A vision based query interface annotation method is used to relate attributes and form elements in form-based web query interfaces, this method can reach accuracy of 82%.And a user participation method is used to tune the result; user can answer "yes" or "no" for existing annotations, or manually annotate form elements.Mass feedback is added to the annotation algorithm to produce more accurate result.By this approach, query interface annotation can reach a perfect accuracy.
Federrath, Hannes
Research in Privacy Enhancing Technology has meanwhile a tradition of at least 20 years. One application (if not the most significant at the present) of Privacy Enhancing Technology is anonymous Web surfing. While weak protection can be achieved by simple proxy solutions, strong anonymity needs more effort: Systems like JAP and TOR are based on the idea of the "mix network" introduced by David Chaum in 1981. The talk presents selected basic privacy enhancing techniques, available practical so...
De-anonymizing BitTorrent Users on Tor
Le Blond, Stevens; Manils, Pere; Chaabane, Abdelberi; Kaafar, Mohamed Ali; Legout, Arnaud; Castellucia, Claude; Dabbous, Walid
Some BitTorrent users are running BitTorrent on top of Tor to preserve their privacy. In this extended abstract, we discuss three different attacks to reveal the IP address of BitTorrent users on top of Tor. In addition, we exploit the multiplexing of streams from different applications into the same circuit to link non-BitTorrent applications to revealed IP addresses.
Effects of prior destructive behavior, anonymity, and group presence on deindividuation and aggression.
Diener, E
Three of Zimbardo's deindividuation input variables (group presence, anonymity, and arousal) were manipulated in laboratory experiment, and their effects on aggression and deindividuation were measured. Only arousal produced a significant increase in aggression (p less than .05), while group presence produced a significant decrease in aggression (p less than .01). Anonymity had no significant effect on subjects' aggressiveness. Deindividuation per se was measured on a postsession questionnaire that assessed subjects' memory for their own aggressive behavior, self-consciousness, concern for social evaluation, and memory for central and peripheral cues. Only arousal condition participants showed deindividuation changes, but a factor analysis revealed that the deindividuation changes did not comprise a unified factor. Also it did not appear that the internal changes caused aggressive behavior, since the correlation between the two was low. PMID:1271222
The Impact of Alcoholics Anonymous on other substance abuse related Twelve Step programs
Laudet, Alexandre B.
This chapter explores the influence of the AA model on self-help fellowships addressing problems of drug dependence. Fellowships that have adapted the 12-step recovery model to other substances of abuse are reviewed; next similarities and differences between AA and drug-recovery 12-step organizations are examined; finally, we present empirical findings on patterns of attendance and perceptions of AA and Narcotics Anonymous (NA) among polydrug dependent populations, many of whom are cross-addi...
Directory of Open Access Journals (Sweden)
Marlus Heriberto Arns de Oliveira
Full Text Available The Constitution of the Federative Republic of Brazil, enacted in 1988 during the democratization process of the country after the end of an authoritarian regime preceded by several others that show a non-democratic tradition in the Brazilian Republic, remained still remnants an authoritarian Patronizing and Paternalist state, the example of the final part of the Article 5, item IV, which claims to be the free expression of thought, but forbids anonymity, prohibition which deserves to be rethought, especially on the internet, where the navigation data of people deserve protection, as well as their rights to remain anonymous, a fact which entails the need for reflection on the scope and how best to interpret the constitutional provision cited, a debate that, in the proposed article will deal think the ideas of paternalism, authoritarianism and freedom, whose focus will be about within the Internet, social networks and the Knowledge Society.
Design on PKI-Based Anonymous Mobile Agent Security in E-Commerce
Institute of Scientific and Technical Information of China (English)
MENG Xiangsong; HAN Fengwu
The security of mobile agent directly decides its usage width in e-commerce. Especially, to protect users' private information is becoming more important now and future. So an anonymous mobile agent security mechanism with the secure authentication infrastructure based on PKI(public key infrastructure) is proposed in the paper. The multi-agent system is programmed by java language and every agent must register itself in CA(certificate authority) before working in the net and express his legit identity which is temptly produced and used only once. The CA ensures the legal of all agents' identity which take part in communicaiton or trade. And every user agent identity only is used once which makes other agents cannot decipher users' private information. The security mechanism of the multi-agent system implements anonymity, integrity, data confidentiality of mobile agent based on the MH(multiple hop) integrity protection regard to PKI limit.
Double-blind in light of the internet: A note on author anonymity
Holm, Jerker
This paper analyses the credibility of author anonymity that is provided by a double-blind review process. It is argued that authors have strong incentives to disseminate information about their papers before publication. A sample from two economics journals, both using double-blind review processes, provides evidence that author-revealing information of most accepted papers is available on the Internet before the review process is finished. The difficulty and cost of identifying authors of u...
Quantum private query based on single-photon interference
Xu, Sheng-Wei; Sun, Ying; Lin, Song
Quantum private query (QPQ) has become a research hotspot recently. Specially, the quantum key distribution (QKD)-based QPQ attracts lots of attention because of its practicality. Various such kind of QPQ protocols have been proposed based on different technologies of quantum communications. Single-photon interference is one of such technologies, on which the famous QKD protocol GV95 is just based. In this paper, we propose two QPQ protocols based on single-photon interference. The first one is simpler and easier to realize, and the second one is loss tolerant and flexible, and more practical than the first one. Furthermore, we analyze both the user privacy and the database privacy in the proposed protocols.
Quantum private query based on single-photon interference
Xu, Sheng-Wei; Sun, Ying; Lin, Song
Quantum private query (QPQ) has become a research hotspot recently. Specially, the quantum key distribution (QKD)-based QPQ attracts lots of attention because of its practicality. Various such kind of QPQ protocols have been proposed based on different technologies of quantum communications. Single-photon interference is one of such technologies, on which the famous QKD protocol GV95 is just based. In this paper, we propose two QPQ protocols based on single-photon interference. The first one is simpler and easier to realize, and the second one is loss tolerant and flexible, and more practical than the first one. Furthermore, we analyze both the user privacy and the database privacy in the proposed protocols.
On Enhancing Data Utility in K-Anonymization for Data without Hierarchical Taxonomies
Directory of Open Access Journals (Sweden)
Mohammad Rasool Sarrafi Aghdam
Full Text Available K-anonymity is the model that is widely used to protect the privacy of individuals in publishing micro-data. It could be defined as clustering with constrain of minimum k tuples in each group. K-anonymity cuts down the linking confidence between sensitive information and specific individual by the ration of 1/k. However, the accuracy of the data in k-anonymous dataset decreases due to information loss. Moreover, most of the current approaches are for numerical attributes or in case of categorical attributes they require extra information such as attribute hierarchical taxonomies which often do not exist. In this paper we propose a new model, based on clustering, defining the distance between tuples including numerical and categorical attributes which does not require extra information and present the SpatialDistance (SD heuristic algorithm. Comparisons of experimental results on real datasets between SD algorithm and existing well-known algorithms show that SD performs the best and offers much higher data utility and reduces the information loss significantly.
Advice from a medical expert through the Internet on queries about AIDS and hepatitis: analysis of a pilot experiment.
Directory of Open Access Journals (Sweden)
Javier Marco
Full Text Available BACKGROUND: Advice from a medical expert on concerns and queries expressed anonymously through the Internet by patients and later posted on the Web, offers a new type of patient-doctor relationship. The aim of the current study was to perform a descriptive analysis of questions about AIDS and hepatitis made to an infectious disease expert and sent through the Internet to a consumer-oriented Web site in the Spanish language. METHODS AND FINDINGS: Questions were e-mailed and the questions and answers were posted anonymously in the "expert-advice" section of a Web site focused on AIDS and hepatitis. We performed a descriptive study and a temporal analysis of the questions received in the first 12 months after the launch of the site. A total of 899 questions were received from December 2003 to November 2004, with a marked linear growth pattern. Questions originated in Spain in 68% of cases and 32% came from Latin America (the Caribbean, Central America, and South America. Eighty percent of the senders were male. Most of the questions concerned HIV infection (79% with many fewer on hepatitis (17%. The highest numbers of questions were submitted just after the weekend (37% of questions were made on Mondays and Tuesdays. Risk factors for contracting HIV infection were the most frequent concern (69%, followed by the window period for detection (12.6%, laboratory results (5.9%, symptoms (4.7%, diagnosis (2.7%, and treatment (2.2%. CONCLUSIONS: Our results confirm a great demand for this type of "ask-the-expert" Internet service, at least for AIDS and hepatitis. Factors such as anonymity, free access, and immediate answers have been key factors in its success.
A reciprocal framework for spatial K-anonymity
Ghinita, Gabriel
Spatial K-anonymity (SKA) exploits the concept of K-anonymity in order to protect the identity of users from location-based attacks. The main idea of SKA is to replace the exact location of a user U with an anonymizing spatial region (ASR) that contains at least K-1 other users, so that an attacker can pinpoint U with probability at most 1/K. Simply generating an ASR that includes K users does not guarantee SKA. Previous work defined the reciprocity property as a sufficient condition for SKA. However, the only existing reciprocal method, Hilbert Cloak, relies on a specialized data structure. In contrast, we propose a general framework for implementing reciprocal algorithms using any existing spatial index on the user locations. We discuss ASR construction methods with different tradeoffs on effectiveness (i.e., ASR size) and efficiency (i.e., construction cost). Then, we present case studies of applying our framework on top of two popular spatial indices (namely, R*-trees and Quad-trees). Finally, we consider the case where the attacker knows the query patterns of each user. The experimental results verify that our methods outperform Hilbert Cloak. Moreover, since we employ general-purpose spatial indices, the proposed system is not limited to anonymization, but supports conventional spatial queries as well. © 2009 Elsevier B.V. All rights reserved.
Chertov, Oleg; 10.1007/978-3-642-14058-7_61
In recent years the amount of digital data in the world has risen immensely. But, the more information exists, the greater is the possibility of its unwanted disclosure. Thus, the data privacy protection has become a pressing problem of the present time. The task of individual privacy-preserving is being thoroughly studied nowadays. At the same time, the problem of statistical disclosure control for collective (or group) data is still open. In this paper we propose an effective and relatively simple (wavelet-based) way to provide group anonymity in collective data. We also provide a real-life example to illustrate the method.
Technology for Anonymity: Names By Other Nyms.
Wayner, Peter
Provides a summary of some of the technical solutions for producing anonymous communication on the Internet and presents an argument that anonymity is as much a part of crime prevention as requiring people to provide their names. Discusses identity theft; the three major techniques that make anonymous cash possible; and anonymizing Internet…
Query Optimization in OODBMS: Identifying Subquery for Complex Query Management
Directory of Open Access Journals (Sweden)
Sheetal S. Dhande
Full Text Available This paper is based on relatively newer approach fo r query optimization in object databases, which uses query decomposition and cached query res ults to improve execution a query. Issues that are focused here is fast retrieval and high re use of cached queries, Decompose Query into Sub query, Decomposition of complex queries into sm aller for fast retrieval of result. Here we try to address another open area of query c aching like handling wider queries. By using some parts of cached results helpful for answ ering other queries (wider Queries and combining many cached queries while producing the r esult. Multiple experiments were performed to prove the pr oductivity of this newer way of optimizing a query. The limitation of this technique is that i t's useful especially in scenarios where data manipulation rate is very low as compared to data r etrieval rate.
Directory of Open Access Journals (Sweden)
Sheetal S. Dhande
Full Text Available This paper is based on relatively newer approach for query optimization in object databases, which uses query decomposition and cached query results to improve execution a query. Issues that are focused here is fast retrieval and high reuse of cached queries, Decompose Query into Sub query, Decomposition of complex queries into smaller for fast retrieval of result. Here we try to address another open area of query caching like handling wider queries. By using some parts of cached results helpful for answering other queries (wider Queries and combining many cached queries while producing the result. Multiple experiments were performed to prove the productivity of this newer way of optimizing a query. The limitation of this technique is that it's useful especially in scenarios where data manipulation rate is very low as compared to data retrieval rate.
一种基于SPKI的匿名支付方案%An Anonymous Payment Scheme Based on SPKI
Institute of Scientific and Technical Information of China (English)
朱庆生; 李唯唯; 王茜; 傅鹤岗
SPKI is a proposed standard for public-key certificates. One important property of SPKI is that SPKI is key-oriented rather than name-oriented, and the public-key is globally unique. In this paper we propose an anonymous paymentscheme based on SPKI aiming at the problem of anonymous payment in B2C e-commerce. In the scheme we use the key-oriented characteristic of SPKI to link the public key to the account, and use authorization certificates to pay. The scheme achieves the anonymity very well.
On the Querying for Places on the Mobile Web
DEFF Research Database (Denmark)
Jensen, Christian S.
The web is undergoing a fundamental transformation: it is becoming mobile and is acquiring a spatial dimension. Thus, the web is increasingly being used from mobile devices, notably smartphones, that can be geo-positioned using GPS or technologies that exploit wireless communication networks. In...... addition, web content is being geo-tagged. This transformation calls for new, spatio-textual query functionality. The research community is hard at work enabling efficient support for such functionality....
On the Effectiveness of the Minimization Approach to the Query Optimization
Directory of Open Access Journals (Sweden)
N. Mendkovich
Full Text Available A standard problem of DBMSs usage is a lack of efficiency and high cost of the access to the stored data. The acceptable level of system performance may be achieved by query optimization technics that determine the most efficient way to execute a given query by its modification and considering possible query execution plans. The goal of this paper is to prove the efficiency of the query minimization algorithms based on minimization of the query restriction by elimination of the redundant conditions. The paper represents minimization algorithms based on the mathematical transformations, which detect and remove redundant conditions from query restriction to simplify it. It includes minimization algorithms based on "condition absorption", prime implicants, and a set of linear inequalities minimization technics. The paper also includes theoretical justification of the efficiency of minimization approach to the query optimization based on restriction simplification. We also observe experimental results of the implementation of these optimization techniques and their influence on the query processing speed. In the end, we represent an observation of the query minimization impact on the whole optimization process
Online Query Scheduling on Source Permutation for Big Data Integration
Yuan, Zimu; Guo, Shusheng
Big data integration could involve a large number of sources with unpredictable redundancy information between them. The approach of building a central warehousing to integrate big data from all sources then becomes infeasible because of so large number of sources and continuous updates happening. A practical approach is to apply online query scheduling that inquires data from sources at runtime upon receiving a query. In this paper, we address the Time-Cost Minimization Problem for online qu...
A Voronoi-Based Location Privacy-Preserving Method for Continuous Query in LBS
Most of the mobile phones have GPS sensors which make location based service (LBS) applicable. LBS brings not only convenience but also location privacy leak to us. Achieving anonymity and sending private queries are two main privacy-preserving courses in LBS. A novel location privacy-preserving method is proposed based on Voronoi graph partition on road networks. Firstly, based on the prediction of a user's moving direction, a cooperative k-anonymity method is proposed without constructing c...
Anonymous Publish-Subscribe Overlays
Daubert, Jörg
Freedom of speech is a core value of our society. While it can be exercised anonymously towards undesired observers in the physical world, the Internet is based on unique and nonanonymous identifiers (IDs) for every participant. Anonymity, however, is a crucial requirement to exercise freedom of speech using the Internet without having to face political persecution. To achieve anonymity, messages must be unlinkable to senders an receivers. That means that messages cannot be linked to IDs and ...
Optimization Query Process of Mediators Interrogation Based On Combinatorial Storage
Directory of Open Access Journals (Sweden)
L. Cherrat
Full Text Available In the distributed environment where a query involves several heterogeneous sources, communication costs must be taken into consideration. In this paper we describe a query optimization approach using dynamic programming technique for set integrated heterogeneous sources. The objective of the optimization is to minimize the total processing time including load processing, request rewriting and communication costs, to facilitate communication inter-sites and to optimize the time of data transfer from site to others. Moreover, the ability to store data in more than one centre site provides more flexibility in terms of Security/Safety and overload of the network. In contrast to optimizers which are considered a restricted search space, the proposed optimizer searches the closed subsets of sources and independency relationship which may be deep laniary or hierarchical trees. Especially the execution of the queries can start traversal anywhere over any subset and not only from a specific source.
An arbitrated quantum signature scheme based on entanglement swapping with signer anonymity
International Nuclear Information System (INIS)
In this paper an arbitrated quantum signature scheme based on entanglement swapping is proposed. In this scheme a message to be signed is coded with unitary operators. Combining quantum measurement with quantum encryption, the signer can generate the signature for a given message. Combining the entangled states generated by the TTP's Bell measurement with the signature information, the verifier can verify the authentication of a signature through a single quantum state measurement. Compared with previous schemes, our scheme is more efficient and less complex, furthermore, our scheme can ensure the anonymity of the signer. (general)
An arbitrated quantum signature scheme based on entanglement swapping with signer anonymity
Li, Wei; Fan, Ming-Yu; Wang, Guang-Wei
In this paper an arbitrated quantum signature scheme based on entanglement swapping is proposed. In this scheme a message to be signed is coded with unitary operators. Combining quantum measurement with quantum encryption, the signer can generate the signature for a given message. Combining the entangled states generated by the TTP's Bell measurement with the signature information, the verifier can verify the authentication of a signature through a single quantum state measurement. Compared with previous schemes, our scheme is more efficient and less complex, furthermore, our scheme can ensure the anonymity of the signer.
On the Necessity of Term Dependence in a Query Space for Weighted Retrieval.
Bollmann-Sdorra, Peter; Raghavan, Vijay V.
Discussion of the vector space model and properties of document and query spaces focuses on the proof that requiring term independence to hold in the query space is inconsistent with the goal of achieving better performance by means of weighted retrieval. Proofs are provided. (Author/LRW)
Study on Pear Diseases Query System Based on Ontology and SWRL
Sun, Qian; Liang, Yong
International audience This paper studied the construction of Pear Diseases Domain Ontology (PDDO), and the realization of query system based on PDDO and SWRL. First, an approach to build PDDO based on SWRL was proposed, which consists of confirming core concepts, adding the properties of concepts and the relationships between concepts, adding the instances of concepts, representing domain ontology, adding SWRL rules and reasoning. Then the query system model and implementation algorithm w...
Is it the end for anonymity as we know it? A critical examination of the ethical principle of anonymity in the context of 21st century demands on the qualitative researcher
Tilley, Liz; Woodthorpe, Kate
Told from the perspective of two UK-based early career researchers, this article is an examination of contemporary challenges posed when dealing with the ethical principle of anonymity in qualitative research, specifically at the point of dissemination. Drawing on their respective doctoral experience and literature exploring the difficulties that can arise from the application of anonymity with regard to historical and geographical contexts, the authors question the applicability of the princ...
Efficient Queries of Stand-off Annotations for Natural Language Processing on Electronic Medical Records.
Luo, Yuan; Szolovits, Peter
In natural language processing, stand-off annotation uses the starting and ending positions of an annotation to anchor it to the text and stores the annotation content separately from the text. We address the fundamental problem of efficiently storing stand-off annotations when applying natural language processing on narrative clinical notes in electronic medical records (EMRs) and efficiently retrieving such annotations that satisfy position constraints. Efficient storage and retrieval of stand-off annotations can facilitate tasks such as mapping unstructured text to electronic medical record ontologies. We first formulate this problem into the interval query problem, for which optimal query/update time is in general logarithm. We next perform a tight time complexity analysis on the basic interval tree query algorithm and show its nonoptimality when being applied to a collection of 13 query types from Allen's interval algebra. We then study two closely related state-of-the-art interval query algorithms, proposed query reformulations, and augmentations to the second algorithm. Our proposed algorithm achieves logarithmic time stabbing-max query time complexity and solves the stabbing-interval query tasks on all of Allen's relations in logarithmic time, attaining the theoretic lower bound. Updating time is kept logarithmic and the space requirement is kept linear at the same time. We also discuss interval management in external memory models and higher dimensions. PMID:27478379
Evaluating XML-Extended OLAP Queries Based on a Physical Algebra
DEFF Research Database (Denmark)
Yin, Xuepeng; Pedersen, Torben Bach
In today's OLAP systems, physically integrating fast-changing data, e.g., stock quotes, into a cube is complex and time-consuming. This data is likely to be available in XML format on the WWW; thus, instead of physical integration, making XML data logically federated with OLAP systems is desirable....... In this paper, we extend previous work on the logical federation of OLAP and XML data sources by presenting a simplified query semantics, a physical query algebra and a robust OLAP-XML query engine as well as the query evaluation techniques. Performance experiments with a prototypical implementation...... suggest that the performance for OLAP-XML federations is comparable to queries on physically integrated data....
The Effect of Number of Agents on Optimization of adaptivity Join Queries in Heterogeneous Distributed Databases
Directory of Open Access Journals (Sweden)
Amir ASIL
Full Text Available Distributed systems signify data distribution, association of activities, and controlling the distributed components of the system. Distributed systems are mostly used to share the workload or transfer data processing functions to a place nearer to those functions. This important task should be mentioned in database query optimization. The growing need for optimizing query processing in databases has given rise to many methods of doing this. This article provides a multi-agent system for heterogeneous distributed databases by combining optimization techniques for processing queries in databases and adaptivity. In this system the effect of the number of agents on optimization of query processing in Heterogeneous distributed databases will be analyzed. In this system an agent has been added to make the database adaptable. In this system the greatness of the effect of number of agents on optimization of processing of joined queries has been analyzed.
Relaxing rdf queries based on user and domain preferences
DEFF Research Database (Denmark)
Dolog, Peter; Stueckenschmidt, Heiner; Wache, Holger;
knowledge and user preferences. We describe a framework for information access that combines query refinement and relaxation in order to provide robust, personalized access to heterogeneous resource description framework data as well as an implementation in terms of rewriting rules and explain its...... application in the context of e-learning systems....
Extracting Result Schema Based on Query Instances in the Deep Web
Institute of Scientific and Technical Information of China (English)
NIE Tiezheng; YU Ge; SHEN Derong; KOU Yue; LIU Wei
Deep Web sources contain a large of high-quality and query-related structured date. One of the challenges in the Deep Web is extracting result schemas of Deep Web sources. To address this challenge, this paper describes a novel approach that extracts both result data and the result schema of a Web database.The approach first models the query interface of a Deep Web source and fills in it with a specifically query instance. Then the result pages of the Deep Web sources are formatted in the tree structure to retrieve subtrees that contain elements of the query instance. Next, result schema of the Deep Web source is extracted by matching the subtree' nodes with the query instance, in which,a two-phase schema extraction method is adopted for obtaining more accurate result schema. Finally, experiments on real Deep Web sources show the utility of our approach, which provides a high precision and recall.
Anonymous Biometric Access Control
Directory of Open Access Journals (Sweden)
Shuiming Ye
Full Text Available Access control systems using the latest biometric technologies can offer a higher level of security than conventional password-based systems. Their widespread deployments, however, can severely undermine individuals' rights of privacy. Biometric signals are immutable and can be exploited to associate individuals' identities to sensitive personal records across disparate databases. In this paper, we propose the Anonymous Biometric Access Control (ABAC system to protect user anonymity. The ABAC system uses novel Homomorphic Encryption (HE based protocols to verify membership of a user without knowing his/her true identity. To make HE-based protocols scalable to large biometric databases, we propose the k-Anonymous Quantization (kAQ framework that provides an effective and secure tradeoff of privacy and complexity. kAQ limits server's knowledge of the user to k maximally dissimilar candidates in the database, where k controls the amount of complexity-privacy tradeoff. kAQ is realized by a constant-time table lookup to identity the k candidates followed by a HE-based matching protocol applied only on these candidates. The maximal dissimilarity protects privacy by destroying any similarity patterns among the returned candidates. Experimental results on iris biometrics demonstrate the validity of our framework and illustrate a practical implementation of an anonymous biometric system.
Most Recent Match Queries in On-Line Suffix Trees
DEFF Research Database (Denmark)
Larsson, N. Jesper
arbitrary patterns, at each step of processing an online stream. We present augmentations to Ukkonen's suffix tree construction algorithm for optimal-time queries, maintaining indexing time within a logarithmic factor in the size of the indexed string. We show that the algorithm is applicable to sliding......A suffix tree is able to efficiently locate a pattern in an indexed string, but not in general the most recent copy of the pattern in an online stream, which is desirable in some applications. We study the most general version of the problem of locating a most recent match: supporting queries for......-window indexing, and sketch a possible optimization for use in the special case of Lempel-Ziv compression....
Relative expressive power of navigational querying on graphs
Fletcher, GHL George; Gyssens, M; Leinders, D; Surinx, D; Van den Bussche, J; Van Gucht, D; Vansummeren, S; Wu, Y
Motivated by both established and new applications, we study navigational query languages for graphs (binary relations). The simplest language has only the two operators union and composition, together with the identity relation. We make more powerful languages by adding any of the following operators: intersection; set difference; projection; coprojection; converse; and the diversity relation. All these operators map binary relations to binary relations. We compare the expressive power of al...
Relative expressive power of navigational querying on graphs
Fletcher, George H. L.; Gyssens, Marc; Leinders, Dirk; Van den Bussche, Jan; Van Gucht, Dirk; Vansummeren, Stijn; Wu, Yuqing
Motivated by both established and new applications, we study navigational query languages for graphs (binary relations). The simplest language has only the two operators union and composition, together with the identity relation. We make more powerful languages by adding any of the following operators: intersection; set di erence; projection; coprojection; converse; transitive closure; and the diversity relation. All these operators map binary relations to binary relat...
Directory of Open Access Journals (Sweden)
Zulaini Yahya
Full Text Available In Cross-Language Information Retrieval (CLIR process, the translation effects have a direct impact on the accuracy of follow-up retrieval results. In dictionary-based approach, we are dealing with the words that have more than one meaning which can decrease the retrieval performance if the query translation return an incorrect translations. These issues need to be overcome using efficient technique. In this study we proposed a Cross-Language Information Retrieval (CLIR method based on domain ontology using Quran concepts for disambiguating translation of the query and to improve the dictionary-based query translation. For experimentation, we use Quran ontology written in English and Malay languages as a bilingual parallel-corpora and Quran concepts as a resource for cross-language query translation along with dictionary-based translation. For evaluation, we measure the performance of three IR systems. IR1 is natural language query IR, IR2 is natural language query CLIR based on dictionary (as a Baseline and IR3 is the retrieval of this research proposed method using Mean Average Precision (MAP and average precision at 11 points of recall. The experimental result shows that our proposed method brings significant improvement in retrieval accuracy for English document collections, but deficient for Malay document collections. The proposed CLIR method can obtain query expansion effect and improve retrieval performance in certain language.
Effects of Cultural Orientation on Attitude Toward Anonymity in E-Collaboration
Zhong, Yingqin; Liu, Na; Lim, John
The important role of attitude in the acceptance and diffusion of technology has been widely acknowledged. Greater research efforts have been called for examining the relationships between cultural variables and attitude toward technology. In this regard, this study investigates the impact of cultural orientation (focusing on an individual's degree of collectivism) on attitude toward e-collaboration technology. A theoretical model is proposed and subsequently tested using a questionnaire survey involving 236 data points. Self-reliance, competitive success, and group work orientation are found as significant indicators reflecting an individual's degree of collectivism, which in turn influences willingness to participate, evaluation of collaborative effort, and preference for anonymity feature. Subsequently, the three variables are found to affect perceptions about decision quality, enjoyment, uncertainty, and pressure in e-collaboration.
Directory of Open Access Journals (Sweden)
Full Text Available Privacy Preservation in data mining protects the data from revealing unauthorized extraction of information. Data Anonymization techniques implement this by modifying the data, so that the original values cannot be acquired easily. Perturbation techniques are variedly used which will greatly affect the quality of data,since there is a trade-off between privacy preservation and information loss which will subsequently affect the result of data mining. The method that is proposed in this paper is based on nested clustering of data andperturbation on each cluster. The size of clusters is kept optimal to reduce the information loss. The paper explains the methodology, implementation and results of nested clustering. Various metrics are also provided to explicate that this method overcomes the disadvantages of other perturbation methods.
Effects of personality and loss of anonymity on aggression: a reevaluation of deindividuation.
Propst, L R
Zimbardo's deindividuation hypothesis was reexamined by individuating some subjects. Twelve four-person groups administered shock to a confederate in a 2 x 2 x 2 factorial design with two levels of social individuation (subjects' level of anonymity to group members), two levels of nonsocial individuation (subjects' opportunity to give identifying information to the experimenter on a word association test) and two levels of individual differences. It was found that subjects, who individuated themselves by giving information to the experimenter on the word association test showed more, not less, antisocial behavior. Furthermore, this increased antisocial behavior was exhibited only by externally oriented subjects: those with an external locus of control and a low mysticism score. Some of those more antisocial subjects were also more likely to report feeling like they stood out from the group. It was concluded that antisocial behavior in this paradigm may thus be a response to experimenter demand felt most strongly when subjects felt most identifiable. PMID:490306
Lower Bounds on Quantum Query Complexity for Read-Once Formulas with XOR and MUX Operators
Fukuhara, Hideaki; Takimoto, Eiji
We introduce a complexity measure r for the class F of read-once formulas over the basis {AND, OR, NOT, XOR, MUX} and show that for any Boolean formula F in the class F, r(F) is a lower bound on the quantum query complexity of the Boolean function that F represents. We also show that for any Boolean function f represented by a formula in F, the deterministic query complexity of f is only quadratically larger than the quantum query complexity of f. Thus, the paper gives further evidence for the conjecture that there is an only quadratic gap for all functions.
Supporting K nearest neighbors query on high-dimensional data in P2P systems
Institute of Scientific and Technical Information of China (English)
Mei LI; Wang-Chien LEE; Anand SIVASUBRAMANIAM; Jizhong ZHAO
Peer-to-peer systems have been widely used for sharing and exchanging data and resources among numerous computer nodes.Various data objects identifiable with high dimensional feature vectors,such as text,images,genome sequences,are starting to leverage P2P technology.Most of the existing works have been focusing on queries on data objects with one or few attributes and thus are not applicable on high dimensional data objects.In this study,we investigate K nearest neighbors query (KNN)on high dimensional data objects in P2P systems.Efficient query algorithm and solutions that address various technical challenges raised by high dimensionality,such as search space resolution and incremental search space refinement,are proposed.An extensive simulation using both synthetic and real data sets demonstrates that our proposal efficiently supports KNN query on high dimensional data in P2P systems.
[Name Withheld]: Anonymity and Its Implications
Weicher, Maureen
Anonymity allows the individual to have a voice without having a name. Since the word "anonymous" entered the English language with the advent of the printing press, the implications of being anonymous - and its lexical offspring "anonymity" - have shifted with time, place, and circumstance. What are the perceived effects of being anonymous/anonymity on the individual and on society? In this paper, I will explore some of the shifting meanings and implications of this concept, first as i...
Collective spatial keyword querying
DEFF Research Database (Denmark)
Cao, Xin; Cong, Gao; Jensen, Christian S.;
With the proliferation of geo-positioning and geo-tagging, spatial web objects that possess both a geographical location and a textual description are gaining in prevalence, and spatial keyword queries that exploit both location and textual description are gaining in prominence. However, the...... queries studied so far generally focus on finding individual objects that each satisfy a query rather than finding groups of objects where the objects in a group collectively satisfy a query. We define the problem of retrieving a group of spatial web objects such that the group's keywords cover the query......'s keywords and such that objects are nearest to the query location and have the lowest inter-object distances. Specifically, we study two variants of this problem, both of which are NP-complete. We devise exact solutions as well as approximate solutions with provable approximation bounds to the problems. We...
On the evaluation of fuzzy quantified queries in a database management system
Bosc, Patrick; Pivert, Olivier
Many propositions to extend database management systems have been made in the last decade. Some of them aim at the support of a wider range of queries involving fuzzy predicates. Unfortunately, these queries are somewhat complex and the question of their efficiency is a subject under discussion. In this paper, we focus on a particular subset of queries, namely those using fuzzy quantified predicates. More precisely, we will consider the case where such predicates apply to individual elements as well as to sets of elements. Thanks to some interesting properties of alpha-cuts of fuzzy sets, we are able to show that the evaluation of these queries can be significantly improved with respect to a naive strategy based on exhaustive scans of sets or files.
Query Optimization on Compressed and Decompressed Object-Oriented Database Using Operators
Directory of Open Access Journals (Sweden)
Abhijit Banubakode,
Full Text Available In this paper, we present an approach using various database operators that permits to enrich technique of query optimization existing in the objectoriented databases and the comparative analysis of query optimization of compressed and uncompressed object oriented database based on cost, cardinality and no of bytes. Focus is on query optimization using relational operator, logical operator and special operators. Our experimental study shows that the improvement in the quality of plans is significant only with decrease in cost, cardinality and no of bytes after database compression. Looking at the success of query optimization in the relational model, our approach inspires itself of these optimization techniques and enriched it so that they can support the new concepts introduced by the object oriented databases.
Query Optimization in Object Oriented Databases Based on SD-Tree and n-ary Tree
Directory of Open Access Journals (Sweden)
Tran Minh Bao
Full Text Available In this paper, we suggest a new technique to create index helping to query almost identical similarities with keywords in case there is no correct match found. It is based on a SD-Tree and a n-ary Tree helping to query related information when there is no correct match. Index structure arranges signatures according to hierarchical clustering for improving assessment of query. This method is based on technique of using signature file and SD-Tree and signature files are organized according to decentralization to filter unsuitable data quickly and each signature file is saved according to SD-Tree structure for increasing speed of scanning signature. This method helps to decrease effectively search space, so therefore improving effectively complexity of query time.
Svetlana A. Firsova; Elena A. Ryabukhina
Introduction: this article explores the pedagogical technology employed to teach medical students foundations of work with MICROSOFT ACCESS databases. The above technology is based on integrative approach to the information modeling in public health practice, drawing upon basic didactic concepts that pertain to objects and tools databases created in MICROSOFT ACCESS. The article examines successive steps in teaching the topic "Queries in MICROSOFT ACCESS" – from simple queries to complex ones...
On the Expressiveness of Implicit Provenance in Query and Update Languages
Buneman, Peter; Cheney, James; Vansummeren, Stijn
Information describing the origin of data, generally referred to as provenance, is important in scientific and curated databases where it is the basis for the trust one puts in their contents. Since such databases are constructed using operations of both query and update languages, it is of paramount importance to describe the effect of these languages on provenance. In this article we study provenance for query and update languages that are closely related to SQL, and compare two ways in wh...
ZuiScat : querying and visualizing information spaces on personal digital assistants
Büring, Thorsten; Reiterer, Harald
ZuiScat is a visualization concept for querying large information spaces on Personal Digital Assistants (PDA). Retrieval results are presented in a dynamic scatterplot, which is enhanced by geometric and semantic zoom techniques to provide smooth transitions from abstract visual encodings to data content. The same visualization is also used to manage bookmarks and to serve as a powerful query history tool. User feedback suggests that ZuiScat provides intuitive and efficient data access but st...
Anonymous Boh avatud kunsti maastikul / Raivo Kelomees
Kelomees, Raivo, 1960-
Anonymous Bohi näitus Tartu Kunstimajas, avatud 30. juulini 2010. Anonymous Boh on koos Non Grataga läbi viinud performance´id Euroopas, Ameerikas ja Aasias. Anonymous Bohi vastused oma näituse ja loominguga seotud küsimustele
An Automatic Approximate Matching Technique Based on Phonetic Encoding for Odia Query
Directory of Open Access Journals (Sweden)
Rakesh Chandra Balbantray
Full Text Available In search engine query optimization plays the major role in order to give relevant result. The user query mostly contains name entities. Not only names but so many words are frequently used as search criteria for information retrieval and identity matching systems in Odia. The names have normally several variations. This variations and errors in names make the exact string matching problematic. If all the variations are approximately matched, then the result can be more relevant. In this paper we put forward an automatic approximate matching technique by which all the variations having similar phonetic code of the query word can be searched and gives the best result. Our algorithm is based on the phonetic encoding of the given query words which can give more relevant result of the desired search.
Efficient Anonymizations with Enhanced Utility
Directory of Open Access Journals (Sweden)
Jacob Goldberger
Full Text Available One of the most well studied models of privacy preservation is k-anonymity. Previous studies of k-anonymization used various utility measures that aim at enhancing the correlation between the original public data and the generalized public data. We, bearing in mind that a primary goal in releasing the anonymized database for datamining is to deducemethods of predicting the private data from the public data, propose a new information-theoretic measure that aims at enhancing the correlation between the generalized public data and the private data. Such a measure significantly enhances the utility of the released anonymized database for data mining. We then proceed to describe a new algorithm that is designed to achieve k-anonymity with high utility, independently of the underlying utility measure. That algorithm is based on a modified version of sequential clustering which is the method of choice in clustering. Experimental comparison with four well known algorithms of k-anonymity show that the sequential clustering algorithm is an efficient algorithm that achieves the best utility results. We also describe a modification of the algorithm that outputs k-anonymizations which respect the additional security measure of l-diversity.
Institute of Scientific and Technical Information of China (English)
丁晓渊; 顾春华; 王明永
Query extension is a key issue in information retrieval , the efficiency of query expansion determines the retrieval performance of retrieval system .Most of the query expansions are based on global analysis or local analysis , though the accuracies have been greatly improved, but they all have their own limitations .Query log is the record of long term query behaviour by a great quantity of users .In this paper, we propose a query log-based expansion method of local co-occurrence, through which we can build an associated diagram of user initial query and user document through mining the link between user ' s initial query and user logs , and construct the related word list using local co-occurrence method , thus to realise the query expansion .The test on 50, 000 corpora shows that the precision has about 44%improvement after using this method .%查询扩展是信息检索中的一个关键问题,查询扩展的有效性决定了检索系统的检索性能。大多数的查询扩展基于全局分析或者局部分析法,虽然准确率有了很大的提高,但是都有各自的局限性。查询日志是大量用户长期查询行为的记录。提出了基于查询日志的局部共现查询扩展方法,该方法通过挖掘用户初始查询与查询日志之间的联系,构建一个用户初始查询与用户文档的关联关系图,并且使用局部共现的方法构建相关词表,从而实现查询扩展。在50000篇语料上的测试表明,该方法相对于未扩展时准确率提高了44%以上。
Top-K Queries on Uncertain Data: On Score Distribution and Typical Answers
Ge, Tingjian; Zdonik, Stan; Madden, Samuel R.
Uncertain data arises in a number of domains, including data integration and sensor networks. Top-k queries that rank results according to some user-defined score are an important tool for exploring large uncertain data sets. As several recent papers have observed, the semantics of top-k queries on uncertain data can be ambiguous due to tradeoffs between reporting high-scoring tuples and tuples with a high probability of being in the resulting data set. In this paper, we demonstrate the need ...
Anonymous Authentication for Smartcards
Directory of Open Access Journals (Sweden)
J. Hajny
Full Text Available The paper presents an innovative solution in the field of RFID (Radio-Frequency IDentification smartcard authentication. Currently the smartcards are used for many purposes - e.g. employee identification, library cards, student cards or even identity credentials. Personal identity is revealed to untrustworthy entities every time we use these cards. Such information could later be used without our knowledge and for harmful reasons like shopping pattern scanning or even movement tracking. We present a communication scheme for keeping one's identity private in this paper. Although our system provides anonymity, it does not allow users to abuse this feature. The system is based on strong cryptographic primitives that provide features never available before. Besides theoretical design of the anonymous authentication scheme and its analysis we also provide implementation results.
Narcotics Anonymous: Anonymity, admiration, and prestige in an egalitarian community
Snyder, Jeffrey K.; Fessler, Daniel M.T.
Narcotics Anonymous (NA) supports long-term recovery for those addicted to drugs. Paralleling social dynamics in many small-scale societies, NA exhibits tension between egalitarianism and prestige-based hierarchy, a problem exacerbated by the addict's personality as characterized by NA's ethnopsychology. We explore how NA's central principle of anonymity normatively translates into egalitarianism among group members. Turning to the lived reality of membership, building on Carr's (2011) conc...
U.S. Environmental Protection Agency — The Superfund Query allows users to retrieve data from the Comprehensive Environmental Response, Compensation, and Liability Information System (CERCLIS) database.
Directory of Open Access Journals (Sweden)
Dr. V. Shanthi
Full Text Available The advancement in mobile communications and its integration with Geographical Information System result in tremendous increase in Location aware computing. Users thirst for Geo-Point of interest leads to exploration of different classes of spatial queries like nearest neighbor, range queries etc in location based computing. Eachquery type is unique and there is no frame work to combine these spatial queries. In this paper, we introduce a PASQAR: Privacy aware Spatial Query Assessor on Road Networks that processes the different types of queries based on user inputs. Further PASQAR masks the user identity using encryption technique. The experimental evaluation reflects result of applying various optimization techniques in query processing and proves the efficiency of PASQAR model.
Surinx, Dimitri
In this thesis we introduce navigational query languages on graphs. Path queries in our languages are built over several operators: identity, union, composition, projection, coprojection, converse, transitive closure, diversity, intersection and difference. The smallest language we will consider only contains the first 3 operators, while the largest language contains all operators. For these query languages we will characterize their complete relative expressive power, i.e., we will compare t...
Determination of the Internet Anonymity Influence on the Level of Aggression and Usage of Obscene Lexis
Potapova, Rodmonga; Gordeev, Denis
This article deals with the analysis of the semantic content of the anonymous Russian-speaking forum 2ch.hk, different verbal means of expressing of the emotional state of aggression are revealed for this site, and aggression is classified by its directions. The lexis of different Russian-and English- speaking anonymous forums (2ch.hk and iichan.hk, 4chan.org) and public community "MDK" of the Russian-speaking social network VK is analyzed and compared with the Open Corpus of the Russian lang...
A Report on the Utilization of the Computer Program QUERY by the ERIC Clearinghouse on Teacher Education.
Tatis, Rita M.
This paper reports the results of the testing and use of a batch-mode program, QUERY, in three large computer runs performed by the ERIC (Educational Resources Information Center) Clearinghouse on Teacher Education from March through August 1970. Focus is on the behavior of QUERY as a search tool, not on cost-benefit analysis or comparison with…
Directory of Open Access Journals (Sweden)
Hazra Imran
Full Text Available The explosive growth of the World Wide Web is making it difficult for a user to locate information that isrelevant to his/her interest. Though existing search engines work well to a certain extent but they still faceproblems like word mismatch which arises because the majority of information retrieval systemscompare query and document terms on lexical level rather than on semantic level and short query: theaverage length of queries by the user is less than two words. Short queries and the incompatibilitybetween the terms in user queries and documents strongly affect the retrieval of relevant document.Query expansion has long been suggested as a technique to increase the effectiveness of the informationretrieval. Query expansion is the process of supplementing additional terms or phrases to the originalquery to improve the retrieval performance. The central problem of query expansion is the selection ofthe expansion terms based on which user's original query is expanded. Thesaurus helps to solve thisproblem. Thesaurus have frequently been incorporated in information retrieval system for identifying thesynonymous expressions and linguistic entities that are semantically similar. Thesaurus has been widelyused in many applications, including information retrieval and natural language processing.
Jonker, Hugo; Pieters, Wolter
According to international law, anonymity of the voter is a fundamental precondition for democratic elections. In electronic voting, several aspects of voter anonymity have been identified. In this paper, we re-examine anonymity with respect to voting, and generalise existing notions of anonymity in e-voting. First, we identify and categorise the types of attack that can be a threat to anonymity of the voter, including different types of vote buying and coercion. This analysis leads to a categorisation of anonymity in voting in terms of a) the strength of the anonymity achieved and b) the extent of interaction between voter and attacker. Some of the combinations, including weak and strong receipt-freeness, are formalised in epistemic logic.
Query Recommendation employing Query Logs in Search Optimization
Directory of Open Access Journals (Sweden)
Neha Singh
Full Text Available In this paper we suggest a method that, given a query presented to a search engine, proposes a list of concerned queries. The concerned queries are founded in antecedently published queries, and can be published by the user to the search engine to tune or redirect the search process. The method proposed is based on a query clustering procedure in which groups of semantically like queries are named. The clustering procedure uses the content of historical preferences of users registered in the query log of the search engine. The method not only discloses the related queries, but also ranks them agreeing to a relevance criterion. Finally, we show with experiments over the query log of a search engine the potency of the method.
Shortest Path and Distance Queries on Road Networks: An Experimental Evaluation
Wu, Lingkun; Deng, Dingxiong; Cong, Gao; Zhu, Andy Diwen; Zhou, Shuigeng
Computing the shortest path between two given locations in a road network is an important problem that finds applications in various map services and commercial navigation products. The state-of-the-art solutions for the problem can be divided into two categories: spatial-coherence-based methods and vertex-importance-based approaches. The two categories of techniques, however, have not been compared systematically under the same experimental framework, as they were developed from two independent lines of research that do not refer to each other. This renders it difficult for a practitioner to decide which technique should be adopted for a specific application. Furthermore, the experimental evaluation of the existing techniques, as presented in previous work, falls short in several aspects. Some methods were tested only on small road networks with up to one hundred thousand vertices; some approaches were evaluated using distance queries (instead of shortest path queries), namely, queries that ask only for the ...
PRESY: A Context Based Query Reformulation Tool for Information Retrieval on the Web
Directory of Open Access Journals (Sweden)
Abdelkrim Bouramoul
Full Text Available Problem statement: The huge number of information on the web as well as the growth of new inexperienced users creates new challenges for information retrieval. It has become increasingly difficult for these users to find relevant documents that satisfy their individual needs. Certainly the current search engines (such as Google, Bing and Yahoo offer an efficient way to browse the web content. However, the result quality is highly based on uses queries which need to be more precise to find relevant documents. This task still complicated for the majority of inept users who cannot express their needs with significant words in the query. For that reason, we believe that a reformulation of the initial user's query can be a good alternative to improve the information selectivity. This study proposed a novel approach and presents a prototype system called Profile-based Reformulation System (PRESY for information retrieval on the web. Approach: It used an incremental approach to categorize users by constructing a contextual base. The latter was composed of two types of context (static and dynamic obtained using the users' profiles. The architecture proposed was implemented using .Net environment to perform queries reformulating tests. Results: The experiments gave at the end of this article show that the precision of the returned content is effectively improved. The tests were performed with the most popular searching engine (i.e., Google, Bind and Yahoo selected in particular for their high selectivity. Among the given results, we found that query reformulation improve the first three results by 10.7 and 11.7% of the next seven returned elements. So as we could see the reformulation of users' initial queries improves the pertinence of returned content. Conclusion/Recommendations: Therefore, we believed that the exploitation of contextual data based on users' profiles could be a very good way to reformulate user query. This complementary mechanism would
An Improved HITS Algorithm Based on Page-query Similarity and Page Popularity
Xinyue Liu; Hongfei Lin; Cong Zhang
The HITS algorithm is a very popular and effective algorithm to rank web documents based on the link information among a set of web pages. However, it assigns every link with the same weight. This assumption results in topic drift. In this paper, we firstly define the generalized similarity between a query and a page, and the popularity of a web page. Then we propose a weighted HITS algorithm which differentiates the importance of links with the query-page similarities and the popularity of w...
KoralQuery -- A General Corpus Query Protocol
DEFF Research Database (Denmark)
Bingel, Joachim; Diewald, Nils
The task-oriented and format-driven development of corpus query systems has led to the creation of numerous corpus query languages (QLs) that vary strongly in expressiveness and syntax. This is a severe impediment for the interoperability of corpus analysis systems, which lack a common protocol. In...... this paper, we present KoralQuery, a JSON-LD based general corpus query protocol, aiming to be independent of particular QLs, tasks and corpus formats. In addition to describing the system of types and operations that KoralQuery is built on, we exemplify the representation of corpus queries in the...
Query recommendation for children
Duarte Torres, Sergio; Hiemstra, Djoerd; Weber, Ingmar; Serdyukov, Pavel
One of the biggest problems that children experience while searching the web occurs during the query formulation process. Children have been found to struggle formulating queries based on keywords given their limited vocabulary and their difficulty to choose the right keywords. In this work we propo
Tigani, Jordan
How to effectively use BigQuery, avoid common mistakes, and execute sophisticated queries against large datasets Google BigQuery Analytics is the perfect guide for business and data analysts who want the latest tips on running complex queries and writing code to communicate with the BigQuery API. The book uses real-world examples to demonstrate current best practices and techniques, and also explains and demonstrates streaming ingestion, transformation via Hadoop in Google Compute engine, AppEngine datastore integration, and using GViz with Tableau to generate charts of query results. In addit
Marlus Heriberto Arns de Oliveira; José Renato Gaziero Cella
The Constitution of the Federative Republic of Brazil, enacted in 1988 during the democratization process of the country after the end of an authoritarian regime preceded by several others that show a non-democratic tradition in the Brazilian Republic, remained still remnants an authoritarian Patronizing and Paternalist state, the example of the final part of the Article 5, item IV, which claims to be the free expression of thought, but forbids anonymity, prohibition which deserves to be reth...
A Comparison of the Effects of K-Anonymity on Machine Learning Algorithms
Hayden Wimmer; Loreen Powell
While research has been conducted in machine learning algorithms and in privacy preserving in data mining (PPDM), a gap in the literature exists which combines the aforementioned areas to determine how PPDM affects common machine learning algorithms. The aim of this research is to narrow this literature gap by investigating how a common PPDM algorithm, K-Anonymity, affects common machine learning and data mining algorithms, namely neural networks, logistic regression, decision trees, and Baye...
A Review on anonymization approach to preserve privacy of Published data through record elimination
Directory of Open Access Journals (Sweden)
Isha K. Gayki
Full Text Available Data mining is the process of analyzing data. Data Privacy is collection of data and dissemination of data. Privacy issues arise in different area such as health care, intellectual property, biological data, financial transaction etc. It is very difficult to protect the data when there is transfer of data. Sensitive information must be protected. There are two kinds of major attacks against privacy namely record linkage and attribute linkage attacks. Research have proposed some methods namely k-anonymity, ℓ-diversity, t-closeness for data privacy. K-anonymity method preserves the privacy against record linkage attack alone. It is unable to prevent address attribute linkage attack. ℓ-diversity method overcomes the drawback of k-anonymity method. But it fails to prevent identity disclosure attack and attribute disclosure attack. t-closeness method preserves the privacy against attribute linkage attack but not identity disclosure attack. A proposed method used to preserve the privacy of individuals sensitive data from record and attribute linkage attacks. In the proposed method, privacy preservation is achieved through generalization by setting range values and through record elimination. A proposed method overcomes the drawback of both record linkage attack and attribute linkage attack.
Query auto completion in information retrieval
Fei Cai
Query auto completion is an important feature embedded into today's search engines. It can help users formulate queries which other people have searched for when he/she finishes typing the query prefix. Today's most sophisticated query auto completion approaches are based on the collected query logs
A Semantic Query Transformation Approach Based on Ontology for Search Engine
Directory of Open Access Journals (Sweden)
Full Text Available These days we are using some popular web search engines for information retrieval in all areas, such engine are as Google, Yahoo!, and Live Search, etc. to obtain initial helpful information.Which information we retrieved via search engine may not be relevant to the search target in the search engine user's mind. When user not found relevant information he has to shortlist the results. Thesesearch engines use traditional search service based on "static keywords", which require the users to type in the exact keywords. This approach clearly puts the users in a critical situation of guessing the exact keyword. The users may want to define their search by using attributes of the search target. But the relevancy of results in most cases may not be satisfactory and the users may not be patient enough to browse through complete list of pages to get a relevant result. The reason behind this is the search engines performs search based on the syntax not on semantics. But they seemed to be less efficient to understand the relationship between the keywords which had an adverse effect on the results it produced. Semantic search engines – only solution to this; which returns concepts not documents according to user query matching. In This paper we proposed a semantic query interface which creates a semantic query according the user input query and study of current semantic search engine techniques for semantic search.
Privacy Preserving Quantum Anonymous Transmission via Entanglement Relay
Wei Yang; Liusheng Huang; Fang Song
Anonymous transmission is an interesting and crucial issue in computer communication area, which plays a supplementary role to data privacy. In this paper, we put forward a privacy preserving quantum anonymous transmission protocol based on entanglement relay, which constructs anonymous entanglement from EPR pairs instead of multi-particle entangled state, e.g. GHZ state. Our protocol achieves both sender anonymity and receiver anonymity against an active adversary and tolerates any number of...
Lower Bounds on Query Complexity for Testing Bounded-Degree CSPs
Yoshida, Yuichi
In this paper, we consider lower bounds on the query complexity for testing CSPs in the bounded-degree model. First, for any ``symmetric'' predicate $P:{0,1}^{k} \\to {0,1}$ except \\equ where $k\\geq 3$, we show that every (randomized) algorithm that distinguishes satisfiable instances of CSP(P) from instances $(|P^{-1}(0)|/2^k-\\epsilon)$-far from satisfiability requires $\\Omega(n^{1/2+\\delta})$ queries where $n$ is the number of variables and $\\delta>0$ is a constant that depends on $P$ and $\\epsilon$. This breaks a natural lower bound $\\Omega(n^{1/2})$, which is obtained by the birthday paradox. We also show that every one-sided error tester requires $\\Omega(n)$ queries for such $P$. These results are hereditary in the sense that the same results hold for any predicate $Q$ such that $P^{-1}(1) \\subseteq Q^{-1}(1)$. For EQU, we give a one-sided error tester whose query complexity is $\\tilde{O}(n^{1/2})$. Also, for 2-XOR (or, equivalently E2LIN2), we show an $\\Omega(n^{1/2+\\delta})$ lower bound for distinguishi...
Quantum anonymous voting with anonymity check
International Nuclear Information System (INIS)
We propose a new protocol for quantum anonymous voting having serious advantages over the existing protocols: it protects both the voters from a curious tallyman and all the participants from a dishonest voter in unconditional way. The central idea of the protocol is that the ballots are given back to the voters after the voting process, which gives a possibility for two voters to check the anonymity of the vote counting process by preparing a special entangled state of two ballots. Any attempt of cheating from the side of the tallyman results in destroying the entanglement, which can be detected by the voters.
Anonymity and Historical-Anonymity in Location-Based Services
Bettini, Claudio; Mascetti, Sergio; Wang, X. Sean; Freni, Dario; Jajodia, Sushil
The problem of protecting user's privacy in Location-Based Services (LBS) has been extensively studied recently and several defense techniques have been proposed. In this contribution, we first present a categorization of privacy attacks and related defenses. Then, we consider the class of defense techniques that aim at providing privacy through anonymity and in particular algorithms achieving "historical k- anonymity" in the case of the adversary obtaining a trace of requests recognized as being issued by the same (anonymous) user. Finally, we investigate the issues involved in the experimental evaluation of anonymity based defense techniques; we show that user movement simulations based on mostly random movements can lead to overestimate the privacy protection in some cases and to overprotective techniques in other cases. The above results are obtained by comparison to a more realistic simulation with an agent-based simulator, considering a specific deployment scenario.
Query Performance Prediction for Information Retrieval Based on Covering Topic Score
Institute of Scientific and Technical Information of China (English)
Hao Lang; Bin Wang; Gareth Jones; Jin-Tao Li; Fan Ding; Yi-Xuan Liu
We present a statistical method called Covering Topic Score (CTS) to predict query performance for information retrieval. Estimation is based on how well the topic of a user's query is covered by documents retrieved from a certain retrieval system. Our approach is conceptually simple and intuitive, and can be easily extended to incorporate features beyond bag-of-words such as phrases and proximity of terms. Experiments demonstrate that CTS significantly correlates with query performance in a variety of TREC test collections, and in particular CTS gains more prediction power benefiting from features of phrases and proximity of terms. We compare CTS with previous state-of-the-art methods for query performance prediction including clarity score and robustness score. Our experimental results show that CTS consistently performs better than, or at least as well as, these other methods. In addition to its high effectiveness, CTS is also shown to have very low computational complexity, meaning that it can be practical for real applications.
Security Analysis of Accountable Anonymity in Dissent
Syta, Ewa; Johnson, Aaron; Corrigan-Gibbs, Henry; Weng, Shu-Chun; Wolinsky, David; Ford, Bryan
Users often wish to communicate anonymously on the Internet, for example in group discussion or instant messaging forums. Existing solutions are vulnerable to misbehaving users, however, who may abuse their anonymity to disrupt communication. Dining Cryptographers Networks (DC-nets) leave groups vulnerable to denial-of-service and Sybil attacks, mix networks are difficult to protect against traffic analysis, and accountable voting schemes are unsuited to general anonymous messaging. DISSENT ...
Internet and the right of anonymity
Voorhoof, Dirk
This articles explores the ratio and characteristics of the right of anonymity on the Internet. A right of anonymity is considered as a shield against oppression, harassment, retaliation, censorship or discrimination and therefore it is considered as a vital component of freedom of speech or freedom of expression. Reference is made to several existing types of rights of anonymity in relation to freedom of expression, such as the right to protect (confidential) journalistic sources, free elec...
Data Retention and Anonymity Services
Berthold, Stefan; Böhme, Rainer; Köpsell, Stefan
The recently introduced legislation on data retention to aid prosecuting cyber-related crime in Europe also affects the achievable security of systems for anonymous communication on the Internet. We argue that data retention requires a review of existing security evaluations against a new class of realistic adversary models. In particular, we present theoretical results and first empirical evidence for intersection attacks by law enforcement authorities. The reference architecture for our study is the anonymity service AN.ON, from which we also collect empirical data. Our adversary model reflects an interpretation of the current implementation of the EC Directive on Data Retention in Germany.
Algebraic Optimization of Outerjoin Queries
Galindo-Legaria, Cesar Alejandro
An advantage of relational database languages is that they allow "declarative" query specification: users pose queries as a set of conditions or properties on data to be retrieved, rather than by giving a procedure to obtain such data. The database system is then responsible for generating an efficient execution plan, depending on how information is physically stored. In this context, generation of efficient plans is known as database query optimization. Careful query analysis is justified du...
The Interactive Effects of Motivations and Trust in Anonymity on Adolescents' Enduring Participation in Web-Based Social Science Research: A Longitudinal Behavioral Analysis
Directory of Open Access Journals (Sweden)
Barbara Stiglbauer
Full Text Available Based on self-determination and social exchange theory, this study investigates the effects of extrinsic motivation, intrinsic motivation, and trust in anonymity on enduring survey participation over a period of 2 years. Trust in anonymity was expected to act as a moderator between motivations and the likelihood of repeated survey participation. Participants were N = 227 adolescent members of an academic online panel for youth research. Results of longitudinal logistic regression analyses demonstrated a steady decline in the probability of survey participation over time. Extrinsic but not intrinsic motivation significantly increased the probability of initial survey participation, whereas both, extrinsic and intrinsic motivation, buffered the declining probability of survey participation over time; however, only if trust in anonymity was comparably low. These results suggest that the beneficial effects of extrinsic and intrinsic motivations on enduring survey participation are especially prevalent if trust in anonymity is of low to medium size.
Economical quantum anonymous transmissions
International Nuclear Information System (INIS)
We present a new information-theoretically secure protocol for the anonymous transmission of quantum information. Different from the pioneering works, we use single photons to construct anonymous entanglement instead of multi-partite entangled states in this protocol, and therefore we reduce the complexity of physical implementation in practice.
Ackerman, Margareta; Lopez-Ortiz, Alejandro
Over the last fifteen years, web searching has seen tremendous improvements. Starting from a nearly random collection of matching pages in 1995, today, search engines tend to satisfy the user's informational need on well-formulated queries. One of the main remaining challenges is to satisfy the users' needs when they provide a poorly formulated query. When the pages matching the user's original keywords are judged to be unsatisfactory, query expansion techniques are used to alter the result set. These techniques find keywords that are similar to the keywords given by the user, which are then appended to the original query leading to a perturbation of the result set. However, when the original query is sufficiently ill-posed, the user's informational need is best met using entirely different keywords, and a small perturbation of the original result set is bound to fail. We propose a novel approach that is not based on the keywords of the original query. We intentionally seek out orthogonal queries, which are r...
[Comment on "Anonymous reviews: Self-serving, counterproductive, and unacceptable"] from R.E. Criss and A.M. Hofmeister
Criss, Robert E.; Hofmeister, Anne M.
We share many of the experiences and most of the sentiments relayed by Myrl Beck in his 1 July contribution to the Eos Forum, as well as those of a similar nature expressed by Alexander McBirney in his March 2003 commentary in GSA Today. We are in fact delighted that senior scientists are speaking up about the unsatisfactory nature of anonymous reviews. However, we believe they understate the problems, partly because the situation is worsening with time. Moreover, the brunt of such problems is disproportionately felt not by emeritus professors but by young scientists, women, and minorities, and this is the crux of the issue.This year, we have, like Beck, received rejections based on comments by two anonymous reviewers and an anonymous associate editor. We have also received rejections from anonymous associate editors based on a single constructive review requesting minor revision, along with an anonymous hostile "review" that could have been written about any manuscript on any topic by any author. More common than these are rejections from identified associate editors based on one or two anonymous reviews, which more often than not err on most of the points made, and in two cases dispute work that resulted in Nobel Prizes. We have examples this year of each type where the senior authors are recent Ph.D.s, whose vulnerabilities underscore the reprehensible nature of this "process."
Query optimization over crowdsourced data
Park, Hyunjung
Deco is a comprehensive system for answering declarative queries posed over stored relational data together with data obtained on-demand from the crowd. In this paper we describe Deco\\'s cost-based query optimizer, building on Deco\\'s data model, query language, and query execution engine presented earlier. Deco\\'s objective in query optimization is to find the best query plan to answer a query, in terms of estimated monetary cost. Deco\\'s query semantics and plan execution strategies require several fundamental changes to traditional query optimization. Novel techniques incorporated into Deco\\'s query optimizer include a cost model distinguishing between "free" existing data versus paid new data, a cardinality estimation algorithm coping with changes to the database state during query execution, and a plan enumeration algorithm maximizing reuse of common subplans in a setting that makes reuse challenging. We experimentally evaluate Deco\\'s query optimizer, focusing on the accuracy of cost estimation and the efficiency of plan enumeration.
Optimal query error of quantum approximation on some Sobolev classes
Institute of Scientific and Technical Information of China (English)
We study the approximation of the imbedding of functions from anisotropic and general-ized Sobolev classes into Lq([0,1]d) space in the quantum model of computation. Based on the quantum algorithms for approximation of finite imbedding from LpN to LNq , we develop quantum algorithms for approximating the imbedding from anisotropic Sobolev classes B(Wpr ([0,1]d)) to Lq([0,1]d) space for all 1 q,p ∞ and prove their optimality. Our results show that for p < q the quantum model of computation can bring a speedup roughly up to a squaring of the rate in the classical deterministic and randomized settings.
Query complexity in expectation
Kaniewski, J.; Lee, Troy; Wolf,
We study the query complexity of computing a function f:{0,1}^n-->R_+ in expectation. This requires the algorithm on input x to output a nonnegative random variable whose expectation equals f(x), using as few queries to the input x as possible. We exactly characterize both the randomized and the quantum query complexity by two polynomial degrees, the nonnegative literal degree and the sum-of-squares degree, respectively. We observe that the quantum complexity can be unboundedly smaller than t...
Improving Estimation Accuracy of Aggregate Queries on Data Cubes
Energy Technology Data Exchange (ETDEWEB)
Pourabbas, Elaheh; Shoshani, Arie
In this paper, we investigate the problem of estimation of a target database from summary databases derived from a base data cube. We show that such estimates can be derived by choosing a primary database which uses a proxy database to estimate the results. This technique is common in statistics, but an important issue we are addressing is the accuracy of these estimates. Specifically, given multiple primary and multiple proxy databases, that share the same summary measure, the problem is how to select the primary and proxy databases that will generate the most accurate target database estimation possible. We propose an algorithmic approach for determining the steps to select or compute the source databases from multiple summary databases, which makes use of the principles of information entropy. We show that the source databases with the largest number of cells in common provide the more accurate estimates. We prove that this is consistent with maximizing the entropy. We provide some experimental results on the accuracy of the target database estimation in order to verify our results.
MHBase: A Distributed Real-Time Query Scheme for Meteorological Data Based on HBase
Directory of Open Access Journals (Sweden)
Tinghuai Ma
Full Text Available Meteorological technology has evolved rapidly in recent years to provide enormous, accurate and personalized advantages in the public service. Large volumes of observational data are generated gradually by technologies such as geographical remote sensing, meteorological radar satellite, etc. that makes data analysis in weather forecasting more precise but also poses a threat to the traditional method of data storage. In this paper, we present MHBase, (Meteorological data based on HBase (Hadoop Database, a distributed real-time query scheme for meteorological data based on HBase. The calibrated data obtained from terminal devices will be partitioned into HBase and persisted to HDFS (the Hadoop Distributed File System. We propose two algorithms (the Indexed Store and the Indexed Retrieve Algorithms to implement a secondary index using HBase Coprocessors, which allow MHbase to provide high performance data querying on columns other than rowkey. Experimental results show that the performance of MHBase can satisfy the basic demands of meteorological business services.
The history of science is replete with important works that were originally published without the author's legal name being revealed. Most modern scientists will have worked anonymously in their capacity as peer reviewers. But why is anonymity so popular? And is it a valid approach? I argue that pseudonymity and anonymity, although not appropriate for all forms of scientific communication, have a vital role to play in academic discourse. They can facilitate the free expression of interpretations and ideas, and can help to ensure that suggestions and criticisms are evaluated dispassionately, regardless of their source. PMID:23570959
On the Complexity of Query Answering under Matching Dependencies for Entity Resolution
Bertossi, Leopoldo; Gardezi, Jaffer
Matching Dependencies (MDs) are a relatively recent proposal for declarative entity resolution. They are rules that specify, given the similarities satisfied by values in a database, what values should be considered duplicates, and have to be matched. On the basis of a chase-like procedure for MD enforcement, we can obtain clean (duplicate-free) instances; actually possibly several of them. The resolved answers to queries are those that are invariant under the resulting class of resolved inst...
Perm: Processing provenance and data on the same data model through query rewriting
Glavic, B; Alonso, G
Data provenance is information that describes how a given data item was produced. The provenance includes source and intermediate data as well as the transformations involved in producing the concrete data item. In the context of a relational databases, the source and intermediate data items are relations, tuples and attribute values. The transformations are SQL queries and/or functions on the relational data items. Existing approaches capture provenance information by extending the underl...
Increasing user participation: An exploratory study of querying on the Facebook and Twitter platforms
Crowley, Caren; Daniels, Wilfried; Bachiller Soler, Rafael; Joosen, Wouter; Hughes, Danny
Participatory applications frequently rely upon a crowd–sourced community of users who contribute data and content to deliver a service. The success or failure of participatory applications is dependent on developing and maintaining a community of responsive users. This paper reports the results of an exploratory 30–day study examining user responsiveness to query messages. In total 3,055 check–in requests were sent via the online social networks Facebook or Twitter to 70 participants who wer...
Querying and Merging Heterogeneous Data by Approximate Joins on Higher-Order Terms
S. Price; Flach, PA
Integrating heterogeneous data from sources as diverse as web pages, digital libraries, knowledge bases, the Semantic Web and databases is an open problem. The ultimate aim of our work is to be able to query such heterogeneous data sources as if their data were conveniently held in a single relational database. Pursuant to this aim, we propose a generalisation of joins from the relational database model to enable joins on arbitrarily complex structured data in a higher-order representation. B...
BlinkDB: Queries with Bounded Errors and Bounded Response Times on Very Large Data
Agarwal, Sameer; Mozafari, Barzan; Madden, Samuel; Stoica, Ion
Today's web is predominantly data-driven. Corporations, businesses and netizens are increasingly depending on enormous amounts of data (spanning terabytes or even petabytes in size) to make intelligent business and personal decisions. Often the time it takes to make these decisions is critical. Unfortunately, quickly analyzing large volumes of data poses significant challenges. For instance, scanning 1TB of data may take minutes, even when the data is spread across hundreds of machines and read in parallel. In this paper, we present BlinkDB, a massively parallel, sampling-based approximate query engine for running interactive queries on large volumes of data. The key observation in BlinkDB is that one can make perfect decisions in the absence of perfect answers. For example, reliably detecting a malfunctioning server in a distributed collection of system logs does not require knowing every request the server processed. Based on this insight, BlinkDB allows one to tradeoff between query accuracy and response t...
Directory of Open Access Journals (Sweden)
K. Sridharan
Full Text Available Due to enhance in complexity of services, there is a necessity for dynamic interaction models. For a service-oriented system to work properly, we need a context-sensitive trust based search. Automatic information transfer is also deficient when unexpected query is given. However, it shows that search engines are vulnerable in answering intellectual queries and shows an unreliable outcome. The user cannot have a fulfillment with these results due to lack of trusts on blogs. In our modified trust algorithm, which process exact skill matching and retrieval of information based on proper content rank. Our contribution to this system is new modified trust algorithm with automatic formulation of meaningful query search to retrieve the exact contents from the top-ranked documents based on the expert rank and their content quality verified of their resources provided. Some semantic search engines cannot show their important performance in improving precision and lowering recall. It hence effectively reduces complexity in combining HPS and software services.
Head lice surveillance on a deregulated OTC-sales market: a study using web query data.
Directory of Open Access Journals (Sweden)
Johan Lindh
Full Text Available The head louse, Pediculus humanus capitis, is an obligate ectoparasite that causes infestations of humans. Studies have demonstrated a correlation between sales figures for over-the-counter (OTC treatment products and the number of humans with head lice. The deregulation of the Swedish pharmacy market on July 1, 2009, decreased the possibility to obtain complete sale figures and thereby the possibility to obtain yearly trends of head lice infestations. In the presented study we wanted to investigate whether web queries on head lice can be used as substitute for OTC sales figures. Via Google Insights for Search and Vårdguiden medical web site, the number of queries on "huvudlöss" (head lice and "hårlöss" (lice in hair were obtained. The analysis showed that both the Vårdguiden series and the Google series were statistically significant (p<0.001 when added separately, but if the Google series were already included in the model, the Vårdguiden series were not statistically significant (p = 0.5689. In conclusion, web queries can detect if there is an increase or decrease of head lice infested humans in Sweden over a period of years, and be as reliable a proxy as the OTC-sales figures.
Bayesian Query-Focused Summarization
Daumé, Hal
We present BayeSum (for ``Bayesian summarization''), a model for sentence extraction in query-focused summarization. BayeSum leverages the common case in which multiple documents are relevant to a single query. Using these documents as reinforcement for query terms, BayeSum is not afflicted by the paucity of information in short queries. We show that approximate inference in BayeSum is possible on large data sets and results in a state-of-the-art summarization system. Furthermore, we show how BayeSum can be understood as a justified query expansion technique in the language modeling for IR framework.
Legal Issues in Anonymity and Pseudonymity.
Froomkin, A. Michael
Regulation of anonymous and pseudonymous communications is an important and contentious Internetrelated issues of the 21st century. Resolution of this controversy will effect freedom of speech, nature of electronic commerce, and capabilities of law enforcement. The legal constraints on anonymous communication, and the constitutional constraints on…
Querying Co-regulated Genes on Diverse Gene Expression Datasets Via Biclustering.
Deveci, Mehmet; Küçüktunç, Onur; Eren, Kemal; Bozdağ, Doruk; Kaya, Kamer; Çatalyürek, Ümit V
Rapid development and increasing popularity of gene expression microarrays have resulted in a number of studies on the discovery of co-regulated genes. One important way of discovering such co-regulations is the query-based search since gene co-expressions may indicate a shared role in a biological process. Although there exist promising query-driven search methods adapting clustering, they fail to capture many genes that function in the same biological pathway because microarray datasets are fraught with spurious samples or samples of diverse origin, or the pathways might be regulated under only a subset of samples. On the other hand, a class of clustering algorithms known as biclustering algorithms which simultaneously cluster both the items and their features are useful while analyzing gene expression data, or any data in which items are related in only a subset of their samples. This means that genes need not be related in all samples to be clustered together. Because many genes only interact under specific circumstances, biclustering may recover the relationships that traditional clustering algorithms can easily miss. In this chapter, we briefly summarize the literature using biclustering for querying co-regulated genes. Then we present a novel biclustering approach and evaluate its performance by a thorough experimental analysis. PMID:26626937
Bo, Yang
A data stream management system (DSMS) is similar to a database management system (DBMS) but can search data directly in on-line streams. Using its mediator-wrapper approach, the extensible database system, Amos II, allows different kinds of distributed data resource to be queried. It has been extended with a stream datatype to query possibly infinite streams, which provides DSMS functionality. Nowadays, more and more web applications start to offer their services in JSON format which is a te...
Directory of Open Access Journals (Sweden)
Kamsuriah Ahmad
Full Text Available Oracle database is well suited to use for managing and exchanging of corporate data, especially for companies that have large-scale databases. Even though Oracle can work best, however, there are conditions where Oracle does not perform well and consume more time to perform the query transaction. This is when the database tuning process is needed. This process will solve the problems of low performance and high execution time when accessing data in the database. This study aims to propose an improvement process of query tuning that can reduce queries execution time. The cause of the problems can be discovered by reviewing the source code, List of Value (LOV and view on the current system. To enhance the query, existing query scripts need to be modified to fit the tuning process. As an evaluation on the effectiveness of the proposed query tuning process, a comparison of study is done. The result of the study shows that before the tuning process, a system takes 156 milliseconds to execute the query and after implementing the proposed query tuning process, the execution time decreases to less than one millisecond. It means hundred times performance improvement on the query execution. The outcome of the study proved that the query execution time decreased after implementing the proposed query tuning process in the system.
[Comment on "Anonymous reviews: Self-serving, counterproductive, and unacceptable"] Anecdotal information is insufficient to claim
Walder, Joseph S.
I have read the recent Forum commentaries describing disgruntlement with particular anonymous reviews (1 July 2003 and 29 July 2003 issues), and nodded sympathetically. After all, who among us has not felt, at one time or another, that a reviewer badly misunderstood our contribution to the scientific literature or our grant proposal? But each of these recent Forum contributors in fact committed the elementary logical error of invoking anecdotal evidence to prove a point. I doubt that any of these correspondents would accept scientific claims based on anecdotes. Yet somehow they believe that anecdotes form a sufficient basis for claiming that anonymous reviewing is inherently a nasty business. These correspondents further employed the dubious rhetorical device of contrasting their own self-defined, high ethical standards with those of their adversaries, whom they variously described as rude, hostile, vindictive, lazy, cowardly, selfish, bigoted against women and minorities, and attired in "the costume of crooks." The parallel with the discourse of political argument is hard to miss.
An Anonymous User Authentication and Key Agreement Scheme Based on a Symmetric Cryptosystem in Wireless Sensor Networks.
Jung, Jaewook; Kim, Jiye; Choi, Younsung; Won, Dongho
In wireless sensor networks (WSNs), a registered user can login to the network and use a user authentication protocol to access data collected from the sensor nodes. Since WSNs are typically deployed in unattended environments and sensor nodes have limited resources, many researchers have made considerable efforts to design a secure and efficient user authentication process. Recently, Chen et al. proposed a secure user authentication scheme using symmetric key techniques for WSNs. They claim that their scheme assures high efficiency and security against different types of attacks. After careful analysis, however, we find that Chen et al.'s scheme is still vulnerable to smart card loss attack and is susceptible to denial of service attack, since it is invalid for verification to simply compare an entered ID and a stored ID in smart card. In addition, we also observe that their scheme cannot preserve user anonymity. Furthermore, their scheme cannot quickly detect an incorrect password during login phase, and this flaw wastes both communication and computational overheads. In this paper, we describe how these attacks work, and propose an enhanced anonymous user authentication and key agreement scheme based on a symmetric cryptosystem in WSNs to address all of the aforementioned vulnerabilities in Chen et al.'s scheme. Our analysis shows that the proposed scheme improves the level of security, and is also more efficient relative to other related schemes. PMID:27537890
Cache Pattern with Multi-Queries
Directory of Open Access Journals (Sweden)
Full Text Available This article proposes a cache pattern with multi-queries and describes the multi-query optimization with scheduling, caching and pipelining. A set of cache patterns is derived from a set of class of multi-queries that are loaded into the cache. Each cache pattern represents a unique equivalence class in the set of patterns. The multi-query optimization with scheduling, caching and pipelining provides efficient heuristics, for a good queries ordering using a single invocation on the entire batch of queries. Multi-query optimization chooses the results of sub-expression that should be admitted to or discarded from cache, when it executes queries. We introduce the heuristic of pair queries and define the equivalence class of multi-queries from cache pattern. We show that the union of all equivalence classes of queries from the cache patterns is the set of cache patterns.
Using Dempster-Shafer's evidence theory for query expansion based on freebase knowledge
Pan, Dazhao; Peng ZHANG; Li, Jingfei; Song, Dawei; Wen, Jirong; Hou, Yuexian; Hu, Bin; Jia, Yuan; De Roeck, Anne
Query expansion is generally a useful technique in improving search performance. However, some expanded query terms obtained by traditional statistical methods (e.g., pseudo-relevance feedback) may not be relevant to the user's information need, while some relevant terms may not be contained in the feedback documents at all. Recent studies utilize external resources to detect terms that are related to the query, and then adopt these terms in query expansion. In this paper, we present a study ...
Federated SPARQL Query Processing Reconciling Diversity, Flexibility and Performance on the Web of Data
Basca, C
Querying the ever-growing Web of Data poses a significant challenge in today's Semantic Web. The complete lack of any centralised control leads to potentially arbitrary data distribution, high variability of latency between hosts participating in query answering, and, in the extreme, even the (sudden) unavailability of some hosts during query execution. In this thesis we address the question of how to efficiently query the Web of Data while taking into account its scale, diversity and unrelia...
Mining Longitudinal Web Queries: Trends and Patterns.
Wang, Peiling; Berry, Michael W.; Yang, Yiheng
Analyzed user queries submitted to an academic Web site during a four-year period, using a relational database, to examine users' query behavior, to identify problems they encounter, and to develop techniques for optimizing query analysis and mining. Linguistic analyses focus on query structures, lexicon, and word associations using statistical…
Effective Density Queries of Continuously Moving Objects
DEFF Research Database (Denmark)
Jensen, Christian Søndergaard; Lin, D.; Ooi, B.C.;
In this paper, we study a newly emerging type of queries on moving objects - the density query. Basically, this query locates regions in the data space where the density of the objects is high. This type of queries is especially useful in Location Based Services (LBS). For example, in a traffic...
Anonymous quantum communications using the quantum one-time pad
International Nuclear Information System (INIS)
We present the first quantum secure communication protocol for an anonymous receiver without the assistance of anonymous entanglement. In previous works, if a public sender wants to send quantum messages to a chosen receiver while protecting the identity of the receiver from others, all participants should cooperate first to construct the entanglement between the sender and the anonymous receiver. This is the most important process in anonymous quantum communications. With anonymous entanglement, the sender can communicate quantum messages to the anonymous receiver by applying teleportation protocols. In contrast, our protocol is novel and achieves communication of quantum messages directly from the public sender to the anonymous receiver based on the quantum one-time pad and current achievements. Notably, the anonymity of the receiver, as well as the privacy of the quantum messages, is perfectly protected with the exception of an exponentially small probability in our protocol. (paper)
Anonymous Mobile Payment Solution
Directory of Open Access Journals (Sweden)
Alhaj Ali Jalila
Full Text Available The evolution and increasing popularity of mobile handheld devices has led to the development of payment applications. The global acceptance of mobile payments is hindered by security and privacy concerns. One of the main problems evoked is the anonymity related with banking transactions. In this paper I propose a new secured architecture for mobile banking. Anonymity and privacy protection are the measures to be enhanced in order to satisfy people's current needs. The banking platform must provide the highest level of security for messages exchanged between bank and the customer.
Foreword for the special issue of selected papers from the 7th EDBT/ICDT Workshop on Privacy and Anonymity in Information Society (PAIS 2014
Directory of Open Access Journals (Sweden)
Traian Marius Truta
Full Text Available The seventh Workshop on Privacy and Anonymity in Information Society (PAIS 2014 was held in conjunction with the International Conference on Extending Database Technology (EDBT and International Conference on Database Theory (ICDT in Athens, Greece. The PAIS 2014 workshop provided an open yet focused platform for researchers and practitioners from fields such as computer science, statistics, healthcare informatics, and law to discuss and present current research challenges and advances in data privacy and anonymity research. The present special issue contains three extended papers that have been selected as the best three papers presented at PAIS 2014 workshop.
VISAGE: A Query Interface for Clinical Research.
Zhang, Guo-Qiang; Siegler, Trish; Saxman, Paul; Sandberg, Neil; Mueller, Remo; Johnson, Nathan; Hunscher, Dale; Arabandi, Sivaram
We present the design and implementation of VISAGE (VISual AGgregator and Explorer), a query interface for clinical research. We follow a user-centered development approach and incorporate visual, ontological, searchable and explorative features in three interrelated components: Query Builder, Query Manager and Query Explorer. The Query Explorer provides novel on-line data mining capabilities for purposes such as hypothesis generation or cohort identification. The VISAGE query interface has been implemented as a significant component of Physio-MIMI, an NCRR-funded, multi-CTSA-site pilot project. Preliminary evaluation results show that VISAGE is more efficient for query construction than the i2b2 web-client. PMID:21347154
Quantum Private Query Protocol Based on Two Non-Orthogonal States
Yan Chang; Shibin Zhang; Guihua Han; Zhiwei Sheng; Lili Yan; Jinxin Xiong
We propose a loss tolerant quantum private query (QPQ) protocol based on two non-orthogonal states and unambiguous state discrimination (USD) measurement. By analyzing a two-point attack by a third party, we find that our protocol has a stronger ability to resist external attacks than G-protocol and Y-protocol. Our protocol requires a smaller number of compressions than that in G-protocol (Gao et al., Opt. Exp. 2012, 20, 17411–17420) and Y-protocol (Yan et al. Quant. Inf. Process. 2014, 13, 8...
Selective Flooding Based on Relevant Nearest-Neighbor using Query Feedback and Similarity across Unstructured Peer-to-Peer Networks
Directory of Open Access Journals (Sweden)
Iskandar Ishak
Full Text Available Problem statement: Efficient searching is a fundamental problem for unstructured peer to peer networks. Flooding requires a lot of resources in the network and thus will increase the search cost. Searching approach that utilizes minimum network resources is required to produce efficient searching in the robust and dynamic peer-to-peer network. Approach: This study addressed the need for efficient flood-based searching in unstructured peer-to-peer network by considering the content of query and only selecting peers that were most related to the query given. We used minimum information to perform efficient peer selection by utilizing the past queries data and the query message. We exploited the nearest-neighbor concept on our query similarity and query hits space metrics for selecting the most relevant peers for efficient searching. Results: As demonstrated by extensive simulations, our searching scheme achieved better retrieval and low messages consumption. Conclusion: This study suggested that, in an unstructured peer-to-peer network, flooding that was based on the selection of relevant peers, can improve searching efficiency.
Optimizing queries in distributed systems
Directory of Open Access Journals (Sweden)
Ion LUNGU
Full Text Available This research presents the main elements of query optimizations in distributed systems. First, data architecture according with system level architecture in a distributed environment is presented. Then the architecture of a distributed database management system (DDBMS is described on conceptual level followed by the presentation of the distributed query execution steps on these information systems. The research ends with presentation of some aspects of distributed database query optimization and strategies used for that.
A flexible approach to distributed data anonymization.
Kohlmayer, Florian; Prasser, Fabian; Eckert, Claudia; Kuhn, Klaus A
Sensitive biomedical data is often collected from distributed sources, involving different information systems and different organizational units. Local autonomy and legal reasons lead to the need of privacy preserving integration concepts. In this article, we focus on anonymization, which plays an important role for the re-use of clinical data and for the sharing of research data. We present a flexible solution for anonymizing distributed data in the semi-honest model. Prior to the anonymization procedure, an encrypted global view of the dataset is constructed by means of a secure multi-party computing (SMC) protocol. This global representation can then be anonymized. Our approach is not limited to specific anonymization algorithms but provides pre- and postprocessing for a broad spectrum of algorithms and many privacy criteria. We present an extensive analytical and experimental evaluation and discuss which types of methods and criteria are supported. Our prototype demonstrates the approach by implementing k-anonymity, ℓ-diversity, t-closeness and δ-presence with a globally optimal de-identification method in horizontally and vertically distributed setups. The experiments show that our method provides highly competitive performance and offers a practical and flexible solution for anonymizing distributed biomedical datasets. PMID:24333850
Graphical querying of model-driven spreadsheets
Cunha, Jácome Miguel Costa; Fernandes, João Paulo de Sousa Ferreira; Pereira, Rui Alexandre Afonso; Saraiva, João Alexandre
This paper presents a graphical interface to query modeldriven spreadsheets, based on experience with previous work and empirical studies in querying systems, to simplify query construction for typical end-users with little to no knowledge of SQL. We briefly show our previous text based model-driven querying system. Afterwards, we detail our graphical model-driven querying interface, explaining each part of the interface and showing an example. To validate our work, we executed an empirica...
Scalable Package Queries in Relational Database Systems
Brucato, Matteo; Beltran, Juan Felipe; Abouzied, Azza; Meliou, Alexandra
Traditional database queries follow a simple model: they define constraints that each tuple in the result must satisfy. This model is computationally efficient, as the database system can evaluate the query conditions on each tuple individually. However, many practical, real-world problems require a collection of result tuples to satisfy constraints collectively, rather than individually. In this paper, we present package queries, a new query model that extends traditional database queries to...
Directory of Open Access Journals (Sweden)
Full Text Available Continuous aggregation queries are used to monitor the changes in data with time varying for online decision making. For continuous queries low cost and scalable techniques used a network of aggregators. Individual node cannot by itself determine its inclusion in the query result for this a different algorithmic challenges from aggregate and selection queries are presented. At specific coherencies each data item can serve for a set of data aggregators. Technique involves disseminating query into sub query and sub queries are executed on the chosen data aggregators. We build a query cost model which can be used to estimate the number of refresh messages which is required to satisfy the client specified incoherency bound. Performance results shows that by our method the query can be executed using less than one third the messages required for existing schemes. Our adaptive strategy employs distributed decisions made by the distributed servers independently based on localized statistics collected by each server at runtime. When comparatively static environment, propose two motionless tree construction algorithms relying on apriori system statistics. These static trees can also be used as early trees in a dynamic environment and apply our schemes to both single- and multi object distribution. Our extensive performance study illustrate that the adaptive mechanisms.
Preserving Communities in Anonymized Social Networks
Directory of Open Access Journals (Sweden)
Alina Campan
Full Text Available Social media and social networks are embedded in our society to a point that could not have been imagined only ten years ago. Facebook, LinkedIn, and Twitter are already well known social networks that have a large audience in all age groups. The amount of data that those social sites gather from their users is continually increasing and this data is very valuable for marketing, research, and various other purposes. At the same time, this data usually contain a significant amount of sensitive information which should be protected against unauthorized disclosure. To protect the privacy of individuals, this data must be anonymized such that the risk of re-identification of specific individuals is very low. In this paper we study if anonymized social networks preserve existing communities from the original social networks. To perform this study, we introduce two approaches to measure the community preservation between the initial network and its anonymized version. In the first approach we simply count how many nodes from the original communities remained in the same community after the processes of anonymization and de-anonymization. In the second approach we consider the community preservation for each node individually. Specifically, for each node, we compare the original and final communities to which the node belongs. To anonymize social networks we use two models, namely, k-anonymity for social networks and k-degree anonymity. To determine communities in social networks we use an existing community detection algorithm based on modularity quality function. Our experiments on publically available datasets show that anonymized social networks satisfactorily preserve the community structure of their original networks.
Denney, Ewen W.; Naylor, Dwight; Pai, Ganesh
Querying a safety case to show how the various stakeholders' concerns about system safety are addressed has been put forth as one of the benefits of argument-based assurance (in a recent study by the Health Foundation, UK, which reviewed the use of safety cases in safety-critical industries). However, neither the literature nor current practice offer much guidance on querying mechanisms appropriate for, or available within, a safety case paradigm. This paper presents a preliminary approach that uses a formal basis for querying safety cases, specifically Goal Structuring Notation (GSN) argument structures. Our approach semantically enriches GSN arguments with domain-specific metadata that the query language leverages, along with its inherent structure, to produce views. We have implemented the approach in our toolset AdvoCATE, and illustrate it by application to a fragment of the safety argument for an Unmanned Aircraft System (UAS) being developed at NASA Ames. We also discuss the potential practical utility of our query mechanism within the context of the existing framework for UAS safety assurance.
Vaucouleur, Sebastien
We introduce code query by example for customisation of evolvable software products in general and of enterprise resource planning systems (ERPs) in particular. The concept is based on an initial empirical study on practices around ERP systems. We motivate our design choices based on those empirical results, and we show how the proposed solution helps with respect to the infamous upgrade problem: the conflict between the need for customisation and the need for upgrade of ERP systems. We further show how code query by example can be used as a form of lightweight static analysis, to detect automatically potential defects in large software products. Code query by example as a form of lightweight static analysis is particularly interesting in the context of ERP systems: it is often the case that programmers working in this field are not computer science specialists but more of domain experts. Hence, they require a simple language to express custom rules.
A Mechanism for Anonymous Credit Card Systems
Tamura, Shinsuke; Yanase, Tatsuro
This paper proposes a mechanism for anonymous credit card systems, in which each credit card holder can conceal individual transactions from the credit card company, while enabling the credit card company to calculate the total expenditures of transactions of individual card holders during specified periods, and to identify card holders who executed dishonest transactions. Based on three existing mechanisms, i.e. anonymous authentication, blind signature and secure statistical data gathering, together with implicit transaction links proposed here, the proposed mechanism enables development of anonymous credit card systems without assuming any absolutely trustworthy entity like tamper resistant devices or organizations faithful both to the credit card company and card holders.
Research Issues in Mobile Querying
DEFF Research Database (Denmark)
Breunig, M.; Jensen, Christian Søndergaard; Klein, M.; Zeitz, A.; Koloniari, G.; Grünbauer, J.; Marrón, P.J.; Panieyiotoa, C.; Boll, S.; Saltenis, Simonas; Sattler, K.-U.; Hauswirth, M.; Lehner, W.; Wolfson, O.
This document reports on key aspects of the discussions conducted within the working group. In particular, the document aims to offer a structured and somewhat digested summary of the group's discussions. The document first offers concepts that enable characterization of "mobile queries" as well ...... the types of systems that enable such queries. It explores the notion of context in mobile queries. The document ends with a few observations, mainly regarding challenges....
Query Expansion Strategy based on Pseudo Relevance Feedback and Term Weight Scheme for Monolingual Retrieval
Vaidyanathan, Rekha; Das, Sujoy; Srivastava, Namita
Query Expansion using Pseudo Relevance Feedback is a useful and a popular technique for reformulating the query. In our proposed query expansion method, we assume that relevant information can be found within a document near the central idea. The document is normally divided into sections, paragraphs and lines. The proposed method tries to extract keywords that are closer to the central theme of the document. The expansion terms are obtained by equi-frequency partition of the documents obtain...
Geospatial-Enabled RuleML in a Study on Querying Respiratory Disease Information
DEFF Research Database (Denmark)
Gao, Sheng; Boley, Harold; Mioc, Darka;
health data query and representation framework is proposed through the formalization of spatial information. We include the geometric representation in RuleML deduction, and apply ontologies and rules for querying and representing health information. Corresponding geospatial built-ins were implemented...... as an extension to OO jDREW. Case studies were carried out using geospatial-enabled RuleML queries for respiratory disease information. The paper thus demonstrates the use of RuleML for geospatial-semantic querying and representing of health information....
On describing human white matter anatomy: the white matter query language.
Wassermann, Demian; Makris, Nikos; Rathi, Yogesh; Shenton, Martha; Kikinis, Ron; Kubicki, Marek; Westin, Carl-Fredrik
The main contribution of this work is the careful syntactical definition of major white matter tracts in the human brain based on a neuroanatomist's expert knowledge. We present a technique to formally describe white matter tracts and to automatically extract them from diffusion MRI data. The framework is based on a novel query language with a near-to-English textual syntax. This query language allows us to construct a dictionary of anatomical definitions describing white matter tracts. The definitions include adjacent gray and white matter regions, and rules for spatial relations. This enables automated coherent labeling of white matter anatomy across subjects. We use our method to encode anatomical knowledge in human white matter describing 10 association and 8 projection tracts per hemisphere and 7 commissural tracts. The technique is shown to be comparable in accuracy to manual labeling. We present results applying this framework to create a white matter atlas from 77 healthy subjects, and we use this atlas in a proof-of-concept study to detect tract changes specific to schizophrenia. PMID:24505722
Complex dynamics of our economic life on different scales: insights from search engine query data.
Preis, Tobias; Reith, Daniel; Stanley, H Eugene
Search engine query data deliver insight into the behaviour of individuals who are the smallest possible scale of our economic life. Individuals are submitting several hundred million search engine queries around the world each day. We study weekly search volume data for various search terms from 2004 to 2010 that are offered by the search engine Google for scientific use, providing information about our economic life on an aggregated collective level. We ask the question whether there is a link between search volume data and financial market fluctuations on a weekly time scale. Both collective 'swarm intelligence' of Internet users and the group of financial market participants can be regarded as a complex system of many interacting subunits that react quickly to external changes. We find clear evidence that weekly transaction volumes of S&P 500 companies are correlated with weekly search volume of corresponding company names. Furthermore, we apply a recently introduced method for quantifying complex correlations in time series with which we find a clear tendency that search volume time series and transaction volume time series show recurring patterns. PMID:21078644
Reid, Jon
Native apps have distinct advantages, but the future belongs to mobile web apps that function on a broad range of smartphones and tablets. Get started with jQuery Mobile, the touch-optimized framework for creating apps that look and behave consistently across many devices. This concise book provides HTML5, CSS3, and JavaScript code examples, screen shots, and step-by-step guidance to help you build a complete working app with jQuery Mobile. If you're already familiar with the jQuery JavaScript library, you can use your existing skills to build cross-platform mobile web apps right now. This b
On Mobility Management in Multi-Sink Sensor Networks for Geocasting of Queries
Directory of Open Access Journals (Sweden)
Paul Havinga
Full Text Available In order to efficiently deal with location dependent messages in multi-sink wireless sensor networks (WSNs, it is key that the network informs sinks what geographical area is covered by which sink. The sinks are then able to efficiently route messages which are only valid in particular regions of the deployment. In our previous work (see the 5th and 6th cited documents, we proposed a combined coverage area reporting and geographical routing protocol for location dependent messages, for example, queries that are injected by sinks. In this paper, we study the case where we have static sinks and mobile sensor nodes in the network. To provide up-to-date coverage areas to sinks, we focus on handling node mobility in the network. We discuss what is a better method for updating the routing structure (i.e., routing trees and coverage areas to handle mobility efficiently: periodic global updates initiated from sinks or local updates triggered by mobile sensors. Simulation results show that local updating perform very well in terms of query delivery ratio. Local updating has a better scalability to increasing network size. It is also more energy efficient than ourpreviously proposed approach, where global updating in networks have medium mobility rate and speed.
Seeking Anonymity in an Internet Panopticon
Feigenbaum, Joan; Ford, Bryan
Obtaining and maintaining anonymity on the Internet is challenging. The state of the art in deployed tools, such as Tor, uses onion routing (OR) to relay encrypted connections on a detour passing through randomly chosen relays scattered around the Internet. Unfortunately, OR is known to be vulnerable at least in principle to several classes of attacks for which no solution is known or believed to be forthcoming soon. Current approaches to anonymity also appear unable to offer accurate, princi...
Privacy Preserving Quantum Anonymous Transmission via Entanglement Relay
Yang, Wei; Huang, Liusheng; Song, Fang
Anonymous transmission is an interesting and crucial issue in computer communication area, which plays a supplementary role to data privacy. In this paper, we put forward a privacy preserving quantum anonymous transmission protocol based on entanglement relay, which constructs anonymous entanglement from EPR pairs instead of multi-particle entangled state, e.g. GHZ state. Our protocol achieves both sender anonymity and receiver anonymity against an active adversary and tolerates any number of corrupt participants. Meanwhile, our protocol obtains an improvement in efficiency compared to quantum schemes in previous literature.
A Comparison of Anonymous versus Identifiable e-Peer Review on College Student Writing Performance and the Extent of Critical Feedback
Lu, Ruiling; Bol, Linda
Peer review has become commonplace in composition courses and is increasingly employed in the context of telecommunication technology. The purpose of this experiment was to compare the effects of anonymous and identifiable electronic peer (e-peer) review on college student writing performance and the extent of critical peer feedback. Participants…
Form and Function: The Impact of Query Term and Operator Usage on Web Search Results.
Lucas, Wendy; Topi, Heikki
Describes a study of college students that investigated Web-based search engine queries and compared relevancy ratings with expert-formulated queries. Considers the number of subject terms used and the use of Boolean operators and discuses the need for designing search engine interfaces that provide greater support in term selection and operator…
Robust Query Processing for Personalized Information Access on the Semantic Web
DEFF Research Database (Denmark)
Dolog, Peter; Stuckenschmidt, Heiner; Wache, Holger
Research in Cooperative Query answering is triggered by the observation that users are often not able to correctly formulate queries to databases that return the intended result. Due to a lack of knowledge of the contents and the structure of a database, users will often only be able to provide v...
Consciousness as a process of queries and answers in architectures based on in situ representations
Velde, Van der F.
Functional or access consciousness can be described as an ongoing dynamic process of queries and answers. Whenever we have an awareness of an object or its surroundings, it consists of the dynamic process that answers (implicit) queries like "What is the color or shape of the object?" or "What surro
Geospatial-Enabled RuleML in a Study on Querying Respiratory Disease Information
DEFF Research Database (Denmark)
Gao, Sheng; Boley, Harold; Mioc, Darka; Anton, François; Yi, Xialoun
A spatial component for health data can support spatial analysis and visualization in the investigation of health phenomena. Therefore, the utilization of spatial information in a Semantic Web environment will enhance the ability to query and to represent health data. In this paper, a semantic...... health data query and representation framework is proposed through the formalization of spatial information. We include the geometric representation in RuleML deduction, and apply ontologies and rules for querying and representing health information. Corresponding geospatial built-ins were implemented as...... an extension to OO jDREW. Case studies were carried out using geospatial-enabled RuleML queries for respiratory disease information. The paper thus demonstrates the use of RuleML for geospatial-semantic querying and representing of health information....
Anonymity And Accountability In Web Based Transactions
H.Jayasree; .Damodaram
Decreased privacy is an unavoidable consequence in the drive to make the world a more secure, safer place, according to some analysts. In the on-line world, the conflict between privacy and security manifests itself in a debate between anonymity and accountability. Balance between Anonymity and Accountability is a major concern in web based transactions. The protection of users' privacy when performing web-based transactions is an important factor in the acceptance and use of Internet and we...
Security and Anonymity of Bitcoin Payments
Korošec, Peter
This thesis presents the digital payment system Bitcoin. It describes the cryptography on which the system is based. Presented are the short history of the system and the principles of how it works. Highlighted are the state of anonymity that the system provides while making payments and the safety it guarantees while executing transactions. Within the context of anonymity, the state of masking the users identity within the payment system is described, together with warnings and mechanisms to...
Influence of characteristic X-ray of impurity element on anonymous spectral lines excited by hydrogen gas discharge source bombarding targets
International Nuclear Information System (INIS)
A series of low energy X-ray spectral lines which have constant energy have been detected in hydrogen gas discharge source bombarding targets. Their energy are 1.7 keV, 2.3 keV, 2.6 keV, 3.3 keV and 3.7 keV, respectively. These anonymous spectral lines can not be explained by the known theories. There are still possibilities that they are produced by potential impurity elements in targets or in the discharge chamber, although the energy of the anonymous spectral lines are close to the energy of the characteristic X-ray of some elements,such as Si, Ta, S, Cl, K, Ca and Ti, etc. In this paper, the origin of impurity elements in the experimental system are analyzed, the influence of impurity elements in the discharge chamber and targets on the new spectral lines are studied, and the target surface is analyzed by X-ray photoelectron spectroscopy. The study shows that the impurity elements have no influence on the generation of the anonymous spectral lines. The characteristics of the anonymous spectral lines need further experimental and theoretical study. (authors)
Wacks, R
Since the beginning of the digital area, privacy and anonymity have been impacted drastically (both, positively and negatively), by the different technologies developed for communications purposes. The broad possibilities that the Internet offers since its conception, makes it a mandatory target for those entities that are aiming to know and control the different channels of communication and the information that flows through. In this paper, we address the current threats against privacy and...
Mediated Traceable Anonymous Encryption
Izabachène, Malika; Pointcheval, David; Vergnaud, Damien
The notion of key privacy for asymmetric encryption schemes was formally defined by Bellare, Boldyreva, Desai and Pointcheval in 2001: it states that an eavesdropper in possession of a ciphertext is not able to tell which specifi key, out of a set of known public keys, is the one under which the ciphertext was created. Since anonymity can be misused by dishonest users, some situations could require a tracing authority capable of revoking key privacy when illegal behavior is detected. Prior wo...
A solution of spatial query processing and query optimization for spatial databases
Institute of Scientific and Technical Information of China (English)
YUAN Jie; XIE Kun-qing; MA Xiu-jun; ZHANG Min; SUN Le-bin
Recently, attention has been focused on spatial query language which is used to query spatial databases. A design of spatial query language has been presented in this paper by extending the standard relational database query language SQL. It recognizes the significantly different requirements of spatial data handling and overcomes the inherent problems of the application of conventional database query languages. This design is based on an extended spatial data model, including the spatial data types and the spatial operators on them. The processing and optimization of spatial queries have also been discussed in this design. In the end, an implementation of this design is given in a spatial query subsystem.
Similarity extraction mechanism concerning historical personalities based on SQL queries in an RDBMS environment
Barouchou, Alexandra; Dendrinos, Markos
An interesting issue in the domain of history of science and ideas is the concept of similarity of historical personalities. Similar objects of research of philosophers and scientists indicate prospective influences, caused either from one another's reading or meetings, communication or even cooperation. Key methodological role in the surfacing of the sought similarities play the keywords extracted from their works as well as their placement in a philosophical and scientific term taxonomy. The case study examined in the framework of this paper concerns scientists and philosophers, who lived in ancient Greece or Renaissance periods and dealt, in at least one work, with the subject God. All the available data (scientists, studies, recorded relations between scientists, keywords, and thematic hierarchy) have been organized in an RDBMS environment, aiming at the emergence of similarities and influences between scientists through properly created SQL queries based on date and thematic hierarchy criteria.
Quantum Private Query Protocol Based on Two Non-Orthogonal States
Directory of Open Access Journals (Sweden)
Yan Chang
Full Text Available We propose a loss tolerant quantum private query (QPQ protocol based on two non-orthogonal states and unambiguous state discrimination (USD measurement. By analyzing a two-point attack by a third party, we find that our protocol has a stronger ability to resist external attacks than G-protocol and Y-protocol. Our protocol requires a smaller number of compressions than that in G-protocol (Gao et al., Opt. Exp. 2012, 20, 17411–17420 and Y-protocol (Yan et al. Quant. Inf. Process. 2014, 13, 805–813, which means less post-processing. Our protocol shows better database security and user privacy compared with G-protocol.
Domainwise Web Page Optimization Based On Clustered Query Sessions Using Hybrid Of Trust And ACO For Effective Information Retrieval
Directory of Open Access Journals (Sweden)
Dr. Suruchi Chawla
Full Text Available Abstract In this paper hybrid of Ant Colony OptimizationACO and trust has been used for domainwise web page optimization in clustered query sessions for effective Information retrieval. The trust of the web page identifies its degree of relevance in satisfying specific information need of the user. The trusted web pages when optimized using pheromone updates in ACO will identify the trusted colonies of web pages which will be relevant to users information need in a given domain. Hence in this paper the hybrid of Trust and ACO has been used on clustered query sessions for identifying more and more relevant number of documents in a given domain in order to better satisfy the information need of the user. Experiment was conducted on the data set of web query sessions to test the effectiveness of the proposed approach in selected three domains Academics Entertainment and Sports and the results confirm the improvement in the precision of search results.
Anon-Pass: Practical Anonymous Subscriptions.
Lee, Michael Z; Dunn, Alan M; Katz, Jonathan; Waters, Brent; Witchel, Emmett
We present the design, security proof, and implementation of an anonymous subscription service. Users register for the service by providing some form of identity, which might or might not be linked to a real-world identity such as a credit card, a web login, or a public key. A user logs on to the system by presenting a credential derived from information received at registration. Each credential allows only a single login in any authentication window, or epoch. Logins are anonymous in the sense that the service cannot distinguish which user is logging in any better than random guessing. This implies unlinkability of a user across different logins. We find that a central tension in an anonymous subscription service is the service provider's desire for a long epoch (to reduce server-side computation) versus users' desire for a short epoch (so they can repeatedly "re-anonymize" their sessions). We balance this tension by having short epochs, but adding an efficient operation for clients who do not need unlinkability to cheaply re-authenticate themselves for the next time period. We measure performance of a research prototype of our protocol that allows an independent service to offer anonymous access to existing services. We implement a music service, an Android-based subway-pass application, and a web proxy, and show that adding anonymity adds minimal client latency and only requires 33 KB of server memory per active user. PMID:24504081
A Practical Approach for Scalable Conjunctive Query Answering on Acyclic {EL}^+ Knowledge Base
Mei, Jing; Liu, Shengping; Xie, Guotong; Kalyanpur, Aditya; Fokoue, Achille; Ni, Yuan; Li, Hanyu; Pan, Yue
Conjunctive query answering for {EL}^{++} ontologies has recently drawn much attention, as the Description Logic {EL}^{++} captures the expressivity of many large ontologies in the biomedical domain and is the foundation for the OWL 2 EL profile. In this paper, we propose a practical approach for conjunctive query answering in a fragment of {EL}^{++}, namely acyclic {EL}^+, that supports role inclusions. This approach can be implemented with low cost by leveraging any existing relational database management system to do the ABox data completion and query answering. We conducted a preliminary experiment to evaluate our approach using a large clinical data set and show our approach is practical.
A Simplistic Mechanism for Query Cost Optimization
Directory of Open Access Journals (Sweden)
Debopam De
Full Text Available The cost of a database query can be optimized so that a more efficient query can be generated. However not many tools are available which work independently to optimize the cost of a query. This article is based on a tool that we developed to serve the purpose. It uses an Oracle Database and Linear Programming Problem concepts to evaluate the optimum cost of the query and compares it with the original cost of the query that the user gives. The optimum cost can also be used to devise a new query which serves the same purpose as the original one and with reduced cost.
Flanagan, David
"As someone who uses jQuery on a regular basis, it was surprising to discover how much of the library I'm not using. This book is indispensable for anyone who is serious about using jQuery for non-trivial applications."-- Raffaele Cecco, longtime developer of video games, including Cybernoid, Exolon, and Stormlord jQuery is the "write less, do more" JavaScript library. Its powerful features and ease of use have made it the most popular client-side JavaScript framework for the Web. This book is jQuery's trusty companion: the definitive "read less, learn more" guide to the library. jQuery P
Boduch, Adam
Filled with a practical collection of recipes, jQuery UI Cookbook is full of clear, step-by-step instructions that will help you harness the powerful UI framework in jQuery. Depending on your needs, you can dip in and out of the Cookbook and its recipes, or follow the book from start to finish.If you are a jQuery UI developer looking to improve your existing applications, extract ideas for your new application, or to better understand the overall widget architecture, then jQuery UI Cookbook is a must-have for you. The reader should at least have a rudimentary understanding of what jQuery UI is
Different ways of providing anonymity
Glavač, Vesna
The aim of this thesis is to show the importance of security and anonymity on the internet by demonstrating the use of a SOCKS proxy. In theoretical part, properties of various security mechanisms are explored with focus on SOCKS protocol as one of the most widely used systems. Presented are the inner workings and different versions as well as advantages and drawbacks of the protocol. The paper tries to identify the simplest way of encrypting data traffic by using SOCKS protocol with SSH tunn...
SPIN Query Tools for De-identified Research on a Humongous Database
McDonald, Clement J.; Dexter, Paul; Schadow, Gunther; Chueh, Henry C.; Abernathy, Greg; Hook, John; Blevins, Lonnie; Overhage, J Marc; Jules J Berman
The Shared Pathology Informatics Network (SPIN), a research initiative of the National Cancer Institute, will allow for the retrieval of more than 4 million pathology reports and specimens. In this paper, we describe the special query tool as developed for the Indianapolis/Regenstrief SPIN node, integrated into the ever-expanding Indiana Network for Patient care (INPC). This query tool allows for the retrieval of de-identified data sets using complex logic, auto-coded final ...
Approximate dictionary queries
DEFF Research Database (Denmark)
Brodal, Gerth Stølting; Gasieniec, Leszek
Given a set of n binary strings of length m each. We consider the problem of answering d-queries. Given a binary query string of length m, a d-query is to report if there exists a string in the set within Hamming distance d of . We present a data structure of size O(nm) supporting 1-queries in ti...
Andrei Gomberg; Cesar Martinelli; Ricard Torres
In a social choice model with an infinite number of agents, there may occur "equal size" coalitions that a preference aggregation rule should treat in the same manner. We introduce an axiom of equal treatment with respect to a measure of coalition size and explore its interaction with common axioms of social choice. We show that, provided the measure space is sufficiently rich in coalitions of the same measure, the new axiom is the natural extension of the concept of anonymity, and in particu...
An Examination of Natural Language as a Query Formation Tool for Retrieving Information on E-Health from Pub Med.
Peterson, Gabriel M.; Su, Kuichun; Ries, James E.; Sievert, Mary Ellen C.
Discussion of Internet use for information searches on health-related topics focuses on a study that examined complexity and variability of natural language in using search terms that express the concept of electronic health (e-health). Highlights include precision of retrieved information; shift in terminology; and queries using the Pub Med…
An Anonymous Credit Card System
Androulaki, Elli; Bellovin, Steven
Credit cards have many important benefits; however, these same benefits often carry with them many privacy concerns. In particular, the need for users to be able to monitor their own transactions, as well as bank's need to justify its payment requests from cardholders, entitle the latter to maintain a detailed log of all transactions its credit card customers were involved in. A bank can thus build a profile of each cardholder even without the latter's consent. In this paper, we present a practical and accountable anonymous credit system based on ecash, with a privacy preserving mechanism for error correction and expense-reporting.
Foreword for the special issue of selected papers from the 7th EDBT/ICDT Workshop on Privacy and Anonymity in Information Society (PAIS 2014)
Traian Marius Truta; Li Xiong; Farshad Fotouhi
The seventh Workshop on Privacy and Anonymity in Information Society (PAIS 2014) was held in conjunction with the International Conference on Extending Database Technology (EDBT) and International Conference on Database Theory (ICDT) in Athens, Greece. The PAIS 2014 workshop provided an open yet focused platform for researchers and practitioners from fields such as computer science, statistics, healthcare informatics, and law to discuss and present current research challenges and advances ...
Information Privacy in the Marketspace: Implications for the Commercial Uses of Anonymity on the Web.
Hoffman, Donna L.; Novak, Thomas P.; Peralta, Marcos A.
Suggests that the primary barrier to successful commercial development of the Web is lack of consumer trust in the medium. Examines how customer concerns are affecting growth and development of consumeroriented commercial activity on the Web and investigates the implications of these concerns for potential industry response. Suggests that radical…
[Analysis of forensic-medical expert conclusions on rap and concealed rape (data from anonymous questionnaires)].
Pigolkin, Iu I; Dmitrieva, O A
Specific features of modern cases of raping are analyzed on the basis of the data of forensic medical obstetrical and gynecological expert evaluations carried out in the Primorye territory. Age and risk groups are defined, health status of victims is characterized, and specific injuries of the body and genitals are described. Specific features of concealed sexual violations in Vladivostok are defined and the need in creation of rehabilitation centers for victims of raping is discussed. PMID:11871331
Reflections on the Ritual process in Mexican Communities of Alcoholics Anonymous
Palacios Ramírez, José
The author conveys his reflections on the symbolic aspects and ritual character of the therapeutic communities of rehabilitation of alcoholics, known as "Alcoholic Anonymous" (AA). He did ethnographic fieldwork among AA communities of Ciudad Victoria, in Tamaulipas, northern Mexico. These communities, facing a problem often neglected by both government and society in Mexico, yet holding a position of subalternity and marginality in the country, offer a spiritual way out to those alcoholics wh...
基于 DAA 和 TLS 的匿名远程证明协议%Anonymous remote attestation protocol based on DAA and TLS
Institute of Scientific and Technical Information of China (English)
张大伟; 韩臻; 蒋逸尘; 黎妹红
To prevent the masquerading attack in the remote attestation with the direct anonymous at-testation (DAA ) ,a anonymous remote attestation protocol was proposed based on DAA and the transport layer security (TLS) protocol .The trusted platform module was utilized to measure the platform configuration and anonymous identity ,and the signature generated .The new identity au-thentication and certificate verification method were designed .The remote attestation information was transmitted with supplemental messages in TLS .The anonymous attestation ,integrity reporting and key agreement mechanisms were integrated so as to build a trusted anonymous channel .Security anal-ysis show s that our protocol satisfies unforgeability ,anonymity ,user-controllable linkability and un-cloneability in identity authentication as well as resists the replay attack and the masquerading attack . The proposed protocol is easily deployed because of the compatibility with the TLS extension frame-work .%为了解决使用直接匿名证明方法进行远程证明易受伪装攻击的问题,提出了一种基于直接匿名证明和安全传输层协议(TLS)的匿名远程证明协议。使用可信平台模块,完成平台配置和匿名身份的度量并生成签名信息;改进身份认证和证书校验机制,并使用T LS协议的扩展消息传输远程证明内容;结合匿名证明、完整性报告和密钥协商机制设计总体协议,从而在交互双方构建出匿名认证的可信信道。分析表明:改进方案满足身份认证的不可伪造性、匿名性、可控的可链接性和不可克隆性,能够抵御重放攻击和伪装攻击,且设计的协议兼容扩展的T LS协议架构,便于部署。
Anonymity, ethics and credibility in the blogosphere and on Twitter: gastronomic criticism in "Alhos, passas & maçãs" and in @carapuceiro
Renata Maria do Amaral
This article intends to understand the anonymous restaurant critic currently made on the Internet, based on the cases of the Alhos, passas & maçãs blog and the @carapuceiro Twitter. Before considered as personal diaries or means of communication among friends, today blogs and social networks have no limits – and, when used to criticize restaurants negatively, its impact reaches unpremeditated boundaries, including reactions of chefs and journalists themselves. At the same time that these tool...
Medical students' education on organ donation and its evaluation during six consecutive years: results of a voluntary, anonymous educational intervention study
Radunz, Sonia; Benkö, Tamás; Stern, Sabrina; Saner, Fuat H.; Paul, Andreas; Kaiser, Gernot M
Background One of the main reasons for organ shortage is insufficient education on organ donation. Knowledgeable medical students could share the information with friends and families resulting in a positive attitude to organ donation of the general public. Methods During six consecutive years (2009 to 2014), we conducted a voluntary, anonymous educational intervention study on organ donation among fourth year medical students in the course of the main surgery lecture at the University of Ess...
Unintended Effects of Anonymous Resumes
Behaghel, Luc; Crépon, Bruno; Le Barbanchon, Thomas
We evaluate an experimental program in which the French public employment service anonymized resumes for firms that were hiring. Firms were free to participate or not; participating firms were then randomly assigned to receive either anonymous resumes or name-bearing ones. We find that participating firms become less likely to interview and hire minority candidates when receiving anonymous resumes. We show how these unexpected results can be explained by the self-selection of firms into the p...
Reflections on the Ritual process in Mexican Communities of Alcoholics Anonymous
Directory of Open Access Journals (Sweden)
Palacios Ramírez, José
Full Text Available The author conveys his reflections on the symbolic aspects and ritual character of the therapeutic communities of rehabilitation of alcoholics, known as "Alcoholic Anonymous" (AA. He did ethnographic fieldwork among AA communities of Ciudad Victoria, in Tamaulipas, northern Mexico. These communities, facing a problem often neglected by both government and society in Mexico, yet holding a position of subalternity and marginality in the country, offer a spiritual way out to those alcoholics who approach them. Their activities are of interest for a discussion of ritual in current contexts. In addition, the communities are illuminating for many of the key aspects of the comparative ethnographic analysis of ritual.
El objeto de este trabajo es apuntar algunas líneas de reflexión sobre los aspectos simbólicos y de carácter ritual que presentan las comunidades terapéuticas de rehabilitación de alcohólicos, Alcohólicos Anónimos (AA. Para ello parto del trabajo de campo etnográfico realizado en agrupaciones de AA en Ciudad Victoria, Tamaulipas, al norte de México. Estas comunidades de apoyo a alcohólicos, desde una posición de subalternidad y marginalidad, ante una problemática casi siempre obviada por la sociedad y el gobierno mexicano, ofrecen una "salida" de corte espiritual a quienes se acercan a ellas, por lo que resultan interesantes para la reflexión sobre el ritual en contextos actuales. Por otro lado, estas comunidades presentan muchos de los aspectos clave en el análisis etnográfico comparativo de los ritos.
A Web 2.0 Application for Executing Queries and Services on Climatic Data
Abad-Mota, S.; Ruckhaus, E.; Garboza, A.; Tepedino, G.
aggregation, hourly, daily, monthly, so that they can be provided to the user at the desired level. This means that additional caution has to be exercised in query answering, in order to distinguish between primary and derived data. On the other hand, a Web 2.0 application is being designed to provide a front-end to the repository. This design focuses on two important aspects: the use of metadata structures, and the definition of collaborative Web 2.0 features that can be integrated to a project of this nature. Metadata descriptors include for a set of measurements, its quality, granularity and other dimension information. With these descriptors it is possible to establish relationships between different sets of measurements and provide scientists with efficient searching mechanisms that determine the related sets of measurements that contribute to a query answer. Unlike traditional applications for climatic data, our approach not only satisfies requirements of researchers specialized in this domain, but also those of anyone interested in this area; one of the objectives is to build an informal knowledge base that can be improved and consolidated with the usage of the system.
Reading (and Not Reading Anonymity: Daniel Defoe, An Essay on the Regulation of the Press and A Vindication of the Press
Directory of Open Access Journals (Sweden)
Mark Vareschi
Full Text Available In this essay I take up the anonymous An Essay on the Regulation of the Press (1704 and A Vindication of the Press (1718, both regularly attributed to Daniel Defoe. While the pamphlets themselves consider anonymity essential to a work being read and interpreted, paradoxically, twentieth- and twenty-first century critics insist on correct attribution as the starting point for interpretation. The consequences and benefits of authorial attribution to these, and other, minor works are not insignificant. The attribution of authorship to a known author ensures that a work will survive; it may even ensure that a work is subject to study and analysis. However, authorial attribution may also foreclose study and analysis because the attributed work, if it is to be by the named author, must be made to cohere within a larger body of work.
SCRY: Enabling quantitative reasoning in SPARQL queries
Meroño-Peñuela, A.; Stringer, Bas; Loizou, Antonis; Abeln, Sanne; Heringa, Jaap
The inability to include quantitative reasoning in SPARQL queries slows down the application of Semantic Web technology in the life sciences. SCRY, our SPARQL compatible service layer, improves this by executing services at query time and making their outputs query-accessible, generating RDF data on
Nearest Neighbor Queries in Road Networks
DEFF Research Database (Denmark)
Jensen, Christian Søndergaard; Kolar, Jan; Pedersen, Torben Bach;
in road networks. Such queries may be of use in many services. Specifically, we present an easily implementable data model that serves well as a foundation for such queries. We also present the design of a prototype system that implements the queries based on the data model. The algorithm used...
Research of Query Translation on Deep Web%Deep Web搜索中查询转换的研究
Institute of Scientific and Technical Information of China (English)
邵秀丽; 李云龙; 张文龙
The mapping mechanism of query translation has been advanced, which is based on synonymous attributes and group attributes. The problem of how to realize the more accurate comprehensive mapping from the source query string to the target query string has been solved. The query substring to each source site for the realization of retrieval has been provided, the solution of this paper has been applied to 20 representative Deep Web sites which are selected from domestic books area, and the Deep Web search to these sites* book information is implemented.%基于同义属性和成组属性给出了查询转换映射机制,解决了如何从源查询串到目标查询串的较为准确的映射,实现了检索对应各源网址的转换查询子串,相应的方案应用于国内20个代表性的图书领域的DeepWeb站点,较好地实现了对这些站点的Deep Web图书信息的搜索.
Online Piracy, Anonymity and Social Change – Deviance Through Innovation
Larsson, Stefan; Svensson, Måns; Kaminski, Marcin
This article analyses current trends in the use of anonymity services among younger Swedes (15-25) and focuses on individuals engaging in illegal file sharing in order to better understand the rationale behind both file sharing as well as online anonymity, especially in relation to enforcement of copyright. By comparing the findings of a survey conducted on three different occasions (early 2009, late 2009 and early 2012), we measure the fluctuations in the use of anonymity services among appr...
A peer-to-peer music sharing system based on query-by-humming
Wang, Jianrong; Chang, Xinglong; Zhao, Zheng; Zhang, Yebin; Shi, Qingwei
Today, the main traffic in peer-to-peer (P2P) network is still multimedia files including large numbers of music files. The study of Music Information Retrieval (MIR) brings out many encouraging achievements in music search area. Nevertheless, the research of music search based on MIR in P2P network is still insufficient. Query by Humming (QBH) is one MIR technology studied for years. In this paper, we present a server based P2P music sharing system which is based on QBH and integrated with a Hierarchical Index Structure (HIS) to enhance the relation between surface data and potential information. HIS automatically evolving depends on the music related items carried by each peer such as midi files, lyrics and so forth. Instead of adding large amount of redundancy, the system generates a bit of index for multiple search input which improves the traditional keyword-based text search mode largely. When network bandwidth, speed, etc. are no longer a bottleneck of internet serve, the accessibility and accuracy of information provided by internet are being more concerned by end users.
Anonymous Fingerprinting with Robust QIM Watermarking Techniques
Directory of Open Access Journals (Sweden)
R. L. Lagendijk
Full Text Available Fingerprinting is an essential tool to shun legal buyers of digital content from illegal redistribution. In fingerprinting schemes, the merchant embeds the buyer's identity as a watermark into the content so that the merchant can retrieve the buyer's identity when he encounters a redistributed copy. To prevent the merchant from dishonestly embedding the buyer's identity multiple times, it is essential for the fingerprinting scheme to be anonymous. Kuribayashi and Tanaka, 2005, proposed an anonymous fingerprinting scheme based on a homomorphic additive encryption scheme, which uses basic quantization index modulation (QIM for embedding. In order, for this scheme, to provide sufficient security to the merchant, the buyer must be unable to remove the fingerprint without significantly degrading the purchased digital content. Unfortunately, QIM watermarks can be removed by simple attacks like amplitude scaling. Furthermore, the embedding positions can be retrieved by a single buyer, allowing for a locally targeted attack. In this paper, we use robust watermarking techniques within the anonymous fingerprinting approach proposed by Kuribayashi and Tanaka. We show that the properties of an additive homomorphic cryptosystem allow for creating anonymous fingerprinting schemes based on distortion compensated QIM (DC-QIM and rational dither modulation (RDM, improving the robustness of the embedded fingerprints. We evaluate the performance of the proposed anonymous fingerprinting schemes under additive-noise and amplitude-scaling attacks.
Molinaro, Marco
In the query-commit problem we are given a graph where edges have distinct probabilities of existing. It is possible to query the edges of the graph, and if the queried edge exists then its endpoints are irrevocably matched. The goal is to find a querying strategy which maximizes the expected size of the matching obtained. This stochastic matching setup is motivated by applications in kidney exchanges and online dating. In this paper we address the query-commit problem from both theoretical and experimental perspectives. First, we show that a simple class of edges can be queried without compromising the optimality of the strategy. This property is then used to obtain in polynomial time an optimal querying strategy when the input graph is sparse. Next we turn our attentions to the kidney exchange application, focusing on instances modeled over real data from existing exchange programs. We prove that, as the number of nodes grows, almost every instance admits a strategy which matches almost all nodes. This resu...
Querying Versioned Software Repositories
Christopeit, Dietrich; Böhlen, Michael; Kanne, Carl-Christian; Mazeika, Arturas
Large parts of today's data is stored in text documents that undergo a series of changes during their lifetime. For instance during the development of a software product the source code changes frequently. Currently, managing such data relies on version control systems (VCSs). Extracting information from large documents and their different versions is a manual and tedious process. We present {\\sc Qvestor}, a system that allows to declaratively query docume...
Querying versioned software repositories
Christopeit, Dietrich; Böhlen, Michael H.; Kanne, Carl-Christian; Mazeika, Arturas
Large parts of today's data is stored in text documents that undergo a series of changes during their lifetime. For instance during the development of a software product the source code changes frequently. Currently, managing such data relies on version control systems (VCSs). Extracting information from large documents and their different versions is a manual and tedious process. We present Qvestor, a system that allows to declaratively query documents. It leverages information about the str...
Co-occurrence Relation of DNS Queries Based Research on Botnet Activities
Directory of Open Access Journals (Sweden)
Zhiwen Wang
Full Text Available As a new platform for launching attacks collectively, botnets have been considered as the leading security threat to the Internet in the literature. Previous works focus on how to detect zombies via some of the behavioral patterns of botnets. However, it's an important and challenging task to track the network activities of the zombies so as to have an insight into the global view of "what those zombies do" besides "who those zombies are" since it's an exclusively nature of botnets to stay stealthy when conducting various malicious activities as long as possible. In this paper, an improved approach is proposed to handle this new problem based on co-occurrence relation of DNS queries with full consideration of the spatial and temporal properties of botnet activities. The approach excludes noise made by NAT, and distinguishes domains with co-occurrence relation by botnet activities from them by normal user activation, according to the spatial dimensions and time dimensions. Then, we validate the approach using DNS traffic in real network. The experimental result shows it can eliminate the NAT interference, significantly reduce the amount of data and improve the discovery of unknown botnet domain exceptionalness, we analysis main factors whish impact the approach, and then proposed treatment strategies correspondingly.
QuerySpaces on Hadoop for the ATLAS EventIndex
Hrivnac, Julius; The ATLAS collaboration; Cranshaw, Jack; Glasman, Claudia; Favareto, Andrea; Prokoshin, Fedor
Hadoop-based implementation of the adaptive query engine serving as the back-end for the ATLAS EventIndex. The QuerySpaces implementation handles both original data and search results providing fast and efficient mechanisms for new user queries using already accumulated knowledge for optimisation. Detailed description and statistics about user requests are collected in HBase tables and HDFS files. Requests are associated to their results and a graph of relations between them is created to be used to find the most efficient way of providing answers to new requests The environment is completely transparent to users and is accessible over several command-line interfaces, a Web Service and a programming API.
QuerySpaces on Hadoop for the ATLAS EventIndex
Hrivnac, Julius; The ATLAS collaboration; Cranshaw, Jack; Favareto, Andrea; Prokoshin, Fedor; Glasman, Claudia; Toebbicke, Rainer
A Hadoop-based implementation of the adaptive query engine serving as the back-end for the ATLAS EventIndex. The QuerySpaces implementation handles both original data and search results providing fast and efficient mechanisms for new user queries using already accumulated knowledge for optimization. Detailed descriptions and statistics about user requests are collected in HBase tables and HDFS files. Requests are associated to their results and a graph of relations between them is created to be used to find the most efficient way of providing answers to new requests The environment is completely transparent to users and is accessible over several command-line interfaces, a Web Service and a programming API.
基于PMI属性证书的匿名认证方案%Anonymous Authentication Scheme based-on AC of PMI
Institute of Scientific and Technical Information of China (English)
贺靖靖; 刘景森; 史强
随着计算机网络迅速发展,网络交易也越来越普遍,然而在交易过程中,用户身份认证,访问控制及其授权管理成为系统关注的焦点。与此同时,人们对自己的隐私信息更为关注,用户希望通过匿名的方式访问资源。因此,如何实现用户对资源的匿名访问,是一个需要解决的问题。提出了一个基于PMI属性证书的匿名认证方案,实现了对资源的匿名访问。理论分析证明,该方案具有安全性、匿名性和不关联性,可追踪性。%With the rapid development of the computer network,the network transaction is becoming more and more popular, however, in the process of transaction user authentication, access control and its authorized management has become the focus of the system.At the same time, people pay more attention on their own privacy information; users want to access resources through anonymous way. Therefore, how to realize the anonymous access resources is a problem to be solved. This paper proposes a system which based on PMI' s attribute certificates to realize the anonymous access. Theoretical analysis shows that this solution provides the security, anonymity and no relevance,traceability.
Multi-Dimensional Path Queries
DEFF Research Database (Denmark)
Bækgaard, Lars
to create nested path structures. We present an SQL-like query language that is based on path expressions and we show how to use it to express multi-dimensional path queries that are suited for advanced data analysis in decision support environments like data warehousing environments......We present the path-relationship model that supports multi-dimensional data modeling and querying. A path-relationship database is composed of sets of paths and sets of relationships. A path is a sequence of related elements (atoms, paths, and sets of paths). A relationship is a binary path that...
Recommendation Sets and Choice Queries
DEFF Research Database (Denmark)
Viappiani, Paolo Renato; Boutilier, Craig
the problem of generating optimal recommendation sets and the problem of generating optimal choice queries, considering both Bayesian and regret-based elicitation. Our results show that, somewhat surprisingly, under very general circumstances, the optimal recommendation set coincides with the optimal......Utility elicitation is an important component of many applications, such as decision support systems and recommender systems. Such systems query users about their preferences and offer recommendations based on the system's belief about the user's utility function. We analyze the connection between...... query....
Secure Electronic Cash Scheme with Anonymity Revocation
Directory of Open Access Journals (Sweden)
Baoyuan Kang
Full Text Available In a popular electronic cash scheme, there are three participants: the bank, the customer, and the merchant. First, a customer opens an account in a bank. Then, he withdraws an e-cash from his account and pays it to a merchant. After checking the electronic cash's validity, the merchant accepts it and deposits it to the bank. There are a number of requirements for an electronic cash scheme, such as, anonymity, unforgeability, unreusability, divisibility, transferability, and portability. Anonymity property of electronic cash schemes can ensure the privacy of payers. However, this anonymity property is easily abused by criminals. In 2011, Chen et al. proposed a novel electronic cash system with trustee-based anonymity revocation from pairing. On demand, the trustee can disclose the identity for e-cash. But, in this paper we point out that Chen et al.'s scheme is subjected to some drawbacks. To contribute secure electronic cash schemes, we propose a new offline electronic cash scheme with anonymity revocation. We also provide the formally security proofs of the unlinkability and unforgeability. Furthermore, the proposed scheme ensures the property of avoiding merchant frauds.
Nymble: Blocking Misbehaving Users inAnonymizing Networks
Directory of Open Access Journals (Sweden)
Dipali V. Yelane
Full Text Available Anonymizing networks such as Tor allow users to access Internet services privately by using a series of routers to hide the client'sIP address from the server. The success of such networks, however, has been limited by users employing this anonymity for abusive purposes such as defacing popular websites. Website administrators routinely rely on IP-address blocking for disabling access to misbehaving users, but blocking IP addresses is not practical if the abuser routes through an anonymizing network. As a result, administrators block a l known exit nodes of anonymizing networks, denying anonymous access to misbehaving and behaving users alike. To address this problem, we present Nymble, a system in which servers can "blacklist" misbehaving users, thereby blocking users without compromising their anonymity.Our system is thus agnostic to different servers' definitions of misbehavior — servers can blacklist users for whatever reason, and the privacy of blacklisted users is maintained.
SPIN query tools for de-identified research on a humongous database.
McDonald, Clement J; Dexter, Paul; Schadow, Gunther; Chueh, Henry C; Abernathy, Greg; Hook, John; Blevins, Lonnie; Overhage, J Marc; Berman, Jules J
The Shared Pathology Informatics Network (SPIN), a research initiative of the National Cancer Institute, will allow for the retrieval of more than 4 million pathology reports and specimens. In this paper, we describe the special query tool as developed for the Indianapolis/Regenstrief SPIN node, integrated into the ever-expanding Indiana Network for Patient care (INPC). This query tool allows for the retrieval of de-identified data sets using complex logic, auto-coded final diagnoses, and intrinsically supports multiple types of statistical analyses. The new SPIN/INPC database represents a new generation of the Regenstrief Medical Record system - a centralized, but federated system of repositories. PMID:16779093
Challenges of Anonymous Communication: Bridging Gaps between Theory and Practice
Westermann, Benedikt
Anonymous communication is an important building block for privacy enhancing technologies and in addition to this, the deployed anonymity networks have become important tools to protect the users' privacy in the Internet where hundreds of thousands of users rely on them. During the last decades, researchers have investigated the security aspects of anonymous communication networks. One important research methodology is the investigation of attacks which helps to understand the security proper...
基于隐私决策度的改进k-匿名算法%Improved Algorithm of k-anonymity Based on Degree of Privacy Preservation
Institute of Scientific and Technical Information of China (English)
申艳光; 闫晶星; 刘永红; 郭高尚
现有的匿名化隐私保护技术在进行数据发布和数据共享前对于敏感属性的个性化隐私保护的支持存在不足,为了实现更为合理的个性化隐私保护,结合粒计算粗糙集理论和k-匿名理论的最新研究成果,针对电子商务中隐私保护个性化决策选择度的不同,从粒化角度出发,提出一种基于隐私决策度的改进k-匿名算法。经实验验证,该算法更好的实现了隐私保护的个性化,同时其隐私保护精度方面优于已有的p-Sensitive k-匿名算法。%In the existing anonymous privacy protection technology, there is a shortage of personalized privacy protection support for sensitive attributes before data release and sharing. In order to achieve more reasonable personalized privacy preservation and improve the precision of privacy preservation, this paper reviewed the latest researches in granular computing theory, rough set theory and k-anonymity theory, and presented an improved algorithm of k-anonymity based on the personalized decision degree of privacy preservation, in view of different personalized granularity decision selectivity of privacy preservation in E-business.The experimental results show that the novel algorithm can achieve privacy preservation with more reasonable personalization, and its accuracy of privacy preservation is superior to p-sensitive k-anonymity algorithm.
GeoVanet: A Routing Protocol for Query Processing in Vehicular Networks
Directory of Open Access Journals (Sweden)
Thierry Delot
Full Text Available In a vehicular ad hoc network (VANET, cars can exchange information by using short-range wireless communications. Along with the opportunities offered by vehicular networks, a number of challenges also arise. In particular, most works so far have focused on a push model, where potentially useful data are pushed towards vehicles. The use of pull models, that would allow users to send queries to a set of cars in order to find the desired information, has not been studied in depth. The main challenge for pull models is the difficulty to route the different results towards the query originator in a highly dynamic network where the nodes move very quickly. To solve this issue, we propose GeoVanet, an anonymous and non-intrusive geographic routing protocol which ensures that the sender of a query can get a consistent answer. Our goal is to ensure that the user will be able to retrieve the query results within a bounded time. To prove the effectiveness of GeoVanet, an extensive experimental evaluation has been performed, that proves the interest of the proposal for both rural and urban areas. It shows that up to 80% of the available query results are delivered to the user.
Anonymous Authentication Scheme Based on Role Model of PMI%基于PMI角色模型的匿名认证方案
Institute of Scientific and Technical Information of China (English)
贺靖靖; 刘景森; 史强; 傅慧明
隐私保护是当前网络应用中最受关注的问题之一,越来越多的用户希望加强隐私保护,在不泄露个人敏感信息的情况下实现资源访问.针对匿名访问控制提出了一种基于PKI/PMI证书的认证方案,即在用户和服务提供者之间引入可信第三方,利用角色说明属性证书RS-AC和角色分配属性证书RA-AC,实现匿名认证.理论分析证明,该方案具有安全性、匿名性和不关联性.%Nowadays,the privacy protection is one of the most concerned problems. More and more users want to strengthen their own privacy preservation and hope that they can access the resources without providing personal sensitive informations. An anonymous access control scheme is proposed which is based on PKI/PMI certificates. The trusted third party is introduced between users and the service provider. The role stated-attribute certificate(RS-AC) and role assigned attribute certificate(RA-AC) are used to implement the anonymous authentication. Theoretical analysis shows that this solution provides the security,anonymity and no relevance.
York, Richard
Newly revised and updated resource on jQuery's many features and advantages Web Development with jQuery offers a major update to the popular Beginning JavaScript and CSS Development with jQuery from 2009. More than half of the content is new or updated, and reflects recent innovations with regard to mobile applications, jQuery mobile, and the spectrum of associated plugins. Readers can expect thorough revisions with expanded coverage of events, CSS, AJAX, animation, and drag and drop. New chapters bring developers up to date on popular features like jQuery UI, navigation, tables, interacti
Query Optimization Architecture for Data Grid Environment
Directory of Open Access Journals (Sweden)
Ayouni Houssam Eddine
Full Text Available Query optimization in data integration systems over large scale network, faces the challenges of dealing with autonomous, heterogeneous and distributed data sources, dynamic execution environment and changing user requirements. In this paper we introduce system architecture for query optimization. The latter consists of several important phases. We introduce also a cost model to calculate the cost of query execution. In order to optimize the cost of query processing considering the constraints in grid environment, an execution model based on mobile agents for efficient execution of binary relational operators (join of the query is determined based on the cost model. Finally the paper tests our approach through experiment.
On the Delusiveness of Adopting a Common Space for Modeling IR Objects: Are Queries Documents?
Bollmann-Sdorra, Peter; Raghavan, Vjay V.
Proposes that document space and query space have different structures in information retrieval and discusses similarity measures, term independence, and linear structure. Examples are given using the retrieval functions of dot-product, the cosine measure, the coefficient of Jaccard, and the overlap function. (Contains 28 references.) (LRW)
Design of an On-Line Query Language for Full Text Patent Search.
Glantz, Richard S.
The design of an English-like query language and an interactive computer environment for searching the full text of the U.S. patent collection are discussed. Special attention is paid to achieving a transparent user interface, to providing extremely broad search capabilities (including nested substitution classes, Kleene star events, and domain…
Blocking Misbehaving Users in Anonymizing Networks
DEFF Research Database (Denmark)
Banoth, Rajkumar
Internet services can be accessed privately through anonymizing networks like Tor. A set of routers are used to achieve this in order to hide the identity of client from server. The users of such networks often indulge into malicious activities and cause damage to popular web applications. The...... administrators of those web sites do block the IP address from which the request comes. This is not the practical solution as the hackers operate through anonymous networks. Blocking a node based on IP address will cau se misbehaving and genuine users to lost access to the web sites. This is the problem in the...... existing systems and motivation to take up this research work. The proposed system develops a security mechanism that ensures that only the misbehaving users are blackl isted while genuine users and their anonymity are preserved. Even though the misbehaving users are blacklisted, their privacy is still...
The role of economics in the QUERI program: QUERI Series
Directory of Open Access Journals (Sweden)
Smith Mark W
Full Text Available Abstract Background The United States (U.S. Department of Veterans Affairs (VA Quality Enhancement Research Initiative (QUERI has implemented economic analyses in single-site and multi-site clinical trials. To date, no one has reviewed whether the QUERI Centers are taking an optimal approach to doing so. Consistent with the continuous learning culture of the QUERI Program, this paper provides such a reflection. Methods We present a case study of QUERI as an example of how economic considerations can and should be integrated into implementation research within both single and multi-site studies. We review theoretical and applied cost research in implementation studies outside and within VA. We also present a critique of the use of economic research within the QUERI program. Results Economic evaluation is a key element of implementation research. QUERI has contributed many developments in the field of implementation but has only recently begun multi-site implementation trials across multiple regions within the national VA healthcare system. These trials are unusual in their emphasis on developing detailed costs of implementation, as well as in the use of business case analyses (budget impact analyses. Conclusion Economics appears to play an important role in QUERI implementation studies, only after implementation has reached the stage of multi-site trials. Economic analysis could better inform the choice of which clinical best practices to implement and the choice of implementation interventions to employ. QUERI economics also would benefit from research on costing methods and development of widely accepted international standards for implementation economics.
Provenance for Aggregate Queries
Yael Amsterdamer; Daniel Deutch; Val Tannen
We study in this paper provenance information for queries with aggregation. Provenance information was studied in the context of various query languages that do not allow for aggregation, and recent work has suggested to capture provenance by annotating the different database tuples with elements of a commutative semiring and propagating the annotations through query evaluation. We show that aggregate queries pose novel challenges rendering this approach inapplicable. Consequently, we propose...
Efficient Query Rewrite for Structured Web Queries
Gollapudi, Sreenivas; Ntoulas, Alexandros; Paparizos, Stelios
Web search engines and specialized online verticals are increasingly incorporating results from structured data sources to answer semantically rich user queries. For example, the query \\WebQuery{Samsung 50 inch led tv} can be answered using information from a table of television data. However, the users are not domain experts and quite often enter values that do not match precisely the underlying data. Samsung makes 46- or 55- inch led tvs, but not 50-inch ones. So a literal execution of the above mentioned query will return zero results. For optimal user experience, a search engine would prefer to return at least a minimum number of results as close to the original query as possible. Furthermore, due to typical fast retrieval speeds in web-search, a search engine query execution is time-bound. In this paper, we address these challenges by proposing algorithms that rewrite the user query in a principled manner, surfacing at least the required number of results while satisfying the low-latency constraint. We f...
Anon-Pass: Practical Anonymous Subscriptions
Lee, Michael Z.; Dunn, Alan M.; Katz, Jonathan; Waters, Brent; Witchel, Emmett
We present the design, security proof, and implementation of an anonymous subscription service. Users register for the service by providing some form of identity, which might or might not be linked to a real-world identity such as a credit card, a web login, or a public key. A user logs on to the system by presenting a credential derived from information received at registration. Each credential allows only a single login in any authentication window, or epoch. Logins are anonymous in the sen...
本体的查询与推理研究%Research on Ontology Querying and Inference
Institute of Scientific and Technical Information of China (English)
王晓慧; 罗军; 余淑良
Nowadays,computer network is widely used in various aspects of life. But searching for what people need from the mass information has a lot of questions. Consequently,the concept of ontology has appeared. And then ontology querying and inference is the important component of the application based on ontology. The purposes of this research are to make the knowledge to the fullest expression and querying the information more accurate and complete. Firstly, introduced the concept of ontology and constructed an ontology model. Then used ontology query language,SPARQL,to query me existed model. And also used SWRL to extend the semantic rules. Finally,introduced lena with which obtained more knowledge by reasoning on the model. Thus concluded,in the process of querying and inference with SPARQL and Jena,inference could develop the ability of querying,and the rules were the key to increase the power of inference.%现今,计算机网络被广泛应用于生活的方方面面,而从海量的信息中搜寻出人们所需要的还存在诸多问题,于是产生了本体的概念.而本体的查询和推理是基于本体的应用中重要的组成部分,研究的目的是为了使知识得以充分表达并且对信息的查询更加精确、完备.首先介绍了本体的概念并建立本体模型,然后用本体查询语言SPARQL对已有模型进行查询并用SWRL对模型进行语义规则的扩充;最后介绍了Jena,并对本体模型进行推理,由此获得了更多知识.结论就是,在利用SPARQL和Jena进行查询与推理的过程中,推理将提高查询能力,而规则是提高推理能力的关键.
A novel informatics concept for high-throughput shotgun lipidomics based on the molecular fragmentation query language
Herzog, Ronny; Schwudke, Dominik; Schuhmann, Kai; Sampaio, Julio L; Bornstein, Stefan R; Schroeder, Michael; Shevchenko, Andrej
Shotgun lipidome profiling relies on direct mass spectrometric analysis of total lipid extracts from cells, tissues or organisms and is a powerful tool to elucidate the molecular composition of lipidomes. We present a novel informatics concept of the molecular fragmentation query language implemented within the LipidXplorer open source software kit that supports accurate quantification of individual species of any ionizable lipid class in shotgun spectra acquired on any mass spectrometry plat...
An Efficient Query Rewriting Approach for Web Cached Data Management
Institute of Scientific and Technical Information of China (English)
With the internet development, querying data on the Web is an attention problem of involving information from distributed, and often dynamically, related Web sources. Basically, some sub-queries can be effectively cached from previous queries or materialized views in order to achieve a better query performance based on the notion of rewriting queries. In this paper, we propose a novel query-rewriting model, called Hierarchical Query Tree, for representing Web queries. Hierarchical Query Tree is a labeled tree that is suitable for representing the inherent hierarchy feature of data on the Web. Based on Hierarchical Query Tree, we use case-based approach to determine what the query results should be. The definitions of queries and query results are both represented as labeled trees. Thus, we can use the same model for representing cases and the medium query results can also be dynamically updated by the user queries. We show that our case-based method can be used to answer a new query based on the combination of previous queries, including changes of requirements and various information sources.
Querying phenotype-genotype relationships on patient datasets using semantic web technology: the example of cerebrotendinous xanthomatosis
Directory of Open Access Journals (Sweden)
Taboada María
Full Text Available Abstract Background Semantic Web technology can considerably catalyze translational genetics and genomics research in medicine, where the interchange of information between basic research and clinical levels becomes crucial. This exchange involves mapping abstract phenotype descriptions from research resources, such as knowledge databases and catalogs, to unstructured datasets produced through experimental methods and clinical practice. This is especially true for the construction of mutation databases. This paper presents a way of harmonizing abstract phenotype descriptions with patient data from clinical practice, and querying this dataset about relationships between phenotypes and genetic variants, at different levels of abstraction. Methods Due to the current availability of ontological and terminological resources that have already reached some consensus in biomedicine, a reuse-based ontology engineering approach was followed. The proposed approach uses the Ontology Web Language (OWL to represent the phenotype ontology and the patient model, the Semantic Web Rule Language (SWRL to bridge the gap between phenotype descriptions and clinical data, and the Semantic Query Web Rule Language (SQWRL to query relevant phenotype-genotype bidirectional relationships. The work tests the use of semantic web technology in the biomedical research domain named cerebrotendinous xanthomatosis (CTX, using a real dataset and ontologies. Results A framework to query relevant phenotype-genotype bidirectional relationships is provided. Phenotype descriptions and patient data were harmonized by defining 28 Horn-like rules in terms of the OWL concepts. In total, 24 patterns of SWQRL queries were designed following the initial list of competency questions. As the approach is based on OWL, the semantic of the framework adapts the standard logical model of an open world assumption. Conclusions This work demonstrates how semantic web technologies can be used to support
Efficient caching for constrained skyline queries
DEFF Research Database (Denmark)
Mortensen, Michael Lind; Chester, Sean; Assent, Ira; Magnani, Matteo
Constrained skyline queries retrieve all points that optimize some user's preferences subject to orthogonal range constraints, but at significant computational cost. This paper is the first to propose caching to improve constrained skyline query response time. Because arbitrary range constraints...... are unlikely to match a cached query exactly, our proposed method identifies and exploits similar cached queries to reduce the computational overhead of subsequent ones. We consider interactive users posing a string of similar queries and show how these can be classified into four cases based on how...... they overlap cached queries. For each we present a specialized solution. For the general case of independent users, we introduce the Missing Points Region (MPR), that minimizes disk reads, and an approximation of the MPR. An extensive experimental evaluation reveals that the querying for an...
Miles, S.; Moreau, L; Groth, P; Tan, V.; Munroe, S; Jiang, Sheng
A related document defines schemas to be used for documentation about the execution of a process. It also defines the provenance of a data item as the process that led to that item. A provenance query is a query for the provenance of a data item and the results of such a query is documentation of the process that led to the item. In this document, we specify a protocol by which a querying actor and provenance store can communicate in performing a provenance query. This primarily takes the for...
Anonymous Web Browsing and Hosting
Directory of Open Access Journals (Sweden)
Full Text Available In today's high tech environment every organization, individual computer users use internet for accessing web data. To maintain high confidentiality and security of the data secure web solutions are required. In this paper we described dedicated anonymous web browsing solutions which makes our browsing faster and secure. Web application which play important role for transferring our secret information including like email need more and more security concerns. This paper also describes that how we can choose safe web hosting solutions and what the main functions are which provides more security over server data. With the browser security network security is also important which can be implemented using cryptography solutions, VPN and by implementing firewalls on the network. Hackers always try to steal our identity and data, they track our activities using the network application software's and do harmful activities. So in this paper we described that how we can monitor them from security purposes.
DEFF Research Database (Denmark)
Yi, Ke; Wang, Lu; Wei, Zhewei
Database queries can be broadly classified into two categories: reporting queries and aggregation queries. The former retrieves a collection of records from the database that match the query's conditions, while the latter returns an aggregate, such as count, sum, average, or max (min), of a parti....... Our indexes require linear space and extract a summary with the optimal or near-optimal query cost. We illustrate the efficiency and usefulness of our designs through extensive experiments and a system demonstration.......Database queries can be broadly classified into two categories: reporting queries and aggregation queries. The former retrieves a collection of records from the database that match the query's conditions, while the latter returns an aggregate, such as count, sum, average, or max (min), of a...... particular attribute of these records. Aggregation queries are especially useful in business intelligence and data analysis applications where users are interested not in the actual records, but some statistics of them. They can also be executed much more efficiently than reporting queries, by embedding...
Practical Quantum Private Database Queries Based on Passive Round-Robin Differential Phase-shift Quantum Key Distribution
Li, Jian; Yang, Yu-Guang; Chen, Xiu-Bo; Zhou, Yi-Hua; Shi, Wei-Min
A novel quantum private database query protocol is proposed, based on passive round-robin differential phase-shift quantum key distribution. Compared with previous quantum private database query protocols, the present protocol has the following unique merits: (i) the user Alice can obtain one and only one key bit so that both the efficiency and security of the present protocol can be ensured, and (ii) it does not require to change the length difference of the two arms in a Mach-Zehnder interferometer and just chooses two pulses passively to interfere with so that it is much simpler and more practical. The present protocol is also proved to be secure in terms of the user security and database security. PMID:27539654
Certain Investigations on Query processing related issues in Mobile Computing Platforms for Large Datasets
Directory of Open Access Journals (Sweden)
Andamuthu Palanisamy
Full Text Available Applications in real time environment demands interactions from different devices both fixed and mobile devices in a seamless manner. The users interacting are in different geographic environments. The datasets are of different nature and allows for interaction across users in different levels with more levels of constraints. This in turn leads to different directions for addressing the issues in mobile computing. The queries from users are also complex and involve joins. The data residing also leads to issues of data management and prioritization of requests in communication. The technology enabled devices are also improving with processors and different platforms like HTML5 to address the existing issues. This paper presents a detailed survey of different issues in query processing in mobile environment. The solutions are also presented for the existing issues at the end of the paper.
Anonymous publication of sensitive transactional data
Ghinita, Gabriel
Existing research on privacy-preserving data publishing focuses on relational data: in this context, the objective is to enforce privacy-preserving paradigms, such as k-anonymity and ℓ-diversity, while minimizing the information loss incurred in the anonymizing process (i.e., maximize data utility). Existing techniques work well for fixed-schema data, with low dimensionality. Nevertheless, certain applications require privacy-preserving publishing of transactional data (or basket data), which involve hundreds or even thousands of dimensions, rendering existing methods unusable. We propose two categories of novel anonymization methods for sparse high-dimensional data. The first category is based on approximate nearest-neighbor (NN) search in high-dimensional spaces, which is efficiently performed through locality-sensitive hashing (LSH). In the second category, we propose two data transformations that capture the correlation in the underlying data: 1) reduction to a band matrix and 2) Gray encoding-based sorting. These representations facilitate the formation of anonymized groups with low information loss, through an efficient linear-time heuristic. We show experimentally, using real-life data sets, that all our methods clearly outperform existing state of the art. Among the proposed techniques, NN-search yields superior data utility compared to the band matrix transformation, but incurs higher computational overhead. The data transformation based on Gray code sorting performs best in terms of both data utility and execution time. © 2006 IEEE.
Anonymous Transactions in Computer Networks
Dolev, Shlomi; Kopeetsky, Marina
We present schemes for providing anonymous transactions while privacy and anonymity are preserved, providing user anonymous authentication in distributed networks such as the Internet. We first present a practical scheme for anonymous transactions while the transaction resolution is assisted by a Trusted Authority. This practical scheme is extended to a theoretical scheme where a Trusted Authority is not involved in the transaction resolution. Given an authority that generates for each player hard to produce evidence EVID (e. g., problem instance with or without a solution) to each player, the identity of a user U is defined by the ability to prove possession of said evidence. We use Zero-Knowledge proof techniques to repeatedly identify U by providing a proof that U has evidence EVID, without revealing EVID, therefore avoiding identity theft.
Robust Quantum Private Queries
Wang, Tian-Yin; Wang, Shu-Yu; Ma, Jian-Feng
We propose a new quantum private query protocol with the technique of decoherence-free states, which is a theoretical study of how decoherence-free states can be used for the protection of quantum information in such a protocol. This protocol can solve the noise problem that will make the user obtain a wrong answer and hence give rise to a bad influence on the reputation of the database provider. Furthermore, this protocol is also flexible, loss-resistant and easily generalized to a large database similar to the previous works.
Robust Quantum Private Queries
Wang, Tian-Yin; Wang, Shu-Yu; Ma, Jian-Feng
We propose a new quantum private query protocol with the technique of decoherence-free states, which is a theoretical study of how decoherence-free states can be used for the protection of quantum information in such a protocol. This protocol can solve the noise problem that will make the user obtain a wrong answer and hence give rise to a bad influence on the reputation of the database provider. Furthermore, this protocol is also flexible, loss-resistant and easily generalized to a large database similar to the previous works.
Conitzer, Vincent
A (randomized, anonymous) voting rule maps any multiset of total orders of (aka. votes over) a fixed set of alternatives to a probability distribution over these alternatives. A voting rule f is neutral if it treats all alternatives symmetrically. It satisfies participation if no voter ever benefits from not casting her vote. It is falsename-proof if no voter ever benefits from casting additional (potentially different) votes. It is anonymity-proof if it satisfies participation and it i...
Automatic Control of Configuration of Web Anonymization
Directory of Open Access Journals (Sweden)
Tomas Sochor
Full Text Available Anonymization of the Internet traffic usually hides details about the request originator from the target server. Such a disguise might be required in some situations, especially in the case of web browsing. Although the web traffic anonymization is not a part of the http specification, it could be achieved using a certain extra tool. Significant deceleration of anonymized traffic compared to normal traffic is inevitable but it can be controlled in some cases as this article suggests. The results presented here focus on measuring the parameters of such deceleration in terms of response time, transmission speed and latency and proposing the way how to control it. This study focuses on TOR primarily because recent studies have concluded that other tools (like I2P and JAP provide worse service. Sets of 14 file locations and 30 web pages have been formed and the latency, response time and transmission speed during the page or file download were measured repeatedly both with TOR active in various configurations and without TOR. The main result presented here comprises several ways how to improve the TOR anonymization efficiency and the proposal for its automatic control. In spite of the fact that efficiency still remains too low compared to normal web traffic for ordinary use, its automatic control could make TOR a useful tool in special cases.
Probabilistic Adaptive Anonymous Authentication in Vehicular Networks
Institute of Scientific and Technical Information of China (English)
Yong Xi; Ke-Wei Sha; Wei-Song Shi; Loren Schwiebert; Tao Zhang
Vehicular networks have attracted extensive attention in recent years for their promises in improving safety and enabling other value-added services. Most previous work focuses on designing the media access and physical layer protocols.Privacy issues in vehicular systems have not been well addressed. We argue that privacy is a user-specific concept, and a good privacy protection mechanism should allow users to select the levels of privacy they wish to have. To address this requirement, we propose an adaptive anonymous authentication mechanism that can trade off the anonymity level with computational and communication overheads (resource usage). This mechanism, to our knowledge, is the first effort on adaptive anonymous authentication. The resources used by our protocol are few. A high traffic volume of 2000 vehicles per hour consumes about 60kbps bandwidth, which is less than one percent of the bandwidth of DSRC (Dedicated Short Range Communications). By using adaptive anonymity, the protocol response time can further be improved 2~4 times with lessthan 20% bandwidth overheads.
Institute of Scientific and Technical Information of China (English)
朱鲲鹏; 魏芳
查询扩展可以有效地消除查询歧义,提高信息检索的准确率和召回率.通过挖掘用户日志中查询词和相关文档的连接关系,构造关联查询,并在此基础上提出一种从关联查询中提取查询扩展词的查询扩展方法.同时,还提出一种查询歧义的判别方法,该方法可以对查询词所表达的检索意图的模糊程度进行有效度量,也可以对查询词的检索性能进行预先估计.通过对查询歧义的度量来动态调整扩展词的长度,提高查询扩展模型的灵活性和适应能力.%Query expansion has long been suggested as an effective way to eliminate query ambiguity and improve the precision and recall rates of information retrieval. By mining relations among phrases and relative documents in user logs, the paper constructs related queries, based on which proposes a query expansion method to extract query expansion words from related queries. Meanwhile the paper introduces a method to measure the ambiguity of user queries, which can calculate the fuzzy degree of uses' search intentions and can estimate the performance of search sessions in advance. Trie query ambiguity measurement helps dynamically adjusting the number of expanded terms, so that the flexibility and adaptability of query expansion model is improved.
An Efficient Temporal Query Search for Time Sensitive Queries
Directory of Open Access Journals (Sweden)
Mani. G
Full Text Available Time Stamp is an important magnitude for document relevance for a large number of searches, such as over blogs and news archives. Research on searching over such collections has largely focused on locating topically similar documents for a query. Unfortunately, topic similarity alone is not always sufficient for document ranking. In this paper we presented an efficient method for processing time-sensitive queries over a news archive, with techniques for identifying important time periods for a query. This work demonstrates the integrating time in the retrieval task can improve the quality of the retrieval results, and motivates further research in the area. Currently, we rely on the publication time of the documents to locate time periods of interest. However, a document published at a later date (e.g., a review article, summarizing an event may also be relevant. In this paper the research direction is to introduce time-based diversity in query results by grouping the results into clusters of relevant time ranges, enabling users to be aware of and interact with time information when examining the query results
Directory of Open Access Journals (Sweden)
Nicoleta IACOB
Full Text Available The need for the distributed systems has been determined by the type of business developed by companies with offices geographically distributed where the specific organizational structure promotes a decentralized business model. This paper describes the techniques and concepts of system architecture for distributed database management systems, followed by the presentation of implementation phases involved when dealing with the distributed queries across distributed systems. The goal of query optimization is to determine the most efficient way to execute a query in a distributed environment, by obtaining a lower system response time and also by minimizing the query execution time. For this, we will analyze the factors that influence the ways to execute a query and we will also review the available strategies to optimize the distributed query execution.
Improving Security Architecture of Anonymous Wireless Mesh Networks
DEFF Research Database (Denmark)
Banoth, Rajkumar
As users of networks increasingly aware of their privacy needs, the importance of anonymity is gaining popularity. The reason behind it is that anonymity can hide the actual identity of end users while allowing their to access services of network or web site. More over they are allowed to do so...... without being traced. This usage is prevailing in P2P systems and also payment based networks like e-cash. Achieving anonymity and being able to trace misbehaving users are the two conflicting requirements. This paper proposes a security architecture that is aimed at providing complete anonymity to honest...... users while tracing misbehaving users thus resolving the conflict between anonymity and traceability requirements. In addition to these, this paper also focuses on basic security requirements such as nonrepudiation, data integrity, confidentiality, and authentication. The empirical results revealed that...
Implementation of Quantum Private Queries Using Nuclear Magnetic Resonance
Institute of Scientific and Technical Information of China (English)
WANG Chuan; HAO Liang; ZHAO Lian-Jie
@@ We present a modified protocol for the realization of a quantum private query process on a classical database.Using one-qubit query and CNOT operation,the query process can be realized in a two-mode database.In the query process,the data privacy is preserved as the sender would not reveal any information about the database besides her query information,and the database provider cannot retain any information about the query.We implement the quantum private query protocol in a nuclear magnetic resonance system.The density matrix of the memory registers are constructed.
Implementation of Quantum Private Queries Using Nuclear Magnetic Resonance
International Nuclear Information System (INIS)
We present a modified protocol for the realization of a quantum private query process on a classical database. Using one-qubit query and CNOT operation, the query process can be realized in a two-mode database. In the query process, the data privacy is preserved as the sender would not reveal any information about the database besides her query information, and the database provider cannot retain any information about the query. We implement the quantum private query protocol in a nuclear magnetic resonance system. The density matrix of the memory registers are constructed. (general)
Unemployment Insurance Query (UIQ)
Social Security Administration — The Unemployment Insurance Query (UIQ) provides State Unemployment Insurance agencies real-time online access to SSA data. This includes SSN verification and Title...
Exploring features for automatic identification of news queries through query logs
Institute of Scientific and Technical Information of China (English)
Xiaojuan; ZHANG; Jian; LI
Purpose:Existing researches of predicting queries with news intents have tried to extract the classification features from external knowledge bases,this paper tries to present how to apply features extracted from query logs for automatic identification of news queries without using any external resources.Design/methodology/approach:First,we manually labeled 1,220 news queries from Sogou.com.Based on the analysis of these queries,we then identified three features of news queries in terms of query content,time of query occurrence and user click behavior.Afterwards,we used 12 effective features proposed in literature as baseline and conducted experiments based on the support vector machine(SVM)classifier.Finally,we compared the impacts of the features used in this paper on the identification of news queries.Findings:Compared with baseline features,the F-score has been improved from 0.6414 to0.8368 after the use of three newly-identified features,among which the burst point(bst)was the most effective while predicting news queries.In addition,query expression(qes)was more useful than query terms,and among the click behavior-based features,news URL was the most effective one.Research limitations:Analyses based on features extracted from query logs might lead to produce limited results.Instead of short queries,the segmentation tool used in this study has been more widely applied for long texts.Practical implications:The research will be helpful for general-purpose search engines to address search intents for news events.Originality/value:Our approach provides a new and different perspective in recognizing queries with news intent without such large news corpora as blogs or Twitter.
Efficient Query Processing in Distributed Search Engines
Jonassen, Simon
Web search engines have to deal with a rapidly increasing amount of information, high query loads and tight performance constraints. The success of a search engine depends on the speed with which it answers queries (efficiency) and the quality of its answers (effectiveness). These two metrics have a large impact on the operational costs of the search engine and the overall user satisfaction, which determine the revenue of the search engine. In this context, any improvement in query processing...
An Efficient Data Fingerprint Query Algorithm Based on Two-Leveled Bloom Filter
Directory of Open Access Journals (Sweden)
Bin Zhou
Full Text Available The function of the comparing fingerprints algorithm was to judge whether a new partitioned data chunk was in a storage system a decade ago. At present, in the most de-duplication backup system the fingerprints of the big data chunks are huge and cannot be stored in the memory completely. The performance of the system is unavoidably retarded by data chunks accessing the storage system at the querying stage. Accordingly, a new query mechanism namely Two-stage Bloom Filter (TBF mechanism is proposed. Firstly, as a representation of the entirety for the first grade bloom filter, each bit of the second grade bloom filter in the TBF represents the chunks having the identical fingerprints reducing the rate of false positives. Secondly, a two-dimensional list is built corresponding to the two grade bloom filter for the absolute addresses of the data chunks with the identical fingerprints. Finally, a new hash function class with the strong global random characteristic is set up according to the data fingerprints' random characteristics. To reduce the comparing data greatly, TBF decreases the number of accessing disks, improves the speed of detecting the redundant data chunks, and reduces the rate of false positives which helps the improvement of the overall performance of system.
Information Network Model Query Processing
Song, Xiaopu
Information Networking Model (INM) [31] is a novel database model for real world objects and relationships management. It naturally and directly supports various kinds of static and dynamic relationships between objects. In INM, objects are networked through various natural and complex relationships. INM Query Language (INM-QL) [30] is designed to explore such information network, retrieve information about schema, instance, their attributes, relationships, and context-dependent information, and process query results in the user specified form. INM database management system has been implemented using Berkeley DB, and it supports INM-QL. This thesis is mainly focused on the implementation of the subsystem that is able to effectively and efficiently process INM-QL. The subsystem provides a lexical and syntactical analyzer of INM-QL, and it is able to choose appropriate evaluation strategies and index mechanism to process queries in INM-QL without the user's intervention. It also uses intermediate result structure to hold intermediate query result and other helping structures to reduce complexity of query processing.
Dr.S.K.JAYANTHI,; Ms.S.PREMA
Most commercial search engines return roughly the same results for the same query, regardless of the user's real interest. This paper focus on user report strategy so that the browsers can obtain the web search results based on their profiles in visual mode. Users can be mined from the concept-based user profiles to perform mutual filtering. Browsers with same idea and domain can share their knowledge. From the existing user profiles the interest and domain of the users can be obtained and th...
Social Indispensability in Spite of Temporal and Spatial Separation: Motivation Gains in a Sequential Task During Anonymous Cooperation on the Internet
Directory of Open Access Journals (Sweden)
Marion Wittchen
Full Text Available Recent research has demonstrated motivation gains during synchronous group work compared to individual work when group members' contribution was indispensable for the group's success (e.g., Hertel, Kerr, & Messé, 2000, Hertel, Deter, & Konradt, 2003. The current study extends this earlier research (a by examining indispensability effects during sequential cooperation (temporal separation, and (b by exploring these effects under conditions of high anonymity on the Internet (spatial separation. A 2 (Internet vs. laboratory context x 3 (high vs. low vs. no impact of personal contribution for a group x 2 (individual vs. group trial design was used with the last factor measured within subjects (N = 231. Motivation was measured with a vigilance task that simulated an Internet travel agency selling package holidays according to incoming customer requests. During all trials, participants received contemporaneous feedback about their own performance. During the group trials, participants additionally received information about their partner's alleged previous performance at this point of the trial, which suggested that the partner had always performed slightly better than the participant. As expected, both in the laboratory and the Internet setting, the highest motivation gains occurred when participants' contribution to the group's outcome was indispensable for the group. This finding provides evidence that motivation gains among inferior group members are possible even during sequential group work under highly anonymous conditions.
Learning Joint Query Interpretation and Response Ranking
Sawant, Uma; Chakrabarti, Soumen
Thanks to information extraction and semantic Web efforts, search on unstructured text is increasingly refined using semantic annotations and structured knowledge bases. However, most users cannot become familiar with the schema of knowledge bases and ask structured queries. Interpreting free-format queries into a more structured representation is of much current interest. The dominant paradigm is to segment or partition query tokens by purpose (references to types, entities, attribute names,...
Web and Semantic Web Query Languages
Bailey, James; Bry, François; Furche, Tim; Schaffert, Sebastian
A number of techniques have been developed to facilitate powerful data retrieval on the Web and Semantic Web. Three categories of Web query languages can be distinguished, according to the format of the data they can retrieve: XML, RDF and Topic Maps. This article introduces the spectrum of languages falling into these categories and summarises their salient aspects. The languages are introduced using common sample data and query types. Key aspects of the query languages ...
Querying moving objects detected by sensor networks
Bestehorn, Markus
Declarative query interfaces to Sensor Networks (SN) have become a commodity. These interfaces allow access to SN deployed for collecting data using relational queries. However, SN are not confined to data collection, but may track object movement, e.g., wildlife observation or traffic monitoring. While rational approaches are well suited for data collection, research on ""Moving Object Databases"" (MOD) has shown that relational operators are unsuitable to express information needs on object movement, i.e., spatio-temporal queries. ""Querying Moving Objects Detected by Sensor Networks"" studi
Oceanographic ontology-based spatial knowledge query
Institute of Scientific and Technical Information of China (English)
The construction of oceanographic ontologies is fundamental to the "digital ocean". Therefore, on the basis of introduction of new concept of oceanographic ontology, an oceanographic ontology-based spatial knowledge query (OOBSKQ) method was proposed and developed. Because the method uses a natural language to describe query conditions and the query result is highly integrated knowledge,it can provide users with direct answers while hiding the complicated computation and reasoning processes, and achieves intelligent,automatic oceanographic spatial information query on the level of knowledge and semantics. A case study of resource and environmental application in bay has shown the implementation process of the method and its feasibility and usefulness.
Moving Spatial Keyword Queries
DEFF Research Database (Denmark)
Wu, Dingming; Yiu, Man Lung; Jensen, Christian S.
Web users and content are increasingly being geo-positioned. This development gives prominence to spatial keyword queries, which involve both the locations and textual descriptions of content. We study the efficient processing of continuously moving top-k spatial keyword (MkSK) queries over spatial...
Libby, Alex
If you are a developer who is already familiar with using jQuery and wants to push your skill set further, then this book is for you. The book assumes an intermediate knowledge level of jQuery, JavaScript, HTML5, and CSS.
DEFF Research Database (Denmark)
Toman, David; Bowman, Ivan Thomas
efficient translated SQL queries by taking into account the properties of the encoding used for temporal attributes. For concreteness, this translation technique is presented in the context of SQL/TP; however, these techniques are also applicable to other temporal query languages....
Querying and Manipulating Temporal Databases
Directory of Open Access Journals (Sweden)
Mohamed Mkaouar
Full Text Available Many works have focused, for over twenty five years, on the integration of the time dimension indatabases (DB. However, the standard SQL3 does not yet allow easy definition, manipulation andquerying of temporal DBs. In this paper, we study how we can simplify querying and manipulatingtemporal facts in SQL3, using a model that integrates time in a native manner. To do this, we proposenew keywords and syntax to define different temporal versions for many relational operators andfunctions used in SQL. It then becomes possible to perform various queries and updates appropriate totemporal facts. We illustrate the use of these proposals on many examples from a real application.
Query Evaluation in Deductive Databases
Bry, François
It is desirable to answer queries posed to deductive databases by computing fixpoints because such computations are directly amenable to set-oriented fact processing. However, the classical fixpoint procedures based on bottom-up processing — the naive and semi-naive methods — are rather primitive and often inefficient. In this article, we rely on bottom-up meta-interpretation for formalizing a new fixpoint procedure that performs a different kind of reasoning: We specify a top-down query answ...
Patient Perspectives on Sharing Anonymized Personal Health Data Using a Digital System for Dynamic Consent and Research Feedback: A Qualitative Study
Whitley, Edgar A; Lund, David; Kaye, Jane
Background Electronic health records are widely acknowledged to provide an important opportunity to anonymize patient-level health care data and collate across populations to support research. Nonetheless, in the wake of public and policy concerns about security and inappropriate use of data, conventional approaches toward data governance may no longer be sufficient to respect and protect individual privacy. One proposed solution to improve transparency and public trust is known as Dynamic Consent, which uses information technology to facilitate a more explicit and accessible opportunity to opt out. In this case, patients can tailor preferences about whom they share their data with and can change their preferences reliably at any time. Furthermore, electronic systems provide opportunities for informing patients about data recipients and the results of research to which their data have contributed. Objective To explore patient perspectives on the use of anonymized health care data for research purposes. To evaluate patient perceptions of a Dynamic Consent model and electronic system to enable and implement ongoing communication and collaboration between patients and researchers. Methods A total of 26 qualitative interviews and three focus groups were conducted that included a video presentation explaining the reuse of anonymized electronic patient records for research. Slides and tablet devices were used to introduce the Dynamic Consent system for discussion. A total of 35 patients with chronic rheumatic disease with varying levels of illness and social deprivation were recruited from a rheumatology outpatient clinic; 5 participants were recruited from a patient and public involvement health research network. Results Patients were supportive of sharing their anonymized electronic patient record for research, but noted a lack of transparency and awareness around the use of data, making it difficult to secure public trust. While there were general concerns about
Optimal Planar Orthogonal Skyline Counting Queries
DEFF Research Database (Denmark)
Brodal, Gerth Stølting; Larsen, Kasper Green
counting queries, i.e. given a query rectangle R to report the size of the skyline of P\\cap R. We present a data structure for storing n points with integer coordinates having query time O(lg n/lglg n) and space usage O(n). The model of computation is a unit cost RAM with logarithmic word size. We prove...... that these bounds are the best possible by presenting a lower bound in the cell probe model with logarithmic word size: Space usage nlgO(1) n implies worst case query time Ω(lg n/lglg n)....
Optimal Planar Orthogonal Skyline Counting Queries
DEFF Research Database (Denmark)
Brodal, Gerth Stølting; Larsen, Kasper Green
counting queries, i.e. given a query rectangle R to report the size of the skyline of P\\cap R. We present a data structure for storing n points with integer coordinates having query time O(lg n/lglg n) and space usage O(n). The model of computation is a unit cost RAM with logarithmic word size. We prove...... that these bounds are the best possible by presenting a lower bound in the cell probe model with logarithmic word size: Space usage nlgO(1) n implies worst case query time Ω(lg n/lglg n)....
Benedetti, Ryan
Want to add more interactivity and polish to your websites? Discover how jQuery can help you build complex scripting functionality in just a few lines of code. With Head First jQuery, you'll quickly get up to speed on this amazing JavaScript library by learning how to navigate HTML documents while handling events, effects, callbacks, and animations. By the time you've completed the book, you'll be incorporating Ajax apps, working seamlessly with HTML and CSS, and handling data with PHP, MySQL and JSON. If you want to learn-and understand-how to create interactive web pages, unobtrusive scrip
The Spatial Nearest Neighbor Skyline Queries
Soudani, Nasrin Mazaheri
User preference queries are very important in spatial databases. With the help of these queries, one can found best location among points saved in database. In many situation users evaluate quality of a location with its distance from its nearest neighbor among a special set of points. There has been less attention about evaluating a location with its distance to nearest neighbors in spatial user preference queries. This problem has application in many domains such as service recommendation systems and investment planning. Related works in this field are based on top-k queries. The problem with top-k queries is that user must set weights for attributes and a function for aggregating them. This is hard for him in most cases. In this paper a new type of user preference queries called spatial nearest neighbor skyline queries will be introduced in which user has some sets of points as query parameters. For each point in database attributes are its distances to the nearest neighbors from each set of query points. ...
Anonymity And Accountability In Web Based Transactions
Directory of Open Access Journals (Sweden)
Full Text Available Decreased privacy is an unavoidable consequence in the drive to make the world a more secure, safer place, according to some analysts. In the on-line world, the conflict between privacy and security manifests itself in a debate between anonymity and accountability. Balance between Anonymity and Accountability is a major concern in web based transactions. The protection of users' privacy when performing web-based transactions is an important factor in the acceptance and use of Internet and web services. There is a tremendous improvement in the automation of the way we pay for goods and services by the variety and growth of electronic banking services available to the consumers. Hence there is a need for the ultimate structure of the new electronic transaction system that has a substantial impact on the personal privacy as well as on the nature and extent of criminal use of E- transactions. This paper presents an approach for such structure.
Privacy, anonymity and subjectivity in genomic research.
McGonigle, Ian; Shomron, Noam
The use of non-anonymized human genome data is becoming increasingly popular in research. Here we review the proceedings of a special meeting on this topic that took place at European Molecular Biology Organization (EMBO) in December 2014. The main points discussed centered on how to achieve 'anonymity,' 'trust,' and 'protection of data' in relation to new genomic technologies and research. Following our report of this meeting, we also raise three further issues for future consideration: the harmonization of international law in relation to genetic data protection; the complex issues around the 'dividual' nature of genetic data; and the growing commercial value of personal data. In conclusion, we stress the importance of scientists working in the area of genomic research engaging in interdisciplinary collaborations with humanities and social science scholars and addressing these complicated issues. PMID:26763729
Efficient Model Querying with VMQL
DEFF Research Database (Denmark)
Acretoaie, Vlad; Störrle, Harald
Context: Despite model querying being an important practical problem, existing solutions lack either usability, expressiveness, or generality. The Visual Model Query Language (VMQL) is a query byexample solution created to satisfy these requirements simultaneously. Objective: In the present paper...
Optimism analysis of parallel queries in databases through multicores
Directory of Open Access Journals (Sweden)
Full Text Available Apart form data management techniques such as data -ware housing and mining thispaper focus mainly on parallelism optimization for peculiar queries for particular applications.Queries involved in day to day database application may of different types such as queries withmultiple relations, queries with single relations and multiple operations, multiple queries withmultiple relations. These queries consists usually many join (single and multiple and aggregateoperators. The existing Parallel processing methodologies that treat these kinds of queries arevery sensitive to data distribution and involve more IO and Communication cost in processing. Inorder to overcome the issues an analysis is made how to cover parallelism on behalf onarchitectural basis. The paper organized as basic issues in parallelism query processing andmulticores and how inter and intra operator parallelism is deployed (how the threads basedparallel programming is used in query processing, how the parallelism is achieved with thedesired time.
Anonymous electronic trading versus floor trading
Franke, Günter; Hess, Dieter
This paper compares the attractiveness of floor trading and anonymous electronic trading systems. It is argued that in times of low information intensity the insight into the order book of the electronic trading system provides more valuable information than floor trading, but in times of high information intensity the reverse is true. Thus, the electronic system's market share in trading activity should decline in times of high information intensity. This hypothesis is tested by data on BUND...
jQuery simplifies building rich, interactive web frontends. Getting started with this JavaScript library is easy, but it can take years to fully realize its breadth and depth; this cookbook shortens the learning curve considerably. With these recipes, you'll learn patterns and practices from 19 leading developers who use jQuery for everything from integrating simple components into websites and applications to developing complex, high-performance user interfaces. Ideal for newcomers and JavaScript veterans alike, jQuery Cookbook starts with the basics and then moves to practical use cases w
Reverse engineering SPARQL queries
Arenas, M; Diaz, GI; Kostylev, E
Semantic Web systems provide open interfaces for end-users to access data via a powerful high-level query language, SPARQL. But users unfamiliar with either the details of SPARQL or properties of the target dataset may find it easier to query by example — give examples of the information they want (or examples of both what they want and what they do not want) and let the system reverse engineer the desired query from the examples. This approach has been heavily used in th...
An Internet Based Anonymous Electronic Cash System
Directory of Open Access Journals (Sweden)
Israt Jahan
Full Text Available There is an increase activity in research to improve the current electronic payment system which is parallel with the progress of internet. Electronic cash system is a cryptographic payment system which offers anonymity during withdrawal and purchase. Electronic cash displays serial numbers which can be recorded to allow further tracing. Contrary to their physical counterparts, e-cash have an inherent limitation; they are easy to copy and reuse (double-spending. An observer is a tamper-resistant device, issued by the Internet bank, which is incorporated with the Internet user's computer that prevents double-spending physically, i.e., the user has no access to her e-cash and therefore he cannot copy them. In this paper, we shall present an anonymous electronic cash scheme on the internet which incorporates tamper-resistant device with user-module.
SSA-Caterpillar in Group Anonymity
Tavrov, Dan
Nowadays, it is a common practice to protect various types of statistical data before publishing them for different researches. For instance, when conducting extensive demographic surveys such as national census, the collected data should be at least depersonalized to guarantee proper level of privacy preservation. In practice, even more complicated methods of data protection need to be used. All these methods can be generally divided into two classes. The first ones aim at providing individual data anonymity, whereas the other ones are focused on protecting information about a group of respondents. In this paper, we propose a novel technique of providing group anonymity in statistical data using singular spectrum analysis (SSA).Also, we apply SSA to defining hidden patterns in demographic data distribution.
Path Minima Queries in Dynamic Weighted Trees
DEFF Research Database (Denmark)
Davoodi, Pooya; Brodal, Gerth Stølting; Satti, Srinivasa Rao
In the path minima problem on a tree, each edge is assigned a weight and a query asks for the edge with minimum weight on a path between two nodes. For the dynamic version of the problem, where the edge weights can be updated, we give data structures that achieve optimal query time\\todo{what about...
Research of OWL ontology storage and query based on BaseX%基于BaseX数据库的OWL本体存储查询研究
Institute of Scientific and Technical Information of China (English)
胡甜甜; 曹旻
针对目前基于关系型数据库等存储模式的本体存储查询效率较低的情况,提出使用XML数据库BaseX进行本体的存储,并设计了相应的本体存储查询架构.在对BaseX存储结构与接口的研究基础上,实现对OWL本体的存储.利用BaseX的查询接口和XQuery查询语言对OWL本体进行检索,在建立推理规则库基础上,实现本体查询扩展与推理.实验将提出的存储查询方法与基于关系型数据库的存储查询方法进行对比,验证了提出的方法具备高效的存储查询性能,同时具备本体查询的推理能力.%In view of low efficiency of ontology storage and query based on relational database or other databases, BaseX as an XML database is proposed to store ontoloy, besides, the architecture of it is also designed. Based on the research of BaseX storage structure and its interface, ontology storage is implemented. OWL ontology query is implemented by using the BaseX query interface and Xquery language, and ontology query extension and reasoning are implemented on the basis of inference rules library. The experiments compare the ontology storage and query method put forward in this paper with the classic method based on the relational database, which verify the method in this paper has more efficient storage and query performance, along with the ability of ontology query reasoning.
Anonymity, ethics and credibility in the blogosphere and on Twitter: gastronomic criticism in "Alhos, passas & maçãs" and in @carapuceiro
Directory of Open Access Journals (Sweden)
Renata Maria do Amaral
Full Text Available This article intends to understand the anonymous restaurant critic currently made on the Internet, based on the cases of the Alhos, passas & maçãs blog and the @carapuceiro Twitter. Before considered as personal diaries or means of communication among friends, today blogs and social networks have no limits – and, when used to criticize restaurants negatively, its impact reaches unpremeditated boundaries, including reactions of chefs and journalists themselves. At the same time that these tools extend the possibilities of subjective comments written by ordinary people, without a degree in journalism, the press loses credibility by choosing to criticize in a courteous way, submitting itself to the invitations sent by press offices and to the "cordial journalism".
Our Anonymous Online Research Participants Are Not Always Anonymous: Is This a Problem?
Dawson, Phillip
When educational research is conducted online, we sometimes promise our participants that they will be anonymous--but do we deliver on this promise? We have been warned since 1996 to be careful when using direct quotes in Internet research, as full-text web search engines make it easy to find chunks of text online. This paper details an empirical…
Purpose-restricted Anonymous Mobile Communications Using Anonymous Signatures in Online Credential Systems
DEFF Research Database (Denmark)
Fathi, Hanane; Shin, SeongHan; Kobara, Kazukuni;
To avoid the risk of long-term storage of secrets on a portable device, an online credential system supports the roaming user in retrieving securely at various locations his private key and other material to generate anonymous signatures. The protocol proposed here allows a roaming mobile user to...
A Query Language for Digital Libraries
Yang, Jitao
W e introduce a data model for digital libraries and an associated query language for the discovery of objects of interest based on content or description. W e also outline possible mappings of the query language to existing standards, namely SPARQL. This paper is a short description of my doctoral work, under way, at the University of Paris South.
Query Intent Disambiguation of Keyword-Based Semantic Entity Search in Dataspaces
Institute of Scientific and Technical Information of China (English)
Dan Yang; De-Rong Shen; Ge Yu; Yue Kou; Tie-Zheng Nie
Keyword query has attracted much research attention due to its simplicity and wide applications.The inherent ambiguity of keyword query is prone to unsatisfied query results.Moreover some existing techniques on Web query,keyword query in relational databases and XML databases cannot be completely applied to keyword query in dataspaces.So we propose KeymanticES,a novel keyword-based semantic entity search mechanism in dataspaces which combines both keyword query and semantic query features.And we focus on query intent disambiguation problem and propose a novel three-step approach to resolve it.Extensive experimental results show the effectiveness and correctness of our proposed approach.
Exponential Lower Bound for 2-Query Locally Decodable Codes
Kerenidis, I; Kerenidis, Iordanis; Wolf, Ronald de
We prove exponential lower bounds on the length of 2-query locally decodable codes. Goldreich et al. recently proved such bounds for the special case of linear locally decodable codes. Our proof shows that a 2-query locally decodable code can be decoded with only 1 quantum query, and then proves an exponential lower bound for such 1-query locally quantum-decodable codes. We also exhibit q-query locally quantum-decodable codes that are much shorter than the best known q-query classical codes. Finally, we give some new lower bounds for (not necessarily linear) private information retrieval systems.
Scalable Techniques for Security and Anonymity in Distributed Systems
Akhoondi, Masoud
Security and privacy in distributed systems are long-standing hard problems. On the one hand, solutions for anonymous communications over the Internet are either vulnerable to traffic analysis or offer poor performance. On the other hand, compromises within enterprises remain hard to track down due to complex dependencies between hosts, applications, and their data.In this thesis, I develop two solutions to improve the anonymity vs. performance trade-off for communications over the Internet. ...
The role of quasi-identifiers in k-anonymity revisited
Bettini, C.; Wang, X S; S. Jajodia
The concept of k-anonymity, used in the recent literature to formally evaluate the privacy preservation of published tables, was introduced based on the notion of quasi-identifiers (or QI for short). The process of obtaining k-anonymity for a given private table is first to recognize the QIs in the table, and then to anonymize the QI values, the latter being called k-anonymization. While k-anonymization is usually rigorously validated by the authors, the definition of QI remains mostly inform...
Reidentification and k-anonymity: a model for disclosure risk in graphs
Stokes, Klara; Torra, Vicenç
In this article we provide a formal framework for reidentification in general. We define n-confusion as a concept for modelling the anonymity of a database table and we prove that n-confusion is a generalization of k- anonymity. After a short survey on the different available definitions of k- anonymity for graphs we provide a new definition for k-anonymous graph, which we consider to be the correct definition. We provide a description of the k-anonymous graphs, both for the regular and the n...
Anonymous Client Authentication for Transport Layer Security
Dietrich, Kurt
Nowadays, anonymity and privacy protecting mechanisms are becoming more and more important. The anonymity of platforms and the privacy of users operating in the Internet are major concerns of current research activities. Although different techniques for protecting anonymity exist, standard protocols like Transport Layer Security are still missing adequate support for these technologies. In this paper, we analyze how Trusted Computing technologies and anonymous credential systems can be used ...
Hiding in Plain Sight: Exploiting Broadcast for Practical Host Anonymity
Energy Technology Data Exchange (ETDEWEB)
Shue, Craig A [ORNL; Gupta, Prof. Minaxi [Indiana University
Users are being tracked on the Internet more than ever before as Web sites and search engines gather pieces of information sufficient to identify and study their behavior. While many existing schemes provide strong anonymity, they are inappropriate when high bandwidth and low latency are required. In this work, we explore an anonymity scheme for end hosts whose performance makes it possible to have it always on. The scheme leverages the natural grouping of hosts in the same subnet and the universally available broadcast primitive to provide anonymity at line speeds. Our scheme is strongly resistant against all active or passive adversaries as long as they are outside the subnet. Even within the subnet, our scheme provides reasonable resistance against adversaries, providing anonymity that is suitable for common Internet applications.
Ontology-based Queries over Cancer Data
Gonzalez-Beltran, Alejandra; Finkelstein, Anthony
The ever-increasing amount of data in biomedical research, and in cancer research in particular, needs to be managed to support efficient data access, exchange and integration. Existing software infrastructures, such caGrid, support access to distributed information annotated with a domain ontology. However, caGrid's current querying functionality depends on the structure of individual data resources without exploiting the semantic annotations. In this paper, we present the design and development of an ontology-based querying functionality that consists of: the generation of OWL2 ontologies from the underlying data resources metadata and a query rewriting and translation process based on reasoning, which converts a query at the domain ontology level into queries at the software infrastructure level. We present a detailed analysis of our approach as well as an extensive performance evaluation. While the implementation and evaluation was performed for the caGrid infrastructure, the approach could be applicable ...
Query as Region Partition in Managing Moving Objects for Concurrent Continuous Query
Directory of Open Access Journals (Sweden)
Ming Qi
Full Text Available Applications in location-based services rely on the efficient management of large scale moving objects, and one of the most important operations is real-time continuous query over moving objects, such as monitoring the objects of a certain region. In order to satisfy the high throughput and handle real-time updates and queries, it is a good choice to introduce multi-core parallel processing and managing spatial indices in main memory. In this paper, we propose a new scheme of processing continuous query on a novel spatial index based on uniform grid which is proved to be a good indexing scheme in main memory. The novelty of our index is to manage query region as the partition in the spatial index, which unified the index updating and query processing. Our experiments indicate that this sophisticated approach has better performance especially when the query is rather stationary.
Revocable Anonymous Access to the Internet?
Claessens, Joris; Diaz, Claudia; Goemans, Caroline; Preneel, Bart; Vandewalle, Joos; Dumortier, Jos
Users of telecommunications networks are concerned about privacy, and desire anonymous access, while some organizations are concerned about how this anonymous access might be abused. Proposes a solution for revocable anonymous access to the Internet. Presents some legal background and motivation for such a solution. Indicates some difficulties and…
Query Optimization Techniques - Tips For Writing Efficient And Faster SQL Queries
Directory of Open Access Journals (Sweden)
Jean HABIMANA
Full Text Available Abstract SQL statements can be used to retrieve data from any database. If youve worked with databases for any amount of time retrieving information its practically given that youve run into slow running queries. Sometimes the reason for the slow response time is due to the load on the system and other times it is because the query is not written to perform as efficiently as possible which is the much more common reason. For better performance we need to use best faster and efficient queries. This paper covers how these SQL queries can be optimized for better performance. Query optimization subject is very wide but we will try to cover the most important points. In this paper I am not focusing on in- depth analysis of database but simple query tuning tips amp tricks which can be applied to gain immediate performance gain.
Directory of Open Access Journals (Sweden)
Full Text Available Most commercial search engines return roughly the same results for the same query, regardless of the user's real interest. This paper focus on user report strategy so that the browsers can obtain the web search results based on their profiles in visual mode. Users can be mined from the concept-based user profiles to perform mutual filtering. Browsers with same idea and domain can share their knowledge. From the existing user profiles the interest and domain of the users can be obtained and the search engine personalization is focused in this paper. Finally, the concept-based user profiles can be incorporated into the vis -(Visual ranking algorithm of a searchengine so that search results can be ranked according to individual users' interests and displayed in visual mode.
Anonymity and verifiability in multi-attribute reverse auction
Srinath, T R; Pais, Alwyn Roshan; 10.5121/ijitcs.2011.1401
The use of e-Auction services has been increasing in recent years. Security requirements in conducting e-Auctions are mainly bid privacy, anonymity and public verifiability. Most of the secure protocols concentrate on privacy and anonymity, which are achieved through bidder-resolved multi-party computation, assuming two or more trusted third parties, either through numerous auctioneers or with asymmetric models in which the commercial entity of an auction issuer or registration manager is assumed in addition to the auctioneer. Multi-attribute reverse auctions promise higher market efficiency and effective information exchange. This work extends and uses the existing schemes. This scheme uses scoring function, winner determination in multi-attribute auctions to implement public verifiability. Anonymity is achieved through bidder side pseudonym generation. By results and analysis we say this is very simple and effective scheme. This scheme ensures public verifiability and anonymity in multi-attribute auctions w...
Identity and anonymity: victims and perpetrators in human rights reports
De Cock, Barbara; Michaud Maturana, Daniel; 4th Biennial Meeting of the International Association for the Study of Spanish in Society (SIS-EES) / 6th International Conference of Hispanic Linguistics
Identity and anonymity: victims and perpetrators in human rights reports In this paper, we look into the construction of identity and anonymity in human rights reports, more concretely in the report by the Rettig Commission on human rights violations under the Pinochet regime. In the preliminaries to this report, the commission formulates its desire to give an account that is as complete as possible yet also its refraining from attributing individual responsibility (Oteíza 2010). We will anal...
Application of Steganography for Anonymity through the Internet
Bahi, Jacques; Couchot, Jean-François; Friot, Nicolas; Guyeux, Christophe
In this paper, a novel steganographic scheme based on chaotic iterations is proposed. This research work takes place into the information hiding security framework. The applications for anonymity and privacy through the Internet are regarded too. To guarantee such an anonymity, it should be possible to set up a secret communication channel into a web page, being both secure and robust. To achieve this goal, we propose an information hiding scheme being stego-secure, which is the highest level...
Social distance and anonymity modulate fairness consideration: An ERP study
Rongjun Yu; Pan Hu; Ping Zhang
Previous research indicated that fairness consideration can be influenced by social distance. However, it is not clear whether social distance and anonymity have an interactive impact on fairness evaluation during asset distribution and whether these processes can be documented in brain activity. Using a modified ultimatum game combined with measures of event related potential (ERP), we examined how social distance and anonymity modulate brain response to inequality. At the behavior level, we...
Anonymization of DICOM Electronic Medical Records for Radiation Therapy
Newhauser, Wayne; Jones, Timothy; Swerdloff, Stuart; Newhauser, Warren; Cilia, Mark; Carver, Robert (British painter, ca.1730-1791); Halloran, Andy; Zhang, Rui
Electronic medical records (EMR) and treatment plans are used in research on patient outcomes and radiation effects. In many situations researchers must remove protected health information (PHI) from EMRs. The literature contains several studies describing the anonymization of generic Digital Imaging and Communication in Medicine (DICOM) files and DICOM image sets but no publications were found that discuss the anonymization of DICOM radiation therapy plans, a key component of an EMR in a can...
Effects of Anonymous Whistle‐Blowing and Perceived Reputation Threats on Investigations of Whistle‐Blowing Allegations by Audit Committee Members
James E. Hunton; Jacob M. Rose
A total of 83 experienced audit committee members participated in an experiment in which they evaluated the credibility of and allocated investigative resources towards a whistle-blowing allegation of financial reporting malfeasance by corporate executive officers. We manipulated whether the whistle‐blowing allegation was made through anonymous or non‐anonymous channels and whether the allegation posed a relatively high or low threat to the personal reputation of the audit committee member wh...
Tuning the SQL Query in order to Reduce Time Consumption
Directory of Open Access Journals (Sweden)
Karthik P
Full Text Available The optimizer examines parsed and normalized queries, and information about database objects. The input to the optimizer is a parsed SQL query and statistics about the tables, indexes, and columns named in the query. The output from the optimizer is a query plan. The query plan is compiled code that contains the ordered steps to carry out the query, including the access methods (table scan or index scan, type of join to use, join order, and so on to access each table. Using statistics on tables and indexes, the optimizer predicts the cost of using alternative access methods to resolve a particular query. It finds the best query plan - the plan that is least the costly in terms of I/O [1].For many queries, there are many possible query plans. Adaptive Server selects the least costly plan, and compiles and executes it. The query process very faster and less cost per query. This query optimization gives the High performance of the system and less stress on the database when data transmission occurs and the efficient usage of database engine and lesser memory consumed.
Data on publications, structural analyses, and queries used to build and utilize the AlloRep database.
Sousa, Filipa L; Parente, Daniel J; Hessman, Jacob A; Chazelle, Allen; Teichmann, Sarah A; Swint-Kruse, Liskin
The AlloRep database (www.AlloRep.org) (Sousa et al., 2016) [1] compiles extensive sequence, mutagenesis, and structural information for the LacI/GalR family of transcription regulators. Sequence alignments are presented for >3000 proteins in 45 paralog subfamilies and as a subsampled alignment of the whole family. Phenotypic and biochemical data on almost 6000 mutants have been compiled from an exhaustive search of the literature; citations for these data are included herein. These data include information about oligomerization state, stability, DNA binding and allosteric regulation. Protein structural data for 65 proteins are presented as easily-accessible, residue-contact networks. Finally, this article includes example queries to enable the use of the AlloRep database. See the related article, "AlloRep: a repository of sequence, structural and mutagenesis data for the LacI/GalR transcription regulators" (Sousa et al., 2016) [1]. PMID:27508249
A Query on the Impact of Place on the Formation of Iconic Buildings in Architecture
Davarpanah, Sayena
ABSTRACT: Places are demarcated with their different characteristics. Generally, socio-cultural, historical, ecological, technological and human attributes define the places and their architecture consequently. Throughout the centuries, the power of place on the development of architecture is known and respectively experienced. Even, in modern times when there is a limited attention to the local/contextual characteristics, creating places and making the environment meaningful are considered ...
The Research on Automatic Construction of Domain Model Based on Deep Web Query Interfaces
JianPing, Gu
The integration of services is transparent, meaning that users no longer face the millions of Web services, do not care about the required data stored, but do not need to learn how to obtain these data. In this paper, we analyze the uncertainty of schema matching, and then propose a series of similarity measures. To reduce the cost of execution, we propose the type-based optimization method and schema matching pruning method of numeric data. Based on above analysis, we propose the uncertain schema matching method. The experiments prove the effectiveness and efficiency of our method.
Web Retrieval Optimization Model Based on User's Query Intention Identification%基于用户查询意图识别的Web搜索优化模型
Institute of Scientific and Technical Information of China (English)
杨艺; 周元
在对用户查询意图进行分析分类的基础上,提出了一种Web搜索优化模型.该模型通过识别用户查询意图来查询意图特征词和内容主题词的双重约束,再结合用户查询行为获得查询目标,既保证了用户查询意图的准确匹配,又自动过滤和屏蔽了不相关信息.与相关工作对比,其重点在于准确获取用户查询意图,提高用户满意度.实验结果表明,该模型在实现信息搜索准确性和用户对查询结果满意度方面比传统搜索方法有明显改善.%A Web retrieval optimization model was proposed based on the analysis and classification of user's query intention. It focuses on user's query intention identification,and can both ensure match user's query intention accurately and filter useless information automatically by means of characteristic word of query intention, content keyword and user's query behavior. Comparing with related work. This paper focused on user's query intention and user's satisfaction. Experimental results show that the model can improve significantly the accuracy in information retrieve and users' satisfaction compared with traditional methods.
Directory of Open Access Journals (Sweden)
S. R. Bharamagoudar
Full Text Available The amount of images or the pictorial data is growing day by day with the expansion of internet services. As the network and development of multimedia technologies are becoming more popular, users are not satisfied with the traditional information retrieval techniques. So nowadays the content based image retrieval are becoming a source of exact and fast retrieval. . It is very difficult for the users to retrieve the required images using a operative and efficient mechanism. There are many techniques which are used to retrieve the images depending upon the requirement of different applications. This paper provides an extensive review of various latest research work and methodologies applied in the field of CBIR. Images are retrieved on the basis of automatically derived features such as, texture, shape and color which is generally referred to as Content-Based Image Retrieval (CBIR. Content based image retrieval is an important research area in image processing, with a vast domain of applications like recognition systems i.e. finger, face, biometrics, medical sciences etc. However, the technology still lacks maturity, and is not yet being used on a significant scale. In the absence of hard evidence on the effectiveness of CBIR techniques in practice, opinion is still sharply divided about their usefulness in handling real-life queries in large and diverse image collections. The concepts which are presently used for CBIR system are all under research.
Henzinger, Monika; Chang, Bay-Wei; Milch, Brian; Brin, Sergey
Many daily activities present information in the form of a stream of text, and often people can benefit from additional information on the topic discussed. TV broadcast news can be treated as one such stream of text; in this paper we discuss finding news articles on the web that are relevant to news currently being broadcast.We evaluated a variety of algorithms for this problem, looking at the impact of inverse document frequency, stemming, compounds, history, and query length on the re...
DEFF Research Database (Denmark)
Cao, Xin; Chen, Lisi; Cong, Gao; Jensen, Christian S.; Qu, Qiang; Skovsgaard, Anders; Wu, Dingming; Yiu, Man Lung
The web is increasingly being used by mobile users. In addition, it is increasingly becoming possible to accurately geo-position mobile users and web content. This development gives prominence to spatial web data management. Specifically, a spatial keyword query takes a user location and user......-supplied keywords as arguments and returns web objects that are spatially and textually relevant to these arguments. This paper reviews recent results by the authors that aim to achieve spatial keyword querying functionality that is easy to use, relevant to users, and can be supported efficiently. The paper covers...
Chaffer, Jonathan
Enabling Ontology Based Semantic Queries in Biomedical Database Systems.
Zheng, Shuai; Wang, Fusheng; Lu, James; Saltz, Joel
While current biomedical ontology repositories offer primitive query capabilities, it is difficult or cumbersome to support ontology based semantic queries directly in semantically annotated biomedical databases. The problem may be largely attributed to the mismatch between the models of the ontologies and the databases, and the mismatch between the query interfaces of the two systems. To fully realize semantic query capabilities based on ontologies, we develop a system DBOntoLink to provide unified semantic query interfaces by extending database query languages. With DBOntoLink, semantic queries can be directly and naturally specified as extended functions of the database query languages without any programming needed. DBOntoLink is adaptable to different ontologies through customizations and supports major biomedical ontologies hosted at the NCBO BioPortal. We demonstrate the use of DBOntoLink in a real world biomedical database with semantically annotated medical image annotations. PMID:23404054
Efficient Semi-structured Queries in Scala using XQuery Shipping
Borran-Dejnabadi, Fatemeh
This project proposes a new approach to interact with database systems through programming languages. A formal query language can be integrated within modern programming languages and the semi-structured queries can be evaluated using automatic transformation and query shipping. The focus of this project is on XML queries and Scala programming language. Particularly, this project optimizes the XML-based expressions of Scala using XQuery transformation and Shipping. In this work, Scala sequenc...
FDB: A Query Engine for Factorised Relational Databases
Bakibayev, Nurzhan; Závodný, Jakub
Factorised databases are relational databases that use compact factorised representations at the physical layer to reduce data redundancy and boost query performance. This paper introduces FDB, an in-memory query engine for select-project-join queries on factorised databases. Key components of FDB are novel algorithms for query optimisation and evaluation that exploit the succinctness brought by data factorisation. Experiments show that for data sets with many-to-many relationships FDB can outperform relational engines by orders of magnitude.
FDB: A Query Engine for Factorised Relational Databases
Bakibayev, Nurzhan; OLTEANU, Dan; Závodný, Jakub
Factorised databases are relational databases that use compact factorised representations at the physical layer to reduce data redundancy and boost query performance. This paper introduces FDB, an in-memory query engine for select-project-join queries on factorised databases. Key components of FDB are novel algorithms for query optimisation and evaluation that exploit the succinctness brought by data factorisation. Experiments show that for data sets with many-to-many relationships FDB can ou...
Directory of Open Access Journals (Sweden)
Shaikhah Alhazmi
Full Text Available Preference querying technology is a very important issue in a variety of applications ranging from ecommerce to personalized search engines. Most of recent research works have been dedicated to this topic in the Artificial Intelligence and Database fields. Several formalisms allowing preference reasoning and specification have been proposed in the Artificial Intelligence domain. On the other hand, in the Database field the interest has been focused mainly in extending standard Structured Query Language (SQL and also eXtensible Markup Language (XML with preference facilities in order to provide personalized query answering. More precisely, the interest in the database context focuses on the notion of Top-k preference query and on the development of efficient methods for evaluating these queries. A Top-k preference query returns k data tuples which are the most preferred according to the user's preferences. Of course, Top-k preference query answering is closely dependent on the particular preference model underlying the semantics of the operators responsible for selecting the best tuples. In this paper, we consider the Conditional Preference queries (CP-queries where preferences are specified by a set of rules expressed in a logical formalism. We introduce Top-k conditional preference queries (Top-k CP-queries, and the operators BestK-Match and Best-Match for evaluating these queries will be presented.
GUN: An Efficient Execution Strategy for Querying the Web of Data
Montoya, Gabriela; Ibanez, Luis-Daniel; Skaf-Molli, Hala; Molli, Pascal; Vidal, Maria-Esther
Local-As-View (LAV) mediators provide a uniform interface to a federation of heterogeneous data sources, attempting to execute queries against the federation. LAV mediators rely on query rewriters to translate mediator queries into equivalent queries on the federated data sources. The query rewriting problem in LAV mediators has shown to be NP-complete, and there may be an exponential number of rewritings, making unfeasible the execution or even generation of all the rewritings for some queri...
A Trichotomy in the Complexity of Counting Answers to Conjunctive Queries
Chen, Hubie; Mengel, Stefan
Conjunctive queries are basic and heavily studied database queries; in relational algebra, they are the select-project-join queries. In this article, we study the fundamental problem of counting, given a conjunctive query and a relational database, the number of answers to the query on the database. In particular, we study the complexity of this problem relative to sets of conjunctive queries. We present a trichotomy theorem, which shows essentially that this problem on a set of conjunctive q...
Extended query refinement for medical image retrieval.
Deserno, Thomas M; Güld, Mark O; Plodowski, Bartosz; Spitzer, Klaus; Wein, Berthold B; Schubert, Henning; Ney, Hermann; Seidl, Thomas
The impact of image pattern recognition on accessing large databases of medical images has recently been explored, and content-based image retrieval (CBIR) in medical applications (IRMA) is researched. At the present, however, the impact of image retrieval on diagnosis is limited, and practical applications are scarce. One reason is the lack of suitable mechanisms for query refinement, in particular, the ability to (1) restore previous session states, (2) combine individual queries by Boolean operators, and (3) provide continuous-valued query refinement. This paper presents a powerful user interface for CBIR that provides all three mechanisms for extended query refinement. The various mechanisms of man-machine interaction during a retrieval session are grouped into four classes: (1) output modules, (2) parameter modules, (3) transaction modules, and (4) process modules, all of which are controlled by a detailed query logging. The query logging is linked to a relational database. Nested loops for interaction provide a maximum of flexibility within a minimum of complexity, as the entire data flow is still controlled within a single Web page. Our approach is implemented to support various modalities, orientations, and body regions using global features that model gray scale, texture, structure, and global shape characteristics. The resulting extended query refinement has a significant impact for medical CBIR applications. PMID:17497197
Spatial Keyword Query Processing
DEFF Research Database (Denmark)
Chen, Lisi; Jensen, Christian S.; Wu, Dingming
Geo-textual indices play an important role in spatial keyword query- ing. The existing geo-textual indices have not been compared sys- tematically under the same experimental framework. This makes it difficult to determine which indexing technique best supports specific functionality. We provide ...
Morgan, Mary M.; Beaman, Peter D.; Shusman, Daniel J.; Hupp, Jon A.; Zielstorff, Rita D.; Barnett, G. Octo
This paper describes the Medical Query Language (MQL), a "formal" language which enables unsophisticated users, having no background in programming or computer science, to express information retrieval and analysis questions of their data bases. MQL is designed to access any MUMPS data base. Most MQL applications to date have dealt with the COmputer STored Ambulatory Record (COSTAR) data base.
Broadcast-Based Spatial Queries
Institute of Scientific and Technical Information of China (English)
Kwang-Jin Park; Moon-Bae Song; Chong-Sun Hwang
Indexing techniques have been developed for wireless data broadcast environments, in order to conserve the scarce power resources of the mobile clients. However, the use of interleaved index segments in a broadcast cycle increases the average access latency for the clients. In this paper, the broadcast-based spatial query processing methods (BBS)are presented for the location-based services. In the BBS, broadcasted data objects are sorted sequentially based on their locations, and the server broadcasts the location dependent data along with an index segment. Then, a sequential prefetching and caching scheme is designed to reduce the query response time. The performance of this scheme is investigated in relation to various environmental variables, such as the distributions of the data objects, the average speed of the clients and the size of the service area.
Querying Sentiment Development over Time
DEFF Research Database (Denmark)
Andreasen, Troels; Christiansen, Henning; Have, Christian Theil
A new language is introduced for describing hypotheses about fluctuations of measurable properties in streams of timestamped data, and as prime example, we consider trends of emotions in the constantly flowing stream of Twitter messages. The language, called EmoEpisodes, has a precise semantics...... that measures how well a hypothesis characterizes a given time interval; the semantics is parameterized so it can be adjusted to different views of the data. EmoEpisodes is extended to a query language with variables standing for unknown topics and emotions, and the query-answering mechanism will...... return instantiations for topics and emotions as well as time intervals that provide the largest deflections in this measurement. Experiments are performed on a selection of Twitter data to demonstrates the usefulness of the approach....
Cooperative Scalable Moving Continuous Query Processing
DEFF Research Database (Denmark)
Li, Xiaohui; Karras, Panagiotis; Jensen, Christian S.
A range of applications call for a mobile client to continuously monitor others in close proximity. Past research on such problems has covered two extremes: It has offered totally centralized solutions, where a server takes care of all queries, and totally distributed solutions, in which there is...... no central authority at all. Unfortunately, none of these two solutions scales to intensive moving object tracking applications, where each client poses a query. In this paper, we formulate the moving continuous query (MCQ) problem and propose a balanced model where servers cooperatively take care of...
Anonymity: an impediment to performance in healthcare.
Karlsberg, Daniel W; Pierce, Read G
Many teaching hospitals employ a care team structure composed of a broad range of healthcare providers with different skill sets. Each member of this team has a distinct role and a different level of training ranging from attending physician to resident, intern, and medical student. Often times, these different roles lead to greater complexity and confusion for both patients and nursing staff. It has been demonstrated that patients have a great degree of difficulty in identifying members of their care team. This anonymity also exists between nursing staff and other care providers. In order to better understand the magnitude of anonymity within the teaching hospital, a ten-question survey was sent to nurses across three different departments. Results from this survey demonstrated that 71% of nurses are "Always" or "Often" able to identify which care team is responsible for their patients, while 79% of nurses reported that they either "Often" or "Sometimes" page a provider who is not currently caring for a given patient. Furthermore, 33% of nurses felt that they were either "Rarely" or "Never" able to recognize, by face and name, attending level providers. Residents were "Rarely" or "Never" recognized by face and name 37% of the time, and interns 42% of the time. Contacting the wrong provider repeatedly leads to de facto delays in medication, therapy, and diagnosis. Additionally, these unnecessary interruptions slow workflow for both nurses and members of the care team, making hospital care less efficient and safe overall. Technological systems should focus on reducing anonymity within the hospital in order to enhance healthcare delivery. PMID:25114570
Constraint-based query distribution framework for an integrated global schema
DEFF Research Database (Denmark)
Malik, Ahmad Kamran; Qadir, Muhammad Abdul; Iftikhar, Nadeem;
Distributed heterogeneous data sources need to be queried uniformly using global schema. Query on global schema is reformulated so that it can be executed on local data sources. Constraints in global schema and mappings are used for source selection, query optimization, and querying partitioned and...... replicated data sources. The provided system is all XML-based which poses query in XML form, transforms, and integrates local results in an XML document. Contributions include the use of constraints in our existing global schema which help in source selection and query optimization, and a global query...... distribution framework for querying distributed heterogeneous data sources. ©2009 IEEE....
Query Adaptive Image Retrieval System
Directory of Open Access Journals (Sweden)
Amruta Dubewar
Full Text Available Images play a crucial role in various fields such as art gallery, medical, journalism and entertainment. Increasing use of image acquisition and data storage technologies have enabled the creation of large database. So, it is necessary to develop appropriate information management system to efficiently manage these collections and needed a system to retrieve required images from these collections. This paper proposed query adaptive image retrieval system (QAIRS to retrieve images similar to the query image specified by user from database. The goal of this system is to support image retrieval based on content properties such as colour and texture, usually encoded into feature vectors. In this system, colour feature extracted by various techniques such as colour moment, colour histogram and autocorrelogram and texture feature extracted by using gabor wavelet. Hashing technique is used to embed high dimensional image features into hamming space, where search can be performed by hamming distance of compact hash codes. Depending upon minimum hamming distance it returns the similar image to query image.
分布式空间拓扑连接查询优化处理算法%Research on the Distributed Spatial Topological Query Optimization Algorithm
Institute of Scientific and Technical Information of China (English)
针对传统分布式数据库查询应用于分布式空间数据库查询带来的传输和处理代价高的问题,本文结合已有分布式跨边界片段连接优化方法,深入研究了分布式空间拓扑连接查询处理,提出跨边界连接优化的空间查询优化算法,丰富了传统的分布式查询的关系代数等价变换规则。同时,针对不同片段连接类型的分布式空间查询全局优化策略,实现了分布式空间查询分解与数据本地化,从而优化分布式查询中的数据传输所付出的高昂代价。最后,提出了结点归并、连接归并树、执行结点、执行计划树等分布式查询优化方法,利用相应归并和优化算法将全局空间查询转化为各个场地局部空间数据库的具体执行计划,消除分布式查询中的冗余计算,优化查询计算策略,从而解决分布式空间查询中的处理代价高的问题。通过分布式空间查询实验表明,本文的算法能够较好地提高分布式空间查询的性能。%Due to complex data structure, complicated spatial relationship and massive data volume, distributed spatial query is a time-consuming processing, which will cause high transmission and processing cost. Query pro-cessing method in traditional distributed database cannot satisfy the demands of query in distributed geospatial database. Therefore, new query methods in distributed geospatial database need to be studied. In this paper, the distributed spatial join query processing is deeply studied based on the existing optimizing methods of the con-ventional query processing in traditional distributed database, and a series of transformation rules of relational al-gebra expression based on cross-border topological join optimization rules are proposed. The processed query tree is optimized by equivalent transformation after data localization. The global optimized method of distributed spatial join query for different fragments is
Privacy-Preserving Updates to Anonymous Databases
Sivasubramanian, R.; K.P. KALIYAMURTHIE
Suppose a medical facility connected with a research institution and the researchers can use themedical details of a patient without knowing the personal details. Thus the research data base used by theresearchers must be anonymized (Sanitized). We can consider another problem in the area of census.Individuals give the private information to a trusted party (Census Bureau) and the census bureau mustpublish anonymized or sanitized version of data. So anonymization is done for privacy. Our work...
Comparison of the Personality Profiles of Inmate Anonymous and Non-Anonymous Male Addicts
Directory of Open Access Journals (Sweden)
Nasrolah Erfani
Full Text Available Aim: This study compared the personality profiles of inmate anonymous and non-anonymous male addicts. Method: The participants of study were anonymous and non-anonymous male addicts of the prisons of the Hamadan province in 1391. The population was 3130 addicts, including 627 anonymous and 2503 non-anonymous addicts. The 310 addicts were selected by stratified random sampling the sample size was determined by Cochran formula.The short-form NEO Five Factor personality questionnaire administered among selected sample. Data analyzed by descriptive statistic as frequency and percentage, also, inferential statistic as multivariate analysis of variance was run. Results: The results showed that personality profiles of anonymous and non-anonymous addicts were significantly different. That is, mean score of neuroticism in anonymous addicts was less than non anonymous. Also, mean score of extraversion was higher in anonymous addicts. Conclusion: It can be concluded that the anonymous male addicts are differ with non-anonymous male addicts in personality traits.
Performance of native SPARQL query processors
Maharajan, Shridevika
Expressing data in RDF is one approach for making data available as Linked Data on the Web. Searching such data requires an RDF database engine providing some query language. The standard query language for RDF is called SPARQL. An RDF database engine can either be a middleware on top of an existing (relational) database or a native RDF store having its own internal data repository. Organizations often have difficulties to decide which solution they should adopt because there are few comprehe...
EHR query language (EQL)--a query language for archetype-based health records.
Ma, Chunlan; Frankel, Heath; Beale, Thomas; Heard, Sam
OpenEHR specifications have been developed to standardise the representation of an international electronic health record (EHR). The language used for querying EHR data is not as yet part of the specification. To fill in this gap, Ocean Informatics has developed a query language currently known as EHR Query Language (EQL), a declarative language supporting queries on EHR data. EQL is neutral to EHR systems, programming languages and system environments and depends only on the openEHR archetype model and semantics. Thus, in principle, EQL can be used in any archetype-based computational context. In the EHR context described here, particular queries mention concepts from the openEHR EHR Reference Model (RM). EQL can be used as a common query language for disparate archetype-based applications. The use of a common RM, archetypes, and a companion query language, such as EQL, semantic interoperability of EHR information is much closer. This paper introduces the EQL syntax and provides example clinical queries to illustrate the syntax. Finally, current implementations and future directions are outlined. PMID:17911747
Study on Query Expansion of AWAR Algorithm In Information Retrieval%AWAR算法在信息检索查询扩展中的研究
Institute of Scientific and Technical Information of China (English)
According to the existing problem of that the commonly used information retrieval algorithms is low in query performance. This paper proposed an information retrieval and extended query model based on AWAR algorithm, the model first uses the traditional vector space model algorithm to carry out the initial survey of the retrieval target, and then using the minimun complete weighted confidence threshold to generate completely weighted association rules, finally extracting extension word according to the rules and getting the query results. Experiments show that the information retrieval and extended query model based on AWAR algorithm has a better retrieval performance than the traditional vector space model algorithm and the query expansion retrieval algorithm based on local context analysis.%针对目前常用的信息检索算法普遍存在查询性能不高的问题。本文提出了一种基于AWAR算法的信息检索扩展查询模型,该模型首先采用传统向量空间模型算法对检索目标进行初检,然后利用最小完全加权置信度阈值生成完全加权关联规则,最后根据规则提取扩展词,得到查询结果。实验表明,基于AWAR算法的信息检索扩展查询模型的检索性能比传统向量空间模型算法和基于局部上下文分析的查询扩展的检索算法要高。
Practical anonymity hiding in plain sight online
Loshin, Peter
For those with legitimate reason to use the Internet anonymously--diplomats, military and other government agencies, journalists, political activists, IT professionals, law enforcement personnel, political refugees and others--anonymous networking provides an invaluable tool, and many good reasons that anonymity can serve a very important purpose. Anonymous use of the Internet is made difficult by the many websites that know everything about us, by the cookies and ad networks, IP-logging ISPs, even nosy officials may get involved. It is no longer possible to turn off browser cookies to be l
Browsing the Internet: good-bye anonymity!
Computer Security Team
Do you consider browsing the Internet to be your private business? When visiting random web-sites, how far do you assume you are anonymous? Would it matter to you that Google or Facebook can profile your browsing behaviour in order to better target you with advertisements? Did you notice that you already get targeted ads when you are logged on to Google or Facebook even if you are visiting completely different websites? If matters to you, note that browsing anonymously on the Internet is far from easy. When you are connected to the Internet, you give away a variety of information: your PC's IP address, some browser settings like language or screen size, and, probably, your login information. So how private is private? You might argue that your current IP address has been picked from a pool of addresses and therefore regularly changes, so it does not necessarily always pinpoint you. On the other hand, with the dawn of IPv6 there is no need any more for shared IP addresses as the...
Mining tree-query associations in graphs
Hoekx, Eveline
New applications of data mining, such as in biology, bioinformatics, or sociology, are faced with large datasetsstructured as graphs. We introduce a novel class of tree-shapedpatterns called tree queries, and present algorithms for miningtree queries and tree-query associations in a large data graph. Novel about our class of patterns is that they can containconstants, and can contain existential nodes which are not counted when determining the number of occurrences of the patternin the data graph. Our algorithms have a number of provableoptimality properties, which are based on the theory of conjunctive database queries. We propose a practical, database-oriented implementation in SQL, and show that the approach works in practice through experiments on data about food webs, protein interactions, and citation analysis.
Optimized Query Plan Algorithm for the Nested Query
Directory of Open Access Journals (Sweden)
Chittaranjan Pradhan
Full Text Available The SQL language allows users to express the queries that have nested sub-queries in them. Optimization of nested queries has received considerable attention over the last few years. Most of the previous optimization work has assumed that at most one block is nested within any given block. The two main contributions of this report are: 1. Optimization strategies for queries that have an arbitrary number of blocks nested within any given block, and 2. a new algorithm for the execution of nested queries, involving one or more other joins, in a multi-processor environment. The new algorithm cuts down the processing costs overconventional algorithms.
Performance Oriented Query Processing In GEO Based Location Search Engines
Umamaheswari, M
Geographic location search engines allow users to constrain and order search results in an intuitive manner by focusing a query on a particular geographic region. Geographic search technology, also called location search, has recently received significant interest from major search engine companies. Academic research in this area has focused primarily on techniques for extracting geographic knowledge from the web. In this paper, we study the problem of efficient query processing in scalable geographic search engines. Query processing is a major bottleneck in standard web search engines, and the main reason for the thousands of machines used by the major engines. Geographic search engine query processing is different in that it requires a combination of text and spatial data processing techniques. We propose several algorithms for efficient query processing in geographic search engines, integrate them into an existing web search query processor, and evaluate them on large sets of real data and query traces.
Lambert, Chip
You've started down the path of jQuery Mobile, now begin mastering some of jQuery Mobile's higher level topics. Go beyond jQuery Mobile's documentation and master one of the hottest mobile technologies out there. Previous JavaScript and PHP experience can help you get the most out of this book.
A Semantic Graph Query Language
Energy Technology Data Exchange (ETDEWEB)
Kaplan, I L
Semantic graphs can be used to organize large amounts of information from a number of sources into one unified structure. A semantic query language provides a foundation for extracting information from the semantic graph. The graph query language described here provides a simple, powerful method for querying semantic graphs.
Efficient Inference Control for Open Relational Queries
Biskup, Joachim; Hartmann, Sven; Link, Sebastian; Lochner, Jan-Hendrik
We present a control mechanism for preserving confidentiality in relational databases under open queries. This mechanism is based on a reduction of costly inference control to efficient access control that has recently been developed for closed database queries. Our approach guarantees that secrets being declared in form of a confidentiality policy are not disclosed to database users even if they utilize their a priori knowledge to draw inferences. It turns out that there is no straightforwar...
Modular Responsive Web Design using Element Queries
Wiener, Lucas; Ekholm, Tomas; Haller, Philipp
Responsive Web Design (RWD) enables web applications to adapt to the characteristics of different devices such as screen size which is important for mobile browsing. Today, the only W3C standard to support this adaptability is CSS media queries. However, using media queries it is impossible to create applications in a modular way, because responsive elements then always depend on the global context. Hence, responsive elements can only be reused if the global context is exactly the same, sever...
How Do Search Engines Handle Chinese Queries?
Hong Cui; Haidar Moukdad
The use of languages other than English has been growing exponentially on the Web. However, the major search engines have been lagging behind in providing indexes and search features to handle these languages. This article explores the characteristics of the Chinese language and how queries in this language are handled by different search engines. Queries were entered in two major search engines (Google and AlltheWeb) and two search engines developed for Chinese (Sohu and Baidu). Criteria suc...
Automatic Reformulation of Children's Search Queries
Kalsbeek, van, A.; De, Wit, A.; Trieschnigg, Dolf; Vet, de, H.C.W.; Huibers, Theo; Hiemstra, Djoerd
The number of children that have access to an Internet connection (at home or at school) is large and growing fast. Many of these children search the web by using a search engine. These search engines do not consider their skills and preferences however, which makes searching difficult. This paper tries to uncover methods and techniques that can be used to automatically improve search results on queries formulated by children. In order to achieve this, a prototype of a query expander is built...
Intelligent Visual Analytics Queries
Hao, Ming C.; Dayal, Umeshwar; Keim, Daniel A.; Morent, Dominik; Schneidewind, Jörn
Visualizations of large multi-dimensional data sets, occurring in scientific and commercial applications, often reveal interesting local patterns. Analysts want to identify the causes and impacts of these interesting areas, and they also want to search for similar patterns occurring elsewhere in the data set. In this paper we introduce the Intelligent Visual Analytics Query (IVQuery) concept that combines visual interaction with automated analytical methods to support analysts in discovering ...
Range Query Processing in Multidisk Systems
Institute of Scientific and Technical Information of China (English)
In order to reduce the disk access time,a database can be stored on several simultaneously accessible disks.In this paper,we are concerned with the dynamic d-attribute database allocation problem for range queries,An allocation method,called coordinate moule allocation method,is proposed to allocate data in a d-attribute database among disks so that the maximum disk accessing concurrency can be achieved for range queries.Our analysis and experiments show that the method achieves the optimum or near-optimum parallelism for range queries.The paper offers the conditions under which the method is optimal .The worst case bounds of the performance of the method are also given.In addition,the parallel algorithm of processing range queries in described at the end of the paper.The method has been used in the statistic and scientific database management system whic is being designed by us.
Query-answering algorithms for information agents
Energy Technology Data Exchange (ETDEWEB)
Levy, A.Y.; Rajaraman, A.; Ordille, J.J.
We describe the architecture and query-answering algorithms used in the Information Manifold, an implemented information gathering system that provides uniform access to structured information sources on the World-Wide Web. Our architecture provides an expressive language for describing information sources, which makes it easy to add new sources and to model the fine-grained distinctions between their contents. The query-answering algorithm guarantees that the descriptions of the sources are exploited to access only sources that are relevant to a given query. Accessing only relevant sources is crucial to scale up such a system to large numbers of sources. In addition, our algorithm can exploit run-time information to further prune information sources and to reduce the cost of query planning.
Adding Query Privacy to Robust DHTs
DEFF Research Database (Denmark)
Backes, Michael; Goldberg, Ian; Kate, Aniket;
intermediate peers that (help to) route the queries towards their destinations. In this paper, we satisfy this requirement by presenting an approach for providing privacy for the keys in DHT queries. We use the concept of oblivious transfer (OT) in communication over DHTs to preserve query privacy without...... compromising spam resistance. Although our OT-based approach can work over any DHT, we concentrate on communication over robust DHTs that can tolerate Byzantine faults and resist spam. We choose the best-known robust DHT construction, and employ an efficient OT protocol well-suited for achieving our goal of...... obtaining query privacy over robust DHTs. Finally, we compare the performance of our privacy-preserving protocols with their more privacy-invasive counterparts. We observe that there is no increase in the message complexity and only a small overhead in the computational complexity....
Distributed anonymous discrete function computation
Hendrickx, Julien M; Tsitsiklis, John N
We propose a model for deterministic distributed function computation by a network of identical and anonymous nodes. In this model, each node has bounded computation and storage capabilities that do not grow with the network size. Furthermore, each node only knows its neighbors, not the entire graph. Our goal is to characterize the class of functions that can be computed within this model. In our main result, we provide a necessary condition for computability which we show to be nearly sufficient, in the sense that every function that violates this condition can at least be approximated. The problem of computing suitably rounded averages in a distributed manner plays a central role in our development; we provide an algorithm that solves it in time that grows quadratically with the size of the network.
[Encryption technique for linkable anonymizing].
Okamoto, Etsuji
Linkage of different records such as health insurance claims or medical records for the purpose of cohort studies or cancer registration usually requires matching with personal names and other personally identifiable data. The present study was conducted to examine the possibility of performing such privacy-sensitive procedures in a "linkable anonymizing" manner using encryption. While bidirectional communication entails encryption and deciphering, necessitating both senders and receivers sharing a common secret "key", record linkage entails only encryption and not deciphering because researchers do not need to know the identity of the linked person. This unidirectional nature relieves researchers from the historical problem of "key sharing" and enables data holders such as municipal governments and insurers to encrypt personal names in a relatively easy manner. The author demonstrates an encryption technique using readily available spread-sheet software, Microsoft Excel in a step-by-step fashion. Encoding Chinese characters into the numeric JIS codes and replacing the codes with a randomly assigned case-sensitive alphabet, all names of Japanese nationals will be encrypted into gibberish strings of alphabet, which can not be deciphered without the secret key. Data holders are able to release personal data without sacrificing privacy, even when accidental leakage occurs and researchers are still able to link records of the same name because encrypted texts, although gibberish, are unique to each name. Such a technical assurance of privacy protection is expected to satisfy the Privacy Protection Act or the Ethical Guidelines for Epidemiological Research and enhance public health research. Traditional encryption techniques, however, cannot be applied to cancer or stroke registration, because the registrar receives reports from numerous unspecified senders. The new public key encryption technique will enable disease registry in a linkable anonymizing manner. However
A Self-Encryption Remote User Anonymous Authentication Scheme Using Smart Cards
Institute of Scientific and Technical Information of China (English)
LU Rong-xing; CAO Zhen-fu; SU Ren-wang
Remote user authentication is essential in distributed network environment to protect unauthorized access of a networked system. However, most of those existing remote user authentication schemes have not provided the user identity anonymity, while user anonymity is particularly important in some practical applications.Therefore, based on self-encryption mechanism, a new remote user authentication scheme was proposed. The scheme not only has no need of maintaining a password table at the remote server, but also can protect the user's anonymity.
The Query Complexity of Finding a Hidden Permutation
DEFF Research Database (Denmark)
Afshani, Peyman; Afrawal, Manindra; Benjamin, Doerr;
the score fz(x) defined as fz(x):=maxi[0n]ji:z(j)=x(j); i.e., the length of the longest common prefix of x and z with respect to . The goal is to minimize the number of queries asked. Our main result are matching upper and lower bounds for this problem, both for deterministic and randomized query...... schemes. The deterministic query complexity is (nlogn), which, surprisingly, improves to (nloglogn) in the randomized setting. For the randomized query complexity, both the upper and lower bound are stronger than what can be achieved by standard arguments like the analysis of random queries or information......-theoretic considerations. Our proof of the (nloglogn) lower bound is based on a potential function argument, which seems to be uncommon in the query complexity literature. We find this potential function technique a very powerful tool in proving lower bounds for randomized query schemes and we expect it to find...
Anonymous pastoral care for problems pertaining to sexuality.
van Drie, A; Ganzevoort, R R; Spiering, M
Anonymous pastoral care is one of the options for help in problems pertaining to sexuality. This paper explores the topics they seek help for, the religious aspects involved, and the relation between the normativity of their church tradition on the one hand and sexual and spiritual health criteria on the other. We analyzed helpseeking questions of two protestant Christian organizations in the Netherlands providing anonymous pastoral care: Refoweb and EO-Nazorg. Sexual themes were addressed in 19 and 2.3 % of the submitted questions, respectively. Of the helpseekers, 56 % is female, 15 % male, and 29 % unknown. Questions and problems for which people seek anonymous pastoral care focus primarily on premarital abstinence, gender roles, contraception, sexual orientation and masturbation. The authority of the Bible seems to be important for questioners, especially when dealing with ethical questions. Different relations between the normativity of the church tradition and sexual and spiritual health are discussed. PMID:23784431
Co-occurrence Relation of DNS Queries Based Research on Botnet Activities
Zhiwen Wang; Lu Liu
As a new platform for launching attacks collectively, botnets have been considered as the leading security threat to the Internet in the literature. Previous works focus on how to detect zombies via some of the behavioral patterns of botnets. However, it's an important and challenging task to track the network activities of the zombies so as to have an insight into the global view of "what those zombies do" besides "who those zombies are" since it's an excl...
Anonymity in Classroom Voting and Debating
Ainsworth, Shaaron; Gelmini-Hornsby, Giulia; Threapleton, Kate; Crook, Charles; O'Malley, Claire; Buda, Marie
The advent of networked environments into the classroom is changing classroom debates in many ways. This article addresses one key attribute of these environments, namely anonymity, to explore its consequences for co-present adolescents anonymous, by virtue of the computer system, to peers not to teachers. Three studies with 16-17 year-olds used a…
Serracino Inglott, P.
Do the deviant acts carried out by the collective known as Anonymous qualify as vigilante activity, and if so, can they be justified? Addressing this question helps expose the difficulties of morally evaluating technologically enabled deviance. Anonymous is a complex, fluid actor but not as mysterio
Structure and Anonymity of the Bitcoin Transaction Graph
Directory of Open Access Journals (Sweden)
Kay Hamacher
Full Text Available The Bitcoin network of decentralized payment transactions has attracted a lot of attention from both Internet users and researchers in recent years. Bitcoin utilizes a peer-to-peer network to issue anonymous payment transactions between different users. In the currently used Bitcoin clients, the full transaction history is available at each node of the network to prevent double spending without the need for a central authority, forming a valuable source for empirical research on network structure, network dynamics, and the implied anonymity challenges, as well as guidance on the future evolution of complex payment systems. We found dynamical effects of which some increase anonymity while others decrease it. Most importantly, several parameters of the Bitcoin transaction graph seem to have become stationary over the last 12–18 months. We discuss the implications.
Anonymous Authorship Control for User-Generated Content
Directory of Open Access Journals (Sweden)
Suk-Bong LEE
Full Text Available User-Generated Content (UGC is opening up new large market in content services, and more and more people are visiting web sites to share and enjoy UGCs. These trends make many authors to move into online. Authors want to conserve their authorship and expect to publish their UGC anonymously in cases. To meet the requirements, we propose a new authorship control model based on watermarking and metadata. Authors can embed their authorship into their UGC with identities or with anonym. Even though an author publishes his UGC anonymously, he can prove his authorship without unveiling his identity via 5 methods utilizing the proposed authorship model. The proposed model and methods need no TTP and are robust even based on fragile underlying watermarking scheme.
Semantic Web Query on E-Governance Data and Designing Ontology for Agriculture Domain
Directory of Open Access Journals (Sweden)
Swaran Lata
Full Text Available Indian agriculture has made rapid progress on the a gricultural front during the past three decades and is in a queue of the major producer in the world. But still it has long way to go and meet challenges ahead such as communication, resour ces, and availability at right time at right place. The web has had an amazing existence and it has been the driving force for a cause to grow information across boundaries, enabling effect ive communication and 24x7 service availability all leading to a digital information b ased economy that we have today. Despite that, its direct influence has reached to a small percent age of human population. Since localization populated with India and the applications are trans lated and adapted for Indian users. With the possible localization of spread raw formatted India n government data, at different locations are thought to have integrated with each other using th e internet web technology as – Semantic Web Network
Application of Steganography for Anonymity through the Internet
Bahi, Jacques M; Friot, Nicolas; Guyeux, Christophe
In this paper, a novel steganographic scheme based on chaotic iterations is proposed. This research work takes place into the information hiding security framework. The applications for anonymity and privacy through the Internet are regarded too. To guarantee such an anonymity, it should be possible to set up a secret communication channel into a web page, being both secure and robust. To achieve this goal, we propose an information hiding scheme being stego-secure, which is the highest level of security in a well defined and studied category of attacks called "watermark-only attack". This category of attacks is the best context to study steganography-based anonymity through the Internet. The steganalysis of our steganographic process is also studied in order to show it security in a real test framework.
Conceptual querying through ontologies
DEFF Research Database (Denmark)
Andreasen, Troels; Bulskov, Henrik
knowledge ontology to the concepts instantiated in the collection. The notion of ontology-based similarity is briefly described, language constructs for direct navigation and retrieval of concepts in the ontology are discussed and approaches to conceptual summarization are presented....... motivated by an obvious need for users to survey huge volumes of objects in query answers. An ontology formalism and a special notion of-instantiated ontology" are introduced. The latter is a structure reflecting the content in the document collection in that; it is a restriction of a general world...
Instant Cassandra query language
Singh, Amresh
Get to grips with a new technology, understand what it is and what it can do for you, and then get to work with the most important features and tasks. It's an Instant Starter guide.Instant Cassandra Query Language is great for those who are working with Cassandra databases and who want to either learn CQL to check data from the console or build serious applications using CQL. If you're looking for something that helps you get started with CQL in record time and you hate the idea of learning a new language syntax, then this book is for you.
RESEARCH ON ANONYMOUS COMMUNICATION TECHNOLOGIES IN AD HOC NETWORKS%无线 Ad hoc 网络匿名通信技术研究
Institute of Scientific and Technical Information of China (English)
王秀芝; 石志东; 房卫东; 张小珑; 单联海
无线 Ad hoc 网络(MANET)的多跳、自组织、无固定设施以及运算资源有限等特性,使得传统网络中复杂度高的安全算法难以应用于其中。而采用与匿名技术相结合的安全机制,可较好地解决节点隐私和通信关系保密的安全问题。针对现有的匿名技术,采用对比分析的方法,对传统网络的匿名技术进行分析,总结技术上的优缺点,研究 Ad hoc 网络的匿名技术,并对比分析各种匿名通信协议的安全性能,为后续的研究与应用提供帮助。%Due to the features of Ad hoc networks such as multi-hop,self-organisation,non-infrastructure and limited resource,the security algorithms with high complexity in traditional networks are hard to be used in it.However to use the security mechanism combining with anonymous technology can well solve the security problem in regard to nodes'privacy and communication relationship secret.In this paper,targeted at existing anonymous technologies,we analyse their use in traditional networks with the method of comparative analysis, summarise the advantages and disadvantages in terms of technology,and meanwhile study the anonymous technologies used in Ad hoc networks,as well as compare and analyse the security performances of various anonymous communication protocol,these provide the help for subsequent researches and applications.
What's beyond query by example?
Boujemaa, Nozha; Fauqueur, Julien; Gouet, Valérie
Over the last ten years, the crucial problem of information retrieval in multimedia documents has boosted research activities in the field of visual appearance indexing and retrieval by content. In the early research years, the concept of the «query by visual example» (QBVE) has been proposed and shown to be relevant for visual information retrieval. It is obvious that QBVE is not able to satisfy the multiple visual search usage requirements. In this paper, we focus on two major approaches th...
Authority and Hierarchy within Anonymous Internet Relay Chat Networks
Directory of Open Access Journals (Sweden)
Stewart Kenton Bertram
Full Text Available 'The protest group Anonymous has emerged as one of the most significant social movements of recent years, announcing their arrival as a globally recognized brand with regular disruptive cyber attacks and the leak of large volumes of sensitive data. Despite the obvious significance of Anonymous, to date, little academic research has been focused on what role hierarchy and internal authority play (if any within the group. Bespoke software was used to structure over 5000 examples of IRC log files, so that a base line descriptive statistical picture could be drawn, as well as a more granular enumeration of the privileges associated with individual users.'
Anonymous authentication protocol for multi-services in wireless environments
Institute of Scientific and Technical Information of China (English)
To provide mutual authentication among users, wireless networks, and service providers in roaming wireless environments, this article presents an anonymous authentication and access control protocol. Bases on this protocol, entities of different trusted domains can mutually authenticate each other and preserve the anonymity of users. Hybrid cryptosystem, secret splitting, and hash chains are used in the protocol, which decrease computational loads and establish trusted relations for both entities. The proposed protocol has the least computation complexity compared with other protocols, whereas, the security has been significantly improved.
Study and Practice of the Anonymity Technology Model for Electronic Commerce Based on MPLS%基于MPLS的电子商务匿名技术模型研究与实践
Institute of Scientific and Technical Information of China (English)
解争龙; 吴振强; 弋改珍; 王芳
电子商务作为贸易手段已经进入人们的日常生活,如何保护商业机密、个人隐私是电子商务贸易中急需解决的问题.根据MPLS工作原理,在Onion匿名技术的基础上,建立基于MPLS的电子商务匿名模型,使用Nettrace对纯Onion匿名模型与基于MPLS匿名模型从安全和效率进行了比较.结果表明,基于MPLS匿名技术在保护用户隐私的同时,提高Onion匿名模型的通信效率.%Electronic Commerce has stepped into the daily life of people.But how to protect the business confidentiality and personal privacy is one of the problems resolved quickly.According to the operating principle of MPLS,on the anonymity technology of Onion,their security and efficiency has been compared for the anonymity models of the pure Onion and the MPLS.The results show that the anonymity technology of MPLS-based protected the user's privacy,while developed the efficiency of the model of Onion.
On the Editor's Role in the Experts-Anonymously-Reviewing System%论责任编辑在专家匿名审稿制中的主导作用
Institute of Scientific and Technical Information of China (English)
By analyzing the status of the academic journal reviewing system and the problems springing out in the current experts-anonymously-reviewing system, this essay discusses on the common cognitive misunderstandings of the experts-anonymously-reviewing system,which still needs further improvement. It proposes that, in addition to highlighting the experts'subjectivity, we should strengthen the editor's leading role in the experts-anonymously-reviewing system.%分析了学术期刊审稿制度的现状,论述了当前学术期刊界普遍采用的专家匿名审稿制需要注意的问题,剖析了常见的专家匿名审稿制的认识误区,建议完善专家匿名审稿制度,在发挥专家的主体作用的同时,应大力加强责任编辑在专家匿名审稿制度中的主导作用.
Intelligent Database Flexible Querying System by Approximate Query Processing
Tlili, Oussama; Ounelli, Habib
Database flexible querying is an alternative to the classic one for users. The use of Formal Concepts Analysis (FCA) makes it possible to make approximate answers that those turned over by a classic DataBase Management System (DBMS). Some applications do not need exact answers. However, flexible querying can be expensive in response time. This time is more significant when the flexible querying require the calculation of aggregate functions ("Sum", "Avg", "Count", "Var" etc.). In this paper, we propose an approach which tries to solve this problem by using Approximate Query Processing (AQP).
基于HTML5+jQuery Mobile的移动Web应用开发研究%Study of mobile web application development based on HTML5 and jQuery Mobile
Institute of Scientific and Technical Information of China (English)
With the rapidly growing popularity of smart devices such as iphone and Android,mobile web technology has gradually become a new hot spot of concern,traditional site will be transferred to the mobile terminal due to market demand . Using jQuery Mobile and HTML5 to do mobile web application development, with the development of simple, short release cycle, cross-platform, cross-platform advantages . In this paper, jQuery Mobile and HTML5 mobile web application development made a presentation and analysis.%随着iphone、Android等智能设备的迅速普及,移动Web技术逐渐成为关注的新热点,传统信息类和电子商务网站因市场需求向移动终端转移。使用jQuery Mobile和HTML5做移动Web应用开发,具有开发简单,发布周期短、跨平台跨设备的优点。文章对jQuery Mobile和HTML5的移动Web应用开发做了介绍和分析。
A note on: No need to choose: How to get both a PTAS and Sublinear Query Complexity
Ailon, Nir
We revisit various PTAS's (Polynomial Time Approximation Schemes) for minimization versions of dense problems, and show that they can be performed with sublinear query complexity. This means that not only do we obtain a (1+eps)-approximation to the NP-Hard problems in polynomial time, but also avoid reading the entire input. This setting is particularly advantageous when the price of reading parts of the input is high, as is the case, for examples, where humans provide the input. Trading off query complexity with approximation is the raison d'etre of the field of learning theory, and of the ERM (Empirical Risk Minimization) setting in particular. A typical ERM result, however, does not deal with computational complexity. We discuss two particular problems for which (a) it has already been shown that sublinear querying is sufficient for obtaining a (1 + eps)-approximation using unlimited computational power (an ERM result), and (b) with full access to input, we could get a (1+eps)-approximation in polynomial t...
Location-Dependent Query Processing Under Soft Real-Time Constraints
Directory of Open Access Journals (Sweden)
Zoubir Mammeri
Full Text Available In recent years, mobile devices and applications achieved an increasing development. In database field, this development required methods to consider new query types like location-dependent queries (i.e. the query results depend on the query issuer location. Although several researches addressed problems related to location-dependent query processing, a few works considered timing requirements that may be associated with queries (i.e., the query results must be delivered to mobile clients on time. The main objective of this paper is to propose a solution for location-dependent query processing under soft real-time constraints. Hence, we propose methods to take into account client location-dependency and to maximize the percentage of queries respecting their deadlines. We validate our proposal by implementing a prototype based on Oracle DBMS. Performance evaluation results show that the proposed solution optimizes the percentage of queries meeting their deadlines and the communication cost.
Database query optimization based on Bat Algorithm and Cuckoo Search Algorithm%基于BACS算法的数据库查询优化
Institute of Scientific and Technical Information of China (English)
针对布谷鸟算法局部搜索能力弱、寻优精度低等缺陷,提出一种蝙蝠算法和布谷鸟算法相融合的数据库查询优化算法(BACS)。按照布谷鸟优化算法对鸟巢位置进行更新,利用蝙蝠算法的动态转换策略对鸟巢位置进一步更新,避免算法陷入局部最优;最后将BACS应用于数据库查询优化问题求解,并通过仿真实验对BACS的性能进行测试。实验结果表明,BACS加快了数据库查询优化求解的收敛速度,获得了质量更高的查询优化方案。%In order to solve the problems of bat algorithm which has low optimizing accuracy and weak local search ability, a novel query optimization method of database is proposed based on Bat Algorithm and Cuckoo Search Algorithm (BACS). Firstly, nest location is updated according to the cuckoo search optimization algorithm, and then cuckoo nest location is further replaced according to the dynamic conversion strategy in the bat algorithm and avoids falling into local optimum, finally it is applied to solve the query optimization problem of database, and the performance of BACS is tested by simulation experiments. The results show that, BACS accelerates the convergence speed of database query optimiza-tion and can obtain higher quality query optimization scheme.
Institute of Scientific and Technical Information of China (English)
Liang Jian; Ao Qingyun; Chen Ying
This letter presents an anonymous off-line electronic payment model with multiple issuing-banks and gives an implementation scheme based on the discrete logarithm problem and the random oracle model. Comparing with previous works, the proposed scheme benefits from no involvement of customer group authority and its security depends on the known difficulty of resolving general discrete logarithm problem.
Semantic Query Expansion Based on Multilingual Ontology%基于多语本体的语义查询扩展研究
Institute of Scientific and Technical Information of China (English)
司莉; 潘秋玉
查询扩展是改善信息检索结果的有效方法。针对用户获取多语言信息的需求以及当前跨语言信息检索存在的翻译歧异性问题,提出一种基于多语本体的语义查询扩展方法,介绍其基本原理、查询扩展模型及实现过程,使跨语言信息检索从字符匹配变成语义层面的匹配,实现跨语言信息检索中的查询扩展,以提高多语言信息检索的查全率和查准率。%Query expansion is an effective method to enhance information retrieval performance. Aiming at the requirements of acquiring multilingual information and solving the problems of semantic disambiguation of cross language information retrieval (CLIR), the article proposed a new semantic query expansion method based on multilingual ontology, and introduced its fundamentals, model and realization process, to turn character-matching into semantic matching for CLIR, implementing query expansion in CLIR, which may optimize system's recal and precision.
Improving web-image search results using query-relative classifiers
Krapac, Josip; Allan, Moray; Verbeek, Jakob; Jurie, Frédéric
Web image search using text queries has received considerable attention. However, current state-of-the-art approaches require training models for every new query, and are therefore unsuitable for real-world web search applications. The key contribution of this paper is to introduce generic classifiers that are based on query-relative features which can be used for new queries without additional training. They combine textual features, based on the occurence of query terms in web pages and ima...
Multi-Dimensional Top-k Dominating Queries
DEFF Research Database (Denmark)
Yiu, Man Lung; Mamoulis, Nikos
attention from the research community. This paper is an extensive study on the evaluation of topk dominating queries. First, we propose a set of algorithms that apply on indexed multi-dimensional data. Second, we investigate query evaluation on data that are not indexed. Finally, we study a relaxed variant...... of the query which considers dominance in dimensional subspaces. Experiments using synthetic and real datasets demonstrate that our algorithms significantly outperform a previous skyline-based approach. We also illustrate the applicability of this multi-dimensional analysis query by studying the......The top-k dominating query returns k data objects which dominate the highest number of objects in a dataset. This query is an important tool for decision support since it provides data analysts an intuitive way for finding significant objects. In addition, it combines the advantages of top-k and...
Index and query methods in road networks
Feng, Jun
This book presents the index and query techniques on road network and moving objects which are limited to road network. Here, the road network of non-Euclidean space has its unique characteristics such that two moving objects may be very close in a straight line distance. The index used in two-dimensional Euclidean space is not always appropriate for moving objects on road network. Therefore, the index structure needs to be improved in order to obtain suitable indexing methods, explore the shortest path and acquire nearest neighbor query and aggregation query methods under the new index structures. Chapter 1 of this book introduces the present situation of intelligent traffic and index in road network, Chapter 2 introduces the relevant existing spatial indexing methods. Chapter 3-5 focus on several issues of road network and query, they involves: traffic road network models (see Chapter 3), index structures (see Chapter 4) and aggregate query methods (see Chapter 5). Finally, in Chapter 6, the book briefly de...
An Extensive Analysis of Query by Singing/Humming System Through Query Proportion
Directory of Open Access Journals (Sweden)
Trisiladevi C. Nagavi
Full Text Available Query by Singing/Humming (QBSH is a Music Information Retrieval (MIR system with small audio excerpt as query. The rising availability of digital music stipulates effective music retrieval methods. Further, MIR systems support content based searching for music and requires no musical acquaintance. Current work on QBSH focuses mainly on melody features such as pitch, rhythm, note etc., size of databases, response time, score matching and search algorithms. Even though a variety of QBSH techniques are proposed, there is a dearth of work to analyze QBSH through query excerption. Here, we present an analysis that works on QBSH through query excerpt. To substantiate a series of experiments are conducted with the help of Mel-Frequency Cepstral Coefficients (MFCC, Linear Predictive Coefficients (LPC and Linear Predictive Cepstral Coefficients (LPCC to portray the robustness of the knowledge representation. Proposed experiments attempt to reveal that retrieval performance as well as precision diminishes in the snail phase with the growing database size.
A Study of Library Databases by Translating Those SQL Queries into Relational Algebra and Generating Query Trees
Directory of Open Access Journals (Sweden)
Santhi Lasya
Full Text Available Even in this World Wide Web era where there is unrestricted access to a lot of articles and books at a mouses click, the role of an organized library is immense. It is vital to have effective software to manage various functions in a library and the fundamental for effective software is the underlying database access and the queries used. And hence library databases become our use-case for this study. This paper starts off with considering a basic ER model of a typical library relational database. We would also list all the basic use-cases in a library management system. The next part of the paper deals with the sql queries used for performing certain functions in a library database management system. Along with the queries, we would generate reports for some of the use cases. The final section of the paper forms the crux of this library database study, wherein we would dwell on the concepts of query processing and query optimization in the relational database domain. We would analyze the above mentioned queries, by translating the query into a relational algebra expression and generating a query tree for the same. By converting algebra, we look at optimizing the query, and by generating a query tree, we would come up a cheapest cost plan.
Directory of Open Access Journals (Sweden)
M. Drlík
Full Text Available The extension of (Internet databases forceseveryone to become more familiar with techniques of datastorage and retrieval because users' success often dependson their ability to pose right questions and to be able tointerpret their answers. University programs pay moreattention to developing database programming skills than todata exploitation skills. To educate our students to become"database users", the authors intensively exploit supportivetools simplifying the production of database elements astables, queries, forms, reports, web pages, and macros.Videosequences demonstrating "standard operations" forcompleting them have been prepared to enhance out-ofclassroomlearning. The use of SQL and other professionaltools is reduced to the cases when the wizards are unable togenerate the intended construct.
The Impact of Anonymization for Automated Essay Scoring
Shermis, Mark D.; Lottridge, Sue; Mayfield, Elijah
This study investigated the impact of anonymizing text on predicted scores made by two kinds of automated scoring engines: one that incorporates elements of natural language processing (NLP) and one that does not. Eight data sets (N = 22,029) were used to form both training and test sets in which the scoring engines had access to both text and…
Online Role-Play: Anonymity, Engagement and Risk.
Bell, Maureen
Discussion of role-play focuses on a case study of an asynchronous, anonymous online role-play at an Australian university within a WebCT bulletin board that was designed as an alternative to an existing face-to-face workshop to offer more flexible access for participants. Suggests further research needs. (Author/LRW)
Anonymous pastoral care for problems pertaining to sexuality
A. van Drie; R.R. Ganzevoort; M. Spiering
Anonymous pastoral care is one of the options for help in problems pertaining to sexuality. This paper explores the topics they seek help for, the religious aspects involved, and the relation between the normativity of their church tradition on the one hand and sexual and spiritual health criteria o
Attitudes toward Spirituality and the Core Principles of Alcoholics Anonymous
Davis, S. J.; Benshoff, John J.; Koch, D. Shane
One-hundred and fifty-one students enrolled in substance abuse counselor training classes were surveyed on their attitudes about spirituality in substance abuse treatment and their beliefs about the principles of Alcoholics Anonymous (AA). Significant correlations were found between the subjects' spirituality and their attitudes toward…
An adaptive range-query optimization technique with distributed replicas
Institute of Scientific and Technical Information of China (English)
Sayar Ahmet; Pierce Marlon; Fox C.Geoffrey
Replication is an approach often used to speed up the execution of queries submitted to a large dataset. A compile-time/run-time approach is presented for minimizing the response time of 2-dimensional range when a distributed replica of a dataset exists. The aim is to partition the query payload (and its range) into subsets and distribute those to the replica nodes in a way that minimizes a client's response time. However, since query size and distribution characteristics of data (data dense/sparse regions) in varying ranges are not known a priori, performing efficient load balancing and parallel processing over the unpredictable workload is difficult. A technique based on the creation and manipulation of dynamic spatial indexes for query payload estimation in distributed queries was proposed. The effectiveness of this technique was demonstrated on queries for analysis of archived earthquake-generated seismic data records.
A novel adaptive Cuckoo search for optimal query plan generation.
Gomathi, Ramalingam; Sharmila, Dhandapani
The emergence of multiple web pages day by day leads to the development of the semantic web technology. A World Wide Web Consortium (W3C) standard for storing semantic web data is the resource description framework (RDF). To enhance the efficiency in the execution time for querying large RDF graphs, the evolving metaheuristic algorithms become an alternate to the traditional query optimization methods. This paper focuses on the problem of query optimization of semantic web data. An efficient algorithm called adaptive Cuckoo search (ACS) for querying and generating optimal query plan for large RDF graphs is designed in this research. Experiments were conducted on different datasets with varying number of predicates. The experimental results have exposed that the proposed approach has provided significant results in terms of query execution time. The extent to which the algorithm is efficient is tested and the results are documented. PMID:25215330
A Novel Adaptive Cuckoo Search for Optimal Query Plan Generation
Directory of Open Access Journals (Sweden)
Ramalingam Gomathi
Full Text Available The emergence of multiple web pages day by day leads to the development of the semantic web technology. A World Wide Web Consortium (W3C standard for storing semantic web data is the resource description framework (RDF. To enhance the efficiency in the execution time for querying large RDF graphs, the evolving metaheuristic algorithms become an alternate to the traditional query optimization methods. This paper focuses on the problem of query optimization of semantic web data. An efficient algorithm called adaptive Cuckoo search (ACS for querying and generating optimal query plan for large RDF graphs is designed in this research. Experiments were conducted on different datasets with varying number of predicates. The experimental results have exposed that the proposed approach has provided significant results in terms of query execution time. The extent to which the algorithm is efficient is tested and the results are documented.
The Risk of a Halo Bias as a Reason to Keep Students Anonymous during Grading
Malouff, John M.; Emmerton, Ashley J.; Schutte, Nicola S.
Experts have advocated anonymous grading as a means of eliminating actual or perceived evaluator bias in subjective student assessment. The utility of anonymity in assessment rests on whether information derived from student identity can unduly influence evaluation. The halo effect provides a conceptual background for why a bias might occur. In…
Providing Group Anonymity Using Wavelet Transform
Chertov, Oleg
Providing public access to unprotected digital data can pose a threat of unwanted disclosing the restricted information. The problem of protecting such information can be divided into two main subclasses, namely, individual and group data anonymity. By group anonymity we define protecting important data patterns, distributions, and collective features which cannot be determined through analyzing individual records only. An effective and comparatively simple way of solving group anonymity problem is doubtlessly applying wavelet transform. It's easy-to-implement, powerful enough, and might produce acceptable results if used properly. In the paper, we present a novel method of using wavelet transform for providing group anonymity; it is gained through redistributing wavelet approximation values, along with simultaneous fixing data mean value and leaving wavelet details unchanged (or proportionally altering them). Moreover, we provide a comprehensive example to illustrate the method.
Anonymity-Preserving Public-Key Encryption
DEFF Research Database (Denmark)
Kohlweiss, Markulf; Maurer, Ueli; Onete, Cristina;
A receiver-anonymous channel allows a sender to send a message to a receiver without an adversary learning for whom the message is intended. Wireless broadcast channels naturally provide receiver anonymity, as does multi-casting one message to a receiver population containing the intended receiver...... resource (e.g. a confidential anonymous channel) from given real resources (e.g. a broadcast channel). We define appropriate anonymous communication resources and show that a very natural resource can be constructed by using a PKE scheme which fulfills three properties that appear in cryptographic...... applying a cryptographic scheme explicit in the constructed (ideal) resource; this specifies the exact requirements for the applicability of a cryptographic scheme in a given context. It also allows to decide which of the existing security properties of such a cryptographic scheme are adequate for the...
Anonymous Agencies, Backstreet Businesses and Covert Collectives
DEFF Research Database (Denmark)
Krause Hansen, Hans; Schoeneborn, Dennis
Book review of: Anonymous Agencies, Backstreet Businesses and Covert Collectives: rethinking Organizations in the 21st Century, C. R. Scott. Stanford, CA: Stanford University Press, 2013. 272 pp. £45.90. ISBN 9780804781381......Book review of: Anonymous Agencies, Backstreet Businesses and Covert Collectives: rethinking Organizations in the 21st Century, C. R. Scott. Stanford, CA: Stanford University Press, 2013. 272 pp. £45.90. ISBN 9780804781381...
Firtman, Maximiliano
Would you like to build one mobile web application that works on iPad and Kindle Fire as well as iPhone and Android smartphones? This introductory guide to jQuery Mobile shows you how. Through a series of hands-on exercises, you'll learn the best ways to use this framework's many interface components to build customizable, multiplatform apps. You don't need any programming skills or previous experience with jQuery to get started. By the time you finish this book, you'll know how to create responsive, Ajax-based interfaces that work on a variety of smartphones and tablets, using jQuery Mobile
Disjunctive ASP with Functions: Decidable Queries and Effective Computation
Alviano, Mario; Leone, Nicola; 10.1017/S1471068410000244
Querying over disjunctive ASP with functions is a highly undecidable task in general. In this paper we focus on disjunctive logic programs with stratified negation and functions under the stable model semantics (ASP^{fs}). We show that query answering in this setting is decidable, if the query is finitely recursive (ASP^{fs}_{fr}). Our proof yields also an effective method for query evaluation. It is done by extending the magic set technique to ASP^{fs}_{fr}. We show that the magic-set rewritten program is query equivalent to the original one (under both brave and cautious reasoning). Moreover, we prove that the rewritten program is also finitely ground, implying that it is decidable. Importantly, finitely ground programs are evaluable using existing ASP solvers, making the class of ASP^{fs}_{fr} queries usable in practice.
Secure Query in Wireless Sensor Network Using Underground Parties
Directory of Open Access Journals (Sweden)
Haiping Huang
Full Text Available Recently, secure query has become a significant issue for researchers. It proposes the concept of secure multi-party query in Internet of things or sensor networks making use of "underground parties" to guarantee network security. Based on a novel network model assumption, it adopts homomorphic privacy and secure multi-party computation techniques to realize the above mentioned secure query, and then it puts forward the horizontal and vertical query algorithm in the top-k query through cooperation of underground parties. Thereafter, by the simulation tests it compares the time efficiency of the proposed algorithm with other typical sort algorithms under different top-k scenarios. At last, it analyzes the relationship between query time and number of underground party nodes.
Querying and Extracting Timeline Information from Road Traffic Sensor Data.
Imawan, Ardi; Indikawati, Fitri Indra; Kwon, Joonho; Rao, Praveen
The escalation of traffic congestion in urban cities has urged many countries to use intelligent transportation system (ITS) centers to collect historical traffic sensor data from multiple heterogeneous sources. By analyzing historical traffic data, we can obtain valuable insights into traffic behavior. Many existing applications have been proposed with limited analysis results because of the inability to cope with several types of analytical queries. In this paper, we propose the QET (querying and extracting timeline information) system-a novel analytical query processing method based on a timeline model for road traffic sensor data. To address query performance, we build a TQ-index (timeline query-index) that exploits spatio-temporal features of timeline modeling. We also propose an intuitive timeline visualization method to display congestion events obtained from specified query parameters. In addition, we demonstrate the benefit of our system through a performance evaluation using a Busan ITS dataset and a Seattle freeway dataset. PMID:27563900
Querying Big Data:Bridging Theory and Practice
Institute of Scientific and Technical Information of China (English)
樊文飞; 怀进鹏
Big data introduces challenges to query answering, from theory to practice. A number of questions arise. What queries are "tractable" on big data? How can we make big data "small" so that it is feasible to find exact query answers? When exact answers are beyond reach in practice, what approximation theory can help us strike a balance between the quality of approximate query answers and the costs of computing such answers? To get sensible query answers in big data, what else do we necessarily do in addition to coping with the size of the data? This position paper aims to provide an overview of recent advances in the study of querying big data. We propose approaches to tackling these challenging issues, and identify open problems for future research.
A Novel Adaptive Cuckoo Search for Optimal Query Plan Generation
Ramalingam Gomathi; Dhandapani Sharmila
The emergence of multiple web pages day by day leads to the development of the semantic web technology. A World Wide Web Consortium (W3C) standard for storing semantic web data is the resource description framework (RDF). To enhance the efficiency in the execution time for querying large RDF graphs, the evolving metaheuristic algorithms become an alternate to the traditional query optimization methods. This paper focuses on the problem of query optimization of semantic web data. An efficient ...
Institute of Scientific and Technical Information of China (English)
Xu Lingling; Zhang Fangguo; Wen Yamin
In ACM'CCS 2009,Camenisch,et al.proposed the Obhvious Transfer with Access Control (AC-OT) in which each item is associated with an attribute set and can only be available,on request,to the users who have all the attributes in the associated set.Namely,AC-OT achieves access control policy for conjunction of attributes.Essentially,the functionality of AC-OT is equivalent to the simplified version that we call AC-OT-SV:for each item,one attribute is associated with it,and it is requested that only the users who possess the associated attribute can obtain the item by queries.On one hand,AC-OT-SV is a special case of AC-OT when there is just one associated attribute with each item.On the other hand,any AC-OT can be realized by an AC-OT-SV.In this paper,we first present a concrete AC-OT-SV protocol which is proved to be secure in the model defined by Camenisch,et al..Then from the protocol,interestingly,a concrete Identity-Based Encryption (IBE) with Anonymous Key Issuing (AKI) is given which is just a direct application to AC-OT-SV.By comparison,we show that the AKI protocol we present is more efficient in communications than that proposed by Chow.
VMQL: A Visual Language for Ad-Hoc Model Querying
DEFF Research Database (Denmark)
Störrle, Harald
In large scale model based development, analysis level models are more like knowledge bases than engineering artifacts. Their effectiveness depends, to a large degree, on the ability of domain experts to retrieve information from them ad hoc. For large scale models, however, existing query facili...... applied to several visual modeling languages, implemented, and validated in small case studies, and several controlled experiments....... facilities are inadequate. The Visual Model Query Language (VMQL) is a novel approach that uses the respective modeling language of the source model as the query language, too. The semantics of VMQL is defined formally based on graphs, so that query execution can be defined as graph matching. VMQL has been...
"I'd Be So Much More Comfortable Posting Anonymously": Identified versus Anonymous Participation in Student Discussion Boards
Roberts, Lynne D.; Rajah-Kanagasabai, Camilla J.
Academic staff members encourage university students to use online student discussion boards within learning management systems to ask and answer questions, share information and engage in discussion. We explore the impact of anonymity on student posting behaviour. An online survey was completed by 131 second year undergraduate psychology students…
How Do Search Engines Handle Chinese Queries?
Directory of Open Access Journals (Sweden)
Hong Cui
Full Text Available The use of languages other than English has been growing exponentially on the Web. However, the major search engines have been lagging behind in providing indexes and search features to handle these languages. This article explores the characteristics of the Chinese language and how queries in this language are handled by different search engines. Queries were entered in two major search engines (Google and AlltheWeb and two search engines developed for Chinese (Sohu and Baidu. Criteria such as handling word segmentation, number of retrieved documents, and correct display and identification of Chinese characters were used to examine how the search engines handled the queries. The results showed that the performance of the two major search engines was not on a par with that of the search engines developed for Chinese.
Directory of Open Access Journals (Sweden)
Asokan M
Usability of XML Query Languages
Graaumans, J.P.M.
The eXtensible Markup Language (XML) is a markup language which enables re-use of information. Specific query languages for XML are developed to facilitate this. There are large differences between history, design goal, and syntax of the XML query languages. However, in practice these languages are
Provider Aware Anonymization Algorithm for Preserving M - Privacy
Directory of Open Access Journals (Sweden)
A. Usha Rani
Full Text Available In this paper, we consider the collaborative data publishing problem for anonymizing horizontally partitioned data at multiple data providers. We consider a new type of "insider attack" by colluding data providers who may use their own data records (a subset of the overall data in addition to the external background knowledge to infer the data records contributed by other data providers. The paper addresses this new threat and makes several contributions. First, we introduce the notion of m-privacy, which guarantees that the anonymized data satisfies a given privacy constraint against any group of up to m colluding data providers. Second, we present heuristic algorithms exploiting the equivalence group monotonicity of privacy constraints and adaptive ordering techniques for efficiently checking m-privacy given a set of records. Finally, we present a data provider-aware anonymization algorithm with adaptive m- privacy checking strategies to ensure high utility and m-privacy of anonymized data with efficiency. Experiments on real-life datasets suggest that our approach achieves better or comparable utility and efficiency than existing and baseline algorithms while providing m-privacy guarantee.
Role Engagement and Anonymity in Synchronous Online Role Play
Directory of Open Access Journals (Sweden)
Sarah Cornelius
Full Text Available Role play activities provide opportunities for learners to adopt unfamiliar roles, engage in interactions with others, and get involved in realistic tasks. They are often recommended to foster the development of soft skills and a wider perspective of the world. Such activities are widely used as an online teaching approach, with examples ranging from the simple use of email to the employment of virtual worlds and Web 2.0 technologies.This paper provides a case study of a role play activity which employs real-time anonymous discussion forums and aims to improve our understanding of effective role play and the impact of anonymity. This role play has been effective in educating learners about different perspectives on the issue of Quality in Further Education. The context and implementation of the role play are outlined, and the learners' interactions and experiences are explored using an investigative analysis of discussion transcripts and semi-structured interviews with participants. The findings suggest that role engagement and anonymity are important components for success in synchronous online role play. Evidence is presented that provides an insight into the factors which encourage role engagement, including prior experiences and contributions from peers. The impact of anonymity is also explored since many participants did not regard the study environment as real and attempted to identify their peers.
A Generic Framework for Anonymous Authentication in Mobile Networks
Institute of Scientific and Technical Information of China (English)
Jing Xu; Wen-Tao Zhu
Designing an anonymous user authentication scheme in global mobility networks is a non-trivial task because wireless networks are susceptible to attacks and mobile devices powered by batteries have limited communication,processing and storage capabilities.In this paper,we present a generic construction that converts any existing secure password authentication scheme based on a smart card into an anonymous authentication scheme for roaming services.The security proof of our construction can be derived from the underlying password authentication scheme employing the same assumptions.Compared with the original password authentication scheme,the transformed scheme does not sacrifice the authentication efficiency,and additionally,an agreed session key can be securely established between an anonymous mobile user and the foreign agent in charge of the network being visited.Furthermore,we present an instantiation of the proposed generic construction.The performance analysis shows that compared with other related anonymous authentication schemes,our instantiation is more efficient.
The anonymity paradox in patient engagement: reputation, risk and web-based public feedback.
Speed, Ewen; Davison, Charlie; Gunnell, Caroline
The UK National Health Service (NHS) has long espoused patient and public engagement. Recent years have seen increasing use of internet-based methods of collecting feedback about patient experience and public and staff views about NHS services and priorities. Often hailed as a means of facilitating participative democratic patient engagement, these processes raise a number of complex issues. A key aspect of it is the opportunity for comment to be made anonymously. Our research reveals an anonymity paradox whereby patients clearly demonstrate a perception that anonymity is a prerequisite for effective use of these feedback processes, whereas professionals demonstrate a perception that patient anonymity is a barrier to effective use. The risks of anonymity are constructed very differently by patients and professionals. Patient concerns around anonymity were not motivated by a general concern about a loss of privacy, but more that a positive identification might compromise future care. For professionals, concerns were voiced more around risks of reputational damage for specific practitioners or practices (in that anyone could say anything) and also that this anonymous feedback was available publicly and that it might go against the medical opinion of the professional. These concerns pointed to important differences in perceptions of patient and professional vulnerability. In the qualitative analysis that follows the key finding was that while anonymity makes service users feel less vulnerable, it can have the opposite effect on managers and clinical staff. This raises important implications for the use and utility of internet-based methods of collecting patient feedback. PMID:26879526
Web Database Schema Identification through Simple Query Interface
Lin, Ling; Zhou, Lizhu
Web databases provide different types of query interfaces to access the data records stored in the backend databases. While most existing works exploit a complex query interface with multiple input fields to perform schema identification of the Web databases, little attention has been paid on how to identify the schema of web databases by simple query interface (SQI), which has only one single query text input field. This paper proposes a new method of instance-based query probing to identify WDBs' interface and result schema for SQI. The interface schema identification problem is defined as generating the fullcondition query of SQI and a novel query probing strategy is proposed. The result schema is also identified based on the result webpages of SQI's full-condition query, and an extended identification of the non-query attributes is proposed to improve the attribute recall rate. Experimental results on web databases of online shopping for book, movie and mobile phone show that our method is effective and efficient.
DEFF Research Database (Denmark)
Pedersen, Torben Bach; Gu, Junmin; Shoshani, Arie;
inherent in data in non-standard applications are not accommodated well by OLAP systems. In contrast, object database systems are built to handle such complexity, but do not support OLAP-type querying well. This paper presents the concepts and techniques underlying a flexible, "multi-model" federated...... support queries that involve data in object databases. The language permits selection criteria that reference object data, queries that return combinations of OLAP and object data, and queries that group dimensional data according to object data. The system is designed to be aggregation-safe, in the sense...... that it exploits the aggregation semantics of the data to prevent incorrect or meaningless query results. These capabilities may also be integrated into existing languages. It is shown how to integrate relational and XML data using the technology. A prototype implementation of the system is reported...
De Rosa, Aurelio
Filled with practical, step-by-step instructions and clear explanations for the most important and useful tasks. Instant jQuery Selectors follows a simple how-to format with recipes aimed at making you well versed with the wide range of selectors that jQuery has to offer through a myriad of examples.Instant jQuery Selectors is for web developers who want to delve into jQuery from its very starting point: selectors. Even if you're already familiar with the framework and its selectors, you could find several tips and tricks that you aren't aware of, especially about performance and how jQuery ac
Querying dynamic communities in online social networks
Institute of Scientific and Technical Information of China (English)
Li WEIGANG; Edans F.O.SANDES; Jianya ZHENG; Alba C.M.A.de MELO; Lorna UDEN
Online social networks (OSNs) offer people the opportunity to join communities where they share a common interest or objective. This kind of community is useful for studying the human behavior, diffusion of information, and dynamics of groups. As the members of a community are always changing, an efficient solution is needed to query information in real time. This paper introduces the Follow Model to present the basic relationship between users in OSNs, and combines it with the MapReduce solution to develop new algorithms with parallel paradigms for querying. Two models for reverse relation and high-order relation of the users were implemented in the Hadoop system. Based on 75 GB message data and 26 GB relation network data from Twitter, a case study was realized using two dynamic discussion communities:#musicmonday and #beatcancer. The querying performance demonstrates that the new solution with the implementation in Hadoop significantly improves the ability to find useful information from OSNs.
Metadata Challenge for Query Processing Over Heterogeneous Wireless Sensor Network
Komalavalli, C
Wireless sensor networks become integral part of our life. These networks can be used for monitoring the data in various domain due to their flexibility and functionality. Query processing and optimization in the WSN is a very challenging task because of their energy and memory constraint. In this paper, first our focus is to review the different approaches that have significant impacts on the development of query processing techniques for WSN. Finally, we aim to illustrate the existing approach in popular query processing engines with future research challenges in query optimization.
Annotating URLs with query terms: What factors predict reliable annotations?
Verberne, S.; Hinne, M.; van der Heijden, M.; Kraaij, Wessel; D'hondt, E.K.L.; Weide, Theo van der
A number of recent studies have investigated the relation be-ween URLs and associated query terms from search engine log files. In [5], the query terms associated with the domain of a URL were used as features for a URL classification task. The idea is that query terms that lead to successful classification of a URL are reliable semantic descriptors of the URL content. We follow up on this work by investigating which properties of a URL and its associated query terms predict the classificatio...
Transfer active learning by querying committee
Institute of Scientific and Technical Information of China (English)
Hao SHAO; Feng TAO; Rui XU
In real applications of inductive learning for classifi cation, labeled instances are often defi cient, and labeling them by an oracle is often expensive and time-consuming. Active learning on a single task aims to select only informative unlabeled instances for querying to improve the classifi cation accuracy while decreasing the querying cost. However, an inevitable problem in active learning is that the informative measures for selecting queries are commonly based on the initial hypotheses sampled from only a few labeled instances. In such a circumstance, the initial hypotheses are not reliable and may deviate from the true distribution underlying the target task. Consequently, the informative measures will possibly select irrelevant instances. A promising way to compensate this problem is to borrow useful knowledge from other sources with abundant labeled information, which is called transfer learning. However, a signifi cant challenge in transfer learning is how to measure the similarity between the source and the target tasks. One needs to be aware of different distributions or label assignments from unrelated source tasks;otherwise, they will lead to degenerated performance while transferring. Also, how to design an effective strategy to avoid selecting irrelevant samples to query is still an open question. To tackle these issues, we propose a hybrid algorithm for active learning with the help of transfer learning by adopting a divergence measure to alleviate the negative transfer caused by distribution differences. To avoid querying irrelevant instances, we also present an adaptive strategy which could eliminate unnecessary instances in the input space and models in the model space. Extensive experiments on both the synthetic and the real data sets show that the proposed algorithm is able to query fewer instances with a higher accuracy and that it converges faster than the state-of-the-art methods.
Challenging More Updates: Towards Anonymous Re-publication of Fully Dynamic Datasets
Li, Feng
Most existing anonymization work has been done on static datasets, which have no update and need only one-time publication. Recent studies consider anonymizing dynamic datasets with external updates: the datasets are updated with record insertions and/or deletions. This paper addresses a new problem: anonymous re-publication of datasets with internal updates, where the attribute values of each record are dynamically updated. This is an important and challenging problem for attribute values of records are updating frequently in practice and existing methods are unable to deal with such a situation. We initiate a formal study of anonymous re-publication of dynamic datasets with internal updates, and show the invalidation of existing methods. We introduce theoretical definition and analysis of dynamic datasets, and present a general privacy disclosure framework that is applicable to all anonymous re-publication problems. We propose a new counterfeited generalization principle alled m-Distinct to effectively anon...
Anonimos: An LP based Approach for Anonymizing Weighted Social Network Graphs
Das, Sudipto; Abbadi, Amr El
The increasing popularity of social networks has initiated a fertile research area in information extraction and data mining. Anonymization of these social graphs is important to facilitate publishing these data sets for analysis by external entities. Prior work has concentrated mostly on node identity anonymization and structural anonymization. But with the growing interest in analyzing social networks as a weighted network, edge weight anonymization is also gaining importance. We present An\\'onimos, a Linear Programming based technique for anonymization of edge weights that preserves linear properties of graphs. Such properties form the foundation of many important graph-theoretic algorithms such as shortest paths problem, k-nearest neighbors, minimum cost spanning tree, and maximizing information spread. As a proof of concept, we apply An\\'onimos to the shortest paths problem and its extensions, prove the correctness, analyze complexity, and experimentally evaluate it using real social network data sets. O...
基于UDT协议的印章查询系统%Seal querying system based on UDT protocol
Institute of Scientific and Technical Information of China (English)
张帝; 张宇
鉴于TCP协议的低效性和UDP协议的不可靠性,提出一种运用了新的可靠UDP协议(UDT)的印章查询系统,大大提高了数据传输的可靠性,同时引入Tinyxml以及Zlib技术来实现印章查询的功能.由于采用新的数据传输协议,并引入相应的拥塞控制和数据可靠性控制机制,使得印章查询系统的效率能够满足用户的需求.%Concerning the inefficiency of TCP protocol and the unreliability of UDP protocol, the seal querying system with a novel and reliable UDP protocol (UDT), greatly increased the reliability of data transmission, and achieved its seal querying function by applying the technology of Tinyxml and Zlib. Due to the employment of the new data transfer protocol and relevant congestion control and data reliability mechanism, the users' needs can be greatly met with the efficiency of the proposed system.
Le mythe de la démonstrabilité résiste-t-il encore ? Remarques sur l'orientation des réponses anonymes Is the myth of demonstrability still valid? Comments on the orientation of anonymous answers
Directory of Open Access Journals (Sweden)
Paola Basso
Full Text Available La Preisfrage de 1763 était, à l'époque, incroyablement actuelle. En effet, autour de 1761, à l'Académie de Berlin et en dehors d'elle, une somme de facteurs vint menacer la supériorité incontestée de la méthode démonstrative. Même si l'optimisme suscité par les mathématiques était encore victorieux, le paradigme de la certitude absolue était imperceptiblement en train de se transformer. On se distanciait d'un certain cartésianisme et, pour utiliser le mot de Voltaire, au « compas de la mathématique » on ajoutait « le flambeau de l'expérience ». On jugeait le réquisit pur de la déduction logique trop élevé pour l'entendement humain, et l'on avait tendance à souligner les traits sensibles du plan syntaxique des figures géométriques ou des preuves des faits. Cette circonspection concernant la rhétorique de la démonstrationest bien visible dans les pages anonymes des réponses à cette Preisfrage : la plupart sont favorables à l'évidence géométrique en métaphysique, mais le scepticisme vis à vis des démonstrations mathématiques inflexibles est palpable. Le pruritus demonstrandi contenait-il déjà en lui-même, par son outrance, le germe du futur dédain pour les démonstrations en philosophie ?It was an incredibly topical question that the Berlin Academy set in 1763. Indeed, a number of factors came to threaten the undisputed superiority of the demonstrative method at and around the Berlin Academy in 1761. Even if the optimism raised by mathematics still prevailed, the paradigm of absolute certainty was changing imperceptibly. Cartesianism was becoming less popular and, to use Voltaire's word, "the torch of experience" was added to "the compass of mathematics". The pure requisite of logical deduction was deemed too demanding for human understanding. The circumspection concerning the rhetoric of demonstration is obvious in the anonymous pages of the answers to this Preisfrage
Predictors of anonymous cyber aggression: the role of adolescents' beliefs about anonymity, aggression, and the permanency of digital content.
Wright, Michelle F
Little attention has been given to whether adolescents' beliefs about anonymity and their normative beliefs about cyber aggression jointly increase their perpetration of cyber aggression. To this end, the present longitudinal study examined the moderating influence of these variables on the relationships among adolescents' attitudes toward the permanency of digital content, confidence with not getting caught, and anonymous cyber aggression (ACA) assessed 1 year later (Time 2). These associations were examined among 274 7th and 8th graders and through five technologies, including social networking sites (SNS), e-mail, instant messenger (IM), mobile phones, and chatrooms. Findings indicated that increases in Time 2 ACA and attitudes toward the permanency of digital content were more strongly related when adolescents reported greater confidence with not getting caught and higher normative beliefs concerning cyber aggression through SNS and mobile phones. In addition, higher levels of attitudes toward the permanency of digital content, confidence with not getting caught, beliefs about anonymity, and normative beliefs regarding cyber aggression were related to greater Time 2 ACA through e-mail, IM, and chatrooms. All findings are discussed in the context of adolescents' positive attitudes toward ACA, and an appeal for additional research is made to understand more about anonymity in cyberspace. PMID:24724731
Towards Verbalizing SPARQL Queries in Arabic
I. Al Agha; O. El-Radie
With the wide spread of Open Linked Data and Semantic Web technologies, a larger amount of data has been published on the Web in the RDF and OWL formats. This data can be queried using SPARQL, the Semantic Web Query Language. SPARQL cannot be understood by ordinary users and is not directly accessible to humans, and thus they will not be able to check whether the retrieved answers truly correspond to the intended information need. Driven by this challenge, natural language generation from SPA...
基于本体的语义查询扩展应用研究%Application Research of Semantic Query Expansion Based on Ontology
Institute of Scientific and Technical Information of China (English)
With the rapid development of smart city, the traditional search method based on key words can 't satisfy users. Semantic query expansion based on ontology is an important intelligent search technique which with the help of semantic information and expansion reasoning. The precision and recall can be improved and the research result can be optimized. This article studies carefully the semantic query expansion theory, built domain ontology of the computer science based on Protégé and Chinese Library Classification. In the same way, the rules are modified according to the reality. Eventually, the query expansion was used to distance education resources of smart city for personalized search with good effect.%传统的基于关键词匹配的信息检索方式已无法满足智慧城市建设进程中海量数据处理的要求,而基于本体的语义查询扩展智能化搜索技术借助于本体的语义信息与扩展推理使查询条件更符合用户意图,能够提高查全率和查准率,优化检索结果.在本体语义查询扩展技术的研究基础上,使用主流的本体编辑工具Protégé创建了一个"计算机"领域的本体,并根据现实需要进行规则修改,最终将其应用于智慧城市远程教育资源的个性化搜索中,能取得较理想的效果.
Directory of Open Access Journals (Sweden)
Vidya S. Dandagi
Full Text Available Semantic Web is a system that allows machines to understand complex human requests. Depending on the meaning semantic web replies. Semantics is the learning of the meanings of linguistic appearance. It is the main branch of contemporary linguistics. Semantics is meaning of words, text or a phrase and relations between them. RDF provides essential support to the Semantic Web. To represent distributed information RDF is created. Applications can use RDF created and process it in an adaptive manner. Knowledge representation is done using RDF standards and it is machine understandable. This paper describes the creation of a semantic web using RDF, and retrieval of accurate results using SparQL query language.
How Alcoholics Anonymous (AA) and Narcotics Anonymous (NA) Work: Cross-Disciplinary Perspectives
Krentzman, Amy R.; Robinson, Elizabeth A. R.; Moore, Barbara C.; Kelly, John F.; Laudet, Alexandre B.; White, William L.; Zemore, Sarah E.; Kurtz, Ernest; Strobbe, Stephen
Evidence from multiple lines of research supports the effectiveness and practical importance of Alcoholics Anonymous and Narcotics Anonymous. Conference presenters discussed the relationship between 12-Step participation and abstinence among various populations, including adolescents, women, and urban drug users. Insight from the arts and humanities placed empirical findings in a holistic context.
How Alcoholics Anonymous (AA) and Narcotics Anonymous (NA) Work: Cross-Disciplinary Perspectives.
Krentzman, Amy R; Robinson, Elizabeth A R; Moore, Barbara C; Kelly, John F; Laudet, Alexandre B; White, William L; Zemore, Sarah E; Kurtz, Ernest; Strobbe, Stephen
Evidence from multiple lines of research supports the effectiveness and practical importance of Alcoholics Anonymous and Narcotics Anonymous. Conference presenters discussed the relationship between 12-Step participation and abstinence among various populations, including adolescents, women, and urban drug users. Insight from the arts and humanities placed empirical findings in a holistic context. PMID:21785524
Abiteboul, Serge
The amount of data of all kinds available electronically has increased dramatically in recent years. The data resides in different forms, ranging from unstructured data in the systems to highly structured in relational database systems. Data is accessible through a variety of interfaces including Web browsers, database query languages, application-specic interfaces, or data exchange formats. Some of this data is raw data, e.g., images or sound. Some of it has structure even if the structure is often implicit, and not as rigid or regular as that found in standard database systems. Sometimes the structure exists but has to be extracted from the data. Sometimes also it exists but we prefer to ignore it for certain purposes such as browsing. We call here semi-structured data this data that is (from a particular viewpoint) neither raw data nor strictly typed, i.e., not table-oriented as in a relational model or sorted-graph as in object databases. As will seen later when the notion of semi-structured data is more precisely de ned, the need for semi-structured data arises naturally in the context of data integration, even when the data sources are themselves well-structured. Although data integration is an old topic, the need to integrate a wider variety of data- formats (e.g., SGML or ASN.1 data) and data found on the Web has brought the topic of semi-structured data to the forefront of research. The main purpose of the paper is to isolate the essential aspects of semi- structured data. We also survey some proposals of models and query languages for semi-structured data. In particular, we consider recent works at Stanford U. and U. Penn on semi-structured data. In both cases, the motivation is found in the integration of heterogeneous data.
a-diversity and k-anonymity Big Data Privacy Preservation Based on Micro-aggregation%基于微聚集的a-多样性k-匿名大数据隐私保护
Institute of Scientific and Technical Information of China (English)
程亮; 蒋凡
基于敏感信息的数据发布面临的主要问题在于如何保证数据的有用性和隐私保护。匿名化是一个很好的方法,目前有多种匿名化模型。然而大多数的模型主要侧重于使用预先定义的参数为整个数据集提供无差别的隐私保护,这并不能适应不同个体对不同敏感属性的多样性保护需求。基于此,文章提出了一种满足敏感信息的多样性非相关约束的a-多样性 k-匿名化模型;同时,设计了一个改进的微聚集算法的框架替代了传统的泛化/抑制实现匿名化。使用这个框架,能够提高数据的有用性并降低隐私泄露的风险。通过在真实数据集上进行多次试验验证了此方案的有效性。%A great challenge in privacy preservation is to trade off two important issues: data utility and privacy preservation, in publication of dataset which usually contain sensitive information. Anonymization is a well-represent approach to achieve this, and there exist several anonymity models. Most of those models mainly focus on protecting privacy exerting identical protection for the whole table with pre-deifned parameters. This could not meet the diverse requirements of protection degrees varied with different sensitive value. Motivated by this, this paper firstly proposes an a-diversity k-anonymity model to satisfy diversity deassociation for sensitive information, and meanwhile, designs a framework based on an improved microaggregation algorithm, as an alternative to generalization/suppression to achieve anonymization. By using this framework, we improve the data utility and decrease the disclosure risk of privacy disclosure. We conduct several experiments to validate our schemes.
Performance evaluation of various K- anonymity techniques
Maheshwarkar, Nidhi; Pathak, Kshitij; Chourey, Vivekanand
Today's advanced scenario where each information is available in one click, data security is the main aspect. Individual information which sometimes needs to be hiding is easily available using some tricks. Medical information, income details are needed to be kept away from adversaries and so, are stored in private tables. Some publicly released information contains zip code, sex, birth date. When this released information is linked with the private table, adversary can detect the whole confidential information of individuals or respondents, i.e. name, medical status. So to protect respondents identity, a new concept k-anonymity is used which means each released record has at least (k-1) other records in the release whose values are distinct over those fields that appear in the external data. K-anonymity can be achieved easily in case of single sensitive attributes i.e. name, salary, medical status, but it is quiet difficult when multiple sensitive attributes are present. Generalization and Suppression are used to achieve k-anonymity. This paper provides a formal introduction of k-anonymity and some techniques used with it l-diversity, t-closeness. This paper covers k-anonymity model and the comparative study of these concepts along with a new proposed concept for multiple sensitive attributes.
Tracking Federated Queries in the Linked Data
Nassopoulos, Georges; Serrano-Alvarado, Patricia; Molli, Pascal; Desmontils, Emmanuel
Federated query engines allow data consumers to execute queries over the federation of Linked Data (LD). However, as feder-ated queries are decomposed into potentially thousands of subqueries distributed among SPARQL endpoints, data providers do not know fed-erated queries, they only know subqueries they process. Consequently, unlike warehousing approaches, LD data providers have no access to secondary data. In this paper, we propose FETA (FEderated query TrAcking), a query tracking algorithm...
Directory of Open Access Journals (Sweden)
P. Ranjani
Full Text Available Relational query databases provide a high level declarative interface to access data stored in relational databases. Two key components of the query evaluation component of a SQL database system are the query optimizer and the query execution engine. System R optimization framework since this was a remarkably elegant approach that helped fuel much of the subsequent work in optimization. Transparent and efficient evaluations of preferential queries are allowed by relational database systems. This results in experimenting extensive evaluation on two real world data sets which illustrates the feasibility and advantages of the framework. Early pruning of results based on score or confidence during query processing are enabled by combining the prefer operator with the rank and rank join operators. During preference evaluation, both the conditional and the scoring part of a preference are used. The conditional part acts as a soft constraint that determines which records are scored without disqualifying any duplicates from the query result. To introduce a preferences mapping relational data model that extends database with profile preferences for query optimizing and an extended algebra that captures the essence of processing queries with ranking method. Based on a set of algebraic properties and a cost model that to propose, to provide several query optimization strategies for extended query plans. To describe a query execution algorithm that blends preference evaluation with query execution, while making effective use of the native query engine.
A Knowledge Based Approach for Query Optimization in Preferential Mapping Relational Databases
Directory of Open Access Journals (Sweden)
Full Text Available Relational query databases provide a high level declarative interface to access data stored in relational databases. Two key components of the query evaluation component of a SQL database system are the query optimizer and the query execution engine. System R optimization framework since this was a remarkably elegant approach that helped fuel much of the subsequent work in optimization. Transparent and efficient evaluations of preferential queries are allowed by relational database systems. This results in experimenting extensive evaluation on two real world data sets which illustrates the feasibility and advantages of the framework. Early pruning of results based on score or confidence during query processing are enabled by combining the prefer operator with the rank and rank join operators. During preference evaluation, both the conditional and the scoring part of a preference are used. The conditional part acts as a soft constraint that determines which records are scored without disqualifying any duplicates from the query result. To introduce a preferences mapping relational data model that extends database with profile preferences for query optimizing and an extended algebra that captures the essence of processing queries with ranking method. Based on a set of algebraic properties and a cost model that to propose, to provide several query optimization strategies for extended query plans. To describe a query execution algorithm that blends preference evaluation with query execution, while making effective use of the native query engine.
基于异构双极信息的模糊查询研究%Study on Fuzzy Query of Heterogeneous Bipolarity Information
Institute of Scientific and Technical Information of China (English)
赵法信; 金义富
在日常生活中,人们在表达其需求时,常常会对同一事物同时使用正面的描述和负面的描述.由于不要求正、负面的描述必须相互对称,此类具有异构语义的信息被称为异构双极信息.传统信息系统中的模糊查询方法,不能很好地处理用户查询需求中所含有的异构双极信息.基于经典数据库,以在模糊查询中能够处理异构双极信息为目标,将Vague集引入到异构双极信息的建模,给出了一个由独立的满意度和不满意度所组成的异构双极信息查询满意度模型框架,并在此基础上讨论了包含正面、负面信息的异构双极信息查询处理方法.%In daily life,people often give both positive and negative information to state what they desire and what they reject for the same things.Because positive and negative statements do not necessarily mirror each other,this results in so-called heterogeneous bipolar information.The fuzzy query in traditional information systemss does not adequately support the handling of heterogeneous bipolar information.In this paper,based on the regular database,vague set was introduced into the modeling of heterogeneous bipolar information for dealing with heterogeneous bipolar information in fuzzy queries,and a bipolar query satisfaction modelling framework which is based on couples that consist of an independent degree of satisfaction and degree of dissatisfaction was given,then the processing of heterogeneous bipolar queries that contain both positive and negative criteria was also discussed.
PBS: An Economical Natural Language Query Interpreter.
Samstag-Schnock, Uwe; Meadow, Charles T.
Reports on the design and implementation of PBS (Parsing, Boolean Recognition, Stemming), a software module used in conjunction with an intermediary program to interpret natural language queries used for online database searching. Results of a test of the initial version, which is designed for use with bibliographic files, are reported. (13…
Approximate Nearest Neighbor Queries among Parallel Segments
DEFF Research Database (Denmark)
Emiris, Ioannis Z.; Malamatos, Theocharis; Tsigaridas, Elias
We develop a data structure for answering efficiently approximate nearest neighbor queries over a set of parallel segments in three dimensions. We connect this problem to approximate nearest neighbor searching under weight constraints and approximate nearest neighbor searching on historical data...
General Services Administration — Schedule Sales Query presents sales volume figures as reported to GSA by contractors. The reports are generated as quarterly reports for the current year and the...
Beighley, Lynn
Learn how jQuery can make your Web page or blog stand out from the crowd!. jQuery is free, open source software that allows you to extend and customize Joomla!, Drupal, AJAX, and WordPress via plug-ins. Assuming no previous programming experience, Lynn Beighley takes you through the basics of jQuery from the very start. You'll discover how the jQuery library separates itself from other JavaScript libraries through its ease of use, compactness, and friendliness if you're a beginner programmer. Written in the easy-to-understand style of the For Dummies brand, this book demonstrates how you can a