Biplab Kumer Sarker

Learn More
Dedication To my dear grandparents, parents and wife. Abstract This thesis proposes a weighted DAG (wDAG) similarity algorithm for match-making in e-Business environments. We focus on the metadata representation of buyer and seller agents, as well as a similarity and associated simplicity measure over this information. In order to make the interaction(More)
A tremendous growing interest in finding dependency among patterns has been developing in the domain of time series data mining. Researchers have been considering time series data that occurs in the science and business endeavors such as: prices of stocks, the data of a intensive care unit, data flowing from a robot's sensor, human motion data etc. It is(More)
A Distributed Computing System (DCS) comprising networked heterogeneous processors requires efficient tasks to processor allocation to achieve minimum turnaround time and highest possible throughput. Task allocation in DCS remains an important and relevant problem attracting the attention of researchers in the discipline. A good number of task allocation(More)
Our weighted-tree similarity algorithm matches buyers and sellers in e-Business environments. We use arc-labeled, arc-weighted trees to represent the products (or services) sought/offered by buyers/sellers. Partial product descriptions can be represented via subtrees missing in either or both of the trees. In order to take into account the effect of a(More)
Ontology is a fundamental data object for organizing knowledge in a structured way in many areas ranging from philosophy to Knowledge Management. Knowledge capture, knowledge integration and knowledge delivery are the essential parts of dynamic knowledge management. E-Learning is considered to be an integral part of knowledge delivery system. Information(More)
• Mining association rules from multi­stream data has received a lot of attention to the data mining community. • It is quite effective and useful to discover such rules. Abstract • The challenge: Discovering these rules is a very time consuming and expensive when we are mining them from enormous time ordered real valued continuous data sets. Abstract •(More)
Summary form only given. Most of the task allocation models & algorithms in distributed computing system (DCS) require a priori knowledge of its execution time on the processing nodes. Since the task assignment is not known in advance, this time is quite difficult to estimate. We propose a cluster-based dynamic allocation scheme, in a distributed computing(More)
A parallel algorithm based on a lattice theoretic approach is proposed to find the rules among patterns that sustain sequential nature in the multi-stream time series data. The human motion data captured by motion capturing system considered as multi-stream multidimensional data is used as real time data set. The data set is transformed into sequences of(More)
Permission is granted to quote short excerpts and to reproduce figures and tables from this report, provided that the source of such material is fully acknowledged. Abstract. Price is the omnipresent factor that determines buyers' and sellers' decision-making when trading products in real and virtual marketplaces. However , since a fixed price can often(More)