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

Parameters extraction for MIS structure with protective layer by double-image Green's function method

INTERNATIONAL JOURNAL OF ELECTRONICS 2005年第9期92卷 553-559页

作者： Dai, WL Li, ZF Fan, Y Shanghai Jiao Tong Univ Dept Elect Engn Shanghai 200030 Peoples R China Univ Elect Sci & Technol China Sch Elect Engn Chengdu 610054 Peoples R China

In this paper, a new double- image Green's function approach is proposed to compute the frequency- dependent capacitance and conductance for the interconnects based on metal- insulator- semiconductor ( MIS) structure with a protective layer. The hierarchical algorithm is also adopted to speed the calculation of the infinite series resulted from the double- image Green's function. The parameters gained from this new approach are shown to be in good agreement with the data obtained by full- wave method and total charge Green's function method.

关键词： protective MIS double-image Green's function hierarchical algorithm

来源：评论

学校读者我要写书评

暂无评论

Robust hierarchical Sensor Optimization Placement Method for Leak Detection in Water Distribution System

引用

WATER RESOURCES MANAGEMENT 2021年第12期35卷 3995-4008页

作者： Hu, Zukang Chen, Wenlong Chen, Beqing Tan, Debao Zhang, Yu Shen, Dingtao Hohai Univ Coll Comp & Informat Nanjing Peoples R China Changjiang River Sci Res Inst Hubei Prov Key Lab River Basin Water Resources & Wuhan Peoples R China Changjiang River Sci Res Inst Spatial Informat Technol Applicat Inst Wuhan Peoples R China

The quality of sensor placement in water distribution systems (WDSs) has considerable impact on leak detection accuracy and identification efficiency. Sensor-placement optimization has long been a major issue in the research of WDS. Conventional hierarchical algorithms based on joint entropy have been widely applied to sensor-placement optimization in the engineering-safety monitoring field. Although such algorithms can effectively reduce information redundancy and are computationally very efficient, they fail to fully account for various practical failure scenarios. Sensor failures introduce bias into monitored data and disrupt the monitoring process, thereby compromising the monitoring performance of a given sensor network. To overcome this drawback, this study proposes a new optimal sensor-placement scheme for WDSs based on an improved hierarchical algorithm. The new optimization scheme works by sequentially selecting sensors using joint entropy as a sensor-placement objective function and fully considers various scenarios of a single-sensor failure to ensure minimal information entropy loss during sensor failure. Simulation is performed on an example network (i.e., Net 3 from EPANET), revealing that when a sensor fails, information entropy loss is 0.011 for conventional sensor-placement schemes, but it is only 0.007 for the improved scheme. Statistical analysis shows that the improved scheme has a higher robustness and adaptability for leak detection and identification, owing to the full consideration of various scenarios of a single-sensor failure.

关键词： hierarchical algorithm Joint entropy Leak detection and identification Sensor-placement optimization Water distribution system

来源：评论

学校读者我要写书评

暂无评论

Clustering Multispectral Images Using Spatial-Spectral Information

引用

IEEE GEOSCIENCE AND REMOTE SENSING LETTERS 2015年第7期12卷 1521-1525页

作者： Fatemi, Sayyed Bagher Mobasheri, Mohammad Reza Abkar, Ali Akbar KN Toosi Univ Technol Dept Photogrammetry & Remote Sensing Tehran 19697 Iran

Clustering is an important topic in image analysis and has many applications. Owing to the limitations of the feature space in multispectral images and spectral overlap of the clusters, it is required to use some additional information such as the spatial context in image clustering. To increase the accuracy of image clustering, a new hierarchical Iterative Clustering algorithm using Spatial and Spectral information (HICLASS) is introduced. This algorithm separates pixels into uncertain and certain categories based on decision distances in the feature space. The algorithm labels the certain pixels using the k-means clustering, and the uncertain ones with the help of information in both spatial and spectral domains of the image. The proposed algorithm is tested using simulated and real data. The benchmark results indicate better performance of HICLASS when compared with the k-means, local embeddings, and some proximity-based algorithms. The overall accuracy of the k-means has increased between 12.5% and 20.4% for different data. The HICLASS method increases the accuracy and generates more homogeneous regions, which are required for object-based applications.

