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

Phase partition for nonlinear batch process monitoring

IFAC-PapersOnLine 2016年第7期49卷 1181-1186页

作者： Liu, Jingxiang Liu, Tao Zhang, Jie Institute of Advanced Control Technology Dalian University of Technology Dalian116024 China School of Chemical Engineering and Advanced Materials Newcastle University Newcastle upon Tyne NE1 7RU United Kingdom

A window-based step-wise sequential phase partition method is proposed for monitoring nonlinear batch processes with multiphase operations. The three-dimensional batch data are unfolded in the batch-wise direction to facilitate establishing the kernel principle component analysis (KPCA) models. A moving window is introduced to maintain the kernel parameters unchanged for computation while preserving the time sequence of different phases, thus capable of significantly reducing the storage space of kernel matrices and the computation complexity. A numerical case and a penicillin fermentation process are used to demonstrate the effectiveness and merit of the proposed method. © 2016

关键词： Batch data processing Digital storage Drug products Numerical methods Principal component analysis Process control Process monitoring Batch process Batch process monitoring computation complexity Kernel principle component analysis Moving window Penicillin fermentation process Phase partition Phase partition methods

来源：评论

学校读者我要写书评

暂无评论

On complexity of Ehrenfeucht-Fraisse games

引用

ANNALS OF PURE AND APPLIED LOGIC 2009年第3期161卷 404-415页

作者： Khoussainov, Bakhadyr Liu, Jiamou Univ Auckland Dept Comp Sci Auckland 1 New Zealand

In this paper, we initiate the study of Ehrenfeucht-Fraisse games for some standard finite structures. Examples of such standard structures are equivalence relations, trees, unary relation structures, Boolean algebras, and some of their natural expansions. The paper concerns the following question that we call the Ehrenfeucht-Fraisse problem. Given n is an element of omega as a parameter, and two relational structures A and B from one of the classes of structures mentioned above, how efficient is it to decide if Duplicator wins the n-round EF game G(n)(A. B)? We provide algorithms for solving the Ehrenfeucht-Fraisse problem for the mentioned classes of structures. The running times of all the algorithms are bounded by constants. We obtain the Values of these constants as functions of n. (C) 2009 Elsevier B.V. All rights reserved.

关键词： Finite model theory Ehrenfeucht-Fraisse game computation complexity

来源：评论

学校读者我要写书评

暂无评论

