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

A novel discrete particle swarm optimization algorithm for meta-task assignment in heterogeneous computing systems

Microprocessors and Microsystems 2011年第1期35卷 10-17页

作者： Qinma Kang Hong He The Key Laboratory of “Embedded System and Service Computing” Ministry of Education Tongji University Shanghai 201804 PR China School of Information Engineering Shandong University at Weihai Weihai 264209 PR China

Optimal assignment of a meta-task in heterogeneous computing systems is NP-complete in the general case. Therefore, heuristic approaches must be employed to find good solutions within a reasonable time. We propose a novel discrete particle swarm optimization (DPSO) algorithm for this problem. Firstly, to make particle swarm optimization algorithm more suitable for solving task assignment problems, particles are represented as integer vectors and a new position update method is developed based on discrete domain. Secondly, an effective variable neighborhood descent algorithm is applied to emphasize exploitation. In addition, migration mechanism is introduced with the hope to escape from possible local optimum and to balance the exploration and exploitation. Computational simulations and comparisons based on a set of benchmark instances indicate that the proposed DPSO algorithm is a viable approach for the task assignment problem.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Hybrid Filtrations Recommendation system based on Privacy Preserving in Edge computing

引用

Procedia Computer Science 2018年 129卷 407-409页

作者： Lina Ni Hongdi Lin Mengmeng Zhang Jinquan Zhang College of Computer Science and Engineering Shandong University of Science and Technology Qingdao China The Key Laboratory of Embedded System and Service Computing Ministry of Education Tongji University Shanghai China

It is challenging to design a secure recommendation system on the Internet which can help users to select their favorite products as less privacy leaked as possible. In this paper, we present a hybrid filtrations recommendation system based on privacy preserving in edge computing (HFRS-PP), which can prevent the users’ privacy information from being leaked via the merits of edge computing in the process of computing and ensure the real-time, accuracy and stability of the query results. Particularly, we propose a privacy-preserving recommendation algorithm to obtain the desired results for the end users through hybrid filtrations. The filtration-rough set theory algorithm is given to distinguish the valid reviews from spam reviews for the next filtration.

关键词： Privacy protection edge computing recommendation system rough set theory

来源：评论

学校读者我要写书评

暂无评论

A Blockchain Based Automatic Access Scheme Design and Implement for Small Cell Base Station 21

A Blockchain Based Automatic Access Scheme Design and Implem...

引用

21st IEEE International Conference on Communication Technology, ICCT 2021

作者： Liang, Jingchao Wu, Jun Tan, Bin Ren, Haoqi Zhang, Zhifeng School of Computer Science and Technology Tongji University Key Laboratory of Embedded System and Service Computing Ministry of Education Shanghai China Fudan University School of Computer Science Shanghai China Jinggangshan University Electronics and Information Engineering Ji'an China Tongji University Electronics and Information Engineering Shanghai China

ISBN: (纸本)9781665432061

5G technology is constrained by its higher frequency band and smaller coverage area, which leads to the need for operators to use technologies such as small cell base stations to increase the density of base station deployment to ensure signal coverage quality, which leads to more enormous construction costs. Therefore, it is urgent to find a safe and reliable solution that can use the existing public network to realize small cell base stations with automatic access. Based on this demand, we summarize various existing small cell base station automatic access technology solutions and their advantages and disadvantages while combing the characteristics of blockchain technology and its application solutions in similar scenarios. And then, we propose a new blockchain-based base station automatic access solution and implements the system in a practical scenario. In our solution, we innovatively introduce blockchain as an intermediate manager for small base stations and core networks, which solves traditional solutions requiring customized equipment while ensuring safety and reliability. It reduces costs and improves efficiency, but some problems are brought by the 'decentralization' of blockchain waiting to be solved. © 2021 IEEE.

关键词： Blockchain

来源：评论

学校读者我要写书评

暂无评论

Implicit privacy preservation:a framework based on data generation

引用

Security and Safety 2022年第1期1卷 166-183页

作者： Qing Yang Cheng Wang Teng Hu Xue Chen Changjun Jiang Key Laboratory of Embedded System and Service Computing(Tongji University) Ministry of EducationShanghai 201804China National(Province-Ministry Joint)Collaborative Innovation Center for Financial Network Security Tongji UniversityShanghai 201804China

