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

arXiv 2021年

作者： He, Lang Niu, Mingyue Tiwari, Prayag Marttinen, Pekka Su, Rui Jiang, Jiewei Guo, Chenguang Wang, Hongyu Ding, Songtao Wang, Zhongmin Pan, Xiaoying Dang, Wei School of Computer Science and Technology Xi'an University of Posts and Telecommunications Shaanxi Xi'an710121 China Shaanxi Key Laboratory of Network Data Analysis and Intelligent Processing Xi'an University of Posts and Telecommunications Shaanxi Xi'an710121 China Beijing100190 China Beijing100049 China Department of Computer Science Aalto University Espoo Finland School of Foreign Languages Northwest University Shaanxi Xi'an China School of Electronic Engineering Xi'an University of Posts and Telecommunications Xi'an China School of Electronics and Information Northwestern Polytechnical University Shaanxi Xi'an China Shaanxi Mental Health Center Shaanxi Xi'an710061 China

With the acceleration of the pace of work and life, people have to face more and more pressure, which increases the possibility of suffering from depression. However, many patients may fail to get a timely diagnosis due to the serious imbalance in the doctor-patient ratio in the world. Promisingly, physiological and psychological studies have indicated some differences in speech and facial expression between patients with depression and healthy individuals. Consequently, to improve current medical care, many scholars have used deep learning to extract a representation of depression cues in audio and video for automatic depression detection. To sort out and summarize these works, this review introduces the databases and describes objective markers for automatic depression estimation (ADE). Furthermore, we review the deep learning methods for automatic depression detection to extract the representation of depression from audio and video. Finally, this paper discusses challenges and promising directions related to automatic diagnosing of depression using deep learning technologies. © 2021, CC BY.

关键词： Diagnosis

来源：评论

学校读者我要写书评

暂无评论

Front Cover: International Journal of Intelligent Systems, Volume 37 Issue 11 November 2022

引用

International Journal of Intelligent Systems 2022年第11期37卷

作者： Xianjia Meng Yong Yang Ximeng Liu Nan Jiang School of Information Science and Technology Northwest University Xi'an People's Republic of China Fujian Province Key Laboratory of Information Security of Network System and College of Computer and Data Science Fuzhou University Fuzhou People's Republic of China Cyberspace Security Research Center Peng Cheng Laboratory Shenzhen People's Republic of China Department of Internet of Things School of Information Engineering East China Jiao Tong University Nanchang People's Republic of China

来源：评论

学校读者我要写书评

暂无评论

Onionchain: Towards balancing privacy and traceability of blockchain-based applications

arXiv

引用

arXiv 2019年

作者： Zhang, Yue Weng, Jian Weng, Jiasi Li, Ming Luo, Weiqi College of Informatin Science and Technology College of Cyber security National Joint Engineering Research Center of Network Security Detection and Protection Technology Guangdong Key Laboratory of Data Security and Privacy Preserving Jinan University Guangzhou510632 China

With the popularity of Blockchain comes grave security related concerns. Achieving privacy and traceability simultaneously remains an open question. Efforts have been made to address the issues, while they may subject to specific scenarios. This paper studies how to provide a more general solution for this open question. Concretely, we propose Onionchain, featuring a suite of protocols, offering both traceability and privacy. As the term implies, our Onionchain is inspired by Onion routing. We investigate the principles of Onion routing carefully and integrate its mechanism together with Blockchain technology. We advocate the Blockchain community to adopt Onionchain with the regards of privacy and traceability. To this end, a case-study of Onionchain, which runs in the context of Vehicular Ad Hoc networks (VANETs), is proposed, providing the community a guideline to follow. Systematic security analysis and extensive experiments are also conducted to validate our secure and cost-effective Onionchain. Copyright © 2019, The Authors. All rights reserved.

关键词： Blockchain

来源：评论

学校读者我要写书评

暂无评论

