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

Optimal Linear Crossover for Mitigating Negative Transfer in Evolutionary Multitasking

IEEE Transactions on Evolutionary Computation 2024年

作者： Liu, Zhaobo Yuan, Jianhua Zhang, Haili Zeng, Tao Zhu, Zexuan Shenzhen University Institute for Advanced Study Shenzhen518060 China Shenzhen University College of Computer Science and Software Engineering Shenzhen518060 China Shenzhen Polytechnic University School of Undergraduate Education Shenzhen518055 China Shenzhen University National Engineering Laboratory for Big Data System Computing Technology Shenzhen518060 China Shenzhen University Shenzhen City Key Laboratory of Embedded System Design Shenzhen518060 China Chongqing University Key Laboratory of Dependable Service Computing in Cyber Physical Society Ministry of Education of China Chongqing400044 China

Evolutionary multitasking algorithms use information exchange among individuals in a population to solve multiple optimization problems simultaneously. Negative transfer is a critical factor that affects the performance of evolutionary multitasking algorithms. In this study, we propose an innovative approach to mitigate negative transfer in evolutionary multitasking algorithms. The proposed approach is grounded in rigorous theoretical analysis, which provides valuable theoretical insights into the design of an optimal linear crossover operator for mitigating negative transfer. By identifying interpretable conditions, we establish a solid theoretical foundation to prevent negative transfer in diverse scenarios. Building upon these findings, we theoretically derive a closed-form expression for the optimal crossover operator and propose practical design methods based on approximations. Furthermore, we integrate the proposed optimal crossover operator into a fundamental evolutionary multitasking algorithm framework. The resultant algorithm is comparable or superior to other state-of-the-art methods. Empirical validation through comprehensive experiments confirms the effectiveness of our theoretical findings. © 1997-2012 IEEE.

关键词： Optimization algorithms

来源：评论

学校读者我要写书评

暂无评论

HeavyTracker: An Efficient Algorithm for Heavy-Hitter Detection in High-Speed Networks

HeavyTracker: An Efficient Algorithm for Heavy-Hitter Detect...

引用

International Conference on Parallel and Distributed systems (ICPADS)

作者： Jiakun Yu Yu-E Sun He Huang Yang Du Guoju Gao Hongli Xu Shigang Chen School of Computer Science and Technology Soochow University Suzhou China School of Rail Transportation Soochow University Suzhou China Ministry of Education Key Laboratory of Embedded System and Service Computing (Tongji University) Shanghai China School of Computer Science and Technology University of Science and Technology of China Hefei China

Detecting heavy hitters that constitute the majority of network traffic is a critical task in network measurement. However, the highly skewed network traffic and the size-limited on-chip memory pose great challenges for heavy-hitter detection. The prior arts either use sketches to track all flows or maintain a fix-sized tracking list for recording elephant flows, resulting in limited detection precision or time-consuming tracking list exchanges. This paper presents HeavyTracker, an efficient algorithm that detects heavy hitters based on a count-with-threshold strategy. A two-dimensional tracker unit array is employed in our design to capture the heavy hitters, where each flow is randomly mapped to one unit in all rows. The tracker unit is designed to accept many flows and precisely report the largest two with frequencies that reach a predefined threshold. This design eliminates the frequent and time-consuming exchanges for maintaining the tracking list, allowing us to use a hash table to track the reported elephant flows. Experimental results based on real Internet traces show that HeavyTracker achieves a high $\mathbf{F}_{\beta}$-Score of threshold-t detection (0.97) and over 99% precision of top-k detection under a tight memory size. Besides, it reduces the frequency estimation error by 97.4% compared to the state-of-the-art.

关键词： Art High-speed networks Measurement uncertainty Telecommunication traffic Size measurement Frequency estimation Internet

来源：评论

学校读者我要写书评

暂无评论

Software services protection security protocol based on software watermarking in cloud environment

引用

