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

Communications in Computer and information Science 2014年 472卷 225-229页

作者： Kong, Yuan Zhang, Zheng Liu, Yang Key Laboratory of Image Information Processing and Intelligent Control School of Automation Huazhong University of Science and Technology Wuhan Hubei430074 China

ISBN: (纸本)9783662450482

Spiking neural P systems with astrocytes (SNPA systems, for short) are a class of distributed parallel computing devices inspired from the way spikes pass through the synapses between the neurons. In this work, we investigate the language generation power of SNPA systems. Specifically, we prove that SNPA systems without the forgetting rules can generate recursively enumerable languages and characterize regular languages. Furthermore, we give a finite language that can be generated by SNPA systems, but which cannot be generated by spiking neural P systems without astrocytes. These results show that astrocyte is a powerful ingredient for generating languages by spiking neural P systems. © Springer-Verlag Berlin Heidelberg 2014.

关键词： Distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

Identification of Prognostic Signature in Esophageal Cancer Based on Network Analysis 15th

Identification of Prognostic Signature in Esophageal Cancer ...

引用

15th International Conference on Bio-Inspired Computing: Theories and Applications, BIC-TA 2020

作者： Ma, Jianfei Huang, Yabing Key Laboratory of Image Information Processing and Intelligent Control School of Artificial Intelligence and Automation Huazhong University of Science and Technology Luoyu Road 1037 Wuhan430074 China Department of Pathology Renmin Hospital of Wuhan University Wuhan430060 China

ISBN: (纸本)9789811613531

Esophageal cancer is the 6th most common cancer in the world with a five-year survival among 15 % to 25 % patients. It’s of great significance to identify prognostic signature for precise prediction of patient survival. In this work, we use a network-based approach to identify the disease genes of esophageal cancer. We construct the co-expression networks of normal and cancer samples by interpreting the gene expression profile and further divide the networks into inactivated subnetwork and enhanced subnetwork. Functional enrichment analysis shows that phosphoprotein and acetylation are both enriched in the inactivated genes and enhanced genes. Furthermore, 5 kinesin family members, KIF11, KIF23, KIF18A, KIF18B, and KIF2A, are all found to be significantly enhanced, suggesting that kinesin is crucial in promoting the formation of esophageal cancer. The 11 genes both inactivated and enhanced in the process of tumor development are found to be prognosis-associated and perform well in evaluating the survival of esophageal cancer patients. This study provides us fundamental recognition about the functional dysregulation in esophageal cancer and help to identify the biomarker for the further development of therapeutic targets. © 2021, Springer Nature Singapore Pte Ltd.

关键词： Diseases

来源：评论

学校读者我要写书评

暂无评论

Hybrid Consensus-based Algorithm for Distributed Economic Dispatch Problem

引用

IFAC-PapersOnLine 2017年第1期50卷 177-182页

作者： Liu X.-K. Wang Y.-W. Yan H. Wang X. Hu X. School of Automation Huazhong University of Science and Technology Wuhan 430074 China Key Laboratory of Image Processing and Intelligent Control (Huazhong University of Science and Technology) Ministry of Education China Key Laboratory of Advanced Control Optimization for Chemical Process of Ministry of Education China School of Information Science and Engineering East China University of Science and Technology 130 Meilong Road Shanghai 200237 China

Economic dispatch is one of the fundamental problems in the power system research. The existing algorithms are either discrete iterative algorithms or continuous-time dynamical algorithms. By virtue of the hybrid techniques, a hybrid consensus-based algorithm is proposed in this paper, which consists of a finite-time continuous-time algorithm and a discrete-time interacted scheme. Moreover, inspired by the cluster synchronization and the benefit of the projection operator, a supervised strategy is carried out to ensure that each generator unit will work within its power generation constraint. For a better understanding of the supervised hybrid distributed algorithm, the detailed pseudo-code is presented. Finally, a numerical example is given to illustrate the effectiveness of the algorithm. © 2017

关键词： consensus protocol distributed optimization economic dispatch hybrid system smart grid

来源：评论

学校读者我要写书评

暂无评论

A new roadmap constitution method based on dividing grid and level-set

A new roadmap constitution method based on dividing grid and...

引用

International Symposium on Intelligence information processing and Trusted Computing

作者： Li, Shidong Ding, Mingyue Cai, Chao Institute for Information Engineering of Hubei University for Nationalities Enshi Hubei China Institute for Pattern Recognition and Artificial Intelligence National Lab. for Multi-spectral Information Processing Technologies HUST Wuhan China College of Life Science and Technology Image Processing and Intelligent Control Key Laboratory of Education Ministry of China HUST Wuhan China

