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

arXiv 2023年

作者： Zhu, Zhongyang Zhao, Junqiao Huang, Kai Tian, Xuebo Lin, Jiaye Ye, Chen Department of Computer Science and Technology School of Electronics and Information Engineering Tongji University Shanghai China The MOE Key Lab of Embedded System and Service Computing Tongji University Shanghai China Institute of Intelligent Vehicles Tongji University Shanghai China The School of Surveying and Geo-Informatics Tongji University Shanghai China

Simultaneous localization and mapping (SLAM) is critical to the implementation of autonomous driving. Most LiDAR-inertial SLAM algorithms assume a static environment, leading to unreliable localization in dynamic environments. Moreover, the accurate tracking of moving objects is of great significance for the control and planning of autonomous vehicles. This study proposes LIMOT, a tightly-coupled multi-object tracking and LiDAR-inertial odometry system that is capable of accurately estimating the poses of both ego-vehicle and objects. We propose a trajectory-based dynamic feature filtering method, which filters out features belonging to moving objects by leveraging tracking results before scan-matching. Factor graph-based optimization is then conducted to optimize the bias of the IMU and the poses of both the ego-vehicle and surrounding objects in a sliding window. Experiments conducted on the KITTI tracking dataset and self-collected dataset show that our method achieves better pose and tracking accuracy than our previous work DL-SLOT and other baseline methods. Our open-source implementation is available at https://***/tiev-tongji/LIMOT. Copyright © 2023, The Authors. All rights reserved.

关键词： Autonomous vehicles

来源：评论

学校读者我要写书评

暂无评论

Conflict Analysis for Pythagorean Fuzzy Information systems with Group Decision Making

arXiv

引用

arXiv 2017年

作者： Lang, Guangming Department of Computer Science and Technology Tongji University Shanghai201804 China School of Mathematics and Statistics Changsha University of Science and Technology Changsha Hunan410114 China Key Laboratory of Embedded System and Service Computing Ministry of Education Tongji University Shanghai201804 China

Pythagorean fuzzy sets provide stronger ability than intuitionistic fuzzy sets to model uncertainty information and knowledge, but little effort has been paid to conflict analysis of Pythagorean fuzzy information systems. In this paper, we present three types of positive, central, and negative alliances with different thresholds, and employ examples to illustrate how to construct the positive, central, and negative alliances. Then we study conflict analysis of Pythagorean fuzzy information systems based on Bayesian minimum risk theory. Finally, we investigate group conflict analysis of Pythagorean fuzzy information systems based on Bayesian minimum risk theory. Copyright © 2017, The Authors. All rights reserved.

关键词： Fuzzy sets

来源：评论

学校读者我要写书评

暂无评论

An Improved Adaptive Exponential Smoothing Model for Short-term Travel Time Forecasting of Urban Arterial Street

引用

Acta Automatica Sinica 2008年第11期34卷 1404-1409页

作者： Zhi-Peng LI Hong YU Yun-Cai LIU Fu-Qiang LIU Key Laboratory of Embedded System and Service Computing Ministry of Education Tongji University Shanghai 200092 P. R. China Intelligent Transportation System Department Shanghai Electrical Apparatus Research Institute Shanghai 200063 P. R. China Institute of Image Processing and Pattern Recognition Shanghai Jiao Tong University Shanghai 200240 P. R. China

Short-term forecasting of travel time is essential for the success of intelligent transportation system. In this paper, we review the state-of-art of short-term traffic forecasting models and outline their basic ideas, related works, advantages and disadvantages of each model. An improved adaptive exponential smoothing (IAES) model is also proposed to overcome the drawbacks of the previous adaptive exponential smoothing model. Then, comparing experiments are carried out under normal traffic condition and abnormal traffic condition to evaluate the performance of four main branches of forecasting models on direct travel time data obtained by license plate matching (LPM). The results of experiments show each model seems to have its own strength and weakness. The forecasting performance of IASE is superior to other models in shorter forecasting horizon (one and two step forecasting) and the IASE is capable of dealing with all kind of traffic conditions.

