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

Factors correlation mining on railway accidents using association rule learning algorithm

学校读者我要写书评

暂无评论

Factors correlation mining on railway accidents using associ...

International Conference on Intelligent Transportation

作者： Yakun Wang 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 China State Key Lab of Rail Traffic Control & Safety Beijing Jiaotong University Beijing China

ISBN: (数字)9781728141497

ISBN: (纸本)9781728141503

Although much research work for the operation safety has been taken in the railway domain, some accidents still occur because past experiences of accident analysis were not fully accumulated for safety improvement. This study aims to identify potential causal relationships among the many factors playing a role in railway accidents. A new interestingness measure, Confidence_interestingness ("C_" Inter) and corresponding improved algorithm, Positive and Negative Association Rules Algorithm based on "C_" Inter (PNARA_CI) were put forward in our study. Compared with traditional association rule mining algorithms, the PNARA_CI does not generate candidate association rules by means of frequent itemsets, but by the combination between every two accident factors, which can mine the positive and negative association rules with practical value to the maximum. And they were applied to railway accidents data to explore the association rules of the causal factors in the case study. The effectiveness of the algorithm was verified.

关键词： Railway accidents Data mining Rail transportation Itemsets Safety Databases Task analysis

B2SFinder: Detecting Open-Source Software Reuse in COTS Software

学校读者我要写书评

暂无评论

B2SFinder: Detecting Open-Source Software Reuse in COTS Soft...

IEEE International Conference on Automated Software Engineering (ASE)

作者： Zimu Yuan Muyue Feng Feng Li Gu Ban Yang Xiao Shiyang Wang Qian Tang He Su Chendong Yu Jiahuan Xu Aihua Piao Jingling Xuey Wei Huo Institute of Information Engineering Chinese Academy of Sciences Key Laboratory of Network Assessment Technology Chinese Academy of Sciences Beijing Key Laboratory of Network Security and Protection Technology and School of Cyber Security University of Chinese Academy of Sciences University of New South Wales

COTS software products are developed extensively on top of OSS projects, resulting in OSS reuse vulnerabilities. To detect such vulnerabilities, finding OSS reuses in COTS software has become imperative. While scalable to tens of thousands of OSS projects, existing binary-to-source matching approaches are severely imprecise in analyzing COTS software products, since they support only a limited number of code features, compute matching scores only approximately in measuring OSS reuses, and neglect the code structures in OSS projects. We introduce a novel binary-to-source matching approach, called B2SFINDER 1 , to address these limitations. First of all, B2SFINDER can reason about seven kinds of code features that are traceable in both binary and source code. In order to compute matching scores precisely, B2SFINDER employs a weighted feature matching algorithm that combines three matching methods (for dealing with different code features) with two importance-weighting methods (for computing the weight of an instance of a code feature in a given COTS software application based on its specificity and occurrence frequency). Finally, B2SFINDER identifies different types of code reuses based on matching scores and code structures of OSS projects. We have implemented B2SFINDER using an optimized data structure. We have evaluated B2SFINDER using 21991 binaries from 1000 popular COTS software products and 2189 candidate OSS projects. Our experimental results show that B2SFINDER is not only precise but also scalable. Compared with the state ofthe art, B2SFINDER has successfully found up to 2.15× as many reuse cases in 53.85 seconds per binary file on average. We also discuss how B2SFINDER can be leveraged in detecting OSS reuse vulnerabilities in practice.

关键词： Open source software Libraries Software algorithms security Switches Arrays

Two new families of quantum synchronizable codes

学校读者我要写书评

暂无评论

arXiv 2019年

作者： Luo, Lan Ma, Zhi Lin, Dongdai Henan Key Laboratory of Network Cryptography Technology Zhengzhou450001 State Key Laboratory of Information Security Beijing100093

In this paper, we present two new ways of quantum synchronization coding based on the (u + v\u - v) construction and the product construction respectively and greatly enrich the varieties of available quantum synchro-nizable codes. The circumstances where the maximum synchronization error tolerance can be reached are explained for both constructions. Furthermore, repeated-root cyclic codes derived from the (u + v\u - v) construction are shown to be able to provide better Pauli error-correcting capability than BCH codes. Copyright © 2019, The Authors. All rights reserved.