MAXIMAL RANK OF MXNX(MN-K) TENSORS: 收藏
分享
引用; SIAM JOURNAL ON COMPUTING 1990年第3期19卷 467-471页; 作者： BSHOUTY, NH Technion-Israel Inst of Technology Israel; It is shown that the maximal rank of m×n×(mn−k)m×n×(mn; It is shown that the maximal rank of m×n×(mn; 关键词： 68G25 15A57 computation complexity bilinear forms tensor rank; 来源：评论; 学校读者我要写书评

暂无评论

Low-complexity encoder for LDPC codes in space applications

引用

ELECTRONICS LETTERS 2019年第23期55卷 1241-+页

作者： Chen, Weigang Han, Changcai Yang, Jinsheng Tianjin Univ Sch Microelect Tianjin Peoples R China

A low complexity encoding method and encoder architecture are proposed for the low-density parity-check (LDPC) codes in space applications recommended by Consultant Committee for Space Data Systems. This method uses the generator matrix partition and decomposition to obtain a much smaller dense core matrix. Thus, only one quarter of dense block matrices need to be implemented using the traditional circulant encoding structure. Therefore, the encoder can be implemented with lower computation and storage complexity.

关键词： parity check codes matrix algebra encoding satellite communication computational complexity low-complexity encoder LDPC codes space applications low complexity encoding method encoder architecture low-density parity-check codes generator matrix partition dense block matrices storage complexity circulant encoding structure dense core matrix Consultant Committee for Space Data Systems computation complexity

来源：评论

学校读者我要写书评

暂无评论

Analysis of Hydrogen Gas Sensing Characteristics Based on a Grey Polynomial Differential Model (GPDM) Algorithm

引用

IEEE SENSORS JOURNAL 2011年第9期11卷 1894-1898页

作者： Lin, Kun-Wei Hsu, Chi-Shiang Chaoyang Univ Technol Dept Comp Sci & Informat Engn Taichung 41349 Taiwan Natl Cheng Kung Univ Inst Microelect Dept Elect Engn Tainan 70101 Taiwan

The interesting hydrogen gas sensing characteristics, based on a field-effect transistor (FET)-based sensor, are studied and analyzed. In addition, a new grey algorithm is developed to reduce the computing complexity. From experimental results, the studied device exhibits good hydrogen performance for wide hydrogen concentration detection and widespread operation temperature. For practical applications, it is important to reduce the computational complexity and eliminate data redundancy. In this paper, a new grey polynomial differential model (GPDM) is developed to analyze hydrogen gas sensing properties. Based on the proposed model, the simulated data points are substantially decreased from 4000 points (the measured results) to 68 points (GPDM data). It is worth to note that, the simulated curve still retains the original features of experimental hydrogen transient response. The error rate between the simulated data and experimental results is only of 0.091%. Therefore, the reported GPDM presents the promise on the analysis of hydrogen gas sensing performance by reducing the undesired computing complexity and data redundancy.

关键词： computation complexity data redundancy grey polynomial differential model (GPDM) hydrogen sensor

来源：评论

学校读者我要写书评

暂无评论

Consensus of second-order multi-agents with actuator saturation and asynchronous time-delays

引用

IET CONTROL THEORY AND APPLICATIONS 2017年第17期11卷 3201-3210页

作者： Yanumula, Venkata Karteek Kar, Indrani Majhi, Somanath IIT Dept EEE Gauhati 781039 India

This study presents the consensus of a saturated second-order multi-agent system with non-switching dynamics that can be represented by a directed graph. The system is affected by data processing (input delay) and communication time-delays that are assumed to be asynchronous. The agents have saturation non-linearities, each of them is approximated into separate linear and non-linear elements. Non-linear elements are represented by describing functions. Describing functions and stability of linear elements are used to estimate the existence of limit cycles in the system with multiple control laws. Stability analysis of the linear element is performed using Lyapunov-Krasovskii functions and frequency domain analysis. A comparison of pros and cons of both the analyses with respect to time-delay ranges, applicability and computation complexity is presented. Simulation and corresponding hardware implementation results are demonstrated to support theoretical results.

关键词： multi-robot systems mobile robots delays directed graphs control nonlinearities stability Lyapunov methods frequency-domain analysis approximation theory computational complexity saturated second-order multiagent system actuator saturation asynchronous time-delays nonswitching dynamics directed graph data processing communication time-delays input delay saturation nonlinearities linear elements nonlinear elements stability analysis limit cycles multiple control laws Lyapunov-Krasovskii functions frequency domain analysis time-delay ranges applicability complexity computation complexity

来源：评论

学校读者我要写书评

暂无评论

A New Processing Approach for Reducing computational complexity in Cloud-RAN Mobile Networks

引用

IEEE ACCESS 2018年 6卷 6927-6946页

作者： Mahmood, Ali M. Al-Yasiri, Adil Alani, Omar Y. K. Univ Salford Manchester M5 4WT Lancs England Univ Technol Baghdad Baghdad 10066 Iraq

Cloud computing is considered as one of the key drivers for the next generation of mobile networks (e.g., 5G). This is combined with the dramatic expansion in mobile networks, involving millions (or even billions) of subscribers with a greater number of current and future mobile applications (e.g., IoT). Cloud Radio Access Network (C-RAN) architecture has been proposed as a novel concept to gain the benefits of cloud computing as an efficient computing resource, to meet the requirements of future cellular networks. However, the computational complexity of obtaining the channel state information in the full-centralized C-RAN increases as the size of the network is scaled up, as a result of enlargement in channel information matrices. To tackle this problem of complexity and latency, MapReduce framework and fast matrix algorithms are proposed. This paper presents two levels of complexity reduction in the process of estimating the channel information in cellular networks. The results illustrate that complexity can be minimized from O(N-3) to O((N/k)(3)), where N is the total number of RRHs and k is the number of RRHs per group, by dividing the processing of RRHs into parallel groups and harnessing the MapReduce parallel algorithm in order to process them. The second approach reduces the computation complexity from O((N/k)(3)) to O((N/k)(2.807)) using the algorithms of fast matrix inversion. The reduction in complexity and latency leads to a significant improvement in both the estimation time and in the scalability of C-RAN networks.

关键词： C-RAN Channel State Information computation complexity MapReduce Fast Matrix Algorithms Strassen's Algorithm Block LU Decomposition

来源：评论

学校读者我要写书评

暂无评论

complexity and a heuristic algorithm of computing parallel degree for program nets with SWITCH-nodes

引用

IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES 2006年第11期E89A卷 3207-3215页

作者： Yamaguchi, Shingo Takai, Tomohiro Watanabe, Tatsuya Ge, Qi-Wei Tanaka, Minoru Yamaguchi Univ Grad Sch Sci & Engn Ube Yamaguchi 7558611 Japan Fujitsu Syst Solut Ltd Tokyo 1130021 Japan Yamaguchi Univ Fac Educ Yamaguchi 7538513 Japan

This paper deals with computation of parallel degree, PARAdeg, for (dataflow) program-nets with SWITCH-nodes. Ge et al. have given the definition of PARAdeg and an algorithm of computing PARAdeg for program nets with no SWITCH-nodes. However, for program nets with SWITCH-nodes, any algorithm of computing PARAdeg has not been proposed. We first show that it is intractable to compute PARAdeg for program nets with SWITCH-nodes. To do this, we define a subclass of program nets with SWITCH-nodes, named structured program nets, and then show that the decision problem related to compute PARAdey for acyclic structured program nets is NP-complete. Next, we give a heuristic algorithm to compute PARAdeg for acyclic structured program nets. Finally, we do experiments to evaluate our heuristic algorithm for 200 acyclic structured program nets. We can say that the heuristic algorithm is reasonable, because its accuracy is more than 96% and the computation time can be greatly reduced.

关键词： program nets parallel degree computation complexity NP-completeness

来源：评论

学校读者我要写书评

暂无评论

Distributed-program reliability analysis: complexity and efficient algorithms

引用

IEEE TRANSACTIONS ON RELIABILITY 1999年第1期48卷 87-95页

作者： Lin, MS Chang, MS Chen, DJ Tamsui Oxford Univ Coll Dept Informat Management Taipei 25103 Taiwan Chunghwa Telecommun Training Inst Taipei 22077 Taiwan Natl Chiao Tung Univ Dept Comp Sci & Informat Hsinchu 30050 Taiwan

This paper investigates the problem of distributed-program reliability in various classes of distributed computing systems. This problem is computationally intractable for arbitrary distributed computing systems, even when it is restricted to the class of star distributed computing systems. One solvable case for star distributed computing systems is identified, in which data files are distributed with respective to a consecutive property;a polynomial-time algorithm is developed for this case. A linear-time algorithm is developed to test whether or not an arbitrary star distributed computing system has this consecutive file distribution property. Efficient algorithms may still be sought for computing lower & upper bounds on the distributed program reliability for arbitrary distributed computing systems.

关键词： distributed computing system distributed-program reliability computation complexity

来源：评论

学校读者我要写书评

暂无评论

Fast mapping algorithm for histogram to binary set conversion

引用

PATTERN RECOGNITION LETTERS 2000年第10期21卷 899-906页

作者： Chen, T Chen, LH Nanyang Technol Univ Sch Elect & Elect Engn Singapore 639798 Singapore Monash Univ Sch Comp Sci & Software Engn Clayton Vic 3168 Australia

In this paper, a fast binary set mapping (FBSM) algorithm is proposed for expediting the conversion from histograms to binary color sets. In comparison with the original mapping scheme, significant reduction in the computation complexity can be achieved. Such an efficient mapping algorithm justifies the practical usage of the prefiltering technique in the application to histogram-based image retrieval systems, especially to searching large image databases. (C) 2000 Published by Elsevier Science B.V. All rights reserved.

关键词： computation complexity binary color set histogram-based image retrieval

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：