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

arXiv 2024年

作者： Wu, Xu Hou, XianXu Lai, Zhihui Zhou, Jie Zhang, Ya-Nan Pedrycz, Witold Shen, Linlin The Computer Vision Institute College of Computer Science and Software Engineering Shenzhen University Shenzhen518060 China Shenzhen Institute of Artificial Intelligence and Robotics for Society Shenzhen518060 China Guangdong Key Laboratory of Intelligent Information Processing Shenzhen University Shenzhen518060 China School of AI and Advanced Computing Xi’an Jiaotong-Liverpool University China National Engineering Laboratory for Big Data System Computing Technology Shenzhen University SZU Branch Shenzhen Institute of Artificial Intelligence and Robotics for Society Guangdong Shenzhen518060 China The Department of Electrical & Computer Engineering University of Alberta University of Alberta Canada

Low-light image enhancement (LLIE) aims to improve low-illumination images. However, existing methods face two challenges: (1) uncertainty in restoration from diverse brightness degradations;(2) loss of texture and color information caused by noise suppression and light enhancement. In this paper, we propose a novel enhancement approach, CodeEnhance, by leveraging quantized priors and image refinement to address these challenges. In particular, we reframe LLIE as learning an image-to-code mapping from low-light images to discrete codebook, which has been learned from high-quality images. To enhance this process, a Semantic Embedding Module (SEM) is introduced to integrate semantic information with low-level features, and a Codebook Shift (CS) mechanism, designed to adapt the pre-learned codebook to better suit the distinct characteristics of our low-light dataset. Additionally, we present an Interactive Feature Transformation (IFT) module to refine texture and color information during image reconstruction, allowing for interactive enhancement based on user preferences. Extensive experiments on both real-world and synthetic benchmarks demonstrate that the incorporation of prior knowledge and controllable information transfer significantly enhances LLIE performance in terms of quality and fidelity. The proposed CodeEnhance exhibits superior robustness to various degradations, including uneven illumination, noise, and color distortion. Copyright © 2024, The Authors. All rights reserved.

关键词： Image enhancement

来源：评论

学校读者我要写书评

暂无评论

Systematic Resource Allocation in Cloud RAN with Caching as a Service under Two Timescales

Systematic Resource Allocation in Cloud RAN with Caching as ...

引用

作者： Tang, Jianhua Quek, Tony Q. S. Chang, Tsung-Hui Shim, Byonghyo Hunan Provincial Key Laboratory of Intelligent Computing and Language Information Processing College of Information Science and Engineering Hunan Normal University Changsha410081 China Institute of New Media and Communications Department of Electrical and Computer Engineering Seoul National University Seoul08826 Korea Republic of Information Systems Technology and Design Pillar Singapore University of Technology and Design Singapore487372 Singapore Department of Electronic Engineering Kyung Hee University Yongin17104 Korea Republic of School of Science and Engineering Chinese University of Hong Kong Shenzhen518172 China Shenzhen Research Institute of Big Data Shenzhen518172 China Department of Electrical and Computer Engineering Institute of New Media and Communications Seoul National University Seoul08826 Korea Republic of

Recently, cloud radio access network (C-RAN) with caching as a service (CaaS) was proposed to merge the functionalities of communication, computing, and caching (CCC) together. In this paper, we dissect the interactions of CCC in C-RAN with CaaS from two dimensions: physical resource dimension and time dimension. In the physical resource dimension, we identify how to segment the baseband unit (BBU) pool resources (i.e., computation and storage) into different types of virtual machines (VMs). In the time dimension, we address how the long-term resource segmentation in the BBU pool impacts on the short-term transmit beamforming at the remote radio heads. We formulate the problem as a stochastic mixed-integer nonlinear programming (SMINLP) to minimize the system cost, including the server cost, VM cost and wireless transmission cost. After a series of approximation, including sample average approximation, successive convex approximation, and semidefinite relaxation, the SMINLP is approximated as a global consensus problem. The alternating direction method of multipliers (ADMM) is utilized to obtain the solution in a parallel fashion. Simulation results verify the convergence of our proposed algorithm, and also confirm that the proposed scheme is more cost-saving than that without considering the integration of CCC. © 1972-2012 IEEE.

