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

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

A service selection method based on web service clusters

引用

Journal of Applied Sciences 2013年第24期13卷 5734-5738页

作者： Liu, Wei Du, Yu-Yue Yan, Chun College of Information Science and Engineering Shandong University of Science and Technology 266590 Qingdao China The Key Laboratory of Embedded System and Service Computing Ministry of Education Tongji University 200092 Shanghai China

service selection is an essential issue in service discovery based on Web service clusters. The ratio of trust value to price is introduced to select the most suitable service in a cluster. The method of computing the initial trust, the direct trust and the recommendation trust are, respectively presented and the overall trust is derived based on them. The proposed method keeps the balance between the price and service quality. © 2013 Asian Network for Scientific Information.

关键词： Web services

来源：评论

学校读者我要写书评

暂无评论

A hierarchical clustering strategy of processing class imbalance and its application in fraud detection 21

A hierarchical clustering strategy of processing class imbal...

引用

21st IEEE International Conference on High Performance Computing and Communications, 17th IEEE International Conference on Smart City and 5th IEEE International Conference on Data Science and systems, HPCC/SmartCity/DSS 2019

作者： Zhang, Youjun Liu, Guanjun Zheng, Lutao Yan, Chungang Key Laboratory of the Ministry of Education for Embedded System and Service Computing Shanghai Electronic Transactions and Information Service Collaborative Innovation Center Tongji University Shanghai China

ISBN: (纸本)9781728120584

With the Internet and mobile communications becoming an indispensable part of people's daily lives, online transactions have become one of the most common payment methods. However, transaction fraud incidents also occur frequently, causing a larger number of economic losses. Therefore, transaction fraud detection is significant. The methods of machine learning are often used to detect fraudulent transactions from a larger amount of transaction data. However, the class imbalance problem reduces the performance of these methods. There are mainly four factors causing this problem: imbalanced class distribution, sample size, class separability and within-class concept. The existing improvement strategies for class imbalance mainly focus on the first factor but omit other three ones. This paper considers the four factors to propose a comprehensive model called clustering tree. Constructing a clustering tree includes two steps: 1) we first select a clustering algorithm considering the class separability;and then 2) we use this clustering algorithm to construct a tree that can be used to determine if an incoming transaction is illegal. The root node of this tree contains all samples, and we consider both the imbalanced class distribution and the within-class concept when samples are hierarchically divided into sub-nodes during the constructing process. We compare the proposed method with five state-of-the-art ones on two real transaction datasets, and the experimental results show that our method works better. © 2019 IEEE.

关键词： Clustering algorithms

来源：评论

学校读者我要写书评

暂无评论

Probabilistic bootstrap-based evolutionary algorithm for three-objective wind farm turbine position optimization

引用

Swarm and Evolutionary Computation 2025年 96卷

作者： Chen Zhang Haotian Li Xiuxian Li Jiujun Cheng Zhenyu Lei Shangce Gao Faculty of Engineering University of Toyama Toyama-shi 930-8555 Japan College of Electronics and Information Engineering Shanghai Research Institute for Intelligent Autonomous Systems Tongji University Shanghai China Ministry of Education Key Laboratory of Embedded System and Service Computing Tongji University Shanghai China

Amid the worsening energy crisis, wind farm layout optimization (WFLO) to increase power generation, reduce costs, and mitigate potential environmental impacts is of great significance. This paper formulates three-objective wind farm layout optimization (TWFLO) which is rarely considered, aiming to effectively utilize existing information to optimize power output, land usage, and costs. We propose a new algorithm (MOEA/D-P) based on probability distributions to guide turbine placement and improve the performance of a Multiobjective Evolutionary Algorithm Based on Decomposition (MOEA/D). This algorithm addresses the issue of neglecting valuable information during layout optimization. Additionally, we make improvements to the traditional land-use function to avoid situations where non-convex layouts result in an area calculation of zero. The MOEA/D-P is tested on six different initial layouts and compared with five algorithms under two wind conditions. Results are evaluated using inverted generational distance, hypervolume, and scatter plot distributions. The impact of initial probability distribution on algorithm performance is discussed under four simple wind conditions. The results show that MOEA/D-P outperforms the other five algorithms in terms of performance.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Improved Density Peaking Algorithm for Community Detection Based on Graph Representation Learning

引用

computer systems Science & Engineering 2022年第12期43卷 997-1008页

作者： Jiaming Wang Xiaolan Xie Xiaochun Cheng Yuhan Wang Guangxi Key Laboratory of Embedded Technology and Intelligent System Guilin541006GuangxiChina School of Information Science and Engineering Guilin University of TechnologyGuilin541006GuangxiChina Department of Computer Science Middlesex UniversityLondon

