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

arXiv 2020年

作者： Wu, Xun Zheng, Wei-Long Lu, Bao-Liang Center for Brain-Like Computing and Machine Intelligence Department of Computer Science and Engineering Key Laboratory of Shanghai Education Commission for Intelligent Interaction and Cognitive Engineering Brain Science and Technology Research Center Qing Yuan Research Institute Shanghai Jiao Tong University 800 Dong Chuan Road Shanghai200240 China Clinical Data Animation Center Department of Neurology Massachusetts General Hospital Harvard Medical School 55 Fruit Street BostonMA United States

Compared with the rich studies on the motor brain-computer interface (BCI), the recently emerging affective BCI presents distinct challenges since the brain functional connectivity networks involving emotion are not well investigated. Previous studies on emotion recognition based on electroencephalography (EEG) signals mainly rely on single-channel-based feature extraction methods. In this paper, we propose a novel emotion-relevant critical subnetwork selection algorithm and investigate three EEG functional connectivity network features: strength, clustering coefficient, and eigenvector centrality. The discrimination ability of the EEG connectivity features in emotion recognition is evaluated on three public emotion EEG datasets: SEED, SEED-V, and DEAP. The strength feature achieves the best classification performance and outperforms the state-of-the-art differential entropy feature based on single-channel analysis for the EEG signals. The experimental results reveal that distinct functional connectivity patterns are exhibited for the five emotions of disgust, fear, sadness, happiness, and neutrality. Furthermore, we construct a multimodal emotion recognition model by combining the functional connectivity features from EEG and the features from eye movements or physiological signals using deep canonical correlation analysis. The classification accuracies of multimodal emotion recognition are 95.08 ± 6.42% on the SEED dataset, 84.51 ± 5.11% on the SEED-V dataset, and 85.34 ± 2.90% and 86.61 ± 3.76% for arousal and valence on the DEAP dataset, respectively. The results demonstrate the complementary representation properties of the EEG functional connectivity network features with eye movement data. In addition, we find that the brain networks constructed with fewer channels, i.e., 18 channels, achieve comparable performance with that of the 62-channel network with respect to multimodal emotion recognition and enable easier setups for BCI systems in real scenarios. Cop

关键词： Electrophysiology

来源：评论

学校读者我要写书评

暂无评论

Distributed cooperative guidance for maneuvering targets with directed conmunication topologies

引用

Hangkong Xuebao/Acta Aeronautica et Astronautica Sinica 2020年 41卷

作者： Dong, Xiaofei Ren, Zhang Chi, Qingxi Li, Qingdong School of Automation Science and Electrical Engineering Beihang University Beijing100083 China Science and Technology on Complex System Control and Intelligent Agent Cooperation Laboratory Beijing100074 China Science and Technology on Aircraft Control Laboratory Beihang University Beijing100083 China Beijing Advanced Innovation Center for Big Data and Brain Computing Beihang University Beijing100083 China

This paper studies the distributed cooperative guidance for maneuvering targets with directed communication topologies. First, a guidance system model is established based on the geometric relationship between the aircraft and the target, in which the nonlinear problem is solved by feedback linearization. In this design, the unknown maneuver of the target is observed by the extended state observer, and the estimation of the unknown maneuver of the target is applied to the design of the guidance law. In this process, the influence of the target maneuvering on the time-to-go is eliminated by means of direct compensation. Then, the designed guidance law is brought into the guidance model, transforming the problem of cooperative guidance into the problem of consensus. Next, the necessary and sufficient conditions for the convergence of the designed cooperative guidance law are obtained by conducting the pole analysis. Finally, the designed cooperative guidance law and the method of the parameter selection are analyzed by adopting the simulation analysis. © 2020, Beihang University Aerospace Knowledge Press. All right reserved.

关键词： State estimation

来源：评论

学校读者我要写书评

暂无评论

Financial Big data Hot and Cold Separation Scheme Based on HBase and Redis

Financial Big Data Hot and Cold Separation Scheme Based on H...

引用

IEEE International Conference on Big data and Cloud computing (BdCloud)

作者： Kunhui Li Kun Guo Hong Guo Fujian Provincial Key Laboratory of Network Computing and Intelligent Information Processing College of Mathematics and Computer Science Fuzhou University Fuzhou China Key Laboratory of Spatial Data Mining Information Sharing Ministry of Education Fuzhou China College of Mathematics and Computer Science Fuzhou University Fuzhou China