Mm-Wave Low-Profile Wideband Antenna Array Using Low-temperature Co-fired Ceramics (LTCC) Technique

Mm-Wave Low-Profile Wideband Antenna Array Using Low-tempera...

引用

International Conference on Microwave and Millimeter Wave technology Proceedings

作者： Jianfeng Zhu Yang Yang Chenhao Chu Shufang Li Shaowei Liao Quan Xue Beijing Key Laboratory of Network System Architecture and Convergence Beijing University of Posts and Telecommunications Beijing China School of Electrical and Data Engineering University of Technology Sydney Ultimo NSW Australia School of Electronic and Information Engineering South China University of Technology Guangzhou China

A low-profile wideband and high gain patch antenna array using low-temperature co-fired ceramics (LTCC) fabrication technique is proposed for 60-GHz applications. Coupled feeding scheme is adopted so that the antenna achieves wide impedance bandwidth that covers the entire 60-GHz license-free band with the height of only 0.384 mm (four tape layers). The shorting pin connecting the upper patch and ground imitates the virtual ac ground plane of differential feeding. This enables the antenna element to achieve good radiation performances including stable gain, symmetrical beam with low cross-polarization, which are comparable to those of the differential-driven patch antenna while the complex differential feeding network is not required. Antenna array prototype is fabricated and measured to verify the idea.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Novel Color Orthogonal Moments-Based Image Representation and Recognition

Research Square

引用

Research Square 2020年

作者： He, Bing Liu, Jun Yang, Tengfei Xiao, Bin Peng, Yanguo School of Physics and Electrical Engineering Weinan Normal University Weinan714000 China Shaanxi Key Laboratory of Network Data Analysis and Intelligent Processing Xi’an University of Posts & Telecommunications Xi’an710121 China School of Computer Science and Technology Weinan Normal University Weinan714000 China School of Cyberspace Security Xi’an University of Posts & Telecommunications Xi’an710121 China Chongqing Key Laboratory of Computational Intelligence Chongqing University of Posts and Telecommunications Chongqing400065 China School of Computer Science and Technology Xidian University Xi’an710071 China

Inspired by quaternion algebra and the idea of fractional-order transformation, we propose a new set of quaternion fractional-order generalized Laguerre orthogonal moments (QFr-GLMs) based on fractional-order generalized Laguerre polynomials. Firstly, the proposed QFr-GLMs are directly constructed in Cartesian coordinate space, avoiding the need for conversion between Cartesian and polar coordinates;therefore, they are better image descriptors than circularly orthogonal moments constructed in polar coordinates. Moreover, unlike the latest Zernike moments based on quaternion and fractional-order transformations, which extract only the global features from color images, our proposed QFr-GLMs can extract both the global and local color features. This paper also derives a new set of invariant color-image descriptors by QFr-GLMs, enabling geometric-invariant pattern recognition in color images. Finally, the performances of our proposed QFr-GLMs and moment invariants were evaluated in simulation experiments of correlated color images. Both theoretical analysis and experimental results demonstrate the value of the proposed QFr-GLMs and their geometric invariants in the representation and recognition of color images. © 2020, CC BY.

关键词： Image reconstruction

来源：评论

学校读者我要写书评

暂无评论

Improved Upper Bound on the network Function Computing Capacity

Improved Upper Bound on the Network Function Computing Capac...

引用

作者： Guang, Xuan Yeung, Raymond W. Yang, Shenghao Li, Congduan School of Mathematical Sciences and LPMC Nankai University Tianjin300071 China Institute of Network Coding Chinese University of Hong Kong Hong Kong Hong Kong Department of Information Engineering Chinese University of Hong Kong Hong Kong Hong Kong School of Science and Engineering Chinese University of Hong Kong Shenzhen518172 China Shenzhen Key Laboratory of IoT Intelligent Systems and Wireless Network Technology Chinese University of Hong Kong Shenzhen518172 China Shenzhen Research Institute of Big Data Shenzhen518172 China School of Electronics and Communication Engineering Sun Yat-sen University Guangzhou510006 China

