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

International Conference on Advances in Materials Science and Information Technologies in Industry (AMSITI)

作者： Liu Wei Sun Yiming Liu Yanxiu Changchun Univ Sci & Technol Dept Comp Sci & Technol Changchun 130022 Peoples R China

ISBN: (纸本)9783038350125

We propose a noise-robust continuous speech recognition (CSR) method for modeling and recognition. In recognition, we divide the continuous speech vectors to segments using proposed algorithm, then use DRA based on the segments for recognition. The proposed method efficiency is studied for noisy environment. DRA decreases the difference between the model and recognition continuous speech vectors. The new algorithm focuses on adjust the vectors by using different maxima in different segments. Segment-based DRA algorithm can make noisy speech feature vectors closer to the model. The average recognition rate has been improved at different noise and SNR conditions.

关键词： Noise Robust Continuous Speech Recognition optimal algorithm

来源：评论

学校读者我要写书评

暂无评论

Semi-Automatic Analysis of algorithm Complexity (Case Study: Square-Root Computation) 12

Semi-Automatic Analysis of Algorithm Complexity (Case Study:...

引用

12th IEEE International Symposium on Intelligent Systems and Informatics (SISY)

作者： Erascu, Madalina West Univ Timisoara HPC Ctr Timisoara Romania

ISBN: (纸本)9781479959969

We report on our on-going efforts to apply real quantifier elimination to the (semi-)automatic complexity analysis of numerical algorithms. In particular, we describe a case study on the square root problem: given a real number x and an error bound epsilon, find a real interval such that it contains root x and its width is less than or equal to epsilon. A typical numerical algorithm starts with an initial interval and repeatedly updates it by applying a "refinement map" on it until it becomes narrow enough. In this paper, the complexity analysis amounts to find the smallest maximum number of loop iterations of the algorithm. Hence, the algorithm must be correct, terminating and optimal. It can be formulated as a quantifier elimination problem over real numbers. Hence, in principle, the complexity analysis can be carried out automatically. However, the computational requirement is huge, making the automatic analysis practically impossible with the current general real quantifier elimination software. We overcame the difficulty by (1) carefully reducing a complicated quantified formula into several simpler ones and (2) automatically eliminating the quantifiers from the resulting ones using the state-of-the-art quantifier elimination software. As the result, we were able to compute semi-automatically the complexity of a class of optimal contracting maps.

关键词： Complexity optimal algorithm Square root Real quantifier elimination

来源：评论

学校读者我要写书评

暂无评论

Guidance Control Law Design for Penetrating Guided Bomb Based on Multi-section Composite Guidance 33

Guidance Control Law Design for Penetrating Guided Bomb Base...

引用

33rd Chinese Control Conference (CCC)

作者： Zhang Zhi-an Ji Zheng NUST Sch Mech Engn Nanjing 210094 Jiangsu Peoples R China

ISBN: (纸本)9781479947249

According to the guideline requirement for certain penetrating aero guided bomb, a guidance control law based on multi-section composite guidance is designed, the mathematical model of control system composed of pitch, yaw and roll channel is built. In order to pitching loop as the analysis object, in the glide phase, the normal overload is taken as the controlled parameter, so as to keep the aero guided bomb flighting at maximum lift-drag ratio;In the transitional phase, the method of pitch angle control and early virtual proportional navigation is adoptted, aiming at ensuring the impact angle maximum and that the bomb can fall into preconcerted proportional navigation region, under the condition that the normal overload is less than the required overload;In the dive phase, virtual proportional navigation is taken to guide the bomb to the target and meet the requirement of attack angle and the CEP precision simultaneously. The optimal algorithm which optimize the control parameters of two key points is adopted to fulfill the demand of adaptive flight control for the aero guided bomb. Simulation results show that the control law of multi-section composite guidance can meet the requirements of the large impact angle, small attack angle, minimum impact velocity and the CEP precision, and also provide technical support for the engineering realization of the penetrating aero guided bomb.

关键词： Aero Guided Bomb Normal Overload Virtual Proportional Navigation optimal algorithm GuidanceLlaw

来源：评论

学校读者我要写书评

暂无评论

optimal Implementation of Elliptic Curve Cryptography

Optimal Implementation of Elliptic Curve Cryptography

引用

IEEE International Conference on Service Operations and Logistics, and Informatics (SOLI)

作者： Lv, Hongqiang Li, Hui Yi, Junkai Lu, Hao Beijing Univ Chem Technol Coll Informat Sci & Technol Beijing 100029 Peoples R China Chinese Acad Sci Inst Automat State Key Lab Management & Control Complex Syst Beijing Peoples R China

ISBN: (纸本)9781479905300;9781479905294

The most time-consuming operation in the Elliptic Curve Cryptography (ECC) calculation is scalar multiplication. Scalar multiplication plays a major role in ECC. Currently, there are several optimization algorithms for point scalar multiplication which have either high computational complexity or additional storage requirement. They are all unsuitable for further applying. In this paper, we present a new compatible optimal algorithm which improves the efficiency by generating a special random number k as the scalar. The experimental results show that the processes of encryption and decryption have been speed up significantly in the same condition.

关键词： Elliptic Curve Cryptography scalar multiplication optimal algorithm random number

来源：评论

学校读者我要写书评

暂无评论

An Improved optimal algorithm For A Location Choice Problem

An Improved Optimal Algorithm For A Location Choice Problem

引用

1st International Conference on Networking and Digital Society

作者： Ma Ran Han Xuefeng Henan Polytech Univ Coll Math & Informat Sci Jiaozuo 454000 Peoples R China

The paper presents an improved optimal location choice in a network. The location choice model considers not only the maximum distances between the vertices but also the sum of the whole cost, which is a common proble... 详细信息

ISBN: (纸本)9780769536354

关键词： network optimal algorithm location choice problem

来源：评论

学校读者我要写书评

暂无评论

Semi-online scheduling for jobs with release times

引用

JOURNAL OF COMBINATORIAL OPTIMIZATION 2013年第3期26卷 448-464页

作者： Li, Rongheng Yang, Liying He, Xiaoqiong Chen, Qiang Cheng, Xiayan Hunan Normal Univ Coll Math & Comp Sci Changsha 410081 Hunan Peoples R China

In this paper we consider three semi-online scheduling problems for jobs with release times on m identical parallel machines. The worst case performance ratios of the LS algorithm are analyzed. The objective function is to minimize the maximum completion time of all machines, i.e. the makespan. If the job list has a non-decreasing release times, then is the tight bound of the worst case performance ratio of the LS algorithm. If the job list has non-increasing processing times, we show that is an upper bound of the worst case performance ratio of the LS algorithm. Furthermore if the job list has non-decreasing release times and the job list has non-increasing processing times we prove that the LS algorithm has worst case performance ratio not greater than 3/2 - 1/2m.

关键词： On-line scheduling List scheduling optimal algorithm Worst-case performance Release time

来源：评论

学校读者我要写书评

暂无评论

Sampling numbers of periodic Sobolev spaces with a Gaussian measure in the average case setting

引用

JOURNAL OF APPROXIMATION THEORY 2013年 167卷 109-120页

作者： Huang, Zexia Wang, Heping Capital Normal Univ Sch Math Sci Beijing 100048 Peoples R China

In this paper, we investigate p-average sampling numbers of a periodic Sobolev space W-2(r) with a Gaussian measure in the L-q metric for 1 <= q <= infinity and 0 < p < infinity, and obtain their asymptotic orders. Moreover, we show that in the average case setting, the operators I-n, which are the Lagrange interpolating operators, are asymptotically optimal in the Lq metric for all 1 <= q <= infinity. It is interesting to note that in the worst case setting, In are not asymptotically optimal algorithms in the Lq metric for q = 1 or infinity. (C) 2012 Elsevier Inc. All rights reserved.

关键词： Average sampling numbers Standard information optimal algorithm Gaussian measure

来源：评论

学校读者我要写书评

暂无评论

Determining the transport mechanism of an enzyme-catalytic complex metabolic network based on biological robustness

引用

BIOPROCESS AND BIOSYSTEMS ENGINEERING 2013年第4期36卷 433-441页

作者： Wang, Lei Dalian Univ Technol Sch Math Sci Dalian 116024 Liaoning Peoples R China

Understanding the transport mechanism of 1,3-propanediol (1,3-PD) is of critical importance to do further research on gene regulation. Due to the lack of intracellular information, on the basis of enzyme-catalytic system, using biological robustness as performance index, we present a system identification model to infer the most possible transport mechanism of 1,3-PD, in which the performance index consists of the relative error of the extracellular substance concentrations and biological robustness of the intracellular substance concentrations. We will not use a Boolean framework but prefer a model description based on ordinary differential equations. Among other advantages, this also facilitates the robustness analysis, which is the main goal of this paper. An algorithm is constructed to seek the solution of the identification model. Numerical results show that the most possible transport way is active transport coupled with passive diffusion.

关键词： Complex metabolic network Biological robustness System identification Transport mechanism optimal algorithm

来源：评论

学校读者我要写书评

暂无评论

Multi-covered path in wireless sensor networks

引用

TELECOMMUNICATION SYSTEMS 2013年第1期54卷 19-33页

作者： Fang, Can Zhang, Peng Huang, Wei Fu, Cheng Southwestern Univ Sch Comp & Informat Sci Chongqing Peoples R China Northwestern Polytech Univ Sch Comp Sci Xian 710072 Peoples R China Nanchang Univ Sch Informat Engn Nanchang Peoples R China Chinese Acad Sci Shanghai Adv Res Inst Shanghai Peoples R China

The progress of development on sensor networks has inspired many new applications. Some of these applications require the target to be observed by more than one sensors simultaneously. Sensor coverage, which reflects how well a sensor network is monitored by sensors, is an important measure for the quality of service (QoS) that a sensor network can provide. In this paper, we addressed the coverage problem from two different view points and referred to them as the worst-case and best-case coverage problems. Most existing works on these two problems assumed that the coverage degree is one (i.e. the target area falls within the sensing range of at least one sensor). In this paper, we address the k-coverage problem, where the coverage degree is a user-defined parameter k. This is a generalization of the earlier work where only k=1 is assumed. By combining geometric and algorithmic techniques, we establish optimal algorithms to solve the two variants of the k-coverage problem in polynomial time. An important extension of our study on the k-coverage problem was also proposed: the distributed algorithm for the problem. This helps in applying the proposed algorithm under more practical scenarios.

关键词： optimal algorithm Polynomial time complexity Sensor network k-coverage

来源：评论

学校读者我要写书评

暂无评论

Generic Cuts: An Efficient algorithm for optimal Inference in Higher Order MRF-MAP

Generic Cuts: An Efficient Algorithm for Optimal Inference i...

引用

12th European Conference on Computer Vision (ECCV)

作者： Arora, Chetan Banerjee, Subhashis Kalra, Prem Maheshwari, S. N. Indian Inst Technol Delhi Delhi India

ISBN: (纸本)9783642337147

We propose a new algorithm called Generic Cuts for computing optimal solutions to 2 label MRF-MAP problems with higher order clique potentials satisfying submodularity. The algorithm runs in time O(2(k)n(3)) in the worst case (k is clique order and n is the number of pixels). A special gadget is introduced to model flows in a high order clique and a technique for building a flow graph is specified. Based on the primal dual structure of the optimization problem the notions of capacity of an edge and cut are generalized to define a flow problem. We show that in this flow graph max flow is equal to min cut which also is the optimal solution to the problem when potentials are submodular. This is in contrast to all prevalent techniques of optimizing Boolean energy functions involving higher order potentials including those based on reductions to quadratic potential functions which provide only approximate solutions even for submodular functions. We show experimentally that our implementation of the Generic Cuts algorithm is more than an order of magnitude faster than all algorithms including reduction based whose outputs on submodular potentials are near optimal.

关键词： Higher Order MRF-MAP Submodular Function Minimization optimal algorithm

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：