We consider the multi-label ranking approach to multilabel learning. Boosting is a natural method for multilabel ranking as it aggregates weak predictions through majority votes, which can be directly used as scores to produce a ranking of the labels. We design online boosting algorithms with provable loss bounds for multi-label ranking. We show that our first algorithm is optimal in terms of t...

Four lemmas, which constitute the theoretical foundation necessary to determine optimal control strategies for a class of single machine family scheduling problems, are presented in this technical report. The scheduling problem is characterized by the presence of sequence-dependent batch setup and controllable processing times; moreover, the generalized due-date model is adopted in the problem....

Recent efforts in bioinformatics have achieved tremendous progress in the machine reading of biomedical literature, and the assembly of the extracted biochemical interactions into large-scale models such as protein signaling pathways. However, batch machine reading of literature at today’s scale (PubMed alone indexes over 1 million papers per year) is unfeasible due to both cost and processing ...

The coordination of production scheduling and transportation has recently received a lot of attention in logistics and supply chain management. We study a coordinated scheduling problem, in which each job is transported to a single serial batching machine for further processing, each batch to be processed occurs a processing cost, and the objective is minimizing the sum of the makespan and the ...

The discrete lotsizing and scheduling problem for one machine with sequence dependent setup times and setup costs is solved as a single machine scheduling problem, which we term the batch sequencing problem. The relationship between the lotsizing problem and the batch sequencing problem is analyzed. The batch sequencing problem is solved with a branch & bound algorithm which is accelerated by b...

As main memory grows, query performance is more and more determined by the raw CPU costs of query processing itself. The classical iterator style query processing technique is very simple and flexible, but shows poor performance on modern CPUs due to lack of locality and frequent instruction mispredictions. Several techniques like batch oriented processing or vectorized tuple processing have be...

We present an integrated framework for simultaneous tracking, group detection and multi-level activity recognition in crowd videos. Instead of solving these problems independently and sequentially, we solve them together in a unified framework to utilize the strong correlation that exists among individual motion, groups and activities. We explore the hierarchical structure hidden in the video t...

in the last two decade the use of aerial laser scanner (als) or lidar (light detection and ranging) sensor in geomatics engineering and surveying application has augmented significantly . the main reason of the mentioned phenomenon is the reliability and accuracy of the data obtained by lidar sensors. the output of lidar is unclassified 3d point cloud. classification of the lidar point clouds i...

The Turing machine models an old-fashioned computer, that does not interact with the user or other computers, and only batch processing. Therefore, we came up a Reactive Machine have these shortcomings. In Machine, transitions labels to give notion of interactivity. resulting process graph, use bisimilarity instead language equivalence. Subsequently, considered classical theorems notions from a...