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

real-time Welfare-Maximizing Regulation Allocation in Dynamic Aggregator-EVs System

IEEE TRANSACTIONS ON SMART GRID 2014年第3期5卷 1397-1409页

作者： Sun, Sun Dong, Min Liang, Ben Univ Toronto Dept Elect & Comp Engn Toronto ON M1C 1A4 Canada Univ Ontario Inst Technol Dept Elect Comp & Software Engn Toronto ON L1H 7K4 Canada

The concept of vehicle-to-grid (V2G) has gained recent interest as more and more electric vehicles (EVs) are put to use. In this paper, we consider a dynamic aggregator-EVs system, where an aggregator centrally coordinates a large number of dynamic EVs to provide regulation service. We propose a Welfare-Maximizing Regulation Allocation (WMRA) algorithm for the aggregator to fairly allocate the regulation amount among the EVs. Compared with previous works, WMRA accommodates a wide spectrum of vital system characteristics, including dynamics of EV, limited EV battery size, EV battery degradation cost, and the cost of using external energy sources for the aggregator. The algorithm operates in real time and does not require any prior knowledge of the statistical information of the system. Theoretically, we demonstrate that WMRA is away from the optimum by, where is a controlling parameter depending on EVs' battery size. In addition, our simulation results indicate that WMRA can substantially outperform a suboptimal greedy algorithm.

关键词： Aggregator-EVs system electric vehicles real-time algorithm V2G welfare-maximizing regulation allocation

来源：评论

学校读者我要写书评

暂无评论

Tight Tradeoffs for real-time Approximation of Longest Palindromes in Streams

引用

algorithmICA 2019年第9期81卷 3630-3654页

作者： Gawrychowski, Pawel Merkurev, Oleg Shur, Arseny M. Uznanski, Przemyslaw Univ Wroclaw Inst Comp Sci Ul Joliot Curie 15 PL-50383 Wroclaw Poland Ural Fed Univ Dept Algebra & Fundamental Informat Pr Lenina 51 Ekaterinburg 620000 Russia Swiss Fed Inst Technol Dept Comp Sci Univ Str 6 CH-8092 Zurich Switzerland

We consider computing a longest palindrome in the streaming model, where the symbols arrive one-by-one andwedo not have random access to the input. While computing the answer exactly using sublinear space is not possible in such a setting, one can still hope for a good approximation guarantee. Our contribution is twofold. First, we provide lower bounds on the space requirements for randomized approximation algorithms processing inputs of length n. We rule out Las Vegas algorithms, as they cannot achieve sublinear space complexity. For Monte Carlo algorithms, we prove a lower bound of O(M logmin{| S|, M}) bits of memory;here M = n/E for approximating the answer with additive error E, and M = log n/log(1 + e) for approximating the answer with multiplicative error (1+ e). Second, we design four real-time algorithms for this problem. Three of them are Monte Carlo approximation algorithms for additive error, " small" and " big" multiplicative errors, respectively. Each algorithm uses O(M) words of memory. Thus the obtained lower bounds are asymptotically tight up to a logarithmic factor. The fourth algorithm is deterministic and finds a longest palindrome exactly if it is short. This algorithm can be run in parallel with a Monte Carlo algorithm to obtain better results in practice. Overall, both the time and space complexity of finding a longest palindrome in a stream are essentially settled.

关键词： Palindrome Streaming Lower bound real-time algorithm

来源：评论

学校读者我要写书评

暂无评论

A 2-STEP SENSITIVITY APPROACH FOR real-time LINE FLOW CALCULATION

引用

ELECTRIC POWER SYSTEMS RESEARCH 1991年第1期21卷 63-69页

作者： LIN, CE CHEN, ST HUANG, CL Institute of Aeronautics and Astronautics Department of Electrical Engineering Cheng Kung University Tainan Taiwan

The network sensitivity factors are used for line flow estimation. Most of them are applied in conjunction with demand change limits under certain conditions. In this paper, a new factor, called the Z-bus distribution factor, is proposed to improve some deficiencies in the use of these sensitivity factors. A two-step real-time approach, combining the generalized generation shift distribution factor and the proposed Z-bus distribution factor, is organized to calculate line flows using an algorithm without running a load flow. Test systems with arbitrary demand changes in each bus are simulated and demonstrated to prove the outstanding characteristics of the proposed approach. The solution accuracy is good compared with that of the fast decoupled load flow method, with a much shorter execution time. It is very suitable for security evaluation and contingency analysis in real time.

关键词： SENSITIVITY FACTOR Z-BUS DISTRIBUTION FACTOR GENERALIZED GENERATION SHIFT DISTRIBUTION FACTOR real-time algorithm

来源：评论

学校读者我要写书评

暂无评论

A real-time solution for an inverse Cauchy problem in cardiology

引用

INVERSE PROBLEMS IN SCIENCE AND ENGINEERING 2008年第3期16卷 281-301页

作者： Celorrio, Ricardo Hofinger, Andreas Univ Zaragoza Dept Appl Math E-50009 Zaragoza Spain Johann Radon Inst Computat & Appl Math Linz Austria

