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

IEEE International Conference on Web services (ICWS)

作者： Yi Liu Jianxun Liu Xiangping Zhang Haize Hu Hunan Provincial Key Laboratory for Services Computing and Novel Software Technology Hunan University of Science and Technology Xiangtan China School of Informationn Hunan University of Humanities Science and Technology Loudi China School of Computer Science and Engineering Hunan University of Science and Technology Xiangtan China

Code completion, which can accelerate the software development process and improve the quality of software products, is an essential part of today’s integrated development environments. It has become an important research topic in the field of software engineering. Recent studies have shown that the method of code completion based on the Abstract Syntax Tree (AST) learns syntactic information about the code, which helps to improve the accuracy of code completion. However, when modeling neural networks for ASTs, the sequencing operation of nodes leads to the loss of their hierarchical structure information. Meanwhile, traditional neural networks cannot predict many Out-of-Vocabulary (OoV) words in the terminal node values of AST. To alleviate the above problem, in this paper, we propose a Multiple-Path Learning neural network model for code completion (MPL) based on an AST by learning from a large-scale corpus. In this model, multiple paths such as context path, root path, and terminal node path are established to understand different code features required for node prediction and improve code representation ability. Based on the principle of program local repeatability, it also adopts a replication mechanism to copy the appropriate OoV words from the local terminal node path as the prediction result, further improving the prediction accuracy. The experimental results show that the MPL model has better performance than existing methods on the code completion task.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A Kind of new parallax algorithm based on symmetric continuous optimization 5

A Kind of new parallax algorithm based on symmetric continuo...

引用

2020 5th International Seminar on Computer technology, Mechanical and Electrical Engineering, ISCME 2020

作者： Jiang, Kaiwen Zhang, Degan Xu, Haixia Key Laboratory of Computer Vision and System Tianjin University of Technology Ministry of Education 300384 China Tianjin Key Lab of Intelligent Computing and Novel Software Technology Tianjin University of Technology Tianjin China School of Electronic and Information Engineering Tianjin Vocational Institute Tianjin300410 China

With the fast development of 3D imaginations becomes more and more fascination, multi-view stereo based 3D reconstruction is a significant technique for those application. To facilitate the subsequent processing of 3D reconstruction and reduce the possibility of other algorithms falling into local optimal solutions, attempting to get better and faster performance, a new parallax calculation based on symmetric continuous optimization is proposed in this paper. The algorithm is proposed here will be tested respectively in the same data, in order to certificate the algorithm applied is better than traditional minimize El algorithm. © Published under licence by IOP Publishing Ltd.

关键词： Optimization

来源：评论

学校读者我要写书评

暂无评论

Robust Imagined Speech Production Using AI-Generated Content Network for Patients with Language Impairments

引用

IEEE Transactions on Consumer Electronics 2024年

作者： Xu, Xu Fu, Chong Dalian University of Technology School of Software Dalian116621 China Northeastern University School of Computer Science and Engineering Shenyang110004 China Northeastern University Key Laboratory of Intelligent Computing in Medical Image Ministry of Education Shenyang110819 China Ministry of Education Engineering Research Center of Security Technology of Complex Network System Shenyang110004 China

Imagined speech production is critical for brain-computer interface systems. It is able to provide the communication ability for patients with language impairments. Nowadays, many studies have developed algorithms for this purpose. However, they often struggle with an issue that is the noise in physiological signals from various devices. This makes current methods have low robustness when performing speech generation. To this end, we propose a framework to robustly producing imagined speech for patients with language impairments. It is based on artificial intelligent-generated content (AIGC). In specific, this work develops a diffusion model to remove noise from brain signals, which are then converted and normalized into log-mel spectrograms. Next, the product feeds into a transformer-based model to extract local and global features. Finally, these enhanced features are inputted into full connected layers to generate the imagined speech. The effectiveness of our model is validated using the high-quality, i.e., single-word-production-Dutch-iBIDS dataset. It achieves Pearson correlation scores above 0.8 and standard deviations below 0.2 across different volunteers. Experimental results well demonstrate that our model is robust and has advantages over peer methods. © 2024 IEEE.

关键词： Deep learning

来源：评论

学校读者我要写书评

暂无评论

