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

$\rho$ -Dominant Skyline Computation on data Stream

IEEE Access 2018年 6卷 53201-53213页

作者： Zhiqiong Wang Junchang Xin Linlin Ding Jianmin Ba Xiaosong Gao Neusoft Institute of Intelligent Healthcare Technology Co. Ltd. Key Laboratory of Big Data Management and Analytics Shenyang China School of Information Liaoning University Shenyang China School of Computer Science and Engineering Northeastern University Shenyang China Sino-Dutch Biomedical and Information Engineering School Northeastern University Shenyang China

Skyline query is widely used in multi-standard decision making process. As the extension to skyline query, p-dominant skyline query controls the base of the result set by adjusting data proportion, which is suitable for the application on fast deciding data stream. However, skyline query on data stream cannot satisfy the need for skyline query of corresponding value ratio, and the traditional p-dominant skyline query cannot provide skyline query with frequent data update. As a result, a data stream-based algorithm that can achieve the goal of p-dominant skyline query is proposed. First, the definitions of full-dominant relationship and p-dominance are given, after which the definitions of p-dominant skyline and p-dominant skyline based on data stream are proposed. Second, by analyzing the characters of data stream-based p-dominant skyline, a new data filtering method is established. Based on the method, p-Dominant Skyline Query on data stream over Sliding Window (DSSW) is proposed in order to improve the efficiency of p-dominant skyline query. After that, we expend the p-dominant skyline query of data stream into n-of-N p-dominant skyline query and the (n1, n 2 )-of-Np-dominant skyline query in data stream. Finally, we prove that DSSW has obvious advantages in responding time and storage skyline space by comparing with the traditional p-dominant skyline query algorithms through abundant experiments.

关键词： IEEE merchandise Microsoft Windows Indexes Decision making Heuristic algorithms Computer science

来源：评论

学校读者我要写书评

暂无评论

Train delays prediction based on feature selection and random forest

Train delays prediction based on feature selection and rando...

引用

International Conference on intelligent Transportation

作者： Yuanyuan Ji Wei Zheng Hairong Dong Pengfei Gao National Research Center of Railway Safety Assessment Beijing Jiaotong University Beijing China National Research Centre of Railway Safety Assessment and the Beijing Key Laboratory of Intelligent Traffic Data Security and Privacy Protection Technology Beijing Jiaotong University Beijing State Key Lab of Rail Traffic Control & Safety Beijing Jiaotong University Beijing

ISBN: (数字)9781728141497

ISBN: (纸本)9781728141503

Although trains are more efficient and convenient than other transportation, delays often occur. Accurately predicting the delay time of trains is of great significance to both dispatchers and passengers. The method for predicting the arrival delay time of trains is based on feature selection algorithm and machine learning. First, we collect train delay cases to sort out the delay factors. In addition to internal factors, external factors such as weather and signal failure are also considered. Then, an improved max-relevance and min-redundancy method (mRMR) is used for feature selection. Finally, we apply the method of weighted random forest (wRF) to predict the delay time. The results demonstrate that the feature selection algorithm has a prominent effect on improving the accuracy of the model, and the mean square error based on the weighted random forest has an improvement potential in forecast precision.

关键词： Delays Feature extraction Predictive models Prediction algorithms Rail transportation Correlation Random forests

来源：评论

学校读者我要写书评

暂无评论

JDsearch: A Personalized Product Search dataset with Real Queries and Full Interactions

arXiv

引用

arXiv 2023年

作者： Liu, Jiongnan Dou, Zhicheng Tang, Guoyu Xu, Sulong Gaoling School of Artificial Intelligence Renmin University of China Beijing China Engineering Research Center of Next-Generation Intelligent Search and Recommendation MOE Beijing China *** Inc. Beijing China Beijing Key Laboratory of Big Data Management and Analysis Methods China

Recently, personalized product search attracts great attention and many models have been proposed. To evaluate the effectiveness of these models, previous studies mainly utilize the simulated Amazon recommendation dataset, which contains automatically generated queries and excludes cold users and tail products. We argue that evaluating with such a dataset may yield unreliable results and conclusions, and deviate from real user satisfaction. To overcome these problems, in this paper, we release a personalized product search dataset comprised of real user queries and diverse user-product interaction types (clicking, adding to cart, following, and purchasing) collected from ***, a popular Chinese online shopping platform. More specifically, we sample about 170,000 active users on a specific date, then record all their interacted products and issued queries in one year, without removing any tail users and products. This finally results in roughly 12,000,000 products, 9,400,000 real searches, and 26,000,000 user-product interactions. We study the characteristics of this dataset from various perspectives and evaluate representative personalization models to verify its feasibility. The dataset can be publicly accessed at Github: https://***/rucliujn/JDsearch. © 2023, CC BY-NC-SA.

