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

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

来源：评论

学校读者我要写书评

暂无评论

An Event Timeline Extraction Method Based on News Corpus 2

An Event Timeline Extraction Method Based on News Corpus

引用

2017 IEEE 2nd International Conference on Big Data Analysis（ICBDA 2017）

作者： Yaguang Wu Haichun Sun Chungang Yan Department of Computer Science and Technology Tongji University The Key Laboratory of Embedded System and Service Computing Tongji University College of Police Information Engineering People's Public Security University of China

ISBN: (纸本)9781509036202

Event extraction is an important research point in information extraction area, and news event extraction has a greater practical significance. The existing methods of extracting news event, which starts from the time element, is to identify the date sentences hold by Natural Language Processing and extract the event on the date by Text Clustering. However, they only process the news that holds a time-tag and gives up the news that has no accurate date, which easily leads an extraction deviation of significant events and reduces the accuracy of ordering the significant events. In this paper, improvement for this defect is to calculate the similarities between sentences to put part of the non-time-tag sentences into the right date container, thereby the accuracy of ordering the significant event is *** experiments and compared with the existing methods,the accuracy of ordering the significant events in this paper is improved by 14.6%.

关键词： event extraction text information mining sentence similarity timeline

来源：评论

学校读者我要写书评

暂无评论

Synchronization of Multi-Weighted and Directed Network Under Pinning Impulsive Control

Synchronization of Multi-Weighted and Directed Network Under...

引用

2021 China Automation Congress, CAC 2021

作者： Hu, Xiaohan Liu, Xiwei Department of Computer Science and Technology Tongji University Shanghai201804 China Department of Computer Science and Technology Key Laboratory of Embedded System Service Computing Tongji University Shanghai201804 China

ISBN: (纸本)9781665426473

In this paper, multi-weighted and directed complex dynamic networks (MWDCDNs) under the control of hybrid impulses are analyzed. Two cases are considered. In the first case, impulses can be only applied on one fixed node. In the other case, impulses are applied on different nodes according to whether they are synchronized or de-synchronized in MWDCDNs with unbounded time delay. By limiting impulsive interval and Chebyshev distance between the normalized left eigenvectors (NLEVec) of multiple coupling matrices corresponding to the zero eigenvalue, we obtain some criteria for the synchronization of MWDCNs. Some numerical simulation are also given. © 2021 IEEE

关键词： Eigenvalues and eigenfunctions

来源：评论

学校读者我要写书评

暂无评论

GradSA: Gradient Sparsification and Accumulation for Communication-Efficient Distributed Deep Learning 15th

GradSA: Gradient Sparsification and Accumulation for Communi...

引用

15th International Conference on Green, Pervasive, and Cloud computing, GPC 2020

作者： Liu, Bo Jiang, Wenbin Zhao, Shaofeng Jin, Hai He, Bingsheng National Engineering Research Center for Big Data Technology and System Service Computing Technology and System Lab Cluster and Grid Computing Lab Huazhong University of Science and Technology Wuhan China Wuhan National Laboratory for Optoelectronics Key Laboratory of Information Storage System Engineering Research Center of Data Storage Systems and Technology Huazhong University of Science and Technology Wuhan China Library Henan University of Economics and Law Zhengzhou China Department of Computer Science School of Computing National University of Singapore Singapore Singapore

ISBN: (纸本)9783030642426

Large-scale distributed deep learning is of great importance in various applications. For distributed training, the inter-node gradient communication often becomes the performance bottleneck. Gradient sparsification has been proposed to reduce the communication overhead. However, the sparsification only arbitrarily selects a small fraction of gradients, while the efficiency of selection dimension has been overlooked. Furthermore, gradient staleness is inevitable after applying the sparsification which will ultimately lead to model divergence. In this paper, we propose a staleness-compensated sparse stochastic gradient descent algorithm, GradSA, to improve the training efficiency. Layer-level gradients are sparsified to reduce the communication overhead, which conform to the characteristics of the network structure, and historical accumulation of the approximated gradients is utilized to speed up convergence. We demonstrate the model convergence acceleration and the efficiency of our layer-level selection over existing state-of-the-art works, such as DGC, TernGrad, and 8-Bit quantization. © 2020, Springer Nature Switzerland AG.