Tongxin Xuebao/Journal on Communications 2012年第SUPPL.2期33卷 176-181页

作者： Xu, Jin-Chao Zeng, Guo-Sun Wang, Wei Department of Computer Science and Technology Tongji University Shanghai 201804 China The Key Laboratory of Embedded System and Service Computing Ministry of Education Tongji University Shanghai 201804 China

Aimed to resist the infringement of software services in cloud environment, a software services protection security protocol based on software watermarking in cloud environment was presented. On the consideration of actual needs in cloud computing, the protocol introduced the software watermarking as a service cloud which was responsible for software watermark embedding and extraction. The protocol not only met the basic requirements of software copyright protection, but also gived the detailed strategy to solve the infringement, and hardened the ability of the software watermarking to resist various attacks. The analysis shows that the proposed protocol has higher security.

关键词： Copyrights

来源：评论

学校读者我要写书评

暂无评论

Automatic vector-based road structure mapping using multi-beam lidar

arXiv

引用

arXiv 2018年

作者： He, Xudong Zhao, Junqiao Sun, Lu Huang, Yewei Zhang, Xinglian Li, Jun Ye, Chen Key Laboratory of Embedded System and Service Computing Tongji University Ministry of Education Shanghai Department of Computer Science and Technology School of Electronics and Information Engineering Tongji University Shanghai School of Surveying and Geo-Informatics Tongji University Shanghai China School of Automotive Studies Tongji University Shanghai China

In this paper, we studied a SLAM method for vector-based road structure mapping using multi-beam LiDAR. We propose to use the polyline as the primary mapping element instead of grid cell or point cloud, because the vector-based representation is precise and lightweight, and it can directly generate vector-based High-Definition (HD) driving map as demanded by autonomous driving systems. We explored: 1) the extraction and vectorization of road structures based on local probabilistic fusion. 2) the efficient vector-based matching between frames of road structures. 3) the loop closure and optimization based on the pose-graph. In this study, we took a specific road structure, the road boundary, as an example. We applied the proposed matching method in three different scenes and achieved the average absolute matching error of 0.07 m. We further applied the mapping system to the urban road with the length of 860 meters and achieved an average global accuracy of 0.466 m without the help of high precision GPS. Copyright © 2018, The Authors. All rights reserved.

关键词： Mapping

来源：评论

学校读者我要写书评

暂无评论

TiEV: The tongji intelligent electric vehicle in the intelligent vehicle future challenge of China

arXiv

引用

arXiv 2018年

作者： Zhao, Junqiao Ye, Chen Wu, Yan Guan, Linting Cai, Lewen Sun, Lu Yang, Tao He, Xudong Li, Jun Ding, Yongchao Zhang, Xinglian Wang, Xinchen Huang, Jinlin Zhang, Enwei Huang, Yewei Jiang, Wei Zhang, Shaoming Xiong, Lu Feng, Tiantian Key Laboratory of Embedded System and Service Computing Ministry of Education Tongji University Shanghai Department of Computer Science and Technology School of electrics and Information Engineering Tongji University Shanghai School of Surveying and Geo-Informatics Tongji University Shanghai China School of Automotive Studies Tongji University Shanghai China

TiEV is an autonomous driving platform implemented by the Tongji University of China. The vehicle is drive-by-wire and is fully powered by electricity. We devised the software system of TiEV from scratch, which is capable of driving the vehicle autonomously in urban paths as well as on fast express roads. We describe our whole system, especially novel modules of probabilistic perception fusion, large-scale mapping and updating, the 1st and the 2nd planning and the overall safety concern. TiEV finished 2016, and 2017 Intelligent Vehicle Future Challenge of China held at Changshu. We show our experiences on the development of autonomous vehicles and discuss the future trends. Copyright © 2018, The Authors. All rights reserved.

关键词： Autonomous vehicles

来源：评论

学校读者我要写书评

暂无评论

DSC: Deep scan context descriptor for large-scale place recognition

arXiv

