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

analysis of Algorithm Efficiency for Heat Diffusion at Nanoscale Based on a MEMS Structure Investigation

ENERGIES 2020年第10期13卷

作者： Raszkowski, Tomasz Zubert, Mariusz Lodz Univ Technol Dept Microelect & Comp Sci PL-90924 Lodz Poland

This paper presents an analysis of the time complexity of algorithms prepared for solving heat transfer problems at nanoscale. The first algorithm uses the classic Dual-Phase-Lag model, whereas the second algorithm employs a reduced version of the model obtained using a Krylov subspace method. This manuscript includes a description of the finite difference method approximation prepared for analysis of the real microelectromechanical system (MEMS) structure manufactured by the Polish Institute of Electron Technology. In addition, an approximation scheme of the model, as well as the Krylov subspace-based model order reduction technique are also described. The paper considers simulation results obtained using both investigated versions of the Dual-Phase-Lag model. Moreover, the relative error generated by the reduced model, as well as the computational complexity of both algorithms, and a convergence of the proposed approach are analyzed. Finally, all analyses are discussed in detail.

关键词： Dual-Phase-Lag heat transfer model Krylov subspace-based model order reduction algorithm efficiency analysis relative error analysis algorithm convergence analysis computational complexity analysis thermal simulation algorithm finite difference method scheme Grunwald-Letnikov fractional derivative

来源：评论

学校读者我要写书评

暂无评论

Sparsity-based space-time adaptive processing using complex-valued Homotopy technique for airborne radar

引用

IET SIGNAL PROCESSING 2014年第5期8卷 552-564页

作者： Yang, Zhaocheng Li, Xiang Wang, Hongqiang Nie, Lei Natl Univ Def Technol Res Inst Space Elect Elect Sci & Engn Sch Changsha 410073 Hunan Peoples R China

In this study, a novel sparsity-based space-time adaptive processing algorithm based on the complex-valued Homotopy technique is proposed for airborne radar applications. The proposed algorithm firstly extends the existing standard real-valued Homotopy method to a more general complex-valued application using the gradient approaches. By exploiting the sparsity of the clutter spectrum in the whole spatiotemporal plane, the proposed algorithm recovers the clutter spectrum via the proposed complex Homotopy algorithm and then uses it to estimate the clutter covariance matrix, followed by the space-time filtering and the target detection. Furthermore, the implementations of the proposed algorithm are detailed. The computational complexity analysis shows that the proposed algorithm has a lower-computational complexity than the existing complex-valued Homotopy algorithm. Simulation results show that the proposed algorithm converges at a very fast speed (only 4-6 snapshots in the authors simulations) and provides both excellent detection performance and easy parameter settings.

关键词： detection performance complex-valued homotopy technique general complex-valued application gradient approaches radar imaging spatiotemporal plane parameter settings airborne radar applications sparsity-based space-time adaptive processing algorithm Optical, image and video signal processing clutter spectrum Algebra Radar equipment, systems and applications Filtering methods in signal processing covariance matrices target detection space-time filtering space-time adaptive processing radar clutter object detection computational complexity clutter covariance matrix filtering theory airborne radar computational complexity analysis

来源：评论

学校读者我要写书评

暂无评论

A novel division algorithm and architectures for parallel and sequential processing

引用

JOURNAL OF CIRCUITS SYSTEMS AND COMPUTERS 2005年第2期14卷 281-295页

作者： Tatas, K Soudris, DJ Siomos, D Thanailakis, A Democritus Univ Thrace Dept Elect & Comp Engn VLSI Design & Testing Ctr Xanthi 67100 Greece

A new algorithm for reducing the division operation to a series of smaller divisions is introduced. Partitioning the dividend into segments, we perform divisions, shifts, and accumulations taking into account the weight of dividend bits. Each partial division can be performed by any existing division algorithm. From an algorithmic point of view, computation analysis is performed in comparison with the existing algorithms. From an implementation point of view, since the division can be performed by any existing divider, the designer can choose the divider which best meets his specifications. Although the algorithm is presented for integer numbers, it can be easily generalized for fractions, since it is only a matter of representation. Two possible implementations of the algorithm, namely the sequential and parallel are derived, with several variations, allowing performance, cost, and cost/performance trade-offs. Exhaustive comparisons of the derived implementations with many existing implementations in terms of area cost, performance, and cost/performance are done. A plethora of alternative implementations can be derived due to a variable number of partitions.

关键词： computer arithmetic division computational complexity analysis algorithms parallel processing

来源：评论

学校读者我要写书评

暂无评论

Two-Stage Mixed Discrete-Continuous Identification of Radial Basis Function (RBF) Neural Models for Nonlinear Systems

引用

IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS I-REGULAR PAPERS 2009年第3期56卷 630-643页

