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

relaxation algorithm-based PTV with dual calculation method and its application in addressing particle saltation

JOURNAL OF VISUALIZATION 2015年第1期18卷 71-81页

作者： Jia, Pan Wang, Yuan Zhang, Yang Yang, Bin Xi An Jiao Tong Univ Dept Fluid Machinery & Engn Xian 710049 Peoples R China Northwest Univ Sch Chem Engn Xian 710069 Peoples R China

This paper proposes a dual calculation method (DCM) that in velocity fields obtained from particle tracking velocimetry detects spurious velocity vectors. The synthetic images were used to test the performance of the DCM. By adding random erasing to the genuine matching data, the influence of noise effect was simulated and analyzed. A comparison with the minimum net-flux method indicates that the DCM is more effective in identifying erroneous vectors as particles having no genuine candidates are more readily identified, thereby, ensuring strong consistent match. The DCM is also found to be more effective in addressing particle saltation, based on the accurately abstracted trajectories, the kinetic parameters of the sand grains are calculated.

关键词： Particle tracking relaxation algorithm Dual calculation Particle saltation

来源：评论

学校读者我要写书评

暂无评论

Models and a relaxation algorithm for continuous network design problem with a tradable credit scheme and equity constraints

引用

COMPUTERS & OPERATIONS RESEARCH 2014年第1期41卷 252-261页

作者： Wang, Guangmin Gao, Ziyou Xu, Meng Sun, Huijun Beijing Jiaotong Univ Inst Syst Sci Beijing 100044 Peoples R China China Univ Geosci Sch Econ & Management Wuhan 430074 Peoples R China Beijing Jiaotong Univ MOE Key Lab Urban Transportat Complex Syst Theory Beijing 100044 Peoples R China

The sustainable problems of transportation have become noticeable in the majority of cities worldwide. Many researchers are devoted themselves into traffic congestion. Generally, traffic congestion could be alleviated via increasing road capacity (supply) or reducing traffic (demand). In this paper, we model CNDP which has a tradable credit scheme and equity constraints in order to research on the way of releasing congestion by combining increasing supply and reducing demand. Firstly, the bilevel programming problem is proposed to model the CNDP with a tradable credit scheme. The upper level (the government) chooses optimal capacity enhancement for some existing links to minimize the total system costs under a budget constraint. The lower level chooses the optimal route based on considering the generalized travel cost in which both travel time and credit charging for using the link are involved. And then, considering the inequity problem in terms of equilibrium O-D travel cost and link travel time, the model is proposed by incorporating equity constraints into CNDP with a tradable credit scheme. After presenting a relaxation algorithm, the experiments on Sioux Falls network are illustrated. Finally, conclusion and some future research directions are presented. (C) 2012 Elsevier Ltd. All rights reserved.

关键词： Continuous network design problem (CNDP) Bilevel programming problem relaxation algorithm Tradable credit scheme Equity

来源：评论

学校读者我要写书评

暂无评论

R&D-based Calibrated Growth Models with Finite-Length Patents: A Novel relaxation algorithm for Solving an Autonomous FDE System of Mixed Type

引用

COMPUTATIONAL ECONOMICS 2018年第1期51卷 123-158页

作者： Lin, Hwan C. Shampine, L. F. Univ North Carolina Charlotte Dept Econ 9201 Univ City Blvd Charlotte NC 28223 USA Southern Methodist Univ Dept Math POB 750235 Dallas TX 75275 USA

The statutory patent length is 20 years in most countries. R&D-based growth models, however, often presume an infinite patent length. In this paper, finite-length patents are embedded in a non-scale R&D-based growth model, while allowing any patent's effective life to be terminated prematurely, subject to two idiosyncratic hazards from imitation and creative destruction. This gives rise to an autonomous system of mixed-type functional differential equations (FDEs) that had never been encountered in the growth literature. Its dynamics are driven by current, delayed and advanced states. We present a relaxation algorithm to solve these FDEs by solving a sequence of standard boundary value problems for systems of ordinary differential equations. We use this algorithm to simulate a calibrated U.S. economy's transitional dynamics by making discrete changes from the baseline 20 years patent length. We find that if transitional impacts are taken into account, the switch to the long-run optimal patent length can incur a welfare loss, albeit rather small.

关键词： Patent length Innovation Delay differential equation Advance differential equation Dynamics Endogenous growth relaxation algorithm

来源：评论

学校读者我要写书评

暂无评论

Objective relaxation algorithm for Reliable Simulation-Driven Size Reduction of Antenna Structures

引用

IEEE ANTENNAS AND WIRELESS PROPAGATION LETTERS 2017年 16卷 1949-1952页

