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

International Conference on Research Challenges in computer science (ICRCCS)

作者： Jianjun Yuan Changjun Jiang Zuowen Jiang Department of Computer Science and Technology The Key Laboratory of Embedded System and Service Computing Ministry of Education of China University of Tongji Shanghai 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. In real systems, constraints usually exist between values, which means that some values cannot coexist in a valid test. Although meta-heuristic strategies like simulated annealing can generally discover smaller pairwise test suite in the presence of constraints, they may cost more time to perform search, compared with greedy algorithms. We propose a new method, improved extremal optimization, for constructing constrained pairwise test suites. Experimental results show that improved extremal optimization gives similar size of resulting pairwise test suite and yields a 13% reduction in solution time over simulated annealing.

关键词： Constraint optimization Software testing System testing Simulated annealing Costs Greedy algorithms computer science Educational technology Laboratories Embedded system

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

LogisticLDA: Regularizing latent dirichlet allocation by logistic regression

PACLIC 23 - Proceedings of the 23rd Pacific Asia Conference ...

引用

PACLIC 23 - Proceedings of the 23rd Pacific Asia Conference on Language, Information and Computation 2009年 1卷 160-169页

作者： Guo, Jia-Cheng Lu, Bao-Liang Li, Zhiwei Zhang, Lei Center for Brain-Like Computing and Machine Intelligence Department of Computer Science and Engineering Shanghai Jiao Tong University 800 Dong Chuan Road Shanghai 200040 China MOE-Microsoft Key Laboratory for Intelligent Computing and Intelligent Systems Shanghai Jiao Tong University 800 Dong Chuan Road Shanghai 200040 China Microsoft Research Asia 49 Zhichun Road Haidian District Beijing 100080 China

ISBN: (纸本)9789624423198

We present in this paper a supervised topic model for multi-class classification problems. To incorporate supervisory information, we jointly model documents and their labels in a graphical model called LogisticLDA, which mathematically integrates a generative model and a discriminative model in a principled way. By maximizing the posterior of document labels using logistic normal distributions, the model effectively incorporates the supervisory information to maximize inter-class distance in the topic space, while documents still enjoy the interchangeability characteristic for ease of inference. Experimental results on three benchmark datasets demonstrate that the model outperforms state-of-the-art supervised topic models. Compared with support vector machine, the model also achieves comparable performance, but meanwhile it discovers a topic space, which is valuable for dimension reduction, topic mining and document retrieval. © 2009 by Jia-Cheng Guo, Bao-Liang Lu, Zhiwei Li, and Lei Zhang.

关键词： Normal distribution

来源：评论

学校读者我要写书评

暂无评论

Extracting keyphrases from Chinese news articles using Text Rank and query log knowledge

PACLIC 23 - Proceedings of the 23rd Pacific Asia Conference ...

引用

PACLIC 23 - Proceedings of the 23rd Pacific Asia Conference on Language, Information and Computation 2009年 2卷 733-740页

作者： Liang, Weiming Huang, Chang-Ning Li, Mu Lu, Bao-Liang Center for Brain-Like Computing and Machine Intelligence Department of Computer Science and Engineering Shanghai Jiao Tong University 800 Dong Chuan Road Shanghai 200240 China Microsoft Research Asia 49 Zhichun Road Haidian District Beijing 100080 China MOE-Microsoft Key Laboratory for Intelligent Computing and Intelligent Systems Shanghai Jiao Tong University 800 Dong Chuan Road Shanghai 200240 China

ISBN: (纸本)9789624423198

keyphrases extracted from articles are beneficial in helping people boost browsing speed, but unfortunately keyphrases are rarely available for news articles due to the high expense of labor and time for manual annotation. This paper proposes a practical approach to extracting keyphrases for Chinese news articles using the Text Rank and query log knowledge. Previous work is word based, while our approach uses phrase as its basic element. We generate phrases by employing several statistical criteria with the huge amount of queries as a training corpus. We use Text Rank, a graph-based learning algorithm, for extracting keyphrases from Chinese news articles. In addition, two instructive features, lengths and positions of phrases, are incorporated into the Text Rank model. Experimental results demonstrate that our methods improve the performance significantly. © 2009 by Weiming Liang, Chang-Ning Huang, Mu Li, and Bao-Liang Lu.

