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

Annual Review in Automatic Programming 1985年第PART 2期12卷 213-215页

作者： Grabarnik, P.Ya Institute of Soil Science and Photosynthesis Pushchino 142292 Russian Federation

A pure plant community with a simple structure of the arrangement of individuals is considered. The stochastic model represented by a Markov random field (MRF), describes a productivity property of the plant community. The parameters of the model may be interpreted as a strength of the competition between plants. The problem of the interplant competition modelling is to choose the probability structure and parameters of the model and to simulate a Markov random field. The synthesized image patterns may be applied to a study of real data. © 1985.

关键词： image pattern Markov random field plant community simulation algorithm

来源：评论

学校读者我要写书评

暂无评论

Accuracy of wind speed forecasting based on joint probability prediction of the parameters of the Weibull probability density function

引用

FRONTIERS IN ENERGY RESEARCH 2023年 11卷

作者： Majid, Amir Abdul Univ Sci & Technol Fujairah Coll Engn & Technol Fujairah U Arab Emirates

This work aims to evaluate different error estimations of the shape and scale parameters of the Weibull probability density function of wind speed measured at the Fujairah site over a 1-year period. This study estimates trends in the variation of Weibull parameters using moving averages and Markov series methods. The focus is on the scale and shape factors, which are evaluated by mapping monthly mean wind speeds into a Weibull probability distribution function. Due to the imprecise nature of these factors, multiple data simulations are used to predict Weibull factors based on data measuring interpolations. A procedural algorithm is proposed to select the overall best forecast based on several estimation methods that evaluate raised prediction errors. A probabilistic analysis is followed to predict future wind speed and wind energy based on variations in the scale and shape factors. This study focuses on the scale factor variation as it is found to be more dominant than the Weibull shape factor. The forecasted wind speed is checked with the measured value in future months and found to be within trend values. The results suggest that the proposed algorithm provides an accurate and reliable method for predicting future wind speed and energy output.

关键词： index term detection error estimation measurement methods simulation algorithm wind speed prediction Weibull parameters

来源：评论

学校读者我要写书评

暂无评论

Hydraulic and Hydrologic Performance of Residential Rain Gardens

引用

JOURNAL OF ENVIRONMENTAL ENGINEERING 2015年第11期141卷 04015033-04015033页

作者： Jennings, Aaron A. Berger, Michael A. Hale, James D. Case Western Reserve Univ Dept Civil Engn Civil Engn Cleveland OH 44106 USA Case Western Reserve Univ Dept Civil Engn Cleveland OH 44106 USA

Accelerated stormwater runoff creates environmental problems in many urban communities. Methods of reducing runoff for individual residences are available, but are often recommended without sufficient analysis. For example, many states provide guidance on creating rain gardens, but few include information about how well rain gardens actually work. An analysis algorithm is presented to evaluate rain garden effectiveness at reducing stormwater runoff by promoting infiltration, evaporation, and evapotranspiration. Example simulations are presented based on an Ohio meteorological record. Results indicate that garden effectiveness is dominated by infiltration. Evaporation and evapotranspiration play minor roles in reducing runoff. Results also indicate that current rain garden design recommendations are often too conservative. Even for low permeability soils, rain gardens can be more effective than currently assumed. Common depth recommendations are reasonable, but area recommendations are also conservative. Residential rain gardens have a much better chance of reducing stormwater runoff than rain barrels. Their design recommendations should be revised to concentrate less on garden flora and more on the properties that promote desirable hydrologic performance. (C) 2015 American Society of Civil Engineers.

关键词： Stormwater runoff Residential rain garden simulation algorithm Infiltration Evaporation Evapotranspiration

来源：评论

学校读者我要写书评

暂无评论

Dynamic Characteristics Analysis of an Oil Turbine

引用

Procedia Engineering 2012年 28卷 12-17页

作者： Biao Yan Xide Lai Jianghong Long Xiao Huang Fei Hao Dean's Office Hydrochina Chengdu Engineering Corporation Huanhua North Road No1 Chengdu 610072 China School of Energy & Environment Xihua University Jinniu District Tuqiao Jinzhou Road No 999 Chengdu 610039 China Department of Computer Science KAIST 373-1 Guseong-dong Yuseong-guDaejeon 305-701 Republic of Korea