作者： Koziel, Slawomir Reykjavik Univ Sch Sci & Engn IS-101 Reykjavik Iceland Gdansk Univ Technol Fac Elect Telecommun & Informat PL-80233 Gdansk Poland

This letter investigates reliable size reduction of antennas through electromagnetic-driven optimization. It is demonstrated that conventional formulation of the design task by direct footprint miniaturization with imposing constraints on electrical performance parameters may not lead to optimum results. The reason is that-in a typical antenna structure-only a few geometry parameters explicitly determine the antenna footprint, and therefore sensitivity of antenna size to other parameters is zero. At the same time, finding the genuine optimum requires adjustment of all parameters as the optimum is determined by the tradeoff between the size and other figures of merit such as reflection characteristic. Here, an alternative designmethodology is proposed that involves relaxation between size reduction and matching improvement. Our methodology is demonstrated using two examples of ultrawideband antenna structures. It is superior over the conventional approach in terms of the optimized antenna size achieved. Experimental validation of the results is also provided.

关键词： Antenna design miniaturization relaxation algorithm simulation-driven design surrogate modeling

来源：评论

学校读者我要写书评

暂无评论

A relaxation algorithm FOR DECENTRALIZED RESOURCE ALLOCATION IN FEMTOCELL NETWORKS

A RELAXATION ALGORITHM FOR DECENTRALIZED RESOURCE ALLOCATION...

引用

2nd IEEE International Conference on Cloud Computing and Intelligent Systems (CCIS)

作者： Wang, Xiaoyu Liu, Yuan'an Xie, Gang Deng, Panliang Beijing Univ Posts & Telecommun Sch Elect Engn Beijing 100876 Peoples R China Beijing Univ Posts & Telecommun Sch Informat & Commun Engn Beijing 100876 Peoples R China Beijing Univ Posts & Telecommun Key Lab Univ Wireless Commun Minist Educ Beijing 100876 Peoples R China

ISBN: (纸本)9781467318556;9781467318570

Dynamic spectrum sharing can improve the spectrum efficiency under some constraints on the interference to the authorized users. However, in femtocell networks the sensing reliability of femtocell access point (FAP) is limited by the channel fading and device preference. In this paper, we consider the influence of miss detection and false alarm to the macrocell user (MU) and model this problem as a joint optimization of spectrum detection and power allocation. A relaxation algorithm for decentralized resource allocation has been proposed to maximize the throughput of the femtocell networks. The simulation results demonstrate that the proposed algorithm can improve the throughput of femtocell networks than uniform threshold algorithm.

关键词： Resource allocation relaxation algorithm Femtocell network Cognitive radio

来源：评论

学校读者我要写书评

暂无评论

Recursive relaxation algorithm for Identification of Multiple Input Multiple Output Systems

Recursive Relaxation Algorithm for Identification of Multipl...

引用

Chinese Intelligent Automation Conference

作者： Zhou, Ying Yang, Jing-song Wang, Tong Wang, Hong Hebei Univ Technol Tianjin 300130 Peoples R China 93756 Troops Tianjin Peoples R China CETGC Res Inst 53 Tianjin 300130 Peoples R China

ISBN: (纸本)9789813290501;9789813290495

The traditional system identification method based on least square method has the disadvantages of heavy computation and slow operation speed in a particular model. In this paper, the off-line identification based on the equation error autoregressive model is studied by using the relaxation algorithm which is proved the unbiasedness and effectiveness. Furthermore, on the basis of off-line identification parameters, the system is identified online by recursive relaxation algorithm that calculated by relaxation algorithm. The simulation results show that the recursive relaxation algorithm has good computational speed and identification accuracy in the multi-input-multi-output linear system.

关键词： relaxation algorithm Online identification Linear system Multiple input multiple output

来源：评论

学校读者我要写书评

暂无评论

Learning model in relaxation algorithm influenced by self-organizing maps for image restoration

引用

IEEJ TRANSACTIONS ON ELECTRICAL AND ELECTRONIC ENGINEERING 2008年第4期3卷 404-412页

作者： Maeda, Michiharu Shigei, Noritaka Miyajima, Hiromi Fukuoka Inst Technol Fac Informat Engn Dept Comp Sci & Engn Higashi Ku Fukuoka 8110295 Japan Kagoshima Univ Fac Engn Dept Elect & Elect Engn Kagoshima 8900065 Japan

