变形指纹查询失误1例

1案例资料 1999年3月26日，重庆市某地发生一起杀人案，经现场勘查，办案人员在现场提取了一枚指纹痕迹。本案经多年工作均未发现犯罪嫌疑人，成为一起积案。2003年重庆市公安局建立指纹自动识别系统，办案人员将该指纹录入系统，经多人多次反复翻查，均无结果。直到2011年6月25日，办案人员再次对该指纹特征重新标注进行翻查，终于比中犯罪嫌疑人向某，从而破获了这起10年前积存的命案。

Optimization of RDF link traversal based query execution

Aiming at the problem that only some types of SPARQL （ simple protocal and resource description framework query language） queries can be answered by using the current resource description framework link traversal based query execution （RDF-LTE） approach, this paper discusses how the execution order of the triple pattern affects the query results and cost based on concrete SPARQL queries, and analyzes two properties of the web of linked data, missing backward links and missing contingency solution. Then three heuristic principles for logic query plan optimization, namely, the filtered basic graph pattern （FBGP） principle, the triple pattern chain principle and the seed URIs principle, are proposed. The three principles contribute to decrease the intermediate solutions and increase the types of queries that can be answered. The effectiveness and feasibility of the proposed approach is evaluated. The experimental results show that more query results can be returned with less cost, thus enabling users to develop the full potential of the web of linked data.

Query Expansion for Chinese Information Retrieval by Using a Decaying Co-occurrence Model

Query expansion with thesaurus is one of the useful techniques in modern information retrieval (IR). In this paper, a method of query expansion for Chinese IR by using a decaying co-occurrence model is proposed and realized. The model is an extension of the traditional co-occurrence model by adding a decaying factor that decreases the mutual information when the distance between the terms increases. Experimental results on TREC-9 collections show this query expansion method results in significant improvements over the IR without query expansion.

Semantic-based query processing for relational data integration

To solve the query processing correctness problem for semantic-based relational data integration,the semantics of SAPRQL（simple protocol and RDF query language） queries is defined.In the course of query rewriting,all relative tables are found and decomposed into minimal connectable units.Minimal connectable units are joined according to semantic queries to produce the semantically correct query plans.Algorithms for query rewriting and transforming are presented.Computational complexity of the algorithms is discussed.Under the worst case,the query decomposing algorithm can be finished in O（n2） time and the query rewriting algorithm requires O（nm） time.And the performance of the algorithms is verified by experiments,and experimental results show that when the length of query is less than 8,the query processing algorithms can provide satisfactory performance.

An AND-LUT Based Hybrid FPGA Architecture

A new hybrid FPGA architecture is proposed. The logic tile,which consists of a logic cluster and related connection boxes （CBs）, can be configured as either programmable logic arrays （PLAs） or look-up tables （LUTs）, This architecture can be classified as an AND-LUT array. PLAs are suitable for the implementation of high fan-in logic circuits, while LUTs are used to implement low fan-in logic circuits. As a result, the proposed hybrid FPGA architecture （HFA） is more flexible to improve logic density. Experiments based on MCNC benchmark circuits were performed in both the hybrid architecture and conventional LUT-based symmetrical FPGA architecture in term of area consumption. Preliminary results indicate that on average, the area is reduced by 46% using the new hybrid architecture.

APPROXIMATE QUERY AND CALCULATION OF RNN_k BASED ON VORONOI CELL

Reverse k nearest neighbor （RNNk） is a generalization of the reverse nearest neighbor problem and receives increasing attention recently in the spatial data index and query. RNNk query is to retrieve all the data points which use a query point as one of their k nearest neighbors. To answer the RNNk of queries efficiently, the properties of the Voronoi cell and the space-dividing regions are applied. The RNNk of the given point can be found without computing its nearest neighbors every time by using the rank Voronoi cell. With the elementary RNNk query result, the candidate data points of reverse nearest neighbors can he further limited by the approximation with sweepline and the partial extension of query region Q. The approximate minimum average distance （AMAD） can be calculated by the approximate RNNk without the restriction of k. Experimental results indicate the efficiency and the effectiveness of the algorithm and the approximate method in three varied data distribution spaces. The approximate query and the calculation method with the high precision and the accurate recall are obtained by filtrating data and pruning the search space.

Processing and optimization of UMQL-based multimedia queries

Through the mapping from UMQL （ unified multimedia query language） conditional expressions to UMQA （unified multimedia query algebra） query operations, a translation algorithm from a UMQL query to a UMQA query plan is put forward, which can generate an equivalent UMQA internal query plan for any UMQL query. Then, to improve the execution costs of UMQA query plans effectively, equivalent UMQA translation formulae and general optimization strategies are studied, and an optimization algorithm for UMQA internal query plans is presented. This algorithm uses equivalent UMQA translation formulae to optimize query plans, and makes the optimized query plans accord with the optimization strategies as much as possible. Finally, the logic implementation methods of UMQA plans, i.e., logic implementation methods of UMQA operators, are discussed to obtain useful target data from a muifirnedia database. All of these algorithms are implemented in a UMQL prototype system. Application results show that these query processing techniques are feasible and applicable.

