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

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

来源：评论

学校读者我要写书评

暂无评论

Adaptive social network construction using Gaussian mixture model

引用

Information Technology Journal 2011年第12期10卷 2252-2259页

作者： Guo, Xin Xiang, Yang Chen, Qian Wei, Wei Department of Computer Science and Technology School of Electronic and Information Engineering Tongji University Shanghai 201804 China Key Laboratory of Embedded System and Service Computing Ministry of Education Tongji University Shanghai 200092 China

A Social network graph shows social interactions and relationships between individuals in a specific social environment, which is very helpful for analyzing social relationships, activities, structures, etc. The author quantized the strengths of social objects' relationships in social environment using an improved vector space model. Gaussian mixture model was employed to set the threshold for identifying social relationships adaptively and divide social subgroups automatically. According to the threshold, social network graph would be constructed based on performance measures. It is concluded that hidden social relationships can be discovered effectively by using this approach which is very flexible and adaptive for dynamic information feedback mechanism. © 2011 Asian Network for Scientific Information.

关键词： Gaussian distribution

来源：评论

学校读者我要写书评

暂无评论

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.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A Novel Mutual Information based Ant Colony Classifier 5

A Novel Mutual Information based Ant Colony Classifier

引用

2017 International Conference on Progress in Informatics and computing(PIC)

作者： Hang Yu Xiaoxiao Qian Yang Yu Jiujun Cheng Ying Yu Shangce Gao College of Computer Science and Technology Taizhou University Faculty of Engineering University of Toyama Key Laboratory of Embedded System and Service Computing Ministry of EducationTongji University

ISBN: (纸本)9781538619797;9781538619780

By constructing a list of IF-THEN rules, the traditional ant colony optimization(ACO) has been successfully applied on data classification with not only a promising accuracy but also a user comprehensibility. However, as the collected data to be classified usually contain large volumes and redundant features, it is challenging to further improve the classification accuracy and meanwhile reduce the computational time for *** paper proposes a novel hybrid mutual information based ant colony algorithm(mrAM+) for classification. First, a maximum relevance minimum redundancy feature selection method is used to select the most informative and discriminative attributes in a dataset. Then, we use the enhanced ACO classifier(i.e., AM+)to perform the classification. Experimental results show that the proposed mrAM+ outperforms other seven state-of-art related classification algorithms in terms of accuracy and the size of model.

关键词： ant colony optimization mutual information classification data mining feature selection

来源：评论

学校读者我要写书评

暂无评论

Performance analysis for large scale parallel microscopic traffic simulation system

Performance analysis for large scale parallel microscopic tr...

引用

International Symposium on Advances in Computer and Sensor Networks and systems, 2008

作者： Fei, Yin Dongliang, Zhang Department of Computer Science and Technology Tongji University The Key Laboratory of Embedded System and Service Computing Ministry of Education Shanghai 201804 China

ISBN: (纸本)9781427629807

In this paper, we present the parallel implementation of the traffic microsimulation PMTS (Parallel Microscopic Traffic Simulation) focusing on the performance issues. The parallelization of PMTS is domain decomposition, which means that each processor of the PC cluster is responsible for a different geographical area of the simulation region. We describe the transportation network graph partition and information exchange between domains. We demonstrate the time cost mathematics models for PMTS: the vehicle generation, vehicle position calculation, and vehicle information exchange between domains. The workload balance is obtained by adjusting the boundary lines according to the relative load of adjacent subnetworks. All these works have been proved to be effective when PMTS put into use and the experiment results are also provided which match our analysis.

关键词： Vehicles

来源：评论

学校读者我要写书评

暂无评论

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.

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

来源：评论

学校读者我要写书评

暂无评论

Multi‐granularity re‐ranking for visible‐infrared person re‐identification

引用

CAAI Transactions on Intelligence Technology 2023年第3期8卷 770-779页