This paper presents a learning model in relaxation algorithm influenced by self-organizing maps for reducing random-valued impulse noise. Self-organizing maps have been hitherto studied for the ordering process and the convergence phase of weight vectors. As a novel approach of self-organizing maps, a learning model in relaxation algorithm for image restoration is proposed, which creates a map containing one unit for each pixel. Utilizing pixel values as input, image inference is conducted by self-organizing maps. Then, an updating function with threshold according to the difference between input value and inferred value is introduced, so as not to respond to noisy input sensitively. Therefore the inference of an original image proceeds appropriately since any pixel is influenced by neighboring pixels corresponding to the neighboring setting. The characteristic of our approach includes the network constructing the same number of both inputs and weights for inferring the original image from a degraded image in sequential processing, unlike the distinct number in which self-organizing maps have applied to conventional techniques for the ordering and the convergence of weight vectors. In the inference process, the effect of initial threshold and initial neighborhood on accuracy is examined. Experimental results are presented in order to show that our approach is effective in quality for image restoration. (C) 2008 Institute of Electrical Engineers of Japan. Published by John Wiley & Sons, Inc.

关键词： image restoration self-organizing maps learning relaxation algorithm peak signal to noise ratio

来源：评论

学校读者我要写书评

暂无评论

A Link-Node Discrete-Time Dynamic Second Best Toll Pricing Model with a relaxation Solution algorithm

引用

NETWORKS & SPATIAL ECONOMICS 2009年第2期9卷 243-267页

作者： Ban, Xuegang (Jeff) Liu, Henry X. Rensselaer Polytech Inst Dept Civil & Environm Engn Troy NY 12180 USA Univ Minnesota Dept Civil Engn Minneapolis MN USA

Dynamic congestion pricing has become an important research topic because of its practical implications. In this paper, we formulate dynamic second-best toll pricing (DSBTP) on general networks as a bilevel problem: the upper level is to minimize the total weighted system travel time and the lower level is to capture motorists' route choice behavior. Different from most of existing DSBTP models, our formulation is in discrete-time, which has very distinct properties comparing with its continuous-time counterpart. Solution existence condition of the proposed model is established independent of the actual formulation of the underlying dynamic user equilibrium (DUE). To solve the bilevel DSBTP model, we adopt a relaxation scheme. For this purpose, we convert the bilevel formulation into a single level nonlinear programming problem by applying a link-node based nonlinear complementarity formulation for DUE. The single level problem is solved iteratively by first relaxing the strick complementarity by a relaxation parameter, which is then progressively reduced. Numerical results are also provided in this paper to illustrate the proposed model and algorithm. In particular, we show that by varying travel time weights on different links, DSBTP can help traffic management agencies better achieve certain system objectives. Examples are given on how changes of the weights impact the optimal tolls and associated objective function values.

关键词： Congestion pricing Dynamic second best toll pricing Dynamic user equilibrium relaxation algorithm

来源：评论

学校读者我要写书评

暂无评论

New relaxation algorithm for Three-dimensional Assignment Problem

New Relaxation Algorithm for Three-dimensional Assignment Pr...

引用

2011 13th IEEE Joint International Computer Science and Information Technology Conference(JICSIT 2011)

作者： Qian Gao School of Information Science and Engineering Ludong University Yantai, China Hailin Zou School of Information Science and Engineering Ludong University Yantai, China Xinming Zhang School of Foreign Languages Ludong University Yantai, China Li Zhou School of Information Science and Engineering Ludong University Yantai, China

The valid solution algorithm for multi-dimensional assignment problem is a difficult point in optimization field. This paper proposes a new relaxation algorithm to solve three- dimensional assignment problem by fusing a certain number of good solutions of 2-dimensional (2-D) assignment problems which are relaxed from 3-D assignment problem. The new algorithm constructs the optimal solution by assigning the solution components with high frequency appearing in the good solutions of 2-D assignment problems according to an order from high to low under feasible constraints. So the calculation complexity is decreased, and the data association accuracy of targets is improved to some extent. Simulation results show that the new algorithm is feasible and effective.

关键词： solution component relaxation algorithm three- dimensional assignment problem

来源：评论

学校读者我要写书评

暂无评论

A relaxation algorithm FOR DECENTRALIZED RESOURCE ALLOCATION IN FEMTOCELL NETWORKS

A RELAXATION ALGORITHM FOR DECENTRALIZED RESOURCE ALLOCATION...

引用

2012 IEEE 2nd International Conference on Cloud Computing and Intelligence Systems

作者： Xiaoyu Wang Yuan'an Liu Gang Xie Panliang Deng School of Electronic Engineering Beijing University of Posts and Telecommunications Key Laboratory of Universal Wireless Communication Ministry of EducationBeijing University of Posts and Telecommunications School of Information and Communication Engineering Beijing University of Posts and Telecommunications

关键词： Resource allocation relaxation algorithm Femtocell network Cognitive radio

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：