引用

arXiv 2021年

作者： Cui, Jiafeng Huang, Tengfei Cai, Yingfeng Zhao, Junqiao Xiong, Lu Yu, Zhuoping School of Automobile Tongji University Shanghai China Department of Computer Science and Technology School of Electronics and Information Engineering Tongji University Shanghai China The Key Laboratory of Embedded System and Service Computing Ministry of Education Tongji University Shanghai China Institute of Intelligent Vehicles Tongji University Shanghai China

LiDAR-based place recognition is an essential and challenging task both in loop closure detection and global relocalization. We propose Deep Scan Context (DSC), a general and discriminative global descriptor that captures the relationship among segments of a point cloud. Unlike previous methods that utilize either semantics or a sequence of adjacent point clouds for better place recognition, we only use raw point clouds to get competitive results. Concretely, we first segment the point cloud egocentrically to acquire centroids and eigenvalues of the segments. Then, we introduce a graph neural network to aggregate these features into an embedding representation. Extensive experiments conducted on the KITTI dataset show that DSC is robust to scene variants and outperforms existing methods. © 2021, CC BY.

关键词： Eigenvalues and eigenfunctions

来源：评论

学校读者我要写书评

暂无评论

Unsupervised joint learning of depth, optical flow, ego-motion from video

arXiv

引用

arXiv 2021年

作者： Li, Jianfeng Zhao, Junqiao Song, Shuangfu Feng, Tiantian The Key Laboratory of Embedded System and Service Computing Ministry of Education Tongji University Shanghai China Department of Computer Science and Technology School of Electronics and Information Engineering Tongji University Shanghai China School of Surveying and Geoinfomatics Tongji University Shanghai China Insititute of Intelligent Vehicle Tongji University Shanghai China

Estimating geometric elements such as depth, camera motion, and optical flow from images is an important part of the robot's visual perception. We use a joint selfsupervised method to estimate the three geometric elements. Depth network, optical flow network and camera motion network are independent of each other but are jointly optimized during training phase. Compared with independent training, joint training can make full use of the geometric relationship between geometric elements and provide dynamic and static information of the scene. In this paper, we improve the joint self-supervision method from three aspects: network structure, dynamic object segmentation, and geometric constraints. In terms of network structure, we apply the attention mechanism to the camera motion network, which helps to take advantage of the similarity of camera movement between frames. And according to attention mechanism in Transformer, we propose a plug-and-play convolutional attention module. In terms of dynamic object, according to the different influences of dynamic objects in the optical flow self-supervised framework and the depth-pose self-supervised framework, we propose a threshold algorithm to detect dynamic regions, and mask that in the loss function respectively. In terms of geometric constraints, we use traditional methods to estimate the fundamental matrix from the corresponding points to constrain the camera motion network. We demonstrate the effectiveness of our method on the KITTI dataset. Compared with other joint self-supervised methods, our method achieves state-of-the-art performance in the estimation of pose and optical flow, and the depth estimation has also achieved competitive *** Codes 65Dxx © 2021, CC BY-NC-ND.

关键词： Geometry

来源：评论

学校读者我要写书评

暂无评论

Admission Control for Non-preprovisioned service Flow in Wireless Metropolitan Area Networks

Admission Control for Non-preprovisioned Service Flow in Wir...

引用

European Conference on Universal Multiservice Networks (ECUMN)

作者： Liping Wang Fuqiang Liu Yusheng Ji Nararat Ruangchaijatupon The Key Laboratory of |Embedded System and Service Computing| Ministry of Education China Ministry of Education Tongji University Shanghai China Graduate University of Advanced Studies (SOKENDAI) Tokyo Japan National Institute of Information Japan School of Electronics and Information Engineering University of Tongji Shanghai China The Graduate University for Advanced Studies Tokyo Japan National Institute of Informatics Japan

