Efficient top-k retrieval with signatures

This paper describes a new method of indexing and searching large binary signature collections to efficiently find similar signatures, addressing the scalability problem in signature search. Signatures offer efficient computation with acceptable measure of similarity in numerous applications. However, performing a complete search with a given search argument (a signature) requires a Hamming distance calculation against every signature in the collection. This quickly becomes excessive when dealing with large collections, presenting issues of scalability that limit their applicability. Our method efficiently finds similar signatures in very large collections, trading memory use and precision for greatly improved search speed. Experimental results demonstrate that our approach is capable of finding a set of nearest signatures to a given search argument with a high degree of speed and fidelity.

Short-term traffic volume forecasting : a k-nearest neighbor approach enhanced by constrained linearly sewing principle component algorithm

To enhance the performance of the k-nearest neighbors approach in forecasting short-term traffic volume, this paper proposed and tested a two-step approach with the ability of forecasting multiple steps. In selecting k-nearest neighbors, a time constraint window is introduced, and then local minima of the distances between the state vectors are ranked to avoid overlappings among candidates. Moreover, to control extreme values’ undesirable impact, a novel algorithm with attractive analytical features is developed based on the principle component. The enhanced KNN method has been evaluated using the field data, and our comparison analysis shows that it outperformed the competing algorithms in most cases.

On the hardness of the sum of K mins problem

The sum of k mins protocol was proposed by Hopper and Blum as a protocol for secure human identification. The goal of the protocol is to let an unaided human securely authenticate to a remote server. The main ingredient of the protocol is the sum of k mins problem. The difficulty of solving this problem determines the security of the protocol. In this paper, we show that the sum of k mins problem is NP-Complete and W[1]-Hard. This latter notion relates to fixed parameter intractability. We also discuss the use of the sum of k mins protocol in resource-constrained devices.

The molecular structure of the borate mineral rhodizite (K, Cs)Al4Be4(B, Be)12O28 – A vibrational spectroscopic study

We have studied the borate mineral rhodizite (K, Cs)Al4Be4(B, Be)12O28 using a combination of DEM with EDX and vibrational spectroscopic techniques. The mineral occurs as colorless, gray, yellow to white crystals in the triclinic crystal system. The studied sample is from the Antandrokomby Mine, Sahatany valley, Madagascar. The mineral is prized as a semi-precious jewel. Semi-quantitative chemical composition shows a Al, Ca, borate with minor amounts of K, Mg and Cs. The mineral has a characteristic borate Raman spectrum and bands are assigned to the stretching and bending modes of B, Be and Al. No Raman bands in the OH stretching region were observed.

ORIGO Stepping Stones Grade K Student Journal

A mathematics curriculum for the Common Core Curriculum at the Kindergarten level for the USA

Differences in membrane acyl phospholipid composition between an endothermic mammal and an ectothermic reptile are not limited to any phospholipid class

This study examined questions concerning differences in the acyl composition of membrane phospholipids that have been linked to the faster rates of metabolic processes in endotherms versus ectotherms. In liver, kidney, heart and brain of the ectothermic reptile, Trachydosaurus rugosus, and the endothermic mammal, Rattus norvegicus, previous findings of fewer unsaturates but a greater unsaturation index (UI) in membranes of the mammal versus those of the reptile were confirmed. Moreover, the study showed that the distribution of phospholipid head-group classes was similar in the same tissues of the reptile and mammal and that the differences in acyl composition were present in all phospholipid classes analysed, suggesting a role for the physical over the chemical properties of membranes in determining the faster rates of metabolic processes in endotherms. The most common phosphatidylcholine (PC) molecules present in all tissues (except brain) of the reptile were 16:0/18:1, 16:0/18:2, 18:0/18:2, 18:1/18:1 and 18:1/18:2, whereas arachidonic acid (20:4), containing PCs 16:0/ 20: 4, 18: 0/ 20: 4, were the common molecules in the mammal. The most abundant phosphatidylethanolamines ( PE) used in the tissue of the reptile were 18:0/18:2, 18:0/20:4, 18:1/18:1, 18:1/18:2 and 18:1/20:4, compared to 16: 0/ 18: 2, 16: 0/ 20: 4, 16: 0/ 22: 6, 18: 0/ 20: 4, 18: 0/ 22: 6 and 18:1/20: 4 in the mammal. UI differences were primarily due to arachidonic acid found in both PC and PEs, whereas docosahexaenoic acid (22:6) was a lesser contributor mainly within PEs and essentially absent in the kidney. The phospholipid composition of brain was more similar in the reptile and mammal compared to those of other tissues.

Top-k retrieval using facility location analysis

The top-k retrieval problem aims to find the optimal set of k documents from a number of relevant documents given the user’s query. The key issue is to balance the relevance and diversity of the top-k search results. In this paper, we address this problem using Facility Location Analysis taken from Operations Research, where the locations of facilities are optimally chosen according to some criteria. We show how this analysis technique is a generalization of state-of-the-art retrieval models for diversification (such as the Modern Portfolio Theory for Information Retrieval), which treat the top-k search results like “obnoxious facilities” that should be dispersed as far as possible from each other. However, Facility Location Analysis suggests that the top-k search results could be treated like “desirable facilities” to be placed as close as possible to their customers. This leads to a new top-k retrieval model where the best representatives of the relevant documents are selected. In a series of experiments conducted on two TREC diversity collections, we show that significant improvements can be made over the current state-of-the-art through this alternative treatment of the top-k retrieval problem.

Party to litigation insolvent company - costs order against non-party liquidator

In Kimtran Pty Ltd v Downie [2003] QDC 043 the court allowed in part an appeal from the refusal by the Queensland Building Tribunal to order the respondent liquidators pay the appellants' costs of proceedings in the Tribunal. The decision involved an examination of authorities which have considered the circumstances in which it is in the interests of justice to make an order for costs against a non-party.

Costs order against company in liquidation unlikely to be effective indemnity

In Kimtran v Downie [2003] QCA 424, the Queensland Court of Appeal allowed an appeal from the decision of a District Court judge who had ordered costs against a non-party liquidator. It held that the court's decision in relation to the awarding of costs against a liquidator was not constrained by the decision of the of the Court of Appeal in Mahaffey v Belar Pty Ltd [1999] QCA 2 in the manner stated in the District Court.