Auto-expanded multi query examples technology in content-based image retrieval

In order to narrow the semantic gap existing in content-based image retrieval （CBIR）,a novel retrieval technology called auto-extended multi query examples （AMQE） is proposed.It expands the single one query image used in traditional image retrieval into multi query examples so as to include more image features related with semantics.Retrieving images for each of the multi query examples and integrating the retrieval results,more relevant images can be obtained.The property of the recall-precision curve of a general retrieval algorithm and the K-means clustering method are used to realize the expansion according to the distance of image features of the initially retrieved images.The experimental results demonstrate that the AMQE technology can greatly improve the recall and precision of the original algorithms.

Data partitioning based on sampling for power load streams

A novel data streams partitioning method is proposed to resolve problems of range-aggregation continuous queries over parallel streams for power industry.The first step of this method is to parallel sample the data,which is implemented as an extended reservoir-sampling algorithm.A skip factor based on the change ratio of data-values is introduced to describe the distribution characteristics of data-values adaptively.The second step of this method is to partition the fluxes of data streams averagely,which is implemented with two alternative equal-depth histogram generating algorithms that fit the different cases：one for incremental maintenance based on heuristics and the other for periodical updates to generate an approximate partition vector.The experimental results on actual data prove that the method is efficient,practical and suitable for time-varying data streams processing.

Approximate querying between heterogeneous ontologies based on association matrix

An approximate approach of querying between heterogeneous ontology-basedinformation systems based on an association matrix is proposed. First, the association matrix isdefined to describe relations between concepts in two ontologies. Then, a methodof rewriting queriesbased on the association matrix is presented to solve the ontology heterogeneity problem. Itrewrites the queries in one ontology to approximate queries in another ontology based on thesubsumption relations between concepts. The method also uses vectors to represent queries, and thencomputes the vectors with the association matrix; the disjoint relations between concepts can beconsidered by the results. It can get better approximations than the methods currently in use, whichdonot consider disjoint relations. The method can be processed by machines automatically. It issimple to implement and expected to run quite fast.

Matching algorithm for label-based integrable-ware query

Based on tree-inclusion matching, retrieval may be transformed into matching between the query tree and the integrable-ware label tree. Considering the retrieval specialities of integrable-ware, three theorems of matching are given. On this basis, the inverted-path string algorithm for the integrable-ware label tree query is proposed. This algorithm searches from leaf nodes rather than from root nodes, and considers about the path length and the total number of leaf nodes. It can terminate the failed matching as early as possible and avoid spending too much time on loop comparisons in character string matching. It utilizes the dictionary suffix order to skip much of the impossibility matching path. The experimental results show that this algorithm enhances the recall and the precision of integrable-ware query efficiency while maintaining the searching speed of the integrable-ware.

A method for publishing relational schema into DTD

This paper focuses on exporting relational data into extensible markup language (XML). First, the characteristics of both relational schemas represented by E-R diagrams and XML document type definitions (DTDs) are analyzed. Secondly, the corresponding mapping rules are proposed. At last an algorithm based on edge tables is presented. There are two key points in the algorithm. One is that the edge table is used to store the information of the relational dictionary, and this brings about the efficiency of the algorithm. The other is that structural information can be obtained from the resulting DTDs and other applications can optimize their query processes using the structural information.

Ontology-based schema matching method in web query interface integration

Deep web data integration needs to do schema matching on web query interfaces and obtain the mapping table.By introducing semantic conflicts into web query interface integration and discussing the origins and categories of the semantic conflicts,an ontology-based schema matching method is proposed.The process of the method is explained in detail using the example of web query interface integration in house domain.Conflicts can be detected automatically by checking semantic relevance degree,then the categories of the conflicts are identified and messages are sent to the conflict solver,which eliminates the conflicts and obtains the mapping table using conflict solving rules.The proposed method is simple,easy to implement and can be flexibly reused by extending the ontology to different domains.

Choosing meaningful structure data for improving web search

In order to improve the quality of web search,a new query expansion method by choosing meaningful structure data from a domain database is proposed.It categories attributes into three different classes,named as concept attribute,context attribute and meaningless attribute,according to their semantic features which are document frequency features and distinguishing capability features.It also defines the semantic relevance between two attributes when they have correlations in the database.Then it proposes trie-bitmap structure and pair pointer tables to implement efficient algorithms for discovering attribute semantic feature and detecting their semantic relevances.By using semantic attributes and their semantic relevances,expansion words can be generated and embedded into a vector space model with interpolation parameters.The experiments use an IMDB movie database and real texts collections to evaluate the proposed method by comparing its performance with a classical vector space model.The results show that the proposed method can improve text search efficiently and also improve both semantic features and semantic relevances with good separation capabilities.