ISBN: (纸本)9780769541969

Roadmap methods were widely used in route planning fields, both for robots and unmanned aircrafts. Traditional roadmap is constituted by connecting the vertexes of convex obstacle, which is related to the locations of start and goal of route, so the roadmap can not be reused when anyone of start and goal changed. Absence of reusability reduces the efficiency of route planning by using roadmap. A new roadmap constitution method was proposed in this paper, which is build on dividing the 2D configuration space into multi-scale grids and setting nodes of roadmap on grid boundary using Level-Set method, same method was used to construct the map cells of roadmap between any two nodes lays on same grid . The roadmap constituted with new method can be reused when the start or goal was changed;it is efficient for replanning problem. © 2010 IEEE.

关键词： Reusability

来源：评论

学校读者我要写书评

暂无评论

Robust Output Synchronization of Lower Triangular Multi-Agents Via Sampled-Data control

引用

IFAC-PapersOnLine 2017年第1期50卷 2415-2420页

作者： Chen X. Zhu L. Chai L. Zhang H.-T. School of Information Science and Engineering Wuhan University of Science and Technology Wuhan 430081 China Department of Electric and Electronic Engineering University of Hong Kong Hong Kong Key Laboratory of Image Processing and Intelligent Control School of Automation and the State Key Laboratory of Digital Manufacturing Equipment and Technology Huazhong University of Science and Technology Wuhan 430074 China

This paper establishes a general sampled-data framework for robust output synchronization of nonlinear heterogeneous multi-agent system in the lower-triangular form. Inspired by our previous work, this problem can be solved in a two-step manner: (1) sampled-data perturbed consensus, and (2) sampled-data perturbed output regulation. These two steps are coupled by a small gain condition which must be satisfied to ensure the robust output synchronization is achieved. We will first show that the sampling conditions on accomplishing sampled-data perturbed consensus and perturbed output regulation separately. In addition, we strengthen our previous small gain condition to incorporate the sampling effort. The sampled-data synchronization controller can be designed provided that the sampling condition satisfies some additional condition. © 2017

关键词： Multi-agent systems Nonlinear systems Output regulation Sampled-data Synchronization

来源：评论

学校读者我要写书评

暂无评论

Lightweight Human Pose Estimation Using Heatmap-Weighting Loss

arXiv

引用

arXiv 2022年

作者： Li, Shiqi Xiang, Xiang MoE Key Lab of Image Information Processing Intelligent Control School of Artificial Intelligence and Automation Huazhong University of Science and Technology China

Recent research on human pose estimation exploits complex structures to improve performance on benchmark datasets, ignoring the resource overhead and inference speed when the model is actually deployed. In this paper, we lighten the computation cost and parameters of the deconvolution head network in SimpleBaseline and introduce an attention mechanism that utilizes original, inter-level, and intra-level information to intensify the accuracy. Additionally, we propose a novel loss function called heatmap weighting loss, which generates weights for each pixel on the heatmap that makes the model more focused on keypoints. Experiments demonstrate our method achieves a balance between performance, resource volume, and inference speed. Specifically, our method can achieve 65.3 AP score on COCO test-dev, while the inference speed is 55 FPS and 18 FPS on the mobile GPU and CPU, respectively. Copyright © 2022, The Authors. All rights reserved.

关键词： Benchmarking

来源：评论

学校读者我要写书评

暂无评论

Efficient VLSI architecture for multi-dimensional discrete wavelet transform

Efficient VLSI architecture for multi-dimensional discrete w...

引用

MIPPR 2005: SAR and Multispectral image processing

作者： Xiong, Cheng-Yi Tian, Jin-Wen Liu, Jian College of Electronic Information Engineering South-Center University for Nationalities Wuhan 430074 China Institute of Pattern Recognition and Artificial Intelligence Key Laboratory of Education Ministry for Image Processing and Intelligent Control Huazhong University of Science and Technology Wuhan 430074 China

Efficient VLSI architectures for multi-dimensional (m-D) discrete wavelet transform (DWT), e.g. m=2, 3, are presented, in which the lifting scheme of DWT is used to reduce efficiently hardware complexity. The parallelism of 2 m subbands transforms in lifting-based m-D DWT is explored, which increases efficiently the throughput rate of separable m-D DWT. The proposed architecture is composed of m2m-1 1-D DWT modules working in parallel and pipelined, which is designed to process 2m input samples per clock cycle, and generate 2m subbands coefficients synchronously. The total time of computing one level of decomposition for a 2-D image (3-D image sequence) of size N2 (MN2) is approximately N2/4 (MN2/8) intra- clock cycles (ccs). An efficient line-based architecture framework for both 2D+t and t+2D 3-D DWT is first proposed. Compared with the similar works reported in previous literature, the proposed architecture has good performance in terms of production of computation time and hardware cost. The proposed architecture is simple, regular, scalable and well suited for VLSI implementation.