关键词：

ReGO: Reference-Guided Outpainting for Scenery Image

学校读者我要写书评

暂无评论

arXiv 2021年

作者： Wang, Yaxiong Wei, Yunchao Qian, Xueming Zhu, Li Yang, Yi The School of Software Engineering Xi’an Jiaotong University Xi'An710049 China Institute of Information Science Beijing Jiaotong University Beijing100000 China The Key Laboratory for Intelligent Networks and Network Security Ministry of Education Xi’an Jiaotong University Xi'An710049 China The SMILES Laboratory Xi’an Jiaotong University Xi'An710049 China Zhibian Technology Co. Ltd. Taizhou317000 China The School of Software Xi’an Jiaotong University Xi'An710049 China School of Computer Science and Technology Zhejiang University Hangzhou310000 China

We aim to tackle the challenging yet practical scenery image outpainting task in this work. Recently, generative adversarial learning has significantly advanced the image outpainting by producing semantic consistent content for the given image. However, the existing methods always suffer from the blurry texture and the artifacts of the generative part, making the overall outpainting results lack authenticity. To overcome the weakness, this work investigates a principle way to synthesize texture-rich results by borrowing pixels from its neighbors (i.e. , reference images), named Reference-Guided Outpainting (ReGO). Particularly, the ReGO designs an Adaptive Content Selection (ACS) module to transfer the pixel of reference images for texture compensating of the target one. To prevent the style of the generated part from being affected by the reference images, a style ranking loss is further proposed to augment the ReGO to synthesize style-consistent results. Extensive experiments on two sceneary benchmarks, NS6K [3], NS8K [9] and SUN Attribute [25], well demonstrate the effectiveness of our ReGO. Our code is available at https://***/wangyxxjtu/ReGOPytorch. © 2021, CC BY.

关键词： Textures

How Does Knowledge Graph Embedding Extrapolate to Unseen Data: A Semantic Evidence View

学校读者我要写书评

暂无评论

arXiv 2021年

作者： Li, Ren Cao, Yanan Zhu, Qiannan Bi, Guanqun Fang, Fang Liu, Yi Li, Qian Institute of Information Engineering Chinese Academy of Sciences China School of Cyber Security University of Chinese Academy of Sciences China Gaoling School of Artificial Intelligence Renmin University of China China Beijing Key Laboratory of Big Data Management and Analysis Methods China National Computer Network Emergency Response Technical Team Coordination Center of China China University of Technology Sydney Australia

Knowledge Graph Embedding (KGE) aims to learn representations for entities and relations. Most KGE models have gained great success, especially on extrapolation scenarios. Specifically, given an unseen triple (h, r, t), a trained model can still correctly predict t from (h, r,?), or h from (?, r, t), such extrapolation ability is impressive. However, most existing KGE works focus on the design of delicate triple modeling function, which mainly tells us how to measure the plausibility of observed triples, but offers limited explanation of why the methods can extrapolate to unseen data, and what are the important factors to help KGE extrapolate. Therefore in this work, we attempt to study the KGE extrapolation of two problems: 1. How does KGE extrapolate to unseen data? 2. How to design the KGE model with better extrapolation ability? For the problem 1, we first discuss the impact factors for extrapolation and from relation, entity and triple level respectively, propose three Semantic Evidences (SEs), which can be observed from train set and provide important semantic information for extrapolation. Then we verify the effectiveness of SEs through extensive experiments on several typical KGE methods. For the problem 2, to make better use of the three levels of SE, we propose a novel GNN-based KGE model, called Semantic Evidence aware Graph Neural network (SE-GNN). In SE-GNN, each level of SE is modeled explicitly by the corresponding neighbor pattern, and merged sufficiently by the multi-layer aggregation, which contributes to obtaining more extrapolative knowledge representation. Finally, through extensive experiments on FB15k-237 and WN18RR datasets, we show that SE-GNN achieves state-of-the-art performance on Knowledge Graph Completion task and performs a better extrapolation ability. Our code is available at https://***/renli1024/SE-GNN. Copyright © 2021, The Authors. All rights reserved.

