00488nas a2200133   4500008004100000245007200041210006900113260000900182300001200191490000700203100001400210700001200224856011800236       2017                        eng d00aA novel approach for regularization of convolutional neural network0 anovel approach for regularization of convolutional neural networ  c2017  a30 - 360 v151 aZhang, Y.1 aShi, B.  uhttps://www.scopus.com/inward/record.uri?eid=2-s2.0-85016461859&partnerID=40&md5=546e0229eda800292c211f2c58adf7b501530nas a2200217   4500008004100000245006500041210006300106260000900169300001400178490000700192520084900199653003401048653001501082653002601097653002301123100001401146700001201160700001101172700001201183856011701195       2013                        eng d00aModeling and simulation of DIGSILENT-based micro-grid system0 aModeling and simulation of DIGSILENTbased microgrid system  c2013  a342 - 3510 v113 aThe accurate modeling of micro-grid access to power system planning and design stage needs is the primary problem to solve. This paper modeled the micro grid photovoltaic power generation system, including silicon solar cell, photovoltaic inverters, battery energy storage system, and the micro power distribution system. In the use of power system analysis software (DIGSILENT) of actual power system simulation, the simulation results verify the model's correctness. In the power grid fault disturbance, the light intensity of disturbance and the load disturbances, the simulation results show that the optical storage combined with micro network has fast dynamic response characteristics, and its network of grid-connected voltage influenced by the changes of the light and load is little, while more affected by the network fault influence.10aBattery energy storage system10aMicro grid10aPhotovoltaic inverter10aSilicon solar cell1 aZhang, Y.1 aZhu, X.1 aLi, Q.1 aLiu, T.  uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-84890522361&partnerID=40&md5=6ae6926a5a8e9c87e46f14f7d564b0cc01557nas a2200193   4500008004100000245013800041210006900179260000900248300001400257490000700271520080600278653002201084653004101106653004701147653002501194100001301219700001401232856011701246       2013                        eng d00aParameters selection in the discrete particle swarm optimization algorithm solving gate and runway combinational optimization problem0 aParameters selection in the discrete particle swarm optimization  c2013  a197 - 2010 v113 aGate and runway combinational optimization (GRCO) problem is of great significance in airport operation. In this paper, experimental analysis is performed on the parameters characteristics of the discrete particle swarm optimization (DPSO) algorithm for combinatorial optimization problems. Inertia weight, acceleration constants and population size all have an important impact on the performance of the algorithm. Optimal values exist in the specific application of the respective parameters. The optimal value interval of the population size does not vary with different acceleration constants when inertia weight is constant. Increasing the population size can improve the solution quality, but the time overhead increases significantly. Finally, each parameters selection guidelines are provided.10aAirport operation10aDiscrete particle swarm optimization10aGate and runway combinational optimization10aParameters selection1 aDing, J.1 aZhang, Y.  uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-84880782704&partnerID=40&md5=b89c7c4e42430962155e9283216c7b7001405nas a2200229   4500008004100000245005400041210005300095260000900148300001400157490000700171520075600178653000800934653001000942653001400952653002000966653001000986653002200996100001201018700001401030700001401044856011701058       2013                        eng d00aRobust zero-watermarking algorithm for CAD models0 aRobust zerowatermarking algorithm for CAD models  c2013  a240 - 2430 v113 aCopyright protection and authentication of digital contents have become a significant issue in the current digital epoch with efficient communication mediums such as Internet. Digital watermarking technique is now one of the hot research fields of copyright protection for CAD graphic data under the network environment. But there are very limited techniques available for that because of its high shape-preserving demand. Zero-watermarking is such a good means to deal with it and it has lots of advantages such as high capacity, good robustness and various functions. In this paper, we will discuss zerowatermarking algorithm for CAD models and eventually propose a watermarking-based digital rights management system that would test our techniques.10aCAD10aChaos10aCopyright10aEmbedded design10aNURBS10aZero-watermarking1 aLiu, N.1 aZhang, S.1 aZhang, Y.  uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-84880814416&partnerID=40&md5=7e8682b26931ad23644dd6e4bbbd631802376nas a2200205   4500008004100000245008800041210006900129260000900198300001400207490000600221520168100227653002101908653002101929653002401950653003901974100001302013700001402026700001302040856011702053       2011                        eng d00aApplication-level solution for data integration in ubiquitous computing environment0 aApplicationlevel solution for data integration in ubiquitous com  c2011  a233 - 2410 v93 aThe Ubiquitous Computing envisions a world of communicating mobile devices and sensors. Advances in wireless communications raise users' expectations about the accessibility of information in Ubiquitous Computing environments. Getting meaningful information from disparate sensor nodes and/or mobile devices spread in Ubiquitous Computing environment is an urgent task. On the one hand, the heterogeneity of the sensor nodes makes share and finding data at the mobile devices and sink nodes much harder. On the other hand, nodes in Ubiquitous Computing environment are highly dynamic which means query planning in Ubiquitous Computing environment should be able to dynamically re-make their plan when the network conditions change due to intermittent connectivity. To address these two issues, this paper proposes a new service-oriented framework(called UCDS, standing for Ubiquitous Computing Data Services ) at application-level, which supports for semantic integration and querying of heterogeneous data sets distributed over the Ubiquitous Computing environment. We propose a RDF-View-based approach for mobile data mediation, and describe the service-composition-based query planning algorithm implemented in UCDS. We explore an ontology based approach to, mapping mobile data to data services (DS for short), publishing DS with the shared domain ontology. We also explore dynamically evolving service interface enabled by richly service description capability using the semantic web languages, and answering queries through DS composition. Experimental results show that the approach adopted by UCDS provides a better performance compared with the conventional approach.10aData integration10aQuery processing10aService composition10aUbiquitous Computing Data Services1 aZhou, L.1 aZhang, Y.1 aGuan, B.  uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-84855403966&partnerID=40&md5=c0fbe9d31dec46666f6361a5d9fb7a7201708nas a2200193   4500008004100000245009300041210006900134260000900203300001400212490000600226520105000232653002601282653001801308653001901326100001401345700001501359700002301374856011701397       2007                        eng d00aA comparative study on key phrase extraction methods in automatic Web Site Summarization0 acomparative study on key phrase extraction methods in automatic   c2007  a323 - 3320 v53 aWeb Site Summarization is the process of automatically generating a concise and informative summary for a given Web site. It has gained more and more attention in recent years as effective summarization could lead to enhanced Web information retrieval systems such as searching for Web sites. Extraction-based approaches to Web site summarization rely on the extraction of the most significant sentences from the target Web site based on the density of a list of key phrases that best describe the entire Web site. In this work, we benchmark five alternative key phrase extraction methods, TFIDF, KEA, Keyword, Keyterm, and Mixture, in an automatic Web site summarization framework we previously developed. We investigate the performance of these underlying methods via a formal user study and demonstrate that Keyterm is the best choice for key phrase extraction while Mixture should be used to obtain key sentences. We also discuss why one method performs better than another and what could be done to further improve the summarization system.10aKey phrase extraction10aWeb retrieval10aWeb site study1 aZhang, Y.1 aMilios, E.1 aZincir-Heywood, N.  uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-70350686085&partnerID=40&md5=1e62cb16df24be6167a1dbde14d4281c01884nas a2200205   4500008004100000245011000041210006900151260000900220300001400229490000600243520116900249653002601418653002301444653002601467653002601493100001401519700001601533700001201549856011701561       2007                        eng d00aUnsupervised learning aided by clustering and local-global hierarchical analysis in knowledge exploration0 aUnsupervised learning aided by clustering and localglobal hierar  c2007  a237 - 2460 v53 aUnsupervised learning plays an important role in the Knowlede exploration discovery. The basic task of unsupervised learning is to find latent variablesor relationships in a given dataset wihout any assumed regularities or patterns. In this paper we apply two advanced models, clustering analysis and hierarchial analysis to accomplish unsupervised learning. K-Means clustering presents its strength in large scale clustering. The original data can be pre-processed and the potential variables are targeted. Correlations among these variables are explored in the subsequent sets by Local Global Hierarchial Analysis (LGHA) assisted by three main steps. In the first step, we use a structural approach to find qualititative patterns from the given variables. Then, the second step applies a quantitative based algorithm to find quantitative patterns from those variables. The and last step generated global hybrid patterns by combining the local patterns obtained from the first two steps based on a certain criterion. Both of the K-Means and Local Global Hierarchial Analysis (LGHA) models are applied in experiments with real world longitutional medical datasets.10aHierarchical analysis10aK-means clustering10aKnowledge exploration10aUnsupervised learning1 aZhang, Y.1 aOrgun, M.A.1 aLin, W.  uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-44949188275&partnerID=40&md5=2448112a6f72451c391f1e75cc38eeed