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

Automatic recognition of depression based on audio and video:A review

World Journal of Psychiatry 2024年第2期14卷 225-233页

作者： Meng-Meng Han Xing-Yun Li Xin-Yu Yi Yun-Shao Zheng Wei-Li Xia Ya-Fei Liu Qing-Xiang Wang Shandong Mental Health Center Shandong UniversityJinan 250014Shandong ProvinceChina Key Laboratory of Computing Power Network and Information Security Ministry of EducationShandong Computer Science Center(National Supercomputer Center in Jinan)Qilu University of Technology(Shandong Academy of Sciences)Jinan 250353Shandong ProvinceChina Shandong Engineering Research Center of Big Data Applied Technology Faculty of Computer Science and TechnologyQilu University of Technology(Shandong Academy of Sciences)Jinan 250353Shandong ProvinceChina Shandong Provincial Key Laboratory of Computer Networks Shandong Fundamental Research Center for Computer ScienceJinan 250353Shandong ProvinceChina Department of Ward Two Shandong Mental Health CenterShandong UniversityJinan 250014Shandong ProvinceChina

Depression is a common mental health *** current depression detection methods,specialized physicians often engage in conversations and physiological examinations based on standardized scales as auxiliary measures for depression ***-biological markers-typically classified as verbal or non-verbal and deemed crucial evaluation criteria for depression-have not been effectively *** physicians usually require extensive training and experience to capture changes in these *** in deep learning technology have provided technical support for capturing non-biological *** researchers have proposed automatic depression estimation(ADE)systems based on sounds and videos to assist physicians in capturing these features and conducting depression *** article summarizes commonly used public datasets and recent research on audio-and video-based ADE based on three perspectives:Datasets,deficiencies in existing research,and future development directions.

关键词： Depression recognition Deep learning Automatic depression estimation System Audio processing Image processing Feature fusion Future development

来源：评论

学校读者我要写书评

暂无评论

DynGL-SDP: Dynamic Graph Learning for Semantic Dependency Parsing 29

DynGL-SDP: Dynamic Graph Learning for Semantic Dependency Pa...

引用

29th International Conference on Computational Linguistics, COLING 2022

作者： Li, Bin Gao, Miao Fan, Yunlong Sataer, Yikemaiti Gao, Zhiqiang Gui, Yaocheng School of Computer Science and Engineering Southeast University Nanjing210096 China Key Laboratory of Computer Network and Information Integration Ministry of Education Nanjing210096 China School and Institute of Modern Posts Nanjing University of Posts and Telecommunications Nanjing210003 China

A recent success in semantic dependency parsing shows that graph neural networks can make significant accuracy improvements, owing to its powerful ability in learning expressive graph representations. However, this work learns graph representations based on a static graph constructed by an existing parser, suffering from two drawbacks: (1) the static graph might be error-prone (e.g., noisy or incomplete), and (2) graph construction stage and graph representation learning stage are disjoint, the errors introduced in the graph construction stage cannot be corrected and might be accumulated to later stages. To address these two drawbacks, we propose a dynamic graph learning framework and apply it to semantic dependency parsing, for jointly learning graph structure and graph representations. Experimental results show that our parser outperforms the previous parsers on the SemEval-2015 Task 18 dataset in three languages (English, Chinese, and Czech). © 2022 Proceedings - International Conference on Computational Linguistics, COLING. All rights reserved.

关键词： Graph neural networks

来源：评论

学校读者我要写书评

暂无评论

Find the Bad Apples: An efficient method for perfect key recovery under imperfect SCA oracles – A case study of Kyber

IACR Transactions on Cryptographic Hardware and Embedded Sys...

引用

IACR Transactions on Cryptographic Hardware and Embedded Systems 2022年第1期2023卷 89-112页

作者： Shen, Muyan Cheng, Chi Zhang, Xiaohan Guo, Qian Jiang, Tao Hubei Key Laboratory of Intelligent Geo-Information Processing School of Computer Science China University of Geosciences Wuhan China State Key Laboratory of Integrated Services Networks Xidian University Xian China Lund University Lund Sweden Research Center of 6G Mobile Communications School of Cyber Science and Engineering Huazhong University of Science and Technology Wuhan China

