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

2nd International Conference on Computer Science and Network Technology (ICCSNT)

作者： Xu, Chengxi Hu, Ronggui Wang, Yongyi Shi, Fan Elect Engn Inst EEI Hefei 230037 Peoples R China

ISBN: (纸本)9781467329644;9781467329637

Pseudo Random Number Generator (PRNG) is widely used in computer software design. The famous Domain Name System (DNS) software--BIND uses Linear Feedback Shift Register (LFSR) based PRNG algorithm to produce randomness of its transaction IDs. In recent years, DNS cache poisoning attack occurs frequently, which exploits BIND PRNG weakness, aiming at forging BIND with fake responses. In this paper, we present detailed analysis of the LFSR PRNG algorithm of BIND 9.2.4, which shows that its PRNG can be reconstructed. An effective noniterative reconstruction algorithm is proposed to fully reconstruct the internal states of the LFSRS. The algorithm is independent of the initial state of LFSR and of specific hardware platform. The experiment shows that our algorithm is more efficient than existing algorithm.

关键词： LFSR PRNG PRNG Weakness PRNG Reconstruction noniterative algorithm

来源：评论

学校读者我要写书评

暂无评论

noniterative Sparse LS-SVM Based on Globally Representative Point Selection

引用

IEEE TRANSACTIONS ON NEURAL NETWORKS AND LEARNING SYSTEMS 2021年第2期32卷 788-798页

作者： Ma, Yuefeng Liang, Xun Sheng, Gang Kwok, James T. Wang, Maoli Li, Guangshun Qufu Normal Univ Sch Comp Jining 276826 Peoples R China Yancheng Teachers Univ Sch Informat Engn Yancheng 224007 Peoples R China Hong Kong Univ Sci & Technol Dept Comp Sci & Engn Hong Kong Peoples R China

A least squares support vector machine (LS-SVM) offers performance comparable to that of SVMs for classification and regression. The main limitation of LS-SVM is that it lacks sparsity compared with SVMs, making LS-SVM unsuitable for handling large-scale data due to computation and memory costs. To obtain sparse LS-SVM, several pruning methods based on an iterative strategy were recently proposed but did not consider the quantity constraint on the number of reserved support vectors, as widely used in real-life applications. In this article, a noniterative algorithm is proposed based on the selection of globally representative points (global-representation-based sparse least squares support vector machine, GRS-LSSVM) to improve the performance of sparse LS-SVM. For the first time, we present a model of sparse LS-SVM with a quantity constraint. In solving the optimal solution of the model, we find that using globally representative points to construct the reserved support vector set produces a better solution than other methods. We design an indicator based on point density and point dispersion to evaluate the global representation of points in feature space. Using the indicator, the top globally representative points are selected in one step from all points to construct the reserved support vector set of sparse LS-SVM. After obtaining the set, the decision hyperplane of sparse LS-SVM is directly computed using an algebraic formula. This algorithm only consumes O(N2) in computational complexity and O(N) in memory cost which makes it suitable for large-scale data sets. The experimental results show that the proposed algorithm has higher sparsity, greater stability, and lower computational complexity than the traditional iterative algorithms.

关键词： Support vector machines Iterative methods Optimization Training Kernel Sparse matrices Learning systems Globally representative point noniterative algorithm pruning method quantity constraint sparse least squares support vector machine (LS-SVM)

来源：评论

学校读者我要写书评

暂无评论

PAM - A noniterative APPROXIMATE SOLUTION METHOD FOR CLOSED MULTICHAIN QUEUING-NETWORKS

引用

PERFORMANCE EVALUATION 1989年第2期9卷 119-133页

作者： HSIEH, CT LAM, SS UNIV TEXAS DEPT COMP SCIAUSTINTX 78712

Approximate MVA algorithms for separable queueing networks are based upon an iterative solution of a set of modified MVA formulas. Although each iteration has a computational time requirement of O( MK 2 ) or less, many iterations are typically needed for convergence to a solution. ( M denotes the number of queues and K the number of closed chains or customer classes.) We present some faster approximate solution algorithms that are noniterative . They are suitable for the analysis and design of communication networks which may require tens to hundreds, perhaps thousands, of closed chains to model flow-controlled virtual channels. The basis of our method is the distribution of a chain's population proportional to loads to get initial estimates of mean queue lengths. This is the same basis used in the derivation of proportional upper bounds for single-chain networks; for a multichain network, such a proportional distribution leads to approximations rather than upper bounds of chain throughputs. Nevertheless, these approximate solutions provide chain throughputs, mean end-to-end delays, and server utilizations that are sufficiently accurate for the analysis and design of communication networks and possibly other distributed systems with a large number of customer classes. Three PAM algorithms of increasing accuracy are presented. Two of them have time and space requirements of O( MK ). The third algorithm has a time requirement of O( MK 2 ) and a space requirement of O( MK ).

