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

Chinese Control Conference (CCC)

作者： Xiwei Liu Jiujun Cheng Department of Computer Science and Technology the Key Laboratory of Embedded System and Service Computing Ministry of Education Tongji University Shanghai China Department of Computer Science and Technology the Key Laboratory of Embedded System Service Computing Shanghai China

In this paper, the cluster synchronization problem for nonlinearly coupled networks under periodically intermittent pinning control is studied. At first, a sufficient condition to guarantee cluster synchronization is presented. Next, an adaptive intermittent control algorithm is designed to the control strength and its validity is rigorously proved. Finally, some numerical examples are presented to demonstrate the correctness of obtained theoretical results.

关键词： Synchronization Couplings Symmetric matrices Adaptive systems Educational institutions Equations Neural networks

来源：评论

学校读者我要写书评

暂无评论

Estimating the direction of motion based on active RFID

Estimating the direction of motion based on active RFID

引用

5th International Conference on New Trends in Information Science and service Science, NISS 2011

作者： Yujian Yangwei Zhang, Yaing School of Electronics and Information Tongji University Shanghai China School of Economics and Management Shanghai Ocean University Shanghai China Key Laboratory of Embedded System and Service Computing Ministry of Education Tongji University Shanghai China

ISBN: (纸本)9788988678626

RFID is one of the crucial technology of the IOT (Internet of things), and it has been applying to the fields of manufacturing, logistics management, public security, etc. Active RFID, as one important component of RFID, has striking features of low power consumption, stable signals, long-range read and strong anti-jamming ability. Active RFID is thus widely used in the areas of long-range identification of people and vehicles and Real Time Location system. In the various applications of active RFID, estimating the direction of motion is a vital technical issue. This paper puts forward a new method to estimate. In other words, using several directional antennae, it forms several reading zones, extracts events of tag-entering or tag-leaving and then realizes the estimation by the order of events. In this way, it is feasible to estimate not only the direction of motion of tags accurately, but also other complicated logic, e.g. tag return midway. © 2011 AICIT.

关键词： Radio frequency identification (RFID)

来源：评论

学校读者我要写书评

暂无评论

Probabilistic Convergent Hough Transform

Probabilistic Convergent Hough Transform

引用

International Conference on Information and Automation (ICIA)

作者： Lei Zhu Zhaoqi Chen The Key Laboratory of Embedded System and Service Computing Ministry of Education University of Tongji Shanghai China

To reduce the computational complexity, a novel method of standard Hough transform (SHT), named probabilistic convergent Hough transform (PCHT), is proposed in this paper. PCHT avoids unnecessary cost of SHT in computation by intermittently detecting several points of a line through fast convergence and in memory by using a one-dimensional accumulator. Considering the inevitable error initiated by PCHT, Sensitivity of detection method is introduced to limit the error rate of detecting a fake line within the tolerable range. Experiment is done in various circumstances. Results and comparison between several line detections and PCHT are shown next, and further discussion is given in the final.

关键词： Transforms Noise Convergence Sensitivity Artificial neural networks Probabilistic logic Shape

来源：评论

学校读者我要写书评

暂无评论

Full-Duplex Millimeter-Wave Communication

arXiv

引用

arXiv 2017年

作者： Xiao, Zhenyu Xia, Pengfei Xia, Xiang-Gen Beihang University Key Laboratory of Embedded System and Service Computing Tongji University University of Delaware

The potential of doubling the spectrum efficiency of full-duplex (FD) transmission motivates us to investigate FD millimeter-wave (FD-mmWave) communication. To realize FD transmission in the mmWave band, we first introduce possible antenna configurations for FD-mmWave transmission. It is shown that, different from the cases in micro-wave band FD communications, the configuration with separate Tx/Rx antenna arrays appears more flexible in self-interference (SI) suppression while it may increase some cost and area versus that with the same array. We then model the mmWave SI channel with separate Tx/Rx arrays, where a near-field propagation model is adopted for the line-of-sight (LOS) path, and it is found that the established LOS-SI channel with separate Tx/Rx arrays also shows spatial sparsity. Based on the SI channel, we further explore approaches to mitigate SI by signal processing, and we focus on a new cancellation approach in FD-mmWave communication, i.e., beamforming cancellation. Centered on the constant-amplitude (CA) constraint of the beamforming vectors, we propose several candidate solutions. Lastly, we consider an FD-mmWave multi-user scenario, and show that even if there are no FD users in an FD-mmWave cellular system, the FD benefit can still be exploited in the FD base station. Candidate solutions are also discussed to mitigate both SI and multi-user interference (MUI) simultaneously. Copyright © 2017, The Authors. All rights reserved.

