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

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

作者： Xiwei Liu Yuan Xu Department of Computer Science and Technology Tongji Universityand with the Key Laboratory of Embedded System and Service ComputingMinistry of Education

The pinning control problem of directed complex dynamical networks with unbounded time-varying delays is investigated in this *** related works investigate the synchronization without any external control;while in this paper,external pinning control is added on the network,and this is the main difference between this paper and previous *** order to realize the synchronization,we design a simple controller to pin the *** sufficient criteria are deduced from the method of linear matrix inequality(LMI).Finally,the correct of our theoretical results is verified by numerical examples.

关键词： Complex networks Pinning control Synchronization Time-varying Unbounded delay

来源：评论

学校读者我要写书评

暂无评论

Effectively compressing Near-Duplicate Videos in a joint way

Effectively compressing Near-Duplicate Videos in a joint way

引用

IEEE International Conference on Multimedia and Expo (ICME)

作者： Hanli Wang Ming Ma Tao Tian Key Laboratory of Embedded System and Service Computing Tongji University Shanghai P. R. China

With the increasing popularity of social network, more and more people tend to store and transmit information in visual format, such as image and video. However, the cost of this convenience brings about a shock to traditional video servers and expose them under the risk of overloading. Among the huge amount of online videos, there are quite a number of Near-Duplicate Videos (NDVs). Although many works have been proposed to detect NDVs, few researches are investigated to compress these NDVs in a more effective way than independent compression. In this work, we utilize the data redundancy of NDVs and propose a video coding method to jointly compress NDVs. In order to employ the proposed video coding method, a number of pre-processing functions are designed to explore the correlation of visual information among NDVs and to suit the video coding requirements. Experimental results verify that the proposed video coding method is able to effectively compress NDVs and thus save video data storage.

关键词： Videos Video coding Image coding Bit rate Joints Indexes Encoding

来源：评论

学校读者我要写书评

暂无评论

A New Modified Reachability Graph of ω-independent Petri Nets and its Application

A New Modified Reachability Graph of ω-independent Petri Ne...

引用

2nd International Conference on Communication Technology(ICCT 2015)

作者： Ru Yang Zhijun Ding Meiqin Pan The Key Laboratory of Embedded System and Service Computing Ministry of Education College of international business Shanghai International Studies University

Analysis approaches of liveness are important to Petri nets theory,but the relevant research work in the past is still *** paper proposed a new modified reachability graph(NMRG) approach for liveness analysis of ω-independent Petri *** NMRG of a Petri net is transformed from its NMRT and can be used to analyze liveness and deadlock of ω-independent unbound Petri nets.A sufficient condition of liveness and a sufficient and necessary condition of deadlock of ω-independent Petri nets are proposed on the basis of *** are given to illustrate the method.

关键词： ω-Independent Petri net Liveness Deadlock NMRG

来源：评论

学校读者我要写书评

暂无评论

Lane Detection Method Based on Improved RANSAC Algorithm

Lane Detection Method Based on Improved RANSAC Algorithm

引用

International Symposium on Autonomous Decentralized systems (ISADAS)

作者： Jie Guo Zhihua Wei Duoqian Miao Ministry of Education Key Laboratory of Embedded System and Service Computing Shanghai China Department of Computer Science and Technology Tongji University

ISBN: (纸本)9781479982622

Lane detection based on computer vision is a key technology of Automatic Drive system for intelligent vehicles. In this paper, we propose a real-time and efficient lane detection algorithm that can detect lanes appearing in urban streets and highway roads under complex background. In order to enhance lane boundary information and to be suitable for various light conditions, we adopt canny algorithm for edge detection to get good feature points. We use the generalized curve lane parameter model, which can describe both straight and curved lanes. We propose an improved random sample consensus (RANSAC) algorithm combined with the least squares technique to estimate lane model parameters based on feature extraction. Experiments are conducted on both real road lane videos captured by Tongji University and Caltech Lane Datasets. The experimental results show that our algorithm is can meet the real time requirement and fit lane boundaries well in various challenging road conditions.

关键词： Feature extraction Roads Computational modeling Image edge detection Algorithm design and analysis Real-time systems Mathematical model

来源：评论

