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

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

来源：评论

学校读者我要写书评

暂无评论

Interpretation-enabled software reuse detection based on a multi-level birthmark model

arXiv

引用

arXiv 2021年

作者： Xu, Xi Zheng, Qinghua Yan, Zheng Fan, Ming Jia, Ang Liu, Ting Key Laboratory of Intelligent Networks and Network Security Ministry of Education China School of Computer Science and Technology Xi'an Jiaotong University China School of Cyber Science and Engineering Xi'an Jiaotong University China State Key Lab on Integrated Services Networks School of Cyber Engineering Xidian University China Department of Communications and Networking Aalto University Finland

Software reuse, especially partial reuse, poses legal and security threats to software development. Since its source codes are usually unavailable, software reuse is hard to be detected with interpretation. On the other hand, current approaches suffer from poor detection accuracy and efficiency, far from satisfying practical demands. To tackle these problems, in this paper, we propose ISRD, an interpretation-enabled software reuse detection approach based on a multi-level birthmark model that contains function level, basic block level, and instruction level. To overcome obfuscation caused by cross-compilation, we represent function semantics with Minimum Branch Path (MBP) and perform normalization to extract core semantics of instructions. For efficiently detecting reused functions, a process for "intent search based on anchor recognition" is designed to speed up reuse detection. It uses strict instruction match and identical library call invocation check to find anchor functions (in short anchors) and then traverses neighbors of the anchors to explore potentially matched function pairs. Extensive experiments based on two real-world binary datasets reveal that ISRD is interpretable, effective, and efficient, which achieves 97.2% precision and 94.8% recall. Moreover, it is resilient to cross-compilation, outperforming state-of-the-art approaches. © 2021, CC BY-NC-SA.

关键词： computer software reusability

来源：评论

学校读者我要写书评

暂无评论

Interpretation-Enabled Software Reuse Detection Based on a Multi-level Birthmark Model

Interpretation-Enabled Software Reuse Detection Based on a M...

引用

International Conference on Software Engineering (ICSE)

作者： Xi Xu Qinghua Zheng Zheng Yan Ming Fan Ang Jia Ting Liu Key Laboratory of Intelligent Networks and Network Security Ministry of Education China School of Computer Science and Technology Xi’an Jiaotong University China State Key Lab on Integrated Services Networks School of Cyber Engineering Xidian University China Department of Communications and Networking Aalto University Finland School of Cyber Science and Engineering Xi’an Jiaotong University China

ISBN: (纸本)9781665402965;9781665448314

关键词： Law Semantics Libraries security Software reusability Software engineering Resilience

来源：评论

学校读者我要写书评

暂无评论

Trading Based Service-Oriented Spectrum-Aware RAN-Slicing Under Spectrum Sharing

Trading Based Service-Oriented Spectrum-Aware RAN-Slicing Un...

引用

IEEE Conference on Wireless Communications and networking

作者： Kajia Jiao Xuanheng Li Miao Pan Fan Jiang Ming Li School of Information and Communication Engineering Dalian University of Technology Dalian China Department of Electrical and Computer Engineering University of Houston Houston TX USA Shaanxi Key Laboratory of Information Communication Network and Security Xi’an University of Posts and Telecommunications Xian Shaanxi China

ISBN: (数字)9781728131061

ISBN: (纸本)9781728131078

The fast development on emerging services makes our telecommunications networks witness two key problems. One is the flexibility to fulfill the diverse service requests and the other is the shortage on spectrum. network slicing and spectrum sharing have been regarded as two prominent solutions, which, however, are barely jointly studied. When taking the shared spectrum into account, its unique feature of heterogeneity and uncertainty will bring new challenges for the slicing. In this paper, we propose a service-oriented spectrum-aware RAN-slicing trading (SSRT) scheme with a comprehensive consideration on both aspects. For the SSRT scheme, we jointly slice three kinds of resources, namely, time, spectrum (including both licensed one and shared one), and network facilities, according to the diverse traffic requests, which are classified into delay-tolerant (DT) ones and delay-sensitive (DS) ones, as well as the willing payments from different service providers (SPs). To achieve both inter-slice and intra-slice isolation, we construct a three-dimensional (3D) conflict graph and formulate the SSRT scheme into a mixed-integer nonlinear programming (MINLP) problem with a cross-layer spectrum-aware resource allocation and a hybrid transmission mode (including both single-hop and multi-hop). Since finding all the maximum independent sets (MIS) for the 3D conflict graph is an NP-hard problem, we further develop an iterative heuristic algorithm for the MIS determination.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Velocity-driven particle swarm optimization 8

Velocity-driven particle swarm optimization

引用

8th International Conference on Computing and Pattern Recognition, ICCPR 2019

作者： Li, Wei Fan, Yaochi Jiang, Qiaoyong Xu, Qingzheng School of Computer Science and Engineering Xi'An University of Technology China Shaanxi Key Laboratory for Network Computing and Security Technology Xi'an710048 China School of Computer Science and Engineering Xi'An University of Technology Xi'an710048 China College of Information and Communication National University of Defense Technology Xi'an710106 China

ISBN: (纸本)9781450376570

Particle swarm optimization (PSO) is an efficient nature-inspired optimization algorithm, which has been widely applied in many engineering fields. The performance of particle swarm optimization (PSO) has been significantly influenced by velocity update strategy. Traditionally, each particle updates its velocity based on its historical best experience and the global best experience, which may make the swarm lose its diversity and lead to premature convergence. To strengthen the performance of PSO, this paper proposes an improved PSO with the velocity-driven strategy (VD-PSO). In VD-PSO algorithm, the particles whose velocities are driven by better velocities focus on exploitation. The historical velocities, such as better velocities, may effectively characterize the landscape information of the optimization problems. In addition, the particles focus on exploration through information exchange amongst velocities. To verify the effectiveness of the proposed algorithm, experiments are conducted with CEC2014 test problems. The experimental results demonstrate the effectiveness of the proposed algorithm for solving the global optimization problems. © 2019 Association for Computing Machinery.

