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

第34届中国控制与决策会议

作者： Xu Mengbin Wei Dong Zhao Ke School of Electrical and Information Engineering Beijing University of Civil Engineering and Architecture Beijing Municipal Science and Technology Commission Key Laboratory of Intelligent Processing for Building Big Data Beijing Xicheng District Special Equipment Inspection Institute

In view of the problem that it is dithcult to establish the mathematical model of elevator group control system and the optimization effect of traditional control method is not ideal,a group control model based on fuzzy control is ***,we analyze the basic principle of elevator group control system,then we elaborate the algorithm flow of elevator group control system scheduling optimization,and finally,we verify the algorithm in the simulation platform based on Visual Studio,and the simulation results show that fuzzy control can effectively solve the scheduling optimization problem of elevator group control system.

关键词： Elevator group control system Fuzzy control Scheduling optimization evaluation function

来源：评论

学校读者我要写书评

暂无评论

Interpretable Visual Reasoning via Probabilistic Formulation Under Natural Supervision 16th

Interpretable Visual Reasoning via Probabilistic Formulation...

引用

16th European Conference on Computer Vision, ECCV 2020

作者： Han, Xinzhe Wang, Shuhui Su, Chi Zhang, Weigang Huang, Qingming Tian, Qi University of Chinese Academy of Sciences Beijing China Key Laboratory of Intelligent Information Processing Institute of Computing Technology CAS Beijing China Kingsoft Cloud Beijing China Harbin Institute of Technology Weihai China Peng Cheng Laboratory Shenzhen China Shenzhen University Shenzhen China

ISBN: (纸本)9783030585440

Visual reasoning is crucial for visual question answering (VQA). However, without labelled programs, implicit reasoning under natural supervision is still quite challenging and previous models are hard to interpret. In this paper, we rethink implicit reasoning process in VQA, and propose a new formulation which maximizes the log-likelihood of joint distribution for the observed question and predicted answer. Accordingly, we derive a Temporal Reasoning Network (TRN) framework which models the implicit reasoning process as sequential planning in latent space. Our model is interpretable on both model design in probabilist and reasoning process via visualization. We experimentally demonstrate that TRN can support implicit reasoning across various datasets. The experimental results of our model are competitive to existing implicit reasoning models and surpass baseline by a large margin on complicated reasoning tasks without extra computation cost in forward stage. © 2020, Springer Nature Switzerland AG.

关键词： Machine learning

来源：评论

学校读者我要写书评

暂无评论

Architecture and key Technologies of Parallel Dispatching System for Railway Technical Operation Stations

Architecture and Key Technologies of Parallel Dispatching Sy...

引用

2023 International Annual Conference on Complex Systems and intelligent Science, CSIS-IAC 2023

作者： Xiong, Gang Yang, Donghu Xu, Wei Li, Runmei Chen, Shichao Song, Bing Dong, Xisong Zhu, Fenghua Institute of Automation Chinese Academy of Sciences State Key Laboratory of Multimodal Artificial Intelligence Systems Beijing100190 China Institute of Automation Chinese Academy of Sciences Beijing Engineering Research Center of Intelligent Systems and Technology Beijing100190 China School of Artificial Intelligence University of Chinese Academy of Sciences Beijing100049 China Signal and Communication Research Institute China Academy of Railway Science Corporation Limited Beijing100081 China The School of Electronic and Information Engineering Beijing Jiaotong University Beijing100081 China Beijing Huairou Academy of Parallel Sensing Beijing101400 China Chinese Academy of Sciences Guangdong Engineering Research Center of 3D Printing and Intelligent Manufacturing Cloud Computing Center Dongguan523808 China

ISBN: (纸本)9798350309003

A railroad technical operation station is an extensive and complex operation system and a variety of random disturbing factors further increase the complexity of its command and dispatching. To enhance the railroad technical operation stations' intelligence, and integration level, and enhance its dispatching management ability of complex operation plans, based on the ACP approach, this paper designs the parallel dispatching system (PDS) architecture, and describes its key technologies including the artificial dispatching system (ADS), computing experiments, parallel execution, etc. On the basis of the artificial dispatching system, computational experiments can optimize various types of technical operations and the overall operational process, to achieve parallel execution between the actual dispatching system and ADS. PDS can provide more efficient and intelligent command and dispatching solutions for railroad technical work stations, and promote the development of the railroad transportation industry in the direction of higher quality and efficiency. © 2023 IEEE.

关键词： Railroads

来源：评论

学校读者我要写书评

暂无评论