关键词： Knowledge graph

Investigating Bi-level optimization for learning and vision from a unified perspective: A survey and beyond

学校读者我要写书评

暂无评论

arXiv 2021年

作者： Liu, Risheng Gao, Jiaxin Zhang, Jin Meng, Deyu Lin, Zhouchen DUT-RU International School of Information Science & Engineering Dalian University of Technology Key Laboratory for Ubiquitous Network Service Software of Liaoning Province Dalian116024 China Department of Mathematics Southern University of Science and Technology National Center for Applied Mathematics Shenzhen China School of Mathematics and Statistics Ministry of Education Key Lab of Intelligent Networks and Network Security Xi’an Jiaotong University Xi’an Shaanxi China School of Electronics Engineering and Computer Science Peking University Beijing100871 China Cooperative Medianet Innovation Center Shanghai Jiao Tong University Shanghai200240 China

Bi-Level Optimization (BLO) is originated from the area of economic game theory and then introduced into the optimization community. BLO is able to handle problems with a hierarchical structure, involving two levels of optimization tasks, where one task is nested inside the other. In machine learning and computer vision fields, despite the different motivations and mechanisms, a lot of complex problems, such as hyper-parameter optimization, multi-task and meta learning, neural architecture search, adversarial learning and deep reinforcement learning, actually all contain a series of closely related subproblms. In this paper, we first uniformly express these complex learning and vision problems from the perspective of BLO. Then we construct a best-response-based single-level reformulation and establish a unified algorithmic framework to understand and formulate mainstream gradient-based BLO methodologies, covering aspects ranging from fundamental automatic differentiation schemes to various accelerations, simplifications, extensions and their convergence and complexity properties. Last but not least, we discuss the potentials of our unified BLO framework for designing new algorithms and point out some promising directions for future research. © 2021, CC BY.

关键词： Deep learning

Is AI Robust Enough for Scientific Research?

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Zhang, Jun-Jie Song, Jiahao Wang, Xiu-Cheng Li, Fu-Peng Liu, Zehan Chen, Jian-Nan Dang, Haoning Wang, Shiyao Zhang, Yiyan Xu, Jianhui Shi, Chunxiang Wang, Fei Pang, Long-Gang Cheng, Nan Zhang, Weiwei Zhang, Duo Meng, Deyu Northwest Institute of Nuclear Technology No. 28 Pingyu Road Shaanxi Xi’an710024 China School of Telecommunications Engineering Xidian University No. 2 South Taibai Road Shaanxi Xi’an710071 China State Key Laboratory of ISN No. 2 South Taibai Road Shaanxi Xi’an710071 China Institute of Particle Physics Central China Normal University No. 152 Luoyu Road Hubei Wuhan30079 China School of Computer Science and Technology Xi’an Jiaotong University No. 28 Xianning West Road Shaanxi Xi’an710049 China Ministry of Education Key Lab of Intelligent Networks and Network Security Xi’an Jiaotong University No. 28 Xianning West Road Shaanxi Xi’an710049 China Guangzhou Institute of Geography Academy of Sciences No. 100 Xianlie Road Guangdong Guangzhou510070 China National Meteorological Information Center Beijing100044 China MDX Research Center for Element Strategy Institute of Integrated Research Institute of Science Tokyo Midori-ku Yokohama226-8503 Japan School of Physics and Information Technology Shaanxi Normal University No. 620 West Chang’an Avenue Shaanxi Xi’an710119 China School of Aeronautics Northwestern Polytechnical University No. 127 West Youyi Road Shaanxi Xi’an710072 China AI for Science Institute Beijing100080 China DP Technology Beijing100080 China Academy for Advanced Interdisciplinary Studies Peking University Beijing100871 China School of Mathematics and Statistics Xi’an Jiaotong University No. 28 Xianning West Road Shaanxi Xi’an710049 China

We uncover a phenomenon largely overlooked by the scientific community utilizing AI: neural networks exhibit high susceptibility to minute perturbations, resulting in significant deviations in their outputs. Through an analysis of five diverse application areas—weather forecasting, chemical energy and force calculations, fluid dynamics, quantum chromodynamics, and wireless communication—we demonstrate that this vulnerability is a broad and general characteristic of AI systems. This revelation exposes a hidden risk in relying on neural networks for essential scientific computations, calling further studies on their reliability and security. © 2024, CC0.