关键词：

来源：评论

学校读者我要写书评

暂无评论

ER: Equivariance Regularizer for Knowledge Graph Completion

arXiv

引用

arXiv 2022年

作者： Cao, Zongsheng Xu, Qianqian Yang, Zhiyong Huang, Qingming State Key Laboratory of Information Security Institute of Information Engineering CAS Beijing China School of Cyber Security University of Chinese Academy of Sciences Beijing China Key Laboratory of Intelligent Information Processing Institute of Computing Technology CAS Beijing China School of Computer Science and Technology University of Chinese Academy of Sciences Beijing China Key Laboratory of Big Data Mining and Knowledge Management Chinese Academy of Sciences Beijing China Peng Cheng Laboratory Shenzhen China

Tensor factorization and distanced based models play important roles in knowledge graph completion (KGC). However, the relational matrices in KGC methods often induce a high model complexity, bearing a high risk of overfitting. As a remedy, researchers propose a variety of different regularizers such as the tensor nuclear norm regularizer. Our motivation is based on the observation that the previous work only focuses on the "size" of the parametric space, while leaving the implicit semantic information widely untouched. To address this issue, we propose a new regularizer, namely, Equivariance Regularizer (ER), which can suppress overfitting by leveraging the implicit semantic information. Specifically, ER can enhance the generalization ability of the model by employing the semantic equivariance between the head and tail entities. Moreover, it is a generic solution for both distance based models and tensor factorization based models. The experimental results indicate a clear and substantial improvement over the state-of-the-art relation prediction methods. © 2022, CC BY.

关键词： Knowledge graph

来源：评论

学校读者我要写书评

暂无评论

Simulate Human Saccadic Scan-Paths in Target Searching

引用

International Journal of Intelligence Science 2016年第1期6卷 1-9页

作者： Lijuan Duan Jun Miao David M. W. Powers Jili Gu Laiyun Qing Beijing Key Laboratory of Trusted Computing Beijing Key Laboratory on Integration and Analysis of Large-Scale Stream Data College of Computer Science and Technology Beijing University of Technology Beijing China National Engineering Laboratory for Critical Technologies of Information Security Classified Protection Beijing China Key Laboratory of Intelligent Information Processing of Chinese Academy of Sciences(CAS) Institute of Computing Technology CAS Beijing China School of Computer Science Engineering & Maths Flinders University of South Australia Adelaide South Australia Beijing Samsung Telecom R&D Center Beijing China University of Chinese Academy of Sciences Beijing China

Human saccade is a dynamic process of information pursuit. There are many methods using either global context or local context cues to model human saccadic scan-paths. In contrast to them, this paper introduces a model for gaze movement control using both global and local cues. To test the performance of this model, an experiment is done to collect human eye movement data by using an SMI iVIEW X Hi-Speed eye tracker with a sampling rate of 1250 Hz. The experiment used a two-by-four mixed design with the location of the targets and the four initial positions. We compare the saccadic scan-paths generated by the proposed model against human eye movement data on a face benchmark dataset. Experimental results demonstrate that the simulated scan-paths by the proposed model are similar to human saccades in term of the fixation order, Hausdorff distance, and prediction accuracy for both static fixation locations and dynamic scan-paths.

关键词： Saccadic Scan-Paths Eye Movement Fixation Locations Dynamic Scan-Paths

来源：评论

学校读者我要写书评

暂无评论

Visible-Thermal Multiple Object Tracking: Large-scale Video dataset and Progressive Fusion Approach

arXiv

引用

arXiv 2024年

作者： Zhu, Yabin Wang, Qianwu Li, Chenglong Tang, Jin Huang, Zhixiang The Key Laboratory of Intelligent Computing and Signal Processing Ministry of Education Anhui University School of Public Safety and Emergency Management Anhui University of Science and Technology Hefei231131 China School of Artificial Intelligence Anhui University Hefei230601 China Information Materials and Intelligent Sensing Laboratory of Anhui Province Anhui Provincial Key Laboratory of Security Artificial Intelligence School of Artificial Intelligence Anhui University Hefei230601 China Information Materials and Intelligent Sensing Laboratory of Anhui Province Anhui Provincial Key Laboratory of Multimodal Cognitive Computation School of Computer Science and Technology Anhui University Hefei230601 China Center for Big Data and Population Health of IHM China

