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

IEEE International Conference on Big Data Analysis (ICBDA)

作者： Yuanhui Sun Yaying Zhang Key Laboratory of Embedded System and Service Computing Tongji University Shanghai China

ISBN: (纸本)9781467395922

Path restoring is a path searching problem in the time-dependent road network with the time constraints of origin and destination. This paper proposes a path restoring algorithm to find the possible path that vehicles may have been driving along. We mined the vehicle trajectories based on historical GPS data and then build a “popular” intersection graph based on its entropy and frequency. Then the restoring path is searched on the sub-graph of the popular intersection graph. The experiment result shows that the proposed algorithm increases 10% compared to that of using time-dependent fastest path method.

关键词： Vehicles Trajectory Roads Entropy TV Heuristic algorithms Algorithm design and analysis

来源：评论

学校读者我要写书评

暂无评论

Optimal stopping theory based fast coding tree unit decision for high efficiency video coding

Optimal stopping theory based fast coding tree unit decision...

引用

IEEE Visual Communications and Image Processing (VCIP)

作者： Xiuzhe Wu Hanli Wang Zhihua Wei Key Laboratory of Embedded System and Service Computing Tongji University Shanghai China

ISBN: (纸本)9781509053179

High Efficiency Video Coding (HEVC) is the most recent video coding standard aiming to further reduce the bitrate over 50% as compared to the state-of-the-art H.264/Advanced Video Coding under the same visual quality. In order to achieve this, a number of advanced coding techniques have been adopted in HEVC, including the quadtree structure of Coding Unit (CU), Prediction Unit (PU) and Transform Unit (TU), etc. However, these coding techniques lead to a tremendous increase in HEVC encoding computations. In order to reduce the HEVC encoding computational complexity, the optimal stopping theory is employed herein to design an efficient algorithm to optimize the decision making process when choosing the best coding parameters of CU, PU and TU. Extensive comparative experimental results are performed by the proposed algorithm and another two recent works, which demonstrate that the proposed algorithm is very efficient and better in reducing the HEVC encoding computations while keeping the video quality and compression efficiency almost intact.

关键词： Encoding Decision making Algorithm design and analysis Optimization High efficiency video coding Bit rate

来源：评论

学校读者我要写书评

暂无评论

Modeling and Control of Urban Expressways with Emergency using Hybrid Petri Nets

Modeling and Control of Urban Expressways with Emergency usi...

引用

IEEE International Conference on systems, Man, and Cybernetics

作者： Yaying Zhang Yuefeng Fu Wei Qiang Key Laboratory of Embedded System and Service Computing Tongji University Shanghai China

ISBN: (纸本)9781509018987

The urban expressway system model based on hybrid petri nets is proposed. With the traffic detecting cameras and coils, the strategies of traffic signal lights and warning lights are enforced with the aim to prevent the large-scale congestion in emergencies (e.g. accidents). The simulation results verify the effectiveness of the proposed model and the warning light strategy is demonstrated to be suitable for traffic accidents and congestion in the accident-prone weaving sections in the urban expressways.

关键词： warning light strategy Hybrid petri nets urban expressway model emergency control

来源：评论

学校读者我要写书评

暂无评论

Real-time action recognition with enhanced motion vector CNNs

Real-time action recognition with enhanced motion vector CNN...

引用

2016 IEEE Conference on Computer Vision and Pattern Recognition, CVPR 2016

作者： Zhang, Bowen Wang, Limin Wang, Zhe Qiao, Yu Wang, Hanli Shenzhen Key Lab of Comp. Vis. and Pat. Rec. Shenzhen Institutes of Advanced Technology CAS China Key Laboratory of Embedded System and Service Computing Ministry of Education Tongji University Shanghai China Computer Vision Lab ETH Zurich Switzerland

ISBN: (纸本)9781467388511

The deep two-stream architecture [23] exhibited excellent performance on video based action recognition. The most computationally expensive step in this approach comes from the calculation of optical flow which prevents it to be real-time. This paper accelerates this architecture by replacing optical flow with motion vector which can be obtained directly from compressed videos without extra calculation. However, motion vector lacks fine structures, and contains noisy and inaccurate motion patterns, leading to the evident degradation of recognition performance. Our key insight for relieving this problem is that optical flow and motion vector are inherent correlated. Transferring the knowledge learned with optical flow CNN to motion vector CNN can significantly boost the performance of the latter. Specifically, we introduce three strategies for this, initialization transfer, supervision transfer and their combination. Experimental results show that our method achieves comparable recognition performance to the state-of-the-art, while our method can process 390.7 frames per second, which is 27 times faster than the original two-stream method.

关键词： Pattern recognition

来源：评论

学校读者我要写书评

暂无评论

Net-structure-based conditions to decide compatibility and weak compatibility for a class of inter-organizational workflow nets

引用

Science China(Information Sciences) 2015年第7期58卷 128-143页

作者： LIU GuanJun JIANG ChangJun Department of Computer Science Tongji University Key Laboratory of the Ministry of Education for Embedded System and Service Computing Tongji University

Inter-organizational workflow nets(IWF-nets) can well model the interactions among multiple processes by sending/receiving messages. Compatibility and weak compatibility are crucial properties for *** latter guarantees that a system is deadlock-free and livelock-free while the former also guarantees that it has no dead tasks. Our previous work proved that the(weak) compatibility problem is PSPACE-complete for safe IWF-nets. This paper defines a class of IWF-nets in which some simple circuits are allowed. Necessary and sufficient conditions are presented to decide compatibility and weak compatibility for this class, and they are dependent on the net structures only. Algorithms are developed based on these conditions. In addition, we show that the traditional net structures like siphon cannot be easily used to decide the(weak) compatibility of IWF-nets.