关键词： Beamforming

来源：评论

学校读者我要写书评

暂无评论

Quasi-synchronization for delayed systems with parameter mismatches via aperiodically intermittent control

Quasi-synchronization for delayed systems with parameter mis...

引用

International Conference on systems and Informatics (ICSAI)

作者： Xiwei Liu Ping Li Yuan Xu Ying Liu Department of Computer Science and Technology Key Laboratory of Embedded System and Service Computing Shanghai China

ISBN: (纸本)9781479954599

Quasi-synchronization is an important type of synchronization because of the parameter mismatches in the real world, so we will investigate it for a delayed network, which is master-slave coupled. By applying the aperiodically and nonlinearly intermittent control on the network, and assuming the time delay is varying, we will present some useful criteria for exponential quasi-synchronization. The main difference of this paper with previous works is that the intermittent mode is aperiodic while that in previous works is periodic. Finally, simulations are also given to show its validity.

关键词： Synchronization Mathematical model Delay effects Numerical models Observers Equations Educational institutions

来源：评论

学校读者我要写书评

暂无评论

Feedback-based Coarse Time-Granularity POI Recommendation and Itinerary Planning

Feedback-based Coarse Time-Granularity POI Recommendation an...

引用

Chinese Automation Congress (CAC)

作者： Jie Zong Zhijun Ding The Key Laboratory of Embedded System and Service Computing Ministry of Education TONGJI University Shanghai China

ISBN: (纸本)9781665426480

For tourists, planning their own travel itinerary to a strange city is really challenging. Although there are many researches on Point of Interests (POIs) recommendation and itinerary planning, two problems occur in currently proposed recommendation algorithms. First, the time granularity of the algorithms is too fine. POI recommendation should be considered within a more coarse-grained time factor. For example, a visitor wouldn’t like to visit a water park in winter, although he appears to love such places. However, seldom researches have taken this into consideration. Second, most of the algorithms build their models based on the tourists’ trajectory, which means, they did not consider users’ feedback. In fact, quite a number of tourists do not like their travel experience and give negative feedbacks after their visits. In this situation, we shouldn’t recommend similar POIs to this user because he may not like such kind of scenic spots at all. To address these two problems, this paper proposes an algorithm called Feedback-based Coarse Time-Granularity POI Recommendation, which can extract information from comments and distinguish tourists’ attitudes towards the POIs they have visited. At the same time, the coarse-grained time factor is considered while making recommendations. In addition, an itinerary planning algorithm is proposed. Experiments show that our algorithm can reach SOTA.

关键词： Negative feedback Automation Urban areas Planning Trajectory Time factors Data mining

来源：评论

学校读者我要写书评

暂无评论

Edge-weight-Based link prediction in heterogeneous graph

Edge-weight-Based link prediction in heterogeneous graph

引用

IEEE International Conference on Networking, Sensing and Control

作者： Jie Zong Zhijun Ding The key laboratory of embedded system and service computing ministry of education TONGJI University Shanghai China

ISBN: (纸本)9781665472449

Link prediction is to predict whether there is a link between two nodes in the graph, it is a very important application and plays a great role in various industries. In recent years, with the development of graph neural network technology, many algorithms make effort to study the expression of each node from the original graph data and use them to infer new links. However, most of the existing algorithms have a common problem when facing heterogeneous graphs, which is, they do not consider the weight of edges in graphs. Instead, they put all their energies into computing node features. Although a few algorithms such as RGCN are trying to take the influence of different link types into account while extracting node features, these implicit feature extractions do not start from the global information, but just calculate independently for each node. In other words, in these algorithms, even the same type of links will be abstracted into different features on different nodes. This is obviously inconsistent with reality. On the same map, the feature of the same link should be relatively fixed and should not be changed just because of different positions. In addition, when the current graph neural network algorithm is applied to link prediction, the link type to be predicted must be specified in advance, which makes the algorithm extremely inflexible. In order to solve these problems, we propose an edge weight calculation algorithm that extracts the edge feature from the whole graph. We also propose the edge-weight-based link prediction algorithm. By introducing edge weight into the MLP, there is no need to specify the target link type at the beginning of model training. It improves both the performance and efficiency of the link prediction model. Experiments on two datasets show that this edge-weight-based link prediction algorithm performs better than current algorithms and reaches SOTA.

