Filters








16,997 Hits in 6.4 sec

Algorithm 680: evaluation of the complex error function

G. P. M. Poppe, C. M. J. Wijers
1990 ACM Transactions on Mathematical Software  
ALGORITHM Given a complex number z, in the first quadrant of the complex plane, WOFZ (z) computes the value of the Faddeeva-function w(z) = exp(-z2) . erfc(-iz) with an accuracy of 14 significant digits  ...  The major distinction between Algorithm 363 and Algorithm 680 lies initially in the choice of the variable QRHO and in the fact that NU isn't a constant if (QRHO.GE.l.O), but decreases with increasing  ...  Permission to copy without fee all or part of this material is granted provided that the copies are not made or distributed for direct commercial advantage, the ACM copyright notice and the title of the  ... 
doi:10.1145/77626.77630 fatcat:dvjlwhzg2jgtdmb6ulpc5rrsxa

An Algorithm for Validating ASN.1 (X.680) Specifications using Set Constraints

C. Rinderknecht
2003 Computer journal  
We propose to fully validate the X.680 specifications, i.e., the main part of ASN.1, by means of an algorithm which relies on the set constraints theory.  ...  solving procedure which relies upon an algorithm of Aiken and Wimmers.  ...  The worst case complexity of the solving procedure is the same as the complexity of Aiken and Wimmers' algorithm.  ... 
doi:10.1093/comjnl/46.4.401 fatcat:ow4niifmznfepmiqor2ygvxs6i

A Genetic Algorithm for VLSI Floorplanning [chapter]

Christine L. Valenzuela, Pearl Y. Wang
2000 Lecture Notes in Computer Science  
The classical floor planning techniques use block packing to minimize chip area, by making use of algorithms like B-TREE representation, simulated annealing.  ...  To get an optimal solution it is imperative to choose an efficient, cost effective algorithm. This paper presents a genetic algorithm to provide a solution to the floor planning technique.  ...  And evaluates them using a predefine fitness function. [2] . A fitness function is a complex mathematical function needed to evaluate each chromosome encountered by the GA.  ... 
doi:10.1007/3-540-45356-3_66 fatcat:e5i4n3urczgwzoojxozcw26s5a

Algorithms for Moving Objects Databases

J. A. Cotelo Lema
2003 Computer journal  
Some of them are relatively straightforward; others are quite complex.  ...  For example, a moving point might be projected into the plane, yielding a curve, or a moving region be mapped to a function describing the development of its size, yielding a real-valued function.  ...  In our case, k is bounded by v so that the time complexity of function min func is O(v log v). Hence, the time complexity of the third part of the algorithm is O(v 2 log v).  ... 
doi:10.1093/comjnl/46.6.680 fatcat:qjxmhcvmcncd7pnzu6n7j4sfuq

A 680 nA ECG Acquisition IC for Leadless Pacemaker Applications

Long Yan, Pieter Harpe, Venkata Rajesh Pamula, Masato Osawa, Yasunari Harada, Kosei Tamiya, Chris Van Hoof, Refet Firat Yazicioglu
2014 IEEE Transactions on Biomedical Circuits and Systems  
Low-power heartbeat detections are evaluated with the help of the ASIC acquiring nearly 20,000 beats across 10 different records from the MIT-BIH arrhythmia database.  ...  In the presence of muscle noise, both the average Sensitivity (Se) and Positive Predictivity (PP) show more than 90% when the input SNR 6 dB.  ...  The total current consumption of the ASIC is only 680 nA.  ... 
doi:10.1109/tbcas.2014.2377073 pmid:25546862 fatcat:q6vbx3msgbb7rpeicoflc7ha2e

Vertical partitioning algorithms for database design

Shamkant Navathe, Stefano Ceri, Gio Wiederhold, Jinglie Dou
1984 ACM Transactions on Database Systems  
The algorithms presented in this paper have been implemented, and examples of their actual use are shown.  ...  A two-phase approach for the determination of fragments is proposed; in the first phase, the design is driven by empirical objective functions which do not require specific cost information.  ...  ACKNOWLEDGMENTS Many colleagues have participated in discussions on vertical partitioning, and have inspired some of the concepts used here.  ... 
doi:10.1145/1994.2209 fatcat:roihrotlwzfjbklaei6gu3sl3e

Algorithm 916

Mofreh R. Zaghloul, Ahmed N. Ali
2011 ACM Transactions on Mathematical Software  
We present a MATLAB function for the numerical evaluation of the Faddeyeva function w(z). The function is based on a newly developed accurate algorithm.  ...  Verification of the flexibility, reliability, and superior accuracy of the algorithm is provided through comparison with standard algorithms available in other libraries and software packages.  ...  In particular the comments and suggestions received from the associate editor, algorithm editor and the fourth anonymous referee were extremely helpful and insightful.  ... 
doi:10.1145/2049673.2049679 fatcat:nn4vigubvjfdlccgw4ivkfimr4

New Procedure for Deriving Optimized Strapdown Attitude Algorithms

V. Z. Gusinsky, V. M. Lesyuchevsky, Yu. A. Litmanovich, Howard Musoff, George T. Schmidt
1997 Journal of Guidance Control and Dynamics  
The tuning of an algorithm to classical coning allows higher com- putational accuracy in comparison with the general case of motion without adding complexity to the algorithm.  ...  A numerical evaluation of the elliptic functions sn, cn, and dn also shows negli- gible harmonics higher than about 20 Hz for sn and cn and about 30 Hz for dn for the case of m = 0.7.  ... 
doi:10.2514/2.4130 fatcat:zru6exolpbhu3lq3upaexcco5y