ISBN: (数字)9781728143286

ISBN: (纸本)9781728143293

In the era of big data, HBase has been widely used in scenarios of massive unstructured data. For the financial big data, due to the integrity and timing of it, unreasonable data storage and management usually lead to hot spots that decreases the query performance. In practice, the separation of hot and cold financial data will improve data query performance and utilization rate of cluster resources. In this paper, a hot and cold data separation scheme is designed, to store infrequently queried financial data to HBase, and frequently queried one to Redis. The cold data is reasonably planned and managed through pre-partitioning and row key design for HBase. A hot data cache based on Redis is realized to improve the query speed and reduces the pressure of HBase. In addition, due to the lack of Redis's inherent cache elimination strategy, we propose a caching strategy based on the frequencies of updating and querying operations. The experimental results show that the scheme can effectively avoid the hot storage problem, and improve the query performance, and improve the cache hit ratio of Redis. Therefore, the number of cold data access requests can be effectively reduced.

关键词： Big data Distributed databases Memory Time series analysis Stock markets

来源：评论

学校读者我要写书评

暂无评论

Mixed Word Embedding Method Based on Knowledge Graph Augment for Text Classification

Mixed Word Embedding Method Based on Knowledge Graph Augment...

引用

IEEE International Conference on Big data and Cloud computing (BdCloud)

作者： Hongzhong Wang Kun Guo Zhanghui Liu Fujian Provincial Key Laboratory of Network Computing and Intelligent Information Processing College of Mathematics and Computer Science Fuzhou University Fuzhou China Key Laboratory of Spatial Data Mining & Information Sharing Ministry of Education Fuzhou China College of Mathematics and Computer Science Fuzhou University Fuzhou China

ISBN: (数字)9781728143286

ISBN: (纸本)9781728143293

This paper presents a self-training word embedding text classification model based on knowledge graph expansion for text classification. Current mixed word embedding methods are overly dependent on the Fasttext pre-training model and here is still a problem of missing words with rich semantic information are not mapped. First, we propose a method for extracting missing nouns based on shape near word filtering. Second, we design a self-training word embedding method based on knowledge graph that mixes with pre-training word embedding to obtain a high-quality mixed word vector with rich semantics and rich semantics. Third, we designed a GRU model based on improved mixed word embedding to improve the quality of text classification. Experiments conducted on multiple text classification datasets demonstrate that our methods can effectively improve the text classification accuracy.

关键词： Text categorization Context modeling Feature extraction Training Task analysis Predictive models

来源：评论

学校读者我要写书评

暂无评论

TRIPS: A System for translating raw indoor positioning data into visual mobility semantics 44th

TRIPS: A System for translating raw indoor positioning data ...

引用

44th International Conference on Very Large data Bases, VLDB 2018

作者： Li, Huan Lu, Hua Shi, Feichao Chen, Gang Chen, Ke Shou, Lidan Department of Computer Science Zhejiang University China Department of Computer Science Aalborg University Denmark Key Laboratory of Big Data Intelligent Computing of Zhejiang Province China CAD and CG State Key Lab Zhejiang University China

The rapid accumulation of indoor positioning data is increasingly booming the interest in indoor mobility analyses. As a fundamental analysis, it is highly relevant to translate raw indoor positioning data into mobility semantics that describe what, where and when in a more concise and semantics-oriented way. Such a translation is challenging as multiple data sources are involved, raw indoor positioning data is of low quality, and translation results are hard to assess. We demonstrate a system TRIPS that streamlines the entire translation process by three functional components. The Configurator provides a standard but concise means to configure multiple input sources, including the indoor positioning data, indoor space information, and relevant contexts. The Translator cleans the indoor positioning data and exports reliable mobility semantics without manual interventions. The Viewer offers a suite of flexible operations to trace the input, output and intermediate data involved in the translation. data analysts can interact with TRIPS to obtain the desired mobility semantics in a visual and convenient way. © 2018 VLDB Endowment.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Image Segmentation Using Fuzzy C-means Optimized by Ant Lion Optimization

Image Segmentation Using Fuzzy C-means Optimized by Ant Lion...

引用

IEEE International Conference on intelligent data Acquisition and Advanced computing Systems

作者： Can Jin Zhiwei Ye Lingyu Yan Ye Cao Aixin Zhang Lie Ma Xiang Hu Jiwei Hu School of Computer Science Hubei University of Technology Wuhan China Fujian Provincial Key Laboratory of Data Intensive Computing Key Laboratory of Intelligent Computing and Information Processing Fujian Province University Wuhan Jingzhi Technology Co. Ltd. Wuhan China Wuhan FiberHome Technical Services Co. Ltd. Wuhan China