关键词： Training Industries Semantics Predictive models Prediction algorithms Feature extraction Graph neural networks

来源：评论

学校读者我要写书评

暂无评论

Dynamic Time-Constrained Path Recommendation with User’s Preference

Dynamic Time-Constrained Path Recommendation with User’s Pr...

引用

IEEE International Conference on systems, Man and Cybernetics

作者： Yixi Wu Yaying Zhang Key Laboratory of Embedded System and Service Computing Ministry of Education Tongji University Shanghai China

ISBN: (纸本)9781665442084

Path recommendation is an essential application in people’s daily life. However, drivers’ experience hidden in their driving history and their personal preferences are less considered in path planning. In this paper we propose a dynamic time-constrained path recommendation method, utilizing the historical GPS trajectory information and user preferences. First, based on graph entropy, critical intersections are extracted from trajectory information to simplify the road network structure. Then the time-dependent mostly chosen path (TDMCP) is obtained by trajectories processing to determine the time-varying paths between critical intersections. Thus the original complex road network is abstracted as a search subnet. Finally we propose an improved dynamic A* search (IDAS) on the search sub-net to find the candidate paths satisfying the time-constraints, and further allow users to set personal preferences to select the final optimal path. The proposed method is validated on the real-world data set, and the result shows that the proposed method surpasses the competing ones especially on long distance path recommendation.

关键词： Roads Conferences Entropy Trajectory History Data mining Cybernetics

来源：评论

学校读者我要写书评

暂无评论

A Dynamic Road Incident Information Delivery Strategy to Reduce Urban Traffic Congestion

引用

IEEE/CAA Journal of Automatica Sinica 2018年第5期5卷 934-945页

作者： Liang Qi Mengchu Zhou Wenjing Luan IEEE Department of Computer Scicnce and Technology Shandong University of Science and TechnologyQingdao 266590China Department of Computer Science Tongji UniversityShanghai 201804China Department of Electrical and Computer Engineering New Jersey Institute of TechnologyNewark NJ 07102USA Key Laboratory of Embedded System and Service Computing Ministry of EducationShanghai Electronic Transactions and Information Service Collaborative Innovation CenterDepartment of Com-puter ScienceTongji UniversityShanghai 201804China

Advanced information and communication technolo-gies can be used to facilitate traffic incident *** an incident is detected and blocks a road link,in order to reduce the incident-induced traffic congestion,a dynamic strategy to deliver incident information to selected drivers and help them make detours in urban areas is proposed by this ***-dependent shortest path algorithms are used to generate a subnetwork where vehicles should receive such information.A simulation approach based on an extended cell transmission model is used to describe traffic flow in urban networks where path information and traffic flow at downstream road links are well *** results reveal the influences of some major parameters of an incident-induced congestion dissipation process such as the ratio of route-changing vehicles to the total vehicles,operation time interval of the proposed strategy,traffic density in the traffic network,and the scope of the area where traffic incident information is *** results can be used to improve the state of the art in preventing urban road traffic congestion caused by incidents.

关键词： Cell transmission model(CTM) intelligent transportation systems(ITS) traffic incident management(TIM) urban traffic congestion

来源：评论

学校读者我要写书评

暂无评论

The preference relation and its application in the information system

The preference relation and its application in the informati...

引用

IEEE International Conference on Computer Science and Automation Engineering (CSAE)

作者： Zhao Mingqing Key Laboratory of Embedded System and Service Computing Ministry of Education University of Tongji Shanghai China

In order to strengthen the traditional information system's capacity of describing practical problems, preference relation is introduced into information system and the concepts of preference information system, preference decision table, and information utility function are offered in this paper. In addition, the existence theorem of information utility function and several applications of information utility function in knowledge acquisition are provided.

关键词： Information systems Knowledge acquisition Economics Clustering methods Transforms Information science Approximation methods

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：