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

Inspecting a Set of Strips optimally

11th International Workshop on algorithms and Data Structures (WADS 2009)

作者： Kamphans, Tom Langetepe, Elmar Braunschweig Univ Technol Algorithms Grp D-38106 Braunschweig Germany Univ Bonn Inst Comp Sci 1 Bonn 53117 Germany

ISBN: (纸本)9783642033667

We consider a set of axis-parallel nonintersecting strips in the plane. An observer starts to the left of all strips and ends to the right, thus visiting all strips in the given order. A strip is inspected as long as the observer is inside the strip. How should the observer move to inspect all strips'? We use the path length outside a strip as a quality measure which should be minimized. Therefore, we would like to find a directed path that minimizes the maximal measure among all strips. We present an optimal algorithm designed according to the structural properties of the optimal solution.

关键词： Computational geometry motion planning watchman routes optimal inspection path optimal algorithm

来源：评论

学校读者我要写书评

暂无评论

Dynamic Programming for optimal Integration of Plug-in Hybrid Electric Vehicles (PHEVs) in Residential Electric Grid Areas

Dynamic Programming for Optimal Integration of Plug-in Hybri...

引用

Annual Conference on IEEE Industrial Electronics Society

作者： Harun TURKER Ahmad HABLY Seddik BACHA Grenoble Electrical Engineering Lab. Grenoble Image Parole Signal Automatique Lab.

ISBN: (纸本)9781467324199

Plug-in Hybrid Electric Vehicles (PHEVs) will strongly penetrate in the car fleet. Based on databases of the houses Daily Loads Profiles (DLPs) and on a probabilistic algorithm of PHEVs connections in residential electric grid areas, this paper determines the minimal charging current or PHEVs charging power which assures that the batteries reached the desired State of Charge (SOC) at the departure time without any charging restriction during peak hours. A dynamic optimization algorithm programming which defines an optimal constant charging current for the PHEV is developed. If charging occurs at home, the application of the proposed optimal algorithm on 10 000 cases shows statistically that a load power chargers for PHEVs charged in residential electric grid areas equals to 373W (230V×1.62A) ensures that 99.4% of the PHEVs batteries have a SOC equals to 100% for the next use.

关键词： Daily Load Profile Dynamic optimization algorithm Minimal charging current or power optimal algorithm Plug-in Hybrid Electric Vehicle Probabilistic algorithm Residential electric grid areas State of Charge

来源：评论

学校读者我要写书评

暂无评论

optimal Queries Processing in a Heterogeneous Sensor Network Using Multicommodity Network Flow Method

Optimal Queries Processing in a Heterogeneous Sensor Network...

引用

第17届工业工程与工程管理国际学术会议(IE&EM2010)

作者： Nurjahan Begum Samia Tasnim Mahmuda Naznin Department of Computer Science and Engineering Bangladesh University of Engineering and TechnologyDhaka-1000Bangladesh

In a wireless sensor network,it is a common practice to have in network partial data *** part of this,the mitigation of the demands issued by sink nodes in a heterogeneous resource constrained sensor network requires optimal resource sharing,which is a very challenging *** find this task analogous to finding the optimal flow in a multi commodity flow *** minimum cost multi commodity flow problem is an NP hard *** our paper,we give an optimal cost algorithm to solve this problem where a special data structure is built, which we call Data Forwarding *** compare our algorithm to a well known auction method where a commodity wins the bid based on the lowest cost path, and the other looser commodities are shipped using more expensive paths incurring more *** algorithmic analysis shows that our method is free of deadlock as well.

关键词： Multicommodity Sensor Network Query Processing optimal algorithm

来源：评论

学校读者我要写书评

暂无评论

BASED ON SELF ORGANIZED EVOLUTIONARY algorithm FOR SOLVING CONSTRAINT PROBLEM

BASED ON SELF ORGANIZED EVOLUTIONARY ALGORITHM FOR SOLVING C...

引用

2007中国宁波国际计算机科学与技术学术大会

作者： Zhu Lili Zhao Kong Yuan Hua Yi Rongqin Wenzhou University School of Physics & Electronic Information Suzhou Top Institute of Information Technology Key Lab.of Symbol Computation & Knowledge Engineering of the Ministry of Education College of Computer Science & Technology Jilin University

ISBN: (纸本)9780972147903

The problem of parameterization design is equivalent to the problem of solving a set of nonlinear equations *** this paper,a new optimization algorithm—self organized evolutionary algorithm(SOEA) is proposed and applied into the parameterization *** SOEA the colony is composed of the *** organizational evolutionary operators which are split operator,mergence operator and coordination operator can lead the colony to *** three kinds of operators have different functions in the *** operator limits the scale of the organization and makes sure a part of organization comes into next generation directly,which maintains the variety of the *** operator makes use of the leader's information fully and acts as a local search *** operator increases the degree of adaptability between the two organizations by the *** experiment shows that SOEA has good capability in parameterization design.