Image segmentation is the indispensable part in the field of computer vision. There are tremendous methods for handling this task such as Otsu-thresholding and Fuzzy C-means (FCM). However, the segmentation results of the images are occasionally unsatisfactory due to the presence of noise. In this paper, two kinds of spatial information consisting of the relative position information and the intensity information of the neighborhood pixels in an image are taken into consideration in constructing the objective function in FCM. Moreover, Ant Lion Optimization, one of the recently proposed optimization algorithms is utilized to optimize the relevant index. Bio-inspired ALO has the robust ability to find optimal parameters in search spaces. So the proposed approach to image segmentation based on Fuzzy C-Means (FCM) and Ant Lion Optimization (ALO) may alleviate this problem to a certain degree. A series of experimental validation has been implemented for demonstrating the performance of the proposed approach in the end of the paper.

关键词： Clustering algorithms Image segmentation Optimization Convergence Linear programming Standards Gaussian noise

来源：评论

学校读者我要写书评

暂无评论

Accumulative time-based ranking method to reputation evaluation in information networks

arXiv

引用

arXiv 2019年

作者： Liao, Hao Liu, Qi-Xin Huang, Ze-Cheng Yeung, Chi Ho Zhang, Yi-Cheng National Engineering Laboratory on Big Data System Computing Technology Guangdong Province Engineering Center of China-made High Performance Data Computing System College of Computer Science and Software Engineering Shenzhen University Shenzhen518060 China Institute of Big Data Intelligent Management and Decision Shenzhen University Shenzhen518060 China Department of Science and Environmental Studies The Education University of Hong Kong Hong Kong Hong Kong Department of Physics University of Fribourg Fribourg Switzerland

With the rapid development of modern technology, the Web has become an important platform for users to make friends and acquire information. However, since information on the Web is over-abundant, information filtering becomes a key task for online users to obtain relevant suggestions. As most Websites can be ranked according to users’ rating and preferences, relevance to queries, and recency, how to extract the most relevant item from the over-abundant information is always a key topic for researchers in various fields. In this paper, we adopt tools used to analyze complex networks to evaluate user reputation and item quality. In our proposed accumulative time-based ranking (ATR) algorithm, we incorporate two behavioral weighting factors which are updated when users select or rate items, to reflect the evolution of user reputation and item quality over time. We showed that our algorithm outperforms state-of-the-art ranking algorithms in terms of precision and robustness on empirical datasets from various online retailers and the citation datasets among research publications. Copyright © 2019, The Authors. All rights reserved.

关键词： Information filtering

来源：评论

学校读者我要写书评

暂无评论

Insight-HXMT and GECAM-C observations of the brightest-of-all-time GRB 221009A

arXiv

引用

arXiv 2023年