This work is to study the dynamic characteristics of an oil turbine (OT) in the lubricating system of large-scale steam turbines. The configuration and the functions of OT are introduced. The mathematical models are accordingly explored. In addition, the experiment results are predicted and compared with the theoretical prediction. Finally, the dynamic characteristics in the start-up procedure are simulated and analyzed. The agreement between the numerical results and the experiment observations is in general satisfactory. It shows that the numerical simulation approach is reliable, and could be applied into the dynamic characteristics research and optimization of other complicated fluid systems as hydropower station.

关键词： Lubricating network system Dynamic characteristics Mathematical model simulation algorithm simulation control Oil turbine

来源：评论

学校读者我要写书评

暂无评论

Short-Run Contexts and Imperfect Testing for Continuous Sampling Plans

引用

algorithmS 2018年第4期11卷 46-46页

作者： Rodriguez, Mirella Jeske, Daniel R. Univ Calif Riverside Dept Stat Riverside CA 92521 USA

Continuous sampling plans are used to ensure a high level of quality for items produced in long-run contexts. The basic idea of these plans is to alternate between 100% inspection and a reduced rate of inspection frequency. Any inspected item that is found to be defective is replaced with a non-defective item. Because not all items are inspected, some defective items will escape to the customer. Analytical formulas have been developed that measure both the customer perceived quality and also the level of inspection effort. The analysis of continuous sampling plans does not apply to short-run contexts, where only a finite-size batch of items is to be produced. In this paper, a simulation algorithm is designed and implemented to analyze the customer perceived quality and the level of inspection effort for short-run contexts. A parameter representing the effectiveness of the test used during inspection is introduced to the analysis, and an analytical approximation is discussed. An application of the simulation algorithm that helped answer questions for the U.S. Navy is discussed.

关键词： CSP-1 sampling plan harold dodge simulation algorithm imperfect testing short-run contexts

来源：评论

学校读者我要写书评

暂无评论

Stochastic decomposition for l_p-norm symmetric survival functions on the positive orthant

引用

JOURNAL OF MULTIVARIATE ANALYSIS 2021年 184卷 104760-104760页

作者： Mai, Jan-Frederik Wang, Ruodu XAIA Investment GmbH Sonnenstr 19 D-80331 Munich Germany Univ Waterloo Dept Stat & Actuarial Sci Waterloo ON Canada

We derive a stochastic representation for the probability distribution on the positive orthant (0, infinity)(d) whose association between components is minimal among all probability laws with lp-norm symmetric survival functions. It is given by a transformation of a uniform distribution on the standard unit simplex that is multiplied with an independent finite mixture of certain beta distributions and an additional atom at unity. On the one hand, this implies an efficient simulation algorithm for arbitrary probability laws with l(p)-norm symmetric survival function. On the other hand, this result is leveraged to construct an exact simulation algorithm for max-infinitely divisible probability distributions on the positive orthant whose exponent measure has l(p)-norm symmetric survival function. Both applications generalize existing results for the case p = 1 to the case of arbitrary p >= 1. (C) 2021 Elsevier Inc. All rights reserved.

关键词： Archimedean copula Max-infinitely divisible d-monotone function simulation algorithm

来源：评论

学校读者我要写书评

暂无评论

Parametric delineation uncertainties contouring (PDUC) modeling on CT scans of prostate cancer patients

引用

JOURNAL OF APPLIED CLINICAL MEDICAL PHYSICS 2023年第7期24卷 e13970页

作者： Ly, Vi Liu, Lizhong Cardenas, Carlos Maroongroge, Sean De, Brian Basha, Daniel El Court, Laurence Luo, Xi Univ Texas MD Anderson Canc Ctr Div Radiat Oncol Houston TX USA Univ Texas Hlth Sci Ctr Sch Publ Hlth Dept Biostat & Data Sci Houston TX USA Univ Texas MD Anderson Canc Ctr Div Radiat Oncol 1400 Pressler St Houston TX 77030 USA Univ Texas Hlth Sci Ctr Dept Biostat & Data Sci 1200 Pressler St Houston TX 77030 USA

