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

A Hybrid algorithm for Optimizing Multi-Modal Functions

Wuhan University Journal of Natural Sciences 2006年第3期11卷 551-554页

作者： Li Qinghua Yang Shida Ruan Youlin College of Computer Science and Technology Huazhong University of Science and Technology Wuhan 430074Hubei China

A new genetic algorithm is presented based on the musical performance. The novelty of this algorithm is that a new genetic algorithm, mimicking the musical process of searching for a perfect state of harmony, which increases the robustness of it greatly and gives a new meaning of it in the meantime, has been developed, Combining the advantages of the new genetic algorithm, simplex algorithm and tabu search, a hybrid algorithm is proposed. In order to verify the effectiveness of the hybrid algorithm, it is applied to solving some typical numerical function optimization problems which are poorly solved by traditional genetic algorithms. The experimental results show that the hybrid algorithm is fast and reliable.

关键词： harmony genetic allgorithm simplex algorithm Tabu search

来源：评论

学校读者我要写书评

暂无评论

MEDIUM OPTIMIZATION OF PYROLYSIS REACTOR

MEDIUM OPTIMIZATION OF PYROLYSIS REACTOR

引用

19th International Symposium of the Danube-Adria-Association-for-Automation-and-Manufacturing

作者： Lupu Ciprian Azzouzi Messaouda

ISBN: (纸本)9783901509681

This paper deals with the supervision of an industrial plant by taking a petrochemical process as a study case;it is a new optimization procedure that was applied on a pyrolysis reactor which is fed in by the petrol as a primary matter and produces the ethylene, one of its several products. The medium optimization principle was tackled in this work, starting from a set of stationary system data that depends on the petrol feed-in source selected in each case under certain probability estimations. So the received petrol quality plays an important role in the produced ethylene concentration.

关键词： optimization pyrolysis reactor simplex algorithm petrol separation modelling

来源：评论

学校读者我要写书评

暂无评论

Alignstein: Optimal transport for improved LC-MS retention time alignment

引用

GIGASCIENCE 2022年第11期11卷 giac101页

作者： Skoraczynski, Grzegorz Gambin, Anna Miasojedow, Blazej Univ Warsaw Fac Math Informat & Mech Stefana Banacha 2 PL-02097 Warsaw Poland

