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

arXiv 2019年

作者： Zhou, Hongtu Yang, Xinneng Zhang, Enwei Zhao, Junqiao Cai, Lewen Ye, Chen Wu, Yan Key Laboratory of Embedded System and Service Computing Ministry of Education Tongji University Shanghai Department of Computer Science and Technology School of Electronics and Information Engineering Tongji University Shanghai Institute of Intelligent Vehicle Tongji University Shanghai Department of Computer Science Nanjing University Nanjing China

Real-time multi-target path planning is a key issue in the field of autonomous driving. Although multiple paths can be generated in real-time with polynomial curves, the generated paths are not flexible enough to deal with complex road scenes such as S-shaped road and unstructured scenes such as parking lots. Search and sampling-based methods, such as A* and RRT and their derived methods, are flexible in generating paths for these complex road environments. However, the existing algorithms require significant time to plan to multiple targets, which greatly limits their application in autonomous driving. In this paper, a real-time path planning method for multi-targets is proposed. We train a fully convolutional neural network (FCN) to predict a path region for the target at first. By taking the predicted path region as soft constraints, the A* algorithm is then applied to search the exact path to the target. Experiments show that FCN can make multiple predictions in a very short time (50 times in 40ms), and the predicted path region effectively restrict the searching space for the following A* search. Therefore, the A* can search much faster so that the multi-target path planning can be achieved in real-time (3 targets in less than 100ms). Copyright © 2019, The Authors. All rights reserved.

关键词： Autonomous vehicles

来源：评论

学校读者我要写书评

暂无评论

Polynomial-time hierarchy of computable reals

引用

Journal of Computational Information systems 2011年第4期7卷 1108-1115页

作者： Chen, Qingliang Su, Kaile Wu, Lijun Department of Computer Science Jinan University Guangzhou 510632 China Key Laboratory of Embedded System and Service Computing Ministry of Education Tongji University Shanghai China Key Laboratory of High Confidence Software Technologies Ministry of Education Peking University Beijing China Institute for Integrated and Intelligent Systems Griffith University Brisbane Australia School of Computer Science and Engineering University of Electronic Science and Technology Chengdu 610054 China

In mathematics, various representations of real numbers have been investigated and all these representations are proved to be mathematically equivalent. Furthermore, it is known that all effective versions of these representations lead to the same class of "computable real numbers". However, when subrecursive (such as primitive recursive) is taken into account, these representations can lead to different notions of "computable real numbers". This paper will look into the polynomial-time version of the problem for computable real numbers under different representations. We will summarize the known results to exhibit the comprehensive hierarchy they form. Our goal is to clarify systematically how the polynomial-time computability depends on the representations of the real numbers. Copyright © 2011 Binary Information Press.

关键词： Polynomial approximation

来源：评论

学校读者我要写书评

暂无评论

A Tree Pruning Algorithm For MIMO Sphere Decoding Based On Path Metric

A Tree Pruning Algorithm For MIMO Sphere Decoding Based On P...

引用

IEEE Vehicular Technology Conference

作者： Shiliang Wang Xiaolong Guo Songlin Sun Tiehong Tian Shizhen Sun Xiaojun Jing Key Laboratory of Trustworthy Distributed Computing and Service (BUPT) Ministry of Education Beijing University of Posts and Telecommunications Beijing China 100876 China Unicom System Integration Limited Corporation

ISBN: (纸本)9781467309899

Tree pruning can significantly reduce the complexity of sphere decoding (SD). How to determine the pruning rule is an open problem of tree pruning. In this paper, we propose a pruning strategy for SD based on path metric. Because only the nearest lattice point is concerned, if the ratio of the metric to the minimum metric is larger than a threshold, the path whose metric is large enough can be pruned. We analyze the influence of the choice of the thresholds on the performance and the complexity. Through analysis and the simulations, we can show that the complexity reduction is significant while maintaining the negligible performance degradation when proper thresholds are chosen. Besides, tradeoff between complexity and performance can be easily achieved by adjusting the thresholds.

关键词： significantly reduce easily achieved adjusting the threshold tree pruning degradation of performance Metric Metronidazole Spheres Complexity DECODING tradeoffs