Deep Learning Strategies for Addressing Anomalous Exposure in Image processing: The FARDBUNet Approach 5

Deep Learning Strategies for Addressing Anomalous Exposure i...

引用

5th International Conference on High Performance Big Data and intelligent Systems, HDIS 2023

作者： Zhou, Qi Yang, Kai Ke, Zunwang Wang, Gang Zhang, Yugui Jia, Yizhen Cao, Fengcai Ma, Junxiao Liu, Changlin Zhang, Kaijie Wu, Min School of Semiconductor Science and Technology South China Normal University GuangZhou510631 China CGNPC Uranium Industry Development Co. Ltd. Beijing100020 China School of Software Xinjiang University Urumqi830046 China School of Computing and Data Engineering NingboTech University Ningbo315100 China AnnLab Institute of Semiconductors Chinese Academy of Sciences Beijing100083 China Beijing Key Laboratory of Semiconductor Neural Network Intelligent Sensing and Computing Technology Beijing100083 China School of Integrated Circuits University of Chinese Academy of Sciences Beijing100049 China Co. Ltd Beijing100176 China School of Information Beijing Forestry University Beijing100083 China

ISBN: (纸本)9798350394160

In real-world scenarios, capturing scenes with excessive dynamic range often leads to the partial loss of highlight or dark area information due to irradiance variations and limitations in the capture capabilities of imaging devices caused by their size and material constraints. This phenomenon gives rise to anomalous exposure problems and triggers the loss of crucial initial details, thereby becoming a significant obstacle to achieving high image quality. Despite numerous researchers’ integration of exposure compensation techniques into the imaging process, the anomalous exposure problem remains unsolved, hindering progress in image processing. Consequently, considerable research is valuable in implementing exposure calibration techniques on visual perception and multimedia devices. This dissertation proposes FARDBUNet, a novel end-to-end exposure calibration model designed to address the anomalous exposure problem. A key innovation of FARDBUNet is the incorporation of a fused attention mechanism, enabling the model to prioritize regions needing enhanced correction while accounting for the global exposure characteristics of the image. Additionally, to tackle the challenge of inadequate information availability in the localized areas due to exposure issues, we introduce an atrous residual dense block that efficiently captures local information by expanding the receptive field. Comprehensive tests validate the effectiveness of our suggested model, which performs on par with leading techniques on expansive exposure datasets. ©2023 IEEE.

关键词： Image enhancement

来源：评论

学校读者我要写书评

暂无评论

Self-supervised Cross-view Representation Reconstruction for Change Captioning

arXiv

引用

arXiv 2023年

作者： Tu, Yunbin Li, Liang Su, Li Zha, Zheng-Jun Yan, Chenggang Huang, Qingming University of Chinese Academy of Sciences Beijing China Key Lab of Intelligent Information Processing ICT CAS Beijing China Peng Cheng Laboratory Shenzhen China University of Science and Technology of China Hefei China Hangzhou Dianzi University Hangzhou China Lishui Institute of Hangzhou Dianzi University Hangzhou China

Change captioning aims to describe the difference between a pair of similar images. Its key challenge is how to learn a stable difference representation under pseudo changes caused by viewpoint change. In this paper, we address this by proposing a self-supervised cross-view representation reconstruction (SCORER) network. Concretely, we first design a multi-head token-wise matching to model relationships between cross-view features from similar/dissimilar images. Then, by maximizing cross-view contrastive alignment of two similar images, SCORER learns two view-invariant image representations in a self-supervised way. Based on these, we reconstruct the representations of unchanged objects by cross-attention, thus learning a stable difference representation for caption generation. Further, we devise a cross-modal backward reasoning to improve the quality of caption. This module reversely models a "hallucination" representation with the caption and "before" representation. By pushing it closer to the "after" representation, we enforce the caption to be informative about the difference in a self-supervised manner. Extensive experiments show our method achieves the state-of-the-art results on four datasets. The code is available at https://***/tuyunbin/SCORER. © 2023, CC BY.

关键词： Image representation

来源：评论

学校读者我要写书评

暂无评论

Larger receptive Field and Context information for Pose estimation:Larger Gaussian kernel 5

Larger receptive Field and Context Information for Pose esti...

引用

5th International Conference on High Performance Big Data and intelligent Systems, HDIS 2023

