KWARESMI (Knowledge-based Web Automated and Reconfigurable Evaluation with guidelineS

合集下载

基于云边协同子类蒸馏的卷积神经网络模型压缩方法

基于云边协同子类蒸馏的卷积神经网络模型压缩方法

基于云边协同子类蒸馏的卷积神经网络模型压缩方法孙婧;王晓霞【期刊名称】《计算机科学》【年(卷),期】2024(51)5【摘要】当前卷积神经网络模型的训练和分发流程中,云端拥有充足的计算资源和数据集,但难以应对边缘场景中碎片化的需求。

边缘侧能够直接进行模型的训练和推理,但难以直接使用云端按照统一规则训练的卷积神经网络模型。

针对在边缘侧资源受限的情况下,卷积神经网络算法进行模型压缩的训练和推理有效性低的问题,首先,提出了一种基于云边协同的模型分发和训练框架,该框架可以结合云端和边缘侧各自的优势进行模型再训练,满足边缘对指定识别目标、指定硬件资源和指定精度的需求。

其次,基于云边协同框架训练的思路,对知识蒸馏技术进行改进,提出了新的基于Logits和基于Channels两种子类知识蒸馏方法(SLKD和SCKD),云服务端先提供具有多目标识别的模型,而后通过子类知识蒸馏的方法,在边缘侧将模型重新训练为一个可以在资源受限的场景下部署的轻量化模型。

最后,在CIFAR-10公共数据集上,对联合训练框架的有效性和两种子类蒸馏算法进行了验证。

实验结果表明,在压缩比为50%的情况下,相比具有全部分类的模型,所提模型推理准确率得到了显著的提升(10%~11%);相比模型的重新训练,通过知识蒸馏方法训练出的模型精度也有显著提高,并且压缩比率越高,模型精度提升越明显。

【总页数】8页(P313-320)【作者】孙婧;王晓霞【作者单位】华东政法大学智能科学与信息法学系;西北师范大学计算机科学与工程学院【正文语种】中文【中图分类】TP391.4【相关文献】1.基于特征复用的卷积神经网络模型压缩方法2.基于知识蒸馏的超分辨率卷积神经网络压缩方法3.降低参数规模的卷积神经网络模型压缩方法4.基于统计分析的卷积神经网络模型压缩方法5.基于轻量化卷积神经网络模型的云与云阴影检测方法因版权原因,仅展示原文概要,查看原文内容请购买。

AdaptableUIforWe...

AdaptableUIforWe...

Adaptable UI for Web Service Composition:A Model-Driven ApproachWaldemar Ferreira NetoSupervised by:Philippe ThiranPReCISE Research Center,University of Namur,5000,Belgium{o,pthiran}@fundp.ac.beAbstract.The main objective of this work is to provide User Interfaces(UI)for Web service compositions(WSC).We aim at investigating howuser interfaces and their navigation can be derived from the WSC struc-tures(data and controlflows).We propose a model-driven engineeringapproach that provides models and transformational methods that allowderiving and adapting UI for any context of use.Keywords:Web service composition,model-driven engineering,userinterface,adaptation.1IntroductionWeb services have gained attention due to the pressing need for integrating heterogeneous systems.A Web service is a software system designed to support interoperable machine-to-machine interactions over a network.It has an interface described in a machine-processable format.A main advantage of Web services is their ability of being composed.A Web service composition(WSC)consists in combining several Web services in a same process,in order to address complex user’s needs that a single Web service could not satisfy[2].There are several initiatives to provide languages that allow the description of a Web service composition.The current WSC languages are expressive enough to describe fully automated processes to build Web service compositions[2].How-ever,full-automated processes cannot represent all real-life scenarios specially those that need user interactions.In these scenarios,a user interaction may range from simple approvals to elaborate interactions where the user performs a complex data entry,for example,filling several forms.Any computer system that involves users needs user interfaces(UI)to permit the interactions between the system and the user.The users of a WSC can interact with it through diverse devices(Desktop,Smart Phone,Tablet,among others)in diverse modalities(visual,aural,tactile,etc.).The adaptability of the UIs for a WSC has become necessary due to the variety of contexts of use.In this work,we propose a model-driven engineering(MDE)approach for pro-viding adaptable UIs from WSC.In particular,the approach relies on a mod-elization of user interactions within the WSC.Based on this modelization,the G.Pallis et al.(Eds.):ICSOC2011,LNCS7221,pp.177–182,2012.c Springer-Verlag Berlin Heidelberg2012oapproach proposes a method to derive an abstract representation of the UI from a WSC.Interestingly,the derivation rules rely on the data/controlflow of the WSC for specifying the navigation through the UIs.The obtained abstract rep-resentation can then be adapted to any specific context of use.The remainder of this work is organized as follows.An overview of the works about user interactions and Web service composition is given in Section2.Section 3explores the research challenges associated with the generation of UI from WSC.Section4proposes an MDE approach to deal with challenges that were identified.Section5offers a preliminary plan for realizing our MDE approach and Section6concludes.2Related WorkThere are several approaches that permit interactions between users and Web services.In some of these approaches,the information about the Web service (which can be WSDL or OWL-S)is used to infer a suitable user interface(e.g., [8]).To increase the usability of generated used interfaces,some approaches use additional information like UI annotation[9],platform-specific description[12], or user context[14].In these approaches,the UI generation relies on type of the input and output described on the Web service description.The development of Web interfaces for Web services has been addressed by the Web engineering community by the means of model-driven Web design ap-proaches[15]and[4].These approaches propose a model-based development method for process-based Web applications that use Web services.The former approach describes the Web service composition by BPMN and the UI naviga-tion is described by a web-specific visual modeling language,WebML[4].The latter relies on BPMN too,but the UI navigation is described on an object-oriented modeling language,OOWS[15].Based on HTML templates,a set of UIs can be automatically generated form the WSC,and the navigation among these UIs is driven by the navigation model.Another work that generates user interfaces for Web services is the Dynvoker [13].This approach interprets a determined Web service and generates Web forms according to the Web service operation.Based on a BPEL-like language (GUI4CWS)this approach allows to handle complex service interaction scenar-ios.There are other approaches that allow a similar UI generation,but these approaches consider multiples actors[5]or/and context-aware UIs[11].Other approaches generate UI for Web services based on the annotated Web service descriptions and the UI defined from a task model[17].The annotations are used to generate the UI for the Web services and the task model drives the navigation among the UIs and Web services.As such,these approaches do separate the data/controlflows of the WSC and the UI navigation model.Other works aim at extending WSC descriptions with user interactions.An example of such extensions is BPEL4People[1],which introduces user actors into a Web service composition by defining a new type of BPEL activity to specify user tasks.However,this extension focuses only on the user task andAdaptable UI for Web Service Composition:A Model-Driven Approach179 does not deal with the design of a user interface for the Web service compo-sition.Another example of BPEL extensions that addresses the user interac-tion is BPEL4UI(Business Process Execution Language for User Interface)[6]. BPEL4UI extends the Partner Link part of BPEL in order to allow defining a binding between BPEL activities and an existing UI.This user interface is devel-oped separately from the composition instead to be generated.In another work, Lee et al.[10]extend BPEL by adding interactive activities that are embedded in the BPEL code.Unlike BPEL4UI,this work specifies the UI together with the WSC,however the UI is specified for a unique context of use.3Research ChallengesThe main objective of this work is to derive adaptable UI from WSC.In the following,we present the research challenges that must be tackled to achieve this objective.First,we need to investigate how user interactions can be integrated within WSC.Concretely,WSC must be extended with user interaction activities that express the different possible types of user interactions[16]:data input interac-tion,data output interaction,data selection,and interaction by user event.Another challenge is the fact that the navigation and the composition of the UI can rely on the control/dataflow structures of the WSC extended with user interaction activities.A simple example of generation is given in Figure1that presents a simple travel reservation management.This WSC comprises three user interaction actives.The UI generation can lead to a UI grouping of the two first user interactions activities(initializing Service and transportation means selection)as data provided by these user interactions are mutually independent. However,this UI could not comprise the third user interaction activity(providing license number),as the user interaction will only be enable if the transportation means is the private car.The last challenge is to be able to generate a UI adapted to the user context (user preference,user environment,and user platform)and the usability criteria (e.g.,the size of the device screen).4Proposed ApproachWe propose a Model-driven Engineering(MDE)approach that provides models and transformations for deriving and adapting UI from WSC and the context of use.We identify3main models and3main methodological steps.4.1ModelsOur MDE approach relies on3models:–UI-WSC:an extension of WSC with user interaction activities.To be com-pliant with current standards,the model is to rely on existing standards:a standard for WSC(e.g.BPEL)and a standard for describing user interfaces(iXML).oFig.1.Web service composition to manage travel reservations–Abstract user interface(AUI):this model describes the UI independently to any interaction modality(e.g.graphical modal,vocal modal)and com-puting platform(e.g.PC,smart phone).This model only specifies the UI components,their elements,and the navigation among the components.–Concrete user interface(CUI):this model is an adaptation of an AUI toa specific context of use(user preference,environment,and platform).Forexample,for visually handicapped person,an output abstract component could be transformed to a(concrete)vocal output.4.2MethodOur MDE method consists in3main steps:–Modeling:where the WSCs are modelized within its user interactions by a designer using the UI-WSC.–Transformation:where the AUI is derived by applying transformations to the UI-WSC model.–Adaptation:where the CUI is derived from the AUI and the context of use.Additionally,the user can interact with the CUI through an interpreter, while a runtime component arbitrates the communication between the CUI and the WSC.Adaptable UI for Web Service Composition:A Model-Driven Approach181 5Research MethodologyThefirst part of our research consists in the definition of the different models of our MDE approach.In particular,we investigate and modelize how the user interaction can be specified within WSCs.Our goal here is to propose a extension to WSC meta-model(UI-WSC meta-model)with the user interaction activities representing the different possible types of user interactions.For the AUI and CUI meta-models,we refer to existing works in UI meta-modeling.Next,we define the transformation rules for deriving an AUI description from a UI-WSC model.We plan to define these rules in an incremental way:starting with simple UI-WSC patterns(e.g.,input/output sequence,choice)to continue with more complex ones(e.g.,loop or interruptible area).AUI adaptation is the next step.As there are existing approaches,we plan to investigate and evaluate these approaches so that we can to adopt the more suitable to our approach.As a proof of concept,we develop a tool that not only supports the three main steps of your MDE method(design)but also orchestrate the WSC execution and the user interactions with the user(runtime).Finally,we evaluate our approach.Wefirst aim at evaluating our approach against other approaches(e.g.[6,15]and[4]).As comparison criteria,we adopt the usability criteria proposed by the ISO9241[7]:satisfaction,effectiveness,and efficiency.We also aim at evaluating our approach in real scenarios with real users. 6ConclusionIn this work,we propose an MDE approach for providing adaptable UI from WSC.This approach aims at specifying all types of user interactions within WSC process,as well as the derivation of an abstract representation of the UI. The derivation rules rely on the data/controlflow of the WSC for specifying the navigation through these abstract representations.Finally,the obtained repre-sentation can then be materialized to any specific context of use in order to provide an adapted UI.So far,we have reviewed the literature about the users interactions and Web services.We have already proposed a BPEL extension able to modelize all types of user interactions within WSC processes,named UI-BPEL meta-model[3].We have also implemented a design tool that is dedicated to edit a WSC conform to our UI-BPEL meta-model.The tool is an Eclipse plug-in based on the Eclipse BPEL Designer1.As future work,we plan to work on the transformation rules for deriving AUI from UI-BPEL and integrate these rules into our modeling tool. References1.Agrawal,A.,Amend,M.,Das,M.,Ford,M.,Keller,C.,Kloppmann,M.,K¨o nig,D.,Leymann,F.,M¨u ller,R.,Pfau,G.,et al.:Ws-bpel extension for people,bpel4people (2007)1http://webapps.fundp.ac.be/wse/wiki/pmwiki.php?n=Projects.UIBPELo2.ter Beek,M.H.,Bucchiarone,A.,Gnesi,S.:Web service composition approaches:From industrial standards to formal methods.In:ICIW,p.15.IEEE Computer Society(2007)3.Boukhebouze,M.,Neto,W.P.F.,Erbin,L.:Yet Another BPEL Extension for UserInteractions.In:De Troyer,O.,Bauzer Medeiros,C.,Billen,R.,Hallot,P.,Simitsis,A.,Van Mingroot,H.(eds.)ER Workshops2011.LNCS,vol.6999,pp.24–33.Springer,Heidelberg(2011)4.Brambilla,M.,Dosmi,M.,Fraternali,P.:Model-driven engineering of service or-chestrations.In:Proceedings of the7th Congress on Services,pp.562–569.IEEE Computer Society,Washington,DC(2009)5.Daniel,F.,Casati,F.,Benatallah,B.,Shan,M.-C.:Hosted Universal Composition:Models,Languages and Infrastructure in mashArt.In:Laender,A.H.F.,Castano, S.,Dayal,U.,Casati,F.,de Oliveira,J.P.M.(eds.)ER2009.LNCS,vol.5829,pp.428–443.Springer,Heidelberg(2009)6.Daniel,F.,Soi,S.,Tranquillini,S.,Casati,F.,Heng,C.,Yan,L.:From People toServices to UI:Distributed Orchestration of User Interfaces.In:Hull,R.,Mendling, J.,Tai,S.(eds.)BPM2010.LNCS,vol.6336,pp.310–326.Springer,Heidelberg (2010)7.ISO(ed.):ISO9241-11:Ergonomic requirements for office work with visual displayterminals(VDTs)–Part9:Requirements for non-keyboard input devices(2000) 8.Kassoff,M.,Kato,D.,Mohsin,W.:Creating GUIs for web services.IEEE InternetComputing7(5),66–73(2003)9.Khushraj,D.,Lassila,O.:Ontological Approach to Generating Personalized UserInterfaces for Web Services.In:Gil,Y.,Motta,E.,Benjamins,V.R.,Musen,M.A.(eds.)ISWC2005.LNCS,vol.3729,pp.916–927.Springer,Heidelberg(2005) 10.Lee,J.,Lin,Y.Y.,Ma,S.P.,Lee,S.J.:BPEL extensions to user-interactive servicedelivery.J.Inf.Sci.Eng.25(5),1427–1445(2009)11.Pietschmann,S.,Voigt,M.,R¨u mpel,A.,Meißner,K.:CRUISe:Composition ofRich User Interface Services.In:Gaedke,M.,Grossniklaus,M.,D´ıaz,O.(eds.) ICWE2009.LNCS,vol.5648,pp.473–476.Springer,Heidelberg(2009)12.Song,K.,Lee,K.H.:Generating multimodal user interfaces for web services.Inter-acting with Computers20(4-5),480–490(2008)13.Spillner,J.,Feldmann,M.,Braun,I.,Springer,T.,Schill,A.:Ad-Hoc Usage of WebServices with Dynvoker.In:M¨a h¨o nen,P.,Pohl,K.,Priol,T.(eds.)ServiceWave 2008.LNCS,vol.5377,pp.208–219.Springer,Heidelberg(2008)14.Steele,R.,Khankan,K.,Dillon,T.S.:Mobile web services discovery and invocationthrough auto-generation of abstract multimodal interface.In:ITCC(2),pp.35–41.IEEE Computer Society(2005)15.Torres,V.,Pelechano,V.:Building Business Process Driven Web Applications.In:Dustdar,S.,Fiadeiro,J.L.,Sheth,A.P.(eds.)BPM2006.LNCS,vol.4102,pp.322–337.Springer,Heidelberg(2006)16.Trewin,S.,Zimmermann,G.,Vanderheiden,G.C.:Abstract representations as abasis for usable user interfaces.Interacting with Computers16(3),477–506(2004) 17.Vermeulen,J.,Vandriessche,Y.,Clerckx,T.,Luyten,K.,Coninx,K.:Service-Interaction Descriptions:Augmenting Services with User Interface Models.In:Gul-liksen,J.,Harning,M.B.,van der Veer,G.C.,Wesson,J.(eds.)EIS2007.LNCS, vol.4940,pp.447–464.Springer,Heidelberg(2008)。

2014年中科院SCI分区

2014年中科院SCI分区

期刊全称ACM Transactions on Intelligent Systems and TechnologyACM Transactions on Intelligent Systems and TechnologyIEEE Communications Surveys and TutorialsIEEE Communications Surveys and TutorialsIEEE TRANSACTIONS ON FUZZY SYSTEMSIEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE International Journal of Neural SystemsIEEE Transactions on Industrial InformaticsMIS QUARTERLYIEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATIONIEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATIONCOMPUTER-AIDED CIVIL AND INFRASTRUCTURE ENGINEERINGIEEE WIRELESS COMMUNICATIONSIEEE WIRELESS COMMUNICATIONSIEEE WIRELESS COMMUNICATIONSJournal of Statistical SoftwareIEEE Transactions on Neural Networks and Learning SystemsIEEE Transactions on Neural Networks and Learning SystemsIEEE Transactions on Neural Networks and Learning SystemsMEDICAL IMAGE ANALYSISMEDICAL IMAGE ANALYSISACM COMPUTING SURVEYSIEEE COMMUNICATIONS MAGAZINEINTEGRATED COMPUTER-AIDED ENGINEERINGINTEGRATED COMPUTER-AIDED ENGINEERINGENVIRONMENTAL MODELLING & SOFTWAREINTERNATIONAL JOURNAL OF COMPUTER VISIONIEEE Computational Intelligence MagazineIEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONSACM TRANSACTIONS ON GRAPHICSSIAM Journal on Imaging SciencesSIAM Journal on Imaging SciencesIEEE Transactions on Affective ComputingIEEE Transactions on Affective ComputingINFORMATION SCIENCESIEEE Transactions on CyberneticsIEEE Transactions on CyberneticsARCHIVES OF COMPUTATIONAL METHODS IN ENGINEERING JOURNAL OF INFORMATION TECHNOLOGYKNOWLEDGE-BASED SYSTEMSIEEE TRANSACTIONS ON IMAGE PROCESSINGJOURNAL OF MACHINE LEARNING RESEARCHIEEE NETWORKIEEE NETWORKIEEE NETWORKIEEE TRANSACTIONS ON INFORMATION THEORY JOURNAL OF LIGHTWAVE TECHNOLOGYCOMPUTERS & EDUCATIONKNOWLEDGE AND INFORMATION SYSTEMSKNOWLEDGE AND INFORMATION SYSTEMSIEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS JOURNAL OF THE ACMJOURNAL OF THE ACMJOURNAL OF THE ACMJOURNAL OF THE ACMIEEE TRANSACTIONS ON MOBILE COMPUTINGIEEE TRANSACTIONS ON MOBILE COMPUTINGPATTERN RECOGNITIONAPPLIED SOFT COMPUTINGAPPLIED SOFT COMPUTINGCOMMUNICATIONS OF THE ACMCOMMUNICATIONS OF THE ACMCOMMUNICATIONS OF THE ACMInformation FusionInformation FusionARTIFICIAL INTELLIGENCEACM TRANSACTIONS ON MATHEMATICAL SOFTWAREIEEE TRANSACTIONS ON ANTENNAS AND PROPAGATION EVOLUTIONARY COMPUTATIONEVOLUTIONARY COMPUTATIONCOMPUTERS & CHEMICAL ENGINEERINGIEEE TRANSACTIONS ON SOFTWARE ENGINEERINGANNUAL REVIEW OF INFORMATION SCIENCE AND TECHNOLOGYIEEE TRANSACTIONS ON VEHICULAR TECHNOLOGYCHEMOMETRICS AND INTELLIGENT LABORATORY SYSTEMSIEEE Transactions on Systems Man Cybernetics-SystemsFUTURE GENERATION COMPUTER SYSTEMSIEEE TRANSACTIONS ON BROADCASTINGJOURNAL OF THE AMERICAN SOCIETY FOR INFORMATION SCIENCE AND TE NEURAL NETWORKSDATA MINING AND KNOWLEDGE DISCOVERYDATA MINING AND KNOWLEDGE DISCOVERYIEEE Transactions on Human-Machine SystemsIEEE Transactions on Human-Machine SystemsHUMAN-COMPUTER INTERACTIONHUMAN-COMPUTER INTERACTIONIEEE INTERNET COMPUTINGIEEE-ACM TRANSACTIONS ON NETWORKINGIEEE-ACM TRANSACTIONS ON NETWORKINGIEEE-ACM TRANSACTIONS ON NETWORKINGIEEE TRANSACTIONS ON VISUALIZATION AND COMPUTER GRAPHICS EXPERT SYSTEMS WITH APPLICATIONSIEEE INTELLIGENT SYSTEMSIEEE MICROIEEE MICRODECISION SUPPORT SYSTEMSDECISION SUPPORT SYSTEMSIEEE Transactions on Services ComputingIEEE Transactions on Services ComputingIEEE Transactions on Autonomous Mental DevelopmentARTIFICIAL LIFEARTIFICIAL LIFEIEEE Journal of Biomedical and Health InformaticsIEEE Journal of Biomedical and Health InformaticsIEEE PERVASIVE COMPUTINGIEEE PERVASIVE COMPUTINGINTERNATIONAL JOURNAL OF INFORMATION TECHNOLOGY & DECISION MA INTERNATIONAL JOURNAL OF INFORMATION TECHNOLOGY & DECISION MA INTERNATIONAL JOURNAL OF INFORMATION TECHNOLOGY & DECISION MA INFORMATION & MANAGEMENTINTERNATIONAL JOURNAL OF APPROXIMATE REASONINGBIOLOGICAL CYBERNETICSCOMPUTERS & STRUCTURESJOURNAL OF STRATEGIC INFORMATION SYSTEMSAd Hoc NetworksAd Hoc NetworksJOURNAL OF MATHEMATICAL IMAGING AND VISIONJOURNAL OF MATHEMATICAL IMAGING AND VISIONIEEE TRANSACTIONS ON MULTIMEDIAIEEE TRANSACTIONS ON MULTIMEDIAIEEE TRANSACTIONS ON MULTIMEDIAIEEE TRANSACTIONS ON COMMUNICATIONSIEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMSMobile Information SystemsMobile Information SystemsIEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERINGIEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING COMPUTERS & OPERATIONS RESEARCHNEURAL COMPUTATIONIEEE Transactions on Information Forensics and SecurityIEEE MICROWAVE MAGAZINEIMAGE AND VISION COMPUTINGIMAGE AND VISION COMPUTINGIMAGE AND VISION COMPUTINGENGINEERING APPLICATIONS OF ARTIFICIAL INTELLIGENCEIEEE TRANSACTIONS ON RELIABILITYIEEE TRANSACTIONS ON RELIABILITYNEUROCOMPUTINGAUTONOMOUS ROBOTSADVANCED ENGINEERING INFORMATICSINTERNATIONAL JOURNAL OF ELECTRONIC COMMERCEInternational Journal of Web and Grid ServicesInternational Journal of Web and Grid ServicesCOMPUTERS AND ELECTRONICS IN AGRICULTUREIEEE Antennas and Wireless Propagation LettersUSER MODELING AND USER-ADAPTED INTERACTIONIEEE Transactions on HapticsSTRUCTURAL AND MULTIDISCIPLINARY OPTIMIZATIONCOMPUTER GRAPHICS FORUMJournal of Optical Communications and NetworkingJournal of Optical Communications and NetworkingJournal of Optical Communications and NetworkingCOMPUTERS & INDUSTRIAL ENGINEERINGMACHINE LEARNINGACM Transactions on Sensor NetworksACM Transactions on Sensor NetworksEUROPEAN JOURNAL OF INFORMATION SYSTEMSJournal of Computational ScienceJournal of Computational ScienceCOMPUTERS IN INDUSTRYIEEE-ACM Transactions on Computational Biology and BioinformaticsEMPIRICAL SOFTWARE ENGINEERINGVLDB JOURNALVLDB JOURNALJOURNAL OF MANAGEMENT INFORMATION SYSTEMSCOMPUTER SPEECH AND LANGUAGECOMPUTERCOMPUTERJournal of Grid ComputingJournal of Grid ComputingInternational Journal of Bio-Inspired ComputationInternational Journal of Bio-Inspired ComputationPervasive and Mobile ComputingPervasive and Mobile ComputingINDUSTRIAL MANAGEMENT & DATA SYSTEMSINTERNATIONAL JOURNAL OF INTELLIGENT SYSTEMSIEEE Transactions on Computational Intelligence and AI in GamesIEEE Transactions on Computational Intelligence and AI in GamesDATA & KNOWLEDGE ENGINEERINGDATA & KNOWLEDGE ENGINEERINGPARALLEL COMPUTINGCOMPUTING IN SCIENCE & ENGINEERINGMECHATRONICSCOMPUTER METHODS IN BIOMECHANICS AND BIOMEDICAL ENGINEERING IEEE SOFTWARESOFT COMPUTINGSOFT COMPUTINGJOURNAL OF NETWORK AND COMPUTER APPLICATIONSJOURNAL OF NETWORK AND COMPUTER APPLICATIONSJOURNAL OF NETWORK AND COMPUTER APPLICATIONSACM TRANSACTIONS ON SOFTWARE ENGINEERING AND METHODOLOGY TELECOMMUNICATIONS POLICYElectronic Commerce Research and ApplicationsElectronic Commerce Research and ApplicationsINTERNET RESEARCH-ELECTRONIC NETWORKING APPLICATIONS AND POLI INTERNET RESEARCH-ELECTRONIC NETWORKING APPLICATIONS AND POLIACM Transactions on Knowledge Discovery from DataACM Transactions on Knowledge Discovery from DataROBOTICS AND COMPUTER-INTEGRATED MANUFACTURING INFORMATION SYSTEMSWiley Interdisciplinary Reviews-Data Mining and Knowledge DiscoveryWiley Interdisciplinary Reviews-Data Mining and Knowledge DiscoveryCOMPUTER METHODS AND PROGRAMS IN BIOMEDICINECOMPUTER METHODS AND PROGRAMS IN BIOMEDICINEINFORMATION AND SOFTWARE TECHNOLOGYINFORMATION AND SOFTWARE TECHNOLOGYSPEECH COMMUNICATIONJOURNAL OF HEURISTICSJOURNAL OF HEURISTICSARTIFICIAL INTELLIGENCE IN MEDICINECOMPUTER-AIDED DESIGNJOURNAL OF COMPUTING IN CIVIL ENGINEERINGFuzzy Optimization and Decision MakingJournal of the Association for Information SystemsIEEE TRANSACTIONS ON COMPUTERSIEEE Systems JournalIEEE Systems JournalCOMPUTER VISION AND IMAGE UNDERSTANDINGOPTICAL FIBER TECHNOLOGYJournal of Web SemanticsJournal of Web SemanticsJournal of Web SemanticsIEEE Vehicular Technology MagazineINTERNATIONAL JOURNAL OF SYSTEMS SCIENCEACM Transactions on the WebACM Transactions on the WebIEEE TRANSACTIONS ON ELECTROMAGNETIC COMPATIBILITYIEEE TRANSACTIONS ON AEROSPACE AND ELECTRONIC SYSTEMSIEEE COMPUTER GRAPHICS AND APPLICATIONSINTERNATIONAL JOURNAL OF HUMAN-COMPUTER STUDIESADVANCES IN ENGINEERING SOFTWAREADVANCES IN ENGINEERING SOFTWARECOMPUTERS IN BIOLOGY AND MEDICINECOMPUTER NETWORKS-THE INTERNATIONAL JOURNAL OF COMPUTER AND COMPUTER NETWORKS-THE INTERNATIONAL JOURNAL OF COMPUTER AND COMPUTER NETWORKS-THE INTERNATIONAL JOURNAL OF COMPUTER AND Swarm IntelligenceInternational Journal of Fuzzy SystemsPersonal and Ubiquitous ComputingPersonal and Ubiquitous ComputingJOURNAL OF VISUAL COMMUNICATION AND IMAGE REPRESENTATION JOURNAL OF VISUAL COMMUNICATION AND IMAGE REPRESENTATION ARTIFICIAL INTELLIGENCE REVIEWINFORMATICANEURAL COMPUTING & APPLICATIONSJOURNAL OF INFORMATION SCIENCECOMPUTATIONAL LINGUISTICSCOMPUTATIONAL LINGUISTICSIEEE COMMUNICATIONS LETTERSIEEE TRANSACTIONS ON VERY LARGE SCALE INTEGRATION (VLSI) SYSTEM IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCU IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCU INFORMS JOURNAL ON COMPUTINGINTERNATIONAL JOURNAL OF HIGH PERFORMANCE COMPUTING APPLICAT INTERNATIONAL JOURNAL OF HIGH PERFORMANCE COMPUTING APPLICAT INTERNATIONAL JOURNAL OF HIGH PERFORMANCE COMPUTING APPLICAT MACHINE VISION AND APPLICATIONSMACHINE VISION AND APPLICATIONSJOURNAL OF HYDROINFORMATICSRADIO SCIENCEJOURNAL OF COMPLEXITYAutomated Software EngineeringENGINEERING COMPUTATIONSCOMPUTER COMMUNICATIONSCOMPUTER COMMUNICATIONSACM TRANSACTIONS ON INFORMATION SYSTEMSMOBILE NETWORKS & APPLICATIONSMOBILE NETWORKS & APPLICATIONSMOBILE NETWORKS & APPLICATIONSIEEE Design & TestCOMPUTER STANDARDS & INTERFACESCOMPUTER STANDARDS & INTERFACESGenetic Programming and Evolvable MachinesGenetic Programming and Evolvable MachinesMULTIDIMENSIONAL SYSTEMS AND SIGNAL PROCESSINGPATTERN RECOGNITION LETTERSIEEE Transactions on Dependable and Secure ComputingIEEE Transactions on Dependable and Secure ComputingIEEE Transactions on Dependable and Secure ComputingWORLD WIDE WEB-INTERNET AND WEB INFORMATION SYSTEMSWORLD WIDE WEB-INTERNET AND WEB INFORMATION SYSTEMSONLINE INFORMATION REVIEWROBOTICS AND AUTONOMOUS SYSTEMSJournal of Real-Time Image ProcessingINTERNATIONAL JOURNAL OF UNCERTAINTY FUZZINESS AND KNOWLEDGE ADAPTIVE BEHAVIORJOURNAL OF INTELLIGENT MANUFACTURINGJOURNAL OF COMPUTER AND SYSTEM SCIENCESJOURNAL OF COMPUTER AND SYSTEM SCIENCESNEURAL PROCESSING LETTERSJOURNAL OF SYSTEMS AND SOFTWAREJOURNAL OF SYSTEMS AND SOFTWARESOFTWARE TESTING VERIFICATION & RELIABILITYCOMPUTERS & SECURITYACM Transactions on Applied PerceptionIEEE MULTIMEDIAIEEE MULTIMEDIAIEEE MULTIMEDIAIEEE MULTIMEDIAIEEE TRANSACTIONS ON CONSUMER ELECTRONICSSIMULATION MODELLING PRACTICE AND THEORYSIMULATION MODELLING PRACTICE AND THEORYREQUIREMENTS ENGINEERINGREQUIREMENTS ENGINEERINGComputer Supported Cooperative Work-The Journal of Collaborative Computing DISPLAYSSoftware and Systems ModelingINTERACTING WITH COMPUTERSAUTONOMOUS AGENTS AND MULTI-AGENT SYSTEMSBusiness & Information Systems EngineeringJOURNAL OF ARTIFICIAL INTELLIGENCE RESEARCHINTERNATIONAL JOURNAL OF SATELLITE COMMUNICATIONS AND NETWOR ACM Transactions on Autonomous and Adaptive SystemsACM Transactions on Autonomous and Adaptive SystemsACM Transactions on Autonomous and Adaptive SystemsWIRELESS COMMUNICATIONS & MOBILE COMPUTINGWIRELESS COMMUNICATIONS & MOBILE COMPUTINGINTERNATIONAL JOURNAL OF COMPUTER INTEGRATED MANUFACTURING JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTINGApplied OntologyApplied OntologyApplied OntologyJournal of Ambient Intelligence and Smart EnvironmentsJournal of Ambient Intelligence and Smart EnvironmentsJournal of Ambient Intelligence and Smart EnvironmentsINFORMATION PROCESSING & MANAGEMENTInternational Journal on Semantic Web and Information SystemsInternational Journal on Semantic Web and Information SystemsInternational Journal of Applied Mathematics and Computer Science TELECOMMUNICATION SYSTEMSOPEN SYSTEMS & INFORMATION DYNAMICSJOURNAL OF CRYPTOLOGYSIAM JOURNAL ON COMPUTINGJournal of Software-Evolution and ProcessIET OptoelectronicsCOMPUTATIONAL INTELLIGENCEIET Radar Sonar and NavigationCOMPUTERS & GRAPHICS-UKINTERNATIONAL JOURNAL OF HUMAN-COMPUTER INTERACTIONIEEE Transactions on Learning TechnologiesAPPLIED COMPUTATIONAL ELECTROMAGNETICS SOCIETY JOURNALACM TRANSACTIONS ON PROGRAMMING LANGUAGES AND SYSTEMS COMPUTER AIDED GEOMETRIC DESIGNCOMPUTERS & ELECTRICAL ENGINEERINGCOMPUTERS & ELECTRICAL ENGINEERINGJOURNAL OF DATABASE MANAGEMENTJOURNAL OF DATABASE MANAGEMENTBEHAVIOUR & INFORMATION TECHNOLOGYACM Transactions on Multimedia Computing Communications and ApplicationsACM Transactions on Multimedia Computing Communications and ApplicationsACM Transactions on Multimedia Computing Communications and Applications MULTIMEDIA TOOLS AND APPLICATIONSMULTIMEDIA TOOLS AND APPLICATIONSMULTIMEDIA TOOLS AND APPLICATIONSIEEE Computer Architecture LettersCognitive Systems ResearchSOFTWARE-PRACTICE & EXPERIENCEScientific ProgrammingGRAPHICAL MODELSCYBERNETICS AND SYSTEMSACM SIGCOMM Computer Communication ReviewInformation VisualizationPRESENCE-TELEOPERATORS AND VIRTUAL ENVIRONMENTSPRESENCE-TELEOPERATORS AND VIRTUAL ENVIRONMENTSACM TRANSACTIONS ON DATABASE SYSTEMSACM TRANSACTIONS ON DATABASE SYSTEMSOptical Switching and NetworkingOptical Switching and NetworkingJOURNAL OF FUNCTIONAL PROGRAMMINGACM TRANSACTIONS ON COMPUTER SYSTEMSACM Transactions on Computer-Human InteractionACM Transactions on Computer-Human InteractionComputers and ConcreteETRI JOURNALIEEE SECURITY & PRIVACYIEEE SECURITY & PRIVACYR JournalCOMPUTINGVISUAL COMPUTERACM Transactions on StorageACM Transactions on StorageCONSTRAINTSCONSTRAINTSOPTIMIZATION METHODS & SOFTWAREINFORMATION SYSTEMS FRONTIERSINFORMATION SYSTEMS FRONTIERSEUROPEAN TRANSACTIONS ON TELECOMMUNICATIONS PERFORMANCE EVALUATIONPERFORMANCE EVALUATIONIET Microwaves Antennas & PropagationACM Transactions on Modeling and Computer SimulationJOURNAL OF INTELLIGENT & ROBOTIC SYSTEMSACM Transactions on Embedded Computing SystemsACM Transactions on Embedded Computing SystemsCIN-COMPUTERS INFORMATICS NURSINGCOMPUTER JOURNALCOMPUTER JOURNALCOMPUTER JOURNALCOMPUTER JOURNALENGINEERING WITH COMPUTERSDESIGNS CODES AND CRYPTOGRAPHYNETWORKSNETWORK-COMPUTATION IN NEURAL SYSTEMSInformation Technology and ControlInformation Technology and ControlIETE TECHNICAL REVIEWInternational Journal of Data Warehousing and MiningJOURNAL OF SUPERCOMPUTINGJOURNAL OF SUPERCOMPUTINGNEW GENERATION COMPUTINGNEW GENERATION COMPUTINGWIRELESS NETWORKSWIRELESS NETWORKSPATTERN ANALYSIS AND APPLICATIONSJOURNAL OF INTELLIGENT & FUZZY SYSTEMS CONCURRENCY AND COMPUTATION-PRACTICE & EXPERIENCE CONCURRENCY AND COMPUTATION-PRACTICE & EXPERIENCE ACM Transactions on Internet TechnologyACM Transactions on Internet TechnologyInternational Journal of Ad Hoc and Ubiquitous ComputingInternational Journal of Ad Hoc and Ubiquitous ComputingACM Transactions on Computational LogicACM Transactions on Information and System SecurityCluster Computing-The Journal of Networks Software Tools and ApplicationsCluster Computing-The Journal of Networks Software Tools and Applications INTERNATIONAL JOURNAL OF COMMUNICATION SYSTEMSEURASIP Journal on Wireless Communications and NetworkingEXPERT SYSTEMSEXPERT SYSTEMSINTERNATIONAL JOURNAL OF RF AND MICROWAVE COMPUTER-AIDED ENG INTERNATIONAL JOURNAL OF GENERAL SYSTEMSINFORMATION RETRIEVALMODELING IDENTIFICATION AND CONTROLCONNECTION SCIENCECONNECTION SCIENCESOFTWARE QUALITY JOURNALSIMULATION-TRANSACTIONS OF THE SOCIETY FOR MODELING AND SIMULA SIMULATION-TRANSACTIONS OF THE SOCIETY FOR MODELING AND SIMULA Digital InvestigationDigital InvestigationDISTRIBUTED AND PARALLEL DATABASESDISTRIBUTED AND PARALLEL DATABASESKNOWLEDGE ENGINEERING REVIEWSIGMOD RECORDSIGMOD RECORDJOURNAL OF INTELLIGENT INFORMATION SYSTEMSJOURNAL OF INTELLIGENT INFORMATION SYSTEMSInternational Journal of Wavelets Multiresolution and Information Processing International Journal on Document Analysis and RecognitionJOURNAL OF COMPUTER INFORMATION SYSTEMSINTERNATIONAL JOURNAL OF COOPERATIVE INFORMATION SYSTEMSAI MAGAZINEIET Computer VisionACM Journal on Emerging Technologies in Computing SystemsDISTRIBUTED COMPUTINGInternational Journal of Antennas and PropagationJOURNAL OF MULTIPLE-VALUED LOGIC AND SOFT COMPUTINGJOURNAL OF MULTIPLE-VALUED LOGIC AND SOFT COMPUTINGBELL LABS TECHNICAL JOURNALBELL LABS TECHNICAL JOURNALJournal on Multimodal User InterfacesJournal on Multimodal User InterfacesCryptography and Communications-Discrete-Structures Boolean Functions and Sequences Science China-Information SciencesAPPLICABLE ALGEBRA IN ENGINEERING COMMUNICATION AND COMPUTIN APPLICABLE ALGEBRA IN ENGINEERING COMMUNICATION AND COMPUTIN IBM JOURNAL OF RESEARCH AND DEVELOPMENTIBM JOURNAL OF RESEARCH AND DEVELOPMENTIBM JOURNAL OF RESEARCH AND DEVELOPMENTIBM JOURNAL OF RESEARCH AND DEVELOPMENTREAL-TIME SYSTEMSCOMPUTER MUSIC JOURNALWIRELESS PERSONAL COMMUNICATIONSINFORMATION AND COMPUTATIONJOURNAL OF SYSTEMS ARCHITECTUREJOURNAL OF SYSTEMS ARCHITECTUREACM TRANSACTIONS ON DESIGN AUTOMATION OF ELECTRONIC SYSTEMS ACM TRANSACTIONS ON DESIGN AUTOMATION OF ELECTRONIC SYSTEMS International Journal of Distributed Sensor NetworksInternational Journal of Distributed Sensor NetworksTHEORY AND PRACTICE OF LOGIC PROGRAMMINGTHEORY AND PRACTICE OF LOGIC PROGRAMMINGACM Transactions on Architecture and Code OptimizationACM Transactions on Architecture and Code OptimizationInternational Journal of Information SecurityInternational Journal of Information SecurityInternational Journal of Information SecurityAEU-INTERNATIONAL JOURNAL OF ELECTRONICS AND COMMUNICATIONS Natural ComputingNatural ComputingJOURNAL OF SYMBOLIC COMPUTATIONJournal of Signal Processing Systems for Signal Image and Video Technology MULTIMEDIA SYSTEMSMULTIMEDIA SYSTEMSMATHEMATICAL STRUCTURES IN COMPUTER SCIENCEJOURNAL OF LOGIC AND COMPUTATIONINFORMATION SYSTEMS MANAGEMENTAdvances in Electrical and Computer EngineeringComputer Science and Information SystemsComputer Science and Information SystemsJOURNAL OF AUTOMATED REASONINGAI EDAM-ARTIFICIAL INTELLIGENCE FOR ENGINEERING DESIGN ANALYSIS AI EDAM-ARTIFICIAL INTELLIGENCE FOR ENGINEERING DESIGN ANALYSIS INTERNATIONAL JOURNAL OF PATTERN RECOGNITION AND ARTIFICIAL INT SCIENCE OF COMPUTER PROGRAMMINGComputational and Mathematical Organization TheoryMICROPROCESSORS AND MICROSYSTEMSMICROPROCESSORS AND MICROSYSTEMSAdvances in Mathematics of CommunicationsJOURNAL OF VISUAL LANGUAGES AND COMPUTINGJournal of SimulationJOURNAL OF COMPUTER SCIENCE AND TECHNOLOGYJOURNAL OF COMPUTER SCIENCE AND TECHNOLOGYPHOTONIC NETWORK COMMUNICATIONSPHOTONIC NETWORK COMMUNICATIONSDISCRETE MATHEMATICS AND THEORETICAL COMPUTER SCIENCE THEORETICAL COMPUTER SCIENCEALGORITHMICAASLIB PROCEEDINGSKYBERNETIKAANNALES DES TELECOMMUNICATIONS-ANNALS OF TELECOMMUNICATION INTEGRATION-THE VLSI JOURNALInternational Journal of Critical Infrastructure ProtectionACM Transactions on AlgorithmsInternational Journal of Computers Communications & ControlFORMAL ASPECTS OF COMPUTINGJOURNAL OF UNIVERSAL COMPUTER SCIENCEJOURNAL OF UNIVERSAL COMPUTER SCIENCECONCURRENT ENGINEERING-RESEARCH AND APPLICATIONSANALOG INTEGRATED CIRCUITS AND SIGNAL PROCESSINGInternational Journal of Microwave and Wireless TechnologiesJOURNAL OF COMPUTING AND INFORMATION SCIENCE IN ENGINEERING JOURNAL OF VISUALIZATIONIET SoftwareInternational Journal of Unconventional ComputingTurkish Journal of Electrical Engineering and Computer SciencesLanguage Resources and EvaluationIEEE ANNALS OF THE HISTORY OF COMPUTINGINTERNATIONAL JOURNAL OF PARALLEL PROGRAMMINGIT ProfessionalIT ProfessionalIT ProfessionalJOURNAL OF NEW MUSIC RESEARCHINFORMATION PROCESSING LETTERSIntelligent Data AnalysisNeural Network WorldJOURNAL OF LOGIC AND ALGEBRAIC PROGRAMMINGACM SIGPLAN NOTICESAI COMMUNICATIONSJournal of Internet TechnologyJournal of Internet TechnologyIET Information SecurityIET Information SecurityJournal of Applied LogicJournal of Applied LogicFORMAL METHODS IN SYSTEM DESIGNTHEORY OF COMPUTING SYSTEMSNatural Language EngineeringVIRTUAL REALITYVIRTUAL REALITYInternational Journal of Computational Intelligence SystemsInternational Journal of Computational Intelligence SystemsJOURNAL OF COMMUNICATIONS AND NETWORKSJOURNAL OF COMMUNICATIONS AND NETWORKSMINDS AND MACHINESACTA INFORMATICAJournal of Network and Systems ManagementJournal of Network and Systems ManagementAd Hoc & Sensor Wireless NetworksAd Hoc & Sensor Wireless NetworksKSII Transactions on Internet and Information SystemsKSII Transactions on Internet and Information SystemsLogical Methods in Computer ScienceUniversal Access in the Information SocietyCOMPUTER ANIMATION AND VIRTUAL WORLDSInternational Journal of Network ManagementInternational Journal of Network ManagementJOURNAL OF ORGANIZATIONAL COMPUTING AND ELECTRONIC COMMERCE JOURNAL OF ORGANIZATIONAL COMPUTING AND ELECTRONIC COMMERCE FUNDAMENTA INFORMATICAEADVANCES IN COMPUTERSADVANCES IN COMPUTERSAPPLIED ARTIFICIAL INTELLIGENCEJOURNAL OF EXPERIMENTAL & THEORETICAL ARTIFICIAL INTELLIGENCE PROGRAM-ELECTRONIC LIBRARY AND INFORMATION SYSTEMSSecurity and Communication NetworksSecurity and Communication NetworksProblems of Information TransmissionNew Review of Hypermedia and MultimediaINTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE COMPUTER APPLICATIONS IN ENGINEERING EDUCATIONIET Computers and Digital TechniquesIET Computers and Digital TechniquesJOURNAL OF COMMUNICATIONS TECHNOLOGY AND ELECTRONICS Frontiers of Computer ScienceFrontiers of Computer ScienceFrontiers of Computer SciencePeer-to-Peer Networking and ApplicationsPeer-to-Peer Networking and ApplicationsANNALS OF MATHEMATICS AND ARTIFICIAL INTELLIGENCEChina CommunicationsCOMPUTER LANGUAGES SYSTEMS & STRUCTURESCOMPEL-THE INTERNATIONAL JOURNAL FOR COMPUTATION AND MATHEM International Journal of Web Services ResearchInternational Journal of Web Services ResearchJournal of Organizational and End User ComputingJournal of Zhejiang University-SCIENCE C-Computers & ElectronicsJournal of Zhejiang University-SCIENCE C-Computers & ElectronicsKYBERNETESJournal of Cellular AutomataIEICE TRANSACTIONS ON COMMUNICATIONSRomanian Journal of Information Science and TechnologyInternational Arab Journal of InformationInternational Arab Journal of InformationCANADIAN JOURNAL OF ELECTRICAL AND COMPUTER ENGINEERING-REVU JOURNAL OF CIRCUITS SYSTEMS AND COMPUTERSMalaysian Journal of Computer ScienceMalaysian Journal of Computer ScienceCOMPUTING AND INFORMATICSJOURNAL OF INFORMATION SCIENCE AND ENGINEERINGJournal of Web EngineeringJournal of Web EngineeringInternational Journal on Artificial Intelligence ToolsInternational Journal on Artificial Intelligence ToolsRAIRO-THEORETICAL INFORMATICS AND APPLICATIONSIEEE Latin America TransactionsDESIGN AUTOMATION FOR EMBEDDED SYSTEMSDESIGN AUTOMATION FOR EMBEDDED SYSTEMSIEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICAT IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICAT INTERNATIONAL JOURNAL OF SOFTWARE ENGINEERING AND KNOWLEDGE INTERNATIONAL JOURNAL OF SOFTWARE ENGINEERING AND KNOWLEDGE COMPUTER SYSTEMS SCIENCE AND ENGINEERINGCOMPUTER SYSTEMS SCIENCE AND ENGINEERINGJOURNAL OF COMPUTER AND SYSTEMS SCIENCES INTERNATIONAL JOURNAL OF COMPUTER AND SYSTEMS SCIENCES INTERNATIONAL JOURNAL OF COMPUTER AND SYSTEMS SCIENCES INTERNATIONALIETE JOURNAL OF RESEARCHMICROWAVE JOURNALIEICE TRANSACTIONS ON INFORMATION AND SYSTEMSIEICE TRANSACTIONS ON INFORMATION AND SYSTEMSCRYPTOLOGIAINTELLIGENT AUTOMATION AND SOFT COMPUTINGPROGRAMMING AND COMPUTER SOFTWARETraitement du SignalJournal of the Institute of Telecommunications ProfessionalsMICROWAVES & RFELECTRONICS WORLDCOMPUTER GRAPHICS WORLDJCR期刊简称ISSN所属小类所属小类(中文)小类分区大类复分大类分区ACM T INTEL SYST TEC2157-6904C OMPUTER SCIENCE, ARTI计算机:人工智能1N1 ACM T INTEL SYST TEC2157-6904C OMPUTER SCIENCE, INFO计算机:信息系统1N1 IEEE COMMUN SURV TUT1553-877X T ELECOMMUNICATIONS电信学1N1 IEEE COMMUN SURV TUT1553-877X C OMPUTER SCIENCE, INFO计算机:信息系统1N1 IEEE T FUZZY SYST1063-6706C OMPUTER SCIENCE, ARTI计算机:人工智能1N1 IEEE T PATTERN ANAL0162-8828C OMPUTER SCIENCE, ARTI计算机:人工智能1N1 INT J NEURAL SYST0129-0657C OMPUTER SCIENCE, ARTI计算机:人工智能1N1 IEEE T IND INFORM1551-3203C OMPUTER SCIENCE, INTE计算机:跨学科应1N1 MIS QUART0276-7783C OMPUTER SCIENCE, INFO计算机:信息系统1N1 IEEE T EVOLUT COMPUT1089-778X C OMPUTER SCIENCE, THEO计算机:理论方法1N1 IEEE T EVOLUT COMPUT1089-778X C OMPUTER SCIENCE, ARTI计算机:人工智能1N1 COMPUT-AIDED CIV INF1093-9687C OMPUTER SCIENCE, INTE计算机:跨学科应1N1 IEEE WIREL COMMUN1536-1284T ELECOMMUNICATIONS电信学1N1 IEEE WIREL COMMUN1536-1284C OMPUTER SCIENCE, INFO计算机:信息系统1N1 IEEE WIREL COMMUN1536-1284C OMPUTER SCIENCE, HAR计算机:硬件1N1 J STAT SOFTW1548-7660C OMPUTER SCIENCE, INTE计算机:跨学科应1N1 IEEE T NEUR NET LEAR2162-237X C OMPUTER SCIENCE, THEO计算机:理论方法1N1 IEEE T NEUR NET LEAR2162-237X C OMPUTER SCIENCE, ARTI计算机:人工智能1N1 IEEE T NEUR NET LEAR2162-237X C OMPUTER SCIENCE, HAR计算机:硬件1N1 MED IMAGE ANAL1361-8415C OMPUTER SCIENCE, INTE计算机:跨学科应1N1 MED IMAGE ANAL1361-8415C OMPUTER SCIENCE, ARTI计算机:人工智能2N1 ACM COMPUT SURV0360-0300C OMPUTER SCIENCE, THEO计算机:理论方法1N1 IEEE COMMUN MAG0163-6804T ELECOMMUNICATIONS电信学1N2 INTEGR COMPUT-AID E1069-2509C OMPUTER SCIENCE, INTE计算机:跨学科应2N2 INTEGR COMPUT-AID E1069-2509C OMPUTER SCIENCE, ARTI计算机:人工智能2N2 ENVIRON MODELL SOFTW1364-8152C OMPUTER SCIENCE, INTE计算机:跨学科应2N2 INT J COMPUT VISION0920-5691C OMPUTER SCIENCE, ARTI计算机:人工智能2N2 IEEE COMPUT INTELL M1556-603X C OMPUTER SCIENCE, ARTI计算机:人工智能2N2 IEEE J SEL AREA COMM0733-8716T ELECOMMUNICATIONS电信学1N2 ACM T GRAPHIC0730-0301C OMPUTER SCIENCE, SOFT计算机:软件工程1N2 SIAM J IMAGING SCI1936-4954C OMPUTER SCIENCE, ARTI计算机:人工智能2N2 SIAM J IMAGING SCI1936-4954C OMPUTER SCIENCE, SOFT计算机:软件工程1N2 IEEE T AFFECT COMPUT1949-3045C OMPUTER SCIENCE, CYB计算机:控制论1N2。

WEBs 应用手册说明书

WEBs 应用手册说明书

WEBs 应用手册关于霍尼韦尔霍尼韦尔是一家《财富》全球500 强的高科技企业。

我们的高科技解决方案涵盖航空、汽车、楼宇、住宅和工业控制技术,特性材料,以及物联网。

我们致力于将物理世界和数字世界深度融合,利用先进的云计算、数据分析和工业物联网技术解决最为棘手的经济和社会挑战。

在中国,霍尼韦尔长期以创新来推动增长,贯彻“东方服务于东方”和“东方服务于全球”的战略。

霍尼韦尔始创于1885 年,在华历史可以追溯到1935 年,在上海开设了第一个经销机构。

目前,霍尼韦尔四大业务集团均已落户中国,上海是霍尼韦尔亚太区总部,在华员工人数约11,000 人。

同时,霍尼韦尔在中国的30 多个城市拥有50 多家独资公司和合资企业,其中包括20 多家工厂,旨在共同打造万物互联、更智能、更安全和更可持续发展的世界。

欲了解更多公司信息,请访问霍尼韦尔中国网站www. ,或关注霍尼韦尔官方微博和官方微信。

霍尼韦尔霍尼韦尔智能建筑科技集团我们在全球拥有23,000 多名员工。

我们的产品、软件和技术已在全球超过1,000 万栋建筑中使用。

我们的技术确保商业楼宇业主和用户的设施安全、节能、具有可持续性与高生产力。

霍尼韦尔智能建筑科技集团深耕中国40 多年来,参与了30 多个城市的150 多条地铁的建设,为500 多座机场的智慧和安全保驾护航,为600 多家酒店提供智能管理系统,为1000多家医院提供了数字化解决方案。

目录第一部分 (4)霍尼韦尔智慧楼宇系统架构示意图 (4)霍尼韦尔智慧能源管理解决方案 (6)WEBs N4管理软件 (9)霍尼韦尔智慧触控屏 (13)第二部分 (17)系统控制器 WEB 8000 系列 (17)系统控制器 WEB 8000 VAV 专用系列 (21)边缘数据管理器 (24)增强型可编程通用控制器 (27)可编程通用控制器 (30)可编程通用控制器扩展模块 (33)BACnet 可编程通用 / VAV 控制器 (36)Lonworks 可编程通用 / VAV 控制器 (39)VAV 控制器 (43)BACnet 通用控制器 (46)Sylk TM I/O 扩展模块 (49)MVCweb 控制器 (52)UB系列独立控制器 (55)第三部分 (59)房间温控单元 (59)变风量末端墙装模块 (63)WTS3/6 系列温控器 (65)WTS8/9 系列温控器 (69)WS9 系列墙装模块 (73)建筑网络适配器 (76)智能电表 (78)4Ethernet / LANBACnet MS/TP Modbus RTU LonworksKNXSylk BusLightingModbus TCP BACnet IPBACnet IPAlarm Console clientWEB 8000 Web ControllerWEBStation Supervisor智慧触控屏Sylk I/O ModuleLonworks Spyder边缘数据管理器Spyder Universal ControllerPUC BACnet MS/TP Controller霍尼韦尔智慧楼宇系统架构示意图系统示意图仅用于显示设备在系统中的层次关系以及支持的通讯协议具体配置细节请结合实际项目情况,联系霍尼韦尔技术工程师进行架构设计5ElectricitySubmeterBACnet IPBACnet IPHTTPs , BACnet IP , oBIX , SNMP , …WEBs Enterprise Security WEBs Energy AnalyticsHAQ61增强型 BACnet IP ControllerFCU Wall ModuleVAV Controller EM Bus I/O ModuleSylk Bus Wall Module增强型 BACnet IP ControllerEM Bus6霍尼韦尔智慧能源管理解决方案智能高效,机器自学习功能准确分析,快速发现能耗异常功能全面,基于能耗大数据采集、趋势分析、评估诊断和流程控制的闭环管理功能数据准确,具有180多年计量仪表生产、安装与服务的专业知识灵活易用,云平台或本地部署灵活配置和迁移,操作简便扩展性好通过能源可见性、积极应对能耗异常和提高管理人员参与度,用户可以:★ 避免能耗异常波动★ 确保节能投资的投资回报率(ROI)符合预期★ 提高管理效率和降低运营成本研究显示,更多的企业为合规地实现节省成本、提高效率,越来越关注能源管理系统。

基于改进DeepLabV3+的引导式道路提取方法及在震源点位优化中的应用

基于改进DeepLabV3+的引导式道路提取方法及在震源点位优化中的应用

2024年3月第39卷第2期西安石油大学学报(自然科学版)JournalofXi’anShiyouUniversity(NaturalScienceEdition)Mar.2024Vol.39No.2收稿日期:2023 06 03基金项目:国家自然科学基金面上项目“基于频变信息的流体识别及流体可动性预测”(41774142);四川省重点研发项目“工业互联网安全与智能管理平台关键技术研究与应用”(2023YFG0112);四川省自然科学基金资助项目“基于超分辨感知方法的密集神经图像分割”(2022NSFSC0964)第一作者:曹凯奇(1998 ),男,硕士,研究方向:遥感图像标注。

E mail:819088338@qq.com通讯作者:文武(1979 ),男,博士,研究方向:人工智能在地球科学的应用、高性能计算。

E mail:wenwu@cuit.edu.cnDOI:10.3969/j.issn.1673 064X.2024.02.016中图分类号:TE19文章编号:1673 064X(2024)02 0128 15文献标识码:A基于改进DeepLabV3+的引导式道路提取方法及在震源点位优化中的应用曹凯奇1,张凌浩2,徐虹1,吴蔚3,文武1,周航1(1.成都信息工程大学计算机学院,四川成都610225;2.国网四川省电力公司电力科学研究院,四川成都610094;3.中国石油集团东方地球物理勘探有限责任公司采集技术中心,河北涿州072750)摘要:为解决自动识别方法在道路提取时存在漏提、错提现象,提出一种引导式道路提取方法提高修正效率。

在DeepLabV3+原有输入通道(3通道)的基础上添加额外输入通道(第4通道),将道路的4个极点转化为二维高斯热图后作为额外通道输入网络,网络以极点作为引导信号,使网络适用于引导式道路提取任务;设计并行多分支模块,提取上下文信息,增强网络特征提取能力;融合类均衡二值交叉熵和骰子系数组成新的复合损失函数进行训练缓解正负样本不均衡问题。

graded

graded

Mesh-free analysis of cracks in isotropic functionallygraded materialsB.N.Rao,S.Rahman *College of Engineering,The University of Iowa,2140Seamans Center,Iowa City,IA 52242,USAReceived 21August 2001;received in revised form 22February 2002;accepted 17March 2002AbstractThis paper presents a Galerkin-based meshless method for calculating stress-intensity factors (SIFs)for a stationary crack in two-dimensional functionally graded materials of arbitrary geometry.The method involves an element-free Galerkin method (EFGM),where the material properties are smooth functions of spatial coordinates and two newly developed interaction integrals for mixed-mode fracture analysis.These integrals can also be implemented in con-junction with other numerical methods,such as the finite element method (FEM).Five numerical examples including both mode-I and mixed-mode problems are presented to evaluate the accuracy of SIFs calculated by the proposed parisons have been made between the SIFs predicted by EFGM and available reference solutions in the literature,generated either analytically or by FEM using various other fracture integrals or analyses.Agood agreement is obtained between the results of the proposed meshless method and the reference solutions.Ó2002Elsevier Science Ltd.All rights reserved.Keywords:Crack;Functionally graded materials;Element-free Galerkin method;Stress-intensity factor;J -integral;Interaction integral1.IntroductionIn recent years,functionally graded materials (FGMs)have been introduced and applied in the devel-opment of structural components subject to non-uniform service requirements.FGMs,which possess continuously varying microstructure and mechanical and/or thermal properties,are essentially two-phase particulate composites,such as ceramic and metal alloy phases,synthesized such that the composition of each constituent changes continuously in one direction,to yield a predetermined composition profile [1].Even though the initial developmental emphasis of FGMs was to synthesize thermal barrier coating for space applications [2],later investigations uncovered a wide variety of potential applications,including nuclear fast breeder reactors [3],piezoelectric and thermoelectric devices [4–6],graded refractive index *Corresponding author.Tel.:+1-319-335-5679;fax:+1-319-335-5669.E-mail address:rahman@ (S.Rahman).URL:/$rahman.0013-7944/03/$-see front matter Ó2002Elsevier Science Ltd.All rights reserved.PII:S 0013-7944(02)00038-3materials in audio–video disks[7],thermionic converters[8],dental and medical implants[9],and others [10].The absence of sharp interfaces in FGM largely reduces material property mismatch,which has been found to improve resistance to interfacial delamination and fatigue crack propagation[11].However,the microstructure of FGM is generally heterogeneous,and the dominant type of failure in FGM is crack initiation and growth from inclusions.The extent to which constituent material properties and micro-structure can be tailored to guard against potential fracture and failure patterns is relatively unknown.Such issues have motivated much of the current research into the numerical computation of crack-driving forces and the simulation of crack growth in FGMs.Analytical work on FGMs begins as early as1960when soil was modeled as a non-homogeneous ma-terial by Gibson[12].Due to the complexity,plane elasticity problems involving cracks in FGM are solved assuming a functional form of the material property variation,usually a linear or exponential function. Assuming an exponential spatial variation of the elastic modulus,Atkinson and List[13],Dhaliwal and Singh[14],and Delale and Erdogan[15]solved crack problems for non-homogeneous materials subjected to mechanical loads.Delale and Erdogan[15]showed that the asymptotic crack-tip stressfield in FGMs possesses the same square root singularity as in homogeneous materials.Eischen[16]studied mixed-mode conditions in non-homogeneous materials using thefinite element method(FEM).He also verified that the leading term of the asymptotic expansion for stresses was square-root singular.This result was reconfirmed by Jin and Noda[17]for materials with piecewise differentiable property variations.By further assuming the exponential variation of thermal properties of the material,Jin and Noda[18]and Erdogan and Wu[19] computed thermal stress-intensity factor(SIF)for non-homogeneous solids.Yang and Shih[20]considered a semi-infinite crack in an interlayer between two dissimilar materials,and they obtained an approximate solution from a known bimaterial solution.Gu and Asaro[21]considered a semi-infinite crack in a strip of FGM under edge loading and obtained SIF relations for many commonly used fracture specimen con-figurations.Erdogan[11]reviewed the elementary concepts of fracture mechanics of FGM and identified a number of typical problems relating to FGM fracture.Crack deflection in FGM has been considered by Gu and Asaro[22]who reported the strong influence of the material gradient on the crack kink angle when the crack is in the middle of the gradient zone.Tohgo et al.[23]carried out a numerical analysis of particulate FGM,and studied the influence of the material gradient on the size of a singularfield by comparing the FGM results with those obtained for a homogeneous medium.Gu et al.[24]presented a simplified method for calculating the crack-tipfield of FGMs using the equivalent domain integral technique.Anlas et al.[25] evaluated SIFs in FGMs by the FEM where the material property variation was discretized by assigning different homogeneous elastic properties to each element.Both Gu et al.[24]and Anlas et al.[25]considered a mode-I crack where the crack is parallel to the material gradation,and used commercial FEM software in their analyses.Marur and Tippur[26]considered a crack normal to the elastic gradient and performed FEM analysis in conjunction with their experiments.Bao and Wang[27]studied multi-cracking in an FGM coating.Bao and Cai[28]studied delamination cracking in a functionally graded ceramic/metal substrate. Lee and Erdogan[29]evaluated residual thermal stresses in FGMs.Recently,Kim and Paulino[30] evaluated the mixed-mode fracture parameters in FGMs using FEM analysis with three different ap-proaches:the path-independent JÃk -integral method,the modified crack-closure integral method,and thedisplacement correlation technique.Zou et al.[31]proposed a multiple isoparametric FEM to evaluate the SIFs of cracks in FGMs.Thus,most of the analytical studies on FGM reviewed above have used FEM as the numerical tool.FEM may present some limitations in solving solid mechanics problems characterized by a continuous change in geometry of the domain under analysis.Crack propagation is a prime example in which the use of FEM requires a large number of remeshings of thefinite element model to represent arbitrary and complex paths.The underlying structures of FEM and similar methods,which rely on a mesh,is quite cumbersome in treating cracks that are not coincident with the original mesh geometry. Consequently,the only viable option for dealing with moving cracks using FEM is to remesh during each discrete step of model evolution so that the mesh lines remain coincident with the cracks throughout the 2 B.N.Rao,S.Rahman/Engineering Fracture Mechanics70(2003)1–27B.N.Rao,S.Rahman/Engineering Fracture Mechanics70(2003)1–273 analysis.This creates numerical difficulties,often leading to degradation of solution accuracy,complexity in computer programming,and a computationally intensive environment.In recent years,various Galerkin-based meshless or mesh-free methods have been developed or inves-tigated to solve fracture-mechanics problems without the use of a structured grid[32–38].These meshless methods employ moving least-squares(MLS)approximation of a function that permits the resultant shape functions to be constructed entirely in terms of arbitrarily placed nodes.Since no element connectivity data is required,the burdensome meshing or remeshing characteristic of FEM is avoided.Since the mesh generation of complex cracked structures can be a far more time-consuming and costly effort than the solution of a discrete set of linear equations,the meshless method provides an attractive alternative to FEM.However,to date most developments in meshless methods have focused on the fracture of homo-geneous materials.Fracture analysis of cracks in FGMs using meshless methods has not been widespread and is only currently gaining attention.As a result,there is considerable interest in developing meshless methods for the evaluation of crack-driving force in FGMs.This paper presents a meshless method for calculating the fracture parameters of a stationary crack in FGM with arbitrary geometry.This method involves an element-free Galerkin method(EFGM),where the material properties are smooth functions of spatial coordinates and two newly developed interaction in-tegrals for mixed-mode fracture analysis.In conjunction with the proposed method,both mode-I and mixed-mode two-dimensional problems have been solved.Five numerical examples are presented to evaluate the accuracy of SIFs calculated by the proposed parisons have been made between the SIFs predicted by the proposed method and the existing results available in the current literature. 2.Crack-tipfields in FGMConsider a two-dimensional structure with a rectilinear crack of length2a,subjected to external loads S1;S2;...;S M,as shown in Fig.1.It is assumed that the material properties,such as the modulus of elas-ticity E and the Poisson’s ratio m,vary accordingtoE¼Eðx1;x2Þ¼EðxÞ;ð1Þm¼mðx1;x2Þ¼mðxÞ;ð2Þwhere x¼f x1;x2g T2R2,EðxÞP0andÀ16mðxÞ61=2are continuous,bounded,and at least piecewise differentiable functions on domain X,and the x1–x2coordinate system is defined in Fig.1.In reality,FGMs are multi-phase materials with generally,locally discontinuous material properties.Hence,EðxÞand mðxÞin Eqs.(1)and(2)should be viewed as smoothly varying‘‘effective’’material properties of FGMs.In this case, FGMs can be modeled as non-homogeneous materials,for which the elastic constitutive equation ise ij¼1þmÃðxÞEÃðxÞr ijþmÃðxÞEÃðxÞr kk d ij;ð3Þwhere e ij and r ij are the strain and stress components,respectively,and d ij is the Kronecker delta.In Eq.(3), EÃðxÞand mÃðxÞare given by EðxÞand mðxÞunder plane stress condition and by EðxÞ=½1ÀmðxÞ2 and mðxÞ=½1ÀmðxÞ under plane strain condition,respectively.For non-homogeneous materials undergoing plane stress or plane strain linear-elastic deformation,in the absence of body forces the Airy stress function Fðx1;x2Þsatisfies[16]r2r2FEÃðxÞÀo2o x221þmÃðxÞEÃðxÞo2Fo x21Ào2o x211þmÃðxÞEÃðxÞo2Fo x22þ2o2o x1o x21þmÃðxÞEÃðxÞo2Fo x1o x2¼0;ð4Þwhere r2¼o2=o x21þo2=o x22is the two-dimensional Laplacian operator.Eischen[16]and later Jin andNoda[17]showed that for piecewise differentiable material property variations,the elastic stress and dis-placementfields in FGM can be derived using the stress function in variable separable form,identical to the homogeneous case.Hence,the linear-elastic singular stressfield near the crack tip can be obtained as[16]r11¼1ffiffiffiffiffiffiffi2p rp½K I f I11ðhÞþK II f II11ðhÞ ;ð5Þr22¼1ffiffiffiffiffiffiffi2p rp½K I f I22ðhÞþK II f II22ðhÞ ;ð6Þr12¼1ffiffiffiffiffiffiffi2p rp½K I f I12ðhÞþK II f II12ðhÞ ;ð7Þwhere K I and K II are the mode-I and mode-II SIFs,respectively,and f Iij ðhÞand f IIijðhÞ(i,j¼1,2)are thestandard angular functions for a crack in a homogeneous elastic medium.Similarly,the near tip dis-placementfield u¼f u1;u2g T can be obtained as[16]u1¼1ltipffiffiffiffiffiffir2pr½K I g I1ðhÞþK II g II1ðhÞ ð8Þandu2¼1ltipffiffiffiffiffiffir2pr½K I g I2ðhÞþK II g II2ðhÞ ;ð9Þwhere l tip¼E tip=½2ð1þm tipÞ is the shear modulus,E tip is the elastic modulus,and m tip is the Poisson’s ratio,all evaluated at the crack tip,and g Ii ðhÞand g IIiðhÞ,i¼1,2are standard angular functions for a crack in ahomogeneous elastic medium[39].Even though the material gradient does not influence the square-root singularity or the singular stress distribution,the material gradient does affect the SIFs.Hence,the fracture parameters are functions of the material gradients,external loading,and geometry.4 B.N.Rao,S.Rahman/Engineering Fracture Mechanics70(2003)1–273.The interaction integral methodThe interaction integral method is an effective tool for calculating mixed-mode fracture parameters in homogeneous materials[40,41].In this section the interaction integral method for homogeneous materials isfirst briefly summarized,then extended for cracks in FGM.In fact,the study of FGM would enhance the understanding of a fracture in a generic material,since upon shrinking the gradient layer in FGM is ex-pected to behave like a sharp interface,and upon expansion,the fracture behavior would be analogous to that of a homogeneous material.3.1.Homogeneous materialsThe path independent J-integral for a homogeneous cracked body is given by[42]J¼ZCW d1jÀr ijo u io x1n j d C;ð10Þwhere W¼Rr ij d e ij is the strain energy density and n j is the j th component of the outward unit vectornormal to an arbitrary contour C enclosing the crack tip.For linear elastic material models it can shown that W¼r ij e ij=2¼e ij D ijkl e kl=2,where D ijkl is a component of constitutive tensor.Applying the divergence theorem,the contour integral in Eq.(10)can be converted into an equivalent domain form,given by[43]J¼ZAr ijo u io x1ÀW d1jo qo x jd AþZAoo x jr ijo u io x1ÀW d1jq d A;ð11Þwhere A is the area inside the contour and q is a weight function chosen such that it has a value of unity at the crack tip,zero along the boundary of the domain,and arbitrary elsewhere.By expanding the second integrand,Eq.(11)reduces toJ¼ZAr ijo u io x1ÀW d1jo qo x jd AþZAo r ijo x jo u io x1þr ijo2u io x j o x1Àr ijo e ijo x1À12e ijo D ijklo x1e klq d A:ð12ÞUsing equilibrium(o r ij=o x j¼0)and compatibility(e ij¼o u i=o x j)conditions and noting that o D ijkl=o x1¼0 in homogeneous materials,the second integrand of Eq.(12)vanishes,yieldingJ¼ZAr ijo u io x1ÀW d1jo qo x jd A;ð13Þwhich is the classical domain form of the J-integral in homogeneous materials.Consider two independent equilibrium states of the cracked body.Let state1correspond to the actual state for the given boundary conditions,and let state2correspond to an auxiliary state,which can be either mode-I or mode-II near tip displacement and stressfields.Superposition of these two states leads to another equilibrium state(state S)for which the domain form of the J-integral isJðSÞ¼ZAðrð1Þij"þrð2ÞijÞoðuð1Þiþuð2ÞiÞo x1ÀWðSÞd1j#o qo x jd A;ð14Þwhere superscript i¼1,2,and S indicatefields and quantities associated with state i and WðSÞ¼1ðrð1Þijþrð2ÞijÞðeð1Þijþeð2ÞijÞ:ð15ÞBy expanding Eq.(14),JðSÞ¼Jð1ÞþJð2ÞþMð1;2Þ;ð16ÞB.N.Rao,S.Rahman/Engineering Fracture Mechanics70(2003)1–275whereJð1Þ¼ZArð1Þijo uð1Þio x1"ÀWð1Þd1j#o qo x jd Að17ÞandJð2Þ¼ZArð2Þijo uð2Þio x1"ÀWð2Þd1j#o qo x jd Að18Þare the J-integrals for states1and2,respectively,andMð1;2Þ¼ZArð1Þijo uð2Þio x1"þrð2Þijo uð1Þio x1ÀWð1;2Þd1j#o qo x jd Að19Þis an interaction integral.In Eqs.(17)–(19),Wð1Þ¼1rð1Þij eð1Þij,Wð2Þ¼1rð2Þij eð2Þij,and Wð1;2Þ¼1ðrð1Þij eð2Þijþrð2Þij eð1ÞijÞrepresent various strain energy densities,which satisfyWðSÞ¼Wð1ÞþWð2ÞþWð1;2Þ:ð20ÞFor linear-elastic solids under mixed-mode loading conditions,the J-integral is also equal to the energy release rate and hence,the J-integral can be written asJ¼1EÃðK2IþK2IIÞ:ð21ÞApplying Eq.(21)to states1,2,and the superimposed state S givesJð1Þ¼1EÃðKð1Þ2IþKð1Þ2IIÞ;ð22ÞJð2Þ¼1EÃðKð2Þ2IþKð2Þ2IIÞð23ÞandJðSÞ¼1EÃðKð1ÞIhþKð2ÞIÞ2þðKð1ÞIIþKð2ÞIIÞ2i¼1EÃðKð1Þ2IhþKð1Þ2IIÞþðKð2Þ2IþKð2Þ2IIÞþ2ðKð1ÞIKð2ÞIþKð1ÞIIKð2ÞIIÞi¼Jð1ÞþJð2Þþ2EÃKð1ÞIKð2ÞIþKð1ÞIIKð2ÞII:ð24ÞComparing Eqs.(16)and(24),Mð1;2Þ¼2EÃðKð1ÞIKð2ÞIhþKð1ÞIIKð2ÞIIÞi:ð25ÞThe individual SIFs for the actual state can obtained by judiciously choosing the auxiliary state(state2). For example,if state2is chosen to be state I,i.e.,the mode-I near tip displacement and stressfield is chosenas the auxiliary state,then Kð2ÞI ¼1and Kð2ÞII¼0.Hence,Eq.(25)can be reduced toMð1;IÞ¼2Kð1ÞIEÃ;ð26Þ6 B.N.Rao,S.Rahman/Engineering Fracture Mechanics70(2003)1–27from whichK ð1ÞI ¼M ð1;I ÞE Ã2:ð27ÞSimilarly,if state 2is chosen to be state II,i.e.,the mode-II near tip displacement and stress field is chosen as the auxiliary state,then K ð2ÞI ¼0and K ð2ÞII ¼1.Following similar considerations,K ð1ÞII ¼M ð1;II ÞE Ã2:ð28ÞThe interaction integrals M ð1;I Þand M ð1;II Þcan be evaluated from Eq.(19).Eqs.(27)and (28)have been successfully used for calculating SIFs under various mixed-mode loading conditions [32–38].3.2.Functionally graded materialsFor non-homogeneous materials,even though the equilibrium and compatibility conditions are satisfied,the material gradient term of the second integrand of Eq.(12)does not vanish.So Eq.(12)reduces to a more general integral,henceforth referred to as the e J -integral [24],which is e J ¼Z A r ij o u i o x 1 ÀW d 1j o q o x j d A ÀZ A12e ij o D ijkl o x 1e kl q d A :ð29ÞBy comparing Eq.(29)to the classical J -integral (see Eq.(13)),the presence of material non-homogeneity results in the addition of the second domain integral.Although this integral is negligible for a path very close to the crack tip,it must be accounted for with relatively large integral domains,so that the e J -integral can be accurately calculated.The e J -integral in Eq.(29)is actually the first component of the J üf J Ã1;J Ã2g T vector integral (i.e.,J Ã1)proposed by Eischen [16].Hence,e J also represents the energy release rate of an elastic body.It is ele-mentary to show that the e J -integral becomes zero for any closed contour in an uncracked homogeneous,as well as in non-homogeneous bodies,and therefore remains path independent when used in conjunction with cracks in FGM [16,44].In order to derive interaction integral for FGMs,consider again actual (state 1),auxiliary (state 2),and superimposed (state S )equilibrium states.For the actual state,Eq.(29)can be directly invoked to represent the e J -integral.However,a more general form,such as Eq.(11),must be used for auxiliary and superim-posed states.For example,the e J -integral for the superimposed state S can written as e J ðS Þ¼Z A ðr ð1Þij þr ð2Þij Þo ðu ð1Þi þu ð2Þi Þo x 1ÀW ðS Þd 1j !o q o x j d A þZ Ao o x j ðr ð1Þij þr ð2Þij Þo ðu ð1Þi þu ð2Þi Þo x 1ÀW ðS Þd 1j !q d A :ð30ÞClearly,the evaluations of e JðS Þand the resulting interaction integral depend on how the auxiliary field is defined.There are several options in choosing the auxiliary field.Two methods,developed in this study,are described in the following.3.2.1.Method I:homogeneous a uxilia ry fieldThe method I involves selecting the auxiliary stress and displacement fields given by Eqs.(5)–(9)and calculating the auxiliary strain field from the symmetric gradient of the auxiliary displacement field.In this approach,the auxiliary stress and strain fields are related through a constant constitutive tensor evaluated at the crack tip.Hence,both equilibrium (o r ð2Þij =o x j ¼0)and compatibility (e ð2Þij ¼o u ð2Þi =o x j )conditions are satisfied in the auxiliary state.However,the non-homogeneous constitutive relation of FGM is not strictly satisfied in the auxiliary state,which would introduce gradients of stress fields as extra terms in the in-teraction integral.B.N.Rao,S.Rahman /Engineering Fracture Mechanics 70(2003)1–277Using Eq.(20)and invoking both equilibrium and compatibility conditions,Eq.(30)can be further simplified to e J ðS Þ¼Z Aðr ð1Þij þr ð2Þij Þo ðu ð1Þi þu ð2Þi Þo x 1ÀðW ð1ÞþW ð2ÞþW ð1;2ÞÞd 1j !o q o x j d A þZ A 12"Àe ð1Þij o D ijkl o x 1e ð1Þkl þr ð1Þij o e ð2Þij o x 1Ào r ð2Þij o x 1e ð1Þij þr 2ij o e ð1Þij o x 1Ào r ð1Þij o x 1e ð2Þij #q d A :ð31ÞBy expanding Eq.(31),e J ðS Þ¼e J ð1Þþe J ð2Þþe Mð1;2Þ;ð32Þwheree J ð1Þ¼Z A r ð1Þij o u ð1Þi o x 1"ÀW ð1Þd 1j #o q o x j d A ÀZ A 12e ð1Þij o D ijkl o x 1e ð1Þkl q d A ;ð33Þe J ð2Þ¼Z A r ð2Þij o u ð2Þi o x 1"ÀW ð2Þd 1j #o q o x j d A ð34Þare the e J -integrals for states 1and 2,respectively,and e M ð1;2Þ¼Z A r ð1Þij o u ð2Þi 1"þr ð2Þij o u ð1Þi 1ÀW ð1;2Þd 1j #o q j d A þZ A 1r ð1Þij o e ð2Þij 1"Ào r ð2Þij 1e ð1Þij þr ð2Þij o e ð1Þij 1Ào r ð1Þij 1e ð2Þij #q d A ð35Þis the modified interaction integral for non-homogeneous materials.3.2.2.Method II:non-homogeneous a uxilia ry fieldThe method II entails selecting the auxiliary stress and displacement fields given by Eqs.(5)–(9)and calculating the auxiliary strain field using the same spatially varying constitutive tensor of FGM.In thisapproach,the auxiliary stress field satisfies equilibrium (o r ð2Þij =o x j ¼0);however,the auxiliary strain field isnot compatible with the auxiliary displacement field (e ð2Þij ¼o u ð2Þi =o x j ).If the auxiliary fields are not com-patible,extra terms that will arise due to lack of compatibility should be taken into account while evalu-ating the interaction integral,even though they may not be sufficiently singular in the asymptotic limit to contribute to the value of the integral [45–47].Hence,this method also introduces additional terms to the resulting interaction integral.Following similar considerations,but using only equilibrium condition in the auxiliary state,Eq.(30)can also be simplified toe J ðS Þ¼Z Aðr ð1Þij þr ð2Þij Þo ðu ð1Þi þu ð2Þi Þo x 1ÀðW ð1ÞþW ð2ÞþW ð1;2ÞÞd 1j !o q o x j d A þZ A ðr ð1Þij þr ð2Þij Þo 2u ð2Þi o x j o x 1 Ào e ð2Þij o x 1!À12ðe ð1Þij þe ð2Þij Þo D ijkl o x 1ðe ð1Þkl þe ð2Þkl Þ!q d A :ð36Þ8 B.N.Rao,S.Rahman /Engineering Fracture Mechanics 70(2003)1–27Comparing Eqs.(36)and(32),e Jð1Þ¼ZArð1Þijo uð1Þio x1"ÀWð1Þd1j#o qo x jd AÀZA12eð1Þijo D ijklo x1eð1Þklq d A;ð37Þe Jð2Þ¼ZArð2Þijo uð2Þio x1"ÀWð2Þd1j#o qo x jd AþZArð2Þijo2uð2Þio x j o x1"Ào eð2Þijo x1!À12eð2Þijo D ijklo x1eð2Þkl#q d Að38Þare the e J-integrals for states1and2,respectively,ande Mð1;2Þ¼ZArð1Þijo uð2Þio x1"þrð2Þijo uð1Þio x1ÀWð1;2Þd1j#o qo x jd AþZArð1Þijo2uð2Þio x j o x1"Ào eð2Þijo x1!Àeð1Þijo D ijklo x1eð2Þkl#q d Að39Þis another modified interaction integral for non-homogeneous materials.Recently,Dolbow and Gosz[48] have also derived a path independent interaction integral which is the same as the one given by Eq.(39). Note,for homogeneous materials,o D ijkl=o x1¼0,eð2Þij¼o uð2Þi=o x j,rð1Þij o eð2Þij=o x1¼o rð2Þij=o x1eð1Þij and rð2Þij o eð1Þij=o x1¼o rð1Þij=o x1eð2Þij,regardless of how the auxiliaryfield is defined.As a result,the e Jð1Þ,e Jð2Þ,and e Mð1;2Þintegrals in methods I and II degenerate to their corresponding homogeneous solutions,as expected.3.2.3.Stress-intensity factorsFor linear-elastic solids,the e J-integral also represents the energy release rate and,hence,e J¼1Etip ðK2IþK2IIÞ;ð40Þwhere EÃtip is evaluated at the crack tip.Regardless of how the auxiliaryfields are defined,Eq.(40)applied tostates1,2,and S yieldse Jð1Þ¼1Etip ðKð1Þ2IþKð1Þ2IIÞ;ð41Þe Jð2Þ¼1Etip ðKð2Þ2IþKð2Þ2IIÞð42Þande JðSÞ¼e Jð1Þþe Jð2Þþ2Etip ðKð1ÞIKð2ÞIþKð1ÞIIKð2ÞIIÞ:ð43ÞComparing Eq.(32)with Eq.(43),e Mð1;2Þ¼2EtipKð1ÞIKð2ÞIhþKð1ÞIIKð2ÞIIi:ð44ÞFollowing a similar procedure and judiciously choosing the intensity of the auxiliary state as described earlier,the SIFs for non-homogeneous materials can also be derived asKð1ÞI ¼e Mð1;IÞEÃtip2ð45ÞB.N.Rao,S.Rahman/Engineering Fracture Mechanics70(2003)1–279。

基于 Web 的中英文术语自动抽取技术


作者签名: 日 期:
导师签名: 日 期:




术语广泛的存在于科技文档中,如何提取、分析、理解以至翻译这些术语 成为现在自然语言处理的一个研究方向。随着当今世界信息量的急剧增加和国 际交流的日益频繁,计算机网络技术迅速普及和发展,语言障碍愈加明显和严 重,对机器翻译的潜在需求也越来越大。双语术语散落在这些海量的互联网文 本数据中,靠人工进行检测和提取是不可想象的。本文所要解决机器翻译中如 何快速地对网络文本进行处理,从中抽取出较为准确的术语中英文互译候选, 以减轻人工筛选的工作量。 目前,双语术语的研究一般是运用句法分析或者引入双语词典的方法,实 现句子对齐,而后从对齐的句子运用算法,抽取互译词。而本文的基本思路是 在无监督的情况下,利用网络上大量存在的中英文术语互译信息,达到自动抽 取中英文术语候选的目的。我们通过对互联网上大量文本信息的观察,选取一 类符合规则的文本,针对文本建立一个语言模板,运用网络爬虫,抓取网页生 成网络文本语料库;而后,在 MapReduce 架构下对网络文本语料进行处理,抽 取符合该语言模板规定的大量中英文词对;对抽取出来的大量中英文双语术语 候选进行预处理,过滤掉部分噪声;对预处理后的数据运用多种优化的 LCS 算 法加以抽取,生成中英文双语术语互译词典,并对结果加以评测。 本文的研究工作主要包括在以下几个方面: 1. 在 MapReduce 架构下,对抓取的文本语料库数据快速处理,以获得所需 文本数据资源。 2. 设计了一套无监督的双语术语自动抽取软件系统,能较为及时准确地发 现并更新术语库。 3. 基于 LCS 算法提出并建立了两种将规则和统计的方法相结合的双语术语 自动抽取模型。 4 用 CRFs 辅助优化 LCS 算法, 对比试验结果, 分析 CRFs 分词对 LCS 算法 的影响。 关键词: 术语 自动抽取 机器翻译 中文信息处理 自然语言处理

ReliabilityEngineeringandSystemSafety91(2006)992–1007

Reliability Engineering and System Safety 91(2006)992–1007Multi-objective optimization using genetic algorithms:A tutorialAbdullah Konak a,Ã,David W.Coit b ,Alice E.Smith caInformation Sciences and Technology,Penn State Berks,USA bDepartment of Industrial and Systems Engineering,Rutgers University cDepartment of Industrial and Systems Engineering,Auburn UniversityAvailable online 9January 2006AbstractMulti-objective formulations are realistic models for many complex engineering optimization problems.In many real-life problems,objectives under consideration conflict with each other,and optimizing a particular solution with respect to a single objective can result in unacceptable results with respect to the other objectives.A reasonable solution to a multi-objective problem is to investigate a set of solutions,each of which satisfies the objectives at an acceptable level without being dominated by any other solution.In this paper,an overview and tutorial is presented describing genetic algorithms (GA)developed specifically for problems with multiple objectives.They differ primarily from traditional GA by using specialized fitness functions and introducing methods to promote solution diversity.r 2005Elsevier Ltd.All rights reserved.1.IntroductionThe objective of this paper is present an overview and tutorial of multiple-objective optimization methods using genetic algorithms (GA).For multiple-objective problems,the objectives are generally conflicting,preventing simulta-neous optimization of each objective.Many,or even most,real engineering problems actually do have multiple-objectives,i.e.,minimize cost,maximize performance,maximize reliability,etc.These are difficult but realistic problems.GA are a popular meta-heuristic that is particularly well-suited for this class of problems.Tradi-tional GA are customized to accommodate multi-objective problems by using specialized fitness functions and introducing methods to promote solution diversity.There are two general approaches to multiple-objective optimization.One is to combine the individual objective functions into a single composite function or move all but one objective to the constraint set.In the former case,determination of a single objective is possible with methods such as utility theory,weighted sum method,etc.,but theproblem lies in the proper selection of the weights or utility functions to characterize the decision-maker’s preferences.In practice,it can be very difficult to precisely and accurately select these weights,even for someone familiar with the problem pounding this drawback is that scaling amongst objectives is needed and small perturbations in the weights can sometimes lead to quite different solutions.In the latter case,the problem is that to move objectives to the constraint set,a constraining value must be established for each of these former objectives.This can be rather arbitrary.In both cases,an optimization method would return a single solution rather than a set of solutions that can be examined for trade-offs.For this reason,decision-makers often prefer a set of good solutions considering the multiple objectives.The second general approach is to determine an entire Pareto optimal solution set or a representative subset.A Pareto optimal set is a set of solutions that are nondominated with respect to each other.While moving from one Pareto solution to another,there is always a certain amount of sacrifice in one objective(s)to achieve a certain amount of gain in the other(s).Pareto optimal solution sets are often preferred to single solutions because they can be practical when considering real-life problems/locate/ress0951-8320/$-see front matter r 2005Elsevier Ltd.All rights reserved.doi:10.1016/j.ress.2005.11.018ÃCorresponding author.E-mail address:konak@ (A.Konak).since thefinal solution of the decision-maker is always a trade-off.Pareto optimal sets can be of varied sizes,but the size of the Pareto set usually increases with the increase in the number of objectives.2.Multi-objective optimization formulationConsider a decision-maker who wishes to optimize K objectives such that the objectives are non-commensurable and the decision-maker has no clear preference of the objectives relative to each other.Without loss of generality, all objectives are of the minimization type—a minimization type objective can be converted to a maximization type by multiplying negative one.A minimization multi-objective decision problem with K objectives is defined as follows: Given an n-dimensional decision variable vector x¼{x1,y,x n}in the solution space X,find a vector x* that minimizes a given set of K objective functions z(x*)¼{z1(x*),y,z K(x*)}.The solution space X is gen-erally restricted by a series of constraints,such as g j(x*)¼b j for j¼1,y,m,and bounds on the decision variables.In many real-life problems,objectives under considera-tion conflict with each other.Hence,optimizing x with respect to a single objective often results in unacceptable results with respect to the other objectives.Therefore,a perfect multi-objective solution that simultaneously opti-mizes each objective function is almost impossible.A reasonable solution to a multi-objective problem is to investigate a set of solutions,each of which satisfies the objectives at an acceptable level without being dominated by any other solution.If all objective functions are for minimization,a feasible solution x is said to dominate another feasible solution y (x1y),if and only if,z i(x)p z i(y)for i¼1,y,K and z j(x)o z j(y)for least one objective function j.A solution is said to be Pareto optimal if it is not dominated by any other solution in the solution space.A Pareto optimal solution cannot be improved with respect to any objective without worsening at least one other objective.The set of all feasible non-dominated solutions in X is referred to as the Pareto optimal set,and for a given Pareto optimal set,the corresponding objective function values in the objective space are called the Pareto front.For many problems,the number of Pareto optimal solutions is enormous(perhaps infinite).The ultimate goal of a multi-objective optimization algorithm is to identify solutions in the Pareto optimal set.However,identifying the entire Pareto optimal set, for many multi-objective problems,is practically impos-sible due to its size.In addition,for many problems, especially for combinatorial optimization problems,proof of solution optimality is computationally infeasible.There-fore,a practical approach to multi-objective optimization is to investigate a set of solutions(the best-known Pareto set)that represent the Pareto optimal set as well as possible.With these concerns in mind,a multi-objective optimization approach should achieve the following three conflicting goals[1]:1.The best-known Pareto front should be as close aspossible to the true Pareto front.Ideally,the best-known Pareto set should be a subset of the Pareto optimal set.2.Solutions in the best-known Pareto set should beuniformly distributed and diverse over of the Pareto front in order to provide the decision-maker a true picture of trade-offs.3.The best-known Pareto front should capture the wholespectrum of the Pareto front.This requires investigating solutions at the extreme ends of the objective function space.For a given computational time limit,thefirst goal is best served by focusing(intensifying)the search on a particular region of the Pareto front.On the contrary,the second goal demands the search effort to be uniformly distributed over the Pareto front.The third goal aims at extending the Pareto front at both ends,exploring new extreme solutions.This paper presents common approaches used in multi-objective GA to attain these three conflicting goals while solving a multi-objective optimization problem.3.Genetic algorithmsThe concept of GA was developed by Holland and his colleagues in the1960s and1970s[2].GA are inspired by the evolutionist theory explaining the origin of species.In nature,weak and unfit species within their environment are faced with extinction by natural selection.The strong ones have greater opportunity to pass their genes to future generations via reproduction.In the long run,species carrying the correct combination in their genes become dominant in their population.Sometimes,during the slow process of evolution,random changes may occur in genes. If these changes provide additional advantages in the challenge for survival,new species evolve from the old ones.Unsuccessful changes are eliminated by natural selection.In GA terminology,a solution vector x A X is called an individual or a chromosome.Chromosomes are made of discrete units called genes.Each gene controls one or more features of the chromosome.In the original implementa-tion of GA by Holland,genes are assumed to be binary digits.In later implementations,more varied gene types have been introduced.Normally,a chromosome corre-sponds to a unique solution x in the solution space.This requires a mapping mechanism between the solution space and the chromosomes.This mapping is called an encoding. In fact,GA work on the encoding of a problem,not on the problem itself.GA operate with a collection of chromosomes,called a population.The population is normally randomly initia-lized.As the search evolves,the population includesfitterA.Konak et al./Reliability Engineering and System Safety91(2006)992–1007993andfitter solutions,and eventually it converges,meaning that it is dominated by a single solution.Holland also presented a proof of convergence(the schema theorem)to the global optimum where chromosomes are binary vectors.GA use two operators to generate new solutions from existing ones:crossover and mutation.The crossover operator is the most important operator of GA.In crossover,generally two chromosomes,called parents,are combined together to form new chromosomes,called offspring.The parents are selected among existing chromo-somes in the population with preference towardsfitness so that offspring is expected to inherit good genes which make the parentsfitter.By iteratively applying the crossover operator,genes of good chromosomes are expected to appear more frequently in the population,eventually leading to convergence to an overall good solution.The mutation operator introduces random changes into characteristics of chromosomes.Mutation is generally applied at the gene level.In typical GA implementations, the mutation rate(probability of changing the properties of a gene)is very small and depends on the length of the chromosome.Therefore,the new chromosome produced by mutation will not be very different from the original one.Mutation plays a critical role in GA.As discussed earlier,crossover leads the population to converge by making the chromosomes in the population alike.Muta-tion reintroduces genetic diversity back into the population and assists the search escape from local optima. Reproduction involves selection of chromosomes for the next generation.In the most general case,thefitness of an individual determines the probability of its survival for the next generation.There are different selection procedures in GA depending on how thefitness values are used. Proportional selection,ranking,and tournament selection are the most popular selection procedures.The procedure of a generic GA[3]is given as follows:Step1:Set t¼1.Randomly generate N solutions to form thefirst population,P1.Evaluate thefitness of solutions in P1.Step2:Crossover:Generate an offspring population Q t as follows:2.1.Choose two solutions x and y from P t based onthefitness values.ing a crossover operator,generate offspringand add them to Q t.Step3:Mutation:Mutate each solution x A Q t with a predefined mutation rate.Step4:Fitness assignment:Evaluate and assign afitness value to each solution x A Q t based on its objective function value and infeasibility.Step5:Selection:Select N solutions from Q t based on theirfitness and copy them to P t+1.Step6:If the stopping criterion is satisfied,terminate the search and return to the current population,else,set t¼t+1go to Step2.4.Multi-objective GABeing a population-based approach,GA are well suited to solve multi-objective optimization problems.A generic single-objective GA can be modified tofind a set of multiple non-dominated solutions in a single run.The ability of GA to simultaneously search different regions of a solution space makes it possible tofind a diverse set of solutions for difficult problems with non-convex,discon-tinuous,and multi-modal solutions spaces.The crossover operator of GA may exploit structures of good solutions with respect to different objectives to create new non-dominated solutions in unexplored parts of the Pareto front.In addition,most multi-objective GA do not require the user to prioritize,scale,or weigh objectives.Therefore, GA have been the most popular heuristic approach to multi-objective design and optimization problems.Jones et al.[4]reported that90%of the approaches to multi-objective optimization aimed to approximate the true Pareto front for the underlying problem.A majority of these used a meta-heuristic technique,and70%of all meta-heuristics approaches were based on evolutionary ap-proaches.Thefirst multi-objective GA,called vector evaluated GA (or VEGA),was proposed by Schaffer[5].Afterwards, several multi-objective evolutionary algorithms were devel-oped including Multi-objective Genetic Algorithm (MOGA)[6],Niched Pareto Genetic Algorithm(NPGA) [7],Weight-based Genetic Algorithm(WBGA)[8],Ran-dom Weighted Genetic Algorithm(RWGA)[9],Nondomi-nated Sorting Genetic Algorithm(NSGA)[10],Strength Pareto Evolutionary Algorithm(SPEA)[11],improved SPEA(SPEA2)[12],Pareto-Archived Evolution Strategy (PAES)[13],Pareto Envelope-based Selection Algorithm (PESA)[14],Region-based Selection in Evolutionary Multiobjective Optimization(PESA-II)[15],Fast Non-dominated Sorting Genetic Algorithm(NSGA-II)[16], Multi-objective Evolutionary Algorithm(MEA)[17], Micro-GA[18],Rank-Density Based Genetic Algorithm (RDGA)[19],and Dynamic Multi-objective Evolutionary Algorithm(DMOEA)[20].Note that although there are many variations of multi-objective GA in the literature, these cited GA are well-known and credible algorithms that have been used in many applications and their performances were tested in several comparative studies. Several survey papers[1,11,21–27]have been published on evolutionary multi-objective optimization.Coello lists more than2000references in his website[28].Generally, multi-objective GA differ based on theirfitness assign-ment procedure,elitisim,or diversification approaches.In Table1,highlights of the well-known multi-objective with their advantages and disadvantages are given.Most survey papers on multi-objective evolutionary approaches intro-duce and compare different algorithms.This paper takes a different course and focuses on important issues while designing a multi-objective GA and describes common techniques used in multi-objective GA to attain the threeA.Konak et al./Reliability Engineering and System Safety91(2006)992–1007 994goals in multi-objective optimization.This approach is also taken in the survey paper by Zitzler et al.[1].However,the discussion in this paper is aimed at introducing the components of multi-objective GA to researchers and practitioners without a background on the multi-objective GA.It is also import to note that although several of the state-of-the-art algorithms exist as cited above,many researchers that applied multi-objective GA to their problems have preferred to design their own customized algorithms by adapting strategies from various multi-objective GA.This observation is another motivation for introducing the components of multi-objective GA rather than focusing on several algorithms.However,the pseudo-code for some of the well-known multi-objective GA are also provided in order to demonstrate how these proce-dures are incorporated within a multi-objective GA.Table1A list of well-known multi-objective GAAlgorithm Fitness assignment Diversity mechanism Elitism ExternalpopulationAdvantages DisadvantagesVEGA[5]Each subpopulation isevaluated with respectto a differentobjective No No No First MOGAStraightforwardimplementationTend converge to theextreme of each objectiveMOGA[6]Pareto ranking Fitness sharing byniching No No Simple extension of singleobjective GAUsually slowconvergenceProblems related to nichesize parameterWBGA[8]Weighted average ofnormalized objectives Niching No No Simple extension of singleobjective GADifficulties in nonconvexobjective function space Predefined weightsNPGA[7]Nofitnessassignment,tournament selection Niche count as tie-breaker in tournamentselectionNo No Very simple selectionprocess with tournamentselectionProblems related to nichesize parameterExtra parameter fortournament selectionRWGA[9]Weighted average ofnormalized objectives Randomly assignedweightsYes Yes Efficient and easyimplementDifficulties in nonconvexobjective function spacePESA[14]Nofitness assignment Cell-based density Pure elitist Yes Easy to implement Performance depends oncell sizesComputationally efficientPrior information neededabout objective spacePAES[29]Pareto dominance isused to replace aparent if offspringdominates Cell-based density astie breaker betweenoffspring and parentYes Yes Random mutation hill-climbing strategyNot a population basedapproachEasy to implement Performance depends oncell sizesComputationally efficientNSGA[10]Ranking based onnon-dominationsorting Fitness sharing bynichingNo No Fast convergence Problems related to nichesize parameterNSGA-II[30]Ranking based onnon-dominationsorting Crowding distance Yes No Single parameter(N)Crowding distance worksin objective space onlyWell testedEfficientSPEA[11]Raking based on theexternal archive ofnon-dominatedsolutions Clustering to truncateexternal populationYes Yes Well tested Complex clusteringalgorithmNo parameter forclusteringSPEA-2[12]Strength ofdominators Density based on thek-th nearest neighborYes Yes Improved SPEA Computationallyexpensivefitness anddensity calculationMake sure extreme pointsare preservedRDGA[19]The problem reducedto bi-objectiveproblem with solutionrank and density asobjectives Forbidden region cell-based densityYes Yes Dynamic cell update More difficult toimplement than othersRobust with respect to thenumber of objectivesDMOEA[20]Cell-based ranking Adaptive cell-baseddensity Yes(implicitly)No Includes efficienttechniques to update celldensitiesMore difficult toimplement than othersAdaptive approaches toset GA parametersA.Konak et al./Reliability Engineering and System Safety91(2006)992–10079955.Design issues and components of multi-objective GA 5.1.Fitness functions5.1.1.Weighted sum approachesThe classical approach to solve a multi-objective optimization problem is to assign a weight w i to each normalized objective function z 0i ðx Þso that the problem is converted to a single objective problem with a scalar objective function as follows:min z ¼w 1z 01ðx Þþw 2z 02ðx ÞþÁÁÁþw k z 0k ðx Þ,(1)where z 0i ðx Þis the normalized objective function z i (x )and P w i ¼1.This approach is called the priori approach since the user is expected to provide the weights.Solving a problem with the objective function (1)for a given weight vector w ¼{w 1,w 2,y ,w k }yields a single solution,and if multiple solutions are desired,the problem must be solved multiple times with different weight combinations.The main difficulty with this approach is selecting a weight vector for each run.To automate this process;Hajela and Lin [8]proposed the WBGA for multi-objective optimization (WBGA-MO)in the WBGA-MO,each solution x i in the population uses a different weight vector w i ¼{w 1,w 2,y ,w k }in the calculation of the summed objective function (1).The weight vector w i is embedded within the chromosome of solution x i .Therefore,multiple solutions can be simulta-neously searched in a single run.In addition,weight vectors can be adjusted to promote diversity of the population.Other researchers [9,31]have proposed a MOGA based on a weighted sum of multiple objective functions where a normalized weight vector w i is randomly generated for each solution x i during the selection phase at each generation.This approach aims to stipulate multiple search directions in a single run without using additional parameters.The general procedure of the RWGA using random weights is given as follows [31]:Procedure RWGA:E ¼external archive to store non-dominated solutions found during the search so far;n E ¼number of elitist solutions immigrating from E to P in each generation.Step 1:Generate a random population.Step 2:Assign a fitness value to each solution x A P t by performing the following steps:Step 2.1:Generate a random number u k in [0,1]for each objective k ,k ¼1,y ,K.Step 2.2:Calculate the random weight of each objective k as w k ¼ð1=u k ÞP K i ¼1u i .Step 2.3:Calculate the fitness of the solution as f ðx Þ¼P K k ¼1w k z k ðx Þ.Step 3:Calculate the selection probability of each solutionx A P t as follows:p ðx Þ¼ðf ðx ÞÀf min ÞÀ1P y 2P t ðf ðy ÞÀf minÞwhere f min ¼min f f ðx Þj x 2P t g .Step 4:Select parents using the selection probabilities calculated in Step 3.Apply crossover on the selected parent pairs to create N offspring.Mutate offspring with a predefined mutation rate.Copy all offspring to P t +1.Update E if necessary.Step 5:Randomly remove n E solutions from P t +1and add the same number of solutions from E to P t +1.Step 6:If the stopping condition is not satisfied,set t ¼t þ1and go to Step 2.Otherwise,return to E .The main advantage of the weighted sum approach is a straightforward implementation.Since a single objective is used in fitness assignment,a single objective GA can be used with minimum modifications.In addition,this approach is computationally efficient.The main disadvan-tage of this approach is that not all Pareto-optimal solutions can be investigated when the true Pareto front is non-convex.Therefore,multi-objective GA based on the weighed sum approach have difficulty in finding solutions uniformly distributed over a non-convex trade-off surface [1].5.1.2.Altering objective functionsAs mentioned earlier,VEGA [5]is the first GA used to approximate the Pareto-optimal set by a set of non-dominated solutions.In VEGA,population P t is randomly divided into K equal sized sub-populations;P 1,P 2,y ,P K .Then,each solution in subpopulation P i is assigned a fitness value based on objective function z i .Solutions are selected from these subpopulations using proportional selection for crossover and mutation.Crossover and mutation are performed on the new population in the same way as for a single objective GA.Procedure VEGA:N S ¼subpopulation size (N S ¼N =K )Step 1:Start with a random initial population P 0.Set t ¼0.Step 2:If the stopping criterion is satisfied,return P t .Step 3:Randomly sort population P t .Step 4:For each objective k ,k ¼1,y K ,perform the following steps:Step 4.1:For i ¼1þðk 21ÞN S ;...;kN S ,assign fit-ness value f ðx i Þ¼z k ðx i Þto the i th solution in the sorted population.Step 4.2:Based on the fitness values assigned in Step 4.1,select N S solutions between the (1+(k À1)N S )th and (kN S )th solutions of the sorted population to create subpopulation P k .Step 5:Combine all subpopulations P 1,y ,P k and apply crossover and mutation on the combined population to create P t +1of size N .Set t ¼t þ1,go to Step 2.A similar approach to VEGA is to use only a single objective function which is randomly determined each time in the selection phase [32].The main advantage of the alternating objectives approach is easy to implement andA.Konak et al./Reliability Engineering and System Safety 91(2006)992–1007996computationally as efficient as a single-objective GA.In fact,this approach is a straightforward extension of a single objective GA to solve multi-objective problems.The major drawback of objective switching is that the popula-tion tends to converge to solutions which are superior in one objective,but poor at others.5.1.3.Pareto-ranking approachesPareto-ranking approaches explicitly utilize the concept of Pareto dominance in evaluatingfitness or assigning selection probability to solutions.The population is ranked according to a dominance rule,and then each solution is assigned afitness value based on its rank in the population, not its actual objective function value.Note that herein all objectives are assumed to be minimized.Therefore,a lower rank corresponds to a better solution in the following discussions.Thefirst Pareto ranking technique was proposed by Goldberg[3]as follows:Step1:Set i¼1and TP¼P.Step2:Identify non-dominated solutions in TP and assigned them set to F i.Step3:Set TP¼TPF i.If TP¼+go to Step4,else set i¼iþ1and go to Step2.Step4:For every solution x A P at generation t,assign rank r1ðx;tÞ¼i if x A F i.In the procedure above,F1,F2,y are called non-dominated fronts,and F1is the Pareto front of population P.NSGA[10]also classifies the population into non-dominated fronts using an algorithm similar to that given above.Then a dummyfitness value is assigned to each front using afitness sharing function such that the worst fitness value assigned to F i is better than the bestfitness value assigned to F i+1.NSGA-II[16],a more efficient algorithm,named the fast non-dominated-sort algorithm, was developed to form non-dominated fronts.Fonseca and Fleming[6]used a slightly different rank assignment approach than the ranking based on non-dominated-fronts as follows:r2ðx;tÞ¼1þnqðx;tÞ;(2) where nq(x,t)is the number of solutions dominating solution x at generation t.This ranking method penalizes solutions located in the regions of the objective function space which are dominated(covered)by densely populated sections of the Pareto front.For example,in Fig.1b solution i is dominated by solutions c,d and e.Therefore,it is assigned a rank of4although it is in the same front with solutions f,g and h which are dominated by only a single solution.SPEA[11]uses a ranking procedure to assign better fitness values to non-dominated solutions at underrepre-sented regions of the objective space.In SPEA,an external list E of afixed size stores non-dominated solutions that have been investigated thus far during the search.For each solution y A E,a strength value is defined assðy;tÞ¼npðy;tÞN Pþ1,where npðy;tÞis the number solutions that y dominates in P.The rank r(y,t)of a solution y A E is assigned as r3ðy;tÞ¼sðy;tÞand the rank of a solution x A P is calculated asr3ðx;tÞ¼1þXy2E;y1xsðy;tÞ.Fig.1c illustrates an example of the SPEA ranking method.In the former two methods,all non-dominated solutions are assigned a rank of1.This method,however, favors solution a(in thefigure)over the other non-dominated solutions since it covers the least number of solutions in the objective function space.Therefore,a wide, uniformly distributed set of non-dominated solutions is encouraged.Accumulated ranking density strategy[19]also aims to penalize redundancy in the population due to overrepre-sentation.This ranking method is given asr4ðx;tÞ¼1þXy2P;y1xrðy;tÞ.To calculate the rank of a solution x,the rank of the solutions dominating this solution must be calculatedfirst. Fig.1d shows an example of this ranking method(based on r2).Using ranking method r4,solutions i,l and n are ranked higher than their counterparts at the same non-dominated front since the portion of the trade-off surface covering them is crowded by three nearby solutions c,d and e. Although some of the ranking approaches described in this section can be used directly to assignfitness values to individual solutions,they are usually combined with variousfitness sharing techniques to achieve the second goal in multi-objective optimization,finding a diverse and uniform Pareto front.5.2.Diversity:fitness assignment,fitness sharing,and nichingMaintaining a diverse population is an important consideration in multi-objective GA to obtain solutions uniformly distributed over the Pareto front.Without taking preventive measures,the population tends to form relatively few clusters in multi-objective GA.This phenom-enon is called genetic drift,and several approaches have been devised to prevent genetic drift as follows.5.2.1.Fitness sharingFitness sharing encourages the search in unexplored sections of a Pareto front by artificially reducingfitness of solutions in densely populated areas.To achieve this goal, densely populated areas are identified and a penaltyA.Konak et al./Reliability Engineering and System Safety91(2006)992–1007997。

fanyi

A Petri Net-based Model for Web Service CompositionAbstractThe Internet is going through several major changes. It has become a vehicle of Web services rather than just a reposi-tory of information. Many organizations are putting their core business competencies on the Internet as a collection of Web services. An important challenge is to integrate them to cre-ate new value-added Web services in ways that could never be foreseen forming what is known as Business-to-Business(B2B) services. Therefore, there is a need for modeling techniques and tools for reliable Web service composition. In this paper, we propose a Petri net-based algebra, used to model control flows, as a necessary constituent of reliable Web service com-position process. This algebra is expressive enough to capture the semantics of complex Web service combinations.Keywords: Web services, Petri net, Web service com-position.1 IntroductionIn order to survive the massive competition created by the new online economy, many organizations are rushing to put their core business competencies on the Internet as a collection of Web services for more automation and global visibility. The concept of Web service has become recently very popular, however, there is no clear agreed upon definition yet. Typical examples of Web services include on-line travel reservations, procurement, customer relationship management(CRM), billing, accounting, and supply chain. In this paper, by Web service(or simply service)we mean an autonomous software application or component, i.e., a semantically well defined functionality, uniquely identified by a Uniform Resource Locator(URL).The ability to efficiently and effectively share services on the Web is a critical step towards the development of the new online economy driven by the Business-to-Business(B2B)e-commerce. Existing enterprises would form alliances and integrate their services to share costs, skills, and resources in offering a value-added service to form what is known as B2B services. Briefly stated, a B2B service is a conglomeration of mostly outsourced services working in tandem to achieve the business goals of the desired enterprise. An example of an integrated B2B service is a financial management system that uses payroll, tax preparation, and cash management as components. The component services might all be outsourced to business partners.To date, the development of B2B services has been largely ad-hoc, time-consuming, and requiring enormous effort of low-level programming. This task would obviously be tedious and hardly scalable because of the volatility and size of the Web. As services are most likely autonomous and heterogeneous, building a B2B service with appropriate inter-service coordination would be difficult. More importantly, the fast and dynamic composition of services is an essential requirement for organizations to adapt their business practices to the dynamic nature of the Web.As pointed out before, Internet and Web technologies have opened new ways of doing business more cheaply and efficiently. However, for B2B e-commerce to really take off, there is a need for effective and efficient means to abstract, compose, analyze, and evolve Web services in an appropriate time-frame. Ad-hoc and proprietary solutions on the one hand, and lack of a canonical model for modeling and managing Web services on the other hand, have largely hampered a faster pace in deploying B2B services. Current technologies based on Universal Description, Discovery, and Integration (UDDI)1,Web Service Description Language(WSDL),and Simple Object Access Protocol(SOAP) do not realize complex Web service combinations, henceproviding limited support in service composition. SOAP is a standard for exchanging XML-formatted messages over HTTP between applications. WSDL is a general purpose XML language for describing what a Web service does, where it resides, and how to invoke it. UDDI is a standard for publishing information about Web services in a global registry as well as for Web service discovery.In this paper, we propose a Petri net-based algebra for modeling Web services control flows. The model is expressive enough to capture the semantics of complex service combinations and their respective specificities. The obtained framework enables declarative composition of Web services. We show that the defined algebra caters for the creation of dynamic and transient relationships among services. The remainder of this paper is organized as follows. Web service modeling and specification using Petri nets are presented in Section 2.Section 3 is devoted to the algebra for composing Web services and its Petri net-based formal semantics. Section 4 discusses the analysis and verification of Web services. Section 5 gives a brief overview of related work. Finally, Section 6 provides some concluding remarks.2 Web Services as Petri NetsPetri nets (Petri 1962, Peterson 1981)are a well founded process modeling technique that have formal semantics. They have been used to model and analyze several types of processes including protocols, manufacturing systems, and business processes. Petri net is a directed, connected, and bipartite graph in which each node is either a place or a transition. Tokens occupy places. When there is at least one token in every place connected to a transition, we say that the transition is enabled. Any enabled transition may fire removing one token from every input place, and depositing one token in each output place. The use of visual modeling techniques such as Petri nets in the design of complex Web services is justified by many reasons. For example, visual representations provide a high-level yet precise language which allows to express and reason about concepts at their natural level of abstraction.A Web service behavior is basically a partially ordered set of operations. Therefore, it is straight-forward to map it into a Petri net. Operations are modeled by transitions and the state of the service is modeled by places. The arrows between places and transitions are used to specify causal relations.We can categorise Web services into material services, information services, and material/information services, the mixture of both. We assume that a Petri net, which represents the behavior of a service, contains one input place (i.e., a place with no incoming arcs) and one output place (i.e., a place with no outgoing arcs).A Petri net with one input place, for absorbing information, and one output place, for emitting information, will facilitate the definition of the composition operators and the analysis as well as the verification of certain properties. At any given time, a Web service can be in one of the following states: NotInstantiated , Ready, Running, Suspended, or Completed. When a Web service is in the Ready state, this means that a token is in its corresponding input place, whereas the Completed state means that there is a token in the corresponding output place.3 Composing Web ServicesA Web service has a specific task to perform and may depend on other Web services, hence being composite. For example , a company that is interested in selling books could focus on this aspect while outsourcing other aspects such as payment and shipment. The composition of two or more services generates a new service providing both the original individual behavioral logic anda new collaborative behavior for carrying out a new composite task. This means that existing services are able to cooperate although the cooperation was not designed in advance. Service composition could be static (service components interact with each other in a pre-negotiated manner) or dynamic (they discover each other and negotiate on the fly). In this section we present an algebra that allows the creation of new value-added Web services using existing ones as building blocks. Sequence, alternative, iteration, and arbitrary sequence are typical constructs specified in the control flow. More elaborate operators, dealt with in this paper, are parallel with communication, discriminator, selection, and refinement. We also give a formal semantics to the proposed algebra in terms of Petri nets as well as some nice algebraic properties.3.2 Formal SemanticsIn this section, we give a formal definition, in terms of Petri nets, of the composition operators. It is important to note that service composition, as will be described below, applies to syntactically different services. This is due to the fact that the places and transitions of the component services must be disjoint for proper composition. However, a service may be composed with itself. Typically, this situation occurs when services describe variants of the same operation (e.g., normal execution and exceptional situations) or, for instance, if a single supplier offers two different goods, the requests may be handled independently, as though they were from two different suppliers. In this case, the overlapping must be resolved prior to composition. This can be accomplished by renaming the sets P and T of one of the equal services. The two services remain equal up to isomorphism on the names of transitions and places. Note also that, in case of silent operations, we represent graphically the corresponding transitions as black rectangles.3.2.1 Basic ConstructsEmpty Service . The empty service is a service that performs no operation. It is used for technical and theoretical reasons.Sequence . The sequence operator allows the execution of two services S1 and S2 in sequence, that is, one after another.S1 must be completed before S2can start. This is typically the case when a service depends on the output of the previous service. For example, the service Payment is executed after the completion of the service Delivery.Alternative . The alternative operator permits, given two services S1 and S2,to model the execution of either S1 or S2,but not both. For instance, the assess_claim service is followed by either the service indemnify_customer or the service convoke_customer.Arbitrary Sequence. The arbitrary sequence operator specifies the execution of two services that must not be executed concurrently, that is, given two services S1 and S2,we have either S1 followed by S2 or S2 followed by S1.Suppose,for instance, that there are two goods, then acquiring a single good is useless unless the rest of the conjuncts can also be acquired. Moreover, without a deadline, there is no benefit by making the two requests in parallel, and doing so may lead to unnecessary costs if one of the conjuncts is unavailable or unobtainable. Therefore, the optimal execution is necessarily an arbitrary serial ordering of requests to suppliers.Iteration. The iteration operator models the execution of a service followed a certain number of times by itself. Typical examples where iteration is required are communication and quality control where services are executed more than once.3.2.2 Advanced ConstructsParallelism with Communication. The parallel operator represents the concurrent execution of two services. Concurrent services may synchronize and exchange information.Discriminator. Web services are unreliable; they have a relatively high probability of failing or of being unacceptably slow. Delays of only a few seconds could result in service providers losing significant sums of money or disappointing their customers. Different service providers may provide the same or similar services. Therefore, it should be possible to combine unreliable services to obtain more “reliable”services. The discriminator operator is used, for instance, to place redundant orders to different suppliers offering the same service to increase reliability. The first to perform the requested service triggers the subsequent service and all other late responses are ignored for the rest of the composite service process.Selection. Relying on a single supplier puts a company at its mercy. To reduce risk, a company should maintain relationships with multiple suppliers. These suppliers may, e.g., charge different prices, propose different delivery dates and times, and have different reliabilities. The selection construct allows to choose the best service provider, by using a ranking criteria, among several competing suppliers to outsource a particular operation.Refinement. The refinement construct, in which operations are replaced by more detailed non empty services, is used to introduce additional component services into a service. Refinement is the transformation of a design from a high level abstract form to a lower level more concrete form hence allowing hierarchical modeling.摘要互联网正经过几个大的变化。

知识图谱构建技术综述

中图法分类号 T P 1 8
修回日期 : - - - - 2 0 1 4 1 1 0 6; 2 0 1 5 0 4 0 8 收稿日期 : ) ; ; 国家 “ 八六三 ” 高技术研究发展计划基 金 项 目 ( 国家自然科学基金项目( 教 育 部 -中 国 移 动 2 0 1 1 AA 0 1 0 7 0 6 6 1 1 3 3 0 1 6, 6 1 2 7 2 5 2 7) 基金项目 : ) 科研基金项目 ( MCM 2 0 1 2 1 0 4 1 T h i s w o r k w a s s u o r t e d b t h e N a t i o n a l H i h T e c h n o l o R e s e a r c h a n d D e v e l o m e n t P r o r a m o f C h i n a( 8 6 3P r o r a m) p p y g g y p g g ( ) , ,a 2 0 1 1 AA 0 1 0 7 0 6 t h e N a t i o n a l N a t u r a l S c i e n c e F o u n d a t i o n o f C h i n a( 6 1 1 3 3 0 1 6, 6 1 2 7 2 5 2 7) n d M i n i s t r o f E d u c a t i o n - y ) C h i n a M o b l i e C o mm u n i c a t i o n s C o r o r a t i o n R e s e a r c h F u n d s( MCM 2 0 1 2 1 0 4 1 . p
在学术界清华大学建成了第1个大规模中英文跨语言知识图谱xlore中国科学院计算技术研究所基于开放知识网络openkn建立了人立方事立方知立方原型系统中国科学院数学与系统科学研究院陆汝钤院士提出知件knowware的概念上海交通大学构建并发布了中文知识图谱研究平台zhishime复旦大学gdm实验室推出的中文知识图谱项目等2这些项目的特点是知识库规模较大涵盖的知识领域较广泛并且能为用户提供一定的智能搜索及问答服务
  1. 1、下载文档前请自行甄别文档内容的完整性,平台不提供额外的编辑、内容补充、找答案等附加服务。
  2. 2、"仅部分预览"的文档,不可在线预览部分如存在完整性等问题,可反馈申请退款(可完整预览的文档不适用该条件!)。
  3. 3、如文档侵犯您的权益,请联系客服反馈,我们会尽快为您处理(人工客服工作时间:9:00-18:30)。

KWARESMI – Knowledge-based Web Automated Evaluation Toolwith Reconfigurable Guidelines Optimization

Abdo Beirekdar1,2, Jean Vanderdonckt2, Monique Noirhomme-Fraiture11Facultés Universitaires Notre-Dame de la Paix, Institut d’Informatique

Rue Grandgagnage, 21 – B-5000 Namur (Belgium){abe,mno}@info.fundp.ac.be2Université catholique de Louvain, BCHI

Place des Doyens, 1 – B-1348 Louvain-la-Neuve (Belgium){beirekdar,vanderdonckt}@isys.ucl.ac.be

AbstractKWARESMI (Knowledge-based Web Automated and Reconfigurable Evaluation with guidelineSoptiMIzation) tool is aimed for expressing, structuring, and organizing web usability guidelinestowards automated evaluation. Traditional tools transform natural statements of usabilityguidelines into lines of code in a tool that parses the HTML code of a web page and performsguidelines review. These tools are inflexible by nature: impossible to introduce a new guideline, tomodify an existing one, to select guidelines on demand before evaluation. Furthermore, there is nooptimization of how guidelines can be evaluated in an efficient way: all guidelines are tested on allelements, without factoring out common parts. KWARESMI attempts to address these shortcomings

by allowing evaluators to express guidelines in a higher level than simply HTML code and usingthem for automated usability evaluation on demand.

1 IntroductionUsability is today recognised as a major quality and success factor of web sites. A wide range ofusability evaluation techniques have been proposed and many of them are currently in use (Ivory& Hearst, 2001). They range from formal usability testing to informal usability tests conducted byusability specialists at usability labs or among real users.Automation of these techniques became much desired (Brajnik, 2000; Ivory & Hearst, 2001;Cooper, 1999) because they required usability specialists to conduct them or to analyse evaluationresults, which is very resource consuming especially for very large, continuously growing websites. In addition, there is a lack of usability and accessibility experts due to an increased demand.A possible solution consists of capturing the knowledge and experience of these experts andexpressing it in form of recommendations or guidelines to be reviewed and applied by designersand developers. Some studies show that applying guidelines by designers is subject tointerpretation, basically because of the inappropriate structuring or formulation (Scapin et al.,2000).For this reason and others, automation has been predominately used to objectively check guidelineconformance or review (Ivory & Hearst, 2001). Many automatic evaluation tools were developedto assist evaluators with guidelines review by automatically detecting and reporting ergonomicviolation and making suggestions for repairing them. Representative examples of these toolsinclude: A-Prompt (A-Prompt, 1999), LIFT (LIFT, 2003), Bobby (Cooper, 1999) and WebSat(Scholtz & Laskowski,, 1998). Some tools can be integrated with popular web design tools andmethods (LIFT, 2003). The most popular set of guidelines evaluated by most existing evaluationtools are the W3C Web content Accessibility Guidelines (http://www.w3c.org/TR/WC AG10) andSection508 guidelines (http://www. section508.gov).In this paper, we present a tool that overcomes major shortcomings of existing evaluation tools. Itenables evaluators to express the ergonomic body of knowledge provided by guidelines in termsof HTML elements (tags and attributes). Once coded, this knowledge can be evaluateddynamically at evaluation-time by configuring the guidelines expressions in an optimised waydepending on the guidelines to be evaluated and the elements contained in the page. This processconsequently considers guidelines relevant to the targeted evaluation context, and factors out sub-structures that are common across these guidelines, even if they come from different sets ofguidelines.This paper is structured as follows: section 2 gives detailed description of the tool. Section 3concludes the paper by underlying major potential advantages of the proposed tool.

2 The KWARESMI ToolOur tool tries to overcome major shortcomings of existing automatic evaluation tools due to hardcoding the evaluation logic inside their evaluation engine.

2.1 Tool RequirementsThe tool is supposed to meet the following requirements:A. Be knowledge-based: it exploits the ergonomic knowledge contained in ergonomicguidelines and re-expresses it in terms of HTML knowledge contained in the semantic ofHTML elements.B. Be Web-oriented: it works on HTML code of Web pages. At first step we target Webpages containing HTML only (no CSS, Scripts, etc.).C. Be automated: it should automate the maximum of tasks related to Web evaluationprocess, the main task being the evaluation itself.D. Be reconfigurable: the tool must enable evaluators to control the manipulation of both theguidelines structuring and the evaluation process.E. Enable guidelines optimization: the tool should identify potential common ergonomicinformation among different guidelines. This information should be used to optimizeevaluation of these guidelines.F. Support the GDL formal language: the development of KWARESMI was triggered by the

相关文档
最新文档