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

PIPELINE ARCHITECTURES FOR RECURSIVE MORPHOLOGICAL OPERATIONS

IEEE TRANSACTIONS ON IMAGE PROCESSING 1995年第1期4卷 11-18页

作者： SHIH, FY KING, CT PU, CC NEW JERSEY INST TECHNOL DEPT ELECT & COMP ENGNNEWARKNJ 07102 NATL TSING HUA UNIV DEPT COMP SCIHSINCHU 300TAIWAN NEW JERSEY INST TECHNOL COMP VIS LABNEWARKNJ 07102 MING HSIN INST TECHNOL DEPT INFORMAT MANAGEMENTHSINCHUTAIWAN

In this paper, we introduce efficient pipeline architectures for the recursive morphological operations. The standard morphological operation is applied directly on the original input image and produces an output image. The order of image scanning in which the operator is applied to the input pixels is irrelevant. However, the intent of the recursive morphological operations is to feed back the output at the current scanning pixel to overwrite its corresponding input pixel to be considered into computation at the following scanning pixels. The resultant output image by recursive morphology inherently depends on the image scanning sequence. Two pipelined implementations of the recursive morphological operations are presented. The design of an application-specific systolic array is first introduced. The systolic array uses 3 n cells to process an n x n image in 6 n - 2 cycles. The cell utilization rate is 100%. Second, a parallel program implementing the recursive morphological operations and running on distributed-memory multicomputers is described. Performance of the program can be finely tuned by choosing appropriate partition parameters.

关键词： Pipelines Morphological operations Morphology Computer architecture Gray-scale Shape Image processing Systolic arrays partitioning algorithms Mathematics

来源：评论

学校读者我要写书评

暂无评论

A MILP Based Framework for the Hydro Unit Commitment Considering Irregular Forbidden Zone Related Constraints

引用

IEEE TRANSACTIONS ON POWER SYSTEMS 2021年第3期36卷 1819-1832页

作者： Zhao, Zhipeng Cheng, Chuntian Liao, Shengli Li, Yapeng Lu, Quan Dalian Univ Technol Inst Hydropower & Hydroinformat Dalian 116024 Peoples R China Dalian Univ Technol Key Lab Ocean Energy Utilizat & Energy Conservat Minist Educ Dalian 116024 Peoples R China Dalian Univ Technol Dept Elect & Elect Engn Dalian 116024 Peoples R China

The irregular forbidden zone (FZ) is a common phenomenon with giant hydropower plants developed in the past two decades in China. Irregular shapes of FZs significantly challenge hydro unit commitment (HUC). This paper proposes a novel MILP based framework for HUC considering irregular FZ related constraints including the FZ constraint, effects of linearization errors in both the net head and the output, and the FZ crossing constraint. In the framework, the FZ constraint is handled by the optimal convex partitioning algorithm and the common structure-based formulation method. Inspired by the planar translating robot placement problem, linearization errors are considered by the Minkowski sum method. To handle the FZ crossing constraint, we then propose a graph theory-based approximate formulation method. The framework is integrated into a HUC model with an objective of peak shaving. The model is then tested with a batch of real-world instances of a cascade hydropower system formed by ten giant units with highly irregular FZs. The results show our framework can effectively consider the irregular FZ related constraints. The major advantage of our framework is its ability to handle the irregular shapes of FZs without any tedious and error-prone manual processing.

关键词： Hydroelectric power generation Shape Vibrations partitioning algorithms Robots Reservoirs irregular forbidden zone hydro unit commitment MILP convex partition graph theory

来源：评论

学校读者我要写书评

暂无评论

A Distributed Higher-Order k-Medoids Clustering Algorithm for Network Partition

引用

IEEE TRANSACTIONS ON NETWORK SCIENCE AND ENGINEERING 2024年第5期11卷 4181-4193页

作者： Mo, Yuanqiu Xing, Ran Hou, Huazhou Southeast Univ Nanjing 211189 Peoples R China Univ Sydney Sydney NSW 2006 Australia Purple Mt Labs Nanjing 211102 Peoples R China

In this paper, we develop a distributed higher-order k-medoids clustering algorithm for networks using hop count as the distance metric, typical examples include social networks, wireless sensor networks and etc. Different than the classical k-medoids clustering where each cluster is assigned with one medoid (representative nodes in the network), the proposed algorithm is capable of partitioning the nodes into clusters dominated by multiple medoids. In this algorithm, a higher-order shortest path algorithm is first adopted to assign each node the clustering set comprising of its h (h >= 1) closest medoids using the hop count metric, then an aggregation algorithm collects the local information from each node to the medoids in its clustering set, based on which a medoids update mechanism helps each medoid decide whether to keep its medoid status or assign the status to one of its neighbors, so as to improve the clustering quality. The clustering performance of the proposed algorithm is proved to monotonically converge to a local optimum after running the algorithm finite times. Simulations results show that the proposed algorithm can achieve superior performance compared with several centralized $k$-medoids clustering algorithms and scale well as the number of nodes increases.