关键词： Integer programming

来源：评论

学校读者我要写书评

暂无评论

Square Kilometre Array Science Data Challenge 3a: foreground removal for an EoR experiment

arXiv

引用

arXiv 2025年

作者： Bonaldi, A. Hartley, P. Braun, R. Purser, S. Acharya, A. Ahn, K. Aparicio Resco, M. Bait, O. Bianco, M. Chakraborty, A. Chapman, E. Chatterjee, S. Chege, K. Chen, X. Chen, Z. Conaboy, L. Cruz, M. Darriba, L. De Santis, M. Denzel, P. Diao, K. Feron, J. Finlay, C. Gehlot, B. Ghosh, S. Giri, S.K. Grumitt, R. Hong, S.E. Ito, T. Jiang, M. Jordan, C. Kim, S. Kim, M. Kim, J. Krishna, S.P. Kulkarni, A. López-Caniego, M. Labadie-García, I. Lee, H. Lee, D. Lee, N. Line, J. Liu, Y. Mao, Y. Mazumder, A. Mertens, F.G. Munshi, S. Nasirudin, A. Ni, S. Nistane, V. Norregaard, C. Null, D. Offringa, A. Oh, M. Oh, S.-H. Parkinson, D. Pritchard, J. Ruiz-Granda, M. Salvador López, V. Shan, H. Sharma, R. Trott, C. Yoshiura, S. Zhang, L. Zhang, X. Zheng, Q. Zhu, Z. Zuo, S. Akahori, T. Alberto, P. Allys, E. An, T. Anstey, D. Baek, J. Basavraj Brackenhoff, S. Browne, P. Ceccotti, E. Chen, H. Chen, T. Choudhuri, S. Choudhury, M. Coles, J. Cook, J. Cornu, D. Cunnington, S. Das, S. De Lera Acedo, E. Delouis, J.-M. Deng, F. Ding, J. Elahi, K.M.A. Fernandez, P. Fernández, C. Alcázar, A. Fernández Galluzzi, V. Gao, L.-Y. Garain, U. Garrido, J. Gendron-Marsolais, M.-L. Gessey-Jones, T. Ghorbel, H. Gong, Y. Guo, S. Hasegawa, K. Hayashi, T. Herranz, D. Holanda, V. Holloway, A.J. Hothi, I. Höfer, C. Jelić, V. Jiang, Y. Jiang, X. Kang, H. Kim, J.-Y. Koopmans, L.V. Lacroix, R. Lee, E. Leeney, S. Levrier, F. Li, Y. Liu, Y. Ma, Q. Meriot, R. Mesinger, A. Mevius, M. Minoda, T. Miville-Deschenes, M.-A. Moldon, J. Mondal, R. Murmu, C. Murray, S. Nirmala, S.R. Niu, Q. Nunhokee, C. O’Hara, O. Pal, S.K. Pal, S. Park, J. Parra, M. Patra, N.N. Pindor, B. Remazeilles, M. Rey, P. Rubino-Martin, J.A. Saha, S. Selvaraj, A. Semelin, B. Shah, R. Shao, Y. Shaw, A.K. Shi, F. Shimabukuro, H. Singh, G. Sohn, B.W. Stagni, M. Starck, J.-L. Sui, C. Swinbank, J.D. Sánchez, J. SKA Observatory Jodrell Bank Lower Whitington MacclesfieldSK11 9FT United Kingdom Max-Planck Institute for Astrophysics Karl-Schwarzschild-Straße 1 Garching85748 Germany Department of Earth Sciences Chosun University Gwangju61452 Korea Republic of Universidad Europea de Madrid Madrid28670 Spain Observatoire de Sauverny Versoix1290 Switzerland Department of Physics Trottier Space Institute McGill University 3600 rue University MontréalQCH3A 2T8 Canada School of Physics and Astronomy The University of Nottingham University Park NottinghamNG7 2RD United Kingdom Department of Physics and Astronomy University of the Western Cape Cape Town Bellville7535 South Africa Kapteyn Astronomical Institute University of Groningen PO Box 800 Groningen9700 AV Netherlands Research Center for Astronomical Computing Zhejiang Laboratory Hangzhou311121 China National Astronomical Observatories Chinese Academy of Sciences Beijing100101 China Institute for Astronomy The University of Edinburgh Royal Observatory EdinburghEH9 3HJ United Kingdom Avda. de los Castros s/n SantanderE-39005 Spain Glorieta de la Astronomía s/n Granada18008 Spain Saint-Imier Switzerland Centre for Artificial Intelligence ZHAW Zurich University of Applied Sciences Technikumstrasse 71 Winterthur8400 Switzerland Department of Astronomy Tsinghua University Beijing100084 China Département de Physique Théorique Center for Astroparticle Physics Université de Geneve 24 quai Ernest Ansermet Geneve 41211 Switzerland Nordita KTH Royal Institute of Technology Stockholm University Hannes Alfv´ens väg 12 StockholmSE-106 91 Sweden Korea Astronomy and Space Science Institute Daejeon34055 Korea Republic of Astronomy Campus University of Science and Technology Daejeon34055 Korea Republic of Kumamoto University International Research Organization for Advanced Science and Technology 2-39-1 Kurokami Chuo-ku Kumamoto860-8555 Japan National Key Laboratory of Radar Signal Processing

