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

作者： Ruoxi Li UPPSALA UNIVERSITY

学位级别：硕士

This paper proposes a safety stock calculation function based on their distribution properties and create a guideline for the stock status optimization problem. The motivation for this paper originates the cooperation with a drilling tools company, Epiroc Drilling tools AB. The safety stock calculation divides all items into three distri- bution and design the safety stock for each types separately considering the influence of service level value and lead time. During the process of guideline design, complicated production chain framework is taken into account through recursive algorithm. The stock status combination which can give the minimum storage cost is the optimal guideline for stock item and non-stock item. The time for approximating the global minimum through exhaustive search is remarkably reduced due to the application of Parallel programming and statistical model.

关键词： Safety stock Statistical distribution Supply chain optimization recursive algorithm Statistical model

来源：评论

学校读者我要写书评

暂无评论

GPS NETWORK ADJUSTMENT USING KALMAN FILTER

GPS NETWORK ADJUSTMENT USING KALMAN FILTER

引用

作者： BHARAT BHUSHAN INDIAN INSTITUTE OF TECHNOLOGY ROORKEE

学位级别：硕士

The GPS provides position of a point on the surface of the earth with high degree of speed and accuracy. However, the GPS measurements are also fraught with different types of errors. Among these errors random errors are the most unpredictable. Many applications of GPS data require accurate point position which is possible by reducing the random error in the GPS data. One of the method of reducing the random error is to adjust the network formed by the GPS control points. GPS provides large amount of data continuously at an' interval as low as 0.001 second epoch. Thus huge amount of data may better be processed by an algorithm less complex requiring less memory and computational time. Kalman Filter is a recursive algorithm which requires only the present and the previous observations may be one such algorithm which applied on GPS control network which minimizes the random error. In this study the Kalman Filter algorithm has been applied to adjust a GPS based control network. The results of proposed Kalman filter technique give better accuracy with more consistency and are found superior to the standard one (least square).

关键词： GPS Network Adjustment Kalman filter recursive algorithm

来源：评论

学校读者我要写书评

暂无评论

The influence of burstiness and correlation of traffic on an ATM multiplexer

The influence of burstiness and correlation of traffic on an...

引用

1996 International Conference on Communication Technology

作者： Liao, JX Li, LM Sun, HR UNIV ELECT SCI & TECHNOL CHINA NATL KEY LAB OPT FIBER COMMUNCHENGDU 610054PEOPLES R CHINA

ISBN: (纸本)7505336355

This paper presents a traffic model for an ATM multiplexer providing video, voice, image, and data services. The traffic model classifies the input traffic into two types: real-time and non-real-time. The input process for real-time traffic is a Markov modulated Bernoulli process (MMBP), while that for non-real-time traffic is a Bernoulli process with batches. The z-transform of the cell interarrival time A/sub MMBP/(z) is obtained. The average traffic load /spl rho//sub MMBP/ and the squared coefficient of variation of the time between success cell C/sup 2//sub MMBP/ are then obtained from the respective derivatives of A/sub MMBP/(z). The autocorrelation coefficient of the cell interarrival time with lag 1 /spl psi/, can be also obtained. This paper presents an iterative algorithm that can be used to calculate the MMBP probability distribution of the cell interarrival time. So far few results about discrete-time finite buffer queues with correlated inputs are known. This paper analyzes the performance of an ATM multiplexer considering the correlation and burst in cell arrivals. For the MMBP-stream, the waiting time distribution and the cell loss probability for MMBP+M/sup [X]//D/1/K finite buffer system are all exactly calculated with the use of a recursive algorithm. Calculations show the influence of burstiness and correlation on both the loss probability and waiting time. The accuracy of the analytical results has been largely validated by means of a simulation approach.

关键词： asynchronous transfer mode multiplexing equipment telecommunication traffic Markov processes modulation buffer storage correlation methods queueing theory Poisson distribution iterative methods Z transforms ATM multiplexer burstiness correlation traffic model real-time traffic nonreal-time traffic Markov modulated Bernoulli process Bernoulli process z-transform cell interarrival time average traffic load autocorrelation coefficient iterative algorithm probability distribution discrete-time finite buffer queues correlated inputs waiting time distribution cell loss probability recursive algorithm simulation poisson distribution