There is a large amount of information in the network data that we canexploit. It is difficult for classical community detection algorithms to handle network data with sparse topology. Representation learning of network data is usually paired with clustering algorithms to solve the community detection ***, there is always an unpredictable distribution of class clusters outputby graph representation learning. Therefore, we propose an improved densitypeak clustering algorithm (ILDPC) for the community detection problem, whichimproves the local density mechanism in the original algorithm and can betteraccommodate class clusters of different shapes. And we study the communitydetection in network data. The algorithm is paired with the benchmark modelGraph sample and aggregate (GraphSAGE) to show the adaptability of ILDPCfor community detection. The plotted decision diagram shows that the ILDPCalgorithm is more discriminative in selecting density peak points compared tothe original algorithm. Finally, the performance of K-means and other clusteringalgorithms on this benchmark model is compared, and the algorithm is proved tobe more suitable for community detection in sparse networks with the benchmarkmodel on the evaluation criterion F1-score. The sensitivity of the parameters ofthe ILDPC algorithm to the low-dimensional vector set output by the benchmarkmodel GraphSAGE is also analyzed.

关键词： Representation learning data mining low-dimensional embedding community detection density peaking algorithm

来源：评论

学校读者我要写书评

暂无评论

API Usage Pattern Search Based on Model Checking 7th

API Usage Pattern Search Based on Model Checking

引用

7th International Symposium on Dependable Software Engineering: Theories, Tools, and Applications, SETTA 2021

作者： Ding, Xue-er Niu, Jun Wang, Jia Faculty of Electrical Engineering and Computer Science Ningbo University Ningbo315211 China Key Laboratory of Embedded System and Service Computing Ministry of Education Tongji University Shanghai201804 China

ISBN: (纸本)9783030912642

Reusing existing class libraries can improve the productivity of software development. API usage patterns are useful resources for programmers in reusing class libraries. Existing approaches often exploit API graphs to model semantic relations between API elements of class libraries, and traversal graphs to capture API usage patterns. However, those approaches cannot describe the number of parameters and the number of overload methods, and may not search for various API usage patterns. In this paper, we propose an automatic and complete approach to searching for API usage patterns by model checking technique. We introduce a novel kind of API transition system model to completely describe the relations between all API elements of existing class libraries. We obtain API usage constraints from queries, namely the numbers and types of input and output objects and class types transformed based on APIs replacement model, and give the logical characterizations of the constraints by suitable CTL* (computation tree logic) formulas. Then, we can obtain suitable API usage patterns by model checking the logical formulas in related API transition system models based on model checker NuSMV. The experiments indicate that, in contrast to existing approaches, our approach can automatically and effectively search for various API usage patterns. © 2021, Springer Nature Switzerland AG.

关键词： Model checking

来源：评论

学校读者我要写书评

暂无评论

An efficient gene selection algorithm based on tolerance rough set theory 1

引用

12th International Conference on Rough Sets, Fuzzy Sets, Data Mining and Granular Computing, RSFDGrC 2009

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

ISBN: (数字)9783642106460

ISBN: (纸本)3642106455

Gene selection, a key procedure of the discriminant analysis of microarray data, is to select the most informative genes from the whole gene set. Rough set theory is a mathematical tool for further reducing redundancy. One limitation of rough set theory is the lack of effective methods for processing real-valued data. However, most of gene expression data sets are continuous. Discretization methods can result in information loss. This paper investigates an approach combining feature ranking together with feature selection based on tolerance rough set theory. Compared with gene selection algorithm based on rough set theory, the proposed method is more effective for selecting high discriminative genes in cancer classification task. © 2009 Springer-Verlag Berlin Heidelberg.

关键词： Rough set theory

来源：评论

学校读者我要写书评

暂无评论

Upper Bounds on Lifetime of Three Dimensional Extended UWB Sensor Networks

引用

电子学报(英文版) 2010年第2期19卷 307-312页

作者： XU Juan JIANG Changjun GUO Aihuang HONG Yongfa LI Shu WANG Cheng School of Electronics and Information Engineering Tongji University Shanghai China Key Laboratory of Embedded System and Service Computing of the Ministry of Education Tongji University Shanghai China College of Information Science and Engineering Shandong University of Science and Technology Qingdao China

The upper bounds on lifetime of three dimensional extended Time hopping impulse radio Ultrawide band (TH-IR UWB) sensor networks are derived using percolation theory arguments. The TH-IR UWB sensor network consists of n sensor nodes distributed in a cube of edge length n^1/3 according to a Poisson point process of unit intensity. It is shown that for such a static three dimensional extended TH-IR UWB sensor network, the upper bound on the lifetime is of order O(n^-1), while in the ideal case, the upper bound on the lifetime is longer than that of a static network by a factor of n ^2/3. Therefore sensor nodes moving randomly in the deployment area can improve the upper bound on network lifetime. The results also reveal that the upper bounds on network lifetime decrease with the number of nodes n, thus extended THIR UWB sensor networks aren't prone to be employed in large-scale network.

关键词：无线传感器网络三维扩展寿命延长超宽带上界静态网络生存时间移动节点

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：