学校读者我要写书评

暂无评论

keystroke dynamics in password authentication for multi-user account

引用

Journal of Computational Information systems 2015年第1期11卷 321-331页

作者： Zhang, Xiaomeng Zhao, Peihai Wang, Mimi Department of Computer Science and Technology Tongji University Shanghai China The Key Laboratory of Embedded System and Service Computing Ministry of Education Tongji University Shanghai China

In the field of identity authentication, existing researches on user keystroke authentication only focus on the situation in which a single user uses a single account. When multiple users share one account, there emerges the problem of inaccurate modeling. The key to construct the keyboard behaviour pattern in a single-account-for-multiple-users case is to cluster and build the unique keyboard behaviour pattern for each user under the shared account. In this paper, the original K-means clustering algorithm is improved by adding variance determination conditions. And when the number of users is unknown, the algorithm will determine whether the account is a multi-user account or not and identify the number of users under the account to carry out keyboard behaviour clustering in a single-account-for-multiple-users situation. We build a model based on keyboard behaviour data after clustering. Compared with other methods, experiments arrive at the expected results. This method can be used for keyboard behaviour authentication in real-world scenarios in which multiple users share one account at home or in companies. ©, 2014, Journal of Computational Information systems. All right reserved.

关键词： Authentication

来源：评论

学校读者我要写书评

暂无评论

Research on the Matthews correlation coefficients metrics of personalized recommendation algorithm evaluation

引用

International Journal of Hybrid Information Technology 2015年第1期8卷 163-172页

作者： Liu, Yingbo Cheng, Jiujun Yan, Chendan Wu, Xiao Chen, Fuzhen Key Laboratory of Embedded System and Service Computing of Ministry of Education Tongji University Shanghai China Department of Computer Science and Technology Tongji University Shanghai China

The personalized recommendation systems could better improve the personalized service for network user and alleviate the problem of information overload in the Internet. As we all know, the key point of being a successful recommendation system is the performance of recommendation algorithm. When scholars put forward some new recommendation algorithms, they claim that the new algorithms have been improved in some respects, better than previous algorithm. So we need some evaluation metrics to evaluate the algorithm performance. Due to the scholar didn’t fully understand the evaluation mechanism of recommendation algorithms. They mainly emphasized some specific evaluation metrics like Accuracy, Diversity. What’s more, the academia did not establish a complete and unified assessment of recommendation algorithms evaluation system which is credibility to do the work of recommendation evaluation. So how to do this work objective and reasonable is still a challengeable task. In this article, we discussed the present evaluation metrics with its respective advantages and disadvantages. Then, we put forward to use the Matthews Correlation Coefficient to evaluate the recommendation algorithm’s performance. All this based on an open source projects called mahout which provides a rich set of components to construct the classic recommendation algorithm. The results of the experiments show that the applicability of Matthews correlation coefficient in the relative evaluation work of recommendation algorithm. © 2015 SERSC.

关键词： Recommender systems

来源：评论

学校读者我要写书评

暂无评论

An immune approach for detecting the user's behavior of electronic transaction process

引用

Journal of Computational Information systems 2015年第2期11卷 683-692页

作者： Jiang, Shaoping Yan, Chungang Zhao, Peihai Wang, Mimi Department of Computer Science and Technology Tongji University Shanghai China Key Laboratory of Embedded System and Service Computing Ministry of Education Tongji University Shanghai China

In the process of electronic transaction, there are many abnormal conditions such as user's own mistakes, account theft and so on. Inspired by mechanisms of immune homeostasis, immune surveillance and immune update from the biological immune system, an immune approach for detecting the user's behavior of electronic transaction process is proposed to solve these problems and make the user's behaviors credible. By computing age of each log and cleaning up the aging logs, logs which can reflect the user's habit could be gotten and the mechanism of immune homeostasis is realized. With the newly-generated transaction sequence detected to be abnormal or not, the mechanisms of immune surveillance is achieved. Updating related sets is the realization of immune update, and the goal of detecting the user's behavior can be reached. The experimental results show that the true positive rate can reach 92% when the false positive rate is 10.8%. 1553-9105/Copyright © 2015 Binary Information Press

关键词： Physiology

