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

World Congress on software Engineering

作者： Sun, Shiwen Xia, Chengyi Wang, Li Wang, Lanying School of Computer and Communication Engineering Tianjin University of Technology Tianjin China Tianjin Key Laboratory of Intelligence Computing and Novel Software Technology Tianjin University of Technology Tianjin China Periodical Department Hebei University Baoding China

ISBN: (纸本)9780769543031

Recently, large-scale computer software systems have attached a great deal of attention when they are regarded as complex networks composed of interacting units. In this paper, the collaboration relationships between header files in the source code of Linux kernels are analyzed by constructing a weighted File Collaboration Network(FCN): each node represents a header file, two nodes are connected if corresponding header files are both included in the same source file at least once, also the link weight is assigned to evaluate the intensity of co-inclusion of two header files. Through using appropriate non-weighted and weighted quantities, structural properties of FCNs are characterized and analyzed. The study of large-scale softwares from the viewpoint of complex networks can provide a better description of the organizational principles and evolving mechanism of complex software systems. © 2010 IEEE.

关键词： Complex networks

来源：评论

学校读者我要写书评

暂无评论

Real-Valued Negative Databases 12

Real-Valued Negative Databases

引用

12th European Conference on the Synthesis and Simulation of Living Systems: Advances in Artificial Life, ECAL 2013

作者： Zhao, Dongdong Luo, Wenjian School of Computer Science and Technology University of Science and Technology of China Hefei Anhui230027 China Anhui Province Key Laboratory of Software Engineering in Computing and Communication University of Science and Technology of China Hefei Anhui230027 China

ISBN: (纸本)9780262317092

The negative database (NDB) is the negative representation of original data. Existing work has demonstrated that NDB can be used to preserve privacy and hide information. However, most work about NDB is based on binary representation. In some applications which are naturally descripted in real-valued space, the binary negative database is hard to be applied appropriately. Therefore, the real-valued negative database is proposed in this paper, and reversing the real-valued negative database is proved to be an NP-hard problem. Moreover, an effective algorithm for generating real-valued negative databases is given. Finally, an example of applying the realvalued negative database to the privacy-preserving data publication is descripted, and it shows that the real-valued negative database is valuable in practice. © 2013 Proceedings of the 12th European Conference on the Synthesis and Simulation of Living Systems: Advances in Artificial Life, ECAL 2013. All rights reserved.

关键词： Computational complexity

来源：评论

学校读者我要写书评

暂无评论

Fast searching optimal negative surveys

Fast searching optimal negative surveys

引用

2014 International Conference on Information and Network Security, ICINS 2014

作者： Lu, Yihui Luo, Wenjian Zhao, Dongdong School of Computer Science and Technology University of Science and Technology of China Hefei Anhui230027 China Anhui Province Key Laboratory of Software Engineering in Computing and Communication University of Science and Technology of China Hefei Anhui230027 China

ISBN: (纸本)9781849199094

In a negative survey, a category which does not agree with the fact of each participant is collected. Hence, data collectors cannot acquire the realistic data of participants, and this can efficiently protect participants' private information and sensitive data. However, existing approaches used to estimate the distribution of positive surveys from negative surveys are not practical and time-consuming. This paper proposed a method in order to acquire practical estimation results with a lower computing cost, namely fastNStoPS. Usually, privacy and utility are used to measure the performances of negative surveys, and they are two conflicting metrics. Users have different demands on privacy (or utility) under different circumstances. The optimal negative surveys are a Pareto font of these two objectives. To demonstrate its practicability, the proposed fastNStoPS method is embedded into a Differential Evolution (DE), which is used to find the optimal negative surveys. The experiment results show that the DE has a much better performance on find the optimal negative surveys, and the computing cost is very low.

关键词： Surveys

来源：评论

学校读者我要写书评

暂无评论

Cost-Optimized Microservice Deployment for IoT Application in Cloud-Edge Collaborative Environment 26

Cost-Optimized Microservice Deployment for IoT Application i...

引用

26th International Conference on Computer Supported Cooperative Work in Design, CSCWD 2023

作者： Zhang, Xiaoyuan Tang, Bing Yang, Qing Xu, Wei Guo, Feiyan Hunan University of Science and Technology Hunan Key Laboratory for Service Computing and Novel Software Technology School of Computer Science and Engineering Xiangtan411201 China Guangzhou Maritime University School of Information and Communication Engineering Guangzhou510725 China

