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

Design of real-time algorithms for food and cereals inspection

IMAGING SCIENCE JOURNAL 2003年第2期51卷 63-78页

作者： Davies, ER Univ London Royal Holloway & Bedford New Coll Dept Phys Machine Vis Grp Egham TW20 0EX Surrey England

This paper reviews the process of automated visual inspection and highlights the fact that product location is likely to involve considerably more computation than product scrutiny. The situation is illustrated by a number of case studies drawn broadly from the baking and cereals industries. It is common for baked products to be manufactured at rates of 10-30 per second, and inspection can realistically provide reliable control over quality for 100 per cent of products. For cereal grains, 100 per cent inspection is much more difficult. An alternative strategy is to take a substantial sample from each consignment: typically, similar to 3 kg of grain should be inspected within 3 min-a target that has now been met. Where profit margins are low, the cost of inspection equipment has to be kept down, and serious efforts need to be devoted to cost effective real-time implementation. This paper describes sampling procedures that permit considerable speed-up to be achieved in software alone, without incurring any real loss of robustness. Finally, the paper points to the difficulties of specification and delivery of algorithms against a backcloth both of conflicting parameters-sensitivity, robustness, accuracy, speed and implementation cost-and of lack of deep knowledge of the nature of the image data being processed. While this provides some scope for theoretical analysis, case studies are proposed for providing a positive way forward, because these can help workers to see more clearly where solutions to their problems might lie.

关键词： inspection fault detection contaminant detection robustness real-time algorithms

来源：评论

学校读者我要写书评

暂无评论

Applying load adaptive real-time algorithms to a vehicle control system

引用

CONTROL ENGINEERING PRACTICE 1998年第4期6卷 541-546页

作者： Pfefferl, J Farber, G Tech Univ Munich Lab Proc Control & Real Time Syst D-8000 Munich Germany

In many applications, approximate results are often sufficient to achieve an acceptable behavior of a real-time system. Imprecise calculations could be necessary due to a transient overload situation caused by extraordinary events. To handle this exceptional work as well as the normal tasks, it is possible to reduce temporarily the computation time of the normal jobs by applying a more intelligent and flexible form of algorithm. In this paper, algorithm structures are presented, which are suitable to implement the methods mentioned above. The basic idea is to offer multiple algorithm alternatives, of different complexities, for solving a problem. To prove the applicability of the proposed methods on a real system, the theoretical considerations are applied to a practical example consisting of a vehicle convoy. (C) 1998 Elsevier Science Ltd: All rights reserved.

关键词： real-time algorithms load adaptation imprecise computation techniques and resulting errors control systems timeliness deadlines

来源：评论

学校读者我要写书评

暂无评论

New approach for splitting a class of real-time algorithms for pipelined processing

引用

COMPUTER SYSTEMS SCIENCE AND ENGINEERING 1997年第3期12卷 213-220页

作者： Sinha, A Sinha, A Choudhury, S JADAVPUR UNIV DEPT MATH CALCUTTA 700032 W BENGAL INDIA BENGAL ENGN COLL DEPT E&TC HOWRAH 711103 W BENGAL INDIA

This paper aims to develop a generalized technique for splitting a given sequential algorithm into a number of sequential stages for pipelined mode of execution. Each stage so identified is executed by one processor, and the time of execution of each stage is equal to the data arrival time. If such splitting is done at logical interfaces, a processor needs to communicate to its successor processor partial results only. However, such splitting cannot always be carried out at logical interfaces in the interest of maximizing the throughput. This necessitates additionally the communication of processor status to the succeeding processor. This problem has been carefully in the proposed scheme and the effectiveness of the scheme has been tested experimentally using a number of real-time algorithms.

关键词： pipelined processing real-time algorithms splitting

来源：评论

学校读者我要写书评

暂无评论

Design of real-time algorithms for food and cereals inspection

引用

The Journal of Photographic Science 2003年第2期51卷 63-78页

This paper reviews the process of automated visual inspection and highlights the fact that product location is likely to involve considerably more computation than product scrutiny. The situation is illustrated by a number of case studies drawn broadly from the baking and cereals industries. It is common for baked products to be manufactured at rates of 10–30 per second, and inspection can realistically provide reliable control over quality for 100 per cent of products. For cereal grains, 100 per cent inspection is much more difficult. An alternative strategy is to take a substantial sample from each consignment: typically, ∼ 3 kg of grain should be inspected within 3 min—a target that has now been met. Where profit margins are low, the cost of inspection equipment has to be kept down, and serious efforts need to be devoted to cost effective real-time implementation. This paper describes sampling procedures that permit considerable speed-up to be achieved in software alone, without incurring any real loss of ***, the paper points to the difficulties of specification and delivery of algorithms against a backcloth both of conflicting parameters—sensitivity, robustness, accuracy, speed and implementation cost—and of lack of deep knowledge of the nature of the image data being processed. While this provides some scope for theoretical analysis, case studies are proposed for providing a positive way forward, because these can help workers to see more clearly where solutions to their problems might lie.

