Ranking temporal data has not been studied until recently, even though ranking is an important operator (being promoted as a firstclass citizen) in database systems. However, only the instant top-k queries on temporal data were studied in, where objects with the k highest scores at a query time instance t are to be retrieved. The instant top-k definition clearly comes with limitations (sensitiv...

The Google search engine has enjoyed huge success with its web page ranking algorithm, which exploits global, rather than local, hyperlink structure of the web using random walks. Here we propose a simple universal ranking algorithm for data lying in the Euclidean space, such as text or image data. The core idea of our method is to rank the data with respect to the intrinsic manifold structure ...

ABSTRACT The ranking of seed lots is a fundamental process for all companies in the industry. This work aims to demonstrate data mining methods sorghum during processing through analysis quality control data. Germination and cold tests were performed verify physiological lots. Seed samples from each lot evaluated two moments: post-cleaning finished product (ready marketing). results after pre-p...

Many software test generation techniques target on generating software test data. Only a few of them provide automatic way to verify if software behaves correctly using generated test data. We propose a testing technique, which uses UML modeling language extension OCL as imprecise test oracle. Imprecise OCL constraints can be viewed as expressions which define expected results within some range...