ISBN: (纸本)9798350331684

With the popularity of cloud native and DevOps, container technology is widely used and combined with microservices. The deployment of container-based microservices in distributed cloud-edge infrastructure requires suitable strategies to ensure the quality of service for users. However, the existing container orchestration tools cannot flexibly select the best deployment location according to the user's cost budget, and are insufficient in personalized deployment solutions. From the perspective of application providers, this paper considers the location distribution of users, application dependencies, and server price differences, and proposes a genetic algorithm-based Internet-of-Things (IoT) application deployment strategy for personalized cost budgets. The application deployment problem is defined as an optimization problem that minimizes user service latency under cost constraints. This problem is an NP-hard problem, and genetic algorithm is introduced to solve the optimization problem effectively and improve the deployment efficiency. The proposed algorithm is compared with four baseline algorithms, Time-Greedy, Cost-Greedy, Random and PSO, using real datasets and some synthetic datasets. The results show that the proposed algorithm outperforms other competing baseline algorithms. © 2023 IEEE.

关键词： Genetic algorithms

来源：评论

学校读者我要写书评

暂无评论

A novel denoising method for infrared image based on bilateral filtering and non-local means

引用

Optoelectronics Letters 2017年第3期13卷 237-240页

作者：刘凤连孙梦尧蔡文娜 Key Laboratory of Computer Vision and System Ministry of Education of ChinaTianjin Key Laboratory of Intelligence Computing and Novel Software TechnologySchool of Computer and Communication EngineeringTianjin University of TechnologyTianjin 300384China

This paper presents an image denoising method based on bilateral filtering and non-local means. The non-local region texture or structure of the image has the characteristics of repetition, which can be used to effectively preserve the edge and detail of the image. And compared with classical methods, bilateral filtering method has a better performance in denosing for the reason that the weight includes the geometric closeness factor and the intensity similarity factor. We combine the geometric closeness factor with the weight of non-local means, and construct a new weight. Experimental results show that the modified algorithm can achieve better performance. And it can protect the image detail and structure information better.

关键词： bilateral filtering similarity pixel texture combine repetition neighborhood preserve noisy

来源：评论

学校读者我要写书评

暂无评论

A parallel NURBS-based isogeometric analysis framework on multi-core CPUs

引用

Journal of Computational Information Systems 2012年第16期8卷 6589-6600页

作者： Guo, Licai Huang, Zhangjin Gu, Naijie School of Computer Science and Technology University of Science and Technology of China China Key Laboratory of Software in Computing and Communication Anhui China USTC-SICT Joint Laboratory on Network and Communication China

A parallel framework for NURBS-based isogeometric analysis on multi-core cpus is presented in this paper. The framework is composed of two parts: (1) construction of the stiffness matrix and right hand side vector;(2) a parallel sparse solver. We analyze the properties of NURBS basis, use the ELLPACK format to store the stiffness matrix. The parallel strategy is dividing the matrix and vectors into disjoint parts. Each core computes one part in parallel. We test the effectiveness and efficiency of the framework on an 8-core machine and a 48-core machine. The framework solves the 2-d poisson equation and can solve 1.05 million degrees of freedom in about 22 seconds using 32 cores. The speed-up of the construction reaches 28.3 using 32 cores. © 2012 Binary Information Press.

关键词： Stiffness matrix

来源：评论

学校读者我要写书评

暂无评论

A framework for optimization in multi-channel multi-radio wireless mesh networks

A framework for optimization in multi-channel multi-radio wi...

引用

IET International Conference on Wireless Mobile and Multimedia Networks Proceedings, ICWMMN 2006

作者： Wanli, Dong Naijie, Gu Kun, Bi Kun, Tu Xiaohu, Liu Dept. of Comput. Sci. and Technol. Univ. of Sci. and Technol. of China Hefei Anhui 230027 China Anhui Province Key Laboratory of Software in Computing and Communication Hefei Anhui 230027 China

ISBN: (纸本)0863416446

Multi-hop infrastructure wireless mesh networks offer increased reliability, coverage and reduced equipment costs over their single-hop counterpart, wireless LANs. Equipping wireless routers with multiple radios further improves the capacity by transmitting over multiple radios simultaneously using orthogonal channels. However, due to the limited number of available orthogonal channels, interference is still a factor in such networks. In this paper, we propose a network model that captures the key practical aspects of such systems and characterize the constraints binding their behavior. We mathematically formulate the optimization framework, taking into account the interference constraints, the number of channels in the network and the number of radios available at each mesh router etc. We then use this framework to develop solutions for multiple objectives subject to different kind of fairness constraints on allocation of scarce wireless capacity among mobile clients. The methods proposed in this paper can be a valuable tool for network designers in planning network deployment and for optimizing different performance objectives.