PurposeVariability in contouring contributes to large variations in radiation therapy planning and treatment outcomes. The development and testing of tools to automatically detect contouring errors require a source of contours that includes well-understood and realistic errors. The purpose of this work was to develop a simulation algorithm that intentionally injects errors of varying magnitudes into clinically accepted contours and produces realistic contours with different levels of variability. MethodsWe used a dataset of CT scans from 14 prostate cancer patients with clinician-drawn contours of the regions of interest (ROI) of the prostate, bladder, and rectum. Using our newly developed Parametric Delineation Uncertainties Contouring (PDUC) model, we automatically generated alternative, realistic contours. The PDUC model consists of the contrast-based DU generator and a 3D smoothing layer. The DU generator transforms contours (deformation, contraction, and/or expansion) as a function of image contrast. The generated contours undergo 3D smoothing to obtain a realistic look. After model building, the first batch of auto-generated contours was reviewed. Editing feedback from the reviews was then used in a filtering model for the auto-selection of clinically acceptable (minor-editing) DU contours. ResultsOverall, C values of 5 and 50 consistently produced high proportions of minor-editing contours across all ROI compared to the other C values (0.936 +/-$ \pm \;$0.111 and 0.552 +/-$ \pm \;$0.228, respectively). The model performed best on the bladder, which had the highest proportion of minor-editing contours (0.606) of the three ROI. In addition, the classification AUC for the filtering model across all three ROI is 0.724 +/-$ \pm \;$0.109. DiscussionThe proposed methodology and subsequent results are promising and could have a great impact on treatment planning by generating mathematically simulated alternative structures that are clinically relevant and realistic e

关键词： cancer contouring delineation uncertainties simulation algorithm treatment planning

来源：评论

学校读者我要写书评

暂无评论

A Theoretical approach to the computational complexity measure of abstract DEVS simulators

引用

INTERNATIONAL JOURNAL OF MODELING simulation AND SCIENTIFIC COMPUTING 2023年第4期14卷

作者： Diouf, Yoro Maiga, Oumar Y. Traore, Mamadou K. African Univ Sci & Technol AUST PMB 681 Garki Abuja Fct Nigeria Univ Sci Tech & Technol Bamako USTTB Hamdalaye ACI 2000 Rue 405Porte 359BP E 423 Bamako Mali Univ Bordeaux 351 Cours Liberat CS 10004 F-33405 Talence France

DEVS is a sound Modeling and simulation (M&S) framework that describes a model in a modular and hierarchical way. It comes along with an abstract simulation algorithm which defines its operational semantics. Many variants of such an algorithm have been proposed by DEVS researchers. Yet, the proper interpretation and analysis of the computational complexity of such approaches have not been systematically addressed and defined. As systems become larger and more complex, the efficiency of the DEVS simulation algorithms in terms of time complexity measure becomes a major issue. Therefore, it is necessary to devise a method for computing this complexity. This paper proposes a generic method to address such an issue, taking advantage of the recursion embedded in the triggered-by-message principle of the DEVS simulation protocol. The applicability of the method is shown through the complexity analysis of various DEVS simulation algorithms.

关键词： Discrete-Event Systems Specification (DEVS) Modeling and simulation (M&S) computational complexity simulation algorithm

来源：评论

学校读者我要写书评

暂无评论

Numerical solution of the general Volterra nth-order integro-differential equations via variational iteration method

引用

ASIAN-EUROPEAN JOURNAL OF MATHEMATICS 2020年第2期13卷

作者： Khaireddine, Fernane 8 May 1945 Univ Guelma Dept Math POB 401 Guelma 24000 Algeria

In this paper, we use the variational iteration method (VIM) to construct approximate solutions for the general nth-order integro-differential equations. We show that his method can be effectively and easily used to solve some classes of linear and nonlinear Volterra integro-differential equations. Finally, some numerical examples with exact solutions are given.

关键词： Volterra integro-differential equations variational iteration method (VIM) integral equation simulation algorithm

来源：评论

学校读者我要写书评

暂无评论

The Reachable simulation Problem

引用

ACM Transactions on Computational Logic 1000年

作者： Pierre Ganty Nicolas Manini Francesco Ranzato IMDEA Software Insititute Spain IMDEA Software Insititute Spain and Universidad Politécnica de Madrid Spain Università di Padova Italy

We investigate the problem of computing the reachable blocks of the simulation equivalence and its natural counterpart for the simulation preorder, referred to as the reachable simulation problem. Through a theoretical investigation of this problem, we unveil a sharp contrast with the already settled case of bisimulation equivalence. Then, we design algorithms to solve the reachable simulation problem by leveraging the idea of interleaving reachability and simulation computation while possibly avoiding the computation of all the reachable states or the whole simulation preorder. Specifically, we propose algorithms achieving different guarantees on the precision of the output, and a symbolic algorithm that operates on state partitions and relations between their blocks, which is particularly well-suited for processing infinite-state systems.

关键词： simulation Reachability Reachable simulation Problem simulation algorithm Symbolic Data Structure

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：