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

2nd International Conference on Signal Processing and Machine Learning, SPML 2019

作者： Zhang, Enwei Zhou, Hongtu Ding, Yongchao Zhao, Junqiao Ye, Chen Key Laboratory of Embedded System and Service Computing Ministry of Education Tongji University School of Electronics and Information Engineering Shanghai China

ISBN: (纸本)9781450372213

Obstacle avoiding is one of the most complex tasks for autonomous driving systems, which was also ignored by many cutting-edge end-to-end learning-based methods. The difficulties stem from the integrated process of detection and interpretation of environment and obstacles and generation of proper behaviors. We make the use of CARLA, a simulator for autonomous driving research, and collect massive human drivers' reactions to obstacles on road subjecting to given driving commands, i.e. follow, go straight, turn left and turn right for about 6 hours. A behavior-Cloning neural network architecture is proposed with the modified loss that enlarge the effects of errors for steer, which indicates the benefit to high an accuracy. We found the data augmentation of the image is crucial to the training of the proposed network. And a reasonable limit allows avoiding unexpected stop. The experiments demonstrate 3 obstacle avoidance cases: for the same type as the training dataset, other automobile and two-wheeled vehicles. Finally, the CARLA benchmark is also tested. © 2019 Association for computing Machinery.

关键词： Autonomous vehicles

来源：评论

学校读者我要写书评

暂无评论

A hierarchical clustering strategy of processing class imbalance and its application in fraud detection 21

A hierarchical clustering strategy of processing class imbal...

引用

21st IEEE International Conference on High Performance computing and Communications, 17th IEEE International Conference on Smart City and 5th IEEE International Conference on Data Science and systems, HPCC/SmartCity/DSS 2019

作者： Zhang, Youjun Liu, Guanjun Zheng, Lutao Yan, Chungang Key Laboratory of the Ministry of Education for Embedded System and Service Computing Shanghai Electronic Transactions and Information Service Collaborative Innovation Center Tongji University Shanghai China

ISBN: (纸本)9781728120584

With the Internet and mobile communications becoming an indispensable part of people's daily lives, online transactions have become one of the most common payment methods. However, transaction fraud incidents also occur frequently, causing a larger number of economic losses. Therefore, transaction fraud detection is significant. The methods of machine learning are often used to detect fraudulent transactions from a larger amount of transaction data. However, the class imbalance problem reduces the performance of these methods. There are mainly four factors causing this problem: imbalanced class distribution, sample size, class separability and within-class concept. The existing improvement strategies for class imbalance mainly focus on the first factor but omit other three ones. This paper considers the four factors to propose a comprehensive model called clustering tree. Constructing a clustering tree includes two steps: 1) we first select a clustering algorithm considering the class separability;and then 2) we use this clustering algorithm to construct a tree that can be used to determine if an incoming transaction is illegal. The root node of this tree contains all samples, and we consider both the imbalanced class distribution and the within-class concept when samples are hierarchically divided into sub-nodes during the constructing process. We compare the proposed method with five state-of-the-art ones on two real transaction datasets, and the experimental results show that our method works better. © 2019 IEEE.

关键词： Clustering algorithms

来源：评论

学校读者我要写书评

暂无评论

Performance analysis for large scale parallel microscopic traffic simulation system

Performance analysis for large scale parallel microscopic tr...

引用

International Symposium on Advances in Computer and Sensor Networks and systems, 2008

作者： Fei, Yin Dongliang, Zhang Department of Computer Science and Technology Tongji University The Key Laboratory of Embedded System and Service Computing Ministry of Education Shanghai 201804 China

ISBN: (纸本)9781427629807

In this paper, we present the parallel implementation of the traffic microsimulation PMTS (Parallel Microscopic Traffic Simulation) focusing on the performance issues. The parallelization of PMTS is domain decomposition, which means that each processor of the PC cluster is responsible for a different geographical area of the simulation region. We describe the transportation network graph partition and information exchange between domains. We demonstrate the time cost mathematics models for PMTS: the vehicle generation, vehicle position calculation, and vehicle information exchange between domains. The workload balance is obtained by adjusting the boundary lines according to the relative load of adjacent subnetworks. All these works have been proved to be effective when PMTS put into use and the experiment results are also provided which match our analysis.

关键词： Vehicles

来源：评论

学校读者我要写书评

暂无评论

A Novel Mutual Information based Ant Colony Classifier 5

A Novel Mutual Information based Ant Colony Classifier

引用

2017 International Conference on Progress in Informatics and computing(PIC)

作者： Hang Yu Xiaoxiao Qian Yang Yu Jiujun Cheng Ying Yu Shangce Gao College of Computer Science and Technology Taizhou University Faculty of Engineering University of Toyama Key Laboratory of Embedded System and Service Computing Ministry of EducationTongji University

ISBN: (纸本)9781538619797;9781538619780