作者： An, Zheng-Hua Antier, S. Bi, Xing-Zi Bu, Qing-Cui Cai, Ce Cao, Xue-Lei Camisasca, Anna-Elisa Chang, Zhi Chen, Gang Chen, Li Chen, Tian-Xiang Chen, Wen Chen, Yi-Bao Chen, Yong Chen, Yu-Peng Coughlin, Michael W. Cui, Wei-Wei Dai, Zi-Gao Hussenot-Desenonges, T. Du, Yan-Qi Du, Yuan-Yuan Du, Yun-Fei Fan, Cheng-Cheng Frontera, Filippo Gao, He Gao, Min Ge, Ming-Yu Gong, Ke Gu, Yu-Dong Guan, Ju Guo, Dong-Ya Guo, Zhi-Wei Guidorzi, Cristiano Han, Da-Wei He, Jian-Jian He, Jun-Wang Hou, Dong-Jie Huang, Yue Huo, Jia Ji, Zhen Jia, Shu-Mei Jiang, Wei-Chun Kann, David Alexander Klotz, A. Kong, Ling-Da Lan, Lin Li, An Li, Bing Li, Chao-Yang Li, Cheng-Kui Li, Gang Li, Mao-Shun Li, Ti-Pei Li, Wei Li, Xiao-Bo Li, Xin-Qiao Li, Xu-Fang Li, Yan-Guo Li, Zheng-Wei Liang, Jing Liang, Xiao-Hua Liao, Jin-Yuan Lin, Lin Liu, Cong-Zhan Liu, He-Xin Liu, Hong-Wei Liu, Jia-Cong Liu, Xiao-Jing Liu, Ya-Qing Liu, Yu-Rong Lu, Fang-Jun Lu, Hong Lu, Xue-Feng Luo, Qi Luo, Tao Ma, Bin-Yuan Ma, Fu-Li Ma, Rui-Can Ma, Xiang Maccary, Romain Mao, Ji-Rong Meng, Bin Nie, Jian-Yin Orlandini, Mauro Ou, Ge Peng, Jing-Qiang Peng, Wen-Xi Qiao, Rui Qu, Jin-Lu Ren, Xiao-Qin Shi, Jing-Yan Shi, Qi Song, Li-Ming Song, Xin-Ying Su, Ju Sun, Gong-Xing Sun, Liang Sun, Xi-Lei Tan, Wen-Jun Tan, Ying Tao, Lian Tuo, You-Li Turpin, Damien Wang, Jin-Zhou Wang, Chen Wang, Chen-Wei Wang, Hong-Jun Wang, Hui Wang, Jin Wang, Ling-Jun Wang, Peng-Ju Wang, Ping Wang, Wen-Shuai Wang, Xiang-Yu Wang, Xi-Lu Wang, Yu-Sa Wang, Yue Wen, Xiang-Yang Wu, Bo-Bing Wu, Bai-Yang Wu, Hong Xiao, Sheng-Hui Xiao, Shuo Xiao, Yun-Xiang Xie, Sheng-Lun Xiong, Shao-Lin Xiong, Sen-Lin Xu, Dong Xu, He Xu, Yan-Jun Xu, Yan-Bing Xu, Ying-Chen Xu, Yu-Peng Xue, Wang-Chen Yang, Sheng Yang, Yan-Ji Yang, Zi-Xu Ye, Wen-Tao Yi, Qi-Bin Yi, Shu-Xu Yin, Qian-Qing You, Yuan Yu, Yun-Wei Yu, Wei Yu, Wen-Hui Zeng, Ming Zhang, Bing Zhang, Bin-Bin Zhang, Da-Li Zhang, Fan Zhang, Hong-Mei Zhang, Juan Key Laboratory of Particle Astrophysics Institute of High Energy Physics Chinese Academy of Sciences 19B Yuquan Road Beijing100049 China Institut für Astronomie und Astrophysik Kepler Center for Astro and Particle Physics Eberhard Karls Universität Sand 1 Tübingen72076 Germany College of Physics Hebei Key Laboratory of Photophysics Research and Application Hebei Normal University Hebei Shijiazhuang050024 China Department of Physics and Earth Science University of Ferrara Via Saragat 1 Ferrara44122 Italy Department of Astronomy Beijing Normal University Beijing100875 China CAS Key Laboratory for Research in Galaxies and Cosmology Department of Astronomy University of Science and Technology of China Hefei230026 China Department of Astronomy Tsinghua University Beijing100084 China Southwest Jiaotong University Chengdu610092 China INAF Osservatorio di Astrofisica e Scienza dello Spazio di Bologna Via Piero Gobetti 101 Bologna40129 Italy University of Chinese Academy of Sciences Chinese Academy of Sciences Beijing100049 China College of physics Sciences Technology Hebei University No. 180 Wusi Dong Road Lian Chi District Hebei Baoding071002 China INFN - Sezione di Ferrara Via Saragat 1 Ferrara44122 Italy Physics and Space Science College China West Normal University China Yunnan Observatories Chinese Academy of Sciences Yunnan Province Kunming650011 China Key Laboratory of Space Astronomy and Technology National Astronomical Observatories Chinese Academy of Sciences Beijing100012 China School of Astronomy and Space Science Nanjing University Nanjing210093 China School of Physics and Optoelectronics Xiangtan University Yuhu District Hunan Xiangtan411105 China Guizhou Provincial Key Laboratory of Radio Astronomy and Data Processing Guizhou Normal University Guiyang550001 China Institute of Astrophysics Central China Normal University Wuhan430079 China Nevada Center for Astrophysics Department of Physics and Astronomy University of