Background: Reproducibility of liquid chromatography separation is limited by retention time drift. As a result, measured signals lack correspondence over replicates of the liquid chromatography-mass spectrometry (LC-MS) experiments. Correction of these errors is named retention time alignment and needs to be performed before further quantitative analysis. Despite the availability of numerous alignment algorithms, their accuracy is limited (e.g., for retention time drift that swaps analytes' elution order). Results: We present the Alignstein, an algorithm for LC-MS retention time alignment. It correctly finds correspondence even for swapped signals. To achieve this, we implemented the generalization of the Wasserstein distance to compare multidimensional features without any reduction of the information or dimension of the analyzed data. Moreover, Alignstein by design requires neither a reference sample nor prior signal identification. We validate the algorithm on publicly available benchmark datasets obtaining competitive results. Finally, we show that it can detect the information contained in the tandem mass spectrum by the spatial properties of chromatograms. Conclusions: We show that the use of optimal transport effectively overcomes the limitations of existing algorithms for statistical analysis of mass spectrometry datasets. The algorithm's source code is available at https://***/grzsko/Alignstein.

关键词： liquid chromatography-mass spectrometry retention time alignment Wasserstein distance simplex algorithm

来源：评论

学校读者我要写书评

暂无评论

Intervention policy influence on the effect of epidemiological crisis on industry-level production through input-output networks

引用

SOCIO-ECONOMIC PLANNING SCIENCES 2023年第PartA期87卷

作者： Lazebnik, Teddy Shami, Labib Bunimovich-Mendrazitsky, Svetlana UCL Canc Inst Dept Canc Biol London England Western Galilee Coll Dept Econ Akko Israel Ariel Univ Dept Math Ariel Israel

During a global epidemiological crisis, lockdowns and border closures substantially disrupt international supply chains, underscoring the importance of choosing an intervention policy that accounts for the unique structure of input-output linkages among domestic industries. This study develops a pioneering mathematical model to quantify the role of pandemic-related intervention policies in the economic impact of a pandemic outbreak in an economy where sectors are complements throughout input-output networks. Our approach is based on three pillars - epidemiological, social, and economic sub-models. Moreover, we present in silico computer simulations to examine the influence of work capsules, work-from-home, vaccination, and industry closure on the damage a pandemic could inflict on output at the industry level. A comparison between work capsules and work-from-home policies shows that the latter decreases economic loss much more than the former. Compared to a state without interventions, a work-from-home policy affecting 12% of the workforce will decrease output loss by 1.4 percentage points during an epidemiological crisis following a COVID-19-like outbreak. Under the constraint of choosing one intervention policy, vaccination significantly reduces the loss of output, particularly in industries that require close customer-seller contacts. In the analysis of scenarios of integrating intervention policies, it is found that, using direct marginal contribution as the measure, the vaccination intervention is approximately 4.5 times more effective at reducing output loss than the work-from-home intervention.

关键词： Spatio-temporal SIR models Input-output tables and analysis Production Crisis management Government policy simplex algorithm

来源：评论

学校读者我要写书评

暂无评论

BUDGET CONSTRAINED OPTIMAL TIME SCHEDULING algorithm IN GRID

BUDGET CONSTRAINED OPTIMAL TIME SCHEDULING ALGORITHM IN GRID

引用

2009 2nd IEEE International Conference on Broadband Network & Multimedia Technology（IC-BNMT2009）

作者： Lv Yi,Liu Chuan,Huang Sheng,Jiang Qing Communication and Information Engineering Institute,Chongqing University of Posts and Telecommunications,Chongqing 400065,China

Tasks' smallest completion time is a fundamental goal of the grid scheduling,however,the completion time of tasks and cost are often *** this paper,A Budget Constrained Optimal Time Scheduling on the grid computing platforms is discussed,where resources have different speeds of computation and *** task scheduling problem is converted into a linear programming *** resource gains the optimal execution time and the smallest completion time of the task were obtained,under the condition of the budget constraint,using of the simplex algorithm to obtain the optimal *** simulation results show that the performance of the algorithm is superior to other similar algorithms.

关键词： grid scheduling linear programming simplex algorithm

来源：评论

学校读者我要写书评

暂无评论

Combining Genetic algorithm with Sim lex Method for Geometric Constraint Solving

Combining Genetic Algorithm with Sim lex Method for Geometri...

引用

2010 International Conference on Computer,Mechatronics,Control and Electronic Engineering(2010计算机、机电、控制与电子工程国际会议 CMCE 2010)

作者： Hua Yuan Xin Chang School of Computer Science & Engineering Changchun University of Technology Changchun China School of Computer Science & Engineering Changchun University of Technology Changchun China

ISBN: (纸本)9781424479573

The geometric constraint solving can transform into the numerical optimization solving. A new hybrid algorithm is proposed which combines the merits of global search of the Genetic algorithm and the good property of local search of the simplex algorithm approach. This algorithm uses Genetic algorithm to search the area where the best solution may exist in the whole space, and then performs fine searching. When the algorithm approaches to the best solution and the search speed is too slow, we can change to the effective local search strategy—the simplex algorithm in order to enhance the ability of the GA on fine searching. It makes the algorithm get rid off the prematurity convergence situation. We apply this algorithm into the geometric constraint solving. The experiment shows that the hybrid algorithm has the effective convergence property and it can find the global best solution.

关键词： Genetic algorithm geometric constraint solving simplex algorithm

来源：评论

学校读者我要写书评

暂无评论

Leveraging Human Mobility for Communication in Body Area Networks

引用

ACM TRANSACTIONS ON SENSOR NETWORKS 2014年第3期10卷 39-39页

作者： Hauer, Jan-Hinrich Tech Univ Berlin Telecommun Networks Grp D-10587 Berlin Germany

When a person is walking the RF signal strength of an on-body communication link may exhibit significant fluctuation with peak-to-peak amplitudes beyond 20 dB. Instantaneous signal strength may be noisy, but the smoothed signal typically exhibits a period that matches the person's stride period. We present an opportunistic packet scheduler that extracts a set of Received Signal Strength Indicator (RSSI) samples from application traffic and utilizes an accelerometer to monitor the person's gait cycle. Packets are scheduled based on previous RSSI peaks and the current offset within the gait cycle. We formulate the task of finding a nonoverlapping packet schedule among the different body area network (BAN) devices as a linear programming problem and present an efficient way of solving it with the simplex method. Our experimental evaluation shows that outdoors BAN links with PRR (ratio of correctly received to transmitted packets) values between 50% and 90% can typically be turned into reliable links with PRR values well above 90%. Indoors the improvements are smaller, but still significant at low transmission power. The main price is an increase in packet delivery latency. The energy consumed by the devices is marginal, but the coordinator spends more energy due to signal processing.

关键词： algorithm Design Experimentation Measurement Performance Wireless sensor networks body area networks mobility packet scheduling simplex algorithm MAC

来源：评论

学校读者我要写书评

暂无评论

Distributed lighting control of locally intelligent luminaire systems

Distributed lighting control of locally intelligent luminair...

引用

IEEE International Conference on Systems, Man, and Cybernetics

作者： Haixu Wang Ashish Pandharipande David Caicedo P. P. J. van den Bosch Philips Research High Tech Campus Eindhoven University of Technology Faculty of Electrical Engineering

ISBN: (纸本)9781467317139

We consider the control of lighting systems with embedded sensing, communication, computation and control functions at the luminaire-level. Each intelligent luminaire has (i) local presence sensing information, (ii) local light distribution information, (iii) a controller that determines its dimming level, and (iv) connectivity with other luminaires in its neighborhood. In a lighting system of such luminaires, we are interested in achieving localized illumination rendering wherein average illuminance levels of L_o and L_u are to be provided in occupied and unoccupied zones respectively, with a given uniformity level. Under these constraints, we minimize the power expended for rendering in the lighting system. A distributed control algorithm is designed to determine dimming levels of each luminaire. The performance of the proposed algorithm is compared with a centralized control algorithm in terms of power consumption and achieved illumination rendering, under different occupancy conditions.

关键词： Distributed lighting control simplex algorithm LED-luminaires Localized illumination rendering lighting equipment LIGHTING SYSTEMS Rendering control function Computer algorithms lighting controls dimming Information Distribution Power consumption Standing Orders Controllers

来源：评论

学校读者我要写书评

暂无评论

Shape Optimization of Stratosphere Airship

Shape Optimization of Stratosphere Airship

引用

Asian Simulation Conference/The 6th International conference on system Simulation and Scientific Computing

作者： WANG Xiaoliang, SHAN Xuexiong (Dept. of Eng. Mechanics, Shanghai Jiaotong Univ, Shanghai, 200030)

Using one-way coupled inviscid - boundary layer model and a hybrid genetic algorithm, shape optimization of airship in incompressible flow at zero incidence was performed for the design Reynolds number regime of high altitude stratospheric platforms. The airship geometry is expressed analytically as piecewise polynomial function of eight parameters. The inviscid flow is computed by distribution of source on airship surface, which provides the pressure and velocity of airship's surface. The boundary layer is computed using an integral formulation: the laminar part of the flow is computed with Thwaites' model, and the turbulent part is solved with Head's model. A en-type amplification formulation is used to locate the transition area. The drag coefficient is computed using the Squire-Young formula. Optimization problems are solved using a hybrid genetic algorithm composed of Genetic algorithm and Nelder-Mead simplex search method. Finally, the optimal shape of airship body under one condition was presented.

关键词： airship boundary layer genetic algorithm simplex algorithm

来源：评论

学校读者我要写书评

暂无评论

Combining Genetic algorithm with Simlex Method for Geometric Constraint Solving

Combining Genetic Algorithm with Simlex Method for Geometric...

引用

2010 International Conference on Computer,Mechatronics, Control and Electronic Engineering (CMCE 2010)

作者： Hua Yuan School of Computer Science & Engineering Changchun University of Technology Changchun,China Xin Chang School of Computer Science & Engineering,Changchun University of Technology Changchun,China

The geometric constraint solving can transform into the numerical optimization solving.A new hybrid algorithm is proposed which combines the merits of global search of the Genetic algorithm and the good property of local search of the simplex algorithm *** algorithm uses Genetic algorithm to search the area where the best solution may exist in the whole space,and then performs fine *** the algorithm approaches to the best solution and the search speed is too slow,we can change to the effective local search strategy-the simplex algorithm in order to enhance the ability of the GA on fine *** makes the algorithm get rid off the prematurity convergence *** apply this algorithm into the geometric constraint *** experiment shows that the hybrid algorithm has the effective convergence property and it can find the global best solution.

关键词： Genetic algorithm geometric constraint solving simplex algorithm

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：