作者： Ma, Junxiao Yang, Kai Ke, Zunwang Wang, Gang Zhang, Yugui Cao, Fengcai Zhou, Qi Fei, Yang School of Information Beijing Forestry University Beijing100083 China CGNPC Uranium Industry Development Co. Ltd. Beijing100020 China School of Software Xinjiang University Urumqi830046 China School of Computing and Data Engineering NingboTech University Ningbo315100 China AnnLab Institute of Semiconductors Chinese Academy of Sciences Beijing100083 China Beijing Key Laboratory of Semiconductor Neural Network Intelligent Sensing and Computing Technology Beijing100083 China School of Integrated Circuits University of Chinese Academy of Sciences Beijing100049 China Co. Ltd Beijing100176 China School of Semiconductor Science and Technology South China Normal University GuangZhou510631 China

ISBN: (纸本)9798350394160

The field of pose estimation has a wide range of application prospects in various industries in the current era. With the continuous development of deep learning techniques, the effects in the field of human pose estimation are constantly being optimized. However, due to the influence of factors such as occlusion and human posture variability, it is easy to lead to inaccurate identification of keypoints and even keypoints’ missing and matching errors, there is still a lot of optimization space for the effect of pose estimation. In this paper, we propose an improvement to generate heatmaps in the training process: increase the radius of the Gaussian kernel and adjust the smoothness of Gaussian distribution to get a larger receptive field, encourage the model to use more context information in prediction, and control other parameters unchanged on the premise of using heatmap regression. Improve keypoint detection performance by optimizing this item. In the experiment, for the COCO-keypoint data set, we selected different methods published in recent years, and after our improvement, we obtained better accuracy and performance than the original method, which proves the validity of our method. ©2023 IEEE.

关键词： Gaussian distribution

来源：评论

学校读者我要写书评

暂无评论

MDPPC: Efficient Scalable Multiparty Delegated PSI and PSI Cardinality

MDPPC: Efficient Scalable Multiparty Delegated PSI and PSI C...

引用

Annual Conference on Privacy, Security and Trust, PST

作者： Yihao Yang Xiaolei Dong Jiachen Shen Zhenfu Cao Yunbo Yang Jun Zhou Liming Fang Zhe Liu Chunpeng Ge Chunhua Su Zongyang Hou Shanghai Key Laboratory of Trustworthy Computing East China Normal University Shanghai China Research Center for Basic Theories of Intelligent Computing Research Institute of Basic Theories Zhejiang Lab Hangzhou China College of Computer Science and Technology Nanjing University of Aeronautics and Astronautics Nanjing China Science and Technology on Parallel and Distributed Processing Laboratory (PDL) Changsha China Shandong University Jinan China University of Aizu Fukushima Japan Print-Rite Technology Development Co. Ltd. Of Zhuhai China

Private Set Intersection (PSI) is one of the most important functions in secure multiparty computation (MPC). PSI protocols have been a practical cryptographic primitive and there are many privacy-preserving applications based on PSI protocols such as computing conversion of advertising and distributed computation. Private Set Intersection Cardinality (PSI-CA) is a useful variant of PSI protocol. PSI and PSI-CA allow several parties, each holding a private set, to jointly compute the intersection and cardinality, respectively without leaking any additional information. Nowadays, most PSI protocols mainly focus on two-party settings, while in multiparty settings, parties are able to share more valuable information and thus more desirable. On the other hand, with the advent of cloud computing, delegating computation to an untrusted server becomes an interesting problem. However, most existing delegated PSI protocols are unable to efficiently scale to multiple clients. In order to solve these problems, this paper proposes MDPPC, an efficient PSI protocol which supports scalable multiparty delegated PSI and PSI-CA operations. Security analysis shows that MDPPC is secure against semi-honest adversaries and it allows any number of colluding clients. For 15 parties with set size of 2 20 on server side and 2 16 on clients side, MDPPC costs only 81 seconds in PSI and 80 seconds in PSI-CA, respectively. The experimental results show that MDPPC has high scalability.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Interactive Prototype Learning and Self-Learning for Few-Shot Medical Image Segmentation

SSRN

引用

SSRN 2024年

作者： Song, Yuhui Xu, Chenchu Wang, Boyan Du, Xiuquan Chen, Jie Zhang, Yanping Li, Shuo School of Computer Science and Technology Anhui University Hefei230601 China Key Laboratory of Intelligent Computing and Signal Processing of Ministry of Education Anhui University Hefei230601 China Institute of Artificial Intelligence Hefei Comprehensive National Science Center Hefei230051 China Department of Computer Science and Technology Tsinghua University Beijing100084 China School of Engineering Case Western Reserve University Cleveland44106 United States