关键词： Clustering hierarchical algorithm k-means multispectral remote sensing

来源：评论

学校读者我要写书评

暂无评论

ICCAP - A linear time sparsification and reordering algorithm for 3-D BEM capacitance extraction

引用

IEEE TRANSACTIONS ON MICROWAVE THEORY AND TECHNIQUES 2006年第7期54卷 3060-3068页

作者： Jiang, Rong Chang, Yi-Hao Chen, Charlie Chung-Ping Cadence Design Syst Inc San Jose CA 95131 USA Etron Technol Corp Memory Design Dev Hsinchu Taiwan Natl Taiwan Univ Dept Elect Engn Taipei 106 Taiwan Natl Taiwan Univ Grad Inst Elect Engn Taipei 106 Taiwan

This paper presents an efficient, simple, hierarchical, and sparse three-dimensional capacitance extraction algorithm, i.e., ICCAP. Most previous capacitance extraction algorithms, such as FastCap and HiCap, introduce intermediate variables to facilitate the hierarchical potential calculation, but still preserve the basic panels as basis. In this paper, we. discover that those intermediate variables are a fundamentally much better basis than leaf panels. As a result, we are able to explicitly construct the sparse potential coefficient matrix and solve it with linear memory and linear run time in comparison with the most recent hierarchical O(nlogn) approach in PHiCap. Furthermore, the explicit sparse formulation of a potential matrix not only enables the usage of preconditioned Krylov subspace iterative methods, but also the reordering technique. A new reordering technique, i.e., level-oriented reordering (LOR), is proposed to further reduce over 20% of memory consumption and run time compared with no reordering techniques applied. In fact, LOR is even better than the state-of-the-art minimum degree reordering and more efficient. Without complicated orthonormalization matrix computation, ICCAP is very simple, efficient, and accurate. Experimental results demonstrate the superior run time and memory consumption over previous approaches while achieving similar accuracy.

关键词： basis boundary-element method (BEM) capacitance extraction hierarchical algorithm interconnect interconnect modeling parasitic extraction reordering

来源：评论

学校读者我要写书评

暂无评论

hierarchical Location Identification of Destabilizing Faults and Attacks in Power Systems: A Frequency-Domain Approach

引用

IEEE TRANSACTIONS ON SMART GRID 2019年第2期10卷 2036-2045页

作者： Amini, Sajjad Pasqualetti, Fabio Abbaszadeh, Masoud Mohsenian-Rad, Hamed Univ Calif Riverside Dept Elect & Comp Engn Riverside CA 92507 USA Univ Calif Riverside Dept Mech Engn Riverside CA 92507 USA GE Global Res Niskayuna NY 12039 USA

An optimization-based data-driven approach is proposed to identify the unknown location(s) of destabilizing faults and attacks in power systems. The analysis in this paper kicks in at the critical moment where the presence of destabilizing fault or attack is detected within the power system;therefore, there is an immediate need to identify the location(s) of the affected generators or loads in order to enable proper and effective post-detection measures. The proposed method works in frequency-domain. It does not require prior knowledge about the number of affected location(s). It is accurate in identifying the correct locations and also in preventing false alarms. It is computationally more efficient than its time-domain counterparts. Importantly, it is well-suited to be implemented in a hierarchical fashion, with applications such as in wide area monitoring systems. Various case studies on IEEE 9 and IEEE 39 bus test systems verified the performance of the proposed algorithms.

关键词： Fault and attack location identification power system stability cyber-physical security hierarchical algorithm

来源：评论