The complementary benefits from visible and thermal infrared data are widely utilized in various computer vision task, such as visual tracking, semantic segmentation and object detection, but rarely explored in Multiple Object Tracking (MOT). In this work, we contribute a large-scale Visible-Thermal video benchmark for MOT, called VT-MOT. VT-MOT has the following main advantages. 1) The data is large scale and high diversity. VT-MOT includes 582 video sequence pairs, 401k frame pairs from surveillance, drone, and handheld platforms. 2) The cross-modal alignment is highly accurate. We invite several professionals to perform both spatial and temporal alignment frame by frame. 3) The annotation is dense and high-quality. VT-MOT has 3.99 million annotation boxes annotated and double-checked by professionals, including heavy occlusion and object re-acquisition (object disappear and reappear) challenges. To provide a strong baseline, we design a simple yet effective tracking framework, which effectively fuses temporal information and complementary information of two modalities in a progressive manner, for robust visible-thermal MOT. A comprehensive experiment are conducted on VT-MOT and the results prove the superiority and effectiveness of the proposed method compared with state-of-the-art methods. From the evaluation results and analysis, we specify several potential future directions for visible-thermal MOT. The project is released in https://***/wqw123wqw/PFTrack. Copyright © 2024, The Authors. All rights reserved.

关键词： Semantic Segmentation

来源：评论

学校读者我要写书评

暂无评论

Geometry Interaction Knowledge Graph Embeddings

arXiv

引用

arXiv 2022年

作者： Cao, Zongsheng Xu, Qianqian Yang, Zhiyong Cao, Xiaochun Huang, Qingming State Key Laboratory of Information Security Institute of Information Engineering CAS Beijing China School of Cyber Security University of Chinese Academy of Sciences Beijing China Key Laboratory of Intelligent Information Processing Institute of Computing Technology CAS Beijing China School of Computer Science and Technology University of Chinese Academy of Sciences Beijing China Key Laboratory of Big Data Mining and Knowledge Management Chinese Academy of Sciences Beijing China Peng Cheng Laboratory Shenzhen China

Knowledge graph (KG) embeddings have shown great power in learning representations of entities and relations for link prediction tasks. Previous work usually embeds KGs into a single geometric space such as Euclidean space (zero curved), hyperbolic space (negatively curved) or hyperspherical space (positively curved) to maintain their specific geometric structures (e.g., chain, hierarchy and ring structures). However, the topological structure of KGs appears to be complicated, since it may contain multiple types of geometric structures simultaneously. Therefore, embedding KGs in a single space, no matter the Euclidean space, hyperbolic space or hyperspheric space, cannot capture the complex structures of KGs accurately. To overcome this challenge, we propose Geometry Interaction knowledge graph Embeddings (GIE), which learns spatial structures interactively between the Euclidean, hyperbolic and hyperspherical spaces. Theoretically, our proposed GIE can capture a richer set of relational information, model key inference patterns, and enable expressive semantic matching across entities. Experimental results on three well-established knowledge graph completion benchmarks show that our GIE achieves the state-of-the-art performance with fewer parameters. © 2022, CC BY.

关键词： Knowledge graph

来源：评论

学校读者我要写书评

暂无评论

Theoretical Analysis on Index System of Ecological Balanced Fertilization for Three Crops

引用

Meteorological and Environmental Research 2020年第5期11卷 91-95页

作者： Shuojin WANG Changhong MI Zhiping HUANG Shutian LIU Xianda HOU Hongyan ZHENG Jian DING Ling LU Yanlin HOU Guangxi Geographical Indication Crops Research Center of Big Data Mining and Experimental Engineering Technology Nanning Normal UniversityNanning 530001China Guangxi Key Laboratory of Earth Surface Processes and Intelligent Simulation Nanning Normal UniversityNanning 530001China Key Laboratory of Environment Change and Resources Use in Beibu Gulf(Nanning Normal University) Nanning 530001China Agro-Environmental Protection Institute Ministry of Agriculture and Rural AffairsTianjin 300191China

This paper analyzed theoretical basis of ecological balanced fertilization by data mining method based on the relationships among relative abundance-deficiency values of soil nutrients,optimum fertilization amounts and nutrient conversion rates of N,P and K for rice,wheat and maize in column *** results and conclusions were as follows:①the scientific basis of guiding fertilization by the relative abundance-deficiency value of soil nutrient was insufficient.②The scientific basis for predicting fertilizer amount according to nutrient conversion rate was sufficient.③There was consistency among the relative abundance-deficiency values of soil nutrients,indicating that the soil nutrient balance was important to the production.④There was some consistency among the optimum fertilizer amounts,indicating that N,P and K fertilizer should be balanced.⑤There was some consistency among nutrient conversion rates,indicating that nutrient uptake was consistent,which required the consistency among relative abundance-deficiency values of soil *** there was inconsistency,it needed to be supplemented by means of fertilization.⑥The relative abundance-deficiency value of soil nutrient and optimum fertilizer amounts of other nutrients were negatively correlated mostly,indicating that if the relative abundance-deficiency value of soil nutrient was high,the others also should be high,resulting in optimum fertilizer amounts of other nutrients decreased.⑦The nutrient conversion rate was negatively correlated mostly with the optimal fertilizer amounts of other nutrients,indicating that more fertilizer amount of one nutrient lowered its own conversion rate,mean while also reduced the conversion rates of other *** embodied the unity and balance of nutrient absorption by the crops.