Improving the admission control process in wireless metropolitan area networks (WMAN) based on the IEEE 802.16e standard can improve the QoS. Because IEEE 802.16e supports five classes of service as well as mobility, an admission control policy for non-preprovisioned service flow is proposed. This policy is compatible with the QoS parameters for each service class defined in the standard. As improvements, the guard channel scheme is used to give handover connections higher priority and a novel proportional bandwidth-borrowing scheme is added to prioritize the different service classes. The simulation results show the proposed admission control policy maximizes the bandwidth utilization and the use of the two schemes provides a reasonable priority order of new originated connections and handover connections of different service classes. The connection-blocking and connection-dropping probabilities were reduced to the extent that they can be ignored

关键词： Admission control Wireless LAN Metropolitan area networks Bandwidth Media Access Protocol Laboratories embedded system embedded computing Informatics Identity management systems

来源：评论

学校读者我要写书评

暂无评论

Hybrid uniform distribution of particle swarm optimizer

引用

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences 2010年第10期E93-A卷 1782-1791页

作者： Zhang, Junqi Tan, Ying Ni, Lina Xie, Chen Tang, Zheng Department of Computer Science and Technology Key Laboratory of Embedded System and Service Computing Ministry of Education Qingdao China Tongji University Shanghai 200092 China Key Laboratory of Machine Perception Ministry of Education Qingdao China Department of Machine Intelligence School of Electronics Engineering and Computer Science Peking University Beijing 100871 China College of Info Sci and Engi Shandong University of Science and Technology Qingdao China Department of Intellectual Information Systems Engineering University of Toyama Toyama-shi 930-8555 Japan

Particle swarm optimizer (PSO) is a stochastic global optimization technique based on a social interaction metaphor. Because of the complexity, dynamics and randomness involved in PSO, it is hard to theoretically analyze the mechanism on which PSO depends. Statistical results have shown that the probability distribution of PSO is a truncated triangle, with uniform probability across the middle that decreases on the sides. The "truncated triangle" is also called the "Maya pyramid" by Kennedy. However, very little is known regarding the sampling distribution of PSO in itself. In this paper, we theoretically analyze the "Maya pyramid" without any assumption and derive its computational formula, which is actually a hybrid uniform distribution that looks like a trapezoid and conforms with the statistical results. Based on the derived density function of the hybrid uniform distribution, the search strategy of PSO is defined and quantified to characterize the mechanism of the search strategy in PSO. In order to show the significance of these definitions based, on the derived hybrid uniform distribution, the comparison between the defined search strategies of the classical, linear decreasing weight based PSO and the canonical constricted PSO suggested by Clerc is illustrated and elaborated. Copyright © 2010 The Institute of Electronics, Information and Communication Engineers.

关键词： Probability distributions

来源：评论

学校读者我要写书评

暂无评论

Maximally permissive control of flexible manufacturing systems with fewest disjunctive constraints

Maximally permissive control of flexible manufacturing syste...

引用

International Conference on Advanced Mechatronic systems (ICAMechS)

作者： YuFeng Chen MengChu Zhou XiaoOu Li School of Electro-Mechanical Engineering Xidian University Xi'an China Key Laboratory of Embedded System and Service Computing Ministry of Education University of Tongji Shanghai China Department of Electrical and Computer Engineering New Jersey Institute of Technology Newark NJ USA Departamento de Computacion CINVESTAVIPN Mexico Distrito Federal Mexico

For Petri net models whose legal reachability spaces are non-convex, one cannot optimally control them by the conjunctions of linear constraints. This work proposes a method to find a set of linear constraints such that each constraint can forbid all first-met bad markings and every legal marking satisfies at least one constraint. Then, the disjunctions of the obtained constraints can make all legal markings reachable and forbid all first-met bad markings, i.e., the controlled net is live and maximally permissive. The work also develops an integer linear programming model to minimize the number of the constraints. Finally, an example is provided to illustrate the proposed method.

关键词： Law Optimal control Vectors Aerospace electronics Petri nets system recovery

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：