关键词： inspection fault detection contaminant detection robustness real-time algorithms

来源：评论

学校读者我要写书评

暂无评论

Online semiparametric regression via sequential Monte Carlo

引用

AUSTRALIAN & NEW ZEALAND JOURNAL OF STATISTICS 2025年第0期

作者： Menictas, Marianne Oates, Chris J. Wand, Matt P. Grubhub Inc 111 West Washington St Chicago IL 60602 USA Newcastle Univ Sch Math Stat & Phys Newcastle Upon Tyne NE1 7RU England Univ Technol Sydney Sch Math & Phys Sci POB 123 Broadway NSW 2007 Australia

We develop and describe online algorithms for performing online semiparametric regression analyses. Earlier work on this topic is by Luts, Broderick and Wand (2014), Journal of Computational and Graphical Statististics, 23, 589-615, where online mean-field variational Bayes (MFVB) was employed. In this article we instead develop sequential Monte Carlo approaches to circumvent well-known inaccuracies inherent in variational approaches. For Gaussian response semiparametric regression models, our new algorithms share the online MFVB property of only requiring updating and storage of sufficient statistics quantities of streaming data. In the non-Gaussian case, accurate online semiparametric regression requires the full data to be kept in storage. The new algorithms allow for new options concerning accuracy-speed trade-offs for online semiparametric regression.

关键词： generalised additive models generalised linear mixed models real-time algorithms penalised splines

来源：评论

学校读者我要写书评

暂无评论

real-time parallel routing for telecom networks, - Graph algorithms and bulk-synchronous parallel acceleration

Real-time parallel routing for telecom networks, - Graph alg...

引用

IEEE Canadian Conference on Electrical and Computer Engineering

作者： Gaetan Hains Alain Dominguez Central Software Institute French R&D Center Huawei Technologies Paris France

ISBN: (纸本)9781467387224

The fixed-time constrainted routing problem (FTCRP) is an engineering variant of the multicommodity network-flow problem where flows represent unsplittable telecommunication routes, and global solutions should be computed in at most one millisecond per route. Algorithmic solutions based on integer linear programming (ILP) lead to column generation (CG) heuristics to cope lazily with the exponential number of paths. In this paper we present experimental evidence that solving FTCRP with ILP leads to explosive time and memory consumption, while many innovative algorithms can alleviate this combinatorial explosion, and are also amenable to highly scalable bulk-synchronous (BSP) algorithms. We show several new solution methods tested on realistic instances with up to hundreds of thousands of routes and many dozens of computational cores with high efficiency.

关键词： constrainted unsplittable network flows real-time algorithms bulk-synchronous parallelism graph algorithms

来源：评论

学校读者我要写书评

暂无评论

REMaDD: Resource-Efficient Malicious Domains Detector in Large-Scale Networks

引用

IEEE ACCESS 2020年 8卷 66327-66337页

作者： Kdosha, Ofir Erets Rosenthal, Gilad Cohen, Kobi Freund, Alon Bartik, Avishay Ron, Aviv Ben Gurion Univ Negev Sch Elect & Comp Engn IL-8410501 Beer Sheva Israel IBM Cyber Secur Ctr Excellence IL-8489325 Beer Sheva Israel

Detecting malicious activities in cyber systems is a major challenge of cybersecurity service providers. Due to the large amount of network traffic, it is often likened to finding a needle in a haystack. Domain name system (DNS) is one of the fundamental protocols of the internet, and therefore it can give a broad view of those malicious activities, which abuse it and leave fingerprints as part of their attack vector. In this collaborative research between Ben-Gurion University, and IBM, a significant performance improvement was achieved in detecting malicious domains as compared to the state-of-the-art software solutions. Specifically, we establish a novel algorithm to detect malicious domains in large-scale DNS traffic, named Resource-Efficient Malicious Domain Detector (REMaDD), with the following desired properties. First, the algorithm does not require prior knowledge on historical malicious activities in its real-time operations. Second, the development used real live streaming data from The Inter-University Computation Center (IUCC), and operated on real-time IBM system. The algorithm is highly computational efficient and satisfies real-time requirements in terms of running time and computational complexity. REMaDD demonstrated strong performance in terms of both detection accuracy and computational efficiency as compared to existing algorithms. Specifically, experimental results on IBM production environment demonstrated that REMaDD achieved 89.4 & x0025;Precision score, and 82.9 & x0025;Recall score. By contrast, the DomainObserver, and *** algorithms achieved only 76.7 & x0025;, 67.2 & x0025;Precision score, and 81.7 & x0025;, 75.3 & x0025;Recall score, respectively.