By constructing a list of IF-THEN rules, the traditional ant colony optimization(ACO) has been successfully applied on data classification with not only a promising accuracy but also a user comprehensibility. However, as the collected data to be classified usually contain large volumes and redundant features, it is challenging to further improve the classification accuracy and meanwhile reduce the computational time for *** paper proposes a novel hybrid mutual information based ant colony algorithm(mrAM+) for classification. First, a maximum relevance minimum redundancy feature selection method is used to select the most informative and discriminative attributes in a dataset. Then, we use the enhanced ACO classifier(i.e., AM+)to perform the classification. Experimental results show that the proposed mrAM+ outperforms other seven state-of-art related classification algorithms in terms of accuracy and the size of model.

关键词： ant colony optimization mutual information classification data mining feature selection

来源：评论

学校读者我要写书评

暂无评论

Upper Bounds on Lifetime of Three Dimensional Extended UWB Sensor Networks

引用

电子学报(英文版) 2010年第2期19卷 307-312页

作者： XU Juan JIANG Changjun GUO Aihuang HONG Yongfa LI Shu WANG Cheng School of Electronics and Information Engineering Tongji University Shanghai China Key Laboratory of Embedded System and Service Computing of the Ministry of Education Tongji University Shanghai China College of Information Science and Engineering Shandong University of Science and Technology Qingdao China

The upper bounds on lifetime of three dimensional extended Time hopping impulse radio Ultrawide band (TH-IR UWB) sensor networks are derived using percolation theory arguments. The TH-IR UWB sensor network consists of n sensor nodes distributed in a cube of edge length n^1/3 according to a Poisson point process of unit intensity. It is shown that for such a static three dimensional extended TH-IR UWB sensor network, the upper bound on the lifetime is of order O(n^-1), while in the ideal case, the upper bound on the lifetime is longer than that of a static network by a factor of n ^2/3. Therefore sensor nodes moving randomly in the deployment area can improve the upper bound on network lifetime. The results also reveal that the upper bounds on network lifetime decrease with the number of nodes n, thus extended THIR UWB sensor networks aren't prone to be employed in large-scale network.

关键词：无线传感器网络三维扩展寿命延长超宽带上界静态网络生存时间移动节点

来源：评论

学校读者我要写书评

暂无评论

Robust Learning to Rank Based on Portfolio Theory and AMOSA Algorithm

引用

IEEE Transactions on systems, Man, and Cybernetics: systems 2017年第6期47卷 1007-1018页

作者： Li, Jinzhong Liu, Guanjun Yan, Chungang Jiang, Changjun Key Laboratory of the Ministry of Education for Embedded System and Service Computing Department of Computer Science and Technology Tongji University Shanghai201804 China Key Laboratory of Watershed Ecology and Geographical Environment Monitoring NASG Department of Computer Science and Technology Jinggangshan University Ji'an343009 China

Effectiveness is the most important factor considered in the ranking models yielded by algorithms of learning to rank (LTR). Most of the related ranking models only focus on improving the average effectiveness but ignore robustness. When a ranking model ignores robustness, the effectiveness for many queries is possibly very poor although the average effectiveness for all queries is relatively high. Therefore, Wang et al. first consider robustness in their ranking models. However, the robustness formula defined by Wang et al. cannot characterize those queries whose effectiveness are hurt seriously in comparison with the baseline model. In order to overcome this shortcoming, we propose a novel formula of characterizing robustness based on portfolio theory, and construct a multiobjective optimization model of the robust LTR in which the formula is used. Based on this model, we propose an approach of risk-sensitive and robust LTR, named as R2Rank, which is based on the framework of archived multiobjective simulated annealing algorithm and the idea of preference ranking organization method for enrichment evaluation. The experimental results show that the ranking models produced by our proposed R2Rank approach are better in both effectiveness and robustness than those produced by three state-of-the-art LTR approaches. © 2016 IEEE.

关键词： Simulated annealing

来源：评论

学校读者我要写书评

暂无评论

Fuzzy H∞ Filtering for Nonlinear Networked systems with Multiple Stochastic Time-Varying Delays, Packet Dropouts and Sensor Saturation 34

Fuzzy H∞ Filtering for Nonlinear Networked Systems with Mul...

引用

第三十四届中国控制会议

作者： XU Xiaoli YAN Huaicheng ZHANG Hao SHI Hongbo Key Laboratory of Advanced Control and Optimization for Chemical Process of Ministry of Education School of information Science and Engineering East China University of Science and Technology Key Laboratory of Embedded System and Service Computing Ministry of Education

ISBN: (纸本)9781467374439

This paper investigates the problem of H∞ filter design for a class of nonlinear networked system based on T-S fuzzy model. Multiple stochastic time-varying delays and some incomplete information are considered simultaneously. Incomplete information includes randomly occurring sensor saturation and packet dropouts. Stochastic time-varying delays are depicted as a sequence of stochastic and independent variables, which take values on 0 and 1. Two sets of Bernoulli distributed white noises are introduced to describe randomly occurring sensor saturation and packet dropouts. System conservatism is reduced due to introduce an approach of piecewise quadratic Lyapunov function. By solving a set of linear matrix inequalities(LMIs), the filter parameters are obtained. Finally, a simulation example is provided to illustrate the effectiveness of the proposed filter design approach.