关键词： Clustering algorithms partitioning algorithms Length measurement Wireless sensor networks Social networking (online) Search problems Prototypes k -medoids clustering higher-order clustering graph algorithms

来源：评论

学校读者我要写书评

暂无评论

A Formal Framework for Maximum Error Estimation in Approximate Logic Synthesis

引用

IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS 2022年第4期41卷 840-853页

作者： Scarabottolo, Ilaria Ansaloni, Giovanni Constantinides, George A. Pozzi, Laura Univ Svizzera Italiana Fac Informat CH-6904 Lugano Switzerland Ecole Polytech Fed Lausanne EPFL Embedded Syst Lab CH-1015 Lausanne Switzerland Imperial Coll London Dept Elect & Elect Engn London SW7 2AZ England

Approximate logic synthesis techniques have become popular in error-resilient systems, where accuracy requirements can be traded for improved energy efficiency. Many of these techniques operate on a circuit by substituting or removing some of its portions under a predefined error constraint;however, the research on systematic methods to determine the error induced by such transformations is still at an early stage. We propose herein a generic framework for modeling maximum error in a circuit, called partition and propagate, which is a fundamental preliminary step for ALS. This framework is based on circuit partitioning and error propagation among the subcircuits. We provide a sound, complete formal description of such framework, and we illustrate how two state-of-the-art algorithms can be subsumed by it. Moreover, we propose a novel gate-level error-modeling algorithm, which is able to identify the whole range of possible errors induced by a given approximate transformation. We compare the three strategies and illustrate the efficiency of the new error-propagation methodology, which is able to identify accurate error bounds and, hence, guide ALS techniques to more valuable solutions.

关键词： Integrated circuit modeling Logic gates partitioning algorithms Computational modeling Approximation algorithms Scalability Monte Carlo methods Approximate computing efficient architecture error modeling hardware design logic synthesis

来源：评论

学校读者我要写书评

暂无评论

MODELING AND CONTROL OF CARBON-MONOXIDE CONCENTRATION USING A NEURO-FUZZY TECHNIQUE

引用

IEEE TRANSACTIONS ON FUZZY SYSTEMS 1995年第3期3卷 271-279页

作者： TANAKA, K SANO, M WATANABE, H HIROSHA CITY UNIV DEPT COMP SCIHIROSHIMA 73131JAPAN MERCURY TECHNOL NEW YORKNY 10005

Modeling and control of carbon monoxide (CO) concentration using a neuro-fuzzy technique are discussed. A self-organizing fuzzy identification algorithm (SOFIA) for identifying complex systems such as CO concentration is proposed. The main purpose of SOFIA is to reduce the computational requirement for identifying a fuzzy model. In particular, we simplify a procedure for finding the optimal structure Of fuzzy partition. The delta rule, which is a basic learning method in neural networks, is used for parameter identification of a fuzzy model. SOFIA consists of four stages which effectively realize structure identification and parameter identification. The procedure of SOFIA is concretely demonstrated by a simple example which has been used in some modeling exercises. The identification result shows effectiveness of SOFIA. Next, we apply SOFIA to a prediction problem for CO concentration in the air at the busiest traffic intersection in a large city of Japan. Prediction results show that the fuzzy model is much better than a linear model. Furthermore, we simulate a control system for keeping CO concentration at a constant level by using the identified fuzzy model. A self-learning for adaptively modifying controller parameters by delta rule is introduced because the dynamics of real CO concentration system changes gradually over a long period of time. Two self-learning controllers are designed in this simulation, One is a self-learning linear PI controller. The other is a self-learning fuzzy PI controller. We investigate robustness and adaptability of this control system for disturbance and parameter perturbation of the CO concentration model. Simulation results show that the self-learning fuzzy controller is more robust and adaptive.

关键词： Fuzzy control Fuzzy systems Parameter estimation Predictive models Control system synthesis Robust control partitioning algorithms Learning systems Neural networks Fuzzy neural networks

来源：评论

学校读者我要写书评

暂无评论

ITERATIVELY MAXIMUM-LIKELIHOOD DECODABLE SPHERICAL CODES AND A METHOD FOR THEIR CONSTRUCTION

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 1988年第3期34卷 480-485页

作者： GAO, JP RUDOLPH, LD HARTMANN, CRP SYRACUSE UNIV SCH COMP & INFORMAT SCISYRACUSENY 13244

The authors propose a class of spherical codes which can be easily decoded by an efficient iterative maximum likelihood decoding algorithm. A necessary and sufficient condition for a spherical code to be iteratively maximum likelihood decodable is formulated. A systematic construction method for such codes based on shrinking of Voronoi corners is analyzed. The base code used for construction is the binary maximal length sequence code. The second-level construction is described. Computer simulation results for selected codes constructed by the proposed method are given.< >

关键词： Iterative decoding Maximum likelihood decoding Iterative algorithms Sufficient conditions Euclidean distance Information science partitioning algorithms Iterative methods Additive white noise Signal to noise ratio

来源：评论

学校读者我要写书评

暂无评论

CLOSEST COSET DECODING OF (U)(U + V) CODES

引用

IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS 1989年第6期7卷 982-988页