GRB 221009A is the brightest gamma-ray burst ever detected since the discovery of this kind of energetic explosions. However, an accurate measurement of the prompt emission properties of this burst is very challenging due to its exceptional brightness. With joint observations of Insight-HXMT and GECAM-C, we made an unprecedentedly accurate measurement of the emission during the first ∼1800 s of GRB 221009A, including its precursor, main emission (ME, which dominates the burst in flux), flaring emission and early afterglow, in the hard X-ray to soft gamma-ray band from ∼ 10 keV to ∼ 6 MeV. Based on the GECAM-C unsaturated data of the ME, we measure a record-breaking isotropic equivalent energy (Eiso) of ∼ 1.5 × 1055 erg, which is about eight times the total rest-mass energy of the Sun. The early afterglow data require a significant jet break between 650 s and 1100 s, most likely at ∼ 950 s from the afterglow starting time TAG, which corresponds to a jet opening angle of ∼ 0.7◦ (ηγn)1/8, where n is the ambient medium density in units of cm−3 and ηγ is the ratio between γ-ray energy and afterglow kinetic energy. The beaming-corrected total γ-ray energy Eγ is ∼ 1.15 × 1051 (ηγn)1/4 erg, which is typical for long GRBs. These results suggest that this GRB may have a special central engine, which could launch and collimate a very narrowly beamed jet with an ordinary energy budget, leading to exceptionally luminous gamma-ray radiation per unit solid angle. Alternatively, more GRBs might have such a narrow and bright beam, which are missed by an unfavorable viewing angle or have been detected without distance measurement. Copyright © 2023, The Authors. All rights reserved.

关键词： Gamma rays

来源：评论

学校读者我要写书评

暂无评论

Residual Networks for Light Field Image Super-Resolution

Residual Networks for Light Field Image Super-Resolution

引用

IEEE/CVF Conference on Computer Vision and Pattern Recognition

作者： Shuo Zhang Youfang Lin Hao Sheng Beijing Key Lab of Traffic Data Analysis and Mining School of Computer and Information Technology Beijing Jiaotong University Key Laboratory of Intelligent Passenger Service of Civil Aviation CAAC State Key Laboratory of Software Development Environment School of Computer Science and Engineering Beihang University Beijing Advanced Innovation Center for Big Data and Brain Computing Beihang University

Light field cameras are considered to have many potential applications since angular and spatial information is captured simultaneously. However, the limited spatial resolution has brought lots of difficulties in developing related applications and becomes the main bottleneck of light field cameras. In this paper, a learning-based method using residual convolutional networks is proposed to reconstruct light fields with higher spatial resolution. The view images in one light field are first grouped into different image stacks with consistent sub-pixel offsets and fed into different network branches to implicitly learn inherent corresponding relations. The residual information in different spatial directions is then calculated from each branch and further integrated to supplement high-frequency details for the view image. Finally, a flexible solution is proposed to super-resolve entire light field images with various angular resolutions. Experimental results on synthetic and real-world datasets demonstrate that the proposed method outperforms other state-of-the-art methods by a large margin in both visual and numerical evaluations. Furthermore, the proposed method shows good performances in preserving the inherent epipolar property in light field images.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Overlapping Community Detection Based on Influence and Seeds Extension

引用

Tien Tzu Hsueh Pao/Acta Electronica Sinica 2019年第1期47卷 153-160页

作者： Yu, Zhi-Yong Chen, Ji-Jie Guo, Kun Chen, Yu-Zhong Xu, Qian College of Mathematics and Computer Sciences Fuzhou University FuzhouFujian350116 China Fujian Provincial Key Laboratory of Network Computing and Intelligent Information Processing FuzhouFujian350116 China Ministry of Education Key Laboratory of Spatial Data Mining & Information Sharing FuzhouFujian350116 China State Grid Info-Telecom Great Power Science and Technology Co. Ltd. FuzhouFujian350003 China

Community detection is a significant research direction in the research of social networks. To improve the quality of seeds selection and expansion, we propose an influence seeds extension overlapping community detection (i-SEOCD) algorithm for overlapping community detection. First, i-SEOCD uses a node influence strategy to find the seed communities with tight structures. Second, on the basis of the seed communities, we calculate the similarity among communities and their neighbor nodes. The nodes whose similarity is greater than a predefined threshold are selected. Third, the strategy of optimizing a self-adaptive function is adopted to expand the communities. Finally, the free nodes in the network are assigned to their corresponding communities in order to find out all the overlapping community structures. Experiments on the real and artificial networks show that i-SEOCD is capable of discovering overlapping communities in complex social networks efficiently. © 2019, Chinese Institute of Electronics. All right reserved.

关键词： Population dynamics

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：