关键词： Efficiency

来源：评论

学校读者我要写书评

暂无评论

A survey on distributed compressed sensing： theory and applications

引用

Frontiers of Computer Science 2014年第6期8卷 893-904页

作者： Hongpeng YIN Jinxing LI Yi CHAI Simon X. YANG College of Automation Chongqing University Chongqing 400030 China Key Laboratory of Dependable Service Computing in Cyber Physical Society of Ministry of Education Chongqing 400030 China State Key Laboratory of Power Transmission Equipment and System Security and New Technology Chongqing 400030 China School of Engineering University of Guelph Guelph N1G 2W1 Canada

The compressed sensing （CS） theory makes sample rate relate to signal structure and content. CS samples and compresses the signal with far below Nyquist sampling frequency simultaneously. However, CS only considers the intra-signal correlations, without taking the correlations of the multi-signals into account. Distributed compressed sensing （DCS） is an extension of CS that takes advantage of both the inter- and intra-signal correlations, which is wildly used as a powerful method for the multi-signals sensing and compression in many fields. In this paper, the characteristics and related works of DCS are reviewed. The framework of DCS is introduced. As DCS＇s main portions, sparse representation, measurement matrix selection, and joint reconstruction are classified and summarized. The applications of DCS are also categorized and discussed. Finally, the conclusion remarks and the further research works are provided.

关键词： compressed sensing distributed compressed sensing sparse representation measurement matrix joint reconstruction joint sparsity model

来源：评论

学校读者我要写书评

暂无评论

Using more initial centers for the seeding-based semi-supervised K-harmonic means clustering

Using more initial centers for the seeding-based semi-superv...

引用

2012 International Conference on Emerging Technologies for Information systems, computing, and Management, ICM 2012

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

ISBN: (纸本)9781461470090

In the initialization of the traditional semi-supervised k-means, the mean of some labeled data belonging to one same class was regarded as one initial center and the number of the initial centers is equal to the number of clusters. However, this initialization method using a small amount of labeled data also called seeds which are not appropriate for the semi-supervised k-harmonic means clustering insensitive to the initial centers. In this paper, a novel semi-supervised k-harmonic means clustering is proposed. Some seeds with one same class are divided into several groups and the mean of all data is viewed as one initial center in every group. Therefore, the number of the initial centers is more than the number of clusters in the new method. To investigate the effectiveness of the approach, several experiments are done on three datasets. Experimental results show that the presented method can improve the clustering performance compared to other traditional semi-supervised clustering algorithms. © 2013 Springer Science+Business Media New York.

关键词： Harmonic analysis

来源：评论

学校读者我要写书评

暂无评论

Gene selection and cancer classification: A rough sets based approach

Gene selection and cancer classification: A rough sets based...

引用

Rough Set and Knowledge technology Conference, RSKT 2008

作者： Sun, Lijun Miao, Duoqian Zhang, Hongyun Key Laboratory of Embedded System and Service Computing Ministry of Education Tongji University Shanghai 201804 China Department of Computer Science and Technology Tongji University Shanghai 201804 China

ISBN: (纸本)3642144667

Indentification of informative gene subsets responsible for discerning between available samples of gene expression data is an important task in bioinformatics. Reducts, from rough sets theory, corresponding to a minimal set of essential genes for discerning samples, is an efficient tool for gene selection. Due to the compuational complexty of the existing reduct algoritms, feature ranking is usually used to narrow down gene space as the first step and top ranked genes are selected . In this paper,we define a novel certierion based on the expression level difference btween classes and contribution to classification of the gene for scoring genes and present a algorithm for generating all possible reduct from informative *** algorithm takes the whole attribute sets into account and find short reduct with a significant reduction in computational complexity. An exploration of this approach on benchmark gene expression data sets demonstrates that this approach is successful for selecting high discriminative genes and the classification accuracy is impressive. © 2010 Springer-Verlag.

关键词： Gene expression

来源：评论

学校读者我要写书评

暂无评论

Inertial estimator learning automata

引用

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences 2012年第6期E95-A卷 1041-1048页