Monitoring nearest neighbor queries with cache strategies

The problem of continuously monitoring multiple K-nearest neighbor (K-NN) queries with dynamic object and query dataset is valuable for many location-based applications. A practical method is to partition the data space into grid cells, with both object and query table being indexed by this grid structure, while solving the problem by periodically joining cells of objects with queries having their influence regions intersecting the cells. In the worst case, all cells of objects will be accessed once. Object and query cache strategies are proposed to further reduce the I/O cost. With object cache strategy, queries remaining static in current processing cycle seldom need I/O cost, they can be returned quickly. The main I/O cost comes from moving queries, the query cache strategy is used to restrict their search-regions, which uses current results of queries in the main memory buffer. The queries can share not only the accessing of object pages, but also their influence regions. Theoretical analysis of the expected I/O cost is presented, with the I/O cost being about 40% that of the SEA-CNN method in the experiment results.

Power Network Lightning Accident Quick Inquiry with the Lightning Location System

At present, lightning is one of the 10 natural disasters, and it is also the top environmental factor of power interruption. It often causes huge losses to the electric system. The Wuhan High Voltage Institute of the State Grid Corporation of China and Huazhong University of Science and Technology have been researching and developing lightning location systems （LLSs） since the late 1980s. In the mid-1990s, a lightning detection network was created in 29 provinces and cities in China. It is primarily applied to rapidly find lightning accidents, which greatly reduces power interruption. Also, it ensures high efficiency and safe operation of the electricity system. Remarkable benefit is achieved. China＇s LLS went through an ＂orientation positioning - time difference positioning - integrated positioning＂ development process. The positioning precision, detection efficiency, degree of automation, practicability and applied range are improved. Also, a lightning information system plan of the national network has been implemented, which services the whole society.

Achieve Personalized Anonymity Through Query Blocks Exchanging

In cyberspace security,the privacy in location-based services(LBSs) becomes more critical. In previous solutions,a trusted third party(TTP) was usually employed to provide disturbance or obfuscation,but it may become the single point of failure or service bottleneck. In order to cope with this drawback,we focus on another important class,establishing anonymous group through short-range communication to achieve k-anonymity with collaborative users. Along with the analysis of existing algorithms,we found users in the group must share the same maximum anonymity degree,and they could not ease the process of preservation in a lower one. To cope with this problem,we proposed a random-QBE algorithm to put up with personalized anonymity in user collaboration algorithms,and this algorithm could preserve both query privacy and location privacy. Then we studied the attacks from passive and active adversaries and used entropy to measure user's privacy level. Finally,experimental evaluations further verify its effectiveness and efficiency.

Climate Characteristics of Thunder and Lightning in Anyang City

The research explored frequencies of different weathers caused by con-vection, characters of thunder and lightning, spatial and temporal changes, move-ment routes, geographical distribution, daily, monthly and annual changes of thunder or lightning, based on 30 years information. Furthermore, a search system of thun-derstorm in history was established, laying foundation for prevention and prepared-ness of thunderstorm in Anyang.

Urban China in Transformation:Hybrid Economy,Juxtaposed Space,and New Testing Ground for Geographical Enquiries

History has brought us into a significant moment when the majority of the human kind has taken up resi-dence in urban settlements. The focus of global urbanization has shifted to the developing world and the center of manufacturing is no longer confined to the Global North. This paper provides a periodical assessment of the current status of China's urban transformation in the global context of a shifting emphasis of industrialization and urbaniza-tion. China's phenomenal urban transformation deserves a special attention not only because of its unparalleled scale and speed but also because of its distinct trajectory of growth that does not conform to normal theoretical ex-pectations. The results of assessment revealed an urban economy with remarkable hybridity, a society that is in-creasingly stratified, polarized, and segregated, and a juxtaposed urban space undergoing restless and pervasive transformation. A decentering world should entail a decentering knowledge production. A critical reflection upon the Chinese patterns and processes of urban transformation has identified 4 main issues with great potentials for inno-vative knowledge production, namely: 1) privatization and economic development; 2) state, society, and space; 3) urbanization of capital, labor, and land; and 4) the environment and Chinese political ecology. The paper closes with the remark that a rapidly transforming urban China has presented itself as a fertile and resourceful testing ground for critical and innovative geographic enquiries.

A new approach to query expansion in information retrieval

To eliminate the mismatch between words of relevant documents and user's query and more seriousnegative effects it has on the performance of information retrieval,a method of query expansion on the ba-sis of new terms co-occurrence representation was put forward by analyzing the process of producingquery.The expansion terms were selected according to their correlation to the whole query.At the sametime,the position information between terms were considered.The experimental result on test retrievalconference(TREC)data collection shows that the method proposed in the paper has made an improve-ment of 5%～19% all the time than the language modeling method without expansion.Compared to thepopular approach of query expansion,pseudo feedback,the precision of the proposed method is competi-tive.