Efficient and effective algorithms for clustering uncertain graphs

Kai Han, Fei Gui, Xiaokui Xiao, Jing Tang, Yuntian He, Zongmai Cao, He Huang
2019 Proceedings of the VLDB Endowment  
We analyze the hardness of these problems, and propose algorithms that provide considerably improved approximation guarantees than the existing studies do.  ...  Specifically, our algorithms offer (1 − 1/e)-approximations for the k-median problem and (OPT c k )-approximations for the k-center problem, where OPT c k is the optimal objective function value for k-center  ...  evaluation of our algorithms.  ... 
doi:10.14778/3311880.3311884 fatcat:kvutglo25bdkdpomoj6bln5sl4

A high-resolution spectral analysis algorithm for power-system disturbance monitoring

P. O'Shea
2002 IEEE Transactions on Power Systems  
In a previous paper, the author presented a Fourier-based algorithm for monitoring the characteristics of the damped oscillating "modes" which are set up after a disturbance in an electric power-distribution  ...  This current paper extends the previous work to enable the processing of multiple modes which are very closely spaced in frequency. Importantly, the proposed algorithm has good noise performance.  ...  ACKNOWLEDGMENT Part of this work was performed at the School of Electrical and Computer Systems Engineering, RMIT University.  ... 
doi:10.1109/tpwrs.2002.800911 fatcat:qzbatvm4lzdithvwydj6peiuii

An Effective Directional Residual Interpolation Algorithm for Color Image Demosaicking

Ke Yu, Chengyou Wang, Sen Yang, Zhiwei Lu, Dan Zhao
2018 Applied Sciences  
Compared with four directional weights in minimized Laplacian residual interpolation, the proposed algorithm not only guarantees the quality of color images but also reduces the computational complexity  ...  The proposed directional interpolation algorithm aims to reduce computational complexity and get more accurate interpolated pixel values in the complex edge areas.  ...  However, the weakness of this algorithm is that the algorithm has high computational complexity.  ... 
doi:10.3390/app8050680 fatcat:ev5j7lywljdmzgwl32oz4u3hk4

MINAS: multiclass learning algorithm for novelty detection in data streams

Elaine Ribeiro de Faria, André Carlos Ponce de Leon Ferreira Carvalho, João Gama
2015 Data mining and knowledge discovery  
Most of the works found in the ND literature presents it as a binary classification task.  ...  This work proposes MINAS, an algorithm for ND in data streams. MINAS deals with ND as a multiclass task. In the initial training phase, MINAS builds a decision model based on a labeled data set.  ...  When evaluating a classifier, an important issue to be considered, in addition to the error measure, is the complexity of the model.  ... 
doi:10.1007/s10618-015-0433-y fatcat:5zd5fvv2h5gm5aewogxasfbchy

Simplified Partial Digest Problem: Enumerative and Dynamic Programming Algorithms

J. Blazewicz, E.K. Burke, M. Kasprzak, A. Kovalev, M.Y. Kovalyov
2007 IEEE/ACM Transactions on Computational Biology & Bioinformatics  
We present an Oðn2 n Þ time enumerative algorithm (ENUM) and an Oðn 2q Þ time dynamic programming algorithm for the error-free SPDP, where n is the number of restriction sites and q is the number of distinct  ...  Finally, we describe and discuss the results of the computer experiments with our algorithms.  ...  Similarly to algorithm ENUM, Step 2 determines the time complexity of algorithm DP. The time complexity of this step can be evaluated as Oð P n j¼1 jS j jÞ.  ... 
doi:10.1109/tcbb.2007.1060 pmid:17975277 fatcat:dn242vctznaaxerzp7ektg6ty4

Possibilities and limitations of the ART-Sample algorithm for reconstruction of 3D temperature fields and the influence of opaque obstacles

Yuanyang Li, Cila Herman
2013 International Journal of Heat and Mass Transfer  
The need for the measurement of complex, unsteady, three-dimensional (3D) temperature distributions arises in a variety of engineering applications, and tomographic techniques are applied to accomplish  ...  In the paper, the reconstruction accuracy is discussed quantitatively both without and with obstacles in the measurement volume for a set of phantom functions mimicking realistic temperature distributions  ...  Acknowledgments The authors acknowledge the contributions of Dr. Martin Wetzel to the development of the computer codes and Dr. Tianhong Dai to the recording of the interferometric images.  ... 
doi:10.1016/j.ijheatmasstransfer.2013.03.026 pmid:24039276 pmcid:PMC3768022 fatcat:ciqcpo7ib5ajdhirwdceafp3xe

A node reconnection algorithm for mimetic finite difference discretizations of elliptic equations on triangular meshes

Markus Berndt, Konstantin Lipnikov, Mikhail Shashkov, Pavel Váchal
2005 Communications in Mathematical Sciences  
We demonstrate the efficiency of our new algorithm with numerical examples.  ...  However, using only node reconnection the discretization error can be significantly reduced.  ...  In subsequent iterations, it will be as costly as a fixed number of evaluations of a residual. Each of the iterations of the rest of the algorithm is of complexity O(N X ).  ... 
doi:10.4310/cms.2005.v3.n4.a11 fatcat:xeuqgncdlvhunnqcxihphmxdwe
« Previous Showing results 1 — 15 out of 16,997 results