A deep learning system for predicting time to progression of diabetic retinopathy

引用

NATURE MEDICINE 2024年第2期30卷 358-359页

作者： [Anonymous] Shanghai Belt and Road International Joint Laboratory for Intelligent Prevention and Treatment of Metabolic Disorders Department of Computer Science and Engineering School of Electronic Information and Electrical Engineering Shanghai Jiao Tong University Department of Endocrinology and Metabolism Shanghai Sixth People’s Hospital Affiliated to Shanghai Jiao Tong University School of Medicine Shanghai Diabetes Institute Shanghai Clinical Center for Diabetes Shanghai China MOE Key Laboratory of AI School of Electronic Information and Electrical Engineering Shanghai Jiao Tong University Shanghai China Department of Ophthalmology Huadong Sanatorium Wuxi China Department of Ophthalmology Shanghai Sixth People’s Hospital Affiliated to Shanghai Jiao Tong University School of Medicine Shanghai China Department of Ophthalmology and Visual Sciences The Chinese University of Hong Kong Hong Kong China Singapore Eye Research Institute Singapore National Eye Centre Singapore Singapore Department of Computer Science and Engineering The Hong Kong University of Science and Technology Hong Kong China Department of Chemical and Biological Engineering The Hong Kong University of Science and Technology Hong Kong China State Key Laboratory of Ophthalmology Zhongshan Ophthalmic Center Sun Yat-sen University Guangdong Provincial Key Laboratory of Ophthalmology and Visual Science Guangzhou China Department of Ophthalmology Peking Union Medical College Hospital Peking Union Medical College Chinese Academy of Medical Sciences Beijing China Medical Records and Statistics Office Shanghai Sixth People’s Hospital Affiliated to Shanghai Jiao Tong University School of Medicine Shanghai China Department of Geriatrics Tongji Hospital Tongji Medical College Huazhong University of Science and Technology Wuhan China National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Cluster and Grid Computing Lab School of Computer Science and Tech

We developed and validated a deep learning system (termed DeepDR Plus) in a diverse, multiethnic, multi-country dataset to predict personalized risk and time to progression of diabetic retinopathy. We show that DeepDR Plus can be integrated into the clinical workflow to promote individualized intervention strategies for the management of diabetic retinopathy.

关键词： Diabetes complications Machine learning Predictive markers

来源：评论

学校读者我要写书评

暂无评论

CA-Edit: Causality-Aware Condition Adapter for High-Fidelity Local Facial Attribute Editing

arXiv

引用

arXiv 2024年

作者： Xian, Xiaole He, Xilin Niu, Zenghao Zhang, Junliang Xie, Weicheng Song, Siyang Yu, Zitong Shen, Linlin Computer Vision Institute School of Computer Science & Software Engineering Shenzhen University China National Engineering Laboratory for Big Data System Computing Technology Shenzhen University China Guangdong Key Laboratory of Intelligent Information Processing China University of Exeter United Kingdom Great Bay University China

For efficient and high-fidelity local facial attribute editing, most existing editing methods either require additional finetuning for different editing effects or tend to affect beyond the editing regions. Alternatively, inpainting methods can edit the target image region while preserving external areas. However, current inpainting methods still suffer from the generation misalignment with facial attributes description and the loss of facial skin details. To address these challenges, (i) a novel data utilization strategy is introduced to construct datasets consisting of attribute-text-image triples from a data-driven perspective, (ii) a Causality-Aware Condition Adapter is proposed to enhance the contextual causality modeling of specific details, which encodes the skin details from the original image while preventing conflicts between these cues and textual conditions. In addition, a Skin Transition Frequency Guidance technique is introduced for the local modeling of contextual causality via sampling guidance driven by low-frequency alignment. Extensive quantitative and qualitative experiments demonstrate the effectiveness of our method in boosting both fidelity and editability for localized attribute editing. The code is available at https://***/connorxian/CA-Edit. © 2024, CC BY.

关键词：

来源：评论

学校读者我要写书评

暂无评论

HairDiffusion: Vivid Multi-Colored Hair Editing via Latent Diffusion

arXiv

引用

arXiv 2024年

