After having been a term of reflection in philosophy as well as psychology for ages, the fascination with human wisdom finally reaches the realms of computerscience. In comparison to the first philosophical definitio...
详细信息
After having been a term of reflection in philosophy as well as psychology for ages, the fascination with human wisdom finally reaches the realms of computerscience. In comparison to the first philosophical definition attempts, that date back to Aristotle (384BC-322BC), the efforts in information science during the late 1980s seem quite recent. Nevertheless have there been astonishing new insights provided by cognitive science since those first formal modelizations were designed - findings that strongly suggest a reconsideration of our current formalization of wisdom in the computerscience domain. We suggest to establish a new, integrated view on the concept of wisdom, using the insights of cognitive sciences. Furthermore, we discuss possible measures that are able to cover at least fundamental properties of wisdom including its vague aspects.
Deep Web databases contain more than 90% of pertinent information of the Web. Despite their importance, users don't profit of this treasury. Many deep web services are offering competitive services in term of pric...
详细信息
Deep Web databases contain more than 90% of pertinent information of the Web. Despite their importance, users don't profit of this treasury. Many deep web services are offering competitive services in term of prices, quality of service, and facilities. As the number of services is growing rapidly, users have difficulty to ask many web services in the same time. In this paper, we imagine a system where users have the possibility to formulate one query using one query interface and then the system translates query to the rest of query interfaces. However, interfaces are created by designers in order to be interpreted visually by users, machines can not interpret query from a given interface. We propose a new approach which emulates capacity of interpretation of users and extracts query from deep web query interfaces. Our approach has proved good performances on two standard datasets.
Deep Web databases contain more than 90% of pertinent information of the Web. Despite their importance, users don't profit of this treasury. Many deep web services are offering competitive services in term of pric...
详细信息
Deep Web databases contain more than 90% of pertinent information of the Web. Despite their importance, users don't profit of this treasury. Many deep web services are offering competitive services in term of prices, quality of service, and facilities. As the number of services is growing rapidly, users have difficulty to ask many web services in the same time. In this paper, we imagine a system where users have the possibility to formulate one query using one query interface and then the system translates query to the rest of query interfaces. However, interfaces are created by designers in order to be interpreted visually by users, machines can not interpret query from a given interface. We propose a new approach which emulates capacity of interpretation of users and extracts query from deep web query interfaces. Our approach has proved good performances on two standard datasets.
Many heavy crimes committed such as murders or robberies frequently involve firearms, particularly pistols. In order to solve the crime cases, firearm identification is becoming vital. Unique marks are left on the bul...
详细信息
Many heavy crimes committed such as murders or robberies frequently involve firearms, particularly pistols. In order to solve the crime cases, firearm identification is becoming vital. Unique marks are left on the bullet and the cartridge case when a firearm is fired. The firing pin impression is one of the most vital marks on any cartridge case. In this study, a total of 68 features of firing pin impression images – 20 basic statistical features, and 48 geometric moment features up to the sixth order – were extracted from three regions of the firing pin impression image, namely whole, centre and ring images. Five different types of pistol of the Parabellum Vector SPI 9 mm model were tested, where 50 bullets were fired from each pistol. Preliminary analysis using Pearson correlation shows that the features are significantly highly correlated. Therefore principal component analysis (PCA) was used to analyze the interrelationship among the features and combine them into a smaller set of factors while maintaining maximum information of the original patterns. PCA has reduced the dimensionality of the features into nine significant components of features. Discriminant analysis was used to identify the types of pistols used based on the new components. A total of 85.2% of the images were correctly classified according to the pistols used using cross-validation under discriminant analysis. The result demonstrates the potential of using PCA to reduce the dimensions of the numerical features towards an efficient firearm identification system.
We present an I/O-efficient algorithm for topologically sorting directed acyclic graphs (DAGs). No provably I/O-efficient algorithm for this problem is known. Similarly, the performance of our algorithm, which we call...
详细信息
We present a language independent approach for conflation that does not depend on predefined rules or prior knowledge of the target language. The proposed unsupervised method is based on an enhancement of the pure n-g...
详细信息
We study the following problem: Given an array A storing N real numbers, preprocess it to allow fast reporting of the K smallest elements in the subarray A[i,j] in sorted order, for any triple (i,j,K) with 1 ≤ i ≤ j...
详细信息
ISBN:
(纸本)9780898719932
We study the following problem: Given an array A storing N real numbers, preprocess it to allow fast reporting of the K smallest elements in the subarray A[i,j] in sorted order, for any triple (i,j,K) with 1 ≤ i ≤ j ≤ N and 1 ≤ K ≤ j - i + 1. We are interested in scenarios where the array A is large, necessitating an I/O-efíicient solution. For a parameter / with 1 m n, we construct a data structure that uses 0((N/f)logmn) space and achieves a query bound of O(logB N + fK/B) I/Os,1 where B is the block size, M is the size of the main memory, n :- N/B, and m := M/B. Our main contribution is to show that this solution is nearly optimal. To be precise, we show that achieving a query bound of O(logαn + fK/B) I/Os, for any constant a, requires Ω(N f-1logMn/log(f-1logMn)) space assuming B = Ω(logN). For M ≥ B1+Ε, this is within a log logm n factor of the upper bound. The lower bound assumes indivisibility of records and holds even if we assume K is always set to j - 1 + 1. We also show that it is the requirement that the K smallest elements be reported in sorted order which makes the problem hard. If the K smallest elements in the query range can be reported in any order, then we can obtain a linear-size data structure with a query bound of O(logB N + K/B) I/Os.
The signature quadratic form distance has been introduced as an adaptive similarity measure coping with flexible content representations of multimedia data. While this distance has shown high retrieval quality, its hi...
详细信息
暂无评论