关键词： Travel time short-term forecasting license plate matching (LPM) exponential smoothing

来源：评论

学校读者我要写书评

暂无评论

A recent survey on controllable text generation: A causal perspective

引用

Fundamental Research 2024年

作者： Wang, Junli Zhang, Chenyang Zhang, Dongyu Tong, Haibo Yan, Chungang Jiang, Changjun Key Laboratory of Embedded System and Service Computing (Tongji University) Ministry of Education Shanghai 201804 China National (Province-Ministry Joint) Collaborative Innovation Center for Financial Network Security Tongji University Shanghai 201804 China

As an important subject of natural language generation, Controllable Text Generation (CTG) focuses on integrating additional constraints and controls while generating texts and has attracted a lot of attention. Existing controllable text generation approaches mainly capture the statistical association implied within training texts, but generated texts lack causality consideration. This paper intends to review recent CTG approaches from a causal perspective. Firstly, according to previous research on basic types of CTG models, it is discovered that their essence is to obtain the association, and then four kinds of challenges caused by absence of causality are introduced. Next, this paper reviews the improvements to address these challenges from four aspects, namely representation disentanglement, causal inference, knowledge enhancement and multi-aspect CTG respectively. Additionally, this paper inspects existing evaluations of CTG, especially evaluations for causality of CTG. Finally, this review discusses some future research directions for the causality improvement of CTG and makes a conclusion. © 2024

关键词： Causal inference Causality Controllable text generation Knowledge enhancement Representation disentanglement

来源：评论

学校读者我要写书评

暂无评论

Learning Sequence Descriptor based on Spatio-Temporal Attention for Visual Place Recognition

arXiv

引用

arXiv 2023年

作者： Zhao, Junqiao Zhang, Fenglin Cai, Yingfeng Tian, Gengxuan Mu, Wenjie Ye, Chen Feng, Tiantian Department of Computer Science and Technology School of Electronics and Information Engineering Tongji University Shanghai China The MOE Key Lab of Embedded System and Service Computing Tongji University Shanghai China Institute of Intelligent Vehicles Tongji University Shanghai China School of Surveying and Geo-Informatics Tongji University Shanghai China

Visual Place Recognition (VPR) aims to retrieve frames from a geotagged database that are located at the same place as the query frame. To improve the robustness of VPR in perceptually aliasing scenarios, sequence-based VPR methods are proposed. These methods are either based on matching between frame sequences or extracting sequence descriptors for direct retrieval. However, the former is usually based on the assumption of constant velocity, which is difficult to hold in practice, and is computationally expensive and subject to sequence length. Although the latter overcomes these problems, existing sequence descriptors are constructed by aggregating features of multiple frames only, without interaction on temporal information, and thus cannot obtain descriptors with spatio-temporal discrimination. In this paper, we propose a sequence descriptor that effectively incorporates spatio-temporal information. Specifically, spatial attention within the same frame is utilized to learn spatial feature patterns, while attention in corresponding local regions of different frames is utilized to learn the persistence or change of features over time. We use a sliding window to control the temporal range of attention and use relative positional encoding to construct sequential relationships between different features. This allows our descriptors to capture the intrinsic dynamics in a sequence of frames. Comprehensive experiments on challenging benchmark datasets show that the proposed approach outperforms recent state-of-the-art methods. The code is available at https://***/tiev-tongji/Spatio-Temporal-SeqVPR. Copyright © 2023, The Authors. All rights reserved.

关键词： Query processing

来源：评论

学校读者我要写书评

暂无评论

LOG-LIO2: A LiDAR-Inertial Odometry with Efficient Uncertainty Analysis

arXiv

引用

arXiv 2024年