关键词： optimal algorithm Geometric constraint solving Self organized evolutionary algorithm

来源：评论

学校读者我要写书评

暂无评论

Linear time algorithm for computing min-max movement of sink-based mobile sensors for line barrier coverage

引用

CONCURRENCY AND COMPUTATION-PRACTICE & EXPERIENCE 2022年第2期34卷

作者： Zou, Wenjie Guo, Longkun Huang, Peihuang Lin, Geng Mei, Hengquan Fuzhou Univ Coll Math & Comp Sci Fuzhou Peoples R China Qilu Univ Technol Sch Comp Sci Room 420 Jinan 250353 Peoples R China Minjiang Univ Coll Math & Data Sci Fuzhou Peoples R China

Witnessing broad energy-critical applications of barrier coverage in mobile and wireless sensor networks, emerging practical applications have recently brought a new barrier coverage model which uses sink-based mobile sensors for covering a given barrier with the aim of prolonging the lifespan of the coverage. In the model, a set of sink stations were distributed on the plane in which each sink can emit mobile sensors with an identical radius. The task is to cover a given line barrier with the emitted mobile sensors, aiming to minimize the maximum movement of the sensors so as to prolong the shortest lifespan among the sensors in coverage. In this paper, we first devise an algorithm for optimally solving the problem based on the properties of the structures called movement parity and tangent equilibrium points between the sinks. Then based on a more sophisticated geometric property of optimum solutions, we improve the runtime to a linear runtime O(k) which attains the possibly optimum runtime of the problem for k being the number of sinks. At last, numerical experiments are carried out to demonstrate the practical performance gain of our algorithms against baselines in literature.

关键词： barrier coverage equilibrium min‐ max movement optimal algorithm sink station

来源：评论

学校读者我要写书评

暂无评论

optimality in SM Identification of Nonlinear Systems

引用

IFAC Proceedings Volumes 2003年第16期36卷 1519-1524页

作者： Mario Milanese Carlo Novara Dipartimento di Automatica e Informatica Politecnico di Torino Corso Duca degli Abruzzi 24. 10129 Torino Italy

In the paper the problem of identifying discrete time nonlinear systems from finite and noise-corrupted measurements is considered. Most methods in the literature are based on the estimation of a model within a finitely parametrized model class describing the functional form of involved nonlinearities. A key problem in these methods is the proper choice of the model class, typically realized by a search, from the simplest to more complex ones (linear, bilinear, polynomial, neural networks, etc.). In this paper an alternative approach, based on a Set Membership framework is presented, not requiring assumptions on the functional form of the regression function describing the relations between measured input and output, but assuming only some information on its regularity, given by bounds on its gradient. In this way, the problem of considering approximate functional forms is circumvented. Moreover, noise is assumed to be bounded, in contrast with statistical methods, which rely on assumptions such as stationarity, ergodicity, uncorrelation, type of distribution, etc., whose validity may be difficult to be reliably tested and is lost in presence of approximate modeling. Necessary and sufficient conditions for assumptions validation are given. An optimal interval estimate of the regression function is obtained, providing its uncertainty range for any assigned regressor values. The set estimate allows to derive an optimal identification algorithm, giving estimates with minimal guaranteed Lp error on the overall domain of the regressors. The properties of the optimal estimate are investigated and its worst-case Lp identification error is evaluated.

关键词： Nonlinear Identification Model quality Set Membership Identification optimal algorithm

来源：评论

学校读者我要写书评

暂无评论

Investigating effective variables to produce desirable aroma in sourdough using e-nose and sensory panel

引用

JOURNAL OF FOOD PROCESSING AND PRESERVATION 2021年第2期45卷 e15157-e15157页

作者： Farahmand, Elham Razavi, Seyed Hadi Mohtasebi, Seyed Saeid Univ Tehran Fac Agr Engn & Technol Dept Food Sci Engn & Technol Bioproc Engn Lab BPEL POB 4111 Karaj *** Iran Univ Tehran Fac Agr Engn & Technol Dept Agr Machinery Engn Karaj Iran

