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

A Lightweight OS-Level Virtualization Architecture Based on Android

学校读者我要写书评

暂无评论

A Lightweight OS-Level Virtualization Architecture Based on ...

2017 2nd International Conference on Computer, Network Security and communication Engineering(CNSCE2017)

作者： Bo-wen LIU Nai-jie GU De-he GU School of Computer Science and Technology University of Science and Technology of China Institute of Advanced Technology University of Science and Technology of China Anhui Province Key Laboratory of Computing and Communication Software

All kinds of intelligent terminal equipment emerge in endlessly and grow explosively. Typical devices, such as smartphones and tablets, are becoming more and more popular, furthermore, intelligent equipment market share has more than that on PCs. And on mobile devices area, the demand for virtualization technology is gradually increasing. As an important branch of computer technology development, operating system level virtualization is becoming a hot spot of current research due to its low overhead and the advantages of lightweight. In this paper, based on the Android system on mobile devices, implement a prototype which can run multiple virtual system instances on only an Android OS by modifying the namespace mechanism in the Linux kernel to and expand into driver namespace mechanism. In addition, put forward a model called the active-inactive model guaranteeing the process if and only if in the active namespace to operate the device drivers, which was designed and implemented a new scheme of operating system level virtualization.

关键词： Virtualization Android Namespace

Reversible Attack based on Local Visual Adversarial Perturbation

学校读者我要写书评

暂无评论

arXiv 2021年

作者： Chen, Li Zhu, Shaowei Andrew, Abel Yin, Zhaoxia Anhui Provincial Key Laboratory of Multimodal Cognitive Computation Anhui University Hefei230601 China Computer and Information Sciences University of Strathclyde Glasgow United Kingdom School of Communication & Electronic Engineering East China Normal University Shanghai200241 China

Adding perturbations to images can mislead classification models to produce incorrect results. Recently, researchers exploited adversarial perturbations to protect image privacy from retrieval by intelligent models. However, adding adversarial perturbations to images destroys the original data, making images useless in digital forensics and other fields. To prevent illegal or unauthorized access to sensitive image data such as human faces without impeding legitimate users, the use of reversible adversarial attack techniques is increasing. The original image can be recovered from its reversible adversarial examples. However, existing reversible adversarial attack methods are designed for traditional imperceptible adversarial perturbations and ignore the local visible adversarial perturbation. In this paper, we propose a new method for generating reversible adversarial examples based on local visible adversarial perturbation. The information needed for image recovery is embedded into the area beyond the adversarial patch by the reversible data hiding technique. To reduce image distortion, lossless compression and the B-R-G (blue-red-green) embedding principle are adopted. Experiments on CIFAR-10 and ImageNet datasets show that the proposed method can restore the original images error-free while ensuring good attack performance. Copyright © 2021, The Authors. All rights reserved.

关键词： Digital forensics

The framework of applying vertex coloring method to identify genes associated with Alzheimer's diseases basing on gene expression

学校读者我要写书评

暂无评论

The framework of applying vertex coloring method to identify...

IEEE International Conference on Granular Computing (GRC)

作者： Ben-Qiong Hu Jiang-Lin Zhou Xu Li Chao-Yang Pang College of Management Science Chengdu University of Technology Chengdu China Department of mathematics & physics He fei university Anhui China Group of Gene Computation College of Mathematics and Software Science Sichuan Normal University Chengdu China Group of Gene Computation Key Laboratory of Visual Computation and Virtual Reality of Sichuan Chengdu China

Alzheimer's disease (AD) is the most common form of dementia. One of the research topics is to identify the genes associated with AD through analyzing DNA microarray data by computation. Holding view of vertex coloring of graph theory, in this paper, a new clustering method named vertex coloring clustering (VCC) is presented. VCC is specified for gene clustering, which makes similar gene expression cluster tightly in same class and they share same gene characteristics or function. So, VCC can be also used to identify the genes associated with AD. Using VCC, 27 candidate AD genes are identified in this paper, and 5 genes agree with other men's study.

关键词： Alzheimer's disease Image color analysis Gene expression Clustering algorithms Proteins Educational institutions

Extending CDFR for Overlapping Community Detection

学校读者我要写书评

暂无评论

Extending CDFR for Overlapping Community Detection

International Conference on Data Intelligence and Security (ICDIS)

作者： Nannan Lu Wenjian Luo Li Ni Hao Jiang Weiping Ding Anhui Province Key Laboratory of Software Engineering in Computing and Communication University of Science and Technology of China Hefei China Centre for Artificial Intelligence University of Technology Sydney Broadway NSW Australia

ISBN: (纸本)9781538657638

