检索结果-内蒙古大学图书馆

A Simulation-Free Exact Conditional Goodness-of-Fit Test for The Binomial Distribution

Calcutta Statistical Association Bulletin 2015年第3-4期67卷 105-128页

作者： Hazra, Arnab Indian Statistical Institute Kolkata India Department of Statistics North Carolina State University United States

Several exact testing methods for continuous distributions, asymptotic as well as simulation based exact methods for both- discrete and continuous cases have been developed for analyzing goodness-of-fit, a priori. An exact Kolmogorov-Smirnov type goodness-of-fit test is developed for checking whether the data comes from a binomial distribution or not. This is a conditional test;p-value is calculated as the conditional probability given the sample total and hence the success probability need not be specified under the null hypothesis. Instead of using simulation, p-value is calculated using a sequential procedure and hence the inference procedure is simulationfree. Properties of the test, some examples, power comparisons with other existing techniques are also provided. © 2015 SAGE Publications.

关键词： conditional test Goodness-of-fit hypergeometric distribution Kolmogorov-Smirnov test sequential algorithm

来源：评论

学校读者我要写书评

暂无评论

High Performance Online Key Performance Indicator's Calculations in Oil Refineries 23

High Performance Online Key Performance Indicator's Calculat...

引用

23nd Signal Processing and Communications Applications Conference (SIU)

作者： Bakir, Mustafa Sevilgen, Fatih Erdogan TUPRAS Genel Mudurluk Surec Gelistirme & Yazilim Mudurlugu Batman Merkez Batman Turkey Gebze Tekn Univ Bilgisayar Muhendisligi Gebze Turkey

ISBN: (纸本)9781467373869

It is critical in Oil Refineries to monitor the process online by several departments with respect to various perspectives. Key performance indicators generated by conversion of sensor - based measurements into meaningful data fulfill this requirement. However, the performance indicators must be provided to the users online. In this article, we discuss code optimization and parallelization of key performance indicator's calculation. By using these methods we obtained %696 improvement against the initial algorithm and %55 improvement against the optimal sequential algorithm in the performance of the system.

关键词： petroleum refinery performance indicators code optimization sequential algorithm parallelization Departments

来源：评论

学校读者我要写书评

暂无评论

sequential LOCAL FRI SAMPLING OF INFINITE STREAMS OF DIRACS

SEQUENTIAL LOCAL FRI SAMPLING OF INFINITE STREAMS OF DIRACS

引用

IEEE International Conference on Acoustics, Speech and Signal Processing

作者： Jon Onativia Jose Antonio Uriguen Pier Luigi Dragotti Department of Electrical and Electronic Engineering Imperial College London

ISBN: (纸本)9781479903573

The theory of sampling signals with finite rate of innovation (FRI) has shown that it is possible to perfectly recover classes of non-bandlimited signals such as streams of Diracs from uniform samples. Most of previous papers, however, have to some extent only focused on the sampling of periodic or finite duration signals. In this paper we propose a novel method that is able to reconstruct infinite streams of Diracs, even in high noise scenarios. We sequentially process the discrete samples and output locations and amplitudes of the Diracs in real-time. We first establish conditions for perfect reconstruction in the noiseless case and then present the sequential algorithm for the noisy scenario. We also show that we can achieve a high reconstruction accuracy of 1000 Diracs for SNRs as low as 5dB.

关键词： Analog-to-digital conversion Finite rate of innovation Sampling theory Annihilating filter Analog-digital conversion streams Sampling sequential algorithm perfect reconstruction Paul Adrien Maurice Dirac rivers signals Noise

来源：评论

学校读者我要写书评

暂无评论

Restructuring and Implementations of 2D Matrix Transpose algorithm Using SSE4 Vector Instructions 1

Restructuring and Implementations of 2D Matrix Transpose Alg...

引用

International Conference on Applied Research in Computer Science and Engineering (ICAR)

作者： Zekri, Ahmed S. Beirut Arab Univ Fac Sci Dept Math & Comp Sci Beirut Lebanon

ISBN: (纸本)9781467385435