Side-channel resilience is a crucial feature when assessing whether a post-quantum cryptographic proposal is sufficiently mature to be deployed. In this paper, we propose a generic and efficient adaptive approach to improve the sample complexity (i.e., the required number of traces) of plaintext-checking (PC) oracle-based side-channel attacks (SCAs), a major class of key recovery chosen-ciphertext SCAs on lattice-based key encapsulation mechanisms (KEMs). This new approach is preferable when the constructed PC oracle is imperfect, which is common in practice, and its basic idea is to design new detection codes that can determine erroneous positions in the initially recovered secret key. These secret entries are further corrected with a small number of additional traces. This work benefits from the generality of PC oracle and thus is applicable to various schemes and implementations. Our main target is Kyber since it has been selected by NIST as the KEM algorithm for standardization. We instantiated the proposed generic attack on Kyber512 and then conducted extensive computer simulations against Kyber512 and FireSaber. We further mounted an electromagnetic (EM) attack against an optimized implementation of Kyber512 in the pqm4 library running on an STM32F407G board with an ARM Cortex-M4 microcontroller. These simulations and real-world experiments demonstrate that the newly proposed attack could greatly improve the state-of-the-art in terms of the required number of traces. For instance, the new attack requires only 41% of the EM traces needed in a majority-voting attack in our experiments, where the raw oracle accuracy is fixed. © 2022, Ruhr-University of Bochum. All rights reserved.

关键词： Standardization

来源：评论

学校读者我要写书评

暂无评论

Lattice-based group encryptions with only one trapdoor

引用

Science China(information Sciences) 2022年第5期65卷 205-222页

作者： Jing PAN Jiang ZHANG Fangguo ZHANG Xiaofeng CHEN Willy SUSILO State Key Laboratory of Integrated Service Networks(ISN) Xidian University State Key Laboratory of Cryptology School of Computer Science and Engineering Sun Yat-sen University Guangdong Key Laboratory of Information Security Institute of Cybersecurity and Cryptology School of Computing and Information TechnologyUniversity of Wollongong