关键词： Queueing Network Mean Value Analysis Approximate Solution noniterative algorithm Proportional Bound Communication Network

来源：评论

学校读者我要写书评

暂无评论

A SIMPLE noniterative PROCEDURE FOR FITTING OF MULTIEXPONENTIAL FUNCTIONS

引用

JOURNAL OF NEUROSCIENCE METHODS 1991年第2-3期38卷 243-246页

作者： MIRONOV, SL Max-Planck Institute for Psychiatry 8033 Planegg-Martinsried Germany

An efficient procedure for finding parameters of multiexponential function from experimental data is described. All time-constants are determined by roots of the corresponding characteristic polynomial and weighting factors are then found from the system of linear equations. Due to the non-iterative character of the fitting procedure it is fast and does not need a guess about the initial values of parameters of multiexponential function. For single- or double-exponential fitting explicit algorithms are given, for which programming is straightforward.

关键词： MULTIEXPONENTIAL FITTING noniterative algorithm

来源：评论

学校读者我要写书评

暂无评论

An Electromagnetic Tracking Method Using Rotating Orthogonal Coils

引用

IEEE TRANSACTIONS ON MAGNETICS 2012年第12期48卷 4802-4810页

作者： Ge, Xin Wang, Yifeng Ding, Ning Wu, Xiaomei Wang, Yuanyuan Fang, Zuxiang Fudan Univ Dept Elect Engn Shanghai 200433 Peoples R China

In this paper, an electromagnetic tracking method that uses two rotating orthogonal coils is proposed. Two cross-shaped coils can rotate together and be driven in sequence to generate a magnetic field. One of the rotating orthogonal coils is used to track the position of the three-axis sensor and the other is to help solve the orientation of the sensor. As rotation can provide a geometrical relationship between the magnetic source and the sensor, the method does not require the generated magnetic field to imitate the ideal dipole in calculation. A fast noniterative algorithm and simple 1-D mapping along the axis of one coil are used to realize six degree-of-freedom (6DOF) tracking. Thus, the complexity of the magnetic tracking method and the corresponding systemcan be greatly reduced. Simulation results show that the method has good tracking accuracy and speed, which can be further improved by using an adaptive step-size searching strategy. So, it is concluded that the method can be used as an effective target monitoring method in many application domains such as minimally invasive therapy.

关键词： Electromagnetic tracking noniterative algorithm rotating orthogonal coils searching strategy

来源：评论

学校读者我要写书评

暂无评论

COHERENCY-BASED MULTIMACHINE STABILITY STUDY

引用

IEE PROCEEDINGS-C GENERATION TRANSMISSION AND DISTRIBUTION 1982年第4期129卷 153-160页

作者： GHAFURIAN, A BERG, GJ UNIV CALGARY FAC ENGNDEPT ELECT ENGNCALGARY T2N 1N4ALBERTACANADA

A new equivalent generator model to replace a group of coherent generators is discussed. The model is simple and can easily be implemented in transient stability programs. Derivation of the parameters of the proposed equivalent generator does not follow the common approach of calculating a new set of parameters for a new or hypothetical generator. The model is derived in such a way that its dynamic equations correspond to those of one of the generators it represents. The approach to the derivation of the equivalent generator equations is general. In the paper the model is derived for application in two different stability programs. In the first program a conventional method of stability analysis is used which incorporates classical generator models. The second program involves a noniterative algorithm in which generators could be modelled with any desired degree of accuracy. As the equivalent generator incorporates the equations of one of the machines in the system, it is possible to model all generators and controllers, including the equivalent generator, with any degree of detail desired. While the main objective of the paper is to introduce the equivalent model and its mathematical derivation, application of the new technique to reduce the order of a power system is also demonstrated.