作者： Li, Kang Peng, Jian-Xun Bai, Er-Wei Queens Univ Belfast Sch Elect Elect Engn & Comp Sci Belfast BT7 Antrim North Ireland Univ Iowa Dept Elect & Comp Engn Iowa City IA 52242 USA

The identification of nonlinear dynamic systems using radial basis function (RBF) neural models is studied in this paper. Given a model selection criterion, the main objective is to effectively and efficiently build a parsimonious compact neural model that generalizes well over unseen data. This is achieved by simultaneous model structure selection and optimization of the parameters over the continuous parameter space. It is a mixed-integer hard problem, and a unified analytic framework is proposed to enable an effective and efficient two-stage mixed discrete-continuous;identification procedure. This novel framework combines the advantages of an iterative discrete two-stage subset selection technique for model structure determination and the calculus-based continuous optimization of the model parameters. computational complexity analysis and simulation studies confirm the efficacy of the proposed algorithm.

关键词： computational complexity analysis continuous parameter optimization nonlinear system identification radial basis function (RBF) neural modeling structure determination subset selection

来源：评论

学校读者我要写书评

暂无评论

The Steiner Forest Problem revisited

引用

JOURNAL OF DISCRETE ALGORITHMS 2010年第2期8卷 154-163页

作者： Gassner, Elisabeth Graz Univ Technol Inst for Mathemat B Steyrergasse 30 A-8010 Graz Austria

The Steiner Forest Problem (SFP for short) is a natural generalization of the classical Steiner Tree Problem. Instead of only one terminal net there is given a set of terminal nets that have to be connected by choosing edges at minimum cost. Richey and Parker [ M.B. Richey, R.G. Parker, On multiple Steiner subgraph problems, Networks 16 (4) (1986) 423-438] posed the question whether SFP is hard on series-parallel graphs. We partially answer this question by showing that SFP is strongly NP-hard on graphs with treewidth 3. On the other hand, a quadratic time algorithm for the special case on outerplanar graphs is suggested. Since series-parallel graphs have treewidth 2 and outerplanar graphs are series-parallel, we almost close the gap between polynomially solvable and hard cases. (C) 2009 Elsevier B. V. All rights reserved.

关键词： Steiner Forest Steiner subgraph computational complexity analysis Series-parallel graph Outerplanar graph

来源：评论

学校读者我要写书评

暂无评论

SCHEDULING TASKS ON 2 PROCESSORS WITH DEADLINES AND ADDITIONAL RESOURCES

引用

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH 1986年第3期26卷 364-370页

作者： BLAZEWICZ, J BARCELO, J KUBIAK, W ROCK, H UNIV POLITECH BARCELONA FAC INFORMATBARCELONASPAIN POLITECH GDANSKA INST INFORMATGDANSKPOLAND TECH UNIV BERLIN INST QUANTITAT METHODEND-1000 BERLIN 12FED REP GER

The deterministic scheduling model studied in this paper involves a finite set of identical processors, a finite set of additional resources and a finite set of tasks to be executed, each requiring one processor and specified amounts of additional resources during a known amount of time. Each task is to be completed before its deadline. We establish the complexity status of the two major open nonpreemptive scheduling problems of this type. That is, we prove NP-hardness of two scheduling problems with two processors and unit processing times of all the tasks; the first one has one resource type available in a specified amount, the second one has an arbitrary number of resourcers, each available in amount of one unit. These results are complementary to a previous paper by the first author, where a polynomial-time algorithm was presented for an arbitrary number of processors, one resource type and zero-one resource requirements of the tasks. In addition, in the present paper new restricted versions of One-in-three 3 Sat are also proved to be NP-hard. These heavily restricted versions promise to be useful in other NP-hardness proofs.

关键词： computational complexity analysis deadlines NP-hard problems resource constraints Scheduling

来源：评论

学校读者我要写书评

暂无评论

A dimension reduced INS/VNS integrated navigation method for planetary rovers

引用

中国航空学报（英文版） 2016年第6期29卷 1695-1709页

作者： Ning Xiaolin Gui Mingzhen Zhang Jie Fang Jiancheng School of Instrument Science&0pto-Electronics Engineering Beihang University Beijing 100083 China

Inertial navigation system/visual navigation system (INS/VNS) integrated navigation is a commonly used autonomous navigation method for planetary rovers. Since visual measurements are related to the previous and current state vectors (position and attitude) of planetary rovers, the performance of the Kalman filter (KF) will be challenged by the time-correlation problem. A state augmentation method, which augments the previous state value to the state vector, is commonly used when dealing with this problem. However, the augmenting of state dimensions will result in an increase in computation load. In this paper, a state dimension reduced INS/VNS integrated nav-igation method based on coordinates of feature points is presented that utilizes the information obtained through INS/VNS integrated navigation at a previous moment to overcome the time rel-evance problem and reduce the dimensions of the state vector. Equations of extended Kalman filter (EKF) are used to demonstrate the equivalence of calculated results between the proposed method and traditional state augmented methods. Results of simulation and experimentation indicate that this method has less computational load but similar accuracy when compared with traditional methods.