学校读者我要写书评

暂无评论

Perfect load balancing on the star interconnection network

引用

JOURNAL OF SUPERCOMPUTING 2007年第3期41卷 269-286页

作者： Imani, N. Sarbazi-Azad, H. Akl, S. G. Sharif Univ Technol Tehran Iran IPM Sch Comp Sci Tehran Iran Queens Univ Kingston ON Canada

In this paper, we use the regular distribution method to design a perfect load balancing algorithm for an n-star with a maximum error of 1 and a time complexity of 3n(n + 1). This algorithm is based on the novel notion of leader trees. A second algorithm proposed in this paper as an enhancement to our first algorithm and uses an arbitrary spanning tree as the leader tree and has a worst time complexity of 2.25n(2)-3n + 0.75. We also discuss the issue of dynamically selecting the leader tree and hybrid load balancing algorithms in general. Furthermore, we present a hybrid algorithm for load balancing on the star interconnection network which benefits from a diffusion load balancing preprocessing phase and shows a smaller mean time complexity than our two first algorithms.

关键词： multicomputers interconnection networks star graph load balancing hierarchical algorithm tree embedding

来源：评论

学校读者我要写书评

暂无评论

Reduction of energy consumption in wireless sensor networks based on predictable routes for multi-mobile sink

引用

JOURNAL OF SUPERCOMPUTING 2019年第11期75卷 7290-7313页

作者： Karimi, A. Amini, S. M. Islamic Azad Univ Fac Comp & Informat Technol Engn Qazvin Branch Qazvin Iran Islamic Azad Univ Fac Tech & Comp Engn Sci & Res Branch Tehran Iran

According to recent studies, we can benefit from mobile sinks and hierarchical algorithms to improve energy efficiency and load efficiency in wireless sensor networks. To improve energy conservation and to increase load balancing, we proposed a cluster-based routing algorithm based on several predictable movement paths for mobile sinks. The basic idea of the proposed scheme is to prolong the network longevity and to reduce the average distance between cluster heads and mobile sinks in the data transmission process. To this end, and inspiring by the hexagonal shape of beehives, we let the network area to be a hexagonal shape in which sensor nodes are distributed randomly. This hexagon is composed of three rhombuses, where each rhombus is considered as a cluster. The mobile sinks are forced to move along an internal triangle formed by connecting the large diagonals of these three rhombuses. Since the sinks move along a pre-determined path and accurately covers the area of all clusters, this movement strategy eliminates the problem of sink off cluster heads, seen in a previous similar approach. In addition, we provide the ability for the sensing nodes to send the data to the closet sinks based on different movement paths and with minimal energy consumption. Therefore, the distance between the cluster heads and mobile sinks is reduced, which in turn leads to reduced energy consumption among the sensing nodes and increases load balancing. According to the simulation results, the proposed scheme has better performance in terms of the number of active nodes, the total energy consumption, the average of residual energy, and the network lifetime compared to previous movement strategies.

关键词： Energy consumption hierarchical algorithm Network lifetime Multi-mobile sink Wireless sensor networks

来源：评论

学校读者我要写书评

暂无评论

Scalable Virtual Network Mapping algorithm for Internet-Scale Networks

引用

IEICE TRANSACTIONS ON COMMUNICATIONS 2012年第7期E95B卷 2222-2231页

作者： Yang, Qiang Wu, Chunming Zhang, Min Zhejiang Univ Coll Elect Engn Hangzhou 310003 Zhejiang Peoples R China Zhejiang Univ Coll Comp Sci & Engn Hangzhou 310003 Zhejiang Peoples R China Zhejiang Univ Coll Comp Sci Hangzhou 310003 Zhejiang Peoples R China Zhejiang Univ Coll Comp Sci & Technol Hangzhou 310003 Zhejiang Peoples R China