The problem of network function computation over a directed acyclic network is investigated in this paper. In such a network, a sink node desires to compute with zero error a target function, of which the inputs are generated at multiple source nodes. The edges in the network are assumed to be error-free and have limited capacity. The nodes in the network are assumed to have unbounded computing capability and be able to perform network coding. The computing rate of a network code that can compute the target function over the network is the average number of times that the target function is computed with zero error for one use of the network. In this paper, we obtain an improved upper bound on the computing capacity, which is applicable to arbitrary target functions and arbitrary network topologies. This improved upper bound not only is an enhancement of the previous upper bounds but also is the first tight upper bound on the computing capacity for computing an arithmetic sum over a certain non-tree network, which has been widely studied in the literature. We also introduce a multi-dimensional array approach that facilitates evaluation of the improved upper bound. Furthermore, we apply this bound to the problem of computing a vector-linear function over a network. With this bound, we are not only able to enhance a previous result on computing a vector-linear function over a network but also simplify the proof significantly. Finally, we prove that for computing the binary maximum function over the reverse butterfly network, our improved upper bound is not achievable. This result establishes that in general our improved upper bound is non-achievable, but whether it is asymptotically achievable or not remains open. © 1963-2012 IEEE.

关键词： network coding

来源：评论

学校读者我要写书评

暂无评论

Visual Tracking Algorithm Based on Color Name Histogram

Visual Tracking Algorithm Based on Color Name Histogram

引用

作者： Chenchen Yue Wangsheng Yu Zhiqiang Hou Sugang Ma College of Computer Science and Technology Xi'an University of Posts and Telecommunications Shaanxi Key Laboratory of Network Data Analysis and Intelligent Processing Xi'an University of Posts and Telecommunications Information and Navigation Institute of Air Force Engineering University

Aimed at the problem that traditional histogram is sensitive to illumination changes in visual tracking,combined with the CN(Color Name) feature,we proposed a new feature(denotes CNH,Color Name Histogram) based on color ***,the method projected the original RGB image to CN space to obtain robust 11 feature ***,we counted the each pixel numbers of feature ***,normalizing the amount of pixels in each *** addition,we adopted a feature adaptive fusion method to combine CNH and HOG(Histogram of Oriented Gradient).In order to prove validity of the proposed algorithm,we use Staple(Sum of Template And Pixel-wise Learners) algorithm frame to make a controlled *** contrast with the reference algorithms,the success of our algorithm increases by 1.5% and the precision increases by 1.7%.The results show that this method retains the advantages of traditional histogram which is insensitive to target deformation,but also enhances the robustness to illumination change.

关键词： Visual tracking Color histogram Color name Feature fusion

来源：评论

学校读者我要写书评

暂无评论

Predictability of real temporal networks

arXiv

引用

arXiv 2020年

作者： Tang, Disheng Du, Wenbo Shekhtman, Louis Wang, Yijie Havlin, Shlomo Cao, Xianbin Yan, Gang School of Electronic and Information Engineering Beihang University Beijing100191 China School of Physics Science and Engineering Tongji University Shanghai200092 China National Engineering Laboratory of Big Data Application Technologies of Comprehensive Transportation Beijing100191 China Network Science Institute Northeastern University BostonMA02115 United States Department of Physics Bar Ilan University Ramat Gan5290002 Israel Shanghai Institute of Intelligence Science and Technology Tongji University Shanghai200092 China CAS Center for Excellence in Brain Science and Intelligence Technology Chinese Academy of Sciences Shanghai200031 China