关键词： computational complexity analysis Inertial navigation system INS/VNS integrated naviga-tion Planetary exploration rover Visual navigation system

来源：评论

学校读者我要写书评

暂无评论

NETWORK-BASED VERTEX DISSOLUTION

引用

SIAM JOURNAL ON DISCRETE MATHEMATICS 2015年第2期29卷 888-914页

作者： Van Bevern, Rene Bredereck, Robert Chen, Jiehua Froese, Vincent Niedermeier, Rolf Woeginger, Gerhard J. TU Berlin Inst Softwaretech & Theoret Informat D-10587 Berlin Germany TU Eindhoven Dept Math & Comp Sci NL-5600 MB Eindhoven Netherlands

We introduce a graph-theoretic vertex dissolution model that applies to a number of redistribution scenarios, such as gerrymandering in political districting or work balancing in an online situation. The central aspect of our model is the deletion of certain vertices and the redistribution of their load to neighboring vertices in a completely balanced way. We investigate how the underlying graph structure, the knowledge of which vertices should be deleted, and the relation between old and new vertex loads influence the computational complexity of the underlying graph problems. Our results establish a clear borderline between tractable and intractable cases.

关键词： computational complexity analysis combinatorial algorithms economization election control flow networks matching NP-hard problems political districting redistribution scenarios

来源：评论

学校读者我要写书评

暂无评论

Smart meter deployment optimisation and its analysis for appliance load monitoring

引用

JOURNAL OF ENGINEERING-JOE 2015年第4期2015卷 116-124页

作者： Khwaja, Ahmed Shaharyar Naeem, Muhammad Anpalagan, Alagan Venetsanopoulos, Tas A. Venkatesh, Bala Ryerson Univ Dept ELCE Toronto ON M5B 2K3 Canada

In this study, the authors study the problem of smart meter deployment optimisation for appliance load monitoring, that is, to monitor a number of devices without any ambiguity using the minimum number of low-cost smart meters. The importance of this problem is due to the fact that the number of meters should be reduced to decrease the deployment cost, improve reliability and decrease congestion. In this way, in future, smart meters can provide additional information about the type and number of distinct devices connected, besides their normal functionalities concerned with providing overall energy measurements and their communication. The authors present two exact smart meter deployment optimisation algorithms, one based on exhaustive search and the other based on efficient implementation of the exhaustive search. They formulate the problem mathematically and present computational complexity analysis of their algorithms. Simulation scenarios show that for a typical number of home appliances, the efficient search method is significantly faster compared to the exhaustive search and can provide the same optimal solution. The authors also show the dependency of their method on the distribution of the load pattern that can potentially be in a typical household.

关键词： power system measurement load forecasting domestic appliances appliance load monitoring energy measurements Domestic appliances Power system planning and layout optimisation smart meter deployment optimisation algorithms load pattern distribution Electrical/electronic equipment (energy utilisation) Optimisation techniques exhaustive search computational complexity analysis smart meters Power system measurement and metering home appliances

来源：评论

学校读者我要写书评

暂无评论

Parameterized complexity of team formation in social networks 1

引用

11th International Conference on Algorithmic Aspects in Information and Management (AAIM)

作者： Bredereck, Robert Chen, Jiehua Hueffner, Falk Kratsch, Stefan TU Berlin Inst Softwaretech & Theoret Informat Berlin Germany Univ Oxford Dept Comp Sci Oxford England Ben Gurion Univ Negev Dept Ind Engn & Management Beer Sheva Israel Univ Bonn Inst Informat 1 Bonn Germany

ISBN: (数字)9783319411682

ISBN: (纸本)9783319411675

Given a task that requires some skills and a social network of individuals with differei skills, the TEAM FORMATION problem asks to find a team of individuals that together ca perform the task, while minimizing communication costs. Since the problem is NP-hard, identify the source of intractability by analyzing its parameterized complexity with respel to parameters such as the total number of skills k, the team size 1, the communication cost budget b, and the maximum vertex degree A. We show that the computation complexity strongly depends on the communication cost measure: when using the weight of a minimum spanning tree of the subgraph formed by the selected team, we obtain fixes parameter tractability for example with respect to the parameter k. In contrast, when using the diameter as measure, the problem is intractable with respect to any single parameter however, combining A with either b or 1 yields fixed-parameter tractability. (C) 2017 Elsevier B.V. All rights reserved

关键词： computational complexity analysis Parameterized complexity analysis Team formation on social networks

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：