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

Interval set cluster analysis: A re-formulation 1

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

作者： Yao, Yiyu Lingras, Pawan Wang, Ruizhi Miao, Duoqian Department of Computer Science University of Regina Regina SK S4S 0A2 Canada Department of Mathematics and Computing Science Saint Mary's University Halifax NS B3H 3C3 Canada Dept. of Comp. Science and Technology Key Laboratory of Embedded System and Service Computing Tongji University Shanghai 201804 China

ISBN: (数字)9783642106460

ISBN: (纸本)3642106455

A new clustering strategy is proposed based on interval sets, which is an alternative formulation different from the ones used in the existing studies. Instead of using a single set as the representation of a cluster, each cluster is represented by an interval set that is defined by a pair of sets called the lower and upper bounds. Elements in the lower bound are typical elements of the cluster and elements between the upper and lower bounds are fringe elements of the cluster. A cluster is therefore more realistically characterized by a set of core elements and a set of boundary elements. Two types of interval set clusterings are proposed, one is non-overlapping lower bound interval set clustering and the other is overlapping lower bound interval set clusterings, corresponding to the standard partition based and covering based clusterings. © 2009 Springer-Verlag Berlin Heidelberg.

关键词： Cluster analysis

来源：评论

学校读者我要写书评

暂无评论

Parameter Approximate Dynamic Optimization for PSO systems

Parameter Approximate Dynamic Optimization for PSO Systems

引用

Joint 48th IEEE Conference on Decision and Control and 28th Chinese Control Conference

作者： Qi Kang Lei Wang Derong Liu Qidi Wu College of Electronics and Information Engineering and the Key Laboratory of Embedded System and Computer-service of MOETongji University Key Laboratory of Complex Systems and Intelligence Science Chinese Academy of Sciences

This paper presents a novel swarm approximate dynamic programming method(swarm-ADP) for parameter optimization of PSO systems,from the perspective of optimal *** on the stability results of a simplified PSO and the swarm-ADP algorithm,parameter dynamic optimization and computation is studied in detail for a deterministic PSO system and a stochastic PSO system,***,numerical simulations based on several benchmarks optimization are *** results show the validity of the proposed parameter optimization method for PSO systems.

关键词： swarm Parameter Approximate Dynamic Optimization for PSO systems

来源：评论

学校读者我要写书评

暂无评论

Independent global constraints-aware web service composition optimization

引用

Information Technology Journal 2009年第2期8卷 181-187页

作者： Fang, Xianwen Jiang, Changjun Fan, Xiaoqin Department of Computer Science and Technology Tongji University Shanghai 201804 China Key Lab of Embedded System and Service Computing Ministry of Education Shanghai 201804 China Department of Information and Computer Science Anhui University of Science and Technology Huainan Anhui 232001 China

In semi-automatic service composition, developers should construct the process model according to concrete application requirement and then the instance services are bound automatically for every abstract task and make the composite service with optimal performance. This study presents independent global constrains-aware Web service composition method based on associate Petri net (APN) and genetic algorithm (GA). Firstly, an APN modeling methods which can describe multi-attribute multi-constraint relations and associate relation between component services is proposed. Secondly, combining with the properties of APN, GA is used to search a legal firing sequence with the biggest trust value in the APN model and the composite service corresponding to the legal firing sequence is the optimal solution. Finally, the experimental simulation is given out. Theoretical analysis and experimental results indicate that this method owns both lower computation cost and higher success ratio of service composition. © 2009 Asian Network for Scientific Information.

关键词： Web services

来源：评论

学校读者我要写书评

暂无评论

Multicast Throughput of Hybrid Wireless Networks Under Gaussian Channel Model

Multicast Throughput of Hybrid Wireless Networks Under Gauss...

引用

IEEE International Conference on Distributed computing systems

作者： Cheng Wang Shaojie Tang Xiang-Yang Li Changjun Jiang Yunhao Liu Department of Computer Science and Technology Tongji University Shanghai China Department of Computer Science Illinois Institute of Technology Chicago IL 60616 Key Laboratory of Embedded System and Service Computing Ministry of Education Shanghai China Department of Computer Science and Engineering Hong Kong University of Science and Technology

ISBN: (纸本)9781424444816

We study the multicast capacity for hybrid wireless networks consisting of ordinary wireless nodes and base stations under Gaussian Channel model, which generalizes both the unicast capacity and broadcast capacity for hybrid wireless networks. We simply consider the hybrid extended network, where the ordinary wireless nodes are placed in the square region A(n) with side-length n~(1/2) according to a Poisson point process with unit intensity. In addition, m additional base stations (BSs) serving as the relay gateway are placed regularly in the region A(n) and they are connected by a high-bandwidth wired network. Three broad categories of multicast strategies are proposed in this paper. According to the different scenarios in terms of m, n and n_d, we select the optimal scheme from the three categories of strategies, and derive the achievable multicast throughput based on the optimal decision.

关键词： Wireless networks Multicast Gaussian channels point operation BASE STATION HYBRID Hybrid electric vehicles Throughput

来源：评论

学校读者我要写书评

暂无评论

Approximate dynamic job-shop scheduling optimization for semiconductor assembly based on swarm intelligence

引用

Nanjing Li Gong Daxue Xuebao/Journal of Nanjing University of Science and Technology 2009年第SUPPL. 1期33卷 39-46页