作者： Yadi Wang Hongyun Zhang Duoqian Miao Witold Pedrycz Department of Computer Science and Technology Tongji UniversityShanghaiChina Key Laboratory of Embedded System and Service Computing Ministry of EducationShanghaiChina Department of Electrical and Computer Engineering University of AlbertaEdmontonAlbertaCanada System Research Institute Polish Academy of SciencesWarsawPoland

Visible‐infrared person re‐identification(VI‐ReID)is a supplementary task of single‐modality re‐identification,which makes up for the defect of conventional re‐identification under insufficient *** is more challenging than single‐modality ReID because,in addition to difficulties in pedestrian posture,camera shoot-ing angle and background change,there are also difficulties in the cross‐modality *** works only involve coarse‐grained global features in the re‐ranking calculation,which cannot effectively use fine‐grained ***,fine‐grained features are particularly important due to the lack of information in cross‐modality re‐*** this end,the Q‐center Multi‐granularity K‐reciprocal Re‐ranking Algorithm(termed QCMR)is proposed,including a Q‐nearest neighbour centre encoder(termed QNC)and a Multi‐granularity K‐reciprocal Encoder(termed MGK)for a more comprehensive feature *** converts the probe‐corresponding modality features into gallery corresponding modality features through modality transfer to narrow the modality *** takes a coarse‐grained mutual nearest neighbour as the dominant and combines a fine‐grained nearest neighbour as a supplement for similarity *** experiments on two widely used VI‐ReID benchmarks,SYSU‐MM01 and RegDB have shown that our method achieves state‐of‐the‐art ***,the mAP of SYSU‐MM01 is increased by 5.9%in all‐search mode.

关键词： computer vision recognition

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Improved condition for controllability of strongly dependent strict minimal siphons in Petri nets

Improved condition for controllability of strongly dependent...

引用

International Conference on Networking, Sensing and Control

作者： Liu, Guanjun Jiang, Changjun Zhou, Mengchu Key Laboratory of the MoE for Embedded System and Service Computing Tongji University Shanghai 201804 China Department of Electrical and Computer Engineering New Jersey Institute of Technology Newark NJ 07102 United States

ISBN: (纸本)9781424495702

Li and Zhou propose an important concept for Petri nets: elementary siphons. They partition siphons into elementary and dependent ones. The controllability of the latter can be ensured by the former's proper control. They give a sufficient condition to decide whether a dependent siphon is controlled by its elementary ones in S3PR. However, this condition is so loose that in many cases the controllability of a dependent SMS cannot be determined although it is actually controlled. In this paper, we propose an improved condition to decide the controllability of strongly dependent SMS. © 2011 IEEE.

关键词： Controllability

来源：评论

学校读者我要写书评

暂无评论

Non-intrusive load disaggregation using semi-supervised learning method

Non-intrusive load disaggregation using semi-supervised lear...

引用

2019 International Conference on Security, Pattern Analysis, and Cybernetics, SPAC 2019

作者： Miao, Nan Zhao, Shengjie Shi, Qingjiang Zhang, Rongqing Tongji University Key Laboratory of Embedded System and Service Computing of Ministry of Education Shanghai China Tongji University Sch. of Software Eng. the Key Lab. of Embedded System and Service Computing of Ministry of Education Shanghai China Tongji University School of Software Engineering Shanghai China

ISBN: (纸本)9781728159287

With the emerging of smart metering around the world, there is a growing demand to analyse the residential energy usage. In this paper, we propose a Deep Neural Network (DNN)-based approach for non-intrusive load monitoring (NILM), which can achieve effective and efficient estimation of individual appliance usage according to a single main meter reading in a non-intrusive manner. Considering practical situations, two training methods are provided. The first training approach is fully supervised learning, which requires a ground truth of label, indicating the state of the appliance (ON/OFF), to build a prediction model. The second training approach is semi-supervised learning, leading to better performance by F-Measure metric while only requiring some more unlabelled training data. Experimental results on the low-sample rate REDD dataset demonstrate the superior performance of our proposed DNN-based method compared with Hidden Markov Model (HMM)based and Graph Signal Processing (GSP)-based approaches. © 2019 IEEE.

关键词： Deep neural networks

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：