来源：评论

学校读者我要写书评

暂无评论

Multicast Throughput of Hybrid Wireless Networks Under Gaussian Channel Model

Multicast Throughput of Hybrid Wireless Networks Under Gauss...

引用

IEEE International Conference on Distributed computing systems

作者： Cheng Wang Shaojie Tang Xiang-Yang Li Changjun Jiang Yunhao Liu Department of Computer Science and Technology Tongji University Shanghai China Department of Computer Science Illinois Institute of Technology Chicago IL 60616 Key Laboratory of Embedded System and Service Computing Ministry of Education Shanghai China Department of Computer Science and Engineering Hong Kong University of Science and Technology

ISBN: (纸本)9781424444816

We study the multicast capacity for hybrid wireless networks consisting of ordinary wireless nodes and base stations under Gaussian Channel model, which generalizes both the unicast capacity and broadcast capacity for hybrid wireless networks. We simply consider the hybrid extended network, where the ordinary wireless nodes are placed in the square region A(n) with side-length n~(1/2) according to a Poisson point process with unit intensity. In addition, m additional base stations (BSs) serving as the relay gateway are placed regularly in the region A(n) and they are connected by a high-bandwidth wired network. Three broad categories of multicast strategies are proposed in this paper. According to the different scenarios in terms of m, n and n_d, we select the optimal scheme from the three categories of strategies, and derive the achievable multicast throughput based on the optimal decision.

关键词： Wireless networks Multicast Gaussian channels point operation BASE STATION HYBRID Hybrid electric vehicles Throughput

来源：评论

学校读者我要写书评

暂无评论

ASBSO: An improved brain storm optimization with flexible search length and memory-based selection

arXiv

引用

arXiv 2021年

作者： Yu, Yang Gao, Shangce Wang, Yirui Cheng, Jiujun Todo, Yuki The Faculty of Engineering University of Toyama Toyama930-8555 Japan Key Laboratory of Embedded System and Service Computing Ministry of Education Department of Computer Science and Technology Tongji University Shanghai200092 China The School of Electrical and Computer Engineering Kanazawa University Kanazawa-shi920-1192 Japan

Brain storm optimization (BSO) is a newly proposed population-based optimization algorithm which uses a logarithmic sigmoid transfer function to adjust its search range during the convergent process. However, this adjustment only varies with the current iteration number, and lacks of flexibility and variety which makes a poor search efficiency and robustness of BSO. To alleviate this problem, an adaptive step length structure together with a success memory selection strategy are proposed to be incorporated into BSO. This proposed method, adaptive step length based on memory selection BSO, namely ASBSO, applies multiple step lengths to modify the generation process of new solutions, thus supplying a flexible search according to corresponding problems and convergent periods. The novel memory mechanism which is capable of evaluating and storing the degree of improvements of solutions is used to determine the selection possibility of step lengths. A set of 57 benchmark functions are used to test ASBSO's search ability, and four real-world problems are adopted to show its application value. All these test results indicate the remarkable improvement in solution quality, scalability and robustness of ASBSO. Copyright © 2021, The Authors. All rights reserved.

关键词： Swarm intelligence

来源：评论

学校读者我要写书评

暂无评论

Risk Contagion in Interbank Lending Networks: A Multi-Agent-Based Modeling and Simulation Perspective

SSRN

引用

SSRN 2024年

作者： Ding, Zhijun Yan, Huanlan Chen, Yijun The Key Laboratory of Embedded System and Service Computing Tongji University No.4800 Caoan Gonglu Road Shanghai201804 China The Department of Computer Science and Technology Tongji University No.4800 Caoan Gonglu Road Shanghai201804 China Shanghai Artificial Intelligence Laboratory No.701 Yunjin Road Shanghai200232 China