关键词： Cyber security domain name system (DNS) detection algorithms real-time algorithms

来源：评论

学校读者我要写书评

暂无评论

Layered Hashing Algorithm for real-time Systems

引用

THEORY OF COMPUTING SYSTEMS 2012年第2期50卷 279-295页

作者： Mandelbrod, Matan Ramat Raziel 9 IL-90974 Ramat Raziel Israel

We present a hashing mechanism designated for real-time systems. As such, it is faster than standard hashing techniques, yet remains low-cost and uses a relatively small amount of resources. We study a mathematical model of the proposed mechanism, and compare the theoretical results to statistics obtained from simulations. The main contribution of this work is a procedure to determine the appropriate dimensions of the Hash-Table as a function of the required load, and a long-run analysis of the distribution of elements in the table.

关键词： real-time algorithms Resource allocation Hashing

来源：评论

学校读者我要写书评

暂无评论

A tractable class of algorithms for reliable routing in stochastic networks

引用

TRANSPORTATION RESEARCH PART C-EMERGING TECHNOLOGIES 2012年第1期20卷 199-217页

作者： Samaranayake, S. Blandin, S. Bayen, A. Univ Calif Berkeley Berkeley CA 94720 USA

The goal of this article is to provide the theoretical basis for enabling tractable solutions to the "arriving on time" problem and enabling its use in real-time mobile phone applications. Optimal routing in transportation networks with highly varying traffic conditions is a challenging problem due to the stochastic nature of travel-times on links of the network. The definition of optimality criteria and the design of solution methods must account for the random nature of the travel-time on each link Most common routing algorithms consider the expected value of link travel-time as a sufficient statistic for the problem and produce least expected travel-time paths without consideration of travel-time variability. However, in numerous practical settings the reliability of the route is also an important decision factor. In this article, we consider the following optimality criterion: maximizing the probability of arriving on time at a destination given a departure time and a time budget. We present an efficient algorithm for finding an optimal routing policy with a well bounded computational complexity, improving on an existing solution that takes an unbounded number of iterations to converge to the optimal solution. A routing policy is an adaptive algorithm that determines the optimal solution based on en route travel-times and therefore provides better reliability guarantees than an a priori solution. Novel speed-up techniques to efficiently compute the adaptive optimal strategy and methods to prune the search space of the problem are also investigated. Finally, an extension of this algorithm which allows for both time-varying traffic conditions and spatio-temporal correlations of link travel-time distributions is presented. The dramatic runtime improvements provided by the algorithm are demonstrated for practical scenarios in California. (C) 2011 Elsevier Ltd. All rights reserved.

关键词： Stochastic routing Adaptive routing Dynamic programming Traffic information systems real-time algorithms

来源：评论

学校读者我要写书评

暂无评论

real-time hierarchical systems with arbitrary scheduling at global level

引用

JOURNAL OF SYSTEMS AND SOFTWARE 2016年第0期119卷 70-86页

作者： Guasque, Ana Balbastre, Patricia Crespo, Alfons Univ Politecn Valencia E-46022 Valencia ES Spain

Partitioned architectures isolate software components into independent partitions whose execution will not interfere with other partitions, preserving temporal and spatial isolation. Hierarchical scheduling can effectively be used to schedule these systems. Schedulability analysis of hierarchical real-time systems is based on prior knowledge of the local and the global scheduling algorithms. In a partitioned system with safety and security issues and certification assurance levels, global scheduling is usually generated using a static table. Therefore, each partition must allocate task jobs only in the temporal windows reserved for that partition. Even if the static table can come originally from a periodic server or other scheduling policy, the final plan may be modified due to changes in the system requirements. As a consequence, the CPU assignment to a partition does not have to correspond to any known policy. In this case, it is not possible to use existing scheduling analysis for hierarchical systems. This paper studies a new scheduling problem: a hierarchical system in which global policy is not known but provided as a set of arbitrary time windows. (C) 2016 Elsevier Inc. All rights reserved.

关键词： real-time systems Partitioned systems Embedded systems real-time systems scheduling real-time algorithms

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：