关键词： Weather forecasting

In-situ data scheduling optimization based on rainbow DQN for IIoT

学校读者我要写书评

暂无评论

Future Generation Computer Systems 2026年 174卷

作者： Peiying Zhang Siyi Li Lizhuang Tan Neeraj Kumar Jian Wang Kai Liu Qingdao Institute of Software College of Computer Science and Technology China University of Petroleum (East China) Qingdao 266580 China Shandong Key Laboratory of Intelligent Oil & Gas Industrial Software Qingdao 266580 China Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center (National Supercomputer Center in Jinan) Qilu University of Technology (Shandong Academy of Sciences) Jinan 250014 China Department of Computer Science and Engineering Thapar Institute of Engineering and Technology Patiala 147004 India Department of Computer Science University of Economics and Human Sciences Warszawa 01-043 Poland Department of Networks and Communications College of Computer Science and Information Technology Imam Abdulrahman Bin Faisal University Dammam 31441 Saudi Arabia College of Science China University of Petroleum (East China) Qingdao 266580 China Beijing National Research Center for Information Science and Technology Tsinghua University Beijing 100084 China State Key Laboratory of Space Network and Communications Tsinghua University Beijing 100084 China

In industrial systems, in-situ computing refers to a mode of local or proximate data processing within the cloud–edge-terminal architecture. In the Industrial Internet of Things (IIoT) environment, servers are typically deployed near terminal devices to coordinate and manage the scheduling of in-situ data, forming a comprehensive in-situ server system. With the rapid growth of IIoT terminal devices, challenges such as high processing delays and severe demand congestion arise in the in-situ data scheduling process. To address this challenge, this paper proposes a scheduling optimization scheme based on Rainbow DQN. The scheme designs a scheduling buffer and classification strategy to distinguish in-situ data based on storage demand characteristics, thereby optimizing the scheduling process. At the same time, a multi-level storage structure is introduced to store in-situ data classified according to the scheduling strategy. Additionally, the Rainbow DQN algorithm is utilized to assist in the scheduling decision-making of in-situ data retrieval, effectively alleviating system congestion while ensuring certain throughput performance. Extensive simulation experiments show that the Rainbow DQN algorithm achieves a reduction of 60.82% in average waiting delay, 62.94% in average unprocessed demand, and a 58.27% reduction in average completion delay.

关键词：

Golden grain: Building a secure and decentralized model marketplace for MLaaS

学校读者我要写书评

暂无评论

arXiv 2020年

作者： Weng, Jiasi Weng, Jian Cai, Chengjun Huang, Hongwei Wang, Cong The College of Information 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 The Department of Computer Science City University of Hong Kong Hong Kong Hong Kong The City University of Hong Kong Shenzhen Research Institute Shenzhen518057 China

ML-as-a-service (MLaaS) becomes increasingly popular and revolutionizes the lives of people. A natural requirement for MLaaS is, however, to provide highly accurate prediction services. To achieve this, current MLaaS systems integrate and combine multiple well-trained models in their services. Yet, in reality, there is no easy way for MLaaS providers, especially for startups, to collect sufficiently well-trained models from individual developers, due to the lack of incentives. In this paper, we aim to fill this gap by building up a model marketplace, called as Golden Grain, to facilitate model sharing, which enforces the fair model-money swapping process between individual developers and MLaaS providers. Specifically, we deploy the swapping process on the blockchain, and further introduce a blockchain-empowered model benchmarking process for transparently determining the model prices according to their authentic performances, so as to motivate the faithful contributions of well-trained models. Especially, to ease the blockchain overhead for model benchmarking, our marketplace carefully offloads the heavy computation and designs a secure off-chain on-chain interaction protocol based on a trusted execution environment (TEE), for ensuring both the integrity and authenticity of benchmarking. We implement a prototype of our Golden Grain on the Ethereum blockchain, and conduct extensive experiments using standard benchmark datasets to demonstrate the practically affordable performance of our design. © 2020, CC BY.

关键词： Blockchain