作者： Zeng, Yu Zhang, Yang Liu, Jiachen Shen, Linlin Deng, Kaijun He, Weizhao Wang, Jinbao Computer Vision Institute School of Computer Science & Software Engineering Shenzhen University China Shenzhen Institute of Artificial Intelligence and Robotics for Society China National Engineering Laboratory for Big Data System Computing Technology Shenzhen University China Guangdong Provincial Key Laboratory of Intelligent Information Processing China

Hair editing is a critical image synthesis task that aims to edit hair color and hairstyle using text descriptions or reference images, while preserving irrelevant attributes (e.g., identity, background, cloth). Many existing methods are based on StyleGAN to address this task. However, due to the limited spatial distribution of StyleGAN, it struggles with multiple hair color editing and facial preservation. Considering the advancements in diffusion models, we utilize Latent Diffusion Models (LDMs) for hairstyle editing. Our approach introduces Multi-stage Hairstyle Blend (MHB), effectively separating control of hair color and hairstyle in diffusion latent space. Additionally, we train a warping module to align the hair color with the target region. To further enhance multi-color hairstyle editing, we fine-tuned a CLIP model using a multi-color hairstyle dataset. Our method not only tackles the complexity of multi-color hairstyles but also addresses the challenge of preserving original colors during diffusion editing. Extensive experiments showcase the superiority of our method in editing multi-color hairstyles while preserving facial attributes given textual descriptions and reference images. © 2024, CC BY.

关键词： Color image processing

来源：评论

学校读者我要写书评

暂无评论

DEGSTalk: Decomposed Per-Embedding Gaussian Fields for Hair-Preserving Talking Face Synthesis

arXiv

引用

arXiv 2024年

作者： Deng, Kaijun Zheng, Dezhi Xie, Jindong Wang, Jinbao Xie, Weicheng Shen, Linlin Song, Siyang Computer Vision Institute School of Computer Science and Software Engineering Shenzhen University China National Engineering Laboratory for Big Data System Computing Technology Shenzhen University China Guangdong Provincial Key Laboratory of Intelligent Information Processing China Department of Computer Science University of Exeter United Kingdom

Accurately synthesizing talking face videos and capturing fine facial features for individuals with long hair presents a significant challenge. To tackle these challenges in existing methods, we propose a decomposed per-embedding Gaussian fields (DEGSTalk), a 3D Gaussian Splatting (3DGS)-based talking face synthesis method for generating realistic talking faces with long hairs. Our DEGSTalk employs Deformable Pre-Embedding Gaussian Fields, which dynamically adjust pre-embedding Gaussian primitives using implicit expression coefficients. This enables precise capture of dynamic facial regions and subtle expressions. Additionally, we propose a Dynamic Hair-Preserving Portrait Rendering technique to enhance the realism of long hair motions in the synthesized videos. Results show that DEGSTalk achieves improved realism and synthesis quality compared to existing approaches, particularly in handling complex facial dynamics and hair preservation. Our code will be publicly available at https://***/CVI-SZU/DEGSTalk. Copyright © 2024, The Authors. All rights reserved.

关键词： Gaussian distribution

来源：评论

学校读者我要写书评

暂无评论

A generalized reliability analysis of 3-ary n-cubes

A generalized reliability analysis of 3-ary n-cubes

引用

International Conference on Communication Software and Networks, ICCSN

作者： Zefang Bai Guijuan Wang Meijie Ma School of Mathematics and Statistics Qilu University of Technology (Shandong Academy of Sciences) Jinan China Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center Qilu University of Technology (Shandong Academy of Sciences) Jinan China Shandong Provincial Key Laboratory of Industrial Network and Information System Security Shandong Fundamental Research Center for Computer Science Jinan China

ISBN: (数字)9798331506322

ISBN: (纸本)9798331506339

Evaluating the reliability of interconnection networks is crucial. The edge-connectivity is a parameter used to assess reliability. In this paper, we discuss a conditional edge-connectivity called the h-extra g-component edge-connectivity. It combines the extra edge-connectivity and the component edge-connectivity. First, this paper proved that $c \lambda_{3}^{h}\left(Q_{n}^{3}\right)=4 n h-$ $4 e_{h}\left(Q_{n}^{3}\right)-h$ for $1 \leq h \leq \frac{1}{2} \cdot 3^{\left\lceil\frac{h}{2}\right\rceil}, n \geq 3$. Then, the paper given the upper bound of h-extra g-component edge-connectivity of the 3 -ary n-cubes for $g \in\left\{4,3^{c}+1\right\}, 1 \leq c \leq\left\lceil\frac{n}{2}\right\rceil-1, n \geq 3$.