关键词： Graphic methods

来源：评论

学校读者我要写书评

暂无评论

Adomian decomposition method and Padé approximants for solving the Blaszak-Marciniak lattice

引用

Chinese Physics B 2008年第11期17卷 3953-3964页

作者：杨沛陈勇李志斌 Department of Computer Science East China Normal University Shanghai Key Laboratory of Trustworthy Computing East China Normal University

The Adomian decomposition method （ADM） and Pade approximants are combined to solve the well-known Blaszak-Marciniak lattice, which has rich mathematical structures and many important applications in physics and mathematics. In some cases, the truncated series solution of ADM is adequate only in a small region when the exact solution is not reached. To overcome the drawback, the Pade approximants, which have the advantage in turning the polynomials approximation into a rational function, are applied to the series solution to improve the accuracy and enlarge the convergence domain. By using the ADM-Pade technique, the soliton solutions of the Blaszak-Marciniak lattice are constructed with better accuracy and better convergence than by using the ADM alone. Numerical and figurative illustrations show that it is a promising tool for solving nonlinear problems.

关键词： Adomian decomposition method Pade approximants Blaszak-Marciniak lattice soliton solution

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Process-aware service composition based on Petri net

引用

Journal of Harbin Institute of Technology (New Series) 2008年第SUPPL.期15卷 162-166页

作者： Sun, Ping Li, Xiangmei Department of Computer Science and Engineering Tongji University Shanghai 201804 China Embedded System and Service Computing Key Laboratory Shanghai 201804 China

One of the most promising advantages of Web service technology is the possibility of creating value-added services by combining existing ones. A major challenge is how to discover and select concrete service according to user requirements. This paper addresses the topic of service discovery composite Web services. The main feature is that we take the process model as well as service profile into account. Firstly, the process models of Web services are translated into Petri nets. Based on this, we propose a service matchmaking algorithm, via comparing the functionality compatibility and process consistency, thus leading to more accurate matchmaking.

关键词： Web services

来源：评论

学校读者我要写书评

暂无评论

Symmetry Reduction and Exact Solutions of the(3+1)-Dimensional Breaking Soliton Equation

引用

Communications in Theoretical Physics 2008年第10期50卷 832-840页

作者： WANG Ling DONG Zhong-Zhou Department of Mathematics and Computer Science Chizhou University Chizhou 247000 China Shanghai Key Laboratory of Trustworthy Computing East China Normal University Shanghai 200062 China Key Laboratory of Mathematics Mechanization Chinese Academy of Sciences Beijing 100080 China

By means of the generalized direct method,a relationship is constructed between the new solutions andthe old ones of the (3+1)-dimensional breaking soliton *** on the relationship,a new solution is obtainedby using a given solution of the *** symmetry is also obtained for the (3+1)-dimensional breaking *** using the equivalent vector of the symmetry,we construct a seven-dimensional symmetry algebra and getthe optimal system of group-invariant *** every case of the optimal system,the (3+1)-dimensional breakingsoliton equation is reduced and some solutions to the reduced equations are ***,some new explicitsolutions are found for the (3+1)-dimensional breaking soliton equation.

关键词： generalized direct method breaking soliton equation optimal system explicit solution

来源：评论

学校读者我要写书评

暂无评论

引用

Communications in Theoretical Physics 2008年第10期50卷 803-808页

作者： DONG Zhong-Zhou CHEN Yong WANG Ling Shanghai Key Laboratory of Trustworthy Computing East China Normal University Shanghai 200062 China Key Laboratory of Mathematics Mechanization Chinese Academy of Sciences Beijing 100080 China Department of Mathematics and Computer Science Chizhou University Chizhou 247000 Anhui Province China

Painleve property of the （2＋1）-dimensional multi-component Broer-Kaup （BK） system is considered by using the standard Weiss Kruskal approaches. Applying the Clarkson and Kruskal （CK） direct method to the （2＋1）- dimensional multi-component BK system, some types of similarity reductions are obtained. By solving the reductions, one can get the solutions of the （2＋1）-dimensional multi-component BK system.

关键词： multi-component Broer Kaup system similarity reduction direct method

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：