This paper addresses a special and imperceptible class of privacy,called implicit *** contrast to traditional(explicit)privacy,implicit privacy has two essential properties:(1)It is not initially de ned as a privacy attribute;(2)it is strongly associated with privacy *** other words,attackers could utilize it to infer privacy attributes with a certain probability,indirectly resulting in the disclosure of private *** deal with the implicit privacy disclosure problem,we give a measurable de nition of implicit privacy,and propose an ex-ante implicit privacy-preserving framework based on data generation,called *** framework consists of an implicit privacy detection module and an implicit privacy protection *** former uses normalized mutual information to detect implicit privacy attributes that are strongly related to traditional privacy *** on the idea of data generation,the latter equips the Generative Adversarial Network(GAN)framework with an additional discriminator,which is used to eliminate the association between traditional privacy attributes and implicit *** elaborate a theoretical analysis for the convergence of the *** demonstrate that with the learned generator,IMPOSTER can alleviate the disclosure of implicit privacy while maintaining good data utility.

关键词： Privacy preservation Implicit privacy Generative adversarial network Data utility Data generation

来源：评论

学校读者我要写书评

暂无评论

Sensor data quality assessment for building simulation model calibration based on automatic differentiation

Sensor data quality assessment for building simulation model...

引用

2013 IEEE International Conference on Automation Science and Engineering, CASE 2013

作者： Li, Sisi Song, Zhen Zhou, Mengchu Lu, Yan Department of Electrical and Computer Engineering New Jersey Institute of Technology Newark NJ 07013 United States Key Laboratory of Embedded System and Service Computing Ministry of Education Tongji University Shanghai 201804 China Department of Automation and Control Siemens Corporation Corporate Technology Princeton NJ 08540 United States

ISBN: (纸本)9781479915156

Building simulation models play a vital role in optimal building climate control, energy audit, fault detection and diagnosis, continuous commissioning, and planning. Real system parameters are often unknown or partially unknown and need to be identified through historical data, which are currently acquired by heuristically designed experiments. Without quality sensor data, model calibration is prone to fail, even if the calibration algorithm is appropriate. In this paper, we propose a Fisher-information-matrix (FIM)-based metric to examine the sensor data measurements and how their quality is related to the model calibration quality. It aims to provide quantitative guidance in the calibration cycle of a whole building model that takes as many variables as possible into consideration for the sake of accuracy. Our concerned model is based on well-known physical laws and tries to avoid simplification, thereby leading to a highly discontinuous system with model switches due to the seasonal or daily variation and other reasons. Such a model is implemented in the form of a software package. Hence, no explicit mathematical expression can be given. A key technical challenge is that the complexity of the model prohibits the analytical derivation of FIM, while the numeric calculation is sensitive to sensor noise and model switches. We, hence, propose to adopt an automatic differentiation method, which exploits the operator overload feature of object oriented programming language, for robust numerical FIM calculation. © 2013 IEEE.

关键词： Numerical methods

来源：评论

学校读者我要写书评

暂无评论

Optimizing skyline queries in SPA distributed networks

引用

Tien Tzu Hsueh Pao/Acta Electronica Sinica 2013年第8期41卷 1515-1520页

作者： Huang, Zhen-Hua Xiang, Yang Sun, Sheng-Li Chen, Qian Department of Computer and Technology Tongji University Shanghai 201804 China Key Laboratory of Embedded System and Service Computing Ministry of Education Tongji University Shanghai 201804 China School of Software and Microelectronics Peking University Beijing 102600 China

Skyline query has recently received a lot of attention in information service community. The TPAOSS (Three-Phase Algorithm for Optimizing Skyline Scalar) algorithm has two performance drawbacks: (1) in the third phase of TPAOSS, as the number of objects on net nodes increases, the length of bloom filter will increases exponentially, which will seriously influence the efficiency of obtaining replicated values and the occupation size of memory;(2) the TPAOSS algorithm does not consider the computation efficiency of local or global subspace skyline queries in each net node. Motivated by these facts, we propose EPSSQDN (Efficient Processing of Subspace Skyline Queries in Distributed Networks), an algorithm for efficient processing of subspace skyline queries in SPA distributed networks. Moreover, in order to further reduce the computation cost of subspace skyline queries and decrease the volume of data transferred, we present an efficient optimized techniques. Furthermore, we present extensive experiments that demonstrate our method is more advantageous than the TPAOSS algorithm.

关键词： Information services

来源：评论

学校读者我要写书评

暂无评论

Decomposition based efficient algorithms for knowledge reduction

引用

ICIC Express Letters 2010年第3期4卷 1025-1032页