关键词： Optimum yield Optimum fertilization amount Nutrient conversion rate Fertilizer utilization ratio Relative abundance-deficiency value of soil nutrient

来源：评论

学校读者我要写书评

暂无评论

Two-Stage OD Flow Prediction for Emergency in Urban Rail Transit

引用

IEEE Transactions on intelligent Transportation Systems 2024年第1期25卷 920-928页

作者： Zhu, Guangyu Ding, Jiacun Wei, Yun Yi, Yang Xu, Sendren Sheng-Dong Wu, Edmond Q. Beijing Jiaotong University Key Lab. of Transport Industry of Big Data Application Technologies for Comprehensive Transport The Beijing Research Center of Urban Traffic Information Sensing and Service Technologies Beijing100044 China Beijing Mass Transit Railway Operation Corporation Ltd. Beijing100014 China Yangzhou University College of Information Engineering Yangzhou225127 China National Taiwan University of Science and Technology Automation and Control Center The Graduate Institute of Automation and Control Taipei106335 Taiwan Shanghai Jiao Tong University Key Laboratory of System Control and Information Processing Ministry of Education of China The Shanghai Engineering Research Center of Intelligent Control and Management Department of Automation Shanghai200240 China

Urban rail transit (URT) is vulnerable to natural disasters and social emergencies including fire, storm and epidemic (such as COVID-19), and real-time origin-destination (OD) flow prediction provides URT operators with important information to ensure the safety of URT system. However, hindered by the high dimensionality of OD flow and the lack of supportive information reflecting the real-time passenger flow changes, study in this area is at the beginning stage. A novel model consisting of two stages is proposed for OD flow prediction. The first stage predicts the inflows of all stations by Long Short-Term Memory (LSTM) in real time, where the dimension is reduced compared with predicting OD flows directly. In the second stage, the notion of separation rate, namely, the proportion of inbound passengers bounding for another station, is estimated. Finally, The OD flow is predicted by multiplying the inflow and separation rate. Experiments based on Hangzhou Metro dataset show the proposed model outperforms the contrast model in weighted mean average error (WMAE) and weighted mean square error (WMSE). Results also suggest that the proposed prediction model performs better on weekdays than on weekends, and with greater accuracy on larger OD flows. © 2000-2011 IEEE.

关键词： Forecasting

来源：评论

学校读者我要写书评

暂无评论

A Low-Area Overhead Secure Scan Architecture Resisting Scan-Based Attacks for Crypto Chips

A Low-Area Overhead Secure Scan Architecture Resisting Scan-...

引用

2017 International MultiConference of Engineers and Computer Scientists, IMECS 2017

作者： Weizheng, Wang Jincheng, Wang Shuo, Cai Peng, Liu Tieqiao, Liu College of Computer and Communication Engineering Hunan Provincial Key Laboratory of Intelligent Processing of Big Data on Transportation Changsha University of Science and Technology Changsha Hunan410114 China College of Computer and Communication Engineering Changsha University of Science and Technology Changsha410114 China College of Computer and Communication Engineering Changsha University of Science and Technology Changsha410114 China Information Science and Engineering Department Hunan University Changsha410082 China Management School Hangzhou Dianzi University Hangzhou310018 China

ISBN: (纸本)9789881404732

Scan design is a widely used design-for-testability (DFT) technique that improves the controllability and observability of integrated circuits (ICs) resulting in the facilitation of the testing. However, it can also be used to access secret information of crypto chips, and thus threaten dramatically the security of the cipher keys. In this paper, we propose a secure scan DFT architecture to thwart scan-based side-channel attacks. This architecture provides the scan chain reset mechanism, and thus can prevent these attacks based on mode switching. Meanwhile, the secret key is isolated from scan chains of an advanced encryption standard (AES) design in the test mode. Therefore, it can also halt the test-mode-only scan attacks. The proposed secure scan DFT technique ensures the security without compromising the testability of original chip. Most important of all, the secure scan test is implemented with extremely low hardware overhead.

关键词： Design for testability

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：