The present study introduces a procedure for designing a sourdough with a desirable aroma to promote the acceptability of sourdough bread's flavor. Different combinations of the most common flours and microbial species in sourdough fermentation were designed using the D-optimal algorithm and evaluated by panelists. We selected a combination of rye, barley, and oat (1:1:1) fermented by co-culture of Leuconostoc mesenteroides and Kluyveromyces marxianus. Also, we presented a novel method for choosing the most effective factors on the aroma intensity using an electronic nose (e-nose) system via singular value decomposition method. The effect of fermentation conditions (i.e., time, temperature, and dough yield), amino acids (phenylalanine, leucine, and asparagine), sugars (fructose, glucose, sucrose, and sorbitol), and enrichment by other parts of the grain (starch, embryo, and bran) were examined. Reducing temperature and increasing DY and time lead to producing stronger aroma in selected sourdough. Overall, fructose, phenylalanine, and bran among studied ingredients showed the highest impact on the intensity of aroma. Practical applications Improving the flavor is among the most challenging issues facing food manufacturers. The use of sourdough in the bread industry is a traditional method and has recently gained popularity among producers and consumers as it can improve texture, shelf life, and nutritional value. However, the fermentation process does not always lead to the desired flavor. Therefore, to solve this problem, an extensive study in flours and microbial strains widely used in sourdough production was conducted and the best combination was proposed. This product is a suitable alternative to chemical flavors. For future studies, the strategy proposed for detecting the most effective factors in aroma generation using an e-nose can be used for flavor improvement in other food products.

关键词： D‐ optimal algorithm flavor Kluyveromyces marxianus Leuconostoc mesenteroides singular value decomposition

来源：评论

学校读者我要写书评

暂无评论

Direct method for tension feasible region calculation in multi-redundant cable-driven parallel robots using computational geometry

引用

MECHANISM AND MACHINE THEORY 2021年 158卷 104225-104225页

作者： Sun, Guangyao Liu, Zhen Gao, Haibo Li, Nan Ding, Liang Deng, Zongquan Harbin Inst Technol State Key Lab Robot & Syst Harbin Peoples R China

With a low moving inertia, high payload-to-weight ratio, and large workspace, cable-driven parallel robots (CDPRs) are relevant in many applications, especially redundant CDPRs. As there exist an infinite number of tension distributions, this paper presents a novel computational geometry-based method to calculate a tension feasible region (TFR)-a preimage of tension distribution-for multi-redundant CDPRs. The proposed TFR algorithm overcomes some of the limitations of conventional iterative and vertices search methods. The TFR is first interpreted as a convex intersection of multiple boundary-parallel spaces, where its dimension is equal to redundancy r. To obtain the centroid of TFR, the vertices coordinates and order for r = 2 and 3 only need to be determined on surface. Static simulations with 6 degrees-of-freedom using 8-cable and 9-cable CDPRs are employed to demonstrate the algorithmic accuracy. Additionally, to illustrate that the optimal tension distribution has continuity, motion trajectories for the same CDPRs are calculated. Furthermore, the proposed algorithm minimizes computational time when compared to the performance of existing algorithms. Thus, the proposed method could rapidly establish the optimal tension distribution. (C) 2020 Elsevier Ltd. All rights reserved.

关键词： optimal algorithm Computational geometry Tension feasible region Cable-driven parallel robots

来源：评论

学校读者我要写书评

暂无评论

RETRACTED: A biologically inspired intelligent PID controller tuning for AVR systems (Retracted article. See vol. 9, pg. 814, 2011)

引用

INTERNATIONAL JOURNAL OF CONTROL AUTOMATION AND SYSTEMS 2006年第5期4卷 624-636页

作者： Kim, Dong Hwa Cho, Jae Hoon Hanbat Natl Univ Sch Elect Elect Control & Instrumentat Engn Taejon 305716 South Korea Chungbuk Natl Univ Sch Elect & Comp Engn Chungbuk 361763 South Korea

This paper proposes a hybrid approach involving Genetic algorithm (GA) and Bacterial Foraging (BF) for tuning the PID controller of an AVR. Recently the social foraging behavior of E. coli bacteria has been used to solve optimization problems. We first illustrate the proposed method using four test functions and the performance of the algorithm is studied with an emphasis on mutation, crossover, variation of step sizes, chemotactic steps, and the life time of the bacteria. Further;the proposed algorithm is used for tuning the PID controller of an AVR. Simulation results are very encouraging and this approach provides us a novel hybrid model based on foraging behavior with a possible new connection between evolutionary forces in social foraging and distributed non-gradient optimization algorithm design for global optimization over noisy surfaces.

关键词： bacterial foraging optimization genetic algorithm hybrid system optimal algorithm

来源：评论

学校读者我要写书评

暂无评论

Computational Complexity of Iterative Processes

引用

SIAM Journal on Computing 1972年第2期1卷 167-179页

作者： J. F. Traub

The theory of optimal algorithmic processes is part of computational complexity. This paper deals with analytic computational complexity. The relation between the goodness of an iteration algorithm and its new functio... 详细信息

关键词： computational complexity optimal algorithm optimal iteratiop numerical mathematics iteration theory

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：