Few-shot learning alleviates the heavy dependence of medical image segmentation tasks on large-scale labeled data, but it shows a strong performance gap when dealing with new targets and new tasks compared with traditional deep learning. Existing few-shot medical image segmentation models mainly realize segmentation by learning the semantic class knowledge of a few known (support) samples and extending it to unknown (query) samples. However, the neglect of the differences between known and unknown samples leads to a certain deviation in the transfer of class knowledge, and the trained model tends to overfit the class knowledge of training classes, which greatly reduces the segmentation and generalization performance of few-shot model. In this work, we propose an interactive prototype learning and self-learning network to alleviate the above problems. Specifically, we propose an interactive prototype learning network to promote feature consistency between support images and query images to improve the accuracy of prototype metric learning. In addition, to avoid overfitting the training class knowledge and reduce the over-dependence of query segmentation on the class knowledge, we introduce a query features-guided self-learning network to achieve the finer segmentation of query images through its rich feature information. Our model obtained the competitive segmentation results on three multi-organ and multi-modal public datasets that show a substantial improvement in generalization ability. © 2024, The Authors. All rights reserved.

关键词： Zero-shot learning

来源：评论

学校读者我要写书评

暂无评论

Selection of Cancer Biomarkers from Microarray Gene Expression Data Utilizing the Bi-Objective Optimization Method

Selection of Cancer Biomarkers from Microarray Gene Expressi...

引用

IEEE International Conference on Bioinformatics and Biomedicine (BIBM)

作者： Hanjing Jiang Jianqing Lin Huachao Zhu Yabing Huang Key Laboratory of Image Information Processing and Intelligent Control of Education Ministry of China Institute of Artificial Intelligence School of Artificial Intelligence and Automation Huazhong University of Science and Technology Wuhan China School of Computer Science Wuhan University Wuhan China Department of Pathology Renmin Hospital of Wuhan University Wuhan China

Cancer-associated biomarker genes play an indispensable role in the intricate tapestry of cancer development and manifestation. The expression of biomarkers in different types of tumor cells has beneficial implications for shedding light on the development of various cancers, guiding clinical diagnosis, and treatment. Microarray technology enables the expression levels of thousands of genes in samples to be sequenced simultaneously. However, sparse and high-dimensional microarray data present a formidable challenge in identifying biomarker genes. This study presents EREF-NSGA2, a novel method for cancer biomarker selection from microarray data, employing a hybrid gene selection approach. Firstly, the combination of the wrapper and embedded gene selection methods is proposed to filter the microarray data, which efficiently decreases the search space of the algorithm. After that, the improved NSGA-II algorithm is used to search the genes subset obtained from the previous step to reach the optimal subset of cancer biomarker genes. The proposed EREF-NSGA2 is compared with other reported methods on six cancer benchmark gene expression datasets. A detailed biological analysis is performed to analyze the relationship between the selected genes and the cancer data sets they belong to. To summarize, EREF-NSGA2 proves its effectiveness in selecting a feature subset comprising the fewest genes while maintaining the highest classification accuracy.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Characterization and construction of optimal binary linear codes with one-dimensional hull

arXiv

引用

arXiv 2022年

作者： Li, Shitao Shi, Minjia Kim, Jon-Lark The School of Mathematical Sciences Anhui University Hefei230601 China The Key Laboratory of Intelligent Computing and Signal Processing Ministry of Education The School of Mathematical Sciences Anhui University Hefei230601 China State Key Laboratory of Information Security Institute of Information Engineering Chinese Academy of Sciences Beijing100093 China The Department of Mathematics Sogang University Seoul Korea Republic of

The hull of a linear code over finite fields is the intersection of the code and its dual, and linear codes with small hulls have applications in computational complexity and information protection. Linear codes with the smallest hull are LCD codes, which have been widely studied. Recently, several papers were devoted to related LCD codes over finite fields with size greater than 3 to linear codes with one-dimensional or higher dimensional hull. Therefore, an interesting and non-trivial problem is to study binary linear codes with one-dimensional hull with connection to binary LCD codes. The objective of this paper is to study some properties of binary linear codes with one-dimensional hull, and establish their relation with binary LCD codes. Some interesting inequalities are thus obtained. Using such a characterization, we study the largest minimum distance done(n, k) among all binary linear [n, k] codes with one-dimensional hull. We determine the largest minimum distances done(n, n − k) for k ≤ 5 and done(n, k) for k ≤ 4 or 14 ≤ n ≤ 24. We partially determine the exact value of done(n, k) for k = 5 or 25 ≤ n ≤ *** Codes 94B05, 15B05, 12E10 Copyright © 2022, The Authors. All rights reserved.

关键词： Optimal systems

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：