Current general-purpose processors are augmented with vector instructions that can process many elements of matrices and vectors in parallel. Transposing a matrix in-place is a main kernel operation required by many scientific and engineering applications to shuttle data before, during, or after processing. This operation increases the traffic on the memory bus and hence clever techniques such as blocking are required to enhance the performance. In this paper, we present an enhanced version of a previously published algorithm for transposing a matrix on a two-dimensional processor arrays. We restructured this algorithm to fit the one-dimensional vector register architecture augmented to general-purpose CPUs. We implemented the new vector algorithm using Intel SSE4 vector instruction set and compare its performance with the standard sequential algorithm in addition to an already employed implementation of Ekhlundh's algorithm. We also studied the automatic compiler optimizations and their effect on the vectorization of the algorithm. The best of our implementations showed a maximum speedup of 1.6 compared with the sequential algorithm, and an almost equal performance compared with Eklundh's algorithm implementation.

关键词： instruction sets mathematics computing matrix algebra optimising compilers parallel processing 2D matrix transpose algorithm Ekhlundh algorithm Intel SSE4 vector instruction set automatic compiler optimization general-purpose CPU general-purpose processor memory bus one-dimensional vector register architecture standard sequential algorithm two-dimensional processor arrays Kernel Multicore processing Parallel processing Program processors Registers Signal processing algorithms Yttrium PARALLEL PROCESSING (COMPUTERS) instruction sets mathematics computing Program processors Signal processing algorithms Registers matrix algebra Rare earths yttrium sequential algorithm Kernel general processor

来源：评论

学校读者我要写书评

暂无评论

Policy-based access control framework for large networks

Policy-based access control framework for large networks

引用

8th IEEE International Conference on Networks (ICON 2000)

作者： Duan, HX Wu, JP Li, X Tsing Hua Univ Network Res Ctr Beijing Peoples R China

ISBN: (纸本)0769507778

Efforts of this paper focus on the issues about management and throughput of firewalls (or screening routers) applied in transit networks. On the one hand, manual configuration of large amount of firewalls distributed in many access points can not meet the global security requirements in the open and dynamic environment. On the other hand, the ordinal lookup of filtering rules in each individual firewall results in great decrease of throughput. Aimed at a typical transit network and its security policy requirements, a policy-based access control framework (PACF) is proposed in this paper. This framework is based on three levels of abstract access control policy: organizational access control policy (OACP), global access control policy (GACP) and local access control policy (LACP). The GACP, which comes from the results of IDSes and search engines according to OACP, is automatically and dynamically distributed to firewalls as LACPs. Each LACP is then enforced by an individual firewall. Some key algorithms for distribution of GACP and enforcement of LACP are described. A hash-based algorithm is proposed, for lookup of filtering rules in LACP. Under the environment with policy requirements described in this paper the new algorithm reduces the time complexity of lookup from O (N) of traditional sequential algorithm to O (1), which therefore increases largely the throughput of firewalls.

关键词： access control telecommunication network management telecommunication network routing authorisation cryptography table lookup computational complexity search engines telecommunication security policy based access control large networks firewalls management firewalls throughput screening routers transit networks global security requirements open environment dynamic environment ordinal lookup filtering rules security policy requirements policy-based access control framework organizational access control policy global access control policy local access control policy IDSes search engines key algorithms hash-based algorithm time complexity reduction sequential algorithm

来源：评论

学校读者我要写书评

暂无评论

sequential Localization with Inaccurate Measurements

Sequential Localization with Inaccurate Measurements

引用

2009 American Control Conference (ACC 2009)

作者： J. Fang D. Duncan A. S. Morse Department of Electrical Engineering at Yale University

ISBN: (纸本)9781424445233

The sensor network localization problem with distance information is to determine the positions of all sensors in a network given the positions of some sensors and the distances between some pairs of sensors. We present a sequential algorithm for estimating sensor positions when only inaccurate distance measurements are available, and evaluate the performance of the algorithm on simulations of randomly deployed networks of 100 sensors.

关键词： Sensors Inaccurate sequential algorithm position sensor sequential

来源：评论

学校读者我要写书评

暂无评论

Mit :: Ai :: Aim :: Aitr-995

引用

2016年

Mit :: Ai :: Aim :: Aitr-995 by published by

关键词： aitr-995 algorithm chapter computation connection machine cube expansion expansions local expansion multipole multipole expansion node numerical verifications parallel parallel algorithm pythagorean configuration running time sequential algorithm sequential implementation three bodies tree