The inverse problem of electrocardiography describes the reconstruction of the cardiac electrophysiological activity from remote measurements of its generated electrical potential. In this work, we present a real-time solution to this ill-posed problem under simultaneous regularization in time and space. Furthermore we propose a fast post-processing step that recovers the conduction velocity, i.e., the speed of the travelling potential. Numerical examples are presented to illustrate the robustness and efficiency of the new method.

关键词： inverse problem of electrocardiography regularization real-time algorithm

来源：评论

学校读者我要写书评

暂无评论

An efficient neural network approach to dynamic robot motion planning

引用

NEURAL NETWORKS 2000年第2期13卷 143-148页

作者： Yang, SX Meng, M Univ Guelph Sch Engn Guelph ON N1G 2W1 Canada Univ Alberta Dept Elect & Comp Engn Edmonton AB T6G 2G7 Canada

In this paper, a biologically inspired neural network approach to real-time collision-free motion planning of mobile robots or robot manipulators in a nonstationary environment is proposed. Each neuron in the topologically organized neural network has only local connections, whose neural dynamics is characterized by a shunting equation. Thus the computational complexity linearly depends on the neural network size. The real-time robot motion is planned through the dynamic activity landscape of the neural network without any prior knowledge of the dynamic environment, without explicitly searching over the free workspace or the collision paths, and without any learning procedures. Therefore it is computationally efficient. The global stability of the neural network is guaranteed by qualitative analysis and the Lyapunov stability theory. The effectiveness and efficiency of the proposed approach are demonstrated through simulation studies. (C) 2000 Elsevier Science Ltd. All rights reserved.

关键词： neural networks robot navigation collision avoidance real-time algorithm

来源：评论

学校读者我要写书评

暂无评论

Proper Orthogonal Decomposition Method to Nonlinear Filtering Problems in Medium-High Dimension

引用

IEEE TRANSACTIONS ON AUTOMATIC CONTROL 2020年第4期65卷 1613-1624页

作者： Wang, Zhongjian Luo, Xue Yau, Stephen S-T Zhang, Zhiwen Univ Hong Kong Dept Math Hong Kong Peoples R China Beihang Univ Sch Math Sci Shahe Campus Beijing 102206 Peoples R China Tsinghua Univ Dept Math Sci Beijing 100084 Peoples R China

In this paper, we investigate the proper orthogonal decomposition (POD) method to numerically solve the forward Kolmogorov equation (FKE). Our method aims to explore the low-dimensional structures in the solution space of the FKE and to develop efficient numerical methods. As an important application and our primary motivation to study the POD method to FKE, we solve the nonlinear filtering (NLF) problems with a real-time algorithm proposed by Yau and Yau combined with the POD method. This algorithm is referred as POD algorithm in this paper. Our POD algorithm consists of offline and online stages. In the offline stage, we construct a small number of POD basis functions that capture the dynamics of the system and compute propagation of the POD basis functions under the FKE operator. In the online stage, we synchronize the coming observations in a real-time manner. Its convergence analysis has also been discussed. Some numerical experiments of the NLF problems are performed to illustrate the feasibility of our algorithm and to verify the convergence rate. Our numerical results show that the POD algorithm provides considerable computational savings over existing numerical methods.

关键词： Heuristic algorithms Mathematical model real-time systems Convergence Stochastic processes Discrete wavelet transforms Duncan-Mortensen-Zakai equation nonlinear filtering (NLF) problems proper orthogonal decomposition (POD) real-time algorithm

来源：评论

学校读者我要写书评

暂无评论

Solving Nonlinear Filtering Problems Using a Tensor Train Decomposition Method

引用

IEEE TRANSACTIONS ON AUTOMATIC CONTROL 2023年第7期68卷 4405-4412页

作者： Li, Sijing Wang, Zhongjian Yau, Stephen S. -T. Zhang, Zhiwen Univ Hong Kong Dept Math Hong Kong Peoples R China Univ Chicago Dept Stat Chicago IL 60637 USA Tsinghua Univ Dept Math Sci Beijing 100084 Peoples R China

In this article, we propose an efficient numerical method to solve nonlinear filtering (NLF) problems. Specifically, we use the tensor train decomposition method to solve the forward Kolmogorov equation (FKE) arising from the NLF problem. Our method consists of offline and online stages. In the offline stage, we use the finite difference method to discretize the partial differential operators involved in the FKE and extract low-dimensional structures in the solution tensor using the tensor train decomposition method. In the online stage using the precomputed low-rank approximation tensors, we can quickly solve the FKE given new observation data. Therefore, we can solve the NLF problem in a real-time manner. Finally, we present numerical results to show the efficiency and accuracy of the proposed method in solving up to six-dimensional NLF problems.

关键词： Duncan-Mortensen-Zakai (DMZ) equation forward Kolmogorov equations (FKEs) nonlinear filtering (NLF) problems real-time algorithm tensor train (TT) decomposition method

来源：评论

学校读者我要写书评

暂无评论

Affine-structure-based facial image encoding

引用