作者： Huang, Kai Zhao, Junqiao Lin, Jiaye Zhu, Zhongyang Song, Shuangfu Ye, Chen Feng, Tiantian The School of Surveying and Geo-Informatics Tongji University Shanghai China Department of Computer Science and Technology School of Electronics and Information Engineering Tongji University Shanghai China The MOE Key Lab of Embedded System and Service Computing Tongji University Shanghai China Institute of Intelligent Vehicles Tongji University Shanghai China

Uncertainty in LiDAR measurements, stemming from factors such as range sensing, is crucial for LIO (LiDAR-Inertial Odometry) systems as it affects the accurate weighting in the loss function. While recent LIO systems address uncertainty related to range sensing, the impact of incident angle on uncertainty is often overlooked by the community. Moreover, the existing uncertainty propagation methods suffer from computational inefficiency. This paper proposes a comprehensive point uncertainty model that accounts for both the uncertainties from LiDAR measurements and surface characteristics, along with an efficient local uncertainty analytical method for LiDAR-based state estimation problem. We employ a projection operator that separates the uncertainty into the ray direction and its orthogonal plane. Then, we derive incremental Jacobian matrices of eigenvalues and eigenvectors w.r.t. points, which enables a fast approximation of uncertainty propagation. This approach eliminates the requirement for redundant traversal of points, significantly reducing the time complexity of uncertainty propagation from O(n) to O(1) when a new point is added. Simulations and experiments on public datasets are conducted to validate the accuracy and efficiency of our formulations. The proposed methods have been integrated into a LIO system, which is available at https://***/tiev-tongji/LOG-LIO2. Copyright © 2024, The Authors. All rights reserved.

关键词： Optical radar

来源：评论

学校读者我要写书评

暂无评论

Verification of web service protocols by logic of knowledge

引用

Journal of Information and Computational Science 2011年第6期8卷 921-932页

作者： Chen, Qingliang Su, Kaile Cao, Ying Liu, Chanjuan School of Electronics Engineering and Computer Science Peking University Beijing 100871 China Department of Computer Science Jinan University Guangzhou 510632 China Key Laboratory of Embedded System and Service Computing Ministry of Education Tongji University Shanghai 200000 China Institute for Integrated and Intelligent Systems Griffith University Brisbane Australia

Web services is a popular distributed systems technology and its effectiveness and efficiency rely badly on the underlying protocols. And web service protocols are designed in XML formats so the message structures within are quite different from the conventional ones. Therefore, the well-established formal verification techniques for conventional protocols, which have gained substantial achievements in practice, cannot be applied directly to them because of the inherently different syntax. In this paper, we propose a justification-oriented and automatic formal approach to verify, in the standard Dolev-Yao model, concerned security properties expressed as epistemic notions, i. e., logic of knowledge, for web service protocols, based on a fault-preserving mapping tool called SuD (SOAP under Dolev-Yao). Our approach is significant because, instead of finding flaws in finite number of protocol sessions, the specifications we are to verify can hold in arbitrary number of sessions. © 2011 Binary Information Press.

关键词： Web services

来源：评论

学校读者我要写书评

暂无评论

Petri net-based real-time scheduling of time-constrained single-arm cluster tools with activity time variation

Petri net-based real-time scheduling of time-constrained sin...

引用

IEEE International Conference on Robotics and Automation (ICRA)

作者： Yan Qiao NaiQi Wu MengChu Zhou Department of Industrial Engineering School of Mechatronics Engineering Guangdong University of Technology Guangzhou China The 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

It is challenging to schedule time-constrained cluster tools subject to activity time variation. With the help of their Petri net model, a real-time control policy is used to offset the activity time variation. Based on it, the schedulability conditions and scheduling algorithms are presented for single-arm cluster tools. The schedulability conditions can be analytically checked. Algorithms are developed based on analytical expressions such that it is also computationally efficient. The schedule obtained by the scheduling algorithms together with a real-time control policy forms the real-time schedule. It is optimal in terms of cycle time.