关键词： Upper bound Multiprocessor interconnection Software Reliability

来源：评论

学校读者我要写书评

暂无评论

Efficient Module-Lattice-based Certificateless Online/Offline Signcryption Scheme for Internet of Medical Things

引用

IEEE Internet of Things Journal 2025年

作者： Bai, Ye He, Debiao Yang, Zhichao Luo, Min Peng, Cong Wuhan University Key Laboratory of Aerospace Information Security and Trusted Computing Ministry of Education School of Cyber Science and Engineering Wuhan430072 China Wuhan University School of Cyber Science and Engineering Wuhan430072 China Qilu University of Technology Shandong Academy of Sciences Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center Jinan250014 China Naval University of Engineering Department of Information Security Wuhan430000 China Shandong Fundamental Research Center for Computer Science Shandong Provincial Key Laboratory of Industrial Network and Information System Security Jinan250014 China

The Internet of Medical Things (IoMT) has achieved remote diagnosis and real-time health monitoring through intelligent sensor devices and Internet of Things (IoT) technology, providing great convenience for analyzing medical conditions between doctors and patients. However, sensitive information such as patient medical data may face security challenges such as data leakage and abuse during transmission in the IoMT. To ensure the confidentiality and unforgeability of medical data transmission, scholars have proposed many cryptographic schemes. With the development of quantum computers, schemes based on traditional cryptographic primitives have become insecure. Existing cryptographic schemes for IoMT cannot simultaneously meet the security requirements of high communication performance, low computational overhead, and resistance to quantum attacks. Therefore, we propose an efficient module-lattice-based certificateless online/offline signcryption (MLCLOOSC) scheme resistant to quantum attacks while meeting the confidentiality and unforgeability requirements under Type I and Type II attacks. Compared with five recent CLOOSC schemes, theoretical analysis, and experimental test results show that the proposed scheme outperforms the other five schemes regarding computational and communication costs and security. Therefore, our scheme is more suitable for application in IoMT scenarios. © 2014 IEEE.

关键词： Quantum computers

来源：评论

学校读者我要写书评

暂无评论

MIME: Fast and Accurate Flow Information Compression for Multi-Spread Estimation

MIME: Fast and Accurate Flow Information Compression for Mul...

引用

International Conference on Network Protocols

作者： Hanwen Zhang He Huang Yu-E Sun Zhaojie Wang School of Computer Science & Technology Soochow University Suzhou China School of Rail Transportation Soochow University Suzhou China Key Laboratory of Embedded System and Service Computing Ministry of Education Tongji University Shanghai China

Spread estimation is an essential issue in high-speed networks with wide applications, such as network billing, quality of service, anomaly detection, etc. As a promising technique, sketch can efficiently estimate per-flow spread with only a small memory cost. Many studies focus on improving the performance of sketches. However, these works primarily focus on optimizing the counter level or sketch level without considering the scenario of multi-spread estimation, which is crucial for improving memory utilization and detecting anomalies. In this paper, we propose an efficient flow information compression algorithm based on the on-chip/off-chip hybrid framework to estimate multiple flow spreads. In the on-chip memory, we filter out non-duplicates and sample them to the off-chip space for recording. In the off-chip memory, we compress each sampled non-duplicate to a carefully designed bit-cube. When the measurement is finished, we separate corresponding KV-flows from a specific flow based on the user query. Then, we rebuild this flow to a subset group based on the duplicate number of each KV-flow. Finally, according to the Multi-set theory, we derive an accurate multi-spread estimate formula to solve this issue with a high throughput and small on-chip memory usage. Furthermore, we evaluate the performance of our proposed estimator using real Internet traffic traces downloaded from CAIDA. Experiments show that, compared to the state-of-the-art, our proposal achieves a 97.2% lower average relative error in per-destination source flow spread estimation with a tight on-chip memory, e.g., 320KB. And our proposed method achieves 31.86 higher processing throughput.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：