关键词： Velocity

来源：评论

学校读者我要写书评

暂无评论

A novel Image security Protection Method Based on DCT Compression Theory and Hyper-chaotic Mapping

引用

Journal of Physics: Conference Series 2021年第1期2066卷

作者： Xianglian Xue Haiyan Jin School of Computer Science and Engineering Xi'an University of Technology Xi'an 710077Shaanxi China Shaanxi University of Chinese Medicine Xianyang712046Shaanxi China Shaanxi Key Laboratory for Network Computing and Security Technology Xi'an University of Technology Xi'an710077Shaanxi China

This paper studies the current situation of image compression encryption and analyzes the influence of low frequency (DC coefficient) and high frequency (AC coefficient) on image structure in DCT transformation. Based on this, a novel image security protection method based on DCT compression theory and hyper-chaotic mapping is proposed. First, the position of the pixel of the original image is disturbed, and converts the image from spatial domain into frequency domain by the two-dimensional DCT transformation and quantization. Second, change the pixel values by modifying the values of the sign bit of AC coefficient and DC coefficient. At last, the encrypted image is obtained by carrying out inverse quantization, inverse transformation and reverse operation by bit.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Secure Data Propagation in Edge-Cloud Orchestrated Computing Paradigms: Statistcs and Taxonomy

Secure Data Propagation in Edge-Cloud Orchestrated Computing...

引用

International Conference on Advanced Cloud and Big Data (CBD)

作者： Feng Yu Xixian Li Huimin Zhang Li-e Wang College of computer science Guangxi Normal University Guilin China Key Laboratory of Computer Network and Information Integration Southeast University Nanjing China Guangxi Key Lab of Multi-source Information Mining &Security Guilin China Guangxi Key Laboratory of Trusted Software Guilin University of Electronic Technology Guilin China

Despite the importance of the secure data propagation in the edge-cloud orchestrated computing paradigms, to the best of our knowledge, there is lack of systematic and comprehensive review on this research topic. The purpose of this article is to provide a systematic literature survey on secure data propagation in edge-cloud orchestrated computing environment to examine the current technical achievements published between 2010 and February 2020. The brief contributions of the paper are as follows: (1)providing a comprehensive literature review of the secure data propagation approaches in the edge-cloud orchestrated computing paradigms, (2) designing a methodology for document retrieval and selection, (3) presenting analysis and comparison for main technique methods of secure data propagation in hybrid edge-cloud environment.

关键词： Systematics Bibliographies Taxonomy Big Data

来源：评论

学校读者我要写书评

暂无评论

A Control Task Assignment Algorithm based on sub-graph isomorphism

A Control Task Assignment Algorithm based on sub-graph isomo...

引用

International Conference on Advanced Cloud and Big Data (CBD)

作者： Feng Yu Xixian Li Huimin Zhang Li-e Wang College of computer science Guangxi Normal University Guilin China Key Laboratory of Computer Network and Information Integration Southeast University Nanjing China Guangxi Key Lab of Multi-source Information Mining & Security Guilin China Guangxi Key Laboratory of Trusted Software Guilin University of Electronic Technology Guilin China

To enhance the controllability and trustworthiness of the Internet, a new network control architecture has been presented with control task extracted to the intra-domain control node and executed in distributed multi-domain cooperative style. The study on control task assigning approach plays a central role in this network control pattern and shares some features with virtual network mapping problem. Different from the previous heuristics-based algorithms, we designs a baseline assigning algorithm which tests if the control task request can be mapped to a sub-graph of substrate control network or not without control task migration. Subsequently, an extend version is described under task migration considered. Our experiment evaluations show the impact of parameters on the runtime and assigning accuracy rate.

关键词： Cloud computing Backtracking Runtime Heuristic algorithms Process control Big Data Feature extraction

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Algorithms for Globally-Optimal Secure Signaling over Gaussian MIMO Wiretap Channels Under Interference Constraints

arXiv

引用

arXiv 2020年

作者： Dong, Limeng Loyka, Sergey Li, Yong Ministry of Education Key Lab for Intelligent Networks and Network Security School of Information and Communications Engineering Xi’an Jiaotong University Xi’anShaanxi710049 China School of Electrical Engineering and Computer Science University of Ottawa Canada School of Electronics and Information Northwestern Polytechnical University Xian China

Multi-user Gaussian MIMO wiretap channel is considered under interference power constraints (IPC), in addition to the total transmit power constraint (TPC). Algorithms for global maximization of its secrecy rate are proposed. Their convergence to the secrecy capacity is rigorously proved and a number of properties are established analytically. Unlike known algorithms, the proposed ones are not limited to the MISO case and are proved to converge to a global rather than local optimum in the general MIMO case, even when the channel is not degraded. In practice, the convergence is fast as only a small to moderate number of Newton steps is required to achieve a high precision level. The interplay of TPC and IPC is shown to result in an unusual property when an optimal point of the max-min problem does not provide an optimal transmit covariance matrix in some (singular) cases. To address this issue, an algorithm is developed to compute an optimal transmit covariance matrix in those singular cases. It is shown that this algorithm also solves the dual (nonconvex) problems of globally minimizing the total transmit power subject to the secrecy and interference constraints;it provides the minimum transmit power and respective signaling strategy needed to achieve the secrecy capacity, hence allowing power savings. Copyright © 2020, The Authors. All rights reserved.

关键词： Covariance matrix

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：