关键词： VLSI circuits

来源：评论

学校读者我要写书评

暂无评论

A fast VLSI architecture for two-dimensional discrete wavelet transform based on lifting scheme

A fast VLSI architecture for two-dimensional discrete wavele...

引用

2004 7th International Conference on Solid-State and Integrated Circuits Technology Proceedings, ICSICT 2004

作者： Xiong, Chengyi Tian, Jinwen Liu, Jian Institute of Pattern Recognition and Artificial Intelligence Key Laboratory of Eduaction Ministry for Image Processing and Intelligent Control Huazhong University of Science and Technology Wuhan 430074 China College of Electronic Information Engineering South-Center University for Nationalities Wuhan 430074 China

This paper proposes a novel fast architecture for two-dimensional discrete wavelet transform by using lifting scheme. The parallel and embedded decimation techniques are employed to optimize the architecture, which is mainly composed of two horizontal filter modules and one vertical filter module, working in parallel and pipeline fashion with 100% hardware utilization. The architecture is designed to generate two outputs at one working clock cycle, with every two subbands coefficients alternately. The total time of computing J levels of decomposition for N×N image is approximately 2N2(I-4 J)/3 clock cycles. In comparison with the other devices reported in previous literature, the design has many advantages including lower hardware complexity and area and power efficient. The design is also fast, regular and simple, as well as well suited for VLSI implementation. © 2004 IEEE.

关键词： VLSI circuits

来源：评论

学校读者我要写书评

暂无评论

A Comparison of Large-Scale moeAs with Informed Initialization for Voltage Transformer Ratio Error Estimation 1

引用

17th International Conference on Bio-Inspired Computing: Theories and Applications, BIC-TA 2022

作者： Li, Lianghao He, Cheng Li, Hongbin Key Laboratory of Image Information Processing and Intelligent Control of Education Ministry of China School of Artificial Intelligence and Automation Huazhong University of Science and Technology Wuhan430074 China School of Electrical and Electronic Engineering Huazhong University of Science and Technology Wuhan430074 China

ISBN: (数字)9789819915491

ISBN: (纸本)9789819915484

Large-scale multiobjective optimization problems (LSMOPs) exist widely in real-world applications. The large number of decision variables in LSMOP leads to a tremendous high-dimensional search space, which is still challenging for existing multiobjective evolutionary algorithms (moeAs). The voltage transformer ratio error estimation (TREE) problem is a typical LSMOP in real-world applications. A number of large-scale multiobjective evolutionary algorithms (LSmoeAs) have been adopted for solving the TREE problem, but so far there is still considerable potential for improvement in their results. In this paper, we propose a informed initialization for solving the TREE problem. The physical properties of the TREE problem are used to construct an initial set of solutions with specific characteristics. The proposed initialization method is tested against the default initialization method on five TREE problems by being applied on six state-of-the-art LSmoeAs and a classical moeA. The experimental results demonstrate that the initialization method has a significant effect on the performance of LSmoeAs in solving the TREE problems. © 2023, The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.

关键词： Multiobjective optimization

来源：评论

学校读者我要写书评

暂无评论

Consensus-Based Distributed Algorithm for Gep

SSRN

引用

SSRN 2022年

作者： Lv, Kexin He, Fan Huang, Xiaolin Yang, Jie Institute of Image Processing and Pattern Recognition Shanghai Jiao Tong University MOE Key Laboratory of System Control and Information Processing Shanghai200240 China

Generalized eigenvalue problem (GEP) plays a significant role in signal processing and machine learning. This paper proposes a consensus-based distributed algorithm for GEP in multi-agent systems, where data samples are distributively stored across agents. The distributed GEP is reformulated as a consensus optimization, but the presence of its quadratic inseparable constraint makes the considered problem more challenging. To deal with it, a sequential method is proposed combined with the alternating direction method of multipliers, which requires communication between couples of nodes. Theoretical analysis shows the proposed algorithm will converge to the set of stationary solutions. And the numerical experiments on synthetic and real-world datasets validate that the approximated solution is competitive to the ground truth. © 2022, The Authors. All rights reserved.

关键词： Multi agent systems

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：