关键词： stability mathematical derivation equivalent generator model transient response subroutines multimachine stability transient stability programs power system analysis computing stability response Power engineering computing noniterative algorithm coherency toned Stability in control theory Power system management, operation and economics

来源：评论

学校读者我要写书评

暂无评论

Robust algorithm to estimate fault synchrophasor from fault-transient synchrophasor in phasor data concentrator

引用

IET GENERATION TRANSMISSION & DISTRIBUTION 2015年第2期9卷 124-132页

作者： Das, Sarasij Sidhu, Tarlochan Univ Ontario Inst Technol Fac Engn & Appl Sci Oshawa ON Canada

A fault-transient synchrophasor is computed over a window of pre-fault and fault samples. A fault synchrophasor is computed over a window of fault samples only. Fault-transient synchrophasors are discarded and are generally not used in the synchrophasor applications. Recently, an algorithm has been proposed to compute fault synchrophasor from fault-transient synchrophasor in phasor data concentrator (PDC). The accuracy of the existing algorithm deteriorates due to fault-induced transients and inaccurate fault starting time. A robust algorithm has been proposed to compute fault synchrophasor from fault-transient synchrophasor in PDC. The proposed algorithm does not use fault starting time in the calculations. It also performs better than the existing algorithm when fault-induced transients are present in the signal. The proposed algorithm is simple, non-iterative and performs satisfactorily in various investigated scenarios. The advantage of the proposed algorithm has been demonstrated in the context of fault location application.

关键词： fault location phasor measurement power system transients synchrophasor fault estimation fault-transient synchrophasor phasor data concentrator fault-induced transients PDC noniterative algorithm fault location application robust algorithm

来源：评论

学校读者我要写书评

暂无评论

Modified semiparametric maximum likelihood estimator in linear regression analysis with complete data or right-censored data

引用

TECHNOMETRICS 2005年第1期47卷 34-42页

作者： Yu, QQ Wong, GYC SUNY Binghamton Dept Math Sci Binghamton NY 13902 USA Strang Canc Prevent Ctr New York NY 10021 USA

Consider a linear regression model where the response variable may be right-censored. The standard maximum likelihood estimator (MLE)-based parametric approach to estimation of regression coefficients requires that the parametric form of the error distribution be known. Given a dataset, we may not be able to find a valid parametric form for the error distribution. In such a case the error distribution is unknown and arbitrary, and a semiparametric approach is plausible. A special modified semiparametric MLE (MSMLE) of the regression coefficients is proposed. Simulation suggests that the MSMLE is consistent is asymptotically normally distributed and may be efficient. The new procedure is applied to engineering data.

关键词： arbitrary error distribution asymptotic normality noniterative algorithm semiparametric MLE simulation studies

来源：评论

学校读者我要写书评

暂无评论

Round-up of integer bit allocation

引用

ELECTRONICS LETTERS 2002年第10期38卷 466-467页

作者： Guo, LF Meng, Y Florida Atlantic Univ Dept Elect Engn Boca Raton FL 33430 USA

A non-iterative algorithm is presented for the round-up procedure of integer bit allocation, The round-up algorithm will give the optimum result without the disadvantages of the traditional iterative method.

关键词： integer bit allocation source coding Codes quantisation (signal) noniterative algorithm Information theory round-up procedure communication applications quantization

来源：评论

学校读者我要写书评

暂无评论

POWER SYSTEM DYNAMIC-STATE ESTIMATION BY OPTIMAL VARIABLE INCREMENTAL DISPLACEMENTS

引用

PROCEEDINGS OF THE INSTITUTION OF ELECTRICAL ENGINEERS-LONDON 1976年第5期123卷 433-436页

作者： ALLAM, MF LAUGHTON, MA UNIV LONDON QUEEN MARY COLL DEPT ELECT & ELECTR ENGNLONDON E1 4NSENGLAND

A dynamic-state estimation technique is proposed based on the concept of relating changes observed in the measured variables to changes in the state variables by means of a power-system production function which is introduced and defined. Optimal state-variable changes are found using pseudo-inverse matrices in a simple noniterative algorithm.

关键词： noniterative algorithm dynamic state estimation Network and transmission line calculations Control system analysis and synthesis methods pseudo inverse matrice optimal state variable state estimation Power systems Control of electric power systems power system power systems incremental displacements

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：