作者： Zhang, Junqi Ni, Lina Xie, Chen Gao, Shangce Tang, Zheng Department of Computer Science and Technology Key Laboratory of Embedded System and Service Computing Tongji University Shanghai 200092 China College of Information Science and Engineering Shandong University of Science and Technology Qingdao China Department of Intellectual Information Systems Engineering University of Toyama Toyama-shi 930-8555 Japan

This paper presents an inertial estimator learning automata scheme by which both the short-term and long-term perspectives of the environment can be incorporated in the stochastic estimator-the long term information crystallized in terms of the running reward-probability estimates, and the short term information used by considering whether the most recent response was a reward or a penalty. Thus, when the shortterm perspective is considered, the stochastic estimator becomes pertinent in the context of the estimator algorithms. The proposed automata employ an inertial weight estimator as the short-term perspective to achieve a rapid and accurate convergence when operating in stationary random environments. According to the proposed inertial estimator scheme, the estimates of the reward probabilities of actions are affected by the last response from environment. In this way, actions that have gotten the positive response from environment in the short time, have the opportunity to be estimated as "optimal", to increase their choice probability and consequently, to be selected. The estimates become more reliable and consequently, the automaton rapidly and accurately converges to the optimal action. The asymptotic behavior of the proposed scheme is analyzed and it is proved to be Ε-optimal in every stationary random environment. Extensive simulation results indicate that the proposed algorithm converges faster than the traditional stochastic-estimator-based SERI scheme, and the deterministicestimator- based DGPA and DPRI schemes when operating in stationary random environments. Copyright © 2012 The Institute of Electronics, Information and Communication Engineers.

关键词： Probability

来源：评论

学校读者我要写书评

暂无评论

l-SkyDiv query:Effectively improve the usefulness of skylines

引用

Science China(Information Sciences) 2010年第9期53卷 1785-1799页

作者： HUANG ZhenHua1,2*,XIANG Yang1 & LIN ZiYu3 1Department of Computer Science and technology,Tongji University,Shanghai 201804,China 2The Key laboratory of Embedded system and service computing,Ministry of Education,Tongji University,Shanghai 200092,China 3Department of Computer Science and technology,Peking University,Beijing 100871,China 1. Department of Computer Science and Technology Tongji University Shanghai 201804 China2. The Key Laboratory of Embedded System and Service Computing Ministry of Education Tongji University Shanghai 200092 China3. Department of Computer Science and Technology Peking University Beijing 100871 China

Skyline query processing has recently received a lot of attention in database *** a set of multi-dimensional objects,the skyline query finds the objects that are not dominated by *** the best of our knowledge,the existing researches mainly focus on how to efficiently return the whole skyline ***,as the cardinality and dimensionality of input dataset increase,the number of skylines grows exponentially,and hence this "huge" skyline set is completely useless to *** by the above fact,in this paper,we present a novel type of l-SkyDiv query,which only returns l skylines having maximum diversity,to improve the usefulness of skyline ***,we prove that the l-SkyDiv query belongs to the NP-Hard problem theoretically,and propose three efficient heuristic algorithms whose time complexities are polynomial to fast implement the proposed ***,we present detailed theoretical analyses and extensive experiments,demonstrating that our algorithms are both efficient and effective.

关键词： skyline query diversity heuristic algorithm query optimization performance evaluation

来源：评论

学校读者我要写书评

暂无评论

Dependency-aware Maintenance for Dynamic Grid services

Dependency-aware Maintenance for Dynamic Grid Services

引用

International Conference on Parallel Processing (ICPP)

作者： Hai Jin Li Qi Song Wu Yaqin Luo Jie Dai Cluster and Grid Computing Laboratory Service Computing Technology and System Huazhong University of Science and Technology China

Any mistaken maintenance for the complicated and distributed grid can bring unpredictable disaster. Here we focus on the system availability issues caused by service dependencies during the maintenance in grid. A novel mechanism, called Cobweb Guardian, is proposed in this paper. It provides multiple granularities (service-, container-, and node-level) maintenance for service components in grid. By using the Cobweb Guardian, grid administrators can execute the maintaining task safely in runtime with high availability. The evaluation results show that our proposed dependency-aware maintenance can make the grid management more automatic and available.

关键词： Availability Runtime Grid computing Computers Software maintenance Scalability Project management Parallel processing Containers Costs

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：