Group encryption(GE), the encryption analog of group signatures, is a fundamental primitive that offers a privacy-preserving service for a specific receiver concealed within a group of certified *** other cryptographic primitives, GE constructions are always considered relative to the potential danger of quantum computations. The only existing lattice-based variant appeared in the work of Libert et al.(Asiacrypt'16). Despite its non-trivial achievement, the construction suffers in terms of efficiency due to the extensive use of lattice trapdoors. In this paper, we develop an integrated zero-knowledge argument system that is friendly to both accumulated values and hidden matrices and supports efficient designs from *** on this system, we propose efficiency enhancing GE where only group users are required to possess the lattice trapdoors and the other parties are not. In particular, we utilize lattice-based cryptographic accumulators to confirm prospective group members and use the dual Regev encryption scheme to provide privacy for ciphertext recipients. These modifications significantly increase GE efficiency. In addition, under the intractability assumptions of the standard lattice problems, we prove the security of the proposed scheme in the standard model(assuming interaction during the proof phase), which retains the strongest level of security as the only currently available candidate.

关键词： lattice cryptography group encryptions lattice trapdoors accumulators zero-knowledge

来源：评论

学校读者我要写书评

暂无评论

The Adaptive Fault-tolerant Routing Based on an Improved Local Security information Model of the Exchanged Hypercube 21

The Adaptive Fault-tolerant Routing Based on an Improved Loc...

引用

21st IEEE International Symposium on Parallel and Distributed Processing with Applications, 13th IEEE International Conference on Big Data and Cloud Computing, 16th IEEE International Conference on Social Computing and Networking and 13th International Conference on Sustainable Computing and Communications, ISPA/BDCloud/SocialCom/SustainCom 2023

作者： Zhang, Yazhi Luo, Chuanwen Wang, Guijuan Zhang, Li Lv, Mengjie Yu, Jiguo Qilu University of Technology School of Computer Science and Technology Jinan China Beijing Forestry University School of Information Science and Technology Beijing 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 Jinan China Shandong Fundamental Research Center for Computer Science Shandong Provincial Key Laboratory of Computer Networks Jinan China Nanjing University of Posts and Telecommunications College of Computer Nanjing China Qilu University of Technology Shandong Academy of Sciences Big Data Research Institute Jinan China

ISBN: (纸本)9798350329223

With the increasing amount of computation in high-performance computing, the scale of interconnection networks is becoming larger and larger. It is inevitable that processors or links in the network become faulty. Therefore, it is very important for a processor to understand the security status of itself and neighbors, and then adaptively and reliably communicate. However, the existing security information models consider faulty processors or faulty links separately, and do not consider the situation where both processors and links fail simultaneously. The Exchanged Hypercube is an excellent interconnection network structure which achieves a balance between network functionality and hardware overhead while preserving many excellent properties of the Hypercube. In this paper, we propose an adaptive fault-tolerant routing algorithm of the Exchanged Hypercube based on an improved local security information model, which considers the faulty processors and faulty links simultaneously. This algorithm always can select suitable processors for routing based on the local security information and unsafe coefficients of processors, which greatly reduces the impact of the faulty of networks. The adaptive fault-tolerant routing algorithm of the Exchanged Hypercube network is not only suitable for regular networks but also for heterogeneous networks since the Exchanged Hypercube is a semi regular network. Sufficient experimental results show that the algorithm proposed in this paper has a lower packet loss rate, a higher success rate, and a shorter average path length. © 2023 IEEE.

关键词： Hypercube networks

来源：评论

学校读者我要写书评

暂无评论

Gaia: Ground Station-Centric Mobility Management for LEO Satellite networks

Gaia: Ground Station-Centric Mobility Management for LEO Sat...

引用

IEEE International Conference on Communications (ICC)

作者： Xiaxin Zhou Tian Pan Zhaokun Yang Sirui Su Jun Hu Guohao Ruan Junkai Huang Tao Huang Yunjie Liu Beijing University of Posts and Telecommunications Beijing China Purple Mountain Laboratories Nanjing China Key Laboratory of Computer Network and Information Integration Ministry of Education Southeast University China

ISBN: (数字)9781728190549

ISBN: (纸本)9781728190556

For mega-scale low Earth orbit (LEO) satellite constellations, the relative position changes between satellites and ground terminals pose challenges for end-to-end TCP session maintenance, which serves as the substrate for many Internet services. Mobile IP resolves the session maintenance issue by in-troducing a binding mechanism between the care-of address and home address; however, this also leads to inefficient triangular routing. Our recently proposed LISP-LEO, through partition-satellite mapping, routes traffic to the service satellite above the destination terminal's partition, addressing the triangular routing problem. However, due to the corner case of partition-satellite mapping, LISP-LEO introduces the issue of the last-hop route selection, as well as the associated per-terminal registration states on the satellite, making the solution non-scalable. In this work, we propose Gaia, a ground station-centric mobility management scheme for LEO satellite networks. Gaia maintains a precise mapping of each ground terminal's IP and its geographical location. When receiving traffic from a source terminal, the access satellite can, based on the geographical location of the destination terminal carried by the traffic, directly locate the satellite above the destination terminal and tunnel the traffic to it. In addition, to reduce the satellite's burden, we add a DNS-like querying mechanism by offloading the mapping of terminal IPs and geographical locations to the ground station. The evaluation shows that Gaia outperforms Mobile IP and LISP-LEO in both end-to-end latency and on-board resource consumption.

关键词： Satellite constellations Satellites Web and internet services Low earth orbit satellites Production Routing Maintenance

来源：评论

学校读者我要写书评

暂无评论

Gradient sparsification for efficient wireless federated learning with differential privacy

引用

Science China(information Sciences) 2024年第4期67卷 272-288页

作者： Kang WEI Jun LI Chuan MA Ming DING Feng SHU Haitao ZHAO Wen CHEN Hongbo ZHU School of Electronic and Optical Engineering Nanjing University of Science and Technology Zhejiang Lab Key Laboratory of Computer Network and Information Integration(Southeast University) Ministry of Education Data61 Commonwealth Scientific and Industrial Research Organisation School of Information and Communication Engineering Hainan University School of Communications and Information Engineering Nanjing University of Posts and Telecommunications School of Electronic Information and Electrical Engineering Shanghai Jiao Tong University

Federated learning(FL) enables distributed clients to collaboratively train a machine learning model without sharing raw data with each other. However, it suffers from the leakage of private information from uploading models. In addition, as the model size grows, the training latency increases due to the limited transmission bandwidth and model performance degradation while using differential privacy(DP)protection. In this paper, we propose a gradient sparsification empowered FL framework with DP over wireless channels, to improve training efficiency without sacrificing convergence performance. Specifically, we first design a random sparsification algorithm to retain a fraction of the gradient elements in each client's local model, thereby mitigating the performance degradation induced by DP and reducing the number of transmission parameters over wireless channels. Then, we analyze the convergence bound of the proposed algorithm, by modeling a non-convex FL problem. Next, we formulate a time-sequential stochastic optimization problem for minimizing the developed convergence bound, under the constraints of transmit power, the average transmitting delay, as well as the client's DP requirement. Utilizing the Lyapunov drift-plus-penalty framework, we develop an analytical solution to the optimization problem. Extensive experiments have been implemented on three real-life datasets to demonstrate the effectiveness of our proposed algorithm. We show that our proposed algorithms can fully exploit the interworking between communication and computation to outperform the baselines, i.e., random scheduling, round robin, and delay-minimization algorithms.

关键词： federated learning differential privacy gradient sparsification Lyapunov drift convergence analysis

来源：评论

学校读者我要写书评

暂无评论

Research on the Programming Language for Symmetric Cryptographic Algorithms

引用

Chinese Journal of Electronics 2023年第2期19卷 303-306页

作者： Fenghua Li Junzhi Yan Rongna Xie Jianfeng Ma Beijing Electronic Science and Technology Institute Beijing China Key Laboratory of Computer Networks and Information Security (Ministry of Education) Xidian University Xi'an China

The Programming language for symmetric cryptographic algorithms (PLSCA) is proposed. The detailed specification of the syntax of PLSCA is presented, and the cipher of IDEA is described using PLSCA as an example. Using PLSCA, the cryptography designers could describe the structure of symmetric cryptographic algorithms in a formal way, exchange their ideas and algorithm details, test and analyze the symmetric cryptographic algorithms conveniently and rapidly. PLSCA may improve the testing efficiency of new algorithms. It is adapt to assist the design and automatic analysis for symmetric cryptographic algorithms, and it may be used as a standard language to submit new algorithms to the evaluation staff.

关键词： computer languages Ciphers information security Syntactics Cryptography Standards Research and development

来源：评论

学校读者我要写书评

暂无评论

D-Router: Decoupled Content Routers with Remote Content Store

D-Router: Decoupled Content Routers with Remote Content Stor...

引用

IEEE International Conference on Communications (ICC)

作者： Shuyi Chen Tian Pan Chunyang Wu Guohao Ruan Jiao Zhang Tao Huang Yunjie Liu Beijing University of Posts and Telecommunications Beijing China Purple Mountain Laboratories Nanjing China Key Laboratory of Computer Network and Information Integration Ministry of Education Southeast University China

ISBN: (数字)9781728190549

ISBN: (纸本)9781728190556

Named Data Networking (NDN) enables efficient content distribution through in-network caching. However, the additional states of network intermediary nodes make NDN forwarding more burdensome, and the unpredictability of cache hits during forwarding leads to uncertain content retrieval latency. To overcome performance bottlenecks at the router's data plane and enhance network determinism, we propose the decoupled content router with remote content store (D-Router). This novel architecture decouples the local content store (CS) from routers and introduces the remote CS device for pooling important content. When Interest packets arrive at a router whose CS is overloaded, we ensure determinism by forwarding them to the remote CS for processing if the requested content is cached there, preventing blocking before the local CS of routers and potential random cache hits along the forwarding path. The dual-path bypass forwarding is supported through the design of routers and a dual-path routing protocol. D-Router is compatible with traditional NDN. Experiments show notable enhancements in data plane performance, including a 30% reduction in round-trip time (RTT), a 25% increase in throughput, improved determinism, and reduced network jitter. Additionally, the decoupling of CS makes it easier for network administrators to deploy network upgrades.

关键词： Performance evaluation Jitter Throughput Routing protocols

来源：评论

学校读者我要写书评

暂无评论

Fine-grained Semantic Alignment with Transferred Person-SAM for Text-based Person Retrieval 24

Fine-grained Semantic Alignment with Transferred Person-SAM ...

引用

32nd ACM International Conference on Multimedia, MM 2024

作者： Wang, Yihao Yang, Meng Cao, Rui School of Computer Science and Engineering Sun Yat-Sen University Guangdong Guangzhou China State Key Laboratory of Integrated Services Networks Xidian University Shaanxi Xi'an China Ministry of Education Guangdong Guangzhou China School of Information Science and Technology State-Province Joint Engineering and Research Center of Advanced Networking and Intelligent Information Services Northwest University Shaanxi Xi'an China

ISBN: (纸本)9798400706868

Addressing the disparity in description granularity and information gap between images and text has long been a formidable challenge in text-based person retrieval (TBPR) tasks. Recent researchers tried to solve this problem by random local alignment. However, they failed to capture the fine-grained relationships between images and text, so the information and modality gaps remain on the table. We align image regions and text phrases at the same semantic granularity to address the semantic atomicity gap. Our idea is first to extract and then exploit the relationships between fine-grained locals. We introduce a novel Fine-grained Semantic Alignment with Transferred Person-SAM (SAP-SAM) approach. By distilling and transferring knowledge, we propose a Person-SAM model to extract fine-grained semantic concepts at the same granularity from images and texts of TBPR and its relationships. With the extracted knowledge, we optimize the fine-grained matching via Explicit Local Concept Alignment and Attentive Cross-modal Decoding to discriminate fine-grained image and text features at the same granularity level and represent the important semantic concepts from both modalities, effectively alleviating the granularity and information gaps. We evaluate our proposed approach on three popular TBPR datasets, demonstrating that SAP-SAM achieves state-of-the-art results and underscores the effectiveness of end-to-end fine-grained local alignment in TBPR tasks. © 2024 ACM.

关键词： Visual languages

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：