关键词： H ∞ filtering,multiple time-varying delays,randomly occurring sensor saturation,packet dropouts,piecewise quadratic Lyapunov function

来源：评论

学校读者我要写书评

暂无评论

Practical Prescribed Time Tracking Control With Bounded Time-Varying Gain Under Non-Vanishing Uncertainties

引用

IEEE/CAA Journal of Automatica Sinica 2024年第1期11卷 219-230页

作者： Dahui Luo Yujuan Wang Yongduan Song the Key Laboratory of Dependable Service Computing in Cyber Physical Society Ministry of EducationChongqing UniversityChongqing 400044 the School of Automation Chongqing UniversityChongqing 400044 the Star Institute for Intelligent Systems Chongqing 400044 IEEE

This paper investigates the prescribed-time control(PTC) problem for a class of strict-feedback systems subject to non-vanishing uncertainties. The coexistence of mismatched uncertainties and non-vanishing disturbances makes PTC synthesis nontrivial. In this work, a control method that does not involve infinite time-varying gain is proposed, leading to a practical and global prescribed time tracking control solution for the strict-feedback systems, in spite of both the mismatched and nonvanishing uncertainties. Different from methods based on control switching to avoid the issue of infinite control gain that involves control discontinuity at the switching point, in our method a softening unit is exclusively included to ensure the continuity of the control action. Furthermore, in contrast to most existing prescribed-time control works where the control scheme is only valid on a finite time interval, in this work, the proposed control scheme is valid on the entire time interval. In addition, the prior information on the upper or lower bound of gi is not in need,enlarging the applicability of the proposed method. Both the theoretical analysis and numerical simulation confirm the effectiveness of the proposed control algorithm.

关键词： Adaptive control prescribed time control(PTC) strict-feedback systems tracking control

来源：评论

学校读者我要写书评

暂无评论

An Initialization Method based on The Core Clusters for Locality-weight Fuzzy C-Means Clustering 4th

An Initialization Method based on The Core Clusters for Loca...

引用

2013 IEEE 4th International Conference on Software Engineering and service Science

作者： Lei Gu The Key Laboratory of Embedded System and Service Computing Ministry of Education Tongji University School of Computer Science and Technology Nanjing University of Posts and Telecommunication

ISBN: (纸本)9781467349970

The Locality-weight fuzzy c-means clustering method has been presented *** this approach can improve the clustering accuracies,it often gains the unstable clustering results because some random samples are employed for the initial *** this paper,an initialization method based on the core clusters is used for the locality-weight fuzzy c-means *** core clusters can be formed by constructing the σ-neighborhood graph and their centers are regarded as the initial centers of the locality-weight fuzzy c-means *** investigate the effectiveness of our approach,several experiments are done on three *** results show that our proposed method can improve the clustering performance compared to the previous locality-weight fuzzy c-means clustering.

关键词： the initialization clustering methods core clusters locality-weight fuzzy c-means neighborhood graph

来源：评论

学校读者我要写书评

暂无评论

Exploiting robustness in Petri net-based closed-loop systems to accommodate control specification changes

Exploiting robustness in Petri net-based closed-loop systems...

引用

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

作者： Li, Jun Zhou, Mengchu Dai, Xianzhong Key Laboratory of Measurement and Control of Complex Systems of Engineering China Ministry of Education Automation School of Southeast University Nanjing 210096 China Key Laboratory of Embedded System and Service Computing Ministry of Education Tongji University Shanghai 201804 China

ISBN: (纸本)9781479915156

Supervisory control reconfiguration has been paid more attention due to its capacity of handling the uncertainties including resource failures, capability degradation, and task changes in discrete event systems. However, the robustness of closed-loop systems in response to some specification changes was not addressed in the prior studies. This paper presents a reconfiguration method based on Petri nets and integer programming for supervisory control of resource allocation systems with changeable resource allocation relationships (control specifications). First, we propose a reconfiguration mechanism. It updates the P-invariant-based supervisor and evolves the state of the closed-loop system. The latter adapts to the certain changes in specifications by the self-regulation of the closed-loop system's state. It utilizes fully the robustness in a closed-loop system and avoids unnecessary modification of a supervisor. Then, a reconfiguration model with robustness analysis is proposed based on integer programming. By using it, a firing sequence of transitions as a serial of reconfiguration actions can be found. The execution of the sequence implements the state evolution of a closed-loop system. There is no need for making additional efforts to analyze state reachability of the system, since the firability condition of transitions is incorporated into the model. Finally, the method is illustrated through an example of a hospital emergency service system. © 2013 IEEE.

关键词： Closed loop systems

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：