关键词： Robots Semiconductor device modeling Schedules Load modeling Real time systems Manganese Bismuth

来源：评论

学校读者我要写书评

暂无评论

Efficient Routing Protection Algorithm Based on Optimized Network Topology

引用

Computers, Materials & Continua 2022年第9期72卷 4525-4540页

作者： Haijun Geng Zikun Jin Jiangyuan Yao Han Zhang Zhiguo Hu Bo Yang Yingije Guo Wei Wang Qidong Zhang Guoao Duan School of Computer and Information Technology Shanxi UniversityShanxi030006China School of Automation and Software Engineering Shanxi UniversityShanxi030006China School of Computer Science and Technology Hainan UniversityHaikou570228China Department of Computer Science&Technology Tsinghua UniversityBeijing100084China Department of Urban&Regional Planning San JoséState University San JoséCA95192USA Key Laboratory of Embedded System and Service Computing(Tongji University) Ministry of EducationShanghai201804China Institute of Fundamental and Frontier Sciences University of Electronic Science and Technology of ChinaChengdu610054China Beijinng University of Technology Beijing-Dublin International CollegeBeijing University of TechnologyBeijing100124China

Network failures are unavoidable and occur *** the network fails,intra-domain routing protocols deploying on the Internet need to undergo a long convergence *** this period,a large number of messages are discarded,which results in a decline in the user experience and severely affects the quality of service of Internet service Providers(ISP).Therefore,improving the availability of intra-domain routing is a trending research question to be *** usually employs routing protection algorithms to improve intra-domain routing ***,existing routing protection schemes compute as many backup paths as possible to reduce message loss due to network failures,which increases the cost of the network and impedes the methods deployed in *** address the issues,this study proposes an efficient routing protection algorithm based on optimized network topology(ERPBONT).ERPBONT adopts the optimized network topology to calculate a backup path with the minimum path coincidence degree with the shortest path for all source ***,the backup path with the minimum path coincidence with the shortest path is described as an integer programming *** the simulated annealing algorithm ERPBONT is used to find the optimal ***,the algorithm is tested on the simulated topology and the real *** experimental results show that ERPBONT effectively reduces the path coincidence between the shortest path and the backup path,and significantly improves the routing availability.

关键词： Routing protection algorithm network availability network failure shortest path backup path

来源：评论

学校读者我要写书评

暂无评论

Response Policies to Process Module Failure in Single-Arm Cluster Tools Subject to Wafer Residency Time Constraints

Response Policies to Process Module Failure in Single-Arm Cl...

引用

作者： Qiao, Yan Pan, Chun-Rong Wu, Nai-Qi Zhou, Mengchu Department of Industrial Engineering School of Electro-Mechanical Engineering Guangdong University of Technology Guangzhou510006 China School of Mechatronics and Electrical Engineering Jiangxi University of Science and Technology Ganzhou341000 China Institute of Systems Engineering Macau University of Science and Technology Taipa China Key Laboratory of Embedded System and Service Computing Ministry of Education Tongji University Shanghai201804 China Department of Electrical and Computer Engineering New Jersey Institute of Technology NewarkNJ07102-1982 United States

In semiconductor manufacturing, wafer residency time constraints make the scheduling problem of cluster tools complicated. A process module (PM) in cluster tools is prone to failure. It is crucial to deal with any such failure in a proper and timely manner. If there are feasible periodic schedules in operating a cluster tool before and after a PM failure, it is desired to make it operate continuously when such a failure occurs. However, due to wafer residency time constraints, it is highly challenging to control a tool such that it can be correctly transferred from a feasible schedule before failure to another after it. To solve this problem, a Petri net model is developed to describe the dynamic behavior of a single-arm cluster tool and failure response policies are proposed. The proposed policies are formulated via simple control laws for their easy implementation. Examples are given to show them. © 2015 IEEE.

关键词： Scheduling

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：