来源：评论

学校读者我要写书评

暂无评论

Využití rekurzivní metody nejmenších čtverců pro analýzu dynamiky vozidel

Využití rekurzivní metody nejmenších čtverců pro anal...

引用

作者： Sladká, Pavla Brno University of Technology

Tato diplomová práce nastiňuje teoretické základy potřebné pro návrh algoritmu rekurzivní metody nejmenších čtverců a následně jeho aplikaci na experimentální d... 详细信息

Tato diplomová práce nastiňuje teoretické základy potřebné pro návrh algoritmu rekurzivní metody nejmenších čtverců a následně jeho aplikaci na experimentální data naměřená při testovacím manévru uskutečněném v roce 2001. Analyzována byla příčná dynamika jednostopého rovinného modelu vozidla. Práce také obsahuje srovnání výsledků získaných jednak rekurzivním algoritmem a dále i algoritmem Kalmanova filtru.

关键词： dynamický systém bílý šum metoda nejmenších čtverců jednostopý model adaptivní filtr rekurzivní algoritmus koeficienty filtru dynamic system white noise least squares method single-track model adaptive filter recursive algorithm filter coeffi

来源：评论

学校读者我要写书评

暂无评论

Aplikace na podporu výuky dynamického programování

Aplikace na podporu výuky dynamického programování

引用

作者： Nereča, Tomáš Brno University of Technology

Webová aplikácia, ktorá je výsledkom tejto práce, sa zaoberá technikou návrhu algoritmov s názvom dynamické programovanie. Aplikácia na konkrétnych príkladoc... 详细信息

Webová aplikácia, ktorá je výsledkom tejto práce, sa zaoberá technikou návrhu algoritmov s názvom dynamické programovanie. Aplikácia na konkrétnych príkladoch poukazuje na jej princípy a výhody. Pri každom príklade je konkrétny algoritmus teoreticky vysvetlený a jeho priebeh je znázornený pomocou dynamicky vypĺňanej tabuľky. Okrem toho aplikácia porovnáva efektivitu riešenia technikou dynamického programovania s jednoduchým rekurzívnym riešením pomocou grafov a tabuľky.

关键词： DP dynamické programovanie rekurzívny algoritmus programovacia technika optimalizačná úloha React TypeScript Material-UI DP dynamic programming recursive algorithm computer programming method optimization problem React TypeScript Material-U

来源：评论

学校读者我要写书评

暂无评论

recursive method to compute similarity of XML documents

引用

Jisuanji Gongcheng/Computer Engineering 2005年第11期31卷 25-27+126页

作者： Zhang, Bingqi Bai, Shuo Zhao, Zhangjie Institute of Computing Technology Chinese Academy of Sciences Beijing 100080 China

The quantity of XML data shared in the World Wide Web is increasing quickly and it offers both challenges and opportunities in information retrieval, data mining and intelligent information processing. As the basis of information retrieval, mining, and processing, accurate determination of similarity between XML documents is important and valuable. This paper provides a novel recursive method to get the similarity between XML documents according to the semantic and structural features of XML. It also provides experiments to show the comparison of the method against traditional methods and the results prove the method is highly effective.

关键词： recursive algorithm Semantic Similarity VSM model XML

来源：评论

学校读者我要写书评

暂无评论

Educational software tool for the generation of Quasi-Random urban scenarios applied to electromagnetic computer simulation

引用

INTERNATIONAL JOURNAL OF ELECTRICAL ENGINEERING EDUCATION 2021年

作者： Delgado, Carlos Laborda, Alberto Univ Alcala Dept Comp Sci Madrid Spain