In many real-world networks, a node often belongs to multiple communities. Therefore, overlapping community detection is an important task in social network analysis. CDFR is an efficient algorithm recently proposed for non-overlapping community detection. In this paper, CDFR is extended for overlapping community detection, and the extended algorithm is called as OCDFR. In OCDFR, CDFR is first called to obtain a non-overlapping community partition. Then, find the kth NGC (k=1, 2, 3,...) node for each node, and record the fuzzy relations between them. Based on the fuzzy relation between a node and its kth NGC, five decision methods are proposed to determine whether it can join the communities to which its kth NGC belongs. Experimental results on real-world networks and synthetic networks demonstrate that OCDFR is effective and highly competitive.

关键词： Heuristic algorithms Social network services Partitioning algorithms Clustering algorithms Nickel Complex networks Security

Estimating properties of chaotic system based on S-NURBS resampling method

学校读者我要写书评

暂无评论

Estimating properties of chaotic system based on S-NURBS res...

International Conference on Measurement, Information and Control (MIC)

作者： Chenxi Shao Qingqing Liu Tingting Wang Binghong Wang Anhui Province Key Laboratory of Software in Computing and Communication University of Science and Technology of China Hefei China Computer Science and Technology Department University of Science and Technology of China Hefei China

ISBN: (纸本)9781479913916

Physical properties of the chaotic system play important roles on studying the innate character and deciding the practical predictability of the dynamics. For a short piece of undersampled chaotic signals, it is very hard to abstract the physical properties of the signal source from the sequence. In this paper, we model this type of data with global S-NURBS method to reconstruct a smooth trajectory and resample the trajectory to get enough series. In this way, the problem of estimating the physical properties from small undersampled data is turned to the work of calculating the properties of the resampled time series. The new interpolation method is named as S-NURBS resampling method, and the simulation experiment demonstrates that the new method has a good performance in studying physical systems from the observed time series.

关键词： Time series analysis Interpolation Trajectory Chaos Splines (mathematics) Surface topography Surface reconstruction

A hybrid active contour model with local Gaussian distribution fitting energy for image segmentation

学校读者我要写书评

暂无评论

Journal of Information and computational Science 2015年第17期12卷 6515-6523页

作者： Zhang, Runru Huang, Zhangjin Gu, Naijie School of Computer Science and Technology University of Science and Technology of China Hefei China Anhui Province Key Laboratory of Computing and Communication Software Hefei China Institute of Advanced Technology University of Science and Technology of China Hefei China

Active contour models have been widely applied in image segmentation with promising results. However, many of them fail to segment images successfully due to intensity inhomogeneity. To address this problem, we propose a hybrid region-based active contour model which fully utilizes local intensity information. This model develops a localized active contour framework and incorporates a local Gaussian distribution fitting energy. In order to increase both the computational efficiency and stability of the proposed model, a multi-resolution strategy is employed and the active contour is evolved in a reinitialization-free way. Extensive experiments demonstrate that our model is effective and efficient in segmenting images with intensity inhomogeneity, and outperforms several state-of-the-art algorithms. © 2015 by Binary Information Press.

关键词： Image segmentation

New Framework for Code-Mapping-based Reversible Data Hiding in JPEG Images

学校读者我要写书评

暂无评论

arXiv 2020年

作者： Du, Yang Yin, Zhaoxia Key Lab of Intelligent Computing and Signal Processing of Ministry of Education School of Computer Science and Technology Anhui University Hefei230601 China Anhui Key Laboratory of Multimodal Cognitive Computation School of Computer Science and Technology Anhui University Hefei230601 China School of Communication & Electronic Engineering East China Normal University Shanghai200241 China

Code mapping (CM) is an efficient technique for reversible data hiding (RDH) in JPEG images, which embeds data by constructing a mapping relationship between the used and unused codes in the JPEG bitstream. This study presents a new framework for designing a CM-based RDH method. First, a new code mapping strategy is proposed to suppress file size expansion and improve applicability. Based on our proposed strategy, the mapped codes are redefined by creating a new Huffman table rather than selecting them from the unused codes in the original Huffman table. The critical issue of designing the CM-based RDH method, that is, constructing code mapping, is converted into a combinatorial optimization problem. This study proposes a novel CM-based RDH method that utilizes a genetic algorithm (GA). The experimental results demonstrate that the proposed method achieves a high embedding capacity with no signal distortion while suppressing file size expansion. Copyright © 2020, The Authors. All rights reserved.

关键词： Mapping

The Quantum Internet (Technical Version)

学校读者我要写书评

暂无评论

arXiv 2025年