作者： Kang, Qi Yang, Dong-Sheng Wang, Lei Wu, Qi-Di College of Electronics and Information Engineering Shanghai 201804 China Key Laboratory of Embedded System and Computer-service of Ministry of Education Tongji University Shanghai 201804 China

An approximate dynamic optimization method is proposed for a kind of semiconductor assembly job-shop scheduling based on swarm intelligence. In this method, a heuristic swarm stochastic optimization technology, i. e., the particle swarm optimization is adopted to find an optimal operation. sequence and the schedule strategy having the minimal total make-span (TMS) in its admissible sequence space. Meanwhile, a discrete dynamic programming approach is integrated to particle fitness evaluation. The numerical example based on the simplified produce model and the actual produce data is studied to illustrate the effectiveness of the method for job-shop scheduling.

关键词： Job shop scheduling

来源：评论

学校读者我要写书评

暂无评论

Integrated verification model atsFPM based on functional, time and spatial constraints

引用

Jisuanji Xuebao/Chinese Journal of Computers 2009年第4期32卷 740-750页

作者： Niu, Jun Zeng, Guo-Sun Chen, Bo Department of Computer Science and Technology Tongji University Shanghai 201804 China Key Laboratory of Embedded System and Service Computing of Ministry of Education Shanghai 201804 China College of Information Engineering Zhejiang Business Technology Institute Ningbo 315012 China

Nowadays complex information system's integrated formal models of function verification and performance evaluation lack properties constraint about space aspect. This paper presents an integrated verification model atsFPM by defining a space requirement function over the states of the considered information system. The patterns of paths which are based on regular expressions is proposed in order to specify the functional specifications. The syntax and semantic of the model atsFPM is defined. A conversion product model is obtained by the combination of the system model and the automaton of the pattern of paths which expresses the functional specifications. The verification of the model atsFPM is tackled by the performance verification technique of Markov Reward Model. Experimental results show that the atsFPM model and its verification approach can satisfy the modeling of information system and verification of functional and performance specifications.

关键词： Information systems

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Optimization dynamics evaluation mode for particle swarm algorithm

引用

Nanjing Li Gong Daxue Xuebao/Journal of Nanjing University of Science and Technology 2009年第SUPPL. 1期33卷 1-6页

作者： An, Jing Yang, Dong-Sheng Wang, Lei Kang, Qi Wu, Qi-Di College of Electronics and Information Engineering Tongji University Shanghai 201804 China School of Mechanical and Automation Engineering Shanghai Institute of Technology Shanghai 200235 China Embedded System and Computer-service Key Laboratory of Ministry of Education Tongji University Shanghai 201804 China

Based on the fundamental evaluation index system of intelligent optimization, a type of optimization dynamics evaluation mode for particle swarm algorithm is presented here. The mode is used for general optimization performance and particles'population dynamics. In the evaluation mode, primary indexes include optimum value, population dynamic aggregation, population center convergence and population diversity. Numerical optimization simulation based on several benchmarks is studied, and the typical population dynamic results of primary indexes show that the proposed optimization dynamics evaluation mode is effective.

关键词： Population dynamics

来源：评论

学校读者我要写书评

暂无评论

Probabilistic Convergent Hough Transform

Probabilistic Convergent Hough Transform

引用

International Conference on Information and Automation (ICIA)

作者： Lei Zhu Zhaoqi Chen The Key Laboratory of Embedded System and Service Computing Ministry of Education University of Tongji Shanghai China

To reduce the computational complexity, a novel method of standard Hough transform (SHT), named probabilistic convergent Hough transform (PCHT), is proposed in this paper. PCHT avoids unnecessary cost of SHT in computation by intermittently detecting several points of a line through fast convergence and in memory by using a one-dimensional accumulator. Considering the inevitable error initiated by PCHT, Sensitivity of detection method is introduced to limit the error rate of detecting a fake line within the tolerable range. Experiment is done in various circumstances. Results and comparison between several line detections and PCHT are shown next, and further discussion is given in the final.

关键词： Transforms Noise Convergence Sensitivity Artificial neural networks Probabilistic logic Shape

来源：评论

学校读者我要写书评

暂无评论

Visual Tracking Based on Mixture Motion Model and Incorporate Observation Distribution

Visual Tracking Based on Mixture Motion Model and Incorporat...

引用

Congress on Image and Signal Processing, CISP

作者： Keju Zu Yu Yang Zhipeng Li Fuqiang Liu Min Tian The Key Laboratory of Embedded System and Service Computing supported by Ministry ofEducation University of Tongji Shanghai China

Accurate visual object tracking through long sequences is a challenging task since object's appearance changes and complex motion happens. We present mixture motion model and incorporate observation model within the Monte Carlo framework to achieve robust visual tracking. The mixture motion model which employs important history motion information of the target is built according to a motion measurement matrix to model the target's transition state. Meanwhile, the incorporate observation model is established by introducing SVM classification scores into normal tracking observation model. A particles filter's implementation with these mixture models is demonstrated, which leads to robust tracking results, especially in occlusion and complex scene.

关键词： Target tracking Particle tracking Monte Carlo methods Robustness Support vector machines Support vector machine classification Particle filters History Signal processing Laboratories

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：