We present and analyse the results of the Science data challenge 3a (SDC3a, https://***/challenges/ foregrounds), an EoR foreground-removal community-wide exercise organised by the Square Kilometre Array Observatory (SKAO). The challenge ran for 8 months, from March to October 2023. Participants were provided with realistic simulations of SKA-Low data between 106 MHz and 196 MHz, including foreground contamination from extragalactic as well as Galactic emission, instrumental and systematic effects. They were asked to deliver cylindrical power spectra of the EoR signal, cleaned from all corruptions, and the corresponding confidence levels. Here we describe the approaches taken by the 17 teams that completed the challenge, and we assess their performance using different metrics. The challenge results provide a positive outlook on the capabilities of current foreground-mitigation approaches to recover the faint EoR signal from SKA-Low observations. The median error committed in the EoR power spectrum recovery is below the true signal for seven teams, although in some cases there are some significant outliers. The smallest residual overall is 4.2+−204.2 × 10−4 K2h−3cMpc3 across all considered scales and frequencies. The estimation of confidence levels provided by the teams is overall less accurate, with the true error being typically underestimated, sometimes very significantly. The most accurate error bars account for 60 ± 20% of the true errors committed. The challenge results provide a means for all teams to understand and improve their performance. This challenge indicates that the comparison between independent pipelines could be a powerful tool to assess residual biases and improve error estimation. © 2025, CC BY.

关键词： Cosmology

来源：评论

学校读者我要写书评

暂无评论

A New Logistic Map Based Chaotic Biogeography-based Optimization Approach for Cluster Analysis

A New Logistic Map Based Chaotic Biogeography-based Optimiza...

引用

2016 IEEE International Conference on Progress in Informatics and computing

作者： Shui-Hua Wang Hui-Min Lu Yu-Jie Li Yang Wang Zhi-Min Chen Yu-Min Wei Wen-Juan Jia Fang-Yuan Liu Yu-Dong Zhang School of Computer Science and Technology Nanjing Normal University Hunan Provincial Key Laboratory of Network Investigational Technology Hunan Policy Academy Department of Electrical Engineering The city college of New YorkCUNY Department of Mechanical and Control Engineering Kyushu Institute of Technology School of Information Engineering Yangzhou University School of Physics and Electronic Engineering Taizhou University School of Electronic Information Shanghai Dianji University School of Energy and Mechanical Engineering Nanjing Normal University Key Laboratory of Intelligent Computing and Information Processing in Fujian Provincial University Quanzhou Normal University

Cluster analysis is important in scientific and industrial fields. In this study, we proposed a novel chaotic biogeography-based optimization(CBBO) method, and applied it in centroid-based clustering methods. The results over three types of simulation data showed that this proposed CBBO method gave better performance than chaotic particle swarm optimization, genetic algorithm, firefly algorithm, and quantum-behaved particle swarm optimization. In all, our CBBO method is effective in centroid-based clustering.

关键词： chaotic biogeography-based optimization cluster analysis centroid-based clustering simulation particle swarm optimization

来源：评论

学校读者我要写书评

暂无评论

GenFace: A Large-Scale Fine-Grained Face Forgery Benchmark and Cross Appearance-Edge Learning

arXiv

引用

arXiv 2024年

作者： Zhang, Yaning Yu, Zitong Wang, Tianyi Huang, Xiaobin Shen, Linlin Gao, Zan Ren, Jianfeng Computer Vision Institute College of Computer Science and Software Engineering Shenzhen University Shenzhen518060 China School of Computing and Information Technology Great Bay University Dongguan523000 China National Engineering Laboratory for Big Data System Computing Technology Shenzhen University Shenzhen518060 China Nanyang Technological University 50 Nanyang Ave Block N 4 639798 Singapore Shenzhen Institute of Artificial Intelligence and Robotics for Society Shenzhen518129 China Guangdong Key Laboratory of Intelligent Information Processing Shenzhen University China Jinan250014 China Key Laboratory of Computer Vision and System Ministry of Education Tianjin University of Technology Tianjin300384 China School of Computer Science University of Nottingham Ningbo China

The rapid advancement of photorealistic generators has reached a critical juncture where the discrepancy between authentic and manipulated images is increasingly indistinguishable. Thus, benchmarking and advancing techniques detecting digital manipulation become an urgent issue. Although there have been a number of publicly available face forgery datasets, the forgery faces are mostly generated using GAN-based synthesis technology, which does not involve the most recent technologies like diffusion. The diversity and quality of images generated by diffusion models have been significantly improved and thus a much more challenging face forgery dataset shall be used to evaluate SOTA forgery detection literature. In this paper, we propose a large-scale, diverse, and fine-grained high-fidelity dataset, namely GenFace, to facilitate the advancement of deepfake detection, which contains a large number of forgery faces generated by advanced generators such as the diffusion-based model and more detailed labels about the manipulation approaches and adopted generators. In addition to evaluating SOTA approaches on our benchmark, we design an innovative Cross Appearance-Edge Learning (CAEL) detector to capture multi-grained appearance and edge global representations, and detect discriminative and general forgery traces. Moreover, we devise an Appearance-Edge Cross-Attention (AECA) module to explore the various integrations across two domains. Extensive experiment results and visualizations show that our detection model outperforms the state of the arts on different settings like cross-generator, cross-forgery, and cross-dataset evaluations. Code and datasets will be available at https://***/Jenine-321/GenFace. Copyright © 2024, The Authors. All rights reserved.

关键词： Image enhancement

来源：评论

学校读者我要写书评

暂无评论

Author Correction: Full reconstruction of simplicial complexes from binary contagion and Ising data

引用

Nature communications 2022年第1期13卷 3692页

作者： Huan Wang Chuang Ma Han-Shuang Chen Ying-Cheng Lai Hai-Feng Zhang The Key Laboratory of Intelligent Computing and Signal Processing of Ministry of Education School of Mathematical Science Anhui University Hefei 230601 China. School of Internet Anhui University Hefei 230601 China. School of Physics and Material Science Anhui University Hefei 230601 China. School of Electrical Computer and Energy Engineering Arizona State University Tempe AZ 85287 USA. The Key Laboratory of Intelligent Computing and Signal Processing of Ministry of Education School of Mathematical Science Anhui University Hefei 230601 China. haifengzhang1978@***.

来源：评论

学校读者我要写书评

暂无评论

Nitrogen vertical distribution by canopy reflectance spectrum in winter wheat

引用

IOP Conference Series: Earth and Environmental Science 2014年第1期17卷

作者： W J Huang Q Y Yang D L Peng L S Huang D Y Zhang G J Yang Key Laboratory of Digital Earth Science Institute of Remote Sensing and Digital Earth Chinese Academy of Sciences Beijing 100094 China Key Laboratory of Intelligent Computing & Signal Processing Ministry of Education Anhui University Hefei 230039 Anhui China Beijing Agriculture Information Technology Research Center Beijing 100097 China

Nitrogen is a key factor for plant photosynthesis, ecosystem productivity and leaf respiration. Under the condition of nitrogen deficiency, the crop shows the nitrogen deficiency symptoms in the bottom leaves, while excessive nitrogen will affect the upper layer leaves first. Thus, timely measurement of vertical distribution of foliage nitrogen content is critical for growth diagnosis, crop management and reducing environmental impact. This study presents a method using bi-directional reflectance difference function (BRDF) data to invert foliage nitrogen vertical distribution. We developed upper-layer nitrogen inversion index (ULNI), middle-layer nitrogen inversion index (MLNI) and bottom-layer nitrogen inversion index (BLNI) to reflect foliage nitrogen inversion at upper layer, middle layer and bottom layer, respectively. Both ULNI and MLNI were made by the value of the ratio of Modified Chlorophyll Absorption Ration Index to the second Modified Triangular Vegetation Index (MCARI/MTVI2) referred to as canopy nitrogen inversion index (CNII) in this study at ±40° and ±50°, and at ±30° and ±40° view angles, respectively. The BLNI was composed by the value of nitrogen reflectance index (NRI) at ±20° and ±30° view angles. These results suggest that it is feasible to measure foliage nitrogen vertical-layer distribution in a large scale by remote sensing.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Distributed resource scheduling for large-scale MEC systems: A multi-agent ensemble deep reinforcement learning with imitation acceleration

arXiv

引用

arXiv 2020年

作者： Jiang, Feibo Dong, Li Wang, Kezhi Yang, Kun Pan, Cunhua Hunan Provincial Key Laboratory of Intelligent Computing and Language Information Processing Hunan Normal University Changsha China Key Laboratory of Hunan Province for New Retail Virtual Reality Technology Hunan University of Commerce Changsha China Department of Computer and Information Sciences Northumbria University United Kingdom School of Computer Sciences and Electrical Engineering University of Essex ColchesterCO4 3SQ United Kingdom School of Electronic Engineering and Computer Science Queen Mary University of London LondonE1 4NS United Kingdom

We consider the optimization of distributed resource scheduling to minimize the sum of task latency and energy consumption for all the Internet of things devices (IoTDs) in a large-scale mobile edge computing (MEC) system. To address this problem, we propose a distributed intelligent resource scheduling (DIRS) framework, which includes centralized training relying on the global information and distributed decision making by each agent deployed in each MEC server. More specifically, we first introduce a novel multi-agent ensemble-assisted distributed deep reinforcement learning (DRL) architecture, which can simplify the overall neural network structure of each agent by partitioning the state space and also improve the performance of a single agent by combining decisions of all the agents. Secondly, we apply action refinement to enhance the exploration ability of the proposed DIRS framework, where the near-optimal state-action pairs are obtained by a novel Lvy flight search. Finally, an imitation acceleration scheme is presented to pre-train all the agents, which can significantly accelerate the learning process of the proposed framework through learning the professional experience from a small amount of demonstration data. Extensive simulations are conducted to demonstrate that the proposed DIRS framework is efficient and outperforms the existing benchmark schemes. Copyright © 2020, The Authors. All rights reserved.

关键词： Deep learning

来源：评论

学校读者我要写书评

暂无评论

Balancing Exploration and Exploitation for Solving Large-scale Multiobjective Optimization via Attention Mechanism

arXiv

引用

arXiv 2022年

作者： Hong, Haokai Jiang, Min Feng, Liang Lin, Qiuzhen Tan, Kay Chen School of Informatics Xiamen University Fujian China College of Computer Science Chongqing University Chongqing China College of Computer Science and Software Engineering Shenzhen University Guangdong China Department of Computing The Hong Kong Polytechnic University Hong Kong The Department of Artificial Intelligence Key Laboratory of Digital Protection and Intelligent Processing of Intangible Cultural Heritage of Fujian and Taiwan Ministry of Culture and Tourism School of Informatics Xiamen University Fujian361005 China

Large-scale multiobjective optimization problems (LSMOPs) refer to optimization problems with multiple conflicting optimization objectives and hundreds or even thousands of decision variables. A key point in solving LSMOPs is how to balance exploration and exploitation so that the algorithm can search in a huge decision space efficiently. Large-scale multiobjective evolutionary algorithms consider the balance between exploration and exploitation from the individual's perspective. However, these algorithms ignore the significance of tackling this issue from the perspective of decision variables, which makes the algorithm lack the ability to search from different dimensions and limits the performance of the algorithm. In this paper, we propose a large-scale multiobjective optimization algorithm based on the attention mechanism, called (LMOAM). The attention mechanism will assign a unique weight to each decision variable, and LMOAM will use this weight to strike a balance between exploration and exploitation from the decision variable level. Nine different sets of LSMOP benchmarks are conducted to verify the algorithm proposed in this paper, and the experimental results validate the effectiveness of our design. Copyright © 2022, The Authors. All rights reserved.

关键词： Multiobjective optimization

来源：评论

学校读者我要写书评

暂无评论

PubLabeler: Enhancing Automatic Classification of Publications in UniProtKB Using Protein Textual Description and PubMedBERT

引用

IEEE Journal of Biomedical and Health Informatics 2024年第5期29卷 3782-3791页

作者： Shaojun Wang Junyi Bian Xiaodi Huang Hong Zhou Shanfeng Zhu Institute of Science and Technology for Brain-Inspired Intelligence Fudan University Shanghai China School of Computer Science Fudan University Shanghai China School of Computing Mathematics and Engineering Charles Sturt University Albury NSW Australia Atypon Systems LLC Oxford U.K. Institute of Science and Technology for Brain-Inspired Intelligence and MOE Frontiers Center for Brain Science Fudan University Shanghai China Key Laboratory of Computational Neuroscience and Brain-Inspired Intelligence Fudan University Ministry of Education Shanghai China Shanghai Key Laboratory of Intelligent Information Processing Shanghai Institute of Artificial Intelligence Algorithm Fudan University Shanghai China Zhangjiang Fudan International Innovation Center Fudan University Shanghai China

In UniProtKB, each protein is linked to numerous publications covering topics such as sequence, function, and structure, which are annotated manually or through automated methods. Given the vast number of proteins and literature, manual annotation is time-consuming and labour-intensive. Although UniProtKB offers automated annotations, their quality often falls short. Therefore, developing an accurate automated classifier to identify the topics of publications associated with each protein is imperative for advancing biomedical knowledge discovery. Classifying publications in UniProtKB involves protein-publication pairs characterized by multi-label, label co-occurrence, and class imbalance, which increases complexity. This paper proposes a novel method called PubLabeler, which simultaneously considers protein description and scientific literature texts as input. PubLabeler employs the PubMedBERT model to encode input texts and integrates label co-occurrence information into the model parameters. Additionally, it uses focal loss to update parameters, allowing the model to focus more on classes with a few instances. Using newly annotated literature from Swiss-Prot in 2023 as a test set, PubLabeler achieved superior results in both micro and macro metrics, showing a 28.5% improvement in macro-F1 compared to UniProtKB's automated annotation method, UPCLASS. Furthermore, we validated PubLabeler's effectiveness in TrEMBL annotation, showcasing its comprehensive prediction results compared to TrEMBL's automated annotations. These findings highlight PubLabeler's reliability and potential to advance protein-related information extraction and knowledge discovery.

关键词： Proteins Protein engineering Annotations Bioinformatics Training Manuals Biological system modeling Text categorization Predictive models Pipelines

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：