关键词： Wireless sensor networks

来源：评论

学校读者我要写书评

暂无评论

An efficient group key agreement protocol with administrator 3

An efficient group key agreement protocol with administrator

引用

3rd International Conference on Internet of Things and Smart City, IoTSC 2023

作者： Fang, Qihao Zhang, Lei Zhang, Mingrui Shanghai Key Laboratory of Trustworthy Computing East China Normal University Shanghai200062 China Science and Technology on Communication Security Laboratory Chengdu610041 China Engineering Research Center of Software/Hardware Co-design Technology and Application Ministry of Education Shanghai200062 China

ISBN: (纸本)9781510666375

Group key agreement technology is one of the most popular solution to establish a reliable secure channel between communicating entities of a group. Group key agreement protocol with administrator (GKAA) can handle a large number of group operations in sequence to resolve disorder problem and it is widely used in practical applications. However, in most of existing protocol, the administrator has to compute materials for each participant in the group which brings huge calculate overhead. In this paper, we propose an efficient group key agreement protocol with Administrator. Our GKAA protocol is able to perform group operation in a high efficacy way with the help of a key tree. It is also flexible and scalable since it suits for any network communication environment like IoT, video meeting, social applications, etc. Our protocol satisfies the properties including forward secrecy, PCS and key control resistance. © 2023 SPIE.

关键词： Network security

来源：评论

学校读者我要写书评

暂无评论

Address assignment in wireless sensor networks using game approach

Address assignment in wireless sensor networks using game ap...

引用

IET International Conference on Wireless Mobile and Multimedia Networks Proceedings, ICWMMN 2006

作者： Kim, Tu Naijie, Gu Kim, Bi Wanli, Dong Dept. of Comput. Sci. and Technol. Univ. of Sci. and Technol. of China Hefei Anhui 230027 China Anhui Province Key Laboratory of Software in Computing and Communication Hefei Anhui 230027 China

ISBN: (纸本)0863416446

In this paper, we propose a game model to solve the MAC address assignment in sensor networks. Insufficiency of battery power of sensors makes the conservation of the energy be the main design issues for the sensor networks. Due to the small packet payload, the MAC header is a significant and energy-costly overhead. To remedy this, we propose a novel scheme for a MAC address assignment. The key feature which makes our approach unique is that we propose a mixed strategy game model to solve the address assignment problem. We prove that there is a mixed strategy Nash equilibrium in our game model. The model takes advantage of the exploitation of spatial address ruse to save energy. Our model is easy to implement, which makes it a potential candidate for practical implementations, even for very large networks.

关键词： Wireless sensor networks

来源：评论

学校读者我要写书评

暂无评论

Practical privacy-preserving mixing protocol for Bitcoin 26

Practical privacy-preserving mixing protocol for Bitcoin

引用

26th International Conference on Computer Supported Cooperative Work in Design, CSCWD 2023

作者： Chang, Qianqian Xu, Lin Zhang, Lei Shanghai Key Laboratory of Trustworthy Computing East China Normal University Shanghai200062 China Science and Technology on Communication Security Laboratory Chengdu610041 China Engineering Research Center of Software/Hardware Co-design Technology and Application Ministry of Education Shanghai200062 China

ISBN: (纸本)9798350331684

The privacy of Cryptocurrencies are of great concern in various fields. Researches has shown that pseudonyms, which are used in Bitcoin, only provide weak privacy. The privacy of users may be put at risk under deanonymization attacks. The exisiting schemes typically require a trusted-third party to achieve anonymity, however this usually faces a single-point fault. In addition, existing schemes suffer from high communication complexity and impracticality. This paper proposes a practical privacy-preserving mixing protocol for Bitcoin to achieve unlink-ability of input and output address of transactions. Compared to existing schemes, our protocol improves practicality. The communication complexity of our protocol is linearly related to the number of peers. Moreover, our protocol is scalable as it works not only for Bitcoin, but also for other cryptocurrencies. © 2023 IEEE.

关键词： Computational complexity

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：