关键词： formal method workflow nets compatibility business process model web services composition

来源：评论

学校读者我要写书评

暂无评论

A Prediction Based on Clustering and Personality Questionnaire Data for IGD Risk

A Prediction Based on Clustering and Personality Questionnai...

引用

International Conference on Natural Computation, Fuzzy systems and Knowledge Discovery

作者： Xiaoliang Gong Kun Fang Yichu Hou Bozhong Long Zongling Di Lei Cao National Key Laboratory of Embedded System and Service Computing (Ministry of Education) Tongji University Shanghai China

ISBN: (纸本)9781509040940

With the development of the Internet, a lot of people trapped in the network, especially the adolescent depending on the network game and disturbing their normal life. 579 freshmen participated in this work who were collected the personality questionnaires in the first week they came in university and their grades points average (GPA) after half year. The questionnaires were including Self-Control (SCS), Barratt impulse Inventory (BIS) and Chinese Big Five Personality (CBF). This work used multi-clustering algorithms to construct the models of predicting for Internet game disorder (IGD) risk, including FCM, K-means, and Hierarchical for training model. This is the first try to predict the risk of IGD by personality traits. The results shown the questionnaire data were well separated by different clustering algorithms into three groups who were shared the analogous personality traits which has a relationship with the behavior of IGD. But compared to the GPA of each group, the efficiency of the prediction model seems not so satisfactory. There need more efforts to optimized the model in the future.

关键词： Personality questionnaire Data IGD Risk FCM K-means Hierarchical

来源：评论

学校读者我要写书评

暂无评论

A novel adaptive algorithm for location based on Distance-Loss model in complex environment 20

A novel adaptive algorithm for location based on Distance-Lo...

引用

20th IEEE International Conference on Computer Supported Cooperative Work in Design, CSCWD 2016

作者： Fang, Hao Liu, Min Li, Fei Shen, Weiming Zhang, Feng School of Electronic and Information Engineering Tongji University Shanghai201804 China Department of Computer Zhejiang University City College Hangzhou310015 China Key Laboratory of Embedded System and Service Computing Tongji University Shanghai201804 China

ISBN: (纸本)9781509019151

Location based services are the hottest applications on mobile device nowadays. Indoor wireless position is the key technology to enable location based service to work well indoors, where Global Position system normally couldn't work. The main tendency of indoor wireless position is based on Bluetooth and RSSI (radio signal strength indicator). RSSI is the key parameter for wireless position. But values of RSSI are affected by environment factors easily. Because of this reason, results got from the indoor location technology are usually imprecise and unacceptable. In this paper, an adaptive algorithm based on Distance-Loss model in complex environment is introduced to deal with such problems. The algorithm makes the model adapt to the environment by several parameters which are not influenced by environment. The stability and the accuracy of the algorithm is evidenced by a series of strict experiences. © 2016 IEEE.

关键词： Location

来源：评论

学校读者我要写书评

暂无评论

arXiv

引用

arXiv 2017年

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

In practice, there are many dynamic covering decision information systems, and knowledge reduction of dynamic covering decision information systems is a significant challenge of covering-based rough sets. In this paper, we first study mechanisms of constructing attribute reducts for consistent covering decision information systems when adding objects using related families. We also employ examples to illustrate how to construct attribute reducts of consistent covering decision information systems when adding objects. Then we investigate mechanisms of constructing attribute reducts for consistent covering decision information systems when deleting objects using related families. We also employ examples to illustrate how to construct attribute reducts of consistent covering decision information systems when deleting objects. Finally, the experimental results illustrates that the related family-based methods are effective to perform attribute reduction of dynamic covering decision information systems when object sets are varying with time. Copyright © 2017, The Authors. All rights reserved.

关键词： Rough set theory

来源：评论

学校读者我要写书评

暂无评论

arXiv

引用

arXiv 2017年

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

In practical situations, there are many dynamic covering information systems with variations of attributes, but there are few studies on related family-based attribute reduction of dynamic covering information systems. In this paper, we first investigate updated mechanisms of constructing attribute reducts for consistent and inconsistent covering information systems when varying attribute sets by using related families. Then we employ examples to illustrate how to compute attribute reducts of dynamic covering information systems with variations of attribute sets. Finally, the experimental results illustrates that the related family-based methods are effective to perform attribute reduction of dynamic covering information systems when attribute sets are varying with time. Copyright © 2017, The Authors. All rights reserved.

关键词： Information use

来源：评论

学校读者我要写书评

暂无评论

Finite-time Cluster Synchronization of Complex Networks With Time-Varying Delays

Finite-time Cluster Synchronization of Complex Networks With...

引用

第28届中国控制与决策会议

作者： Xiwei Liu Shaohua Li Department of Computer Science and Technology Tongji University The Key Laboratory of Embedded System and Service Computing Ministry of Education

ISBN: (纸本)9781467397155

In this paper,we study the finite-time cluster synchronization of complex networks with time *** are two different types of time-varying delays in the network:the internal time delay and the coupling ***'s more,we assume that coupling time-varying delays exist only between nodes in different clusters,while no delay happens between nodes in the same cluster,which is more consistent with the real *** on the Lyapunov stability theorem,sufficient conditions are derived to guarantee the realization of the finite-time cluster ***,numerical simulations are provided to support the obtained theoretical results.

关键词： Complex network Cluster synchronization Finite-time Time-varying delays

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：