IEE PROCEEDINGS-VISION IMAGE AND SIGNAL PROCESSING 1999年第4期146卷 211-221页

作者： Chatterjee, S Banerjee, S Biswas, KK Indian Inst Technol Dept Comp Sci & Engn New Delhi 110016 India

A real-time algorithm for affine-structure-based video compression for facial images is presented. The face undergoing motion is segmented and triangulated to yield a set of control points. The set of control points generated by triangulation are tracked across a few frames using an intensity-based correlation technique. For accurate motion and structure estimation a Kalman-filter-based algorithm is used to track features on the facial image. The structure information of the control points is transmitted only during the bootstrapping stage. After that only the motion information is transmitted to the decoder. This reduces the number of motion parameters associated with control points in each frame. The local motion of the eyes and lips is captured using local 2-D affine transformations. For real time implementation a quad-tree based search technique is adopted to solve local correlation. Any remaining reconstruction error is accounted for using predictive encoding. Results on real image sequences demonstrate the applicability of the method.

关键词： video coding Combinatorial mathematics motion parameters data compression correlation methods image motion analysis image segmentation video compression face segmentation bootstrapping facial images Filtering methods in signal processing affine-structure-based facial image encoding Video signal processing Kalman filters quadtrees motion information reconstruction error real-time algorithm intensity-based correlation technique face triangulation tracking Image and video coding filtering theory feature tracking quad-tree based search technique image reconstruction local correlation Kalman-filter-based algorithm image sequences low-bit rate video real image sequences local 2D affine transformations predictive encoding

来源：评论

学校读者我要写书评

暂无评论

Voice Activity Detection System for Smart Earphones

引用

IEEE TRANSACTIONS ON CONSUMER ELECTRONICS 2014年第4期60卷 737-744页

作者： Lezzoum, Narimene Gagnon, Ghyslain Voix, Jeremie Univ Quebec Ecole Technol Super Dept Mech Engn Quebec City PQ H3C 1K3 Canada Univ Quebec Ecole Technol Super Dept Elect Engn Montreal PQ H3C 1K3 Canada

This paper presents a real-time voice activity detection (VAD) algorithm implemented in a miniature Digital Signal Processor (DSP) for in-ear listening devices such as earphones or headphones. This system allows consumers to hear external speech signals such as public announcements or oral communication while listening to music without removing their listening devices. The proposed algorithm uses two normalized energy features that compare the energy in the frequency region containing speech information with the frequency regions typically containing noise. The extraction of the normalized features represents the key of the proposed VAD since it eliminates the need for a signal-to-noise ratio (SNR) estimator. The VAD's decision is made using two threshold comparison rules computed from the normalized features and a hangover scheme triggered after a given number of observations. The algorithm parameters, namely the frequency regions' boundaries, number of observations, two decision thresholds and hangover's duration, have been optimized off-line using a genetic algorithm. The performance of the proposed VAD is compared to a benchmark algorithm in four noise environments and three SNRs. Results show that the average false positive rate (FPR) of the proposed algorithm is 4.2% and the average true positive rate (TPR) is 91.4 % compared to the benchmark algorithm which has a FPR average of 29.9 % and a TPR average of 79.0 %. The proposed VAD is implemented in hardware to validate its reliability and complexity(1).

关键词： Smart earphones voice activity detection energy based feature real-time algorithm digital signal processor

来源：评论

学校读者我要写书评

暂无评论

A mathematical model of white blood cell dynamics during maintenance therapy of childhood acute lymphoblastic leukemia

引用

MATHEMATICAL MEDICINE AND BIOLOGY-A JOURNAL OF THE IMA 2019年第4期36卷 471-488页

作者： Le, Thuy T. T. Jost, Felix Raupach, Thomas Zierk, Jakob Rauh, Manfred Suttorp, Meinolf Stanulla, Martin Metzler, Markus Sager, Sebastian Otto Von Guericke Univ Fac Math Inst Math Optimizat Magdeburg Germany Univ Hosp Erlangen Dept Pediat & Adolescent Med Erlangen Germany Univ Hosp Carl Gustav Carus Pediat Hematol & Oncol Dresden Germany Hannover Med Sch Dept Pediat Hematooncol Hannover Germany

Acute lymphoblastic leukemia is the most common malignancy in childhood and requires prolonged oral maintenance chemotherapy to prevent disease relapse after remission induction with intensive intravenous chemotherapy. In maintenance therapy, drug doses of 6-mercaptopurine (6-MP) and methotrexate (MTX) are adjusted to achieve sustained antileukemic activity without excessive myelosuppression. However, uncertainty exists regarding timing and extent of drug dose responses and optimal dose adaptation strategies. We propose a novel comprehensive mathematical model for 6-MP and MTX pharmacokinetics, pharmacodynamics and myelosuppression in acute lymphoblastic maintenance therapy. We personalize and cross-validate the mathematical model using clinical data and propose a real-time algorithm to predict chemotherapy responses with a clinical decision support system as a potential future application.

关键词： childhood acute lymphoblastic leukemia chemotherapy maintenance therapy ordinary differential equations parameter estimation real-time algorithm

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：