作者： Jiao, Na Miao, Duoqian Zhang, Hongyun Department of Computer Science and Technology Ministry of Education of China Tongji University Shanghai 201804 China Key Laboratory of Embedded System and Service Computing Ministry of Education of China Tongji University Shanghai 201804 China

Knowledge reduction, one of essential issues for data mining, has alwaysbeen a, hot topic due to the explosive growth of inform,a,tion. However, whenhandling large-scale data, m,any current knowledge reduction m,ethod,s based, onrough set theory are incapable. In this paper, efficient algorithms forknowledge reduction are put forward, based, on decomposition principle. Theidea, of decomposition is to break a, complex problem, down into a,m,a,ster-problem, and, several sub-problem,s that are simpler, m,orem,a,na,gea,ble and, m,ore solvable by using existing induction methods, thenjoining them, together in order to solve the original problem,. Compared, withsom,e traditional methods, the efficiency of the proposed algorithms can beillustrated by experiments with standard datasets from, UCI database. ICIC International © 2010.

关键词： Rough set theory

来源：评论

学校读者我要写书评

暂无评论

Adaptation of Mismatching services Based on Labelled Interface Automata

Adaptation of Mismatching Services Based on Labelled Interfa...

引用

Fifth International Conference on Semantics,Knowledge and Grid(第五届语义、知识与网格国际会议 SKG 2009)

作者： Tao Liu Guosun Zeng Department of Computer Science and Technology Tongji University Shanghai 200092 China The Key Laboratory of Embedded System and Service Computing Ministry of Education Tongji Universit

In today's web, more and more software and applications are wrapped as services. However interactions between services are not always perfectly completed because of mismatches among them. service mediation and adaptation problems obtain increasingly concerns. In this paper, we propose an extension of interface automata, labelled interface automata, to illustrate mismatching services and adaptation. We characterize the problem by classifying different kinds of adaptation scenarios. Then we focus on how to use labelled interface automata to illustrate the building of adaption service between mismatching services.

关键词： mismatching service adaptation interface automata

来源：评论

学校读者我要写书评

暂无评论

Berth-crane allocation model and algorithm of container berths in the uncertain environment

Berth-crane allocation model and algorithm of container bert...

引用

8th International Conference on Bio-Inspired computing: Theories and Applications, BIC-TA 2013

作者： Liu, Jian-Xin Du, Yu-Yue Hong, Yong-Fa Sun, Lin-Lin College of Information Science Engineering Shandong University of Science and Technology QingdaoShandong266590 China The Key Laboratory of Embedded System and Service Computing Ministry of Education Tongji University Shanghai200092 China College of Civil Engineering and Architecture SUST QingdaoShandong266590 China

ISBN: (纸本)9783642375019

According to the randomness of the vessel’s arrival time and handling time, the establishment of a randomly-oriented environment container berths— crane allocation model, the optimizing goal is to minimize the average ship-waiting time. Taking into account the complexity of the model solution, this paper offers the design of an improved genetic algorithm to reduce the searching space, and according to the characteristics of the optimal solution. With testing example to verify that the model can simulate decision-making environment of berths— crane allocation problem and reflect the decision-maker’s attitude toward risks and preferences. The algorithm can gain a stable and satisfactory solution within the operating time. © Springer-Verlag Berlin Heidelberg 2013.

关键词： Genetic algorithms

来源：评论

学校读者我要写书评

暂无评论

Detecting vehicle target in SAR image with high moment

Detecting vehicle target in SAR image with high moment

引用

International Radar Symposium (IRS)

作者： Renzhou Gui Zhi Wang State Key Laboratory of Satellite Ocean Environment Dynamics The Key Laboratory of Embedded System and Service Computing Ministry of Eduction College of Electronics & Information Engineering Tongji University Shanghai China

Vehicle detection in SAR image is attractive field. High moments included numerous information is proposed to exploit in the field. It not only restrains Gaussian noise automatically, but also suppresses non-gaussian noise. Man-made targets in are different from the background clutter. Moreover, the influence of the shadow about man-made targets is reduced in the algorithm of high moments. We utilize high moments to avoid to analyst the complex scatter theory. By analyzing the relevent theory and practical calculated method of high order moments, we compare the difference of probability of detection between the target chip and clutter chip to achieve the goal of detection. Through processing lots of actual SAR data which is added different kinds of noise, we compare the performance between high order moments and low-order moments method.

关键词： Noise Vehicles Clutter Probability density function Object detection Graphics Moment methods

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：