The proper allocation of network resources from a common physical substrate to a set of virtual networks (VNs) is one of the key technical challenges of network virtualization. While a variety of state-of-the-art algorithms have been proposed in an attempt to address this issue from different facets, the challenge still remains in the context of large-scale networks as the existing solutions mainly perform in a centralized manner which requires maintaining the overall and up-to-date information of the underlying substrate network. This implies the restricted scalability and computational efficiency when the network scale becomes large. This paper tackles the virtual network mapping problem and proposes a novel hierarchical algorithm in conjunction with a substrate network decomposition approach. By appropriately transforming the underlying substrate network into a collection of sub-networks, the hierarchical virtual network mapping algorithm can be carried out through a global virtual network mapping algorithm (GVNMA) and a local virtual network mapping algorithm (LVNMA) operated in the network central server and within individual sub-networks respectively with their cooperation and coordination as necessary. The proposed algorithm is assessed against the centralized approaches through a set of numerical simulation experiments for a range of network scenarios. The results show that the proposed hierarchical approach can be about 5-20 times faster for VN mapping tasks than conventional centralized approaches with acceptable communication overhead between GVNCA and LVNCA for all examined networks, whilst performs almost as well as the centralized solutions.

关键词： virtual networks mapping algorithm Internet-scale networks hierarchical algorithm

来源：评论

学校读者我要写书评

暂无评论

Complexity scalable intra-prediction mode decision algorithm for mobile video applications

引用

IET COMMUNICATIONS 2014年第9期8卷 1654-1662页

作者： Song, Yun Long, Jizhen Yang, Kun Yang, Gaobo Hunan Univ Sch Informat Sci & Engn Changsha 410082 Hunan Peoples R China Changsha Univ Sci & Technol Sch Comp & Commun Engn Changsha 410004 Hunan Peoples R China Univ Essex Sch Comp Sci & Elect Engn Colchester CO4 3SQ Essex England

The full search scheme employed in H.264/AVC significantly improves the coding performance, but it also introduces a very high computational complexity which limits the applications in resource-constrained mobile devices. In this study, the authors firstly present a discretisation total variation and orientation gradient-based hierarchical intra-prediction mode decision method for mobile video applications. By shrinking the candidate mode set in the rate-distortion optimisation (RDO) process, the proposed algorithm reduces the computational complexity and power consumption of the encoder. Furthermore, they extend the hierarchical algorithm to a complexity scalable version in which the coding complexity is measured on five levels by reserving various numbers of modes for RDO. Experimental results demonstrate that the proposed mode decision algorithm reduces the coding complexity significantly with negligible performance degradation and the proposed complexity scalable algorithm is effective and efficient for mobile video application.

关键词： video coding rate distortion theory optimisation video streaming computational complexity gradient methods full search scheme H.264-AVC coding performance computational complexity resource-constrained mobile devices discretisation total variation candidate mode set rateâ€“distortion optimisation process RDO process power consumption encoder hierarchical algorithm coding complexity mode decision algorithm orientation gradient-based hierarchical intraprediction mode decision method mobile video applications

来源：评论

学校读者我要写书评

暂无评论

AN AUTOMATIC INSPECTION SYSTEM FOR PRINTED WIRING BOARD MASKS

引用

PATTERN RECOGNITION 1980年第6期12卷 443-455页

作者： GOTO, N KONDO, T Komukai Toshiba-cho Saiwai-ku Kawasaki 210 Japan

This paper describes an automatic inspection system for printed wiring board masks. This system utilizes a hierarchical defect detection algorithm developed for inspecting high precision mask patterns for both printed wiring boards and integrated circuits. This algorithm makes use of geometrical characteristics of mask patterns to discriminate defects. Sufficient defect detection capability, as well as high inspection throughput, has been accomplished by hardware-implementation of the algorithm and inspection result utilization through retouching machines.

关键词： Automation Visual inspection Mask patterns Pattern recognition Feature extraction hierarchical algorithm

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：