The Isgur-Wise functions for the ground state to ground state semileptonic decays involving b → c transitions are calculated from the (modified) MIT bag model. It is checked that the results for the decays B → Dlν and B → D * lν agree well with experiment. Predictions for the decays Λ b → Λ c lν, B s → D s lν and B s → D * s lν are given and discussed.

für Naturforschung in cooperation with the Max Planck Society for the Advancement of Science under a Creative Commons Attribution 4.0 International License. Dieses Werk wurde im Jahr 2013 vom Verlag Zeitschrift für Naturforschung in Zusammenarbeit mit der Max-Planck-Gesellschaft zur Förderung der Wissenschaften e.V. digitalisiert und unter folgender Lizenz veröffentlicht: Creative Commons Namen...

für Naturforschung in cooperation with the Max Planck Society for the Advancement of Science under a Creative Commons Attribution 4.0 International License. Dieses Werk wurde im Jahr 2013 vom Verlag Zeitschrift für Naturforschung in Zusammenarbeit mit der Max-Planck-Gesellschaft zur Förderung der Wissenschaften e.V. digitalisiert und unter folgender Lizenz veröffentlicht: Creative Commons Namen...

In this paper we present a novel approach for wavelet compression of electrocardiogram (ECG) signals based on the set partitioning in hierarchical trees (SPIHT) coding algorithm. SPIHT algorithm has achieved prominent success in image compression. Here we use a modified version of SPIHT for one dimensional signals. We applied wavelet transform with SPIHT coding algorithm on different records of...

This study presents and evaluates a modified ant colony optimization (ACO) approach for the precedence and resource-constrained multiprocessor scheduling problems. A modified ant colony system is proposed to solve the scheduling problems. A two-dimensional matrix is proposed in this study for assigning jobs on processors, and it has a time-dependency relation structure. The dynamic rule is desi...

A two-jointed arm is used to discuss the conditions under which a neural controller can acquire a precise internal model of a plant to be controlled without the help of an external superviser. The problem can be solved by a 'modified Hebbian rule' ensuring convergence of the synaptic strengths, a feedforward network called 'power network', and a learning algorithm called 'auto-imitation'. The m...

This study presents and evaluates a modified ant colony optimization (ACO) approach for the resource-constrained project scheduling problems. A modified ant colony system is proposed to solve the resource-constrained scheduling problems. A two-dimensional matrix is proposed in this study for scheduling activities with time, and it has a parallel scheme for solving project scheduling problems. T...

We study the complexity of winner determination in single-crossing elections under two classic fully proportional representation rules—Chamberlin–Courant’s rule and Monroe’s rule. Winner determination for these rules is known to be NP-hard for unrestricted preferences. We show that for single-crossing preferences this problem admits a polynomial-time algorithm for Chamberlin–Courant’s rule, but...

This paper describes a Ventricular Tachycardia/Fibrillation (VT/VF) detection algorithm that is specifically designed for a 24/7 personal wireless heart monitoring system. This monitoring system uses Bluetooth enabled biosensors and smart phones to monitor continuously cardiac patients’ vital signs. Our VT/VF algorithm is optimized for continuous real-time monitoring on smart phones with a high...

Rule induction is a data mining technique used to extract classification rules of the form IF (conditions) THEN (predicted class) from data. The majority of the rule induction algorithms found in the literature follow the sequential covering strategy, which essentially induces one rule at a time until (almost) all the training data is covered by the induced rule set. This strategy describes a b...