This document presents the development of a didactic software tool used as a platform for the generation of complex urban scenarios based on probabilistic user-defined parameters. An adaptive algorithm and a set of primitive elements have been developed in order to allow the user to define the complexity and main features of the scenario and obtain a script containing the geometric elements that conform the resulting geometry. This tool has been developed by undergraduate students and is the result of a number of multidisciplinary projects. It is used in undergraduate and graduate teaching programs in order to perform multipath ray tracing analyses, validate propagation models, analyze the multipath channel characteristics or study the performance of MIMO antennas, among others.

关键词： Computational electromagnetics ray tracing Multiple Input Multiple Output propagation model recursive algorithm multidisciplinary teaching

来源：评论

学校读者我要写书评

暂无评论

Optimal independent spanning trees on hypercubes

引用

JOURNAL OF INFORMATION SCIENCE AND ENGINEERING 2004年第1期20卷 143-155页

作者： Tang, SM Wang, YL Leu, YH Natl Taiwan Univ Sci & Technol Dept Informat Managment Taipei 106 Taiwan

Two spanning trees rooted at some vertex r in a graph G are said to be independent if for each vertex v of G, v not equal r, the paths from r to v in two trees are vertex-disjoint. A set of spanning trees of G is said to be independent if they are pairwise independent. A set of independent spanning trees is optimal if the average path length of the trees is the minimum. Any k-dimensional hypercube has k independent spanning trees rooted at an arbitrary vertex. In this paper, an O(kn) time algorithm is proposed to construct k optimal independent spanning trees on a k-dimensional hypercube, where n = 2(k) is the number of vertices in a hypercube.

关键词： independent spanning trees internally disjoint paths hypercubes fault-tolerant broadcasting recursive algorithm

来源：评论

学校读者我要写书评

暂无评论

Constrained-Group-Delay-Optimized Multiple-Resonator-Based Harmonic Analysis

引用

TEHNICKI VJESNIK-TECHNICAL GAZETTE 2021年第4期28卷 1244-1252页

作者： Kusljevic, Miodrag D. Tomic, Josif J. Poljak, Predrag D. Termoelektro Enel AD Bacvanska 21-3 Belgrade 11010 Serbia Univ Novi Sad Trg Dositeja Obradovica 6 Novi Sad 21000 Serbia Inst Chem Technol & Met Njegoseva 12 Belgrade 11000 Serbia

Recently, a multiple-resonator structure was proposed as a robust and computationally efficient tool for harmonic analysis. Two trivial cases have been previously observed. The first case exhibits good out-of-band suppression and elimination of unwanted harmonics, but with a high latency. In the second case, a phase frequency response around the passband centre is zero-flat, that provides fast estimates. However, in this case, resonant peaks at the ends of the passband and high interharmonic gains cause large overshoots. In general, the basic algorithm performance requirements: selectivity and speed, are contradictory which makes it impossible to completely fulfil both of them. In this paper, the Constrained Linear Least-Squares (CLLS) optimization method is used to obtain a compromise solution. As a result, the resonant peaks in the passband are avoided and side lobes are mitigated, simultaneously minimizing the group delay in the middle of the passband. Performed simulations confirmed the effectiveness of the proposed algorithm.

关键词： Constrained Linear Least-Squares (CLLS) frequency response group delay harmonic analysis multiple-resonator recursive algorithm

来源：评论

学校读者我要写书评

暂无评论

Průběžné odhadování modelů závislostí diskrétních veličin na spojitých s aplikací na obchodování s futures

Průběžné odhadování modelů závislostí diskrétních...

引用

作者： Svoboda, Miroslav Charles University of Prague

This bachelor thesis deals with recursive estimation of a dependence of the models with discrete variables on variables that are either discretely or continuously distributed. To this purpose Bayes formula, described in the first chapter, is used, to which an additional assumption of conditional independence is added so that it can be used dynamically. The second chapter describes an approximation algorithm, which is used for recursive approximation of the density of random variable that has been estimated by the Bayesian equation. The third chapter deals with the application of the whole model on a special form of logistic regression. Results are shown on the examples using simulated data. At last, the model along with approximation algorithm is applied on a trading with futures. Powered by TCPDF (***)

关键词： Bayesian estimation recursive algorithm logistic regression futures

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：