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

Construct pairwise test suites based on the Bak-Sneppen model of biological evolution

World Academy of Science, Engineering and Technology 2009年 35卷 224-229页

作者： Yuan, Jianjun Jiang, Changjun Department of Computer Science and Technology The Key Lab. of 'Embedded System and Service Computing' Ministry of Education of China Tongji University Shanghai 201804 China

Pairwise testing, which requires that every combination of valid values of each pair of system factors be covered by at lease one test case, plays an important role in software testing since many faults are caused by unexpected 2-way interactions among system factors. Although meta-heuristic strategies like simulated annealing can generally discover smaller pairwise test suite, they may cost more time to perform search, compared with greedy algorithms. We propose a new method, improved Extremal Optimization (EO) based on the Bak-Sneppen (BS) model of biological evolution, for constructing pairwise test suites and define fitness function according to the requirement of improved EO. Experimental results show that improved EO gives similar size of resulting pairwise test suite and yields an 85% reduction in solution time over SA.

关键词： Simulated annealing

来源：评论

学校读者我要写书评

暂无评论

Adaptation of Mismatching services Based on Labelled Interface Automata

Adaptation of Mismatching Services Based on Labelled Interfa...

引用

Fifth International Conference on Semantics,Knowledge and Grid(第五届语义、知识与网格国际会议 SKG 2009)

作者： Tao Liu Guosun Zeng Department of Computer Science and Technology Tongji University Shanghai 200092 China The Key Laboratory of Embedded System and Service Computing Ministry of Education Tongji Universit

In today's web, more and more software and applications are wrapped as services. However interactions between services are not always perfectly completed because of mismatches among them. service mediation and adaptation problems obtain increasingly concerns. In this paper, we propose an extension of interface automata, labelled interface automata, to illustrate mismatching services and adaptation. We characterize the problem by classifying different kinds of adaptation scenarios. Then we focus on how to use labelled interface automata to illustrate the building of adaption service between mismatching services.

关键词： mismatching service adaptation interface automata

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Feature selection on chinese text classification using character N-grams

引用

3rd International Conference on Rough Sets and Knowledge Technology, RSKT 2008

作者： Wei, Zhihua Miao, Duoqian Chauchat, Jean-Hugues Zhong, Caiming Tongji University Key Laboratory Embedded System and Service Computing Ministry of Education Cao'an Road Shanghai 201804 China Laboratoire ERIC Université Lumière Lyon 2 5 avenue Pierre Mendès-France Bron Cedex 69676 France

ISBN: (纸本)3540797203

In this paper, we perform Chinese text classification using n-gram text representation on TanCorp which is a new large corpus special for Chinese text classification more than 14,000 texts divided into 12 classes. We use different n-gram feature (1-, 2-grams or 1-, 2-, 3-grams) to represent documents. Different feature weights (absolute text frequency, relative text frequency, absolute n-gram frequency and relative n-gram frequency) are compared. The sparseness of "document by feature" matrices is analyzed in various cases. We use the C-SVC classifier which is the SVM algorithm designed for the multi-classification task. We perform our experiments in the TANAGRA platform. We found out that the feature selection methods based on n-gram frequency (absolute or relative) always give better results and produce denser matrices. © 2008 Springer-Verlag Berlin Heidelberg.

关键词： Feature Selection

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：