作者： Rohde, Peter P. Huang, Zixin Ouyang, Yingkai Huang, He-Liang Su, Zu-En Devitt, Simon Ramakrishnan, Rohit Mantri, Atul Tan, Si-Hui Liu, Nana Harrison, Scott Radhakrishnan, Chandrashekar Brennen, Gavin K. Baragiola, Ben Q. Dowling, Jonathan P. Byrnes, Tim Munro, William J. Centre for Quantum Software and Information Faculty of Engineering and Information Technology University of Technology Sydney SydneyNSW Australia Hearne Institute for Theoretical Physics Louisiana State University Baton Rouge United States School of Mathematical and Physical Sciences Macquarie University NSW2109 Australia School of Mathematical and Physical Sciences University of Sheffield SheffieldS3 7RH United Kingdom Henan Key Laboratory of Quantum Information and Cryptography Henan Zhengzhou450000 China Hefei National Laboratory for Physical Sciences at Microscale Department of Modern Physics University of Science & Technology of China Hefei China CAS Centre for Excellence and Synergetic Innovation Centre in Quantum Information & Quantum Physics University of Science & Technology of China Hefei China CAS-Alibaba Quantum Computing Laboratory Shanghai China InstituteQ Aalto University Espoo02150 Finland Indian Institute of Science Bangalore India Singapore University of Technology & Design Singapore Centre for Quantum Technologies National University of Singapore Singapore Horizon Quantum Ireland 24 Fitzwilliam Place Dublin 2 D02 T296 Ireland Institute of Natural Sciences Shanghai Jiao Tong University Shanghai200240 China School of Mathematical Sciences Shanghai Jiao Tong University Shanghai200240 China Ministry of Education Key Laboratory in Scientific and Engineering Computing Shanghai Jiao Tong University Shanghai200240 China Shanghai Artificial Intelligence Laboratory Shanghai China University of Michigan Shanghai Jiao Tong University Joint Institute Shanghai200240 China Leibniz Institute for Research & Information in Education Frankfurt am Main Germany Department of Computer Science and Engineering NYU Shanghai 567 West Yangsi Road Shanghai200124 China Centre of Excellence in Engineered Quantum Systems Macquarie University NSW Australia Centre for Quantum Computation and Communication Technology School of Science RMIT University VIC

The desire to share and unite remote digital assets motivated the development of the classical internet, the enabler of the entire 21st century economy and our modern way of life. As we enter the quantum era, it is to be expected there will be a similar demand for networking quantum assets, motivating a global quantum internet for bringing together the world's quantum resources, leveraging off their exponential trajectory in capability. We present models for quantum networking, how they might be applied in the future, and the implications they will have. Socially, economically, politically and geostrategically, the upcoming era of quantum supremacy will be as significant for the 21st century as the transistor was for the 20th. The inherently different scaling in the computational power of quantum computers fundamentally changes the dynamics of how they will operate in the future. Given their high expected initial cost, a client/server model for outsourcing computation will be essential for enabling the accessibility and proliferation of this technology, and ensuring its economic viability. We therefore anticipate the emergence of cloud quantum computing, a model for outsourcing quantum computations to the network. We argue that economic efficiency will mandate that all future quantum computers be united into a single global virtual quantum computer, offering exponentially more power to all network participants than if they were to keep their resources to themselves. This model for the allocation of computational resources is uniquely quantum, with no classical analogue, completely altering the economic landscape for the future of computation. Given the sensitivity of much of the data to which future quantum computers are going to foreseeably be applied, protocols for encrypted quantum computation will be essential - the outsourcing of computations that neither an eavesdropper nor even the server performing the computation can spy upon. This will enable new models fo

关键词： Outsourcing

A straightforward method to judge the completeness of a polymorphic gate set

学校读者我要写书评

暂无评论

arXiv 2017年

作者： Li, Zhifang Luo, Wenjian Yue, Lihua Wang, Xufa School of Computer Science and Technology University of Science and Technology of China Hefei230027 China Anhui Key Laboratory of Software in Computing and Communication University of Science and Technology of China Hefei230027 China

Polymorphic circuits are a special kind of circuits which possess some different build-in functions and these functions are activated by environment parameters, like light and VDD. Some theories have been proposed to guide the design of polymorphic circuits, including the definition of complete polymorphic gate sets and algorithms to judge the completeness of a polymorphic gate set. However, the previous algorithms have to enumerate all the polymorphic signals for judging the completeness of a polymorphic gate set, and it is not easy to be conducted manually. In this paper, a straightforward method is proposed to judge the completeness of a polymorphic gate set. And the correctness of the straightforward method is proved theoretically. Some examples are given to show that the proposed method could be conducted step by step. Its actual computing cost is usually low, and it is suitable for manual operation. Copyright © 2017, The Authors. All rights reserved.

关键词： Timing circuits