作者： HEMMATI, F COMSAT Laboratories Clarksburg MD USA

The general concept of closest coset decoding (CCD) is presented, and a soft-decoding technique for block codes that is based on partitioning a code into a subcode and its cosets is described. The computational complexity of the CCD algorithm is significantly less than that required if a maximum-likelihood detector (MLD) is used. A set-partitioning procedure and details of the CCD algorithm for soft decoding of mod u mod u+v mod codes are presented. Upper bounds on the bit-error-rate (BER) performance of the proposed algorithm are combined, and numerical results and computer simulation tests for the BER performance of second-order Reed-Muller codes of length 16 and 32 are presented. The algorithm is a suboptimum decoding scheme and, in the range of signal-to-noise-power-density ratios of interest, its BER performance is only a few tenths of a dB inferior to the performance of the MLD for the codes examined.< >

关键词： Maximum likelihood decoding Charge coupled devices Bit error rate partitioning algorithms Block codes Computational complexity Maximum likelihood detection Detectors Upper bound Computer simulation

来源：评论

学校读者我要写书评

暂无评论

Research on Product Reviews Hot Spot Discovery Algorithm Based on Mapreduce

引用

IEEE ACCESS 2020年 8卷 111829-111836页

作者： Su, Hao Liu, Qicheng Mu, Chunxiao Yantai Univ Sch Comp Sci & Control Engn Yantai 264005 Peoples R China

In recent years, with the development of e-commerce, the scale of comment data has shown an exponential growth trend. In this paper, a product review hot spot discovery algorithm based on MapReduce-PR-HD is proposed. The algorithm uses the Vector Space Model to vectorize the text data of the reviews, and utilize the TF-IDF algorithm to calculate the position weight of the feature words, then combines the Canopy algorithm and the K-Means algorithm to achieve the hot spot discovery of product reviews. At the same time, the algorithm obtain the ability to process massive data through the MapReduce framework. Experiments demonstrate that the PR-HD algorithm has high accuracy and parallel efficiency. This allows product developers to obtain more direct and effective suggestions and feedback, which allows product developers to obtain more direct and effective suggestions and feedback.

关键词： Clustering algorithms Data mining partitioning algorithms Mathematical model Indexes Information technology Internet Product reviews hot spot discovery MapReduce canopy algorithm K-means algorithm

来源：评论

学校读者我要写书评

暂无评论

Dynamic Beam Scheduling of Multibeam Low Earth Orbit Satellites Based on an Enhanced Artificial Bee Colony Algorithm

引用

IEEE ACCESS 2022年 10卷 115424-115434页

作者： Wei, Debin Zheng, Dongdong Pan, Chengsheng Yang, Li Nanjing Univ Sci & Technol Sch Automat Nanjing 210094 Peoples R China Dalian Univ Commun & Network Lab Dalian 116622 Peoples R China Nanjing Univ Informat Sci & Technol Sch Elect & Informat Engn Nanjing 210044 Peoples R China

The application of beam-hopping technology to low earth orbit satellites can effectively achieve flexible allocation and efficient utilization of on-board resources. Considering that the power resources on low earth orbit satellites are limited, the electromagnetic environment is complex and changeable, and the terminal distribution and service requirements are highly dynamic. We established the service model, service priority model and multibeam resource scheduling model under the constraints of beam bandwidth, on-board power, service priorities, etc. To solve the catastrophic problem of a large solution space in the resource scheduling model and to improve the convergence of the algorithm, we propose an enhanced artificial bee colony algorithm. The optimization strategy improves the process of population initialization, solution updates, and search for the global optimal solution. The simulation results show that under the constraints of cochannel interference and on-board resource utilization, the algorithm always converges to the objective function at the fastest speed, which proves that the algorithm has high applicability to the high dynamic characteristics of LEO satellites. In addition, the algorithm can obtain the global optimal solution, and thus, it can ensure the fairness of resource allocation and the effectiveness of service completion.

关键词： Artificial bee colony algorithm Heuristic algorithms Resource management Dynamic scheduling Low earth orbit satellites Artificial bee colony algorithm partitioning algorithms Satellite communication Satellite communication beam hopping resource scheduling enhanced artificial bee colony algorithm

来源：评论

学校读者我要写书评

暂无评论

FAST ALGORITHM FOR POLYGON DECOMPOSITION

引用

IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS 1988年第4期7卷 473-483页

作者： NAHAR, S SAHNI, S UNIV MINNESOTA DEPT COMP SCIMINNEAPOLISMN 55455

An O(klog(k)+n) algorithm is developed, where n is the number of versions, to decompose rectilinear polygons into rectangles. This algorithm uses horizontal cuts only and reports nonoverlapping rectangles the union of which is the original rectilinear polygon. This algorithm has been programmed in Pascal on an Apollo DN320 workstation. Experimentation with rectilinear polygons from VLSI artwork indicate that the present algorithm is significantly faster than the plane sweep algorithm and the algorithm proposed by K.D. Gourley and D.M. Green (1983).< >

关键词： partitioning algorithms Very large scale integration Computer science Workstations Application software Computer graphics Image processing Layout Image analysis

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：