首页期刊导航|上海大学学报(英文版)
期刊信息/Journal information
上海大学学报(英文版)
上海大学学报(英文版)

戴世强

季刊

1007-6417

jpsu_l@staff.shu.edu.cn

021-66135218

200444

上海市宝山区上大路99路上海大学124信箱

上海大学学报(英文版)/Journal Journal of Shanghai University(English Edition)
查看更多>>《Journal of Shanghai University》是在钱伟长校长的大力倡导和支持下于1997年6月创刊的。本刊由上海大学出版社出版,《上海大学学报》(英文版)编委会编辑, 上海大学期刊社发行。本刊设有“Reviews”,“Articles”,“Letters”,“Abstracts of Doctoral Dissertations”等栏目,报道范围涉及自然科学与工程技术的多种领域,主要有“应用数学和力学”,“信息技术”,“机电工程与自动化”,“材料科学与工程”等领域。 本刊重视学术论文的创新性。钱校长在本刊发刊词中把科研成果分为三类:第一类用新理论新方法解决新问题;第二类用新理论新方法解决老问题或用已有理论和方法解决新问题;第三类用已有理论和方法解决老问题。本刊将优先刊登第一类学术论文,也发表一些第二类学术论文,而不采用第三类论文。本刊只刊出未在正式刊物上公开发表过的研究论文。 本刊除刊登上海大学教师和研究生的最新研究成果外,也刊登其它高校及科研院所专家学者们的优秀学术论文,而且在论文的筛选和刊出上一视同仁。本刊尤其欢迎国家自然科学基金课题和国家“八六三”项目的研究论文以及海外留学生的研究论文,也欢迎资深学者的专题综述文章, 本刊也以“Letters”的形式报道学者们的阶段性研究成果。本刊主要向国外发行,向国外近20家文献检索刊物和数据库及近百所大学图书馆按期寄送。到目前为止,本刊已被国际多家重要检索刊物或数据库收录。它们是美国的“工程索引”(EI Page One),英国的“科学文摘”(SA-INSPEC),俄罗斯的“文摘杂志”(РЖ),日本的“科学技术文献速报”(CBST),美国的“剑桥科学文摘”(CSA),美国的“数学评论”(MR),美国的“应用力学评论”(AMR),德国的“数学文摘”(ZBI),美国的“化学文摘”(CA)等的收录期刊。本刊同时被国内4家全文数据库和多家专业文摘刊物收录。欢迎国内外专家学者投稿,有关投稿的具体要求见本刊征稿简则。本刊国内外公开发行, 可通过天津联合征订服务部、北京人天书店征订,也可直接向上海大学期刊社征订。
正式出版
收录年代

    Nearest neighbor search algorithm based on multiple background grids for fluid simulation

    ZHENG De-qunWU PinSHANG Wei-lieCAO Xiao-peng...
    405-408页
    查看更多>>摘要:The core of smoothed particle hydrodynamics(SPH)is the nearest neighbor search subroutine.In this paper,a nearest neighbor search algorithm which is based on multiple background grids and support variable smooth length is introduced.Through tested on lid driven cavity flow,it is clear that this method can provide high accuracy.Analysis and experiments have been made on its parallelism,and the results show that this method has better parallelism and with adding processors its accuracy become higher,thus it achieves that efficiency grows in pace with accuracy.

    Generating test case specifications of web service composition using model checking

    QIAN Ling-liCHEN Yi-hai
    409-414页
    查看更多>>摘要:Model checking techniques have been widely used in verifying web service compositions to ensure the trustworthiness.However,little research has focused on testing web services.Based on the research of model checking techniques,we propose a model checking based approach for testing web service composition which is described by using the web services choreography description language(WS-CDL).According to worldwide web consortium(W3C)candidate recommendation,the WS-CDL specification provides a language for characterizing interactions between distinct web services using XML.Since the behaviors of web service composition are asynchronous,distributed,low-coupled and platform independent,we employ the guarded automata(GA)model for specifying the composition described in WS-CDL and using the simple promela interpreter (SPIN)model checker for detecting the collaborations of web services.Test cases can be transformed from counterexamples generated by SPIN using adequacy criteria.In this paper we apply the transition coverage criterion for generating counterexamples.To illustrate our approach,we set “E-commerce service system” as an example for demonstrating how test cases can be generated using SPIN for compositions specified in WS-CDL.

    Parallel communication optimization based on least square method for LBM

    CAO Xiao-pengWU PinSHANG Wei-lieZHENG De-qun...
    415-419页
    查看更多>>摘要:Efficient communication is important to every parallel algorithm.A parallel communication optimization is introduced into lattice Boltzmann method(LBM).It relies on a simplified communication strategy which is implemented by least square method.After testing the improved algorithm on parallel platform,the experimental results show that compared with normal parallel lattice Boltzmann algorithm,it provides better stability,higher performance while maintaining the same accuracy.

    User-preferences based service selection model in large-scale services with various QoS properties

    LIU HuiXU DongXU De-zhenLEI Zhou...
    420-425页
    查看更多>>摘要:With the rapid growth of service scale,there are many services with the same functional properties but different non-functionai properties on the Internet.There have been some global optimizing service selection algorithms for service selection.However,most of those approaches cannot fully reflect users' preferences or are not fully suitable for large-scale services selection.In this paper,an ant colony optimization(ACO)algorithm for the model of global optimizing service selection with various quality of srevice(QoS)properties is employed,and a user-preference based large-scale service selection algorithm is proposed.This algorithm aims at optimizing user-preferred QoS properties and selecting services that meet all user-defined QoS thresholds.Experiment results prove that this algorithm is very efficient in this regard.

    Research and implementation of scalable parallel computing based on Map-Reduce

    NGUYEN Thanh-cuongSHEN Wen-fengCHAI Ya-huiXU Wei-min...
    426-429页
    查看更多>>摘要:As a parallel programming model,Map-Reduce is used for distributed computing of massive data.Map-Reduce model encapsulates the details of parallel implementation,fault-tolerant processing,local computing and load balancing,etc.,provides a simple but powerful interface.In case of having no clear idea about distributed and parallel programming,this interface can be utilized to save development time.This paper introduces the method of using Hadoop,the open-source Map-Reduce software platform,to combine PCs to carry out scalable parallel computing.Our experiment using 12 PCs to compute N-body problem based on Map-Reduce model shows that we can get a 9.8x speedup ratio.This work indicates that the Map-Reduce can be applied in scalable parallel computing.

    Experimentation of a 1-pixel bit reconfigurable ternary optical processor

    WANG Hong-jianJIN YiOUYANG ShanZHOU Yu...
    430-436页
    查看更多>>摘要:A detailed experiment of 1-pixel bit reconfigurable ternary optical processor(TOP)is proposed in the paper.42 basic operation units(BOUs)and 28 typical logic operators of the TOP are realized in the experiment.Results of the test cases elaborately cover the every combination of BOUs and all the nine inputs of ternary processor.Both the experiment process and results analysis are given in this paper.The experimental results demonstrate that the theory of reconfiguring a TOP is valid and that the reconfiguration circuitry is effective.

    Blocking optimized SIMD tree search on modern processors

    ZHANG ZhuoLU Yu-fanSHEN Wen-fengXU Wei-min...
    437-444页
    查看更多>>摘要:Tree search is a widely used fundamental algorithm.Modern processors provide tremendous computing power by integrating multiple cores,each with a vector processing unit.This paper reviews some studies on exploiting single instruction multiple date(SIMD)capacity of processors to improve the performance of tree search,and proposes several improvement methods on reported SIMD tree search algorithms.Based on blocking tree structure,blocking for memory alignment and dynamic blocking prefetch are proposed to optimize the overhead of memory access.Furthermore,as a way of non-linear loop unrolling,the search branch unwinding shows that the number of branches can exceed the data width of SIMD instructions in the SIMD search algorithm.The experiments suggest that blocking optimized SIMD tree search algorithm can achieve 1.6 times response speed faster than the un-optimized algorithm.

    Hybrid method for global optimization using more accuracy interval computation

    CUI Zhong-haoLEI Yong-mei
    445-450页
    查看更多>>摘要:In this paper,a novel hybrid method is presented for finding global optimization of an objective function.Based on the interval computation,this hybrid method combines interval deterministic method and stochastic evolution method.It can find global optimization quickly while ensuring the deterministic and stability of the algorithm.When using interval computation,extra width constraints accuracy of interval computation results.In this paper,a splitting method to reduce the extra width is introduced.This method is easy and it can get a more precise interval computation result.When finding the global optimization,it can increase the efficiency of pruning.Several experiments are given to illustrate the advantage of the new hybrid method.

    Space- and time-efficient approach for virtual machine provisioning

    HU Bo-linLEI ZhouXU DongLI Jian-dun...
    451-455页
    查看更多>>摘要:As a new promising paradigm,cloud computing can make good use of economics of scale and elastically deliver almost any IT related services on demand.Nevertheless,one of the key problems remaining in cloud computing is related to virtual machine images,which require a great amount of space/time to reposit/provision,especially with diverse requests from thousands of users simultaneously.In this paper,by using the splitting and eliminating redundant data techniques,a space and time efficient approach for virtual machines is proposed.The experiments demonstrate that,compared with existing solutions,our approach can conserve more disk space and speed up the provisioning of virtual machines.

    Ai2NU: A Cytoscape plugin for uniformization of biomolecular accession identifiers

    XIE JiangTAN JunYI Rong-guiCHENG Xiao...
    456-462页
    查看更多>>摘要:Cytoscape is one of the most popular platforms for biomolecular networks research.However Cytoscape cannot display biomolecular names according to their accession identifiers in different databases.A plugin named Ai2NU is designed and implemented in this paper.It can make biomolecular names displayed automatically in biomolecular networks graphs in Cytoscape by constructing a local dictionary.It is convenient for researchers to recognize biomolecules and enhance the research efficiency.