Project management tools are mandatory to properly manage a software project. The teaching of these tools is carried out in superior computer courses, but often the instructional strategies are used in an ad-hoc manne...
详细信息
We present a new numerical and inherently parallel algorithm for solving banded (strictly) diagonally dominant triangular and banded Toeplitz (BDDTT) systems of linear equations. A Taylor polynomial, derived from the ...
详细信息
ISBN:
(纸本)9781509042982
We present a new numerical and inherently parallel algorithm for solving banded (strictly) diagonally dominant triangular and banded Toeplitz (BDDTT) systems of linear equations. A Taylor polynomial, derived from the matrix analog of the Taylor Series for evaluating (1-x) ~(-1)where |χ| < 1, is applied, in conjunction with other techniques, to compute an approximate solution to a BDDTT-type system. This method requires O(n log_2n) arithmetic operations (ops) and O(log_2n) parallel steps (steps). Two FFTs and an IFFT of order 2n are the main contributors to the workload. This matches the FFT count for a triangular Toeplitz-matrix-vector multiplication. Clearly then, our method improves on the many algebraic FFT based processes that first determine the triangular Toeplitz matrix that is the inverse of a BDDTT matrix in order to then solve the associated BDDTT system.
As the new generation of smart sensors is evolving towards high sampling acquisitions systems, the amount of information to be handled by learning algorithms has been increasing. The Graphics Processing Unit (GPU) arc...
详细信息
As the new generation of smart sensors is evolving towards high sampling acquisitions systems, the amount of information to be handled by learning algorithms has been increasing. The Graphics Processing Unit (GPU) architectures provide a greener alternative with low energy consumption for mining big-data, harnessing the power of thousands of processing cores in a single chip, opening a widely range of possible applications. Here, we design a novel evolutionary computing GPU parallel function evaluation mechanism, in which different parts of time series are evaluated by different processing threads. By applying a metaheuristics fuzzy model in a low-frequency data for household electricity demand forecasting, results suggested that the proposed GPU learning strategy is scalable as the number of training rounds increases.
This paper deals with the estimation of intrinsic and extrinsic parameters in a fundus camera system. These parameters are fundamental to retrieve three-dimensional reconstruction of eye's structure, in our case, ...
详细信息
According to the World Health Organization, cardiovascular diseases (CVD) are the main cause of death worldwide. An estimated 17.5 million people died from CVD in 2012, representing 31% of all global deaths. The elect...
详细信息
ISBN:
(纸本)9781509024872
According to the World Health Organization, cardiovascular diseases (CVD) are the main cause of death worldwide. An estimated 17.5 million people died from CVD in 2012, representing 31% of all global deaths. The electrocardiogram (ECG) is a central tool for the pre-diagnosis of heart diseases. Many advances on ECG arrhythmia classification have been developed in the last century;however, there is still research to identify malignant waveforms on ECG beats. The premature ventricular complexes (PVC) are known to be associated with malignant ventricular arrhythmias and in sudden cardiac death (SCD) cases. Detecting this kind of arrhythmia has been crucial in clinical applications. In this work, we extracted 80 different features from 108,653 ECG classified beats of the MIT-BIH database in order to classify the Normal, PVC and other kind of ECG beats. We evaluated three classifier algorithms based on Machine Learning with different parameters and we got a total of 14 models. We used the F1 score and we compared predictive values as a measured of classifier evaluations. Results show that we could have a F1 scores near to the unit, showing the models are higher than 93% of performance.
We establish the ultimate limits to the compression of sequences of identically prepared qubits. The limits are determined by Holevo’s information quantity and are attained through use of the optimal universal clonin...
详细信息
We establish the ultimate limits to the compression of sequences of identically prepared qubits. The limits are determined by Holevo’s information quantity and are attained through use of the optimal universal cloning machine, which finds here a novel application to quantum Shannon theory.
This paper presents a real case study pertaining to an issue related to waste collection in the northern part of Malaysia by using a constructive heuristic algorithm known as the Nearest Greedy (NG) technique. This te...
This paper presents a real case study pertaining to an issue related to waste collection in the northern part of Malaysia by using a constructive heuristic algorithm known as the Nearest Greedy (NG) technique. This technique has been widely used to devise initial solutions for issues concerning vehicle routing. Basically, the waste collection cycle involves the following steps: i) each vehicle starts from a depot, ii) visits a number of customers to collect waste, iii) unloads waste at the disposal site, and lastly, iv) returns to the depot. Moreover, the sample data set used in this paper consisted of six areas, where each area involved up to 103 customers. In this paper, the NG technique was employed to construct an initial route for each area. The solution proposed from the technique was compared with the present vehicle routes implemented by a waste collection company within the city. The comparison results portrayed that NG offered better vehicle routes with a 11.07% reduction of the total distance traveled, in comparison to the present vehicle routes.
We have carried out experimental and numerical analyses for reconstruction of permittivity distribution using a pair of long distance small size electrodes and additional arc electrodes. A reconstruction method for pe...
详细信息
The selection and prioritization of software requirements represents an area of interest in Search-Based Software Engineering (SBSE) and its main focus is finding and selecting a set of requirements that may be part o...
详细信息
暂无评论