来源：评论

学校读者我要写书评

暂无评论

Probabilistic Model for Passage Time of Chain-Like Structure through Thick Membrane

ACTA PHYSICA POLONICA A

引用

ACTA PHYSICA POLONICA A 2021年第5期139卷 513-516页

作者： Domanski, Z. Grzybowski, A. Z. Czestochowa Tech Univ PL-42201 Czestochowa Poland

Transfer of a polymer across a membrane is the subject of extensive theoretical and experimental works. One of the most fruitful approaches to such studies relies on the usage of Monte Carlo simulations. In those methods, the polymers are viewed as an abstract chain-like structure, and among the principal goals of the simulation-analysis is to relate their passage time through a cell boundary with various characteristics describing both the structures and their environment. In this paper, we develop probabilistic models for a passage time of the chain-like-structures through a thick membrane. We examine the impact of the boundary thickness on the passage time through a flat membrane as well as its dependence on the polymer length. All our experiments are carried out with the help of our own-developed sequential algorithm that incorporates the tension-propagation mechanism.

关键词： Monte Carlo simulations polymer translocation sequential algorithm thick membrane

来源：评论

学校读者我要写书评

暂无评论

Directionality in protein fold prediction

引用

BMC BIOINFORMATICS 2010年第1期11卷 1-16页

作者： Ellis, Jonathan J. Huard, Fabien P. E. Deane, Charlotte M. Srivastava, Sheenal Wood, Graham R. Macquarie Univ Dept Stat Sydney NSW 2109 Australia Univ Oxford Dept Stat Oxford OX1 3TG England

Background: Ever since the ground-breaking work of Anfinsen et al. in which a denatured protein was found to refold to its native state, it has been frequently stated by the protein fold prediction community that all the information required for protein folding lies in the amino acid sequence. Recent in vitro experiments and in silico computational studies, however, have shown that cotranslation may affect the folding pathway of some proteins, especially those of ancient folds. In this paper aspects of cotranslational folding have been incorporated into a protein structure prediction algorithm by adapting the Rosetta program to fold proteins as the nascent chain elongates. This makes it possible to conduct a pairwise comparison of folding accuracy, by comparing folds created sequentially from each end of the protein. Results: A single main result emerged: in 94% of proteins analyzed, following the sense of translation, from N-terminus to C-terminus, produced better predictions than following the reverse sense of translation, from the C-terminus to N-terminus. Two secondary results emerged. First, this superiority of N-terminus to C-terminus folding was more marked for proteins showing stronger evidence of cotranslation and second, an algorithm following the sense of translation produced predictions comparable to, and occasionally better than, Rosetta. Conclusions: There is a directionality effect in protein fold prediction. At present, prediction methods appear to be too noisy to take advantage of this effect;as techniques refine, it may be possible to draw benefit from a sequential approach to protein fold prediction.

关键词： sequential algorithm Protein Structure Prediction Steric Clash Nascent Chain Fragment Insertion

来源：评论

学校读者我要写书评

暂无评论

An Improved Parameter Identification algorithm for Signals with Unknown-But-Bounded Errors

引用

IFAC Proceedings Volumes 1985年第5期18卷 1507-1512页

作者： G. Belforte B. Bona Dipartimento di Automatica e Informatica Politecnico di Torino C.so Duca degli Abruzzi 24 - 10129 Torino Italy

The problem of parameter identification from measurements corrupted by unknown-but-bounded errors is addressed. It mainly consists in finding the minimal parameter set ∧ consistent both with the obtained data samples and the assumed error description. This problem was treated by two different approaches; one using an ellypsoidal upper bound on ∧ via a recursive algorithm, while in the other approach an hypercubic bound was obtained through the solution of a linear programming problem, The hypercubic description gives an exact bound to the parameter uncertainty, consistent with the available measurements and the error model, but is time consuming when a large number of measurements is present. The ellypsoidal approach allows a fast data preprocessing, producing a smaller subset of constraints that can be fed to the linear programming algorithm. In the present paper a comparison between the two approaches is outlined and a combined use of the positive aspects of both procedures is proposed. The original algorithm has been modified for higher efficiency and the results are compared and discussed.

关键词： Parameter estimation bounded error description sequential algorithm linear programming

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：