Links in most real networks often change over time. Such temporality of links encodes the ordering and causality of interactions between nodes and has a profound effect on network dynamics and function. Empirical evidence has shown that the temporal nature of links in many real-world networks is not random. Nonetheless, it is challenging to predict temporal link patterns while considering the entanglement between topological and temporal link patterns. Here, we propose an entropy-rate-based framework, based on combined topological–temporal regularities, for quantifying the predictability of any temporal network. We apply our framework on various model networks, demonstrating that it indeed captures the intrinsic topological–temporal regularities whereas previous methods considered only temporal aspects. We also apply our framework on 18 real networks of different types and determine their predictability. Interestingly, we find that, for most real temporal networks, despite the greater complexity of predictability brought by the increase in dimension, the combined topological–temporal predictability is higher than the temporal predictability. Our results demonstrate the necessity for incorporating both temporal and topological aspects of networks in order to improve predictions of dynamical processes. Copyright © 2020, The Authors. All rights reserved.

关键词： Topology

来源：评论

学校读者我要写书评

暂无评论

Alert correlation algorithms: A survey and taxonomy

arXiv

引用

arXiv 2018年

作者： Mirheidari, Seyed Ali Arshad, Sajjad Jalili, Rasool Data and Network Security Laboratory Department of Computer Engineering Sharif University of Technology

Alert correlation is a system which receives alerts from heterogeneous Intrusion Detection Systems and reduces false alerts, detects high level patterns of attacks, increases the meaning of occurred incidents, predicts the future states of attacks, and detects root cause of attacks. To reach these goals, many algorithms have been introduced in the world with many advantages and disadvantages. In this paper, we are trying to present a comprehensive survey on already proposed alert correlation algorithms. The approach of this survey is mainly focused on algorithms in correlation engines which can work in enterprise and practical networks. Having this aim in mind, many features related to accuracy, functionality, and computation power are introduced and all algorithm categories are assessed with these features. The result of this survey shows that each category of algorithms has its own strengths and an ideal correlation frameworks should be carried the strength feature of each category. Copyright © 2018, The Authors. All rights reserved.

关键词： network security

来源：评论

学校读者我要写书评

暂无评论

Structured Information Extraction of Pathology Reports with Attention-based Graph Convolutional network

Structured Information Extraction of Pathology Reports with ...

引用

IEEE International Conference on Bioinformatics and Biomedicine (BIBM)

作者： Jialun Wu Kaiwen Tang Haichuan Zhang Chunbao Wang Chen Li School of Computer Science and Technology Xi’an Jiaotong University Xi’an Shaanxi China National Engineering Lab for Big Data Analytics Xi’an Jiaotong University Xi’an Shaanxi China Shaanxi Province Key Laboratory of Satellite and Terrestrial Network Tech.R&D Xi’an Jiaotong University Xi’an Shaanxi China School of Computer Science and Technology Qian Xuesen College Xi’an Jiaotong University Xi’an Shaanxi China the First Affiliated Hospital of Xi’an Jiaotong University Xi’an Shaanxi China

ISBN: (数字)9781728162157

ISBN: (纸本)9781728162164

Electronic medical data contains biochemical, imaging, pathological information during diagnosis and treatment. The pathology report is a kind of highly liberalized unstructured textual data, which is the basis and gold standard of cancer diagnosis and is very important for the prognosis and treatment of patients. The application of information extraction technology to pathological reports can obtain structured data that can be understood and analyzed by computers, helping pathologists make appropriate decisions. In this work, we proposed an attention-based graph convolutional network (GCN) for converting unstructured pathological reports into a structured form suitable for computer analysis to improve the current pathologist's workflow, collected medical data from different platforms, and provided more accurate assistance for diagnosis and treatment. We used pathology reports data from TCGA (The Cancer Genome Atlas) database with fine-grained annotations on 3632 pathology reports including four types of cancers. Our method performs better in our pathology report dataset with higher F1 score than traditional methods and deep learning methods. The results indicate that our method is robust, thus may work with other types of cancer pathology report.

关键词： Pathology Cancer Task analysis Annotations Information retrieval Medical diagnostic imaging data mining

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：