来源：评论

学校读者我要写书评

暂无评论

A parallel computing model for container terminal logistics

A parallel computing model for container terminal logistics

引用

IEEE International Conference on Automation Science and Engineering (CASE)

作者： Bin Li Weiming Shen School of Transportation Fujian University of Technology Fuzhou China The Key Laboratory of Embedded System and Service Computing Tongji University Shanghai China

Existing planning and scheduling solutions for container terminal logistics systems (CTLS) are not sufficient today due to the highly complexity and uncertain environments. This paper reviews the advantages and shortcomings of the existing solutions and proposes a container terminal conceptual parallel computing model for scheduling and execution based on multi-processor systems. It is built on the computational architecture and fundamental principles of distributed, cooperative, parallel, heterogeneous, and reconfigurable computation in essence. The proposed approach is demonstrated and validated by investigating the stress testing, tailor-made processor affinity, load migration and load balancing of a typical container terminal logistics service case with comprehensive computational experiments.

关键词： Containers Computational modeling Processor scheduling Computer architecture Logistics Marine vehicles

来源：评论

学校读者我要写书评

暂无评论

A Distributed Link Prediction Algorithm Based on Clustering in Dynamic Social Networks

A Distributed Link Prediction Algorithm Based on Clustering ...

引用

IEEE International Conference on systems, Man and Cybernetics

作者： Han Yuan Yunlong Ma Feng Zhang Min Liu Weiming Shen Tongji University School of Electronic and Information Engineering Shanghai China Tongji University The Key Laboratory of Embedded System and Service Computing Shanghai China

ISBN: (纸本)9781479986989

Link prediction in network attempts to predict the exist-yet-unknown links or future links in accordance with the node properties and the network typology. It has been used in many domains such as social network, biology experiment, and criminal investigations. Classical methods are based on graph topology structure and path features but few consider clustering information. Actually, clustering information plays an important role in link prediction, it connects the sparse nodes and other communities to form intensive communities. Besides the application of clustering, the MapReduce-based method is used to improve the efficiency. The validity of algorithm is verified by real-world datasets. The experimental results show that the proposed algorithm has a higher prediction accuracy and lower time complexity, and is more scalable than traditional methods executed by a single machine.

关键词： Prediction algorithms Clustering algorithms Indexes Prediction methods Algorithm design and analysis Heuristic algorithms Social network services

来源：评论

学校读者我要写书评

暂无评论

A Stable and Distributed Community Detection Algorithm Based on Maximal Cliques

A Stable and Distributed Community Detection Algorithm Based...

引用

IEEE International Conference on systems, Man and Cybernetics

作者： Feng Gui Yunlong Ma Feng Zhang Min Liu Rong Yin Weiming Shen Tongji University School of Electronic and Information Engineering Shanghai China Tongji University The Key Laboratory of Embedded System and Service Computing Shanghai China

ISBN: (纸本)9781479986989

In the research area of community detection which aims at detecting some highly cohesive vertex subsets in social network, there mainly exist some problems, such as the algorithms with comparatively excellent quality of the final partitioning usually have high time complexity and some other fast algorithms often result in low quality of partitioning or other disadvantages. Nowadays, the increasing demands for community detection in large-scale social networks necessitate the use of distributed and scalable methods to detect communities in an effective and efficient manner. Label propagation algorithm (LPA), whose time complexity is O (m) on a network with m edges, is a near linear time algorithm to detect community effectively. Besides, owing to having good scalability, the parallel version of LPA (DLPA) is suitable for community detection in large-scale social networks. However, DLPA synchronously updates the vertices labels, which usually brings about label oscillations and results in low quality of partitioning. In this paper, we analyze the drawbacks of DLPA and propose a novel method C-DLPA, which combines DLPA with the notion of maximal cliques and at the same time utilizes a new updating mechanism that updating each node' label by probability of its adjacent nodes, to make final partitioning become more accurate and to avoid oscillations effectively. The experimental results show that C-DLPA has better performance is not only low time cost by as much to avoid oscillations but its community detection accuracy compared with DLPA.

关键词： Oscillators Image edge detection Time complexity Partitioning algorithms Algorithm design and analysis Social network services Transforms

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：