The interbank lending network, while facilitating transactions, poses risk contagion in the banking system. To address challenges in existing research, this paper models the interbank lending network using a multi-agent approach and generates a dynamic network through a bidirectional matching mechanism(BiMM). Additionally, We divide banks into three categories based on realistic bank balance sheet data. Given the fact that banks of different categories exhibit different degrees of contagion, we propose the weighted DebtRank (W-DebtRank). Then, comprehensive simulation analysis is conducted on the risk contagion of heterogeneous banks in the dynamic network using W-DebtRank. The proposed method addresses four issues: the heterogeneity of banks, the dynamic nature of networks, the practicality of lending strategies, and the comprehensiveness of risk analysis. The model is validated using the SRISK metric and the Monte Carlo-based SYMBOL simulation model. Through multiple perspectives in simulation experiments, the risk contagion process among banks is deeply investigated in our paper. © 2024, The Authors. All rights reserved.

关键词： Computational methods

来源：评论

学校读者我要写书评

暂无评论

Finite time convergence of pinning synchronization with a single nonlinear controller

arXiv

引用

arXiv 2021年

作者： Chen, Tianping Lu, Wenlian Liu, Xiwei The School of Computer Sciences/Mathematics Fudan University Shanghai200433 China The Centre for Computational Systems Biology School of Mathematical Sciences Fudan University China Department of Computer Science and Technology Tongji University The Key Laboratory of Embedded System and Service Computing Ministry of Education Shanghai200092 China

来源：评论

学校读者我要写书评

暂无评论

Knowledge granulation in interval-valued information systems

Knowledge granulation in interval-valued information systems

引用

International Workshop on Intelligent systems and Applications

作者： Zhang, Nan Miao, Duoqian Gao, Can Department of Computer Science and Technology Tongji University Shanghai 201804 China Department of Computer Science University of Regina Regina SK S4S 0A2 Canada Key Lab. of Embedded System and Service Computing Ministry of Education Tongji University Shanghai 201804 China Department of Electrical and Computer Engineering University of Alberta Edmonton AB T6R 2G4 Canada

ISBN: (纸本)9781424498574

Rough set theory, proposed by Pawlak, has been proved to be a mathematical tool to deal with vagueness and uncertainty in intelligent information processing. In this paper, we propose the concept of knowledge granulation in interval-valued information systems, and discuss some important properties. From these properties, it can be shown that the proposed knowledge granulation provides important approaches to measuring the discernibility of different knowledge. It may be helpful for rule evaluation and knowledge discovery in interval-valued information systems. © 2011 IEEE.

关键词： Information systems

来源：评论

学校读者我要写书评

暂无评论

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

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

引用

International Conference on Communication Technology (ICCT)

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

ISBN: (纸本)9781665432078

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.

关键词： Base stations Costs 5G mobile communication Conferences Communications technology Blockchains Safety

来源：评论

学校读者我要写书评

暂无评论

A MapReduce-based distributed SVM ensemble for scalable image classification and annotation

A MapReduce-based distributed SVM ensemble for scalable imag...

引用

作者： Alham, Nasullah Khalid Li, Maozhen Liu, Yang Qi, Man Nuffield Division of Clinical Laboratory Sciences Radcliffe Department of Medicine University of Oxford OX3 9DU United Kingdom School of Engineering and Design Brunel University Uxbridge Middlesex UB8 3PH United Kingdom Key Laboratory of Embedded Systems and Service Computing Ministry of Education Tongji University China School of Electrical Engineering and Information Systems Sichuan University Chengdu 610065 China Department of Computing Canterbury Christ Church University Canterbury Kent CT1 1QU United Kingdom

A combination of classifiers leads to a substantial reduction of classification errors in a wide range of applications. Among them, support vector machine (SVM) ensembles with bagging have shown better performance in classification than a single SVM. However, the training process of SVM ensembles is notably computationally intensive, especially when the number of replicated training datasets is large. This paper presents MRESVM, a MapReduce-based distributed SVM ensemble algorithm for scalable image annotation which re-samples the training dataset based on bootstrapping and trains an SVM on each dataset in parallel using a cluster of computers. A balanced sampling strategy for bootstrapping is introduced to increase the classification accuracy. MRESVM is evaluated in both experimental and simulation environments, and the results show that the MRESVM algorithm reduces the training time significantly while achieving a high level of accuracy in classifications. © 2013 Elsevier Ltd. All rights reserved.

关键词： Image annotation

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：