[{"data":1,"prerenderedAt":19773},["ShallowReactive",2],{"publications-en":3},[4,58,84,122,151,193,230,263,297,315,340,364,392,417,437,466,494,518,542,569,588,619,640,674,703,732,761,782,821,846,878,900,940,968,997,1021,1046,1067,1089,1125,1152,1177,1200,1234,1256,1283,1309,1347,1366,1392,1423,3075,3108,3132,3158,3188,3215,3237,3274,3296,3319,3347,3370,3405,3430,3454,3482,3507,3534,3555,3581,3605,3623,3648,3678,3697,3726,3757,3780,3799,3832,3860,3889,3916,3940,3969,3995,4016,4042,4059,4081,4107,4133,4155,4185,4202,4227,4250,4280,4301,4325,4345,4372,4403,4425,4440,4466,4491,4528,4552,4572,4621,4657,4690,4714,4739,4764,4786,4816,4843,4867,4888,4908,4933,4955,4977,5003,5027,5044,5066,5087,5112,5139,5161,5194,5224,5244,5271,5294,5318,5340,5365,5400,5432,5459,5481,5504,5526,5563,5581,5605,5639,5661,5684,5704,5735,5759,5781,5810,5839,5867,5883,5909,5938,5957,5983,6010,6035,6064,6079,6104,6130,6159,6179,6207,6237,6261,6284,6308,6331,6355,6393,6425,6455,6477,6502,6526,6549,6581,6612,6645,6671,6696,6716,6743,6761,6786,6815,6843,6865,6888,6905,6937,6962,6992,7012,7029,7047,7072,7100,7124,7145,7171,7191,7215,7241,7272,7291,7342,7375,7403,7435,7461,7498,7523,7545,7562,7585,7611,7643,7666,7691,7714,7741,7767,7787,7808,7845,7877,7918,7944,7967,7990,8010,8034,8063,8087,8105,8127,8156,8182,8205,8290,8316,8343,8371,8400,8429,8458,8485,8501,8639,8665,8680,8702,8747,8766,8860,8885,8907,8924,8952,8979,9008,9042,9072,9099,9117,9139,9158,9178,9198,9222,9245,9266,9297,9329,9350,9381,9407,9440,9457,9497,9681,9701,9718,9747,9774,9796,9825,9855,9873,9890,9908,9943,9971,10000,10023,10056,10077,10104,10123,10139,10159,10183,10215,10240,10264,10290,10308,10329,10354,10379,10400,10448,10472,10497,10522,10542,10565,10587,10606,10638,10663,10679,10763,10779,10795,10826,10854,10873,10894,10926,10957,10984,11011,11031,11057,11080,11105,11130,11146,11348,11369,11391,11415,11448,11478,11503,11520,11545,11572,11599,11620,11645,11675,11694,11721,11748,11774,11795,11820,11844,11872,11891,11931,11952,11979,12007,12032,12061,12086,12116,12141,12164,12203,12224,12251,12275,12297,12329,12353,12373,12399,12480,12505,12530,12558,12585,12614,12646,12667,12687,12715,12741,12757,12780,12801,12823,12843,12871,12894,12917,12940,12956,12972,12996,13021,13038,13071,13092,13129,13152,13183,13210,13247,13272,13299,13323,13338,13359,13384,13419,13438,13477,13497,13514,13541,13563,13590,13610,13630,13654,13676,13696,13724,13746,13768,13794,13817,13837,13859,13881,13901,13926,13954,13978,13998,14032,14054,14075,14102,14203,14232,14255,14276,14308,14335,14357,14382,14398,14420,14440,14468,14490,14513,14536,14556,14573,14604,14626,14645,14663,14703,14727,14747,14769,14798,14822,14842,14873,14894,14914,14938,14961,14976,14996,15016,15054,15079,15103,15126,15150,15177,15232,15257,15274,15298,15320,15352,15372,15410,15431,15454,15480,15515,15530,15563,15588,15612,15643,15664,15686,15706,15721,15744,15777,15812,15830,15868,15893,15915,15932,15952,15973,15994,16014,16048,16076,16114,16131,16162,16190,16231,16273,16296,16324,16343,16370,16393,16437,16465,16480,16505,16525,16543,16564,16581,16601,16622,16647,16668,16691,16707,16742,16770,16794,16815,16837,16862,16890,16918,16946,16977,17005,17032,17057,17082,17108,17137,17161,17181,17211,17237,17264,17284,17317,17341,17374,17398,17422,17443,17465,17480,17497,17514,17530,17555,17576,17599,17628,17649,17671,17742,17765,17784,17806,17835,17858,17885,17907,17926,17946,17964,17986,18009,18041,18076,18106,18139,18155,18182,18205,18231,18264,18296,18323,18345,18371,18397,18433,18468,18491,18508,18535,18556,18578,18621,18650,18671,18692,18720,18737,18762,18779,18796,19104,19128,19153,19174,19583,19607,19624,19647,19674,19695,19730],{"_path":5,"_dir":6,"_draft":7,"_partial":7,"_locale":8,"title":9,"description":10,"_hidden":7,"authors":11,"authors_orcid":14,"year":17,"doi":18,"openalex_id":19,"venue":20,"abstract_screenshot":21,"keywords":22,"body":38,"_type":51,"_id":52,"_source":53,"_file":54,"_stem":55,"_extension":56,"locale":57},"\u002Fpublications\u002F2007\u002Fa-model-for-fresh-produce-shelf-space-allocation-and-inventory-management-with-f","2007",false,"","A Model for Fresh Produce Shelf-Space Allocation and Inventory Management with Freshness-Condition-Dependent Demand","Asignificant amount of work has investigated inventory control problems associated with fresh produce. Much of this work has considered deteriorating inventory control with many models having been proposed for various situations. However, no researchers have specifically studied fresh produce, which has its own special characteristics. Most research categorizes fresh produce into more general deteriorating categories with random lifetimes and nondecaying utilities. However, this classification is not reasonable or practical because the freshness of an item usually plays an important role in influencing the demand for the produce. In this paper, a single-period inventory and shelf-space allocation model is proposed for fresh produce. These items usually have a very short lifetime. The demand rate is assumed to be deterministic and dependent on both the displayed inventory (the number of facings of items on the shelves) and the items' freshness condition (which decreases over time). Several problem instances of different sizes are provided and solved by a modified generalized reduced gradient algorithm.",[12,13],"Bai, Ruibin","Kendall, Graham",[15,16],"0000-0003-1722-568X","0000-0003-2006-5103",2007,"https:\u002F\u002Fdoi.org\u002F10.1287\u002Fijoc.1070.0219","W2170968137","INFORMS journal on computing",null,[23,24,25,26,27,28,29,30,31,32,33,34,35,36,37],"Computer science","Operations research","Inventory management","Inventory control","Space (punctuation)","Work (physics)","Control (management)","Inventory theory","Mathematical optimization","Fresh food","Operations management","Mathematics","Shelf life","Economics","Artificial intelligence",{"type":39,"children":40,"toc":48},"root",[41],{"type":42,"tag":43,"props":44,"children":45},"element","p",{},[46],{"type":47,"value":10},"text",{"title":8,"searchDepth":49,"depth":49,"links":50},2,[],"markdown","content:publications:2007:a-model-for-fresh-produce-shelf-space-allocation-and-inventory-management-with-f.md","content","publications\u002F2007\u002Fa-model-for-fresh-produce-shelf-space-allocation-and-inventory-management-with-f.md","publications\u002F2007\u002Fa-model-for-fresh-produce-shelf-space-allocation-and-inventory-management-with-f","md","en",{"_path":59,"_dir":60,"_draft":7,"_partial":7,"_locale":8,"title":61,"description":8,"_hidden":7,"authors":62,"authors_orcid":68,"year":71,"doi":72,"openalex_id":73,"venue":74,"abstract_screenshot":21,"keywords":75,"body":77,"_type":51,"_id":81,"_source":53,"_file":82,"_stem":83,"_extension":56,"locale":57},"\u002Fpublications\u002F2008\u002Fkhai-thac-tac-djong-thap","2008","Khai Thác Tác Động Thấp",[63,64,65,66,67],"Pham, Ly","Tran, Hong Tai","Cao, Cong","Vu, Nam","Le, Duc",[21,69,70,21,21],"0000-0001-7261-9855","0000-0002-3407-7837",2008,"https:\u002F\u002Fdoi.org\u002F10.2139\u002Fssrn.2137548","W4238616413","SSRN Electronic Journal",[76,34],"Combinatorics",{"type":39,"children":78,"toc":79},[],{"title":8,"searchDepth":49,"depth":49,"links":80},[],"content:publications:2008:khai-thác-tác-động-thấp.md","publications\u002F2008\u002Fkhai-thác-tác-động-thấp.md","publications\u002F2008\u002Fkhai-thác-tác-động-thấp",{"_path":85,"_dir":86,"_draft":7,"_partial":7,"_locale":8,"title":87,"description":88,"_hidden":7,"authors":89,"authors_orcid":91,"year":93,"doi":94,"openalex_id":95,"venue":21,"abstract_screenshot":21,"keywords":96,"body":111,"_type":51,"_id":119,"_source":53,"_file":120,"_stem":121,"_extension":56,"locale":57},"\u002Fpublications\u002F2009\u002Fcanonical-representation-genetic-programming","2009","Canonical representation genetic programming","Search spaces sampled by the process of Genetic Programming often consist of programs which can represent a function in many different ways. Thus, when the space is examined it is highly likely that different programs may be tested which represent the same function, which is an undesirable waste of resources. It is argued that, if a search space can be constructed where only unique representations of a function are permitted, then this will be more successful than employing multiple representations. When the search space consists of canonical representations it is called a canonical search space, and when Genetic Programming is applied to this search space, it is called Canonical Representation Genetic Programming. The challenge lies in constructing these search spaces. With some function sets this is a trivial task, and with some function sets this is impossible to achieve. With other function sets it is not clear how the goal can be achieved. In this paper, we specically examine the search space dened by the function set f+;À; _; =g and the terminal set fx; 1g. Drawing inspiration from the fundamental theorem of arithmetic, and results regarding the fundamental theorem of algebra, we construct a representation where each function that can be constructed with this primitive set has a unique representation. Abbreviations: Genetic Programming (GP), Genetic Algorithm (GA) , The No Free Lunch Theorem (NFL) Keywords: canonical representation, standard form, evolutionary computation, genetic programming, no free lunch, bias, symmetric functions, inverse functions, complementary functions, isomorphic representations.",[90,12],"Woodward, John R.",[92,15],"0000-0002-2093-8990",2009,"https:\u002F\u002Fdoi.org\u002F10.1145\u002F1543834.1543914","W2137277908",[97,98,99,100,27,101,102,34,103,104,105,23,106,107,31,37,108,109,110],"Genetic programming","Genetic representation","Representation (politics)","Function (biology)","Set (abstract data type)","Theoretical computer science","Evolutionary programming","Answer set programming","Canonical form","Genetic algorithm","Algebra over a field","Pure mathematics","Logic programming","Programming language",{"type":39,"children":112,"toc":117},[113],{"type":42,"tag":43,"props":114,"children":115},{},[116],{"type":47,"value":88},{"title":8,"searchDepth":49,"depth":49,"links":118},[],"content:publications:2009:canonical-representation-genetic-programming.md","publications\u002F2009\u002Fcanonical-representation-genetic-programming.md","publications\u002F2009\u002Fcanonical-representation-genetic-programming",{"_path":123,"_dir":86,"_draft":7,"_partial":7,"_locale":8,"title":124,"description":125,"_hidden":7,"authors":126,"authors_orcid":127,"year":93,"doi":128,"openalex_id":129,"venue":21,"abstract_screenshot":21,"keywords":130,"body":140,"_type":51,"_id":148,"_source":53,"_file":149,"_stem":150,"_extension":56,"locale":57},"\u002Fpublications\u002F2009\u002Fwhy-evolution-is-not-a-good-paradigm-for-program-induction","Why evolution is not a good paradigm for program induction","We revisit the roots of Genetic Programming (i.e. Natural Evolution), and conclude that the mechanisms of the process of evolution (i.e. selection, inheritance and variation) are highly suited to the process; genetic code is an effective transmitter of information and crossover is an effective way to search through the viable combinations. Evolution is not without its limitations, which are pointed out, and it appears to be a highly effective problem solver; however we over-estimate the problem solving ability of evolution, as it is often trying to solve \"self-imposed\" survival problems. We are concerned with the evolution of Turing Equivalent programs (i.e. those with iteration and memory). Each of the mechanisms which make evolution work so well are examined from the perspective of program induction. Computer code is not as robust as genetic code, and therefore poorly suited to the process of evolution, resulting in a insurmountable landscape which cannot be navigated effectively with current syntax based genetic operators. Crossover, has problems being adopted in a computational setting, primarily due to a lack of context of exchanged code. A review of the literature reveals that evolved programs contain at most two nested loops, indicating that a glass ceiling to what can currently be accomplished.",[90,12],[92,15],"https:\u002F\u002Fdoi.org\u002F10.1145\u002F1543834.1543915","W2088668797",[23,131,132,97,98,133,102,134,135,136,137,110,37,138,139],"Crossover","Software evolution","Context (archaeology)","Selection (genetic algorithm)","Process (computing)","Inheritance (genetic algorithm)","Turing","Software development","Software",{"type":39,"children":141,"toc":146},[142],{"type":42,"tag":43,"props":143,"children":144},{},[145],{"type":47,"value":125},{"title":8,"searchDepth":49,"depth":49,"links":147},[],"content:publications:2009:why-evolution-is-not-a-good-paradigm-for-program-induction.md","publications\u002F2009\u002Fwhy-evolution-is-not-a-good-paradigm-for-program-induction.md","publications\u002F2009\u002Fwhy-evolution-is-not-a-good-paradigm-for-program-induction",{"_path":152,"_dir":153,"_draft":7,"_partial":7,"_locale":8,"title":154,"description":155,"_hidden":7,"authors":156,"authors_orcid":161,"year":166,"doi":167,"openalex_id":168,"venue":21,"abstract_screenshot":21,"keywords":169,"body":182,"_type":51,"_id":190,"_source":53,"_file":191,"_stem":192,"_extension":56,"locale":57},"\u002Fpublications\u002F2010\u002Fa-decision-support-approach-for-group-decision-making-under-risk-and-uncertainty","2010","A decision support approach for group decision making under risk and uncertainty","Cost-benefit analysis has long been used in decision making about public health and security. Frequently, risk and uncertainty are involved, and benefit and cost are not evenly shared by all stakeholders in the activities where public welfare is concerned. The result of cost-benefit analysis may be controversial because it does not consider the conflict of interest among the stakeholders. In this paper, we propose a decision support approach that allows individual agents to make their own evaluations of benefit, cost and risk over available alternatives. Individual beliefs with respect to the alternatives will then be aggregated to form a group decision. This approach can also be used to integrate the cost benefit analysis into risk assessment. An application to this group decision making, considering the disposal of dead animals, is given.",[157,13,158,159,160,12],"Li, Jiawei","Pollard, Simon","Soane, Emma","Davies, Gareth",[162,16,163,164,165,15],"0000-0003-4685-2615","0000-0001-8188-3324","0000-0001-6090-1212","0000-0001-6662-9299",2010,"https:\u002F\u002Fdoi.org\u002F10.1109\u002Ficlsim.2010.5461315","W2136987445",[170,171,172,173,174,23,175,176,177,24,178,36,179,180,181],"Risk analysis (engineering)","Cost–benefit analysis","Decision analysis","Actuarial science","Welfare","Decision support system","Risk assessment","Management science","Business","Engineering","Computer security","Data mining",{"type":39,"children":183,"toc":188},[184],{"type":42,"tag":43,"props":185,"children":186},{},[187],{"type":47,"value":155},{"title":8,"searchDepth":49,"depth":49,"links":189},[],"content:publications:2010:a-decision-support-approach-for-group-decision-making-under-risk-and-uncertainty.md","publications\u002F2010\u002Fa-decision-support-approach-for-group-decision-making-under-risk-and-uncertainty.md","publications\u002F2010\u002Fa-decision-support-approach-for-group-decision-making-under-risk-and-uncertainty",{"_path":194,"_dir":153,"_draft":7,"_partial":7,"_locale":8,"title":195,"description":196,"_hidden":7,"authors":197,"authors_orcid":201,"year":166,"doi":204,"openalex_id":205,"venue":206,"abstract_screenshot":21,"keywords":207,"body":219,"_type":51,"_id":227,"_source":53,"_file":228,"_stem":229,"_extension":56,"locale":57},"\u002Fpublications\u002F2010\u002Fa-hybrid-evolutionary-approach-to-the-nurse-rostering-problem","A Hybrid Evolutionary Approach to the Nurse Rostering Problem","Nurse rostering is an important search problem with many constraints. In the literature, a number of approaches have been investigated including penalty function methods to tackle these constraints within genetic algorithm frameworks. In this paper, we investigate an extension of a previously proposed stochastic ranking method, which has demonstrated superior performance to other constraint handling techniques when tested against a set of constrained optimization benchmark problems. An initial experiment on nurse rostering problems demonstrates that the stochastic ranking method is better at finding feasible solutions, but fails to obtain good results with regard to the objective function. To improve the performance of the algorithm, we hybridize it with a recently proposed simulated annealing hyper-heuristic (SAHH) within a local search and genetic algorithm framework. Computational results show that the hybrid algorithm performs better than both the genetic algorithm with stochastic ranking and the SAHH alone. The hybrid algorithm also outperforms the methods in the literature which have the previously best known results.",[12,198,13,199,200],"Burke, Edmund","Li, Jingpeng","McCollum, Barry",[15,202,16,203,21],"0000-0003-0712-4762","0000-0002-6758-0084","https:\u002F\u002Fdoi.org\u002F10.1109\u002Ftevc.2009.2033583","W2169641440","IEEE Transactions on Evolutionary Computation",[23,31,208,209,210,106,211,212,213,101,214,37,215,34,216,217,218],"Simulated annealing","Benchmark (surveying)","Ranking (information retrieval)","Local search (optimization)","Penalty method","Evolutionary algorithm","Hybrid algorithm (constraint satisfaction)","Machine learning","Constraint satisfaction","Constraint logic programming","Probabilistic logic",{"type":39,"children":220,"toc":225},[221],{"type":42,"tag":43,"props":222,"children":223},{},[224],{"type":47,"value":196},{"title":8,"searchDepth":49,"depth":49,"links":226},[],"content:publications:2010:a-hybrid-evolutionary-approach-to-the-nurse-rostering-problem.md","publications\u002F2010\u002Fa-hybrid-evolutionary-approach-to-the-nurse-rostering-problem.md","publications\u002F2010\u002Fa-hybrid-evolutionary-approach-to-the-nurse-rostering-problem",{"_path":231,"_dir":153,"_draft":7,"_partial":7,"_locale":8,"title":232,"description":233,"_hidden":7,"authors":234,"authors_orcid":235,"year":166,"doi":236,"openalex_id":237,"venue":21,"abstract_screenshot":21,"keywords":238,"body":252,"_type":51,"_id":260,"_source":53,"_file":261,"_stem":262,"_extension":56,"locale":57},"\u002Fpublications\u002F2010\u002Fan-efficient-guided-local-search-approach-for-service-network-design-problem-wit","An efficient guided local search approach for service network design problem with asset balancing","Service network design is a core problem for logistic transportation planning. It involves determination of the most cost-effective transportation network, package flow distribution as well as balanced vehicle schedules. In this paper, we propose an efficient guided local search approach metaheuristic for this problem, which is able to produce competitive results with much less computational time than those proposed in the literature.",[12,13,157],[15,16,162],"https:\u002F\u002Fdoi.org\u002F10.1109\u002Ficlsim.2010.5461456","W2085220248",[23,239,240,241,242,31,243,211,244,245,246,247,248,249,24,250,251,179,37,180,34],"Metaheuristic","Service (business)","Guided Local Search","Network planning and design","Flow network","Asset (computer security)","Core (optical fiber)","Iterated local search","Vehicle routing problem","Minimum-cost flow problem","Distributed computing","Routing (electronic design automation)","Computer network",{"type":39,"children":253,"toc":258},[254],{"type":42,"tag":43,"props":255,"children":256},{},[257],{"type":47,"value":233},{"title":8,"searchDepth":49,"depth":49,"links":259},[],"content:publications:2010:an-efficient-guided-local-search-approach-for-service-network-design-problem-wit.md","publications\u002F2010\u002Fan-efficient-guided-local-search-approach-for-service-network-design-problem-wit.md","publications\u002F2010\u002Fan-efficient-guided-local-search-approach-for-service-network-design-problem-wit",{"_path":264,"_dir":265,"_draft":7,"_partial":7,"_locale":8,"title":266,"description":8,"_hidden":7,"Transmission Channels authors":267,"authors_orcid":271,"year":275,"doi":276,"openalex_id":277,"venue":74,"abstract_screenshot":21,"keywords":278,"body":290,"_type":51,"_id":294,"_source":53,"_file":295,"_stem":296,"_extension":56,"locale":57},"\u002Fpublications\u002F2011\u002Fhow-did-exchange-rate-impact-china-s-asset-returns-the-structural-break-and-tran","2011","How Did Exchange Rate Impact China’s Asset Returns? The Structural Break and",[268,269,270],"Hua, Xiuping","Sun, Laixiang","Zhang, Yanbing",[272,273,274],"0000-0002-9989-7668","0000-0002-7784-7942","0000-0003-3682-4055",2011,"https:\u002F\u002Fdoi.org\u002F10.2139\u002Fssrn.1912939","W4254074826",[279,280,281,36,282,283,284,285,286,178,287,288,179,289],"Structural break","Exchange rate","Transmission channel","China","Financial economics","Break-Up","Monetary economics","Transmission (telecommunications)","Econometrics","Telecommunications","Geography",{"type":39,"children":291,"toc":292},[],{"title":8,"searchDepth":49,"depth":49,"links":293},[],"content:publications:2011:how-did-exchange-rate-impact-china-s-asset-returns-the-structural-break-and-tran.md","publications\u002F2011\u002Fhow-did-exchange-rate-impact-china-s-asset-returns-the-structural-break-and-tran.md","publications\u002F2011\u002Fhow-did-exchange-rate-impact-china-s-asset-returns-the-structural-break-and-tran",{"_path":298,"_dir":265,"_draft":7,"_partial":7,"_locale":8,"title":299,"description":8,"_hidden":7,"1999-2010\" authors":300,"authors_orcid":302,"year":275,"doi":304,"openalex_id":305,"venue":74,"abstract_screenshot":21,"keywords":306,"body":308,"_type":51,"_id":312,"_source":53,"_file":313,"_stem":314,"_extension":56,"locale":57},"\u002Fpublications\u002F2011\u002Fmonetary-policy-and-housing-prices-a-case-study-of-chinese-experience-in-1999-20","Monetary Policy and Housing Prices: A Case Study of Chinese Experience i",[270,268,301],"Liang, Zhao",[303,272,21],"0000-0002-5741-8104","https:\u002F\u002Fdoi.org\u002F10.2139\u002Fssrn.1914290","W1526474366",[307,36,285],"Monetary policy",{"type":39,"children":309,"toc":310},[],{"title":8,"searchDepth":49,"depth":49,"links":311},[],"content:publications:2011:monetary-policy-and-housing-prices-a-case-study-of-chinese-experience-in-1999-20.md","publications\u002F2011\u002Fmonetary-policy-and-housing-prices-a-case-study-of-chinese-experience-in-1999-20.md","publications\u002F2011\u002Fmonetary-policy-and-housing-prices-a-case-study-of-chinese-experience-in-1999-20",{"_path":316,"_dir":265,"_draft":7,"_partial":7,"_locale":8,"title":317,"description":8,"_hidden":7,"authors":318,"authors_orcid":321,"year":275,"doi":324,"openalex_id":325,"venue":326,"abstract_screenshot":21,"keywords":327,"body":333,"_type":51,"_id":337,"_source":53,"_file":338,"_stem":339,"_extension":56,"locale":57},"\u002Fpublications\u002F2011\u002Ftabu-assisted-guided-local-search-approaches-for-freight-service-network-design","Tabu assisted guided local search approaches for freight service network design",[12,13,319,320],"Qu, Rong","Atkin, Jason",[15,16,322,323],"0000-0001-8318-7509","0000-0002-7187-4982","https:\u002F\u002Fdoi.org\u002F10.1016\u002Fj.ins.2011.11.028","W2166050689","Information Sciences",[328,23,209,241,31,240,329,330,101,331,211,242,332,37,34],"Tabu search","Heuristic","Computation","Search algorithm","Algorithm",{"type":39,"children":334,"toc":335},[],{"title":8,"searchDepth":49,"depth":49,"links":336},[],"content:publications:2011:tabu-assisted-guided-local-search-approaches-for-freight-service-network-design.md","publications\u002F2011\u002Ftabu-assisted-guided-local-search-approaches-for-freight-service-network-design.md","publications\u002F2011\u002Ftabu-assisted-guided-local-search-approaches-for-freight-service-network-design",{"_path":341,"_dir":342,"_draft":7,"_partial":7,"_locale":8,"title":343,"description":8,"_hidden":7,"authors":344,"authors_orcid":346,"year":348,"doi":349,"openalex_id":350,"venue":351,"abstract_screenshot":21,"keywords":352,"body":357,"_type":51,"_id":361,"_source":53,"_file":362,"_stem":363,"_extension":56,"locale":57},"\u002Fpublications\u002F2012\u002Fa-new-model-and-a-hyper-heuristic-approach-for-two-dimensional-shelf-space-alloc","2012","A new model and a hyper-heuristic approach for two-dimensional shelf space allocation",[12,345,13,198],"Woensel, Tom Van",[15,347,16,202],"0000-0003-4766-2346",2012,"https:\u002F\u002Fdoi.org\u002F10.1007\u002Fs10288-012-0211-2","W2096122157","4OR",[208,353,31,329,23,354,355,356,332,34],"Robustness (evolution)","Dimension (graph theory)","Integer programming","Nonlinear system",{"type":39,"children":358,"toc":359},[],{"title":8,"searchDepth":49,"depth":49,"links":360},[],"content:publications:2012:a-new-model-and-a-hyper-heuristic-approach-for-two-dimensional-shelf-space-alloc.md","publications\u002F2012\u002Fa-new-model-and-a-hyper-heuristic-approach-for-two-dimensional-shelf-space-alloc.md","publications\u002F2012\u002Fa-new-model-and-a-hyper-heuristic-approach-for-two-dimensional-shelf-space-alloc",{"_path":365,"_dir":342,"_draft":7,"_partial":7,"_locale":8,"title":366,"description":367,"_hidden":7,"authors":368,"authors_orcid":370,"year":348,"doi":372,"openalex_id":373,"venue":374,"abstract_screenshot":21,"keywords":375,"body":381,"_type":51,"_id":389,"_source":53,"_file":390,"_stem":391,"_extension":56,"locale":57},"\u002Fpublications\u002F2012\u002Fevidence-and-belief-in-regulatory-decisions-incorporating-expected-utility-into","Evidence and belief in regulatory decisions – Incorporating expected utility into decision modelling","Recent changes in the assessment and management of risks has had the effect that greater importance has been placed on relationships between individuals and within groups to inform decision making. In this paper, we provide the theoretical underpinning for an expected utility approach to decision-making. The approach, which is presented using established evidence support logic (TESLA™), integrating the expected utilities in the forming of group decisions. The rationale and basis are described and illustrated through a hypothetical decision context of options for the disposal of animal carcasses that accumulate during disease outbreaks. The approach forms the basis for exploring the richness of risk-based decisions, and representing individual beliefs about the sufficiency of evidence they may advance in support of hypotheses.",[157,160,13,159,12,369,158],"Rocks, Sophie A.",[162,165,16,164,15,371,163],"0000-0002-4439-1299","https:\u002F\u002Fdoi.org\u002F10.1016\u002Fj.eswa.2012.01.193","W2140442648","Expert Systems with Applications",[376,133,377,172,170,23,175,177,378,379,176,24,178,37,36,34,179,380],"Underpinning","Expected utility hypothesis","Decision aids","Subjective expected utility","Medicine",{"type":39,"children":382,"toc":387},[383],{"type":42,"tag":43,"props":384,"children":385},{},[386],{"type":47,"value":367},{"title":8,"searchDepth":49,"depth":49,"links":388},[],"content:publications:2012:evidence-and-belief-in-regulatory-decisions-incorporating-expected-utility-into.md","publications\u002F2012\u002Fevidence-and-belief-in-regulatory-decisions-incorporating-expected-utility-into.md","publications\u002F2012\u002Fevidence-and-belief-in-regulatory-decisions-incorporating-expected-utility-into",{"_path":393,"_dir":342,"_draft":7,"_partial":7,"_locale":8,"title":394,"description":8,"_hidden":7,"1999–2010\" authors":395,"authors_orcid":397,"year":348,"doi":399,"openalex_id":400,"venue":401,"abstract_screenshot":21,"keywords":402,"body":410,"_type":51,"_id":414,"_source":53,"_file":415,"_stem":416,"_extension":56,"locale":57},"\u002Fpublications\u002F2012\u002Fexploring-determinants-of-housing-prices-a-case-study-of-chinese-experience-in-1","Exploring determinants of housing prices: A case study of Chinese experience i",[270,268,396],"Zhao, Liang",[303,272,398],"0000-0001-9690-6365","https:\u002F\u002Fdoi.org\u002F10.1016\u002Fj.econmod.2012.06.025","W2030109150","Economic Modelling",[36,287,280,403,404,405,406,407,408,409],"Vector autoregression","Real gross domestic product","Error correction model","Money supply","Macroeconomics","Interest rate","Cointegration",{"type":39,"children":411,"toc":412},[],{"title":8,"searchDepth":49,"depth":49,"links":413},[],"content:publications:2012:exploring-determinants-of-housing-prices-a-case-study-of-chinese-experience-in-1.md","publications\u002F2012\u002Fexploring-determinants-of-housing-prices-a-case-study-of-chinese-experience-in-1.md","publications\u002F2012\u002Fexploring-determinants-of-housing-prices-a-case-study-of-chinese-experience-in-1",{"_path":418,"_dir":342,"_draft":7,"_partial":7,"_locale":8,"title":419,"description":8,"_hidden":7,"A Unique Data Panel Study\"":21,"authors":420,"authors_orcid":422,"year":348,"doi":424,"openalex_id":425,"venue":74,"abstract_screenshot":21,"keywords":426,"body":430,"_type":51,"_id":434,"_source":53,"_file":435,"_stem":436,"_extension":56,"locale":57},"\u002Fpublications\u002F2012\u002Fthe-influence-of-fundamental-factors-on-chinese-residential-real-estate-prices-a","The Influence of Fundamental Factors on Chinese Residential Real Estate Prices",[268,269,421],"Borgia, Daniel",[272,273,423],"0000-0001-7755-3402","https:\u002F\u002Fdoi.org\u002F10.2139\u002Fssrn.2022682","W206733738",[427,428,178,287,36,429],"Panel data","Real estate","Finance",{"type":39,"children":431,"toc":432},[],{"title":8,"searchDepth":49,"depth":49,"links":433},[],"content:publications:2012:the-influence-of-fundamental-factors-on-chinese-residential-real-estate-prices-a.md","publications\u002F2012\u002Fthe-influence-of-fundamental-factors-on-chinese-residential-real-estate-prices-a.md","publications\u002F2012\u002Fthe-influence-of-fundamental-factors-on-chinese-residential-real-estate-prices-a",{"_path":438,"_dir":439,"_draft":7,"_partial":7,"_locale":8,"title":440,"description":441,"_hidden":7,"authors":442,"authors_orcid":443,"year":444,"doi":445,"openalex_id":446,"venue":447,"abstract_screenshot":21,"keywords":448,"body":455,"_type":51,"_id":463,"_source":53,"_file":464,"_stem":465,"_extension":56,"locale":57},"\u002Fpublications\u002F2013\u002Fa-novel-approach-to-independent-taxi-scheduling-problem-based-on-stable-matching","2013","A novel approach to independent taxi scheduling problem based on stable matching","This paper describes a taxi scheduling system, which aims to improve the overall efficiency of the system, both from the perspective of the drivers and the customers. This is of particular relevance to Chinese cities, where hailing a taxi on the street is by far the most common way in which taxis are requested, since the majority of taxi drivers operate independently, rather than working for a company. The mobile phone and Global Positioning System-based taxi scheduling system, which is described in this paper, aims to provide a decision support system for taxi drivers and facilitates direct information exchange between taxi drivers and passengers, while allowing drivers to remain independent. The taxi scheduling problem is considered to be a non-cooperative game between taxi drivers and a description of this problem is given. We adopt an efficient algorithm to discover a Nash equilibrium, such that each taxi driver and passenger cannot benefit from changing their assigned partner. Two computational examples are given to illustrate the effectiveness of the approach.",[12,157,320,13],[15,162,323,16],2013,"https:\u002F\u002Fdoi.org\u002F10.1057\u002Fjors.2013.96","W2074148772","Journal of the Operational Research Society",[449,23,450,24,451,452,453,454,33,179],"Taxis","Scheduling (production processes)","Mobile phone","Information exchange","Information system","Transport engineering",{"type":39,"children":456,"toc":461},[457],{"type":42,"tag":43,"props":458,"children":459},{},[460],{"type":47,"value":441},{"title":8,"searchDepth":49,"depth":49,"links":462},[],"content:publications:2013:a-novel-approach-to-independent-taxi-scheduling-problem-based-on-stable-matching.md","publications\u002F2013\u002Fa-novel-approach-to-independent-taxi-scheduling-problem-based-on-stable-matching.md","publications\u002F2013\u002Fa-novel-approach-to-independent-taxi-scheduling-problem-based-on-stable-matching",{"_path":467,"_dir":439,"_draft":7,"_partial":7,"_locale":8,"title":468,"description":469,"_hidden":7,"authors":470,"authors_orcid":472,"year":444,"doi":474,"openalex_id":475,"venue":447,"abstract_screenshot":21,"keywords":476,"body":483,"_type":51,"_id":491,"_source":53,"_file":492,"_stem":493,"_extension":56,"locale":57},"\u002Fpublications\u002F2013\u002Fa-path-oriented-encoding-evolutionary-algorithm-for-network-coding-resource-mini","A path-oriented encoding evolutionary algorithm for network coding resource minimization","Network coding is an emerging telecommunication technique, where any intermediate node is allowed to recombine incoming data if necessary. This technique helps to increase the throughput, however, very likely at the cost of huge amount of computational overhead, due to the packet recombination performed (ie coding operations). Hence, it is of practical importance to reduce coding operations while retaining the benefits that network coding brings to us. In this paper, we propose a novel evolutionary algorithm (EA) to minimize the amount of coding operations involved. Different from the state-of-the-art EAs which all use binary encodings for the problem, our EA is based on path-oriented encoding. In this new encoding scheme, each chromosome is represented by a union of paths originating from the source and terminating at one of the receivers. Employing path-oriented encoding leads to a search space where all solutions are feasible, which fundamentally facilitates more efficient search of EAs. Based on the new encoding, we develop three basic operators, that is, initialization, crossover and mutation. In addition, we design a local search operator to improve the solution quality and hence the performance of our EA. The simulation results demonstrate that our EA significantly outperforms the state-of-the-art algorithms in terms of global exploration and computational time.",[471,319,13,12],"Xing, Huanlai",[473,322,16,15],"0000-0002-6345-7265","https:\u002F\u002Fdoi.org\u002F10.1057\u002Fjors.2013.79","W1994691098",[23,477,478,479,480,131,332,481,213,482,31,102,34,251,37],"Linear network coding","Coding (social sciences)","Initialization","Encoding (memory)","Network packet","Decoding methods",{"type":39,"children":484,"toc":489},[485],{"type":42,"tag":43,"props":486,"children":487},{},[488],{"type":47,"value":469},{"title":8,"searchDepth":49,"depth":49,"links":490},[],"content:publications:2013:a-path-oriented-encoding-evolutionary-algorithm-for-network-coding-resource-mini.md","publications\u002F2013\u002Fa-path-oriented-encoding-evolutionary-algorithm-for-network-coding-resource-mini.md","publications\u002F2013\u002Fa-path-oriented-encoding-evolutionary-algorithm-for-network-coding-resource-mini",{"_path":495,"_dir":439,"_draft":7,"_partial":7,"_locale":8,"title":496,"description":497,"_hidden":7,"authors":498,"authors_orcid":501,"year":444,"doi":21,"openalex_id":503,"venue":21,"abstract_screenshot":21,"keywords":504,"body":507,"_type":51,"_id":515,"_source":53,"_file":516,"_stem":517,"_extension":56,"locale":57},"\u002Fpublications\u002F2013\u002Fa-study-of-node-based-large-neighbourhood-approaches-for-the-logistics-service-n","A Study of Node Based Large Neighbourhood Approaches for the Logistics Service Network Optimisation","The latest advances in clouding computing, big data and internet of things (IoT) have greatly transformed the operations and management of enterprise supply chains and logistics. They pro-vide a great opportunity to further optimise current supply chains and transportation networks. The service network design problem (SNDP) is generally considered as a fundamental problem in transportation logistics. It involves the determination of an efficient transportation network and the scheduling details of the corresponding services. The problem is extremely challenging due to the complexity of the constraints and the scale of real-world applications. Therefore, efficient solution methods for this problem are one of the most important research issues in this field. However, current research has mainly focused on various sophisticated high-level search strategies in the form of different local search metaheuristics and their hybrids. Little attention has been paid to novel neighbourhood structures which also play a crucial role in the performance of the algorithm. In this research, we propose a new efficient neighbourhood structure that uses the SNDP constraints to its advantage and more importantly appears to have better reachability than the current ones. The effectiveness of this new neighbourhood is evaluated in",[12,499,500,90],"Hong-hua, Gan","Bei, Yijun",[15,21,502,92],"0000-0001-5720-6374","W2187421153",[328,239,23,505,506,31,24,37,34],"Neighbourhood (mathematics)","Heuristics",{"type":39,"children":508,"toc":513},[509],{"type":42,"tag":43,"props":510,"children":511},{},[512],{"type":47,"value":497},{"title":8,"searchDepth":49,"depth":49,"links":514},[],"content:publications:2013:a-study-of-node-based-large-neighbourhood-approaches-for-the-logistics-service-n.md","publications\u002F2013\u002Fa-study-of-node-based-large-neighbourhood-approaches-for-the-logistics-service-n.md","publications\u002F2013\u002Fa-study-of-node-based-large-neighbourhood-approaches-for-the-logistics-service-n",{"_path":519,"_dir":439,"_draft":7,"_partial":7,"_locale":8,"title":520,"description":521,"_hidden":7,"authors":522,"authors_orcid":524,"year":444,"doi":526,"openalex_id":527,"venue":21,"abstract_screenshot":21,"keywords":528,"body":531,"_type":51,"_id":539,"_source":53,"_file":540,"_stem":541,"_extension":56,"locale":57},"\u002Fpublications\u002F2013\u002Fa-task-based-approach-for-a-real-world-commodity-routing-problem","A task based approach for a real-world commodity routing problem","In this paper, a real world short-haul commodity routing problem is presented. This problem shares several similarities with vehicle routing problem with time windows (VRPTW) and the service network design problem (SNDP), but also has its own specific structures that do not exist in VRPTW or SNDP. A task based formulation is developed for this problem and a variable neighbourhood search metaheuristic approach is proposed, resulting in a visible improvement over the original routing plans according to experimental tests over three real-life instances. Apart from introducing a new real-world commodity routing problem, another main contribution of this paper is a task based formulation that allows commodity flows being considered as nodes in a routing network. Thus algorithms that were designed for VRPTW or SDVRP can also possibly be adapted to solve this commodity flow problem.",[523,12,319,13],"Chen, Jianjun",[525,15,322,16],"0000-0003-0206-3294","https:\u002F\u002Fdoi.org\u002F10.1109\u002Fcipls.2013.6595193","W2074633338",[247,23,250,529,530,239,31,37,251,34,179,36],"Task (project management)","Commodity",{"type":39,"children":532,"toc":537},[533],{"type":42,"tag":43,"props":534,"children":535},{},[536],{"type":47,"value":521},{"title":8,"searchDepth":49,"depth":49,"links":538},[],"content:publications:2013:a-task-based-approach-for-a-real-world-commodity-routing-problem.md","publications\u002F2013\u002Fa-task-based-approach-for-a-real-world-commodity-routing-problem.md","publications\u002F2013\u002Fa-task-based-approach-for-a-real-world-commodity-routing-problem",{"_path":543,"_dir":439,"_draft":7,"_partial":7,"_locale":8,"title":544,"description":545,"_hidden":7,"authors":546,"authors_orcid":549,"year":444,"doi":551,"openalex_id":552,"venue":553,"abstract_screenshot":21,"keywords":554,"body":558,"_type":51,"_id":566,"_source":53,"_file":567,"_stem":568,"_extension":56,"locale":57},"\u002Fpublications\u002F2013\u002Fare-chinese-stock-and-property-markets-integrated-or-segmented","Are Chinese stock and property markets integrated or segmented?","This paper explores the empirical question of whether Chinese stock and property markets are integrated or segmented. We find that, at the national level, investment returns in property and the A-share markets were co-integrated in the long run. In the short run, property price Granger caused A-share prices, but not vice versa. However, the B-share prices were negatively correlated with property prices. Furthermore, the linkage between city-level property prices and stock prices showed significant variations across the country. These findings reveal that property and stock markets were integrated at the national level but the property markets were reasonably segmented among cities. They suggest that investment portfolios pursuing risk diversification should include both A and B shares and properties from different cities.",[547,268,548],"Adcock, Chris","Huang, Yiping",[21,272,550],"0000-0003-3078-5892","https:\u002F\u002Fdoi.org\u002F10.1080\u002F1351847x.2013.788537","W1980226427","European Journal of Finance",[555,556,285,283,557,178,36,289],"Stock (firearms)","Diversification (marketing strategy)","Property (philosophy)",{"type":39,"children":559,"toc":564},[560],{"type":42,"tag":43,"props":561,"children":562},{},[563],{"type":47,"value":545},{"title":8,"searchDepth":49,"depth":49,"links":565},[],"content:publications:2013:are-chinese-stock-and-property-markets-integrated-or-segmented.md","publications\u002F2013\u002Fare-chinese-stock-and-property-markets-integrated-or-segmented.md","publications\u002F2013\u002Fare-chinese-stock-and-property-markets-integrated-or-segmented",{"_path":570,"_dir":439,"_draft":7,"_partial":7,"_locale":8,"title":571,"description":8,"_hidden":7,"China\" authors":572,"authors_orcid":575,"year":444,"doi":578,"openalex_id":579,"venue":74,"abstract_screenshot":21,"keywords":580,"body":581,"_type":51,"_id":585,"_source":53,"_file":586,"_stem":587,"_extension":56,"locale":57},"\u002Fpublications\u002F2013\u002Fexchange-rate-risk-transmission-channels-and-asset-returns-evidence-from-china","Exchange Rate Risk, Transmission Channels, and Asset Returns: Evidence fro",[268,573,574],"Huang, Wei","Jiang, Ying",[272,576,577],"0000-0003-1899-9281","0000-0002-1214-6598","https:\u002F\u002Fdoi.org\u002F10.2139\u002Fssrn.2311617","W3003761514",[282,280,178,285,283,36,289],{"type":39,"children":582,"toc":583},[],{"title":8,"searchDepth":49,"depth":49,"links":584},[],"content:publications:2013:exchange-rate-risk-transmission-channels-and-asset-returns-evidence-from-china.md","publications\u002F2013\u002Fexchange-rate-risk-transmission-channels-and-asset-returns-evidence-from-china.md","publications\u002F2013\u002Fexchange-rate-risk-transmission-channels-and-asset-returns-evidence-from-china",{"_path":589,"_dir":439,"_draft":7,"_partial":7,"_locale":8,"title":590,"description":591,"_hidden":7,"authors":592,"authors_orcid":597,"year":444,"doi":601,"openalex_id":602,"venue":603,"abstract_screenshot":21,"keywords":604,"body":608,"_type":51,"_id":616,"_source":53,"_file":617,"_stem":618,"_extension":56,"locale":57},"\u002Fpublications\u002F2013\u002Fhow-effectively-does-metamorphic-testing-alleviate-the-oracle-problem","How Effectively Does Metamorphic Testing Alleviate the Oracle Problem?","In software testing, something which can verify the correctness of test case execution results is called an oracle. The oracle problem occurs when either an oracle does not exist, or exists but is too expensive to be used. Metamorphic testing is a testing approach which uses metamorphic relations, properties of the software under test represented in the form of relations among inputs and outputs of multiple executions, to help verify the correctness of a program. This paper presents new empirical evidence to support this approach, which has been used to alleviate the oracle problem in various applications and to enhance several software analysis and testing techniques. It has been observed that identification of a sufficient number of appropriate metamorphic relations for testing, even by inexperienced testers, was possible with a very small amount of training. Furthermore, the cost-effectiveness of the approach could be enhanced through the use of more diverse metamorphic relations. The empirical studies presented in this paper clearly show that a small number of diverse metamorphic relations, even those identified in an ad hoc manner, had a similar fault-detection capability to a test oracle, and could thus effectively help alleviate the oracle problem.",[593,594,595,596],"Liu, Huai","Kuo, Fei‐Ching","Towey, Dave","Chen, Tsong Yueh",[598,21,599,600],"0000-0003-3125-4399","0000-0003-0877-4353","0000-0003-3578-0994","https:\u002F\u002Fdoi.org\u002F10.1109\u002Ftse.2013.46","W2162036145","IEEE Transactions on Software Engineering",[23,605,606,110,607,139],"Oracle","Software testing","Software engineering",{"type":39,"children":609,"toc":614},[610],{"type":42,"tag":43,"props":611,"children":612},{},[613],{"type":47,"value":591},{"title":8,"searchDepth":49,"depth":49,"links":615},[],"content:publications:2013:how-effectively-does-metamorphic-testing-alleviate-the-oracle-problem.md","publications\u002F2013\u002Fhow-effectively-does-metamorphic-testing-alleviate-the-oracle-problem.md","publications\u002F2013\u002Fhow-effectively-does-metamorphic-testing-alleviate-the-oracle-problem",{"_path":620,"_dir":439,"_draft":7,"_partial":7,"_locale":8,"title":621,"description":8,"_hidden":7,"authors":622,"authors_orcid":624,"year":444,"doi":626,"openalex_id":627,"venue":374,"abstract_screenshot":21,"keywords":628,"body":633,"_type":51,"_id":637,"_source":53,"_file":638,"_stem":639,"_extension":56,"locale":57},"\u002Fpublications\u002F2013\u002Fpredicting-open-ios-adoption-in-smes-an-integrated-sem-neural-network-approach","Predicting open IOS adoption in SMEs: An integrated SEM-neural network approach",[623,12],"Chong, Alain Yee‐Loong",[625,15],"0000-0002-0881-1612","https:\u002F\u002Fdoi.org\u002F10.1016\u002Fj.eswa.2013.07.023","W2011401412",[629,630,631,23,632,178,37,215],"Knowledge management","Structural equation modeling","Knowledge sharing","Artificial neural network",{"type":39,"children":634,"toc":635},[],{"title":8,"searchDepth":49,"depth":49,"links":636},[],"content:publications:2013:predicting-open-ios-adoption-in-smes-an-integrated-sem-neural-network-approach.md","publications\u002F2013\u002Fpredicting-open-ios-adoption-in-smes-an-integrated-sem-neural-network-approach.md","publications\u002F2013\u002Fpredicting-open-ios-adoption-in-smes-an-integrated-sem-neural-network-approach",{"_path":641,"_dir":439,"_draft":7,"_partial":7,"_locale":8,"title":642,"description":643,"_hidden":7,"authors":644,"authors_orcid":649,"year":444,"doi":652,"openalex_id":653,"venue":654,"abstract_screenshot":21,"keywords":655,"body":663,"_type":51,"_id":671,"_source":53,"_file":672,"_stem":673,"_extension":56,"locale":57},"\u002Fpublications\u002F2013\u002Fprioritization-of-combinatorial-test-cases-by-incremental-interaction-coverage","PRIORITIZATION OF COMBINATORIAL TEST CASES BY INCREMENTAL INTERACTION COVERAGE","Combinatorial interaction testing is a well-recognized testing method, and has been widely applied in practice, often with the assumption that all test cases in a combinatorial test suite have the same fault detection capability. However, when testing resources are limited, an alternative assumption may be that some test cases are more likely to reveal failure, thus making the order of executing the test cases critical. To improve testing cost-effectiveness, prioritization of combinatorial test cases is employed. The most popular approach is based on interaction coverage, which prioritizes combinatorial test cases by repeatedly choosing an unexecuted test case that covers the largest number of uncovered parameter value combinations of a given strength (level of interaction among parameters). However, this approach suffers from some drawbacks. Based on previous observations that the majority of faults in practical systems can usually be triggered with parameter interactions of small strengths, we propose a new strategy of prioritizing combinatorial test cases by incrementally adjusting the strength values. Experimental results show that our method performs better than the random prioritization technique and the technique of prioritizing combinatorial test suites according to test case generation order, and has better performance than the interaction-coverage-based test prioritization technique in most cases.",[645,646,595,596,647,648],"Huang, Rubing","Xie, Xiaodong","Lu, Yansheng","Chen, Jinfu",[650,21,599,600,21,651],"0000-0002-1769-6126","0000-0002-3124-5452","https:\u002F\u002Fdoi.org\u002F10.1142\u002Fs0218194013500459","W2037169161","International Journal of Software Engineering and Knowledge Engineering",[656,23,657,658,659,660,661,662,215,34,179,139],"Prioritization","Test suite","Test case","Test (biology)","Combinatorial design","Reliability engineering","Test strategy",{"type":39,"children":664,"toc":669},[665],{"type":42,"tag":43,"props":666,"children":667},{},[668],{"type":47,"value":643},{"title":8,"searchDepth":49,"depth":49,"links":670},[],"content:publications:2013:prioritization-of-combinatorial-test-cases-by-incremental-interaction-coverage.md","publications\u002F2013\u002Fprioritization-of-combinatorial-test-cases-by-incremental-interaction-coverage.md","publications\u002F2013\u002Fprioritization-of-combinatorial-test-cases-by-incremental-interaction-coverage",{"_path":675,"_dir":439,"_draft":7,"_partial":7,"_locale":8,"title":676,"description":8,"_hidden":7,"authors":677,"authors_orcid":681,"year":444,"doi":685,"openalex_id":686,"venue":687,"abstract_screenshot":21,"keywords":688,"body":696,"_type":51,"_id":700,"_source":53,"_file":701,"_stem":702,"_extension":56,"locale":57},"\u002Fpublications\u002F2013\u002Fswarm-intelligence-in-big-data-analytics","Swarm Intelligence in Big Data Analytics",[678,679,680,12],"Cheng, Shi","Shi, Yuhui","Qin, Quande",[682,683,684,15],"0000-0002-5129-995X","0000-0002-8840-723X","0000-0003-0943-9151","https:\u002F\u002Fdoi.org\u002F10.1007\u002F978-3-642-41278-3_51","W1092618484","Lecture notes in computer science",[689,23,690,691,692,693,694,181,695,215],"Big data","Analytics","Data science","Data analysis","Swarm intelligence","Business intelligence","Particle swarm optimization",{"type":39,"children":697,"toc":698},[],{"title":8,"searchDepth":49,"depth":49,"links":699},[],"content:publications:2013:swarm-intelligence-in-big-data-analytics.md","publications\u002F2013\u002Fswarm-intelligence-in-big-data-analytics.md","publications\u002F2013\u002Fswarm-intelligence-in-big-data-analytics",{"_path":704,"_dir":705,"_draft":7,"_partial":7,"_locale":8,"title":706,"description":707,"_hidden":7,"authors":708,"authors_orcid":710,"year":712,"doi":713,"openalex_id":714,"venue":21,"abstract_screenshot":21,"keywords":715,"body":721,"_type":51,"_id":729,"_source":53,"_file":730,"_stem":731,"_extension":56,"locale":57},"\u002Fpublications\u002F2014\u002Fa-combinatorial-algorithm-for-the-cardinality-constrained-portfolio-optimization","2014","A combinatorial algorithm for the cardinality constrained portfolio optimization problem","Portfolio optimization is an important problem based on the modern portfolio theory (MPT) in the finance field. The idea is to maximize the portfolio expected return as well as minimizing portfolio risk at the same time. In this work, we propose a combinatorial algorithm for the portfolio optimization problem with the cardinality and bounding constraints. The proposed algorithm hybridizes a metaheuristic approach (particle swarm optimization, PSO) and a mathematical programming method where PSO is used to deal with the cardinality constraints and the math programming method is used to deal with the rest of the model. Computational results are given for the benchmark datasets from the OR-library and they indicate that it is a useful strategy for this problem. We also present the solutions obtained by the CPLEX mixed integer program solver for these instances and they can be used as the criteria for the comparison of algorithms for the same problem in the future.",[709,678,12],"Cui, Tianxiang",[711,682,15],"0000-0002-0102-2581",2014,"https:\u002F\u002Fdoi.org\u002F10.1109\u002Fcec.2014.6900357","W2069651500",[31,716,717,23,239,718,719,695,720,355,332,34,429],"Cardinality (data modeling)","Solver","Portfolio","Portfolio optimization","Optimization problem",{"type":39,"children":722,"toc":727},[723],{"type":42,"tag":43,"props":724,"children":725},{},[726],{"type":47,"value":707},{"title":8,"searchDepth":49,"depth":49,"links":728},[],"content:publications:2014:a-combinatorial-algorithm-for-the-cardinality-constrained-portfolio-optimization.md","publications\u002F2014\u002Fa-combinatorial-algorithm-for-the-cardinality-constrained-portfolio-optimization.md","publications\u002F2014\u002Fa-combinatorial-algorithm-for-the-cardinality-constrained-portfolio-optimization",{"_path":733,"_dir":705,"_draft":7,"_partial":7,"_locale":8,"title":734,"description":8,"_hidden":7,"authors":735,"authors_orcid":738,"year":712,"doi":739,"openalex_id":740,"venue":741,"abstract_screenshot":21,"keywords":742,"body":754,"_type":51,"_id":758,"_source":53,"_file":759,"_stem":760,"_extension":56,"locale":57},"\u002Fpublications\u002F2014\u002Fa-strategic-approach-to-improve-sustainability-in-transportation-service-procure","A strategic approach to improve sustainability in transportation service procurement",[736,12,737],"Basu, R. Jothi","Palaniappan, PL.K.",[21,15,21],"https:\u002F\u002Fdoi.org\u002F10.1016\u002Fj.tre.2014.10.015","W2080842156","Transportation Research Part E Logistics and Transportation Review",[743,744,745,746,329,240,23,178,747,748,749,24,750,454,179,751,752,753,36,34],"Bidding","Procurement","Sustainability","Truck","Quality (philosophy)","Reduction (mathematics)","Sample (material)","Environmental economics","Marketing","Automotive engineering","Chemistry",{"type":39,"children":755,"toc":756},[],{"title":8,"searchDepth":49,"depth":49,"links":757},[],"content:publications:2014:a-strategic-approach-to-improve-sustainability-in-transportation-service-procure.md","publications\u002F2014\u002Fa-strategic-approach-to-improve-sustainability-in-transportation-service-procure.md","publications\u002F2014\u002Fa-strategic-approach-to-improve-sustainability-in-transportation-service-procure",{"_path":762,"_dir":705,"_draft":7,"_partial":7,"_locale":8,"title":763,"description":8,"_hidden":7,"authors":764,"authors_orcid":766,"year":712,"doi":768,"openalex_id":769,"venue":770,"abstract_screenshot":21,"keywords":771,"body":775,"_type":51,"_id":779,"_source":53,"_file":780,"_stem":781,"_extension":56,"locale":57},"\u002Fpublications\u002F2014\u002Faggregate-strength-interaction-test-suite-prioritization","Aggregate-strength interaction test suite prioritization",[645,648,595,765,647],"Chan, Alvin",[650,651,599,767,21],"0000-0003-1196-4879","https:\u002F\u002Fdoi.org\u002F10.1016\u002Fj.jss.2014.09.002","W2061211595","Journal of Systems and Software",[657,656,23,772,773,658,659,661,774,215,179,607],"Aggregate (composite)","Suite","Test data",{"type":39,"children":776,"toc":777},[],{"title":8,"searchDepth":49,"depth":49,"links":778},[],"content:publications:2014:aggregate-strength-interaction-test-suite-prioritization.md","publications\u002F2014\u002Faggregate-strength-interaction-test-suite-prioritization.md","publications\u002F2014\u002Faggregate-strength-interaction-test-suite-prioritization",{"_path":783,"_dir":705,"_draft":7,"_partial":7,"_locale":8,"title":784,"description":785,"_hidden":7,"rate movements authors":786,"authors_orcid":789,"year":712,"doi":791,"openalex_id":792,"venue":553,"abstract_screenshot":21,"keywords":793,"body":801,"_type":51,"_id":818,"_source":53,"_file":819,"_stem":820,"_extension":56,"locale":57},"\u002Fpublications\u002F2014\u002Fderivative-activities-and-chinese-banks-exposures-to-exchange-rate-and-interest","Derivative activities and Chinese banks’ exposures to exchange rate and interest","This study investigates the impact of Chinese banks’ derivative activities on their exposure to exchange rate and interest rate changes. The standard Jorion 1990. “The Exchange-Rate Exposure of U.S. Multinationals.” Journal of Business 63 (3): 331–345 model provides weak evidence of Chinese banks’ exposure to these risks. However, the exposure increases substantially when time-varying exposure regressions with orthogonalised market returns are used. We also show that Chinese banks exhibit linear and nonlinear exposures to the exchange rate and interest rate fluctuations. Further analysis indicates that the use of derivatives reduces banks’ foreign exchange risk, but does not affect their interest rate exposure. Derivative products are more likely to be used as an integrated part of the Chinese banks’ risk management systems, which could thus help to stabilise the banking system.",[547,268,787,788],"Mazouz, Khelifa","Yin, Shuxing",[21,272,21,790],"0000-0002-2564-4414","https:\u002F\u002Fdoi.org\u002F10.1080\u002F1351847x.2014.899260","W1981722919",[794,280,795,408,285,796,797,798,799,178,36,800,287,283],"Derivative (finance)","Interest rate derivative","Derivatives market","Interest rate risk","Interest rate parity","Foreign exchange risk","Foreign exchange",{"type":39,"children":802,"toc":816},[803],{"type":42,"tag":43,"props":804,"children":805},{},[806,808,814],{"type":47,"value":807},"This study investigates the impact of Chinese banks’ derivative activities on their exposure to exchange rate and interest rate changes. The standard Jorion ",{"type":42,"tag":809,"props":810,"children":811},"span",{},[812],{"type":47,"value":813},"1990. “The Exchange-Rate Exposure of U.S. Multinationals.” Journal of Business 63 (3): 331–345",{"type":47,"value":815}," model provides weak evidence of Chinese banks’ exposure to these risks. However, the exposure increases substantially when time-varying exposure regressions with orthogonalised market returns are used. We also show that Chinese banks exhibit linear and nonlinear exposures to the exchange rate and interest rate fluctuations. Further analysis indicates that the use of derivatives reduces banks’ foreign exchange risk, but does not affect their interest rate exposure. Derivative products are more likely to be used as an integrated part of the Chinese banks’ risk management systems, which could thus help to stabilise the banking system.",{"title":8,"searchDepth":49,"depth":49,"links":817},[],"content:publications:2014:derivative-activities-and-chinese-banks-exposures-to-exchange-rate-and-interest.md","publications\u002F2014\u002Fderivative-activities-and-chinese-banks-exposures-to-exchange-rate-and-interest.md","publications\u002F2014\u002Fderivative-activities-and-chinese-banks-exposures-to-exchange-rate-and-interest",{"_path":822,"_dir":705,"_draft":7,"_partial":7,"_locale":8,"title":823,"description":8,"_hidden":7,"negative news during the global financial crisis authors":824,"authors_orcid":826,"year":712,"doi":827,"openalex_id":828,"venue":829,"abstract_screenshot":21,"keywords":830,"body":839,"_type":51,"_id":843,"_source":53,"_file":844,"_stem":845,"_extension":56,"locale":57},"\u002Fpublications\u002F2014\u002Fdoes-the-stock-market-reward-innovation-european-stock-index-reaction-to-negativ","Does the stock market reward innovation? European stock index reaction to",[825,268,787,788],"Adcock, Christopher J.",[21,272,21,790],"https:\u002F\u002Fdoi.org\u002F10.1016\u002Fj.jimonfin.2014.06.004","W3123846955","Journal of International Money and Finance",[831,36,832,833,834,555,835,836,285,283,837,429,407,838],"Financial crisis","Bivariate analysis","Stock market","Index (typography)","Stock market index","Autoregressive conditional heteroskedasticity","Financial market","Volatility (finance)",{"type":39,"children":840,"toc":841},[],{"title":8,"searchDepth":49,"depth":49,"links":842},[],"content:publications:2014:does-the-stock-market-reward-innovation-european-stock-index-reaction-to-negativ.md","publications\u002F2014\u002Fdoes-the-stock-market-reward-innovation-european-stock-index-reaction-to-negativ.md","publications\u002F2014\u002Fdoes-the-stock-market-reward-innovation-european-stock-index-reaction-to-negativ",{"_path":847,"_dir":705,"_draft":7,"_partial":7,"_locale":8,"title":848,"description":8,"_hidden":7,"study in Hong Kong international primary schools\" authors":849,"authors_orcid":852,"year":712,"doi":855,"openalex_id":856,"venue":857,"abstract_screenshot":21,"keywords":858,"body":871,"_type":51,"_id":875,"_source":53,"_file":876,"_stem":877,"_extension":56,"locale":57},"\u002Fpublications\u002F2014\u002Fexploring-young-students-learning-experiences-with-the-ipad-a-comparative-study","Exploring young students’ learning experiences with the iPad: a comparativ",[850,595,851],"Wang, Tianchong","Jong, Morris Siu–Yung",[853,599,854],"0000-0002-6410-2490","0000-0001-9186-0484","https:\u002F\u002Fdoi.org\u002F10.1007\u002Fs10209-014-0395-7","W1993023324","Universal Access in the Information Society",[859,860,861,862,23,863,864,865,866,867,868,869,870],"Usability","Popularity","Touchscreen","Class (philosophy)","Mobile device","Interface (matter)","Psychology","Mathematics education","Multimedia","Human–computer interaction","World Wide Web","Social psychology",{"type":39,"children":872,"toc":873},[],{"title":8,"searchDepth":49,"depth":49,"links":874},[],"content:publications:2014:exploring-young-students-learning-experiences-with-the-ipad-a-comparative-study.md","publications\u002F2014\u002Fexploring-young-students-learning-experiences-with-the-ipad-a-comparative-study.md","publications\u002F2014\u002Fexploring-young-students-learning-experiences-with-the-ipad-a-comparative-study",{"_path":879,"_dir":705,"_draft":7,"_partial":7,"_locale":8,"title":880,"description":8,"_hidden":7,"authors":881,"authors_orcid":883,"year":712,"doi":885,"openalex_id":886,"venue":887,"abstract_screenshot":21,"keywords":888,"body":893,"_type":51,"_id":897,"_source":53,"_file":898,"_stem":899,"_extension":56,"locale":57},"\u002Fpublications\u002F2014\u002Fhybridising-heuristics-within-an-estimation-distribution-algorithm-for-examinati","Hybridising heuristics within an estimation distribution algorithm for examination timetabling",[319,882,12,13],"Pham, Nam Ngoc",[322,884,15,16],"0000-0002-7973-9267","https:\u002F\u002Fdoi.org\u002F10.1007\u002Fs10489-014-0615-0","W2038015627","Applied Intelligence",[506,23,889,329,890,101,31,891,892,332,215,37,34],"Generality","Hyper-heuristic","Constructive","Estimation of distribution algorithm",{"type":39,"children":894,"toc":895},[],{"title":8,"searchDepth":49,"depth":49,"links":896},[],"content:publications:2014:hybridising-heuristics-within-an-estimation-distribution-algorithm-for-examinati.md","publications\u002F2014\u002Fhybridising-heuristics-within-an-estimation-distribution-algorithm-for-examinati.md","publications\u002F2014\u002Fhybridising-heuristics-within-an-estimation-distribution-algorithm-for-examinati",{"_path":901,"_dir":705,"_draft":7,"_partial":7,"_locale":8,"title":902,"description":903,"_hidden":7,"authors":904,"authors_orcid":909,"year":712,"doi":914,"openalex_id":915,"venue":916,"abstract_screenshot":21,"keywords":917,"body":929,"_type":51,"_id":937,"_source":53,"_file":938,"_stem":939,"_extension":56,"locale":57},"\u002Fpublications\u002F2014\u002Flife-cycle-resource-consumption-of-automotive-power-seats","Life cycle resource consumption of automotive power seats","In this paper, a full life cycle resource consumption model for automotive seats has been proposed based on the vehicle material-energy-pollution assessment model, and an assessment on energy consumption and abiotic depletion potential (ADP) impact is conducted to evaluate the power seat environmental performances of a representative passenger car from the standpoint of life cycle. The results show that the energy consumption of the selected automotive seats mainly occurs in the use phase. Among all types of energy consumption, the non-renewable energy consumption is much larger than the renewable energy consumption. According to the ADP impact assessment, the consumption of copper and crude oil makes the largest contribution to resource depletion, and the ADP index may increase significantly due to the additional electrical part of car seats. Therefore, the enhancement of environmental performances of car seats can be achieved through measures including design with lightweight metal, fuel-electric conversion efficiency improvement, reduction in energy consumption caused by seat motor running and a more sustainable material with low ADP coefficient.",[905,906,907,908,12],"Chen, Yisong","Yang, Yanping","Li, Xiang","Dong, Haibo",[910,911,912,913,15],"0000-0002-7093-2597","0000-0003-0984-996X","0000-0003-2454-9666","0000-0001-7823-7014","https:\u002F\u002Fdoi.org\u002F10.1080\u002F00207233.2014.942150","W2032514723","International Journal of Environmental Studies",[918,919,920,921,922,752,923,924,925,750,926,179,927,23,928,36],"Automotive industry","Life-cycle assessment","Energy consumption","Resource depletion","Renewable energy","Consumption (sociology)","Resource (disambiguation)","Renewable resource","Environmental science","Production (economics)","Electrical engineering",{"type":39,"children":930,"toc":935},[931],{"type":42,"tag":43,"props":932,"children":933},{},[934],{"type":47,"value":903},{"title":8,"searchDepth":49,"depth":49,"links":936},[],"content:publications:2014:life-cycle-resource-consumption-of-automotive-power-seats.md","publications\u002F2014\u002Flife-cycle-resource-consumption-of-automotive-power-seats.md","publications\u002F2014\u002Flife-cycle-resource-consumption-of-automotive-power-seats",{"_path":941,"_dir":705,"_draft":7,"_partial":7,"_locale":8,"title":942,"description":943,"_hidden":7,"authors":944,"authors_orcid":946,"year":712,"doi":948,"openalex_id":949,"venue":21,"abstract_screenshot":21,"keywords":950,"body":957,"_type":51,"_id":965,"_source":53,"_file":966,"_stem":967,"_extension":56,"locale":57},"\u002Fpublications\u002F2014\u002Fmaintaining-population-diversity-in-brain-storm-optimization-algorithm","Maintaining population diversity in brain storm optimization algorithm","Swarm intelligence suffers the premature convergence, which happens partially due to the solutions getting clustered together, and not diverging again. The brain storm optimization (BSO), which is a young and promising algorithm in swarm intelligence, is based on the collective behavior of human being, that is, the brainstorming process. Premature convergence also happens in the BSO algorithm. The solutions get clustered after a few iterations, which indicate that the population diversity decreases quickly during the search. A definition of population diversity in BSO algorithm to measure the change of solutions' distribution is proposed in this paper. The algorithm's exploration and exploitation ability can be measured based on the change of population diversity. Two kinds of partial re-initialization strategies are utilized to improve the population diversity in BSO algorithm. The experimental results show that the performance of the BSO is improved by these two strategies.",[678,679,680,945,12],"Ting, T. O.",[682,683,684,947,15],"0000-0002-4943-1237","https:\u002F\u002Fdoi.org\u002F10.1109\u002Fcec.2014.6900255","W2150789866",[951,693,479,952,953,23,954,955,332,31,956,37,34,695],"Premature convergence","Population","Diversity (politics)","Convergence (economics)","Brainstorming","Swarm behaviour",{"type":39,"children":958,"toc":963},[959],{"type":42,"tag":43,"props":960,"children":961},{},[962],{"type":47,"value":943},{"title":8,"searchDepth":49,"depth":49,"links":964},[],"content:publications:2014:maintaining-population-diversity-in-brain-storm-optimization-algorithm.md","publications\u002F2014\u002Fmaintaining-population-diversity-in-brain-storm-optimization-algorithm.md","publications\u002F2014\u002Fmaintaining-population-diversity-in-brain-storm-optimization-algorithm",{"_path":969,"_dir":705,"_draft":7,"_partial":7,"_locale":8,"title":970,"description":971,"_hidden":7,"authors":972,"authors_orcid":976,"year":712,"doi":979,"openalex_id":980,"venue":21,"abstract_screenshot":21,"keywords":981,"body":986,"_type":51,"_id":994,"_source":53,"_file":995,"_stem":996,"_extension":56,"locale":57},"\u002Fpublications\u002F2014\u002Fmodeling-urban-road-risky-driving-behaviors-in-china-with-multi-agent-microscopi","Modeling urban road risky driving behaviors in China with multi-agent microscopic traffic simulation","Typical driving behaviors such as car-following and lane-changing can be described based on common concepts. But these behaviors could be different from driver to driver, from nation to nation due to different individual influencing factors (e.g. age, gender, driving age, mood) and situational influencing factors (e.g. weather, congestion, respect for law). Studies show that drivers who have higher level of “driving discourtesy” (i.e rudeness and aggressiveness) have higher probability of performing risky driving behaviors including traffic rule violations. In this paper, we propose a model named Driving Discourtesy Model (DDM). In this model, a new indicator is defined to measure the “driving discourtesy”. With a probability distribution method, we are able to estimate the probability of performing risky driving behaviors of each vehicle based on a vehicle's individual influencing factors and situational factors. A multi-agent traffic simulation is developed to test DDM. The experiment results show that risky driving behaviors including speeding, lane-changing for taking speed advantages and driving on hard shoulder can be simulated effectively using DDM.",[973,12,974,975],"Li, Xia","Siebers, Peer‐Olaf","Wagner, Christian",[21,15,977,978],"0000-0002-0603-5904","0000-0002-6121-9722","https:\u002F\u002Fdoi.org\u002F10.1109\u002Fitsc.2014.6957944","W1966399282",[982,983,23,282,454,984,179,985,289],"Road traffic","Traffic simulation","Simulation","Microsimulation",{"type":39,"children":987,"toc":992},[988],{"type":42,"tag":43,"props":989,"children":990},{},[991],{"type":47,"value":971},{"title":8,"searchDepth":49,"depth":49,"links":993},[],"content:publications:2014:modeling-urban-road-risky-driving-behaviors-in-china-with-multi-agent-microscopi.md","publications\u002F2014\u002Fmodeling-urban-road-risky-driving-behaviors-in-china-with-multi-agent-microscopi.md","publications\u002F2014\u002Fmodeling-urban-road-risky-driving-behaviors-in-china-with-multi-agent-microscopi",{"_path":998,"_dir":705,"_draft":7,"_partial":7,"_locale":8,"title":999,"description":1000,"_hidden":7,"authors":1001,"authors_orcid":1002,"year":712,"doi":1003,"openalex_id":1004,"venue":1005,"abstract_screenshot":1006,"keywords":1007,"body":1010,"_type":51,"_id":1018,"_source":53,"_file":1019,"_stem":1020,"_extension":56,"locale":57},"\u002Fpublications\u002F2014\u002Fnew-metrics-for-prioritized-interaction-test-suites","New Metrics for Prioritized Interaction Test Suites","Combinatorial interaction testing has been well studied in recent years, and has been widely applied in practice. It generally aims at generating an effective test suite (an interaction test suite) in order to identify faults that are caused by parameter interactions. Due to some constraints in practical applications (e.g. limited testing resources), for example in combinatorial interaction regression testing, prioritized interaction test suites (called interaction test sequences) are often employed. Consequently, many strategies have been proposed to guide the interaction test suite prioritization. It is, therefore, important to be able to evaluate the different interaction test sequences that have been created by different strategies. A well-known metric is the Average Percentage of Combinatorial Coverage (shortly APCCλ), which assesses the rate of interaction coverage of a strength λ (level of interaction among parameters) covered by a given interaction test sequence S. However, APCCλ has two drawbacks: firstly, it has two requirements (that all test cases in S be executed, and that all possible λ-wise parameter value combinations be covered by S); and secondly, it can only use a single strength λ (rather than multiple strengths) to evaluate the interaction test sequence - which means that it is not a comprehensive evaluation. To overcome the first drawback, we propose an enhanced metric Normalized APCCλ (NAPCC) to replace the APCCλ Additionally, to overcome the second drawback, we propose three new metrics: the Average Percentage of Strengths Satisfied (APSS); the Average Percentage of Weighted Multiple Interaction Coverage (APWMIC); and the Normalized APWMIC (NAPWMIC). These metrics comprehensively assess a given interaction test sequence by considering different interaction coverage at different strengths. Empirical studies show that the proposed metrics can be used to distinguish different interaction test sequences, and hence can be used to compare different test prioritization strategies.",[645,595,648,647],[650,599,651,21],"https:\u002F\u002Fdoi.org\u002F10.1587\u002Ftransinf.e97.d.830","W2017030700","IEICE Transactions on Information and Systems","new-metrics-for-prioritized-interaction-test-suites.png",[23,657,1008,658,659,773,215,181,1009],"Metric (unit)","Regression analysis",{"type":39,"children":1011,"toc":1016},[1012],{"type":42,"tag":43,"props":1013,"children":1014},{},[1015],{"type":47,"value":1000},{"title":8,"searchDepth":49,"depth":49,"links":1017},[],"content:publications:2014:new-metrics-for-prioritized-interaction-test-suites.md","publications\u002F2014\u002Fnew-metrics-for-prioritized-interaction-test-suites.md","publications\u002F2014\u002Fnew-metrics-for-prioritized-interaction-test-suites",{"_path":1022,"_dir":705,"_draft":7,"_partial":7,"_locale":8,"title":1023,"description":1024,"_hidden":7,"authors":1025,"authors_orcid":1027,"year":712,"doi":1029,"openalex_id":1030,"venue":1031,"abstract_screenshot":21,"keywords":1032,"body":1035,"_type":51,"_id":1043,"_source":53,"_file":1044,"_stem":1045,"_extension":56,"locale":57},"\u002Fpublications\u002F2014\u002Fpopulation-diversity-maintenance-in-brain-storm-optimization-algorithm","Population Diversity Maintenance In Brain Storm Optimization Algorithm","Abstract The convergence and divergence are two common phenomena in swarm intelligence. To obtain good search results, the algorithm should have a balance on convergence and divergence. The premature convergence happens partially due to the solutions getting clustered together, and not diverging again. The brain storm optimization (BSO), which is a young and promising algorithm in swarm intelligence, is based on the collective behavior of human being, that is, the brainstorming process. The convergence strategy is utilized in BSO algorithm to exploit search areas may contain good solutions. The new solutions are generated by divergence strategy to explore new search areas. Premature convergence also happens in the BSO algorithm. The solutions get clustered after a few iterations, which indicate that the population diversity decreases quickly during the search. A definition of population diversity in BSO algorithm is introduced in this paper to measure the change of solutions’ distribution. The algorithm's exploration and exploitation ability can be measured based on the change of population diversity. Different kinds of partial reinitialization strategies are utilized to improve the population diversity in BSO algorithm. The experimental results show that the performance of the BSO is improved by part of solutions re-initialization strategies.",[678,679,680,1026,12],"Zhang, Qingyu",[682,683,684,1028,15],"0000-0001-9739-3899","https:\u002F\u002Fdoi.org\u002F10.1515\u002Fjaiscr-2015-0001","W95170009","Journal of Artificial Intelligence and Soft Computing Research",[951,952,479,693,1033,23,954,332,31,1034,34,695],"Divergence (linguistics)","Exploit",{"type":39,"children":1036,"toc":1041},[1037],{"type":42,"tag":43,"props":1038,"children":1039},{},[1040],{"type":47,"value":1024},{"title":8,"searchDepth":49,"depth":49,"links":1042},[],"content:publications:2014:population-diversity-maintenance-in-brain-storm-optimization-algorithm.md","publications\u002F2014\u002Fpopulation-diversity-maintenance-in-brain-storm-optimization-algorithm.md","publications\u002F2014\u002Fpopulation-diversity-maintenance-in-brain-storm-optimization-algorithm",{"_path":1047,"_dir":705,"_draft":7,"_partial":7,"_locale":8,"title":1048,"description":8,"_hidden":7,"authors":1049,"authors_orcid":1051,"year":712,"doi":1053,"openalex_id":1054,"venue":1055,"abstract_screenshot":21,"keywords":1056,"body":1060,"_type":51,"_id":1064,"_source":53,"_file":1065,"_stem":1066,"_extension":56,"locale":57},"\u002Fpublications\u002F2014\u002Fsearch-with-evolutionary-ruin-and-stochastic-rebuild-a-theoretic-framework-and-a","Search with evolutionary ruin and stochastic rebuild: A theoretic framework and a case study on exam timetabling",[199,12,1050,319],"Shen, Yindong",[203,15,1052,322],"0000-0001-8010-5889","https:\u002F\u002Fdoi.org\u002F10.1016\u002Fj.ejor.2014.11.002","W2158276170","European Journal of Operational Research",[1057,23,31,213,218,1058,1059,106,208,34,37,215],"Markov chain","Component (thermodynamics)","State space",{"type":39,"children":1061,"toc":1062},[],{"title":8,"searchDepth":49,"depth":49,"links":1063},[],"content:publications:2014:search-with-evolutionary-ruin-and-stochastic-rebuild-a-theoretic-framework-and-a.md","publications\u002F2014\u002Fsearch-with-evolutionary-ruin-and-stochastic-rebuild-a-theoretic-framework-and-a.md","publications\u002F2014\u002Fsearch-with-evolutionary-ruin-and-stochastic-rebuild-a-theoretic-framework-and-a",{"_path":1068,"_dir":705,"_draft":7,"_partial":7,"_locale":8,"title":1069,"description":8,"_hidden":7,"authors":1070,"authors_orcid":1072,"year":712,"doi":1074,"openalex_id":1075,"venue":1076,"abstract_screenshot":21,"keywords":1077,"body":1082,"_type":51,"_id":1086,"_source":53,"_file":1087,"_stem":1088,"_extension":56,"locale":57},"\u002Fpublications\u002F2014\u002Fstochastic-service-network-design-with-rerouting","Stochastic service network design with rerouting",[12,1071,199,623],"Wallace, Stein W.",[15,1073,203,625],"0000-0001-5909-7909","https:\u002F\u002Fdoi.org\u002F10.1016\u002Fj.trb.2013.11.001","W2145507194","Transportation Research Part B Methodological",[1078,242,23,24,101,1079,240,1080,1081,243,31,179,251,36],"Flexibility (engineering)","Redundancy (engineering)","Service level","Stochastic programming",{"type":39,"children":1083,"toc":1084},[],{"title":8,"searchDepth":49,"depth":49,"links":1085},[],"content:publications:2014:stochastic-service-network-design-with-rerouting.md","publications\u002F2014\u002Fstochastic-service-network-design-with-rerouting.md","publications\u002F2014\u002Fstochastic-service-network-design-with-rerouting",{"_path":1090,"_dir":705,"_draft":7,"_partial":7,"_locale":8,"title":1091,"description":1092,"_hidden":7,"SOAP messages authors":1093,"authors_orcid":1097,"year":712,"doi":1101,"openalex_id":1102,"venue":1103,"abstract_screenshot":21,"keywords":1104,"body":1114,"_type":51,"_id":1122,"_source":53,"_file":1123,"_stem":1124,"_extension":56,"locale":57},"\u002Fpublications\u002F2014\u002Fworst-input-mutation-approach-to-web-services-vulnerability-testing-based-on-soa","Worst-input mutation approach to web services vulnerability testing based on","The growing popularity and application of Web services have led to increased attention regarding the vulnerability of software based on these services. Vulnerability testing examines the trustworthiness and reduces the security risks of software systems. This paper proposes a worst-input mutation approach for testing Web service vulnerability based on Simple Object Access Protocol (SOAP) messages. Based on characteristics of SOAP messages, the proposed approach uses the farthest neighbor concept to guide generation of the test suite. The corresponding automatic test case generation algorithm, namely, the Test Case generation based on the Farthest Neighbor (TCFN), is also presented. The method involves partitioning the input domain into sub-domains according to the number and type of SOAP message parameters in the TCFN, selecting the candidate test case whose distance is the farthest from all executed test cases, and applying it to test the Web service. We also implement and describe a prototype Web service vulnerability testing tool. The tool was applied to the testing of Web services on the Internet. The experimental results show that the proposed approach can find more vulnerability faults than other related approaches.",[648,1094,595,1095,645,1096],"Wang, Huanhuan","Mao, Chengying","Zhan, Yongzhao",[651,1098,599,1099,650,1100],"0000-0003-4689-5578","0000-0001-8178-1205","0000-0001-7475-2895","https:\u002F\u002Fdoi.org\u002F10.1109\u002Ftst.2014.6919819","W48603715","Tsinghua Science & Technology",[1105,23,1106,657,1107,1108,1109,658,1110,1111,180,869,181,139,607,1112,215,1113],"SOAP","Web service","Vulnerability (computing)","The Internet","Web application security","Fuzz testing","Model-based testing","Web development","Operating system",{"type":39,"children":1115,"toc":1120},[1116],{"type":42,"tag":43,"props":1117,"children":1118},{},[1119],{"type":47,"value":1092},{"title":8,"searchDepth":49,"depth":49,"links":1121},[],"content:publications:2014:worst-input-mutation-approach-to-web-services-vulnerability-testing-based-on-soa.md","publications\u002F2014\u002Fworst-input-mutation-approach-to-web-services-vulnerability-testing-based-on-soa.md","publications\u002F2014\u002Fworst-input-mutation-approach-to-web-services-vulnerability-testing-based-on-soa",{"_path":1126,"_dir":1127,"_draft":7,"_partial":7,"_locale":8,"title":1128,"description":1129,"_hidden":7,"authors":1130,"authors_orcid":1133,"year":1136,"doi":1137,"openalex_id":1138,"venue":21,"abstract_screenshot":21,"keywords":1139,"body":1141,"_type":51,"_id":1149,"_source":53,"_file":1150,"_stem":1151,"_extension":56,"locale":57},"\u002Fpublications\u002F2015\u002Fa-hybrid-genetic-algorithm-for-a-two-stage-stochastic-portfolio-optimization-wit","2015","A hybrid genetic algorithm for a two-stage stochastic portfolio optimization with uncertain asset prices","Portfolio optimization is one of the most important problems in the finance field. The traditional mean-variance model has its drawbacks since it fails to take the market uncertainty into account. In this work, we investigate a two-stage stochastic portfolio optimization model with a comprehensive set of real world trading constraints in order to capture the market uncertainties in terms of future asset prices. A hybrid approach, which integrates genetic algorithm (GA) and a linear programming (LP) solver is proposed in order to solve the model, where GA is used to search for the assets selection heuristically and the LP solver solves the corresponding sub-problems of weight allocation optimally. Scenarios are generated to capture uncertain prices of assets for five benchmark market instances. The computational results indicate that the proposed hybrid algorithm can obtain very promising solutions. Possible future research directions are also discussed.",[709,12,1131,1132,319,199],"Parkes, Andrew J.","He, Fang",[711,15,1134,1135,322,203],"0000-0002-8847-1856","0000-0002-9029-1838",2015,"https:\u002F\u002Fdoi.org\u002F10.1109\u002Fcec.2015.7257198","W1518456858",[717,718,209,719,23,31,106,244,1081,1140,101,429,34,36],"Stochastic optimization",{"type":39,"children":1142,"toc":1147},[1143],{"type":42,"tag":43,"props":1144,"children":1145},{},[1146],{"type":47,"value":1129},{"title":8,"searchDepth":49,"depth":49,"links":1148},[],"content:publications:2015:a-hybrid-genetic-algorithm-for-a-two-stage-stochastic-portfolio-optimization-wit.md","publications\u002F2015\u002Fa-hybrid-genetic-algorithm-for-a-two-stage-stochastic-portfolio-optimization-wit.md","publications\u002F2015\u002Fa-hybrid-genetic-algorithm-for-a-two-stage-stochastic-portfolio-optimization-wit",{"_path":1153,"_dir":1127,"_draft":7,"_partial":7,"_locale":8,"title":1154,"description":8,"_hidden":7,"authors":1155,"authors_orcid":1157,"year":1136,"doi":1159,"openalex_id":1160,"venue":1161,"abstract_screenshot":21,"keywords":1162,"body":1170,"_type":51,"_id":1174,"_source":53,"_file":1175,"_stem":1176,"_extension":56,"locale":57},"\u002Fpublications\u002F2015\u002Fa-revisit-of-three-studies-related-to-random-testing","A revisit of three studies related to random testing",[596,594,595,1156],"Zhou, Zhi Quan",[600,21,599,1158],"0000-0003-1769-9367","https:\u002F\u002Fdoi.org\u002F10.1007\u002Fs11432-015-5314-x","W2010962701","Science China Information Sciences",[1163,23,606,661,662,1164,1165,658,139,1166,1167,134,747,1168,181,215,138,1169,34,179,110],"Random testing","Regression testing","Software quality","Contiguity","Domain (mathematical analysis)","Risk-based testing","Software construction",{"type":39,"children":1171,"toc":1172},[],{"title":8,"searchDepth":49,"depth":49,"links":1173},[],"content:publications:2015:a-revisit-of-three-studies-related-to-random-testing.md","publications\u002F2015\u002Fa-revisit-of-three-studies-related-to-random-testing.md","publications\u002F2015\u002Fa-revisit-of-three-studies-related-to-random-testing",{"_path":1178,"_dir":1127,"_draft":7,"_partial":7,"_locale":8,"title":1179,"description":8,"_hidden":7,"authors":1180,"authors_orcid":1183,"year":1136,"doi":1186,"openalex_id":1187,"venue":1076,"abstract_screenshot":21,"keywords":1188,"body":1193,"_type":51,"_id":1197,"_source":53,"_file":1198,"_stem":1199,"_extension":56,"locale":57},"\u002Fpublications\u002F2015\u002Fa-set-covering-model-for-a-bidirectional-multi-shift-full-truckload-vehicle-rout","A set-covering model for a bidirectional multi-shift full truckload vehicle routing problem",[12,1181,523,1182],"Xue, Ning","Roberts, Gethin Wyn",[15,1184,525,1185],"0000-0003-1449-9933","0000-0002-3703-981X","https:\u002F\u002Fdoi.org\u002F10.1016\u002Fj.trb.2015.06.002","W1924535508",[1189,1190,23,250,247,31,101,240,1191,99,243,1192,249,24,251,34,179,37],"Container (type theory)","Pickup","Upper and lower bounds","Port (circuit theory)",{"type":39,"children":1194,"toc":1195},[],{"title":8,"searchDepth":49,"depth":49,"links":1196},[],"content:publications:2015:a-set-covering-model-for-a-bidirectional-multi-shift-full-truckload-vehicle-rout.md","publications\u002F2015\u002Fa-set-covering-model-for-a-bidirectional-multi-shift-full-truckload-vehicle-rout.md","publications\u002F2015\u002Fa-set-covering-model-for-a-bidirectional-multi-shift-full-truckload-vehicle-rout",{"_path":1201,"_dir":1127,"_draft":7,"_partial":7,"_locale":8,"title":1202,"description":1203,"_hidden":7,"activity diagrams authors":1204,"authors_orcid":1209,"year":1136,"doi":1213,"openalex_id":1214,"venue":1215,"abstract_screenshot":21,"keywords":1216,"body":1223,"_type":51,"_id":1231,"_source":53,"_file":1232,"_stem":1233,"_extension":56,"locale":57},"\u002Fpublications\u002F2015\u002Fa-transformation-based-approach-to-testing-concurrent-programs-using-uml-activit","A transformation-based approach to testing concurrent programs using UML","Unified Modeling Language (UML) activity diagrams are widely used to model concurrent interaction among multiple objects. In this paper, we propose a transformation-based approach to generating scenario-oriented test cases for applications modeled by UML activity diagrams. Using a set of transformation rules, the proposed approach first transforms a UML activity diagram specification into an intermediate representation, from which it then constructs test scenarios with respect to the given concurrency coverage criteria. The approach then finally derives a set of test cases for the constructed test scenarios. The approach resolves the difficulties associated with fork and join concurrency in the UML activity diagram and enables control over the number of the resulting test cases. We further implemented a tool to automate the proposed approach and studied its feasibility and effectiveness using a case study. Experimental results show that the approach can generate test cases on demand to satisfy a given concurrency coverage criterion and can detect up to 76.5% of seeded faults when a weak coverage criterion is used. With the approach, testers can not only schedule the software test process earlier, but can also better allocate the testing resources for testing concurrent applications. Copyright © 2015 John Wiley & Sons, Ltd.",[1205,1206,1207,1208,595],"Sun, Chang‐ai","Zhao, Yan","Pan, Lin","He, Xiao",[1210,1211,21,1212,599],"0000-0003-3696-6176","0000-0002-6453-1682","0000-0002-3000-0795","https:\u002F\u002Fdoi.org\u002F10.1002\u002Fspe.2324","W2135842852","Software Practice and Experience",[23,1217,1218,1219,110,658,101,1220,1111,1221,1222,139],"Activity diagram","Concurrency","Unified Modeling Language","UML tool","Code coverage","Schedule",{"type":39,"children":1224,"toc":1229},[1225],{"type":42,"tag":43,"props":1226,"children":1227},{},[1228],{"type":47,"value":1203},{"title":8,"searchDepth":49,"depth":49,"links":1230},[],"content:publications:2015:a-transformation-based-approach-to-testing-concurrent-programs-using-uml-activit.md","publications\u002F2015\u002Fa-transformation-based-approach-to-testing-concurrent-programs-using-uml-activit.md","publications\u002F2015\u002Fa-transformation-based-approach-to-testing-concurrent-programs-using-uml-activit",{"_path":1235,"_dir":1127,"_draft":7,"_partial":7,"_locale":8,"title":1236,"description":1237,"_hidden":7,"Overcoming the first- and second- order barriers to change\" authors":1238,"authors_orcid":1239,"year":1136,"doi":1240,"openalex_id":1241,"venue":21,"abstract_screenshot":21,"keywords":1242,"body":1245,"_type":51,"_id":1253,"_source":53,"_file":1254,"_stem":1255,"_extension":56,"locale":57},"\u002Fpublications\u002F2015\u002Fchallenges-to-flipped-classroom-adoption-in-hong-kong-secondary-schools-overcomi","Challenges to flipped classroom adoption in Hong Kong secondary schools","The flipped classroom phenomenon has generated a lot of enthusiasm in teaching circles, but not all teachers have embraced this new paradigm. This paper discusses some of the challenges for Hong Kong secondary school teachers to adopt the flipped classroom approaches. Based on a study conducted parallel to a professional development workshop for teachers, a number of concerns regarding the use of flipped classrooms are identified and discussed. Dividing these concerns into first- and second-order barriers, themes in teachers' comments and feedback are identified, and potential approaches to addressing the concerns proposed.",[850,851,595],[853,854,599],"https:\u002F\u002Fdoi.org\u002F10.1109\u002Ftale.2015.7386025","W2242675383",[1243,1244,23,866,178,865],"Order (exchange)","Flipped classroom",{"type":39,"children":1246,"toc":1251},[1247],{"type":42,"tag":43,"props":1248,"children":1249},{},[1250],{"type":47,"value":1237},{"title":8,"searchDepth":49,"depth":49,"links":1252},[],"content:publications:2015:challenges-to-flipped-classroom-adoption-in-hong-kong-secondary-schools-overcomi.md","publications\u002F2015\u002Fchallenges-to-flipped-classroom-adoption-in-hong-kong-secondary-schools-overcomi.md","publications\u002F2015\u002Fchallenges-to-flipped-classroom-adoption-in-hong-kong-secondary-schools-overcomi",{"_path":1257,"_dir":1127,"_draft":7,"_partial":7,"_locale":8,"title":1258,"description":1259,"_hidden":7,"authors":1260,"authors_orcid":1262,"year":1136,"doi":1264,"openalex_id":1265,"venue":553,"abstract_screenshot":21,"keywords":1266,"body":1272,"_type":51,"_id":1280,"_source":53,"_file":1281,"_stem":1282,"_extension":56,"locale":57},"\u002Fpublications\u002F2015\u002Fcontrarian-strategy-and-herding-behaviour-in-the-chinese-stock-market","Contrarian strategy and herding behaviour in the Chinese stock market","This paper investigates the profitability of several types of zero-cost price momentum and contrarian\r\\nstrategies in the Chinese stock market for the 1994–2013 period. Several distinct features of Chinese market\r\\nare documented.We find that contrarian strategies that use Jegadeesh and Titman’s (1993)method with\r\\nweekly frequency are profitable. However, investment strategies based on the ‘nearness’ to of 52-week\r\\nhigh or the recency of the 52-week high are not profitable. Our analysis also shows that contrarian profits\r\\nare higher during the crisis period of 2008–2012. In addition, the return reversal of the winner and loser\r\\nportfolios suggests that contrarian profits can be attributed to overreaction. Finally, we also find evidence\r\\nof herding behaviour in the Chinese market; and the degree of herding behaviour is positively correlated\r\\nwith the profits of contrarian trading strategies.",[1261,268,574],"Chen, Qiwei",[1263,272,577],"0000-0002-8727-3073","https:\u002F\u002Fdoi.org\u002F10.1080\u002F1351847x.2015.1071715","W2192362082",[1267,1268,1269,833,36,283,1270,555,285,178,1271,429,133],"Contrarian","Herding","Profitability index","Investment strategy","Market liquidity",{"type":39,"children":1273,"toc":1278},[1274],{"type":42,"tag":43,"props":1275,"children":1276},{},[1277],{"type":47,"value":1259},{"title":8,"searchDepth":49,"depth":49,"links":1279},[],"content:publications:2015:contrarian-strategy-and-herding-behaviour-in-the-chinese-stock-market.md","publications\u002F2015\u002Fcontrarian-strategy-and-herding-behaviour-in-the-chinese-stock-market.md","publications\u002F2015\u002Fcontrarian-strategy-and-herding-behaviour-in-the-chinese-stock-market",{"_path":1284,"_dir":1127,"_draft":7,"_partial":7,"_locale":8,"title":1285,"description":8,"_hidden":7,"authors":1286,"authors_orcid":1290,"year":1136,"doi":1293,"openalex_id":1294,"venue":401,"abstract_screenshot":21,"keywords":1295,"body":1302,"_type":51,"_id":1306,"_source":53,"_file":1307,"_stem":1308,"_extension":56,"locale":57},"\u002Fpublications\u002F2015\u002Fexamining-the-determinants-of-inward-fdi-evidence-from-norway","Examining the determinants of inward FDI: Evidence from Norway",[1287,268,1288,1289],"Boateng, Agyenim","Nisar, Shaista P.","Wu, Junjie",[1291,272,21,1292],"0000-0002-0599-9365","0000-0002-6363-2705","https:\u002F\u002Fdoi.org\u002F10.1016\u002Fj.econmod.2015.02.018","W2006875749",[36,1296,1297,280,1298,285,409,404,405,407,1299,287,1300,1301],"Openness to experience","Foreign direct investment","Inflation (cosmology)","Effective exchange rate","Unemployment","International economics",{"type":39,"children":1303,"toc":1304},[],{"title":8,"searchDepth":49,"depth":49,"links":1305},[],"content:publications:2015:examining-the-determinants-of-inward-fdi-evidence-from-norway.md","publications\u002F2015\u002Fexamining-the-determinants-of-inward-fdi-evidence-from-norway.md","publications\u002F2015\u002Fexamining-the-determinants-of-inward-fdi-evidence-from-norway",{"_path":1310,"_dir":1127,"_draft":7,"_partial":7,"_locale":8,"title":1311,"description":1312,"_hidden":7,"authors":1313,"authors_orcid":1322,"year":1136,"doi":1330,"openalex_id":1331,"venue":447,"abstract_screenshot":1332,"keywords":1333,"body":1336,"_type":51,"_id":1344,"_source":53,"_file":1345,"_stem":1346,"_extension":56,"locale":57},"\u002Fpublications\u002F2015\u002Fgood-laboratory-practice-for-optimization-research","Good Laboratory Practice for optimization research","Good Laboratory Practice has been a part of non-clinical research for over 40 years. Optimization Research, despite having many papers discussing standards being published over the same period of time, has yet to embrace standards that underpin its research. In this paper we argue the need to adopt standards in optimization research. Building on previous papers, many of which have suggested that the optimization research community should adopt certain standards, we suggest a concrete set of recommendations that the community should adopt. We also discuss how the proposals in this paper could be progressed.",[13,12,1314,1315,1316,1317,157,200,1318,319,1319,1320,1321],"Błażewicz, Jacek","Causmaecker, Patrick De","Gendreau, Michel","John, Robert","Pesch, Erwin","Sabar, Nasser R.","Berghe, Greet Vanden","Yee, Angelina Seow Voon",[16,15,1323,1324,1325,1326,162,21,1327,322,1328,1329,21],"0000-0001-8326-1094","0000-0002-6763-1945","0000-0002-9262-3648","0000-0002-2341-9993","0000-0003-0182-870X","0000-0002-0276-4704","0000-0002-0275-5568","https:\u002F\u002Fdoi.org\u002F10.1057\u002Fjors.2015.77","W2175760929","good-laboratory-practice-for-optimization-research.png",[177,101,23,1334,24,1335,179],"Engineering ethics","Engineering management",{"type":39,"children":1337,"toc":1342},[1338],{"type":42,"tag":43,"props":1339,"children":1340},{},[1341],{"type":47,"value":1312},{"title":8,"searchDepth":49,"depth":49,"links":1343},[],"content:publications:2015:good-laboratory-practice-for-optimization-research.md","publications\u002F2015\u002Fgood-laboratory-practice-for-optimization-research.md","publications\u002F2015\u002Fgood-laboratory-practice-for-optimization-research",{"_path":1348,"_dir":1127,"_draft":7,"_partial":7,"_locale":8,"title":1349,"description":8,"_hidden":7,"Mergers and Acquisitions\" authors":1350,"authors_orcid":1351,"year":1136,"doi":1352,"openalex_id":1353,"venue":74,"abstract_screenshot":21,"keywords":1354,"body":1359,"_type":51,"_id":1363,"_source":53,"_file":1364,"_stem":1365,"_extension":56,"locale":57},"\u002Fpublications\u002F2015\u002Finvestor-protection-and-firm-performance-evidence-from-china-s-cross-border-merg","Investor Protection and Firm Performance: Evidence from China's Cross-Borde",[268],[272],"https:\u002F\u002Fdoi.org\u002F10.2139\u002Fssrn.2558342","W296951277",[282,1355,178,1356,1301,1357,36,429,1358],"Mergers and acquisitions","International trade","Financial system","Political science",{"type":39,"children":1360,"toc":1361},[],{"title":8,"searchDepth":49,"depth":49,"links":1362},[],"content:publications:2015:investor-protection-and-firm-performance-evidence-from-china-s-cross-border-merg.md","publications\u002F2015\u002Finvestor-protection-and-firm-performance-evidence-from-china-s-cross-border-merg.md","publications\u002F2015\u002Finvestor-protection-and-firm-performance-evidence-from-china-s-cross-border-merg",{"_path":1367,"_dir":1127,"_draft":7,"_partial":7,"_locale":8,"title":1368,"description":1369,"_hidden":7,"authors":1370,"authors_orcid":1371,"year":1136,"doi":1372,"openalex_id":1373,"venue":21,"abstract_screenshot":21,"keywords":1374,"body":1381,"_type":51,"_id":1389,"_source":53,"_file":1390,"_stem":1391,"_extension":56,"locale":57},"\u002Fpublications\u002F2015\u002Flessons-from-a-failed-flipped-classroom-the-hacked-computer-science-teacher","Lessons from a failed flipped classroom: The hacked computer science teacher","Teaching in higher education can be rewarding, but also stressful. Different teaching approaches and paradigms may mean that teachers are constantly trying to improve the learning experience for their students — a good thing; but perhaps are not succeeding — a bad thing. This paper is essentially a story centring around a teaching experience I had over the course of a single semester. Motivated by a desire to improve the interactivity in a computer science class, I designed and implemented an initiative to facilitate student interaction and teamwork: a flipped classroom. The initiative was not as successful as hoped for, and so I drew on reflexivity and autoethnography to help understand and learn from the experience.",[595],[599],"https:\u002F\u002Fdoi.org\u002F10.1109\u002Ftale.2015.7386008","W2240636316",[1375,1376,1244,1377,862,866,1378,23,865,1379,867,1380,37],"Interactivity","Autoethnography","Teamwork","Reflexivity","Pedagogy","Sociology",{"type":39,"children":1382,"toc":1387},[1383],{"type":42,"tag":43,"props":1384,"children":1385},{},[1386],{"type":47,"value":1369},{"title":8,"searchDepth":49,"depth":49,"links":1388},[],"content:publications:2015:lessons-from-a-failed-flipped-classroom-the-hacked-computer-science-teacher.md","publications\u002F2015\u002Flessons-from-a-failed-flipped-classroom-the-hacked-computer-science-teacher.md","publications\u002F2015\u002Flessons-from-a-failed-flipped-classroom-the-hacked-computer-science-teacher",{"_path":1393,"_dir":1127,"_draft":7,"_partial":7,"_locale":8,"title":1394,"description":1395,"_hidden":7,"Simulink authors":1396,"authors_orcid":1399,"year":1136,"doi":1402,"openalex_id":1403,"venue":21,"abstract_screenshot":21,"keywords":1404,"body":1412,"_type":51,"_id":1420,"_source":53,"_file":1421,"_stem":1422,"_extension":56,"locale":57},"\u002Fpublications\u002F2015\u002Fon-the-relationship-between-model-coverage-and-code-coverage-using-matlab-s-simu","On the Relationship between Model Coverage and Code Coverage Using MATLAB's","Software Testing is an approach to ensuring the quality of software systems. Testing of safety-critical systems often requires conformance to certain code coverage criteria, including for example, in aviation, Modified Condition\u002FDecision Coverage (MC\u002FDC). In some situations, however, access to the actual code may be restricted with black Box approaches, and testers may only be able to use models of the system, such as those in MATLAB's Simulink. Without access to the code, exact code coverage measurement may not be possible. This paper presents a method of identifying and using the Simulink model's constraints to generate test cases which can achieve high coverage of the actual source code. A case study confirming the relationship between the model's coverage and the code coverage is also presented.",[1397,1398,595],"Dong, Yunwei","Li, Zhe",[1400,1401,599],"0000-0001-9882-9121","0000-0002-0105-6351","https:\u002F\u002Fdoi.org\u002F10.1109\u002Fqrs.2015.39","W1671132807",[1221,23,1165,1405,1406,1407,139,1408,1409,1410,661,110,1411,1113,138,179,101],"Code (set theory)","MATLAB","Source code","Redundant code","Model checking","Static program analysis","Code generation",{"type":39,"children":1413,"toc":1418},[1414],{"type":42,"tag":43,"props":1415,"children":1416},{},[1417],{"type":47,"value":1395},{"title":8,"searchDepth":49,"depth":49,"links":1419},[],"content:publications:2015:on-the-relationship-between-model-coverage-and-code-coverage-using-matlab-s-simu.md","publications\u002F2015\u002Fon-the-relationship-between-model-coverage-and-code-coverage-using-matlab-s-simu.md","publications\u002F2015\u002Fon-the-relationship-between-model-coverage-and-code-coverage-using-matlab-s-simu",{"_path":1424,"_dir":1127,"_draft":7,"_partial":7,"_locale":8,"title":1425,"description":1426,"_hidden":7,"Chinese Firms\" authors":1427,"authors_orcid":1429,"year":1136,"doi":1431,"openalex_id":1432,"venue":1433,"abstract_screenshot":21,"keywords":1434,"body":1445,"_type":51,"_id":3072,"_source":53,"_file":3073,"_stem":3074,"_extension":56,"locale":57},"\u002Fpublications\u002F2015\u002Fownership-financial-constraints-and-firm-performance-foreign-acquisitions-of-chi","Ownership, Financial Constraints and Firm Performance: Foreign Acquisitions o","The increasing globalization of business has heightened the opportunities and pressures to engage in cross-border mergers and acquisitions (hereafter, CBM&As) involving transitional economies, which has grown dramatically over the past decades (Shimizu, et al., 2004). In the last few years, the world has witnessed the emergence of China as one of the most significant destinations for CBM&As, which had 2,561.9billionworthofdealsin2012(Barris,2013).BasedonthereportbytheChineseMinistryofCommerce(ChineseMinistryofCommerce,2014),therewere22,819foreigninvestedcompaniesinChinaandtheforeigncapitalamountreached2,561.9 billion worth of deals in 2012 (Barris, 2013). Based on the report by the Chinese Ministry of Commerce (Chinese Ministry of Commerce, 2014), there were 22,819 foreign invested companies in China and the foreign capital amount reached 2,561.9billionworthofdealsin2012(Barris,2013).BasedonthereportbytheChineseMinistryofCommerce(ChineseMinistryofCommerce,2014),therewere22,819foreigninvestedcompaniesinChinaandtheforeigncapitalamountreached 1,239.11 billion by the end of 2013. Given its strategic geographical location, Hong Kong was the largest foreign investment partner of China, and their total investment value accounted for 59.23 per cent of the Chinese total foreign investment in 2013.",[1428,268],"Chen, Yuhuilin",[1430,272],"0000-0003-2954-3909","https:\u002F\u002Fdoi.org\u002F10.1057\u002F9781137454638_5","W2505885068","Palgrave Macmillan UK eBooks",[282,1435,178,1355,1436,1297,1437,1438,1439,1440,1441,1442,1356,429,1443,36,289,1358,1444],"Christian ministry","Destinations","Foreign capital","Investment (military)","Globalization","Capital (architecture)","Value (mathematics)","Economy","Market economy","Tourism",{"type":39,"children":1446,"toc":3070},[1447],{"type":42,"tag":43,"props":1448,"children":1449},{},[1450,1452,3068],{"type":47,"value":1451},"The increasing globalization of business has heightened the opportunities and pressures to engage in cross-border mergers and acquisitions (hereafter, CBM&As) involving transitional economies, which has grown dramatically over the past decades (Shimizu, et al., 2004). In the last few years, the world has witnessed the emergence of China as one of the most significant destinations for CBM&As, which had ",{"type":42,"tag":809,"props":1453,"children":1456},{"className":1454},[1455],"katex",[1457,2271],{"type":42,"tag":809,"props":1458,"children":1461},{"className":1459},[1460],"katex-mathml",[1462],{"type":42,"tag":1463,"props":1464,"children":1466},"math",{"xmlns":1465},"http:\u002F\u002Fwww.w3.org\u002F1998\u002FMath\u002FMathML",[1467],{"type":42,"tag":1468,"props":1469,"children":1470},"semantics",{},[1471,2264],{"type":42,"tag":1472,"props":1473,"children":1474},"mrow",{},[1475,1481,1488,1493,1499,1504,1509,1513,1517,1522,1527,1532,1536,1541,1546,1551,1555,1560,1565,1570,1575,1579,1584,1588,1592,1596,1602,1607,1611,1615,1619,1623,1627,1631,1635,1640,1646,1650,1654,1658,1662,1666,1670,1674,1678,1682,1686,1690,1694,1698,1702,1706,1710,1714,1719,1723,1727,1731,1736,1740,1744,1748,1752,1756,1760,1765,1769,1773,1777,1781,1785,1789,1793,1797,1801,1805,1809,1814,1818,1822,1826,1831,1835,1839,1843,1847,1851,1855,1859,1863,1867,1871,1875,1879,1883,1887,1891,1895,1899,1903,1907,1911,1915,1919,1923,1927,1931,1935,1939,1943,1947,1951,1955,1959,1963,1967,1971,1975,1979,1983,1987,1991,1996,2000,2005,2009,2013,2017,2021,2025,2030,2034,2038,2042,2047,2051,2055,2059,2063,2067,2071,2075,2079,2083,2087,2091,2095,2099,2103,2107,2111,2115,2119,2123,2127,2131,2135,2139,2143,2147,2151,2155,2159,2163,2167,2171,2175,2179,2183,2187,2191,2195,2199,2203,2207,2211,2215,2219,2223,2228,2232,2236,2240,2244,2248,2252,2256,2260],{"type":42,"tag":1476,"props":1477,"children":1478},"mn",{},[1479],{"type":47,"value":1480},"2",{"type":42,"tag":1482,"props":1483,"children":1485},"mo",{"separator":1484},"true",[1486],{"type":47,"value":1487},",",{"type":42,"tag":1476,"props":1489,"children":1490},{},[1491],{"type":47,"value":1492},"561.9",{"type":42,"tag":1494,"props":1495,"children":1496},"mi",{},[1497],{"type":47,"value":1498},"b",{"type":42,"tag":1494,"props":1500,"children":1501},{},[1502],{"type":47,"value":1503},"i",{"type":42,"tag":1494,"props":1505,"children":1506},{},[1507],{"type":47,"value":1508},"l",{"type":42,"tag":1494,"props":1510,"children":1511},{},[1512],{"type":47,"value":1508},{"type":42,"tag":1494,"props":1514,"children":1515},{},[1516],{"type":47,"value":1503},{"type":42,"tag":1494,"props":1518,"children":1519},{},[1520],{"type":47,"value":1521},"o",{"type":42,"tag":1494,"props":1523,"children":1524},{},[1525],{"type":47,"value":1526},"n",{"type":42,"tag":1494,"props":1528,"children":1529},{},[1530],{"type":47,"value":1531},"w",{"type":42,"tag":1494,"props":1533,"children":1534},{},[1535],{"type":47,"value":1521},{"type":42,"tag":1494,"props":1537,"children":1538},{},[1539],{"type":47,"value":1540},"r",{"type":42,"tag":1494,"props":1542,"children":1543},{},[1544],{"type":47,"value":1545},"t",{"type":42,"tag":1494,"props":1547,"children":1548},{},[1549],{"type":47,"value":1550},"h",{"type":42,"tag":1494,"props":1552,"children":1553},{},[1554],{"type":47,"value":1521},{"type":42,"tag":1494,"props":1556,"children":1557},{},[1558],{"type":47,"value":1559},"f",{"type":42,"tag":1494,"props":1561,"children":1562},{},[1563],{"type":47,"value":1564},"d",{"type":42,"tag":1494,"props":1566,"children":1567},{},[1568],{"type":47,"value":1569},"e",{"type":42,"tag":1494,"props":1571,"children":1572},{},[1573],{"type":47,"value":1574},"a",{"type":42,"tag":1494,"props":1576,"children":1577},{},[1578],{"type":47,"value":1508},{"type":42,"tag":1494,"props":1580,"children":1581},{},[1582],{"type":47,"value":1583},"s",{"type":42,"tag":1494,"props":1585,"children":1586},{},[1587],{"type":47,"value":1503},{"type":42,"tag":1494,"props":1589,"children":1590},{},[1591],{"type":47,"value":1526},{"type":42,"tag":1476,"props":1593,"children":1594},{},[1595],{"type":47,"value":342},{"type":42,"tag":1482,"props":1597,"children":1599},{"stretchy":1598},"false",[1600],{"type":47,"value":1601},"(",{"type":42,"tag":1494,"props":1603,"children":1604},{},[1605],{"type":47,"value":1606},"B",{"type":42,"tag":1494,"props":1608,"children":1609},{},[1610],{"type":47,"value":1574},{"type":42,"tag":1494,"props":1612,"children":1613},{},[1614],{"type":47,"value":1540},{"type":42,"tag":1494,"props":1616,"children":1617},{},[1618],{"type":47,"value":1540},{"type":42,"tag":1494,"props":1620,"children":1621},{},[1622],{"type":47,"value":1503},{"type":42,"tag":1494,"props":1624,"children":1625},{},[1626],{"type":47,"value":1583},{"type":42,"tag":1482,"props":1628,"children":1629},{"separator":1484},[1630],{"type":47,"value":1487},{"type":42,"tag":1476,"props":1632,"children":1633},{},[1634],{"type":47,"value":439},{"type":42,"tag":1482,"props":1636,"children":1637},{"stretchy":1598},[1638],{"type":47,"value":1639},")",{"type":42,"tag":1494,"props":1641,"children":1643},{"mathvariant":1642},"normal",[1644],{"type":47,"value":1645},".",{"type":42,"tag":1494,"props":1647,"children":1648},{},[1649],{"type":47,"value":1606},{"type":42,"tag":1494,"props":1651,"children":1652},{},[1653],{"type":47,"value":1574},{"type":42,"tag":1494,"props":1655,"children":1656},{},[1657],{"type":47,"value":1583},{"type":42,"tag":1494,"props":1659,"children":1660},{},[1661],{"type":47,"value":1569},{"type":42,"tag":1494,"props":1663,"children":1664},{},[1665],{"type":47,"value":1564},{"type":42,"tag":1494,"props":1667,"children":1668},{},[1669],{"type":47,"value":1521},{"type":42,"tag":1494,"props":1671,"children":1672},{},[1673],{"type":47,"value":1526},{"type":42,"tag":1494,"props":1675,"children":1676},{},[1677],{"type":47,"value":1545},{"type":42,"tag":1494,"props":1679,"children":1680},{},[1681],{"type":47,"value":1550},{"type":42,"tag":1494,"props":1683,"children":1684},{},[1685],{"type":47,"value":1569},{"type":42,"tag":1494,"props":1687,"children":1688},{},[1689],{"type":47,"value":1540},{"type":42,"tag":1494,"props":1691,"children":1692},{},[1693],{"type":47,"value":1569},{"type":42,"tag":1494,"props":1695,"children":1696},{},[1697],{"type":47,"value":43},{"type":42,"tag":1494,"props":1699,"children":1700},{},[1701],{"type":47,"value":1521},{"type":42,"tag":1494,"props":1703,"children":1704},{},[1705],{"type":47,"value":1540},{"type":42,"tag":1494,"props":1707,"children":1708},{},[1709],{"type":47,"value":1545},{"type":42,"tag":1494,"props":1711,"children":1712},{},[1713],{"type":47,"value":1498},{"type":42,"tag":1494,"props":1715,"children":1716},{},[1717],{"type":47,"value":1718},"y",{"type":42,"tag":1494,"props":1720,"children":1721},{},[1722],{"type":47,"value":1545},{"type":42,"tag":1494,"props":1724,"children":1725},{},[1726],{"type":47,"value":1550},{"type":42,"tag":1494,"props":1728,"children":1729},{},[1730],{"type":47,"value":1569},{"type":42,"tag":1494,"props":1732,"children":1733},{},[1734],{"type":47,"value":1735},"C",{"type":42,"tag":1494,"props":1737,"children":1738},{},[1739],{"type":47,"value":1550},{"type":42,"tag":1494,"props":1741,"children":1742},{},[1743],{"type":47,"value":1503},{"type":42,"tag":1494,"props":1745,"children":1746},{},[1747],{"type":47,"value":1526},{"type":42,"tag":1494,"props":1749,"children":1750},{},[1751],{"type":47,"value":1569},{"type":42,"tag":1494,"props":1753,"children":1754},{},[1755],{"type":47,"value":1583},{"type":42,"tag":1494,"props":1757,"children":1758},{},[1759],{"type":47,"value":1569},{"type":42,"tag":1494,"props":1761,"children":1762},{},[1763],{"type":47,"value":1764},"M",{"type":42,"tag":1494,"props":1766,"children":1767},{},[1768],{"type":47,"value":1503},{"type":42,"tag":1494,"props":1770,"children":1771},{},[1772],{"type":47,"value":1526},{"type":42,"tag":1494,"props":1774,"children":1775},{},[1776],{"type":47,"value":1503},{"type":42,"tag":1494,"props":1778,"children":1779},{},[1780],{"type":47,"value":1583},{"type":42,"tag":1494,"props":1782,"children":1783},{},[1784],{"type":47,"value":1545},{"type":42,"tag":1494,"props":1786,"children":1787},{},[1788],{"type":47,"value":1540},{"type":42,"tag":1494,"props":1790,"children":1791},{},[1792],{"type":47,"value":1718},{"type":42,"tag":1494,"props":1794,"children":1795},{},[1796],{"type":47,"value":1521},{"type":42,"tag":1494,"props":1798,"children":1799},{},[1800],{"type":47,"value":1559},{"type":42,"tag":1494,"props":1802,"children":1803},{},[1804],{"type":47,"value":1735},{"type":42,"tag":1494,"props":1806,"children":1807},{},[1808],{"type":47,"value":1521},{"type":42,"tag":1494,"props":1810,"children":1811},{},[1812],{"type":47,"value":1813},"m",{"type":42,"tag":1494,"props":1815,"children":1816},{},[1817],{"type":47,"value":1813},{"type":42,"tag":1494,"props":1819,"children":1820},{},[1821],{"type":47,"value":1569},{"type":42,"tag":1494,"props":1823,"children":1824},{},[1825],{"type":47,"value":1540},{"type":42,"tag":1494,"props":1827,"children":1828},{},[1829],{"type":47,"value":1830},"c",{"type":42,"tag":1494,"props":1832,"children":1833},{},[1834],{"type":47,"value":1569},{"type":42,"tag":1482,"props":1836,"children":1837},{"stretchy":1598},[1838],{"type":47,"value":1601},{"type":42,"tag":1494,"props":1840,"children":1841},{},[1842],{"type":47,"value":1735},{"type":42,"tag":1494,"props":1844,"children":1845},{},[1846],{"type":47,"value":1550},{"type":42,"tag":1494,"props":1848,"children":1849},{},[1850],{"type":47,"value":1503},{"type":42,"tag":1494,"props":1852,"children":1853},{},[1854],{"type":47,"value":1526},{"type":42,"tag":1494,"props":1856,"children":1857},{},[1858],{"type":47,"value":1569},{"type":42,"tag":1494,"props":1860,"children":1861},{},[1862],{"type":47,"value":1583},{"type":42,"tag":1494,"props":1864,"children":1865},{},[1866],{"type":47,"value":1569},{"type":42,"tag":1494,"props":1868,"children":1869},{},[1870],{"type":47,"value":1764},{"type":42,"tag":1494,"props":1872,"children":1873},{},[1874],{"type":47,"value":1503},{"type":42,"tag":1494,"props":1876,"children":1877},{},[1878],{"type":47,"value":1526},{"type":42,"tag":1494,"props":1880,"children":1881},{},[1882],{"type":47,"value":1503},{"type":42,"tag":1494,"props":1884,"children":1885},{},[1886],{"type":47,"value":1583},{"type":42,"tag":1494,"props":1888,"children":1889},{},[1890],{"type":47,"value":1545},{"type":42,"tag":1494,"props":1892,"children":1893},{},[1894],{"type":47,"value":1540},{"type":42,"tag":1494,"props":1896,"children":1897},{},[1898],{"type":47,"value":1718},{"type":42,"tag":1494,"props":1900,"children":1901},{},[1902],{"type":47,"value":1521},{"type":42,"tag":1494,"props":1904,"children":1905},{},[1906],{"type":47,"value":1559},{"type":42,"tag":1494,"props":1908,"children":1909},{},[1910],{"type":47,"value":1735},{"type":42,"tag":1494,"props":1912,"children":1913},{},[1914],{"type":47,"value":1521},{"type":42,"tag":1494,"props":1916,"children":1917},{},[1918],{"type":47,"value":1813},{"type":42,"tag":1494,"props":1920,"children":1921},{},[1922],{"type":47,"value":1813},{"type":42,"tag":1494,"props":1924,"children":1925},{},[1926],{"type":47,"value":1569},{"type":42,"tag":1494,"props":1928,"children":1929},{},[1930],{"type":47,"value":1540},{"type":42,"tag":1494,"props":1932,"children":1933},{},[1934],{"type":47,"value":1830},{"type":42,"tag":1494,"props":1936,"children":1937},{},[1938],{"type":47,"value":1569},{"type":42,"tag":1482,"props":1940,"children":1941},{"separator":1484},[1942],{"type":47,"value":1487},{"type":42,"tag":1476,"props":1944,"children":1945},{},[1946],{"type":47,"value":705},{"type":42,"tag":1482,"props":1948,"children":1949},{"stretchy":1598},[1950],{"type":47,"value":1639},{"type":42,"tag":1482,"props":1952,"children":1953},{"separator":1484},[1954],{"type":47,"value":1487},{"type":42,"tag":1494,"props":1956,"children":1957},{},[1958],{"type":47,"value":1545},{"type":42,"tag":1494,"props":1960,"children":1961},{},[1962],{"type":47,"value":1550},{"type":42,"tag":1494,"props":1964,"children":1965},{},[1966],{"type":47,"value":1569},{"type":42,"tag":1494,"props":1968,"children":1969},{},[1970],{"type":47,"value":1540},{"type":42,"tag":1494,"props":1972,"children":1973},{},[1974],{"type":47,"value":1569},{"type":42,"tag":1494,"props":1976,"children":1977},{},[1978],{"type":47,"value":1531},{"type":42,"tag":1494,"props":1980,"children":1981},{},[1982],{"type":47,"value":1569},{"type":42,"tag":1494,"props":1984,"children":1985},{},[1986],{"type":47,"value":1540},{"type":42,"tag":1494,"props":1988,"children":1989},{},[1990],{"type":47,"value":1569},{"type":42,"tag":1476,"props":1992,"children":1993},{},[1994],{"type":47,"value":1995},"22",{"type":42,"tag":1482,"props":1997,"children":1998},{"separator":1484},[1999],{"type":47,"value":1487},{"type":42,"tag":1476,"props":2001,"children":2002},{},[2003],{"type":47,"value":2004},"819",{"type":42,"tag":1494,"props":2006,"children":2007},{},[2008],{"type":47,"value":1559},{"type":42,"tag":1494,"props":2010,"children":2011},{},[2012],{"type":47,"value":1521},{"type":42,"tag":1494,"props":2014,"children":2015},{},[2016],{"type":47,"value":1540},{"type":42,"tag":1494,"props":2018,"children":2019},{},[2020],{"type":47,"value":1569},{"type":42,"tag":1494,"props":2022,"children":2023},{},[2024],{"type":47,"value":1503},{"type":42,"tag":1494,"props":2026,"children":2027},{},[2028],{"type":47,"value":2029},"g",{"type":42,"tag":1494,"props":2031,"children":2032},{},[2033],{"type":47,"value":1526},{"type":42,"tag":1494,"props":2035,"children":2036},{},[2037],{"type":47,"value":1503},{"type":42,"tag":1494,"props":2039,"children":2040},{},[2041],{"type":47,"value":1526},{"type":42,"tag":1494,"props":2043,"children":2044},{},[2045],{"type":47,"value":2046},"v",{"type":42,"tag":1494,"props":2048,"children":2049},{},[2050],{"type":47,"value":1569},{"type":42,"tag":1494,"props":2052,"children":2053},{},[2054],{"type":47,"value":1583},{"type":42,"tag":1494,"props":2056,"children":2057},{},[2058],{"type":47,"value":1545},{"type":42,"tag":1494,"props":2060,"children":2061},{},[2062],{"type":47,"value":1569},{"type":42,"tag":1494,"props":2064,"children":2065},{},[2066],{"type":47,"value":1564},{"type":42,"tag":1494,"props":2068,"children":2069},{},[2070],{"type":47,"value":1830},{"type":42,"tag":1494,"props":2072,"children":2073},{},[2074],{"type":47,"value":1521},{"type":42,"tag":1494,"props":2076,"children":2077},{},[2078],{"type":47,"value":1813},{"type":42,"tag":1494,"props":2080,"children":2081},{},[2082],{"type":47,"value":43},{"type":42,"tag":1494,"props":2084,"children":2085},{},[2086],{"type":47,"value":1574},{"type":42,"tag":1494,"props":2088,"children":2089},{},[2090],{"type":47,"value":1526},{"type":42,"tag":1494,"props":2092,"children":2093},{},[2094],{"type":47,"value":1503},{"type":42,"tag":1494,"props":2096,"children":2097},{},[2098],{"type":47,"value":1569},{"type":42,"tag":1494,"props":2100,"children":2101},{},[2102],{"type":47,"value":1583},{"type":42,"tag":1494,"props":2104,"children":2105},{},[2106],{"type":47,"value":1503},{"type":42,"tag":1494,"props":2108,"children":2109},{},[2110],{"type":47,"value":1526},{"type":42,"tag":1494,"props":2112,"children":2113},{},[2114],{"type":47,"value":1735},{"type":42,"tag":1494,"props":2116,"children":2117},{},[2118],{"type":47,"value":1550},{"type":42,"tag":1494,"props":2120,"children":2121},{},[2122],{"type":47,"value":1503},{"type":42,"tag":1494,"props":2124,"children":2125},{},[2126],{"type":47,"value":1526},{"type":42,"tag":1494,"props":2128,"children":2129},{},[2130],{"type":47,"value":1574},{"type":42,"tag":1494,"props":2132,"children":2133},{},[2134],{"type":47,"value":1574},{"type":42,"tag":1494,"props":2136,"children":2137},{},[2138],{"type":47,"value":1526},{"type":42,"tag":1494,"props":2140,"children":2141},{},[2142],{"type":47,"value":1564},{"type":42,"tag":1494,"props":2144,"children":2145},{},[2146],{"type":47,"value":1545},{"type":42,"tag":1494,"props":2148,"children":2149},{},[2150],{"type":47,"value":1550},{"type":42,"tag":1494,"props":2152,"children":2153},{},[2154],{"type":47,"value":1569},{"type":42,"tag":1494,"props":2156,"children":2157},{},[2158],{"type":47,"value":1559},{"type":42,"tag":1494,"props":2160,"children":2161},{},[2162],{"type":47,"value":1521},{"type":42,"tag":1494,"props":2164,"children":2165},{},[2166],{"type":47,"value":1540},{"type":42,"tag":1494,"props":2168,"children":2169},{},[2170],{"type":47,"value":1569},{"type":42,"tag":1494,"props":2172,"children":2173},{},[2174],{"type":47,"value":1503},{"type":42,"tag":1494,"props":2176,"children":2177},{},[2178],{"type":47,"value":2029},{"type":42,"tag":1494,"props":2180,"children":2181},{},[2182],{"type":47,"value":1526},{"type":42,"tag":1494,"props":2184,"children":2185},{},[2186],{"type":47,"value":1830},{"type":42,"tag":1494,"props":2188,"children":2189},{},[2190],{"type":47,"value":1574},{"type":42,"tag":1494,"props":2192,"children":2193},{},[2194],{"type":47,"value":43},{"type":42,"tag":1494,"props":2196,"children":2197},{},[2198],{"type":47,"value":1503},{"type":42,"tag":1494,"props":2200,"children":2201},{},[2202],{"type":47,"value":1545},{"type":42,"tag":1494,"props":2204,"children":2205},{},[2206],{"type":47,"value":1574},{"type":42,"tag":1494,"props":2208,"children":2209},{},[2210],{"type":47,"value":1508},{"type":42,"tag":1494,"props":2212,"children":2213},{},[2214],{"type":47,"value":1574},{"type":42,"tag":1494,"props":2216,"children":2217},{},[2218],{"type":47,"value":1813},{"type":42,"tag":1494,"props":2220,"children":2221},{},[2222],{"type":47,"value":1521},{"type":42,"tag":1494,"props":2224,"children":2225},{},[2226],{"type":47,"value":2227},"u",{"type":42,"tag":1494,"props":2229,"children":2230},{},[2231],{"type":47,"value":1526},{"type":42,"tag":1494,"props":2233,"children":2234},{},[2235],{"type":47,"value":1545},{"type":42,"tag":1494,"props":2237,"children":2238},{},[2239],{"type":47,"value":1540},{"type":42,"tag":1494,"props":2241,"children":2242},{},[2243],{"type":47,"value":1569},{"type":42,"tag":1494,"props":2245,"children":2246},{},[2247],{"type":47,"value":1574},{"type":42,"tag":1494,"props":2249,"children":2250},{},[2251],{"type":47,"value":1830},{"type":42,"tag":1494,"props":2253,"children":2254},{},[2255],{"type":47,"value":1550},{"type":42,"tag":1494,"props":2257,"children":2258},{},[2259],{"type":47,"value":1569},{"type":42,"tag":1494,"props":2261,"children":2262},{},[2263],{"type":47,"value":1564},{"type":42,"tag":2265,"props":2266,"children":2268},"annotation",{"encoding":2267},"application\u002Fx-tex",[2269],{"type":47,"value":2270},"2,561.9 billion worth of deals in 2012 (Barris, 2013). Based on the report by the Chinese Ministry of Commerce (Chinese Ministry of Commerce, 2014), there were 22,819 foreign invested companies in China and the foreign capital amount reached ",{"type":42,"tag":809,"props":2272,"children":2275},{"className":2273,"ariaHidden":1484},[2274],"katex-html",[2276],{"type":42,"tag":809,"props":2277,"children":2280},{"className":2278},[2279],"base",[2281,2287,2293,2299,2305,2310,2317,2323,2328,2333,2338,2343,2349,2356,2361,2366,2371,2377,2382,2387,2392,2397,2402,2408,2413,2419,2425,2430,2435,2440,2445,2450,2455,2459,2464,2470,2475,2480,2485,2491,2496,2501,2506,2511,2516,2522,2527,2532,2537,2542,2547,2553,2558,2563,2568,2574,2580,2586,2592,2598,2603,2608,2613,2618,2623,2628,2633,2638,2644,2649,2655,2660,2665,2670,2675,2680,2685,2690,2695,2700,2705,2710,2715,2720,2725,2730,2735,2740,2745,2749,2754,2759,2764,2768,2773,2778,2783,2788,2793,2798,2803,2808,2813,2817,2822,2827,2832,2837,2842,2847,2853,2858,2864,2869,2874,2879,2885,2890,2895,2901,2906,2911,2916,2922,2927,2932,2937,2942,2947,2952,2957,2962,2967,2972,2977,2982,2987,2992,2997,3002,3007,3013,3018,3023,3028,3033,3038,3043,3048,3053,3058,3063],{"type":42,"tag":809,"props":2282,"children":2286},{"className":2283,"style":2285},[2284],"strut","height:1em;vertical-align:-0.25em;",[],{"type":42,"tag":809,"props":2288,"children":2291},{"className":2289},[2290],"mord",[2292],{"type":47,"value":1480},{"type":42,"tag":809,"props":2294,"children":2297},{"className":2295},[2296],"mpunct",[2298],{"type":47,"value":1487},{"type":42,"tag":809,"props":2300,"children":2304},{"className":2301,"style":2303},[2302],"mspace","margin-right:0.1667em;",[],{"type":42,"tag":809,"props":2306,"children":2308},{"className":2307},[2290],[2309],{"type":47,"value":1492},{"type":42,"tag":809,"props":2311,"children":2314},{"className":2312},[2290,2313],"mathnormal",[2315],{"type":47,"value":2316},"bi",{"type":42,"tag":809,"props":2318,"children":2321},{"className":2319,"style":2320},[2290,2313],"margin-right:0.0197em;",[2322],{"type":47,"value":1508},{"type":42,"tag":809,"props":2324,"children":2326},{"className":2325,"style":2320},[2290,2313],[2327],{"type":47,"value":1508},{"type":42,"tag":809,"props":2329,"children":2331},{"className":2330},[2290,2313],[2332],{"type":47,"value":1503},{"type":42,"tag":809,"props":2334,"children":2336},{"className":2335},[2290,2313],[2337],{"type":47,"value":1521},{"type":42,"tag":809,"props":2339,"children":2341},{"className":2340},[2290,2313],[2342],{"type":47,"value":1526},{"type":42,"tag":809,"props":2344,"children":2347},{"className":2345,"style":2346},[2290,2313],"margin-right:0.0269em;",[2348],{"type":47,"value":1531},{"type":42,"tag":809,"props":2350,"children":2353},{"className":2351,"style":2352},[2290,2313],"margin-right:0.0278em;",[2354],{"type":47,"value":2355},"or",{"type":42,"tag":809,"props":2357,"children":2359},{"className":2358},[2290,2313],[2360],{"type":47,"value":1545},{"type":42,"tag":809,"props":2362,"children":2364},{"className":2363},[2290,2313],[2365],{"type":47,"value":1550},{"type":42,"tag":809,"props":2367,"children":2369},{"className":2368},[2290,2313],[2370],{"type":47,"value":1521},{"type":42,"tag":809,"props":2372,"children":2375},{"className":2373,"style":2374},[2290,2313],"margin-right:0.1076em;",[2376],{"type":47,"value":1559},{"type":42,"tag":809,"props":2378,"children":2380},{"className":2379},[2290,2313],[2381],{"type":47,"value":1564},{"type":42,"tag":809,"props":2383,"children":2385},{"className":2384},[2290,2313],[2386],{"type":47,"value":1569},{"type":42,"tag":809,"props":2388,"children":2390},{"className":2389},[2290,2313],[2391],{"type":47,"value":1574},{"type":42,"tag":809,"props":2393,"children":2395},{"className":2394,"style":2320},[2290,2313],[2396],{"type":47,"value":1508},{"type":42,"tag":809,"props":2398,"children":2400},{"className":2399},[2290,2313],[2401],{"type":47,"value":1583},{"type":42,"tag":809,"props":2403,"children":2405},{"className":2404},[2290,2313],[2406],{"type":47,"value":2407},"in",{"type":42,"tag":809,"props":2409,"children":2411},{"className":2410},[2290],[2412],{"type":47,"value":342},{"type":42,"tag":809,"props":2414,"children":2417},{"className":2415},[2416],"mopen",[2418],{"type":47,"value":1601},{"type":42,"tag":809,"props":2420,"children":2423},{"className":2421,"style":2422},[2290,2313],"margin-right:0.0502em;",[2424],{"type":47,"value":1606},{"type":42,"tag":809,"props":2426,"children":2428},{"className":2427},[2290,2313],[2429],{"type":47,"value":1574},{"type":42,"tag":809,"props":2431,"children":2433},{"className":2432,"style":2352},[2290,2313],[2434],{"type":47,"value":1540},{"type":42,"tag":809,"props":2436,"children":2438},{"className":2437,"style":2352},[2290,2313],[2439],{"type":47,"value":1540},{"type":42,"tag":809,"props":2441,"children":2443},{"className":2442},[2290,2313],[2444],{"type":47,"value":1503},{"type":42,"tag":809,"props":2446,"children":2448},{"className":2447},[2290,2313],[2449],{"type":47,"value":1583},{"type":42,"tag":809,"props":2451,"children":2453},{"className":2452},[2296],[2454],{"type":47,"value":1487},{"type":42,"tag":809,"props":2456,"children":2458},{"className":2457,"style":2303},[2302],[],{"type":42,"tag":809,"props":2460,"children":2462},{"className":2461},[2290],[2463],{"type":47,"value":439},{"type":42,"tag":809,"props":2465,"children":2468},{"className":2466},[2467],"mclose",[2469],{"type":47,"value":1639},{"type":42,"tag":809,"props":2471,"children":2473},{"className":2472},[2290],[2474],{"type":47,"value":1645},{"type":42,"tag":809,"props":2476,"children":2478},{"className":2477,"style":2422},[2290,2313],[2479],{"type":47,"value":1606},{"type":42,"tag":809,"props":2481,"children":2483},{"className":2482},[2290,2313],[2484],{"type":47,"value":1574},{"type":42,"tag":809,"props":2486,"children":2488},{"className":2487},[2290,2313],[2489],{"type":47,"value":2490},"se",{"type":42,"tag":809,"props":2492,"children":2494},{"className":2493},[2290,2313],[2495],{"type":47,"value":1564},{"type":42,"tag":809,"props":2497,"children":2499},{"className":2498},[2290,2313],[2500],{"type":47,"value":1521},{"type":42,"tag":809,"props":2502,"children":2504},{"className":2503},[2290,2313],[2505],{"type":47,"value":1526},{"type":42,"tag":809,"props":2507,"children":2509},{"className":2508},[2290,2313],[2510],{"type":47,"value":1545},{"type":42,"tag":809,"props":2512,"children":2514},{"className":2513},[2290,2313],[2515],{"type":47,"value":1550},{"type":42,"tag":809,"props":2517,"children":2519},{"className":2518,"style":2352},[2290,2313],[2520],{"type":47,"value":2521},"er",{"type":42,"tag":809,"props":2523,"children":2525},{"className":2524},[2290,2313],[2526],{"type":47,"value":1569},{"type":42,"tag":809,"props":2528,"children":2530},{"className":2529},[2290,2313],[2531],{"type":47,"value":43},{"type":42,"tag":809,"props":2533,"children":2535},{"className":2534,"style":2352},[2290,2313],[2536],{"type":47,"value":2355},{"type":42,"tag":809,"props":2538,"children":2540},{"className":2539},[2290,2313],[2541],{"type":47,"value":1545},{"type":42,"tag":809,"props":2543,"children":2545},{"className":2544},[2290,2313],[2546],{"type":47,"value":1498},{"type":42,"tag":809,"props":2548,"children":2551},{"className":2549,"style":2550},[2290,2313],"margin-right:0.0359em;",[2552],{"type":47,"value":1718},{"type":42,"tag":809,"props":2554,"children":2556},{"className":2555},[2290,2313],[2557],{"type":47,"value":1545},{"type":42,"tag":809,"props":2559,"children":2561},{"className":2560},[2290,2313],[2562],{"type":47,"value":1550},{"type":42,"tag":809,"props":2564,"children":2566},{"className":2565},[2290,2313],[2567],{"type":47,"value":1569},{"type":42,"tag":809,"props":2569,"children":2572},{"className":2570,"style":2571},[2290,2313],"margin-right:0.0715em;",[2573],{"type":47,"value":1735},{"type":42,"tag":809,"props":2575,"children":2577},{"className":2576},[2290,2313],[2578],{"type":47,"value":2579},"hin",{"type":42,"tag":809,"props":2581,"children":2583},{"className":2582},[2290,2313],[2584],{"type":47,"value":2585},"ese",{"type":42,"tag":809,"props":2587,"children":2590},{"className":2588,"style":2589},[2290,2313],"margin-right:0.109em;",[2591],{"type":47,"value":1764},{"type":42,"tag":809,"props":2593,"children":2595},{"className":2594},[2290,2313],[2596],{"type":47,"value":2597},"ini",{"type":42,"tag":809,"props":2599,"children":2601},{"className":2600},[2290,2313],[2602],{"type":47,"value":1583},{"type":42,"tag":809,"props":2604,"children":2606},{"className":2605},[2290,2313],[2607],{"type":47,"value":1545},{"type":42,"tag":809,"props":2609,"children":2611},{"className":2610,"style":2352},[2290,2313],[2612],{"type":47,"value":1540},{"type":42,"tag":809,"props":2614,"children":2616},{"className":2615,"style":2550},[2290,2313],[2617],{"type":47,"value":1718},{"type":42,"tag":809,"props":2619,"children":2621},{"className":2620},[2290,2313],[2622],{"type":47,"value":1521},{"type":42,"tag":809,"props":2624,"children":2626},{"className":2625,"style":2374},[2290,2313],[2627],{"type":47,"value":1559},{"type":42,"tag":809,"props":2629,"children":2631},{"className":2630,"style":2571},[2290,2313],[2632],{"type":47,"value":1735},{"type":42,"tag":809,"props":2634,"children":2636},{"className":2635},[2290,2313],[2637],{"type":47,"value":1521},{"type":42,"tag":809,"props":2639,"children":2641},{"className":2640},[2290,2313],[2642],{"type":47,"value":2643},"mm",{"type":42,"tag":809,"props":2645,"children":2647},{"className":2646,"style":2352},[2290,2313],[2648],{"type":47,"value":2521},{"type":42,"tag":809,"props":2650,"children":2652},{"className":2651},[2290,2313],[2653],{"type":47,"value":2654},"ce",{"type":42,"tag":809,"props":2656,"children":2658},{"className":2657},[2416],[2659],{"type":47,"value":1601},{"type":42,"tag":809,"props":2661,"children":2663},{"className":2662,"style":2571},[2290,2313],[2664],{"type":47,"value":1735},{"type":42,"tag":809,"props":2666,"children":2668},{"className":2667},[2290,2313],[2669],{"type":47,"value":2579},{"type":42,"tag":809,"props":2671,"children":2673},{"className":2672},[2290,2313],[2674],{"type":47,"value":2585},{"type":42,"tag":809,"props":2676,"children":2678},{"className":2677,"style":2589},[2290,2313],[2679],{"type":47,"value":1764},{"type":42,"tag":809,"props":2681,"children":2683},{"className":2682},[2290,2313],[2684],{"type":47,"value":2597},{"type":42,"tag":809,"props":2686,"children":2688},{"className":2687},[2290,2313],[2689],{"type":47,"value":1583},{"type":42,"tag":809,"props":2691,"children":2693},{"className":2692},[2290,2313],[2694],{"type":47,"value":1545},{"type":42,"tag":809,"props":2696,"children":2698},{"className":2697,"style":2352},[2290,2313],[2699],{"type":47,"value":1540},{"type":42,"tag":809,"props":2701,"children":2703},{"className":2702,"style":2550},[2290,2313],[2704],{"type":47,"value":1718},{"type":42,"tag":809,"props":2706,"children":2708},{"className":2707},[2290,2313],[2709],{"type":47,"value":1521},{"type":42,"tag":809,"props":2711,"children":2713},{"className":2712,"style":2374},[2290,2313],[2714],{"type":47,"value":1559},{"type":42,"tag":809,"props":2716,"children":2718},{"className":2717,"style":2571},[2290,2313],[2719],{"type":47,"value":1735},{"type":42,"tag":809,"props":2721,"children":2723},{"className":2722},[2290,2313],[2724],{"type":47,"value":1521},{"type":42,"tag":809,"props":2726,"children":2728},{"className":2727},[2290,2313],[2729],{"type":47,"value":2643},{"type":42,"tag":809,"props":2731,"children":2733},{"className":2732,"style":2352},[2290,2313],[2734],{"type":47,"value":2521},{"type":42,"tag":809,"props":2736,"children":2738},{"className":2737},[2290,2313],[2739],{"type":47,"value":2654},{"type":42,"tag":809,"props":2741,"children":2743},{"className":2742},[2296],[2744],{"type":47,"value":1487},{"type":42,"tag":809,"props":2746,"children":2748},{"className":2747,"style":2303},[2302],[],{"type":42,"tag":809,"props":2750,"children":2752},{"className":2751},[2290],[2753],{"type":47,"value":705},{"type":42,"tag":809,"props":2755,"children":2757},{"className":2756},[2467],[2758],{"type":47,"value":1639},{"type":42,"tag":809,"props":2760,"children":2762},{"className":2761},[2296],[2763],{"type":47,"value":1487},{"type":42,"tag":809,"props":2765,"children":2767},{"className":2766,"style":2303},[2302],[],{"type":42,"tag":809,"props":2769,"children":2771},{"className":2770},[2290,2313],[2772],{"type":47,"value":1545},{"type":42,"tag":809,"props":2774,"children":2776},{"className":2775},[2290,2313],[2777],{"type":47,"value":1550},{"type":42,"tag":809,"props":2779,"children":2781},{"className":2780,"style":2352},[2290,2313],[2782],{"type":47,"value":2521},{"type":42,"tag":809,"props":2784,"children":2786},{"className":2785},[2290,2313],[2787],{"type":47,"value":1569},{"type":42,"tag":809,"props":2789,"children":2791},{"className":2790,"style":2346},[2290,2313],[2792],{"type":47,"value":1531},{"type":42,"tag":809,"props":2794,"children":2796},{"className":2795,"style":2352},[2290,2313],[2797],{"type":47,"value":2521},{"type":42,"tag":809,"props":2799,"children":2801},{"className":2800},[2290,2313],[2802],{"type":47,"value":1569},{"type":42,"tag":809,"props":2804,"children":2806},{"className":2805},[2290],[2807],{"type":47,"value":1995},{"type":42,"tag":809,"props":2809,"children":2811},{"className":2810},[2296],[2812],{"type":47,"value":1487},{"type":42,"tag":809,"props":2814,"children":2816},{"className":2815,"style":2303},[2302],[],{"type":42,"tag":809,"props":2818,"children":2820},{"className":2819},[2290],[2821],{"type":47,"value":2004},{"type":42,"tag":809,"props":2823,"children":2825},{"className":2824,"style":2374},[2290,2313],[2826],{"type":47,"value":1559},{"type":42,"tag":809,"props":2828,"children":2830},{"className":2829,"style":2352},[2290,2313],[2831],{"type":47,"value":2355},{"type":42,"tag":809,"props":2833,"children":2835},{"className":2834},[2290,2313],[2836],{"type":47,"value":1569},{"type":42,"tag":809,"props":2838,"children":2840},{"className":2839},[2290,2313],[2841],{"type":47,"value":1503},{"type":42,"tag":809,"props":2843,"children":2845},{"className":2844,"style":2550},[2290,2313],[2846],{"type":47,"value":2029},{"type":42,"tag":809,"props":2848,"children":2850},{"className":2849},[2290,2313],[2851],{"type":47,"value":2852},"nin",{"type":42,"tag":809,"props":2854,"children":2856},{"className":2855,"style":2550},[2290,2313],[2857],{"type":47,"value":2046},{"type":42,"tag":809,"props":2859,"children":2861},{"className":2860},[2290,2313],[2862],{"type":47,"value":2863},"es",{"type":42,"tag":809,"props":2865,"children":2867},{"className":2866},[2290,2313],[2868],{"type":47,"value":1545},{"type":42,"tag":809,"props":2870,"children":2872},{"className":2871},[2290,2313],[2873],{"type":47,"value":1569},{"type":42,"tag":809,"props":2875,"children":2877},{"className":2876},[2290,2313],[2878],{"type":47,"value":1564},{"type":42,"tag":809,"props":2880,"children":2882},{"className":2881},[2290,2313],[2883],{"type":47,"value":2884},"co",{"type":42,"tag":809,"props":2886,"children":2888},{"className":2887},[2290,2313],[2889],{"type":47,"value":1813},{"type":42,"tag":809,"props":2891,"children":2893},{"className":2892},[2290,2313],[2894],{"type":47,"value":43},{"type":42,"tag":809,"props":2896,"children":2898},{"className":2897},[2290,2313],[2899],{"type":47,"value":2900},"ani",{"type":42,"tag":809,"props":2902,"children":2904},{"className":2903},[2290,2313],[2905],{"type":47,"value":2863},{"type":42,"tag":809,"props":2907,"children":2909},{"className":2908},[2290,2313],[2910],{"type":47,"value":2407},{"type":42,"tag":809,"props":2912,"children":2914},{"className":2913,"style":2571},[2290,2313],[2915],{"type":47,"value":1735},{"type":42,"tag":809,"props":2917,"children":2919},{"className":2918},[2290,2313],[2920],{"type":47,"value":2921},"hinaan",{"type":42,"tag":809,"props":2923,"children":2925},{"className":2924},[2290,2313],[2926],{"type":47,"value":1564},{"type":42,"tag":809,"props":2928,"children":2930},{"className":2929},[2290,2313],[2931],{"type":47,"value":1545},{"type":42,"tag":809,"props":2933,"children":2935},{"className":2934},[2290,2313],[2936],{"type":47,"value":1550},{"type":42,"tag":809,"props":2938,"children":2940},{"className":2939},[2290,2313],[2941],{"type":47,"value":1569},{"type":42,"tag":809,"props":2943,"children":2945},{"className":2944,"style":2374},[2290,2313],[2946],{"type":47,"value":1559},{"type":42,"tag":809,"props":2948,"children":2950},{"className":2949,"style":2352},[2290,2313],[2951],{"type":47,"value":2355},{"type":42,"tag":809,"props":2953,"children":2955},{"className":2954},[2290,2313],[2956],{"type":47,"value":1569},{"type":42,"tag":809,"props":2958,"children":2960},{"className":2959},[2290,2313],[2961],{"type":47,"value":1503},{"type":42,"tag":809,"props":2963,"children":2965},{"className":2964,"style":2550},[2290,2313],[2966],{"type":47,"value":2029},{"type":42,"tag":809,"props":2968,"children":2970},{"className":2969},[2290,2313],[2971],{"type":47,"value":1526},{"type":42,"tag":809,"props":2973,"children":2975},{"className":2974},[2290,2313],[2976],{"type":47,"value":1830},{"type":42,"tag":809,"props":2978,"children":2980},{"className":2979},[2290,2313],[2981],{"type":47,"value":1574},{"type":42,"tag":809,"props":2983,"children":2985},{"className":2984},[2290,2313],[2986],{"type":47,"value":43},{"type":42,"tag":809,"props":2988,"children":2990},{"className":2989},[2290,2313],[2991],{"type":47,"value":1503},{"type":42,"tag":809,"props":2993,"children":2995},{"className":2994},[2290,2313],[2996],{"type":47,"value":1545},{"type":42,"tag":809,"props":2998,"children":3000},{"className":2999},[2290,2313],[3001],{"type":47,"value":1574},{"type":42,"tag":809,"props":3003,"children":3005},{"className":3004,"style":2320},[2290,2313],[3006],{"type":47,"value":1508},{"type":42,"tag":809,"props":3008,"children":3010},{"className":3009},[2290,2313],[3011],{"type":47,"value":3012},"am",{"type":42,"tag":809,"props":3014,"children":3016},{"className":3015},[2290,2313],[3017],{"type":47,"value":1521},{"type":42,"tag":809,"props":3019,"children":3021},{"className":3020},[2290,2313],[3022],{"type":47,"value":2227},{"type":42,"tag":809,"props":3024,"children":3026},{"className":3025},[2290,2313],[3027],{"type":47,"value":1526},{"type":42,"tag":809,"props":3029,"children":3031},{"className":3030},[2290,2313],[3032],{"type":47,"value":1545},{"type":42,"tag":809,"props":3034,"children":3036},{"className":3035,"style":2352},[2290,2313],[3037],{"type":47,"value":1540},{"type":42,"tag":809,"props":3039,"children":3041},{"className":3040},[2290,2313],[3042],{"type":47,"value":1569},{"type":42,"tag":809,"props":3044,"children":3046},{"className":3045},[2290,2313],[3047],{"type":47,"value":1574},{"type":42,"tag":809,"props":3049,"children":3051},{"className":3050},[2290,2313],[3052],{"type":47,"value":1830},{"type":42,"tag":809,"props":3054,"children":3056},{"className":3055},[2290,2313],[3057],{"type":47,"value":1550},{"type":42,"tag":809,"props":3059,"children":3061},{"className":3060},[2290,2313],[3062],{"type":47,"value":1569},{"type":42,"tag":809,"props":3064,"children":3066},{"className":3065},[2290,2313],[3067],{"type":47,"value":1564},{"type":47,"value":3069}," 1,239.11 billion by the end of 2013. Given its strategic geographical location, Hong Kong was the largest foreign investment partner of China, and their total investment value accounted for 59.23 per cent of the Chinese total foreign investment in 2013.",{"title":8,"searchDepth":49,"depth":49,"links":3071},[],"content:publications:2015:ownership-financial-constraints-and-firm-performance-foreign-acquisitions-of-chi.md","publications\u002F2015\u002Fownership-financial-constraints-and-firm-performance-foreign-acquisitions-of-chi.md","publications\u002F2015\u002Fownership-financial-constraints-and-firm-performance-foreign-acquisitions-of-chi",{"_path":3076,"_dir":1127,"_draft":7,"_partial":7,"_locale":8,"title":3077,"description":3078,"_hidden":7,"note-taking app\" authors":3079,"authors_orcid":3085,"year":1136,"doi":3090,"openalex_id":3091,"venue":21,"abstract_screenshot":21,"keywords":3092,"body":3097,"_type":51,"_id":3105,"_source":53,"_file":3106,"_stem":3107,"_extension":56,"locale":57},"\u002Fpublications\u002F2015\u002Fresearching-and-supporting-student-note-taking-building-a-multimedia-note-taking","Researching and supporting student note-taking: Building a multimedi","In late 2014 collaborative research was undertaken between colleagues in the departments of Computer Science, International Communications, the Centre for English language Education (CELE), and the Language Centre at a global higher education institution (HEI-A), located partly in mainland China. This research aims to explore student note-taking habits, especially in the context of more multimedia-intense content. As part of this, student note-taking habits have been observed and studied, and a software application is being developed which will both support student multimedia note-taking, and facilitate research into note-taking habits. An interesting aspect of this project has been the inclusion of HEI-A undergraduate computer science students as software developers. This paper outlines some findings of our research in terms of defining student note-taking habits, describes some of the issues we faced during the first stages of the project and gives a short description on how this application could be used for teaching and research purposes in the future.",[595,3080,3081,3082,3083,3084],"Foster, David A.","Gilardi, Filippo","Martín, Paul","White, Andy","Goria, Cecilia",[599,3086,3087,3088,21,3089],"0000-0003-0900-6946","0000-0002-5702-4391","0000-0002-3464-2103","0000-0002-4530-4038","https:\u002F\u002Fdoi.org\u002F10.1109\u002Ftale.2015.7386015","W2249001326",[133,3093,3094,23,3095,867,139,282,866,1380,865,1358,3096],"Inclusion (mineral)","Mainland China","Institution","Social science",{"type":39,"children":3098,"toc":3103},[3099],{"type":42,"tag":43,"props":3100,"children":3101},{},[3102],{"type":47,"value":3078},{"title":8,"searchDepth":49,"depth":49,"links":3104},[],"content:publications:2015:researching-and-supporting-student-note-taking-building-a-multimedia-note-taking.md","publications\u002F2015\u002Fresearching-and-supporting-student-note-taking-building-a-multimedia-note-taking.md","publications\u002F2015\u002Fresearching-and-supporting-student-note-taking-building-a-multimedia-note-taking",{"_path":3109,"_dir":1127,"_draft":7,"_partial":7,"_locale":8,"title":3110,"description":8,"_hidden":7,"authors":3111,"authors_orcid":3114,"year":1136,"doi":3117,"openalex_id":3118,"venue":3119,"abstract_screenshot":21,"keywords":3120,"body":3125,"_type":51,"_id":3129,"_source":53,"_file":3130,"_stem":3131,"_extension":56,"locale":57},"\u002Fpublications\u002F2015\u002Fsearch-based-qos-ranking-prediction-for-web-services-in-cloud-environments","Search-based QoS ranking prediction for web services in cloud environments",[1095,3112,595,648,3113],"Chen, Jifu","Xie, Xiaoyuan",[1099,3115,599,651,3116],"0000-0003-4529-5175","0000-0003-2828-7165","https:\u002F\u002Fdoi.org\u002F10.1016\u002Fj.future.2015.01.008","W2038540196","Future Generation Computer Systems",[23,210,3121,695,181,240,1106,3122,3123,747,215,3124,37,251,869],"Quality of service","Similarity (geometry)","Cloud computing","Ranking SVM",{"type":39,"children":3126,"toc":3127},[],{"title":8,"searchDepth":49,"depth":49,"links":3128},[],"content:publications:2015:search-based-qos-ranking-prediction-for-web-services-in-cloud-environments.md","publications\u002F2015\u002Fsearch-based-qos-ranking-prediction-for-web-services-in-cloud-environments.md","publications\u002F2015\u002Fsearch-based-qos-ranking-prediction-for-web-services-in-cloud-environments",{"_path":3133,"_dir":1127,"_draft":7,"_partial":7,"_locale":8,"title":3134,"description":3135,"_hidden":7,"and effectiveness in software testing\" authors":3136,"authors_orcid":3137,"year":1136,"doi":3138,"openalex_id":3139,"venue":21,"abstract_screenshot":21,"keywords":3140,"body":3147,"_type":51,"_id":3155,"_source":53,"_file":3156,"_stem":3157,"_extension":56,"locale":57},"\u002Fpublications\u002F2015\u002Fteaching-software-testing-skills-metamorphic-testing-as-vehicle-for-creativity-a","Teaching software testing skills: Metamorphic testing as vehicle for creativit","In spite of its importance to software quality, software testing is often considered the \"poor man\" of software engineering processes, left to the end of many projects, and frequently omitted altogether. Compounding this is the reported perception of testing as a menial, low-level job, lacking any need for creativity or ingenuity, and of much lower status and attractiveness than others, such as design and implementation. When teaching about software testing, instructors often face very unmotivated students, professing little or no interest in becoming testers. This tutorial will address some testing misconceptions, and, through Metamorphic Testing - a new approach to testing which alleviates some of the major challenges in the field (including the Oracle Problem) - will provide a fresh and exciting new perspective on software testing.",[595,596],[599,600],"https:\u002F\u002Fdoi.org\u002F10.1109\u002Ftale.2015.7386036","W2244052174",[605,3141,23,607,606,662,3142,139,1169,1164,3143,1165,3144,3145,3146,138,865,110],"System integration testing","Software reliability testing","Attractiveness","Ingenuity","White-box testing","Software performance testing",{"type":39,"children":3148,"toc":3153},[3149],{"type":42,"tag":43,"props":3150,"children":3151},{},[3152],{"type":47,"value":3135},{"title":8,"searchDepth":49,"depth":49,"links":3154},[],"content:publications:2015:teaching-software-testing-skills-metamorphic-testing-as-vehicle-for-creativity-a.md","publications\u002F2015\u002Fteaching-software-testing-skills-metamorphic-testing-as-vehicle-for-creativity-a.md","publications\u002F2015\u002Fteaching-software-testing-skills-metamorphic-testing-as-vehicle-for-creativity-a",{"_path":3159,"_dir":1127,"_draft":7,"_partial":7,"_locale":8,"title":3160,"description":3161,"_hidden":7,"authors":3162,"authors_orcid":3166,"year":1136,"doi":3170,"openalex_id":3171,"venue":21,"abstract_screenshot":21,"keywords":3172,"body":3177,"_type":51,"_id":3185,"_source":53,"_file":3186,"_stem":3187,"_extension":56,"locale":57},"\u002Fpublications\u002F2015\u002Fusing-partition-information-to-prioritize-test-cases-for-fault-localization","Using Partition Information to Prioritize Test Cases for Fault Localization","Fault Localization Prioritization (FLP) aims at reordering existing test cases so that the location of detected faulty components can be identified earlier, using certain fault localization techniques. Although some researchers have proposed adaptive prioritization strategies with white-box code coverage information, such information may not always be available. In this paper, we address the FLP problem using black-box information derived from partitioning the input domain. Based on the well-known technique of Spectra-Based Fault Localization (SBFL), three test case prioritization strategies are designed following some basic SBFL heuristics. The implementation of these proposed strategies relies only on the partition information, and does not require any test case execution history. Experiments show that our strategies, when compared with pure random selection, result in a faster localization of faulty statements, reducing the number of test case executions required. Here, we analyze the characteristics and merits of the three proposed strategies.",[3163,595,596,3164,3165],"Zhang, Xiaoyi","Zheng, Zheng","Cai, Kai‐Yuan",[3167,599,600,3168,3169],"0000-0001-5124-4919","0000-0001-7922-9067","0000-0001-5206-3933","https:\u002F\u002Fdoi.org\u002F10.1109\u002Fcompsac.2015.35","W1942859513",[23,506,656,3173,3174,658,657,1167,3175,3176,181,215,110,179],"Partition (number theory)","Debugging","Fault (geology)","Fault coverage",{"type":39,"children":3178,"toc":3183},[3179],{"type":42,"tag":43,"props":3180,"children":3181},{},[3182],{"type":47,"value":3161},{"title":8,"searchDepth":49,"depth":49,"links":3184},[],"content:publications:2015:using-partition-information-to-prioritize-test-cases-for-fault-localization.md","publications\u002F2015\u002Fusing-partition-information-to-prioritize-test-cases-for-fault-localization.md","publications\u002F2015\u002Fusing-partition-information-to-prioritize-test-cases-for-fault-localization",{"_path":3189,"_dir":3190,"_draft":7,"_partial":7,"_locale":8,"title":3191,"description":3192,"_hidden":7,"authors":3193,"authors_orcid":3194,"year":3195,"doi":3196,"openalex_id":3197,"venue":21,"abstract_screenshot":21,"keywords":3198,"body":3204,"_type":51,"_id":3212,"_source":53,"_file":3213,"_stem":3214,"_extension":56,"locale":57},"\u002Fpublications\u002F2016\u002Fa-dynamic-truck-dispatching-problem-in-marine-container-terminal","2016","A dynamic truck dispatching problem in marine container terminal","In this paper, a dynamic truck dispatching problem of a marine container terminal is described and discussed. In this problem, a few containers, encoded as work instructions, need to be transferred between yard blocks and vessels by a fleet of trucks. Both the yard blocks and the quay are equipped with cranes to support loading\u002Funloading operations. In order to service more vessels, any unnecessary idle time between quay crane (QC) operations need to be minimised to speed up the container transfer process. Due to the unpredictable port situations that can affect routing plans and the short calculation time allowed to generate one, static solution methods are not suitable for this problem. In this paper, we introduce a new mathematical model that minimises both the QC makespan and the truck travelling time. Three dynamic heuristics are proposed and a genetic algorithm hyperheuristic (GAHH) under development is also described. Experiment results show promising capabilities the GAHH may offer.",[523,12,908,319,13],[525,15,913,322,16],2016,"https:\u002F\u002Fdoi.org\u002F10.1109\u002Fssci.2016.7850081","W2583867918",[746,1189,506,23,3199,250,3200,3201,3202,106,1192,24,135,3203,179,752,251],"Terminal (telecommunication)","Idle","Job shop scheduling","Yard","Real-time computing",{"type":39,"children":3205,"toc":3210},[3206],{"type":42,"tag":43,"props":3207,"children":3208},{},[3209],{"type":47,"value":3192},{"title":8,"searchDepth":49,"depth":49,"links":3211},[],"content:publications:2016:a-dynamic-truck-dispatching-problem-in-marine-container-terminal.md","publications\u002F2016\u002Fa-dynamic-truck-dispatching-problem-in-marine-container-terminal.md","publications\u002F2016\u002Fa-dynamic-truck-dispatching-problem-in-marine-container-terminal",{"_path":3216,"_dir":3190,"_draft":7,"_partial":7,"_locale":8,"title":3217,"description":8,"_hidden":7,"for a test oracle authors":3218,"authors_orcid":3221,"year":3195,"doi":3224,"openalex_id":3225,"venue":770,"abstract_screenshot":21,"keywords":3226,"body":3230,"_type":51,"_id":3234,"_source":53,"_file":3235,"_stem":3236,"_extension":56,"locale":57},"\u002Fpublications\u002F2016\u002Fa-metamorphic-testing-approach-for-supporting-program-repair-without-the-need-fo","A metamorphic testing approach for supporting program repair without the need",[3219,596,594,595,3220],"Jiang, Mingyue","Ding, Zuohua",[3222,600,21,599,3223],"0000-0002-0758-1616","0000-0002-9671-7836","https:\u002F\u002Fdoi.org\u002F10.1016\u002Fj.jss.2016.04.002","W2342081626",[605,657,23,3227,209,3228,658,3229,659,661,110,607,215,139,179,138,1169],"Correctness","Integration testing","Test Management Approach",{"type":39,"children":3231,"toc":3232},[],{"title":8,"searchDepth":49,"depth":49,"links":3233},[],"content:publications:2016:a-metamorphic-testing-approach-for-supporting-program-repair-without-the-need-fo.md","publications\u002F2016\u002Fa-metamorphic-testing-approach-for-supporting-program-repair-without-the-need-fo.md","publications\u002F2016\u002Fa-metamorphic-testing-approach-for-supporting-program-repair-without-the-need-fo",{"_path":3238,"_dir":3190,"_draft":7,"_partial":7,"_locale":8,"title":3239,"description":3240,"_hidden":7,"Environmental Governance in China authors":3241,"authors_orcid":3245,"year":3195,"doi":3248,"openalex_id":3249,"venue":3250,"abstract_screenshot":21,"keywords":3251,"body":3263,"_type":51,"_id":3271,"_source":53,"_file":3272,"_stem":3273,"_extension":56,"locale":57},"\u002Fpublications\u002F2016\u002Fa-new-environmental-protection-law-many-old-problems-challenges-to-environmental","A New Environmental Protection Law, Many Old Problems? Challenges to","Through a three-year revision involving various stakeholders, China has enacted a new Environmental Protection Law ( EPL ). The new law seeks to harmonize economic and social development with environmental protection and for the first time establishes clear requirements for the construction of an ecological civilization. It toughens the penalties for environmental offences with specific articles and provisions for raising public awareness. It also places greater responsibility on local government and law enforcement for the protection of China’s environment. However, many of the problems identified in the old EPL and especially the obstacles to its implementation have not been fully addressed and resolved. Effective environmental governance entails not only environmental laws but also implementation mechanisms, accountability regimes, and institutional arrangements. Raising the status of the EPL and of the general environmental protection apparatus is only the first step to meeting China’s environmental challenges. More efforts in the area of enforcement and implementation will lead China to a cleaner future.",[3242,65,3243,3244],"Zhang, Bo","Gu, Junzhan","Liu, Ting",[3246,70,21,3247],"0000-0001-7963-4572","0009-0001-0331-262X","https:\u002F\u002Fdoi.org\u002F10.1093\u002Fjel\u002Feqw014","W2467135534","Journal of Environmental Law",[3252,282,3253,3254,3255,3256,3257,3258,178,3259,3260,3261,1358,3262,36,289],"Environmental governance","Environmental law","Enforcement","Government (linguistics)","Law enforcement","Corporate governance","Accountability","Law","Rule of law","Environmental planning","Environmental resource management",{"type":39,"children":3264,"toc":3269},[3265],{"type":42,"tag":43,"props":3266,"children":3267},{},[3268],{"type":47,"value":3240},{"title":8,"searchDepth":49,"depth":49,"links":3270},[],"content:publications:2016:a-new-environmental-protection-law-many-old-problems-challenges-to-environmental.md","publications\u002F2016\u002Fa-new-environmental-protection-law-many-old-problems-challenges-to-environmental.md","publications\u002F2016\u002Fa-new-environmental-protection-law-many-old-problems-challenges-to-environmental",{"_path":3275,"_dir":3190,"_draft":7,"_partial":7,"_locale":8,"title":3276,"description":3277,"_hidden":7,"authors":3278,"authors_orcid":3280,"year":3195,"doi":3282,"openalex_id":3283,"venue":21,"abstract_screenshot":21,"keywords":3284,"body":3285,"_type":51,"_id":3293,"_source":53,"_file":3294,"_stem":3295,"_extension":56,"locale":57},"\u002Fpublications\u002F2016\u002Fa-new-fast-large-neighbourhood-search-for-service-network-design-with-asset-bala","A new fast large neighbourhood search for service network design with asset balance constraints","The service network design problem (SNDP) is a fundamental problem in consolidated freight transportation. It involves the determination of an efficient transportation network and the scheduling details of the corresponding services. Compared to vehicle routing problems, SNDP can model transfers and consolidations on a multi-modal freight network. The problem is often formulated as a mixed integer programming problem and is NP-Hard. In this research, we propose a new efficient large neighbourhood search function that can handle the constraints more efficiently. The effectiveness of this new neighbourhood is evaluated in a tabu search metaheuristic (TS) and a GLS guided local search (GLS) method. Experimental results based on a set of well-known benchmark instances show that the new neighbourhood performs significantly better than the previous arc-flipping neighbourhood. The neighbourhood function is also applicable in other optimisation problems with similar discrete constraints.",[12,90,3279],"Subramanian, Nachiappan",[15,92,3281],"0000-0003-4076-6433","https:\u002F\u002Fdoi.org\u002F10.1109\u002Fssci.2016.7850084","W2588989676",[328,505,23,31,239,242,773,208,355,209,332,34,251],{"type":39,"children":3286,"toc":3291},[3287],{"type":42,"tag":43,"props":3288,"children":3289},{},[3290],{"type":47,"value":3277},{"title":8,"searchDepth":49,"depth":49,"links":3292},[],"content:publications:2016:a-new-fast-large-neighbourhood-search-for-service-network-design-with-asset-bala.md","publications\u002F2016\u002Fa-new-fast-large-neighbourhood-search-for-service-network-design-with-asset-bala.md","publications\u002F2016\u002Fa-new-fast-large-neighbourhood-search-for-service-network-design-with-asset-bala",{"_path":3297,"_dir":3190,"_draft":7,"_partial":7,"_locale":8,"title":3298,"description":3299,"_hidden":7,"authors":3300,"authors_orcid":3301,"year":3195,"doi":3303,"openalex_id":3304,"venue":21,"abstract_screenshot":21,"keywords":3305,"body":3308,"_type":51,"_id":3316,"_source":53,"_file":3317,"_stem":3318,"_extension":56,"locale":57},"\u002Fpublications\u002F2016\u002Fa-random-and-coverage-based-approach-for-fault-localization-prioritization","A random and coverage-based approach for fault localization prioritization","Fault Localization Prioritization (FLP) aims to order the execution sequence of test cases so that faulty statements in a faulty program can be localized faster. FLP is an important part of the automation of testing and fault localization in software engineering. The key issue is to identify which test cases can provide most useful information to help locate the faulty statement. Assuming the well-known technique of Spectra-Based Fault Localization (SBFL) is applied, this paper evaluates the quality of a test case based on the characteristics of its statement coverage information. We propose the COverage-based Random (COR) approach to address the FLP problem. Two statement coverage characteristics, the diversity characteristic and the failure-like characteristic, are analyzed and identified as having significant impacts on the effectiveness of fault localization. When using the COR approach, each test case is examined and the degree of each characteristic is measured, with test cases showing high degrees of the characteristics being assigned higher priority for execution. Because of the power of random strategies to improve the robustness of the approach, some random factors in the selection of test cases are included. Empirical studies show that, compared with existing approaches, the COR approach results in a faster localization of faulty statements, reducing the number of necessary test case executions.",[3163,595,596,3164,3165],[3302,599,600,3168,3169],"0000-0002-3362-2813","https:\u002F\u002Fdoi.org\u002F10.1109\u002Fccdc.2016.7531562","W2509565598",[23,353,1163,658,3176,3306,3307,661,656,657,181,1165,1221,3175,139,215,138,179],"Automation","Statement (logic)",{"type":39,"children":3309,"toc":3314},[3310],{"type":42,"tag":43,"props":3311,"children":3312},{},[3313],{"type":47,"value":3299},{"title":8,"searchDepth":49,"depth":49,"links":3315},[],"content:publications:2016:a-random-and-coverage-based-approach-for-fault-localization-prioritization.md","publications\u002F2016\u002Fa-random-and-coverage-based-approach-for-fault-localization-prioritization.md","publications\u002F2016\u002Fa-random-and-coverage-based-approach-for-fault-localization-prioritization",{"_path":3320,"_dir":3190,"_draft":7,"_partial":7,"_locale":8,"title":3321,"description":3322,"_hidden":7,"authors":3323,"authors_orcid":3325,"year":3195,"doi":3327,"openalex_id":3328,"venue":3329,"abstract_screenshot":21,"keywords":3330,"body":3336,"_type":51,"_id":3344,"_source":53,"_file":3345,"_stem":3346,"_extension":56,"locale":57},"\u002Fpublications\u002F2016\u002Fa-scheme-for-determining-vehicle-routes-based-on-arc-based-service-network-desig","A scheme for determining vehicle routes based on Arc-based service network design","In freight transportation, less-than-truckload carriers often need to assign each vehicle a cyclic route so that drivers can come back home after a certain period of time. However, the Node-Arc model for service network design addresses decisions on each arc and does not determine routes directly, although the vehicle balancing constraint ensures that the number of outgoing vehicles equals the number of incoming vehicles at each node. How to transform the optimized service network into a set of vehicle routes remains an important problem that has not yet been studied. In this paper, we propose a three-phase scheme to address this problem. In the first stage, we present an algorithm based on the depth-first search to find all of the different cyclic routes in a service network design solution. In the second stage, we propose to prune poor cyclic routes using real-life constraints so that a collection of acceptable vehicle routes can be obtained before route assignment. Some of the pruning can also be done in the first stage to speed up the proposed algorithm. In the third stage, we formulate the problem of selecting a set of cyclic routes to cover the entire network as a weighted set covering problem. The resulting model is formulated as an integer program and solved with IBM ILOG CPLEX solver. Experimental results on benchmark instances for service network design indicate the effectiveness of the proposed scheme which gives high-quality solutions in an efficient way.",[3324,12,320,13],"Jiang, Xiaoping",[3326,15,323,16],"0000-0002-3588-1675","https:\u002F\u002Fdoi.org\u002F10.1080\u002F03155986.2016.1262580","W2543502461","INFOR Information Systems and Operational Research",[23,717,3331,209,242,101,240,3332,3333,31,3334,3335,251,179,34],"Node (physics)","Scheme (mathematics)","Constraint (computer-aided design)","Pruning","Integer (computer science)",{"type":39,"children":3337,"toc":3342},[3338],{"type":42,"tag":43,"props":3339,"children":3340},{},[3341],{"type":47,"value":3322},{"title":8,"searchDepth":49,"depth":49,"links":3343},[],"content:publications:2016:a-scheme-for-determining-vehicle-routes-based-on-arc-based-service-network-desig.md","publications\u002F2016\u002Fa-scheme-for-determining-vehicle-routes-based-on-arc-based-service-network-desig.md","publications\u002F2016\u002Fa-scheme-for-determining-vehicle-routes-based-on-arc-based-service-network-desig",{"_path":3348,"_dir":3190,"_draft":7,"_partial":7,"_locale":8,"title":3349,"description":3350,"_hidden":7,"Adaptive Random Testing authors":3351,"authors_orcid":3353,"year":3195,"doi":3354,"openalex_id":3355,"venue":3356,"abstract_screenshot":21,"keywords":3357,"body":3359,"_type":51,"_id":3367,"_source":53,"_file":3368,"_stem":3369,"_extension":56,"locale":57},"\u002Fpublications\u002F2016\u002Fa-similarity-metric-for-the-inputs-of-oo-programs-and-its-application-in-adaptiv","A Similarity Metric for the Inputs of OO Programs and Its Application in","Random testing (RT) has been identified as one of the most popular testing techniques, due to its simplicity and ease of automation. Adaptive random testing (ART) has been proposed as an enhancement to RT, improving its fault-detection effectiveness by evenly spreading random test inputs across the input domain. To achieve the even spreading, ART makes use of distance measurements between consecutive inputs. However, due to the nature of object-oriented software (OOS), its distance measurement can be particularly challenging: Each input may involve multiple classes, and interaction of objects through method invocations. Two previous studies have reported on how to test OOS at a single-class level using ART. In this study, we propose a new similarity metric to enable multiclass level testing using ART. When generating test inputs (for multiple classes, a series of objects, and a sequence of method invocations), we use the similarity metric to calculate the distance between two series of objects, and between two sequences of method invocations. We integrate this metric with ART and apply it to a set of open-source OO programs, with the empirical results showing that our approach outperforms other RT and ART approaches in OOS testing.",[648,594,596,595,3352,645],"Su, Chenfei",[651,21,600,599,21,650],"https:\u002F\u002Fdoi.org\u002F10.1109\u002Ftr.2016.2628759","W2561884496","IEEE Transactions on Reliability",[1163,1008,23,3122,101,181,139,3358,658,332,37,215,110,179],"Sequence (biology)",{"type":39,"children":3360,"toc":3365},[3361],{"type":42,"tag":43,"props":3362,"children":3363},{},[3364],{"type":47,"value":3350},{"title":8,"searchDepth":49,"depth":49,"links":3366},[],"content:publications:2016:a-similarity-metric-for-the-inputs-of-oo-programs-and-its-application-in-adaptiv.md","publications\u002F2016\u002Fa-similarity-metric-for-the-inputs-of-oo-programs-and-its-application-in-adaptiv.md","publications\u002F2016\u002Fa-similarity-metric-for-the-inputs-of-oo-programs-and-its-application-in-adaptiv",{"_path":3371,"_dir":3190,"_draft":7,"_partial":7,"_locale":8,"title":3372,"description":3373,"_hidden":7,"authors":3374,"authors_orcid":3378,"year":3195,"doi":3382,"openalex_id":3383,"venue":3384,"abstract_screenshot":21,"keywords":3385,"body":3394,"_type":51,"_id":3402,"_source":53,"_file":3403,"_stem":3404,"_extension":56,"locale":57},"\u002Fpublications\u002F2016\u002Fa-theoretical-and-empirical-integrated-method-to-select-the-optimal-combined-sig","A Theoretical and Empirical Integrated Method to Select the Optimal Combined Signals for Geometry-Free and Geometry-Based Three-Carrier Ambiguity Resolution","Twelve GPS Block IIF satellites, out of the current constellation, can transmit on three-frequency signals (L1, L2, L5). Taking advantages of these signals, Three-Carrier Ambiguity Resolution (TCAR) is expected to bring much benefit for ambiguity resolution. One of the research areas is to find the optimal combined signals for a better ambiguity resolution in geometry-free (GF) and geometry-based (GB) mode. However, the existing researches select the signals through either pure theoretical analysis or testing with simulated data, which might be biased as the real observation condition could be different from theoretical prediction or simulation. In this paper, we propose a theoretical and empirical integrated method, which first selects the possible optimal combined signals in theory and then refines these signals with real triple-frequency GPS data, observed at eleven baselines of different lengths. An interpolation technique is also adopted in order to show changes of the AR performance with the increase in baseline length. The results show that the AR success rate can be improved by 3% in GF mode and 8% in GB mode at certain intervals of the baseline length. Therefore, the TCAR can perform better by adopting the combined signals proposed in this paper when the baseline meets the length condition.",[3375,1182,3376,3377,12],"Zhao, Dongsheng","Lau, Lawrence","Hancock, Craig",[3379,1185,3380,3381,15],"0000-0001-7297-8639","0000-0001-8783-9666","0000-0002-9692-0439","https:\u002F\u002Fdoi.org\u002F10.3390\u002Fs16111929","W2555432335","Sensors",[3386,3387,332,3388,23,3389,3390,3391,3392,3393,34,37,288],"Ambiguity resolution","Ambiguity","Mode (computer interface)","Resolution (logic)","Baseline (sea)","Interpolation (computer graphics)","Global Positioning System","Geometry",{"type":39,"children":3395,"toc":3400},[3396],{"type":42,"tag":43,"props":3397,"children":3398},{},[3399],{"type":47,"value":3373},{"title":8,"searchDepth":49,"depth":49,"links":3401},[],"content:publications:2016:a-theoretical-and-empirical-integrated-method-to-select-the-optimal-combined-sig.md","publications\u002F2016\u002Fa-theoretical-and-empirical-integrated-method-to-select-the-optimal-combined-sig.md","publications\u002F2016\u002Fa-theoretical-and-empirical-integrated-method-to-select-the-optimal-combined-sig",{"_path":3406,"_dir":3190,"_draft":7,"_partial":7,"_locale":8,"title":3407,"description":3408,"_hidden":7,"authors":3409,"authors_orcid":3412,"year":3195,"doi":3415,"openalex_id":3416,"venue":21,"abstract_screenshot":21,"keywords":3417,"body":3419,"_type":51,"_id":3427,"_source":53,"_file":3428,"_stem":3429,"_extension":56,"locale":57},"\u002Fpublications\u002F2016\u002Fa-variable-neighbourhood-search-algorithm-with-compound-neighbourhoods-for-vrptw","A Variable Neighbourhood Search Algorithm with Compound Neighbourhoods for VRPTW","The Vehicle Routing Problem with Time Windows (VRPTW) consists of constructing least cost routes from a depot to a set of geographically scattered service points and back to the depot, satisfying service time interval and capacity constraints. A Variable Neighbourhood Search algorithm with Compound Neighbourhoods is proposed to solve VRPTW in this paper. A number of independent neighbourhood operators are composed into compound neighbourhood operators in a new way, to explore wider search area concerning two objectives (to minimize the number of vehicles and the total travel distance) simultaneously. Promising results are obtained on benchmark datasets",[3410,319,12,3411],"Chen, Binhui","Ishibuchi, Hisao",[3413,322,15,3414],"0000-0001-6540-6827","0000-0001-9186-6472","https:\u002F\u002Fdoi.org\u002F10.5220\u002F0005661800250035","W2345222839",[247,505,209,31,3418,23,332,34,250,289,251],"Variable (mathematics)",{"type":39,"children":3420,"toc":3425},[3421],{"type":42,"tag":43,"props":3422,"children":3423},{},[3424],{"type":47,"value":3408},{"title":8,"searchDepth":49,"depth":49,"links":3426},[],"content:publications:2016:a-variable-neighbourhood-search-algorithm-with-compound-neighbourhoods-for-vrptw.md","publications\u002F2016\u002Fa-variable-neighbourhood-search-algorithm-with-compound-neighbourhoods-for-vrptw.md","publications\u002F2016\u002Fa-variable-neighbourhood-search-algorithm-with-compound-neighbourhoods-for-vrptw",{"_path":3431,"_dir":3190,"_draft":7,"_partial":7,"_locale":8,"title":3432,"description":3433,"_hidden":7,"authors":3434,"authors_orcid":3437,"year":3195,"doi":3438,"openalex_id":3439,"venue":21,"abstract_screenshot":21,"keywords":3440,"body":3443,"_type":51,"_id":3451,"_source":53,"_file":3452,"_stem":3453,"_extension":56,"locale":57},"\u002Fpublications\u002F2016\u002Fan-adaptive-sequence-approach-for-oos-test-case-prioritization","An Adaptive Sequence Approach for OOS Test Case Prioritization","Test case prioritization (TCP) attempts to improve fault detection effectiveness by scheduling important test cases earlier, where important is determined by some criteria and strategy. Adaptive random sequences (ARSs) may be applied to improve the effectiveness of TCP in black-box testing. In this paper, to improve the effectiveness of TCP for object-oriented software, we present an ARS approach based on clustering techniques. In the proposed approach, test cases are clustered according to the number of objects and methods, using two clustering algorithms - K-means and K-medoids. Our proposed sampling strategy can construct ARSs within the clustering framework, constructing two ARS sequences based on the two clustering algorithms, which results in generated test cases with different execution sequences. We also report on experimental studies to verify the proposed approach, with the results showing that our approach can enhance the probability of earlier fault detection, and deliver higher effectiveness than random prioritization.",[648,3435,596,645,595,594,3436],"Zhu, Lili","Guo, Yuchi",[651,21,600,650,599,21,21],"https:\u002F\u002Fdoi.org\u002F10.1109\u002Fissrew.2016.29","W2567436526",[3441,23,656,181,658,450,3442,215,37,31,34,179],"Cluster analysis","Fault detection and isolation",{"type":39,"children":3444,"toc":3449},[3445],{"type":42,"tag":43,"props":3446,"children":3447},{},[3448],{"type":47,"value":3433},{"title":8,"searchDepth":49,"depth":49,"links":3450},[],"content:publications:2016:an-adaptive-sequence-approach-for-oos-test-case-prioritization.md","publications\u002F2016\u002Fan-adaptive-sequence-approach-for-oos-test-case-prioritization.md","publications\u002F2016\u002Fan-adaptive-sequence-approach-for-oos-test-case-prioritization",{"_path":3455,"_dir":3190,"_draft":7,"_partial":7,"_locale":8,"title":3456,"description":3457,"_hidden":7,"authors":3458,"authors_orcid":3462,"year":3195,"doi":3465,"openalex_id":3466,"venue":21,"abstract_screenshot":21,"keywords":3467,"body":3471,"_type":51,"_id":3479,"_source":53,"_file":3480,"_stem":3481,"_extension":56,"locale":57},"\u002Fpublications\u002F2016\u002Fan-augmented-cybersecurity-behavioral-research-model","An Augmented Cybersecurity Behavioral Research Model","Because the human aspect of cybersecurity remains less well understood, the problem of security design with unfriendly user interfaces persists. A major challenge to addressing the human component of cybersecurity is the lack of empirically identified factors influencing individuals' cybersecurity behaviour. In this paper, we propose an augmented behavioural research model that introduces \"attitude to personal data\" as a determinant of cybersecurity behaviour. As a research in-progress, a preliminary study conducted to examine the personal data element of the research model is briefly described. By expanding on existing behavioural theories, this research attempts to examine and predict the adoption of cybersecurity countermeasures from a new perspective. Results from this research are expected to guide the design of enhanced user models for adaptive cybersecurity.",[3459,3460,3461,595],"Addae, Joyce","Radenkovic, Milena","Sun, Xu",[21,3463,3464,599],"0000-0003-4000-6143","0000-0002-2340-7095","https:\u002F\u002Fdoi.org\u002F10.1109\u002Fcompsac.2016.52","W2510995092",[180,23,3468,1058,3469,3470,37,1358],"Perspective (graphical)","Threat model","Element (criminal law)",{"type":39,"children":3472,"toc":3477},[3473],{"type":42,"tag":43,"props":3474,"children":3475},{},[3476],{"type":47,"value":3457},{"title":8,"searchDepth":49,"depth":49,"links":3478},[],"content:publications:2016:an-augmented-cybersecurity-behavioral-research-model.md","publications\u002F2016\u002Fan-augmented-cybersecurity-behavioral-research-model.md","publications\u002F2016\u002Fan-augmented-cybersecurity-behavioral-research-model",{"_path":3483,"_dir":3190,"_draft":7,"_partial":7,"_locale":8,"title":3484,"description":3485,"_hidden":7,"authors":3486,"authors_orcid":3487,"year":3195,"doi":3488,"openalex_id":3489,"venue":21,"abstract_screenshot":21,"keywords":3490,"body":3496,"_type":51,"_id":3504,"_source":53,"_file":3505,"_stem":3506,"_extension":56,"locale":57},"\u002Fpublications\u002F2016\u002Fan-extended-perspective-on-cybersecurity-education","An extended perspective on cybersecurity education","The current trend of ubiquitous device use whereby computing is becoming increasingly context-aware and personal, has created a growing concern for the protection of personal privacy. Privacy is an essential component of security, and there is a need to be able to secure personal computers and networks to minimize privacy depreciation within cyberspace. Human error has been recognized as playing a major role in security breaches: Hence technological solutions alone cannot adequately address the emerging security and privacy threats. Home users are particularly vulnerable to cybersecurity threats for a number of reasons, including a particularly important one that our research seeks to address: The lack of cybersecurity education. We argue that research seeking to address the human element of cybersecurity should not be limited only to the design of more usable technical security mechanisms, but should be extended and applied to offering appropriate training to all stakeholders within cyberspace.",[3459,3460,3461,595],[21,3463,3464,599],"https:\u002F\u002Fdoi.org\u002F10.1109\u002Ftale.2016.7851822","W2587881758",[3491,180,3492,3493,23,133,3494,3495,1108,869],"Cyberspace","USable","Internet privacy","Personally identifiable information","Information privacy",{"type":39,"children":3497,"toc":3502},[3498],{"type":42,"tag":43,"props":3499,"children":3500},{},[3501],{"type":47,"value":3485},{"title":8,"searchDepth":49,"depth":49,"links":3503},[],"content:publications:2016:an-extended-perspective-on-cybersecurity-education.md","publications\u002F2016\u002Fan-extended-perspective-on-cybersecurity-education.md","publications\u002F2016\u002Fan-extended-perspective-on-cybersecurity-education",{"_path":3508,"_dir":3190,"_draft":7,"_partial":7,"_locale":8,"title":3509,"description":8,"_hidden":7,"authors":3510,"authors_orcid":3513,"year":3195,"doi":3516,"openalex_id":3517,"venue":3518,"abstract_screenshot":21,"keywords":3519,"body":3527,"_type":51,"_id":3531,"_source":53,"_file":3532,"_stem":3533,"_extension":56,"locale":57},"\u002Fpublications\u002F2016\u002Fchina-s-new-environmental-protection-regulatory-regime-effects-and-gaps","China's new environmental protection regulatory regime: Effects and gaps",[3242,65,3511,3512],"Hughes, Robert M.","Davis, Wayne S.",[3514,70,3515,21],"0000-0002-3018-9954","0000-0003-1308-666X","https:\u002F\u002Fdoi.org\u002F10.1016\u002Fj.jenvman.2016.11.009","W2554809152","Journal of Environmental Management",[282,3520,3261,3521,3253,3522,3523,178,3262,3524,747,926,3525,1358,3526,3259,36],"Foundation (evidence)","Environmental quality","Water quality","Environmental protection","Environmental regulation","Natural resource economics","Ecology",{"type":39,"children":3528,"toc":3529},[],{"title":8,"searchDepth":49,"depth":49,"links":3530},[],"content:publications:2016:china-s-new-environmental-protection-regulatory-regime-effects-and-gaps.md","publications\u002F2016\u002Fchina-s-new-environmental-protection-regulatory-regime-effects-and-gaps.md","publications\u002F2016\u002Fchina-s-new-environmental-protection-regulatory-regime-effects-and-gaps",{"_path":3535,"_dir":3190,"_draft":7,"_partial":7,"_locale":8,"title":3536,"description":8,"_hidden":7,"authors":3537,"authors_orcid":3539,"year":3195,"doi":3541,"openalex_id":3542,"venue":3543,"abstract_screenshot":21,"keywords":3544,"body":3548,"_type":51,"_id":3552,"_source":53,"_file":3553,"_stem":3554,"_extension":56,"locale":57},"\u002Fpublications\u002F2016\u002Fchina-standardize-r-amp-d-costing","China: Standardize R&D costing",[3538,65],"Sun, Yutao",[3540,70],"0000-0002-8198-5387","https:\u002F\u002Fdoi.org\u002F10.1038\u002F536030b","W2498467682","Nature",[282,3545,178,289,3546,3547],"Activity-based costing","Accounting","Archaeology",{"type":39,"children":3549,"toc":3550},[],{"title":8,"searchDepth":49,"depth":49,"links":3551},[],"content:publications:2016:china-standardize-r-amp-d-costing.md","publications\u002F2016\u002Fchina-standardize-r-amp-d-costing.md","publications\u002F2016\u002Fchina-standardize-r-amp-d-costing",{"_path":3556,"_dir":3190,"_draft":7,"_partial":7,"_locale":8,"title":3557,"description":8,"_hidden":7,"authors":3558,"authors_orcid":3561,"year":3195,"doi":3564,"openalex_id":3565,"venue":3566,"abstract_screenshot":21,"keywords":3567,"body":3574,"_type":51,"_id":3578,"_source":53,"_file":3579,"_stem":3580,"_extension":56,"locale":57},"\u002Fpublications\u002F2016\u002Fcold-chain-configuration-design-location-allocation-decision-making-using-coordi","Cold chain configuration design: location-allocation decision-making using coordination, value deterioration, and big data approximation",[3559,3279,3560,12],"Singh, Adarsh Kumar","Pawar, Kulwant S.",[3562,3281,3563,15],"0000-0001-8892-9444","0000-0001-8830-1024","https:\u002F\u002Fdoi.org\u002F10.1007\u002Fs10479-016-2332-z","W2525572631","Annals of Operations Research",[23,24,3568,3569,240,717,355,689,3570,3571,3572,178,3573,751,179,181],"Supply chain","Product (mathematics)","Service provider","Last mile (transportation)","Facility location problem","Mile",{"type":39,"children":3575,"toc":3576},[],{"title":8,"searchDepth":49,"depth":49,"links":3577},[],"content:publications:2016:cold-chain-configuration-design-location-allocation-decision-making-using-coordi.md","publications\u002F2016\u002Fcold-chain-configuration-design-location-allocation-decision-making-using-coordi.md","publications\u002F2016\u002Fcold-chain-configuration-design-location-allocation-decision-making-using-coordi",{"_path":3582,"_dir":3190,"_draft":7,"_partial":7,"_locale":8,"title":3583,"description":8,"_hidden":7,"authors":3584,"authors_orcid":3588,"year":3195,"doi":21,"openalex_id":3592,"venue":3593,"abstract_screenshot":21,"keywords":3594,"body":3598,"_type":51,"_id":3602,"_source":53,"_file":3603,"_stem":3604,"_extension":56,"locale":57},"\u002Fpublications\u002F2016\u002Fdevelopment-of-a-framework-for-big-data-analytics-in-cold-chain-logistics","Development of a framework for big data analytics in cold chain logistics",[3585,3586,3587,3279,12,3560],"Chaudhuri, Atanu","Dukovska‐Popovska, Iskra","Chan, Hing Kai",[3589,3590,3591,3281,15,3563],"0000-0002-6156-9634","0000-0002-3498-463X","0000-0002-5534-4076","W2510521224","VBN Forskningsportal (Aalborg Universitet)",[3595,689,690,3596,691,178,692,23,181,179,3597],"Cold chain","Chain (unit)","Physics",{"type":39,"children":3599,"toc":3600},[],{"title":8,"searchDepth":49,"depth":49,"links":3601},[],"content:publications:2016:development-of-a-framework-for-big-data-analytics-in-cold-chain-logistics.md","publications\u002F2016\u002Fdevelopment-of-a-framework-for-big-data-analytics-in-cold-chain-logistics.md","publications\u002F2016\u002Fdevelopment-of-a-framework-for-big-data-analytics-in-cold-chain-logistics",{"_path":3606,"_dir":3190,"_draft":7,"_partial":7,"_locale":8,"title":3607,"description":8,"_hidden":7,"investment in R&D of target firms in China authors":3608,"authors_orcid":3609,"year":3195,"doi":3610,"openalex_id":3611,"venue":3612,"abstract_screenshot":21,"keywords":3613,"body":3616,"_type":51,"_id":3620,"_source":53,"_file":3621,"_stem":3622,"_extension":56,"locale":57},"\u002Fpublications\u002F2016\u002Feffects-of-foreign-acquisitions-on-financial-constraints-productivity-and-invest","Effects of foreign acquisitions on financial constraints, productivity and",[1428,268,1287],[21,272,1291],"https:\u002F\u002Fdoi.org\u002F10.1016\u002Fj.ibusrev.2016.12.005","W2566931817","International Business Review",[282,3614,3615,1355,178,3333,1438,749,429,285,1297,1357,36,407],"Cash flow","Productivity",{"type":39,"children":3617,"toc":3618},[],{"title":8,"searchDepth":49,"depth":49,"links":3619},[],"content:publications:2016:effects-of-foreign-acquisitions-on-financial-constraints-productivity-and-invest.md","publications\u002F2016\u002Feffects-of-foreign-acquisitions-on-financial-constraints-productivity-and-invest.md","publications\u002F2016\u002Feffects-of-foreign-acquisitions-on-financial-constraints-productivity-and-invest",{"_path":3624,"_dir":3190,"_draft":7,"_partial":7,"_locale":8,"title":3625,"description":8,"_hidden":7,"authors":3626,"authors_orcid":3628,"year":3195,"doi":3629,"openalex_id":3630,"venue":3631,"abstract_screenshot":21,"keywords":3632,"body":3641,"_type":51,"_id":3645,"_source":53,"_file":3646,"_stem":3647,"_extension":56,"locale":57},"\u002Fpublications\u002F2016\u002Fenvironmental-and-financial-performance-of-mechanical-recycling-of-carbon-fibre","Environmental and financial performance of mechanical recycling of carbon fibre reinforced polymers and comparison with conventional disposal routes",[907,12,3627],"McKechnie, Jon",[912,15,21],"https:\u002F\u002Fdoi.org\u002F10.1016\u002Fj.jclepro.2016.03.139","W2320327177","Journal of Cleaner Production",[3633,3634,3635,3636,919,926,3637,3638,133,3639,3640,179,927],"Incineration","Greenhouse gas","Waste management","Reuse","Landfill gas","Carbon tax","Energy recovery","Municipal solid waste",{"type":39,"children":3642,"toc":3643},[],{"title":8,"searchDepth":49,"depth":49,"links":3644},[],"content:publications:2016:environmental-and-financial-performance-of-mechanical-recycling-of-carbon-fibre.md","publications\u002F2016\u002Fenvironmental-and-financial-performance-of-mechanical-recycling-of-carbon-fibre.md","publications\u002F2016\u002Fenvironmental-and-financial-performance-of-mechanical-recycling-of-carbon-fibre",{"_path":3649,"_dir":3190,"_draft":7,"_partial":7,"_locale":8,"title":3650,"description":3651,"_hidden":7,"authors":3652,"authors_orcid":3653,"year":3195,"doi":3655,"openalex_id":3656,"venue":21,"abstract_screenshot":21,"keywords":3657,"body":3667,"_type":51,"_id":3675,"_source":53,"_file":3676,"_stem":3677,"_extension":56,"locale":57},"\u002Fpublications\u002F2016\u002Ffreight-vehicle-travel-time-prediction-using-gradient-boosting-regression-tree","Freight Vehicle Travel Time Prediction Using Gradient Boosting Regression Tree","Travel time prediction is important for freight transportation companies. Accurate travel time prediction can help these companies make better planning and task scheduling. For several reasons, most companies are not able to obtain traffic flow data from traffic management authorities, but a large amount of trajectory data were collected everyday which has not been fully utilised. In this study, we aim to fill this gap and performed travel time predictions for freight vehicles at individual level using Gradient Boosting Regression Tree (GBRT) models. All the features were extracted or composed from vehicles' temporally sparse trajectory data. Three routes were selected for the prediction experiments. Bayesian optimisation was adopted for model fitting while the results show that both pre-start (before trip starts) and post-start (after trip starts) predictions accuracies reach above 80%. The results also show that the prediction performance can be gradually improved by adding more mean speed estimates of traveled distance from the first 5 minutes as the real-time information. And the prediction performance can be further improved by about 2% by adding more mean speed estimates even if an unusual and non-recurring events occurred at a location of a route segment. This study shows the feasibility of both pre-start and continuous post-start prediction with limited amount of temporally sparse trajectory data for real-world practice.",[973,12],[3654,15],"0000-0003-3050-8529","https:\u002F\u002Fdoi.org\u002F10.1109\u002Ficmla.2016.0182","W2583437448",[3658,23,450,3659,3660,3661,3662,3663,3664,3665,181,215,3666,179,34],"Gradient boosting","Trajectory","Boosting (machine learning)","Predictive modelling","Decision tree","Regression","Tree (set theory)","Random forest","Statistics",{"type":39,"children":3668,"toc":3673},[3669],{"type":42,"tag":43,"props":3670,"children":3671},{},[3672],{"type":47,"value":3651},{"title":8,"searchDepth":49,"depth":49,"links":3674},[],"content:publications:2016:freight-vehicle-travel-time-prediction-using-gradient-boosting-regression-tree.md","publications\u002F2016\u002Ffreight-vehicle-travel-time-prediction-using-gradient-boosting-regression-tree.md","publications\u002F2016\u002Ffreight-vehicle-travel-time-prediction-using-gradient-boosting-regression-tree",{"_path":3679,"_dir":3190,"_draft":7,"_partial":7,"_locale":8,"title":3680,"description":8,"_hidden":7,"authors":3681,"authors_orcid":3682,"year":3195,"doi":3683,"openalex_id":3684,"venue":687,"abstract_screenshot":21,"keywords":3685,"body":3690,"_type":51,"_id":3694,"_source":53,"_file":3695,"_stem":3696,"_extension":56,"locale":57},"\u002Fpublications\u002F2016\u002Ffreight-vehicle-travel-time-prediction-using-sparse-gaussian-processes-regressio","Freight Vehicle Travel Time Prediction Using Sparse Gaussian Processes Regression with Trajectory Data",[973,12],[21,15],"https:\u002F\u002Fdoi.org\u002F10.1007\u002F978-3-319-46257-8_16","W2558174128",[23,3659,3686,632,3687,450,3688,3663,3661,1009,181,215,135,3689,37,31,3666,34],"Gaussian process","Kriging","Support vector machine","Gaussian",{"type":39,"children":3691,"toc":3692},[],{"title":8,"searchDepth":49,"depth":49,"links":3693},[],"content:publications:2016:freight-vehicle-travel-time-prediction-using-sparse-gaussian-processes-regressio.md","publications\u002F2016\u002Ffreight-vehicle-travel-time-prediction-using-sparse-gaussian-processes-regressio.md","publications\u002F2016\u002Ffreight-vehicle-travel-time-prediction-using-sparse-gaussian-processes-regressio",{"_path":3698,"_dir":3190,"_draft":7,"_partial":7,"_locale":8,"title":3699,"description":3700,"_hidden":7,"authors":3701,"authors_orcid":3703,"year":3195,"doi":3704,"openalex_id":3705,"venue":3706,"abstract_screenshot":21,"keywords":3707,"body":3715,"_type":51,"_id":3723,"_source":53,"_file":3724,"_stem":3725,"_extension":56,"locale":57},"\u002Fpublications\u002F2016\u002Finstitutional-logic-dynamics-private-firm-financing-in-ningbo-1912-2008","Institutional logic dynamics: private firm financing in Ningbo (1912–2008)","This study examines the evolution of institutional logics and private firm financing practices in Ningbo, a commercial seaport city in China where the private sector has prospered for centuries, during 1912–2008. We argue that a three-fold institutionalisation process becomes evident when we view changes since 1912; namely institutionalisation, deinstitutionalisation and reinstitutionalisation of entrepreneurship and the associated financing of private firms. Two competing institutional logics, community and market logics, with the former being dominant but gradually giving way to the latter over time in the first stage (the Republican era of China), were eliminated in the second stage (the centrally-planned economy era), but have re-emerged and co-existed in the third stage (the economic reform era). However, unlike in the past, community logic is now subordinate and informal rather than dominant and formal, indicating that, although cyclical patterns are observed, institutional paths are not uniform.",[268,1428,3702],"Prashantham, Shameen",[272,21,21],"https:\u002F\u002Fdoi.org\u002F10.1080\u002F00076791.2015.1122707","W2281222779","Business History",[3708,282,3709,3710,3711,1443,36,429,178,3712,3713,1358,3714],"Institutionalisation","Entrepreneurship","Private sector","Institutional change","Economic system","Economic growth","Public administration",{"type":39,"children":3716,"toc":3721},[3717],{"type":42,"tag":43,"props":3718,"children":3719},{},[3720],{"type":47,"value":3700},{"title":8,"searchDepth":49,"depth":49,"links":3722},[],"content:publications:2016:institutional-logic-dynamics-private-firm-financing-in-ningbo-1912-2008.md","publications\u002F2016\u002Finstitutional-logic-dynamics-private-firm-financing-in-ningbo-1912-2008.md","publications\u002F2016\u002Finstitutional-logic-dynamics-private-firm-financing-in-ningbo-1912-2008",{"_path":3727,"_dir":3190,"_draft":7,"_partial":7,"_locale":8,"title":3728,"description":8,"_hidden":7,"Mannie Liu, Haifeng Huang, and Mike Henry":3729,"Professional Publishing, 2014":3732,"authors_orcid":3738,"year":3195,"doi":3739,"openalex_id":3740,"venue":3741,"abstract_screenshot":21,"keywords":3742,"body":3750,"_type":51,"_id":3754,"_source":53,"_file":3755,"_stem":3756,"_extension":56,"locale":57},"\u002Fpublications\u002F2016\u002Firenewable-energy-in-china-towards-a-green-economy-i-edited-by-manhong-mannie-li","\u003Ci>Renewable Energy in China: Towards a Green Economy\u003C\u002Fi>, edited by Manhon",{" 3 vols":3730},{" Singapore":3731},"Enrich",{" lxvi+254 pp":3733},{"; vi+220 pp":3734},{"; vi+348 pp":3735},{" US$308 (cloth)":3736},{"\" authors":3737},[65],[70],"https:\u002F\u002Fdoi.org\u002F10.1086\u002F683518","W2510222469","The China Journal",[282,3743,3744,3745,3746,3747,1358,3748,24,179,3749,3259,36,23,869],"Publishing","Download","Library science","Management","Scientific publishing","Art history","History",{"type":39,"children":3751,"toc":3752},[],{"title":8,"searchDepth":49,"depth":49,"links":3753},[],"content:publications:2016:irenewable-energy-in-china-towards-a-green-economy-i-edited-by-manhong-mannie-li.md","publications\u002F2016\u002Firenewable-energy-in-china-towards-a-green-economy-i-edited-by-manhong-mannie-li.md","publications\u002F2016\u002Firenewable-energy-in-china-towards-a-green-economy-i-edited-by-manhong-mannie-li",{"_path":3758,"_dir":3190,"_draft":7,"_partial":7,"_locale":8,"title":3759,"description":3760,"_hidden":7,"testing paradigm\" authors":3761,"authors_orcid":3762,"year":3195,"doi":3763,"openalex_id":3764,"venue":21,"abstract_screenshot":21,"keywords":3765,"body":3769,"_type":51,"_id":3777,"_source":53,"_file":3778,"_stem":3779,"_extension":56,"locale":57},"\u002Fpublications\u002F2016\u002Fmetamorphic-testing-a-new-student-engagement-approach-for-a-new-software-testing","Metamorphic testing: A new student engagement approach for a new softwar","Software testing, as part of the software quality assurance processes in software engineering (SE), is seldom cited as the most engaging part of a software engineer's training. In spite of its importance, it was often a neglected area, and only recently, with the adoption of more agile methodologies, has testing come to the fore. Testers face challenges, including the need to be able to identify when software is not behaving as expected. Metamorphic Testing (MT) first appeared twenty years ago in an effort to help testers facing the oracle problem (not having a mechanism to determine correct software behavior). Although MT is simple in concept, it has demonstrated very impressive fault-finding ability, and has recently been attracting a great deal of interest. Training students and practitioners to effectively apply MT has become an important goal, but to date, no textbook or guidelines have been made readily available. This paper, written by some of the leading voices in the MT community, is a sharing of some of the experiences, reflections and insights gained through teaching MT (and other related subjects). These experiences indicate that not only is MT effective in industry and at fault-finding, it has the potential to really engage students in creative SE classroom activities.",[595,596,594,593,1156],[599,600,21,598,1158],"https:\u002F\u002Fdoi.org\u002F10.1109\u002Ftale.2016.7851797","W2588381105",[605,3766,607,23,606,1165,139,3767,747,3768,138,691,1335,179,110],"Agile software development","Paradigm shift","Software quality analyst",{"type":39,"children":3770,"toc":3775},[3771],{"type":42,"tag":43,"props":3772,"children":3773},{},[3774],{"type":47,"value":3760},{"title":8,"searchDepth":49,"depth":49,"links":3776},[],"content:publications:2016:metamorphic-testing-a-new-student-engagement-approach-for-a-new-software-testing.md","publications\u002F2016\u002Fmetamorphic-testing-a-new-student-engagement-approach-for-a-new-software-testing.md","publications\u002F2016\u002Fmetamorphic-testing-a-new-student-engagement-approach-for-a-new-software-testing",{"_path":3781,"_dir":3190,"_draft":7,"_partial":7,"_locale":8,"title":3782,"description":8,"_hidden":7,"authors":3783,"authors_orcid":3784,"year":3195,"doi":3785,"openalex_id":3786,"venue":1161,"abstract_screenshot":21,"keywords":3787,"body":3792,"_type":51,"_id":3796,"_source":53,"_file":3797,"_stem":3798,"_extension":56,"locale":57},"\u002Fpublications\u002F2016\u002Fmetamorphic-testing-as-a-test-case-selection-strategy","Metamorphic testing as a test case selection strategy",[595,1397,1205,596],[599,1400,1210,600],"https:\u002F\u002Fdoi.org\u002F10.1007\u002Fs11432-016-5544-6","W2336957653",[134,659,3788,23,37,3789,3790,3791],"Metamorphic rock","Geology","Geochemistry","Paleontology",{"type":39,"children":3793,"toc":3794},[],{"title":8,"searchDepth":49,"depth":49,"links":3795},[],"content:publications:2016:metamorphic-testing-as-a-test-case-selection-strategy.md","publications\u002F2016\u002Fmetamorphic-testing-as-a-test-case-selection-strategy.md","publications\u002F2016\u002Fmetamorphic-testing-as-a-test-case-selection-strategy",{"_path":3800,"_dir":3190,"_draft":7,"_partial":7,"_locale":8,"title":3801,"description":3802,"_hidden":7,"authors":3803,"authors_orcid":3807,"year":3195,"doi":3809,"openalex_id":3810,"venue":3811,"abstract_screenshot":21,"keywords":3812,"body":3821,"_type":51,"_id":3829,"_source":53,"_file":3830,"_stem":3831,"_extension":56,"locale":57},"\u002Fpublications\u002F2016\u002Fmetamorphic-testing-for-cybersecurity","Metamorphic Testing for Cybersecurity","Testing is a major approach for the detection of software defects, including vulnerabilities in security features. This article introduces metamorphic testing (MT), a relatively new testing method, and discusses how the new perspective of MT can help to conduct negative testing as well as to alleviate the oracle problem in the testing of security-related functionality and behavior. As demonstrated by the effectiveness of MT in detecting previously unknown bugs in real-world critical applications such as compilers and code obfuscators, we conclude that software testing of security-related features should be conducted from diverse perspectives in order to achieve greater cybersecurity.",[596,594,3804,3805,595,3806,1156],"Ma, Wenjuan","Susilo, Willy","Voas, Jeffrey",[600,21,21,3808,599,21,1158],"0000-0002-1562-5105","https:\u002F\u002Fdoi.org\u002F10.1109\u002Fmc.2016.176","W2428841090","Computer",[23,605,180,3813,606,3814,3815,139,1163,3816,3146,607,3817,138,3818,1169,110,658,3123,1113,3819,3820,215],"Security testing","Secure coding","Software security assurance","Black-box testing","Information security","Cloud computing security","Security service","Security information and event management",{"type":39,"children":3822,"toc":3827},[3823],{"type":42,"tag":43,"props":3824,"children":3825},{},[3826],{"type":47,"value":3802},{"title":8,"searchDepth":49,"depth":49,"links":3828},[],"content:publications:2016:metamorphic-testing-for-cybersecurity.md","publications\u002F2016\u002Fmetamorphic-testing-for-cybersecurity.md","publications\u002F2016\u002Fmetamorphic-testing-for-cybersecurity",{"_path":3833,"_dir":3190,"_draft":7,"_partial":7,"_locale":8,"title":3834,"description":3835,"_hidden":7,"authors":3836,"authors_orcid":3840,"year":3195,"doi":3842,"openalex_id":3843,"venue":3844,"abstract_screenshot":21,"keywords":3845,"body":3849,"_type":51,"_id":3857,"_source":53,"_file":3858,"_stem":3859,"_extension":56,"locale":57},"\u002Fpublications\u002F2016\u002Fmt4ws-an-automated-metamorphic-testing-system-for-web-services","MT4WS: an automated metamorphic testing system for web services","The use of web services has been growing significantly, with increasingly large numbers of applications being implemented through the web. A difficulty associated with this development is the quality assurance of these services, specifically the challenges encountered when testing the applications - amongst other things, testers may not have access to the source code, and the correctness of the output may not be easily ascertained (known as the oracle problem). Metamorphic testing (MT) has been introduced as a technique to alleviate the oracle problem. MT makes use of properties of the software under test, known as metamorphic relations, and checks whether or not these relations are violated. Since MT does not require source code to generate the metamorphic relations, it is suitable for testing web services-based applications. We have designed an XML-based language representation to facilitate the formalisation of metamorphic relations, the generation of (follow-up) test cases, and the verification of the test results. Based on this, we have also developed a tool to support the automation of MT for web service applications. This tool has been used in an experiment to test web services, the evaluation of which is reported in this paper.",[3837,3838,3839,595,596],"Sun, Chang ai","Wang, Guan","Wen, Qing",[21,3841,21,599,600],"0000-0002-0317-5055","https:\u002F\u002Fdoi.org\u002F10.1504\u002Fijhpcn.2016.074663","W2406571098","International Journal of High Performance Computing and Networking",[23,605,1106,3846,3227,607,3847,3848,869,110,1112,1109],"Web testing","XML","Web application",{"type":39,"children":3850,"toc":3855},[3851],{"type":42,"tag":43,"props":3852,"children":3853},{},[3854],{"type":47,"value":3835},{"title":8,"searchDepth":49,"depth":49,"links":3856},[],"content:publications:2016:mt4ws-an-automated-metamorphic-testing-system-for-web-services.md","publications\u002F2016\u002Fmt4ws-an-automated-metamorphic-testing-system-for-web-services.md","publications\u002F2016\u002Fmt4ws-an-automated-metamorphic-testing-system-for-web-services",{"_path":3861,"_dir":3190,"_draft":7,"_partial":7,"_locale":8,"title":3862,"description":3863,"_hidden":7,"authors":3864,"authors_orcid":3867,"year":3195,"doi":3870,"openalex_id":3871,"venue":3872,"abstract_screenshot":21,"keywords":3873,"body":3878,"_type":51,"_id":3886,"_source":53,"_file":3887,"_stem":3888,"_extension":56,"locale":57},"\u002Fpublications\u002F2016\u002Fnational-and-regional-financial-openness-in-china","National and regional financial openness in China","While China’s economy has been subject to a wide range of economic reforms since 1978, its capital account is still restricted. The issue of capital account convertibility is widely debated both in China and by foreign observers. This study contributes to the understanding of China’s capital account by constructing new indices for China’s financial openness. First, we construct alternative indices, both of which suggest that China has experienced significant increases in its financial openness, albeit beginning at very low levels in the late 1970s. Then, we construct an index for financial openness at the provincial level from 2000. As expected, the eastern provinces exhibit much higher levels of financial openness than the provinces located in the central and western parts of the country. Taken together, these indices enable a clear overview of national and regional financial openness across time and are well suited for future studies on determinants and effects of financial openness in China.",[268,3865,3866],"Johansson, Anders C.","Wang, Xun",[272,3868,3869],"0000-0002-2964-872X","0000-0002-4909-9764","https:\u002F\u002Fdoi.org\u002F10.1080\u002F14765284.2016.1261490","W2557671569","Journal of Chinese Economic and Business Studies",[1296,282,3874,3875,36,834,3876,1440,1301,429,285,1358,289,3877],"Capital account","Convertibility","Construct (python library)","Currency",{"type":39,"children":3879,"toc":3884},[3880],{"type":42,"tag":43,"props":3881,"children":3882},{},[3883],{"type":47,"value":3863},{"title":8,"searchDepth":49,"depth":49,"links":3885},[],"content:publications:2016:national-and-regional-financial-openness-in-china.md","publications\u002F2016\u002Fnational-and-regional-financial-openness-in-china.md","publications\u002F2016\u002Fnational-and-regional-financial-openness-in-china",{"_path":3890,"_dir":3190,"_draft":7,"_partial":7,"_locale":8,"title":3891,"description":3892,"_hidden":7,"Vocational and Professional Education and Training (VPET) authors":3893,"authors_orcid":3895,"year":3195,"doi":3897,"openalex_id":3898,"venue":21,"abstract_screenshot":21,"keywords":3899,"body":3905,"_type":51,"_id":3913,"_source":53,"_file":3914,"_stem":3915,"_extension":56,"locale":57},"\u002Fpublications\u002F2016\u002Fopen-educational-resources-oers-and-technology-enhanced-learning-tel-in-vocation","Open Educational Resources (OERs) and Technology Enhanced Learning (TEL) in","This paper examines teachers' views on Technology Enhanced Learning (TEL) and Open Educational Resources (OERs) in Vocational and Professional Educational and Training (VPET) in Hong Kong. A number of the Quality Enhancement Supporting Scheme Projects sponsored by the Education Bureau of Hong Kong SAR Government indicate increasing effort to develop OERs for VPET. Several studies have shown that although VPET emphasizes hand-on practical skills under an instructor's supervision, online OERs are increasingly being considered as effective independent learning materials to facilitate learning and teaching. To further examine the needs, a study was conducted in the leading VPET institution in Hong Kong. Questionnaire surveys were distributed to teachers for feedback from TEL and OER seminars and training workshops. Findings indicate that although TEL and OERs for VPET are in great demand, the funding, institutional support, and technical ability to develop TEL and OERs remain concerns.",[595,3894,850],"Ng, Ricky Yuk-Kwan",[599,3896,853],"0009-0006-5796-585X","https:\u002F\u002Fdoi.org\u002F10.1109\u002Ftale.2016.7851808","W2588483206",[3900,3901,3255,747,3902,3095,3903,3904,23,1379,866,629,1358,1380,865,289,380],"Vocational education","Open educational resources","Training (meteorology)","Medical education","Professional development",{"type":39,"children":3906,"toc":3911},[3907],{"type":42,"tag":43,"props":3908,"children":3909},{},[3910],{"type":47,"value":3892},{"title":8,"searchDepth":49,"depth":49,"links":3912},[],"content:publications:2016:open-educational-resources-oers-and-technology-enhanced-learning-tel-in-vocation.md","publications\u002F2016\u002Fopen-educational-resources-oers-and-technology-enhanced-learning-tel-in-vocation.md","publications\u002F2016\u002Fopen-educational-resources-oers-and-technology-enhanced-learning-tel-in-vocation",{"_path":3917,"_dir":3190,"_draft":7,"_partial":7,"_locale":8,"title":3918,"description":3919,"_hidden":7,"authors":3920,"authors_orcid":3924,"year":3195,"doi":3926,"openalex_id":3927,"venue":21,"abstract_screenshot":21,"keywords":3928,"body":3929,"_type":51,"_id":3937,"_source":53,"_file":3938,"_stem":3939,"_extension":56,"locale":57},"\u002Fpublications\u002F2016\u002Fprioritizing-interaction-test-suites-using-repeated-base-choice-coverage","Prioritizing Interaction Test Suites Using Repeated Base Choice Coverage","Combinatorial interaction testing is a well-studied testing strategy that aims at constructing an effective interaction test suite (ITS) of a specific generation strength to identify interaction faults caused by the interactions among factors. Due to limited testing resources in practice, for example in combinatorial interaction regression testing, interaction test suite prioritization (ITSP) has been proposed to improve the efficiency of testing. An intuitive ITSP strategy that has been widely used in practice is fixed-strength interaction coverage based prioritization (FICBP). FICBP makes use of a property of the ITS: interaction coverage at a fixed prioritization strength. However, a challenge facing FICBP is that, when the ITS is large, the prioritization cost can be very high. In this paper, we propose a new FICBP method that, by repeatedly using base choice coverage (i.e., one-wise coverage) during the prioritization process, improves testing efficiency while maintaining testing effectiveness. The empirical studies show that our method has fault detection capability comparable to current FICBP methods, but obtains more stable results in many cases. Additionally, our method requires considerably less prioritization time than other FICBP methods at different prioritization strengths.",[645,3921,648,595,3922,3923],"Zong, Weiwen","Zhou, Yunan","Chen, Deng",[650,21,651,599,21,3925],"0000-0001-6359-801X","https:\u002F\u002Fdoi.org\u002F10.1109\u002Fcompsac.2016.167","W2516462976",[656,23,1164,135,657,773,557,662,658,661,181,215,1009,139,179,138],{"type":39,"children":3930,"toc":3935},[3931],{"type":42,"tag":43,"props":3932,"children":3933},{},[3934],{"type":47,"value":3919},{"title":8,"searchDepth":49,"depth":49,"links":3936},[],"content:publications:2016:prioritizing-interaction-test-suites-using-repeated-base-choice-coverage.md","publications\u002F2016\u002Fprioritizing-interaction-test-suites-using-repeated-base-choice-coverage.md","publications\u002F2016\u002Fprioritizing-interaction-test-suites-using-repeated-base-choice-coverage",{"_path":3941,"_dir":3190,"_draft":7,"_partial":7,"_locale":8,"title":3942,"description":8,"_hidden":7,"development\" authors":3943,"authors_orcid":3947,"year":3195,"doi":3950,"openalex_id":3951,"venue":3952,"abstract_screenshot":21,"keywords":3953,"body":3962,"_type":51,"_id":3966,"_source":53,"_file":3967,"_stem":3968,"_extension":56,"locale":57},"\u002Fpublications\u002F2016\u002Fresearch-diversification-and-impact-the-case-of-national-nanoscience-development","Research diversification and impact: the case of national nanoscienc",[3944,3945,65,3946],"Herron, Patrick","Mehta, Aashish","Lenoir, Timothy",[3948,3949,70,21],"0000-0002-4702-8620","0000-0003-1598-1019","https:\u002F\u002Fdoi.org\u002F10.1007\u002Fs11192-016-2062-7","W3123833861","Scientometrics",[556,3954,3955,3956,3957,3958,3959,1358,3960,691,178,23,36,289,751,3745,3961],"Citation","Proxy (statistics)","Citation impact","Societal impact of nanotechnology","Regional science","Nanotechnology","Economic geography","Materials science",{"type":39,"children":3963,"toc":3964},[],{"title":8,"searchDepth":49,"depth":49,"links":3965},[],"content:publications:2016:research-diversification-and-impact-the-case-of-national-nanoscience-development.md","publications\u002F2016\u002Fresearch-diversification-and-impact-the-case-of-national-nanoscience-development.md","publications\u002F2016\u002Fresearch-diversification-and-impact-the-case-of-national-nanoscience-development",{"_path":3970,"_dir":3971,"_draft":7,"_partial":7,"_locale":8,"title":3972,"description":3973,"_hidden":7,"Prioritization authors":3974,"authors_orcid":3975,"year":3976,"doi":3977,"openalex_id":3978,"venue":21,"abstract_screenshot":21,"keywords":3979,"body":3984,"_type":51,"_id":3992,"_source":53,"_file":3993,"_stem":3994,"_extension":56,"locale":57},"\u002Fpublications\u002F2017\u002Fan-empirical-comparison-of-similarity-measures-for-abstract-test-case-prioritiza","2017","An Empirical Comparison of Similarity Measures for Abstract Test Case","Test case prioritization (TCP) attempts to order test cases such that those which are more important, according to some criterion or measurement, are executed earlier. TCP has been applied in many testing situations, including, for example, regression testing. An abstract test case (also called a model input) is an important type of test case, and has been widely used in practice, such as in configurable systems and software product lines. Similarity-based test case prioritization (STCP) has been proven to be cost-effective for abstract test cases (ATCs), but because there are many similarity measures which could be used to evaluate ATCs and to support STCP, we face the following question: How can we choose the similarity measure(s) for prioritizing ATCs that will deliver the most effective results? To address this, we studied fourteen measures and two popular STCP algorithms - local STCP (LSTCP), and global STCP (GSTCP). We also conducted an empirical study of five realworld programs, and investigated the efficacy of each similarity measure, according to the interaction coverage rate and fault detection rate. The results of these studies show that GSTCP outperforms LSTCP - in 61% to 84% of the cases, in terms of interaction coverage rates; and in 76% to 78% of the cases with respect to fault detection rates. Our studies also show that Overlap, the simplest similarity measure examined in this study, could obtain the overall best performance for LSTCP; and that Goodall3 has the best performance for GSTCP.",[645,3922,3921,595,648],[650,21,21,599,651],2017,"https:\u002F\u002Fdoi.org\u002F10.1109\u002Fcompsac.2017.271","W2755412327",[3122,23,1164,659,3980,656,3175,3981,181,3982,3442,139,37,3666,34,3983,179],"Measure (data warehouse)","Empirical research","Similarity measure","Software system",{"type":39,"children":3985,"toc":3990},[3986],{"type":42,"tag":43,"props":3987,"children":3988},{},[3989],{"type":47,"value":3973},{"title":8,"searchDepth":49,"depth":49,"links":3991},[],"content:publications:2017:an-empirical-comparison-of-similarity-measures-for-abstract-test-case-prioritiza.md","publications\u002F2017\u002Fan-empirical-comparison-of-similarity-measures-for-abstract-test-case-prioritiza.md","publications\u002F2017\u002Fan-empirical-comparison-of-similarity-measures-for-abstract-test-case-prioritiza",{"_path":3996,"_dir":3971,"_draft":7,"_partial":7,"_locale":8,"title":3997,"description":3998,"_hidden":7,"authors":3999,"authors_orcid":4000,"year":3976,"doi":4001,"openalex_id":4002,"venue":21,"abstract_screenshot":21,"keywords":4003,"body":4005,"_type":51,"_id":4013,"_source":53,"_file":4014,"_stem":4015,"_extension":56,"locale":57},"\u002Fpublications\u002F2017\u002Fan-empirical-examination-of-abstract-test-case-prioritization-techniques","An Empirical Examination of Abstract Test Case Prioritization Techniques","Abstract test case prioritization (ATCP) aims at ordering abstract test case in order to increase the speed at which faults are detected, potentially increasing the fault detection rate. This paper empirically examines possible ATCP techniques, according to the following four categories: non-information-guided prioritization (NIGP), interaction coverage based prioritization (ICBP), input-model mutation based prioritization (IMBP), and similarity based prioritization (SBP). We found that the ICBP category has better testing effectiveness than others, according to fault detection rates. Surprisingly, we found that NIGP can achieve similar performance to IMBP, and that SBP can sometimes achieve even better rates of fault detection than some ICBP techniques.",[645,3921,595,3922,648],[650,21,599,21,651],"https:\u002F\u002Fdoi.org\u002F10.1109\u002Ficse-c.2017.105","W2621003306",[656,23,3175,3122,659,3442,181,661,37,179,4004,177],"Image (mathematics)",{"type":39,"children":4006,"toc":4011},[4007],{"type":42,"tag":43,"props":4008,"children":4009},{},[4010],{"type":47,"value":3998},{"title":8,"searchDepth":49,"depth":49,"links":4012},[],"content:publications:2017:an-empirical-examination-of-abstract-test-case-prioritization-techniques.md","publications\u002F2017\u002Fan-empirical-examination-of-abstract-test-case-prioritization-techniques.md","publications\u002F2017\u002Fan-empirical-examination-of-abstract-test-case-prioritization-techniques",{"_path":4017,"_dir":3971,"_draft":7,"_partial":7,"_locale":8,"title":4018,"description":8,"_hidden":7,"network analysis of patents at USPTO\" authors":4019,"authors_orcid":4022,"year":3976,"doi":4025,"openalex_id":4026,"venue":3952,"abstract_screenshot":21,"keywords":4027,"body":4035,"_type":51,"_id":4039,"_source":53,"_file":4040,"_stem":4041,"_extension":56,"locale":57},"\u002Fpublications\u002F2017\u002Fan-evolutionary-process-of-global-nanotechnology-collaboration-a-social-network","An evolutionary process of global nanotechnology collaboration: a socia",[4020,4021,65],"Liu, F.C.","Zhang, Na",[4023,4024,70],"0000-0001-7356-5895","0000-0003-3118-9523","https:\u002F\u002Fdoi.org\u002F10.1007\u002Fs11192-017-2362-6","W2603557277",[4028,4029,3331,4030,4031,135,4032,245,23,178,4033,3468,691,629,4034,869,37,3597,288,34],"Betweenness centrality","Centrality","Closeness","Social network analysis","Preferential attachment","Complex network","Social media",{"type":39,"children":4036,"toc":4037},[],{"title":8,"searchDepth":49,"depth":49,"links":4038},[],"content:publications:2017:an-evolutionary-process-of-global-nanotechnology-collaboration-a-social-network.md","publications\u002F2017\u002Fan-evolutionary-process-of-global-nanotechnology-collaboration-a-social-network.md","publications\u002F2017\u002Fan-evolutionary-process-of-global-nanotechnology-collaboration-a-social-network",{"_path":4043,"_dir":3971,"_draft":7,"_partial":7,"_locale":8,"title":4044,"description":8,"_hidden":7,"authors":4045,"authors_orcid":4046,"year":3976,"doi":4047,"openalex_id":4048,"venue":4049,"abstract_screenshot":21,"keywords":4050,"body":4052,"_type":51,"_id":4056,"_source":53,"_file":4057,"_stem":4058,"_extension":56,"locale":57},"\u002Fpublications\u002F2017\u002Fan-investigation-on-compound-neighborhoods-for-vrptw","An Investigation on Compound Neighborhoods for VRPTW",[3410,319,12,3411],[3413,322,15,3414],"https:\u002F\u002Fdoi.org\u002F10.1007\u002F978-3-319-53982-9_1","W2588308672","Communications in computer and information science",[247,505,209,31,23,101,3418,34,250,289,251,4051],"Cartography",{"type":39,"children":4053,"toc":4054},[],{"title":8,"searchDepth":49,"depth":49,"links":4055},[],"content:publications:2017:an-investigation-on-compound-neighborhoods-for-vrptw.md","publications\u002F2017\u002Fan-investigation-on-compound-neighborhoods-for-vrptw.md","publications\u002F2017\u002Fan-investigation-on-compound-neighborhoods-for-vrptw",{"_path":4060,"_dir":3971,"_draft":7,"_partial":7,"_locale":8,"title":4061,"description":4062,"_hidden":7,"authors":4063,"authors_orcid":4065,"year":3976,"doi":4066,"openalex_id":4067,"venue":4068,"abstract_screenshot":21,"keywords":4069,"body":4070,"_type":51,"_id":4078,"_source":53,"_file":4079,"_stem":4080,"_extension":56,"locale":57},"\u002Fpublications\u002F2017\u002Fchallenges-of-s-amp-t-system-reform-in-china","Challenges of S&T system reform in China","Despite promising reforms, autonomy is unclear",[65,4064],"Suttmeier, Richard P.",[70,21],"https:\u002F\u002Fdoi.org\u002F10.1126\u002Fscience.aal2515","W2598141673","Science",[282,1358],{"type":39,"children":4071,"toc":4076},[4072],{"type":42,"tag":43,"props":4073,"children":4074},{},[4075],{"type":47,"value":4062},{"title":8,"searchDepth":49,"depth":49,"links":4077},[],"content:publications:2017:challenges-of-s-amp-t-system-reform-in-china.md","publications\u002F2017\u002Fchallenges-of-s-amp-t-system-reform-in-china.md","publications\u002F2017\u002Fchallenges-of-s-amp-t-system-reform-in-china",{"_path":4082,"_dir":3971,"_draft":7,"_partial":7,"_locale":8,"title":4083,"description":4084,"_hidden":7,"authors":4085,"authors_orcid":4086,"year":3976,"doi":4087,"openalex_id":4088,"venue":4089,"abstract_screenshot":21,"keywords":4090,"body":4096,"_type":51,"_id":4104,"_source":53,"_file":4105,"_stem":4106,"_extension":56,"locale":57},"\u002Fpublications\u002F2017\u002Fcycle-slip-detection-for-triple-frequency-gps-observations-under-ionospheric-sci","Cycle-slip Detection for Triple-frequency GPS Observations Under Ionospheric Scintillation","Correctly detecting cycle slips is essential for the application of the GPS carrier phase observations in precise positioning. However it is still a challenge to detect small cycle slips caused by ionospheric scintillation. Severe ionospheric scintillation can directly affect the noise level in code and phase measurements, reducing the accuracy in detecting cycle slips. Thus, this research propose a novel detection method on the basis of triple-frequency observations and a Hatch-Melbourne-Wübbena (HMW) combination to detect the cycle slips as a result of ionospheric scintillation. By setting the coefficients of the code measurements in HMW combination to float numbers and introducing the extra-wide-lane signal (0,1,-1), the proposed method can minimize the effect of the measurement noise, especially the noise of the code measurement, and eliminate the ionospheric delay. The time-differenced ambiguity is used as the detection value. In order to determine a suitable threshold for both normal cases and ionospheric scintillation cases, two methods are reviewed. These are the sample variation method and the Generalized AutoRegressive Conditional Heteroscedasticity (GARCH) method. During ionospheric scintillation, the former method may have a great number of false alarms, while the latter method may ignore small cycle slips. This paper proposes a GARCH with partly fixed threshold method. In this method, the threshold is estimated by the GARCH method, while the threshold will be fixed to 1 cycle when the value provided by GARCH is larger than 1 cycle. Thus this threshold can take into account all sizes of cycle slips in both observation conditions. The proposed method is tested with triple-frequency data observed from a satellite whose data is affected by scintillation during a period with high elevation angle. Compared to the sample variation method and the GARCH method, the threshold estimated by the GARCH with partly fixed threshold method can detect all the possible cycle slips, including both artificially added and real original ones. All the slips are removed in the results of GARCH with partly fixed method, while some small slips are still left when using the other two methods.",[3375,1182,3377,3376,12],[3379,1185,3381,3380,15],"https:\u002F\u002Fdoi.org\u002F10.33012\u002F2017.15326","W2774670889","Proceedings of the Satellite Division's International Technical Meeting (Online)\u002FProceedings of the Satellite Division's International Technical Meeting (CD-ROM)",[4091,3392,4092,4093,23,332,34,3597,288,4094,4095],"Scintillation","Ionosphere","Noise (video)","Detector","Geophysics",{"type":39,"children":4097,"toc":4102},[4098],{"type":42,"tag":43,"props":4099,"children":4100},{},[4101],{"type":47,"value":4084},{"title":8,"searchDepth":49,"depth":49,"links":4103},[],"content:publications:2017:cycle-slip-detection-for-triple-frequency-gps-observations-under-ionospheric-sci.md","publications\u002F2017\u002Fcycle-slip-detection-for-triple-frequency-gps-observations-under-ionospheric-sci.md","publications\u002F2017\u002Fcycle-slip-detection-for-triple-frequency-gps-observations-under-ionospheric-sci",{"_path":4108,"_dir":3971,"_draft":7,"_partial":7,"_locale":8,"title":4109,"description":4110,"_hidden":7,"Sequential Pattern Mining Method authors":4111,"authors_orcid":4115,"year":3976,"doi":4119,"openalex_id":4120,"venue":654,"abstract_screenshot":21,"keywords":4121,"body":4122,"_type":51,"_id":4130,"_source":53,"_file":4131,"_stem":4132,"_extension":56,"locale":57},"\u002Fpublications\u002F2017\u002Fdetecting-implicit-security-exceptions-using-an-improved-variable-length-sequent","Detecting Implicit Security Exceptions Using an Improved Variable-Length","The process of component security testing can produce massive amounts of monitor logs. Current approaches to detect implicit security exceptions (those which cannot be identified by visual inspection alone) compare correct execution sequences with fixed patterns mined from the execution of sequential patterns in the monitor logs. However, this is not efficient and is not suitable for mining large monitor logs. To enable effective mining of implicit security exceptions from large monitor logs, this paper proposes a method based on improved variable-length sequential pattern mining. The proposed method first mines the variable-length sequential patterns from correct execution sequences and from actual execution sequences, thus reducing the number of patterns. The sequential patterns are then detected using the Sunday string-searching algorithm. We conducted an experimental study based on this method, the results of which show that the proposed method can efficiently detect the implicit security exceptions of components.",[648,4112,595,3435,645,4113,4114],"Cai, Saihua","Ackah-Arthur, Hilary","Omari, Michael",[651,4116,599,21,650,4117,4118],"0000-0003-0743-1156","0000-0001-8790-814X","0000-0002-1659-8313","https:\u002F\u002Fdoi.org\u002F10.1142\u002Fs0218194017500462","W2765302430",[23,3418,181,34],{"type":39,"children":4123,"toc":4128},[4124],{"type":42,"tag":43,"props":4125,"children":4126},{},[4127],{"type":47,"value":4110},{"title":8,"searchDepth":49,"depth":49,"links":4129},[],"content:publications:2017:detecting-implicit-security-exceptions-using-an-improved-variable-length-sequent.md","publications\u002F2017\u002Fdetecting-implicit-security-exceptions-using-an-improved-variable-length-sequent.md","publications\u002F2017\u002Fdetecting-implicit-security-exceptions-using-an-improved-variable-length-sequent",{"_path":4134,"_dir":3971,"_draft":7,"_partial":7,"_locale":8,"title":4135,"description":4136,"_hidden":7,"authors":4137,"authors_orcid":4139,"year":3976,"doi":4140,"openalex_id":4141,"venue":21,"abstract_screenshot":21,"keywords":4142,"body":4144,"_type":51,"_id":4152,"_source":53,"_file":4153,"_stem":4154,"_extension":56,"locale":57},"\u002Fpublications\u002F2017\u002Fdeveloping-an-automated-coding-tutorial-oer","Developing an automated coding tutorial OER","Inspired by recent Open Educational Resource (OER) development successes in a Sino-foreign Higher Education Institution in China, we were motivated to explore the possibility of creating a new OER to assist in the learning of programming languages: an automated tutorial system for Java. The approach to this project has been influenced by the Students as Change Agents (SACA) programme, which emphasises student participation and influence on their own education experiences. This paper reports on this project as a work-in-progress, describing the background and motivation, and some related work, and presenting our proposed system. The approach to the development, and implementation completed so far are explained, and our on-going and future work are summarised.",[595,4138],"Zhao, Kaiyu",[599,21],"https:\u002F\u002Fdoi.org\u002F10.1109\u002Ftale.2017.8252339","W2782903417",[23,4143,478,3901,28,629,607,867,1335,869,110,179,1380],"Java",{"type":39,"children":4145,"toc":4150},[4146],{"type":42,"tag":43,"props":4147,"children":4148},{},[4149],{"type":47,"value":4136},{"title":8,"searchDepth":49,"depth":49,"links":4151},[],"content:publications:2017:developing-an-automated-coding-tutorial-oer.md","publications\u002F2017\u002Fdeveloping-an-automated-coding-tutorial-oer.md","publications\u002F2017\u002Fdeveloping-an-automated-coding-tutorial-oer",{"_path":4156,"_dir":3971,"_draft":7,"_partial":7,"_locale":8,"title":4157,"description":4158,"_hidden":7,"Collaboration\" authors":4159,"authors_orcid":4164,"year":3976,"doi":4168,"openalex_id":4169,"venue":21,"abstract_screenshot":21,"keywords":4170,"body":4174,"_type":51,"_id":4182,"_source":53,"_file":4183,"_stem":4184,"_extension":56,"locale":57},"\u002Fpublications\u002F2017\u002Fdeveloping-an-open-educational-resource-reflections-on-a-student-staff-collabora","Developing an Open Educational Resource: Reflections on a Student-Staf","Open educational resources (OERs) are essentially resources made freely available to the public for the purpose of enabling education. This paper examines the experiences of a collaborative team of interdisciplinary teachers and computer science students in their research and development of an OER designed to facilitate student note-making, and research. As expected, the team encountered, and overcame, a number of challenges, with both teachers and students learning from the experiences. The OER has been completed, and has been deployed in a full research study. The reflections from the team may help guide similar projects and other forms of student-centeredcollaboration and education.",[595,3080,3081,3082,4160,4161,4162,4163],"White, Andrew","Jiang, Yiru","Pan, Yichen","Qu, Yu",[599,3086,3087,3088,4165,21,4166,4167],"0000-0002-0793-0142","0000-0002-9933-8604","0000-0002-1400-6740","https:\u002F\u002Fdoi.org\u002F10.1109\u002Fcompsac.2017.281","W2756156830",[3901,924,4171,629,23,4172,4173,866,3903,1379,865,869,380],"Educational resources","Open education","Educational technology",{"type":39,"children":4175,"toc":4180},[4176],{"type":42,"tag":43,"props":4177,"children":4178},{},[4179],{"type":47,"value":4158},{"title":8,"searchDepth":49,"depth":49,"links":4181},[],"content:publications:2017:developing-an-open-educational-resource-reflections-on-a-student-staff-collabora.md","publications\u002F2017\u002Fdeveloping-an-open-educational-resource-reflections-on-a-student-staff-collabora.md","publications\u002F2017\u002Fdeveloping-an-open-educational-resource-reflections-on-a-student-staff-collabora",{"_path":4186,"_dir":3971,"_draft":7,"_partial":7,"_locale":8,"title":4187,"description":8,"_hidden":7,"authors":4188,"authors_orcid":4190,"year":3976,"doi":4192,"openalex_id":4193,"venue":74,"abstract_screenshot":21,"keywords":4194,"body":4195,"_type":51,"_id":4199,"_source":53,"_file":4200,"_stem":4201,"_extension":56,"locale":57},"\u002Fpublications\u002F2017\u002Festimating-unbiassed-expected-loss-with-application-to-consumer-credit","Estimating Unbiassed Expected Loss, with Application to Consumer Credit",[4189],"Bellotti, Anthony",[4191],"0000-0001-6317-5877","https:\u002F\u002Fdoi.org\u002F10.2139\u002Fssrn.2916145","W2605579136",[178,173,287,36,23,3666,34],{"type":39,"children":4196,"toc":4197},[],{"title":8,"searchDepth":49,"depth":49,"links":4198},[],"content:publications:2017:estimating-unbiassed-expected-loss-with-application-to-consumer-credit.md","publications\u002F2017\u002Festimating-unbiassed-expected-loss-with-application-to-consumer-credit.md","publications\u002F2017\u002Festimating-unbiassed-expected-loss-with-application-to-consumer-credit",{"_path":4203,"_dir":3971,"_draft":7,"_partial":7,"_locale":8,"title":4204,"description":8,"_hidden":7,"slicing authors":4205,"authors_orcid":4209,"year":3976,"doi":4211,"openalex_id":4212,"venue":770,"abstract_screenshot":21,"keywords":4213,"body":4220,"_type":51,"_id":4224,"_source":53,"_file":4225,"_stem":4226,"_extension":56,"locale":57},"\u002Fpublications\u002F2017\u002Ffault-localisation-for-ws-bpel-programs-based-on-predicate-switching-and-program","Fault localisation for WS-BPEL programs based on predicate switching and program",[1205,4206,4207,593,595,4208],"Ran, Yufeng","Zheng, Caiyun","Zhang, Xiangyu",[1210,21,21,598,599,4210],"0000-0002-9544-2500","https:\u002F\u002Fdoi.org\u002F10.1016\u002Fj.jss.2017.10.030","W2767168670",[4214,23,4215,1106,4216,4217,4218,607,249,110,869,4219,179],"Business Process Execution Language","Program slicing","Service-oriented architecture","Slicing","Business process","Work in process",{"type":39,"children":4221,"toc":4222},[],{"title":8,"searchDepth":49,"depth":49,"links":4223},[],"content:publications:2017:fault-localisation-for-ws-bpel-programs-based-on-predicate-switching-and-program.md","publications\u002F2017\u002Ffault-localisation-for-ws-bpel-programs-based-on-predicate-switching-and-program.md","publications\u002F2017\u002Ffault-localisation-for-ws-bpel-programs-based-on-predicate-switching-and-program",{"_path":4228,"_dir":3971,"_draft":7,"_partial":7,"_locale":8,"title":4229,"description":8,"_hidden":7,"authors":4230,"authors_orcid":4233,"year":3976,"doi":4236,"openalex_id":4237,"venue":770,"abstract_screenshot":21,"keywords":4238,"body":4243,"_type":51,"_id":4247,"_source":53,"_file":4248,"_stem":4249,"_extension":56,"locale":57},"\u002Fpublications\u002F2017\u002Fintroduction-to-the-special-issue-on-test-oracles","Introduction to the special issue on test oracles",[1156,595,4231,4232],"Poon, Pak‐Lok","Tse, T.H.",[1158,599,4234,4235],"0000-0003-2840-2418","0000-0002-0460-8377","https:\u002F\u002Fdoi.org\u002F10.1016\u002Fj.jss.2017.08.031","W2750009193",[605,3227,23,4239,4240,4241,139,918,747,1406,4242,607,984,37,179,332,110],"Advanced driver assistance systems","Model transformation","Transformation (genetics)","Embedded system",{"type":39,"children":4244,"toc":4245},[],{"title":8,"searchDepth":49,"depth":49,"links":4246},[],"content:publications:2017:introduction-to-the-special-issue-on-test-oracles.md","publications\u002F2017\u002Fintroduction-to-the-special-issue-on-test-oracles.md","publications\u002F2017\u002Fintroduction-to-the-special-issue-on-test-oracles",{"_path":4251,"_dir":3971,"_draft":7,"_partial":7,"_locale":8,"title":4252,"description":4253,"_hidden":7,"authors":4254,"authors_orcid":4256,"year":3976,"doi":4258,"openalex_id":4259,"venue":4260,"abstract_screenshot":21,"keywords":4261,"body":4269,"_type":51,"_id":4277,"_source":53,"_file":4278,"_stem":4279,"_extension":56,"locale":57},"\u002Fpublications\u002F2017\u002Fmeasuring-attitude-towards-personal-data-for-adaptive-cybersecurity","Measuring attitude towards personal data for adaptive cybersecurity","Purpose This paper presents an initial development of a personal data attitude (PDA) measurement instrument based on established psychometric principles. The aim of the research was to develop a reliable measurement scale for quantifying and comparing attitudes towards personal data that can be incorporated into cybersecurity behavioural research models. Such a scale has become necessary for understanding individuals’ attitudes towards specific sets of data, as more technologies are being designed to harvest, collate, share and analyse personal data. Design\u002Fmethodology\u002Fapproach An initial set of 34 five-point Likert-style items were developed with eight subscales and administered to participants online. The data collected were subjected to exploratory and confirmatory factor analyses and MANOVA. The results are consistent with the multidimensionality of attitude theories and suggest that the adopted methodology for the study is appropriate for future research with a more representative sample. Findings Factor analysis of 247 responses identified six constructs of individuals’ attitude towards personal data: protective behaviour, privacy concerns, cost-benefit, awareness, responsibility and security. This paper illustrates how the PDA scale can be a useful guide for information security research and design by briefly discussing the factor structure of the PDA and related results. Originality\u002Fvalue This study addresses a genuine gap in research by taking the first step towards establishing empirical evidence for dimensions underlying personal data attitudes. It also adds a significant benchmark to a growing body of literature on understanding and modelling computer users’ security behaviours.",[3459,4255,3461,595,3460],"Brown, Michael",[21,4257,3464,599,3463],"0000-0001-8305-9064","https:\u002F\u002Fdoi.org\u002F10.1108\u002Fics-11-2016-0085","W2761473796","Information and Computer Security",[4262,4263,4264,4265,749,4266,865,3494,630,101,4267,23,870,180,4268],"Likert scale","Originality","Confirmatory factor analysis","Scale (ratio)","Exploratory factor analysis","Applied psychology","Creativity",{"type":39,"children":4270,"toc":4275},[4271],{"type":42,"tag":43,"props":4272,"children":4273},{},[4274],{"type":47,"value":4253},{"title":8,"searchDepth":49,"depth":49,"links":4276},[],"content:publications:2017:measuring-attitude-towards-personal-data-for-adaptive-cybersecurity.md","publications\u002F2017\u002Fmeasuring-attitude-towards-personal-data-for-adaptive-cybersecurity.md","publications\u002F2017\u002Fmeasuring-attitude-towards-personal-data-for-adaptive-cybersecurity",{"_path":4281,"_dir":3971,"_draft":7,"_partial":7,"_locale":8,"title":4282,"description":4283,"_hidden":7,"strategies\" authors":4284,"authors_orcid":4285,"year":3976,"doi":4286,"openalex_id":4287,"venue":21,"abstract_screenshot":21,"keywords":4288,"body":4290,"_type":51,"_id":4298,"_source":53,"_file":4299,"_stem":4300,"_extension":56,"locale":57},"\u002Fpublications\u002F2017\u002Fopen-educational-resource-oer-adoption-in-higher-education-challenges-and-strate","Open educational resource (OER) adoption in higher education: Challenges an","Open Educational Resources (OERs) are teaching learning, and research resources that have been made available such that they can be used, shared, and modified freely. They have already had a significant impact on Higher Education (HE), and have great potential for providing further positive transformation. However, OER adoption has not been universal, with several obstacles and barriers still hindering its wider influence. This paper examines the current situation of OERs, as reported in the literature, listing some of the challenges to their adoption, and discusses current and possible strategies and steps to alleviate the difficulties facing OER advocates.",[850,595],[853,599],"https:\u002F\u002Fdoi.org\u002F10.1109\u002Ftale.2017.8252355","W2783402813",[3901,4289,4172,629,23,924,4171,178,1379,869,1380],"Listing (finance)",{"type":39,"children":4291,"toc":4296},[4292],{"type":42,"tag":43,"props":4293,"children":4294},{},[4295],{"type":47,"value":4283},{"title":8,"searchDepth":49,"depth":49,"links":4297},[],"content:publications:2017:open-educational-resource-oer-adoption-in-higher-education-challenges-and-strate.md","publications\u002F2017\u002Fopen-educational-resource-oer-adoption-in-higher-education-challenges-and-strate.md","publications\u002F2017\u002Fopen-educational-resource-oer-adoption-in-higher-education-challenges-and-strate",{"_path":4302,"_dir":3971,"_draft":7,"_partial":7,"_locale":8,"title":4303,"description":4304,"_hidden":7,"authors":4305,"authors_orcid":4307,"year":3976,"doi":4309,"openalex_id":4310,"venue":4311,"abstract_screenshot":21,"keywords":4312,"body":4314,"_type":51,"_id":4322,"_source":53,"_file":4323,"_stem":4324,"_extension":56,"locale":57},"\u002Fpublications\u002F2017\u002Foptimisation-of-transportation-service-network-using-k-node-large-neighbourhood","Optimisation of transportation service network using κ -node large neighbourhood search","The Service Network Design Problem (SNDP) is generally considered as a fundamental problem in transportation logistics and involves the determination of an efficient transportation network and corresponding schedules. The problem is extremely challenging due to the complexity of the constraints and the scale of real-world applications. Therefore, efficient solution methods for this problem are one of the most important research issues in this field. However, current research has mainly focused on various sophisticated high-level search strategies in the form of different local search metaheuristics and their hybrids. Little attention has been paid to novel neighbourhood structures which also play a crucial role in the performance of the algorithm. In this research, we propose a new efficient neighbourhood structure that uses the SNDP constraints to its advantage and more importantly appears to have better reachability than the current ones. The effectiveness of this new neighbourhood is evaluated in a basic Tabu Search (TS) metaheuristic and a basic Guided Local Search (GLS) method. Experimental results based on a set of well-known benchmark instances show that the new neighbourhood performs better than the previous arc-flipping neighbourhood. The performance of the TS metaheuristic based on the proposed neighbourhood is further enhanced through fast neighbourhood search heuristics and hybridisation with other approaches.",[12,90,3279,4306],"Cartlidge, John",[15,92,3281,4308],"0000-0002-3143-6355","https:\u002F\u002Fdoi.org\u002F10.1016\u002Fj.cor.2017.06.008","W2624821987","Computers & Operations Research",[239,505,328,23,506,31,4313,211,37,332,34],"Reachability",{"type":39,"children":4315,"toc":4320},[4316],{"type":42,"tag":43,"props":4317,"children":4318},{},[4319],{"type":47,"value":4304},{"title":8,"searchDepth":49,"depth":49,"links":4321},[],"content:publications:2017:optimisation-of-transportation-service-network-using-κ-node-large-neighbourhood.md","publications\u002F2017\u002Foptimisation-of-transportation-service-network-using-κ-node-large-neighbourhood.md","publications\u002F2017\u002Foptimisation-of-transportation-service-network-using-κ-node-large-neighbourhood",{"_path":4326,"_dir":3971,"_draft":7,"_partial":7,"_locale":8,"title":4327,"description":4328,"_hidden":7,"authors":4329,"authors_orcid":4330,"year":3976,"doi":4331,"openalex_id":4332,"venue":21,"abstract_screenshot":21,"keywords":4333,"body":4334,"_type":51,"_id":4342,"_source":53,"_file":4343,"_stem":4344,"_extension":56,"locale":57},"\u002Fpublications\u002F2017\u002Fprioritizing-random-combinatorial-test-suites","Prioritizing random combinatorial test suites","The behaviour of a system under test can be influenced by several factors, such as system configurations, user inputs, and so on. It has also been observed that many failures are caused by only a small number of factors. Combinatorial testing aims at generating a small-sized test suite that can identify such failures. Random testing, on the other hand, selects test cases in a random manner, but has sometimes achieved similar failure-finding performance to combinatorial testing. Due to limited testing resources, test case prioritization is often employed, to attempt to identify failures as early as possible. Many prioritization studies, however, have only focused on test suites constructed by combinatorial testing, ignoring randomly constructed test suites. In this paper, we report on an investigation of test case prioritization for random combinatorial test suites. We conducted a series of empirical studies involving three real-world programs, each of which used twelve random combinatorial test suites, and adopted the well-known test case prioritization technique fixed-strength interaction coverage based prioritization (FICBP). Results from the studies indicate that, FICBP with high prioritization strength achieves better interaction coverage rate than with low prioritization strength. Furthermore, when the size of the random test suite is small, it would be better to assign a prioritization strength of 2; but otherwise, a strength of 3 would be more appropriate.",[645,3922,596,595,648,3921],[650,21,600,599,651,21],"https:\u002F\u002Fdoi.org\u002F10.1145\u002F3019612.3019774","W2617992140",[656,23,657,1163,659,660,658,661,215,34,179],{"type":39,"children":4335,"toc":4340},[4336],{"type":42,"tag":43,"props":4337,"children":4338},{},[4339],{"type":47,"value":4328},{"title":8,"searchDepth":49,"depth":49,"links":4341},[],"content:publications:2017:prioritizing-random-combinatorial-test-suites.md","publications\u002F2017\u002Fprioritizing-random-combinatorial-test-suites.md","publications\u002F2017\u002Fprioritizing-random-combinatorial-test-suites",{"_path":4346,"_dir":3971,"_draft":7,"_partial":7,"_locale":8,"title":4347,"description":4348,"_hidden":7,"authors":4349,"authors_orcid":4353,"year":3976,"doi":21,"openalex_id":4357,"venue":21,"abstract_screenshot":21,"keywords":4358,"body":4361,"_type":51,"_id":4369,"_source":53,"_file":4370,"_stem":4371,"_extension":56,"locale":57},"\u002Fpublications\u002F2017\u002Fproceedings-of-the-2nd-international-workshop-on-metamorphic-testing","Proceedings of the 2nd International Workshop on Metamorphic Testing","Metamorphic Testing (MT) is a testing technique that exploits the relationships among the inputs and outputs of multiple executions of the program under test, so- called Metamorphic Relations (MRs). MT has been proven highly effective in testing programs that face the oracle problem, for which the correctness of individual output is difficult to determine. Since the introduction of MT in 1998, the interest in this testing methodology has grown immensely with numerous applications in various domains such as machine learning, bioinformatics, computer graphics, simulation, search engines, decision support, cloud computing, databases, and compilers.",[4350,4351,595,1205,4352],"Pullum, Laura","Kanewala, Upulee","Delamaro, Márcio Eduardo",[4354,4355,599,1210,4356],"0000-0001-6045-7668","0000-0002-5954-1616","0000-0001-7535-5891","W2913784326",[605,23,3227,4359,4360,3123,606,110,1034,607,1113,139,180],"Compiler","Graphics",{"type":39,"children":4362,"toc":4367},[4363],{"type":42,"tag":43,"props":4364,"children":4365},{},[4366],{"type":47,"value":4348},{"title":8,"searchDepth":49,"depth":49,"links":4368},[],"content:publications:2017:proceedings-of-the-2nd-international-workshop-on-metamorphic-testing.md","publications\u002F2017\u002Fproceedings-of-the-2nd-international-workshop-on-metamorphic-testing.md","publications\u002F2017\u002Fproceedings-of-the-2nd-international-workshop-on-metamorphic-testing",{"_path":4373,"_dir":3971,"_draft":7,"_partial":7,"_locale":8,"title":4374,"description":4375,"_hidden":7,"authors":4376,"authors_orcid":4380,"year":3976,"doi":4384,"openalex_id":4385,"venue":21,"abstract_screenshot":21,"keywords":4386,"body":4392,"_type":51,"_id":4400,"_source":53,"_file":4401,"_stem":4402,"_extension":56,"locale":57},"\u002Fpublications\u002F2017\u002Frecognizing-the-presence-of-hidden-visual-markers-in-digital-images","Recognizing the Presence of Hidden Visual Markers in Digital Images","As the promise of Virtual and Augmented Reality (VR and AR) becomes more realistic, an interesting aspect of our enhanced living environment includes the availability ? indeed the potential ubiquity ? of scannable markers. Such markers could represent an initial step into the AR and VR worlds. In this paper, we address the important question of how to recognise the presence of visual markers in freeform digital photos. We use a particularly challenging marker format that is only minimally constrained in structure, called Artcodes. Artcodes are a type of topological marker system enabling people, by following very simple drawing rules, to design markers that are both aesthetically beautiful and machine readable. Artcodes can be used to decorate the surface of any objects, and yet can also contain a hidden digital meaning. Like some other more commonly used markers (such as Barcodes, QR codes), it is possible to use codes to link physical objects to digital data, augmenting everyday objects. Obviously, in order to trigger the behaviour of scanning and further decoding of such codes, it is first necessary for devices to be aware of the presence of Artcodes in the image.",[4377,4378,595,4379],"Xu, Liming","French, Andrew P.","Benford, Steve",[4381,4382,599,4383],"0000-0003-2472-9130","0000-0002-8313-2898","0000-0001-8041-2520","https:\u002F\u002Fdoi.org\u002F10.1145\u002F3126686.3126761","W2765494719",[23,4387,482,868,4388,37,4389,4390,4391],"Augmented reality","Meaning (existential)","Metaverse","Virtual reality","Computer vision",{"type":39,"children":4393,"toc":4398},[4394],{"type":42,"tag":43,"props":4395,"children":4396},{},[4397],{"type":47,"value":4375},{"title":8,"searchDepth":49,"depth":49,"links":4399},[],"content:publications:2017:recognizing-the-presence-of-hidden-visual-markers-in-digital-images.md","publications\u002F2017\u002Frecognizing-the-presence-of-hidden-visual-markers-in-digital-images.md","publications\u002F2017\u002Frecognizing-the-presence-of-hidden-visual-markers-in-digital-images",{"_path":4404,"_dir":3971,"_draft":7,"_partial":7,"_locale":8,"title":4405,"description":4406,"_hidden":7,"Practices\" authors":4407,"authors_orcid":4408,"year":3976,"doi":4409,"openalex_id":4410,"venue":21,"abstract_screenshot":21,"keywords":4411,"body":4414,"_type":51,"_id":4422,"_source":53,"_file":4423,"_stem":4424,"_extension":56,"locale":57},"\u002Fpublications\u002F2017\u002Fstudents-as-partners-in-a-multi-media-note-taking-app-development-best-practices","Students as Partners in a Multi-Media Note-Taking App Development: Bes","This paper summarises some of the best practices learned from an extended software engineering project completed through a collaboration of multidisciplinary faculty and several teams of computer science students. The collaboration delivered an advanced multimedia note-taking application, as an open educational resource (OER), capable of supporting both students and research into note-making practices. The project lasted beyond a single academic year, thus enabling multiple student cohort participation, and took place in an English medium of instruction, Sino-foreign university in China. The experiences and reflections surrounding the project were examined, with a number of resulting ideas for best practices.",[595,3080,3081,3082,4160,4161,4162,4163],[599,3086,3087,3088,4165,21,4166,4167],"https:\u002F\u002Fdoi.org\u002F10.1109\u002Ficse-c.2017.58","W2621372588",[4412,4413,23,3901,924,282,866,1335,629,3903,867,865,869,1380,179,1358,380],"Best practice","Multidisciplinary approach",{"type":39,"children":4415,"toc":4420},[4416],{"type":42,"tag":43,"props":4417,"children":4418},{},[4419],{"type":47,"value":4406},{"title":8,"searchDepth":49,"depth":49,"links":4421},[],"content:publications:2017:students-as-partners-in-a-multi-media-note-taking-app-development-best-practices.md","publications\u002F2017\u002Fstudents-as-partners-in-a-multi-media-note-taking-app-development-best-practices.md","publications\u002F2017\u002Fstudents-as-partners-in-a-multi-media-note-taking-app-development-best-practices",{"_path":4426,"_dir":3971,"_draft":7,"_partial":7,"_locale":8,"title":4427,"description":8,"_hidden":7,"sequence approach based on clustering\" authors":4428,"authors_orcid":4429,"year":3976,"doi":4430,"openalex_id":4431,"venue":770,"abstract_screenshot":21,"keywords":4432,"body":4433,"_type":51,"_id":4437,"_source":53,"_file":4438,"_stem":4439,"_extension":56,"locale":57},"\u002Fpublications\u002F2017\u002Ftest-case-prioritization-for-object-oriented-software-an-adaptive-random-sequenc","Test case prioritization for object-oriented software: An adaptive rando",[648,3435,596,595,594,645,3436],[651,21,600,599,21,650,21],"https:\u002F\u002Fdoi.org\u002F10.1016\u002Fj.jss.2017.09.031","W2764176914",[3441,181,23,1164,3145,658,139,37,215,138,1009],{"type":39,"children":4434,"toc":4435},[],{"title":8,"searchDepth":49,"depth":49,"links":4436},[],"content:publications:2017:test-case-prioritization-for-object-oriented-software-an-adaptive-random-sequenc.md","publications\u002F2017\u002Ftest-case-prioritization-for-object-oriented-software-an-adaptive-random-sequenc.md","publications\u002F2017\u002Ftest-case-prioritization-for-object-oriented-software-an-adaptive-random-sequenc",{"_path":4441,"_dir":4442,"_draft":7,"_partial":7,"_locale":8,"title":4443,"description":4444,"_hidden":7,"authors":4445,"authors_orcid":4447,"year":4449,"doi":4450,"openalex_id":4451,"venue":887,"abstract_screenshot":21,"keywords":4452,"body":4455,"_type":51,"_id":4463,"_source":53,"_file":4464,"_stem":4465,"_extension":56,"locale":57},"\u002Fpublications\u002F2018\u002Fa-hyper-heuristic-with-two-guidance-indicators-for-bi-objective-mixed-shift-vehi","2018","A hyper-heuristic with two guidance indicators for bi-objective mixed-shift vehicle routing problem with time windows","In this paper, a Mixed-Shift Vehicle Routing Problem is proposed based on a real-life container transportation problem. In a long planning horizon of multiple shifts, transport tasks are completed satisfying the time constraints. Due to the different travel distances and time of tasks, there are two types of shifts ( long shift and short shift ) in this problem. The unit driver cost for long shifts is higher than that of short shifts . A mathematical model of this Mixed-Shift Vehicle Routing Problem with Time Windows (MS-VRPTW) is established in this paper, with two objectives of minimizing the total driver payment and the total travel distance. Due to the large scale and nonlinear constraints, the exact search showed is not suitable to MS-VRPTW. An initial solution construction heuristic (EBIH) and a selective perturbation Hyper-Heuristic (GIHH) are thus developed. In GIHH, five heuristics with different extents of perturbation at the low level are adaptively selected by a high level selection scheme with the Hill Climbing acceptance criterion. Two guidance indicators are devised at the high level to adaptively adjust the selection of the low level heuristics for this bi-objective problem. The two indicators estimate the objective value improvement and the improvement direction over the Pareto Front, respectively. To evaluate the generality of the proposed algorithms, a set of benchmark instances with various features is extracted from real-life historical datasets. The experiment results show that GIHH significantly improves the quality of the final Pareto Solution Set, outperforming the state-of-the-art algorithms for similar problems. Its application on VRPTW also obtains promising results.",[3410,319,12,4446],"Laesanklang, Wasakorn",[3413,322,15,4448],"0000-0003-4203-3452",2018,"https:\u002F\u002Fdoi.org\u002F10.1007\u002Fs10489-018-1250-y","W2885975332",[23,247,506,31,329,209,4453,101,4454,250,34,37,215],"Pareto principle","Multi-objective optimization",{"type":39,"children":4456,"toc":4461},[4457],{"type":42,"tag":43,"props":4458,"children":4459},{},[4460],{"type":47,"value":4444},{"title":8,"searchDepth":49,"depth":49,"links":4462},[],"content:publications:2018:a-hyper-heuristic-with-two-guidance-indicators-for-bi-objective-mixed-shift-vehi.md","publications\u002F2018\u002Fa-hyper-heuristic-with-two-guidance-indicators-for-bi-objective-mixed-shift-vehi.md","publications\u002F2018\u002Fa-hyper-heuristic-with-two-guidance-indicators-for-bi-objective-mixed-shift-vehi",{"_path":4467,"_dir":4442,"_draft":7,"_partial":7,"_locale":8,"title":4468,"description":4469,"_hidden":7,"authors":4470,"authors_orcid":4473,"year":4449,"doi":4474,"openalex_id":4475,"venue":21,"abstract_screenshot":21,"keywords":4476,"body":4480,"_type":51,"_id":4488,"_source":53,"_file":4489,"_stem":4490,"_extension":56,"locale":57},"\u002Fpublications\u002F2018\u002Fa-monte-carlo-method-for-metamorphic-testing-of-machine-translation-services","A monte carlo method for metamorphic testing of machine translation services","With the growing popularity of machine translation services, it has become increasingly important to be able to assess their quality. However, the test oracle problem makes it difficult to conduct automated testing. In this paper, we propose a Monte Carlo method, in combination with metamorphic testing, to overcome the oracle problem. Using this method, we assessed the quality of three popular machine translation services --- namely, Google Translate, Microsoft Translator, and Youdao Translate. We set the source language to be English, and the target languages included Chinese, French, Japanese, Korean, Portuguese, Russian, Spanish, and Swedish. A sample of 33,600 observations (involving a total of 100,800 actual translations) was collected and analyzed using a 3 X 56 factorial design. Based on this data, our model found Google Translate to be the best (in terms of the metamorphic relation used) for each and every target language considered. A trend for Indo-European languages producing better results was also identified.",[4471,1156,4472,595],"Pesu, Daniel","Zhen, Jingfeng",[21,1158,21,599],"https:\u002F\u002Fdoi.org\u002F10.1145\u002F3193977.3193980","W2810169973",[605,23,4477,37,860,4478,4479,749,101,747,215,110,3666,34],"Machine translation","Monte Carlo method","Natural language processing",{"type":39,"children":4481,"toc":4486},[4482],{"type":42,"tag":43,"props":4483,"children":4484},{},[4485],{"type":47,"value":4469},{"title":8,"searchDepth":49,"depth":49,"links":4487},[],"content:publications:2018:a-monte-carlo-method-for-metamorphic-testing-of-machine-translation-services.md","publications\u002F2018\u002Fa-monte-carlo-method-for-metamorphic-testing-of-machine-translation-services.md","publications\u002F2018\u002Fa-monte-carlo-method-for-metamorphic-testing-of-machine-translation-services",{"_path":4492,"_dir":4442,"_draft":7,"_partial":7,"_locale":8,"title":4493,"description":4494,"_hidden":7,"Machine Translation Services\" authors":4495,"authors_orcid":4496,"year":4449,"doi":4497,"openalex_id":4498,"venue":4499,"abstract_screenshot":21,"keywords":4500,"body":4502,"_type":51,"_id":4525,"_source":53,"_file":4526,"_stem":4527,"_extension":56,"locale":57},"\u002Fpublications\u002F2018\u002Faccompanying-dataset-for-a-monte-carlo-method-for-metamorphic-testing-of-machine","Accompanying Dataset For: A Monte Carlo Method For Metamorphic Testing O","This is the original dataset, where white spaces are used to separate words of all languages. This is however not the best method of analyzing some Asian languages. Please refer to the following new version for enhanced, character-based analysis results: Zhi Quan Zhou. (2018). Accompanying dataset for: A Monte Carlo Method for Metamorphic Testing of Machine Translation Services (Version 2.0) Data set. Zenodo. http:\u002F\u002Fdoi.org\u002F10.5281\u002Fzenodo.1230139",[4471,1156,4472,595],[21,1158,21,599],"https:\u002F\u002Fdoi.org\u002F10.5281\u002Fzenodo.1194559","W3001696683","Zenodo (CERN European Organization for Nuclear Research)",[4478,3788,23,4501,37,3789,3666,3790,34,753],"Translation (biology)",{"type":39,"children":4503,"toc":4523},[4504],{"type":42,"tag":43,"props":4505,"children":4506},{},[4507,4509,4514,4516],{"type":47,"value":4508},"This is the original dataset, where white spaces are used to separate words of all languages. This is however not the best method of analyzing some Asian languages. Please refer to the following new version for enhanced, character-based analysis results: Zhi Quan Zhou. (2018). Accompanying dataset for: A Monte Carlo Method for Metamorphic Testing of Machine Translation Services (Version 2.0) ",{"type":42,"tag":809,"props":4510,"children":4511},{},[4512],{"type":47,"value":4513},"Data set",{"type":47,"value":4515},". Zenodo. ",{"type":42,"tag":1574,"props":4517,"children":4521},{"href":4518,"rel":4519},"http:\u002F\u002Fdoi.org\u002F10.5281\u002Fzenodo.1230139",[4520],"nofollow",[4522],{"type":47,"value":4518},{"title":8,"searchDepth":49,"depth":49,"links":4524},[],"content:publications:2018:accompanying-dataset-for-a-monte-carlo-method-for-metamorphic-testing-of-machine.md","publications\u002F2018\u002Faccompanying-dataset-for-a-monte-carlo-method-for-metamorphic-testing-of-machine.md","publications\u002F2018\u002Faccompanying-dataset-for-a-monte-carlo-method-for-metamorphic-testing-of-machine",{"_path":4529,"_dir":4442,"_draft":7,"_partial":7,"_locale":8,"title":4530,"description":4531,"_hidden":7,"Coverage Based Prioritization authors":4532,"authors_orcid":4535,"year":4449,"doi":4537,"openalex_id":4538,"venue":4539,"abstract_screenshot":21,"keywords":4540,"body":4541,"_type":51,"_id":4549,"_source":53,"_file":4550,"_stem":4551,"_extension":56,"locale":57},"\u002Fpublications\u002F2018\u002Fan-empirical-comparison-of-fixed-strength-and-mixed-strength-for-interaction-cov","An Empirical Comparison of Fixed-Strength and Mixed-Strength for Interaction","Test case prioritization (TCP) plays an important role in identifying, characterizing, diagnosing, and correcting faults quickly. The TCP has been widely used to order test cases of different types, including model inputs (also called abstract test cases). Model inputs are constructed by modeling the program according to its input parameters, values, and constraints, and has been used in different testing methods, such as combinatorial interaction testing and software product line testing. The Interaction coverage-based TCP (ICTCP) uses interaction coverage information derived from the model input to order inputs. Previous studies have focused generally on the fixed-strength ICTCP, which adopts a fixed strength (i.e., the level of parameter interactions) to support the ICTCP process. It is generally accepted that using more strengths for ICTCP, i.e., mixed-strength ICTCP, may give better ordering than fixed-strength. To confirm whether mixed-strength is better than fixed-strength, in this paper, we report on an extensive empirical study using five real-world programs (written in C), each of which has six versions. The results of the empirical studies show that mixed-strength has better rates of interaction coverage overall than fixed-strength, but they have very similar rates of fault detection. Our results also show that fixed-strength should be used instead of the mixed-strength at the later stage of software testing. Finally, we offer some practical guidelines for testers when using interaction coverage information to prioritize model inputs, under different testing scenarios and resources.",[645,4533,596,4534,595,648],"Zhang, Quanjun","Hamlyn-Harris, James",[650,4536,600,21,599,651],"0000-0002-2495-3805","https:\u002F\u002Fdoi.org\u002F10.1109\u002Faccess.2018.2879638","W2899739878","IEEE Access",[656,23,178],{"type":39,"children":4542,"toc":4547},[4543],{"type":42,"tag":43,"props":4544,"children":4545},{},[4546],{"type":47,"value":4531},{"title":8,"searchDepth":49,"depth":49,"links":4548},[],"content:publications:2018:an-empirical-comparison-of-fixed-strength-and-mixed-strength-for-interaction-cov.md","publications\u002F2018\u002Fan-empirical-comparison-of-fixed-strength-and-mixed-strength-for-interaction-cov.md","publications\u002F2018\u002Fan-empirical-comparison-of-fixed-strength-and-mixed-strength-for-interaction-cov",{"_path":4553,"_dir":4442,"_draft":7,"_partial":7,"_locale":8,"title":4554,"description":4555,"_hidden":7,"constructors authors":4556,"authors_orcid":4557,"year":4449,"doi":4558,"openalex_id":4559,"venue":21,"abstract_screenshot":21,"keywords":4560,"body":4561,"_type":51,"_id":4569,"_source":53,"_file":4570,"_stem":4571,"_extension":56,"locale":57},"\u002Fpublications\u002F2018\u002Fan-experimental-analysis-of-fault-detection-capabilities-of-covering-array-const","An experimental analysis of fault detection capabilities of covering array","Combinatorial Interaction Testing (CIT) aims at constructing an effective test suite, such as a Covering Array (CA), that can detect faults that are caused by the interaction of parameters. In this paper, we report on some empirical studies conducted to examine the fault detection capabilities of five popular CA constructors: ACTS, Jenny, PICT, CASA, and TCA. The experimental results indicate that Jenny has the best performance, because it achieves better fault detection than the other four constructors in many cases. Our results also indicate that CAs generated using ACTS, PICT, or CASA should be prioritized before testing.",[645,3922,595,596,648],[650,21,599,600,651],"https:\u002F\u002Fdoi.org\u002F10.1145\u002F3183440.3194953","W2809064197",[3442,23,37],{"type":39,"children":4562,"toc":4567},[4563],{"type":42,"tag":43,"props":4564,"children":4565},{},[4566],{"type":47,"value":4555},{"title":8,"searchDepth":49,"depth":49,"links":4568},[],"content:publications:2018:an-experimental-analysis-of-fault-detection-capabilities-of-covering-array-const.md","publications\u002F2018\u002Fan-experimental-analysis-of-fault-detection-capabilities-of-covering-array-const.md","publications\u002F2018\u002Fan-experimental-analysis-of-fault-detection-capabilities-of-covering-array-const",{"_path":4573,"_dir":4442,"_draft":7,"_partial":7,"_locale":8,"title":4574,"description":4575,"_hidden":7,"authors":4576,"authors_orcid":4591,"year":4449,"doi":4602,"openalex_id":4603,"venue":4604,"abstract_screenshot":21,"keywords":4605,"body":4610,"_type":51,"_id":4618,"_source":53,"_file":4619,"_stem":4620,"_extension":56,"locale":57},"\u002Fpublications\u002F2018\u002Fare-we-there-yet-how-and-when-specific-biotechnologies-will-improve-human-health","Are We There Yet? How and When Specific Biotechnologies Will Improve Human Health","Patient X: A 67-year-old Caucasian man slips on a patch of ice. He has abrasions to his hands and has sustained significant damage to his hip. At the emergency room, he informs clinicians he takes atorvastatin, metformin, and glimepiride to treat hypertension and Type 2 Diabetes Mellitus (T2DM). X-rays reveal a fractured hip, which will require total hip replacement surgery.",[4577,4578,4579,4580,4581,4582,4583,65,4584,4585,4586,4587,4588,4589,4590],"O’Day, Elizabeth","Hosta‐Rigau, Leticia","Oyarzún, Diego A.","Okano, Hideyuki","Lorenzo, Vı́ctor de","Kameke, Conrad von","Alsafar, Habiba","Chen, Guo‐Qiang","Ji, Weizhi","Roberts, Richard J.","Ronaghi, Mostafa","Yeung, Karen","Zhang, Feng","Lee, Sang Yup",[21,4592,4593,4594,4595,21,4596,70,4597,4598,21,21,4599,4600,4601],"0000-0001-8177-4806","0000-0002-0381-5278","0000-0001-7482-5935","0000-0002-6041-2731","0000-0001-7141-1438","0000-0002-7226-1782","0000-0003-2550-4224","0000-0003-4652-4259","0000-0003-0178-7995","0000-0003-0599-3091","https:\u002F\u002Fdoi.org\u002F10.1002\u002Fbiot.201800195","W2804697235","Biotechnology Journal",[4606,4607,691,4608,23,380,4609],"Computational biology","Human health","Biology","Environmental health",{"type":39,"children":4611,"toc":4616},[4612],{"type":42,"tag":43,"props":4613,"children":4614},{},[4615],{"type":47,"value":4575},{"title":8,"searchDepth":49,"depth":49,"links":4617},[],"content:publications:2018:are-we-there-yet-how-and-when-specific-biotechnologies-will-improve-human-health.md","publications\u002F2018\u002Fare-we-there-yet-how-and-when-specific-biotechnologies-will-improve-human-health.md","publications\u002F2018\u002Fare-we-there-yet-how-and-when-specific-biotechnologies-will-improve-human-health",{"_path":4622,"_dir":4442,"_draft":7,"_partial":7,"_locale":8,"title":4623,"description":8,"_hidden":7,"Subsurface Inter-asset Management\" authors":4624,"authors_orcid":4635,"year":4449,"doi":4644,"openalex_id":4645,"venue":687,"abstract_screenshot":21,"keywords":4646,"body":4650,"_type":51,"_id":4654,"_source":53,"_file":4655,"_stem":4656,"_extension":56,"locale":57},"\u002Fpublications\u002F2018\u002Fatu-dss-knowledge-driven-data-integration-and-reasoning-for-sustainable-subsurfa","ATU-DSS: Knowledge-Driven Data Integration and Reasoning for Sustainabl",[4625,4626,4627,4628,4629,4630,4631,4632,4633,4634],"Wei, Lijun","Du, Heshan","Mahesar, Quratul-ain","Clarke, Barry","Magee, Derek","Dimitrova, Vania","Gunn, David","Entwisle, David","Reeves, Helen","Cohn, Anthony G.",[4636,4637,4638,4639,4640,4641,4642,21,21,4643],"0000-0002-5685-4940","0000-0002-6300-3503","0000-0002-8947-4485","0000-0001-9493-9200","0000-0003-2170-3103","0000-0002-7001-0891","0000-0001-6501-8912","0000-0002-7652-8907","https:\u002F\u002Fdoi.org\u002F10.1007\u002F978-3-319-98192-5_2","W2802818351",[244,23,4647,1034,28,175,629,4648,4649,691,170,181,37,180,178,179,429],"Asset management","Inference engine","Inference",{"type":39,"children":4651,"toc":4652},[],{"title":8,"searchDepth":49,"depth":49,"links":4653},[],"content:publications:2018:atu-dss-knowledge-driven-data-integration-and-reasoning-for-sustainable-subsurfa.md","publications\u002F2018\u002Fatu-dss-knowledge-driven-data-integration-and-reasoning-for-sustainable-subsurfa.md","publications\u002F2018\u002Fatu-dss-knowledge-driven-data-integration-and-reasoning-for-sustainable-subsurfa",{"_path":4658,"_dir":4442,"_draft":7,"_partial":7,"_locale":8,"title":4659,"description":4660,"_hidden":7,"authors":4661,"authors_orcid":4666,"year":4449,"doi":4671,"openalex_id":4672,"venue":21,"abstract_screenshot":21,"keywords":4673,"body":4679,"_type":51,"_id":4687,"_source":53,"_file":4688,"_stem":4689,"_extension":56,"locale":57},"\u002Fpublications\u002F2018\u002Fautomated-prediction-of-shopping-behaviours-using-taxi-trajectory-data-and-socia","Automated prediction of shopping behaviours using taxi trajectory data and social media reviews","The Huff model is a well used mathematical abstraction for predicting shopping centre patronage. It considers two factors: shopping centre attractiveness, and customers' travel costs. Here, taxi trajectory data (more than three million journeys) and social media data (more than eight thousand customer reviews) is used to calibrate the Huff model for five primary shopping centres in the rapidly expanding metropolitan city of Shenzhen, China. The Huff model is calibrated in two ways: globally, to find the single pair of best-fit parameters for attractiveness and travel cost; and locally, using Geographical Weighted Regression to find the best-fit parameters at each spatial location. Results demonstrate that customer reviews on social media provide relatively high prediction accuracy for weekend shopping behaviours when the Huff model is calibrated globally. In contrast, customer footfall, calculated directly from number of taxi journeys, provides higher prediction accuracy when the Huff model is calibrated locally. This suggests that, at weekends, sensitivity to footfall has greater spatial variance (i.e., customers living in some areas have greater preference for shopping at popular centres) than sensitivity to customer reviews (i.e., regardless of where customers live, positive reviews on social media are equally likely to affect behaviour). We present this geographical homogeneity in review sensitivity and heterogeneity in footfall sensitivity as a novel discovery with potential applications in urban, retail, and transportation planning.",[4662,4306,12,4663,4664,4665],"Gong, Shuhui","Yue, Yang","Li, Qingquan","Qiu, Guoping",[4667,4308,15,4668,4669,4670],"0000-0003-4073-8002","0000-0001-6934-2357","0000-0002-2438-6046","0000-0002-5877-5648","https:\u002F\u002Fdoi.org\u002F10.1109\u002Ficbda.2018.8367661","W2774073347",[3143,4034,4674,23,4675,287,4676,4677,3659,454,289,4678,178,24,34,179],"Metropolitan area","Variance (accounting)","Sensitivity (control systems)","Location model","Advertising",{"type":39,"children":4680,"toc":4685},[4681],{"type":42,"tag":43,"props":4682,"children":4683},{},[4684],{"type":47,"value":4660},{"title":8,"searchDepth":49,"depth":49,"links":4686},[],"content:publications:2018:automated-prediction-of-shopping-behaviours-using-taxi-trajectory-data-and-socia.md","publications\u002F2018\u002Fautomated-prediction-of-shopping-behaviours-using-taxi-trajectory-data-and-socia.md","publications\u002F2018\u002Fautomated-prediction-of-shopping-behaviours-using-taxi-trajectory-data-and-socia",{"_path":4691,"_dir":4442,"_draft":7,"_partial":7,"_locale":8,"title":4692,"description":4693,"_hidden":7,"authors":4694,"authors_orcid":4696,"year":4449,"doi":4697,"openalex_id":4698,"venue":21,"abstract_screenshot":4699,"keywords":4700,"body":4703,"_type":51,"_id":4711,"_source":53,"_file":4712,"_stem":4713,"_extension":56,"locale":57},"\u002Fpublications\u002F2018\u002Fautomated-reasoning-for-city-infrastructure-maintenance-decision-support","Automated Reasoning for City Infrastructure Maintenance Decision Support","We present an interactive decision support system for assisting city infrastructure inter-asset management. It combines real-time site specific data retrieval, a knowledge base co-created with domain experts and an inference engine capable of predicting potential consequences and risks resulting from the available data and knowledge. The system can give explanations of each consequence, cope with incomplete and uncertain data by making assumptions about what might be the worst case scenario, and making suggestions for further investigation. This demo presents multiple real-world scenarios, and demonstrates how modifying assumptions (parameter values) can lead to different consequences.",[4625,4629,4630,4628,4626,4627,4695,4634],"Ammari, Kareem Al",[4636,4640,4641,4639,4637,4638,21,4643],"https:\u002F\u002Fdoi.org\u002F10.24963\u002Fijcai.2018\u002F868","W2814785485","automated-reasoning-for-city-infrastructure-maintenance-decision-support.png",[23,4649,175,4648,1167,244,4701,4647,691,4702,170,629,181,37,180],"Knowledge base","Domain knowledge",{"type":39,"children":4704,"toc":4709},[4705],{"type":42,"tag":43,"props":4706,"children":4707},{},[4708],{"type":47,"value":4693},{"title":8,"searchDepth":49,"depth":49,"links":4710},[],"content:publications:2018:automated-reasoning-for-city-infrastructure-maintenance-decision-support.md","publications\u002F2018\u002Fautomated-reasoning-for-city-infrastructure-maintenance-decision-support.md","publications\u002F2018\u002Fautomated-reasoning-for-city-infrastructure-maintenance-decision-support",{"_path":4715,"_dir":4442,"_draft":7,"_partial":7,"_locale":8,"title":4716,"description":4717,"_hidden":7,"authors":4718,"authors_orcid":4721,"year":4449,"doi":4724,"openalex_id":4725,"venue":553,"abstract_screenshot":21,"keywords":4726,"body":4728,"_type":51,"_id":4736,"_source":53,"_file":4737,"_stem":4738,"_extension":56,"locale":57},"\u002Fpublications\u002F2018\u002Fchinese-capital-markets-the-importance-of-history-for-modern-development","Chinese capital markets: the importance of history for modern development","The historical determinants of modern economic development have been widely studied since the seminal work of Engerman and Sokoloff (1997, 2002) and Acemoglu et al. (2001, 2002). The literature is largely based on the former European colonies, especially in Africa. Notwithstanding China’s long and rich history, its long-term effect on modern day development, particularly financial development, remains under-researched. The shocks experienced by China provide important settings for future research in that many of them were sufficiently severe and traumatic for their effects to be detectable today and for them to have an effect on the development of the country even now.",[4719,4720,268,548],"Guariglia, Alessandra","Hou, Wenxuan",[4722,4723,272,550],"0000-0001-5417-2615","0000-0002-6348-7165","https:\u002F\u002Fdoi.org\u002F10.1080\u002F1351847x.2018.1496571","W2888988505",[4727,36,178,429],"Capital market",{"type":39,"children":4729,"toc":4734},[4730],{"type":42,"tag":43,"props":4731,"children":4732},{},[4733],{"type":47,"value":4717},{"title":8,"searchDepth":49,"depth":49,"links":4735},[],"content:publications:2018:chinese-capital-markets-the-importance-of-history-for-modern-development.md","publications\u002F2018\u002Fchinese-capital-markets-the-importance-of-history-for-modern-development.md","publications\u002F2018\u002Fchinese-capital-markets-the-importance-of-history-for-modern-development",{"_path":4740,"_dir":4442,"_draft":7,"_partial":7,"_locale":8,"title":4741,"description":4742,"_hidden":7,"China\" authors":4743,"authors_orcid":4744,"year":4449,"doi":4745,"openalex_id":4746,"venue":4747,"abstract_screenshot":21,"keywords":4748,"body":4753,"_type":51,"_id":4761,"_source":53,"_file":4762,"_stem":4763,"_extension":56,"locale":57},"\u002Fpublications\u002F2018\u002Fcontrolled-currency-regime-and-pricing-of-exchange-rate-risk-evidence-from-china","Controlled Currency Regime and Pricing of Exchange Rate Risk: Evidence Fro","Extant research finds that exchange rate pegs do little to reduce firms’ exposure to exchange rate risk in emerging markets. We study whether exchange rate risk exposures under a pegged\u002Fcontrolled floating currency regime can be priced in asset returns using unique data on exchange rate regime changes in China. As the only currency in the basket of International Monetary Fund’s (IMF) Special Drawing Rights that is not fully market-driven for its exchange rate formation, the Chinese RMB (renminbi) offers an ideal case to study the pricing of exchange rate risk in pegged and controlled floating regimes. We find a negative stock market reaction to the announcement of changes from a pegged exchange rate to a controlled floating regime, suggesting a negative stock valuation effect of expectation of increased exchange rate exposure to currency appreciation. Under the managed floating exchange rate regime, the volatilities of accounting performance measures are significantly greater for the companies with stronger exposure to foreign-exchange rate risk. More importantly, foreign-exchange rate risk is priced in equity returns under the controlled floating regime but not under the strictly pegged regime. Furthermore, the pricing is stronger for firms with higher sensitivity to economic channels transmitting the exchange rate risk exposure to risk premiums. Overall, our results suggest that currency hedging for a multinational corporation with foreign-exchange exposure is warranted under a controlled floating currency regime.",[268,573,574],[272,576,577],"https:\u002F\u002Fdoi.org\u002F10.1177\u002F0148558x18781144","W2811125835","Journal of Accounting Auditing & Finance",[799,280,285,4749,3877,798,36,4750,4751,4752,178,283],"Renminbi","Exchange-rate regime","Foreign exchange market","Floating exchange rate",{"type":39,"children":4754,"toc":4759},[4755],{"type":42,"tag":43,"props":4756,"children":4757},{},[4758],{"type":47,"value":4742},{"title":8,"searchDepth":49,"depth":49,"links":4760},[],"content:publications:2018:controlled-currency-regime-and-pricing-of-exchange-rate-risk-evidence-from-china.md","publications\u002F2018\u002Fcontrolled-currency-regime-and-pricing-of-exchange-rate-risk-evidence-from-china.md","publications\u002F2018\u002Fcontrolled-currency-regime-and-pricing-of-exchange-rate-risk-evidence-from-china",{"_path":4765,"_dir":4442,"_draft":7,"_partial":7,"_locale":8,"title":4766,"description":4767,"_hidden":7,"authors":4768,"authors_orcid":4769,"year":4449,"doi":4770,"openalex_id":4771,"venue":4772,"abstract_screenshot":21,"keywords":4773,"body":4775,"_type":51,"_id":4783,"_source":53,"_file":4784,"_stem":4785,"_extension":56,"locale":57},"\u002Fpublications\u002F2018\u002Fdecision-making-in-cold-chain-logistics-using-data-analytics-a-literature-review","Decision-making in cold chain logistics using data analytics: a literature review","Purpose The purpose of the paper is to identify the multiple types of data that can be collected and analyzed by practitioners across the cold chain, the ICT infrastructure required to enable data capture and how to utilize the data for decision making in cold chain logistics. Design\u002Fmethodology\u002Fapproach Content analysis based literature review of 38 selected research articles, published between 2000 and 2016, was used to create an overview of data capture, technologies used for collection and sharing of data, and decision making that can be supported by the data, across the cold chain and for different types of perishable food products. Findings There is a need to understand how continuous monitoring of conditions such as temperature, humidity, and vibration can be translated to support real-time assessment of quality, determination of actual remaining shelf life of products and use of those for decision making in cold chains. Firms across the cold chain need to adopt appropriate technologies suited to the specific contexts to capture data across the cold chain. Analysis of such data over longer periods can also unearth patterns of product deterioration under different transportation conditions, which can lead to redesigning the transportation network to minimize quality loss or to take precautions to avoid the adverse transportation conditions. Research limitations\u002Fimplications The findings need to be validated through further empirical research and modeling. There are opportunities to identify all relevant parameters to capture product condition as well as transaction data across the cold chain processes for fish, meat and dairy products. Such data can then be used for supply chain (SC) planning and pricing products in the retail stores based on product conditions and traceability information. Addressing some of the above research gaps will call for multi-disciplinary research involving food science and engineering, information technologies, computer science and logistics and SC management scholars. Practical implications The findings of this research can be beneficial for multiple players involved in the cold chain like food processing companies, logistics service providers, ports and wholesalers and retailers to understand how data can be effectively used for better decision making in cold chain and to invest in the specific technologies, which will suit the purpose. To ensure adoption of data analytics across the cold chain, it is also important to identify the player in the cold chain, which will drive and coordinate the effort. Originality\u002Fvalue This paper is one of the earliest to recognize the need for a comprehensive assessment for adoption and application of data analytics in cold chain management and provides directions for future research.",[3585,3586,3279,3587,12],[3589,3590,3281,3591,15],"https:\u002F\u002Fdoi.org\u002F10.1108\u002Fijlm-03-2017-0059","W2786470824","The International Journal of Logistics Management",[690,178,4774,3596,3595,33,23,1335,691,179],"Process management",{"type":39,"children":4776,"toc":4781},[4777],{"type":42,"tag":43,"props":4778,"children":4779},{},[4780],{"type":47,"value":4767},{"title":8,"searchDepth":49,"depth":49,"links":4782},[],"content:publications:2018:decision-making-in-cold-chain-logistics-using-data-analytics-a-literature-review.md","publications\u002F2018\u002Fdecision-making-in-cold-chain-logistics-using-data-analytics-a-literature-review.md","publications\u002F2018\u002Fdecision-making-in-cold-chain-logistics-using-data-analytics-a-literature-review",{"_path":4787,"_dir":4442,"_draft":7,"_partial":7,"_locale":8,"title":4788,"description":4789,"_hidden":7,"authors":4790,"authors_orcid":4797,"year":4449,"doi":4802,"openalex_id":4803,"venue":21,"abstract_screenshot":21,"keywords":4804,"body":4805,"_type":51,"_id":4813,"_source":53,"_file":4814,"_stem":4815,"_extension":56,"locale":57},"\u002Fpublications\u002F2018\u002Fdeveloping-a-language-learning-application-oer","Developing a Language Learning Application OER","University of Nottingham Ningbo China (UNNC) was the first Sino-foreign higher education institution (SmEI) to be established in Mainland China, and has been host to a number of student-staff project partnerships, including in the successful development of Open Education Resources (OERs). This paper reports on the completion of the first phase of an anticipated 2-year student-staff project to develop a language learning application as an OER. It explains the history and context of UNNC and the project, and discusses some of the software engineering processes completed to date. The work completed so far is described and reflected upon, and the future work and impact discussed.",[595,4791,4792,4793,4794,4795,4796],"Millan, Albert","Cheng, Wenpeng","Yang, Sen","Yu, Shiying","Zhao, Zhengchun","Zhu, Tingting",[599,21,4798,4799,4800,21,4801],"0000-0001-5849-7249","0000-0003-4114-7159","0000-0003-3507-3464","0000-0002-7348-5921","https:\u002F\u002Fdoi.org\u002F10.1109\u002Ftale.2018.8615424","W2909446393",[23,4479,37],{"type":39,"children":4806,"toc":4811},[4807],{"type":42,"tag":43,"props":4808,"children":4809},{},[4810],{"type":47,"value":4789},{"title":8,"searchDepth":49,"depth":49,"links":4812},[],"content:publications:2018:developing-a-language-learning-application-oer.md","publications\u002F2018\u002Fdeveloping-a-language-learning-application-oer.md","publications\u002F2018\u002Fdeveloping-a-language-learning-application-oer",{"_path":4817,"_dir":4442,"_draft":7,"_partial":7,"_locale":8,"title":4818,"description":4819,"_hidden":7,"Education Institution":4820,"authors":4821,"authors_orcid":4826,"year":4449,"doi":4828,"openalex_id":4829,"venue":21,"abstract_screenshot":21,"keywords":4830,"body":4832,"_type":51,"_id":4840,"_source":53,"_file":4841,"_stem":4842,"_extension":56,"locale":57},"\u002Fpublications\u002F2018\u002Fdeveloping-virtual-reality-open-educational-resources-in-a-sino-foreign-higher-e","Developing Virtual Reality Open Educational Resources in a Sino-Foreign Highe","Open educational resources (OERs) are teaching, learning, and research resources that have been made available such that they can be used, shared, and modified freely. Motivated by recent OER development successes, an interdisciplinary team at a Sino-foreign Higher Education Institution in China, University of Nottingham Ningbo China (UNNC), have been engaged in the creation of a new virtual reality (VR) OER, initially aimed at students and educators in the institution's Civil Engineering department. The VR OER centres around the creation of a virtual field trip (VFT), capturing knowledge and experience not often available to students. This paper examines the background and motivations to the project, outlining the strategies and cooperation so far employed, and explores the progress and challenges encountered. Anticipated further challenges, and potential mitigation, as the project continues are also discussed.","Challenges and Strategies\"",[595,4822,4823,4824,4825],"Walker, James","Austin, Clayton","Kwong, Chiew Foong","Wei, Sherry",[599,4827,21,21,21],"0000-0002-0152-9366","https:\u002F\u002Fdoi.org\u002F10.1109\u002Ftale.2018.8615167","W2910866194",[3901,4390,3095,282,4831,1335,629,23,1334,1358,179,869,868],"Higher education",{"type":39,"children":4833,"toc":4838},[4834],{"type":42,"tag":43,"props":4835,"children":4836},{},[4837],{"type":47,"value":4819},{"title":8,"searchDepth":49,"depth":49,"links":4839},[],"content:publications:2018:developing-virtual-reality-open-educational-resources-in-a-sino-foreign-higher-e.md","publications\u002F2018\u002Fdeveloping-virtual-reality-open-educational-resources-in-a-sino-foreign-higher-e.md","publications\u002F2018\u002Fdeveloping-virtual-reality-open-educational-resources-in-a-sino-foreign-higher-e",{"_path":4844,"_dir":4442,"_draft":7,"_partial":7,"_locale":8,"title":4845,"description":8,"_hidden":7,"authors":4846,"authors_orcid":4849,"year":4449,"doi":4851,"openalex_id":4852,"venue":4853,"abstract_screenshot":21,"keywords":4854,"body":4860,"_type":51,"_id":4864,"_source":53,"_file":4865,"_stem":4866,"_extension":56,"locale":57},"\u002Fpublications\u002F2018\u002Fdo-antidumping-measures-affect-chinese-export-related-firms","Do antidumping measures affect Chinese export-related firms?",[268,574,4847,4848],"Sun, Qian","Xing, Xinyi",[272,577,4850,21],"0000-0003-4294-9276","https:\u002F\u002Fdoi.org\u002F10.1007\u002Fs11156-018-0729-2","W2801318285","Review of Quantitative Finance and Accounting",[4855,1269,285,4856,4857,555,178,3255,4858,36,1301,4859,429,1443],"Subsidy","Corporate finance","Affect (linguistics)","Stock price","Empirical evidence",{"type":39,"children":4861,"toc":4862},[],{"title":8,"searchDepth":49,"depth":49,"links":4863},[],"content:publications:2018:do-antidumping-measures-affect-chinese-export-related-firms.md","publications\u002F2018\u002Fdo-antidumping-measures-affect-chinese-export-related-firms.md","publications\u002F2018\u002Fdo-antidumping-measures-affect-chinese-export-related-firms",{"_path":4868,"_dir":4442,"_draft":7,"_partial":7,"_locale":8,"title":4869,"description":4870,"_hidden":7,"authors":4871,"authors_orcid":4872,"year":4449,"doi":4873,"openalex_id":4874,"venue":21,"abstract_screenshot":21,"keywords":4875,"body":4877,"_type":51,"_id":4885,"_source":53,"_file":4886,"_stem":4887,"_extension":56,"locale":57},"\u002Fpublications\u002F2018\u002Fenhancing-supervised-classifications-with-metamorphic-relations","Enhancing supervised classifications with metamorphic relations","We report on a novel use of metamorphic relations (MRs) in machine learning: instead of conducting metamorphic testing, we use MRs for the augmentation of the machine learning algorithms themselves. In particular, we report on how MRs can enable enhancements to an image classification problem of images containing hidden visual markers (\"Artcodes\").",[4377,595,4378,4379,1156,596],[4381,599,4382,4383,1158,600],"https:\u002F\u002Fdoi.org\u002F10.1145\u002F3193977.3193978","W2810071081",[3788,23,37,215,4876,3789],"Pattern recognition (psychology)",{"type":39,"children":4878,"toc":4883},[4879],{"type":42,"tag":43,"props":4880,"children":4881},{},[4882],{"type":47,"value":4870},{"title":8,"searchDepth":49,"depth":49,"links":4884},[],"content:publications:2018:enhancing-supervised-classifications-with-metamorphic-relations.md","publications\u002F2018\u002Fenhancing-supervised-classifications-with-metamorphic-relations.md","publications\u002F2018\u002Fenhancing-supervised-classifications-with-metamorphic-relations",{"_path":4889,"_dir":4442,"_draft":7,"_partial":7,"_locale":8,"title":4890,"description":4891,"_hidden":7,"(TVET) authors":4892,"authors_orcid":4893,"year":4449,"doi":4894,"openalex_id":4895,"venue":21,"abstract_screenshot":21,"keywords":4896,"body":4897,"_type":51,"_id":4905,"_source":53,"_file":4906,"_stem":4907,"_extension":56,"locale":57},"\u002Fpublications\u002F2018\u002Fharnessing-oers-in-hong-kong-technical-and-vocational-education-and-training-tve","Harnessing OERs in Hong Kong Technical and Vocational Education and Training","Open Educational Resources (OERs) represent an opportunity to enhance quality access to education. However, OER adoption has not yet made as substantial an impact as might have been expected. This case study identifies strategies for effective OER adoption that can support quality access in Technical and Vocational Education and Training (TVET). We conducted a critical landscape review of existing activities, identifying “what works” and “what doesn't work”, noting both enabling and hindering factors. A questionnaire, interviews, and focus groups with students, teachers and workplace mentors in the leading TVET institution in Hong Kong were then used to examine perceptions and reservations regarding OER usage. The findings suggest that OER adaptations with blended learning might be an effective approach to enable quality access in TVET. This may help build learning communities that enable stakeholders to co-develop and to use the OERs and also to share good practices.",[850,3894,595],[853,3896,599],"https:\u002F\u002Fdoi.org\u002F10.1109\u002Ftale.2018.8615436","W2910308975",[3900,3902,23,1335,178,1379,179,289,1380],{"type":39,"children":4898,"toc":4903},[4899],{"type":42,"tag":43,"props":4900,"children":4901},{},[4902],{"type":47,"value":4891},{"title":8,"searchDepth":49,"depth":49,"links":4904},[],"content:publications:2018:harnessing-oers-in-hong-kong-technical-and-vocational-education-and-training-tve.md","publications\u002F2018\u002Fharnessing-oers-in-hong-kong-technical-and-vocational-education-and-training-tve.md","publications\u002F2018\u002Fharnessing-oers-in-hong-kong-technical-and-vocational-education-and-training-tve",{"_path":4909,"_dir":4442,"_draft":7,"_partial":7,"_locale":8,"title":4910,"description":4911,"_hidden":7,"authors":4912,"authors_orcid":4916,"year":4449,"doi":4918,"openalex_id":4919,"venue":21,"abstract_screenshot":21,"keywords":4920,"body":4922,"_type":51,"_id":4930,"_source":53,"_file":4931,"_stem":4932,"_extension":56,"locale":57},"\u002Fpublications\u002F2018\u002Fmessage-from-the-fast-abstract-co-chairs","Message from the Fast Abstract Co-chairs","Presents the introductory welcome message from the conference proceedings. May include the conference officers' congratulations to all involved with the conference event and publication of the proceedings record.",[4913,4914,4915,595],"Shahriar, Hossain","Takakura, Hiroki","Takemoto, Michiharu",[4917,21,21,599],"0000-0003-1021-7986","https:\u002F\u002Fdoi.org\u002F10.1109\u002Fcompsac.2018.00116","W4242732525",[23,4921,869,3745],"Event (particle physics)",{"type":39,"children":4923,"toc":4928},[4924],{"type":42,"tag":43,"props":4925,"children":4926},{},[4927],{"type":47,"value":4911},{"title":8,"searchDepth":49,"depth":49,"links":4929},[],"content:publications:2018:message-from-the-fast-abstract-co-chairs.md","publications\u002F2018\u002Fmessage-from-the-fast-abstract-co-chairs.md","publications\u002F2018\u002Fmessage-from-the-fast-abstract-co-chairs",{"_path":4934,"_dir":4442,"_draft":7,"_partial":7,"_locale":8,"title":4935,"description":4936,"_hidden":7,"authors":4937,"authors_orcid":4939,"year":4449,"doi":4941,"openalex_id":4942,"venue":603,"abstract_screenshot":21,"keywords":4943,"body":4944,"_type":51,"_id":4952,"_source":53,"_file":4953,"_stem":4954,"_extension":56,"locale":57},"\u002Fpublications\u002F2018\u002Fmetamorphic-relations-for-enhancing-system-understanding-and-use","Metamorphic Relations for Enhancing System Understanding and Use","Modern information technology paradigms, such as online services and off-the-shelf products, often involve a wide variety of users with different or even conflicting objectives. Every software output may satisfy some users, but may also fail to satisfy others. Furthermore, users often do not know the internal working mechanisms of the systems. This situation is quite different from bespoke software, where developers and users typically know each other. This paper proposes an approach to help users to better understand the software that they use, and thereby more easily achieve their objectives-even when they do not fully understand how the system is implemented. Our approach borrows the concept of metamorphic relations from the field of metamorphic testing (MT), using it in an innovative way that extends beyond MT. We also propose a “symmetry” metamorphic relation pattern and a “change direction” metamorphic relation input pattern that can be used to derive multiple concrete metamorphic relations. Empirical studies reveal previously unknown failures in some of the most popular applications in the world, and show how our approach can help users to better understand and better use the systems. The empirical results provide strong evidence of the simplicity, applicability, and effectiveness of our methodology.",[1156,4938,596,595],"Sun, Liqun",[1158,4940,600,599],"0000-0001-7445-5532","https:\u002F\u002Fdoi.org\u002F10.1109\u002Ftse.2018.2876433","W2896505116",[23,3788,607,691,3790,3789],{"type":39,"children":4945,"toc":4950},[4946],{"type":42,"tag":43,"props":4947,"children":4948},{},[4949],{"type":47,"value":4936},{"title":8,"searchDepth":49,"depth":49,"links":4951},[],"content:publications:2018:metamorphic-relations-for-enhancing-system-understanding-and-use.md","publications\u002F2018\u002Fmetamorphic-relations-for-enhancing-system-understanding-and-use.md","publications\u002F2018\u002Fmetamorphic-relations-for-enhancing-system-understanding-and-use",{"_path":4956,"_dir":4442,"_draft":7,"_partial":7,"_locale":8,"title":4957,"description":4958,"_hidden":7,"authors":4959,"authors_orcid":4960,"year":4449,"doi":4961,"openalex_id":4962,"venue":4963,"abstract_screenshot":21,"keywords":4964,"body":4966,"_type":51,"_id":4974,"_source":53,"_file":4975,"_stem":4976,"_extension":56,"locale":57},"\u002Fpublications\u002F2018\u002Fmetamorphic-testing","Metamorphic Testing","Metamorphic testing is an approach to both test case generation and test result verification. A central element is a set of metamorphic relations, which are necessary properties of the target function or algorithm in relation to multiple inputs and their expected outputs. Since its first publication, we have witnessed a rapidly increasing body of work examining metamorphic testing from various perspectives, including metamorphic relation identification, test case generation, integration with other software engineering techniques, and the validation and evaluation of software systems. In this article, we review the current research of metamorphic testing and discuss the challenges yet to be addressed. We also present visions for further improvement of metamorphic testing and highlight opportunities for new research.",[596,594,593,4231,595,4232,1156],[600,21,598,4234,599,4235,1158],"https:\u002F\u002Fdoi.org\u002F10.1145\u002F3143561","W2782311202","ACM Computing Surveys",[23,3788,4965,139,181,110,3789],"Relation (database)",{"type":39,"children":4967,"toc":4972},[4968],{"type":42,"tag":43,"props":4969,"children":4970},{},[4971],{"type":47,"value":4958},{"title":8,"searchDepth":49,"depth":49,"links":4973},[],"content:publications:2018:metamorphic-testing.md","publications\u002F2018\u002Fmetamorphic-testing.md","publications\u002F2018\u002Fmetamorphic-testing",{"_path":4978,"_dir":4442,"_draft":7,"_partial":7,"_locale":8,"title":4979,"description":4980,"_hidden":7,"authors":4981,"authors_orcid":4983,"year":4449,"doi":4985,"openalex_id":4986,"venue":21,"abstract_screenshot":21,"keywords":4987,"body":4992,"_type":51,"_id":5000,"_source":53,"_file":5001,"_stem":5002,"_extension":56,"locale":57},"\u002Fpublications\u002F2018\u002Fmetamorphic-testing-for-adobe-analytics-data-collection-javascript-library","Metamorphic testing for adobe analytics data collection javascript library","In recent years, metamorphic testing has been successfully and systematically adopted within Adobe Systems to improve the cost effectiveness of its software process. In this industry experience report, we present a case where metamorphic testing has been applied to the Data Collection JavaScript Library of Adobe Analytics. This type of software is difficult to test using traditional approaches. The application of metamorphic testing alleviated the oracle problem, and detected real-life bugs in the system under test as well as compatibility problems between the system and its environment, namely, the Internet Explorer browser. Our results further justify the adoption of metamorphic testing as a simple yet effective approach in industrial settings.",[4982,595,1156,596],"Wang, Zhenyu",[4984,599,1158,600],"0000-0002-9946-1418","https:\u002F\u002Fdoi.org\u002F10.1145\u002F3193977.3193979","W2810247445",[23,4988,605,606,139,4989,690,4990,4991,1108,3788,869,607,1113,867],"JavaScript","Adobe","Python (programming language)","Database",{"type":39,"children":4993,"toc":4998},[4994],{"type":42,"tag":43,"props":4995,"children":4996},{},[4997],{"type":47,"value":4980},{"title":8,"searchDepth":49,"depth":49,"links":4999},[],"content:publications:2018:metamorphic-testing-for-adobe-analytics-data-collection-javascript-library.md","publications\u002F2018\u002Fmetamorphic-testing-for-adobe-analytics-data-collection-javascript-library.md","publications\u002F2018\u002Fmetamorphic-testing-for-adobe-analytics-data-collection-javascript-library",{"_path":5004,"_dir":4442,"_draft":7,"_partial":7,"_locale":8,"title":5005,"description":5006,"_hidden":7,"authors":5007,"authors_orcid":5009,"year":4449,"doi":5011,"openalex_id":5012,"venue":5013,"abstract_screenshot":21,"keywords":5014,"body":5016,"_type":51,"_id":5024,"_source":53,"_file":5025,"_stem":5026,"_extension":56,"locale":57},"\u002Fpublications\u002F2018\u002Fmetamorphic-testing-testing-the-untestable","Metamorphic Testing: Testing the Untestable","What if we could know that a program is buggy, even if we could not tell whether or not its observed output is correct? Metamorphic testing provides this ability. This article explains the basics of the technique.",[5008,595,1156,596],"Segura, Sergio",[5010,599,1158,600],"0000-0001-8816-6213","https:\u002F\u002Fdoi.org\u002F10.1109\u002Fms.2018.2875968","W2903744551","IEEE Software",[606,23,3788,607,110,139,3789,5015],"Petrology",{"type":39,"children":5017,"toc":5022},[5018],{"type":42,"tag":43,"props":5019,"children":5020},{},[5021],{"type":47,"value":5006},{"title":8,"searchDepth":49,"depth":49,"links":5023},[],"content:publications:2018:metamorphic-testing-testing-the-untestable.md","publications\u002F2018\u002Fmetamorphic-testing-testing-the-untestable.md","publications\u002F2018\u002Fmetamorphic-testing-testing-the-untestable",{"_path":5028,"_dir":4442,"_draft":7,"_partial":7,"_locale":8,"title":5029,"description":8,"_hidden":7,"authors":5030,"authors_orcid":5032,"year":4449,"doi":5034,"openalex_id":5035,"venue":74,"abstract_screenshot":21,"keywords":5036,"body":5037,"_type":51,"_id":5041,"_source":53,"_file":5042,"_stem":5043,"_extension":56,"locale":57},"\u002Fpublications\u002F2018\u002Fmodelling-recovery-rates-for-non-performing-loans","Modelling Recovery Rates for Non-performing Loans",[4189,5031],"Ye, Hui",[4191,5033],"0000-0003-3490-2427","https:\u002F\u002Fdoi.org\u002F10.2139\u002Fssrn.3256252","W3188268279",[36,287,178],{"type":39,"children":5038,"toc":5039},[],{"title":8,"searchDepth":49,"depth":49,"links":5040},[],"content:publications:2018:modelling-recovery-rates-for-non-performing-loans.md","publications\u002F2018\u002Fmodelling-recovery-rates-for-non-performing-loans.md","publications\u002F2018\u002Fmodelling-recovery-rates-for-non-performing-loans",{"_path":5045,"_dir":4442,"_draft":7,"_partial":7,"_locale":8,"title":5046,"description":5047,"_hidden":7,"Prioritization authors":5048,"authors_orcid":5050,"year":4449,"doi":5052,"openalex_id":5053,"venue":21,"abstract_screenshot":21,"keywords":5054,"body":5055,"_type":51,"_id":5063,"_source":53,"_file":5064,"_stem":5065,"_extension":56,"locale":57},"\u002Fpublications\u002F2018\u002Fon-the-selection-of-strength-for-fixed-strength-interaction-coverage-based-prior","On the Selection of Strength for Fixed-Strength Interaction Coverage Based","Abstract test cases are derived by modeling the system under test, and have been widely applied in practice, such as for software product line testing and combinatorial testing. Abstract test case prioritization (ATCP) is used to prioritize abstract test cases and aims at achieving higher rates of fault detection. Many ATCP algorithms have been proposed, using different prioritization criteria and information. One ATCP approach makes use of fixed-strength level-combinations information covered by abstract test cases, and is called fixed-strength interaction coverage based prioritization (FICBP). Before using FICBP, the prioritization strength λ needs to be decided. Previous studies have generally focused on λ values ranging between 1 and 6. However, no study has investigated the appropriateness of such a range, nor how to assign the prioritization strength for FICBP. To answer these questions, this paper reports on an empirical study involving four real-life programs (each of which with six versions). The experimental results indicate that λ should be set approximately equal to a value corresponding to half of the number of parameters, when testing resources are sufficient. Our results also show that when testing resources are limited or insufficient, either small or large λ values are suggested for FICBP.",[645,3921,596,595,648,3922,5049],"Sun, Weifeng",[650,21,600,599,651,21,5051],"0000-0001-6013-1369","https:\u002F\u002Fdoi.org\u002F10.1109\u002Fcompsac.2018.00049","W2809415834",[656,134,23,37,179],{"type":39,"children":5056,"toc":5061},[5057],{"type":42,"tag":43,"props":5058,"children":5059},{},[5060],{"type":47,"value":5047},{"title":8,"searchDepth":49,"depth":49,"links":5062},[],"content:publications:2018:on-the-selection-of-strength-for-fixed-strength-interaction-coverage-based-prior.md","publications\u002F2018\u002Fon-the-selection-of-strength-for-fixed-strength-interaction-coverage-based-prior.md","publications\u002F2018\u002Fon-the-selection-of-strength-for-fixed-strength-interaction-coverage-based-prior",{"_path":5067,"_dir":4442,"_draft":7,"_partial":7,"_locale":8,"title":5068,"description":5069,"_hidden":7,"authors":5070,"authors_orcid":5071,"year":4449,"doi":5072,"openalex_id":5073,"venue":5074,"abstract_screenshot":21,"keywords":5075,"body":5076,"_type":51,"_id":5084,"_source":53,"_file":5085,"_stem":5086,"_extension":56,"locale":57},"\u002Fpublications\u002F2018\u002Fprioritising-abstract-test-cases-an-empirical-study","Prioritising abstract test cases: an empirical study","Test‐case prioritisation (TCP) attempts to schedule the order of test‐case execution such that faults can be detected as quickly as possible. TCP has been widely applied in many testing scenarios such as regression testing and fault localisation. Abstract test cases (ATCs) are derived from models of the system under test and have been applied to many testing environments such as model‐based testing and combinatorial interaction testing. Although various empirical and analytical comparisons for some ATC prioritisation (ATCP) techniques have been conducted, to the best of the authors’ knowledge, no comparative study focusing on the most current techniques has yet been reported. In this study, they investigated 18 ATCP techniques, categorised into four classes. They conducted a comprehensive empirical study to compare 16 of the 18 ATCP techniques in terms of their testing effectiveness and efficiency. They found that different ATCP techniques could be cost‐effective in different testing scenarios, allowing us to present recommendations and guidelines for which techniques to use under what conditions.",[645,3921,596,595,3922,648],[650,21,600,599,21,651],"https:\u002F\u002Fdoi.org\u002F10.1049\u002Fiet-sen.2018.5199","W2895969100","IET Software",[659,23,661,179,3789],{"type":39,"children":5077,"toc":5082},[5078],{"type":42,"tag":43,"props":5079,"children":5080},{},[5081],{"type":47,"value":5069},{"title":8,"searchDepth":49,"depth":49,"links":5083},[],"content:publications:2018:prioritising-abstract-test-cases-an-empirical-study.md","publications\u002F2018\u002Fprioritising-abstract-test-cases-an-empirical-study.md","publications\u002F2018\u002Fprioritising-abstract-test-cases-an-empirical-study",{"_path":5088,"_dir":4442,"_draft":7,"_partial":7,"_locale":8,"title":5089,"description":5090,"_hidden":7,"authors":5091,"authors_orcid":5092,"year":4449,"doi":5093,"openalex_id":5094,"venue":21,"abstract_screenshot":5095,"keywords":5096,"body":5101,"_type":51,"_id":5109,"_source":53,"_file":5110,"_stem":5111,"_extension":56,"locale":57},"\u002Fpublications\u002F2018\u002Fspatio-temporal-prediction-of-shopping-behaviours-using-taxi-trajectory-data","Spatio-temporal prediction of shopping behaviours using taxi trajectory data","Taxi trajectory data (GPS data collected for 15,000 taxis at intervals of 30 seconds across three million journeys over eight days) is used to generate a spatio-temporal prediction of shopping behaviours in the emerging metropolitan city of Shenzhen, China. Two approaches are compared: time-series forecasting using ARIMA; and a gravity model approach, using the Huff model calibrated with Geographical Weighted Regression. Results demonstrate that ARIMA performs with significantly higher accuracy than the more traditional Huff model method. Further, it is demonstrate that while the accuracy of the Huff model is constrained by model assumptions, applying time-series methods to the underlying data directly (i.e., the ARIMA method) has no such constraints, and is limited only by the amount of data available. This suggests that, as richer data sets become available, spatio-temporal modelling of this kind will become more accurate.",[4306,4662,12,4663,4664,4665],[4308,4667,15,4668,4669,4670],"https:\u002F\u002Fdoi.org\u002F10.1109\u002Ficbda.2018.8367660","W2771791873","spatio-temporal-prediction-of-shopping-behaviours-using-taxi-trajectory-data.png",[5097,449,3659,23,5098,3392,181,5099,5100,4674,215,289,179,454],"Autoregressive integrated moving average","Time series","Series (stratigraphy)","Data modeling",{"type":39,"children":5102,"toc":5107},[5103],{"type":42,"tag":43,"props":5104,"children":5105},{},[5106],{"type":47,"value":5090},{"title":8,"searchDepth":49,"depth":49,"links":5108},[],"content:publications:2018:spatio-temporal-prediction-of-shopping-behaviours-using-taxi-trajectory-data.md","publications\u002F2018\u002Fspatio-temporal-prediction-of-shopping-behaviours-using-taxi-trajectory-data.md","publications\u002F2018\u002Fspatio-temporal-prediction-of-shopping-behaviours-using-taxi-trajectory-data",{"_path":5113,"_dir":4442,"_draft":7,"_partial":7,"_locale":8,"title":5114,"description":5115,"_hidden":7,"addressing cultural distance and cross-cohort handover\" authors":5116,"authors_orcid":5119,"year":4449,"doi":5122,"openalex_id":5123,"venue":5124,"abstract_screenshot":21,"keywords":5125,"body":5128,"_type":51,"_id":5136,"_source":53,"_file":5137,"_stem":5138,"_extension":56,"locale":57},"\u002Fpublications\u002F2018\u002Fstudents-as-co-producers-in-a-multidisciplinary-software-engineering-project-add","Students as co-producers in a multidisciplinary software engineering project","This article reports an undergraduate software engineering project in which, over a period of 2 years, four student teams from different cohorts developed a note-taking app for four academic clients at the students’ own university. We investigated how projects involving internal clients can give students the benefits of engaging in real software development while also giving them experience of a student-staff collaboration that has its own benefits for students, academics, and the university more broadly. As the university involved is a Sino-Foreign university located in China, where most students are Chinese and most teaching staff are not, this ‘student as co-producer’ approach interacts with another feature of the project: cultural distance. Based on analysis of notes, reports, interviews, and focus groups, we recommend that students should be provided with communicative strategies for dealing with academics as clients; universities should develop policies on ownership of student-staff collaborations; and projects should include a formalised handover process. This article can serve as guidance for educators considering a ‘students as co-producers’ approach for software development projects.",[5117,3081,3082,5118,595,4160],"Foster, David","Song, Wei",[5120,3087,3088,5121,599,4165],"0000-0003-2428-715X","0000-0002-4108-7638","https:\u002F\u002Fdoi.org\u002F10.1080\u002F13540602.2018.1486295","W2809559844","Teachers and Teaching",[4413,5126,5127,1335,1380,179,4774,23,865,178,288,3096],"Handover","Cross-cultural",{"type":39,"children":5129,"toc":5134},[5130],{"type":42,"tag":43,"props":5131,"children":5132},{},[5133],{"type":47,"value":5115},{"title":8,"searchDepth":49,"depth":49,"links":5135},[],"content:publications:2018:students-as-co-producers-in-a-multidisciplinary-software-engineering-project-add.md","publications\u002F2018\u002Fstudents-as-co-producers-in-a-multidisciplinary-software-engineering-project-add.md","publications\u002F2018\u002Fstudents-as-co-producers-in-a-multidisciplinary-software-engineering-project-add",{"_path":5140,"_dir":4442,"_draft":7,"_partial":7,"_locale":8,"title":5141,"description":8,"_hidden":7,"in emerging economies":5142,"Chinese case\" authors":5143,"authors_orcid":5144,"year":4449,"doi":5145,"openalex_id":5146,"venue":5147,"abstract_screenshot":21,"keywords":5148,"body":5154,"_type":51,"_id":5158,"_source":53,"_file":5159,"_stem":5160,"_extension":56,"locale":57},"\u002Fpublications\u002F2018\u002Fthe-evolving-relations-between-government-agencies-of-innovation-policymaking-in","The evolving relations between government agencies of innovation policymakin","A policy network approach and its application to the",[3538,65],[3540,70],"https:\u002F\u002Fdoi.org\u002F10.1016\u002Fj.respol.2018.01.003","W2782725467","Research Policy",[282,3255,5149,4031,5150,5151,3712,36,5152,178,1358,3713,5153,1380],"Agency (philosophy)","Emerging markets","Public policy","Economic interventionism","Politics",{"type":39,"children":5155,"toc":5156},[],{"title":8,"searchDepth":49,"depth":49,"links":5157},[],"content:publications:2018:the-evolving-relations-between-government-agencies-of-innovation-policymaking-in.md","publications\u002F2018\u002Fthe-evolving-relations-between-government-agencies-of-innovation-policymaking-in.md","publications\u002F2018\u002Fthe-evolving-relations-between-government-agencies-of-innovation-policymaking-in",{"_path":5162,"_dir":4442,"_draft":7,"_partial":7,"_locale":8,"title":5163,"description":5164,"_hidden":7,"control authors":5165,"authors_orcid":5167,"year":4449,"doi":5172,"openalex_id":5173,"venue":5174,"abstract_screenshot":21,"keywords":5175,"body":5183,"_type":51,"_id":5191,"_source":53,"_file":5192,"_stem":5193,"_extension":56,"locale":57},"\u002Fpublications\u002F2018\u002Fthe-power-of-synthetic-biology-for-bioproduction-remediation-and-pollution-contr","The power of synthetic biology for bioproduction, remediation and pollution","The UN's Sustainable Development Goals present a challenge for biotechnology to develop new environmentally‐friendly and sustainable products and production processes.\\n\\n",[4581,5166,4584,4577,4582,4579,4578,4583,65,4585,4580,4586,4587,4588,4589,4590],"Prather, Kristala L. J.",[4595,5168,4597,21,21,4593,4592,4596,70,4598,4594,5169,21,5170,5171,4601],"0000-0003-0437-3157","0000-0002-4348-0169","0000-0002-9241-8134","0000-0002-7444-1103","https:\u002F\u002Fdoi.org\u002F10.15252\u002Fembr.201745658","W2793677392","EMBO Reports",[5176,4608,5177,5178,5179,5180,5181,926,3523,4606,3526,179,5182],"Bioproduction","Pollution","Environmental remediation","Synthetic biology","Biochemical engineering","Biotechnology","Contamination",{"type":39,"children":5184,"toc":5189},[5185],{"type":42,"tag":43,"props":5186,"children":5187},{},[5188],{"type":47,"value":5164},{"title":8,"searchDepth":49,"depth":49,"links":5190},[],"content:publications:2018:the-power-of-synthetic-biology-for-bioproduction-remediation-and-pollution-contr.md","publications\u002F2018\u002Fthe-power-of-synthetic-biology-for-bioproduction-remediation-and-pollution-contr.md","publications\u002F2018\u002Fthe-power-of-synthetic-biology-for-bioproduction-remediation-and-pollution-contr",{"_path":5195,"_dir":4442,"_draft":7,"_partial":7,"_locale":8,"title":5196,"description":5197,"_hidden":7,"authors":5198,"authors_orcid":5201,"year":4449,"doi":5203,"openalex_id":5204,"venue":21,"abstract_screenshot":21,"keywords":5205,"body":5213,"_type":51,"_id":5221,"_source":53,"_file":5222,"_stem":5223,"_extension":56,"locale":57},"\u002Fpublications\u002F2018\u002Ftraceability-in-systems-engineering-an-avionics-case-study","Traceability in Systems Engineering: An Avionics Case Study","In Systems Engineering (SE), development of complex systems involves a collaboration of expertise from different domains. Heterogeneous artifacts are generated using different modeling tools. Capturing the traceability information among these artifacts helps serve many purposes, including change impact analysis; validation and verification; and requirements tracking. However, creating trace links among these heterogeneous artifacts is problematic. No precise semantics exist for the trace links that relate them. This paper shows how to capture traceability information in a system with heterogeneous artifacts, illustrated here using an avionics case study that uses a traceability model and a trace links taxonomy that we constructed and published previously.",[5199,5200,595],"Mustafa, Nasser","Labiche, Yvan",[21,5202,599],"0000-0001-8880-4836","https:\u002F\u002Fdoi.org\u002F10.1109\u002Fcompsac.2018.10345","W2808848181",[5206,5207,5208,23,5209,607,5210,5211,5212,110,179,139],"Traceability","Requirements traceability","TRACE (psycholinguistics)","Avionics","Semantics (computer science)","Systems engineering","Requirements engineering",{"type":39,"children":5214,"toc":5219},[5215],{"type":42,"tag":43,"props":5216,"children":5217},{},[5218],{"type":47,"value":5197},{"title":8,"searchDepth":49,"depth":49,"links":5220},[],"content:publications:2018:traceability-in-systems-engineering-an-avionics-case-study.md","publications\u002F2018\u002Ftraceability-in-systems-engineering-an-avionics-case-study.md","publications\u002F2018\u002Ftraceability-in-systems-engineering-an-avionics-case-study",{"_path":5225,"_dir":5226,"_draft":7,"_partial":7,"_locale":8,"title":5227,"description":8,"_hidden":7,"authors":5228,"authors_orcid":5230,"year":5232,"doi":5233,"openalex_id":5234,"venue":5235,"abstract_screenshot":21,"keywords":5236,"body":5237,"_type":51,"_id":5241,"_source":53,"_file":5242,"_stem":5243,"_extension":56,"locale":57},"\u002Fpublications\u002F2019\u002Fa-hybrid-combinatorial-approach-to-a-two-stage-stochastic-portfolio-optimization","2019","A hybrid combinatorial approach to a two-stage stochastic portfolio optimization model with uncertain asset prices",[709,12,5229,1131,319,1132,199],"Ding, Shusheng",[711,15,5231,1134,322,1135,203],"0000-0001-5745-7552",2019,"https:\u002F\u002Fdoi.org\u002F10.1007\u002Fs00500-019-04517-y","W2989646934","Soft Computing",[23,719,718,31,1081,717,244,1140,36,34,429],{"type":39,"children":5238,"toc":5239},[],{"title":8,"searchDepth":49,"depth":49,"links":5240},[],"content:publications:2019:a-hybrid-combinatorial-approach-to-a-two-stage-stochastic-portfolio-optimization.md","publications\u002F2019\u002Fa-hybrid-combinatorial-approach-to-a-two-stage-stochastic-portfolio-optimization.md","publications\u002F2019\u002Fa-hybrid-combinatorial-approach-to-a-two-stage-stochastic-portfolio-optimization",{"_path":5245,"_dir":5226,"_draft":7,"_partial":7,"_locale":8,"title":5246,"description":5247,"_hidden":7,"authors":5248,"authors_orcid":5252,"year":5232,"doi":5255,"openalex_id":5256,"venue":603,"abstract_screenshot":21,"keywords":5257,"body":5260,"_type":51,"_id":5268,"_source":53,"_file":5269,"_stem":5270,"_extension":56,"locale":57},"\u002Fpublications\u002F2019\u002Fa-survey-on-adaptive-random-testing","A Survey on Adaptive Random Testing","Random testing (RT) is a well-studied testing method that has been widely applied to the testing of many applications, including embedded software systems, SQL database systems, and Android applications. Adaptive random testing (ART) aims to enhance RT's failure-detection ability by more evenly spreading the test cases over the input domain. Since its introduction in 2001, there have been many contributions to the development of ART, including various approaches, implementations, assessment and evaluation methods, and applications. This paper provides a comprehensive survey on ART, classifying techniques, summarizing application areas, and analyzing experimental evaluations. This paper also addresses some misconceptions about ART, and identifies open research challenges to be further investigated in the future work.",[645,5049,5249,5250,595,5251],"Xu, Yinyin","Chen, Haibo","Xia, Xin",[650,5051,21,5253,599,5254],"0000-0002-9720-0361","0000-0002-6302-3256","https:\u002F\u002Fdoi.org\u002F10.1109\u002Ftse.2019.2942921","W3041931538",[1163,23,5258,606,5259,607,3228,3146,139,181,658,691,215,3983,110,1169,1113],"Implementation","Android (operating system)",{"type":39,"children":5261,"toc":5266},[5262],{"type":42,"tag":43,"props":5263,"children":5264},{},[5265],{"type":47,"value":5247},{"title":8,"searchDepth":49,"depth":49,"links":5267},[],"content:publications:2019:a-survey-on-adaptive-random-testing.md","publications\u002F2019\u002Fa-survey-on-adaptive-random-testing.md","publications\u002F2019\u002Fa-survey-on-adaptive-random-testing",{"_path":5272,"_dir":5226,"_draft":7,"_partial":7,"_locale":8,"title":5273,"description":8,"_hidden":7,"authors":5274,"authors_orcid":5275,"year":5232,"doi":5276,"openalex_id":5277,"venue":5278,"abstract_screenshot":21,"keywords":5279,"body":5287,"_type":51,"_id":5291,"_source":53,"_file":5292,"_stem":5293,"_extension":56,"locale":57},"\u002Fpublications\u002F2019\u002Fa-triple-frequency-cycle-slip-detection-and-correction-method-based-on-modified","A triple-frequency cycle slip detection and correction method based on modified HMW combinations applied on GPS and BDS",[3375,1182,3377,3376,12],[3379,1185,3381,3380,15],"https:\u002F\u002Fdoi.org\u002F10.1007\u002Fs10291-018-0817-8","W2907755701","GPS Solutions",[3392,5280,5281,5282,5283,4092,23,332,5284,3789,288,3597,5285,5286,4095],"GNSS applications","Geosynchronous orbit","Geodesy","GPS signals","Geostationary orbit","Satellite","Assisted GPS",{"type":39,"children":5288,"toc":5289},[],{"title":8,"searchDepth":49,"depth":49,"links":5290},[],"content:publications:2019:a-triple-frequency-cycle-slip-detection-and-correction-method-based-on-modified.md","publications\u002F2019\u002Fa-triple-frequency-cycle-slip-detection-and-correction-method-based-on-modified.md","publications\u002F2019\u002Fa-triple-frequency-cycle-slip-detection-and-correction-method-based-on-modified",{"_path":5295,"_dir":5226,"_draft":7,"_partial":7,"_locale":8,"title":5296,"description":5297,"_hidden":7,"authors":5298,"authors_orcid":5299,"year":5232,"doi":5300,"openalex_id":5301,"venue":5302,"abstract_screenshot":21,"keywords":5303,"body":5307,"_type":51,"_id":5315,"_source":53,"_file":5316,"_stem":5317,"_extension":56,"locale":57},"\u002Fpublications\u002F2019\u002Fa-variable-neighborhood-search-algorithm-with-reinforcement-learning-for-a-real","A variable neighborhood search algorithm with reinforcement learning for a real-life periodic vehicle routing problem with time windows and open routes","This paper studies a real-life container transportation problem with a wide planning horizon divided into multiple shifts. The trucks in this problem do not return to depot after every single shift but at the end of every two shifts. The mathematical model of the problem is first established, but it is unrealistic to solve this large scale problem with exact search methods. Thus, a Variable Neighbourhood Search algorithm with Reinforcement Learning (VNS-RLS) is thus developed. An urgency level-based insertion heuristic is proposed to construct the initial solution. Reinforcement learning is then used to guide the search in the local search improvement phase. Our study shows that the Sampling scheme in single solution-based algorithms does not significantly improve the solution quality but can greatly reduce the rate of infeasible solutions explored during the search. Compared to the exact search and the state-of-the-art algorithms, the proposed VNS-RLS produces promising results.",[3410,319,12,4446],[3413,322,15,4448],"https:\u002F\u002Fdoi.org\u002F10.1051\u002Fro\u002F2019080","W2970726627","RAIRO - Operations Research",[5304,31,5305,23,329,332,5306,247,331,1189,211,250,239,37,34,179],"Reinforcement learning","Variable neighborhood search","Time horizon",{"type":39,"children":5308,"toc":5313},[5309],{"type":42,"tag":43,"props":5310,"children":5311},{},[5312],{"type":47,"value":5297},{"title":8,"searchDepth":49,"depth":49,"links":5314},[],"content:publications:2019:a-variable-neighborhood-search-algorithm-with-reinforcement-learning-for-a-real.md","publications\u002F2019\u002Fa-variable-neighborhood-search-algorithm-with-reinforcement-learning-for-a-real.md","publications\u002F2019\u002Fa-variable-neighborhood-search-algorithm-with-reinforcement-learning-for-a-real",{"_path":5319,"_dir":5226,"_draft":7,"_partial":7,"_locale":8,"title":5320,"description":5321,"_hidden":7,"Level-Combination Coverage authors":5322,"authors_orcid":5323,"year":5232,"doi":5324,"openalex_id":5325,"venue":3356,"abstract_screenshot":21,"keywords":5326,"body":5329,"_type":51,"_id":5337,"_source":53,"_file":5338,"_stem":5339,"_extension":56,"locale":57},"\u002Fpublications\u002F2019\u002Fabstract-test-case-prioritization-using-repeated-small-strength-level-combinatio","Abstract Test Case Prioritization Using Repeated Small-Strength","Abstract test cases (ATCs) have been widely used in practice, including in combinatorial testing and in software product line testing. When constructing a set of ATCs, due to limited testing resources in practice (e.g., in regression testing), test case prioritization (TCP) has been proposed to improve the testing quality, aiming at ordering test cases to increase the speed with which faults are detected. One intuitive and extensively studied TCP technique for ATCs is λ-wise Level-combination Coverage based Prioritization (λLCP), a static, black-box prioritization technique that only uses the ATC information to guide the prioritization process. A challenge facing λLCP, however, is the necessity for the selection of the fixed prioritization strength λ before testing-testers need to choose an appropriate λ value before testing begins. Choosing higher λ values may improve the testing effectiveness of λLCP (e.g., by finding faults faster), but may reduce the testing efficiency (by incurring additional prioritization costs). Conversely, choosing lower λ values may improve the efficiency, but may also reduce the effectiveness. In this paper, we propose a new family of λLCP techniques, Repeated Small-strength Level-combination Coverage-based Prioritization (RSLCP), that repeatedly achieves the full combination coverage at lower strengths. RSLCP maintains λLCP's advantages of being static and black box, but avoids the challenge of prioritization strength selection. We have performed an empirical study involving five different versions of each of five C programs. Compared with λLCP, and Incremental-strength LCP (ILCP), our results show that RSLCP could provide a good tradeoff between testing effectiveness and efficiency. Our results also show that RSLCP is more effective and efficient than two popular techniques of Similarity-based Prioritization (SP). In addition, the results of empirical studies also show that RSLCP can remain robust over multiple system releases.",[645,5049,596,595,648,3921,3922],[650,5051,600,599,651,21,21],"https:\u002F\u002Fdoi.org\u002F10.1109\u002Ftr.2019.2908068","W2943287237",[656,1164,23,661,5327,3146,3145,5328,3816,662,101,139,138,179],"Non-regression testing","Orthogonal array testing",{"type":39,"children":5330,"toc":5335},[5331],{"type":42,"tag":43,"props":5332,"children":5333},{},[5334],{"type":47,"value":5321},{"title":8,"searchDepth":49,"depth":49,"links":5336},[],"content:publications:2019:abstract-test-case-prioritization-using-repeated-small-strength-level-combinatio.md","publications\u002F2019\u002Fabstract-test-case-prioritization-using-repeated-small-strength-level-combinatio.md","publications\u002F2019\u002Fabstract-test-case-prioritization-using-repeated-small-strength-level-combinatio",{"_path":5341,"_dir":5226,"_draft":7,"_partial":7,"_locale":8,"title":5342,"description":5343,"_hidden":7,"authors":5344,"authors_orcid":5345,"year":5232,"doi":5346,"openalex_id":5347,"venue":21,"abstract_screenshot":5348,"keywords":5349,"body":5354,"_type":51,"_id":5362,"_source":53,"_file":5363,"_stem":5364,"_extension":56,"locale":57},"\u002Fpublications\u002F2019\u002Factivity-modelling-using-journey-pairing-of-taxi-trajectory-data","Activity Modelling Using Journey Pairing of Taxi Trajectory Data","Taxi GPS data offers an opportunity to discover behavioural patterns in urban populations. However, raw taxi journey data does not provide a link between outbound and return journeys of individual travellers. Without this information, it is not possible to track individual behaviours. In this study, we propose a novel method for pairing taxi journeys and apply it to taxi trajectory data for the city of Shenzhen, China. Journeys related to three activities are considered: shopping, medical, and work. Results, validated using questionnaire data collected in Shenzhen, quantitatively reveal behavioural patterns and suggest possibilities for applications in urban design.",[4662,4306,12,4663,4664,4665],[4667,4308,15,4668,4669,4670],"https:\u002F\u002Fdoi.org\u002F10.1109\u002Ficbda.2019.8712832","W2940779611","activity-modelling-using-journey-pairing-of-taxi-trajectory-data.png",[3659,3392,5350,23,28,5351,5352,282,5353,454,289,179,288,868],"Raw data","Track (disk drive)","Pairing","Urban computing",{"type":39,"children":5355,"toc":5360},[5356],{"type":42,"tag":43,"props":5357,"children":5358},{},[5359],{"type":47,"value":5343},{"title":8,"searchDepth":49,"depth":49,"links":5361},[],"content:publications:2019:activity-modelling-using-journey-pairing-of-taxi-trajectory-data.md","publications\u002F2019\u002Factivity-modelling-using-journey-pairing-of-taxi-trajectory-data.md","publications\u002F2019\u002Factivity-modelling-using-journey-pairing-of-taxi-trajectory-data",{"_path":5366,"_dir":5226,"_draft":7,"_partial":7,"_locale":8,"title":5367,"description":5368,"_hidden":7,"Business Models\" authors":5369,"authors_orcid":5373,"year":5232,"doi":5377,"openalex_id":5378,"venue":5379,"abstract_screenshot":21,"keywords":5380,"body":5389,"_type":51,"_id":5397,"_source":53,"_file":5398,"_stem":5399,"_extension":56,"locale":57},"\u002Fpublications\u002F2019\u002Fbusiness-on-chain-a-comparative-case-study-of-five-blockchain-inspired-business","Business on Chain: A Comparative Case Study of Five Blockchain-Inspire","Blockchain technology, despite its origins as the underlying infrastructure for value transfer in the era of cryptocurrency, has been touted as the main disruptive force in modern businesses. Blockchain has the capacity to chronologically capture and store transactional data in a standardized and tamper-proof format that is transparent to all stakeholders involved in the transaction. This, in turn, has prompted companies to rethink preexisting business practices, thereby yielding a myriad of fascinating business models anchored in blockchain technology. In this study, we advance contemporary knowledge of business applications of blockchain by drawing on the theoretical lens of the digital business model and value configuration to decipher how pioneers in this space are leveraging blockchain to create and capture value. Through a comparative, multiple case study approach, we analyzed five companies in mainland China that have rolled out blockchain initiatives. From our case analyses, we derived a typology of five blockchain-inspired business models, each of which embodies a distinctive logic for market differentiation. For each business model, we offer insights into its value creation logic, its value capturing mechanism, and the challenges that could threaten its longer-term viability. Grounded in our findings, we discuss key implications for theory and practice.",[623,5370,268,5371,5372],"Lim, Eric T.K.","Zheng, Shuning","Tan, Chee‐Wee",[625,5374,272,5375,5376],"0000-0003-3317-8406","0000-0001-6227-1197","0000-0003-4245-541X","https:\u002F\u002Fdoi.org\u002F10.17705\u002F1jais.00568","W2977744086","Journal of the Association for Information Systems",[5381,5382,5383,5384,1441,5385,689,5386,5387,691,178,23,4218,629,5388,180,751,4991],"Blockchain","Business model","Cryptocurrency","Business rule","Database transaction","Artifact-centric business process model","New business development","Business process modeling",{"type":39,"children":5390,"toc":5395},[5391],{"type":42,"tag":43,"props":5392,"children":5393},{},[5394],{"type":47,"value":5368},{"title":8,"searchDepth":49,"depth":49,"links":5396},[],"content:publications:2019:business-on-chain-a-comparative-case-study-of-five-blockchain-inspired-business.md","publications\u002F2019\u002Fbusiness-on-chain-a-comparative-case-study-of-five-blockchain-inspired-business.md","publications\u002F2019\u002Fbusiness-on-chain-a-comparative-case-study-of-five-blockchain-inspired-business",{"_path":5401,"_dir":5226,"_draft":7,"_partial":7,"_locale":8,"title":5402,"description":5403,"_hidden":7,"authors":5404,"authors_orcid":5409,"year":5232,"doi":5413,"openalex_id":5414,"venue":21,"abstract_screenshot":21,"keywords":5415,"body":5421,"_type":51,"_id":5429,"_source":53,"_file":5430,"_stem":5431,"_extension":56,"locale":57},"\u002Fpublications\u002F2019\u002Fcreating-a-4d-photoreal-vr-environment-to-teach-civil-engineering","Creating a 4D Photoreal VR Environment to Teach Civil Engineering","Motivated by recent developments in AR\u002FVR technology and accessibility, an interdisciplinary team at a Sino-foreign Higher Education Institution in China have been engaged in the creation of a virtual reality learning resource that will be offered to students and educators in the institution's Civil Engineering department. In Civil Engineering education, it is difficult to explain to students how classroom theories translate into real life solutions and field trips can help resolve this problem. However, these must overcome fundamental concerns associated with student site visits, which include safety, logistics and accessibility for disadvantaged students. The presented case study details the development of a virtual field trip that is accessible from simple phone-based virtual reality headsets. The photoreal virtual field trip was constructed through multiple site visits to capture data and the experience now provides students with an opportunity to view the entire construction process of a university library. This paper contributes to current research by exploring the challenges and conjugate solutions encountered whilst building the virtual reality environment, and by presenting the first known photoreal virtual field trip that allows students to autonomously move both spatially and chronologically around a construction site. This will benefit other educational practitioners who are contemplating similar initiatives.",[4822,5405,595,5406,5407,5408],"Stepanov, Denis","Elamin, Ahmed","Pike, Matthew","Wei, Ran",[4827,21,599,5410,5411,5412],"0000-0003-0783-5185","0000-0002-1543-0148","0000-0001-7982-0404","https:\u002F\u002Fdoi.org\u002F10.1109\u002Ftale48000.2019.9225972","W3094010242",[4390,5416,135,5417,3095,5418,924,23,5419,5420,4389,1335,179,868,1380,454,1358],"TRIPS architecture","Field (mathematics)","Field trip","Disadvantaged","Engineering education",{"type":39,"children":5422,"toc":5427},[5423],{"type":42,"tag":43,"props":5424,"children":5425},{},[5426],{"type":47,"value":5403},{"title":8,"searchDepth":49,"depth":49,"links":5428},[],"content:publications:2019:creating-a-4d-photoreal-vr-environment-to-teach-civil-engineering.md","publications\u002F2019\u002Fcreating-a-4d-photoreal-vr-environment-to-teach-civil-engineering.md","publications\u002F2019\u002Fcreating-a-4d-photoreal-vr-environment-to-teach-civil-engineering",{"_path":5433,"_dir":5226,"_draft":7,"_partial":7,"_locale":8,"title":5434,"description":5435,"_hidden":7,"authors":5436,"authors_orcid":5438,"year":5232,"doi":5439,"openalex_id":5440,"venue":5441,"abstract_screenshot":21,"keywords":5442,"body":5448,"_type":51,"_id":5456,"_source":53,"_file":5457,"_stem":5458,"_extension":56,"locale":57},"\u002Fpublications\u002F2019\u002Fcurrent-practices-new-insights-and-emerging-trends-of-financial-technologies","Current practices, new insights, and emerging trends of financial technologies","Purpose Financial technologies, also known as “FinTech,” have brought disruptive changes to virtually every aspect of financial services and are becoming increasingly important in the world economic system. The purpose of this paper is to proffer a bird view of some recent studies in the key research areas of FinTech, such as artificial intelligence, blockchain, crowdfunding and then to summarize the key contributions made by all the six papers in this special issue. Design\u002Fmethodology\u002Fapproach A literature review approach is adopted, and the summary shows that most types of FinTech innovations generate positive value to innovators, financial customers and the society. The current implications and future directions are explored based on theoretical and empirical analyses. Findings The benefits from and determinants of FinTech applications vary across different financial sectors. Together the summary of this special issue suggests that there is substantial value creation in further exploring the dynamics, mechanisms and social consequences of FinTech. Originality\u002Fvalue This study helps to extend knowledge by summarizing the current practices, proffering new insights and watching out emerging trends of financial technologies, and to shed light on a variety of subjects of interest to practitioners, academics and policy makers by suggesting for the future research topics.",[268,548,5437],"Zheng, Yanfeng",[272,550,21],"https:\u002F\u002Fdoi.org\u002F10.1108\u002Fimds-08-2019-0431","W2973674769","Industrial Management & Data Systems",[5443,4263,1441,5444,5445,5446,5447,178,177,629,36,1358,429,23,4268],"Variety (cybernetics)","Financial services","Financial innovation","Emerging technologies","FinTech",{"type":39,"children":5449,"toc":5454},[5450],{"type":42,"tag":43,"props":5451,"children":5452},{},[5453],{"type":47,"value":5435},{"title":8,"searchDepth":49,"depth":49,"links":5455},[],"content:publications:2019:current-practices-new-insights-and-emerging-trends-of-financial-technologies.md","publications\u002F2019\u002Fcurrent-practices-new-insights-and-emerging-trends-of-financial-technologies.md","publications\u002F2019\u002Fcurrent-practices-new-insights-and-emerging-trends-of-financial-technologies",{"_path":5460,"_dir":5226,"_draft":7,"_partial":7,"_locale":8,"title":5461,"description":8,"_hidden":7,"authors":5462,"authors_orcid":5465,"year":5232,"doi":5467,"openalex_id":5468,"venue":687,"abstract_screenshot":21,"keywords":5469,"body":5474,"_type":51,"_id":5478,"_source":53,"_file":5479,"_stem":5480,"_extension":56,"locale":57},"\u002Fpublications\u002F2019\u002Fdeveloping-a-vehicle-networking-platform-based-on-blockchain-technology","Developing a Vehicle Networking Platform Based on Blockchain Technology",[5463,5464,268],"Cho, Siu‐Yeung","Chen, Ningyuan",[21,5466,272],"0000-0002-3948-1011","https:\u002F\u002Fdoi.org\u002F10.1007\u002F978-3-030-23404-1_13","W2951092661",[5381,23,5470,5471,5472,5473,180,1441],"Security token","Smart contract","Incentive","Distributed ledger",{"type":39,"children":5475,"toc":5476},[],{"title":8,"searchDepth":49,"depth":49,"links":5477},[],"content:publications:2019:developing-a-vehicle-networking-platform-based-on-blockchain-technology.md","publications\u002F2019\u002Fdeveloping-a-vehicle-networking-platform-based-on-blockchain-technology.md","publications\u002F2019\u002Fdeveloping-a-vehicle-networking-platform-based-on-blockchain-technology",{"_path":5482,"_dir":5226,"_draft":7,"_partial":7,"_locale":8,"title":5483,"description":5484,"_hidden":7,"authors":5485,"authors_orcid":5487,"year":5232,"doi":5489,"openalex_id":5490,"venue":5491,"abstract_screenshot":21,"keywords":5492,"body":5493,"_type":51,"_id":5501,"_source":53,"_file":5502,"_stem":5503,"_extension":56,"locale":57},"\u002Fpublications\u002F2019\u002Fdynamic-random-testing-of-web-services-a-methodology-and-evaluation","Dynamic Random Testing of Web Services: A Methodology and Evaluation","In recent years, service oriented architecture (SOA) has been increasingly adopted to develop distributed applications in the context of the Internet. To develop reliable SOA-based applications, an important issue is how to ensure the quality of web services. In this article, we propose a dynamic random testing (DRT) technique for web services, which is an improvement over the widely-practiced random testing (RT) and partition testing (PT) approaches. We examine key issues when adapting DRT to the context of SOA, including a framework, guidelines for parameter settings, and a prototype for such an adaptation. Empirical studies are reported where DRT is used to test three real-life web services, and mutation analysis is employed to measure the effectiveness. Our experimental results show that, compared with the three baseline techniques, RT, Adaptive Testing (AT) and Random Partition Testing (RPT), DRT demonstrates higher fault-detection effectiveness with a lower test case selection overhead. Furthermore, the theoretical guidelines of parameter setting for DRT are confirmed to be effective. The proposed DRT and the prototype provide an effective and efficient approach for testing web services.",[1205,5486,3838,595,596,3165],"Dai, Hepeng",[1210,5488,3841,599,600,3169],"0000-0001-5507-3053","https:\u002F\u002Fdoi.org\u002F10.1109\u002Ftsc.2019.2960496","W2994855135","IEEE Transactions on Services Computing",[23,1106,1163,4216,1108,133,3121,3173,181,249,658,661,607,215,869,251,179],{"type":39,"children":5494,"toc":5499},[5495],{"type":42,"tag":43,"props":5496,"children":5497},{},[5498],{"type":47,"value":5484},{"title":8,"searchDepth":49,"depth":49,"links":5500},[],"content:publications:2019:dynamic-random-testing-of-web-services-a-methodology-and-evaluation.md","publications\u002F2019\u002Fdynamic-random-testing-of-web-services-a-methodology-and-evaluation.md","publications\u002F2019\u002Fdynamic-random-testing-of-web-services-a-methodology-and-evaluation",{"_path":5505,"_dir":5226,"_draft":7,"_partial":7,"_locale":8,"title":5506,"description":5507,"_hidden":7,"authors":5508,"authors_orcid":5509,"year":5232,"doi":5510,"openalex_id":5511,"venue":5512,"abstract_screenshot":21,"keywords":5513,"body":5515,"_type":51,"_id":5523,"_source":53,"_file":5524,"_stem":5525,"_extension":56,"locale":57},"\u002Fpublications\u002F2019\u002Fembracing-ambiguity","Embracing ambiguity","Purpose Embracing reflective practice and retrospection, with a goal of identifying commonalities, this paper aims to examine delivery of engineering subjects in both traditional higher education (THE) and technical and vocational education and training (TVET). Design\u002Fmethodology\u002Fapproach Reflections on actions and autoethnography were used to examine the teaching and learning experiences of three educators across two higher education (HE) institutions (HEIs) in the greater Chinese context. Literature reviews and historical contexts are outlined to support the approaches and insights identified. Findings This paper presents a number of common characteristics and challenges identified across both THE and TVET. Drawing on the successful embrace of ambiguity and change in recent software engineering (SE) development paradigms, recommendations are made for how the agile SE themes can be applied in a larger sense to address the wider challenges facing both THE and TVET. Originality\u002Fvalue To the best of the authors’ knowledge, this is the first time that engineering education has been examined and contrasted in the contexts of THE and TVET. The similarities and common challenges may represent a new focus for related work, and the presented insights, from agile methodologies in SE, represent a new perspective for viewing future HE and TVET sustainability.",[595,4822,3894],[599,4827,3896],"https:\u002F\u002Fdoi.org\u002F10.1108\u002Fitse-10-2018-0088","W2920819413","Interactive Technology and Smart Education",[3900,4263,133,3766,3387,1376,1380,1334,4831,1441,3468,1379,629,179,23,5514,1358,3096],"Qualitative research",{"type":39,"children":5516,"toc":5521},[5517],{"type":42,"tag":43,"props":5518,"children":5519},{},[5520],{"type":47,"value":5507},{"title":8,"searchDepth":49,"depth":49,"links":5522},[],"content:publications:2019:embracing-ambiguity.md","publications\u002F2019\u002Fembracing-ambiguity.md","publications\u002F2019\u002Fembracing-ambiguity",{"_path":5527,"_dir":5226,"_draft":7,"_partial":7,"_locale":8,"title":5528,"description":5529,"_hidden":7,"Reuse and VFS authors":5530,"authors_orcid":5535,"year":5232,"doi":5540,"openalex_id":5541,"venue":21,"abstract_screenshot":21,"keywords":5542,"body":5552,"_type":51,"_id":5560,"_source":53,"_file":5561,"_stem":5562,"_extension":56,"locale":57},"\u002Fpublications\u002F2019\u002Fenergy-efficiency-optimization-of-fpga-based-cnn-accelerators-with-full-data-reu","Energy Efficiency Optimization of FPGA-based CNN Accelerators with Full Data","While FPGA has been recognized as a promising platform to accelerate Convolutional Neural Networks (CNNs) in embedded computing given its high flexibility and power efficiency, two challenges still have to be addressed to enhance its applicability on the edge-computing paradigm. First, the power and performance of the CNN accelerator are still bounded by memory throughput, and a CNN-customized architecture is desirable to fully utilize the on-chip storage. Second, power optimization algorithms are insufficiently explored on CNN-targeted platforms. In this paper, we design a novel FPGA-based CNN accelerator architecture that makes full use of the on-chip storage resources leveraging data reuse and loop unrolling strategies. We also present an efficient FPGA-based voltage and frequency scaling (VFS) system that enables VFS of the CNN accelerator for power optimization. We devise a VFS policy that fully exploits the power efficiency potential of the FPGA. Experiment results show up to 40% energy can be saved with our VFS platform and policy.",[5531,5532,5533,5534],"Jiang, Weixiong","Yu, Heng","Liu, Xinzhe","Ha, Yajun",[5536,5537,5538,5539],"0000-0002-6014-6453","0000-0002-0305-2135","0000-0002-7557-4960","0000-0003-4244-5916","https:\u002F\u002Fdoi.org\u002F10.1109\u002Ficecs46596.2019.8964717","W2995857400",[23,5543,4242,5544,5545,5546,5547,1034,5548,3636,5549,1078,5550,5551,37,4359,1113,179],"Field-programmable gate array","Efficient energy use","Convolutional neural network","Loop unrolling","Throughput","Computer architecture","System on a chip","Computer hardware","Computer engineering",{"type":39,"children":5553,"toc":5558},[5554],{"type":42,"tag":43,"props":5555,"children":5556},{},[5557],{"type":47,"value":5529},{"title":8,"searchDepth":49,"depth":49,"links":5559},[],"content:publications:2019:energy-efficiency-optimization-of-fpga-based-cnn-accelerators-with-full-data-reu.md","publications\u002F2019\u002Fenergy-efficiency-optimization-of-fpga-based-cnn-accelerators-with-full-data-reu.md","publications\u002F2019\u002Fenergy-efficiency-optimization-of-fpga-based-cnn-accelerators-with-full-data-reu",{"_path":5564,"_dir":5226,"_draft":7,"_partial":7,"_locale":8,"title":5565,"description":8,"_hidden":7,"authors":5566,"authors_orcid":5567,"year":5232,"doi":5568,"openalex_id":5569,"venue":5570,"abstract_screenshot":21,"keywords":5571,"body":5574,"_type":51,"_id":5578,"_source":53,"_file":5579,"_stem":5580,"_extension":56,"locale":57},"\u002Fpublications\u002F2019\u002Fexploring-user-behavioral-data-for-adaptive-cybersecurity","Exploring user behavioral data for adaptive cybersecurity",[3459,3461,595,3460],[21,3464,599,3463],"https:\u002F\u002Fdoi.org\u002F10.1007\u002Fs11257-019-09236-5","W2943925803","User Modeling and User-Adapted Interaction",[23,690,5572,133,1167,5573,506,180,691],"Predictive analytics","Adaptation (eye)",{"type":39,"children":5575,"toc":5576},[],{"title":8,"searchDepth":49,"depth":49,"links":5577},[],"content:publications:2019:exploring-user-behavioral-data-for-adaptive-cybersecurity.md","publications\u002F2019\u002Fexploring-user-behavioral-data-for-adaptive-cybersecurity.md","publications\u002F2019\u002Fexploring-user-behavioral-data-for-adaptive-cybersecurity",{"_path":5582,"_dir":5226,"_draft":7,"_partial":7,"_locale":8,"title":5583,"description":5584,"_hidden":7,"authors":5585,"authors_orcid":5586,"year":5232,"doi":5587,"openalex_id":5588,"venue":5589,"abstract_screenshot":21,"keywords":5590,"body":5594,"_type":51,"_id":5602,"_source":53,"_file":5603,"_stem":5604,"_extension":56,"locale":57},"\u002Fpublications\u002F2019\u002Fextracting-activity-patterns-from-taxi-trajectory-data-a-two-layer-framework-usi","Extracting activity patterns from taxi trajectory data: a two-layer framework using spatio-temporal clustering, Bayesian probability and Monte Carlo simulation","Global positioning system (GPS) data generated from taxi trips is a valuable source of information that offers an insight into travel behaviours of urban populations with high spatio-temporal resolution. However, in its raw form, GPS taxi data does not offer information on the purpose (or intended activity) of travel. In this context, to enhance the utility of taxi GPS data sets, we propose a two-layer framework to identify the related activities of each taxi trip automatically and estimate the return trips and successive activities after the trip, by using geographic point-of-interest (POI) data and a combination of spatio-temporal clustering, Bayesian inference and Monte Carlo simulation. Two million taxi trips in New York, the United States of America, and ten million taxi trips in Shenzhen, China, are used as inputs for the two-layer framework. To validate each layer of the framework, we collect 6,003 trip diaries in New York and 712 questionnaire surveys in Shenzhen. The results show that the first layer of the framework performs better than comparable methods published in the literature, while the second layer has high accuracy when inferring return trips.",[4662,4306,12,4663,4664,4665],[4667,4308,15,4668,4669,4670],"https:\u002F\u002Fdoi.org\u002F10.1080\u002F13658816.2019.1641715","W2963551795","International Journal of Geographical Information Systems",[3441,5591,3659,4478,23,181,5592,5593,37,3666,34,3597],"Bayesian probability","Layer (electronics)","Markov chain Monte Carlo",{"type":39,"children":5595,"toc":5600},[5596],{"type":42,"tag":43,"props":5597,"children":5598},{},[5599],{"type":47,"value":5584},{"title":8,"searchDepth":49,"depth":49,"links":5601},[],"content:publications:2019:extracting-activity-patterns-from-taxi-trajectory-data-a-two-layer-framework-usi.md","publications\u002F2019\u002Fextracting-activity-patterns-from-taxi-trajectory-data-a-two-layer-framework-usi.md","publications\u002F2019\u002Fextracting-activity-patterns-from-taxi-trajectory-data-a-two-layer-framework-usi",{"_path":5606,"_dir":5226,"_draft":7,"_partial":7,"_locale":8,"title":5607,"description":8,"_hidden":7,"authors":5608,"authors_orcid":5621,"year":5232,"doi":5629,"openalex_id":5630,"venue":21,"abstract_screenshot":21,"keywords":5631,"body":5632,"_type":51,"_id":5636,"_source":53,"_file":5637,"_stem":5638,"_extension":56,"locale":57},"\u002Fpublications\u002F2019\u002Fmet-2019-program-committee","MET 2019 Program Committee",[5609,5610,5611,5612,4351,5613,593,5614,5615,5616,5008,1205,595,5617,5618,5619,5620,1156],"Chan, W. K.","Chen, Tai C.","Hierons, Robert M.","Kaiser, Gail E.","Lindvall, Mikael","Nakajima, Shin","Núñez, Alberto","Podder, Sanjay","Tse, T","Washizaki, Hironori","Wu, Peng","Zhang, Lingming",[5622,5623,5624,5625,4355,5626,598,21,5627,21,5010,1210,599,21,5628,21,21,1158],"0000-0001-7726-6235","0000-0002-5704-5694","0000-0002-4771-1446","0000-0002-8791-1178","0009-0001-7457-4002","0000-0001-8613-746X","0000-0002-1417-9879","https:\u002F\u002Fdoi.org\u002F10.1109\u002Fmet.2019.00007","W4234266282",[23],{"type":39,"children":5633,"toc":5634},[],{"title":8,"searchDepth":49,"depth":49,"links":5635},[],"content:publications:2019:met-2019-program-committee.md","publications\u002F2019\u002Fmet-2019-program-committee.md","publications\u002F2019\u002Fmet-2019-program-committee",{"_path":5640,"_dir":5226,"_draft":7,"_partial":7,"_locale":8,"title":5641,"description":5642,"_hidden":7,"authors":5643,"authors_orcid":5644,"year":5232,"doi":5646,"openalex_id":5647,"venue":21,"abstract_screenshot":21,"keywords":5648,"body":5650,"_type":51,"_id":5658,"_source":53,"_file":5659,"_stem":5660,"_extension":56,"locale":57},"\u002Fpublications\u002F2019\u002Fmetamorphic-exploration-of-an-unsupervised-clustering-program","Metamorphic Exploration of an Unsupervised Clustering Program","Machine learning has been becoming increasingly popular and widely-used in various industry domains. The presence of the oracle problem, however, makes it difficult to ensure the quality of this kind of software. Furthermore, the popularity of machine learning and its application has attracted many users who are not experts in this field. In this paper, we report on using a recently introduced method called metamorphic exploration where we proposed a set of hypothesized metamorphic relations for an unsupervised clustering program, Weka, to enhance understanding of the system and its better use.",[4793,595,1156],[5645,599,1158],"0000-0003-2642-6408","https:\u002F\u002Fdoi.org\u002F10.1109\u002Fmet.2019.00015","W2955676268",[3441,23,605,5649,215,101,37,860,5417,139,181,607,110],"Unsupervised learning",{"type":39,"children":5651,"toc":5656},[5652],{"type":42,"tag":43,"props":5653,"children":5654},{},[5655],{"type":47,"value":5642},{"title":8,"searchDepth":49,"depth":49,"links":5657},[],"content:publications:2019:metamorphic-exploration-of-an-unsupervised-clustering-program.md","publications\u002F2019\u002Fmetamorphic-exploration-of-an-unsupervised-clustering-program.md","publications\u002F2019\u002Fmetamorphic-exploration-of-an-unsupervised-clustering-program",{"_path":5662,"_dir":5226,"_draft":7,"_partial":7,"_locale":8,"title":5663,"description":8,"_hidden":7,"authors":5664,"authors_orcid":5668,"year":5232,"doi":5671,"openalex_id":5672,"venue":5673,"abstract_screenshot":21,"keywords":5674,"body":5677,"_type":51,"_id":5681,"_source":53,"_file":5682,"_stem":5683,"_extension":56,"locale":57},"\u002Fpublications\u002F2019\u002Fmethods-to-detect-and-reduce-driver-stress-a-review","Methods to Detect and Reduce Driver Stress: A Review",[5665,5666,5667],"Chung, Wan‐Young","Chong, Teak-Wei","Lee, Boon Giin",[5669,21,5670],"0000-0002-0121-855X","0000-0001-5743-1010","https:\u002F\u002Fdoi.org\u002F10.1007\u002Fs12239-019-0099-3","W2968963421","International Journal of Automotive Technology",[5675,4239,5676,180,4857,170,454,23,179,752,178,865,37],"Safe driving","Stress (linguistics)",{"type":39,"children":5678,"toc":5679},[],{"title":8,"searchDepth":49,"depth":49,"links":5680},[],"content:publications:2019:methods-to-detect-and-reduce-driver-stress-a-review.md","publications\u002F2019\u002Fmethods-to-detect-and-reduce-driver-stress-a-review.md","publications\u002F2019\u002Fmethods-to-detect-and-reduce-driver-stress-a-review",{"_path":5685,"_dir":5226,"_draft":7,"_partial":7,"_locale":8,"title":5686,"description":5687,"_hidden":7,"Traceability Case Study\" authors":5688,"authors_orcid":5689,"year":5232,"doi":5690,"openalex_id":5691,"venue":21,"abstract_screenshot":21,"keywords":5692,"body":5693,"_type":51,"_id":5701,"_source":53,"_file":5702,"_stem":5703,"_extension":56,"locale":57},"\u002Fpublications\u002F2019\u002Fmitigating-threats-to-validity-in-empirical-software-engineering-a-traceability","Mitigating Threats to Validity in Empirical Software Engineering: ","The issue of validity threats in empirical software engineering research is important. However, some authors overlook this, focusing on validating their work through application of fundamental testing techniques, instead. However, testing is different to empirical validation, with the latter being more concerned about how experimental conclusions are justified. An important factor that can render an experimental conclusion incorrect is researcher's bias, which can be especially relevant when setting the experimental parameters. Therefore, consideration of validity threats is essential to enable confidence in research results and assure the research quality. This paper provides a practical approach for mitigating threats to validity in empirical software engineering using a sequence of software activities. The paper is based on a real-world traceability case study for illustration purposes.",[5199,5200,595],[21,5202,599],"https:\u002F\u002Fdoi.org\u002F10.1109\u002Fcompsac.2019.10227","W2959088703",[5206,23,3981,1165,747,139,607,170,138],{"type":39,"children":5694,"toc":5699},[5695],{"type":42,"tag":43,"props":5696,"children":5697},{},[5698],{"type":47,"value":5687},{"title":8,"searchDepth":49,"depth":49,"links":5700},[],"content:publications:2019:mitigating-threats-to-validity-in-empirical-software-engineering-a-traceability.md","publications\u002F2019\u002Fmitigating-threats-to-validity-in-empirical-software-engineering-a-traceability.md","publications\u002F2019\u002Fmitigating-threats-to-validity-in-empirical-software-engineering-a-traceability",{"_path":5705,"_dir":5226,"_draft":7,"_partial":7,"_locale":8,"title":5706,"description":5707,"_hidden":7,"authors":5708,"authors_orcid":5714,"year":5232,"doi":5720,"openalex_id":5721,"venue":21,"abstract_screenshot":21,"keywords":5722,"body":5724,"_type":51,"_id":5732,"_source":53,"_file":5733,"_stem":5734,"_extension":56,"locale":57},"\u002Fpublications\u002F2019\u002Foer-six-perspectives-on-global-misconceptions-and-challenges","OER: Six Perspectives on Global Misconceptions and Challenges","Open Educational Resources (OERs) are freely accessible materials for teaching, learning, and research that have been made available such that they can be freely used, modified, and shared. Prompted by the potential positive impact that OERs can have, a growing community of OER enthusiasts has been advocating for their adoption in higher education, and elsewhere. The growing demand for computer science education and training (especially in areas related to artificial intelligence, machine learning, and big data) has led to speculation as to how OERs may be best leveraged to support such teaching and learning. The recent occasion of an international OER workshop at the 2019 IEEE Conference on Computers, Software and Applications (COMPSAC) allowed for six OER enthusiasts, all with extensive OER experience, to reflect on the status of OER adoption and understanding. These reflections, addressing misconceptions and challenges, form the basis for this paper.",[595,5709,5710,5711,5712,5713],"Reisman, Sorel","Chan, Henry C. B.","Demartini, Claudio Giovanni","Tovar, Edmundo","Margaria, Tiziana",[599,5715,5716,5717,5718,5719],"0000-0002-7222-4084","0000-0001-8024-0597","0000-0003-0686-6713","0000-0003-2929-659X","0000-0002-5547-9739","https:\u002F\u002Fdoi.org\u002F10.1109\u002Ftale48000.2019.9225943","W3094472142",[3901,23,4173,5723,691,867,866,869,865],"Speculation",{"type":39,"children":5725,"toc":5730},[5726],{"type":42,"tag":43,"props":5727,"children":5728},{},[5729],{"type":47,"value":5707},{"title":8,"searchDepth":49,"depth":49,"links":5731},[],"content:publications:2019:oer-six-perspectives-on-global-misconceptions-and-challenges.md","publications\u002F2019\u002Foer-six-perspectives-on-global-misconceptions-and-challenges.md","publications\u002F2019\u002Foer-six-perspectives-on-global-misconceptions-and-challenges",{"_path":5736,"_dir":5226,"_draft":7,"_partial":7,"_locale":8,"title":5737,"description":5738,"_hidden":7,"With Restriction\" authors":5739,"authors_orcid":5741,"year":5232,"doi":5742,"openalex_id":5743,"venue":3356,"abstract_screenshot":21,"keywords":5744,"body":5748,"_type":51,"_id":5756,"_source":53,"_file":5757,"_stem":5758,"_extension":56,"locale":57},"\u002Fpublications\u002F2019\u002Fone-domain-one-input-adaptive-random-testing-by-orthogonal-recursive-bisection-w","One-Domain-One-Input: Adaptive Random Testing by Orthogonal Recursive Bisectio","One goal of software testing may be the identification or generation of a series of test cases that can detect a fault with as few test executions as possible. Motivated by insights from research into failure-causing regions of input domains, the even-spreading (even distribution) of tests across the input domain has been identified as a useful heuristic to more quickly find failures. This finding has encouraged a shift in focus from traditional random testing (RT) to its enhancement, adaptive random testing (ART), which retains the randomness of test input selection, but also attempts to maintain a more evenly distributed spread of test inputs across the input domain. Given that there are different ways to achieve the even distribution, several different ART methods and approaches have been proposed. This paper presents a new ART method, called ART by orthogonal recursive bisection (ART-ORB), which explores the advantages of repeated geometric bisection of the input domain, combined with restriction regions, to evenly spread test inputs. Experimental results show a better performance in terms of fewer test executions than RT to find failures. Compared with other ART methods, ART-ORB has comparable performance (in terms of required test executions), but incurs lower test input selection overheads, especially in higher dimensional input space. It is recommended that ART-ORB can be used in testing situations involving expensive test input execution.",[4113,648,595,4114,5740,645],"Xi, Jiaxiang",[4117,651,599,4118,21,650],"https:\u002F\u002Fdoi.org\u002F10.1109\u002Ftr.2019.2907577","W2943540685",[23,5745,1163,1167,5328,329,658,332,134,5746,5747,139,215,34,37,3983,3666],"Randomness","Bisection method","Orb (optics)",{"type":39,"children":5749,"toc":5754},[5750],{"type":42,"tag":43,"props":5751,"children":5752},{},[5753],{"type":47,"value":5738},{"title":8,"searchDepth":49,"depth":49,"links":5755},[],"content:publications:2019:one-domain-one-input-adaptive-random-testing-by-orthogonal-recursive-bisection-w.md","publications\u002F2019\u002Fone-domain-one-input-adaptive-random-testing-by-orthogonal-recursive-bisection-w.md","publications\u002F2019\u002Fone-domain-one-input-adaptive-random-testing-by-orthogonal-recursive-bisection-w",{"_path":5760,"_dir":5226,"_draft":7,"_partial":7,"_locale":8,"title":5761,"description":5762,"_hidden":7,"Machine Learning\" authors":5763,"authors_orcid":5764,"year":5232,"doi":5765,"openalex_id":5766,"venue":21,"abstract_screenshot":21,"keywords":5767,"body":5770,"_type":51,"_id":5778,"_source":53,"_file":5779,"_stem":5780,"_extension":56,"locale":57},"\u002Fpublications\u002F2019\u002Fpreparing-software-quality-assurance-professionals-metamorphic-exploration-for-m","Preparing Software Quality Assurance Professionals: Metamorphic Exploration fo","Computer science (CS) subjects have been rapidly growing in popularity, and demand for CS education and training has put increasing pressure on teaching resources in higher education (HE) and elsewhere. HE in the People's Republic of China (PRC) has also been developing, with one product of this evolution being Sino-foreign HE institutions (SfHEIs). Much of the popularity growth for CS can be linked to the growth of CS-based technology and innovation, especially in the form of Artificial Intelligence (AI) and Machine Learning (ML). AI\u002FML-based innovation has been forecast to offer increases in quality of life for consumers. However, AI\u002FML systems face a challenge for software quality assurance (SQA): They are so-called “untestable systems” - identifying the correctness of AI\u002FML system outputs or behaviour may not be feasible. Preparing SQA professionals to be able to ensure AI\u002FML SQA will require innovative and creative education and training. An SQA approach called metamorphic testing (MT) has a proven track record of alleviating the oracle problem, and has great potential as a testing methodology for AI\u002FML systems. Metamorphic exploration (ME) is a new addition to the MT literature, and involves developing the user's understanding of the system under study. This paper reports on experiences at an SfHEI of using ME and MT to test an AI\u002FML system.",[4793,595,1156,596],[5645,599,1158,600],"https:\u002F\u002Fdoi.org\u002F10.1109\u002Ftale48000.2019.9225946","W3093889343",[5768,23,1165,139,747,5769,3768,607,1335,138,179,1113,33],"Quality assurance","Software quality assurance",{"type":39,"children":5771,"toc":5776},[5772],{"type":42,"tag":43,"props":5773,"children":5774},{},[5775],{"type":47,"value":5762},{"title":8,"searchDepth":49,"depth":49,"links":5777},[],"content:publications:2019:preparing-software-quality-assurance-professionals-metamorphic-exploration-for-m.md","publications\u002F2019\u002Fpreparing-software-quality-assurance-professionals-metamorphic-exploration-for-m.md","publications\u002F2019\u002Fpreparing-software-quality-assurance-professionals-metamorphic-exploration-for-m",{"_path":5782,"_dir":5226,"_draft":7,"_partial":7,"_locale":8,"title":5783,"description":5784,"_hidden":7,"authors":5785,"authors_orcid":5787,"year":5232,"doi":5789,"openalex_id":5790,"venue":5791,"abstract_screenshot":21,"keywords":5792,"body":5799,"_type":51,"_id":5807,"_source":53,"_file":5808,"_stem":5809,"_extension":56,"locale":57},"\u002Fpublications\u002F2019\u002Fqualitative-spatial-logic-over-2d-euclidean-spaces-is-not-finitely-axiomatisable","Qualitative Spatial Logic over 2D Euclidean Spaces Is Not Finitely Axiomatisable","Several qualitative spatial logics used in reasoning about geospatial data have a sound and complete axiomatisation over metric spaces. It has been open whether the same axiomatisation is also sound and complete for 2D Euclidean spaces. We answer this question negatively by showing that the axiomatisations presented in (Du et al. 2013; Du and Alechina 2016) are not complete for 2D Euclidean spaces and, moreover, the logics are not finitely axiomatisable.",[4626,5786],"Alechina, Natasha",[4637,5788],"0000-0003-3306-9891","https:\u002F\u002Fdoi.org\u002F10.1609\u002Faaai.v33i01.33012776","W2904386975","Proceedings of the AAAI Conference on Artificial Intelligence",[5793,34,5794,5795,5796,108,5797,107,5798,289,3393,4051],"Euclidean geometry","Geospatial analysis","Metric space","Euclidean space","Non-Euclidean geometry","Discrete mathematics",{"type":39,"children":5800,"toc":5805},[5801],{"type":42,"tag":43,"props":5802,"children":5803},{},[5804],{"type":47,"value":5784},{"title":8,"searchDepth":49,"depth":49,"links":5806},[],"content:publications:2019:qualitative-spatial-logic-over-2d-euclidean-spaces-is-not-finitely-axiomatisable.md","publications\u002F2019\u002Fqualitative-spatial-logic-over-2d-euclidean-spaces-is-not-finitely-axiomatisable.md","publications\u002F2019\u002Fqualitative-spatial-logic-over-2d-euclidean-spaces-is-not-finitely-axiomatisable",{"_path":5811,"_dir":5226,"_draft":7,"_partial":7,"_locale":8,"title":5812,"description":5813,"_hidden":7,"authors":5814,"authors_orcid":5819,"year":5232,"doi":5823,"openalex_id":5824,"venue":4539,"abstract_screenshot":21,"keywords":5825,"body":5828,"_type":51,"_id":5836,"_source":53,"_file":5837,"_stem":5838,"_extension":56,"locale":57},"\u002Fpublications\u002F2019\u002Fregular-expression-based-medical-text-classification-using-constructive-heuristi","Regular Expression Based Medical Text Classification Using Constructive Heuristic Approach","Medical text classification assigns medical related text into different categories such as topics or disease types. Machine learning based techniques have been widely used to perform such tasks despite the obvious drawback in such “black box” approach, leaving no easy way to fine-tune the resultant model for better performance. We propose a novel constructive heuristic approach to generate a set of regular expressions that can be used as effective text classifiers. The main innovation of our approach is that we develop a novel regular expression based text classifier with both satisfactory classification performance and excellent interpretability. We evaluate our framework on real-world medical data provided by our collaborator, one of the largest online healthcare providers in the market, and observe the high performance and consistency of this approach. Experimental results show that the machine-generated regular expressions can be effectively used in conjunction with machine learning techniques to perform medical text classification tasks. The proposed methodology improves the performance of baseline methods (Naive Bayes and Support Vector Machines) by 9% in precision and 4.5% in recall. We also evaluate the performance of modified regular expressions by human experts and demonstrate the potential of practical applications using the proposed method.",[5815,12,5816,907,5817,5818],"Cui, Menglin","Lu, Zheng","Aickelin, Uwe","Ge, Peiming",[5820,15,5821,912,5822,21],"0000-0002-7296-7718","0000-0003-4098-2486","0000-0002-2679-2275","https:\u002F\u002Fdoi.org\u002F10.1109\u002Faccess.2019.2946622","W2979602634",[23,891,5826,329,5827,37,4479,110],"Regular expression","Expression (computer science)",{"type":39,"children":5829,"toc":5834},[5830],{"type":42,"tag":43,"props":5831,"children":5832},{},[5833],{"type":47,"value":5813},{"title":8,"searchDepth":49,"depth":49,"links":5835},[],"content:publications:2019:regular-expression-based-medical-text-classification-using-constructive-heuristi.md","publications\u002F2019\u002Fregular-expression-based-medical-text-classification-using-constructive-heuristi.md","publications\u002F2019\u002Fregular-expression-based-medical-text-classification-using-constructive-heuristi",{"_path":5840,"_dir":5226,"_draft":7,"_partial":7,"_locale":8,"title":5841,"description":5842,"_hidden":7,"authors":5843,"authors_orcid":5847,"year":5232,"doi":5850,"openalex_id":5851,"venue":5852,"abstract_screenshot":21,"keywords":5853,"body":5856,"_type":51,"_id":5864,"_source":53,"_file":5865,"_stem":5866,"_extension":56,"locale":57},"\u002Fpublications\u002F2019\u002Freturning-scientists-and-the-emergence-of-china-s-science-system","Returning scientists and the emergence of China’s science system","Abstract China’s approach to developing a world-class science system includes a vigorous set of programmes to attract back Chinese researchers who have overseas training and work experience. No analysis is available to show the performance of these mobile researchers. This article attempts to close part of this gap. Using a novel bibliometric approach, we estimate the stocks of overseas Chinese and returnees from the perspective of their publication activities, albeit with some limitations. We show that the share of overseas Chinese scientists in the USA is considerably larger than that in the European Union. We also show that Chinese returnees publish higher impact work and continue to publish more and at the international level than domestic counterparts. Returnees not only tend to publish more, but they are instrumental in linking China into the global network. Indeed, returnees actively co-publish with researchers in their former host system, showing the importance of scientific social capital. Future research will examine the impact of length of stay, among other factors, on such impact and integration.",[65,5844,5845,5846],"Baas, Jeroen","Wagner, Caroline S.","Jonkers, Koen",[70,5848,5849,21],"0000-0001-8005-4153","0000-0002-1724-8489","https:\u002F\u002Fdoi.org\u002F10.1093\u002Fscipol\u002Fscz056","W2993292920","Science and Public Policy",[5854,282,28,1358,5855,1440,3958,289,3259,179],"Publication","Social capital",{"type":39,"children":5857,"toc":5862},[5858],{"type":42,"tag":43,"props":5859,"children":5860},{},[5861],{"type":47,"value":5842},{"title":8,"searchDepth":49,"depth":49,"links":5863},[],"content:publications:2019:returning-scientists-and-the-emergence-of-china-s-science-system.md","publications\u002F2019\u002Freturning-scientists-and-the-emergence-of-china-s-science-system.md","publications\u002F2019\u002Freturning-scientists-and-the-emergence-of-china-s-science-system",{"_path":5868,"_dir":5226,"_draft":7,"_partial":7,"_locale":8,"title":5869,"description":8,"_hidden":7,"authors":5870,"authors_orcid":5871,"year":5232,"doi":5872,"openalex_id":5873,"venue":5874,"abstract_screenshot":21,"keywords":5875,"body":5876,"_type":51,"_id":5880,"_source":53,"_file":5881,"_stem":5882,"_extension":56,"locale":57},"\u002Fpublications\u002F2019\u002Fscience-technology-and-innovation-in-china-progress-problems-and-prospects","Science, Technology and Innovation in China: Progress, Problems and Prospects",[65],[70],"https:\u002F\u002Fdoi.org\u002F10.1142\u002F9789811203626_0006","W2922179829","EAI series on East Asia",[282,1334,1358,179],{"type":39,"children":5877,"toc":5878},[],{"title":8,"searchDepth":49,"depth":49,"links":5879},[],"content:publications:2019:science-technology-and-innovation-in-china-progress-problems-and-prospects.md","publications\u002F2019\u002Fscience-technology-and-innovation-in-china-progress-problems-and-prospects.md","publications\u002F2019\u002Fscience-technology-and-innovation-in-china-progress-problems-and-prospects",{"_path":5884,"_dir":5226,"_draft":7,"_partial":7,"_locale":8,"title":5885,"description":5886,"_hidden":7,"New Challenges\" authors":5887,"authors_orcid":5889,"year":5232,"doi":5891,"openalex_id":5892,"venue":21,"abstract_screenshot":21,"keywords":5893,"body":5898,"_type":51,"_id":5906,"_source":53,"_file":5907,"_stem":5908,"_extension":56,"locale":57},"\u002Fpublications\u002F2019\u002Fsensor-networks-and-data-management-in-healthcare-emerging-technologies-and-new","Sensor Networks and Data Management in Healthcare: Emerging Technologies an","Smart pervasive sensor networks are becoming an important part of our daily lives. Low-power, high-availability and high-throughput 5G mobile networks provide the necessary communication means for highly pervasive sensor networks, introducing a technological disruption to health monitoring. The meaningful use of large concurrent sensor networks in healthcare requires multi-level health knowledge integration with sensor data streams. In this paper, we highlight some software engineering and data-processing issues that can be addressed by metamorphic testing. The proposed solution combines data streaming with filtering and cross-calibration, use of medical knowledge for system operation and data interpretation, and IoT-based calibration using certified linked diagnostic devices.",[5407,5199,595,5888],"Brusić, Vladimir",[5411,21,599,5890],"0000-0003-0523-5266","https:\u002F\u002Fdoi.org\u002F10.1109\u002Fcompsac.2019.00123","W2956430636",[23,5894,5895,139,5896,5897,4242,691,3203,251,181],"Wireless sensor network","Data stream mining","Health care","Certification",{"type":39,"children":5899,"toc":5904},[5900],{"type":42,"tag":43,"props":5901,"children":5902},{},[5903],{"type":47,"value":5886},{"title":8,"searchDepth":49,"depth":49,"links":5905},[],"content:publications:2019:sensor-networks-and-data-management-in-healthcare-emerging-technologies-and-new.md","publications\u002F2019\u002Fsensor-networks-and-data-management-in-healthcare-emerging-technologies-and-new.md","publications\u002F2019\u002Fsensor-networks-and-data-management-in-healthcare-emerging-technologies-and-new",{"_path":5910,"_dir":5226,"_draft":7,"_partial":7,"_locale":8,"title":5911,"description":5912,"_hidden":7,"Interfaces authors":5913,"authors_orcid":5915,"year":5232,"doi":5916,"openalex_id":5917,"venue":21,"abstract_screenshot":21,"keywords":5918,"body":5927,"_type":51,"_id":5935,"_source":53,"_file":5936,"_stem":5937,"_extension":56,"locale":57},"\u002Fpublications\u002F2019\u002Fsupporting-computer-science-student-reading-through-multimodal-engagement-interf","Supporting Computer Science Student Reading through Multimodal Engagement","While many computer science (CS) curricula are increasingly addressing a demand for more communicative and ethical graduates, reports of CS student difficulties with nontechnical subjects, such as Professional Ethics, persist. These seem compounded for students learning through a second or foreign language. This paper explores the impact that multimodal engagement interfaces can have on content comprehension. 30 participants of varying English language ability were asked to engage with four unrelated articles under four different conditions: baseline reading (C1); guided reading (sentence-by-sentence) (C2); audio\u002Flistening only (C3); and concurrent (multi-modal) presentation of C2 & C3 (C4). After each engagement, participants were asked to complete a comprehension test on the material that they had just encountered. A subjective survey evaluating the “comfort” and “engagement quality” of each interface was also completed after each interaction. Our results paint a complex picture with the guided reading interface (C2) producing both the best performance, and the poorest subjective evaluation from participants. This result aligns with existing findings identified in the field of reading education. The results highlight how varying language levels in participants impact subjective and performance metrics, suggesting how future interfaces may better support readers, according to their language ability or intended outcomes of reading.",[5407,5914,595],"Shen, Kejia",[5411,21,599],"https:\u002F\u002Fdoi.org\u002F10.1109\u002Ftale48000.2019.9225970","W3094206264",[5919,5920,23,5921,5922,5923,659,5924,747,865,867,866,1379,5925,37,5926],"Active listening","Reading (process)","Presentation (obstetrics)","Curriculum","Sentence","Reading comprehension","Linguistics","Communication",{"type":39,"children":5928,"toc":5933},[5929],{"type":42,"tag":43,"props":5930,"children":5931},{},[5932],{"type":47,"value":5912},{"title":8,"searchDepth":49,"depth":49,"links":5934},[],"content:publications:2019:supporting-computer-science-student-reading-through-multimodal-engagement-interf.md","publications\u002F2019\u002Fsupporting-computer-science-student-reading-through-multimodal-engagement-interf.md","publications\u002F2019\u002Fsupporting-computer-science-student-reading-through-multimodal-engagement-interf",{"_path":5939,"_dir":5226,"_draft":7,"_partial":7,"_locale":8,"title":5940,"description":8,"_hidden":7,"and Language Expectancy Perspectives\" authors":5941,"authors_orcid":5943,"year":5232,"doi":5945,"openalex_id":5946,"venue":74,"abstract_screenshot":21,"keywords":5947,"body":5950,"_type":51,"_id":5954,"_source":53,"_file":5955,"_stem":5956,"_extension":56,"locale":57},"\u002Fpublications\u002F2019\u002Fthe-impact-of-language-on-retweeting-during-acute-crises-uncertainty-reduction-a","The Impact of Language on Retweeting during Acute Crises: Uncertainty Reductio",[5942,5532],"Lee, Chang Heon",[5944,5537],"0000-0002-3906-8462","https:\u002F\u002Fdoi.org\u002F10.2139\u002Fssrn.3446718","W3138490267",[5948,748,865,36,5925,380,870,5949,34],"Expectancy theory","Philosophy",{"type":39,"children":5951,"toc":5952},[],{"title":8,"searchDepth":49,"depth":49,"links":5953},[],"content:publications:2019:the-impact-of-language-on-retweeting-during-acute-crises-uncertainty-reduction-a.md","publications\u002F2019\u002Fthe-impact-of-language-on-retweeting-during-acute-crises-uncertainty-reduction-a.md","publications\u002F2019\u002Fthe-impact-of-language-on-retweeting-during-acute-crises-uncertainty-reduction-a",{"_path":5958,"_dir":5226,"_draft":7,"_partial":7,"_locale":8,"title":5959,"description":5960,"_hidden":7,"authors":5961,"authors_orcid":5962,"year":5232,"doi":5964,"openalex_id":5965,"venue":5966,"abstract_screenshot":21,"keywords":5967,"body":5972,"_type":51,"_id":5980,"_source":53,"_file":5981,"_stem":5982,"_extension":56,"locale":57},"\u002Fpublications\u002F2019\u002Ftravel-time-prediction-in-transport-and-logistics","Travel time prediction in transport and logistics","Purpose Many transport and logistics companies nowadays use raw vehicle GPS data for travel time prediction. However, they face difficult challenges in terms of the costs of information storage, as well as the quality of the prediction. This paper aims to systematically investigate various meta-data (features) that require significantly less storage space but provide sufficient information for high-quality travel time predictions. Design\u002Fmethodology\u002Fapproach The paper systematically studied the combinatorial effects of features and different model fitting strategies with two popular decision tree ensemble methods for travel time prediction, namely, random forests and gradient boosting regression trees. First, the investigation was conducted using pseudo travel time data that were generated using a pseudo travel time sampling algorithm, which allows generating travel time data using different noise processes so that the prediction performance under different travel conditions and noise characteristics can be studied systematically. The results and findings were then further compared and evaluated through a real-life case. Findings The paper provides empirical insights and guidelines about how raw GPS data can be reduced into a small-sized feature vector for the purposes of vehicle travel time prediction. It suggests that, add travel time observations from the previous departure time intervals are beneficial to the prediction, particularly when there is no other types of real-time information (e.g. traffic flow, speed) are available. It was also found that modular model fitting does not improve the quality of the prediction in all experimental settings used in this paper. Research limitations\u002Fimplications The findings are primarily based on empirical studies on limited real-life data instances, and the results may lack generalisabilities. Therefore, the researchers are encouraged to test them further in more real-life data instances. Practical implications The paper includes implications and guidelines for the development of efficient GPS data storage and high-quality travel time prediction under different types of travel conditions. Originality\u002Fvalue This paper systematically studies the combinatorial feature effects for tree-ensemble-based travel time prediction approaches.",[973,12,974,975],[5963,15,977,978],"0000-0003-1561-3590","https:\u002F\u002Fdoi.org\u002F10.1108\u002Fvjikms-11-2018-0102","W2983926835","VINE Journal of Information and Knowledge Management Systems",[23,3662,3392,181,5968,3665,3658,3661,5969,5970,5350,5971,747,215,179,454],"Ensemble learning","Sampling (signal processing)","Travel time","Real-time data",{"type":39,"children":5973,"toc":5978},[5974],{"type":42,"tag":43,"props":5975,"children":5976},{},[5977],{"type":47,"value":5960},{"title":8,"searchDepth":49,"depth":49,"links":5979},[],"content:publications:2019:travel-time-prediction-in-transport-and-logistics.md","publications\u002F2019\u002Ftravel-time-prediction-in-transport-and-logistics.md","publications\u002F2019\u002Ftravel-time-prediction-in-transport-and-logistics",{"_path":5984,"_dir":5985,"_draft":7,"_partial":7,"_locale":8,"title":5986,"description":5987,"_hidden":7,"authors":5988,"authors_orcid":5990,"year":5992,"doi":5993,"openalex_id":5994,"venue":21,"abstract_screenshot":21,"keywords":5995,"body":5999,"_type":51,"_id":6007,"_source":53,"_file":6008,"_stem":6009,"_extension":56,"locale":57},"\u002Fpublications\u002F2020\u002Fa-data-driven-genetic-programming-heuristic-for-real-world-dynamic-seaport-conta","2020","A Data-Driven Genetic Programming Heuristic for Real-World Dynamic Seaport Container Terminal Truck Dispatching","International and domestic maritime trade has been expanding dramatically in the last few decades, seaborne container transportation has become an indispensable part of maritime trade efficient and easy-to-use containers. As an important hub of container transport, container terminals use a range of metrics to measure their efficiency, among which the hourly container throughput (i.e., the number of twentyfoot equivalent unit containers, or TEUs) is the most important objective to improve. This paper proposes a genetic programming approach to build a dynamic truck dispatching system trained on real-world stochastic operations data. The experimental results demonstrated the superiority of this dynamic approach and the potential for practical applications.",[5989,12,319,908,523],"Chen, Xinan",[5991,15,322,913,525],"0000-0001-9620-3264",2020,"https:\u002F\u002Fdoi.org\u002F10.1109\u002Fcec48606.2020.9185659","W3083176092",[1189,746,23,5547,106,329,5996,3199,97,1081,24,5997,3203,454,179,31,251,752,1113,5998],"Dynamic programming","Range (aeronautics)","Wireless",{"type":39,"children":6000,"toc":6005},[6001],{"type":42,"tag":43,"props":6002,"children":6003},{},[6004],{"type":47,"value":5987},{"title":8,"searchDepth":49,"depth":49,"links":6006},[],"content:publications:2020:a-data-driven-genetic-programming-heuristic-for-real-world-dynamic-seaport-conta.md","publications\u002F2020\u002Fa-data-driven-genetic-programming-heuristic-for-real-world-dynamic-seaport-conta.md","publications\u002F2020\u002Fa-data-driven-genetic-programming-heuristic-for-real-world-dynamic-seaport-conta",{"_path":6011,"_dir":5985,"_draft":7,"_partial":7,"_locale":8,"title":6012,"description":6013,"_hidden":7,"employing domain ontologies and qualitative uncertainty-based reasoning authors":6014,"authors_orcid":6015,"year":5992,"doi":6016,"openalex_id":6017,"venue":374,"abstract_screenshot":21,"keywords":6018,"body":6024,"_type":51,"_id":6032,"_source":53,"_file":6033,"_stem":6034,"_extension":56,"locale":57},"\u002Fpublications\u002F2020\u002Fa-decision-support-system-for-urban-infrastructure-inter-asset-management-employ","A decision support system for urban infrastructure inter-asset management","Urban infrastructure assets (e.g. roads, water pipes) perform critical functions to the health and well-being of society. Although it has been widely recognised that different infrastructure assets are highly interconnected, infrastructure management in practice such as planning, installation and maintenance are often undertaken by different stakeholders without considering these dependencies due to the lack of relevant data and cross-domain knowledge, which may cause unexpected cascading social, economic and environmental effects. In this paper, we present a knowledge based decision support system for urban infrastructure inter-asset management. By considering various infrastructure assets (e.g. road, ground, cable), triggers (e.g. pipe leaking) and potential consequences (e.g. traffic disruption) as a holistic system, we model each sub-domain using a modular ontology and encapsulate the interdependence between them using a set of rules. Moreover, qualitative likelihood is assigned to each rule by domain experts (e.g. civil engineers) to encode the uncertainty of knowledge, and an inference engine is applied to predict the potential consequences of a given trigger with location specific data and the encoded rules. A web-based prototype system has been developed based on the above concept and demonstrated to a wide range of stakeholders. The system can assist in the process of decision making by aiding data collation and integration, as well as presenting potential consequences of possible triggers, advising on whether additional information is needed or suggesting ways of obtaining such information. The work shows an intelligent approach to integrate and process multi-source data to pioneer a novel way to aid a complex decision process with a high social impact.",[4625,4626,4627,4695,4629,4628,4630,4631,4632,4633,4634],[4636,4637,4638,21,4640,4639,4641,4642,21,21,4643],"https:\u002F\u002Fdoi.org\u002F10.1016\u002Fj.eswa.2020.113461","W3017039712",[23,6019,4647,4648,1167,244,175,135,6020,4649,6021,6022,170,629,6023,691,453,180,181,37,178,179],"Ontology","Semantic reasoner","Information infrastructure","Critical infrastructure","Semantic Web",{"type":39,"children":6025,"toc":6030},[6026],{"type":42,"tag":43,"props":6027,"children":6028},{},[6029],{"type":47,"value":6013},{"title":8,"searchDepth":49,"depth":49,"links":6031},[],"content:publications:2020:a-decision-support-system-for-urban-infrastructure-inter-asset-management-employ.md","publications\u002F2020\u002Fa-decision-support-system-for-urban-infrastructure-inter-asset-management-employ.md","publications\u002F2020\u002Fa-decision-support-system-for-urban-infrastructure-inter-asset-management-employ",{"_path":6036,"_dir":5985,"_draft":7,"_partial":7,"_locale":8,"title":6037,"description":6038,"_hidden":7,"Blockchain authors":6039,"authors_orcid":6044,"year":5992,"doi":6048,"openalex_id":6049,"venue":21,"abstract_screenshot":21,"keywords":6050,"body":6053,"_type":51,"_id":6061,"_source":53,"_file":6062,"_stem":6063,"_extension":56,"locale":57},"\u002Fpublications\u002F2020\u002Fa-framework-for-assembling-asset-information-models-aims-through-permissioned-bl","A Framework for Assembling Asset Information Models (AIMs) through Permissioned","There is a lack of accurate and valid data provision during the construction project lifecycle, and throughout the in-use phase of building assets. Construction needs to adopt a new technology to support building assets. Due to the current limitation of construction technology, Blockchain can be considered a new revolution within the most advanced construction applications. This paper proposes a framework for assembling Asset Information Models (AIMs) through private Blockchain to allow the owners, consultants, contractors, and suppliers to upload and visualise the data anywhere at any time throughout the lifecycle of the building to support project owners in making decisions. This paper introduces a conceptual framework through the processes of data analysis between the construction stages. The framework will improve current management efficiency in many ways such as: model upload\u002Fdownload, lack of data, partial model exchange, clash detection, conflict resolution, multiple data model formats, and data security. This helps project owners and maintenance teams to enhance their decision-making processes and improve the trust between stakeholders.",[6040,6041,6042,6043,595],"Raslan, Azzam","Kapogiannis, Georgios","Cheshmehzangi, Ali","Tizani, Walid",[21,6045,6046,6047,599],"0000-0002-1738-6734","0000-0003-2657-4865","0000-0003-1868-6998","https:\u002F\u002Fdoi.org\u002F10.1109\u002Fcompsac48688.2020.0-198","W3088491692",[6051,244,5381,23,4647,6052,629,4774,180,170,178,179,429,869,33],"Upload","Building information modeling",{"type":39,"children":6054,"toc":6059},[6055],{"type":42,"tag":43,"props":6056,"children":6057},{},[6058],{"type":47,"value":6038},{"title":8,"searchDepth":49,"depth":49,"links":6060},[],"content:publications:2020:a-framework-for-assembling-asset-information-models-aims-through-permissioned-bl.md","publications\u002F2020\u002Fa-framework-for-assembling-asset-information-models-aims-through-permissioned-bl.md","publications\u002F2020\u002Fa-framework-for-assembling-asset-information-models-aims-through-permissioned-bl",{"_path":6065,"_dir":5985,"_draft":7,"_partial":7,"_locale":8,"title":6066,"description":8,"_hidden":7,"authors":6067,"authors_orcid":6068,"year":5992,"doi":6069,"openalex_id":6070,"venue":1055,"abstract_screenshot":21,"keywords":6071,"body":6072,"_type":51,"_id":6076,"_source":53,"_file":6077,"_stem":6078,"_extension":56,"locale":57},"\u002Fpublications\u002F2020\u002Fa-hybrid-pricing-and-cutting-approach-for-the-multi-shift-full-truckload-vehicle","A hybrid pricing and cutting approach for the multi-shift full truckload vehicle routing problem",[1181,12,319,5817],[1184,15,322,5822],"https:\u002F\u002Fdoi.org\u002F10.1016\u002Fj.ejor.2020.10.037","W3097643400",[239,23,31,247,209,329,5305,250,332,37,34],{"type":39,"children":6073,"toc":6074},[],{"title":8,"searchDepth":49,"depth":49,"links":6075},[],"content:publications:2020:a-hybrid-pricing-and-cutting-approach-for-the-multi-shift-full-truckload-vehicle.md","publications\u002F2020\u002Fa-hybrid-pricing-and-cutting-approach-for-the-multi-shift-full-truckload-vehicle.md","publications\u002F2020\u002Fa-hybrid-pricing-and-cutting-approach-for-the-multi-shift-full-truckload-vehicle",{"_path":6080,"_dir":5985,"_draft":7,"_partial":7,"_locale":8,"title":6081,"description":6082,"_hidden":7,"authors":6083,"authors_orcid":6084,"year":5992,"doi":6085,"openalex_id":6086,"venue":21,"abstract_screenshot":6087,"keywords":6088,"body":6093,"_type":51,"_id":6101,"_source":53,"_file":6102,"_stem":6103,"_extension":56,"locale":57},"\u002Fpublications\u002F2020\u002Fa-logic-of-directions","A Logic of Directions","We propose a logic of directions for points (LD) over 2D Euclidean space, which formalises primary direction relations east (E), west (W), and indeterminate east\u002Fwest (Iew), north (N), south (S) and indeterminate north\u002Fsouth (Ins). We provide a sound and complete axiomatisation of it, and prove that its satisfiability problem is NP-complete.",[4626,5786,4634],[4637,5788,4643],"https:\u002F\u002Fdoi.org\u002F10.24963\u002Fijcai.2020\u002F235","W3034682161","a-logic-of-directions.png",[6089,6090,5796,27,5793,34,6091,23,107,332,37,5798,6092,108,3393],"Indeterminate","Satisfiability","Boolean satisfiability problem","Calculus (dental)",{"type":39,"children":6094,"toc":6099},[6095],{"type":42,"tag":43,"props":6096,"children":6097},{},[6098],{"type":47,"value":6082},{"title":8,"searchDepth":49,"depth":49,"links":6100},[],"content:publications:2020:a-logic-of-directions.md","publications\u002F2020\u002Fa-logic-of-directions.md","publications\u002F2020\u002Fa-logic-of-directions",{"_path":6105,"_dir":5985,"_draft":7,"_partial":7,"_locale":8,"title":6106,"description":6107,"_hidden":7,"authors":6108,"authors_orcid":6112,"year":5992,"doi":6114,"openalex_id":6115,"venue":6116,"abstract_screenshot":21,"keywords":6117,"body":6119,"_type":51,"_id":6127,"_source":53,"_file":6128,"_stem":6129,"_extension":56,"locale":57},"\u002Fpublications\u002F2020\u002Fa-multiobjective-single-bus-corridor-scheduling-using-machine-learning-based-pre","A multiobjective single bus corridor scheduling using machine learning-based predictive models","Many real-life optimisation problems, including those in production and logistics, have uncertainties that pose considerable challenges for practitioners. In spite of considerable efforts, the current methods are still not satisfactory. This is primarily caused by a lack of effective methods to deal with various uncertainties. Existing literature comes from two isolated research communities, namely the operations research community and the machine learning community. In the operations research community, uncertainties are often modelled and solved through techniques like stochastic programming or robust optimisation, which are often criticised for their over conservativeness. In the machine learning community, the problem is formulated as a dynamic control problem and solved through techniques like supervised learning and\u002For reinforcement learning, which could suffer from being myopic and unstable. In this paper, we aim to fill this research gap and develop a novel framework that takes advantages of both short-term accuracy from mathematical models and high-quality future forecasts from machine learning modules. We demonstrate the practicality and feasibility of our approach for a real-life bus scheduling problem and two controlled bus scheduling instances that are generated artificially. To our knowledge, the proposed framework represents the first multi-objective bus-headway-optimisation method for non-timetabled bus schedule with major practical constraints being considered. The advantages of our proposed methods are also discussed, along with factors that need to be carefully considered for practical applications.",[6109,12,157,6110,1181,6111],"Chen, Bing","Liu, Yueni","Ren, Jianfeng",[21,15,162,21,1184,6113],"0000-0003-4619-6590","https:\u002F\u002Fdoi.org\u002F10.1080\u002F00207543.2020.1766716","W3032698666","International Journal of Production Research",[23,450,6118,5304,1222,31,24,37,215,179,984],"Headway",{"type":39,"children":6120,"toc":6125},[6121],{"type":42,"tag":43,"props":6122,"children":6123},{},[6124],{"type":47,"value":6107},{"title":8,"searchDepth":49,"depth":49,"links":6126},[],"content:publications:2020:a-multiobjective-single-bus-corridor-scheduling-using-machine-learning-based-pre.md","publications\u002F2020\u002Fa-multiobjective-single-bus-corridor-scheduling-using-machine-learning-based-pre.md","publications\u002F2020\u002Fa-multiobjective-single-bus-corridor-scheduling-using-machine-learning-based-pre",{"_path":6131,"_dir":5985,"_draft":7,"_partial":7,"_locale":8,"title":6132,"description":6133,"_hidden":7,"authors":6134,"authors_orcid":6136,"year":5992,"doi":6138,"openalex_id":6139,"venue":4539,"abstract_screenshot":21,"keywords":6140,"body":6148,"_type":51,"_id":6156,"_source":53,"_file":6157,"_stem":6158,"_extension":56,"locale":57},"\u002Fpublications\u002F2020\u002Fa-regularized-attribute-weighting-framework-for-naive-bayes","A Regularized Attribute Weighting Framework for Naive Bayes","The Bayesian classification framework has been widely used in many fields, but the covariance matrix is usually difficult to estimate reliably. To alleviate the problem, many naive Bayes (NB) approaches with good performance have been developed. However, the assumption of conditional independence between attributes in NB rarely holds in reality. Various attribute-weighting schemes have been developed to address this problem. Among them, class-specific attribute weighted naive Bayes (CAWNB) has recently achieved good performance by using classification feedback to optimize the attribute weights of each class. However, the derived model may be over-fitted to the training dataset, especially when the dataset is insufficient to train a model with good generalization performance. This paper proposes a regularization technique to improve the generalization capability of CAWNB, which could well balance the trade-off between discrimination power and generalization capability. More specifically, by introducing the regularization term, the proposed method, namely regularized naive Bayes (RNB), could well capture the data characteristics when the dataset is large, and exhibit good generalization performance when the dataset is small. RNB is compared with the state-of-the-art naive Bayes methods. Experiments on 33 machine-learning benchmark datasets demonstrate that RNB outperforms the compared methods significantly.",[6135,6111,12],"Wang, Shihe",[6137,6113,15],"0000-0002-8371-6893","https:\u002F\u002Fdoi.org\u002F10.1109\u002Faccess.2020.3044946","W3110905448",[23,6141,215,37,6142,6143,5591,209,6144,6145,6146,181,4876,3688,34,6147],"Naive Bayes classifier","Weighting","Regularization (linguistics)","Generalization","Bayesian programming","Bayes' theorem","Bayes factor",{"type":39,"children":6149,"toc":6154},[6150],{"type":42,"tag":43,"props":6151,"children":6152},{},[6153],{"type":47,"value":6133},{"title":8,"searchDepth":49,"depth":49,"links":6155},[],"content:publications:2020:a-regularized-attribute-weighting-framework-for-naive-bayes.md","publications\u002F2020\u002Fa-regularized-attribute-weighting-framework-for-naive-bayes.md","publications\u002F2020\u002Fa-regularized-attribute-weighting-framework-for-naive-bayes",{"_path":6160,"_dir":5985,"_draft":7,"_partial":7,"_locale":8,"title":6161,"description":6162,"_hidden":7,"authors":6163,"authors_orcid":6164,"year":5992,"doi":6165,"openalex_id":6166,"venue":21,"abstract_screenshot":21,"keywords":6167,"body":6168,"_type":51,"_id":6176,"_source":53,"_file":6177,"_stem":6178,"_extension":56,"locale":57},"\u002Fpublications\u002F2020\u002Fa-virtual-reality-oer-platform-to-deliver-phobia-motivated-experiences","A Virtual Reality OER Platform to Deliver Phobia-Motivated Experiences","This paper describes an on-going project to develop a Virtual Reality platform to deliver phobia-inspired experiences. These experiences could induce a reaction in the user that may help the user overcome, or alleviate, the phobia. The platform includes monitoring sensors that could be used to measure how much impact the experience is having. The project development has been taking place at a Sino-foreign Higher Education Institution in Mainland China, University of Nottingham Ningbo China (UNNC). UNNC has already been host to a number of OER (Open Educational Resource) development projects, and the current project is also anticipated to eventually be released to the OER community. This paper presents the background, development, and current state of the project. Challenges to project completion, and future work are also outlined.",[5405,595,596,1156],[21,599,600,1158],"https:\u002F\u002Fdoi.org\u002F10.1109\u002Fcompsac48688.2020.00-38","W3088352915",[4390,28,23,3094,924,1335,282,179,868,1358],{"type":39,"children":6169,"toc":6174},[6170],{"type":42,"tag":43,"props":6171,"children":6172},{},[6173],{"type":47,"value":6162},{"title":8,"searchDepth":49,"depth":49,"links":6175},[],"content:publications:2020:a-virtual-reality-oer-platform-to-deliver-phobia-motivated-experiences.md","publications\u002F2020\u002Fa-virtual-reality-oer-platform-to-deliver-phobia-motivated-experiences.md","publications\u002F2020\u002Fa-virtual-reality-oer-platform-to-deliver-phobia-motivated-experiences",{"_path":6180,"_dir":5985,"_draft":7,"_partial":7,"_locale":8,"title":6181,"description":6182,"_hidden":7,"authors":6183,"authors_orcid":6185,"year":5992,"doi":6187,"openalex_id":6188,"venue":21,"abstract_screenshot":21,"keywords":6189,"body":6196,"_type":51,"_id":6204,"_source":53,"_file":6205,"_stem":6206,"_extension":56,"locale":57},"\u002Fpublications\u002F2020\u002Fan-accurate-fpga-online-delay-monitor-supporting-all-timing-paths","An Accurate FPGA Online Delay Monitor Supporting All Timing Paths","Accurate circuit delay measurement is essential for various purposes such as aging detection, health monitoring, and dynamic voltage and frequency scaling. State-of-the-art measurement techniques exhibit several limitations. For example, they are insufficiently informative by only returning binary results on the status of the circuit being normal or abnormal. More importantly, current approaches are not applicable for measuring the delay of timing paths that end with DSPs and BRAMs. To address the issues, we propose a novel online delay monitor (ODM) for modern FPGA platforms that (1) accurately returns the numerical delay values, (2) and is compatible with all types of timing paths in FPGAs. Our proposed ODM is achieved by employing a shadow register triggered by the output signal of a combinational circuit to sample a phase shifting clock. Besides, our design is capable of conveniently measuring the clock jitters, so we are able to propose an associated jitter management scheme to ensure correct ODM sampling. Experimental results show that our ODM achieves an error within 2% with respect to the ground truth.",[5531,6184,5532,5534],"Li, Rui",[5536,6186,5537,5539],"0000-0002-2784-5519","https:\u002F\u002Fdoi.org\u002F10.1109\u002Fiscas45731.2020.9181070","W3091101187",[23,6190,5543,6191,6192,6193,3203,5550,6194,6195,4242,179,288],"Jitter","Static timing analysis","Delay calculation","Synchronization (alternating current)","Electronic engineering","Propagation delay",{"type":39,"children":6197,"toc":6202},[6198],{"type":42,"tag":43,"props":6199,"children":6200},{},[6201],{"type":47,"value":6182},{"title":8,"searchDepth":49,"depth":49,"links":6203},[],"content:publications:2020:an-accurate-fpga-online-delay-monitor-supporting-all-timing-paths.md","publications\u002F2020\u002Fan-accurate-fpga-online-delay-monitor-supporting-all-timing-paths.md","publications\u002F2020\u002Fan-accurate-fpga-online-delay-monitor-supporting-all-timing-paths",{"_path":6208,"_dir":5985,"_draft":7,"_partial":7,"_locale":8,"title":6209,"description":6210,"_hidden":7,"authors":6211,"authors_orcid":6214,"year":5992,"doi":6217,"openalex_id":6218,"venue":1215,"abstract_screenshot":21,"keywords":6219,"body":6226,"_type":51,"_id":6234,"_source":53,"_file":6235,"_stem":6236,"_extension":56,"locale":57},"\u002Fpublications\u002F2020\u002Fan-empirical-comparison-of-commercial-and-open-source-web-vulnerability-scanners","An empirical comparison of commercial and open‐source web vulnerability scanners","Summary Web vulnerability scanners (WVSs) are tools that can detect security vulnerabilities in web services. Although both commercial and open‐source WVSs exist, their vulnerability detection capability and performance vary. In this article, we report on a comparative study to determine the vulnerability detection capabilities of eight WVSs (both open and commercial) using two vulnerable web applications: WebGoat and Damn vulnerable web application. The eight WVSs studied were: Acunetix; HP WebInspect; IBM AppScan; OWASP ZAP; Skipfish; Arachni; Vega; and Iron WASP. The performance was evaluated using multiple evaluation metrics: precision; recall; Youden index; OWASP web benchmark evaluation; and the web application security scanner evaluation criteria. The experimental results show that, while the commercial scanners are effective in detecting security vulnerabilities, some open‐source scanners (such as ZAP and Skipfish) can also be effective. In summary, this study recommends improving the vulnerability detection capabilities of both the open‐source and commercial scanners to enhance code coverage and the detection rate, and to reduce the number of false‐positives.",[6212,648,6213,595],"Amankwah, Richard","Kudjo, Patrick Kwaku",[6215,651,6216,599],"0000-0003-4367-4593","0000-0002-8145-6530","https:\u002F\u002Fdoi.org\u002F10.1002\u002Fspe.2870","W3039344911",[23,1107,6220,6221,180,209,6222,1407,1109,6223,3848,6224,6225,869,1106,3815,3817,1112,139,1113,37,289],"Open source","Vulnerability assessment","False positive paradox","Vulnerability management","IBM","Application security",{"type":39,"children":6227,"toc":6232},[6228],{"type":42,"tag":43,"props":6229,"children":6230},{},[6231],{"type":47,"value":6210},{"title":8,"searchDepth":49,"depth":49,"links":6233},[],"content:publications:2020:an-empirical-comparison-of-commercial-and-open-source-web-vulnerability-scanners.md","publications\u002F2020\u002Fan-empirical-comparison-of-commercial-and-open-source-web-vulnerability-scanners.md","publications\u002F2020\u002Fan-empirical-comparison-of-commercial-and-open-source-web-vulnerability-scanners",{"_path":6238,"_dir":5985,"_draft":7,"_partial":7,"_locale":8,"title":6239,"description":6240,"_hidden":7,"authors":6241,"authors_orcid":6244,"year":5992,"doi":6246,"openalex_id":6247,"venue":21,"abstract_screenshot":21,"keywords":6248,"body":6250,"_type":51,"_id":6258,"_source":53,"_file":6259,"_stem":6260,"_extension":56,"locale":57},"\u002Fpublications\u002F2020\u002Fan-improved-fuzzing-approach-based-on-adaptive-random-testing","An improved fuzzing approach based on adaptive random testing","Fuzzing is a highly automated testing technique. It has been widely used in software vulnerability mining. American fuzzy lop (AFL) is one of the most effective fuzzing tools, with low resource consumption and a variety of efficient fuzzy test strategies. However, because it uses a random testing (RT) algorithm when generating test cases, there is a problem of low quality and low test efficiency. In this paper, we propose an improved fuzzing testing approach based on adaptive random testing (ART) to enhance the effectiveness of AFL test case generation. We also introduce AFL-ART, a new fuzzing tool based on ART. According to the experimental results, AFLART can enhance AFL test case generation, and improve fuzzing testing efficiency.",[648,6242,6243,595],"Chen, Jingyi","Guo, Dong",[651,6245,21,599],"0000-0003-2668-6592","https:\u002F\u002Fdoi.org\u002F10.1109\u002Fissrew51248.2020.00045","W3119380829",[1110,1163,23,606,6249,1221,215,658,139,661,37,179,110],"Fuzzy logic",{"type":39,"children":6251,"toc":6256},[6252],{"type":42,"tag":43,"props":6253,"children":6254},{},[6255],{"type":47,"value":6240},{"title":8,"searchDepth":49,"depth":49,"links":6257},[],"content:publications:2020:an-improved-fuzzing-approach-based-on-adaptive-random-testing.md","publications\u002F2020\u002Fan-improved-fuzzing-approach-based-on-adaptive-random-testing.md","publications\u002F2020\u002Fan-improved-fuzzing-approach-based-on-adaptive-random-testing",{"_path":6262,"_dir":5985,"_draft":7,"_partial":7,"_locale":8,"title":6263,"description":6264,"_hidden":7,"authors":6265,"authors_orcid":6269,"year":5992,"doi":6270,"openalex_id":6271,"venue":21,"abstract_screenshot":21,"keywords":6272,"body":6273,"_type":51,"_id":6281,"_source":53,"_file":6282,"_stem":6283,"_extension":56,"locale":57},"\u002Fpublications\u002F2020\u002Farcametes","ARCAMETES","In its simplest form, software testing consists of creating test cases from a defined input space, running them in the system-under-test (SUT), and evaluating the outputs with a mechanism for determining success or failure (i.e. an oracle). Metamorphic testing (MT) provides powerful concepts for alleviating the problem of a lack of oracles. To increase the adoption of MT among industry practitioners, approaches and tools that lower the effort to identify potential metamorphic relations (MRs) are very much in demand. As such, we propose a learning-based approach to MR discovery and exploration using concepts of metamorphic testing, association rule learning, and combinatorial testing. The results have implications for numerous applications including software testing and program comprehension, among others. These implications set a strong foundation for a future, extensible metamorphic exploration framework.",[6266,6267,6268,595,1156],"Jarman, Darryl","Smith, Riley","Johnston, Owen",[21,21,21,599,1158],"https:\u002F\u002Fdoi.org\u002F10.1145\u002F3387940.3391482","W3088042539",[23],{"type":39,"children":6274,"toc":6279},[6275],{"type":42,"tag":43,"props":6276,"children":6277},{},[6278],{"type":47,"value":6264},{"title":8,"searchDepth":49,"depth":49,"links":6280},[],"content:publications:2020:arcametes.md","publications\u002F2020\u002Farcametes.md","publications\u002F2020\u002Farcametes",{"_path":6285,"_dir":5985,"_draft":7,"_partial":7,"_locale":8,"title":6286,"description":8,"_hidden":7,"authors":6287,"authors_orcid":6292,"year":5992,"doi":6294,"openalex_id":6295,"venue":687,"abstract_screenshot":21,"keywords":6296,"body":6301,"_type":51,"_id":6305,"_source":53,"_file":6306,"_stem":6307,"_extension":56,"locale":57},"\u002Fpublications\u002F2020\u002Fblockchain-federation-enabled-trustable-internet-of-things","Blockchain Federation Enabled Trustable Internet of Things",[6288,6289,268,6290,6291],"Wan, Zhitao","Cai, Minqiang","Yang, Jinqing","Lin, Xianghua",[21,21,272,6293,21],"0000-0001-5706-6914","https:\u002F\u002Fdoi.org\u002F10.1007\u002F978-3-030-59595-1_5","W3089706162",[5381,23,6297,6298,3227,6299,6300,180,249,869,4991],"Interoperability","Scalability","Internet of Things","Architecture",{"type":39,"children":6302,"toc":6303},[],{"title":8,"searchDepth":49,"depth":49,"links":6304},[],"content:publications:2020:blockchain-federation-enabled-trustable-internet-of-things.md","publications\u002F2020\u002Fblockchain-federation-enabled-trustable-internet-of-things.md","publications\u002F2020\u002Fblockchain-federation-enabled-trustable-internet-of-things",{"_path":6309,"_dir":5985,"_draft":7,"_partial":7,"_locale":8,"title":6310,"description":6311,"_hidden":7,"authors":6312,"authors_orcid":6313,"year":5992,"doi":6314,"openalex_id":6315,"venue":21,"abstract_screenshot":21,"keywords":6316,"body":6320,"_type":51,"_id":6328,"_source":53,"_file":6329,"_stem":6330,"_extension":56,"locale":57},"\u002Fpublications\u002F2020\u002Fblockchain-future-facilitator-of-asset-information-modelling-and-management","Blockchain: Future Facilitator of Asset Information Modelling and Management?","Recently, businesses and government bodies in the Architecture, Engineering, and Construction (AEC) sector have faced a key challenge to the delivery of effective project outcomes. Asset Information Modelling (AIM) is a process aimed to serve the asset process once the project is handed over. Considering that Blockchain is a new data management technology that is intended to provide security within a decentralized culture, this could be the foundation for improving asset processes. The research is achieved through a systematic review of the relevant literature. Several studies have been identified in Building Information Modelling (BIM) and Blockchain in the construction domain. However, there is little research conducted in the context of Asset Management Processes (AMP). Skilled people are the main challenge for AIM and Blockchain: findings show that a lack of technological awareness and its link to the adoption of using AIM and Blockchain in the asset management life cycle is the main problem.",[6040,6041,6042,6043,595],[21,6045,6046,6047,599],"https:\u002F\u002Fdoi.org\u002F10.1109\u002Fcompsac48688.2020.0-199","W3088217273",[244,5381,4647,133,629,6317,6318,4774,6319,135,170,23,178,180,429],"Facilitator","IT asset management","Key (lock)",{"type":39,"children":6321,"toc":6326},[6322],{"type":42,"tag":43,"props":6323,"children":6324},{},[6325],{"type":47,"value":6311},{"title":8,"searchDepth":49,"depth":49,"links":6327},[],"content:publications:2020:blockchain-future-facilitator-of-asset-information-modelling-and-management.md","publications\u002F2020\u002Fblockchain-future-facilitator-of-asset-information-modelling-and-management.md","publications\u002F2020\u002Fblockchain-future-facilitator-of-asset-information-modelling-and-management",{"_path":6332,"_dir":5985,"_draft":7,"_partial":7,"_locale":8,"title":6333,"description":8,"_hidden":7,"Engagement? A Comparative Study of Two Approaches authors":6334,"authors_orcid":6338,"year":5992,"doi":6342,"openalex_id":6343,"venue":6344,"abstract_screenshot":21,"keywords":6345,"body":6348,"_type":51,"_id":6352,"_source":53,"_file":6353,"_stem":6354,"_extension":56,"locale":57},"\u002Fpublications\u002F2020\u002Fcan-clicker-technology-and-the-latest-online-response-systems-enhance-student-en","Can Clicker Technology and the Latest Online Response Systems Enhance Student",[6335,6336,6337,595,4822],"Lamb, Doran","Knowles, Lauren","Rattadilok, Prapa",[6339,6340,6341,599,4827],"0009-0008-6221-2451","0000-0003-0949-1582","0000-0001-9802-6812","https:\u002F\u002Fdoi.org\u002F10.1007\u002F978-981-15-3142-2_22","W3024523859","Lecture notes in educational technology",[6346,6347,866,23,3903,867,865,1379,380],"Clicker","Student engagement",{"type":39,"children":6349,"toc":6350},[],{"title":8,"searchDepth":49,"depth":49,"links":6351},[],"content:publications:2020:can-clicker-technology-and-the-latest-online-response-systems-enhance-student-en.md","publications\u002F2020\u002Fcan-clicker-technology-and-the-latest-online-response-systems-enhance-student-en.md","publications\u002F2020\u002Fcan-clicker-technology-and-the-latest-online-response-systems-enhance-student-en",{"_path":6356,"_dir":5985,"_draft":7,"_partial":7,"_locale":8,"title":6357,"description":6358,"_hidden":7,"Assessment Tools\" authors":6359,"authors_orcid":6368,"year":5992,"doi":6374,"openalex_id":6375,"venue":21,"abstract_screenshot":21,"keywords":6376,"body":6382,"_type":51,"_id":6390,"_source":53,"_file":6391,"_stem":6392,"_extension":56,"locale":57},"\u002Fpublications\u002F2020\u002Fchocslat-chinese-healthcare-oriented-computerised-speech-amp-language-assessment","CHOCSLAT: Chinese Healthcare-Oriented Computerised Speech & Languag","This paper describes an on-going project to develop diagnostic profiling tools for healthcare professionals to identify potential speech and language developmental problems of Chinese-speaking children. The tools aim to provide a technical advance in helping children who may have speech impairment or language delay. The project is currently being carried out as a collaboration with Chinese healthcare professionals, and a multidisciplinary team including applied linguists, speech and language pathologists, and computer scientists (staff and students) at the first Sino-foreign higher education institution in China, University of Nottingham Ningbo China (UNNC). The paper presents the background, development, and current state of the project. Challenges to project completion, including difficulties encountered due to the Covid-19 outbreak and subsequent world-wide emergency and lock-down are also discussed.",[595,6360,6361,6362,6363,6364,6365,6366,6367],"Jin, Lixian","Hua, Zhu","Zhu, Jiaye","Feng, Kangming","Geng, Huili","Lü, Jing","Yu, Tianyi","Wang, Yu",[599,6369,6370,21,21,21,6371,6372,6373],"0000-0001-9441-4391","0000-0003-1500-3047","0000-0002-1684-9258","0000-0003-0859-0749","0000-0003-1606-6795","https:\u002F\u002Fdoi.org\u002F10.1109\u002Fcompsac48688.2020.00-49","W3088215428",[5896,282,23,6377,4413,6378,3903,6379,6380,6381,865,380,866,1358],"Speech-Language Pathology","Foreign language","Health professionals","Profiling (computer programming)","EXPOSE",{"type":39,"children":6383,"toc":6388},[6384],{"type":42,"tag":43,"props":6385,"children":6386},{},[6387],{"type":47,"value":6358},{"title":8,"searchDepth":49,"depth":49,"links":6389},[],"content:publications:2020:chocslat-chinese-healthcare-oriented-computerised-speech-amp-language-assessment.md","publications\u002F2020\u002Fchocslat-chinese-healthcare-oriented-computerised-speech-amp-language-assessment.md","publications\u002F2020\u002Fchocslat-chinese-healthcare-oriented-computerised-speech-amp-language-assessment",{"_path":6394,"_dir":5985,"_draft":7,"_partial":7,"_locale":8,"title":6395,"description":6396,"_hidden":7,"lessons from China and the United States\" authors":6397,"authors_orcid":6400,"year":5992,"doi":6402,"openalex_id":6403,"venue":6404,"abstract_screenshot":6405,"keywords":6406,"body":6414,"_type":51,"_id":6422,"_source":53,"_file":6423,"_stem":6424,"_extension":56,"locale":57},"\u002Fpublications\u002F2020\u002Fcoordinated-multi-sectoral-efforts-needed-to-address-the-covid-19-pandemic-lesso","Coordinated multi-sectoral efforts needed to address the COVID-19 pandemic","The COVID-19 pandemic has caused staggering human and economic costs. We outline four key lessons learned from efforts to address the pandemic in China and the US. First, effective surveillance, reporting, and contact tracing are needed to contain an epidemic at its emergence and to mitigate its impact at a later stage. Second, multi-sectoral efforts to offer incentives for those with no or minor symptoms to seek care and to quarantine themselves are critical, which would need concerted efforts from payers, providers, and public health. Third, sustained and routine prevention efforts involving both the public and the health systems will prove to be useful in times of a pandemic. Fourth, a strong public health system is essential and will be appreciated at times of urgency. Concerted multi-sectoral efforts are required to address COVID-19 pandemic with strong leadership from the public health sector.",[6398,65,6399],"Chen, Zhuo","Yang, Gonghuan",[6401,70,21],"0000-0002-5351-3489","https:\u002F\u002Fdoi.org\u002F10.1186\u002Fs41256-020-00150-7","W3021793005","Global Health Research and Policy","coordinated-multi-sectoral-efforts-needed-to-address-the-covid-19-pandemic-lesso.png",[6407,6408,6409,282,5472,6410,3713,178,4609,1358,380,6411,6412,36,6413],"Pandemic","Public health","Contact tracing","Coronavirus disease 2019 (COVID-19)","Infectious disease (medical specialty)","Disease","Nursing",{"type":39,"children":6415,"toc":6420},[6416],{"type":42,"tag":43,"props":6417,"children":6418},{},[6419],{"type":47,"value":6396},{"title":8,"searchDepth":49,"depth":49,"links":6421},[],"content:publications:2020:coordinated-multi-sectoral-efforts-needed-to-address-the-covid-19-pandemic-lesso.md","publications\u002F2020\u002Fcoordinated-multi-sectoral-efforts-needed-to-address-the-covid-19-pandemic-lesso.md","publications\u002F2020\u002Fcoordinated-multi-sectoral-efforts-needed-to-address-the-covid-19-pandemic-lesso",{"_path":6426,"_dir":5985,"_draft":7,"_partial":7,"_locale":8,"title":6427,"description":6428,"_hidden":7,"Coverage and Fault Detection\" authors":6429,"authors_orcid":6433,"year":5992,"doi":6438,"openalex_id":6439,"venue":6440,"abstract_screenshot":21,"keywords":6441,"body":6444,"_type":51,"_id":6452,"_source":53,"_file":6453,"_stem":6454,"_extension":56,"locale":57},"\u002Fpublications\u002F2020\u002Fcovering-array-constructors-an-experimental-analysis-of-their-interaction-covera","Covering Array Constructors: An Experimental Analysis of Their Interactio","Abstract Combinatorial interaction testing (CIT) aims at constructing a covering array (CA) of all value combinations at a specific interaction strength, to detect faults that are caused by the interaction of parameters. CIT has been widely used in different applications, with many algorithms and tools having been proposed to support CA construction. To date, however, there appears to have been no studies comparing different CA constructors when only some of the CA test cases are executed. In this paper, we present an investigation of five popular CA constructors: ACTS, Jenny, PICT, CASA and TCA. We conducted empirical studies examining the five programs, focusing on interaction coverage and fault detection. The experimental results show that when there is no preference or special justification for using other CA constructors, then Jenny is recommended—because it achieves better interaction coverage and fault detection than the other four constructors in many cases. Our results also show that when using ACTS or CASA, their CAs must be prioritized before testing. The main reason for this is that these CAs can result in considerable interaction coverage or fault detection capabilities when executing a large number of test cases; however, they may also produce the lowest rates of fault detection and interaction coverage.",[645,5250,3922,596,595,6430,6431,6432,648],"Lau, Man Fai","Ng, Sebastian","Merkel, Robert",[650,6434,21,600,599,6435,6436,6437,651],"0000-0002-3284-9143","0000-0002-2271-6259","0000-0002-2074-6673","0000-0002-0658-9800","https:\u002F\u002Fdoi.org\u002F10.1093\u002Fcomjnl\u002Fbxaa020","W3020749904","The Computer Journal",[23,3175,6442,3442,332,181,37,34,3666,3789,6443],"Preference","Seismology",{"type":39,"children":6445,"toc":6450},[6446],{"type":42,"tag":43,"props":6447,"children":6448},{},[6449],{"type":47,"value":6428},{"title":8,"searchDepth":49,"depth":49,"links":6451},[],"content:publications:2020:covering-array-constructors-an-experimental-analysis-of-their-interaction-covera.md","publications\u002F2020\u002Fcovering-array-constructors-an-experimental-analysis-of-their-interaction-covera.md","publications\u002F2020\u002Fcovering-array-constructors-an-experimental-analysis-of-their-interaction-covera",{"_path":6456,"_dir":5985,"_draft":7,"_partial":7,"_locale":8,"title":6457,"description":6458,"_hidden":7,"authors":6459,"authors_orcid":6460,"year":5992,"doi":6461,"openalex_id":6462,"venue":21,"abstract_screenshot":21,"keywords":6463,"body":6466,"_type":51,"_id":6474,"_source":53,"_file":6475,"_stem":6476,"_extension":56,"locale":57},"\u002Fpublications\u002F2020\u002Fdata-driven-agent-based-model-of-intra-urban-activities","Data-Driven Agent-Based Model of Intra-Urban Activities","We propose an agent-based model (ABM) to simulate city-scale intra-urban activities and movements. We calibrate the ABM for New York City, using NYC Open Data trip diaries and taxi journeys. Model validation demonstrates that the ABM is able to accurately predict activity demand across the city. Further, when a new hospital wing is opened in Queens, a central district of New York City, the ABM is shown to accurately predict increased shopping demand on Staten Island, an isolated area located at the edge of the city. This demonstrates the value of applying ABM to simulate intra-urban movements and activities, offering dynamic scenario testing that is not available in many other forms of modelling.",[4662,4306,12,4663,4664,4665],[4667,4308,15,4668,4669,4670],"https:\u002F\u002Fdoi.org\u002F10.1109\u002Ficbda49040.2020.9101327","W3004773698",[23,6464,4265,6465,5353,454,984,37,289,179,215,4051],"Agent-based model","Enhanced Data Rates for GSM Evolution",{"type":39,"children":6467,"toc":6472},[6468],{"type":42,"tag":43,"props":6469,"children":6470},{},[6471],{"type":47,"value":6458},{"title":8,"searchDepth":49,"depth":49,"links":6473},[],"content:publications:2020:data-driven-agent-based-model-of-intra-urban-activities.md","publications\u002F2020\u002Fdata-driven-agent-based-model-of-intra-urban-activities.md","publications\u002F2020\u002Fdata-driven-agent-based-model-of-intra-urban-activities",{"_path":6478,"_dir":5985,"_draft":7,"_partial":7,"_locale":8,"title":6479,"description":6480,"_hidden":7,"authors":6481,"authors_orcid":6484,"year":5992,"doi":6486,"openalex_id":6487,"venue":21,"abstract_screenshot":21,"keywords":6488,"body":6491,"_type":51,"_id":6499,"_source":53,"_file":6500,"_stem":6501,"_extension":56,"locale":57},"\u002Fpublications\u002F2020\u002Fdata-driven-regular-expressions-evolution-for-medical-text-classification-using","Data-Driven Regular Expressions Evolution for Medical Text Classification Using Genetic Programming","In medical fields, text classification is one of the most important tasks that can significantly reduce human work-load through structured information digitization and intelligent decision support. Despite the popularity of learning-based text classification techniques, it is hard for human to understand or manually fine-tune the classification for better precision and recall, due to the black box nature of learning. This study proposes a novel regular expression-based text classification method making use of genetic programming (GP) approaches to evolve regular expressions that can classify a given medical text inquiry with satisfaction. Given a seed population of regular expressions (randomly initialized or manually constructed by experts), our method evolves a population of regular expressions, using a novel regular expression syntax and a series of carefully chosen reproduction operators. Our method is evaluated with real-life medical text inquiries from an online healthcare provider and shows promising performance. More importantly, our method generates classifiers that can be fully understood, checked and updated by medical doctors, which are fundamentally crucial for medical related practices.",[6482,12,5816,5818,5817,6483],"Liu, Jiandong","Liu, Daoyun",[6485,15,5821,21,5822,21],"0000-0002-0095-6411","https:\u002F\u002Fdoi.org\u002F10.1109\u002Fcec48606.2020.9185500","W3083541244",[23,5826,97,37,6489,952,215,860,6490,4479],"Precision and recall","Syntax",{"type":39,"children":6492,"toc":6497},[6493],{"type":42,"tag":43,"props":6494,"children":6495},{},[6496],{"type":47,"value":6480},{"title":8,"searchDepth":49,"depth":49,"links":6498},[],"content:publications:2020:data-driven-regular-expressions-evolution-for-medical-text-classification-using.md","publications\u002F2020\u002Fdata-driven-regular-expressions-evolution-for-medical-text-classification-using.md","publications\u002F2020\u002Fdata-driven-regular-expressions-evolution-for-medical-text-classification-using",{"_path":6503,"_dir":5985,"_draft":7,"_partial":7,"_locale":8,"title":6504,"description":6505,"_hidden":7,"authors":6506,"authors_orcid":6507,"year":5992,"doi":6508,"openalex_id":6509,"venue":5512,"abstract_screenshot":21,"keywords":6510,"body":6515,"_type":51,"_id":6523,"_source":53,"_file":6524,"_stem":6525,"_extension":56,"locale":57},"\u002Fpublications\u002F2020\u002Fdeveloping-a-pedagogical-photoreal-virtual-environment-to-teach-civil-engineerin","Developing a pedagogical photoreal virtual environment to teach civil engineering","Purpose It is possible for civil engineering (CE) students to graduate from a degree programme without gaining experience on a construction site. The implementation of virtual field trips using virtual reality (VR) in CE education is a development that can address this phenomenon and help facilitate the consolidation of abstract theories into tangible competences. This project aims to solve a fundamental CE education problem: once a structure has been completed, it is often impossible to see how it was built; hence, how can you demonstrate the construction process to a student? Design\u002Fmethodology\u002Fapproach This research used the opportunity of a new campus library development to record its construction sequence. This was achieved by visiting the site eight times to take panoramic stereoscopic photos of the construction process. By its nature, using VR as a didactic tool facilitates experiential learning, but this project also incorporates discovery learning and situated cognition to develop students’ understanding of the construction process. Findings The use of VR in education is becoming increasingly common, but the explicit pedagogy used in these environments is rarely obvious or stated. This project draws upon current VR education discussions and explores the development of a VR environment with a pedagogical context. Originality\u002Fvalue The development of the VR resource draws upon the pedagogical frameworks of discovery learning (Bruner, 1961) and situated cognition (Lave and Wenger, 1991). A further unique aspect of this research is the use of stereoscopic cameras to capture the library’s construction over time.",[4822,595,5407,6041,5406,5408],[4827,599,5411,6045,5410,5412],"https:\u002F\u002Fdoi.org\u002F10.1108\u002Fitse-10-2019-0069","W3011723033",[6511,6512,6513,4263,6514,23,133,135,4390,1379,866,1380,868,865,5514,37],"Experiential learning","Situated cognition","Situated","Situated learning",{"type":39,"children":6516,"toc":6521},[6517],{"type":42,"tag":43,"props":6518,"children":6519},{},[6520],{"type":47,"value":6505},{"title":8,"searchDepth":49,"depth":49,"links":6522},[],"content:publications:2020:developing-a-pedagogical-photoreal-virtual-environment-to-teach-civil-engineerin.md","publications\u002F2020\u002Fdeveloping-a-pedagogical-photoreal-virtual-environment-to-teach-civil-engineerin.md","publications\u002F2020\u002Fdeveloping-a-pedagogical-photoreal-virtual-environment-to-teach-civil-engineerin",{"_path":6527,"_dir":5985,"_draft":7,"_partial":7,"_locale":8,"title":6528,"description":6529,"_hidden":7,"authors":6530,"authors_orcid":6533,"year":5992,"doi":6535,"openalex_id":6536,"venue":21,"abstract_screenshot":21,"keywords":6537,"body":6538,"_type":51,"_id":6546,"_source":53,"_file":6547,"_stem":6548,"_extension":56,"locale":57},"\u002Fpublications\u002F2020\u002Fdifference-grouping-and-test-suite-evaluation","Difference Grouping and Test Suite Evaluation","No abstract available.",[6266,6531,6532,595],"Hunt, Scott","Berry, Jeffrey",[21,21,6534,599],"0000-0001-6947-0666","https:\u002F\u002Fdoi.org\u002F10.1145\u002F3387903.3389315","W3086518151",[657,773,23,659,658,215,3789,289],{"type":39,"children":6539,"toc":6544},[6540],{"type":42,"tag":43,"props":6541,"children":6542},{},[6543],{"type":47,"value":6529},{"title":8,"searchDepth":49,"depth":49,"links":6545},[],"content:publications:2020:difference-grouping-and-test-suite-evaluation.md","publications\u002F2020\u002Fdifference-grouping-and-test-suite-evaluation.md","publications\u002F2020\u002Fdifference-grouping-and-test-suite-evaluation",{"_path":6550,"_dir":5985,"_draft":7,"_partial":7,"_locale":8,"title":6551,"description":6552,"_hidden":7,"authors":6553,"authors_orcid":6556,"year":5992,"doi":6559,"openalex_id":6560,"venue":6561,"abstract_screenshot":21,"keywords":6562,"body":6570,"_type":51,"_id":6578,"_source":53,"_file":6579,"_stem":6580,"_extension":56,"locale":57},"\u002Fpublications\u002F2020\u002Fdo-national-cultures-matter-in-the-containment-of-covid-19","Do national cultures matter in the containment of COVID-19?","Purpose This paper empirically investigates how cultural variations in individualism and tightness affected the containment of COVID-19 using data from 54 nations during a 30-day period of government intervention. Design\u002Fmethodology\u002Fapproach The authors utilized the hierarchical regression approach to check the effects of three cultural variables – the individualism measure, taken from Hofstede’s six-dimension national culture index, and the measure of cultural tightness, based on the three tightness–looseness indexes calculated by Irem Uz (2015) and their interaction – on the changes in the prevalence rate (ΔPR) and crude mortality rate (ΔCMR) and case fatality rate (CFR) while controlling for the stringency of government responses to COVID-19, median age and population density. Findings Significant relationships were found between cultural variables and national performance in slowing the spread of the coronavirus, measured by ΔPR, ΔCMR and CFR. After controlling for the stringency of government responses, median age and population density, the authors found that cultural tightness and individualism as well as their interactions remain to be pivotal. Loose and individualistic cultures led to faster increases in PR and CMR and higher CFR. A four-quadrant conceptual framework is developed to categorize and discuss the national differences. Originality\u002Fvalue The paper integrated two constructs – cultural tightness–looseness and individualism–collectivism – to form a theoretical lens to guide the authors’ analyses while using the real-time COVID-19 data as a natural experiment for theorizing and testing. This study’s findings have significant policy implications in government responses, strategic planning, cultural adaptability and policy implementations for the world’s continuous battle against the pandemic.",[65,6554,6555],"Li, Ning","Liu, Li",[70,6557,6558],"0000-0002-2699-4563","0000-0002-7119-010X","https:\u002F\u002Fdoi.org\u002F10.1108\u002Fijssp-07-2020-0334","W3091474810","International Journal of Sociology and Social Policy",[6563,6564,6565,952,6566,6567,1380,870,6568,865,6569,1358,36,3096],"Hofstede's cultural dimensions theory","Individualism","Collectivism","Conceptual framework","Uncertainty avoidance","Demographic economics","Demography",{"type":39,"children":6571,"toc":6576},[6572],{"type":42,"tag":43,"props":6573,"children":6574},{},[6575],{"type":47,"value":6552},{"title":8,"searchDepth":49,"depth":49,"links":6577},[],"content:publications:2020:do-national-cultures-matter-in-the-containment-of-covid-19.md","publications\u002F2020\u002Fdo-national-cultures-matter-in-the-containment-of-covid-19.md","publications\u002F2020\u002Fdo-national-cultures-matter-in-the-containment-of-covid-19",{"_path":6582,"_dir":5985,"_draft":7,"_partial":7,"_locale":8,"title":6583,"description":6584,"_hidden":7,"from Chinese listed firms\" authors":6585,"authors_orcid":6589,"year":5992,"doi":6593,"openalex_id":6594,"venue":6595,"abstract_screenshot":21,"keywords":6596,"body":6601,"_type":51,"_id":6609,"_source":53,"_file":6610,"_stem":6611,"_extension":56,"locale":57},"\u002Fpublications\u002F2020\u002Fdoes-science-industry-cooperation-policy-enhance-corporate-innovation-evidence-f","Does science–industry cooperation policy enhance corporate innovation: Evidenc","Abstract We examine science–industry collaborations by identifying how academician workstations – joint platforms by listed firms and academicians under provincial governments – influence corporate innovation. We discover that academician workstations (i) significantly increase firms’ innovation input, quality and efficiency, even after controlling for endogeneity issues; (ii) primarily promote corporate innovation by attracting more talented human capital rather than through funding support; and (iii) are even more significant among state‐owned companies and large companies. These results indicate that government policies on bridging the gap between star scientists and firms could be an important non‐financial incentive to partially explain China’s rapidly growing capacity for innovation.",[6586,6587,65,6588],"Xu, Rong","Li, Conggang","Fang, Minghao",[6590,6591,70,6592],"0000-0001-5651-4738","0000-0002-6053-9134","0000-0003-0828-3124","https:\u002F\u002Fdoi.org\u002F10.1111\u002Facfi.12717","W3096823323","Accounting and Finance",[6597,282,5472,178,6598,3255,6599,6600,747,3546,36,1443],"Endogeneity","Bridging (networking)","Human capital","Industrial organization",{"type":39,"children":6602,"toc":6607},[6603],{"type":42,"tag":43,"props":6604,"children":6605},{},[6606],{"type":47,"value":6584},{"title":8,"searchDepth":49,"depth":49,"links":6608},[],"content:publications:2020:does-science-industry-cooperation-policy-enhance-corporate-innovation-evidence-f.md","publications\u002F2020\u002Fdoes-science-industry-cooperation-policy-enhance-corporate-innovation-evidence-f.md","publications\u002F2020\u002Fdoes-science-industry-cooperation-policy-enhance-corporate-innovation-evidence-f",{"_path":6613,"_dir":5985,"_draft":7,"_partial":7,"_locale":8,"title":6614,"description":6615,"_hidden":7,"authors":6616,"authors_orcid":6620,"year":5992,"doi":6624,"openalex_id":6625,"venue":6626,"abstract_screenshot":21,"keywords":6627,"body":6634,"_type":51,"_id":6642,"_source":53,"_file":6643,"_stem":6644,"_extension":56,"locale":57},"\u002Fpublications\u002F2020\u002Fdvfs-based-quality-maximization-for-adaptive-applications-with-diminishing-retur","DVFS-Based Quality Maximization for Adaptive Applications With Diminishing Return","Application-level approximate computing exploits inherent resilience of adaptive applications, and trades off application output quality for runtime system resources. Existing methods treat computing quality as the number of clock cycles to execute a task, but they overlook the fact that the quality of many real-life applications exhibit the characteristic of diminishing return as the processor continues executing. The diminishing return of the quality is largely due to the features of iterative processing or successive refinement inherent in those applications. Ignoring it leads to large over-estimation in contemporary quality optimization approaches. In this article, we exploit the application adaptability to achieve quality maximization by taking both system resource constraints and diminishing return of the quality into account. We first reveal that the diminishing return of the quality is inherent in several well-known applications, and suggest an exponential model that accurately captures it. Second, we propose a dynamic frequency scaling (DFS) methodology to optimally decide the processor execution cycles for such applications, in order to maximize the output quality under system energy, timing, and temperature constraints. We transform the DFS problem to an iterative pseudo quadratic programming heuristic that can be efficiently solved. Third, we present a wrapping dynamic voltage scaling (wDVS) methodology to achieve further quality improvement, by judiciously adjusting the supply voltage to provide extra frequency scaling space. Compared to state-of-the-art algorithms, our approach produces at least 19.1 percent quality improvement on all evaluated cases, with negligible execution overhead.",[5532,5534,6617,6618,6619],"Veeravalli, Bharadwaj","Chen, Fupeng","El‐Sayed, Hesham",[5537,5539,6621,6622,6623],"0000-0001-9000-1813","0000-0002-1548-8243","0000-0002-7488-0915","https:\u002F\u002Fdoi.org\u002F10.1109\u002Ftc.2020.2997242","W3028727627","IEEE Transactions on Computers",[23,1034,6628,6629,6630,747,209,6631,31,6632,249,6633],"Frequency scaling","Maximization","Overhead (engineering)","Adaptability","Parallel computing","Voltage",{"type":39,"children":6635,"toc":6640},[6636],{"type":42,"tag":43,"props":6637,"children":6638},{},[6639],{"type":47,"value":6615},{"title":8,"searchDepth":49,"depth":49,"links":6641},[],"content:publications:2020:dvfs-based-quality-maximization-for-adaptive-applications-with-diminishing-retur.md","publications\u002F2020\u002Fdvfs-based-quality-maximization-for-adaptive-applications-with-diminishing-retur.md","publications\u002F2020\u002Fdvfs-based-quality-maximization-for-adaptive-applications-with-diminishing-retur",{"_path":6646,"_dir":5985,"_draft":7,"_partial":7,"_locale":8,"title":6647,"description":6648,"_hidden":7,"in SRAM-based FPGAs authors":6649,"authors_orcid":6650,"year":5992,"doi":6652,"openalex_id":6653,"venue":21,"abstract_screenshot":21,"keywords":6654,"body":6660,"_type":51,"_id":6668,"_source":53,"_file":6669,"_stem":6670,"_extension":56,"locale":57},"\u002Fpublications\u002F2020\u002Fdvfs-based-scrubbing-scheduling-for-reliability-maximization-on-parallel-tasks-i","DVFS-Based Scrubbing Scheduling for Reliability Maximization on Parallel Tasks","To obtain high reliability but avoiding the huge area overhead of traditional triple modular redundancy (TMR) methods in SRAM-based FPGAs, scrubbing based methods reconfigure the configuration memory of each task just before its execution. However, due to the limitation of the FPGA reconfiguration module that can only scrub one task at a time, parallel tasks may leave stringent timing requirements to schedule their scrubbing processes. Thus the scrubbing requests may be either delayed or omitted, leading to a less reliable system. To address this issue, we propose a novel optimal DVFS-based scrubbing algorithm to adjust the execution time of user tasks, thus significantly enhance the chance to schedule scrubbing successfully for parallel tasks. Besides, we develop an approximation algorithm to speed up its optimal version and develop a novel K-Means based method to reduce the memory usage of the algorithm. Compared to the state-of-the-art, experimental results show that our work achieves up to 36.11% improvement on system reliability with comparable algorithm execution time and memory consumption.",[6184,5532,5531,5534],[6651,5537,5536,5539],"0000-0001-8042-0803","https:\u002F\u002Fdoi.org\u002F10.1109\u002Fdac18072.2020.9218574","W3091774643",[23,6655,6656,6657,5543,4242,450,6632,1222,1079,6658,6659,5550,1113,179],"Data scrubbing","Control reconfiguration","Static random-access memory","Reliability (semiconductor)","Triple modular redundancy",{"type":39,"children":6661,"toc":6666},[6662],{"type":42,"tag":43,"props":6663,"children":6664},{},[6665],{"type":47,"value":6648},{"title":8,"searchDepth":49,"depth":49,"links":6667},[],"content:publications:2020:dvfs-based-scrubbing-scheduling-for-reliability-maximization-on-parallel-tasks-i.md","publications\u002F2020\u002Fdvfs-based-scrubbing-scheduling-for-reliability-maximization-on-parallel-tasks-i.md","publications\u002F2020\u002Fdvfs-based-scrubbing-scheduling-for-reliability-maximization-on-parallel-tasks-i",{"_path":6672,"_dir":5985,"_draft":7,"_partial":7,"_locale":8,"title":6673,"description":8,"_hidden":7,"authors":6674,"authors_orcid":6678,"year":5992,"doi":6682,"openalex_id":6683,"venue":6684,"abstract_screenshot":21,"keywords":6685,"body":6689,"_type":51,"_id":6693,"_source":53,"_file":6694,"_stem":6695,"_extension":56,"locale":57},"\u002Fpublications\u002F2020\u002Fforecasting-recovery-rates-on-non-performing-loans-with-machine-learning","Forecasting recovery rates on non-performing loans with machine learning",[4189,6675,6676,6677],"Brigo, Damiano","Gambetti, Paolo","Vrins, Frédéric",[4191,6679,6680,6681],"0000-0003-1636-8654","0000-0001-5169-5736","0000-0003-1941-0416","https:\u002F\u002Fdoi.org\u002F10.1016\u002Fj.ijforecast.2020.06.009","W3084402488","International Journal of Forecasting",[6686,6687,6688,23,215,718,3665,135,37,101,287,429,178,36],"Default","Loan","Debt",{"type":39,"children":6690,"toc":6691},[],{"title":8,"searchDepth":49,"depth":49,"links":6692},[],"content:publications:2020:forecasting-recovery-rates-on-non-performing-loans-with-machine-learning.md","publications\u002F2020\u002Fforecasting-recovery-rates-on-non-performing-loans-with-machine-learning.md","publications\u002F2020\u002Fforecasting-recovery-rates-on-non-performing-loans-with-machine-learning",{"_path":6697,"_dir":5985,"_draft":7,"_partial":7,"_locale":8,"title":6698,"description":8,"_hidden":7,"authors":6699,"authors_orcid":6701,"year":5992,"doi":6702,"openalex_id":6703,"venue":6704,"abstract_screenshot":21,"keywords":6705,"body":6709,"_type":51,"_id":6713,"_source":53,"_file":6714,"_stem":6715,"_extension":56,"locale":57},"\u002Fpublications\u002F2020\u002Fforecasting-stock-market-return-with-nonlinearity-a-genetic-programming-approach","Forecasting stock market return with nonlinearity: a genetic programming approach",[5229,709,6700,12],"Xiong, Xihan",[5231,711,21,15],"https:\u002F\u002Fdoi.org\u002F10.1007\u002Fs12652-020-01762-0","W3006224871","Journal of Ambient Intelligence and Humanized Computing",[97,23,833,6706,835,6707,555,287,6708,36,37,283],"Futures contract","Trading strategy","Computational intelligence",{"type":39,"children":6710,"toc":6711},[],{"title":8,"searchDepth":49,"depth":49,"links":6712},[],"content:publications:2020:forecasting-stock-market-return-with-nonlinearity-a-genetic-programming-approach.md","publications\u002F2020\u002Fforecasting-stock-market-return-with-nonlinearity-a-genetic-programming-approach.md","publications\u002F2020\u002Fforecasting-stock-market-return-with-nonlinearity-a-genetic-programming-approach",{"_path":6717,"_dir":5985,"_draft":7,"_partial":7,"_locale":8,"title":6718,"description":6719,"_hidden":7,"authors":6720,"authors_orcid":6722,"year":5992,"doi":6724,"openalex_id":6725,"venue":6726,"abstract_screenshot":6727,"keywords":6728,"body":6732,"_type":51,"_id":6740,"_source":53,"_file":6741,"_stem":6742,"_extension":56,"locale":57},"\u002Fpublications\u002F2020\u002Ffuzzy-c-means-based-scenario-bundling-for-stochastic-service-network-design","Fuzzy C-means-based scenario bundling for stochastic service network design","Stochastic service network designs with uncertain demand represented by a set of scenarios can be modelled as a large-scale two-stage stochastic mixed-integer program (SMIP). The progressive hedging algorithm (PHA) is a decomposition method for solving the resulting SMIP. The computational performance of the PHA can be greatly enhanced by decomposing according to scenario bundles instead of individual scenarios. At the heart of bundle-based decomposition is the method for grouping the scenarios into bundles. In this paper, we present a fuzzy c-means-based scenario bundling method to address this problem. Rather than full membership of a bundle, which is typically the case in existing scenario bundling strategies such as k-means, a scenario has partial membership in each of the bundles and can be assigned to more than one bundle in our method.",[3324,12,6721,5817],"Landa-Silva, Dario",[3326,15,6723,5822],"0000-0002-9499-6827","https:\u002F\u002Fdoi.org\u002F10.48550\u002Farxiv.2011.09890","W2786787220","arXiv (Cornell University)","fuzzy-c-means-based-scenario-bundling-for-stochastic-service-network-design.png",[6729,6730,101,23,31,6249,240,3335,242,4265,6731,24,34,37,251,36],"Bundle","Decomposition","Decomposition method (queueing theory)",{"type":39,"children":6733,"toc":6738},[6734],{"type":42,"tag":43,"props":6735,"children":6736},{},[6737],{"type":47,"value":6719},{"title":8,"searchDepth":49,"depth":49,"links":6739},[],"content:publications:2020:fuzzy-c-means-based-scenario-bundling-for-stochastic-service-network-design.md","publications\u002F2020\u002Ffuzzy-c-means-based-scenario-bundling-for-stochastic-service-network-design.md","publications\u002F2020\u002Ffuzzy-c-means-based-scenario-bundling-for-stochastic-service-network-design",{"_path":6744,"_dir":5985,"_draft":7,"_partial":7,"_locale":8,"title":6745,"description":8,"_hidden":7,"authors":6746,"authors_orcid":6747,"year":5992,"doi":6748,"openalex_id":6749,"venue":6750,"abstract_screenshot":21,"keywords":6751,"body":6754,"_type":51,"_id":6758,"_source":53,"_file":6759,"_stem":6760,"_extension":56,"locale":57},"\u002Fpublications\u002F2020\u002Fgeographical-and-temporal-huff-model-calibration-using-taxi-trajectory-data","Geographical and temporal huff model calibration using taxi trajectory data",[4662,4306,12,4663,4664,4665],[4667,4308,15,4668,4669,4670],"https:\u002F\u002Fdoi.org\u002F10.1007\u002Fs10707-019-00390-x","W2993258566","GeoInformatica",[6752,6753,287,289,3955,3143,1009,3666,23,4677,24,34,179],"Renting","Ordinary least squares",{"type":39,"children":6755,"toc":6756},[],{"title":8,"searchDepth":49,"depth":49,"links":6757},[],"content:publications:2020:geographical-and-temporal-huff-model-calibration-using-taxi-trajectory-data.md","publications\u002F2020\u002Fgeographical-and-temporal-huff-model-calibration-using-taxi-trajectory-data.md","publications\u002F2020\u002Fgeographical-and-temporal-huff-model-calibration-using-taxi-trajectory-data",{"_path":6762,"_dir":5985,"_draft":7,"_partial":7,"_locale":8,"title":6763,"description":8,"_hidden":7,"China\" authors":6764,"authors_orcid":6769,"year":5992,"doi":6774,"openalex_id":6775,"venue":3631,"abstract_screenshot":21,"keywords":6776,"body":6779,"_type":51,"_id":6783,"_source":53,"_file":6784,"_stem":6785,"_extension":56,"locale":57},"\u002Fpublications\u002F2020\u002Fimpacts-of-pollution-abatement-projects-on-happiness-an-exploratory-study-in-chi","Impacts of pollution abatement projects on happiness: An exploratory study i",[6765,6766,65,6767,6768],"Jin, Zhizhou","Zeng, Saixing","Ma, Hanyang","Sun, Daxin",[6770,6771,70,6772,6773],"0000-0003-3698-2803","0000-0002-8757-479X","0000-0002-8972-7147","0000-0002-7948-0208","https:\u002F\u002Fdoi.org\u002F10.1016\u002Fj.jclepro.2020.122869","W3042669157",[6777,5177,282,3525,3713,36,178,6778,289,865,870],"Happiness","Socioeconomics",{"type":39,"children":6780,"toc":6781},[],{"title":8,"searchDepth":49,"depth":49,"links":6782},[],"content:publications:2020:impacts-of-pollution-abatement-projects-on-happiness-an-exploratory-study-in-chi.md","publications\u002F2020\u002Fimpacts-of-pollution-abatement-projects-on-happiness-an-exploratory-study-in-chi.md","publications\u002F2020\u002Fimpacts-of-pollution-abatement-projects-on-happiness-an-exploratory-study-in-chi",{"_path":6787,"_dir":5985,"_draft":7,"_partial":7,"_locale":8,"title":6788,"description":6789,"_hidden":7,"and frequency scaling authors":6790,"authors_orcid":6794,"year":5992,"doi":6797,"openalex_id":6798,"venue":6799,"abstract_screenshot":21,"keywords":6800,"body":6804,"_type":51,"_id":6812,"_source":53,"_file":6813,"_stem":6814,"_extension":56,"locale":57},"\u002Fpublications\u002F2020\u002Foptimizing-energy-efficiency-of-cnn-based-object-detection-with-dynamic-voltage","Optimizing energy efficiency of CNN-based object detection with dynamic voltage","Abstract On the one hand, accelerating convolution neural networks (CNNs) on FPGAs requires ever increasing high energy efficiency in the edge computing paradigm. On the other hand, unlike normal digital algorithms, CNNs maintain their high robustness even with limited timing errors. By taking advantage of this unique feature, we propose to use dynamic voltage and frequency scaling (DVFS) to further optimize the energy efficiency for CNNs. First, we have developed a DVFS framework on FPGAs. Second, we apply the DVFS to SkyNet, a state-of-the-art neural network targeting on object detection. Third, we analyze the impact of DVFS on CNNs in terms of performance, power, energy efficiency and accuracy. Compared to the state-of-the-art, experimental results show that we have achieved 38% improvement in energy efficiency without any loss in accuracy. Results also show that we can achieve 47% improvement in energy efficiency if we allow 0.11% relaxation in accuracy.",[5531,5532,6791,6792,6793,5534],"Zhang, Jiale","Wu, Jiaxuan","Luo, Shaobo",[5536,5537,6795,6796,21,5539],"0000-0003-0688-564X","0000-0003-4585-3907","https:\u002F\u002Fdoi.org\u002F10.1088\u002F1674-4926\u002F41\u002F2\u002F022406","W2995607652","Journal of Semiconductors",[6628,5544,23,353,5545,6801,6633,5543,6802,6803,37,632,4242,928,179,34],"Scaling","Convolution (computer science)","Energy (signal processing)",{"type":39,"children":6805,"toc":6810},[6806],{"type":42,"tag":43,"props":6807,"children":6808},{},[6809],{"type":47,"value":6789},{"title":8,"searchDepth":49,"depth":49,"links":6811},[],"content:publications:2020:optimizing-energy-efficiency-of-cnn-based-object-detection-with-dynamic-voltage.md","publications\u002F2020\u002Foptimizing-energy-efficiency-of-cnn-based-object-detection-with-dynamic-voltage.md","publications\u002F2020\u002Foptimizing-energy-efficiency-of-cnn-based-object-detection-with-dynamic-voltage",{"_path":6816,"_dir":5985,"_draft":7,"_partial":7,"_locale":8,"title":6817,"description":6818,"_hidden":7,"Testing?\" authors":6819,"authors_orcid":6821,"year":5992,"doi":6823,"openalex_id":6824,"venue":21,"abstract_screenshot":21,"keywords":6825,"body":6832,"_type":51,"_id":6840,"_source":53,"_file":6841,"_stem":6842,"_extension":56,"locale":57},"\u002Fpublications\u002F2020\u002Fposter-is-euclidean-distance-the-best-distance-measurement-for-adaptive-random-t","Poster: Is Euclidean Distance the best Distance Measurement for Adaptive Rando","Adaptive random testing (ART) aims at enhancing the testing effectiveness of random testing (RT) by more evenly spreading test cases over the input domain. Many ART methods have been proposed, based on various, different notions. For example, distance-based ART (DART) makes use of the concept of distance to implement ART, attempting to generate new test cases that are far away from previously executed ones. The Euclidean distance has been a popular choice of distance metric, used in DART to evaluate the differences between test cases. However, is the Euclidean distance the most suitable choice for DART? To answer this question, we conducted a series of simulations to investigate the impact that the Euclidean distance, and its many variations, has on the testing effectiveness of DART. The results show that when the dimensionality of the input domain is low, the Euclidean distance may indeed be a good choice. However, when the dimensionality is high, it appears to be less suitable.",[645,6820,5049,595],"Cui, Chenhui",[650,6822,5051,599],"0009-0004-8746-316X","https:\u002F\u002Fdoi.org\u002F10.1109\u002Ficst46399.2020.00049","W3048108174",[6826,6827,6828,1163,23,1008,6829,6830,5793,1167,37,332,34,658,215,3666,6831,3393],"Euclidean distance","Curse of dimensionality","Distance measures","Distance correlation","Euclidean distance matrix","Random variable",{"type":39,"children":6833,"toc":6838},[6834],{"type":42,"tag":43,"props":6835,"children":6836},{},[6837],{"type":47,"value":6818},{"title":8,"searchDepth":49,"depth":49,"links":6839},[],"content:publications:2020:poster-is-euclidean-distance-the-best-distance-measurement-for-adaptive-random-t.md","publications\u002F2020\u002Fposter-is-euclidean-distance-the-best-distance-measurement-for-adaptive-random-t.md","publications\u002F2020\u002Fposter-is-euclidean-distance-the-best-distance-measurement-for-adaptive-random-t",{"_path":6844,"_dir":5985,"_draft":7,"_partial":7,"_locale":8,"title":6845,"description":6846,"_hidden":7,"authors":6847,"authors_orcid":6848,"year":5992,"doi":6849,"openalex_id":6850,"venue":21,"abstract_screenshot":21,"keywords":6851,"body":6854,"_type":51,"_id":6862,"_source":53,"_file":6863,"_stem":6864,"_extension":56,"locale":57},"\u002Fpublications\u002F2020\u002Fprogram-slicing-and-execution-tracing-for-differential-testing-at-adobe-analytic","Program Slicing and Execution Tracing for Differential Testing at Adobe Analytics","This paper reports on the use of program slicing concepts and partial execution tracing at Adobe Analytics to address a major limitation of differential testing --- namely, how to deal with the large numbers of differences typically produced by this regression testing technique. Manual verification, typically used to verify detected differences, is tedious, time-consuming and error-prone. This severely limits the volume of testing that can be done and thereby reduces adoption of differential testing. It is hoped that, by sharing this experience, researchers with expertise in program slicing might be motivated to help solve some of the issues and limitations encountered during this novel application of slicing to a real-world industrial problem.",[6266,6531,595],[21,21,599],"https:\u002F\u002Fdoi.org\u002F10.1145\u002F3387904.3389292","W3085428999",[23,4217,6852,690,4215,4989,110,6853,4991,867],"Tracing","Computer graphics (images)",{"type":39,"children":6855,"toc":6860},[6856],{"type":42,"tag":43,"props":6857,"children":6858},{},[6859],{"type":47,"value":6846},{"title":8,"searchDepth":49,"depth":49,"links":6861},[],"content:publications:2020:program-slicing-and-execution-tracing-for-differential-testing-at-adobe-analytic.md","publications\u002F2020\u002Fprogram-slicing-and-execution-tracing-for-differential-testing-at-adobe-analytic.md","publications\u002F2020\u002Fprogram-slicing-and-execution-tracing-for-differential-testing-at-adobe-analytic",{"_path":6866,"_dir":5985,"_draft":7,"_partial":7,"_locale":8,"title":6867,"description":6868,"_hidden":7,"Smart Vehicles authors":6869,"authors_orcid":6870,"year":5992,"doi":6871,"openalex_id":6872,"venue":6873,"abstract_screenshot":21,"keywords":6874,"body":6877,"_type":51,"_id":6885,"_source":53,"_file":6886,"_stem":6887,"_extension":56,"locale":57},"\u002Fpublications\u002F2020\u002Fquality-estimation-and-optimization-of-adaptive-stereo-matching-algorithms-for-s","Quality Estimation and Optimization of Adaptive Stereo Matching Algorithms for","Stereo matching is a promising approach for smart vehicles to find the depth of nearby objects. Transforming a traditional stereo matching algorithm to its adaptive version has potential advantages to achieve the maximum quality (depth accuracy) in a best-effort manner. However, it is very challenging to support this adaptive feature, since (1) the internal mechanism of adaptive stereo matching (ASM) has to be accurately modeled, and (2) scheduling ASM tasks on multiprocessors to generate the maximum quality is difficult under strict real-time constraints of smart vehicles. In this article, we propose a framework for constructing an ASM application and optimizing its output quality on smart vehicles. First, we empirically convert stereo matching into ASM by exploiting its inherent characteristics of disparity–cycle correspondence and introduce an exponential quality model that accurately represents the quality–cycle relationship. Second, with the explicit quality model, we propose an efficient quadratic programming-based dynamic voltage\u002Ffrequency scaling (DVFS) algorithm to decide the optimal operating strategy, which maximizes the output quality under timing, energy, and temperature constraints. Third, we propose two novel methods to efficiently estimate the parameters of the quality model, namely location similarity-based feature point thresholding and street scenario-confined CNN prediction. Results show that our DVFS algorithm achieves at least 1.61 times quality improvement compared to the state-of-the-art techniques, and average parameter estimation for the quality model achieves 96.35% accuracy on the straight road.",[6618,5532,5534],[6622,5537,5539],"https:\u002F\u002Fdoi.org\u002F10.1145\u002F3372784","W2995463625","ACM Transactions on Embedded Computing Systems",[23,332,450,6875,6876,37,31],"Feature (linguistics)","Matching (statistics)",{"type":39,"children":6878,"toc":6883},[6879],{"type":42,"tag":43,"props":6880,"children":6881},{},[6882],{"type":47,"value":6868},{"title":8,"searchDepth":49,"depth":49,"links":6884},[],"content:publications:2020:quality-estimation-and-optimization-of-adaptive-stereo-matching-algorithms-for-s.md","publications\u002F2020\u002Fquality-estimation-and-optimization-of-adaptive-stereo-matching-algorithms-for-s.md","publications\u002F2020\u002Fquality-estimation-and-optimization-of-adaptive-stereo-matching-algorithms-for-s",{"_path":6889,"_dir":5985,"_draft":7,"_partial":7,"_locale":8,"title":6890,"description":8,"_hidden":7,"authors":6891,"authors_orcid":6892,"year":5992,"doi":6893,"openalex_id":6894,"venue":770,"abstract_screenshot":21,"keywords":6895,"body":6898,"_type":51,"_id":6902,"_source":53,"_file":6903,"_stem":6904,"_extension":56,"locale":57},"\u002Fpublications\u002F2020\u002Fregression-test-case-prioritization-by-code-combinations-coverage","Regression test case prioritization by code combinations coverage",[645,4533,595,5049,648],[650,4536,599,5051,651],"https:\u002F\u002Fdoi.org\u002F10.1016\u002Fj.jss.2020.110712","W3038808621",[6896,1164,656,23,1221,6897,1405,181,661,215,139,179,110,180,3983],"RTP Control Protocol","Leverage (statistics)",{"type":39,"children":6899,"toc":6900},[],{"title":8,"searchDepth":49,"depth":49,"links":6901},[],"content:publications:2020:regression-test-case-prioritization-by-code-combinations-coverage.md","publications\u002F2020\u002Fregression-test-case-prioritization-by-code-combinations-coverage.md","publications\u002F2020\u002Fregression-test-case-prioritization-by-code-combinations-coverage",{"_path":6906,"_dir":5985,"_draft":7,"_partial":7,"_locale":8,"title":6907,"description":8,"_hidden":7,"authors":6908,"authors_orcid":6913,"year":5992,"doi":6917,"openalex_id":6918,"venue":6919,"abstract_screenshot":21,"keywords":6920,"body":6930,"_type":51,"_id":6934,"_source":53,"_file":6935,"_stem":6936,"_extension":56,"locale":57},"\u002Fpublications\u002F2020\u002Fretraction-the-other-face-of-research-collaboration","Retraction: The “Other Face” of Research Collaboration?",[6909,6910,6911,6912,65],"Tang, Li","Hu, Guangyuan","Sui, Yang","Yang, Yuhan",[6914,6915,21,6916,70],"0000-0003-4971-6192","0000-0001-9880-1065","0000-0002-7080-8457","https:\u002F\u002Fdoi.org\u002F10.1007\u002Fs11948-020-00209-1","W3013581766","Science and Engineering Ethics",[3743,6921,282,6922,6923,6924,6925,6926,1358,6927,865,3259,1380,1334,380,179,3096,6928,6929,5153,5949],"Elite","Scientific misconduct","Philosophy of science","Face (sociological concept)","Research integrity","Research ethics","Public relations","Epistemology","Alternative medicine",{"type":39,"children":6931,"toc":6932},[],{"title":8,"searchDepth":49,"depth":49,"links":6933},[],"content:publications:2020:retraction-the-other-face-of-research-collaboration.md","publications\u002F2020\u002Fretraction-the-other-face-of-research-collaboration.md","publications\u002F2020\u002Fretraction-the-other-face-of-research-collaboration",{"_path":6938,"_dir":5985,"_draft":7,"_partial":7,"_locale":8,"title":6939,"description":6940,"_hidden":7,"authors":6941,"authors_orcid":6944,"year":5992,"doi":6947,"openalex_id":6948,"venue":6726,"abstract_screenshot":21,"keywords":6949,"body":6951,"_type":51,"_id":6959,"_source":53,"_file":6960,"_stem":6961,"_extension":56,"locale":57},"\u002Fpublications\u002F2020\u002Fretrieving-and-ranking-short-medical-questions-with-two-stages-neural-matching-m","Retrieving and ranking short medical questions with two stages neural matching model","Internet hospital is a rising business thanks to recent advances in mobile web technology and high demand of health care services. Online medical services become increasingly popular and active. According to US data in 2018, 80 percent of internet users have asked health-related questions online. Numerous data is generated in unprecedented speed and scale. Those representative questions and answers in medical fields are valuable raw data sources for medical data mining. Automated machine interpretation on those sheer amount of data gives an opportunity to assist doctors to answer frequently asked medical-related questions from the perspective of information retrieval and machine learning approaches. In this work, we propose a novel two-stage framework for the semantic matching of query-level medical questions.",[907,6942,5816,12,5817,5818,6943],"Fu, Xinyu","Liu, Gong",[6945,6946,5821,15,5822,21,21],"0000-0002-9851-6376","0000-0003-4178-238X","https:\u002F\u002Fdoi.org\u002F10.48550\u002Farxiv.2012.01254","W3107495100",[23,1108,6876,210,691,3468,6950,869,37,380],"Information retrieval",{"type":39,"children":6952,"toc":6957},[6953],{"type":42,"tag":43,"props":6954,"children":6955},{},[6956],{"type":47,"value":6940},{"title":8,"searchDepth":49,"depth":49,"links":6958},[],"content:publications:2020:retrieving-and-ranking-short-medical-questions-with-two-stages-neural-matching-m.md","publications\u002F2020\u002Fretrieving-and-ranking-short-medical-questions-with-two-stages-neural-matching-m.md","publications\u002F2020\u002Fretrieving-and-ranking-short-medical-questions-with-two-stages-neural-matching-m",{"_path":6963,"_dir":5985,"_draft":7,"_partial":7,"_locale":8,"title":6964,"description":6965,"_hidden":7,"authors":6966,"authors_orcid":6967,"year":5992,"doi":6968,"openalex_id":6969,"venue":3384,"abstract_screenshot":21,"keywords":6970,"body":6981,"_type":51,"_id":6989,"_source":53,"_file":6990,"_stem":6991,"_extension":56,"locale":57},"\u002Fpublications\u002F2020\u002Fsensor-fusion-of-motion-based-sign-language-interpretation-with-deep-learning","Sensor Fusion of Motion-Based Sign Language Interpretation with Deep Learning","Sign language was designed to allow hearing-impaired people to interact with others. Nonetheless, knowledge of sign language is uncommon in society, which leads to a communication barrier with the hearing-impaired community. Many studies of sign language recognition utilizing computer vision (CV) have been conducted worldwide to reduce such barriers. However, this approach is restricted by the visual angle and highly affected by environmental factors. In addition, CV usually involves the use of machine learning, which requires collaboration of a team of experts and utilization of high-cost hardware utilities; this increases the application cost in real-world situations. Thus, this study aims to design and implement a smart wearable American Sign Language (ASL) interpretation system using deep learning, which applies sensor fusion that \"fuses\" six inertial measurement units (IMUs). The IMUs are attached to all fingertips and the back of the hand to recognize sign language gestures; thus, the proposed method is not restricted by the field of view. The study reveals that this model achieves an average recognition rate of 99.81% for dynamic ASL gestures. Moreover, the proposed ASL recognition system can be further integrated with ICT and IoT technology to provide a feasible solution to assist hearing-impaired people in communicating with others and improve their quality of life.",[5667,5666,5665],[5670,21,5669],"https:\u002F\u002Fdoi.org\u002F10.3390\u002Fs20216256","W3096636388",[6971,6972,23,6973,6974,37,6975,6976,5417,868,6977,6978,6979,215,6980,4242],"Sign language","Gesture","Wearable computer","Gesture recognition","Sign (mathematics)","Deep learning","Sensor fusion","Inertial measurement unit","Motion (physics)","Speech recognition",{"type":39,"children":6982,"toc":6987},[6983],{"type":42,"tag":43,"props":6984,"children":6985},{},[6986],{"type":47,"value":6965},{"title":8,"searchDepth":49,"depth":49,"links":6988},[],"content:publications:2020:sensor-fusion-of-motion-based-sign-language-interpretation-with-deep-learning.md","publications\u002F2020\u002Fsensor-fusion-of-motion-based-sign-language-interpretation-with-deep-learning.md","publications\u002F2020\u002Fsensor-fusion-of-motion-based-sign-language-interpretation-with-deep-learning",{"_path":6993,"_dir":5985,"_draft":7,"_partial":7,"_locale":8,"title":6994,"description":8,"_hidden":7,"Challenges\" authors":6995,"authors_orcid":6998,"year":5992,"doi":7001,"openalex_id":7002,"venue":7003,"abstract_screenshot":21,"keywords":7004,"body":7005,"_type":51,"_id":7009,"_source":53,"_file":7010,"_stem":7011,"_extension":56,"locale":57},"\u002Fpublications\u002F2020\u002Fsensor-networks-and-personal-health-data-management-software-engineering-challen","Sensor Networks and Personal Health Data Management: Software Engineerin",[6996,6997,5407,5199,595,5888],"Zhang, X.","Zhang, Jialu",[6999,7000,5411,21,599,5890],"0000-0002-1849-2272","0000-0001-9539-6789","https:\u002F\u002Fdoi.org\u002F10.1007\u002F978-3-030-63092-8_10","W3096062420","Advances in intelligent systems and computing",[23,607],{"type":39,"children":7006,"toc":7007},[],{"title":8,"searchDepth":49,"depth":49,"links":7008},[],"content:publications:2020:sensor-networks-and-personal-health-data-management-software-engineering-challen.md","publications\u002F2020\u002Fsensor-networks-and-personal-health-data-management-software-engineering-challen.md","publications\u002F2020\u002Fsensor-networks-and-personal-health-data-management-software-engineering-challen",{"_path":7013,"_dir":5985,"_draft":7,"_partial":7,"_locale":8,"title":7014,"description":8,"_hidden":7,"authors":7015,"authors_orcid":7016,"year":5992,"doi":7017,"openalex_id":7018,"venue":4311,"abstract_screenshot":21,"keywords":7019,"body":7022,"_type":51,"_id":7026,"_source":53,"_file":7027,"_stem":7028,"_extension":56,"locale":57},"\u002Fpublications\u002F2020\u002Fsoft-clustering-based-scenario-bundling-for-a-progressive-hedging-heuristic-in-s","Soft clustering-based scenario bundling for a progressive hedging heuristic in stochastic service network design",[3324,12,1071,13,6721],[3326,15,1073,16,6723],"https:\u002F\u002Fdoi.org\u002F10.1016\u002Fj.cor.2020.105182","W3111102891",[6729,329,23,3441,7020,218,31,1057,7021,6249,34,181,215,37,3666],"Mixture model","Covariance",{"type":39,"children":7023,"toc":7024},[],{"title":8,"searchDepth":49,"depth":49,"links":7025},[],"content:publications:2020:soft-clustering-based-scenario-bundling-for-a-progressive-hedging-heuristic-in-s.md","publications\u002F2020\u002Fsoft-clustering-based-scenario-bundling-for-a-progressive-hedging-heuristic-in-s.md","publications\u002F2020\u002Fsoft-clustering-based-scenario-bundling-for-a-progressive-hedging-heuristic-in-s",{"_path":7030,"_dir":5985,"_draft":7,"_partial":7,"_locale":8,"title":7031,"description":8,"_hidden":7,"(STI)":7032,"authors":7033,"authors_orcid":7034,"year":5992,"doi":7035,"openalex_id":7036,"venue":3952,"abstract_screenshot":21,"keywords":7037,"body":7040,"_type":51,"_id":7044,"_source":53,"_file":7045,"_stem":7046,"_extension":56,"locale":57},"\u002Fpublications\u002F2020\u002Fthe-dynamics-of-the-studies-of-china-s-science-technology-and-innovation-sti-a-b","The dynamics of the studies of China’s science, technology and innovatio","a bibliometric analysis of an emerging field\"",[3538,65],[3540,70],"https:\u002F\u002Fdoi.org\u002F10.1007\u002Fs11192-020-03500-x","W3024230557",[282,5417,7038,3952,3958,7039,1358,691,1380,3745,23,34],"Bibliometrics","Dynamics (music)",{"type":39,"children":7041,"toc":7042},[],{"title":8,"searchDepth":49,"depth":49,"links":7043},[],"content:publications:2020:the-dynamics-of-the-studies-of-china-s-science-technology-and-innovation-sti-a-b.md","publications\u002F2020\u002Fthe-dynamics-of-the-studies-of-china-s-science-technology-and-innovation-sti-a-b.md","publications\u002F2020\u002Fthe-dynamics-of-the-studies-of-china-s-science-technology-and-innovation-sti-a-b",{"_path":7048,"_dir":5985,"_draft":7,"_partial":7,"_locale":8,"title":7049,"description":8,"_hidden":7,"Regression Discontinuity Evidence from China\" authors":7050,"authors_orcid":7053,"year":5992,"doi":7056,"openalex_id":7057,"venue":6919,"abstract_screenshot":21,"keywords":7058,"body":7065,"_type":51,"_id":7069,"_source":53,"_file":7070,"_stem":7071,"_extension":56,"locale":57},"\u002Fpublications\u002F2020\u002Fthe-effects-of-anti-corruption-campaign-on-research-grant-reimbursement-regressi","The Effects of Anti-corruption Campaign on Research Grant Reimbursement",[6909,65,7051,7052],"Lien, Donald","Liu, Xiaoou",[6914,70,7054,7055],"0000-0002-0659-2831","0000-0001-7535-9753","https:\u002F\u002Fdoi.org\u002F10.1007\u002Fs11948-020-00265-7","W3089552541",[7059,7060,133,282,7061,7062,1358,7063,6922,6926,6923,7064,36,173,3714,3546,3259,380,1334,179,289],"Regression discontinuity design","Reimbursement","Language change","Payroll","Principal (computer security)","Public economics",{"type":39,"children":7066,"toc":7067},[],{"title":8,"searchDepth":49,"depth":49,"links":7068},[],"content:publications:2020:the-effects-of-anti-corruption-campaign-on-research-grant-reimbursement-regressi.md","publications\u002F2020\u002Fthe-effects-of-anti-corruption-campaign-on-research-grant-reimbursement-regressi.md","publications\u002F2020\u002Fthe-effects-of-anti-corruption-campaign-on-research-grant-reimbursement-regressi",{"_path":7073,"_dir":5985,"_draft":7,"_partial":7,"_locale":8,"title":7074,"description":7075,"_hidden":7,"authors":7076,"authors_orcid":7080,"year":5992,"doi":7084,"openalex_id":7085,"venue":21,"abstract_screenshot":21,"keywords":7086,"body":7089,"_type":51,"_id":7097,"_source":53,"_file":7098,"_stem":7099,"_extension":56,"locale":57},"\u002Fpublications\u002F2020\u002Fthe-future-of-teaching-post-covid-19-microlearning-in-product-design-education","The Future of Teaching Post-COVID-19: Microlearning in Product Design Education","The recent COVID-19 pandemic has placed a huge strain on higher education institutions and educators around the world, which has included the closure of campuses, removal of face-to-face instruction and a shift to remote teaching and learning. However, this situation has also created unique opportunities and conditions that can foster innovation in teaching and learning practices and content delivery. One such innovation gaining traction is Microlearning, which offers learning opportunities through small bursts of training materials that learners can comprehend in a short time, according to their preferred schedule and location. This paper explores the potential of Microlearning within design education and how it can be implemented into the Product Design & Manufacture programme at University of Nottingham Ningbo China to support teaching instruction and enhance the student learning experience post-COVID-19.",[7077,7078,3894,595,850,7079],"Gill, Amarpreet","Irwin, Derek","Zhang, Yanhui",[7081,7082,3896,599,853,7083],"0000-0003-0659-026X","0000-0003-0342-6958","0000-0002-8383-1760","https:\u002F\u002Fdoi.org\u002F10.1109\u002Ftale48869.2020.9368322","W3134417241",[6410,6407,23,1222,3569,7087,6924,7088,4831,866,1380,865,1358,380],"Distance education","2019-20 coronavirus outbreak",{"type":39,"children":7090,"toc":7095},[7091],{"type":42,"tag":43,"props":7092,"children":7093},{},[7094],{"type":47,"value":7075},{"title":8,"searchDepth":49,"depth":49,"links":7096},[],"content:publications:2020:the-future-of-teaching-post-covid-19-microlearning-in-product-design-education.md","publications\u002F2020\u002Fthe-future-of-teaching-post-covid-19-microlearning-in-product-design-education.md","publications\u002F2020\u002Fthe-future-of-teaching-post-covid-19-microlearning-in-product-design-education",{"_path":7101,"_dir":5985,"_draft":7,"_partial":7,"_locale":8,"title":7102,"description":7103,"_hidden":7,"uncertainty reduction and language expectancy perspectives\" authors":7104,"authors_orcid":7105,"year":5992,"doi":7106,"openalex_id":7107,"venue":5441,"abstract_screenshot":21,"keywords":7108,"body":7113,"_type":51,"_id":7121,"_source":53,"_file":7122,"_stem":7123,"_extension":56,"locale":57},"\u002Fpublications\u002F2020\u002Fthe-impact-of-language-on-retweeting-during-acute-natural-disasters-uncertainty","The impact of language on retweeting during acute natural disasters","Purpose Social media have increasingly gained credibility as information sources in emergencies. Retweeting or resharing nature has made Twitter a popular medium of information dissemination. The purpose of this article is to enhance our understanding of both linguistic style and content properties (i.e. both affective and informational contents) that drives resharing behavior or virality of disaster messages on Twitter. We investigate this issue in the context of natural disaster crisis. Design\u002Fmethodology\u002Fapproach In this study, the authors develop, drawing upon language expectancy and uncertainty reduction theories as an enabling framework, hypotheses about how the language (i.e. style and content) influence resharing behavior. They employ a natural language processing of disaster tweets to examine how the language – linguistic style (concrete and interactive language) and linguistic content (information- and affect-focused language) – affects resharing behavior on Twitter during natural disasters. To examine the effects of both linguistic style and content factors on virality, a series of negative binomial regressions were conducted, particularly owing to the highly skewed count data. Findings Our analysis of tweets from the 2013 Colorado floods shows that resharing disasters tweets increases with the use of concrete language style during acute emergencies. Interactive language is also positively associated with retweet frequency. In addition, neither positive nor negative emotional tweets drive down resharing during acute crises, while information-focused language content has a significantly positive effect on virality. Practical implications Agencies for public safety and disaster management or volunteer organizations involved in disseminating crisis and risk information to the public may leverage the impacts of the linguistic style and language content through the lens of our research model. The findings encourage practitioners to focus on the role of linguistic style cues during acute disasters. Specifically, from the uncertainty reduction perspective, using concrete language in the disaster tweets is the expected norm, leading to a higher likelihood of virality. Also, interactively frame disaster tweets are more likely to be diffused to a larger number of people on Twitter. Originality\u002Fvalue The language that people use offer important psychological cue to their intentions and motivations. However, the role of language on Twitter has largely been ignored in this crisis communication and few prior studies have examined the relationship between language and virality during acute emergencies. This article explains the complex and multifaceted nature of information resharing behavior using a multi-theoretical approach – including uncertainty reduction and language expectancy theory – to understand effects of language style and content cues on resharing behavior in the context of natural crisis events.",[5942,5532],[5944,5537],"https:\u002F\u002Fdoi.org\u002F10.1108\u002Fimds-12-2019-0711","W3038671591",[5948,7109,7110,7111,865,4034,7112,133,23,870,1358,869,289],"Natural disaster","Uncertainty reduction theory","Credibility","Source credibility",{"type":39,"children":7114,"toc":7119},[7115],{"type":42,"tag":43,"props":7116,"children":7117},{},[7118],{"type":47,"value":7103},{"title":8,"searchDepth":49,"depth":49,"links":7120},[],"content:publications:2020:the-impact-of-language-on-retweeting-during-acute-natural-disasters-uncertainty.md","publications\u002F2020\u002Fthe-impact-of-language-on-retweeting-during-acute-natural-disasters-uncertainty.md","publications\u002F2020\u002Fthe-impact-of-language-on-retweeting-during-acute-natural-disasters-uncertainty",{"_path":7125,"_dir":5985,"_draft":7,"_partial":7,"_locale":8,"title":7126,"description":8,"_hidden":7,"ensemble learning authors":7127,"authors_orcid":7131,"year":5992,"doi":7134,"openalex_id":7135,"venue":374,"abstract_screenshot":21,"keywords":7136,"body":7138,"_type":51,"_id":7142,"_source":53,"_file":7143,"_stem":7144,"_extension":56,"locale":57},"\u002Fpublications\u002F2020\u002Ftrustworthiness-prediction-of-cloud-services-based-on-selective-neural-network-e","Trustworthiness prediction of cloud services based on selective neural network",[1095,7128,595,7129,3112,7130],"Lin, Rongru","Wang, Wenle","He, Qiang",[1099,21,599,7132,3115,7133],"0000-0002-4075-3512","0000-0002-2607-4556","https:\u002F\u002Fdoi.org\u002F10.1016\u002Fj.eswa.2020.114390","W3109291032",[23,3123,215,1058,37,353,695,632,3121,7137,181,5968],"Trustworthiness",{"type":39,"children":7139,"toc":7140},[],{"title":8,"searchDepth":49,"depth":49,"links":7141},[],"content:publications:2020:trustworthiness-prediction-of-cloud-services-based-on-selective-neural-network-e.md","publications\u002F2020\u002Ftrustworthiness-prediction-of-cloud-services-based-on-selective-neural-network-e.md","publications\u002F2020\u002Ftrustworthiness-prediction-of-cloud-services-based-on-selective-neural-network-e",{"_path":7146,"_dir":5985,"_draft":7,"_partial":7,"_locale":8,"title":7147,"description":7148,"_hidden":7,"authors":7149,"authors_orcid":7150,"year":5992,"doi":7151,"openalex_id":7152,"venue":553,"abstract_screenshot":21,"keywords":7153,"body":7160,"_type":51,"_id":7168,"_source":53,"_file":7169,"_stem":7170,"_extension":56,"locale":57},"\u002Fpublications\u002F2020\u002Funderstanding-china-s-fintech-sector-development-impacts-and-risks","Understanding China’s fintech sector: development, impacts and risks","Financial technology (fintech) is rapidly transforming the economy as well as the financial landscape in China. This paper attempts to shed light on its contributing factors, current state, economic impacts and potential risks. We identify three key drivers for China’s fintech development, namely shortage of supply in formal financial market, strong government support for promoting financial inclusion through digital technology, and more ‘tolerant’ regulatory environment. The greatest value of the Chinese fintech sector is promotion of financial inclusion, enabling a vast number of small- and medium-sized enterprises (SMEs) and low-income households to access to financial services. Existing studies unveil some strong evidences of fintech development improving efficiency, increasing employment and supporting entrepreneurship. In the meantime, there are also serious challenges facing this sector, such as regulatory uncertainties, illegal transactions, data abuse, etc. We conclude the paper by presenting some key takeaways, including several lessons for financial regulation.",[268,548],[272,550],"https:\u002F\u002Fdoi.org\u002F10.1080\u002F1351847x.2020.1811131","W3081742869",[7154,178,5447,282,5444,7155,3255,7156,7157,7158,7159,429,1357],"Financial inclusion","Promotion (chess)","Financial sector development","Economic shortage","Access to finance","Financial sector",{"type":39,"children":7161,"toc":7166},[7162],{"type":42,"tag":43,"props":7163,"children":7164},{},[7165],{"type":47,"value":7148},{"title":8,"searchDepth":49,"depth":49,"links":7167},[],"content:publications:2020:understanding-china-s-fintech-sector-development-impacts-and-risks.md","publications\u002F2020\u002Funderstanding-china-s-fintech-sector-development-impacts-and-risks.md","publications\u002F2020\u002Funderstanding-china-s-fintech-sector-development-impacts-and-risks",{"_path":7172,"_dir":5985,"_draft":7,"_partial":7,"_locale":8,"title":7173,"description":8,"_hidden":7,"authors":7174,"authors_orcid":7177,"year":5992,"doi":7181,"openalex_id":7182,"venue":74,"abstract_screenshot":21,"keywords":7183,"body":7184,"_type":51,"_id":7188,"_source":53,"_file":7189,"_stem":7190,"_extension":56,"locale":57},"\u002Fpublications\u002F2020\u002Fus-china-tensions-and-talent-mobility-evidence-from-air-traffic-data","US-China Tensions and Talent Mobility: Evidence from Air Traffic Data",[7175,6909,65,7176],"Wang, Zheng","Zhou, Zhuo",[7178,7179,70,7180],"0000-0002-2271-8801","0000-0001-8536-7538","0000-0001-9682-5717","https:\u002F\u002Fdoi.org\u002F10.2139\u002Fssrn.3739306","W3106711745",[282,454,178,1358,179,3259],{"type":39,"children":7185,"toc":7186},[],{"title":8,"searchDepth":49,"depth":49,"links":7187},[],"content:publications:2020:us-china-tensions-and-talent-mobility-evidence-from-air-traffic-data.md","publications\u002F2020\u002Fus-china-tensions-and-talent-mobility-evidence-from-air-traffic-data.md","publications\u002F2020\u002Fus-china-tensions-and-talent-mobility-evidence-from-air-traffic-data",{"_path":7192,"_dir":7193,"_draft":7,"_partial":7,"_locale":8,"title":7194,"description":8,"_hidden":7,"authors":7195,"authors_orcid":7199,"year":7203,"doi":7204,"openalex_id":7205,"venue":1055,"abstract_screenshot":21,"keywords":7206,"body":7208,"_type":51,"_id":7212,"_source":53,"_file":7213,"_stem":7214,"_extension":56,"locale":57},"\u002Fpublications\u002F2021\u002Fa-deep-reinforcement-learning-based-hyper-heuristic-for-combinatorial-optimisati","2021","A deep reinforcement learning based hyper-heuristic for combinatorial optimisation with uncertainties",[7196,12,319,7197,7198],"Zhang, Yuchang","Tu, Chaofan","Jin, Jiahuan",[7200,15,322,7201,7202],"0000-0002-4152-6784","0000-0002-9730-3563","0000-0002-9637-5450",2021,"https:\u002F\u002Fdoi.org\u002F10.1016\u002Fj.ejor.2021.10.032","W3208057219",[5304,506,329,23,890,7207,37,31,1189,5417,215,34,179],"Interpretability",{"type":39,"children":7209,"toc":7210},[],{"title":8,"searchDepth":49,"depth":49,"links":7211},[],"content:publications:2021:a-deep-reinforcement-learning-based-hyper-heuristic-for-combinatorial-optimisati.md","publications\u002F2021\u002Fa-deep-reinforcement-learning-based-hyper-heuristic-for-combinatorial-optimisati.md","publications\u002F2021\u002Fa-deep-reinforcement-learning-based-hyper-heuristic-for-combinatorial-optimisati",{"_path":7216,"_dir":7193,"_draft":7,"_partial":7,"_locale":8,"title":7217,"description":7218,"_hidden":7,"authors":7219,"authors_orcid":7222,"year":7203,"doi":7225,"openalex_id":7226,"venue":7227,"abstract_screenshot":21,"keywords":7228,"body":7230,"_type":51,"_id":7238,"_source":53,"_file":7239,"_stem":7240,"_extension":56,"locale":57},"\u002Fpublications\u002F2021\u002Fa-fuzzy-based-heuristic-algorithm-for-online-outbound-container-stacking-problem","A Fuzzy-based Heuristic Algorithm for Online Outbound Container Stacking Problem with Uncertain Weight Information","The weight information of an outbound container is often inaccurate, and it cannot be determined until its arrival at a port terminal. In order to fit all containers in a yard into the required loading sequence, re-handling operations are frequently unavoidable due to uncertainty. The planning of container storage location aims to minimize the amount of re-handling operations. We study a fuzzy logic-based heuristic algorithm for the outbound container stacking problem with uncertain weight information in this paper. Based on evaluating the lower and upper bound of re-handling, the parameters of the algorithm are tuned online in handling weight uncertainty. The computational complexity of the proposed algorithm is very low because it is independent from re-handling algorithms. We conduct simulations on two types of container weight datasets, uniform and standard distributions.",[157,7220,7221,12],"Zhou, Can","Wu, Kejia",[7223,7224,21,15],"0000-0002-9595-0732","0000-0001-9285-1248","https:\u002F\u002Fdoi.org\u002F10.1109\u002Fssci50451.2021.9660070","W4207014675","2021 IEEE Symposium Series on Computational Intelligence (SSCI)",[1189,23,329,6249,7229,332,31,3199,181,179,34,37,251],"Stacking",{"type":39,"children":7231,"toc":7236},[7232],{"type":42,"tag":43,"props":7233,"children":7234},{},[7235],{"type":47,"value":7218},{"title":8,"searchDepth":49,"depth":49,"links":7237},[],"content:publications:2021:a-fuzzy-based-heuristic-algorithm-for-online-outbound-container-stacking-problem.md","publications\u002F2021\u002Fa-fuzzy-based-heuristic-algorithm-for-online-outbound-container-stacking-problem.md","publications\u002F2021\u002Fa-fuzzy-based-heuristic-algorithm-for-online-outbound-container-stacking-problem",{"_path":7242,"_dir":7193,"_draft":7,"_partial":7,"_locale":8,"title":7243,"description":7244,"_hidden":7,"authors":7245,"authors_orcid":7248,"year":7203,"doi":7251,"openalex_id":7252,"venue":7253,"abstract_screenshot":21,"keywords":7254,"body":7261,"_type":51,"_id":7269,"_source":53,"_file":7270,"_stem":7271,"_extension":56,"locale":57},"\u002Fpublications\u002F2021\u002Fa-genetic-optimization-resampling-based-particle-filtering-algorithm-for-indoor","A Genetic Optimization Resampling Based Particle Filtering Algorithm for Indoor Target Tracking","In indoor target tracking based on wireless sensor networks, the particle filtering algorithm has been widely used because of its outstanding performance in coping with highly non-linear problems. Resampling is generally required to address the inherent particle degeneracy problem in the particle filter. However, traditional resampling methods cause the problem of particle impoverishment. This problem degrades positioning accuracy and robustness and sometimes may even result in filtering divergence and tracking failure. In order to mitigate the particle impoverishment and improve positioning accuracy, this paper proposes an improved genetic optimization based resampling method. This resampling method optimizes the distribution of resampled particles by the five operators, i.e., selection, roughening, classification, crossover, and mutation. The proposed resampling method is then integrated into the particle filtering framework to form a genetic optimization resampling based particle filtering (GORPF) algorithm. The performance of the GORPF algorithm is tested by a one-dimensional tracking simulation and a three-dimensional indoor tracking experiment. Both test results show that with the aid of the proposed resampling method, the GORPF has better robustness against particle impoverishment and achieves better positioning accuracy than several existing target tracking algorithms. Moreover, the GORPF algorithm owns an affordable computation load for real-time applications.",[7246,3376,12,7247],"Zhou, Ning","Moore, Terry",[7249,3380,15,7250],"0000-0001-8589-3001","0000-0002-6169-059X","https:\u002F\u002Fdoi.org\u002F10.3390\u002Frs13010132","W3119239127","Remote Sensing",[7255,7256,7257,23,353,332,131,695,106,31,37,34,215,7258,7259,7260],"Resampling","Particle filter","Auxiliary particle filter","Kalman filter","Ensemble Kalman filter","Extended Kalman filter",{"type":39,"children":7262,"toc":7267},[7263],{"type":42,"tag":43,"props":7264,"children":7265},{},[7266],{"type":47,"value":7244},{"title":8,"searchDepth":49,"depth":49,"links":7268},[],"content:publications:2021:a-genetic-optimization-resampling-based-particle-filtering-algorithm-for-indoor.md","publications\u002F2021\u002Fa-genetic-optimization-resampling-based-particle-filtering-algorithm-for-indoor.md","publications\u002F2021\u002Fa-genetic-optimization-resampling-based-particle-filtering-algorithm-for-indoor",{"_path":7273,"_dir":7193,"_draft":7,"_partial":7,"_locale":8,"title":7274,"description":8,"_hidden":7,"authors":7275,"authors_orcid":7276,"year":7203,"doi":7277,"openalex_id":7278,"venue":7279,"abstract_screenshot":21,"keywords":7280,"body":7284,"_type":51,"_id":7288,"_source":53,"_file":7289,"_stem":7290,"_extension":56,"locale":57},"\u002Fpublications\u002F2021\u002Fa-hybrid-medical-text-classification-framework-integrating-attentive-rule-constr","A hybrid medical text classification framework: Integrating attentive rule construction and neural network",[907,5815,199,12,5816,5817],[912,5820,203,15,5821,5822],"https:\u002F\u002Fdoi.org\u002F10.1016\u002Fj.neucom.2021.02.069","W3135832423","Neurocomputing",[7207,23,37,7281,5923,215,632,7282,7283,181],"Classifier (UML)","Rule-based system","Hybrid neural network",{"type":39,"children":7285,"toc":7286},[],{"title":8,"searchDepth":49,"depth":49,"links":7287},[],"content:publications:2021:a-hybrid-medical-text-classification-framework-integrating-attentive-rule-constr.md","publications\u002F2021\u002Fa-hybrid-medical-text-classification-framework-integrating-attentive-rule-constr.md","publications\u002F2021\u002Fa-hybrid-medical-text-classification-framework-integrating-attentive-rule-constr",{"_path":7292,"_dir":7193,"_draft":7,"_partial":7,"_locale":8,"title":7293,"description":7294,"_hidden":7,"Supervised Machine Learning Method authors":7295,"authors_orcid":7305,"year":7203,"doi":7313,"openalex_id":7314,"venue":7315,"abstract_screenshot":21,"keywords":7316,"body":7331,"_type":51,"_id":7339,"_source":53,"_file":7340,"_stem":7341,"_extension":56,"locale":57},"\u002Fpublications\u002F2021\u002Fa-review-of-enhancement-of-biohydrogen-productions-by-chemical-addition-using-a","A Review of Enhancement of Biohydrogen Productions by Chemical Addition Using a","In this work, the impact of chemical additions, especially nano-particles (NPs), was quantitatively analyzed using our constructed artificial neural networks (ANNs)-response surface methodology (RSM) algorithm. Fe-based and Ni-based NPs and ions, including Mg2+, Cu2+, Na+, NH4+, and K+, behave differently towards the response of hydrogen yield (HY) and hydrogen evolution rate (HER). Manipulating the size and concentration of NPs was found to be effective in enhancing the HY for Fe-based NPs and ions, but not for Ni-based NPs and ions. An optimal range of particle size (86–120 nm) and Ni-ion\u002FNP concentration (81–120 mg L−1) existed for HER. Meanwhile, the manipulation of the size and concentration of NPs was found to be ineffective for both iron and nickel for the improvement of HER. In fact, the variation in size of NPs for the enhancement of HY and HER demonstrated an appreciable difference. The smaller (less than 42 nm) NPs were found to definitely improve the HY, whereas for the HER, the relatively bigger size of NPs (40–50 nm) seemed to significantly increase the H2 evolution rate. It was also found that the variations in the concentration of the investigated ions only statistically influenced the HER, not the HY. The level of response (the enhanced HER) towards inputs was underpinned and the order of significance towards HER was identified as the following: Na+ > Mg2+ > Cu2+ > NH4+ > K+.",[7296,7297,7298,7299,7300,7301,7302,709,7303,7304],"Liu, Yiyang","Liu, Jinze","He, Hongzhen","Yang, Shanru","Wang, Yixiao","Hu, Jin","Jin, Huan","Yang, Gang","Sun, Yong",[7306,7307,7308,21,7309,21,7310,711,7311,7312],"0000-0002-5846-7354","0000-0003-0555-9412","0000-0002-8053-3389","0000-0002-6264-0201","0000-0003-0721-8283","0000-0003-1032-6840","0000-0002-4888-156X","https:\u002F\u002Fdoi.org\u002F10.3390\u002Fen14185916","W3199907500","Energies",[7317,7318,7319,7320,7321,7322,7323,753,3959,3961,7324,7325,7326,7327,7328,7329,7330],"Ion","Response surface methodology","Biohydrogen","Particle size","Yield (engineering)","Nanoparticle","Hydrogen","Nuclear chemistry","Analytical Chemistry (journal)","Hydrogen production","Metallurgy","Physical chemistry","Chromatography","Organic chemistry",{"type":39,"children":7332,"toc":7337},[7333],{"type":42,"tag":43,"props":7334,"children":7335},{},[7336],{"type":47,"value":7294},{"title":8,"searchDepth":49,"depth":49,"links":7338},[],"content:publications:2021:a-review-of-enhancement-of-biohydrogen-productions-by-chemical-addition-using-a.md","publications\u002F2021\u002Fa-review-of-enhancement-of-biohydrogen-productions-by-chemical-addition-using-a.md","publications\u002F2021\u002Fa-review-of-enhancement-of-biohydrogen-productions-by-chemical-addition-using-a",{"_path":7343,"_dir":7193,"_draft":7,"_partial":7,"_locale":8,"title":7344,"description":7345,"_hidden":7,"density functional theory approach authors":7346,"authors_orcid":7348,"year":7203,"doi":7350,"openalex_id":7351,"venue":7352,"abstract_screenshot":21,"keywords":7353,"body":7364,"_type":51,"_id":7372,"_source":53,"_file":7373,"_stem":7374,"_extension":56,"locale":57},"\u002Fpublications\u002F2021\u002Fadsorption-of-fatty-acid-and-methanol-via-calcium-sulfate-based-catalyst-using-a","Adsorption of fatty acid and methanol via calcium sulfate-based catalyst using a","Abstract This paper reports the molecular simulation of catalytic adsorption of the model compounds (simulated fatty acid and methanol) via the density functional theory (DFT) approach. The catalyst was prepared from an improved clean wet process using phosphorous rock as the raw materials. The adsorptions of the model compounds on the catalyst were simulated. The associated energies during adsorption were calculated. The proposed the detailed simulation offers great details of molecular adsorptions of the model compounds on the created crystallite lattice surface during adsorption.",[7304,7301,7302,7303,7347],"He, Jun",[7312,21,7310,7311,7349],"0000-0001-8056-0347","https:\u002F\u002Fdoi.org\u002F10.1088\u002F1742-6596\u002F2047\u002F1\u002F012016","W3210331220","Journal of Physics Conference Series",[7354,7355,7356,7357,7358,7359,7360,753,7361,3961,7362,7328,7330,7363],"Adsorption","Methanol","Catalysis","Density functional theory","Crystallite","Raw material","Chemical engineering","Inorganic chemistry","Computational chemistry","Crystallography",{"type":39,"children":7365,"toc":7370},[7366],{"type":42,"tag":43,"props":7367,"children":7368},{},[7369],{"type":47,"value":7345},{"title":8,"searchDepth":49,"depth":49,"links":7371},[],"content:publications:2021:adsorption-of-fatty-acid-and-methanol-via-calcium-sulfate-based-catalyst-using-a.md","publications\u002F2021\u002Fadsorption-of-fatty-acid-and-methanol-via-calcium-sulfate-based-catalyst-using-a.md","publications\u002F2021\u002Fadsorption-of-fatty-acid-and-methanol-via-calcium-sulfate-based-catalyst-using-a",{"_path":7376,"_dir":7193,"_draft":7,"_partial":7,"_locale":8,"title":7377,"description":7378,"_hidden":7,"Self-Made EEG Device authors":7379,"authors_orcid":7381,"year":7203,"doi":7383,"openalex_id":7384,"venue":3384,"abstract_screenshot":21,"keywords":7385,"body":7392,"_type":51,"_id":7400,"_source":53,"_file":7401,"_stem":7402,"_extension":56,"locale":57},"\u002Fpublications\u002F2021\u002Faffective-computing-on-machine-learning-based-emotion-recognition-using-a-self-m","Affective Computing on Machine Learning-Based Emotion Recognition Using a","In this research, we develop an affective computing method based on machine learning for emotion recognition using a wireless protocol and a wearable electroencephalography (EEG) custom-designed device. The system collects EEG signals using an eight-electrode placement on the scalp; two of these electrodes were placed in the frontal lobe, and the other six electrodes were placed in the temporal lobe. We performed experiments on eight subjects while they watched emotive videos. Six entropy measures were employed for extracting suitable features from the EEG signals. Next, we evaluated our proposed models using three popular classifiers: a support vector machine (SVM), multi-layer perceptron (MLP), and one-dimensional convolutional neural network (1D-CNN) for emotion classification; both subject-dependent and subject-independent strategies were used. Our experiment results showed that the highest average accuracies achieved in the subject-dependent and subject-independent cases were 85.81% and 78.52%, respectively; these accuracies were achieved using a combination of the sample entropy measure and 1D-CNN. Moreover, our study investigates the T8 position (above the right ear) in the temporal lobe as the most critical channel among the proposed measurement positions for emotion classification through electrode selection. Our results prove the feasibility and efficiency of our proposed EEG-based affective computing method for emotion recognition in real-world applications.",[7380,5667,5665],"Mai, Ngoc-Dau",[7382,5670,5669],"0009-0005-7027-1505","https:\u002F\u002Fdoi.org\u002F10.3390\u002Fs21155135","W3188833721",[7386,23,37,3688,6973,4876,7387,7388,6980,5545,7389,7390,7391,632,865],"Electroencephalography","Perceptron","Emotion classification","Entropy (arrow of time)","Emotion recognition","Feature extraction",{"type":39,"children":7393,"toc":7398},[7394],{"type":42,"tag":43,"props":7395,"children":7396},{},[7397],{"type":47,"value":7378},{"title":8,"searchDepth":49,"depth":49,"links":7399},[],"content:publications:2021:affective-computing-on-machine-learning-based-emotion-recognition-using-a-self-m.md","publications\u002F2021\u002Faffective-computing-on-machine-learning-based-emotion-recognition-using-a-self-m.md","publications\u002F2021\u002Faffective-computing-on-machine-learning-based-emotion-recognition-using-a-self-m",{"_path":7404,"_dir":7193,"_draft":7,"_partial":7,"_locale":8,"title":7405,"description":7406,"_hidden":7,"authors":7407,"authors_orcid":7413,"year":7203,"doi":7421,"openalex_id":7422,"venue":6116,"abstract_screenshot":21,"keywords":7423,"body":7424,"_type":51,"_id":7432,"_source":53,"_file":7433,"_stem":7434,"_extension":56,"locale":57},"\u002Fpublications\u002F2021\u002Fanalytics-and-machine-learning-in-vehicle-routing-research","Analytics and machine learning in vehicle routing research","The Vehicle Routing Problem (VRP) is one of the most intensively studied combinatorial optimisation problems for which numerous models and algorithms have been proposed. To tackle the complexities, uncertainties and dynamics involved in real-world VRP applications, Machine Learning (ML) methods have been used in combination with analytical approaches to enhance problem formulations and algorithmic performance across different problem solving scenarios. However, the relevant papers are scattered in several traditional research fields with very different, sometimes confusing, terminologies. This paper presents a first, comprehensive review of hybrid methods that combine analytical techniques with ML tools in addressing VRP problems. Specifically, we review the emerging research streams on ML-assisted VRP modelling and ML-assisted VRP optimisation. We conclude that ML can be beneficial in enhancing VRP modelling, and improving the performance of algorithms for both online and offline VRP optimisations. Finally, challenges and future opportunities of VRP research are discussed.",[12,5989,7408,709,4662,7409,3324,7302,7198,13,157,7410,6111,7411,1181,7412],"Chen, Zhi‐Long","He, Wentao","Lu, Zheng Feng","Weng, Paul","Zhang, Huayan",[15,5991,7414,711,4667,7415,3326,7416,7202,16,7417,7418,6113,7419,21,7420],"0000-0002-9960-0465","0000-0002-6319-1639","0009-0005-4194-1311","0000-0002-0981-8058","0000-0002-7771-8593","0000-0002-2008-4569","0000-0003-0843-8448","https:\u002F\u002Fdoi.org\u002F10.1080\u002F00207543.2021.2013566","W3129625903",[247,23,215,690,37,250,691],{"type":39,"children":7425,"toc":7430},[7426],{"type":42,"tag":43,"props":7427,"children":7428},{},[7429],{"type":47,"value":7406},{"title":8,"searchDepth":49,"depth":49,"links":7431},[],"content:publications:2021:analytics-and-machine-learning-in-vehicle-routing-research.md","publications\u002F2021\u002Fanalytics-and-machine-learning-in-vehicle-routing-research.md","publications\u002F2021\u002Fanalytics-and-machine-learning-in-vehicle-routing-research",{"_path":7436,"_dir":7193,"_draft":7,"_partial":7,"_locale":8,"title":7437,"description":7438,"_hidden":7,"authors":7439,"authors_orcid":7440,"year":7203,"doi":7441,"openalex_id":7442,"venue":6726,"abstract_screenshot":7443,"keywords":7444,"body":7450,"_type":51,"_id":7458,"_source":53,"_file":7459,"_stem":7460,"_extension":56,"locale":57},"\u002Fpublications\u002F2021\u002Fapproximation-to-object-conditional-validity-with-inductive-conformal-predictors","Approximation to Object Conditional Validity with Inductive Conformal Predictors","Conformal predictors are machine learning algorithms that output prediction sets that have a guarantee of marginal validity for finite samples with minimal distributional assumptions. This is a property that makes conformal predictors useful for machine learning tasks where we require reliable predictions. It would also be desirable to achieve conditional validity in the same setting, in the sense that validity of the prediction intervals remains valid regardless of conditioning on any particular property of the object of the prediction. Unfortunately, it has been shown that such conditional validity is impossible to guarantee for non-trivial prediction problems for finite samples. In this article, instead of trying to achieve a strong conditional validity result, the weaker goal of achieving an approximation to conditional validity is considered. A new algorithm is introduced to do this by iteratively adjusting a conformity measure to deviations from object conditional validity measured in the training data. Along with some theoretical results, experimental results are provided for three data sets that demonstrate (1) in real world machine learning tasks, lack of conditional validity is a measurable problem and (2) that the proposed algorithm is effective at alleviating this problem.",[4189],[4191],"https:\u002F\u002Fdoi.org\u002F10.48550\u002Farxiv.2102.07436","W3134299039","approximation-to-object-conditional-validity-with-inductive-conformal-predictors.png",[7445,3980,23,557,7446,7447,7448,37,215,34,287,181,865,870,7449],"Object (grammar)","Conformal map","Conformity","Conditional expectation","Mathematical analysis",{"type":39,"children":7451,"toc":7456},[7452],{"type":42,"tag":43,"props":7453,"children":7454},{},[7455],{"type":47,"value":7438},{"title":8,"searchDepth":49,"depth":49,"links":7457},[],"content:publications:2021:approximation-to-object-conditional-validity-with-inductive-conformal-predictors.md","publications\u002F2021\u002Fapproximation-to-object-conditional-validity-with-inductive-conformal-predictors.md","publications\u002F2021\u002Fapproximation-to-object-conditional-validity-with-inductive-conformal-predictors",{"_path":7462,"_dir":7193,"_draft":7,"_partial":7,"_locale":8,"title":7463,"description":7464,"_hidden":7,"authors":7465,"authors_orcid":7472,"year":7203,"doi":7479,"openalex_id":7480,"venue":7481,"abstract_screenshot":21,"keywords":7482,"body":7487,"_type":51,"_id":7495,"_source":53,"_file":7496,"_stem":7497,"_extension":56,"locale":57},"\u002Fpublications\u002F2021\u002Fartificial-neural-networks-for-classification-of-single-cell-gene-expression","Artificial Neural Networks for classification of single cell gene expression","Abstract Background Single-cell transcriptome (SCT) sequencing technology has reached the level of high-throughput technology where gene expression can be measured concurrently from large numbers of cells. The results of gene expression studies are highly reproducible when strict protocols and standard operating procedures (SOP) are followed. However, differences in sample processing conditions result in significant changes in gene expression profiles making direct comparison of different studies difficult. Unsupervised machine learning (ML) uses clustering algorithms combined with semi-automated cell labeling and manual annotation of individual cells. They do not scale up well and a workflow used on a specific dataset will not perform well with other studies. Supervised ML classification shows superior classification accuracy and generalization properties as compared to unsupervised ML methods. We describe a supervised ML method that deploys artificial neural networks (ANN), for 5-class classification of healthy peripheral blood mononuclear cells (PBMC) from multiple diverse studies. Results We used 58 data sets to train ANN incrementally – over ten cycles of training and testing. The sample processing involved four protocols: separation of PBMC, separation of PBMC + enrichment (by negative selection), separation of PBMC + FACS, and separation of PBMC + MACS. The training data set included between 85 and 110 thousand cells, and the test set had approximately 13 thousand cells. Training and testing were done with various combinations of data sets from four principal data sources. The overall accuracy of classification on independent data sets reached 5-class classification accuracy of 94%. Classification accuracy for B cells, monocytes, and T cells exceeded 95%. Classification accuracy of natural killer (NK) cells was 75% because of the similarity between NK cells and T cell subsets. The accuracy of dendritic cells (DC) was low due to very low numbers of DC in the training sets. Conclusions The incremental learning ANN model can accurately classify the main types of PBMC. With the inclusion of more DC and resolving ambiguities between T cell and NK cell gene expression profiles, we will enable high accuracy supervised ML classification of PBMC. We assembled a reference data set for healthy PBMC and demonstrated a proof-of-concept for supervised ANN method in classification of previously unseen SCT data. The classification shows high accuracy, that is consistent across different studies and sample processing methods.",[7466,7467,7302,7468,7469,7470,7471,5888],"Zhong, Jiahui","Lyu, Minjie","Cao, Zhiwei","Chitkushev, Lou","Zhang, Guanglan","Keskin, Derin B.",[7473,7474,7310,7475,7476,7477,7478,5890],"0000-0001-5878-976X","0000-0002-0084-847X","0000-0003-1165-1928","0000-0002-9365-8818","0000-0001-6010-490X","0000-0002-8496-6181","https:\u002F\u002Fdoi.org\u002F10.1101\u002F2021.07.29.454293","W3189741360","bioRxiv (Cold Spring Harbor Laboratory)",[37,23,632,3441,4513,7483,215,7484,7485,101,4876,181,4606,4608,4991,7486],"Test set","Workflow","Peripheral blood mononuclear cell","Genetics",{"type":39,"children":7488,"toc":7493},[7489],{"type":42,"tag":43,"props":7490,"children":7491},{},[7492],{"type":47,"value":7464},{"title":8,"searchDepth":49,"depth":49,"links":7494},[],"content:publications:2021:artificial-neural-networks-for-classification-of-single-cell-gene-expression.md","publications\u002F2021\u002Fartificial-neural-networks-for-classification-of-single-cell-gene-expression.md","publications\u002F2021\u002Fartificial-neural-networks-for-classification-of-single-cell-gene-expression",{"_path":7499,"_dir":7193,"_draft":7,"_partial":7,"_locale":8,"title":7500,"description":7501,"_hidden":7,"data and indicators\" authors":7502,"authors_orcid":7503,"year":7203,"doi":7505,"openalex_id":7506,"venue":7507,"abstract_screenshot":7508,"keywords":7509,"body":7512,"_type":51,"_id":7520,"_source":53,"_file":7521,"_stem":7522,"_extension":56,"locale":57},"\u002Fpublications\u002F2021\u002Fbig-data-challenges-in-overcoming-china-s-water-and-air-pollution-relevant-data","Big data challenges in overcoming China’s water and air pollution: relevan","Big data are potentially useful for environmental management planning and actions that can be directed toward pollution control. China is using big data approaches to help reduce its current levels of pollution. However, also needed are better environmental indicators, measurement technologies, data management and reporting, and adaptive management and enforcement. Based on continental-extent monitoring and assessment programs in Europe and the USA, we recommend three major programmatic changes for China. (1) Establish long-term systemic environmental and human health objectives and indicators. (2) Adopt national standard methods for survey designs, sampling and analytical protocols, statistical analyses, and collaborative sampling programs. (3) Provide a transparent process for reporting and correcting data errors.",[3242,3511,3512,65],[7504,3515,21,70],"0009-0006-5386-308X","https:\u002F\u002Fdoi.org\u002F10.1007\u002Fs42452-021-04448-0","W3138488032","SN Applied Sciences","big-data-challenges-in-overcoming-china-s-water-and-air-pollution-relevant-data.png",[689,282,3254,7510,3262,5969,7511,3261,23,691,926,181,289,1358],"Data management","Environmental data",{"type":39,"children":7513,"toc":7518},[7514],{"type":42,"tag":43,"props":7515,"children":7516},{},[7517],{"type":47,"value":7501},{"title":8,"searchDepth":49,"depth":49,"links":7519},[],"content:publications:2021:big-data-challenges-in-overcoming-china-s-water-and-air-pollution-relevant-data.md","publications\u002F2021\u002Fbig-data-challenges-in-overcoming-china-s-water-and-air-pollution-relevant-data.md","publications\u002F2021\u002Fbig-data-challenges-in-overcoming-china-s-water-and-air-pollution-relevant-data",{"_path":7524,"_dir":7193,"_draft":7,"_partial":7,"_locale":8,"title":7525,"description":7526,"_hidden":7,"Higher Education\" authors":7527,"authors_orcid":7529,"year":7203,"doi":7530,"openalex_id":7531,"venue":21,"abstract_screenshot":21,"keywords":7532,"body":7534,"_type":51,"_id":7542,"_source":53,"_file":7543,"_stem":7544,"_extension":56,"locale":57},"\u002Fpublications\u002F2021\u002Fbreaking-boundaries-students-motivation-toward-interdisciplinary-learning-in-hig","Breaking Boundaries: Students' Motivation Toward Interdisciplinary Learning i","Interdisciplinarity is widely regarded as the future of Industry 4.0. It is at the core of the knowledge economy, and is key to solving complex real-world problems. Contemporary education therefore must provide students with the skills and understanding to engage in interdisciplinary studies. This paper explores the experiences, attitudes and motivations of students working on interdisciplinary projects at the University of Nottingham Ningbo China. A mixed-methods sequential explanatory study was conducted that included quantitative pre-experience survey data combined with qualitative data from weekly reports and supervisory observations. The study shows that students were actively willing to engage in interdisciplinary approaches and understood their value, in spite of initial concerns that their core disciplines might be devalued in this environment. However, qualitative results revealed that interdisciplinarity was the result of, and reinforced by, interactions over tasks. Ultimately, we use examples from our study to encourage higher education educators to integrate interdisciplinary learning activities and classes throughout their curricula.",[7077,7078,3894,595,850,7528,7079],"Wells, Robert N.",[7081,7082,3896,599,853,21,7083],"https:\u002F\u002Fdoi.org\u002F10.1109\u002Ftale52509.2021.9678744","W4206899161",[5922,1441,4831,5514,7533,629,1379,866,865,1380,1334,23,3096,179,1358],"Qualitative property",{"type":39,"children":7535,"toc":7540},[7536],{"type":42,"tag":43,"props":7537,"children":7538},{},[7539],{"type":47,"value":7526},{"title":8,"searchDepth":49,"depth":49,"links":7541},[],"content:publications:2021:breaking-boundaries-students-motivation-toward-interdisciplinary-learning-in-hig.md","publications\u002F2021\u002Fbreaking-boundaries-students-motivation-toward-interdisciplinary-learning-in-hig.md","publications\u002F2021\u002Fbreaking-boundaries-students-motivation-toward-interdisciplinary-learning-in-hig",{"_path":7546,"_dir":7193,"_draft":7,"_partial":7,"_locale":8,"title":7547,"description":8,"_hidden":7,"reduction technique\" authors":7548,"authors_orcid":7549,"year":7203,"doi":7550,"openalex_id":7551,"venue":7552,"abstract_screenshot":21,"keywords":7553,"body":7555,"_type":51,"_id":7559,"_source":53,"_file":7560,"_stem":7561,"_extension":56,"locale":57},"\u002Fpublications\u002F2021\u002Fcandidate-test-set-reduction-for-adaptive-random-testing-an-overheads-reduction","Candidate test set reduction for adaptive random testing: An overhead",[645,5250,5049,595],[650,5253,5051,599],"https:\u002F\u002Fdoi.org\u002F10.1016\u002Fj.scico.2021.102730","W3204945965","Science of Computer Programming",[23,1163,748,101,7483,7554,659,661,658,332,37,215,34],"Cost reduction",{"type":39,"children":7556,"toc":7557},[],{"title":8,"searchDepth":49,"depth":49,"links":7558},[],"content:publications:2021:candidate-test-set-reduction-for-adaptive-random-testing-an-overheads-reduction.md","publications\u002F2021\u002Fcandidate-test-set-reduction-for-adaptive-random-testing-an-overheads-reduction.md","publications\u002F2021\u002Fcandidate-test-set-reduction-for-adaptive-random-testing-an-overheads-reduction",{"_path":7563,"_dir":7193,"_draft":7,"_partial":7,"_locale":8,"title":7564,"description":8,"_hidden":7,"authors":7565,"authors_orcid":7566,"year":7203,"doi":7567,"openalex_id":7568,"venue":3543,"abstract_screenshot":21,"keywords":7569,"body":7578,"_type":51,"_id":7582,"_source":53,"_file":7583,"_stem":7584,"_extension":56,"locale":57},"\u002Fpublications\u002F2021\u002Fchinese-joint-venture-universities-try-for-the-best-of-both-worlds","Chinese joint-venture universities try for the best of both worlds",[65],[70],"https:\u002F\u002Fdoi.org\u002F10.1038\u002Fd41586-021-01406-z","W3164865063",[7570,282,7571,7572,7573,3746,178,1358,179,7574,7575,36,429,7576,3259,7577],"Joint venture","Traction (geology)","Joint (building)","Social venture capital","Venture capital","Business administration","Mechanical engineering","Civil engineering",{"type":39,"children":7579,"toc":7580},[],{"title":8,"searchDepth":49,"depth":49,"links":7581},[],"content:publications:2021:chinese-joint-venture-universities-try-for-the-best-of-both-worlds.md","publications\u002F2021\u002Fchinese-joint-venture-universities-try-for-the-best-of-both-worlds.md","publications\u002F2021\u002Fchinese-joint-venture-universities-try-for-the-best-of-both-worlds",{"_path":7586,"_dir":7193,"_draft":7,"_partial":7,"_locale":8,"title":7587,"description":7588,"_hidden":7,"Implementation\" authors":7589,"authors_orcid":7590,"year":7203,"doi":7591,"openalex_id":7592,"venue":21,"abstract_screenshot":21,"keywords":7593,"body":7600,"_type":51,"_id":7608,"_source":53,"_file":7609,"_stem":7610,"_extension":56,"locale":57},"\u002Fpublications\u002F2021\u002Fclif-cross-layer-information-fusion-for-stereo-matching-and-its-hardware-impleme","CLIF: Cross-Layer Information Fusion for Stereo Matching and its Hardwar","The rapid advancement of intelligent systems, especially robotics and autonomous driving, is highly reliant on low-complexity and high-accuracy stereo matching algorithms. However, the performance of state-of-the-art stereo matching algorithms still has great space for improvement by gaining awareness of the implicit information hidden in the cost volume layers. In this paper, we propose a low-complexity local stereo matching algorithm named Cross-Layer Information Fusion (CLIF), to improve the matching accuracy by exploring the hidden information. First, we analyze and extract the hidden information into an auxiliary extractor using a novel fusion method. Second, we propose an information sharing strategy that transforms the extractor into a regularization term on each cost volume layer. Then we improve the design by re-constructing the information extractor between the adjacent cost volume layers and form a pipelined hardware architecture on the FPGA platform. Experimental results show that the proposed CLIF algorithm improves 6.53% average accuracy incurring negligible resources and performance impacts, compared to the state-of-the-art solutions.",[6618,5533,5532,5534],[6622,5538,5537,5539],"https:\u002F\u002Fdoi.org\u002F10.1109\u002Fiscas51556.2021.9401077","W3159545584",[23,37,6876,7594,7595,5543,7596,6143,7597,7598,4876,4391,7599,5550,139],"Extractor","Volume (thermodynamics)","Information fusion","Robotics","Hardware architecture","Robot",{"type":39,"children":7601,"toc":7606},[7602],{"type":42,"tag":43,"props":7603,"children":7604},{},[7605],{"type":47,"value":7588},{"title":8,"searchDepth":49,"depth":49,"links":7607},[],"content:publications:2021:clif-cross-layer-information-fusion-for-stereo-matching-and-its-hardware-impleme.md","publications\u002F2021\u002Fclif-cross-layer-information-fusion-for-stereo-matching-and-its-hardware-impleme.md","publications\u002F2021\u002Fclif-cross-layer-information-fusion-for-stereo-matching-and-its-hardware-impleme",{"_path":7612,"_dir":7193,"_draft":7,"_partial":7,"_locale":8,"title":7613,"description":7614,"_hidden":7,"authors":7615,"authors_orcid":7617,"year":7203,"doi":7619,"openalex_id":7620,"venue":7621,"abstract_screenshot":21,"keywords":7622,"body":7632,"_type":51,"_id":7640,"_source":53,"_file":7641,"_stem":7642,"_extension":56,"locale":57},"\u002Fpublications\u002F2021\u002Fcollective-strategies-with-a-master-slave-mechanism-dominate-in-spatial-iterated","Collective Strategies With a Master-Slave Mechanism Dominate in Spatial-Iterated Prisoner's Dilemma","How cooperation emerges and persists in a population of selfish agents is a fundamental question in evolutionary game theory. The research shows that collective strategies with master-slave mechanism (CSMSM) defeat tit-for-tat and other well-known strategies in spatial iterated prisoner's dilemma. A CSMSM identifies kin members by means of a handshaking mechanism. If the opponent is identified as non-kin, a CSMSM will always defect. Once two CSMSMs meet, they play master and slave roles. A mater defects and a slave cooperates in order to maximize the master's payoff. CSMSM outperforms non-collective strategies in spatial IPD even if there is only a small cluster of CSMSMs in the population. The existence and performance of CSMSM in spatial iterated prisoner's dilemma suggests that cooperation first appears and persists in a group of collective agents.",[157,7616,199,12],"Duncan, Robert O.",[162,7618,203,15],"0000-0003-2843-4743","https:\u002F\u002Fdoi.org\u002F10.4018\u002Fijsir.2021100103","W3205979349","International Journal of Swarm Intelligence Research",[7623,7624,7625,7626,7627,952,7628,23,7629,7630,7631,1380,6928,36,34,5949,6569],"Prisoner's dilemma","Superrationality","Dilemma","Stochastic game","Mechanism (biology)","Iterated function","Mathematical economics","Game theory","Microeconomics",{"type":39,"children":7633,"toc":7638},[7634],{"type":42,"tag":43,"props":7635,"children":7636},{},[7637],{"type":47,"value":7614},{"title":8,"searchDepth":49,"depth":49,"links":7639},[],"content:publications:2021:collective-strategies-with-a-master-slave-mechanism-dominate-in-spatial-iterated.md","publications\u002F2021\u002Fcollective-strategies-with-a-master-slave-mechanism-dominate-in-spatial-iterated.md","publications\u002F2021\u002Fcollective-strategies-with-a-master-slave-mechanism-dominate-in-spatial-iterated",{"_path":7644,"_dir":7193,"_draft":7,"_partial":7,"_locale":8,"title":7645,"description":7646,"_hidden":7,"authors":7647,"authors_orcid":7649,"year":7203,"doi":7650,"openalex_id":7651,"venue":21,"abstract_screenshot":21,"keywords":7652,"body":7655,"_type":51,"_id":7663,"_source":53,"_file":7664,"_stem":7665,"_extension":56,"locale":57},"\u002Fpublications\u002F2021\u002Fcreating-a-virtual-reality-oer-application-to-teach-web-accessibility","Creating a Virtual Reality OER Application to Teach Web Accessibility","Awareness of web accessibility issues is necessary for, amongst other things, good website design. Good website design can mean the difference between disabled users being able to access the website content, or not. This paper describes the impact of a student-led project to develop a VR application, as an Open Education Resource (OER), to increase users’ knowledge and awareness of accessibility. An evaluation for the intervention delivered by the VR application was conducted, according to which, the VR application generally increased knowledge and awareness of web accessibility, but also had a negative impact on some users. The project targetted a Human Computer Interaction (HCI) class taught at the first Sino-foreign higher education institution, University of Nottingham Ningbo China (UNNC). UNNC has already been involved in research into flipped classrooms, technology-enhanced teaching, and the development of several OERs. This paper introduces the background, motivation and objectives, design, and specification of the VR application. The impact of the application on users is evaluated, and some possible future work is discussed.",[7648,7077,5407,595],"Tang, Chengke",[21,7081,5411,599],"https:\u002F\u002Fdoi.org\u002F10.1109\u002Fcompsac51774.2021.00156","W3199117700",[23,4390,868,867,4387,7653,869,7654,1106],"Web accessibility","Web standards",{"type":39,"children":7656,"toc":7661},[7657],{"type":42,"tag":43,"props":7658,"children":7659},{},[7660],{"type":47,"value":7646},{"title":8,"searchDepth":49,"depth":49,"links":7662},[],"content:publications:2021:creating-a-virtual-reality-oer-application-to-teach-web-accessibility.md","publications\u002F2021\u002Fcreating-a-virtual-reality-oer-application-to-teach-web-accessibility.md","publications\u002F2021\u002Fcreating-a-virtual-reality-oer-application-to-teach-web-accessibility",{"_path":7667,"_dir":7193,"_draft":7,"_partial":7,"_locale":8,"title":7668,"description":7669,"_hidden":7,"authors":7670,"authors_orcid":7671,"year":7203,"doi":7672,"openalex_id":7673,"venue":6726,"abstract_screenshot":7674,"keywords":7675,"body":7680,"_type":51,"_id":7688,"_source":53,"_file":7689,"_stem":7690,"_extension":56,"locale":57},"\u002Fpublications\u002F2021\u002Fdata-augmentation-by-morphological-mixup-for-solving-raven-s-progressive-matrice","Data augmentation by morphological mixup for solving Raven's Progressive Matrices","Raven's Progressive Matrices (RPMs) are frequently used in testing human's visual reasoning ability. Recent advances of RPM-like datasets and solution models partially address the challenges of visually understanding the RPM questions and logically reasoning the missing answers. In view of the poor generalization performance due to insufficient samples in RPM datasets, we propose an effective scheme, namely Candidate Answer Morphological Mixup (CAM-Mix). CAM-Mix serves as a data augmentation strategy by gray-scale image morphological mixup, which regularizes various solution methods and overcomes the model overfitting problem. By creating new negative candidate answers semantically similar to the correct answers, a more accurate decision boundary could be defined. By applying the proposed data augmentation method, a significant and consistent performance improvement is achieved on various RPM-like datasets compared with the state-of-the-art models.",[7409,6111,12],[7415,6113,15],"https:\u002F\u002Fdoi.org\u002F10.48550\u002Farxiv.2103.05222","W3215125239","data-augmentation-by-morphological-mixup-for-solving-raven-s-progressive-matrice.png",[7676,7677,23,6144,37,3332,4004,215,7678,4876,34,7679,632],"Raven's Progressive Matrices","Overfitting","Boundary (topology)","Cognition",{"type":39,"children":7681,"toc":7686},[7682],{"type":42,"tag":43,"props":7683,"children":7684},{},[7685],{"type":47,"value":7669},{"title":8,"searchDepth":49,"depth":49,"links":7687},[],"content:publications:2021:data-augmentation-by-morphological-mixup-for-solving-raven-s-progressive-matrice.md","publications\u002F2021\u002Fdata-augmentation-by-morphological-mixup-for-solving-raven-s-progressive-matrice.md","publications\u002F2021\u002Fdata-augmentation-by-morphological-mixup-for-solving-raven-s-progressive-matrice",{"_path":7692,"_dir":7193,"_draft":7,"_partial":7,"_locale":8,"title":7693,"description":7694,"_hidden":7,"Testing for Verification of Advanced Driver-Assistance Systems\" authors":7695,"authors_orcid":7698,"year":7203,"doi":7700,"openalex_id":7701,"venue":4499,"abstract_screenshot":21,"keywords":7702,"body":7703,"_type":51,"_id":7711,"_source":53,"_file":7712,"_stem":7713,"_extension":56,"locale":57},"\u002Fpublications\u002F2021\u002Fdataset-accompanying-the-paper-enhancing-euro-ncap-standards-with-metamorphic-te","Dataset accompanying the paper \"Enhancing Euro NCAP Standards with Metamorphic","These labpackage files are open for interested readers and researchers to validate, replicate and extend our following paper: M. Iqbal, J. C. Han, Z. Q. Zhou, and D. Towey, “Enhancing Euro NCAP standards with metamorphic testing for verification of advanced driver-assistance systems,” in Proceedings of the IEEE\u002FACM 6th International Workshop on Metamorphic Testing (MET ’21), in conjunction with the 43rd International Conference on Software Engineering (ICSE ’21), 2021. Here is the abstract of our paper: ADASs have become increasingly popular. To ensure their safety, simulation testing is essential. In this research, we conducted a case study to investigate the fault- detection effectiveness of existing ADAS testing standards: We tested the Lane Keeping Assist System(LKAS), which is a prebuilt ADAS module of MATLAB and Simulink. We first tested LKAS using the European New Car Assessment Programme (Euro NCAP) that contains 40 prebuilt driving scenarios in MATLAB. Our results show that none of the 40 scenarios detected any failure. We then continued the tests by applying a simple metamorphic relation“equivalence under geometric transformation,” and a previously unknown real-life bug in LKAS was immediately revealed. We reported this finding to the MATLAB team in the US, who then confirmed the bug and corrected the LKAS code. This research provides a strong case for incorporating metamorphic testing into ADAS testing standards and protocols. Please refer to the README.pdf file for further instructions on the usage of our test data.",[7696,7697,1156,595],"Iqbal, Muhammad","Han, Jia Cheng",[7699,21,1158,599],"0000-0002-2778-949X","https:\u002F\u002Fdoi.org\u002F10.5281\u002Fzenodo.4584644","W4393423710",[3788,23,180,3790,3789],{"type":39,"children":7704,"toc":7709},[7705],{"type":42,"tag":43,"props":7706,"children":7707},{},[7708],{"type":47,"value":7694},{"title":8,"searchDepth":49,"depth":49,"links":7710},[],"content:publications:2021:dataset-accompanying-the-paper-enhancing-euro-ncap-standards-with-metamorphic-te.md","publications\u002F2021\u002Fdataset-accompanying-the-paper-enhancing-euro-ncap-standards-with-metamorphic-te.md","publications\u002F2021\u002Fdataset-accompanying-the-paper-enhancing-euro-ncap-standards-with-metamorphic-te",{"_path":7715,"_dir":7193,"_draft":7,"_partial":7,"_locale":8,"title":7716,"description":7717,"_hidden":7,"US–China relations\" authors":7718,"authors_orcid":7719,"year":7203,"doi":7721,"openalex_id":7722,"venue":5852,"abstract_screenshot":21,"keywords":7723,"body":7730,"_type":51,"_id":7738,"_source":53,"_file":7739,"_stem":7740,"_extension":56,"locale":57},"\u002Fpublications\u002F2021\u002Fdecoupling-in-science-and-education-a-collateral-damage-beyond-deteriorating-us","Decoupling in science and education: A collateral damage beyond deterioratin","Abstract Deteriorating relations between the USA and China since 2018 have extended to education and scientific research arenas. We put the US–China science and education in a historical perspective and describe the win–win situation when both countries collaborated. We discuss an ongoing loss–loss scenario of the decoupling and speculate its far-reaching adverse impacts beyond bilateral territories. We call for actions to be taken for a brighter future by the leaderships in both countries.",[6909,65,7175,7176],[6914,70,7720,7180],"0000-0001-6276-1831","https:\u002F\u002Fdoi.org\u002F10.1093\u002Fscipol\u002Fscab035","W3160460498",[282,7724,7725,7726,3468,1358,7727,7728,1380,36,3259,179,7729,23],"Decoupling (probability)","Collateral damage","Collateral","Development economics","Political economy","Criminology",{"type":39,"children":7731,"toc":7736},[7732],{"type":42,"tag":43,"props":7733,"children":7734},{},[7735],{"type":47,"value":7717},{"title":8,"searchDepth":49,"depth":49,"links":7737},[],"content:publications:2021:decoupling-in-science-and-education-a-collateral-damage-beyond-deteriorating-us.md","publications\u002F2021\u002Fdecoupling-in-science-and-education-a-collateral-damage-beyond-deteriorating-us.md","publications\u002F2021\u002Fdecoupling-in-science-and-education-a-collateral-damage-beyond-deteriorating-us",{"_path":7742,"_dir":7193,"_draft":7,"_partial":7,"_locale":8,"title":7743,"description":7744,"_hidden":7,"authors":7745,"authors_orcid":7747,"year":7203,"doi":7748,"openalex_id":7749,"venue":4539,"abstract_screenshot":21,"keywords":7750,"body":7756,"_type":51,"_id":7764,"_source":53,"_file":7765,"_stem":7766,"_extension":56,"locale":57},"\u002Fpublications\u002F2021\u002Fdt-slam-dynamic-thresholding-based-corner-point-extraction-in-slam-system","DT-SLAM: Dynamic Thresholding Based Corner Point Extraction in SLAM System","Visual localization estimation is highly depended on the quality of video frames or captured images. Estimation quality may be affected by the poor visibility, low background texture and overexposure. Low quality frames with blurred edges and poor contrast pose tremendous difficulties for corner point detection in SLAM impacting the overall accuracy of estimation. This paper introduces DT-SLAM, a dynamic self-adaptive threshold (DSAT) approach for ORB corner point extraction in FAST to improve SLAM’s localization performance. The proposed method replaces the existing static threshold-based ORB extraction approach, enabling improved performance in complex real-world scenes. In addition, this study introduces a threshold switching mechanism (TSM) to replace the existing SLAM’s frame-level and cell-level thresholds for corner point extraction. The proposed DT-SLAM approach is validated using the TUM RGB-D and EuRoC benchmark datasets for location tracking performances. The results indicate that the proposed DT-SLAM outperforms the current state-of-the-art ORB-SLAM3, especially in challenging environments.",[7746,5407,5667],"Wu, Renjie",[21,5411,5670],"https:\u002F\u002Fdoi.org\u002F10.1109\u002Faccess.2021.3092000","W3175762042",[37,23,4391,7751,7752,209,5747,7753,7754,7599,4004,7755],"Simultaneous localization and mapping","Thresholding","Frame (networking)","RGB color model","Mobile robot",{"type":39,"children":7757,"toc":7762},[7758],{"type":42,"tag":43,"props":7759,"children":7760},{},[7761],{"type":47,"value":7744},{"title":8,"searchDepth":49,"depth":49,"links":7763},[],"content:publications:2021:dt-slam-dynamic-thresholding-based-corner-point-extraction-in-slam-system.md","publications\u002F2021\u002Fdt-slam-dynamic-thresholding-based-corner-point-extraction-in-slam-system.md","publications\u002F2021\u002Fdt-slam-dynamic-thresholding-based-corner-point-extraction-in-slam-system",{"_path":7768,"_dir":7193,"_draft":7,"_partial":7,"_locale":8,"title":7769,"description":7770,"_hidden":7,"Advanced Driver-Assistance Systems authors":7771,"authors_orcid":7772,"year":7203,"doi":7773,"openalex_id":7774,"venue":21,"abstract_screenshot":21,"keywords":7775,"body":7776,"_type":51,"_id":7784,"_source":53,"_file":7785,"_stem":7786,"_extension":56,"locale":57},"\u002Fpublications\u002F2021\u002Fenhancing-euro-ncap-standards-with-metamorphic-testing-for-verification-of-advan","Enhancing Euro NCAP Standards with Metamorphic Testing for Verification of","Advanced Driver-Assistance Systems (ADASs) have become increasingly popular. To ensure safety, simulation testing is essential. In this research, we conducted a case study to investigate the fault-detection effectiveness of existing ADAS testing standards: We tested the Lane Keeping Assist System (LKAS), which is a prebuilt ADAS module of MATLAB and Simulink. We first tested LKAS using the European New Car Assessment Programme (Euro NCAP), which contains 40 prebuilt driving scenarios in MATLAB. Our results show that none of the 40 scenarios detected any failure. We then continued the tests by applying a simple metamorphic relation \"equivalence under geometric transformation,\" and a previously unknown real-life bug in LKAS was immediately revealed. We reported this finding to the MATLAB team in the US, who then confirmed the bug and corrected the LKAS code. This research provides a strong case for incorporating metamorphic testing into ADAS testing standards and protocols.",[7696,7697,1156,595],[7699,21,1158,599],"https:\u002F\u002Fdoi.org\u002F10.1109\u002Fmet52542.2021.00013","W3185534614",[1406,23,4239,4241,606,4965,984,4242,139,37,181,110],{"type":39,"children":7777,"toc":7782},[7778],{"type":42,"tag":43,"props":7779,"children":7780},{},[7781],{"type":47,"value":7770},{"title":8,"searchDepth":49,"depth":49,"links":7783},[],"content:publications:2021:enhancing-euro-ncap-standards-with-metamorphic-testing-for-verification-of-advan.md","publications\u002F2021\u002Fenhancing-euro-ncap-standards-with-metamorphic-testing-for-verification-of-advan.md","publications\u002F2021\u002Fenhancing-euro-ncap-standards-with-metamorphic-testing-for-verification-of-advan",{"_path":7788,"_dir":7193,"_draft":7,"_partial":7,"_locale":8,"title":7789,"description":7790,"_hidden":7,"authors":7791,"authors_orcid":7792,"year":7203,"doi":7793,"openalex_id":7794,"venue":21,"abstract_screenshot":21,"keywords":7795,"body":7797,"_type":51,"_id":7805,"_source":53,"_file":7806,"_stem":7807,"_extension":56,"locale":57},"\u002Fpublications\u002F2021\u002Fevolutionary-inspired-strategy-for-particle-distribution-optimization-in-auxilia","Evolutionary-Inspired Strategy for Particle Distribution Optimization in Auxiliary Particle Filtering Algorithm Based Indoor Positioning","Particle filter (PF) has been widely used in the target state and position estimations owing to its superiority in tackling the complicated nonlinear problems with arbitrary distributions. As an advanced PF algorithm, Sequential Importance Resampling (SIR) has been widely used for indoor positioning. Since the proposal density of SIR is independent of measurement, the algorithm is vulnerable to outliers. Although the Auxiliary SIR (ASIR) overcomes this problem by performing a two-stage sampling, its positioning accuracy is degraded when the process noise in the filter is large. In order to tackle this problem, an improved ASIR named evolutionary-strategy-integrated ASIR algorithm (EASIR) is proposed in this paper for accuracy improvement in indoor positioning. Tests are carried out for assessing the positioning performance of the proposed algorithm, and positioning accuracy and computation efficiency are considered as the performance metrics in the assessment. Comparing with the SIR and ASIR, the results show that the EASIR achieves better positioning accuracy when the same number of particles are used for data processing and has better robustness when the process noise in the filter is large. Moreover, the computation efficiency of EASIR is generally affordable for real-time applications.",[7246,3376,12,7247],[7249,3380,15,7250],"https:\u002F\u002Fdoi.org\u002F10.1109\u002Fipin51156.2021.9662586","W4206785350",[7256,332,23,7255,353,7796,330,213,7258,37],"Outlier",{"type":39,"children":7798,"toc":7803},[7799],{"type":42,"tag":43,"props":7800,"children":7801},{},[7802],{"type":47,"value":7790},{"title":8,"searchDepth":49,"depth":49,"links":7804},[],"content:publications:2021:evolutionary-inspired-strategy-for-particle-distribution-optimization-in-auxilia.md","publications\u002F2021\u002Fevolutionary-inspired-strategy-for-particle-distribution-optimization-in-auxilia.md","publications\u002F2021\u002Fevolutionary-inspired-strategy-for-particle-distribution-optimization-in-auxilia",{"_path":7809,"_dir":7193,"_draft":7,"_partial":7,"_locale":8,"title":7810,"description":7811,"_hidden":7,"the Supervised Machine Learning Approach\" authors":7812,"authors_orcid":7819,"year":7203,"doi":7827,"openalex_id":7828,"venue":7829,"abstract_screenshot":21,"keywords":7830,"body":7834,"_type":51,"_id":7842,"_source":53,"_file":7843,"_stem":7844,"_extension":56,"locale":57},"\u002Fpublications\u002F2021\u002Fhydrogen-production-by-fluidized-bed-reactors-a-quantitative-perspective-using-t","Hydrogen Production by Fluidized Bed Reactors: A Quantitative Perspective Usin","The current hydrogen generation technologies, especially biomass gasification using fluidized bed reactors (FBRs), were rigorously reviewed. There are involute operational parameters in a fluidized bed gasifier that determine the anticipated outcomes for hydrogen production purposes. However, limited reviews are present that link these parametric conditions with the corresponding performances based on experimental data collection. Using the constructed artificial neural networks (ANNs) as the supervised machine learning algorithm for data training, the operational parameters from 52 literature reports were utilized to perform both the qualitative and quantitative assessments of the performance, such as the hydrogen yield (HY), hydrogen content (HC) and carbon conversion efficiency (CCE). Seven types of operational parameters, including the steam-to-biomass ratio (SBR), equivalent ratio (ER), temperature, particle size of the feedstock, residence time, lower heating value (LHV) and carbon content (CC), were closely investigated. Six binary parameters have been identified to be statistically significant to the performance parameters (hydrogen yield (HY)), hydrogen content (HC) and carbon conversion efficiency (CCE) by analysis of variance (ANOVA). The optimal operational conditions derived from the machine leaning were recommended according to the needs of the outcomes. This review may provide helpful insights for researchers to comprehensively consider the operational conditions in order to achieve high hydrogen production using fluidized bed reactors during biomass gasification.",[7813,7300,7814,7815,7816,7817,7302,7296,7347,7818,7303,7304],"Lian, Zheng","Zhang, Xiyue","Yusuf, Abubakar","Famiyeh, Lord","Murindababisha, David","Wang, Yunshan",[7820,7821,7822,7823,21,7824,7310,7825,7349,7826,7311,7312],"0000-0002-7810-6687","0000-0003-2309-9106","0000-0003-1649-7165","0000-0001-9344-7642","0000-0002-3756-2950","0000-0002-2537-1989","0000-0002-7737-3345","https:\u002F\u002Fdoi.org\u002F10.3390\u002Fj4030022","W3180615795","J — Multidisciplinary Scientific Journal",[7831,7326,7832,7833,7323,926,7359,3635,23,179,753],"Fluidized bed","Process engineering","Biomass (ecology)",{"type":39,"children":7835,"toc":7840},[7836],{"type":42,"tag":43,"props":7837,"children":7838},{},[7839],{"type":47,"value":7811},{"title":8,"searchDepth":49,"depth":49,"links":7841},[],"content:publications:2021:hydrogen-production-by-fluidized-bed-reactors-a-quantitative-perspective-using-t.md","publications\u002F2021\u002Fhydrogen-production-by-fluidized-bed-reactors-a-quantitative-perspective-using-t.md","publications\u002F2021\u002Fhydrogen-production-by-fluidized-bed-reactors-a-quantitative-perspective-using-t",{"_path":7846,"_dir":7193,"_draft":7,"_partial":7,"_locale":8,"title":7847,"description":7848,"_hidden":7,"Models for Fischer–Tropsch Synthesis authors":7849,"authors_orcid":7852,"year":7203,"doi":7857,"openalex_id":7858,"venue":7859,"abstract_screenshot":21,"keywords":7860,"body":7866,"_type":51,"_id":7874,"_source":53,"_file":7875,"_stem":7876,"_extension":56,"locale":57},"\u002Fpublications\u002F2021\u002Fkinetic-study-of-product-distribution-using-various-data-driven-and-statistical","Kinetic Study of Product Distribution Using Various Data-Driven and Statistical",") and the olefin to paraffin ratio (OPR) within acceptable uncertainties. With additional validation data sets (15 × 36 matrix with total 540 data sets), the uncertainties of using three different models were compared and the outcomes were: RBFNN (±5% uncertainties), RSM (±10% uncertainties), and CKGA (±30% uncertainties), respectively. A new effective strategy for kinetic study of the complex FT synthesis is proposed: RBFNN is used for data matrix generation with a limited number of experimental data sets (due to its fast converge and less computation time), CKGA is used for mechanism selections by the Langmuir-Hinshelwood-Hougen-Watson (LHHW) approach using a genetic algorithm to find out potential reaction pathways, and RSM is used for statistical analysis of the investigated data matrix (generated from RBFNN through central composite design) upon responses and subsequent singular\u002Fmultiple optimizations. The proposed strategy is a very useful and practical tool in process engineering design and practice for the product distribution during FT synthesis.",[7300,7850,7814,7815,7851,7302,7296,7347,7818,7303,7304],"Hu, Jing","Qi, Binbin",[7853,7854,7822,21,7855,7310,7856,7349,7826,7311,7312],"0000-0002-1446-3634","0000-0002-9197-0453","0000-0002-0970-2442","0009-0003-2694-9740","https:\u002F\u002Fdoi.org\u002F10.1021\u002Facsomega.1c03851","W3204470425","ACS Omega",[7318,7861,7862,7863,7864,23,106,7865,332,3961,1009,753,215,7356],"Product distribution","Matrix (chemical analysis)","Fischer–Tropsch process","Biological system","Design matrix",{"type":39,"children":7867,"toc":7872},[7868],{"type":42,"tag":43,"props":7869,"children":7870},{},[7871],{"type":47,"value":7848},{"title":8,"searchDepth":49,"depth":49,"links":7873},[],"content:publications:2021:kinetic-study-of-product-distribution-using-various-data-driven-and-statistical.md","publications\u002F2021\u002Fkinetic-study-of-product-distribution-using-various-data-driven-and-statistical.md","publications\u002F2021\u002Fkinetic-study-of-product-distribution-using-various-data-driven-and-statistical",{"_path":7878,"_dir":7193,"_draft":7,"_partial":7,"_locale":8,"title":7879,"description":7880,"_hidden":7,"Histone Demethylase 1 authors":7881,"authors_orcid":7889,"year":7203,"doi":7895,"openalex_id":7896,"venue":7897,"abstract_screenshot":21,"keywords":7898,"body":7907,"_type":51,"_id":7915,"_source":53,"_file":7916,"_stem":7917,"_extension":56,"locale":57},"\u002Fpublications\u002F2021\u002Fmachine-learning-enabled-virtual-screening-for-inhibitors-of-lysine-specific-his","Machine-Learning-Enabled Virtual Screening for Inhibitors of Lysine-Specific","A machine learning approach has been applied to virtual screening for lysine specific demethylase 1 (LSD1) inhibitors. LSD1 is an important anti-cancer target. Machine learning models to predict activity were constructed using Morgan molecular fingerprints. The dataset, consisting of 931 molecules with LSD1 inhibition activity, was obtained from the ChEMBL database. An evaluation of several candidate algorithms on the main dataset revealed that the support vector regressor gave the best model, with a coefficient of determination (R2) of 0.703. Virtual screening, using this model, identified five predicted potent inhibitors from the ZINC database comprising more than 300,000 molecules. The virtual screening recovered a known inhibitor, RN1, as well as four compounds where activity against LSD1 had not previously been suggested. Thus, we performed a machine-learning-enabled virtual screening of LSD1 inhibitors using only the structural information of the molecules.",[7882,7883,5667,7884,7885,7886,7887,7888],"Zhou, Jiajun","Wu, Shiying","Chen, Tianwei","He, Ziqi","Lei, Yukun","Tang, Bencan","Hirst, Jonathan D.",[7890,21,5670,7891,21,7892,7893,7894],"0000-0002-5062-4183","0009-0006-1292-0826","0009-0004-8268-7068","0000-0002-4301-2496","0000-0002-2726-0983","https:\u002F\u002Fdoi.org\u002F10.3390\u002Fmolecules26247492","W4200070360","Molecules",[7899,7900,7901,3688,4606,215,23,7902,7903,753,37,7904,4608,7905,7906],"chEMBL","Virtual screening","Demethylase","Drug discovery","Small molecule","Histone","Biochemistry","Gene",{"type":39,"children":7908,"toc":7913},[7909],{"type":42,"tag":43,"props":7910,"children":7911},{},[7912],{"type":47,"value":7880},{"title":8,"searchDepth":49,"depth":49,"links":7914},[],"content:publications:2021:machine-learning-enabled-virtual-screening-for-inhibitors-of-lysine-specific-his.md","publications\u002F2021\u002Fmachine-learning-enabled-virtual-screening-for-inhibitors-of-lysine-specific-his.md","publications\u002F2021\u002Fmachine-learning-enabled-virtual-screening-for-inhibitors-of-lysine-specific-his",{"_path":7919,"_dir":7193,"_draft":7,"_partial":7,"_locale":8,"title":7920,"description":7921,"_hidden":7,"authors":7922,"authors_orcid":7924,"year":7203,"doi":7926,"openalex_id":7927,"venue":21,"abstract_screenshot":21,"keywords":7928,"body":7933,"_type":51,"_id":7941,"_source":53,"_file":7942,"_stem":7943,"_extension":56,"locale":57},"\u002Fpublications\u002F2021\u002Fmetamorphic-testing-for-block-ciphers","Metamorphic Testing for Block Ciphers","Information is indispensable in modern society. People’s daily communication and work depend on information transmission. Unsafe storage or transmission of data may result in privacy and security problems. One way to attempt to prevent such issues is to use encryption algorithms to transform information into encrypted forms. Because the encryption steps of most encryption algorithms are complex, deciding the correctness of the encrypted output may take a long time in practice. This kind of problem is called the Test Oracle problem. In contrast to traditional software testing, Metamorphic Testing (MT) does not focus on the correctness of each individual output, but examines whether the inputs and outputs of multiple executions of a Program Under Test (PUT) satisfy necessary relations of the PUT, called metamorphic relations. This paper reports on an experience of applying MT to test three encryption algorithms — Data Encryption Standard (DES), Triple Data Encryption Standard (3DES), and Advanced Encryption Standard (AES).",[7923,595,596,1156],"Zhang, Mingjia",[7925,599,600,1158],"0000-0001-9644-0219","https:\u002F\u002Fdoi.org\u002F10.1109\u002Fcompsac51774.2021.00184","W3201031582",[23,7929,3788,7930,7931,7932,180,3789,5015,34,76],"Block cipher","Block (permutation group theory)","Block size","Cryptography",{"type":39,"children":7934,"toc":7939},[7935],{"type":42,"tag":43,"props":7936,"children":7937},{},[7938],{"type":47,"value":7921},{"title":8,"searchDepth":49,"depth":49,"links":7940},[],"content:publications:2021:metamorphic-testing-for-block-ciphers.md","publications\u002F2021\u002Fmetamorphic-testing-for-block-ciphers.md","publications\u002F2021\u002Fmetamorphic-testing-for-block-ciphers",{"_path":7945,"_dir":7193,"_draft":7,"_partial":7,"_locale":8,"title":7946,"description":7947,"_hidden":7,"authors":7948,"authors_orcid":7950,"year":7203,"doi":7952,"openalex_id":7953,"venue":21,"abstract_screenshot":21,"keywords":7954,"body":7956,"_type":51,"_id":7964,"_source":53,"_file":7965,"_stem":7966,"_extension":56,"locale":57},"\u002Fpublications\u002F2021\u002Fmetamorphic-testing-of-fake-news-detection-software","Metamorphic Testing of Fake News Detection Software","Since the popularization of social media, news has entered our lives digitally. While news is spreading broader and faster, fake news is becoming an increasingly popular topic. Fake news detection is therefore important in both social media and research areas. With artificial intelligence technology, software engineers have developed a lot of fake news detection systems. One of the biggest challenges for such systems is that they may face the oracle problem, which means that there may not be a way, or it may take too long time, to confirm the correctness of a specific output. Metamorphic Testing has been applied successfully to alleviate the oracle problem in many different areas, including in artificial intelligence. In this paper, we propose several metamorphic relations for fake news detection and report on experiments using metamorphic testing on fake news detection applications.",[7949,595,596,1156],"Ma, Yingrui",[7951,599,600,1158],"0009-0000-1588-4193","https:\u002F\u002Fdoi.org\u002F10.1109\u002Fcompsac51774.2021.00224","W3200818094",[605,3227,23,4034,139,7955,691,180,37,3493,869,607,332],"Fake news",{"type":39,"children":7957,"toc":7962},[7958],{"type":42,"tag":43,"props":7959,"children":7960},{},[7961],{"type":47,"value":7947},{"title":8,"searchDepth":49,"depth":49,"links":7963},[],"content:publications:2021:metamorphic-testing-of-fake-news-detection-software.md","publications\u002F2021\u002Fmetamorphic-testing-of-fake-news-detection-software.md","publications\u002F2021\u002Fmetamorphic-testing-of-fake-news-detection-software",{"_path":7968,"_dir":7193,"_draft":7,"_partial":7,"_locale":8,"title":7969,"description":7970,"_hidden":7,"authors":7971,"authors_orcid":7973,"year":7203,"doi":7974,"openalex_id":7975,"venue":7976,"abstract_screenshot":21,"keywords":7977,"body":7979,"_type":51,"_id":7987,"_source":53,"_file":7988,"_stem":7989,"_extension":56,"locale":57},"\u002Fpublications\u002F2021\u002Fmission-oriented-mega-r-amp-d-programs-governance-and-policy","Mission-Oriented Mega-R&D Programs: Governance and Policy","Using the concepts of technology goal (T), effective organization (O), and market end-user (M), this paper proposes a TOM framework for analyzing the contextual characteristics of adoption of the MMRD model as a tool of R&D governance. Applying the framework to cases across multiple historical periods, sectors, and countries, we find that R&D with a clear and specific technology goal, dominance of R&D by government agencies, and public sectors as end-users create an appropriate scenario for a government to adopt the MMRD model, while in doing so the government should also take into consideration such factors as economic efficiency, national security, and public interests. We evaluate the TOM framework based on its application to China's practice, particularly its ongoing mega-engineering programs (MEPs).",[7972,65],"Yutao, Sun",[21,70],"https:\u002F\u002Fdoi.org\u002F10.3724\u002Fsp.j.2096-5141.2021.0007","W4289821018","Journal of Advances in Health",[7978,3257,178,3714,1358,429,3597],"Mega-",{"type":39,"children":7980,"toc":7985},[7981],{"type":42,"tag":43,"props":7982,"children":7983},{},[7984],{"type":47,"value":7970},{"title":8,"searchDepth":49,"depth":49,"links":7986},[],"content:publications:2021:mission-oriented-mega-r-amp-d-programs-governance-and-policy.md","publications\u002F2021\u002Fmission-oriented-mega-r-amp-d-programs-governance-and-policy.md","publications\u002F2021\u002Fmission-oriented-mega-r-amp-d-programs-governance-and-policy",{"_path":7991,"_dir":7193,"_draft":7,"_partial":7,"_locale":8,"title":7992,"description":8,"_hidden":7,"authors":7993,"authors_orcid":7996,"year":7203,"doi":7999,"openalex_id":8000,"venue":8001,"abstract_screenshot":21,"keywords":8002,"body":8003,"_type":51,"_id":8007,"_source":53,"_file":8008,"_stem":8009,"_extension":56,"locale":57},"\u002Fpublications\u002F2021\u002Fmodeling-biohydrogen-production-using-different-data-driven-approaches","Modeling biohydrogen production using different data driven approaches",[7300,7994,7995,7818,7296,7302,7347,7304],"Tang, Mingzhu","Ling, Jiangang",[7997,21,7998,7826,7306,7310,7349,7312],"0000-0003-2664-3605","0000-0001-7857-5152","https:\u002F\u002Fdoi.org\u002F10.1016\u002Fj.ijhydene.2021.06.122","W3178473950","International Journal of Hydrogen Energy",[7318,7319,7864,23,5180,632,4513,5100,135,926,753,181,37,215,7326,179,4608],{"type":39,"children":8004,"toc":8005},[],{"title":8,"searchDepth":49,"depth":49,"links":8006},[],"content:publications:2021:modeling-biohydrogen-production-using-different-data-driven-approaches.md","publications\u002F2021\u002Fmodeling-biohydrogen-production-using-different-data-driven-approaches.md","publications\u002F2021\u002Fmodeling-biohydrogen-production-using-different-data-driven-approaches",{"_path":8011,"_dir":7193,"_draft":7,"_partial":7,"_locale":8,"title":8012,"description":8013,"_hidden":7,"R&D subsidies authors":8014,"authors_orcid":8016,"year":7203,"doi":8018,"openalex_id":8019,"venue":553,"abstract_screenshot":21,"keywords":8020,"body":8023,"_type":51,"_id":8031,"_source":53,"_file":8032,"_stem":8033,"_extension":56,"locale":57},"\u002Fpublications\u002F2021\u002Fmore-money-more-honey-an-examination-of-additionality-of-china-s-government-r-am","More money, more honey? An examination of additionality of China’s government","This study considers the interaction effects of government subsidies, financial constraints, and ownership structure on the firm’s net research & development (R&D) based on a sample of 3440 Chinese-listed firms during 2000-2019. Our results indicate that R&D subsidies reduce financial constraints irrespective of ownership type; however, the reduction appears more pronounced for private-owned enterprises (POEs) compared with state-owned enterprises (SOEs). Further analysis reveals that the impact of R&D subsidies on R&D investments depends on the interactive effect between financial constraint and ownership type. For financially constrained SOEs, subsidies spur net R&D investment whereas this is not the case for financially constrained POEs. We also examine the potential factors through which ownership types and financial constraints affect innovation input, namely, institutional development and industrial competition. Our evidence indicates that, in a more institutionally developed province, the effect of subsidies on net R&D input is negative for SOEs, but positive for POEs. In a more competitive industry, SOEs tend to face less agency risk and stronger monitoring, while POEs depend more on their financial slack. Our study challenges the ‘more money, more innovation investment’ story, suggesting that alleviating financial constraints does not necessarily stimulate more net R&D investments.",[8015,1287,268],"Wang, Miao",[8017,1291,272],"0000-0003-3903-2643","https:\u002F\u002Fdoi.org\u002F10.1080\u002F1351847x.2021.1918202","W3159418030",[4855,8021,1438,3255,178,3333,8022,749,429,282,36,285,1443,7064,5153],"Competition (biology)","Additionality",{"type":39,"children":8024,"toc":8029},[8025],{"type":42,"tag":43,"props":8026,"children":8027},{},[8028],{"type":47,"value":8013},{"title":8,"searchDepth":49,"depth":49,"links":8030},[],"content:publications:2021:more-money-more-honey-an-examination-of-additionality-of-china-s-government-r-am.md","publications\u002F2021\u002Fmore-money-more-honey-an-examination-of-additionality-of-china-s-government-r-am.md","publications\u002F2021\u002Fmore-money-more-honey-an-examination-of-additionality-of-china-s-government-r-am",{"_path":8035,"_dir":7193,"_draft":7,"_partial":7,"_locale":8,"title":8036,"description":8037,"_hidden":7,"authors":8038,"authors_orcid":8042,"year":7203,"doi":8046,"openalex_id":8047,"venue":21,"abstract_screenshot":21,"keywords":8048,"body":8052,"_type":51,"_id":8060,"_source":53,"_file":8061,"_stem":8062,"_extension":56,"locale":57},"\u002Fpublications\u002F2021\u002Fmt4ns-metamorphic-testing-for-network-scanning","MT4NS: Metamorphic Testing for Network Scanning","Network scanning tools play an important role in network information gathering, which is the first step in penetration testing. They are tools that can help both hackers and security auditors to detect the hosts in the network environment. Choice of scanner should take consideration of both the speed and the effectiveness of the scanner. In this paper, we report on an experience of using Metamorphic Testing to test two scanners, Nmap and Masscan. Seven Metamorphic Relations for network scanners are presented, and an investigation into their application is reported. The results show the potential for Metamorphic Testing to evaluate and enable comparisons of scanners, with possible problems identified in both scanners under test.",[8039,595,8040,8041,1156],"Zhang, Zhirui","Ying, Zhihao","Zhang, Yifan",[8043,599,8044,8045,1158],"0000-0003-1385-3742","0000-0002-4461-7155","0000-0003-1289-2192","https:\u002F\u002Fdoi.org\u002F10.1109\u002Fmet52542.2021.00010","W3186508261",[23,8049,8050,8051,37,180],"Scanner","Hacker","Audit",{"type":39,"children":8053,"toc":8058},[8054],{"type":42,"tag":43,"props":8055,"children":8056},{},[8057],{"type":47,"value":8037},{"title":8,"searchDepth":49,"depth":49,"links":8059},[],"content:publications:2021:mt4ns-metamorphic-testing-for-network-scanning.md","publications\u002F2021\u002Fmt4ns-metamorphic-testing-for-network-scanning.md","publications\u002F2021\u002Fmt4ns-metamorphic-testing-for-network-scanning",{"_path":8064,"_dir":7193,"_draft":7,"_partial":7,"_locale":8,"title":8065,"description":8066,"_hidden":7,"authors":8067,"authors_orcid":8070,"year":7203,"doi":8073,"openalex_id":8074,"venue":654,"abstract_screenshot":21,"keywords":8075,"body":8076,"_type":51,"_id":8084,"_source":53,"_file":8085,"_stem":8086,"_extension":56,"locale":57},"\u002Fpublications\u002F2021\u002Fmtkeras-an-automated-metamorphic-testing-platform","MTKeras: An Automated Metamorphic Testing Platform","This paper presents an automated, domain-independent, metamorphic testing platform called MTKeras. In this paper, we report on an investigation demonstrating the effectiveness and usability of MTKeras through five case studies in the four domains of image classification, sentiment analysis, search engines and database management systems. We also report on the effectiveness of combining metamorphic relation (input) patterns in individual metamorphic relations, enhancing the failure-finding abilities of the individual relations. The results of our experiments support combining patterns, and the use of MTKeras. The research reported in this paper shows the applicability of metamorphic relation patterns, and introduces a practical tool for the research community.",[8068,1156,596,8069,595],"Liu, Yelin","Liu, Yang",[8071,1158,600,8072,599],"0000-0001-6136-3364","0000-0001-7300-9215","https:\u002F\u002Fdoi.org\u002F10.1142\u002Fs021819402150039x","W3203931506",[23,859,4965,3788,1167,181,37,6950,607,868],{"type":39,"children":8077,"toc":8082},[8078],{"type":42,"tag":43,"props":8079,"children":8080},{},[8081],{"type":47,"value":8066},{"title":8,"searchDepth":49,"depth":49,"links":8083},[],"content:publications:2021:mtkeras-an-automated-metamorphic-testing-platform.md","publications\u002F2021\u002Fmtkeras-an-automated-metamorphic-testing-platform.md","publications\u002F2021\u002Fmtkeras-an-automated-metamorphic-testing-platform",{"_path":8088,"_dir":7193,"_draft":7,"_partial":7,"_locale":8,"title":8089,"description":8,"_hidden":7,"authors":8090,"authors_orcid":8092,"year":7203,"doi":8093,"openalex_id":8094,"venue":374,"abstract_screenshot":21,"keywords":8095,"body":8098,"_type":51,"_id":8102,"_source":53,"_file":8103,"_stem":8104,"_extension":56,"locale":57},"\u002Fpublications\u002F2021\u002Fnormalized-nonconformity-measures-for-automated-valuation-models","Normalized nonconformity measures for automated valuation models",[8091,4189],"Lim, Zhe",[21,4191],"https:\u002F\u002Fdoi.org\u002F10.1016\u002Fj.eswa.2021.115165","W3163453647",[8096,23,8097,287,428,181,3666,34,429,36],"Valuation (finance)","Independent and identically distributed random variables",{"type":39,"children":8099,"toc":8100},[],{"title":8,"searchDepth":49,"depth":49,"links":8101},[],"content:publications:2021:normalized-nonconformity-measures-for-automated-valuation-models.md","publications\u002F2021\u002Fnormalized-nonconformity-measures-for-automated-valuation-models.md","publications\u002F2021\u002Fnormalized-nonconformity-measures-for-automated-valuation-models",{"_path":8106,"_dir":7193,"_draft":7,"_partial":7,"_locale":8,"title":8107,"description":8108,"_hidden":7,"authors":8109,"authors_orcid":8110,"year":7203,"doi":8111,"openalex_id":8112,"venue":21,"abstract_screenshot":21,"keywords":8113,"body":8116,"_type":51,"_id":8124,"_source":53,"_file":8125,"_stem":8126,"_extension":56,"locale":57},"\u002Fpublications\u002F2021\u002Fnot-a-silver-bullet-but-a-silver-lining-metamorphic-marking-administration","Not a Silver Bullet, but a Silver Lining: Metamorphic Marking Administration","COVID-19 has caused heart-break and disruption. The People's Republic of China (PRC) was one of the first severely-impacted countries, but also one of the first to attempt to return to normalcy. Education, including Higher Education-the context of this paper-was disrupted, and the impact of these disruptions continues to be felt. A small consolation, or silver lining, has been the incredible efforts and innovations made by teachers to overcome the COVID-19 challenges. One such innovation is described in this paper: Drawing on the traditions of Metamorphic Exploration and Testing, the authors applied two different approaches to resolving a technical administration problem related to the management of assessments and marks for undergraduate software engineering team projects. This took place at University of Nottingham Ningbo China (UNNC), a Sino-foreign Higher Education Institution (HEI) with a history of staff-student collaboration, and education innovation. This paper outlines the experience and the insights learned from it. In addition to being of general interest to education administrators, especially those involved with project and marking administration, the innovative use of Metamorphic Testing ideas to develop the solution will be particularly interesting to computer scientists and software engineers.",[595,5407],[599,5411],"https:\u002F\u002Fdoi.org\u002F10.1109\u002Feducon46332.2021.9454074","W3175043346",[133,8114,3095,8115,282,4831,179,6927,1334,1380,3746,1358,1335,3259,3749,36],"Administration (probate law)","Silver bullet",{"type":39,"children":8117,"toc":8122},[8118],{"type":42,"tag":43,"props":8119,"children":8120},{},[8121],{"type":47,"value":8108},{"title":8,"searchDepth":49,"depth":49,"links":8123},[],"content:publications:2021:not-a-silver-bullet-but-a-silver-lining-metamorphic-marking-administration.md","publications\u002F2021\u002Fnot-a-silver-bullet-but-a-silver-lining-metamorphic-marking-administration.md","publications\u002F2021\u002Fnot-a-silver-bullet-but-a-silver-lining-metamorphic-marking-administration",{"_path":8128,"_dir":7193,"_draft":7,"_partial":7,"_locale":8,"title":8129,"description":8,"_hidden":7,"authors":8130,"authors_orcid":8131,"year":7203,"doi":8132,"openalex_id":8133,"venue":8134,"abstract_screenshot":21,"keywords":8135,"body":8140,"_type":51,"_id":8153,"_source":53,"_file":8154,"_stem":8155,"_extension":56,"locale":57},"\u002Fpublications\u002F2021\u002Fnovel-prior-position-determination-approaches-in-particle-filter-for-ultra-wideb","Novel prior position determination approaches in particle filter for ultra wideband (UWB)‐based indoor positioning",[7246,3376,12,7247],[7249,3380,15,7250],"https:\u002F\u002Fdoi.org\u002F10.1002\u002Fnavi.415","W3148195646","NAVIGATION Journal of the Institute of Navigation",[7256,6978,8136,23,8137,8138,8139,4391,3597,3789],"Position (finance)","Particle (ecology)","Filter (signal processing)","Acoustics",{"type":39,"children":8141,"toc":8149},[8142],{"type":42,"tag":8143,"props":8144,"children":8146},"h3",{"id":8145},"abstract",[8147],{"type":47,"value":8148},"Abstract",{"title":8,"searchDepth":49,"depth":49,"links":8150},[8151],{"id":8145,"depth":8152,"text":8148},3,"content:publications:2021:novel-prior-position-determination-approaches-in-particle-filter-for-ultra-wideb.md","publications\u002F2021\u002Fnovel-prior-position-determination-approaches-in-particle-filter-for-ultra-wideb.md","publications\u002F2021\u002Fnovel-prior-position-determination-approaches-in-particle-filter-for-ultra-wideb",{"_path":8157,"_dir":7193,"_draft":7,"_partial":7,"_locale":8,"title":8158,"description":8159,"_hidden":7,"authors":8160,"authors_orcid":8161,"year":7203,"doi":21,"openalex_id":8162,"venue":6726,"abstract_screenshot":8163,"keywords":8164,"body":8171,"_type":51,"_id":8179,"_source":53,"_file":8180,"_stem":8181,"_extension":56,"locale":57},"\u002Fpublications\u002F2021\u002Fone-shot-visual-reasoning-on-rpms-with-an-application-to-video-frame-prediction","One-shot Visual Reasoning on RPMs with an Application to Video Frame Prediction","Raven's Progressive Matrices (RPMs) are frequently used in evaluating human's visual reasoning ability. Researchers have made considerable effort in developing a system which could automatically solve the RPM problem, often through a black-box end-to-end Convolutional Neural Network (CNN) for both visual recognition and logical reasoning tasks. Towards the objective of developing a highly explainable solution, we propose a One-shot Human-Understandable ReaSoner (Os-HURS), which is a two-step framework including a perception module and a reasoning module, to tackle the challenges of real-world visual recognition and subsequent logical reasoning tasks, respectively. For the reasoning module, we propose a 2+1 formulation that can be better understood by humans and significantly reduces the model complexity. As a result, a precise reasoning rule can be deduced from one RPM sample only, which is not feasible for existing solution methods. The proposed reasoning module is also capable of yielding a set of reasoning rules, precisely modeling the human knowledge in solving the RPM problem. To validate the proposed method on real-world applications, an RPM-like One-shot Frame-prediction (ROF) dataset is constructed, where visual reasoning is conducted on RPMs constructed using real-world video frames instead of synthetic images. Experimental results on various RPM-like datasets demonstrate that the proposed Os-HURS achieves a significant and consistent performance gain compared with the state-of-the-art models.",[7409,6111,12],[7415,6113,15],"W3215779649","one-shot-visual-reasoning-on-rpms-with-an-application-to-video-frame-prediction.png",[8165,6020,23,37,7753,101,8166,5545,8167,8168,8169,8170,215,4391],"Visual reasoning","Shot (pellet)","Reasoning system","Qualitative reasoning","Black box","Deductive reasoning",{"type":39,"children":8172,"toc":8177},[8173],{"type":42,"tag":43,"props":8174,"children":8175},{},[8176],{"type":47,"value":8159},{"title":8,"searchDepth":49,"depth":49,"links":8178},[],"content:publications:2021:one-shot-visual-reasoning-on-rpms-with-an-application-to-video-frame-prediction.md","publications\u002F2021\u002Fone-shot-visual-reasoning-on-rpms-with-an-application-to-video-frame-prediction.md","publications\u002F2021\u002Fone-shot-visual-reasoning-on-rpms-with-an-application-to-video-frame-prediction",{"_path":8183,"_dir":7193,"_draft":7,"_partial":7,"_locale":8,"title":8184,"description":8185,"_hidden":7,"authors":8186,"authors_orcid":8187,"year":7203,"doi":8188,"openalex_id":8189,"venue":6726,"abstract_screenshot":8190,"keywords":8191,"body":8194,"_type":51,"_id":8202,"_source":53,"_file":8203,"_stem":8204,"_extension":56,"locale":57},"\u002Fpublications\u002F2021\u002Foptimized-conformal-classification-using-gradient-descent-approximation","Optimized conformal classification using gradient descent approximation","Conformal predictors are an important class of algorithms that allow predictions to be made with a user-defined confidence level. They are able to do this by outputting prediction sets, rather than simple point predictions. The conformal predictor is valid in the sense that the accuracy of its predictions is guaranteed to meet the confidence level, only assuming exchangeability in the data. Since accuracy is guaranteed, the performance of a conformal predictor is measured through the efficiency of the prediction sets. Typically, a conformal predictor is built on an underlying machine learning algorithm and hence its predictive power is inherited from this algorithm. However, since the underlying machine learning algorithm is not trained with the objective of minimizing predictive efficiency it means that the resulting conformal predictor may be sub-optimal and not aligned sufficiently to this objective. Hence, in this study we consider an approach to train the conformal predictor directly with maximum predictive efficiency as the optimization objective, and we focus specifically on the inductive conformal predictor for classification. To do this, the conformal predictor is approximated by a differentiable objective function and gradient descent used to optimize it. The resulting parameter estimates are then passed to a proper inductive conformal predictor to give valid prediction sets. We test the method on several real world data sets and find that the method is promising and in most cases gives improved predictive efficiency against a baseline conformal predictor.",[4189],[4191],"https:\u002F\u002Fdoi.org\u002F10.48550\u002Farxiv.2105.11255","W3165860726","optimized-conformal-classification-using-gradient-descent-approximation.png",[7446,8192,8193,34,23,37,3597,7449,632],"Gradient descent","Descent (aeronautics)",{"type":39,"children":8195,"toc":8200},[8196],{"type":42,"tag":43,"props":8197,"children":8198},{},[8199],{"type":47,"value":8185},{"title":8,"searchDepth":49,"depth":49,"links":8201},[],"content:publications:2021:optimized-conformal-classification-using-gradient-descent-approximation.md","publications\u002F2021\u002Foptimized-conformal-classification-using-gradient-descent-approximation.md","publications\u002F2021\u002Foptimized-conformal-classification-using-gradient-descent-approximation",{"_path":8206,"_dir":7193,"_draft":7,"_partial":7,"_locale":8,"title":8207,"description":8208,"_hidden":7,"Networks, Profiles, Gene Markers, and Protein Markers authors":8209,"authors_orcid":8216,"year":7203,"doi":8222,"openalex_id":8223,"venue":8224,"abstract_screenshot":21,"keywords":8225,"body":8230,"_type":51,"_id":8287,"_source":53,"_file":8288,"_stem":8289,"_extension":56,"locale":57},"\u002Fpublications\u002F2021\u002Fpbmc-cell-classification-from-single-cell-mrna-expression-by-artificial-neural-n","PBMC Cell Classification from Single Cell mRNA Expression by Artificial Neural","We performed classification of healthy Peripheral Blood Mononuclear Cells cell types using four methods Artificial Neural Network (ANN), Profiles, Protein Markers (PMs), and RNA markers (RNAMs). Profiles represent patterns of gene expressions characteristic of the subtypes of cells. PMs are protein found exclusively in certain types or subtypes of cells, or represent particular cell states, RNAMs are genes which demonstrate significant differential expressions between cell types. A total of 109 datasets from four different sources containing ∼\\sim∼ 120,000 single cells gene expression were used to train and test prediction models. We combined the methods which perform prediction using the whole set of gene features (ANN and Profiles), and those that used specific gene features (PMs and RNAMs) to predict the cell type. The overall classification accuracy was 94.8% for ANN, 94.5% for Profiles, 90.7% for PMs, 67.9% for RNAMs. The combination of four methods showed accuracy of 90.9% with high confidence of positive predictions. The combination of four methods allowed identification of mislabeled cell types in test data sets.",[7467,8210,8211,8212,8213,7302,8214,8215,5888],"Zhang, Yihan","Yang, Luning","Lin, Xin","Li, Yilin","Bellotti, Anthony Graham","Mitić, Nenad S.",[7474,8217,8218,8219,8220,7310,21,8221,5890],"0000-0002-6465-6258","0000-0001-7863-6605","0000-0002-7468-0366","0000-0001-9408-6738","0000-0002-0556-6279","https:\u002F\u002Fdoi.org\u002F10.1109\u002Fbibm52615.2021.9669826","W4205292020","2021 IEEE International Conference on Bioinformatics and Biomedicine (BIBM)",[8226,7485,7906,8227,8228,632,4606,37,4608,23,7486,8229],"Cell type","Gene expression","Cell","In vitro",{"type":39,"children":8231,"toc":8285},[8232],{"type":42,"tag":43,"props":8233,"children":8234},{},[8235,8237,8283],{"type":47,"value":8236},"We performed classification of healthy Peripheral Blood Mononuclear Cells cell types using four methods Artificial Neural Network (ANN), Profiles, Protein Markers (PMs), and RNA markers (RNAMs). Profiles represent patterns of gene expressions characteristic of the subtypes of cells. PMs are protein found exclusively in certain types or subtypes of cells, or represent particular cell states, RNAMs are genes which demonstrate significant differential expressions between cell types. A total of 109 datasets from four different sources containing ",{"type":42,"tag":809,"props":8238,"children":8240},{"className":8239},[1455],[8241,8264],{"type":42,"tag":809,"props":8242,"children":8244},{"className":8243},[1460],[8245],{"type":42,"tag":1463,"props":8246,"children":8247},{"xmlns":1465},[8248],{"type":42,"tag":1468,"props":8249,"children":8250},{},[8251,8259],{"type":42,"tag":1472,"props":8252,"children":8253},{},[8254],{"type":42,"tag":1482,"props":8255,"children":8256},{},[8257],{"type":47,"value":8258},"∼",{"type":42,"tag":2265,"props":8260,"children":8261},{"encoding":2267},[8262],{"type":47,"value":8263},"\\sim",{"type":42,"tag":809,"props":8265,"children":8267},{"className":8266,"ariaHidden":1484},[2274],[8268],{"type":42,"tag":809,"props":8269,"children":8271},{"className":8270},[2279],[8272,8277],{"type":42,"tag":809,"props":8273,"children":8276},{"className":8274,"style":8275},[2284],"height:0.3669em;",[],{"type":42,"tag":809,"props":8278,"children":8281},{"className":8279},[8280],"mrel",[8282],{"type":47,"value":8258},{"type":47,"value":8284}," 120,000 single cells gene expression were used to train and test prediction models. We combined the methods which perform prediction using the whole set of gene features (ANN and Profiles), and those that used specific gene features (PMs and RNAMs) to predict the cell type. The overall classification accuracy was 94.8% for ANN, 94.5% for Profiles, 90.7% for PMs, 67.9% for RNAMs. The combination of four methods showed accuracy of 90.9% with high confidence of positive predictions. The combination of four methods allowed identification of mislabeled cell types in test data sets.",{"title":8,"searchDepth":49,"depth":49,"links":8286},[],"content:publications:2021:pbmc-cell-classification-from-single-cell-mrna-expression-by-artificial-neural-n.md","publications\u002F2021\u002Fpbmc-cell-classification-from-single-cell-mrna-expression-by-artificial-neural-n.md","publications\u002F2021\u002Fpbmc-cell-classification-from-single-cell-mrna-expression-by-artificial-neural-n",{"_path":8291,"_dir":7193,"_draft":7,"_partial":7,"_locale":8,"title":8292,"description":8293,"_hidden":7,"authors":8294,"authors_orcid":8295,"year":7203,"doi":8296,"openalex_id":8297,"venue":8298,"abstract_screenshot":8299,"keywords":8300,"body":8305,"_type":51,"_id":8313,"_source":53,"_file":8314,"_stem":8315,"_extension":56,"locale":57},"\u002Fpublications\u002F2021\u002Fplanning-for-science-china-s-grand-experiment-and-global-implications","Planning for science: China’s “grand experiment” and global implications","Abstract China’s rising capability in science, technology and innovation to a certain extent has to do with “a grand experiment” that started 15 years ago when the Chinese government released the National Medium and Long-Term Plan for the Development of Science and Technology (2006–2020) (MLP). MLP launched the indigenous innovation strategy and set goals to turn China into an innovation-oriented country. The junction when the old MLP phased out and a new MLP (2021–2035) will soon be introduced holds greater historical and practical significance for the Chinese and international scientific communities to make sense of planning for science. This paper reviews the progress achieved in implementing the MLP, analyzes the daunting challenges facing China to become an innovation-oriented nation, discusses the implications of planning science for the Chinese and international scientific communities, and speculates on what might be included in the new MLP.",[3538,65],[3540,70],"https:\u002F\u002Fdoi.org\u002F10.1057\u002Fs41599-021-00895-7","W3199804895","Humanities and Social Sciences Communications","planning-for-science-china-s-grand-experiment-and-global-implications.png",[282,3255,8301,1358,8302,8303,8304,3713,289,36],"Indigenous","Plan (archaeology)","Chinese academy of sciences","Grand Challenges",{"type":39,"children":8306,"toc":8311},[8307],{"type":42,"tag":43,"props":8308,"children":8309},{},[8310],{"type":47,"value":8293},{"title":8,"searchDepth":49,"depth":49,"links":8312},[],"content:publications:2021:planning-for-science-china-s-grand-experiment-and-global-implications.md","publications\u002F2021\u002Fplanning-for-science-china-s-grand-experiment-and-global-implications.md","publications\u002F2021\u002Fplanning-for-science-china-s-grand-experiment-and-global-implications",{"_path":8317,"_dir":7193,"_draft":7,"_partial":7,"_locale":8,"title":8318,"description":8319,"_hidden":7,"clustering, and ANN classification of single cell transcriptomes authors":8320,"authors_orcid":8321,"year":7203,"doi":8322,"openalex_id":8323,"venue":7481,"abstract_screenshot":21,"keywords":8324,"body":8332,"_type":51,"_id":8340,"_source":53,"_file":8341,"_stem":8342,"_extension":56,"locale":57},"\u002Fpublications\u002F2021\u002Fprediction-of-therapy-outcomes-of-cll-using-gene-expression-intensity-clustering","Prediction of therapy outcomes of CLL using gene expression intensity,","Background Single cell transcriptomics is a new technology that enables us to measure the expression levels of genes from an individual cell. The expression information reflects the activity of that individual cell which could be used to indicate the cell types. Chronic lymphocytic leukemia (CLL) is a malignancy of B cells, one of the peripheral blood mononuclear cells subtypes. We applied five analytical tools for the study of single cell gene expression in CLL course of therapy. These tools included the analysis of gene expression distributions – median, interquartile ranges, and percentage above quality control (QC) threshold; hierarchical clustering applied to all cells within individual single cell data sets; and artificial neural network (ANN) for classification of healthy peripheral blood mononuclear cell (PBMC) subtypes. These tools were applied to the analysis of CLL data representing states before and during the therapy. Results We identified patterns in gene expression that distinguished two patients that had complete remission (complete response), a patient that had a relapse, and a patient that had partial remission within three years of Ibrutinib therapy. Patients with complete remission showed a rapid decline of median gene expression counts, and the total number of gene counts below the QC threshold for healthy cells (670 counts) in 80% of more of the cells. These patients also showed the emergence of healthy-like PBMC cluster maps within 120 days of therapy and distinct changes in predicted proportions of PBMC cell types. Conclusions The combination of basic statistical analysis, hierarchical clustering, and supervised machine learning identified patterns from gene expression that distinguish four CLL patients treated with Ibrutinib that experienced complete remission, partial remission, or relapse. These preliminary results suggest that new bioinformatics tools for single cell transcriptomics, including ANN comparison to healthy PBMC, offer promise in prognostics of CLL.",[7467,7302,4189,8212,7468,7471,5888],[7474,7310,4191,8219,7475,7478,5890],"https:\u002F\u002Fdoi.org\u002F10.1101\u002F2021.08.08.455551","W3187409112",[7485,8325,8227,3441,8326,8327,8328,8228,380,7906,8329,8330,4606,4608,8331,215,23,7486],"Chronic lymphocytic leukemia","Hierarchical clustering","Transcriptome","Gene expression profiling","Immunology","Bioinformatics","Leukemia",{"type":39,"children":8333,"toc":8338},[8334],{"type":42,"tag":43,"props":8335,"children":8336},{},[8337],{"type":47,"value":8319},{"title":8,"searchDepth":49,"depth":49,"links":8339},[],"content:publications:2021:prediction-of-therapy-outcomes-of-cll-using-gene-expression-intensity-clustering.md","publications\u002F2021\u002Fprediction-of-therapy-outcomes-of-cll-using-gene-expression-intensity-clustering.md","publications\u002F2021\u002Fprediction-of-therapy-outcomes-of-cll-using-gene-expression-intensity-clustering",{"_path":8344,"_dir":7193,"_draft":7,"_partial":7,"_locale":8,"title":8345,"description":8346,"_hidden":7,"Transesterification Reaction authors":8347,"authors_orcid":8349,"year":7203,"doi":8350,"openalex_id":8351,"venue":8352,"abstract_screenshot":21,"keywords":8353,"body":8360,"_type":51,"_id":8368,"_source":53,"_file":8369,"_stem":8370,"_extension":56,"locale":57},"\u002Fpublications\u002F2021\u002Fpreparation-of-catalyst-from-phosphorous-rock-using-an-improved-wet-process-for","Preparation of Catalyst from Phosphorous Rock Using an Improved Wet Process for","Gypsum (CaSO4·2H2O) with active catalytic performance was prepared from phosphorous rock through an improved clean wet process. The impact of the preparation conditions was extensively analyzed to identify the statistical significance toward the compositions of the prepared gypsum and catalytic performances during the transesterification reaction. The prepared catalyst predominantly contains CaSO4 (93%) with contaminations of silica (5%), P2O5 (0.25%), Fe2O3 (0.52%), Al2O3 (0.24%), and TiO2 (0.12%). Heavy-metal oxides, that is, Cr2O3, PbO, and CuO, were not detected from the prepared catalyst. The contaminants in gypsum are in the form of complicated composites such as SiO2, (Na2, K2)SiF6, MgF2, AlF3, Ca5(PO4)3F, and Ca3(PO4)2. The significant operational parameters, namely, the crystallization temperature and duration toward the catalytic performance, were identified by ANOVA. The Brönsted acidic sites from the ionic S and O, which might be in the form of S–⃛O or S═O as the surface functional groups, attribute to transesterification catalysis. The theoretical simulation suggests that different ionic sulfates might co-exist on the surface of crystallite gypsum. The transport of reagents to the surface of catalytic sites also plays an important role under the investigated experimental conditions. The reusability study indicates an approximate 10% deactivation after the reaction.",[7818,7994,7815,8348,7814,7303,7347,7302,7304],"Wang, Yixao",[7826,21,21,21,21,7311,7349,7310,7312],"https:\u002F\u002Fdoi.org\u002F10.1021\u002Facs.iecr.1c01072","W3165874471","Industrial & Engineering Chemistry Research",[7356,8354,8355,8356,8357,7360,8358,8359,7361,753,3961,7330,7327],"Gypsum","Transesterification","Reagent","Crystallization","Ionic liquid","Metal",{"type":39,"children":8361,"toc":8366},[8362],{"type":42,"tag":43,"props":8363,"children":8364},{},[8365],{"type":47,"value":8346},{"title":8,"searchDepth":49,"depth":49,"links":8367},[],"content:publications:2021:preparation-of-catalyst-from-phosphorous-rock-using-an-improved-wet-process-for.md","publications\u002F2021\u002Fpreparation-of-catalyst-from-phosphorous-rock-using-an-improved-wet-process-for.md","publications\u002F2021\u002Fpreparation-of-catalyst-from-phosphorous-rock-using-an-improved-wet-process-for",{"_path":8372,"_dir":7193,"_draft":7,"_partial":7,"_locale":8,"title":8373,"description":8374,"_hidden":7,"Platform for Non-traditional Digital Artefacts\" authors":8375,"authors_orcid":8383,"year":7203,"doi":8385,"openalex_id":8386,"venue":21,"abstract_screenshot":21,"keywords":8387,"body":8389,"_type":51,"_id":8397,"_source":53,"_file":8398,"_stem":8399,"_extension":56,"locale":57},"\u002Fpublications\u002F2021\u002Fremote-software-development-a-student-staff-collaboration-to-build-a-showcase-pl","Remote Software Development: A Student-staff Collaboration to Build a Showcas","In today’s digital era, the number of digital artefacts produced by students in universities around the world continues to rise. This paper describes a project that developed a digital artefacts platform to showcase students’ projects at an international level, aiming to increase the visibility of students’ work to global audiences. Due to the COVID-19 pandemic, a large proportion of the software engineering project development took place remotely, with students and staff at University of Nottingham Ningbo China (UNNC), a Sino-foreign Higher Education Institution in Mainland China, adopting remote collaboration tools and techniques. This paper presents the background, software engineering development, and the project’s unique characteristics. In addition, the challenges to project completion and remote collaboration, future recommendations, and the potential to extend this project into an Open Educational Resource (OER) are also discussed.",[595,8376,8377,8378,8379,8380,8381,8382],"Ferdinand, Kevin","Hadian, Gabrielle Saputra","Halim, Ivan Christian","Im, Aurelie U-King","Thenara, Joseph Manuel","Wong, Patricia M. Y.","Wu, Li-Kai",[599,21,21,21,21,8384,21,21],"0000-0002-7584-0245","https:\u002F\u002Fdoi.org\u002F10.1109\u002Fcompsac51774.2021.00154","W3199540811",[23,139,607,867,8388,868,869,1113],"Collaborative software",{"type":39,"children":8390,"toc":8395},[8391],{"type":42,"tag":43,"props":8392,"children":8393},{},[8394],{"type":47,"value":8374},{"title":8,"searchDepth":49,"depth":49,"links":8396},[],"content:publications:2021:remote-software-development-a-student-staff-collaboration-to-build-a-showcase-pl.md","publications\u002F2021\u002Fremote-software-development-a-student-staff-collaboration-to-build-a-showcase-pl.md","publications\u002F2021\u002Fremote-software-development-a-student-staff-collaboration-to-build-a-showcase-pl",{"_path":8401,"_dir":7193,"_draft":7,"_partial":7,"_locale":8,"title":8402,"description":8403,"_hidden":7,"authors":8404,"authors_orcid":8407,"year":7203,"doi":8410,"openalex_id":8411,"venue":21,"abstract_screenshot":21,"keywords":8412,"body":8418,"_type":51,"_id":8426,"_source":53,"_file":8427,"_stem":8428,"_extension":56,"locale":57},"\u002Fpublications\u002F2021\u002Frppg-based-spoofing-detection-for-face-mask-attack-using-efficientnet-on-weighte","rPPG-Based Spoofing Detection for Face Mask Attack using Efficientnet on Weighted Spatial-Temporal Representation","Face spoofing detection against paper attack and video-replay attack has been well studied, whereas detecting 3D face mask attack remains challenging. Remote photoplethysmography (rPPG) signal is a recently developed liveness clue for face-spoofing detection. The main challenge of existing rPPG-based methods is that the signal can be easily distorted by background noise or object motion. To address this problem, in this work, we propose an rPPG-based face-spoofing detection method using multiple regions of interests (ROIs) covering entire face, and emphasize the regions containing richer rPPG signals using larger weights. The rPPG signals of these regions form a weighted spatial-temporal map. In view of the discriminant power of EfficientNet over other deep convolutional neural networks, we propose a domain-specific EfficientNet as the classification method. Extensive experiments on two databases namely 3DMAD and HKBU-Mars V2 demonstrate the superior performance of the proposed method over state-of-the-art rPPG-based face-spoofing-detection algorithms.",[8405,6135,6997,7409,4626,6111,12,8406],"Yao, Chenglin","Liu, Jiang",[8408,6137,7000,7415,4637,6113,15,8409],"0000-0001-5306-8955","0000-0001-6281-6505","https:\u002F\u002Fdoi.org\u002F10.1109\u002Ficip42928.2021.9506276","W3194467497",[8413,23,37,8414,6924,4391,5545,8415,4876,8416,180,8417],"Spoofing attack","Liveness","Replay attack","Facial recognition system","Authentication (law)",{"type":39,"children":8419,"toc":8424},[8420],{"type":42,"tag":43,"props":8421,"children":8422},{},[8423],{"type":47,"value":8403},{"title":8,"searchDepth":49,"depth":49,"links":8425},[],"content:publications:2021:rppg-based-spoofing-detection-for-face-mask-attack-using-efficientnet-on-weighte.md","publications\u002F2021\u002Frppg-based-spoofing-detection-for-face-mask-attack-using-efficientnet-on-weighte.md","publications\u002F2021\u002Frppg-based-spoofing-detection-for-face-mask-attack-using-efficientnet-on-weighte",{"_path":8430,"_dir":7193,"_draft":7,"_partial":7,"_locale":8,"title":8431,"description":8432,"_hidden":7,"the OA advantage in \u003Ci>Nature\u003C\u002Fi> and \u003Ci>Science\u003C\u002Fi>\" authors":8433,"authors_orcid":8438,"year":7203,"doi":8440,"openalex_id":8441,"venue":8442,"abstract_screenshot":21,"keywords":8443,"body":8447,"_type":51,"_id":8455,"_source":53,"_file":8456,"_stem":8457,"_extension":56,"locale":57},"\u002Fpublications\u002F2021\u002Fscientific-value-weights-more-than-being-open-or-toll-access-an-analysis-of-the","Scientific Value Weights more than Being Open or Toll Access: An analysis o","Abstract Purpose We attempt to find out whether OA or TA really affects the dissemination of scientific discoveries. Design\u002Fmethodology\u002Fapproach We design the indicators, hot-degree, and R-index to indicate a topic OA or TA advantages. First, according to the OA classification of the Web of Science (WoS), we collect data from the WoS by downloading OA and TA articles, letters, and reviews published in Nature and Science during 2010–2019. These papers are divided into three broad disciplines, namely biomedicine, physics, and others. Then, taking a discipline in a journal and using the classical Latent Dirichlet Allocation (LDA) to cluster 100 topics of OA and TA papers respectively, we apply the Pearson correlation coefficient to match the topics of OA and TA, and calculate the hot-degree and R-index of every OA-TA topic pair. Finally, characteristics of the discipline can be presented. In qualitative comparison, we choose some high-quality papers which belong to Nature remarkable papers or Science breakthroughs, and analyze the relations between OA\u002FTA and citation numbers. Findings The result shows that OA hot-degree in biomedicine is significantly greater than that of TA, but significantly less than that of TA in physics. Based on the R-index, it is found that OA advantages exist in biomedicine and TA advantages do in physics. Therefore, the dissemination of average scientific discoveries in all fields is not necessarily affected by OA or TA. However, OA promotes the spread of important scientific discoveries in high-quality papers. Research limitations We lost some citations by ignoring other open sources such as arXiv and bioArxiv. Another limitation came from that Nature employs some strong measures for access-promoting subscription-based articles, on which the boundary between OA and TA became fuzzy. Practical implications It is useful to select hot topics in a set of publications by the hot-degree index. The finding comprehensively reflects the differences of OA and TA in different disciplines, which is a useful reference when researchers choose the publishing way as OA or TA. Originality\u002Fvalue We propose a new method, including two indicators, to explore and measure OA or TA advantages.",[8434,8435,65,8436,8437],"Wang, Howell Y.","Wei, Shelia X.","Wang, Xianwen","Ye, Fred Y.",[21,21,70,8439,21],"0000-0002-7236-9267","https:\u002F\u002Fdoi.org\u002F10.2478\u002Fjdis-2021-0033","W3203262851","Journal of Data and Information Science",[8444,3954,8445,3952,23,834,747,6950,691,3745,8446,869,3597,8330],"Latent Dirichlet allocation","Biomedicine","Topic model",{"type":39,"children":8448,"toc":8453},[8449],{"type":42,"tag":43,"props":8450,"children":8451},{},[8452],{"type":47,"value":8432},{"title":8,"searchDepth":49,"depth":49,"links":8454},[],"content:publications:2021:scientific-value-weights-more-than-being-open-or-toll-access-an-analysis-of-the.md","publications\u002F2021\u002Fscientific-value-weights-more-than-being-open-or-toll-access-an-analysis-of-the.md","publications\u002F2021\u002Fscientific-value-weights-more-than-being-open-or-toll-access-an-analysis-of-the",{"_path":8459,"_dir":7193,"_draft":7,"_partial":7,"_locale":8,"title":8460,"description":8461,"_hidden":7,"authors":8462,"authors_orcid":8465,"year":7203,"doi":8468,"openalex_id":8469,"venue":3384,"abstract_screenshot":21,"keywords":8470,"body":8474,"_type":51,"_id":8482,"_source":53,"_file":8483,"_stem":8484,"_extension":56,"locale":57},"\u002Fpublications\u002F2021\u002Fsmart-wearables-with-sensor-fusion-for-fall-detection-in-firefighting","Smart Wearables with Sensor Fusion for Fall Detection in Firefighting","During the past decade, falling has been one of the top three causes of death amongst firefighters in China. Even though there are many studies on fall-detection systems (FDSs), the majority use a single motion sensor. Furthermore, few existing studies have considered the impact sensor placement and positioning have on fall-detection performance; most are targeted toward fall detection of the elderly. Unfortunately, floor cracks and unstable building structures in the fireground increase the difficulty of detecting the fall of a firefighter. In particular, the movement activities of firefighters are more varied; hence, distinguishing fall-like activities from actual falls is a significant challenge. This study proposed a smart wearable FDS for firefighter fall detection by integrating motion sensors into the firefighter's personal protective clothing on the chest, elbows, wrists, thighs, and ankles. The firefighter's fall activities are detected by the proposed multisensory recurrent neural network, and the performances of different combinations of inertial measurement units (IMUs) on different body parts were also investigated. The results indicated that the sensor fusion of IMUs from all five proposed body parts achieved performances of 94.10%, 92.25%, and 94.59% in accuracy, sensitivity, and specificity, respectively.",[8463,7746,5407,8464,5665,5667],"Chai, Xiaoqing","Jin, Hangchao",[8466,8467,5411,21,5669,5670],"0000-0002-3974-8943","0000-0002-7356-8137","https:\u002F\u002Fdoi.org\u002F10.3390\u002Fs21206770","W3205683357",[6973,8471,23,6978,8472,984,8473,3203,179,37,4242,380],"Firefighting","Falling (accident)","Aeronautics",{"type":39,"children":8475,"toc":8480},[8476],{"type":42,"tag":43,"props":8477,"children":8478},{},[8479],{"type":47,"value":8461},{"title":8,"searchDepth":49,"depth":49,"links":8481},[],"content:publications:2021:smart-wearables-with-sensor-fusion-for-fall-detection-in-firefighting.md","publications\u002F2021\u002Fsmart-wearables-with-sensor-fusion-for-fall-detection-in-firefighting.md","publications\u002F2021\u002Fsmart-wearables-with-sensor-fusion-for-fall-detection-in-firefighting",{"_path":8486,"_dir":7193,"_draft":7,"_partial":7,"_locale":8,"title":8487,"description":8,"_hidden":7,"authors":8488,"authors_orcid":8489,"year":7203,"doi":8490,"openalex_id":8491,"venue":687,"abstract_screenshot":21,"keywords":8492,"body":8494,"_type":51,"_id":8498,"_source":53,"_file":8499,"_stem":8500,"_extension":56,"locale":57},"\u002Fpublications\u002F2021\u002Fstudy-of-sign-language-recognition-using-wearable-sensors","Study of Sign Language Recognition Using Wearable Sensors",[5667,5665],[5670,5669],"https:\u002F\u002Fdoi.org\u002F10.1007\u002F978-3-030-68449-5_24","W3126762198",[23,6971,6973,6978,6972,6974,37,868,8493,6975,6980,4391,4242],"American Sign Language",{"type":39,"children":8495,"toc":8496},[],{"title":8,"searchDepth":49,"depth":49,"links":8497},[],"content:publications:2021:study-of-sign-language-recognition-using-wearable-sensors.md","publications\u002F2021\u002Fstudy-of-sign-language-recognition-using-wearable-sensors.md","publications\u002F2021\u002Fstudy-of-sign-language-recognition-using-wearable-sensors",{"_path":8502,"_dir":7193,"_draft":7,"_partial":7,"_locale":8,"title":8503,"description":8504,"_hidden":7,"Imbalance Transfer\" authors":8505,"authors_orcid":8507,"year":7203,"doi":8510,"openalex_id":8511,"venue":21,"abstract_screenshot":21,"keywords":8512,"body":8515,"_type":51,"_id":8636,"_source":53,"_file":8637,"_stem":8638,"_extension":56,"locale":57},"\u002Fpublications\u002F2021\u002Ftait-one-shot-full-integer-lightweight-dnn-quantization-via-tunable-activation-i","TAIT: One-Shot Full-Integer Lightweight DNN Quantization via Tunable Activatio","Both parameter quantization and depthwise convolution are essential measures to provide high-accuracy, lightweight, and resource-friendly solutions when deploying deep neural networks (DNNs) onto edge-AI devices. However, combining the two methodologies may lead to adverse effects: It either suffers from significant accuracy loss or long finetuning time. Besides, contemporary quantization methods are only selectively applied to weight and activation values but not bias and scaling factor values, making them less practical for ASIC\u002FFPGA accelerators. To solve these issues, we propose a novel quantization framework that is effectively optimized for depthwise convolution networks. We discover that the uniformity of the value range within a tensor can serve as a predictor for the tensor’s quantization error. Under the guidance of this predictor, we develop a mechanism called Tunable Activation Imbalance Transfer (TAIT), which tunes the value range uniformity between an activated feature map and its latter weights. Moreover, TAIT fully supports full-integer quantization. We demonstrate TAIT on SkyNet and deploy it on FPGA. Compared to the state-of-the-art, our quantization framework and system design achieve 2.2%+ IoU, 2.4×2.4 \\times2.4× speed, and 1.8×1.8 \\times1.8× energy efficiency improvements, without any requirement of finetuning.",[5531,5532,5533,8506,6184,5534],"Sun, Hao",[5536,5537,5538,8508,8509,5539],"0000-0003-4518-2533","0000-0003-1770-906X","https:\u002F\u002Fdoi.org\u002F10.1109\u002Fdac18074.2021.9586109","W3214591391",[8513,23,3335,8166,8514,37,332,3961,6632,110],"Quantization (signal processing)","Transfer (computing)",{"type":39,"children":8516,"toc":8634},[8517],{"type":42,"tag":43,"props":8518,"children":8519},{},[8520,8522,8577,8579,8632],{"type":47,"value":8521},"Both parameter quantization and depthwise convolution are essential measures to provide high-accuracy, lightweight, and resource-friendly solutions when deploying deep neural networks (DNNs) onto edge-AI devices. However, combining the two methodologies may lead to adverse effects: It either suffers from significant accuracy loss or long finetuning time. Besides, contemporary quantization methods are only selectively applied to weight and activation values but not bias and scaling factor values, making them less practical for ASIC\u002FFPGA accelerators. To solve these issues, we propose a novel quantization framework that is effectively optimized for depthwise convolution networks. We discover that the uniformity of the value range within a tensor can serve as a predictor for the tensor’s quantization error. Under the guidance of this predictor, we develop a mechanism called Tunable Activation Imbalance Transfer (TAIT), which tunes the value range uniformity between an activated feature map and its latter weights. Moreover, TAIT fully supports full-integer quantization. We demonstrate TAIT on SkyNet and deploy it on FPGA. Compared to the state-of-the-art, our quantization framework and system design achieve 2.2%+ IoU, ",{"type":42,"tag":809,"props":8523,"children":8525},{"className":8524},[1455],[8526,8554],{"type":42,"tag":809,"props":8527,"children":8529},{"className":8528},[1460],[8530],{"type":42,"tag":1463,"props":8531,"children":8532},{"xmlns":1465},[8533],{"type":42,"tag":1468,"props":8534,"children":8535},{},[8536,8549],{"type":42,"tag":1472,"props":8537,"children":8538},{},[8539,8544],{"type":42,"tag":1476,"props":8540,"children":8541},{},[8542],{"type":47,"value":8543},"2.4",{"type":42,"tag":1482,"props":8545,"children":8546},{},[8547],{"type":47,"value":8548},"×",{"type":42,"tag":2265,"props":8550,"children":8551},{"encoding":2267},[8552],{"type":47,"value":8553},"2.4 \\times",{"type":42,"tag":809,"props":8555,"children":8557},{"className":8556,"ariaHidden":1484},[2274],[8558],{"type":42,"tag":809,"props":8559,"children":8561},{"className":8560},[2279],[8562,8567,8572],{"type":42,"tag":809,"props":8563,"children":8566},{"className":8564,"style":8565},[2284],"height:0.7278em;vertical-align:-0.0833em;",[],{"type":42,"tag":809,"props":8568,"children":8570},{"className":8569},[2290],[8571],{"type":47,"value":8543},{"type":42,"tag":809,"props":8573,"children":8575},{"className":8574},[2290],[8576],{"type":47,"value":8548},{"type":47,"value":8578}," speed, and ",{"type":42,"tag":809,"props":8580,"children":8582},{"className":8581},[1455],[8583,8610],{"type":42,"tag":809,"props":8584,"children":8586},{"className":8585},[1460],[8587],{"type":42,"tag":1463,"props":8588,"children":8589},{"xmlns":1465},[8590],{"type":42,"tag":1468,"props":8591,"children":8592},{},[8593,8605],{"type":42,"tag":1472,"props":8594,"children":8595},{},[8596,8601],{"type":42,"tag":1476,"props":8597,"children":8598},{},[8599],{"type":47,"value":8600},"1.8",{"type":42,"tag":1482,"props":8602,"children":8603},{},[8604],{"type":47,"value":8548},{"type":42,"tag":2265,"props":8606,"children":8607},{"encoding":2267},[8608],{"type":47,"value":8609},"1.8 \\times",{"type":42,"tag":809,"props":8611,"children":8613},{"className":8612,"ariaHidden":1484},[2274],[8614],{"type":42,"tag":809,"props":8615,"children":8617},{"className":8616},[2279],[8618,8622,8627],{"type":42,"tag":809,"props":8619,"children":8621},{"className":8620,"style":8565},[2284],[],{"type":42,"tag":809,"props":8623,"children":8625},{"className":8624},[2290],[8626],{"type":47,"value":8600},{"type":42,"tag":809,"props":8628,"children":8630},{"className":8629},[2290],[8631],{"type":47,"value":8548},{"type":47,"value":8633}," energy efficiency improvements, without any requirement of finetuning.",{"title":8,"searchDepth":49,"depth":49,"links":8635},[],"content:publications:2021:tait-one-shot-full-integer-lightweight-dnn-quantization-via-tunable-activation-i.md","publications\u002F2021\u002Ftait-one-shot-full-integer-lightweight-dnn-quantization-via-tunable-activation-i.md","publications\u002F2021\u002Ftait-one-shot-full-integer-lightweight-dnn-quantization-via-tunable-activation-i",{"_path":8640,"_dir":7193,"_draft":7,"_partial":7,"_locale":8,"title":8641,"description":8642,"_hidden":7,"authors":8643,"authors_orcid":8644,"year":7203,"doi":8645,"openalex_id":8646,"venue":8647,"abstract_screenshot":8648,"keywords":8649,"body":8654,"_type":51,"_id":8662,"_source":53,"_file":8663,"_stem":8664,"_extension":56,"locale":57},"\u002Fpublications\u002F2021\u002Ftowards-post-pandemic-transformative-teaching-and-learning","Towards Post-pandemic Transformative Teaching and Learning","The recent COVID-19 pandemic has presented challenges to post-secondary education, including that campuses have been closed, removing face-to-face instruction options. Meanwhile, this crisis has also presented unique opportunities to create a \"tipping point\" or conditions that foster innovative teaching practices. In light of such a \"danger-opportunity,\" the feasibility of introducing microlearning (ML), a technology-mediated teaching and learning (T&L) strategy, has recently been revisited by some institutions. ML offers learning opportunities through small bursts of training materials that learners can comprehend in a short time, according to their preferred schedule and location. Initially considered as \"add-on\" complementary online learning resources to provide learners with an active and more engaging learning experience through flexible learning modes, the possibility of an institution-wide implementation of ML has been further explored during the COVID-19 lockdown. This paper presents an exploratory case study examining two post-secondary education institutions' ML introductions. Using the SAMR model as the lens, their approaches to adopting ML are examined through analysis of quantitative questionnaires and qualitative teacher reflections. Overall, ML appears to be a promising direction that may not only be able to help institutions survive, but possibly offer an enhanced teaching and learning experience, post-pandemic. However, its current implementations face many challenges, both practical and pedagogical, and their impacts have yet to achieve transformation. With the insights gained, some possible strategies for moving the adoption of ML to the next level are offered.",[850,595,3894,7077],[853,599,3896,7081],"https:\u002F\u002Fdoi.org\u002F10.1007\u002Fs42979-021-00663-z","W3163754216","SN Computer Science","towards-post-pandemic-transformative-teaching-and-learning.png",[8650,6410,1222,5258,6407,6924,8651,8652,8653,23,866,1379,865,4173,1380,179,380],"Transformative learning","Blended learning","Exploratory research","Tipping point (physics)",{"type":39,"children":8655,"toc":8660},[8656],{"type":42,"tag":43,"props":8657,"children":8658},{},[8659],{"type":47,"value":8642},{"title":8,"searchDepth":49,"depth":49,"links":8661},[],"content:publications:2021:towards-post-pandemic-transformative-teaching-and-learning.md","publications\u002F2021\u002Ftowards-post-pandemic-transformative-teaching-and-learning.md","publications\u002F2021\u002Ftowards-post-pandemic-transformative-teaching-and-learning",{"_path":8666,"_dir":7193,"_draft":7,"_partial":7,"_locale":8,"title":8667,"description":8,"_hidden":7,"authors":8668,"authors_orcid":8669,"year":7203,"doi":8670,"openalex_id":8671,"venue":770,"abstract_screenshot":21,"keywords":8672,"body":8673,"_type":51,"_id":8677,"_source":53,"_file":8678,"_stem":8679,"_extension":56,"locale":57},"\u002Fpublications\u002F2021\u002Fusing-metamorphic-relations-to-verify-and-enhance-artcode-classification","Using metamorphic relations to verify and enhance Artcode classification",[4377,595,4378,4379,1156,596],[4381,599,4382,4383,1158,600],"https:\u002F\u002Fdoi.org\u002F10.1016\u002Fj.jss.2021.111060","W3195636639",[3788,23,3789,37,3790],{"type":39,"children":8674,"toc":8675},[],{"title":8,"searchDepth":49,"depth":49,"links":8676},[],"content:publications:2021:using-metamorphic-relations-to-verify-and-enhance-artcode-classification.md","publications\u002F2021\u002Fusing-metamorphic-relations-to-verify-and-enhance-artcode-classification.md","publications\u002F2021\u002Fusing-metamorphic-relations-to-verify-and-enhance-artcode-classification",{"_path":8681,"_dir":7193,"_draft":7,"_partial":7,"_locale":8,"title":8682,"description":8683,"_hidden":7,"authors":8684,"authors_orcid":8687,"year":7203,"doi":21,"openalex_id":8688,"venue":21,"abstract_screenshot":21,"keywords":8689,"body":8691,"_type":51,"_id":8699,"_source":53,"_file":8700,"_stem":8701,"_extension":56,"locale":57},"\u002Fpublications\u002F2021\u002Fwhat-do-china-s-scientific-ambitions-mean-for-science-and-the-world","What Do China’s Scientific Ambitions Mean for Science—and the World?","Taking a deep look at how China has transformed its capacity for scientific research and innovation provides a window into the country’s ambitions and possible paths in the future.",[8685,65,5845,8686,5846],"Serger, Sylvia Schwaag","Beldarrain, Xabier Geonaga",[21,70,5849,21,21],"W3161708369",[282,1358,8690,3259],"Science education",{"type":39,"children":8692,"toc":8697},[8693],{"type":42,"tag":43,"props":8694,"children":8695},{},[8696],{"type":47,"value":8683},{"title":8,"searchDepth":49,"depth":49,"links":8698},[],"content:publications:2021:what-do-china-s-scientific-ambitions-mean-for-science-and-the-world.md","publications\u002F2021\u002Fwhat-do-china-s-scientific-ambitions-mean-for-science-and-the-world.md","publications\u002F2021\u002Fwhat-do-china-s-scientific-ambitions-mean-for-science-and-the-world",{"_path":8703,"_dir":8704,"_draft":7,"_partial":7,"_locale":8,"title":8705,"description":8706,"_hidden":7,"Light Communication System":8707,"authors":8708,"authors_orcid":8711,"year":8714,"doi":8715,"openalex_id":8716,"venue":8717,"abstract_screenshot":21,"keywords":8718,"body":8736,"_type":51,"_id":8744,"_source":53,"_file":8745,"_stem":8746,"_extension":56,"locale":57},"\u002Fpublications\u002F2022\u002Fa-bandwidth-efficient-hybrid-multilevel-pulse-width-modulation-for-visible-light","2022","A Bandwidth Efficient Hybrid Multilevel Pulse Width Modulation for Visibl","Visible light communication (VLC) is considered a new technology for interconnecting devices in 5G and beyond. VLC can provide additional bandwidth for communicating devices which can help to reduce the radio frequency bandwidth congestion. In this work, we aim to maximize the bandwidth usages for VLC. The proposed modulation technique can impose more bits due to the combined utilization of both pulse height and width changes. Moreover, we subdivide the single bit duration to impose more bits for data transmission. The proposed modulation is capable of transmitting more bits by utilizing fewer optical pulses than other traditional modulation techniques such as multilevel modulation, on-off keying, pulse width modulation, pulse position modulation, pulse amplitude modulation, and multiple pulse position modulation. We have evaluated the theoretical bit error rate (BER) expression in terms of average signal to noise ratio and compared the experimental BER performance for the proposed system. The experimental results demonstrate that the proposed modulation technique can achieve a communication distance of 3 m in an indoor environment.","Experimental and Theoretical Evaluation\"",[8709,8710,5667,5665],"Sejan, Mohammad Abrar Shakil","Naik, Ramavath Prasad",[8712,8713,5670,5669],"0000-0002-6323-2613","0000-0002-9878-2295",2022,"https:\u002F\u002Fdoi.org\u002F10.1109\u002Fojcoms.2022.3217778","W4313156407","IEEE Open Journal of the Communications Society",[8719,8720,8721,8722,8723,8724,23,6194,8725,8726,8727,8728,8729,286,8730,288,8731,3597,8732,179,8139,8733,8734,4094,8735],"Pulse-position modulation","Pulse-amplitude modulation","Bandwidth (computing)","Pulse-width modulation","Modulation (music)","Visible light communication","Quadrature amplitude modulation","Bit error rate","Keying","Analog transmission","Delta modulation","Optical communication","Optics","Pulse (music)","Power (physics)","Channel (broadcasting)","Light-emitting diode",{"type":39,"children":8737,"toc":8742},[8738],{"type":42,"tag":43,"props":8739,"children":8740},{},[8741],{"type":47,"value":8706},{"title":8,"searchDepth":49,"depth":49,"links":8743},[],"content:publications:2022:a-bandwidth-efficient-hybrid-multilevel-pulse-width-modulation-for-visible-light.md","publications\u002F2022\u002Fa-bandwidth-efficient-hybrid-multilevel-pulse-width-modulation-for-visible-light.md","publications\u002F2022\u002Fa-bandwidth-efficient-hybrid-multilevel-pulse-width-modulation-for-visible-light",{"_path":8748,"_dir":8704,"_draft":7,"_partial":7,"_locale":8,"title":8749,"description":8,"_hidden":7,"quantitatively effects of chemical addition in cultivation media on biodegradation efficiency\" authors":8750,"authors_orcid":8751,"year":8714,"doi":8753,"openalex_id":8754,"venue":8755,"abstract_screenshot":21,"keywords":8756,"body":8759,"_type":51,"_id":8763,"_source":53,"_file":8764,"_stem":8765,"_extension":56,"locale":57},"\u002Fpublications\u002F2022\u002Fa-critical-review-on-microbial-degradation-of-petroleum-based-plastics-quantitat","A critical review on microbial degradation of petroleum-based plastics",[7304,7850,7815,7300,7302,7814,7296,7818,7303,7347],[7312,8752,21,7821,7310,7822,7306,7826,7311,7349],"0000-0001-5137-4019","https:\u002F\u002Fdoi.org\u002F10.1007\u002Fs10532-021-09969-4","W4205195749","Biodegradation",[8755,8757,753,3961,34,926,8758,23,7330,179],"Degradation (telecommunications)","Pulp and paper industry",{"type":39,"children":8760,"toc":8761},[],{"title":8,"searchDepth":49,"depth":49,"links":8762},[],"content:publications:2022:a-critical-review-on-microbial-degradation-of-petroleum-based-plastics-quantitat.md","publications\u002F2022\u002Fa-critical-review-on-microbial-degradation-of-petroleum-based-plastics-quantitat.md","publications\u002F2022\u002Fa-critical-review-on-microbial-degradation-of-petroleum-based-plastics-quantitat",{"_path":8767,"_dir":8704,"_draft":7,"_partial":7,"_locale":8,"title":8768,"description":8769,"_hidden":7,"authors":8770,"authors_orcid":8771,"year":8714,"doi":8772,"openalex_id":8773,"venue":8774,"abstract_screenshot":21,"keywords":8775,"body":8781,"_type":51,"_id":8857,"_source":53,"_file":8858,"_stem":8859,"_extension":56,"locale":57},"\u002Fpublications\u002F2022\u002Fa-high-throughput-full-dataflow-mobilenetv2-accelerator-on-edge-fpga","A High-Throughput Full-Dataflow MobileNetv2 Accelerator on Edge FPGA","FPGA accelerators for lightweight neural networks, such as MobileNetv2, are of great need in edge computing applications with high throughput requirements. Dataflow architecture has been considered a promising approach to optimize throughput since the intermediate feature map transfers can be significantly saved. However, previous MobileNetv2 accelerators only achieved a partial-dataflow architecture, and just one-third of the feature map transfers can be saved. To solve this issue, we propose a scheme to achieve a full-dataflow MobileNetv2 accelerator on FPGA. The scheme contains four techniques. First, we improve the full-integer quantization for easier deployment on hardware. Second, we propose tunable activation weight imbalance transfer for less quantization accuracy loss. Third, we present several highly optimized accelerator components whose parallelism can be flexibly adjusted and implement residual connection with deeper FIFO so that the requirements of the full-dataflow architecture can be fully met. Finally, we present a computing resource allocation strategy to balance the latency of each layer, and a memory resource allocation strategy to effectively use the on-chip memory. Compared to the state-of-the-art, experimental results show that the accelerator achieves 1910 FPS with  1.8×1.8\\times 1.8×  speedup when implemented on the Xilinx ZCU102 FPGA. In addition, it reaches 72.98% Top-1 accuracy with 8-bit integer quantization that outperforms all the other MobileNetv2 accelerators.",[5531,5532,5534],[5536,5537,5539],"https:\u002F\u002Fdoi.org\u002F10.1109\u002Ftcad.2022.3198246","W4291910419","IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems",[8776,23,5543,8513,8777,5547,8778,6632,8779,5550,8780,332,3123],"Dataflow","Speedup","Edge device","Latency (audio)","Hardware acceleration",{"type":39,"children":8782,"toc":8855},[8783],{"type":42,"tag":43,"props":8784,"children":8785},{},[8786,8788,8853],{"type":47,"value":8787},"FPGA accelerators for lightweight neural networks, such as MobileNetv2, are of great need in edge computing applications with high throughput requirements. Dataflow architecture has been considered a promising approach to optimize throughput since the intermediate feature map transfers can be significantly saved. However, previous MobileNetv2 accelerators only achieved a partial-dataflow architecture, and just one-third of the feature map transfers can be saved. To solve this issue, we propose a scheme to achieve a full-dataflow MobileNetv2 accelerator on FPGA. The scheme contains four techniques. First, we improve the full-integer quantization for easier deployment on hardware. Second, we propose tunable activation weight imbalance transfer for less quantization accuracy loss. Third, we present several highly optimized accelerator components whose parallelism can be flexibly adjusted and implement residual connection with deeper FIFO so that the requirements of the full-dataflow architecture can be fully met. Finally, we present a computing resource allocation strategy to balance the latency of each layer, and a memory resource allocation strategy to effectively use the on-chip memory. Compared to the state-of-the-art, experimental results show that the accelerator achieves 1910 FPS with ",{"type":42,"tag":8789,"props":8790,"children":8792},"inline-formula",{"xmlns:mml":1465,"xmlnsXLink":8791},"http:\u002F\u002Fwww.w3.org\u002F1999\u002Fxlink",[8793,8795],{"type":47,"value":8794}," ",{"type":42,"tag":8796,"props":8797,"children":8799},"tex-math",{"notation":8798},"LaTeX",[8800,8852],{"type":42,"tag":809,"props":8801,"children":8803},{"className":8802},[1455],[8804,8830],{"type":42,"tag":809,"props":8805,"children":8807},{"className":8806},[1460],[8808],{"type":42,"tag":1463,"props":8809,"children":8810},{"xmlns":1465},[8811],{"type":42,"tag":1468,"props":8812,"children":8813},{},[8814,8825],{"type":42,"tag":1472,"props":8815,"children":8816},{},[8817,8821],{"type":42,"tag":1476,"props":8818,"children":8819},{},[8820],{"type":47,"value":8600},{"type":42,"tag":1482,"props":8822,"children":8823},{},[8824],{"type":47,"value":8548},{"type":42,"tag":2265,"props":8826,"children":8827},{"encoding":2267},[8828],{"type":47,"value":8829},"1.8\\times ",{"type":42,"tag":809,"props":8831,"children":8833},{"className":8832,"ariaHidden":1484},[2274],[8834],{"type":42,"tag":809,"props":8835,"children":8837},{"className":8836},[2279],[8838,8842,8847],{"type":42,"tag":809,"props":8839,"children":8841},{"className":8840,"style":8565},[2284],[],{"type":42,"tag":809,"props":8843,"children":8845},{"className":8844},[2290],[8846],{"type":47,"value":8600},{"type":42,"tag":809,"props":8848,"children":8850},{"className":8849},[2290],[8851],{"type":47,"value":8548},{"type":47,"value":8794},{"type":47,"value":8854}," speedup when implemented on the Xilinx ZCU102 FPGA. In addition, it reaches 72.98% Top-1 accuracy with 8-bit integer quantization that outperforms all the other MobileNetv2 accelerators.",{"title":8,"searchDepth":49,"depth":49,"links":8856},[],"content:publications:2022:a-high-throughput-full-dataflow-mobilenetv2-accelerator-on-edge-fpga.md","publications\u002F2022\u002Fa-high-throughput-full-dataflow-mobilenetv2-accelerator-on-edge-fpga.md","publications\u002F2022\u002Fa-high-throughput-full-dataflow-mobilenetv2-accelerator-on-edge-fpga",{"_path":8861,"_dir":8704,"_draft":7,"_partial":7,"_locale":8,"title":8862,"description":8863,"_hidden":7,"Reality Environments authors":8864,"authors_orcid":8867,"year":8714,"doi":8870,"openalex_id":8871,"venue":21,"abstract_screenshot":21,"keywords":8872,"body":8874,"_type":51,"_id":8882,"_source":53,"_file":8883,"_stem":8884,"_extension":56,"locale":57},"\u002Fpublications\u002F2022\u002Fa-pilot-study-investigating-student-interaction-preferences-in-immersive-virtual","A Pilot Study Investigating Student Interaction Preferences in Immersive Virtual","Since the outbreak of the COVID-19 pandemic, University of Nottingham Ningbo China (UNNC), the first Sino-foreign university in China, has been committed to digital transformation and increasing its technological capabilities and online provisions. At the forefront is Virtual Reality (VR), which is becoming more affordable and accessible. Immersive VR (iVR) is often referred to as the ultimate version of VR, and can be enhanced through sensory interfaces, such as audio and haptic. The present paper describes an iVR pilot study based on the virtual experiences of Design History, developed by V-ROOM, a special division within UNNC that focuses on digital pedagogy, and UNNC’s BEng Product Design and Manufacture (PDM) program. The study explores student preferences and efficacy regarding interaction interfaces and presentation types for learning content within iVR environments. The analysis is based on post-experience questionnaires, (pre\u002Fpost) comprehension tests, students’ statements, and researchers’ observations. Results show that interaction interface types play a pivotal role in immersion and engagement within these environments, and that learning content utilising microlearning and\u002For gamification elements are preferred.",[7077,7078,8865,595,8866,7079],"Mareta, Sannia","Wang, Alan",[7081,7082,8868,599,8869,7083],"0000-0002-5442-4277","0000-0001-9749-0082","https:\u002F\u002Fdoi.org\u002F10.1109\u002Ftale54877.2022.00029","W4380590076",[4390,23,868,8873,867],"Immersive technology",{"type":39,"children":8875,"toc":8880},[8876],{"type":42,"tag":43,"props":8877,"children":8878},{},[8879],{"type":47,"value":8863},{"title":8,"searchDepth":49,"depth":49,"links":8881},[],"content:publications:2022:a-pilot-study-investigating-student-interaction-preferences-in-immersive-virtual.md","publications\u002F2022\u002Fa-pilot-study-investigating-student-interaction-preferences-in-immersive-virtual.md","publications\u002F2022\u002Fa-pilot-study-investigating-student-interaction-preferences-in-immersive-virtual",{"_path":8886,"_dir":8704,"_draft":7,"_partial":7,"_locale":8,"title":8887,"description":8,"_hidden":7,"authors":8888,"authors_orcid":8889,"year":8714,"doi":8890,"openalex_id":8891,"venue":8134,"abstract_screenshot":21,"keywords":8892,"body":8895,"_type":51,"_id":8904,"_source":53,"_file":8905,"_stem":8906,"_extension":56,"locale":57},"\u002Fpublications\u002F2022\u002Fa-robust-detection-and-optimization-approach-for-delayed-measurements-in-uwb-par","A Robust Detection and Optimization Approach for Delayed Measurements in UWB Particle-Filter-Based Indoor Positioning",[7246,3376,12,7247],[7249,3380,15,7250],"https:\u002F\u002Fdoi.org\u002F10.33012\u002Fnavi.514","W4285144486",[7256,23,7796,5997,8136,8893,8894,332,3203,8138,4391,37,179,288],"Ranging","Positioning technology",{"type":39,"children":8896,"toc":8901},[8897],{"type":42,"tag":8143,"props":8898,"children":8899},{"id":8145},[8900],{"type":47,"value":8148},{"title":8,"searchDepth":49,"depth":49,"links":8902},[8903],{"id":8145,"depth":8152,"text":8148},"content:publications:2022:a-robust-detection-and-optimization-approach-for-delayed-measurements-in-uwb-par.md","publications\u002F2022\u002Fa-robust-detection-and-optimization-approach-for-delayed-measurements-in-uwb-par.md","publications\u002F2022\u002Fa-robust-detection-and-optimization-approach-for-delayed-measurements-in-uwb-par",{"_path":8908,"_dir":8704,"_draft":7,"_partial":7,"_locale":8,"title":8909,"description":8,"_hidden":7,"authors":8910,"authors_orcid":8911,"year":8714,"doi":8912,"openalex_id":8913,"venue":687,"abstract_screenshot":21,"keywords":8914,"body":8917,"_type":51,"_id":8921,"_source":53,"_file":8922,"_stem":8923,"_extension":56,"locale":57},"\u002Fpublications\u002F2022\u002Fa-smart-wearable-fall-detection-system-for-firefighters-using-v-rnn","A Smart Wearable Fall Detection System for Firefighters Using V-RNN",[8463,5667,5407,7746,5665],[8466,5670,5411,21,5669],"https:\u002F\u002Fdoi.org\u002F10.1007\u002F978-3-030-98404-5_12","W4226050858",[6973,23,8471,8472,8915,8916,984,4676,3203,180,37,4242,380,179],"Racket","Wearable technology",{"type":39,"children":8918,"toc":8919},[],{"title":8,"searchDepth":49,"depth":49,"links":8920},[],"content:publications:2022:a-smart-wearable-fall-detection-system-for-firefighters-using-v-rnn.md","publications\u002F2022\u002Fa-smart-wearable-fall-detection-system-for-firefighters-using-v-rnn.md","publications\u002F2022\u002Fa-smart-wearable-fall-detection-system-for-firefighters-using-v-rnn",{"_path":8925,"_dir":8704,"_draft":7,"_partial":7,"_locale":8,"title":8926,"description":8,"_hidden":7,"authors":8927,"authors_orcid":8933,"year":8714,"doi":8939,"openalex_id":8940,"venue":687,"abstract_screenshot":21,"keywords":8941,"body":8945,"_type":51,"_id":8949,"_source":53,"_file":8950,"_stem":8951,"_extension":56,"locale":57},"\u002Fpublications\u002F2022\u002Fan-empirical-assessment-of-security-and-privacy-risks-of-web-based-chatbots","An Empirical Assessment of Security and Privacy Risks of Web-Based Chatbots",[8928,8929,8930,8931,8932],"Waheed, Nazar","Ikram, Muhammad","Hashmi, Saad Sajid","He, Xiangjian","Nanda, Priyadarsi",[8934,8935,8936,8937,8938],"0000-0001-5679-5365","0000-0003-2113-3390","0000-0002-2042-3890","0000-0001-8962-540X","0000-0002-5748-155X","https:\u002F\u002Fdoi.org\u002F10.1007\u002F978-3-031-20891-1_23","W4313195941",[8942,3493,869,8943,8944,23,1109,180,1108,1112,1358],"Chatbot","Scrutiny","Anonymity",{"type":39,"children":8946,"toc":8947},[],{"title":8,"searchDepth":49,"depth":49,"links":8948},[],"content:publications:2022:an-empirical-assessment-of-security-and-privacy-risks-of-web-based-chatbots.md","publications\u002F2022\u002Fan-empirical-assessment-of-security-and-privacy-risks-of-web-based-chatbots.md","publications\u002F2022\u002Fan-empirical-assessment-of-security-and-privacy-risks-of-web-based-chatbots",{"_path":8953,"_dir":8704,"_draft":7,"_partial":7,"_locale":8,"title":8954,"description":8955,"_hidden":7,"and Evaluation”\" authors":8956,"authors_orcid":8957,"year":8714,"doi":8958,"openalex_id":8959,"venue":21,"abstract_screenshot":21,"keywords":8960,"body":8963,"_type":51,"_id":8976,"_source":53,"_file":8977,"_stem":8978,"_extension":56,"locale":57},"\u002Fpublications\u002F2022\u002Fan-extended-abstract-of-dynamic-random-testing-of-web-services-a-methodology-and","An Extended Abstract of “Dynamic Random Testing of Web Services: A Methodolog","J1C2 Presentation Abstract at IEEE SERVICES 2022 for IEEE Transactions on Services Computing, 2022, 15(2):736-751. DOI: 10.1109\u002FTSC.2019.2960496.",[1205,5486,3838,595,596,3165],[1210,5488,3841,599,600,3169],"https:\u002F\u002Fdoi.org\u002F10.1109\u002Fservices55459.2022.00043","W4292874616",[23,1163,8961,8962,1106,3846,1109,869,607,1112,215,658],"Dynamic web page","Dynamic testing",{"type":39,"children":8964,"toc":8974},[8965],{"type":42,"tag":43,"props":8966,"children":8967},{},[8968,8973],{"type":42,"tag":809,"props":8969,"children":8970},{},[8971],{"type":47,"value":8972},"J1C2 Presentation Abstract at IEEE SERVICES 2022 for IEEE Transactions on Services Computing, 2022, 15(2):736-751. DOI: 10.1109\u002FTSC.2019.2960496",{"type":47,"value":1645},{"title":8,"searchDepth":49,"depth":49,"links":8975},[],"content:publications:2022:an-extended-abstract-of-dynamic-random-testing-of-web-services-a-methodology-and.md","publications\u002F2022\u002Fan-extended-abstract-of-dynamic-random-testing-of-web-services-a-methodology-and.md","publications\u002F2022\u002Fan-extended-abstract-of-dynamic-random-testing-of-web-services-a-methodology-and",{"_path":8980,"_dir":8704,"_draft":7,"_partial":7,"_locale":8,"title":8981,"description":8982,"_hidden":7,"authors":8983,"authors_orcid":8985,"year":8714,"doi":8987,"openalex_id":8988,"venue":8989,"abstract_screenshot":21,"keywords":8990,"body":8997,"_type":51,"_id":9005,"_source":53,"_file":9006,"_stem":9007,"_extension":56,"locale":57},"\u002Fpublications\u002F2022\u002Fan-improved-ant-colony-approach-for-the-competitive-traveling-salesmen-problem","An Improved Ant Colony Approach for the Competitive Traveling Salesmen Problem","A competitive traveling salesmen problem is a variant of traveling salesman problem in that multiple agents compete with each other in visiting a number of cities. The agent who is the first one to visit a city will receive a reward. Each agent aims to collect as more rewards as possible with the minimum traveling distance. There is still not effective algorithms for this complicated decision making problem. We investigate an improved ant colony approach for the competitive traveling sales-men problem which adopts a time dominance mechanism and a revised pheromone depositing method to improve the quality of solutions with less computational complexity. Simulation results show that the proposed algorithm outperforms the state of art algorithms.",[8984,12,709,319,157],"Du, Xinyang",[8986,15,711,21,162],"0009-0005-8945-6032","https:\u002F\u002Fdoi.org\u002F10.1109\u002Fcec55065.2022.9870414","W4294811610","2022 IEEE Congress on Evolutionary Computation (CEC)",[8991,8992,23,31,8993,8994,8995,8996,24,37,34,332],"Travelling salesman problem","Ant colony optimization algorithms","Ant colony","Traveling purchaser problem","Dominance (genetics)","2-opt",{"type":39,"children":8998,"toc":9003},[8999],{"type":42,"tag":43,"props":9000,"children":9001},{},[9002],{"type":47,"value":8982},{"title":8,"searchDepth":49,"depth":49,"links":9004},[],"content:publications:2022:an-improved-ant-colony-approach-for-the-competitive-traveling-salesmen-problem.md","publications\u002F2022\u002Fan-improved-ant-colony-approach-for-the-competitive-traveling-salesmen-problem.md","publications\u002F2022\u002Fan-improved-ant-colony-approach-for-the-competitive-traveling-salesmen-problem",{"_path":9009,"_dir":8704,"_draft":7,"_partial":7,"_locale":8,"title":9010,"description":9011,"_hidden":7,"Contour Approximation authors":9012,"authors_orcid":9018,"year":8714,"doi":9023,"openalex_id":9024,"venue":9025,"abstract_screenshot":21,"keywords":9026,"body":9031,"_type":51,"_id":9039,"_source":53,"_file":9040,"_stem":9041,"_extension":56,"locale":57},"\u002Fpublications\u002F2022\u002Farbitrary-shape-scene-text-detection-via-visual-relational-rectification-and-con","Arbitrary-Shape Scene Text Detection via Visual-Relational Rectification and","One trend in the latest bottom-up approaches for arbitrary-shape scene text detection is to determine the links between text segments using Graph Convolutional Networks (GCNs). However, the performance of these bottom-up methods is still inferior to that of state-of-the-art top-down methods even with the help of GCNs. We argue that a cause of this is that bottom-up methods fail to make proper use of visual-relational features, which results in accumulated false detection, as well as the error-prone route-finding used for grouping text segments. In this paper, we improve classic bottom-up text detection frameworks by fusing the visual-relational features of text with two effective false positive\u002Fnegative suppression (FPNS) mechanisms and developing a new shape-approximation strategy. First, dense overlapping text segments depicting the “characterness” and “streamline” properties of text are constructed and used in weakly supervised node classification to filter the falsely detected text segments. Then, relational features and visual features of text segments are fused with a novel Location-Aware Transfer (LAT) module and Fuse Decoding (FD) module to jointly rectify the detected text segments. Finally, a novel multiple-text-map-aware contour-approximation strategy is developed based on the rectified text segments, instead of the error-prone route-finding process, to generate the final contour of the detected text. Experiments conducted on five benchmark datasets demonstrate that our method outperforms the state-of-the-art performance when embedded in a classic text detection framework, which revitalizes the strengths of bottom-up methods.",[9013,9014,9015,9016,9017,8931],"Xu, Chengpei","Jia, Wenjing","Cui, Tingcheng","Wang, Ruomei","Zhang, Yuanfang",[9019,9020,21,9021,9022,8937],"0000-0001-8860-7701","0000-0002-0940-3338","0000-0002-2712-4412","0000-0002-1021-2969","https:\u002F\u002Fdoi.org\u002F10.1109\u002Ftmm.2022.3171085","W4293203016","IEEE Transactions on Multimedia",[23,37,9027,9028,4876,209,9029,9030,102],"Noisy text analytics","Visualization","Graph","Text graph",{"type":39,"children":9032,"toc":9037},[9033],{"type":42,"tag":43,"props":9034,"children":9035},{},[9036],{"type":47,"value":9011},{"title":8,"searchDepth":49,"depth":49,"links":9038},[],"content:publications:2022:arbitrary-shape-scene-text-detection-via-visual-relational-rectification-and-con.md","publications\u002F2022\u002Farbitrary-shape-scene-text-detection-via-visual-relational-rectification-and-con.md","publications\u002F2022\u002Farbitrary-shape-scene-text-detection-via-visual-relational-rectification-and-con",{"_path":9043,"_dir":8704,"_draft":7,"_partial":7,"_locale":8,"title":9044,"description":9045,"_hidden":7,"authors":9046,"authors_orcid":9049,"year":8714,"doi":9052,"openalex_id":9053,"venue":9054,"abstract_screenshot":21,"keywords":9055,"body":9061,"_type":51,"_id":9069,"_source":53,"_file":9070,"_stem":9071,"_extension":56,"locale":57},"\u002Fpublications\u002F2022\u002Fboosting-the-discriminant-power-of-naive-bayes","Boosting the Discriminant Power of Naive Bayes","Naive Bayes has been widely used in many applications because of its simplicity and ability in handling both numerical data and categorical data. However, lack of modeling of correlations between features limits its performance. In addition, noise and outliers in the real-world dataset also greatly degrade the classification performance. In this paper, we propose a feature augmentation method employing a stack auto-encoder to reduce the noise in the data and boost the discriminant power of naive Bayes. The proposed stack auto-encoder consists of two auto-encoders for different purposes. The first encoder shrinks the initial features to derive a compact feature representation in order to remove the noise and redundant information. The second encoder boosts the discriminant power of the features by expanding them into a higher-dimensional space so that different classes of samples could be better separated in the higher-dimensional space. By integrating the proposed feature augmentation method with the regularized naive Bayes, the discrimination power of the model is greatly enhanced. The proposed method is evaluated on a set of machine-learning benchmark datasets. The experimental results show that the proposed method significantly and consistently outperforms the state-of-the-art naive Bayes classifiers.",[6135,6111,9047,12,9048],"Lian, Xiaoyu","Jiang, Xudong",[6137,6113,9050,15,9051],"0000-0003-0966-1166","0000-0002-9104-2315","https:\u002F\u002Fdoi.org\u002F10.1109\u002Ficpr56361.2022.9956358","W4312854161","2022 26th International Conference on Pattern Recognition (ICPR)",[6141,23,4876,37,9056,3660,9057,6146,215,9058,4093,7796,6875,9059,7391,9060,181,3688,5591],"Linear discriminant analysis","Categorical variable","Encoder","Discriminant","Feature vector",{"type":39,"children":9062,"toc":9067},[9063],{"type":42,"tag":43,"props":9064,"children":9065},{},[9066],{"type":47,"value":9045},{"title":8,"searchDepth":49,"depth":49,"links":9068},[],"content:publications:2022:boosting-the-discriminant-power-of-naive-bayes.md","publications\u002F2022\u002Fboosting-the-discriminant-power-of-naive-bayes.md","publications\u002F2022\u002Fboosting-the-discriminant-power-of-naive-bayes",{"_path":9073,"_dir":8704,"_draft":7,"_partial":7,"_locale":8,"title":9074,"description":8,"_hidden":7,"authors":9075,"authors_orcid":9081,"year":8714,"doi":9087,"openalex_id":9088,"venue":687,"abstract_screenshot":21,"keywords":9089,"body":9092,"_type":51,"_id":9096,"_source":53,"_file":9097,"_stem":9098,"_extension":56,"locale":57},"\u002Fpublications\u002F2022\u002Fcar-class-aware-regularizations-for-semantic-segmentation","CAR: Class-Aware Regularizations for Semantic Segmentation",[9076,9077,9078,9079,9014,9080,8931],"Huang, Ye","Kang, Di","Chen, Liang","Zhe, Xuefei","Bao, Linchao",[9082,9083,9084,9085,9020,9086,8937],"0000-0001-5668-5529","0000-0002-8996-0897","0000-0003-0712-4738","0000-0002-5005-7166","0000-0001-9543-3754","https:\u002F\u002Fdoi.org\u002F10.1007\u002F978-3-031-19815-1_30","W4221142870",[23,9090,37,9091,862,3660,4649,4876,6875,215],"Segmentation","Pixel",{"type":39,"children":9093,"toc":9094},[],{"title":8,"searchDepth":49,"depth":49,"links":9095},[],"content:publications:2022:car-class-aware-regularizations-for-semantic-segmentation.md","publications\u002F2022\u002Fcar-class-aware-regularizations-for-semantic-segmentation.md","publications\u002F2022\u002Fcar-class-aware-regularizations-for-semantic-segmentation",{"_path":9100,"_dir":8704,"_draft":7,"_partial":7,"_locale":8,"title":9101,"description":8,"_hidden":7,"authors":9102,"authors_orcid":9104,"year":8714,"doi":9105,"openalex_id":9106,"venue":8647,"abstract_screenshot":21,"keywords":9107,"body":9110,"_type":51,"_id":9114,"_source":53,"_file":9115,"_stem":9116,"_extension":56,"locale":57},"\u002Fpublications\u002F2022\u002Fchinese-sign-language-recognition-with-batch-sampling-resnet-bi-lstm","Chinese Sign Language Recognition with Batch Sampling ResNet-Bi-LSTM",[5665,9103,5667],"Xu, Haokai",[5669,21,5670],"https:\u002F\u002Fdoi.org\u002F10.1007\u002Fs42979-022-01341-4","W4289711801",[6971,23,9108,6975,4479,37,6980,9109,5925,34],"Interpreter","Modalities",{"type":39,"children":9111,"toc":9112},[],{"title":8,"searchDepth":49,"depth":49,"links":9113},[],"content:publications:2022:chinese-sign-language-recognition-with-batch-sampling-resnet-bi-lstm.md","publications\u002F2022\u002Fchinese-sign-language-recognition-with-batch-sampling-resnet-bi-lstm.md","publications\u002F2022\u002Fchinese-sign-language-recognition-with-batch-sampling-resnet-bi-lstm",{"_path":9118,"_dir":8704,"_draft":7,"_partial":7,"_locale":8,"title":9119,"description":9120,"_hidden":7,"authors":9121,"authors_orcid":9122,"year":8714,"doi":9123,"openalex_id":9124,"venue":9125,"abstract_screenshot":9126,"keywords":9127,"body":9128,"_type":51,"_id":9136,"_source":53,"_file":9137,"_stem":9138,"_extension":56,"locale":57},"\u002Fpublications\u002F2022\u002Fconnecting-everyday-objects-with-the-metaverse-a-unified-recognition-framework","Connecting Everyday Objects with the Metaverse: A Unified Recognition Framework","The recent Facebook rebranding to Meta has drawn renewed attention to the metaverse. Technology giants, amongst others, are increasingly embracing the vision and opportunities of a hybrid social experience that mixes physical and virtual interactions. As the metaverse gains in traction, it is expected that everyday objects may soon connect more closely with virtual elements. However, discovering this “hidden” virtual world will be a crucial first step to interacting with it in this new augmented world. In this paper, we address the problem of connecting phys-ical objects with their virtual counterparts, especially through connections built upon visual markers. We propose a unified recognition framework that guides approaches to the metaverse access points. We illustrate the use of the framework through experimental studies under different conditions, in which an interactive and visually attractive decoration pattern, an Artcode, is used as the approach to enable the connection. This paper will be of interest to, amongst others, researchers working in Interaction Design or Augmented Reality who are seeking techniques or guidelines for augmenting physical objects in an unobtrusive, complementary manner.",[4377,595,4378,4379],[4381,599,4382,4383],"https:\u002F\u002Fdoi.org\u002F10.1109\u002Fcompsac54236.2022.00063","W4292230762","2022 IEEE 46th Annual Computers, Software, and Applications Conference (COMPSAC)","connecting-everyday-objects-with-the-metaverse-a-unified-recognition-framework.png",[23,4389,868,4390],{"type":39,"children":9129,"toc":9134},[9130],{"type":42,"tag":43,"props":9131,"children":9132},{},[9133],{"type":47,"value":9120},{"title":8,"searchDepth":49,"depth":49,"links":9135},[],"content:publications:2022:connecting-everyday-objects-with-the-metaverse-a-unified-recognition-framework.md","publications\u002F2022\u002Fconnecting-everyday-objects-with-the-metaverse-a-unified-recognition-framework.md","publications\u002F2022\u002Fconnecting-everyday-objects-with-the-metaverse-a-unified-recognition-framework",{"_path":9140,"_dir":8704,"_draft":7,"_partial":7,"_locale":8,"title":9141,"description":8,"_hidden":7,"authors":9142,"authors_orcid":9144,"year":8714,"doi":9146,"openalex_id":9147,"venue":9148,"abstract_screenshot":21,"keywords":9149,"body":9151,"_type":51,"_id":9155,"_source":53,"_file":9156,"_stem":9157,"_extension":56,"locale":57},"\u002Fpublications\u002F2022\u002Fcontainer-terminal-daily-gate-in-and-gate-out-forecasting-using-machine-learning","Container terminal daily gate in and gate out forecasting using machine learning methods",[7198,9143,7302,709,12],"Ma, Mingyu",[7202,9145,7310,711,15],"0000-0003-3923-881X","https:\u002F\u002Fdoi.org\u002F10.1016\u002Fj.tranpol.2022.11.010","W4309749674","Transport Policy",[1189,3199,5547,9150,23,101,5097,1192,984,3203,179,5098,215,251,928,7576,288,5998,1113],"Workload",{"type":39,"children":9152,"toc":9153},[],{"title":8,"searchDepth":49,"depth":49,"links":9154},[],"content:publications:2022:container-terminal-daily-gate-in-and-gate-out-forecasting-using-machine-learning.md","publications\u002F2022\u002Fcontainer-terminal-daily-gate-in-and-gate-out-forecasting-using-machine-learning.md","publications\u002F2022\u002Fcontainer-terminal-daily-gate-in-and-gate-out-forecasting-using-machine-learning",{"_path":9159,"_dir":8704,"_draft":7,"_partial":7,"_locale":8,"title":9160,"description":9161,"_hidden":7,"authors":9162,"authors_orcid":9163,"year":8714,"doi":9164,"openalex_id":9165,"venue":206,"abstract_screenshot":21,"keywords":9166,"body":9167,"_type":51,"_id":9175,"_source":53,"_file":9176,"_stem":9177,"_extension":56,"locale":57},"\u002Fpublications\u002F2022\u002Fcooperative-double-layer-genetic-programming-hyper-heuristic-for-online-containe","Cooperative Double-Layer Genetic Programming Hyper-Heuristic for Online Container Terminal Truck Dispatching","In a marine container terminal, truck dispatching is a crucial problem that impacts the operation efficiency of the whole port. Traditionally, this problem is formulated as an offline optimization problem, whose solutions are, however, impractical for most real-world scenarios primarily because of the uncertainties of dynamic events in both yard operations and seaside loading–unloading operations. These solutions are either unattractive or infeasible to execute. Herein, for more intelligent handling of these uncertainties and dynamics, a novel cooperative double-layer genetic programming hyper-heuristic (CD-GPHH) is proposed to tackle this challenging online optimization problem. In this new CD-GPHH, a novel scenario genetic programming (GP) approach is added on top of a traditional GP method that chooses among different GP heuristics for different scenarios to facilitate optimized truck dispatching. In contrast to traditional arithmetic GP (AGP) and GP with logic operators (LGP) which only evolve on one population, our CD-GPHH method separates the scenario and the calculation into two populations, which improved the quality of solutions in multiscenario problems while reducing the search space. Experimental results show that our CD-GPHH dominates AGP and LGP in solving a multiscenario function fitting problem as well as a truck dispatching problem in a container terminal.",[5989,12,319,908],[5991,15,322,913],"https:\u002F\u002Fdoi.org\u002F10.1109\u002Ftevc.2022.3209985","W4312994607",[1189,746,506,106,23,329,31,97,3199,952,720,179,37,34,332,251,215],{"type":39,"children":9168,"toc":9173},[9169],{"type":42,"tag":43,"props":9170,"children":9171},{},[9172],{"type":47,"value":9161},{"title":8,"searchDepth":49,"depth":49,"links":9174},[],"content:publications:2022:cooperative-double-layer-genetic-programming-hyper-heuristic-for-online-containe.md","publications\u002F2022\u002Fcooperative-double-layer-genetic-programming-hyper-heuristic-for-online-containe.md","publications\u002F2022\u002Fcooperative-double-layer-genetic-programming-hyper-heuristic-for-online-containe",{"_path":9179,"_dir":8704,"_draft":7,"_partial":7,"_locale":8,"title":9180,"description":8,"_hidden":7,"authors":9181,"authors_orcid":9183,"year":8714,"doi":9186,"openalex_id":9187,"venue":374,"abstract_screenshot":21,"keywords":9188,"body":9191,"_type":51,"_id":9195,"_source":53,"_file":9196,"_stem":9197,"_extension":56,"locale":57},"\u002Fpublications\u002F2022\u002Fcross-document-attention-based-gated-fusion-network-for-automated-medical-licens","Cross-document attention-based gated fusion network for automated medical licensing exam",[6482,6111,5816,7409,5815,9182,12],"Zhang, Zibo",[21,6113,9184,7415,5820,9185,15],"0009-0003-6923-944X","0000-0002-4744-0228","https:\u002F\u002Fdoi.org\u002F10.1016\u002Fj.eswa.2022.117588","W4280488523",[23,9189,9190,37,181,215],"Fusion","Cross-validation",{"type":39,"children":9192,"toc":9193},[],{"title":8,"searchDepth":49,"depth":49,"links":9194},[],"content:publications:2022:cross-document-attention-based-gated-fusion-network-for-automated-medical-licens.md","publications\u002F2022\u002Fcross-document-attention-based-gated-fusion-network-for-automated-medical-licens.md","publications\u002F2022\u002Fcross-document-attention-based-gated-fusion-network-for-automated-medical-licens",{"_path":9199,"_dir":8704,"_draft":7,"_partial":7,"_locale":8,"title":9200,"description":8,"_hidden":7,"Device authors":9201,"authors_orcid":9204,"year":8714,"doi":9207,"openalex_id":9208,"venue":687,"abstract_screenshot":21,"keywords":9209,"body":9215,"_type":51,"_id":9219,"_source":53,"_file":9220,"_stem":9221,"_extension":56,"locale":57},"\u002Fpublications\u002F2022\u002Fcyclegan-based-motion-artifact-cancellation-for-photoplethysmography-wearable-de","CycleGAN Based Motion Artifact Cancellation for Photoplethysmography Wearable",[9202,9203,5667,5665],"Long, Nguyen Mai Hoang","Kim, Jong Jin",[9205,9206,5670,5669],"0000-0002-1636-2220","0000-0001-9981-1353","https:\u002F\u002Fdoi.org\u002F10.1007\u002F978-3-030-98404-5_13","W4225716613",[9210,23,9211,37,9212,4391,9213,6979,6980,9214,5550],"Photoplethysmogram","Artifact (error)","SIGNAL (programming language)","Signal processing","Digital signal processing",{"type":39,"children":9216,"toc":9217},[],{"title":8,"searchDepth":49,"depth":49,"links":9218},[],"content:publications:2022:cyclegan-based-motion-artifact-cancellation-for-photoplethysmography-wearable-de.md","publications\u002F2022\u002Fcyclegan-based-motion-artifact-cancellation-for-photoplethysmography-wearable-de.md","publications\u002F2022\u002Fcyclegan-based-motion-artifact-cancellation-for-photoplethysmography-wearable-de",{"_path":9223,"_dir":8704,"_draft":7,"_partial":7,"_locale":8,"title":9224,"description":9225,"_hidden":7,"authors":9226,"authors_orcid":9228,"year":8714,"doi":9230,"openalex_id":9231,"venue":1215,"abstract_screenshot":21,"keywords":9232,"body":9234,"_type":51,"_id":9242,"_source":53,"_file":9243,"_stem":9244,"_extension":56,"locale":57},"\u002Fpublications\u002F2022\u002Fdissimilarity-based-test-case-prioritization-through-data-fusion","Dissimilarity‐based test case prioritization through data fusion","Abstract Test case prioritization (TCP) aims at scheduling test case execution so that more important test cases are executed as early as possible. Many TCP techniques have been proposed, according to different concepts and principles, with dissimilarity‐based TCP (DTCP) prioritizing tests based on the concept of test case dissimilarity: DTCP chooses the next test case from a set of candidates such that the chosen test case is farther away from previously selected test cases than the other candidates. DTCP techniques typically only use one aspect\u002Fgranularity of the information or features from test cases to support the prioritization process. In this article, we adopt the concept of data fusion to propose a new family of DTCP techniques, data‐fusion‐driven DTCP (DDTCP), which attempts to use different information granularities for prioritizing test cases by dissimilarity. We performed an empirical study involving 30 versions of five subject programs, investigating the testing effectiveness and efficiency by comparing DDTCP against DTCP techniques that use a dissimilarity granularity. The experimental results show that not only does DDTCP have better fault‐detection rates than single‐granularity DTCP techniques, but it also appears to only incur similar prioritization costs. The results also show that DDTCP remains robust over multiple system releases.",[645,595,5249,3922,9227],"Yang, Ning",[650,599,21,21,9229],"0000-0003-4388-2691","https:\u002F\u002Fdoi.org\u002F10.1002\u002Fspe.3068","W4205200396",[9233,656,23,181,659,774,101,658,135,37,215,179,607],"Granularity",{"type":39,"children":9235,"toc":9240},[9236],{"type":42,"tag":43,"props":9237,"children":9238},{},[9239],{"type":47,"value":9225},{"title":8,"searchDepth":49,"depth":49,"links":9241},[],"content:publications:2022:dissimilarity-based-test-case-prioritization-through-data-fusion.md","publications\u002F2022\u002Fdissimilarity-based-test-case-prioritization-through-data-fusion.md","publications\u002F2022\u002Fdissimilarity-based-test-case-prioritization-through-data-fusion",{"_path":9246,"_dir":8704,"_draft":7,"_partial":7,"_locale":8,"title":9247,"description":8,"_hidden":7,"authors":9248,"authors_orcid":9252,"year":8714,"doi":9255,"openalex_id":9256,"venue":9257,"abstract_screenshot":21,"keywords":9258,"body":9259,"_type":51,"_id":9263,"_source":53,"_file":9264,"_stem":9265,"_extension":56,"locale":57},"\u002Fpublications\u002F2022\u002Fdynamic-incentive-schemes-for-managing-dockless-bike-sharing-systems","Dynamic incentive schemes for managing dockless bike-sharing systems",[7302,9249,9250,9251],"Liu, Shaoxuan","So, Kut C.","Wang, Kun",[7310,9253,21,9254],"0000-0002-4808-5272","0000-0002-2137-9457","https:\u002F\u002Fdoi.org\u002F10.1016\u002Fj.trc.2021.103527","W4206276011","Transportation Research Part C Emerging Technologies",[5472,1190,23,240,101,24,984,178,7631,179,36,751],{"type":39,"children":9260,"toc":9261},[],{"title":8,"searchDepth":49,"depth":49,"links":9262},[],"content:publications:2022:dynamic-incentive-schemes-for-managing-dockless-bike-sharing-systems.md","publications\u002F2022\u002Fdynamic-incentive-schemes-for-managing-dockless-bike-sharing-systems.md","publications\u002F2022\u002Fdynamic-incentive-schemes-for-managing-dockless-bike-sharing-systems",{"_path":9267,"_dir":8704,"_draft":7,"_partial":7,"_locale":8,"title":9268,"description":9269,"_hidden":7,"Multi-Scale Volume Local Binary Pattern authors":9270,"authors_orcid":9272,"year":8714,"doi":9275,"openalex_id":9276,"venue":9277,"Processing (ICASSP) abstract_screenshot":21,"keywords":9278,"body":9286,"_type":51,"_id":9294,"_source":53,"_file":9295,"_stem":9296,"_extension":56,"locale":57},"\u002Fpublications\u002F2022\u002Fdynamic-texture-recognition-using-pdv-hashing-and-dictionary-learning-on-multi-s","Dynamic Texture Recognition Using PDV Hashing and Dictionary Learning on","Spatial-temporal local binary pattern (STLBP) has been widely used in dynamic texture recognition. STLBP often encounters the high-dimension problem as its dimension increases exponentially, so that STLBP could only utilize a small neighborhood. To tackle this problem, we propose a method for dynamic texture recognition using PDV hashing and dictionary learning on multi-scale volume local binary pattern (PHD-MVLBP). Instead of forming very high-dimensional LBP-histogram features, it first uses hash functions to map the pixel difference vectors (PDVs) to binary vectors, then forms a dictionary using the derived binary vector, and encodes them using the derived dictionary. In such a way, the PDVs are mapped to feature vectors of the size of the dictionary, instead of LBP histograms of very high dimension. Such an encoding scheme could extract the discriminant information from videos in a much larger neighborhood effectively. The experimental results on two widely-used dynamic textures datasets, DynTex++ and UCLA, show the superior performance of the proposed approach over the state-of-the-art methods.",[9271,6111,5532,157],"Ding, Ruxin",[9273,6113,5537,9274],"0000-0002-1174-5193","0000-0002-8171-478X","https:\u002F\u002Fdoi.org\u002F10.1109\u002Ficassp43922.2022.9747106","W3216518016","ICASSP 2022 - 2022 IEEE International Conference on Acoustics, Speech and Signal",[4876,37,9279,9280,9281,23,9282,9283,354,9091,9284,9060,34,4004,9285],"Local binary patterns","Histogram","Feature hashing","Hash function","Binary number","Hash table","Double hashing",{"type":39,"children":9287,"toc":9292},[9288],{"type":42,"tag":43,"props":9289,"children":9290},{},[9291],{"type":47,"value":9269},{"title":8,"searchDepth":49,"depth":49,"links":9293},[],"content:publications:2022:dynamic-texture-recognition-using-pdv-hashing-and-dictionary-learning-on-multi-s.md","publications\u002F2022\u002Fdynamic-texture-recognition-using-pdv-hashing-and-dictionary-learning-on-multi-s.md","publications\u002F2022\u002Fdynamic-texture-recognition-using-pdv-hashing-and-dictionary-learning-on-multi-s",{"_path":9298,"_dir":8704,"_draft":7,"_partial":7,"_locale":8,"title":9299,"description":9300,"_hidden":7,"authors":9301,"authors_orcid":9307,"year":8714,"doi":9312,"openalex_id":9313,"venue":21,"abstract_screenshot":21,"keywords":9314,"body":9318,"_type":51,"_id":9326,"_source":53,"_file":9327,"_stem":9328,"_extension":56,"locale":57},"\u002Fpublications\u002F2022\u002Fefficient-and-accurate-feature-extraction-using-local-density-detector","Efficient and Accurate Feature Extraction Using Local Density Detector","Feature detection is essential to a large number of vision-based applications. Among the approaches available, keypoint detection-based ones, e.g., SIFT, SURF, and ORB, are very popular. In particular, ORB stands out given its attractive balance of efficiency and efficacy, compared to other methods. However, a major drawback that affects the performance of ORB is the high density of keypoints it detects. In this work, a novel method namely local density enhanced ORB (ORBLD) is proposed. ORBLD mitigates ORB's weakness by adopting a local density detector to regulate the number of the keypoints. This approach achieves lower computational cost and reserves robustness under transformation and environmental changes. ORBLD is evaluated by setting up experiments with a self-driving related dataset, and the results show the reduction of 59.8% of keypoints mainly from redundant area, while the representative keypoints are reserved. ORBLD can facilitate the subsequent steps in feature extraction by optimizing keypoint selection and thus results in overall improved performance.",[9302,9303,5942,6111,9304,9305,9306,5532],"He, Yuting","Meng, Jiahui","Li, Jingjin","Yang, Qingyu","Cai, Liyu",[9308,9309,5944,6113,9310,9311,21,5537],"0000-0002-1018-1912","0000-0002-4250-2389","0000-0001-7248-5180","0000-0001-9375-0457","https:\u002F\u002Fdoi.org\u002F10.1145\u002F3573942.3574059","W4376852232",[5747,9315,353,7391,23,37,4094,4876,9316,9317,4391,179,4004],"Scale-invariant feature transform","Performance improvement","Feature selection",{"type":39,"children":9319,"toc":9324},[9320],{"type":42,"tag":43,"props":9321,"children":9322},{},[9323],{"type":47,"value":9300},{"title":8,"searchDepth":49,"depth":49,"links":9325},[],"content:publications:2022:efficient-and-accurate-feature-extraction-using-local-density-detector.md","publications\u002F2022\u002Fefficient-and-accurate-feature-extraction-using-local-density-detector.md","publications\u002F2022\u002Fefficient-and-accurate-feature-extraction-using-local-density-detector",{"_path":9330,"_dir":8704,"_draft":7,"_partial":7,"_locale":8,"title":9331,"description":8,"_hidden":7,"acquisitions authors":9332,"authors_orcid":9334,"year":8714,"doi":9336,"openalex_id":9337,"venue":9338,"abstract_screenshot":21,"keywords":9339,"body":9343,"_type":51,"_id":9347,"_source":53,"_file":9348,"_stem":9349,"_extension":56,"locale":57},"\u002Fpublications\u002F2022\u002Femerging-market-multinationals-pursuit-of-strategic-assets-through-cross-border","Emerging market multinationals’ pursuit of strategic assets through cross-border",[1428,9333,268],"Gunessee, Saileshsingh",[21,9335,272],"0000-0001-9338-4338","https:\u002F\u002Fdoi.org\u002F10.1016\u002Fj.ribaf.2022.101792","W4306630544","Research in International Business and Finance",[9340,9341,178,5150,6600,5153,751,9342,429],"Multinational corporation","Complementary assets","Commerce",{"type":39,"children":9344,"toc":9345},[],{"title":8,"searchDepth":49,"depth":49,"links":9346},[],"content:publications:2022:emerging-market-multinationals-pursuit-of-strategic-assets-through-cross-border.md","publications\u002F2022\u002Femerging-market-multinationals-pursuit-of-strategic-assets-through-cross-border.md","publications\u002F2022\u002Femerging-market-multinationals-pursuit-of-strategic-assets-through-cross-border",{"_path":9351,"_dir":8704,"_draft":7,"_partial":7,"_locale":8,"title":9352,"description":9353,"_hidden":7,"authors":9354,"authors_orcid":9357,"year":8714,"doi":9360,"openalex_id":9361,"venue":9362,"abstract_screenshot":21,"keywords":9363,"body":9370,"_type":51,"_id":9378,"_source":53,"_file":9379,"_stem":9380,"_extension":56,"locale":57},"\u002Fpublications\u002F2022\u002Femployer-branding-and-talent-recruitment-a-systematic-literature-review","Employer Branding and Talent Recruitment: A Systematic Literature Review","In the contemporary highly competitive business environment, employer branding is of greatest importance to talent attraction. However, studies on employer branding and talent recruitment are scattered in diverse disciplines due to the multidisciplinary nature of the problem, and a synthesis is needed to understand what we know, and what we should know about this important problem. This study aims to systematically and comprehensively review extant literature, map out the state of research, and propose avenues for future research on this important subject. Using the method of systematic literature review, we conducted both a descriptive analysis and a thematic analysis of 79 relevant studies. Descriptive analysis was adopted to present research trends in employer banding and recruitment. Thematic analysis was organized in a heuristic model of antecedents, moderators and outcomes of employer branding. Further, dimensionality of employer branding was also examined in this study. We discuss results and implications of our findings, to suggest promising avenues to advance research on employer branding and recruitment. Keywords: employer brand, employer branding, talent, recruitment",[9355,9356,65],"Chen, Xia","Lemański, Michał K.",[9358,9359,70],"0000-0002-0994-5401","0000-0003-3882-557X","https:\u002F\u002Fdoi.org\u002F10.5465\u002Fambpp.2022.16148abstract","W4286665241","Academy of Management Proceedings",[9364,9365,9366,9367,9368,751,4413,178,6927,1380,1358,5514,3096,9369],"Employer branding","Extant taxon","Thematic analysis","Descriptive statistics","Descriptive research","New product development",{"type":39,"children":9371,"toc":9376},[9372],{"type":42,"tag":43,"props":9373,"children":9374},{},[9375],{"type":47,"value":9353},{"title":8,"searchDepth":49,"depth":49,"links":9377},[],"content:publications:2022:employer-branding-and-talent-recruitment-a-systematic-literature-review.md","publications\u002F2022\u002Femployer-branding-and-talent-recruitment-a-systematic-literature-review.md","publications\u002F2022\u002Femployer-branding-and-talent-recruitment-a-systematic-literature-review",{"_path":9382,"_dir":8704,"_draft":7,"_partial":7,"_locale":8,"title":9383,"description":8,"_hidden":7,"images authors":9384,"authors_orcid":9387,"year":8714,"doi":9388,"openalex_id":9389,"venue":9390,"abstract_screenshot":21,"keywords":9391,"body":9400,"_type":51,"_id":9404,"_source":53,"_file":9405,"_stem":9406,"_extension":56,"locale":57},"\u002Fpublications\u002F2022\u002Fend-to-end-metastasis-detection-of-breast-cancer-from-histopathology-whole-slide","End-to-end metastasis detection of breast cancer from histopathology whole slide",[9385,8931,9014,9386],"Khaliliboroujeni, Sepideh","Amirgholipour, Saeed",[21,8937,9020,21],"https:\u002F\u002Fdoi.org\u002F10.1016\u002Fj.compmedimag.2022.102136","W4306181160","Computerized Medical Imaging and Graphics",[23,9392,9393,9394,9395,9109,37,9396,9397,9398,4876,380,9399],"Breast cancer","Computer-aided diagnosis","Metastasis","CAD","Cancer","Cancer detection","Medical physics","Internal medicine",{"type":39,"children":9401,"toc":9402},[],{"title":8,"searchDepth":49,"depth":49,"links":9403},[],"content:publications:2022:end-to-end-metastasis-detection-of-breast-cancer-from-histopathology-whole-slide.md","publications\u002F2022\u002Fend-to-end-metastasis-detection-of-breast-cancer-from-histopathology-whole-slide.md","publications\u002F2022\u002Fend-to-end-metastasis-detection-of-breast-cancer-from-histopathology-whole-slide",{"_path":9408,"_dir":8704,"_draft":7,"_partial":7,"_locale":8,"title":9409,"description":9410,"_hidden":7,"Wireless-Powered Networks authors":9411,"authors_orcid":9417,"year":8714,"doi":9423,"openalex_id":9424,"venue":9425,"abstract_screenshot":21,"keywords":9426,"body":9429,"_type":51,"_id":9437,"_source":53,"_file":9438,"_stem":9439,"_extension":56,"locale":57},"\u002Fpublications\u002F2022\u002Fenergy-efficient-multicodebook-based-backscatter-communications-for-wireless-pow","Energy-Efficient Multicodebook-Based Backscatter Communications for","Backscatter communications have been widely adopted in wireless networks for low-power IoT devices. For the devices which are powered by a battery or harvest energy from ambient signals, it is important to backscatter data in an energy-efficient manner. Inspired by the energy consumption disparity (ECD) between backscattering bit 0 and bit 1, we propose an energy-efficient multicodebook-based backscatter communication (MBBC) scheme, where multiple prefix codebooks, differentiated by multiple data rates, are meticulously designed and shared by the sender and the receiver. The sender backscatters the codewords in the corresponding codebooks, and the receiver recovers the original data by searching the corresponding codebooks. To design the energy-efficient multiple codebooks, we formulate the optimization problem as the minimization of the energy consumption of backscattering data. To address the optimization problem, we employ a forest to represent the multiple codebooks, where each codebook is represented by a binary tree. By conducting the pruning and expanding operations (PEOs) on the forest, we propose a heuristic algorithm to search the energy-efficient codebooks. Simulation results demonstrate that, compared with the other schemes, the proposed MBBC scheme significantly saves energy without sacrificing throughput.",[9412,9413,9414,9415,9416],"Zhang, Yufan","Liu, Xiaoying","Zheng, Kechen","Li, Yanjun","Yao, Yuan",[9418,9419,9420,9421,9422],"0009-0000-5498-412X","0000-0002-4592-0631","0000-0003-3886-4288","0000-0002-3976-3828","0000-0002-2705-6245","https:\u002F\u002Fdoi.org\u002F10.1109\u002Fjiot.2022.3162095","W4220938988","IEEE Internet of Things Journal",[9427,23,9428,920,6803,329,5998,5544,5547,3664,332,3203,251,5551,288,928,37,34],"Codebook","Backscatter (email)",{"type":39,"children":9430,"toc":9435},[9431],{"type":42,"tag":43,"props":9432,"children":9433},{},[9434],{"type":47,"value":9410},{"title":8,"searchDepth":49,"depth":49,"links":9436},[],"content:publications:2022:energy-efficient-multicodebook-based-backscatter-communications-for-wireless-pow.md","publications\u002F2022\u002Fenergy-efficient-multicodebook-based-backscatter-communications-for-wireless-pow.md","publications\u002F2022\u002Fenergy-efficient-multicodebook-based-backscatter-communications-for-wireless-pow",{"_path":9441,"_dir":8704,"_draft":7,"_partial":7,"_locale":8,"title":9442,"description":8,"_hidden":7,"University\" authors":9443,"authors_orcid":9446,"year":8714,"doi":9447,"openalex_id":9448,"venue":21,"abstract_screenshot":21,"keywords":9449,"body":9450,"_type":51,"_id":9454,"_source":53,"_file":9455,"_stem":9456,"_extension":56,"locale":57},"\u002Fpublications\u002F2022\u002Fevaluating-microlearning-a-cross-faculty-case-study-of-a-sino-foreign-university","Evaluating Microlearning: A Cross-faculty Case Study of a Sino-foreig",[9444,9445,7077,4824,7078,595,5407],"Krygier, David","Knowles, Lauren Ruth",[21,21,7081,21,7082,599,5411],"https:\u002F\u002Fdoi.org\u002F10.1007\u002F978-3-030-92979-4_4","W4312923204",[866,865,1358,1380],{"type":39,"children":9451,"toc":9452},[],{"title":8,"searchDepth":49,"depth":49,"links":9453},[],"content:publications:2022:evaluating-microlearning-a-cross-faculty-case-study-of-a-sino-foreign-university.md","publications\u002F2022\u002Fevaluating-microlearning-a-cross-faculty-case-study-of-a-sino-foreign-university.md","publications\u002F2022\u002Fevaluating-microlearning-a-cross-faculty-case-study-of-a-sino-foreign-university",{"_path":9458,"_dir":8704,"_draft":7,"_partial":7,"_locale":8,"title":9459,"description":9460,"_hidden":7,"in Robot-Assisted Intravascular Interventions authors":9461,"authors_orcid":9468,"year":8714,"doi":9475,"openalex_id":9476,"venue":9477,"abstract_screenshot":21,"keywords":9478,"body":9486,"_type":51,"_id":9494,"_source":53,"_file":9495,"_stem":9496,"_extension":56,"locale":57},"\u002Fpublications\u002F2022\u002Fexploring-operators-natural-behaviors-to-predict-catheterization-trial-outcomes","Exploring Operators’ Natural Behaviors to Predict Catheterization Trial Outcomes","Recently, robotic catheterization has enhanced the outcomes of cardiovascular interventions. Meanwhile, the roles of operator’s natural behavior in the robot-assisted intravascular procedures need more attention. In this paper, operators’ hand activities related to endovascular tool manipulation are studied to explore how operators’ hand motions aid robotic catheterization. Controlled in-vivo studies were set up to acquire four types of operators’ natural behaviors during 60 robotic catheterization trials, and activity signals were recorded to proxy operators’ skills. A multi-layer recognition model is developed for recognizing the hand motions made during the procedures. The model operates convolution and dense layers to multiplex features extracted in single to multiple data modalities. Starting with initial-decision layer, the model is built to train and classify catheterization trials recorded from nine interventionists as successful and unsuccessful. Next, a motion-decision layer is built to recognize interventionists’ hand motions using features from different data modalities. Lastly, a mixed-decision layer is integrated to recognize the motion patterns of the successful and unsuccessful trials. Results show that the initial-decision layer has an accuracy of 99.44% in predicting the catheterization trials as successful and unsuccessful, while the motion-decision layer shows accuracies of 98.55% and 98.44% in classifying the seven types of hand motions that operators engage during successful and unsuccessful trials, respectively. Also, the mixed-decision layer has an accuracy of 93.96% in recognizing 14 mixed patterns from both trial classes. This study provides an objective template for skill training and evaluation in robot-assisted catheterization.",[9462,9463,9464,9465,9466,5667,8406,9467],"Du, Wenjing","Omisore, Olatunji Mumini","Duan, Wenke","Gan, Lu","Akinyemi, Toluwanimi Oluwadara","Wang, Lei",[9469,9470,9471,9472,9473,5670,8409,9474],"0000-0002-0571-3398","0000-0002-9740-5471","0000-0001-7509-7538","0000-0002-9641-873X","0000-0002-5598-8971","0000-0002-7033-9806","https:\u002F\u002Fdoi.org\u002F10.1109\u002Ftmrb.2022.3190211","W4285131102","IEEE Transactions on Medical Robotics and Bionics",[9479,9480,380,9481,9482,9483,23,9484,9485,9399,6413],"Psychological intervention","Cardiac catheterization","Intravascular ultrasound","Randomized controlled trial","Intensive care medicine","Radiology","Cardiology",{"type":39,"children":9487,"toc":9492},[9488],{"type":42,"tag":43,"props":9489,"children":9490},{},[9491],{"type":47,"value":9460},{"title":8,"searchDepth":49,"depth":49,"links":9493},[],"content:publications:2022:exploring-operators-natural-behaviors-to-predict-catheterization-trial-outcomes.md","publications\u002F2022\u002Fexploring-operators-natural-behaviors-to-predict-catheterization-trial-outcomes.md","publications\u002F2022\u002Fexploring-operators-natural-behaviors-to-predict-catheterization-trial-outcomes",{"_path":9498,"_dir":8704,"_draft":7,"_partial":7,"_locale":8,"title":9499,"description":9500,"_hidden":7,"Paths in FPGA\" authors":9501,"authors_orcid":9505,"year":8714,"doi":9510,"openalex_id":9511,"venue":9512,"abstract_screenshot":21,"keywords":9513,"body":9521,"_type":51,"_id":9678,"_source":53,"_file":9679,"_stem":9680,"_extension":56,"locale":57},"\u002Fpublications\u002F2022\u002Ffodm-a-framework-for-accurate-online-delay-measurement-supporting-all-timing-pat","FODM: A Framework for Accurate Online Delay Measurement Supporting All Timin","Voltage and frequency scaling (VFS) has been widely used to improve energy efficiency, lifespan, and system reliability by converting conservative timing margins into  VddV_{\\text {dd}}Vdd​  reduction. Along these lines, to investigate the potential implementation of VFS technique in exploring the timing margins under different voltages and frequencies, in situ or online circuit delay measurement is required to monitor all timing paths, which are usually ended with terminal registers. The previously reported online delay measurement approaches require the output of a terminal register to be measurable. However, some FPGA timing paths are ended with embedded hardcores such as DSPs or BRAMs. It is impossible to measure the output of the terminal register inside a hardcore. To address the issue, we propose an online delay monitor (ODM) that can accurately measure the delay of any type of timing path in real-time conditions. The ODM is mainly composed of two shadow registers and a phase-shifted clock. The shadow registers use a phase-shifted clock signal as the input and the output signal of the combinational logic as the clock. In addition, we present an automatic tool and its corresponding design flow (FODM) for inserting an ODM to monitor a path. Compared with the state-of-the-art, our experimental results indicate that the proposed method has the ability to accurately measure the delays online for all the potential timing paths, regardless of their path termination types. Moreover, we demonstrate an average measurement error of only 1.51% using eight floating-point operators at different voltages.",[5531,5532,9502,9503,6184,9504,5534],"Zhang, Hongtu","Shu, Yuhao","Chen, Jian",[5536,5537,9506,9507,9508,9509,5539],"0000-0001-9879-1370","0000-0002-0357-4507","0000-0002-3838-5490","0000-0003-1030-7455","https:\u002F\u002Fdoi.org\u002F10.1109\u002Ftvlsi.2022.3144321","W4210301590","IEEE Transactions on Very Large Scale Integration (VLSI) Systems",[5543,23,6191,6193,9514,9515,9516,9517,9518,332,5550,3203,4242,9519,9520,288],"Path (computing)","Clock synchronization","Standard cell","Clock rate","Shadow (psychology)","Chip","Integrated circuit",{"type":39,"children":9522,"toc":9676},[9523],{"type":42,"tag":43,"props":9524,"children":9525},{},[9526,9528,9668,9670],{"type":47,"value":9527},"Voltage and frequency scaling (VFS) has been widely used to improve energy efficiency, lifespan, and system reliability by converting conservative timing margins into ",{"type":42,"tag":8789,"props":9529,"children":9530},{"xmlns:mml":1465,"xmlnsXLink":8791},[9531,9532],{"type":47,"value":8794},{"type":42,"tag":8796,"props":9533,"children":9534},{"notation":8798},[9535,9667],{"type":42,"tag":809,"props":9536,"children":9538},{"className":9537},[1455],[9539,9572],{"type":42,"tag":809,"props":9540,"children":9542},{"className":9541},[1460],[9543],{"type":42,"tag":1463,"props":9544,"children":9545},{"xmlns":1465},[9546],{"type":42,"tag":1468,"props":9547,"children":9548},{},[9549,9567],{"type":42,"tag":1472,"props":9550,"children":9551},{},[9552],{"type":42,"tag":9553,"props":9554,"children":9555},"msub",{},[9556,9561],{"type":42,"tag":1494,"props":9557,"children":9558},{},[9559],{"type":47,"value":9560},"V",{"type":42,"tag":9562,"props":9563,"children":9564},"mtext",{},[9565],{"type":47,"value":9566},"dd",{"type":42,"tag":2265,"props":9568,"children":9569},{"encoding":2267},[9570],{"type":47,"value":9571},"V_{\\text {dd}}",{"type":42,"tag":809,"props":9573,"children":9575},{"className":9574,"ariaHidden":1484},[2274],[9576],{"type":42,"tag":809,"props":9577,"children":9579},{"className":9578},[2279],[9580,9585],{"type":42,"tag":809,"props":9581,"children":9584},{"className":9582,"style":9583},[2284],"height:0.8333em;vertical-align:-0.15em;",[],{"type":42,"tag":809,"props":9586,"children":9588},{"className":9587},[2290],[9589,9595],{"type":42,"tag":809,"props":9590,"children":9593},{"className":9591,"style":9592},[2290,2313],"margin-right:0.2222em;",[9594],{"type":47,"value":9560},{"type":42,"tag":809,"props":9596,"children":9599},{"className":9597},[9598],"msupsub",[9600],{"type":42,"tag":809,"props":9601,"children":9605},{"className":9602},[9603,9604],"vlist-t","vlist-t2",[9606,9655],{"type":42,"tag":809,"props":9607,"children":9610},{"className":9608},[9609],"vlist-r",[9611,9648],{"type":42,"tag":809,"props":9612,"children":9616},{"className":9613,"style":9615},[9614],"vlist","height:0.3361em;",[9617],{"type":42,"tag":809,"props":9618,"children":9620},{"style":9619},"top:-2.55em;margin-left:-0.2222em;margin-right:0.05em;",[9621,9627],{"type":42,"tag":809,"props":9622,"children":9626},{"className":9623,"style":9625},[9624],"pstrut","height:2.7em;",[],{"type":42,"tag":809,"props":9628,"children":9634},{"className":9629},[9630,9631,9632,9633],"sizing","reset-size6","size3","mtight",[9635],{"type":42,"tag":809,"props":9636,"children":9638},{"className":9637},[2290,9633],[9639],{"type":42,"tag":809,"props":9640,"children":9642},{"className":9641},[2290,47,9633],[9643],{"type":42,"tag":809,"props":9644,"children":9646},{"className":9645},[2290,9633],[9647],{"type":47,"value":9566},{"type":42,"tag":809,"props":9649,"children":9652},{"className":9650},[9651],"vlist-s",[9653],{"type":47,"value":9654},"​",{"type":42,"tag":809,"props":9656,"children":9658},{"className":9657},[9609],[9659],{"type":42,"tag":809,"props":9660,"children":9663},{"className":9661,"style":9662},[9614],"height:0.15em;",[9664],{"type":42,"tag":809,"props":9665,"children":9666},{},[],{"type":47,"value":8794},{"type":47,"value":9669}," reduction. Along these lines, to investigate the potential implementation of VFS technique in exploring the timing margins under different voltages and frequencies, ",{"type":42,"tag":9671,"props":9672,"children":9673},"italic",{"xmlns:mml":1465,"xmlnsXLink":8791},[9674],{"type":47,"value":9675},"in situ or online circuit delay measurement is required to monitor all timing paths, which are usually ended with terminal registers. The previously reported online delay measurement approaches require the output of a terminal register to be measurable. However, some FPGA timing paths are ended with embedded hardcores such as DSPs or BRAMs. It is impossible to measure the output of the terminal register inside a hardcore. To address the issue, we propose an online delay monitor (ODM) that can accurately measure the delay of any type of timing path in real-time conditions. The ODM is mainly composed of two shadow registers and a phase-shifted clock. The shadow registers use a phase-shifted clock signal as the input and the output signal of the combinational logic as the clock. In addition, we present an automatic tool and its corresponding design flow (FODM) for inserting an ODM to monitor a path. Compared with the state-of-the-art, our experimental results indicate that the proposed method has the ability to accurately measure the delays online for all the potential timing paths, regardless of their path termination types. Moreover, we demonstrate an average measurement error of only 1.51% using eight floating-point operators at different voltages.",{"title":8,"searchDepth":49,"depth":49,"links":9677},[],"content:publications:2022:fodm-a-framework-for-accurate-online-delay-measurement-supporting-all-timing-pat.md","publications\u002F2022\u002Ffodm-a-framework-for-accurate-online-delay-measurement-supporting-all-timing-pat.md","publications\u002F2022\u002Ffodm-a-framework-for-accurate-online-delay-measurement-supporting-all-timing-pat",{"_path":9682,"_dir":8704,"_draft":7,"_partial":7,"_locale":8,"title":9683,"description":8,"_hidden":7,"Localization Systems\" authors":9684,"authors_orcid":9685,"year":8714,"doi":9686,"openalex_id":9687,"venue":74,"abstract_screenshot":21,"keywords":9688,"body":9694,"_type":51,"_id":9698,"_source":53,"_file":9699,"_stem":9700,"_extension":56,"locale":57},"\u002Fpublications\u002F2022\u002Fgaitpdr-using-gait-analysis-for-heading-estimation-in-pdr-based-indoor-localizat","Gaitpdr: Using Gait Analysis for Heading Estimation in Pdr Based Indoo",[7746,5407,8463,8464,5665,5667],[21,5411,8466,21,5669,5670],"https:\u002F\u002Fdoi.org\u002F10.2139\u002Fssrn.4139397","W4285183130",[9689,9690,9691,23,9692,289,37,9693,5282,179,380],"Heading (navigation)","Gait","Gait analysis","Estimation","Physical medicine and rehabilitation",{"type":39,"children":9695,"toc":9696},[],{"title":8,"searchDepth":49,"depth":49,"links":9697},[],"content:publications:2022:gaitpdr-using-gait-analysis-for-heading-estimation-in-pdr-based-indoor-localizat.md","publications\u002F2022\u002Fgaitpdr-using-gait-analysis-for-heading-estimation-in-pdr-based-indoor-localizat.md","publications\u002F2022\u002Fgaitpdr-using-gait-analysis-for-heading-estimation-in-pdr-based-indoor-localizat",{"_path":9702,"_dir":8704,"_draft":7,"_partial":7,"_locale":8,"title":9703,"description":8,"_hidden":7,"authors":9704,"authors_orcid":9706,"year":8714,"doi":9708,"openalex_id":9709,"venue":687,"abstract_screenshot":21,"keywords":9710,"body":9711,"_type":51,"_id":9715,"_source":53,"_file":9716,"_stem":9717,"_extension":56,"locale":57},"\u002Fpublications\u002F2022\u002Fgengpt-a-systematic-way-to-generate-synthetic-goal-plan-trees","GenGPT: A Systematic Way to Generate Synthetic Goal-Plan Trees",[9416,9705],"Wu, Di",[9422,9707],"0000-0002-4541-3218","https:\u002F\u002Fdoi.org\u002F10.1007\u002F978-3-030-97457-2_21","W4225822684",[23,8302,6319,659,37,691,607,180],{"type":39,"children":9712,"toc":9713},[],{"title":8,"searchDepth":49,"depth":49,"links":9714},[],"content:publications:2022:gengpt-a-systematic-way-to-generate-synthetic-goal-plan-trees.md","publications\u002F2022\u002Fgengpt-a-systematic-way-to-generate-synthetic-goal-plan-trees.md","publications\u002F2022\u002Fgengpt-a-systematic-way-to-generate-synthetic-goal-plan-trees",{"_path":9719,"_dir":8704,"_draft":7,"_partial":7,"_locale":8,"title":9720,"description":9721,"_hidden":7,"authors":9722,"authors_orcid":9724,"year":8714,"doi":9728,"openalex_id":9729,"venue":9730,"abstract_screenshot":21,"keywords":9731,"body":9736,"_type":51,"_id":9744,"_source":53,"_file":9745,"_stem":9746,"_extension":56,"locale":57},"\u002Fpublications\u002F2022\u002Fidentify-patterns-in-online-bin-packing-problem-an-adaptive-pattern-based-algori","Identify Patterns in Online Bin Packing Problem: An Adaptive Pattern-Based Algorithm","Bin packing is a typical optimization problem with many real-world application scenarios. In the online bin packing problem, a sequence of items is revealed one at a time, and each item must be packed into a bin immediately after its arrival. Inspired by duality in optimization, we proposed pattern-based adaptive heuristics for the online bin packing problem. The idea is to predict the distribution of items based on packed items, and to apply this information in packing future arrival items in order to handle uncertainty in online bin packing. A pattern in bin packing is a combination of items that can be packed into a single bin. Patterns selected according to past items are adopted and periodically updated in scheduling future items in the algorithm. Symmetry in patterns and the stability of patterns in the online bin packing problem are discussed. We have implemented the algorithm and compared it with the Best-Fit in a series of experiments with various distribution of items to show its effectiveness.",[9723,157,12,319,709,7302],"Lin, Bingchen",[9725,9726,15,322,711,9727],"0000-0002-7046-7189","0000-0003-4127-4190","0000-0002-1737-0214","https:\u002F\u002Fdoi.org\u002F10.3390\u002Fsym14071301","W4283393550","Symmetry",[9732,9733,506,23,9734,332,31,34,37,9735],"Bin packing problem","Bin","Best bin first","k-nearest neighbors algorithm",{"type":39,"children":9737,"toc":9742},[9738],{"type":42,"tag":43,"props":9739,"children":9740},{},[9741],{"type":47,"value":9721},{"title":8,"searchDepth":49,"depth":49,"links":9743},[],"content:publications:2022:identify-patterns-in-online-bin-packing-problem-an-adaptive-pattern-based-algori.md","publications\u002F2022\u002Fidentify-patterns-in-online-bin-packing-problem-an-adaptive-pattern-based-algori.md","publications\u002F2022\u002Fidentify-patterns-in-online-bin-packing-problem-an-adaptive-pattern-based-algori",{"_path":9748,"_dir":8704,"_draft":7,"_partial":7,"_locale":8,"title":9749,"description":9750,"_hidden":7,"authors":9751,"authors_orcid":9755,"year":8714,"doi":9759,"openalex_id":9760,"venue":9125,"abstract_screenshot":21,"keywords":9761,"body":9763,"_type":51,"_id":9771,"_source":53,"_file":9772,"_stem":9773,"_extension":56,"locale":57},"\u002Fpublications\u002F2022\u002Fieee-compsac-2022-co-located-workshops-summary","IEEE COMPSAC 2022 Co-Located Workshops Summary","IEEE COMPSAC Workshops series is an established research event that complements the main focus of the IEEE COMPSAC conference, by focusing on specific topics that gain momentum in the research community. This paper introduces the overview of the IEEE COMPSAC 2022 co-located workshops, and discusses some open research issues that have emerged from the different workshops' topics and selected contributions.",[9752,9753,595,9754],"Cuzzocrea, Alfredo","Kashiwazaki, Hiroki","Yang, Ji‐Jiang",[9756,9757,599,9758],"0000-0002-7104-6415","0000-0002-1675-9260","0000-0002-4124-6408","https:\u002F\u002Fdoi.org\u002F10.1109\u002Fcompsac54236.2022.00008","W4298848849",[4921,9762,23,3745,179,3597],"Focus (optics)",{"type":39,"children":9764,"toc":9769},[9765],{"type":42,"tag":43,"props":9766,"children":9767},{},[9768],{"type":47,"value":9750},{"title":8,"searchDepth":49,"depth":49,"links":9770},[],"content:publications:2022:ieee-compsac-2022-co-located-workshops-summary.md","publications\u002F2022\u002Fieee-compsac-2022-co-located-workshops-summary.md","publications\u002F2022\u002Fieee-compsac-2022-co-located-workshops-summary",{"_path":9775,"_dir":8704,"_draft":7,"_partial":7,"_locale":8,"title":9776,"description":9777,"_hidden":7,"authors":9778,"authors_orcid":9780,"year":8714,"doi":9781,"openalex_id":9782,"venue":21,"abstract_screenshot":21,"keywords":9783,"body":9785,"_type":51,"_id":9793,"_source":53,"_file":9794,"_stem":9795,"_extension":56,"locale":57},"\u002Fpublications\u002F2022\u002Fin-place-metamorphic-testing-and-exploration","In-place metamorphic testing and exploration","In this paper, we consider the testing of software whose input involves a data stream, such as in video analysis applications. To address the oracle problem in testing this kind of software, existing metamorphic testing (MT) and metamorphic exploration (ME) techniques typically generate both source and follow-up input streams. In contrast, we propose a different strategy: an in-place method. Instead of examining relations among multiple input streams, our method works on a finer granularity by investigating relations among the data frames within a single input stream --- such as the relations among the image frames within a video stream --- treating a frame, rather than a stream, as a test case. Because our method does not generate any follow-up input stream, or change any frame values, it is also suitable for runtime error detection. We have applied this in-place method to testing video streams in Baidu Apollo, a real-life autonomous driving system. Our study identified previously-unknown obstacle perception failures in the camera perception module, including both undetected and incorrectly-detected objects. The empirical results show that our approach is practical, and readily applicable to industrial-scale systems that include (but are not limited to) the computer vision domain.",[1156,9779,596,595],"Zhu, Junting",[1158,21,600,599],"https:\u002F\u002Fdoi.org\u002F10.1145\u002F3524846.3527334","W4318325591",[23,7753,605,4391,37,5895,139,9784,181,3203,110],"Perception",{"type":39,"children":9786,"toc":9791},[9787],{"type":42,"tag":43,"props":9788,"children":9789},{},[9790],{"type":47,"value":9777},{"title":8,"searchDepth":49,"depth":49,"links":9792},[],"content:publications:2022:in-place-metamorphic-testing-and-exploration.md","publications\u002F2022\u002Fin-place-metamorphic-testing-and-exploration.md","publications\u002F2022\u002Fin-place-metamorphic-testing-and-exploration",{"_path":9797,"_dir":8704,"_draft":7,"_partial":7,"_locale":8,"title":9798,"description":9799,"_hidden":7,"authors":9800,"authors_orcid":9803,"year":8714,"doi":9807,"openalex_id":9808,"venue":9809,"abstract_screenshot":21,"keywords":9810,"body":9814,"_type":51,"_id":9822,"_source":53,"_file":9823,"_stem":9824,"_extension":56,"locale":57},"\u002Fpublications\u002F2022\u002Fintelligent-evacuation-route-planning-algorithm-based-on-maximum-flow","Intelligent Evacuation Route Planning Algorithm Based on Maximum Flow","This paper focuses on the problem of intelligent evacuation route planning for emergencies, including natural and human resource disasters and epidemic disasters, such as the COVID-19 pandemic. The goal of this study was to quickly generate an evacuation route for a community for victims to be evacuated to safe areas as soon as possible. The evacuation route planning problem needs to determine appropriate routes and allocate a specific number of victims to each route. This paper formulates the problem as a maximum flow problem and proposes a binary search algorithm based on a maximum flow algorithm, which is an intelligent optimization evacuation route planning algorithm for the community. Furthermore, the formulation is a nonlinear optimization problem because each route's suggested evacuation time is a convex nonlinear function of the number of victims assigned to that route. Finally, numerical examples and Matlab simulations demonstrate not only the algorithm's effectiveness, but also that the algorithm has low complexity and high precision. The study's findings offer a practical solution for nonlinear models of evacuation route planning, which will be widely used in human society and robot path planning schemes.",[6555,7302,9801,9802],"Liu, Yangguang","Zhang, Xiaomin",[9804,7310,9805,9806],"0000-0001-7274-3004","0000-0001-9468-9651","0000-0003-4088-3744","https:\u002F\u002Fdoi.org\u002F10.3390\u002Fijerph19137865","W4283662769","International Journal of Environmental Research and Public Health",[9811,23,9812,9813,332,454,31,179,34],"Route planning","Flow (mathematics)","Maximum flow problem",{"type":39,"children":9815,"toc":9820},[9816],{"type":42,"tag":43,"props":9817,"children":9818},{},[9819],{"type":47,"value":9799},{"title":8,"searchDepth":49,"depth":49,"links":9821},[],"content:publications:2022:intelligent-evacuation-route-planning-algorithm-based-on-maximum-flow.md","publications\u002F2022\u002Fintelligent-evacuation-route-planning-algorithm-based-on-maximum-flow.md","publications\u002F2022\u002Fintelligent-evacuation-route-planning-algorithm-based-on-maximum-flow",{"_path":9826,"_dir":8704,"_draft":7,"_partial":7,"_locale":8,"title":9827,"description":9828,"_hidden":7,"authors":9829,"authors_orcid":9833,"year":8714,"doi":9837,"openalex_id":9838,"venue":7253,"abstract_screenshot":21,"keywords":9839,"body":9844,"_type":51,"_id":9852,"_source":53,"_file":9853,"_stem":9854,"_extension":56,"locale":57},"\u002Fpublications\u002F2022\u002Fioam-a-novel-sensor-fusion-based-wearable-for-localization-and-mapping","IOAM: A Novel Sensor Fusion-Based Wearable for Localization and Mapping","With the development of indoor location-based services (ILBS), the dual foot-mounted inertial navigation system (DF-INS) has been extensively used in many fields involving monitoring and direction-finding. It is a widespread ILBS implementation with considerable application potential in various areas such as firefighting and home care. However, the existing DF-INS is limited by a high inaccuracy rate due to the highly dynamic and non-stable stride length thresholds. The system also provides less clear and significant information visualization of a person’s position and the surrounding map. This study proposes a novel wearable-foot IOAM-inertial odometry and mapping to address the aforementioned issues. First, the person’s gait analysis is computed using the zero-velocity update (ZUPT) method with data fusion from ultrasound sensors placed on the inner side of the shoes. This study introduces a dynamic minimum centroid distance (MCD) algorithm to improve the existing extended Kalman filter (EKF) by limiting the stride length to a minimum range, significantly reducing the bias in data fusion. Then, a dual trajectory fusion (DTF) method is proposed to combine the left- and right-foot trajectories into a single center body of mass (CBoM) trajectory using ZUPT clustering and fusion weight computation. Next, ultrasound-type mapping is introduced to reconstruct the surrounding occupancy grid map (S-OGM) using the sphere projection method. The CBoM trajectory and S-OGM results were simultaneously visualized to provide comprehensive localization and mapping information. The results indicate a significant improvement with a lower root mean square error (RMSE = 1.2 m) than the existing methods.",[7746,5667,5407,9830,8463,9831,9832],"Zhu, Linzhen","Huang, Liang","Wu, Xian",[8467,5670,5411,9834,8466,9835,9836],"0009-0004-5036-3907","0000-0003-3331-8798","0000-0001-5615-6838","https:\u002F\u002Fdoi.org\u002F10.3390\u002Frs14236081","W4311050067",[23,6977,9840,3659,6978,4391,7258,6973,9841,9842,37,7260,9843,7599,7755,34],"Odometry","STRIDE","Mean squared error","Centroid",{"type":39,"children":9845,"toc":9850},[9846],{"type":42,"tag":43,"props":9847,"children":9848},{},[9849],{"type":47,"value":9828},{"title":8,"searchDepth":49,"depth":49,"links":9851},[],"content:publications:2022:ioam-a-novel-sensor-fusion-based-wearable-for-localization-and-mapping.md","publications\u002F2022\u002Fioam-a-novel-sensor-fusion-based-wearable-for-localization-and-mapping.md","publications\u002F2022\u002Fioam-a-novel-sensor-fusion-based-wearable-for-localization-and-mapping",{"_path":9856,"_dir":8704,"_draft":7,"_partial":7,"_locale":8,"title":9857,"description":8,"_hidden":7,"authors":9858,"authors_orcid":9859,"year":8714,"doi":9860,"openalex_id":9861,"venue":1055,"abstract_screenshot":21,"keywords":9862,"body":9866,"_type":51,"_id":9870,"_source":53,"_file":9871,"_stem":9872,"_extension":56,"locale":57},"\u002Fpublications\u002F2022\u002Flagrange-dual-bound-computation-for-stochastic-service-network-design","Lagrange dual bound computation for stochastic service network design",[3324,12,6111,157,13],[3326,15,6113,162,16],"https:\u002F\u002Fdoi.org\u002F10.1016\u002Fj.ejor.2022.01.044","W4210708571",[31,9863,954,6729,1191,9864,9865,329,23,209,6730,34],"Lagrange multiplier","Dual (grammatical number)","Lagrangian relaxation",{"type":39,"children":9867,"toc":9868},[],{"title":8,"searchDepth":49,"depth":49,"links":9869},[],"content:publications:2022:lagrange-dual-bound-computation-for-stochastic-service-network-design.md","publications\u002F2022\u002Flagrange-dual-bound-computation-for-stochastic-service-network-design.md","publications\u002F2022\u002Flagrange-dual-bound-computation-for-stochastic-service-network-design",{"_path":9874,"_dir":8704,"_draft":7,"_partial":7,"_locale":8,"title":9875,"description":8,"_hidden":7,"platforms":9876,"authors":9877,"authors_orcid":9878,"year":8714,"doi":9879,"openalex_id":9880,"venue":9881,"abstract_screenshot":21,"keywords":9882,"body":9883,"_type":51,"_id":9887,"_source":53,"_file":9888,"_stem":9889,"_extension":56,"locale":57},"\u002Fpublications\u002F2022\u002Fmetamorphic-testing-of-advanced-driver-assistance-system-adas-simulation-platfor","Metamorphic testing of Advanced Driver-Assistance System (ADAS) simulatio","Lane Keeping Assist System (LKAS) case studies\"",[7696,7697,1156,595,596],[7699,21,1158,599,600],"https:\u002F\u002Fdoi.org\u002F10.1016\u002Fj.infsof.2022.107104","W4309344467","Information and Software Technology",[4239,605,23,3227,918,139,4242,4241,984,179,37,607,332],{"type":39,"children":9884,"toc":9885},[],{"title":8,"searchDepth":49,"depth":49,"links":9886},[],"content:publications:2022:metamorphic-testing-of-advanced-driver-assistance-system-adas-simulation-platfor.md","publications\u002F2022\u002Fmetamorphic-testing-of-advanced-driver-assistance-system-adas-simulation-platfor.md","publications\u002F2022\u002Fmetamorphic-testing-of-advanced-driver-assistance-system-adas-simulation-platfor",{"_path":9891,"_dir":8704,"_draft":7,"_partial":7,"_locale":8,"title":9892,"description":8,"_hidden":7,"China’s Indigenous Science Growth\" authors":9893,"authors_orcid":9896,"year":8714,"doi":9898,"openalex_id":9899,"venue":74,"abstract_screenshot":21,"keywords":9900,"body":9901,"_type":51,"_id":9905,"_source":53,"_file":9906,"_stem":9907,"_extension":56,"locale":57},"\u002Fpublications\u002F2022\u002Fmodernizing-the-chinese-way-effect-of-big-science-research-infrastructure-on-chi","Modernizing the Chinese Way: Effect of Big-Science Research Infrastructure o",[9894,9895,65],"Yang, Xiyi","Zhou, Xiaoyu",[21,9897,70],"0000-0002-0681-7068","https:\u002F\u002Fdoi.org\u002F10.2139\u002Fssrn.4057905","W4226057130",[282,8301,1358,4608,3259,3526],{"type":39,"children":9902,"toc":9903},[],{"title":8,"searchDepth":49,"depth":49,"links":9904},[],"content:publications:2022:modernizing-the-chinese-way-effect-of-big-science-research-infrastructure-on-chi.md","publications\u002F2022\u002Fmodernizing-the-chinese-way-effect-of-big-science-research-infrastructure-on-chi.md","publications\u002F2022\u002Fmodernizing-the-chinese-way-effect-of-big-science-research-infrastructure-on-chi",{"_path":9909,"_dir":8704,"_draft":7,"_partial":7,"_locale":8,"title":9910,"description":9911,"_hidden":7,"Recognition Technologies authors":9912,"authors_orcid":9917,"year":8714,"doi":9923,"openalex_id":9924,"venue":9925,"abstract_screenshot":21,"keywords":9926,"body":9932,"_type":51,"_id":9940,"_source":53,"_file":9941,"_stem":9942,"_extension":56,"locale":57},"\u002Fpublications\u002F2022\u002Fmonitoring-and-analysis-solid-formulation-dissolution-phenomenon-with-image-reco","Monitoring and Analysis Solid Formulation Dissolution Phenomenon with Image","The dissolution test has become the most important quality index in the research and development of solid formulation, especially the evaluation of drug bioequivalence. However, it had low operability, was tedious, and was always overlooked. The previously related studies required a fixed tablet and analysed the recorded video by disso GUARO PRO and Microsoft Paint™. Therefore, we have developed a novel image recognition system to automatically track the moving tablet and analyse the volume change at the same time. Image recognition technology is often used to monitor the dissolution process. The camera system with visible light and infrared camera functions was placed on the dissolution tester. The system collects the plate image for binary processing and then records and calculates its pixel area, which can automatically record the volume change of the tablet in the dissolution test, no matter disintegration or corrosion.",[9913,4824,9914,9915,9916,5667,9831],"Wang, Haoyu","Liu, Qianyu","Liu, Junyao","Liu, Zhixin",[9918,9919,9920,9921,9922,5670,9835],"0009-0006-2213-9443","0000-0002-8164-5323","0000-0002-2660-7287","0009-0005-5290-3273","0000-0003-3768-8788","https:\u002F\u002Fdoi.org\u002F10.1155\u002F2022\u002F3997870","W4296230893","Computational Intelligence and Neuroscience",[9927,23,9928,4391,9929,37,7595,9930,9931,9091,135,4004,179],"Operability","Dissolution testing","Dissolution","Image processing","Bioequivalence",{"type":39,"children":9933,"toc":9938},[9934],{"type":42,"tag":43,"props":9935,"children":9936},{},[9937],{"type":47,"value":9911},{"title":8,"searchDepth":49,"depth":49,"links":9939},[],"content:publications:2022:monitoring-and-analysis-solid-formulation-dissolution-phenomenon-with-image-reco.md","publications\u002F2022\u002Fmonitoring-and-analysis-solid-formulation-dissolution-phenomenon-with-image-reco.md","publications\u002F2022\u002Fmonitoring-and-analysis-solid-formulation-dissolution-phenomenon-with-image-reco",{"_path":9944,"_dir":8704,"_draft":7,"_partial":7,"_locale":8,"title":9945,"description":9946,"_hidden":7,"Detection\" authors":9947,"authors_orcid":9949,"year":8714,"doi":9951,"openalex_id":9952,"venue":9025,"abstract_screenshot":21,"keywords":9953,"body":9960,"_type":51,"_id":9968,"_source":53,"_file":9969,"_stem":9970,"_extension":56,"locale":57},"\u002Fpublications\u002F2022\u002Fmorphtext-deep-morphology-regularized-accurate-arbitrary-shape-scene-text-detect","MorphText: Deep Morphology Regularized Accurate Arbitrary-Shape Scene Tex","Bottom-up text detection methods play an important role in arbitrary-shape scene text detection but there are two restrictions preventing them from achieving their great potential, i.e., 1) the accumulation of false text segment detections, which affects subsequent processing, and 2) the difficulty of building reliable connections between text segments. Targeting these two problems, we propose a novel approach, named ``MorphText\", to capture the regularity of texts by embedding deep morphology for arbitrary-shape text detection. Towards this end, two deep morphological modules are designed to regularize text segments and determine the linkage between them. First, a Deep Morphological Opening (DMOP) module is constructed to remove false text segment detections generated in the feature extraction process. Then, a Deep Morphological Closing (DMCL) module is proposed to allow text instances of various shapes to stretch their morphology along their most significant orientation while deriving their connections.Extensive experiments conducted on four challenging benchmark datasets (CTW1500, Total-Text, MSRA-TD500 and ICDAR2017) demonstrate that our proposed MorphText outperforms both top-down and bottom-up state-of-the-art arbitrary-shape scene text detection approaches.",[9013,9014,9016,9948,8931],"Luo, Xiaonan",[9019,9020,9021,9950,8937],"0000-0002-0751-5045","https:\u002F\u002Fdoi.org\u002F10.1109\u002Ftmm.2022.3172547","W4285263829",[23,37,9954,4876,209,6976,7391,135,9955,9956,9957,9958,9959,9930,4004,3393,34],"Text detection","Embedding","Closing (real estate)","Orientation (vector space)","Shape analysis (program analysis)","Mathematical morphology",{"type":39,"children":9961,"toc":9966},[9962],{"type":42,"tag":43,"props":9963,"children":9964},{},[9965],{"type":47,"value":9946},{"title":8,"searchDepth":49,"depth":49,"links":9967},[],"content:publications:2022:morphtext-deep-morphology-regularized-accurate-arbitrary-shape-scene-text-detect.md","publications\u002F2022\u002Fmorphtext-deep-morphology-regularized-accurate-arbitrary-shape-scene-text-detect.md","publications\u002F2022\u002Fmorphtext-deep-morphology-regularized-accurate-arbitrary-shape-scene-text-detect",{"_path":9972,"_dir":8704,"_draft":7,"_partial":7,"_locale":8,"title":9973,"description":9974,"_hidden":7,"authors":9975,"authors_orcid":9979,"year":8714,"doi":9983,"openalex_id":9984,"venue":9985,"Intelligence abstract_screenshot":9986,"keywords":9987,"body":9989,"_type":51,"_id":9997,"_source":53,"_file":9998,"_stem":9999,"_extension":56,"locale":57},"\u002Fpublications\u002F2022\u002Fmulti-agent-intention-progression-with-reward-machines","Multi-Agent Intention Progression with Reward Machines","Recent work in multi-agent intention scheduling has shown that enabling agents to predict the actions of other agents when choosing their own actions can be beneficial. However existing approaches to 'intention-aware' scheduling assume that the programs of other agents are known, or are \"similar\" to that of the agent making the prediction. While this assumption is reasonable in some circumstances, it is less plausible when the agents are not co-designed. In this paper, we present a new approach to multi-agent intention scheduling in which agents predict the actions of other agents based on a high-level specification of the tasks performed by an agent in the form of a reward machine (RM) rather than on its (assumed) program. We show how a reward machine can be used to generate tree and rollout policies for an MCTS-based scheduler. We evaluate our approach in a range of multi-agent environments, and show that RM-based scheduling out-performs previous intention-aware scheduling approaches in settings where agents are not co-designed",[9976,9416,5786,9977,9978],"Dann, Michael","Logan, Brian","Thangarajah, John",[9980,9422,5788,9981,9982],"0000-0002-7658-022X","0000-0003-0648-7107","0000-0002-7699-6444","https:\u002F\u002Fdoi.org\u002F10.24963\u002Fijcai.2022\u002F31","W4285602641","Proceedings of the Thirty-First International Joint Conference on Artificial","multi-agent-intention-progression-with-reward-machines.png",[23,450,249,9988,37,215,31],"Multi-agent system",{"type":39,"children":9990,"toc":9995},[9991],{"type":42,"tag":43,"props":9992,"children":9993},{},[9994],{"type":47,"value":9974},{"title":8,"searchDepth":49,"depth":49,"links":9996},[],"content:publications:2022:multi-agent-intention-progression-with-reward-machines.md","publications\u002F2022\u002Fmulti-agent-intention-progression-with-reward-machines.md","publications\u002F2022\u002Fmulti-agent-intention-progression-with-reward-machines",{"_path":10001,"_dir":8704,"_draft":7,"_partial":7,"_locale":8,"title":10002,"description":8,"_hidden":7,"Algorithm authors":10003,"authors_orcid":10008,"year":8714,"doi":10013,"openalex_id":10014,"venue":74,"abstract_screenshot":21,"keywords":10015,"body":10016,"_type":51,"_id":10020,"_source":53,"_file":10021,"_stem":10022,"_extension":56,"locale":57},"\u002Fpublications\u002F2022\u002Fnew-urban-land-use-layout-modelling-system-based-on-wave-function-collapse-algor","New Urban Land Use Layout Modelling System Based on Wave Function Collapse",[10004,10005,10006,10007,6042,4189],"Shen, Jie","Wang, Rui","Zheng, Fanghao","Deng, Wu",[10009,10010,10011,10012,6046,4191],"0000-0002-8442-7268","0000-0002-4672-5141","0000-0002-7073-7847","0000-0002-6524-6760","https:\u002F\u002Fdoi.org\u002F10.2139\u002Fssrn.4180765","W4289734200",[332,100,23,179,31,34],{"type":39,"children":10017,"toc":10018},[],{"title":8,"searchDepth":49,"depth":49,"links":10019},[],"content:publications:2022:new-urban-land-use-layout-modelling-system-based-on-wave-function-collapse-algor.md","publications\u002F2022\u002Fnew-urban-land-use-layout-modelling-system-based-on-wave-function-collapse-algor.md","publications\u002F2022\u002Fnew-urban-land-use-layout-modelling-system-based-on-wave-function-collapse-algor",{"_path":10024,"_dir":8704,"_draft":7,"_partial":7,"_locale":8,"title":10025,"description":10026,"_hidden":7,"authors":10027,"authors_orcid":10032,"year":8714,"doi":10037,"openalex_id":10038,"venue":10039,"abstract_screenshot":21,"keywords":10040,"body":10045,"_type":51,"_id":10053,"_source":53,"_file":10054,"_stem":10055,"_extension":56,"locale":57},"\u002Fpublications\u002F2022\u002Focclusion-invariant-representation-alignment-for-entity-re-identification","Occlusion-Invariant Representation Alignment for Entity Re-Identification","Entity re-identification is the foundation of tracking- and matching-based computer vision tasks, which are widely employed in a variety of applications. However, when trained exclusively on clear images, the models capacity to generalize is significantly affected by the presence of occlusion at referencing time, whereas data argumentation-based approaches are costly to construct without guaranteeing a test-time improvement. To tackle this problem, we propose a domain adaptation framework based on learning representations that generates occlusion-invariant feature representations by aligning the clean image embedding distribution with the occluded one, using a disparity discrepancy metric derived from the siamese network architecture. Without the need for additional processing modules during the inference stage or an expensive occlusion-augmentation-enlarged dataset during the training stage, we could obtain occlusion invariant embeddings that are free of the impact of occluders. Extensive experimental results for two tasks across three datasets indicate the proposed method’s robustness and effectiveness to a variety of occlusions at all levels.",[10028,10029,4626,7302,10030,10031],"Jiang, Zhanghao","Xu, Ke","Lü, Zheng","Zhang, Qian",[10033,10034,4637,7310,10035,10036],"0000-0002-1263-8998","0000-0001-5855-3810","0009-0002-8784-3168","0000-0001-9205-1881","https:\u002F\u002Fdoi.org\u002F10.1109\u002Ficip46576.2022.9897996","W4308234024","2022 IEEE International Conference on Image Processing (ICIP)",[23,10041,37,99,10042,10043,4391,4479,34,380,10044],"Invariant (physics)","Identification (biology)","Occlusion","Surgery",{"type":39,"children":10046,"toc":10051},[10047],{"type":42,"tag":43,"props":10048,"children":10049},{},[10050],{"type":47,"value":10026},{"title":8,"searchDepth":49,"depth":49,"links":10052},[],"content:publications:2022:occlusion-invariant-representation-alignment-for-entity-re-identification.md","publications\u002F2022\u002Focclusion-invariant-representation-alignment-for-entity-re-identification.md","publications\u002F2022\u002Focclusion-invariant-representation-alignment-for-entity-re-identification",{"_path":10057,"_dir":8704,"_draft":7,"_partial":7,"_locale":8,"title":10058,"description":10059,"_hidden":7,"Exploration of an Autonomous Driving System\" authors":10060,"authors_orcid":10061,"year":8714,"doi":10062,"openalex_id":10063,"venue":10064,"abstract_screenshot":21,"keywords":10065,"body":10066,"_type":51,"_id":10074,"_source":53,"_file":10075,"_stem":10076,"_extension":56,"locale":57},"\u002Fpublications\u002F2022\u002Fpreparing-future-sqa-professionals-an-experience-report-of-metamorphic-explorati","Preparing Future SQA Professionals: An Experience Report of Metamorphi","Computing systems are becoming increasingly complex and sophisticated. Technologies such as artificial intelligence, big data, and autonomous vehicles are pushing the boundaries of system size, complexity, and comprehensibility beyond anything seen before. These advances, however, have left the associated software quality assurance (SQA) tools and processes behind. This is compounded by many training and education programs also not attempting to address this inadequacy in the preparation of future software engineering professionals. We face a situation of extensively-deployed advanced computing systems, many of which lack sufficient SQA support. Metamorphic Testing (MT) and Metamorphic Exploration (ME) are SQA approaches that have a record of being able to alleviate some of the challenges associated with the advanced computer systems. This paper reports on an MT\u002FME experience with the Baidu Apollo autonomous driving system (ADS). The experience included identifying an apparent problem in Apollo, which was later confirmed to be a misunderstanding, but which illustrated the potential for ME to scaffold learning how to perform SQA on such complex systems. The report will be of benefit not only to other ADS developers and testers, but also to other SQA professionals, and especially to SQA trainers and educators.",[8041,5407,595,7697,1156],[8045,5411,599,21,1158],"https:\u002F\u002Fdoi.org\u002F10.1109\u002Feducon52537.2022.9766791","W4280617057","2022 IEEE Global Engineering Education Conference (EDUCON)",[23,139,1165,691,607,138],{"type":39,"children":10067,"toc":10072},[10068],{"type":42,"tag":43,"props":10069,"children":10070},{},[10071],{"type":47,"value":10059},{"title":8,"searchDepth":49,"depth":49,"links":10073},[],"content:publications:2022:preparing-future-sqa-professionals-an-experience-report-of-metamorphic-explorati.md","publications\u002F2022\u002Fpreparing-future-sqa-professionals-an-experience-report-of-metamorphic-explorati.md","publications\u002F2022\u002Fpreparing-future-sqa-professionals-an-experience-report-of-metamorphic-explorati",{"_path":10078,"_dir":8704,"_draft":7,"_partial":7,"_locale":8,"title":10079,"description":8,"_hidden":7,"authors":10080,"authors_orcid":10088,"year":8714,"doi":10094,"openalex_id":10095,"venue":21,"abstract_screenshot":21,"keywords":10096,"body":10097,"_type":51,"_id":10101,"_source":53,"_file":10102,"_stem":10103,"_extension":56,"locale":57},"\u002Fpublications\u002F2022\u002Fprogramme-committee","Programme Committee",[10081,10082,10083,10084,10085,10086,10087,595],"Daveiga, Adele","Singh, Alveen","Gomez, A Cueto","Gallina, Barbara","Kabaso, Boniface","Niekerk, Brett van","Simuja, Clement",[21,10089,21,10090,10091,10092,10093,599],"0000-0002-9826-7891","0000-0002-6952-1053","0000-0001-9208-9599","0000-0003-1050-4256","0000-0002-0105-0013","https:\u002F\u002Fdoi.org\u002F10.1109\u002Fictas53252.2022.9744654","W4226124583",[23],{"type":39,"children":10098,"toc":10099},[],{"title":8,"searchDepth":49,"depth":49,"links":10100},[],"content:publications:2022:programme-committee.md","publications\u002F2022\u002Fprogramme-committee.md","publications\u002F2022\u002Fprogramme-committee",{"_path":10105,"_dir":8704,"_draft":7,"_partial":7,"_locale":8,"title":10106,"description":8,"_hidden":7,"Blockchain\" authors":10107,"authors_orcid":10109,"year":8714,"doi":10111,"openalex_id":10112,"venue":10113,"abstract_screenshot":21,"keywords":10114,"body":10116,"_type":51,"_id":10120,"_source":53,"_file":10121,"_stem":10122,"_extension":56,"locale":57},"\u002Fpublications\u002F2022\u002Fproof-of-position-a-lightweight-consensus-mechanism-for-iot-oriented-blockchain","Proof of Position: A Lightweight Consensus Mechanism for IoT Oriente",[6288,10108,6289,268],"Zhang, Heng",[21,10110,21,272],"0000-0002-2836-2965","https:\u002F\u002Fdoi.org\u002F10.5013\u002Fijssst.a.23.02.06","W4280530513","International Journal of Simulation Systems Science & Technology",[5381,7627,23,6299,8136,10115,180,178,5949,691,6928],"Consensus algorithm",{"type":39,"children":10117,"toc":10118},[],{"title":8,"searchDepth":49,"depth":49,"links":10119},[],"content:publications:2022:proof-of-position-a-lightweight-consensus-mechanism-for-iot-oriented-blockchain.md","publications\u002F2022\u002Fproof-of-position-a-lightweight-consensus-mechanism-for-iot-oriented-blockchain.md","publications\u002F2022\u002Fproof-of-position-a-lightweight-consensus-mechanism-for-iot-oriented-blockchain",{"_path":10124,"_dir":8704,"_draft":7,"_partial":7,"_locale":8,"title":10125,"description":8,"_hidden":7,"governance of emerging technologies”\" authors":10126,"authors_orcid":10127,"year":8714,"doi":10128,"openalex_id":10129,"venue":10130,"abstract_screenshot":21,"keywords":10131,"body":10132,"_type":51,"_id":10136,"_source":53,"_file":10137,"_stem":10138,"_extension":56,"locale":57},"\u002Fpublications\u002F2022\u002Fprospects-and-challenges-introduction-to-the-special-issue-on-global-governance","Prospects and challenges: Introduction to the special issue on “Globa",[6909,65],[6914,70],"https:\u002F\u002Fdoi.org\u002F10.1007\u002Fs43508-022-00050-1","W4297474664","Global Public Policy and Governance",[3257,5446,1358,178,1334,23,179,429],{"type":39,"children":10133,"toc":10134},[],{"title":8,"searchDepth":49,"depth":49,"links":10135},[],"content:publications:2022:prospects-and-challenges-introduction-to-the-special-issue-on-global-governance.md","publications\u002F2022\u002Fprospects-and-challenges-introduction-to-the-special-issue-on-global-governance.md","publications\u002F2022\u002Fprospects-and-challenges-introduction-to-the-special-issue-on-global-governance",{"_path":10140,"_dir":8704,"_draft":7,"_partial":7,"_locale":8,"title":10141,"description":10142,"_hidden":7,"Energy Harvesting Edge Devices authors":10143,"authors_orcid":10144,"year":8714,"doi":10145,"openalex_id":10146,"venue":8774,"abstract_screenshot":21,"keywords":10147,"body":10148,"_type":51,"_id":10156,"_source":53,"_file":10157,"_stem":10158,"_extension":56,"locale":57},"\u002Fpublications\u002F2022\u002Fquality-optimization-of-adaptive-applications-via-deep-reinforcement-learning-in","Quality Optimization of Adaptive Applications via Deep Reinforcement Learning in","Applications with adaptability are widely available on the edge devices with energy harvesting capabilities. For their runtime quality optimization, however, current approaches cannot tackle the variations of quality modeling and harvested energy simultaneously. Therefore, in this article, we are the first to propose a deep reinforcement learning (DRL)-based dynamic voltage frequency scaling (DVFS) method that optimizes the application execution quality of energy harvesting edge devices to mitigate the variations. First, we propose a baseline DRL formulation that novelly migrates the objective of quality maximization into a reward function and constructs a DRL quality agent. Second, we devise a long short-term memory (LSTM)-based selector that performs DRL quality agent selection based on the energy harvesting history. Third, we further propose two optimization methods to alleviate the nonnegligible overhead of DRL computations: 1) an improved thinking-while-moving concurrent DRL scheme to compromise the “state drifting” issue during the DRL decision process and 2) a variable interstate duration decision scheme that compromises the DVFS overhead incurred in each action taken. The experiments take an adaptive stereo matching application as a case study. The results show that the proposed DRL-based DVFS method on average achieves 17.9% runtime reduction and 22.05% quality improvement compared to state-of-the-art solutions.",[6618,5532,5531,5534],[6622,5537,5536,5539],"https:\u002F\u002Fdoi.org\u002F10.1109\u002Ftcad.2022.3142188","W4205905517",[5304,23,6630,6465,6628,6629,6803,747,37,3203,920,31,179],{"type":39,"children":10149,"toc":10154},[10150],{"type":42,"tag":43,"props":10151,"children":10152},{},[10153],{"type":47,"value":10142},{"title":8,"searchDepth":49,"depth":49,"links":10155},[],"content:publications:2022:quality-optimization-of-adaptive-applications-via-deep-reinforcement-learning-in.md","publications\u002F2022\u002Fquality-optimization-of-adaptive-applications-via-deep-reinforcement-learning-in.md","publications\u002F2022\u002Fquality-optimization-of-adaptive-applications-via-deep-reinforcement-learning-in",{"_path":10160,"_dir":8704,"_draft":7,"_partial":7,"_locale":8,"title":10161,"description":10162,"_hidden":7,"authors":10163,"authors_orcid":10165,"year":8714,"doi":10167,"openalex_id":10168,"venue":34,"abstract_screenshot":21,"keywords":10169,"body":10172,"_type":51,"_id":10180,"_source":53,"_file":10181,"_stem":10182,"_extension":56,"locale":57},"\u002Fpublications\u002F2022\u002Freal-economy-effects-on-consumption-based-capm","Real Economy Effects on Consumption-Based CAPM","The consumption-based capital asset pricing model (CCAPM) is an attractive research field in finance, and extant studies have examined the impacts of different factors towards traditional CCAPM, intending to improve the model from the practical perspective. In this paper, we comprehensively scrutinize the real economy effects on the CCAPM by comprising expenditure on durable, expenditure on non-durable goods, services, and real estate four factors. Our study pays great attention to the real economy effect on the CCAPM based on two types of portfolios. By employing both time-series and cross-sectional analysis, our empirical results suggest that the real economy factors can help traditional CCAPM to produce better asset pricing results. Particularly, incorporating the real estate component into the CCAPM model can improve its explanation power on the stock market risk. Our results are potentially useful for investors, portfolios managers and policy makers towards the CCAPM.",[10164,5229,709,7302],"Zheng, Dandan",[10166,5231,711,7310],"0000-0003-2330-5221","https:\u002F\u002Fdoi.org\u002F10.3390\u002Fmath10030360","W4210802171",[10170,428,36,923,283,10171,833,555,287,1442,429,179,133],"Capital asset pricing model","Consumption-based capital asset pricing model",{"type":39,"children":10173,"toc":10178},[10174],{"type":42,"tag":43,"props":10175,"children":10176},{},[10177],{"type":47,"value":10162},{"title":8,"searchDepth":49,"depth":49,"links":10179},[],"content:publications:2022:real-economy-effects-on-consumption-based-capm.md","publications\u002F2022\u002Freal-economy-effects-on-consumption-based-capm.md","publications\u002F2022\u002Freal-economy-effects-on-consumption-based-capm",{"_path":10184,"_dir":8704,"_draft":7,"_partial":7,"_locale":8,"title":10185,"description":10186,"_hidden":7,"authors":10187,"authors_orcid":10192,"year":8714,"doi":10197,"openalex_id":10198,"venue":3384,"abstract_screenshot":21,"keywords":10199,"body":10204,"_type":51,"_id":10212,"_source":53,"_file":10213,"_stem":10214,"_extension":56,"locale":57},"\u002Fpublications\u002F2022\u002Fscatterhough-automatic-lane-detection-from-noisy-lidar-data","ScatterHough: Automatic Lane Detection from Noisy LiDAR Data","Lane detection plays an essential role in autonomous driving. Using LiDAR data instead of RGB images makes lane detection a simple straight line, and curve fitting problem works for realtime applications even under poor weather or lighting conditions. Handling scatter distributed noisy data is a crucial step to reduce lane detection error from LiDAR data. Classic Hough Transform (HT) only allows points in a straight line to vote on the corresponding parameters, which is not suitable for data in scatter form. In this paper, a Scatter Hough algorithm is proposed for better lane detection on scatter data. Two additional operations, ρ neighbor voting and ρ neighbor vote-reduction, are introduced to HT to make points in the same curve vote and consider their neighbors' voting result as well. The evaluation of the proposed method shows that this method can adaptively fit both straight lines and curves with high accuracy, compared with benchmark and state-of-the-art methods.",[10188,10189,709,5816,157,5667,10190,10191],"Zeng, Honghao","Shihong, Jiang","Zhu, Junsong","Yang, Xiaoying",[10193,21,711,5821,10194,5670,10195,10196],"0000-0002-4670-7066","0000-0002-6005-8373","0000-0003-0210-608X","0000-0002-4062-6724","https:\u002F\u002Fdoi.org\u002F10.3390\u002Fs22145424","W4286208817",[10200,23,209,10201,37,10202,4391,4876,4004,10203,34,289,5282],"Hough transform","Lidar","Line (geometry)","Remote sensing",{"type":39,"children":10205,"toc":10210},[10206],{"type":42,"tag":43,"props":10207,"children":10208},{},[10209],{"type":47,"value":10186},{"title":8,"searchDepth":49,"depth":49,"links":10211},[],"content:publications:2022:scatterhough-automatic-lane-detection-from-noisy-lidar-data.md","publications\u002F2022\u002Fscatterhough-automatic-lane-detection-from-noisy-lidar-data.md","publications\u002F2022\u002Fscatterhough-automatic-lane-detection-from-noisy-lidar-data",{"_path":10216,"_dir":8704,"_draft":7,"_partial":7,"_locale":8,"title":10217,"description":10218,"_hidden":7,"authors":10219,"authors_orcid":10221,"year":8714,"doi":10224,"openalex_id":10225,"venue":10226,"abstract_screenshot":21,"keywords":10227,"body":10229,"_type":51,"_id":10237,"_source":53,"_file":10238,"_stem":10239,"_extension":56,"locale":57},"\u002Fpublications\u002F2022\u002Fsemantic-navigation-of-powerpoint-based-lecture-video-for-autonote-generation","Semantic Navigation of PowerPoint-Based Lecture Video for AutoNote Generation","With the increasing popularity of open educational resources in the past few decades, more and more users watch online videos to gain knowledge. However, most educational videos only provide monotonous navigation tools and lack elaborating annotations. This makes the task of locating interesting contents time consuming. To address this limitation, in this article, we propose a slide-based video navigation tool that is able to extract the hierarchical structure and semantic relationship of visual entities in videos, by integrating multichannel information. Features of visual entities are first extracted from the presentation slides by a novel deep learning framework. Then, we propose a clustering approach to extract hierarchical relationships between visual entities (e.g., formulas, texts, or graphs appearing in educational slides). We use this information to associate visual entities with their corresponding audio speech text, by evaluating their semantic relationship. We present two cases where we use the structured data produced by this tool to generate a multilevel table of contents and notes to provide additional navigation materials for learning. The evaluation experiments demonstrate the effectiveness of our proposed solutions for visual entity extraction, hierarchical relationship extraction, as well as corresponding speech text matching. The user study also shows promising improvement in the autogenerated table of contents and notes for facilitating learning.",[9013,9014,9016,8931,10220,9017],"Zhao, Baoquan",[9019,9020,9021,8937,10222,10223],"0000-0002-0574-1663","0000-0001-7196-9589","https:\u002F\u002Fdoi.org\u002F10.1109\u002Ftlt.2022.3216535","W4312514481","IEEE Transactions on Learning Technologies",[23,10228,3441,529,6950,6876,37,8326,4479,867,181],"Table (database)",{"type":39,"children":10230,"toc":10235},[10231],{"type":42,"tag":43,"props":10232,"children":10233},{},[10234],{"type":47,"value":10218},{"title":8,"searchDepth":49,"depth":49,"links":10236},[],"content:publications:2022:semantic-navigation-of-powerpoint-based-lecture-video-for-autonote-generation.md","publications\u002F2022\u002Fsemantic-navigation-of-powerpoint-based-lecture-video-for-autonote-generation.md","publications\u002F2022\u002Fsemantic-navigation-of-powerpoint-based-lecture-video-for-autonote-generation",{"_path":10241,"_dir":8704,"_draft":7,"_partial":7,"_locale":8,"title":10242,"description":10243,"_hidden":7,"authors":10244,"authors_orcid":10245,"year":8714,"doi":10246,"openalex_id":10247,"venue":10248,"abstract_screenshot":21,"keywords":10249,"body":10253,"_type":51,"_id":10261,"_source":53,"_file":10262,"_stem":10263,"_extension":56,"locale":57},"\u002Fpublications\u002F2022\u002Fslam-ing-a-wearable-slam-inertial-navigation-system","SLAM-ING: A Wearable SLAM Inertial NaviGation System","Indoor Location-Based Service (ILBS) shows great research promotions with wide applications e.g., indoor firefighting and cave exploration. Foot-mounted Inertial Navigation System (INS), one approach of ILBS, lacks a reference map of the environment, resulting in poor trajectory recognition. This paper introduces SLAMING, a novel wearable type SLAM via a Zero Angular rate Update (ZARU) aided Inertial NaviGation. SLAMING proposes a gravity center calculation method, merging the dual (left and right) foot trajectories. Moreover, the proposed polar projection and occupancy grid map method determines the map boundary, enabling the fusion of the trajectory and ultrasound range. The mapping results of SLAMING are demonstrated with the ground truth. The location performance is validated using a self-created database, the results of which indicate lower horizontal and spherical error compared with the traditional INS in all scenarios.",[7746,5407,8463,5667,9832],[21,5411,8466,5670,21],"https:\u002F\u002Fdoi.org\u002F10.1109\u002Fsensors52175.2022.9967255","W4311413858","2022 IEEE Sensors",[23,10250,3659,4391,7751,10251,37,6978,6973,6977,10252,7599,7755],"Inertial navigation system","Occupancy grid mapping","Inertial frame of reference",{"type":39,"children":10254,"toc":10259},[10255],{"type":42,"tag":43,"props":10256,"children":10257},{},[10258],{"type":47,"value":10243},{"title":8,"searchDepth":49,"depth":49,"links":10260},[],"content:publications:2022:slam-ing-a-wearable-slam-inertial-navigation-system.md","publications\u002F2022\u002Fslam-ing-a-wearable-slam-inertial-navigation-system.md","publications\u002F2022\u002Fslam-ing-a-wearable-slam-inertial-navigation-system",{"_path":10265,"_dir":8704,"_draft":7,"_partial":7,"_locale":8,"title":10266,"description":10267,"_hidden":7,"Adaptive Random Testing through Small World Graphs\" authors":10268,"authors_orcid":10272,"year":8714,"doi":10276,"openalex_id":10277,"venue":21,"abstract_screenshot":21,"keywords":10278,"body":10279,"_type":51,"_id":10287,"_source":53,"_file":10288,"_stem":10289,"_extension":56,"locale":57},"\u002Fpublications\u002F2022\u002Fsummary-of-swfc-art-a-cost-effective-approach-for-fixed-size-candidate-set-adapt","Summary of SWFC-ART: A Cost-effective Approach for Fixed-Size-Candidate-Se","This extended abstract presents an approach to enhance the Fixed-Sized-Candidate-Set Adaptive Random Testing (FSCS-ART) sampling strategy. SWFC-ART, the proposed approach, stores the previously-executed, non-failure-causing test cases into a Hierarchical Navigable Small World Graph (HNSWG) data structure and uses an efficient and consistent Nearest Neighbor Search (NNS) mechanism, especially for high-dimensional input domains. Our experiments show that SWFC-ART reduces the computational overhead of FSCS-ART from quadratic to log-linear order while retaining the failure-detection effectiveness of FSCS-ART.",[10269,645,595,4114,10270,6213,10271],"Ashfaq, Muhammad","Yashunin, D. A.","Zhang, Tao",[10273,650,599,4118,10274,6216,10275],"0000-0003-1870-7680","0000-0002-6427-5893","0000-0002-6272-4069","https:\u002F\u002Fdoi.org\u002F10.1109\u002Ficst53961.2022.00053","W4282595159",[23,101,1163,6630,9029,102,215,658],{"type":39,"children":10280,"toc":10285},[10281],{"type":42,"tag":43,"props":10282,"children":10283},{},[10284],{"type":47,"value":10267},{"title":8,"searchDepth":49,"depth":49,"links":10286},[],"content:publications:2022:summary-of-swfc-art-a-cost-effective-approach-for-fixed-size-candidate-set-adapt.md","publications\u002F2022\u002Fsummary-of-swfc-art-a-cost-effective-approach-for-fixed-size-candidate-set-adapt.md","publications\u002F2022\u002Fsummary-of-swfc-art-a-cost-effective-approach-for-fixed-size-candidate-set-adapt",{"_path":10291,"_dir":8704,"_draft":7,"_partial":7,"_locale":8,"title":10292,"description":8,"_hidden":7,"Extensible Feedback Systems\" authors":10293,"authors_orcid":10294,"year":8714,"doi":10295,"openalex_id":10296,"venue":8647,"abstract_screenshot":21,"keywords":10297,"body":10301,"_type":51,"_id":10305,"_source":53,"_file":10306,"_stem":10307,"_extension":56,"locale":57},"\u002Fpublications\u002F2022\u002Ftaffies-tailored-automated-feedback-framework-for-developing-integrated-and-exte","TAFFIES: Tailored Automated Feedback Framework for Developing Integrated an",[5407,5667,595],[5411,5670,599],"https:\u002F\u002Fdoi.org\u002F10.1007\u002Fs42979-022-01034-y","W4211154882",[10298,10299,23,133,10300,862,747,10042,867,866,37,865],"Formative assessment","Coursework","Peer feedback",{"type":39,"children":10302,"toc":10303},[],{"title":8,"searchDepth":49,"depth":49,"links":10304},[],"content:publications:2022:taffies-tailored-automated-feedback-framework-for-developing-integrated-and-exte.md","publications\u002F2022\u002Ftaffies-tailored-automated-feedback-framework-for-developing-integrated-and-exte.md","publications\u002F2022\u002Ftaffies-tailored-automated-feedback-framework-for-developing-integrated-and-exte",{"_path":10309,"_dir":8704,"_draft":7,"_partial":7,"_locale":8,"title":10310,"description":8,"_hidden":7,"Learning authors":10311,"authors_orcid":10314,"year":8714,"doi":10317,"openalex_id":10318,"venue":687,"abstract_screenshot":21,"keywords":10319,"body":10322,"_type":51,"_id":10326,"_source":53,"_file":10327,"_stem":10328,"_extension":56,"locale":57},"\u002Fpublications\u002F2022\u002Fthe-force-of-compensation-a-multi-stage-incentive-mechanism-model-for-federated","The Force of Compensation, a Multi-stage Incentive Mechanism Model for Federated",[10312,8932,10313,8931],"Xu, Han","Liang, Jie",[10315,8938,10316,8937],"0000-0002-3580-9403","0000-0001-7179-5208","https:\u002F\u002Fdoi.org\u002F10.1007\u002F978-3-031-23020-2_20","W4312905226",[5472,23,9864,10320,3332,7627,1243,10321,170,629,180,37,7631,178],"Compensation (psychology)","Mechanism design",{"type":39,"children":10323,"toc":10324},[],{"title":8,"searchDepth":49,"depth":49,"links":10325},[],"content:publications:2022:the-force-of-compensation-a-multi-stage-incentive-mechanism-model-for-federated.md","publications\u002F2022\u002Fthe-force-of-compensation-a-multi-stage-incentive-mechanism-model-for-federated.md","publications\u002F2022\u002Fthe-force-of-compensation-a-multi-stage-incentive-mechanism-model-for-federated",{"_path":10330,"_dir":8704,"_draft":7,"_partial":7,"_locale":8,"title":10331,"description":8,"_hidden":7,"prepayment\" authors":10332,"authors_orcid":10336,"year":8714,"doi":10340,"openalex_id":10341,"venue":1055,"abstract_screenshot":21,"keywords":10342,"body":10347,"_type":51,"_id":10351,"_source":53,"_file":10352,"_stem":10353,"_extension":56,"locale":57},"\u002Fpublications\u002F2022\u002Fthe-profitability-of-online-loans-a-competing-risks-analysis-on-default-and-prep","The profitability of online loans: A competing risks analysis on default an",[10333,10334,4189,10335],"Li, Zhiyong","Li, Aimin","Xiao, Yao",[10337,10338,4191,10339],"0000-0001-9307-8453","0000-0002-6983-2310","0000-0002-0622-1045","https:\u002F\u002Fdoi.org\u002F10.1016\u002Fj.ejor.2022.08.013","W4291377626",[10343,1269,6686,173,6687,287,10344,10345,10346,23,178,36,429],"Prepayment of loan","Credit risk","Probability of default","Non-performing loan",{"type":39,"children":10348,"toc":10349},[],{"title":8,"searchDepth":49,"depth":49,"links":10350},[],"content:publications:2022:the-profitability-of-online-loans-a-competing-risks-analysis-on-default-and-prep.md","publications\u002F2022\u002Fthe-profitability-of-online-loans-a-competing-risks-analysis-on-default-and-prep.md","publications\u002F2022\u002Fthe-profitability-of-online-loans-a-competing-risks-analysis-on-default-and-prep",{"_path":10355,"_dir":8704,"_draft":7,"_partial":7,"_locale":8,"title":10356,"description":10357,"_hidden":7,"China\" authors":10358,"authors_orcid":10360,"year":8714,"doi":10362,"openalex_id":10363,"venue":10364,"abstract_screenshot":21,"keywords":10365,"body":10368,"_type":51,"_id":10376,"_source":53,"_file":10377,"_stem":10378,"_extension":56,"locale":57},"\u002Fpublications\u002F2022\u002Fthe-value-of-family-social-capital-in-informal-financial-markets-evidence-from-c","The value of family social capital in informal financial markets: Evidence fro","This study investigates whether and how family social capital influences borrowers' loan performance in informal financial markets. Using a unique dataset collected from an informal financial institution in Eastern China from 2014 to 2018, we show that a higher level of family social capital is associated with better loan performance, captured by lower default probability, lower loss ratio, and lower loss amount. The effect is more pronounced for borrowers with less access to formal financial markets and those with poorer financial conditions, while it is less pronounced for borrowers with higher risk preferences and those born in regions with high social trust. These results continue to hold after addressing endogeneity concerns and conducting a series of robustness tests. Overall, our study provides evidence that borrowers' family social capital creates value in the informal financial markets.",[10359,268],"Li, Wanning",[10361,272],"0000-0003-3715-0195","https:\u002F\u002Fdoi.org\u002F10.1016\u002Fj.pacfin.2022.101922","W4313398159","Pacific-Basin Finance Journal",[6597,5855,10366,6687,282,837,10367,178,4727,429,36,353,1441,1357,6568,285,6599,3713],"Financial institution","Financial capital",{"type":39,"children":10369,"toc":10374},[10370],{"type":42,"tag":43,"props":10371,"children":10372},{},[10373],{"type":47,"value":10357},{"title":8,"searchDepth":49,"depth":49,"links":10375},[],"content:publications:2022:the-value-of-family-social-capital-in-informal-financial-markets-evidence-from-c.md","publications\u002F2022\u002Fthe-value-of-family-social-capital-in-informal-financial-markets-evidence-from-c.md","publications\u002F2022\u002Fthe-value-of-family-social-capital-in-informal-financial-markets-evidence-from-c",{"_path":10380,"_dir":8704,"_draft":7,"_partial":7,"_locale":8,"title":10381,"description":10382,"_hidden":7,"for the Process of Metamorphic Testing authors":10383,"authors_orcid":10384,"year":8714,"doi":10385,"openalex_id":10386,"venue":9125,"abstract_screenshot":21,"keywords":10387,"body":10389,"_type":51,"_id":10397,"_source":53,"_file":10398,"_stem":10399,"_extension":56,"locale":57},"\u002Fpublications\u002F2022\u002Fusing-metamorphic-relation-violation-regions-to-support-a-simulation-framework-f","Using Metamorphic Relation Violation Regions to Support a Simulation Framework","Metamorphic testing (MT) has been growing in pop-ularity, but it can still be quite challenging and time-consuming to assess its performance. Typical approaches to performance assessment can require a series of steps, and depend on a variety of factors, often requiring serendipity. This can be a bottleneck for some aspects of MT research. Central to MT, metamorphic relations (MRs) represent necessary properties of the system under test (SUT). In traditional software testing, simulations are often employed to examine and compare the performance of dif-ferent testing strategies. However, these simulations are typically designed based on the assumed availability (and applicability) of a test oracle - a mechanism to decide the correctness of the SUT output or behaviour. A key reason for the popularity of MT is its proven record of effective software testing, without the need for a test oracle. This strength, however, also means that traditional ways of using simulations to analyse software testing approaches are not applicable for MT. This lack of cheap and fast ways to conduct simulation analyses of MT is a hurdle for many aspects of MT research, and may be an obstacle to its more widespread adoption. To address this, in this paper we introduce the concept of MR-violation regions (MRVRs), and show how they can be used for a certain category of MRs, Deterministic MRs (DMRs), to build simulation tools for MT. We analyse the differences between MRVRs and traditional, oracle-defined failure regions; and report on a preliminary case study exploring MRVRs in numerical-input-domain systems from previous MT studies. We anticipate that the proposed MT simulation framework may facilitate more research into MT, and may help lead to its more widespread adoption.",[8040,4189,595,596,1156],[8044,4191,599,600,1158],"https:\u002F\u002Fdoi.org\u002F10.1109\u002Fcompsac54236.2022.00274","W4301822605",[605,23,3227,10388,135,139,606,4965,607,181,215,332,110,4242],"Bottleneck",{"type":39,"children":10390,"toc":10395},[10391],{"type":42,"tag":43,"props":10392,"children":10393},{},[10394],{"type":47,"value":10382},{"title":8,"searchDepth":49,"depth":49,"links":10396},[],"content:publications:2022:using-metamorphic-relation-violation-regions-to-support-a-simulation-framework-f.md","publications\u002F2022\u002Fusing-metamorphic-relation-violation-regions-to-support-a-simulation-framework-f.md","publications\u002F2022\u002Fusing-metamorphic-relation-violation-regions-to-support-a-simulation-framework-f",{"_path":10401,"_dir":8704,"_draft":7,"_partial":7,"_locale":8,"title":10402,"description":8,"_hidden":7,"Random Testing Using Vantage Point Partitioning\" authors":10403,"authors_orcid":10405,"year":8714,"doi":10407,"openalex_id":10408,"venue":3356,"abstract_screenshot":21,"keywords":10409,"body":10411,"_type":51,"_id":10445,"_source":53,"_file":10446,"_stem":10447,"_extension":56,"locale":57},"\u002Fpublications\u002F2022\u002Fvpp-art-an-efficient-implementation-of-fixed-size-candidate-set-adaptive-random","VPP-ART: An Efficient Implementation of Fixed-Size-Candidate-Set Adaptiv",[645,6820,595,5049,10404],"Lian, Junlong",[650,6822,599,5051,10406],"0009-0007-3167-1236","https:\u002F\u002Fdoi.org\u002F10.1109\u002Ftr.2022.3218602","W4206882053",[23,1163,101,3664,37,6630,10410,332,215,34,658,110,76],"Point (geometry)",{"type":39,"children":10412,"toc":10443},[10413],{"type":42,"tag":9671,"props":10414,"children":10415},{"xmlns:mml":1465,"xmlnsXLink":8791},[10416,10418],{"type":47,"value":10417},"\nAdaptive random testing\n\n (ART) is an enhancement of \n",{"type":42,"tag":9671,"props":10419,"children":10420},{"xmlns:mml":1465,"xmlnsXLink":8791},[10421,10423],{"type":47,"value":10422},"\nrandom testing\n\n (RT), and aims to improve the RT failure-detection effectiveness by distributing test cases more evenly in the input domain. Many ART algorithms have been proposed, with \n",{"type":42,"tag":9671,"props":10424,"children":10425},{"xmlns:mml":1465,"xmlnsXLink":8791},[10426,10428],{"type":47,"value":10427},"\nfixed-size-candidate-set\n\n ART (FSCS-ART) being one of the most effective and popular. FSCS-ART ensures high failure-detection effectiveness by selecting as the next test case the candidate farthest from previously executed test cases. Although FSCS-ART has good failure-detection effectiveness, it also faces some challenges, including heavy computational overheads. In this article, we propose an enhanced version of FSCS-ART, \n",{"type":42,"tag":9671,"props":10429,"children":10430},{"xmlns:mml":1465,"xmlnsXLink":8791},[10431,10433],{"type":47,"value":10432},"\nvantage point partitioning ART\n\n (VPP-ART). VPP-ART addresses the FSCS-ART computational overhead problem using VPP, while maintaining the failure-detection effectiveness. VPP-ART partitions the input domain space using a \n",{"type":42,"tag":9671,"props":10434,"children":10435},{"xmlns:mml":1465,"xmlnsXLink":8791},[10436,10438],{"type":47,"value":10437},"\nmodified vantage point tree\n\n (VP-tree) and finds the approximate nearest executed test cases of a candidate test case in the partitioned subdomains—thereby significantly reducing the time overheads compared with the searches required for FSCS-ART. To enable the FSCS-ART dynamic insertion process, we modify the traditional VP-tree to support dynamic data. The simulation results show that VPP-ART has a much lower time overhead compared to FSCS-ART, but also delivers similar (or better) failure-detection effectiveness, especially in the higher dimensional input domains. According to statistical analyses, VPP-ART can improve on the FSCS-ART failure-detection effectiveness by approximately 50–58%. VPP-ART also compares favorably with the \n",{"type":42,"tag":9671,"props":10439,"children":10440},{"xmlns:mml":1465,"xmlnsXLink":8791},[10441],{"type":47,"value":10442},"\nKD-tree-enhanced fixed-size-candidate-set ART\n\n (KDFC-ART) algorithms (a series of enhanced ART algorithms based on the KD-tree). Our experiments also show that VPP-ART is more cost-effective than FSCS-ART and KDFC-ART.",{"title":8,"searchDepth":49,"depth":49,"links":10444},[],"content:publications:2022:vpp-art-an-efficient-implementation-of-fixed-size-candidate-set-adaptive-random.md","publications\u002F2022\u002Fvpp-art-an-efficient-implementation-of-fixed-size-candidate-set-adaptive-random.md","publications\u002F2022\u002Fvpp-art-an-efficient-implementation-of-fixed-size-candidate-set-adaptive-random",{"_path":10449,"_dir":10450,"_draft":7,"_partial":7,"_locale":8,"title":10451,"description":10452,"_hidden":7,"authors":10453,"authors_orcid":10454,"year":10455,"doi":10456,"openalex_id":10457,"venue":374,"abstract_screenshot":21,"keywords":10458,"body":10461,"_type":51,"_id":10469,"_source":53,"_file":10470,"_stem":10471,"_extension":56,"locale":57},"\u002Fpublications\u002F2023\u002Fa-deep-reinforcement-learning-hyper-heuristic-with-feature-fusion-for-online-pac","2023","A deep reinforcement learning hyper-heuristic with feature fusion for online packing problems","In recent years, deep reinforcement learning has shown great potential in solving computer games with sequential decision-making scenarios. Hyper-heuristic is a generic search framework, capable of intelligently selecting or generating algorithms to solve a class of optimisation problems with stochastic or dynamic settings. This paper proposes a new general framework for solving online packing problems using deep reinforcement learning hyper-heuristics. Although analytical approaches can address most offline packing problems successfully, their online versions have proved much more challenging and the performance of the existing methods is often not satisfactory. In this paper, we extend a recent deep reinforcement learning hyper-heuristic framework by fusing the visual information of real-time packing with distributional information of random parameters of the problem. Computational experiments show that our method outperforms the state of the art online methods with reductions in optimality gap between 2%–19% for knapsack problem and 0.7% for the online strip packing problem. In addition, a new visual analysis presentation is also devised to better interpret the learned packing strategies, which can reveal more information than the widely used landscape analysis. As online packing problems are widely available in production environments, the proposed approach can serve as an important reference to solve other similar combinatorial optimisation problems for which visual layout inputs would aid learning.",[7197,12,5817,7196,4626],[7201,15,5822,7200,4637],2023,"https:\u002F\u002Fdoi.org\u002F10.1016\u002Fj.eswa.2023.120568","W4379057202",[5304,23,506,329,37,10459,10460,215,862,890,6875,31,332,34],"Packing problems","Knapsack problem",{"type":39,"children":10462,"toc":10467},[10463],{"type":42,"tag":43,"props":10464,"children":10465},{},[10466],{"type":47,"value":10452},{"title":8,"searchDepth":49,"depth":49,"links":10468},[],"content:publications:2023:a-deep-reinforcement-learning-hyper-heuristic-with-feature-fusion-for-online-pac.md","publications\u002F2023\u002Fa-deep-reinforcement-learning-hyper-heuristic-with-feature-fusion-for-online-pac.md","publications\u002F2023\u002Fa-deep-reinforcement-learning-hyper-heuristic-with-feature-fusion-for-online-pac",{"_path":10473,"_dir":10450,"_draft":7,"_partial":7,"_locale":8,"title":10474,"description":10475,"_hidden":7,"authors":10476,"authors_orcid":10478,"year":10455,"doi":10481,"openalex_id":10482,"venue":10483,"abstract_screenshot":10484,"keywords":10485,"body":10486,"_type":51,"_id":10494,"_source":53,"_file":10495,"_stem":10496,"_extension":56,"locale":57},"\u002Fpublications\u002F2023\u002Fa-logic-of-east-and-west","A Logic of East and West","We propose a logic of east and west (LEW ) for points in 1D Euclidean space. It formalises primitive direction relations: east (E), west (W) and indeterminate east\u002Fwest (Iew). It has a parameter τ ∈ N>1, which is referred to as the level of indeterminacy in directions. For every τ ∈ N>1, we provide a sound and complete axiomatisation of LEW , and prove that its satisfiability problem is NP-complete. In addition, we show that the finite axiomatisability of LEW depends on τ : if τ = 2 or τ = 3, then there exists a finite sound and complete axiomatisation; if τ > 3, then the logic is not finitely axiomatisable. LEW can be easily extended to higher-dimensional Euclidean spaces. Extending LEW to 2D Euclidean space makes it suitable for reasoning about not perfectly aligned representations of the same spatial objects in different datasets, for example, in crowd-sourced digital maps.",[4626,5786,10477,9977,7220,4634],"Farjudian, Amin",[4637,5788,10479,9981,10480,4643],"0000-0002-1879-0763","0009-0007-1448-1721","https:\u002F\u002Fdoi.org\u002F10.1613\u002Fjair.1.14113","W4322621173","Journal of Artificial Intelligence Research","a-logic-of-east-and-west.png",[6090,5796,5793,27,34,6826,5798,23,107,332,76,37,108,3393],{"type":39,"children":10487,"toc":10492},[10488],{"type":42,"tag":43,"props":10489,"children":10490},{},[10491],{"type":47,"value":10475},{"title":8,"searchDepth":49,"depth":49,"links":10493},[],"content:publications:2023:a-logic-of-east-and-west.md","publications\u002F2023\u002Fa-logic-of-east-and-west.md","publications\u002F2023\u002Fa-logic-of-east-and-west",{"_path":10498,"_dir":10450,"_draft":7,"_partial":7,"_locale":8,"title":10499,"description":10500,"_hidden":7,"authors":10501,"authors_orcid":10502,"year":10455,"doi":10503,"openalex_id":10504,"venue":10505,"abstract_screenshot":21,"keywords":10506,"body":10511,"_type":51,"_id":10519,"_source":53,"_file":10520,"_stem":10521,"_extension":56,"locale":57},"\u002Fpublications\u002F2023\u002Fa-max-relevance-min-divergence-criterion-for-data-discretization-with-applicatio","A Max-Relevance-Min-Divergence criterion for data discretization with applications on naive Bayes","In many classification models, data is discretized to better estimate its distribution. Existing discretization methods often target at maximizing the discriminant power of discretized data, while overlooking the fact that the primary target of data discretization in classification is to improve the generalization performance. As a result, the data tend to be over-split into many small bins since the data without discretization retain the maximal discriminant information. Thus, we propose a Max-Dependency-Min-Divergence (MDmD) criterion that maximizes both the discriminant information and generalization ability of the discretized data. More specifically, the Max-Dependency criterion maximizes the statistical dependency between the discretized data and the classification variable while the Min-Divergence criterion explicitly minimizes the JS-divergence between the training data and the validation data for a given discretization scheme. The proposed MDmD criterion is technically appealing, but it is difficult to reliably estimate the high-order joint distributions of attributes and the classification variable. We hence further propose a more practical solution, Max-Relevance-Min-Divergence (MRmD) discretization scheme, where each attribute is discretized separately, by simultaneously maximizing the discriminant information and the generalization ability of the discretized data. The proposed MRmD is compared with the state-of-the-art discretization algorithms under the naive Bayes classification framework on 45 benchmark datasets. It significantly outperforms all the compared methods on most of the datasets.",[6135,6111,12,9416,9048],[6137,6113,15,9422,9051],"https:\u002F\u002Fdoi.org\u002F10.1016\u002Fj.patcog.2023.110236","W4390322455","Pattern Recognition",[10507,1033,10508,6144,10509,9056,34,6141,23,4876,37,332,181,3688,10510],"Discretization","Discretization of continuous features","Dependency (UML)","Discretization error",{"type":39,"children":10512,"toc":10517},[10513],{"type":42,"tag":43,"props":10514,"children":10515},{},[10516],{"type":47,"value":10500},{"title":8,"searchDepth":49,"depth":49,"links":10518},[],"content:publications:2023:a-max-relevance-min-divergence-criterion-for-data-discretization-with-applicatio.md","publications\u002F2023\u002Fa-max-relevance-min-divergence-criterion-for-data-discretization-with-applicatio.md","publications\u002F2023\u002Fa-max-relevance-min-divergence-criterion-for-data-discretization-with-applicatio",{"_path":10523,"_dir":10450,"_draft":7,"_partial":7,"_locale":8,"title":10524,"description":10525,"_hidden":7,"System authors":10526,"authors_orcid":10527,"year":10455,"doi":10528,"openalex_id":10529,"venue":21,"abstract_screenshot":21,"keywords":10530,"body":10531,"_type":51,"_id":10539,"_source":53,"_file":10540,"_stem":10541,"_extension":56,"locale":57},"\u002Fpublications\u002F2023\u002Fa-novel-attitude-feature-extraction-method-for-multi-imu-based-fall-detection-sy","A Novel Attitude Feature Extraction Method for Multi-IMU Based Fall Detection","Falling has become the leading cause of non-fatal and preventable injuries. The majority of existing fall detection systems (FDSs) rely on motion sensors. However, most of the applied feature extraction methods result in longer processing time and higher computation. This study proposes a novel attitude feature extraction (AFE) method that extract five feature sets from 54 raw measurements obtained from nine inertial measurement units (IMUs) placed on the firefighter’s protective clothing. Our results indicate that the metrics of attitude feature extraction (AFEM) method outperforms the existing metrics of raw feature extraction (RFEM) method in the fall detection. In addition, the proposed method reduces the algorithm processing time and computations significantly. This enables on-device fall detection classification on constrained processing architectures.",[8463,5667,5407,7746,9832],[8466,5670,5411,21,9836],"https:\u002F\u002Fdoi.org\u002F10.1109\u002Ficpeca56706.2023.10075997","W4361862453",[7391,6978,23,37,6875,330,4391,4876,332],{"type":39,"children":10532,"toc":10537},[10533],{"type":42,"tag":43,"props":10534,"children":10535},{},[10536],{"type":47,"value":10525},{"title":8,"searchDepth":49,"depth":49,"links":10538},[],"content:publications:2023:a-novel-attitude-feature-extraction-method-for-multi-imu-based-fall-detection-sy.md","publications\u002F2023\u002Fa-novel-attitude-feature-extraction-method-for-multi-imu-based-fall-detection-sy.md","publications\u002F2023\u002Fa-novel-attitude-feature-extraction-method-for-multi-imu-based-fall-detection-sy",{"_path":10543,"_dir":10450,"_draft":7,"_partial":7,"_locale":8,"title":10544,"description":10545,"_hidden":7,"authors":10546,"authors_orcid":10547,"year":10455,"doi":10548,"openalex_id":10549,"venue":374,"abstract_screenshot":21,"keywords":10550,"body":10554,"_type":51,"_id":10562,"_source":53,"_file":10563,"_stem":10564,"_extension":56,"locale":57},"\u002Fpublications\u002F2023\u002Fa-semi-supervised-adaptive-discriminative-discretization-method-improving-discri","A semi-supervised adaptive discriminative discretization method improving discrimination power of regularized naive Bayes","Recently, many improved naive Bayes methods have been developed with enhanced discrimination capabilities. Among them, regularized naive Bayes (RNB) produces excellent performance by balancing the discrimination power and generalization capability. Data discretization is important in naive Bayes. By grouping similar values into one interval, the data distribution could be better estimated. However, existing methods including RNB often discretize the data into too few intervals, which may result in a significant information loss. To address this problem, we propose a semi-supervised adaptive discriminative discretization framework for naive Bayes, which could better estimate the data distribution by utilizing both labeled data and unlabeled data through pseudo-labeling techniques. The proposed method also significantly reduces the information loss during discretization by utilizing an adaptive discriminative discretization scheme, and hence greatly improves the discrimination power of classifiers. The proposed RNB+, i.e., regularized naive Bayes utilizing the proposed discretization framework, is systematically evaluated on a wide range of machine-learning datasets. It significantly and consistently outperforms state-of-the-art NB classifiers.",[6135,6111,12],[6137,6113,15],"https:\u002F\u002Fdoi.org\u002F10.1016\u002Fj.eswa.2023.120094","W4366165296",[10507,6141,10551,6146,215,23,37,10552,4876,34,5591,3688,10553],"Discriminative model","Bayes error rate","Bayes classifier",{"type":39,"children":10555,"toc":10560},[10556],{"type":42,"tag":43,"props":10557,"children":10558},{},[10559],{"type":47,"value":10545},{"title":8,"searchDepth":49,"depth":49,"links":10561},[],"content:publications:2023:a-semi-supervised-adaptive-discriminative-discretization-method-improving-discri.md","publications\u002F2023\u002Fa-semi-supervised-adaptive-discriminative-discretization-method-improving-discri.md","publications\u002F2023\u002Fa-semi-supervised-adaptive-discriminative-discretization-method-improving-discri",{"_path":10566,"_dir":10450,"_draft":7,"_partial":7,"_locale":8,"title":10567,"description":10568,"_hidden":7,"authors":10569,"authors_orcid":10571,"year":10455,"doi":10573,"openalex_id":10574,"venue":21,"abstract_screenshot":21,"keywords":10575,"body":10576,"_type":51,"_id":10584,"_source":53,"_file":10585,"_stem":10586,"_extension":56,"locale":57},"\u002Fpublications\u002F2023\u002Fa-simulation-hyper-heuristic-method-for-multi-floor-agv-delivery-services-in-hos","A Simulation Hyper-Heuristic Method for Multi-Floor AGV Delivery Services in Hospitals","Automated Guided Vehicles (AGVs) enhance transportation efficiency in different domains such as warehouses, factories, and container ports. Much research has been done into optimal scheduling and routing of multiple AGVs to improve the overall efficiency of the systems. However, more research efforts are required when addressing more complex real-life systems where the mobility of AGVs is highly constrained due to special geometric shapes and dimensions. Focusing on a real-world hospital AGV routing problem, this paper tackles the additional complexity arising from space capacity constraints long narrow corridors and lifts for cross-floor deliveries. A simulation optimisation approach is introduced to accurately model complex interactions of AGVs under conditions like floor switching, charging, and passing narrow corridors. To tackle the underlining vehicle routing problems with pickup and delivery (VRPPD) which is NP-Hard, this paper presents a simulation-based hyper-heuristic optimization approach to minimize the makespan of all tasks. A surrogate model is integrated to expedite the search process, and several experiments are conducted to properly evaluate the performance of our method. Based on the results, our method exhibits great potential in improving efficiency while maintaining the excellent practicality of AGV routing for complex environments like hospitals.",[10570,5989,10190,12],"Yuan, Haocheng",[10572,5991,10195,15],"0009-0007-1717-1585","https:\u002F\u002Fdoi.org\u002F10.1109\u002Fssci52147.2023.10371983","W4390483955",[247,250,23,450,3201,329,135,1189,984,249,31,179,4242,37],{"type":39,"children":10577,"toc":10582},[10578],{"type":42,"tag":43,"props":10579,"children":10580},{},[10581],{"type":47,"value":10568},{"title":8,"searchDepth":49,"depth":49,"links":10583},[],"content:publications:2023:a-simulation-hyper-heuristic-method-for-multi-floor-agv-delivery-services-in-hos.md","publications\u002F2023\u002Fa-simulation-hyper-heuristic-method-for-multi-floor-agv-delivery-services-in-hos.md","publications\u002F2023\u002Fa-simulation-hyper-heuristic-method-for-multi-floor-agv-delivery-services-in-hos",{"_path":10588,"_dir":10450,"_draft":7,"_partial":7,"_locale":8,"title":10589,"description":8,"_hidden":7,"authors":10590,"authors_orcid":10592,"year":10455,"doi":10594,"openalex_id":10595,"venue":3952,"abstract_screenshot":21,"keywords":10596,"body":10599,"_type":51,"_id":10603,"_source":53,"_file":10604,"_stem":10605,"_extension":56,"locale":57},"\u002Fpublications\u002F2023\u002Fa-two-fold-evaluation-in-science-the-case-of-nobel-prize","A two-fold evaluation in science: the case of Nobel Prize",[10591,3538,65],"Chen, Lingzhi",[10593,3540,70],"0000-0002-7208-8916","https:\u002F\u002Fdoi.org\u002F10.1007\u002Fs11192-023-04830-2","W4387424992",[10597,834,10598,1358,753,1380,23,5949,3259],"Identity (music)","Discipline",{"type":39,"children":10600,"toc":10601},[],{"title":8,"searchDepth":49,"depth":49,"links":10602},[],"content:publications:2023:a-two-fold-evaluation-in-science-the-case-of-nobel-prize.md","publications\u002F2023\u002Fa-two-fold-evaluation-in-science-the-case-of-nobel-prize.md","publications\u002F2023\u002Fa-two-fold-evaluation-in-science-the-case-of-nobel-prize",{"_path":10607,"_dir":10450,"_draft":7,"_partial":7,"_locale":8,"title":10608,"description":8,"_hidden":7,"detection\" authors":10609,"authors_orcid":10616,"year":10455,"doi":10623,"openalex_id":10624,"venue":887,"abstract_screenshot":21,"keywords":10625,"body":10631,"_type":51,"_id":10635,"_source":53,"_file":10636,"_stem":10637,"_extension":56,"locale":57},"\u002Fpublications\u002F2023\u002Fabusdet-a-novel-2-5d-deep-learning-model-for-automated-breast-ultrasound-tumor-d","ABUSDet: A Novel 2.5D deep learning model for automated breast ultrasound tumo",[10610,10611,10612,8931,10613,10614,9014,10615],"Song, Xudong","Lu, Xiaoyang","Fang, Gengfa","Fan, Xiaochen","Cai, Le","Wang, Zumin",[10617,10618,10619,8937,10620,10621,9020,10622],"0000-0002-0095-5726","0009-0003-7181-0406","0000-0003-0845-6718","0000-0001-8945-3046","0000-0002-9301-1715","0000-0003-1194-8203","https:\u002F\u002Fdoi.org\u002F10.1007\u002Fs10489-023-04785-0","W4386001203",[23,10626,37,10627,7595,6976,10628,10629,4876,4391,9392,10630,380,9396],"Breast tumor","Modality (human–computer interaction)","Breast ultrasound","Breast imaging","Mammography",{"type":39,"children":10632,"toc":10633},[],{"title":8,"searchDepth":49,"depth":49,"links":10634},[],"content:publications:2023:abusdet-a-novel-2-5d-deep-learning-model-for-automated-breast-ultrasound-tumor-d.md","publications\u002F2023\u002Fabusdet-a-novel-2-5d-deep-learning-model-for-automated-breast-ultrasound-tumor-d.md","publications\u002F2023\u002Fabusdet-a-novel-2-5d-deep-learning-model-for-automated-breast-ultrasound-tumor-d",{"_path":10639,"_dir":10450,"_draft":7,"_partial":7,"_locale":8,"title":10640,"description":8,"_hidden":7,"authors":10641,"authors_orcid":10645,"year":10455,"doi":10649,"openalex_id":10650,"venue":374,"abstract_screenshot":21,"keywords":10651,"body":10656,"_type":51,"_id":10660,"_source":53,"_file":10661,"_stem":10662,"_extension":56,"locale":57},"\u002Fpublications\u002F2023\u002Fan-entropy-based-group-decision-making-approach-for-software-quality-evaluation","An entropy-based group decision-making approach for software quality evaluation",[10642,645,595,10643,10644],"Yue, Chuan","Xian, Zixiang","Wu, Guohua",[10646,650,599,10647,10648],"0000-0001-8494-0312","0000-0002-8892-6187","0000-0003-1552-9620","https:\u002F\u002Fdoi.org\u002F10.1016\u002Fj.eswa.2023.121979","W4387409571",[10652,23,10653,7389,210,181,175,139,10654,10655,215,24,34,332],"Regret","Group decision-making","Projection (relational algebra)","Decision matrix",{"type":39,"children":10657,"toc":10658},[],{"title":8,"searchDepth":49,"depth":49,"links":10659},[],"content:publications:2023:an-entropy-based-group-decision-making-approach-for-software-quality-evaluation.md","publications\u002F2023\u002Fan-entropy-based-group-decision-making-approach-for-software-quality-evaluation.md","publications\u002F2023\u002Fan-entropy-based-group-decision-making-approach-for-software-quality-evaluation",{"_path":10664,"_dir":10450,"_draft":7,"_partial":7,"_locale":8,"title":10665,"description":8,"_hidden":7,"authors":10666,"authors_orcid":10667,"year":10455,"doi":10668,"openalex_id":10669,"venue":6116,"abstract_screenshot":21,"keywords":10670,"body":10672,"_type":51,"_id":10676,"_source":53,"_file":10677,"_stem":10678,"_extension":56,"locale":57},"\u002Fpublications\u002F2023\u002Fanalytics-and-machine-learning-in-scheduling-and-routing-research","Analytics and machine learning in scheduling and routing research",[12,7408,13],[15,7414,16],"https:\u002F\u002Fdoi.org\u002F10.1080\u002F00207543.2022.2131930","W4313477858",[690,450,23,24,250,691,10671,179,33,251],"Industrial engineering",{"type":39,"children":10673,"toc":10674},[],{"title":8,"searchDepth":49,"depth":49,"links":10675},[],"content:publications:2023:analytics-and-machine-learning-in-scheduling-and-routing-research.md","publications\u002F2023\u002Fanalytics-and-machine-learning-in-scheduling-and-routing-research.md","publications\u002F2023\u002Fanalytics-and-machine-learning-in-scheduling-and-routing-research",{"_path":10680,"_dir":10450,"_draft":7,"_partial":7,"_locale":8,"title":10681,"description":10682,"_hidden":7,"Through Timing Delay Measurement on FPGA\" authors":10683,"authors_orcid":10684,"year":10455,"doi":10685,"openalex_id":10686,"venue":8774,"abstract_screenshot":21,"keywords":10687,"body":10688,"_type":51,"_id":10760,"_source":53,"_file":10761,"_stem":10762,"_extension":56,"locale":57},"\u002Fpublications\u002F2023\u002Faos-an-automated-overclocking-system-for-high-performance-cnn-accelerator-throug","AOS: An Automated Overclocking System for High-Performance CNN Accelerato","With the inherent algorithmic error resilience of conventional neural networks (CNNs) and the worst-case design methodologies of current electronic design automation tools, overclocking-based timing speculation is a promising technique to improve the performance of CNN accelerators on FPGA by removing unnecessary timing margins. To avoid potential timing errors, timing delay measurement should be used during overclocking. However, current approaches are not yet good at measuring paths with more intense variability factors such as jitter and lack an automated process for testing circuit delays. In this article, we first propose 2-dimension multiframe fusion to deal with the sampling jitter, then present a timing delay measurement-based automatic overclocking system (AOS) running on heterogeneous FPGA for high-performance CNN accelerators. On the FPGA side, AOS is composed of timing delay monitors (TDMs) that can measure all types of timing paths, a TDM controller that converts the sampled values of TDMs into timing delay in terms of the ratio of path delay to the clock period. On the CPU side, AOS converts the path delay from clock period ratio to absolute delay value and decides the frequency of the accelerator in the next iteration. We demonstrate AOS with a SkyNet accelerator on the Xilinx ZCU104 board and achieve 657 FPS at 436 MHz without accuracy degradation, which is  1.41×1.41\\times 1.41×  performance compared to the baseline.",[5531,5532,6618,5534],[5536,5537,6622,5539],"https:\u002F\u002Fdoi.org\u002F10.1109\u002Ftcad.2023.3235803","W4315489349",[6190,5543,23,6191,6192,5550,3203,4242,332,6195],{"type":39,"children":10689,"toc":10758},[10690],{"type":42,"tag":43,"props":10691,"children":10692},{},[10693,10695,10756],{"type":47,"value":10694},"With the inherent algorithmic error resilience of conventional neural networks (CNNs) and the worst-case design methodologies of current electronic design automation tools, overclocking-based timing speculation is a promising technique to improve the performance of CNN accelerators on FPGA by removing unnecessary timing margins. To avoid potential timing errors, timing delay measurement should be used during overclocking. However, current approaches are not yet good at measuring paths with more intense variability factors such as jitter and lack an automated process for testing circuit delays. In this article, we first propose 2-dimension multiframe fusion to deal with the sampling jitter, then present a timing delay measurement-based automatic overclocking system (AOS) running on heterogeneous FPGA for high-performance CNN accelerators. On the FPGA side, AOS is composed of timing delay monitors (TDMs) that can measure all types of timing paths, a TDM controller that converts the sampled values of TDMs into timing delay in terms of the ratio of path delay to the clock period. On the CPU side, AOS converts the path delay from clock period ratio to absolute delay value and decides the frequency of the accelerator in the next iteration. We demonstrate AOS with a SkyNet accelerator on the Xilinx ZCU104 board and achieve 657 FPS at 436 MHz without accuracy degradation, which is ",{"type":42,"tag":8789,"props":10696,"children":10697},{"xmlns:mml":1465,"xmlnsXLink":8791},[10698,10699],{"type":47,"value":8794},{"type":42,"tag":8796,"props":10700,"children":10701},{"notation":8798},[10702,10755],{"type":42,"tag":809,"props":10703,"children":10705},{"className":10704},[1455],[10706,10733],{"type":42,"tag":809,"props":10707,"children":10709},{"className":10708},[1460],[10710],{"type":42,"tag":1463,"props":10711,"children":10712},{"xmlns":1465},[10713],{"type":42,"tag":1468,"props":10714,"children":10715},{},[10716,10728],{"type":42,"tag":1472,"props":10717,"children":10718},{},[10719,10724],{"type":42,"tag":1476,"props":10720,"children":10721},{},[10722],{"type":47,"value":10723},"1.41",{"type":42,"tag":1482,"props":10725,"children":10726},{},[10727],{"type":47,"value":8548},{"type":42,"tag":2265,"props":10729,"children":10730},{"encoding":2267},[10731],{"type":47,"value":10732},"1.41\\times ",{"type":42,"tag":809,"props":10734,"children":10736},{"className":10735,"ariaHidden":1484},[2274],[10737],{"type":42,"tag":809,"props":10738,"children":10740},{"className":10739},[2279],[10741,10745,10750],{"type":42,"tag":809,"props":10742,"children":10744},{"className":10743,"style":8565},[2284],[],{"type":42,"tag":809,"props":10746,"children":10748},{"className":10747},[2290],[10749],{"type":47,"value":10723},{"type":42,"tag":809,"props":10751,"children":10753},{"className":10752},[2290],[10754],{"type":47,"value":8548},{"type":47,"value":8794},{"type":47,"value":10757}," performance compared to the baseline.",{"title":8,"searchDepth":49,"depth":49,"links":10759},[],"content:publications:2023:aos-an-automated-overclocking-system-for-high-performance-cnn-accelerator-throug.md","publications\u002F2023\u002Faos-an-automated-overclocking-system-for-high-performance-cnn-accelerator-throug.md","publications\u002F2023\u002Faos-an-automated-overclocking-system-for-high-performance-cnn-accelerator-throug",{"_path":10764,"_dir":10450,"_draft":7,"_partial":7,"_locale":8,"title":10765,"description":8,"_hidden":7,"Education authors":10766,"authors_orcid":10767,"year":10455,"doi":10768,"openalex_id":10769,"venue":10770,"abstract_screenshot":21,"keywords":10771,"body":10772,"_type":51,"_id":10776,"_source":53,"_file":10777,"_stem":10778,"_extension":56,"locale":57},"\u002Fpublications\u002F2023\u002Fapplying-software-engineering-thinking-to-teaching-in-emi-sino-foreign-higher-ed","Applying Software-Engineering Thinking to Teaching in EMI Sino-Foreign Higher",[5407,5667,595],[5411,5670,599],"https:\u002F\u002Fdoi.org\u002F10.1007\u002F978-3-031-32811-4_9","W4385323717","Multilingual education yearbook",[3766,133,23,866,179,865,607],{"type":39,"children":10773,"toc":10774},[],{"title":8,"searchDepth":49,"depth":49,"links":10775},[],"content:publications:2023:applying-software-engineering-thinking-to-teaching-in-emi-sino-foreign-higher-ed.md","publications\u002F2023\u002Fapplying-software-engineering-thinking-to-teaching-in-emi-sino-foreign-higher-ed.md","publications\u002F2023\u002Fapplying-software-engineering-thinking-to-teaching-in-emi-sino-foreign-higher-ed",{"_path":10780,"_dir":10450,"_draft":7,"_partial":7,"_locale":8,"title":10781,"description":8,"_hidden":7,"authors":10782,"authors_orcid":10783,"year":10455,"doi":10784,"openalex_id":10785,"venue":21,"abstract_screenshot":21,"keywords":10786,"body":10788,"_type":51,"_id":10792,"_source":53,"_file":10793,"_stem":10794,"_extension":56,"locale":57},"\u002Fpublications\u002F2023\u002Fautomated-metamorphic-relation-generation-with-chatgpt-an-experience-report","Automated Metamorphic-Relation Generation with ChatGPT: An Experience Report",[8041,595,5407],[8045,599,5411],"https:\u002F\u002Fdoi.org\u002F10.1109\u002Fcompsac57700.2023.00275","W4385477813",[3788,4965,23,10787,3789,3790,4991,6443],"Metamorphic petrology",{"type":39,"children":10789,"toc":10790},[],{"title":8,"searchDepth":49,"depth":49,"links":10791},[],"content:publications:2023:automated-metamorphic-relation-generation-with-chatgpt-an-experience-report.md","publications\u002F2023\u002Fautomated-metamorphic-relation-generation-with-chatgpt-an-experience-report.md","publications\u002F2023\u002Fautomated-metamorphic-relation-generation-with-chatgpt-an-experience-report",{"_path":10796,"_dir":10450,"_draft":7,"_partial":7,"_locale":8,"title":10797,"description":10798,"_hidden":7,"Embedded Tiny Neural Networks authors":10799,"authors_orcid":10801,"year":10455,"doi":10802,"openalex_id":10803,"venue":10804,"abstract_screenshot":21,"keywords":10805,"body":10807,"_type":51,"_id":10823,"_source":53,"_file":10824,"_stem":10825,"_extension":56,"locale":57},"\u002Fpublications\u002F2023\u002Fbehind-the-ear-eeg-based-wearable-driver-drowsiness-detection-system-using-embed","Behind-the-Ear EEG-Based Wearable Driver Drowsiness Detection System Using","Driver drowsiness is a major factor that leads to traffic accidents and loss of life. A popular drowsiness detection (DD) method is based on machine learning (ML) and monitoring electroencephalogram (EEG) signals from the scalp. However, the setup is usually bulky and too obtrusive for use in daily life. In addition, the data processing unit is usually placed in large hardware such as cloud servers and personal computers that receive the EEG signal from wearable sensors wirelessly. This results in a cumbersome system that lacks mobility and suffers high latency and power consumption because of wireless connection. The behind-the-ear (BTE) EEG is a novel approach that promises a more convenient and practical solution than scalp-EEG. Recent advances in tiny ML (TinyML) mean that on-device ML-based driver DD (DDD) could also be realized to avoid the limitations mentioned above. This article presents the design of a novel BTE EEG-based DDD system that uses a wearable headband device and runs built-in neural network (NN) models. The device collects EEG signals from four proposed BTE locations that are then preprocessed. Welch’s method is applied to extract the relative power spectral density (rPSD) ratio of three EEG bands (theta, alpha, and beta). Two NN models multilayer perceptron (MLP) and convolutional NN (CNN) were trained and compared to a support vector machine (SVM) before deployment in the embedded device. Then, a benchmark test was performed to evaluate the on-device performances of these models. The test results established the practicality and feasibility of the proposed system for on-device DDD.",[10800,7380,5667,5665],"Nguyen, Ha-Trung",[21,7382,5670,5669],"https:\u002F\u002Fdoi.org\u002F10.1109\u002Fjsen.2023.3307766","W4386320525","IEEE Sensors Journal",[6973,7386,23,632,6980,37,4242,10806,865],"Neuroscience",{"type":39,"children":10808,"toc":10821},[10809],{"type":42,"tag":43,"props":10810,"children":10811},{},[10812,10814,10819],{"type":47,"value":10813},"Driver drowsiness is a major factor that leads to traffic accidents and loss of life. A popular drowsiness detection (DD) method is based on machine learning (ML) and monitoring electroencephalogram (EEG) signals from the scalp. However, the setup is usually bulky and too obtrusive for use in daily life. In addition, the data processing unit is usually placed in large hardware such as cloud servers and personal computers that receive the EEG signal from wearable sensors wirelessly. This results in a cumbersome system that lacks mobility and suffers high latency and power consumption because of wireless connection. The behind-the-ear (BTE) EEG is a novel approach that promises a more convenient and practical solution than scalp-EEG. Recent advances in tiny ML (TinyML) mean that on-device ML-based driver DD (DDD) could also be realized to avoid the limitations mentioned above. This article presents the design of a novel BTE EEG-based DDD system that uses a wearable headband device and runs built-in neural network (NN) models. The device collects EEG signals from four proposed BTE locations that are then preprocessed. Welch’s method is applied to extract the relative power spectral density (rPSD) ratio of three EEG bands (theta, alpha, and beta). Two NN models ",{"type":42,"tag":809,"props":10815,"children":10816},{},[10817],{"type":47,"value":10818},"multilayer perceptron (MLP) and convolutional NN (CNN)",{"type":47,"value":10820}," were trained and compared to a support vector machine (SVM) before deployment in the embedded device. Then, a benchmark test was performed to evaluate the on-device performances of these models. The test results established the practicality and feasibility of the proposed system for on-device DDD.",{"title":8,"searchDepth":49,"depth":49,"links":10822},[],"content:publications:2023:behind-the-ear-eeg-based-wearable-driver-drowsiness-detection-system-using-embed.md","publications\u002F2023\u002Fbehind-the-ear-eeg-based-wearable-driver-drowsiness-detection-system-using-embed.md","publications\u002F2023\u002Fbehind-the-ear-eeg-based-wearable-driver-drowsiness-detection-system-using-embed",{"_path":10827,"_dir":10450,"_draft":7,"_partial":7,"_locale":8,"title":10828,"description":8,"_hidden":7,"authors":10829,"authors_orcid":10833,"year":10455,"doi":10836,"openalex_id":10837,"venue":10838,"abstract_screenshot":21,"keywords":10839,"body":10847,"_type":51,"_id":10851,"_source":53,"_file":10852,"_stem":10853,"_extension":56,"locale":57},"\u002Fpublications\u002F2023\u002Fbike-sharing-duopoly-competition-under-government-regulation","Bike-sharing duopoly competition under government regulation",[10830,7302,10831,10832,9251],"Wang, Yao","Zheng, Shiyuan","Shang, Wen‐Long",[21,7310,10834,10835,9254],"0000-0003-3864-6416","0000-0002-9162-901X","https:\u002F\u002Fdoi.org\u002F10.1016\u002Fj.apenergy.2023.121121","W4375953021","Applied Energy",[10840,10841,178,6600,8021,10842,10843,3255,10844,10845,36,7631,10846,179,23],"Duopoly","Externality","Social cost","Software deployment","Social Welfare","Sharing economy","Cournot competition",{"type":39,"children":10848,"toc":10849},[],{"title":8,"searchDepth":49,"depth":49,"links":10850},[],"content:publications:2023:bike-sharing-duopoly-competition-under-government-regulation.md","publications\u002F2023\u002Fbike-sharing-duopoly-competition-under-government-regulation.md","publications\u002F2023\u002Fbike-sharing-duopoly-competition-under-government-regulation",{"_path":10855,"_dir":10450,"_draft":7,"_partial":7,"_locale":8,"title":10856,"description":8,"_hidden":7,"improved temporal convolutional network\" authors":10857,"authors_orcid":10860,"year":10455,"doi":10862,"openalex_id":10863,"venue":770,"abstract_screenshot":21,"keywords":10864,"body":10866,"_type":51,"_id":10870,"_source":53,"_file":10871,"_stem":10872,"_extension":56,"locale":57},"\u002Fpublications\u002F2023\u002Fbitcn-drsn-an-effective-software-vulnerability-detection-model-based-on-an-impro","BiTCN_DRSN: An effective software vulnerability detection model based on a",[648,10858,4112,10859,5250,595],"Lin, Wei","Yin, Yemin",[651,10861,4116,21,6434,599],"0000-0002-8643-594X","https:\u002F\u002Fdoi.org\u002F10.1016\u002Fj.jss.2023.111772","W4379793253",[23,1407,5545,6976,37,1405,10865,4093,139,6875,215,4876,332,110],"Residual",{"type":39,"children":10867,"toc":10868},[],{"title":8,"searchDepth":49,"depth":49,"links":10869},[],"content:publications:2023:bitcn-drsn-an-effective-software-vulnerability-detection-model-based-on-an-impro.md","publications\u002F2023\u002Fbitcn-drsn-an-effective-software-vulnerability-detection-model-based-on-an-impro.md","publications\u002F2023\u002Fbitcn-drsn-an-effective-software-vulnerability-detection-model-based-on-an-impro",{"_path":10874,"_dir":10450,"_draft":7,"_partial":7,"_locale":8,"title":10875,"description":10876,"_hidden":7,"authors":10877,"authors_orcid":10878,"year":10455,"doi":10879,"openalex_id":10880,"venue":3543,"abstract_screenshot":10881,"keywords":10882,"body":10883,"_type":51,"_id":10891,"_source":53,"_file":10892,"_stem":10893,"_extension":56,"locale":57},"\u002Fpublications\u002F2023\u002Fchina-must-draw-on-internal-research-strength","China must draw on internal research strength","The domestic pool of talent is deep, but international links are still crucial for maintaining the country’s role in the search for global solutions. The domestic pool of talent is deep, but international links are still crucial for maintaining the country’s role in the search for global solutions.",[65],[70],"https:\u002F\u002Fdoi.org\u002F10.1038\u002Fd41586-023-03445-0","W4388490402","china-must-draw-on-internal-research-strength.png",[282,178,1356,1358,3259],{"type":39,"children":10884,"toc":10889},[10885],{"type":42,"tag":43,"props":10886,"children":10887},{},[10888],{"type":47,"value":10876},{"title":8,"searchDepth":49,"depth":49,"links":10890},[],"content:publications:2023:china-must-draw-on-internal-research-strength.md","publications\u002F2023\u002Fchina-must-draw-on-internal-research-strength.md","publications\u002F2023\u002Fchina-must-draw-on-internal-research-strength",{"_path":10895,"_dir":10450,"_draft":7,"_partial":7,"_locale":8,"title":10896,"description":10897,"_hidden":7,"authors":10898,"authors_orcid":10905,"year":10455,"doi":10910,"openalex_id":10911,"venue":10912,"abstract_screenshot":21,"keywords":10913,"body":10915,"_type":51,"_id":10923,"_source":53,"_file":10924,"_stem":10925,"_extension":56,"locale":57},"\u002Fpublications\u002F2023\u002Fchinese-corporate-fraud-risk-assessment-with-machine-learning","Chinese corporate fraud risk assessment with machine learning","Corporate fraud is becoming a vital concern of Chinese financial industry in recent years. However, manual investigation of certain suspicious companies could result in mass consumption of resources. Aside from financial variables which were widely used in previous research, this paper has included novel features to assess Chinese corporate fraud, such as transfer of shares and Institutional Shareholdings, and these features are proven to be effective. We also present an efficient and accurate framework for corporate fraud detection that could be used as a fraud risk early warning system for financial institutions and regulatory authorities. Five machine learning methods have been implemented in the experiment and are compared using six metrics. Among these methods, XGboost has relatively higher performance overall in comparison to other models. Feature analysis has also been performed to analyze the influences of different groups of features in different models. This result illustrates that the models would achieve the best performance when all features are included, while financial condition has the most important impact among these groups. In addition, since the dataset being used is public, the result is simple for other researchers to reproduce and improve.",[10899,10900,10901,10902,10903,10904,8214,5667],"Lu, Qingyang","Fu, Chuyan","Nan, Kailiang","Fang, Yichu","Xu, Jialue","Liu, Jinyao",[10906,10907,21,10908,10909,21,21,5670],"0009-0005-8005-7182","0000-0001-6621-8043","0000-0002-0895-4074","0000-0003-2107-0916","https:\u002F\u002Fdoi.org\u002F10.1016\u002Fj.iswa.2023.200294","W4388011682","Intelligent Systems with Applications",[6875,10914,178,3546,23,215],"Warning system",{"type":39,"children":10916,"toc":10921},[10917],{"type":42,"tag":43,"props":10918,"children":10919},{},[10920],{"type":47,"value":10897},{"title":8,"searchDepth":49,"depth":49,"links":10922},[],"content:publications:2023:chinese-corporate-fraud-risk-assessment-with-machine-learning.md","publications\u002F2023\u002Fchinese-corporate-fraud-risk-assessment-with-machine-learning.md","publications\u002F2023\u002Fchinese-corporate-fraud-risk-assessment-with-machine-learning",{"_path":10927,"_dir":10450,"_draft":7,"_partial":7,"_locale":8,"title":10928,"description":10929,"_hidden":7,"authors":10930,"authors_orcid":10935,"year":10455,"doi":10940,"openalex_id":10941,"venue":10942,"abstract_screenshot":21,"keywords":10943,"body":10946,"_type":51,"_id":10954,"_source":53,"_file":10955,"_stem":10956,"_extension":56,"locale":57},"\u002Fpublications\u002F2023\u002Fcity-infrastructure-ontologies","City infrastructure ontologies","Sustainable urban infrastructure planning and maintenance require an integrated approach that considers various infrastructure assets (e.g., the ground, roads, and buried pipes) and their inter-linkages as a holistic system. To facilitate the usage of this integrated approach, we propose a model of city infrastructure assets and their interdependencies, providing details on how asset properties and processes affect each other. This model is represented as ontologies in OWL 2 Web Ontology Language Manchester Syntax, which can be read and interpreted by machines automatically. These ontologies cover the classifications, properties and processes of the ground, roads and buried water pipes, as well as some related human activities and natural phenomena (e.g., precipitation). The ontologies not only provide a foundation for integrating various types of infrastructure and environmental data, but also for understanding the potential knock-on effects of asset failures. The ontologies have been utilised in a decision support system for integrated urban inter-asset management.",[4626,4625,4630,4629,4628,10931,4632,10932,10933,10934,4633,4634],"Collins, Richard","Torbaghan, Mehran Eskandari","Curioni, Giulio","Stirling, Ross",[4637,4636,4641,4640,4639,10936,21,10937,10938,10939,21,4643],"0000-0001-5449-8535","0000-0001-6069-6108","0000-0002-9243-5436","0000-0002-0069-6621","https:\u002F\u002Fdoi.org\u002F10.1016\u002Fj.compenvurbsys.2023.101991","W4379875542","Computers Environment and Urban Systems",[244,6019,4647,23,10944,10945,6022,6023,170,178,869,180],"Interdependence","Web Ontology Language",{"type":39,"children":10947,"toc":10952},[10948],{"type":42,"tag":43,"props":10949,"children":10950},{},[10951],{"type":47,"value":10929},{"title":8,"searchDepth":49,"depth":49,"links":10953},[],"content:publications:2023:city-infrastructure-ontologies.md","publications\u002F2023\u002Fcity-infrastructure-ontologies.md","publications\u002F2023\u002Fcity-infrastructure-ontologies",{"_path":10958,"_dir":10450,"_draft":7,"_partial":7,"_locale":8,"title":10959,"description":10960,"_hidden":7,"Communication in Challenging Indoor Environments authors":10961,"authors_orcid":10964,"year":10455,"doi":10965,"openalex_id":10966,"venue":21,"abstract_screenshot":21,"keywords":10967,"body":10973,"_type":51,"_id":10981,"_source":53,"_file":10982,"_stem":10983,"_extension":56,"locale":57},"\u002Fpublications\u002F2023\u002Fcomparative-analysis-of-wireless-transmission-methods-for-firefighting-communica","Comparative Analysis of Wireless Transmission Methods for Firefighting","The demand for firefighting has significantly risen in recent decades, accompanied by increased risks faced by firefighters. Tragic incidents, such as the Shanghai factory fires, have resulted in the loss of over thirty firefighter lives. One of the primary contributing factors is the abrupt breakdown in communication between firefighters inside a building and the commanding officer stationed outside, attributable to the harsh and complex indoor environment. This study aims to conduct a comparative analysis of different widely used wireless transmission methods, including Wi-Fi, Bluetooth Low Energy (BLE), and Long Range (LoRa). The experiments are conducted in a two-room setup, with two brick walls acting as a barrier. A wireless data transmitter is placed in one room, while smoke is generated. A receiver placed at varying distances collects the signal strengths. The findings indicate that LoRa exhibits the least drop in signal strength compared to the other methods. In contrast, BLE shows high signal strength variation for the same distances and is not recommended for firefighting communication purposes. This study provides valuable insights for selecting suitable wireless communication modules, particularly in the design of wearable devices for assessing safety risks faced by firefighters.",[5667,7746,10962,10963,8463,5407],"Xu, Fanqi","Zhu, Lexuan",[5670,8467,21,21,8466,5411],"https:\u002F\u002Fdoi.org\u002F10.1109\u002Ftencon58879.2023.10322361","W4388894597",[8471,5998,10968,23,288,10969,286,10970,10971,180,179,10972,8734,289],"Bluetooth","Fire fighter","Bluetooth Low Energy","Transmitter","Architectural engineering",{"type":39,"children":10974,"toc":10979},[10975],{"type":42,"tag":43,"props":10976,"children":10977},{},[10978],{"type":47,"value":10960},{"title":8,"searchDepth":49,"depth":49,"links":10980},[],"content:publications:2023:comparative-analysis-of-wireless-transmission-methods-for-firefighting-communica.md","publications\u002F2023\u002Fcomparative-analysis-of-wireless-transmission-methods-for-firefighting-communica.md","publications\u002F2023\u002Fcomparative-analysis-of-wireless-transmission-methods-for-firefighting-communica",{"_path":10985,"_dir":10450,"_draft":7,"_partial":7,"_locale":8,"title":10986,"description":8,"_hidden":7,"authors":10987,"authors_orcid":10998,"year":10455,"doi":11001,"openalex_id":11002,"venue":21,"abstract_screenshot":21,"keywords":11003,"body":11004,"_type":51,"_id":11008,"_source":53,"_file":11009,"_stem":11010,"_extension":56,"locale":57},"\u002Fpublications\u002F2023\u002Fcompsac-2023-summary","COMPSAC 2023 Summary",[9752,10988,10989,595,10990,10991,10992,10993,10994,10995,10996,10997],"Teranishi, Yuuichi","Sharmin, Moushumi","Kim, H","Kang, E","Broman, D","Lee, E","Aral, A","Brandic, I","Yu, Q","Avestimehr, A",[9756,10999,11000,599,21,21,21,21,21,21,21,21],"0000-0003-0360-6174","0009-0000-2751-1204","https:\u002F\u002Fdoi.org\u002F10.1109\u002Fcompsac57700.2023.00009","W4385489539",[23],{"type":39,"children":11005,"toc":11006},[],{"title":8,"searchDepth":49,"depth":49,"links":11007},[],"content:publications:2023:compsac-2023-summary.md","publications\u002F2023\u002Fcompsac-2023-summary.md","publications\u002F2023\u002Fcompsac-2023-summary",{"_path":11012,"_dir":10450,"_draft":7,"_partial":7,"_locale":8,"title":11013,"description":11014,"_hidden":7,"authors":11015,"authors_orcid":11016,"year":10455,"doi":11017,"openalex_id":11018,"venue":1055,"abstract_screenshot":21,"keywords":11019,"body":11020,"_type":51,"_id":11028,"_source":53,"_file":11029,"_stem":11030,"_extension":56,"locale":57},"\u002Fpublications\u002F2023\u002Fcontainer-port-truck-dispatching-optimization-using-real2sim-based-deep-reinforc","Container port truck dispatching optimization using Real2Sim based deep reinforcement learning","In marine container terminals, truck dispatching optimization is often considered as the primary focus as it provides crucial synergy between the sea-side operations and yard-side activities and hence can greatly affect the terminal throughput and quay crane utilization. However, many existing studies rely on strong assumptions that often overlook the uncertainties and dynamics innate to real-life applications. In this work, we propose a dynamic truck dispatching system for container ports equipped with the latest IoT technologies. The system is comprised of Real2Sim simulation and a truck dispatch agent, trained through a spatial-attention based deep reinforcement learning module, supported by an expert network. The proposed Real2Sim framework has the ability to model the non-linear complexities and non-deterministic events while our attention-aware deep reinforcement learning module is capable of making full use of both historical and real-time port data to learn a high-quality truck dispatching policy under uncertainties. Extensive experiments show our proposed method has good generalization and achieves the state-of-the-art results on the problems derived from real-life data of a large international port.",[7198,709,12,319],[7202,711,15,322],"https:\u002F\u002Fdoi.org\u002F10.1016\u002Fj.ejor.2023.11.038","W4389100928",[5304,1189,746,23,1192,5547,3202,24,3203,37,179,752,288,5998],{"type":39,"children":11021,"toc":11026},[11022],{"type":42,"tag":43,"props":11023,"children":11024},{},[11025],{"type":47,"value":11014},{"title":8,"searchDepth":49,"depth":49,"links":11027},[],"content:publications:2023:container-port-truck-dispatching-optimization-using-real2sim-based-deep-reinforc.md","publications\u002F2023\u002Fcontainer-port-truck-dispatching-optimization-using-real2sim-based-deep-reinforc.md","publications\u002F2023\u002Fcontainer-port-truck-dispatching-optimization-using-real2sim-based-deep-reinforc",{"_path":11032,"_dir":10450,"_draft":7,"_partial":7,"_locale":8,"title":11033,"description":11034,"_hidden":7,"war\" authors":11035,"authors_orcid":11038,"year":10455,"doi":11040,"openalex_id":11041,"venue":10364,"abstract_screenshot":21,"keywords":11042,"body":11046,"_type":51,"_id":11054,"_source":53,"_file":11055,"_stem":11056,"_extension":56,"locale":57},"\u002Fpublications\u002F2023\u002Fcorporate-culture-and-firm-resilience-in-china-evidence-from-the-sino-us-trade-w","Corporate culture and firm resilience in China: Evidence from the Sino-US trad","Prior literature shows that corporate culture matters for firm performance and enhance corporate resilience in crises. We construct a text-based measure of corporate culture for Chinese listed firms and study whether and how strong corporate culture improves corporate resilience during the Sino-US trade war. Empirical analyses suggest that a strong corporate culture mitigates the deteriorating stock returns due to the trade war exposure through two potential influencing mechanisms, enhancing operating performance and mitigating financial constraint. Results also indicate that strong culture works more effectively for privately owned enterprises (POEs) than their state-owned peers, and individual cultures of innovation, hardworking, teamwork, and quality have material effects on stock performance of the POEs. The evidence pinpoints that strong corporate culture helps insulate Chinese private firms more from external shocks and achieve a more sustainable growth.",[11036,268,11037],"Cheng, Sirui","Wang, Qingfeng",[21,272,11039],"0000-0003-2131-7579","https:\u002F\u002Fdoi.org\u002F10.1016\u002Fj.pacfin.2023.102039","W4366814704",[11043,282,178,11044,555,833,3333,5150,285,11045,36,429,3746,1358,133],"Organizational culture","Psychological resilience","Trade war",{"type":39,"children":11047,"toc":11052},[11048],{"type":42,"tag":43,"props":11049,"children":11050},{},[11051],{"type":47,"value":11034},{"title":8,"searchDepth":49,"depth":49,"links":11053},[],"content:publications:2023:corporate-culture-and-firm-resilience-in-china-evidence-from-the-sino-us-trade-w.md","publications\u002F2023\u002Fcorporate-culture-and-firm-resilience-in-china-evidence-from-the-sino-us-trade-w.md","publications\u002F2023\u002Fcorporate-culture-and-firm-resilience-in-china-evidence-from-the-sino-us-trade-w",{"_path":11058,"_dir":10450,"_draft":7,"_partial":7,"_locale":8,"title":11059,"description":11060,"_hidden":7,"for Wireless-Powered Networks” [Sep 15 2022 18153-18163] authors":11061,"authors_orcid":11062,"year":10455,"doi":11063,"openalex_id":11064,"venue":9425,"abstract_screenshot":21,"keywords":11065,"body":11069,"_type":51,"_id":11077,"_source":53,"_file":11078,"_stem":11079,"_extension":56,"locale":57},"\u002Fpublications\u002F2023\u002Fcorrections-to-energy-efficient-multicodebook-based-backscatter-communications-f","Corrections to “Energy-Efficient Multicodebook-Based Backscatter Communications","The detail of the function PEO(.) in Section IV-B for this article was not available at the time of publication. It appears in Section IV-B as follows.",[9412,9413,9414,9415,9416],[9418,9419,9420,9421,9422],"https:\u002F\u002Fdoi.org\u002F10.1109\u002Fjiot.2022.3233167","W4319300077",[9428,23,5998,288,11066,11067,251,6803,100,928,6194,11068,3597,179],"Section (typography)","Special section","Engineering physics",{"type":39,"children":11070,"toc":11075},[11071],{"type":42,"tag":43,"props":11072,"children":11073},{},[11074],{"type":47,"value":11060},{"title":8,"searchDepth":49,"depth":49,"links":11076},[],"content:publications:2023:corrections-to-energy-efficient-multicodebook-based-backscatter-communications-f.md","publications\u002F2023\u002Fcorrections-to-energy-efficient-multicodebook-based-backscatter-communications-f.md","publications\u002F2023\u002Fcorrections-to-energy-efficient-multicodebook-based-backscatter-communications-f",{"_path":11081,"_dir":10450,"_draft":7,"_partial":7,"_locale":8,"title":11082,"description":11083,"_hidden":7,"Maximization in SRAM-Based FPGAs authors":11084,"authors_orcid":11086,"year":10455,"doi":11089,"openalex_id":11090,"venue":8774,"abstract_screenshot":21,"keywords":11091,"body":11094,"_type":51,"_id":11102,"_source":53,"_file":11103,"_stem":11104,"_extension":56,"locale":57},"\u002Fpublications\u002F2023\u002Fcriticality-aware-negotiation-driven-scrubbing-scheduling-for-reliability-maximi","Criticality-Aware Negotiation-Driven Scrubbing Scheduling for Reliability","Memory scrubbing is a resource-efficient technique to ensure the high reliability of SRAM-based FPGAs by refreshing the configuration memory just before its execution. To maximize reliability, a scrubbing scheduling algorithm is expected to scrub as many tasks as possible. Unfortunately, contemporary scheduling algorithms either suboptimally handle scrubbing conflicts under bursty requests from multiple user tasks or discriminate against low-criticality tasks by giving them very low scrubbing opportunities. Besides, exploring the architectural support for scrubbing problems may bring considerable potential for reliability improvements. However, this direction of scheduling-architecture co-optimization has not been well studied so far. In this article, we propose a negotiation-based dynamic scrubbing framework, which addresses the above-mentioned issues in three phases: 1) we propose a negotiation-driven scrubbing scheduling algorithm, which temporarily allows and iteratively reduces the conflicts of scrubbing tasks in order to accommodate more scrubbing tasks to be scheduled; 2) we develop a logistic probability model to prevent scheduling starvation of a set of mix-criticality tasks by dynamically legalizing conflicting ones, considering both the criticality and schedulability of each task; and 3) we develop a dynamic voltage\u002Ffrequency scaling-based multi-ICAPs allocation algorithm to co-optimize with FPGA architectural features for reliability maximization. Compared to the state-of-the-art, experimental results show that our work achieves up to 31.46% improvement in terms of reliability for contemporary SRAM-based FPGAs.",[6184,5532,11085,5534],"Li, Lin",[11087,5537,11088,5539],"0000-0002-2953-9742","0000-0002-6804-702X","https:\u002F\u002Fdoi.org\u002F10.1109\u002Ftcad.2023.3257710","W4327522392",[6655,6657,5543,23,6629,450,11092,6658,661,4242,6632,11093,5550,1113,179,31,33,34],"Criticality","Negotiation",{"type":39,"children":11095,"toc":11100},[11096],{"type":42,"tag":43,"props":11097,"children":11098},{},[11099],{"type":47,"value":11083},{"title":8,"searchDepth":49,"depth":49,"links":11101},[],"content:publications:2023:criticality-aware-negotiation-driven-scrubbing-scheduling-for-reliability-maximi.md","publications\u002F2023\u002Fcriticality-aware-negotiation-driven-scrubbing-scheduling-for-reliability-maximi.md","publications\u002F2023\u002Fcriticality-aware-negotiation-driven-scrubbing-scheduling-for-reliability-maximi",{"_path":11106,"_dir":10450,"_draft":7,"_partial":7,"_locale":8,"title":11107,"description":11108,"_hidden":7,"authors":11109,"authors_orcid":11112,"year":10455,"doi":11115,"openalex_id":11116,"venue":21,"abstract_screenshot":21,"keywords":11117,"body":11119,"_type":51,"_id":11127,"_source":53,"_file":11128,"_stem":11129,"_extension":56,"locale":57},"\u002Fpublications\u002F2023\u002Fcross-modal-short-video-recommendation","Cross-modal Short Video Recommendation","With the rapid development of short video platforms, providing accurate short video recommendations for users has become increasingly important. However, due to the multimodal nature of short videos, effectively utilizing this information to improve recommendation quality remains challenging. This paper proposes a cross-modal short video recommendation method that comprehensively utilizes text, image, and audio information. The method involves multimodal processing of short videos, including segmentation of text, image, and audio, and multimodal alignment. It extracts multimodal features of short videos and fuses these features into a unified short video representation. Recommendations are made based on the similarity between user profiles created from their text browsing history and the short video representations. Finally, a cultural short video recommendation experiment based on users’ text reading history is presented. Experimental results show that the cross-modal feature-based recommendation can effectively improve the personalized recommendation accuracy for users in other modalities, especially for cold start users. The proposed method outperforms existing methods in terms of accuracy, recall, and other metrics.",[6288,11110,11111,268],"Xu, Yuanwei","Yang, Miao",[21,11113,11114,272],"0000-0003-3034-7219","0000-0002-1231-3974","https:\u002F\u002Fdoi.org\u002F10.1109\u002Fmvipit60427.2023.00025","W4400350748",[11118,23],"Modal",{"type":39,"children":11120,"toc":11125},[11121],{"type":42,"tag":43,"props":11122,"children":11123},{},[11124],{"type":47,"value":11108},{"title":8,"searchDepth":49,"depth":49,"links":11126},[],"content:publications:2023:cross-modal-short-video-recommendation.md","publications\u002F2023\u002Fcross-modal-short-video-recommendation.md","publications\u002F2023\u002Fcross-modal-short-video-recommendation",{"_path":11131,"_dir":10450,"_draft":7,"_partial":7,"_locale":8,"title":11132,"description":8,"_hidden":7,"authors":11133,"authors_orcid":11134,"year":10455,"doi":11135,"openalex_id":11136,"venue":11137,"abstract_screenshot":21,"keywords":11138,"body":11139,"_type":51,"_id":11143,"_source":53,"_file":11144,"_stem":11145,"_extension":56,"locale":57},"\u002Fpublications\u002F2023\u002Fdata-augmentation-by-morphological-mixup-for-solving-raven-s-progressive-matrice","Data augmentation by morphological mixup for solving Raven’s progressive matrices",[7409,6111,12],[7415,6113,15],"https:\u002F\u002Fdoi.org\u002F10.1007\u002Fs00371-023-02930-x","W4383619072","The Visual Computer",[7676,7677,23,37,6144,215,8165,181,4876,632,7679,34],{"type":39,"children":11140,"toc":11141},[],{"title":8,"searchDepth":49,"depth":49,"links":11142},[],"content:publications:2023:data-augmentation-by-morphological-mixup-for-solving-raven-s-progressive-matrice.md","publications\u002F2023\u002Fdata-augmentation-by-morphological-mixup-for-solving-raven-s-progressive-matrice.md","publications\u002F2023\u002Fdata-augmentation-by-morphological-mixup-for-solving-raven-s-progressive-matrice",{"_path":11147,"_dir":10450,"_draft":7,"_partial":7,"_locale":8,"title":11148,"description":11149,"_hidden":7,"Dependence in Holographic Video Decoder authors":11150,"authors_orcid":11155,"year":10455,"doi":11160,"openalex_id":11161,"venue":21,"abstract_screenshot":21,"keywords":11162,"body":11171,"_type":51,"_id":11345,"_source":53,"_file":11346,"_stem":11347,"_extension":56,"locale":57},"\u002Fpublications\u002F2023\u002Fdata-partition-optimization-for-high-energy-efficiency-by-decoupling-local-depen","Data Partition Optimization for High Energy Efficiency by Decoupling Local","Holography has attracted considerable attention from researchers due to its ability to store and recreate the wavefront emanating from a three-dimensional object. However, holographic video requires enormous resolution (128k×128k)(128 k \\times 128 k)(128k×128k) at the same frame rates(60fps) as normal video to achieve acceptable visual effects. Data compression is thus essential for its storage\u002Ftransmission. When implementing its decompression pipeline on hardware for mobile scenarios, data dependency and energy consumption must be handled carefully. In this work, we present a novel design framework and a data partition optimization approach to optimize the overall energy consumption by tackling local dependence in the motion compensation module for holographic video codec, and exploring the design space of data partition layout. First, we propose a local data dependency propagation (LDDP) method that transforms one holographic frame with strong local dependence into multiple mutually independent virtual blocks without local dependence at all. Second, we formulate a model for the data partitioning problem, allowing us to analyze and optimize energy consumption by adjusting the layout of data partitions. Third, we provide a heuristic and efficient solution to the formulated model taking advantage of the target application scenarios. Experiment results in various scenarios show that our proposed optimization method achieves 2.94 ~ 3.91 ×\\times× energy efficiency and 46.37% ~ 63.63% area efficiency compared to baseline approaches.",[5533,11151,11152,6618,5532,11153,11154,5534],"Luo, Jianwen","Blinder, David","Schelkens, Peter","Catthoor, Francky",[5538,11156,11157,6622,5537,11158,11159,5539],"0000-0001-9215-5568","0000-0001-7054-0203","0000-0003-0908-1655","0000-0002-3599-8515","https:\u002F\u002Fdoi.org\u002F10.1109\u002Ficecs58634.2023.10382825","W4390693329",[23,920,11163,11164,11165,5544,11166,3203,11167,11168,11169,5551,5550,7753,332,4391,11170],"Inter frame","Motion compensation","Codec","Pipeline (software)","Data compression","Holography","Frame rate","Reference frame",{"type":39,"children":11172,"toc":11343},[11173],{"type":42,"tag":43,"props":11174,"children":11175},{},[11176,11178,11295,11297,11341],{"type":47,"value":11177},"Holography has attracted considerable attention from researchers due to its ability to store and recreate the wavefront emanating from a three-dimensional object. However, holographic video requires enormous resolution ",{"type":42,"tag":809,"props":11179,"children":11181},{"className":11180},[1455],[11182,11230],{"type":42,"tag":809,"props":11183,"children":11185},{"className":11184},[1460],[11186],{"type":42,"tag":1463,"props":11187,"children":11188},{"xmlns":1465},[11189],{"type":42,"tag":1468,"props":11190,"children":11191},{},[11192,11225],{"type":42,"tag":1472,"props":11193,"children":11194},{},[11195,11199,11204,11209,11213,11217,11221],{"type":42,"tag":1482,"props":11196,"children":11197},{"stretchy":1598},[11198],{"type":47,"value":1601},{"type":42,"tag":1476,"props":11200,"children":11201},{},[11202],{"type":47,"value":11203},"128",{"type":42,"tag":1494,"props":11205,"children":11206},{},[11207],{"type":47,"value":11208},"k",{"type":42,"tag":1482,"props":11210,"children":11211},{},[11212],{"type":47,"value":8548},{"type":42,"tag":1476,"props":11214,"children":11215},{},[11216],{"type":47,"value":11203},{"type":42,"tag":1494,"props":11218,"children":11219},{},[11220],{"type":47,"value":11208},{"type":42,"tag":1482,"props":11222,"children":11223},{"stretchy":1598},[11224],{"type":47,"value":1639},{"type":42,"tag":2265,"props":11226,"children":11227},{"encoding":2267},[11228],{"type":47,"value":11229},"(128 k \\times 128 k)",{"type":42,"tag":809,"props":11231,"children":11233},{"className":11232,"ariaHidden":1484},[2274],[11234,11272],{"type":42,"tag":809,"props":11235,"children":11237},{"className":11236},[2279],[11238,11242,11247,11252,11258,11262,11268],{"type":42,"tag":809,"props":11239,"children":11241},{"className":11240,"style":2285},[2284],[],{"type":42,"tag":809,"props":11243,"children":11245},{"className":11244},[2416],[11246],{"type":47,"value":1601},{"type":42,"tag":809,"props":11248,"children":11250},{"className":11249},[2290],[11251],{"type":47,"value":11203},{"type":42,"tag":809,"props":11253,"children":11256},{"className":11254,"style":11255},[2290,2313],"margin-right:0.0315em;",[11257],{"type":47,"value":11208},{"type":42,"tag":809,"props":11259,"children":11261},{"className":11260,"style":9592},[2302],[],{"type":42,"tag":809,"props":11263,"children":11266},{"className":11264},[11265],"mbin",[11267],{"type":47,"value":8548},{"type":42,"tag":809,"props":11269,"children":11271},{"className":11270,"style":9592},[2302],[],{"type":42,"tag":809,"props":11273,"children":11275},{"className":11274},[2279],[11276,11280,11285,11290],{"type":42,"tag":809,"props":11277,"children":11279},{"className":11278,"style":2285},[2284],[],{"type":42,"tag":809,"props":11281,"children":11283},{"className":11282},[2290],[11284],{"type":47,"value":11203},{"type":42,"tag":809,"props":11286,"children":11288},{"className":11287,"style":11255},[2290,2313],[11289],{"type":47,"value":11208},{"type":42,"tag":809,"props":11291,"children":11293},{"className":11292},[2467],[11294],{"type":47,"value":1639},{"type":47,"value":11296}," at the same frame rates(60fps) as normal video to achieve acceptable visual effects. Data compression is thus essential for its storage\u002Ftransmission. When implementing its decompression pipeline on hardware for mobile scenarios, data dependency and energy consumption must be handled carefully. In this work, we present a novel design framework and a data partition optimization approach to optimize the overall energy consumption by tackling local dependence in the motion compensation module for holographic video codec, and exploring the design space of data partition layout. First, we propose a local data dependency propagation (LDDP) method that transforms one holographic frame with strong local dependence into multiple mutually independent virtual blocks without local dependence at all. Second, we formulate a model for the data partitioning problem, allowing us to analyze and optimize energy consumption by adjusting the layout of data partitions. Third, we provide a heuristic and efficient solution to the formulated model taking advantage of the target application scenarios. Experiment results in various scenarios show that our proposed optimization method achieves 2.94 ~ 3.91 ",{"type":42,"tag":809,"props":11298,"children":11300},{"className":11299},[1455],[11301,11323],{"type":42,"tag":809,"props":11302,"children":11304},{"className":11303},[1460],[11305],{"type":42,"tag":1463,"props":11306,"children":11307},{"xmlns":1465},[11308],{"type":42,"tag":1468,"props":11309,"children":11310},{},[11311,11318],{"type":42,"tag":1472,"props":11312,"children":11313},{},[11314],{"type":42,"tag":1482,"props":11315,"children":11316},{},[11317],{"type":47,"value":8548},{"type":42,"tag":2265,"props":11319,"children":11320},{"encoding":2267},[11321],{"type":47,"value":11322},"\\times",{"type":42,"tag":809,"props":11324,"children":11326},{"className":11325,"ariaHidden":1484},[2274],[11327],{"type":42,"tag":809,"props":11328,"children":11330},{"className":11329},[2279],[11331,11336],{"type":42,"tag":809,"props":11332,"children":11335},{"className":11333,"style":11334},[2284],"height:0.6667em;vertical-align:-0.0833em;",[],{"type":42,"tag":809,"props":11337,"children":11339},{"className":11338},[2290],[11340],{"type":47,"value":8548},{"type":47,"value":11342}," energy efficiency and 46.37% ~ 63.63% area efficiency compared to baseline approaches.",{"title":8,"searchDepth":49,"depth":49,"links":11344},[],"content:publications:2023:data-partition-optimization-for-high-energy-efficiency-by-decoupling-local-depen.md","publications\u002F2023\u002Fdata-partition-optimization-for-high-energy-efficiency-by-decoupling-local-depen.md","publications\u002F2023\u002Fdata-partition-optimization-for-high-energy-efficiency-by-decoupling-local-depen",{"_path":11349,"_dir":10450,"_draft":7,"_partial":7,"_locale":8,"title":11350,"description":8,"_hidden":7,"authors":11351,"authors_orcid":11353,"year":10455,"doi":11355,"openalex_id":11356,"venue":11357,"abstract_screenshot":21,"keywords":11358,"body":11362,"_type":51,"_id":11366,"_source":53,"_file":11367,"_stem":11368,"_extension":56,"locale":57},"\u002Fpublications\u002F2023\u002Fdeep-learning-based-rgb-thermal-image-denoising-review-and-applications","Deep learning-based RGB-thermal image denoising: review and applications",[11352,5667,5407,10031,5665],"Yu, Yuan",[11354,5670,5411,21,5669],"0000-0001-7087-9223","https:\u002F\u002Fdoi.org\u002F10.1007\u002Fs11042-023-15916-7","W4382560863","Multimedia Tools and Applications",[23,37,11359,7754,4391,209,4093,11360,6976,4876,4004,7445,11361],"Noise reduction","Video denoising","Video tracking",{"type":39,"children":11363,"toc":11364},[],{"title":8,"searchDepth":49,"depth":49,"links":11365},[],"content:publications:2023:deep-learning-based-rgb-thermal-image-denoising-review-and-applications.md","publications\u002F2023\u002Fdeep-learning-based-rgb-thermal-image-denoising-review-and-applications.md","publications\u002F2023\u002Fdeep-learning-based-rgb-thermal-image-denoising-review-and-applications",{"_path":11370,"_dir":10450,"_draft":7,"_partial":7,"_locale":8,"title":11371,"description":11372,"_hidden":7,"Study\" authors":11373,"authors_orcid":11375,"year":10455,"doi":11377,"openalex_id":11378,"venue":3384,"abstract_screenshot":21,"keywords":11379,"body":11380,"_type":51,"_id":11388,"_source":53,"_file":11389,"_stem":11390,"_extension":56,"locale":57},"\u002Fpublications\u002F2023\u002Fdeep-learning-models-for-stress-analysis-in-university-students-a-sudoku-based-s","Deep Learning Models for Stress Analysis in University Students: A Sudoku-Base","Due to the phenomenon of \"involution\" in China, the current generation of college and university students are experiencing escalating levels of stress, both academically and within their families. Extensive research has shown a strong correlation between heightened stress levels and overall well-being decline. Therefore, monitoring students' stress levels is crucial for improving their well-being in educational institutions and at home. Previous studies have primarily focused on recognizing emotions and detecting stress using physiological signals like ECG and EEG. However, these studies often relied on video clips to induce various emotional states, which may not be suitable for university students who already face additional stress to excel academically. In this study, a series of experiments were conducted to evaluate students' stress levels by engaging them in playing Sudoku games under different distracting conditions. The collected physiological signals, including PPG, ECG, and EEG, were analyzed using enhanced models such as LRCN and self-supervised CNN to assess stress levels. The outcomes were compared with participants' self-reported stress levels after the experiments. The findings demonstrate that the enhanced models presented in this study exhibit a high level of proficiency in assessing stress levels. Notably, when subjects were presented with Sudoku-solving tasks accompanied by noisy or discordant audio, the models achieved an impressive accuracy rate of 95.13% and an F1-score of 93.72%. Additionally, when subjects engaged in Sudoku-solving activities with another individual monitoring the process, the models achieved a commendable accuracy rate of 97.76% and an F1-score of 96.67%. Finally, under comforting conditions, the models achieved an exceptional accuracy rate of 98.78% with an F1-score of 95.39%.",[11374,5667],"Chen, Qicheng",[11376,5670],"0000-0003-0940-3394","https:\u002F\u002Fdoi.org\u002F10.3390\u002Fs23136099","W4382982456",[5676,37,23,866,215,865],{"type":39,"children":11381,"toc":11386},[11382],{"type":42,"tag":43,"props":11383,"children":11384},{},[11385],{"type":47,"value":11372},{"title":8,"searchDepth":49,"depth":49,"links":11387},[],"content:publications:2023:deep-learning-models-for-stress-analysis-in-university-students-a-sudoku-based-s.md","publications\u002F2023\u002Fdeep-learning-models-for-stress-analysis-in-university-students-a-sudoku-based-s.md","publications\u002F2023\u002Fdeep-learning-models-for-stress-analysis-in-university-students-a-sudoku-based-s",{"_path":11392,"_dir":10450,"_draft":7,"_partial":7,"_locale":8,"title":11393,"description":11394,"_hidden":7,"authors":11395,"authors_orcid":11397,"year":10455,"doi":11400,"openalex_id":11401,"venue":21,"abstract_screenshot":21,"keywords":11402,"body":11404,"_type":51,"_id":11412,"_source":53,"_file":11413,"_stem":11414,"_extension":56,"locale":57},"\u002Fpublications\u002F2023\u002Fdpis-blockchain-makes-personal-information-safer","DPIS: Blockchain Makes Personal Information Safer","This paper provides an in-depth analysis of the current state of personal information storage and usage, as well as the existing issues in this domain. It proposes an architecture for building a decentralized, self-organizing, and scalable personal information service system. By improving the organization of the blockchain and constructing a circular access structure, the storage and usage of personal information leverage blockchain technology and cryptographic techniques to enhance the system’s availability and reliability. The article elaborates on the various components of the system and their operational mechanisms, as well as the process for personal information query and authorization for use. The implementation and benchmarking results show the proposed architecture has significant performance advantage comparison with other main stream blockchain for safe date exchange. The proposed architecture balances the use of personal information with security protection, offering a standardized, secure, and convenient approach for personal information usage.",[10108,6288,11396,268],"Zhang, Zhiyu",[11398,21,11399,272],"0000-0002-4201-3892","0000-0001-7318-0717","https:\u002F\u002Fdoi.org\u002F10.1109\u002Ficbctis59921.2023.00013","W4386208015",[5381,11403,3494,23,180,3493],"SAFER",{"type":39,"children":11405,"toc":11410},[11406],{"type":42,"tag":43,"props":11407,"children":11408},{},[11409],{"type":47,"value":11394},{"title":8,"searchDepth":49,"depth":49,"links":11411},[],"content:publications:2023:dpis-blockchain-makes-personal-information-safer.md","publications\u002F2023\u002Fdpis-blockchain-makes-personal-information-safer.md","publications\u002F2023\u002Fdpis-blockchain-makes-personal-information-safer",{"_path":11416,"_dir":10450,"_draft":7,"_partial":7,"_locale":8,"title":11417,"description":11418,"_hidden":7,"Performance authors":11419,"authors_orcid":11426,"year":10455,"doi":11432,"openalex_id":11433,"venue":21,"abstract_screenshot":21,"keywords":11434,"body":11437,"_type":51,"_id":11445,"_source":53,"_file":11446,"_stem":11447,"_extension":56,"locale":57},"\u002Fpublications\u002F2023\u002Feffects-of-augmented-reality-gamification-on-students-intrinsic-motivation-and-p","Effects of Augmented Reality Gamification on Students’ Intrinsic Motivation and","University of Nottingham Ningbo China (UNNC) has been investigating the use of an augmented-reality (AR) educational game to aid in the teaching of Design for Manufacturing and Assembly (DfMA) theories in design and engineering education (DEE). DfMA mastery is critical, as it allows students to create products that are feasible for mass production; it increases material optimization, shortens manufacturing times, and elevates overall quality. However, feedback from students and published research indicates that the topic is complex and underappreciated. Utilizing AR and gamification (GF) is relatively novel in this context, but it has the potential to redefine the topic by giving each student an enhanced learning experience that is fun, engaging, visually appealing, and cognitively stimulating. Our game was developed by a Students-as-Partners (SaP) team at UNNC and combines a tangible puzzle with an AR interface, encouraging collaboration, cooperation, and reflective practices. This research focuses on undergraduate DDE students and aims to understand students’ perceptions of AR educational games and their influence on students’ intrinsic motivation and performance. The results of this study inform the deployment of AR technology in classroom settings, as well as the instructional design of AR and GF learning experiences.",[7077,7078,595,7079,11420,11421,11422,11423,11424,11425],"Li, Bingze","Sun, Linjing","Wang, Zhichao","Yu, Wanling","Zhang, Ruiqi","Zheng, Yaxin",[7081,7082,599,7083,11427,11428,11429,21,11430,11431],"0000-0001-8165-9947","0009-0009-6592-5921","0000-0003-0755-480X","0000-0002-5517-6789","0009-0005-9212-5648","https:\u002F\u002Fdoi.org\u002F10.1109\u002Ftale56641.2023.10398240","W4391266206",[11435,4387,23,868,11436,4390,865,870,1358],"Intrinsic motivation","Self-determination theory",{"type":39,"children":11438,"toc":11443},[11439],{"type":42,"tag":43,"props":11440,"children":11441},{},[11442],{"type":47,"value":11418},{"title":8,"searchDepth":49,"depth":49,"links":11444},[],"content:publications:2023:effects-of-augmented-reality-gamification-on-students-intrinsic-motivation-and-p.md","publications\u002F2023\u002Feffects-of-augmented-reality-gamification-on-students-intrinsic-motivation-and-p.md","publications\u002F2023\u002Feffects-of-augmented-reality-gamification-on-students-intrinsic-motivation-and-p",{"_path":11449,"_dir":10450,"_draft":7,"_partial":7,"_locale":8,"title":11450,"description":8,"_hidden":7,"convolutional neural network in combination of generative adversarial network under small dataset authors":11451,"authors_orcid":11457,"year":10455,"doi":11463,"openalex_id":11464,"venue":11465,"abstract_screenshot":21,"keywords":11466,"body":11471,"_type":51,"_id":11475,"_source":53,"_file":11476,"_stem":11477,"_extension":56,"locale":57},"\u002Fpublications\u002F2023\u002Fefficient-fault-diagnosis-approach-for-solar-photovoltaic-array-using-a-convolut","Efficient fault diagnosis approach for solar photovoltaic array using a",[10611,11452,11453,8931,10612,11454,11455,11456],"Lin, Yaohai","Lin, Peijie","Cheng, Shuying","Chen, Zhicong","Wu, Lijun",[10618,11458,11459,8937,10619,11460,11461,11462],"0000-0002-1654-1130","0000-0001-7990-5926","0000-0001-5544-9794","0000-0002-3471-6395","0000-0003-0468-3294","https:\u002F\u002Fdoi.org\u002F10.1016\u002Fj.solener.2022.12.037","W4323321983","Solar Energy",[11467,23,11468,7281,5545,632,3175,37,11469,11470,4876,6976,179,288,928,4094],"Photovoltaic system","Discriminator","Generative adversarial network","Grid",{"type":39,"children":11472,"toc":11473},[],{"title":8,"searchDepth":49,"depth":49,"links":11474},[],"content:publications:2023:efficient-fault-diagnosis-approach-for-solar-photovoltaic-array-using-a-convolut.md","publications\u002F2023\u002Fefficient-fault-diagnosis-approach-for-solar-photovoltaic-array-using-a-convolut.md","publications\u002F2023\u002Fefficient-fault-diagnosis-approach-for-solar-photovoltaic-array-using-a-convolut",{"_path":11479,"_dir":10450,"_draft":7,"_partial":7,"_locale":8,"title":11480,"description":8,"_hidden":7,"authors":11481,"authors_orcid":11486,"year":10455,"doi":11491,"openalex_id":11492,"venue":687,"abstract_screenshot":21,"keywords":11493,"body":11496,"_type":51,"_id":11500,"_source":53,"_file":11501,"_stem":11502,"_extension":56,"locale":57},"\u002Fpublications\u002F2023\u002Felongated-physiological-structure-segmentation-via-spatial-and-scale-uncertainty","Elongated Physiological Structure Segmentation via Spatial and Scale Uncertainty-Aware Network",[11482,11483,11484,595,12,11485,8406],"Zhang, Yinglin","Xi, Ruiling","Fu, Huazhu","Higashita, Risa",[11487,11488,11489,599,15,11490,8409],"0000-0002-3126-8785","0000-0002-4421-4022","0000-0002-9702-5524","0000-0002-8160-2841","https:\u002F\u002Fdoi.org\u002F10.1007\u002F978-3-031-43901-8_31","W4387211311",[23,9090,37,7207,4265,11494,11495,6827,4876,215,4391,181,4051],"Uncertainty quantification","Image segmentation",{"type":39,"children":11497,"toc":11498},[],{"title":8,"searchDepth":49,"depth":49,"links":11499},[],"content:publications:2023:elongated-physiological-structure-segmentation-via-spatial-and-scale-uncertainty.md","publications\u002F2023\u002Felongated-physiological-structure-segmentation-via-spatial-and-scale-uncertainty.md","publications\u002F2023\u002Felongated-physiological-structure-segmentation-via-spatial-and-scale-uncertainty",{"_path":11504,"_dir":10450,"_draft":7,"_partial":7,"_locale":8,"title":11505,"description":8,"_hidden":7,"authors":11506,"authors_orcid":11508,"year":10455,"doi":11510,"openalex_id":11511,"venue":74,"abstract_screenshot":21,"keywords":11512,"body":11513,"_type":51,"_id":11517,"_source":53,"_file":11518,"_stem":11519,"_extension":56,"locale":57},"\u002Fpublications\u002F2023\u002Fenhancing-container-port-traffic-simulation-by-data-driven-learning-based-method","Enhancing Container Port Traffic Simulation by Data-Driven Learning-Based Method with Sparse Data",[5989,319,11507,908,12],"Dong, Jing",[5991,322,11509,913,15],"0000-0002-2763-7832","https:\u002F\u002Fdoi.org\u002F10.2139\u002Fssrn.4581291","W4386987808",[1189,1192,23,179,928],{"type":39,"children":11514,"toc":11515},[],{"title":8,"searchDepth":49,"depth":49,"links":11516},[],"content:publications:2023:enhancing-container-port-traffic-simulation-by-data-driven-learning-based-method.md","publications\u002F2023\u002Fenhancing-container-port-traffic-simulation-by-data-driven-learning-based-method.md","publications\u002F2023\u002Fenhancing-container-port-traffic-simulation-by-data-driven-learning-based-method",{"_path":11521,"_dir":10450,"_draft":7,"_partial":7,"_locale":8,"title":11522,"description":11523,"_hidden":7,"Virtual Reality-based Digital Game-Based Learning authors":11524,"authors_orcid":11527,"year":10455,"doi":11529,"openalex_id":11530,"venue":21,"abstract_screenshot":21,"keywords":11531,"body":11534,"_type":51,"_id":11542,"_source":53,"_file":11543,"_stem":11544,"_extension":56,"locale":57},"\u002Fpublications\u002F2023\u002Fenhancing-critical-thinking-and-engagement-through-puzzle-box-integration-in-vir","Enhancing Critical Thinking and Engagement through Puzzle Box Integration in","Conventional in-person teaching methods often restrict students’ critical thinking capabilities as they adhere to rigid instructions for information acquisition. The COVID-19 pandemic has accelerated the need to explore innovative educational approaches, leading to a shift towards online education. This study focuses on digital game-based learning (DGBL), which leverages the immersive nature of games to enhance the digital learning experience. The research investigates the integration of puzzle boxes, a gamification strategy, within a virtual reality-based educational game designed for university students. The study aims to explore the design of DGBL using interconnected puzzles to develop cognitive abilities, assess the impact of puzzle boxes on learning experiences, and analyze the interactive design aspects of puzzles and puzzle boxes. Participant feedback revealed that although the puzzles presented a challenge, participants exhibited high motivation to engage with the game, perceiving it as engaging, creative, and innovative. The study highlights the potential of puzzle boxes in fostering reasoning and analytical skills, expanding the learning demands, and enhancing the overall learning experience. These findings contribute to the growing body of research on DGBL and offer valuable insights for educators and instructional designers seeking to incorporate interactive and immersive elements into their teaching methodologies.",[5667,11525,11526],"Tang, Huimin","Fang, Fei",[5670,21,11528],"0000-0003-2256-8329","https:\u002F\u002Fdoi.org\u002F10.1109\u002Ftale56641.2023.10398330","W4391266266",[4390,23,868,11532,11533,4387,867,866,865],"Critical thinking","Mixed reality",{"type":39,"children":11535,"toc":11540},[11536],{"type":42,"tag":43,"props":11537,"children":11538},{},[11539],{"type":47,"value":11523},{"title":8,"searchDepth":49,"depth":49,"links":11541},[],"content:publications:2023:enhancing-critical-thinking-and-engagement-through-puzzle-box-integration-in-vir.md","publications\u002F2023\u002Fenhancing-critical-thinking-and-engagement-through-puzzle-box-integration-in-vir.md","publications\u002F2023\u002Fenhancing-critical-thinking-and-engagement-through-puzzle-box-integration-in-vir",{"_path":11546,"_dir":10450,"_draft":7,"_partial":7,"_locale":8,"title":11547,"description":11548,"_hidden":7,"Synergistic Method\" authors":11549,"authors_orcid":11551,"year":10455,"doi":11553,"openalex_id":11554,"venue":21,"abstract_screenshot":21,"keywords":11555,"body":11561,"_type":51,"_id":11569,"_source":53,"_file":11570,"_stem":11571,"_extension":56,"locale":57},"\u002Fpublications\u002F2023\u002Fenhancing-df-ins-for-accurate-zero-velocity-detection-in-ilbs-a-dual-foot-synerg","Enhancing DF-INS for Accurate Zero-Velocity Detection in ILBS: A Dual Foo","The Dual Foot Inertial Navigation System (DF-INS) shows promise as a practical approach for indoor location-based service (ILBS). Achieving accurate zero-velocity detection is crucial for optimal performance in zero-velocity updating and trajectory calculation. However, conventional techniques rely on fixed thresholds to identify the zero-velocity (stance) phase, which is not suitable for dynamic scenarios and diverse users. This study introduces a dual foot synergistic method to address this issue. Initially, the General Likelihood Ratio Test sequences from both feet are smoothed using a moving average filter. The points of equality within these sequences are then identified as transition points between the stance phase and the swing phase. The experiment was conducted along a closed indoor path, and the results demonstrate that the proposed method outperforms other fixed thresholding methods in terms of zero-velocity detection and DF-INS calculation.",[7746,5667,5407,9830,8463,11550],"Wang, Yongfu",[21,5670,5411,9834,8466,11552],"0000-0003-3196-063X","https:\u002F\u002Fdoi.org\u002F10.1109\u002Fsensors56945.2023.10325168","W4389077833",[11556,7752,3659,10250,23,9864,11557,11558,11559,8138,6978,11560,34,37,332,10252,4391,3597],"Zero (linguistics)","Control theory (sociology)","Angular velocity","Foot (prosody)","Phase (matter)",{"type":39,"children":11562,"toc":11567},[11563],{"type":42,"tag":43,"props":11564,"children":11565},{},[11566],{"type":47,"value":11548},{"title":8,"searchDepth":49,"depth":49,"links":11568},[],"content:publications:2023:enhancing-df-ins-for-accurate-zero-velocity-detection-in-ilbs-a-dual-foot-synerg.md","publications\u002F2023\u002Fenhancing-df-ins-for-accurate-zero-velocity-detection-in-ilbs-a-dual-foot-synerg.md","publications\u002F2023\u002Fenhancing-df-ins-for-accurate-zero-velocity-detection-in-ilbs-a-dual-foot-synerg",{"_path":11573,"_dir":10450,"_draft":7,"_partial":7,"_locale":8,"title":11574,"description":11575,"_hidden":7,"Hybrid SMOTE-GAN Techniques authors":11576,"authors_orcid":11579,"year":10455,"doi":11582,"openalex_id":11583,"venue":11584,"abstract_screenshot":21,"keywords":11585,"body":11588,"_type":51,"_id":11596,"_source":53,"_file":11597,"_stem":11598,"_extension":56,"locale":57},"\u002Fpublications\u002F2023\u002Fenhancing-financial-fraud-detection-through-addressing-class-imbalance-using-hyb","Enhancing Financial Fraud Detection through Addressing Class Imbalance Using","The class imbalance problem in finance fraud datasets often leads to biased prediction towards the nonfraud class, resulting in poor performance in the fraud class. This study explores the effects of utilizing the Synthetic Minority Oversampling TEchnique (SMOTE), a Generative Adversarial Network (GAN), and their combinations to address the class imbalance issue. Their effectiveness was evaluated using a Feed-forward Neural Network (FNN), Convolutional Neural Network (CNN), and their hybrid (FNN+CNN). This study found that regardless of the data generation techniques applied, the classifier’s hyperparameters can affect classification performance. The comparisons of various data generation techniques demonstrated the effectiveness of the hybrid SMOTE and GAN, including SMOTified-GAN, SMOTE+GAN, and GANified-SMOTE, compared with SMOTE and GAN. The SMOTified-GAN and the proposed GANified-SMOTE were able to perform equally well across different amounts of generated fraud samples.",[11577,11578,5667],"Cheah, Patience Chew Yee","Yang, Yue",[11580,11581,5670],"0000-0001-8067-423X","0000-0001-5670-9551","https:\u002F\u002Fdoi.org\u002F10.3390\u002Fijfs11030110","W4386461659","International Journal of Financial Studies",[23,11586,7281,11587,5545,37,862,215,632,181,8721,251],"Oversampling","Hyperparameter",{"type":39,"children":11589,"toc":11594},[11590],{"type":42,"tag":43,"props":11591,"children":11592},{},[11593],{"type":47,"value":11575},{"title":8,"searchDepth":49,"depth":49,"links":11595},[],"content:publications:2023:enhancing-financial-fraud-detection-through-addressing-class-imbalance-using-hyb.md","publications\u002F2023\u002Fenhancing-financial-fraud-detection-through-addressing-class-imbalance-using-hyb.md","publications\u002F2023\u002Fenhancing-financial-fraud-detection-through-addressing-class-imbalance-using-hyb",{"_path":11600,"_dir":10450,"_draft":7,"_partial":7,"_locale":8,"title":11601,"description":11602,"_hidden":7,"authors":11603,"authors_orcid":11605,"year":10455,"doi":11606,"openalex_id":11607,"venue":21,"abstract_screenshot":21,"keywords":11608,"body":11609,"_type":51,"_id":11617,"_source":53,"_file":11618,"_stem":11619,"_extension":56,"locale":57},"\u002Fpublications\u002F2023\u002Fexploring-metamorphic-testing-for-fake-news-detection-software-a-case-study","Exploring Metamorphic Testing for Fake-News Detection Software: A Case Study","Concerns have been growing over fake news and its impact. Software that can automatically detect fake news is becoming more popular. However, the accuracy and reliability of such fake-news detection software remains questionable, partly due to a lack of testing and verification. Testing this kind of software may face the oracle problem, which refers to difficulty (or inability) of identifying the correctness of the software’s output in a reasonable amount of time. Metamorphic testing (MT) has a record of effectively alleviating the oracle problem, and has been successfully applied to testing fake-news detection software. This paper reports on a study, extending previous work, exploring the use of MT for fake-news detection software. The study includes new metamorphic relations and additional experimental results and analysis. Some alternative MR-generation approaches are also explored. The study targets software where the output is a real\u002Ffake news decision, enhancing the applicability of MT to current fake-news detection software. The paper also explores the impact of the prediction accuracy of the fake-news detection software on the MT process. The study demonstrates the validity and applicability of MT to fake-news detection software. The prediction accuracy of the software has a greater impact on MT experiments with greater changes between the source and follow-up inputs, and less dependence on prediction stability. Some possible factors affecting the experimental results are discussed, and directions for future work are provided.",[11604,595,7949,596,1156],"Miao, Lin",[21,599,7951,600,1158],"https:\u002F\u002Fdoi.org\u002F10.1109\u002Fcompsac57700.2023.00122","W4385489369",[23,7955,139,3493,110],{"type":39,"children":11610,"toc":11615},[11611],{"type":42,"tag":43,"props":11612,"children":11613},{},[11614],{"type":47,"value":11602},{"title":8,"searchDepth":49,"depth":49,"links":11616},[],"content:publications:2023:exploring-metamorphic-testing-for-fake-news-detection-software-a-case-study.md","publications\u002F2023\u002Fexploring-metamorphic-testing-for-fake-news-detection-software-a-case-study.md","publications\u002F2023\u002Fexploring-metamorphic-testing-for-fake-news-detection-software-a-case-study",{"_path":11621,"_dir":10450,"_draft":7,"_partial":7,"_locale":8,"title":11622,"description":11623,"_hidden":7,"of Puzzle Box Games for Education\" authors":11624,"authors_orcid":11626,"year":10455,"doi":11627,"openalex_id":11628,"venue":21,"abstract_screenshot":21,"keywords":11629,"body":11634,"_type":51,"_id":11642,"_source":53,"_file":11643,"_stem":11644,"_extension":56,"locale":57},"\u002Fpublications\u002F2023\u002Fexploring-the-fusion-of-mixed-reality-and-digital-game-based-learning-the-case-o","Exploring the Fusion of Mixed Reality and Digital Game-Based Learning: The Cas","The traditional offline teaching landscape has faced unprecedented challenges due to the COVID-19 pandemic, leading to the emergence of online teaching as a novel educational trend. However, online teaching has certain limitations. It lacks robust interaction between teachers and students, making it challenging for teachers to evaluate students’ real-time progress in learning. Moreover, online classrooms often suffer from low engagement, causing students to easily lose focus, resulting in reduced student autonomy and unsatisfactory learning outcomes. In recent years, various studies have proposed game-based learning approaches that integrate instructional content and knowledge. These methods effectively reshape the conventional \"teacher-led, passive learning\" model and address the issue of limited student participation in the classroom. This approach proves advantageous in fostering students’ diverse and comprehensive qualities. To accomplish this objective, the study aims to investigate the fusion of mixed reality technology and digital game-based learning, drawing inspiration from the concept of a puzzle box. The design of virtual digital puzzles revolves around user-centered human-computer interaction, encompassing elements such as user experience satisfaction, interface design for mixed reality technology, and the presentation format in which puzzles serve as the primary medium. The study has demonstrated that students generally exhibit motivation to embrace the utilization of mixed reality puzzle box games for educational purposes. This motivation arises from the allure of gaming elements and the ease of interaction with technology, which contributes to an enhanced learning experience.",[5667,11525,11625],"Wen, Xinlei",[5670,21,21],"https:\u002F\u002Fdoi.org\u002F10.1109\u002Ftale56641.2023.10398389","W4391266289",[23,867,11630,868,11631,11632,11633,866,865],"Game based learning","Game mechanics","Game design","Video game design",{"type":39,"children":11635,"toc":11640},[11636],{"type":42,"tag":43,"props":11637,"children":11638},{},[11639],{"type":47,"value":11623},{"title":8,"searchDepth":49,"depth":49,"links":11641},[],"content:publications:2023:exploring-the-fusion-of-mixed-reality-and-digital-game-based-learning-the-case-o.md","publications\u002F2023\u002Fexploring-the-fusion-of-mixed-reality-and-digital-game-based-learning-the-case-o.md","publications\u002F2023\u002Fexploring-the-fusion-of-mixed-reality-and-digital-game-based-learning-the-case-o",{"_path":11646,"_dir":10450,"_draft":7,"_partial":7,"_locale":8,"title":11647,"description":11648,"_hidden":7,"An Overheads Reduction Technique\" authors":11649,"authors_orcid":11650,"year":10455,"doi":11651,"openalex_id":11652,"venue":21,"abstract_screenshot":21,"keywords":11653,"body":11655,"_type":51,"_id":11672,"_source":53,"_file":11673,"_stem":11674,"_extension":56,"locale":57},"\u002Fpublications\u002F2023\u002Fextended-abstract-of-candidate-test-set-reduction-for-adaptive-random-testing-an","Extended Abstract of Candidate Test Set Reduction for Adaptive Random Testing","This document 1 is an extended abstract of a Science of Computer Programming paper, \"Candidate Test Set Reduction for Adaptive Random Testing: An Overheads Reduction Technique,\" presented as a J1C2 (Journal publication first, Conference presentation following) at the 30th IEEE International Conference on Software Analysis, Evolution and Reengineering (Saner 2023).The paper presents a candidate set reduction strategy to enhance the Fixed-Sized-Candidate-Set version of Adaptive Random Testing (FSCS-ART). The proposed method reduces the number of randomly-generated candidate test cases by retaining valuable, unused candidates from previous iterations. As the computational costs associated with a stored\u002Fretained candidate are less than the costs associated with a randomly-generating one, the overall computational overheads of FSCS-ART are reduced. The reported experimental studies show that the proposed method has a comparable failure-detection effectiveness to FSCS-ART, but less computational overheads.",[645,5250,5049,595],[650,5253,5051,599],"https:\u002F\u002Fdoi.org\u002F10.1109\u002Fsaner56733.2023.00102","W4376606802",[748,1163,23,101,7483,7554,139,11654,658,37,34,110,215,179],"Business process reengineering",{"type":39,"children":11656,"toc":11670},[11657],{"type":42,"tag":43,"props":11658,"children":11659},{},[11660,11662,11668],{"type":47,"value":11661},"This document ",{"type":42,"tag":11663,"props":11664,"children":11665},"sup",{"xmlns:mml":1465,"xmlnsXLink":8791},[11666],{"type":47,"value":11667},"1",{"type":47,"value":11669}," is an extended abstract of a Science of Computer Programming paper, \"Candidate Test Set Reduction for Adaptive Random Testing: An Overheads Reduction Technique,\" presented as a J1C2 (Journal publication first, Conference presentation following) at the 30th IEEE International Conference on Software Analysis, Evolution and Reengineering (Saner 2023).The paper presents a candidate set reduction strategy to enhance the Fixed-Sized-Candidate-Set version of Adaptive Random Testing (FSCS-ART). The proposed method reduces the number of randomly-generated candidate test cases by retaining valuable, unused candidates from previous iterations. As the computational costs associated with a stored\u002Fretained candidate are less than the costs associated with a randomly-generating one, the overall computational overheads of FSCS-ART are reduced. The reported experimental studies show that the proposed method has a comparable failure-detection effectiveness to FSCS-ART, but less computational overheads.",{"title":8,"searchDepth":49,"depth":49,"links":11671},[],"content:publications:2023:extended-abstract-of-candidate-test-set-reduction-for-adaptive-random-testing-an.md","publications\u002F2023\u002Fextended-abstract-of-candidate-test-set-reduction-for-adaptive-random-testing-an.md","publications\u002F2023\u002Fextended-abstract-of-candidate-test-set-reduction-for-adaptive-random-testing-an",{"_path":11676,"_dir":10450,"_draft":7,"_partial":7,"_locale":8,"title":11677,"description":8,"_hidden":7,"authors":11678,"authors_orcid":11679,"year":10455,"doi":11680,"openalex_id":11681,"venue":11682,"abstract_screenshot":21,"keywords":11683,"body":11687,"_type":51,"_id":11691,"_source":53,"_file":11692,"_stem":11693,"_extension":56,"locale":57},"\u002Fpublications\u002F2023\u002Ffch-an-incentive-framework-for-data-owner-dominated-federated-learning","FCH, an incentive framework for data-owner dominated federated learning",[10312,8932,10313,8931],[10315,8938,10316,8937],"https:\u002F\u002Fdoi.org\u002F10.1016\u002Fj.jisa.2023.103521","W4379745684","Journal of Information Security and Applications",[5472,135,11684,23,11685,11686,178,629,170,7631,36,429,37],"Clearing","Federated learning","Information asymmetry",{"type":39,"children":11688,"toc":11689},[],{"title":8,"searchDepth":49,"depth":49,"links":11690},[],"content:publications:2023:fch-an-incentive-framework-for-data-owner-dominated-federated-learning.md","publications\u002F2023\u002Ffch-an-incentive-framework-for-data-owner-dominated-federated-learning.md","publications\u002F2023\u002Ffch-an-incentive-framework-for-data-owner-dominated-federated-learning",{"_path":11695,"_dir":10450,"_draft":7,"_partial":7,"_locale":8,"title":11696,"description":11697,"_hidden":7,"authors":11698,"authors_orcid":11701,"year":10455,"doi":11704,"openalex_id":11705,"venue":553,"abstract_screenshot":21,"keywords":11706,"body":11710,"_type":51,"_id":11718,"_source":53,"_file":11719,"_stem":11720,"_extension":56,"locale":57},"\u002Fpublications\u002F2023\u002Ffemale-venture-capitalists-on-boards-and-firm-innovation-in-china","Female venture capitalists on boards and firm innovation in China","This paper empirically examines the representation of female venture capitalists (VCs) on boards and how they exert substantial influence on firm innovation performance in China. We first identify a positive association between female VCs’ board participation and firm innovation, implying that Chinese female VCs contribute to growing resource commitments and greater success in innovation through quality board services in portfolio firms. We then show that firms with female VC board directors exhibit a lower adverse effect of managerial myopia, capital market pressure, and product market competition on innovation activities. These results are robust to the use of instrumental variable (IV) estimations, subsamples, and alternative variable definitions.",[11699,268,8015,11700],"Fan, Jiani","Wang, Yong",[11702,272,8017,11703],"0000-0002-7363-6910","0000-0003-1227-5960","https:\u002F\u002Fdoi.org\u002F10.1080\u002F1351847x.2023.2264930","W4388038722",[7574,11707,178,282,718,8021,747,11708,3569,3257,11709,924,6600,751,36,3546,1443,429,287],"Instrumental variable","Initial public offering","Product market",{"type":39,"children":11711,"toc":11716},[11712],{"type":42,"tag":43,"props":11713,"children":11714},{},[11715],{"type":47,"value":11697},{"title":8,"searchDepth":49,"depth":49,"links":11717},[],"content:publications:2023:female-venture-capitalists-on-boards-and-firm-innovation-in-china.md","publications\u002F2023\u002Ffemale-venture-capitalists-on-boards-and-firm-innovation-in-china.md","publications\u002F2023\u002Ffemale-venture-capitalists-on-boards-and-firm-innovation-in-china",{"_path":11722,"_dir":10450,"_draft":7,"_partial":7,"_locale":8,"title":11723,"description":11724,"_hidden":7,"Localization System\" authors":11725,"authors_orcid":11727,"year":10455,"doi":11729,"openalex_id":11730,"venue":21,"abstract_screenshot":21,"keywords":11731,"body":11737,"_type":51,"_id":11745,"_source":53,"_file":11746,"_stem":11747,"_extension":56,"locale":57},"\u002Fpublications\u002F2023\u002Fga-pdr-using-gait-analysis-for-heading-estimation-in-pdr-based-indoor-localizati","GA-PDR: Using Gait Analysis for Heading Estimation in PDR Based Indoo","Indoor positioning in the firefighting ground shows promising application prospects for enhancing rescue safety and efficiency. Low visibility and signal interference caused by smoke pose significant difficulties for visual Simultaneous Localization and Mapping (SLAM) systems and radio frequency-based localization methods, while the performance of existing pedestrian dead reckoning (PDR) methods is affected by unpredictable user gaits. This paper introduces a gait analysis-based PDR (GA-PDR) for deriving heading estimation in PDR to improve its localization performance. The proposed method determines the step pattern by analyzing the features of inertial measurement unit data, thereby enabling the classification of forward, left- and right-turn and around-turn from left or right-side movements. In addition, this study introduces a redundant turn elimination method to differentiate false positive patterns via a time-domain heading analysis for turn movements. The location tracking performance with the proposed GA-PDR approach is validated using a self-created dataset established under a smoke-filled experiment, the results of which indicate a lower loop closure error compared with the traditional PDR in all of the tested scenarios.",[7746,5407,8463,5667,5665,11726],"Nkenyereye, Lionel",[21,5411,8466,5670,5669,11728],"0000-0001-6714-4402","https:\u002F\u002Fdoi.org\u002F10.1109\u002Fiecon51785.2023.10312643","W4388726282",[9689,23,11732,37,4391,11733,6978,11734,3203,11735,11736,3392,179,288,289],"Visibility","Dead reckoning","Step detection","Pedestrian","Tracking (education)",{"type":39,"children":11738,"toc":11743},[11739],{"type":42,"tag":43,"props":11740,"children":11741},{},[11742],{"type":47,"value":11724},{"title":8,"searchDepth":49,"depth":49,"links":11744},[],"content:publications:2023:ga-pdr-using-gait-analysis-for-heading-estimation-in-pdr-based-indoor-localizati.md","publications\u002F2023\u002Fga-pdr-using-gait-analysis-for-heading-estimation-in-pdr-based-indoor-localizati.md","publications\u002F2023\u002Fga-pdr-using-gait-analysis-for-heading-estimation-in-pdr-based-indoor-localizati",{"_path":11749,"_dir":10450,"_draft":7,"_partial":7,"_locale":8,"title":11750,"description":11751,"_hidden":7,"authors":11752,"authors_orcid":11754,"year":10455,"doi":11755,"openalex_id":11756,"venue":11757,"abstract_screenshot":21,"keywords":11758,"body":11763,"_type":51,"_id":11771,"_source":53,"_file":11772,"_stem":11773,"_extension":56,"locale":57},"\u002Fpublications\u002F2023\u002Fgan-in-gan-for-monaural-speech-enhancement","GAN-in-GAN for Monaural Speech Enhancement","Some generative adversarial networks (GANs) have been developed to remove background noise in real-world audio recordings. MetricGAN and its variants focus on generating a clean spectrogram from a noisy one, but the final audio quality can't be guaranteed. SEGAN and its variants directly generate an enhanced audio from a noisy one, but their over-long input representations make it less effective in identifying and removing audio noise. In this paper, a novel GAN-in-GAN framework is proposed, where the inner GAN conducts spectrogram-to-spectrogram recovery under the supervision of metric discriminators to effectively clean the audio noise, and the outer GAN conducts an audio-to-audio recovery under the supervision of multi-resolution discriminators to optimize the final audio quality. To tackle the challenges of utilizing multiple adversarial losses for training the proposed GAN-in-GAN simultaneously, a novel gradient balancing scheme is proposed to facilitate a coherent training. The proposed method is compared with state-of-the-art methods on the VoiceBank+DEMAND dataset for audio denoising. It outperforms all the compared methods.",[11753,6111,5532,9048],"Duan, Yicun",[21,6113,5537,9051],"https:\u002F\u002Fdoi.org\u002F10.1109\u002Flsp.2023.3293758","W4383750092","IEEE Signal Processing Letters",[11759,23,4093,11760,6980,11359,11761,11762,37,4004],"Spectrogram","Monaural","Noise measurement","Sound quality",{"type":39,"children":11764,"toc":11769},[11765],{"type":42,"tag":43,"props":11766,"children":11767},{},[11768],{"type":47,"value":11751},{"title":8,"searchDepth":49,"depth":49,"links":11770},[],"content:publications:2023:gan-in-gan-for-monaural-speech-enhancement.md","publications\u002F2023\u002Fgan-in-gan-for-monaural-speech-enhancement.md","publications\u002F2023\u002Fgan-in-gan-for-monaural-speech-enhancement",{"_path":11775,"_dir":10450,"_draft":7,"_partial":7,"_locale":8,"title":11776,"description":8,"_hidden":7,"from MNC Subsidiaries in Confucian China\" authors":11777,"authors_orcid":11780,"year":10455,"doi":11782,"openalex_id":11783,"venue":74,"abstract_screenshot":21,"keywords":11784,"body":11788,"_type":51,"_id":11792,"_source":53,"_file":11793,"_stem":11794,"_extension":56,"locale":57},"\u002Fpublications\u002F2023\u002Fglobal-corporate-social-responsibility-standards-meet-local-culture-evidence-fro","Global Corporate Social Responsibility Standards Meet Local Culture: Evidenc",[11778,65,11779],"Jian-liang, LI","Zhou, Abby Jingzi",[21,70,11781],"0000-0002-1052-5842","https:\u002F\u002Fdoi.org\u002F10.2139\u002Fssrn.4630788","W4388633011",[11785,282,178,11786,3546,11787,9340,7575,1356,1358,6927,3259,429],"Subsidiary","Corporate social responsibility","Social responsibility",{"type":39,"children":11789,"toc":11790},[],{"title":8,"searchDepth":49,"depth":49,"links":11791},[],"content:publications:2023:global-corporate-social-responsibility-standards-meet-local-culture-evidence-fro.md","publications\u002F2023\u002Fglobal-corporate-social-responsibility-standards-meet-local-culture-evidence-fro.md","publications\u002F2023\u002Fglobal-corporate-social-responsibility-standards-meet-local-culture-evidence-fro",{"_path":11796,"_dir":10450,"_draft":7,"_partial":7,"_locale":8,"title":11797,"description":11798,"_hidden":7,"Cardiovascular Interventions authors":11799,"authors_orcid":11802,"year":10455,"doi":11805,"openalex_id":11806,"venue":21,"abstract_screenshot":21,"keywords":11807,"body":11809,"_type":51,"_id":11817,"_source":53,"_file":11818,"_stem":11819,"_extension":56,"locale":57},"\u002Fpublications\u002F2023\u002Fguidewire-endpoint-detection-based-on-pixel-adjacent-relation-in-robot-assisted","Guidewire Endpoint Detection Based on Pixel Adjacent Relation in Robot-assisted","Visualization of endovascular tools like guidewire and catheter is essential for procedural success of endovascular interventions. This requires tracking the tool pixels and motion during catheterization; however, detecting the endpoints of the endovascular tools is challenging due to their small size, thin appearance, and flexibility. As this still limit the performances of existing methods used for endovascular tool segmentation, predicting correct object location could provide ways forward. In this paper, we proposed a neighborhood-based method for detecting guidewire endpoints in X-ray angiograms. Typically, it consists of pixel-level segmentation and a post-segmentation step that is based on adjacency relationships of pixels in a given neighborhood. The latter includes skeletonization to predict endpoint pixels of guidewire. The method is evaluated with proprietary guidewire dataset obtained during in-vivo study in six rabbits, and it shows a high segmentation performance characterized with precision of 87.87% and recall of 90.53%, and low detection error with a mean pixel error of 2.26±0.14 pixels. We compared our method with four state-of-the-art detection methods and found it to exhibit the best detection performance. This neighborhood-based detection method can be generalized for other surgical tool detection and in related computer vision tasks.Clinical Relevance- The proposed method can be provided with better tool tracking and visualization systems during robot-assisted intravascular interventional surgery.",[9462,11800,9463,9464,9466,11801,9467,5667,8406],"Yi, Guanlin","Chen, Xingyu",[9469,11803,9470,9471,9473,11804,9474,5670,8409],"0000-0002-5175-9637","0000-0003-1164-9537","https:\u002F\u002Fdoi.org\u002F10.1109\u002Fembc40787.2023.10340841","W4389542423",[9091,37,23,4391,9090,11808,9028,11495],"Object detection",{"type":39,"children":11810,"toc":11815},[11811],{"type":42,"tag":43,"props":11812,"children":11813},{},[11814],{"type":47,"value":11798},{"title":8,"searchDepth":49,"depth":49,"links":11816},[],"content:publications:2023:guidewire-endpoint-detection-based-on-pixel-adjacent-relation-in-robot-assisted.md","publications\u002F2023\u002Fguidewire-endpoint-detection-based-on-pixel-adjacent-relation-in-robot-assisted.md","publications\u002F2023\u002Fguidewire-endpoint-detection-based-on-pixel-adjacent-relation-in-robot-assisted",{"_path":11821,"_dir":10450,"_draft":7,"_partial":7,"_locale":8,"title":11822,"description":11823,"_hidden":7,"authors":11824,"authors_orcid":11827,"year":10455,"doi":11828,"openalex_id":11829,"venue":21,"abstract_screenshot":21,"keywords":11830,"body":11833,"_type":51,"_id":11841,"_source":53,"_file":11842,"_stem":11843,"_extension":56,"locale":57},"\u002Fpublications\u002F2023\u002Fhexhead-6d-head-pose-estimation-based-visual-focus-of-attention-detection","HexHeAd: 6D Head Pose Estimation Based Visual Focus of Attention Detection","This paper proposes a visual focus of attention detection method based on the user’s 6D head pose estimation, which determines the content of the observer’s visual focus of attention according to the current visual attention focus range of the observer. The system detects the observer’s current head posture and uses continuous tracking of the direction of interest to determine when the observer’s visual focus of attention is drawn to a specific location and content. Context-based visual focus of attention span is used as an approach to detect the level of interest an observer has in a particular content. Then, according to the level of interest of the observer, a visual focus of attention-based interaction channel can be established, and the observer’s feedback on specific content can be accumulated to obtain the relevant preferences of the observer and establish a foundation for future interactions. In order to evaluate the method, we conducted an experiment using short video as the target visual focus of attention, and when the observer watched a large screen playing specific content in an open area, the proposed method determined the current visual focus of attention level of the observer, and further discovered the interest of the observer according to the content viewed by the observer. The evaluation results show that our approach has good performance for automatic observer tracking or human-robot interaction.",[6288,11825,11110,11826,11111,268],"Fei, Haoze","Yang, S. C.",[21,21,11113,21,11114,272],"https:\u002F\u002Fdoi.org\u002F10.1109\u002Ficraic61978.2023.00077","W4394712811",[23,37,9762,11831,4391,11832,9692,4876,179,3789],"Pose","Head (geology)",{"type":39,"children":11834,"toc":11839},[11835],{"type":42,"tag":43,"props":11836,"children":11837},{},[11838],{"type":47,"value":11823},{"title":8,"searchDepth":49,"depth":49,"links":11840},[],"content:publications:2023:hexhead-6d-head-pose-estimation-based-visual-focus-of-attention-detection.md","publications\u002F2023\u002Fhexhead-6d-head-pose-estimation-based-visual-focus-of-attention-detection.md","publications\u002F2023\u002Fhexhead-6d-head-pose-estimation-based-visual-focus-of-attention-detection",{"_path":11845,"_dir":10450,"_draft":7,"_partial":7,"_locale":8,"title":11846,"description":11847,"_hidden":7,"authors":11848,"authors_orcid":11849,"year":10455,"doi":11850,"openalex_id":11851,"venue":5791,"abstract_screenshot":21,"keywords":11852,"body":11853,"_type":51,"_id":11869,"_source":53,"_file":11870,"_stem":11871,"_extension":56,"locale":57},"\u002Fpublications\u002F2023\u002Fhierarchical-convit-with-attention-based-relational-reasoner-for-visual-analogic","Hierarchical ConViT with Attention-Based Relational Reasoner for Visual Analogical Reasoning","Raven’s Progressive Matrices (RPMs) have been widely used to evaluate the visual reasoning ability of humans. To tackle the challenges of visual perception and logic reasoning on RPMs, we propose a Hierarchical ConViT with Attention-based Relational Reasoner (HCV-ARR). Traditional solution methods often apply relatively shallow convolution networks to visually perceive shape patterns in RPM images, which may not fully model the long-range dependencies of complex pattern combinations in RPMs. The proposed ConViT consists of a convolutional block to capture the low-level attributes of visual patterns, and a transformer block to capture the high-level image semantics such as pattern formations. Furthermore, the proposed hierarchical ConViT captures visual features from multiple receptive fields, where the shallow layers focus on the image fine details while the deeper layers focus on the image semantics. To better model the underlying reasoning rules embedded in RPM images, an Attention-based Relational Reasoner (ARR) is proposed to establish the underlying relations among images. The proposed ARR well exploits the hidden relations among question images through the developed element-wise attentive reasoner. Experimental results on three RPM datasets demonstrate that the proposed HCV-ARR achieves a significant performance gain compared with the state-of-the-art models. The source code is available at: https:\u002F\u002Fgithub.com\u002Fwentaoheunnc\u002FHCV-ARR.",[7409,6997,6111,12,9048],[7415,7000,6113,15,9051],"https:\u002F\u002Fdoi.org\u002F10.1609\u002Faaai.v37i1.25072","W4382464482",[6020,23,5210,37,9762,7930,8165,4876,4479,110,34],{"type":39,"children":11854,"toc":11867},[11855],{"type":42,"tag":43,"props":11856,"children":11857},{},[11858,11860,11866],{"type":47,"value":11859},"Raven’s Progressive Matrices (RPMs) have been widely used to evaluate the visual reasoning ability of humans. To tackle the challenges of visual perception and logic reasoning on RPMs, we propose a Hierarchical ConViT with Attention-based Relational Reasoner (HCV-ARR). Traditional solution methods often apply relatively shallow convolution networks to visually perceive shape patterns in RPM images, which may not fully model the long-range dependencies of complex pattern combinations in RPMs. The proposed ConViT consists of a convolutional block to capture the low-level attributes of visual patterns, and a transformer block to capture the high-level image semantics such as pattern formations. Furthermore, the proposed hierarchical ConViT captures visual features from multiple receptive fields, where the shallow layers focus on the image fine details while the deeper layers focus on the image semantics. To better model the underlying reasoning rules embedded in RPM images, an Attention-based Relational Reasoner (ARR) is proposed to establish the underlying relations among images. The proposed ARR well exploits the hidden relations among question images through the developed element-wise attentive reasoner. Experimental results on three RPM datasets demonstrate that the proposed HCV-ARR achieves a significant performance gain compared with the state-of-the-art models. The source code is available at: ",{"type":42,"tag":1574,"props":11861,"children":11864},{"href":11862,"rel":11863},"https:\u002F\u002Fgithub.com\u002Fwentaoheunnc\u002FHCV-ARR",[4520],[11865],{"type":47,"value":11862},{"type":47,"value":1645},{"title":8,"searchDepth":49,"depth":49,"links":11868},[],"content:publications:2023:hierarchical-convit-with-attention-based-relational-reasoner-for-visual-analogic.md","publications\u002F2023\u002Fhierarchical-convit-with-attention-based-relational-reasoner-for-visual-analogic.md","publications\u002F2023\u002Fhierarchical-convit-with-attention-based-relational-reasoner-for-visual-analogic",{"_path":11873,"_dir":10450,"_draft":7,"_partial":7,"_locale":8,"title":11874,"description":8,"_hidden":7,"China authors":11875,"authors_orcid":11878,"year":10455,"doi":11881,"openalex_id":11882,"venue":74,"abstract_screenshot":21,"keywords":11883,"body":11884,"_type":51,"_id":11888,"_source":53,"_file":11889,"_stem":11890,"_extension":56,"locale":57},"\u002Fpublications\u002F2023\u002Fleading-or-facilitating-the-appropriate-role-of-governmental-venture-capital-in","Leading or Facilitating? The Appropriate Role of Governmental Venture Capital in",[268,11876,11700,11877],"Xia, Zhoubo","Peng, Jiadong",[272,21,11879,11880],"0000-0003-4029-4018","0000-0002-3227-9929","https:\u002F\u002Fdoi.org\u002F10.2139\u002Fssrn.4606898","W4387788498",[282,7574,178,7573,1440,429,1358,289],{"type":39,"children":11885,"toc":11886},[],{"title":8,"searchDepth":49,"depth":49,"links":11887},[],"content:publications:2023:leading-or-facilitating-the-appropriate-role-of-governmental-venture-capital-in.md","publications\u002F2023\u002Fleading-or-facilitating-the-appropriate-role-of-governmental-venture-capital-in.md","publications\u002F2023\u002Fleading-or-facilitating-the-appropriate-role-of-governmental-venture-capital-in",{"_path":11892,"_dir":10450,"_draft":7,"_partial":7,"_locale":8,"title":11893,"description":11894,"_hidden":7,"authors":11895,"authors_orcid":11900,"year":10455,"doi":11904,"openalex_id":11905,"venue":11906,"abstract_screenshot":11907,"keywords":11908,"body":11912,"_type":51,"_id":11928,"_source":53,"_file":11929,"_stem":11930,"_extension":56,"locale":57},"\u002Fpublications\u002F2023\u002Flearning-discriminatory-information-for-object-detection-on-urine-sediment-image","Learning Discriminatory Information for Object Detection on Urine Sediment Image","In clinical practice, the microscopic examination of urine sediment is considered an important in vitro examination with many broad applications. Measuring the amount of each type of urine sediment allows for screening, diagnosis and evaluation of kidney and urinary tract disease, providing insight into the specific type and severity. However, manual urine sediment examination is labor-intensive, time-consuming, and subjective. Traditional machine learning based object detection methods require hand-crafted features for localization and classification, which have poor generalization capabilities and are difficult to quickly and accurately detect the number of urine sediments. Deep learning based object detection methods have the potential to address the challenges mentioned above, but these methods require access to large urine sediment image datasets. Unfortunately, only a limited number of publicly available urine sediment datasets are currently available. To alleviate the lack of urine sediment datasets in medical image analysis, we propose a new dataset named UriSed2K, which contains 2465 high-quality images annotated with expert guidance. Two main challenges are associated with our dataset: a large number of small objects and the occlusion between these small objects. Our manuscript focuses on applying deep learning object detection methods to the urine sediment dataset and addressing the challenges presented by this dataset. Specifically, our goal is to improve the accuracy and efficiency of the detection algorithm and, in doing so, provide medical professionals with an automatic detector that saves time and effort. We propose an improved lightweight one-stage object detection algorithm called Discriminatory-YOLO. The proposed algorithm comprises a local context attention module and a global background suppression module, which aid the detector in distinguishing urine sediment features in the image. The local context attention module captures context information beyond the object region, while the global background suppression module emphasizes objects in uninformative backgrounds. We comprehensively evaluate our method on the UriSed2K dataset, which includes seven categories of urine sediments, such as erythrocytes (red blood cells), leukocytes (white blood cells), epithelial cells, crystals, mycetes, broken erythrocytes, and broken leukocytes, achieving the best average precision (AP) of 95.3% while taking only 10 ms per image. The source code and dataset are available at .",[11896,11897,11898,9416,11899],"Chan, Sixian","Wu, Binghui","Zhang, Guodao","Wang, Hongqiang",[11901,21,11902,9422,11903],"0000-0001-8916-1174","0000-0002-6264-5854","0000-0002-7286-7514","https:\u002F\u002Fdoi.org\u002F10.32604\u002Fcmes.2023.029485","W4386850098","Computer Modeling in Engineering & Sciences","learning-discriminatory-information-for-object-detection-on-urine-sediment-image.png",[23,37,11909,7445,11910,215,11808,11911,4876,181,380,3789],"Urinary sediment","Sediment","Urine",{"type":39,"children":11913,"toc":11926},[11914],{"type":42,"tag":43,"props":11915,"children":11916},{},[11917,11919,11924],{"type":47,"value":11918},"In clinical practice, the microscopic examination of urine sediment is considered an important ",{"type":42,"tag":1503,"props":11920,"children":11921},{},[11922],{"type":47,"value":11923},"in vitro",{"type":47,"value":11925}," examination with many broad applications. Measuring the amount of each type of urine sediment allows for screening, diagnosis and evaluation of kidney and urinary tract disease, providing insight into the specific type and severity. However, manual urine sediment examination is labor-intensive, time-consuming, and subjective. Traditional machine learning based object detection methods require hand-crafted features for localization and classification, which have poor generalization capabilities and are difficult to quickly and accurately detect the number of urine sediments. Deep learning based object detection methods have the potential to address the challenges mentioned above, but these methods require access to large urine sediment image datasets. Unfortunately, only a limited number of publicly available urine sediment datasets are currently available. To alleviate the lack of urine sediment datasets in medical image analysis, we propose a new dataset named UriSed2K, which contains 2465 high-quality images annotated with expert guidance. Two main challenges are associated with our dataset: a large number of small objects and the occlusion between these small objects. Our manuscript focuses on applying deep learning object detection methods to the urine sediment dataset and addressing the challenges presented by this dataset. Specifically, our goal is to improve the accuracy and efficiency of the detection algorithm and, in doing so, provide medical professionals with an automatic detector that saves time and effort. We propose an improved lightweight one-stage object detection algorithm called Discriminatory-YOLO. The proposed algorithm comprises a local context attention module and a global background suppression module, which aid the detector in distinguishing urine sediment features in the image. The local context attention module captures context information beyond the object region, while the global background suppression module emphasizes objects in uninformative backgrounds. We comprehensively evaluate our method on the UriSed2K dataset, which includes seven categories of urine sediments, such as erythrocytes (red blood cells), leukocytes (white blood cells), epithelial cells, crystals, mycetes, broken erythrocytes, and broken leukocytes, achieving the best average precision (AP) of 95.3% while taking only 10 ms per image. The source code and dataset are available at .",{"title":8,"searchDepth":49,"depth":49,"links":11927},[],"content:publications:2023:learning-discriminatory-information-for-object-detection-on-urine-sediment-image.md","publications\u002F2023\u002Flearning-discriminatory-information-for-object-detection-on-urine-sediment-image.md","publications\u002F2023\u002Flearning-discriminatory-information-for-object-detection-on-urine-sediment-image",{"_path":11932,"_dir":10450,"_draft":7,"_partial":7,"_locale":8,"title":11933,"description":11934,"_hidden":7,"authors":11935,"authors_orcid":11936,"year":10455,"doi":11937,"openalex_id":11938,"venue":11939,"abstract_screenshot":21,"keywords":11940,"body":11941,"_type":51,"_id":11949,"_source":53,"_file":11950,"_stem":11951,"_extension":56,"locale":57},"\u002Fpublications\u002F2023\u002Fmask-attack-detection-using-vascular-weighted-motion-robust-rppg-signals","Mask Attack Detection Using Vascular-Weighted Motion-Robust rPPG Signals","Detecting 3D mask attacks to a face recognition system is challenging. Although genuine faces and 3D face masks show significantly different remote photoplethysmography (rPPG) signals, rPPG-based face anti-spoofing methods often suffer from performance degradation due to unstable face alignment in the video sequence and weak rPPG signals. To enhance the rPPG signal in a motion-robust way, a landmark-anchored face stitching method is proposed to align the faces robustly and precisely at the pixel-wise level by using both SIFT keypoints and facial landmarks. To better encode the rPPG signal, a weighted spatial-temporal representation is proposed, which emphasizes the face regions with rich blood vessels. In addition, characteristics of rPPG signals in different color spaces are jointly utilized. To improve the generalization capability, a lightweight EfficientNet with a Gated Recurrent Unit (GRU) is designed to extract both spatial and temporal features from the rPPG spatial-temporal representation for classification. The proposed method is compared with the state-of-the-art methods on five benchmark datasets under both intra-dataset and cross-dataset evaluations. The proposed method shows a significant and consistent improvement in performance over other state-of-the-art rPPG-based methods for face spoofing detection.",[8405,6111,12,4626,8406,9048],[21,6113,15,4637,8409,9051],"https:\u002F\u002Fdoi.org\u002F10.1109\u002Ftifs.2023.3293949","W4383753518","IEEE Transactions on Information Forensics and Security",[23,37,4391,6924,4876,8413,8416],{"type":39,"children":11942,"toc":11947},[11943],{"type":42,"tag":43,"props":11944,"children":11945},{},[11946],{"type":47,"value":11934},{"title":8,"searchDepth":49,"depth":49,"links":11948},[],"content:publications:2023:mask-attack-detection-using-vascular-weighted-motion-robust-rppg-signals.md","publications\u002F2023\u002Fmask-attack-detection-using-vascular-weighted-motion-robust-rppg-signals.md","publications\u002F2023\u002Fmask-attack-detection-using-vascular-weighted-motion-robust-rppg-signals",{"_path":11953,"_dir":10450,"_draft":7,"_partial":7,"_locale":8,"title":11954,"description":11955,"_hidden":7,"authors":11956,"authors_orcid":11961,"year":10455,"doi":11964,"openalex_id":11965,"venue":21,"abstract_screenshot":21,"keywords":11966,"body":11968,"_type":51,"_id":11976,"_source":53,"_file":11977,"_stem":11978,"_extension":56,"locale":57},"\u002Fpublications\u002F2023\u002Fmetamorphic-testing-harness-for-the-baidu-apollo-perception-camera-module","Metamorphic Testing Harness for the Baidu Apollo Perception-Camera Module","As the complexity of autonomous driving systems (ADSs) increases, the question of how to organize testing in an efficient manner has become a serious issue. This study investigates the potential for metamorphic testing (MT) to evaluate the perception-camera module of an open-source autonomous driving system (ADS), namely Baidu’s Apollo ADS. The experiments revealed inconsistent obstacle identification results when increasing the brightness of a specific region of the driving scenarios, both in individual and sequential frames, demonstrating the ability of MT to address the oracle problem when testing the perception module of ADSs. Furthermore, this paper presents an MT harness to facilitate ADS testing, which would increase efficiency and help testers to better organize the testing procedure. We also present an industry case study to demonstrate its use in actual production phases.",[8041,595,5407,7697,11957,11958,11959,11960],"Zhou, George","Yin, Chenghao","Wang, Qian","Chen, Xie",[8045,599,5411,21,21,21,11962,11963],"0000-0002-2149-384X","0009-0004-4458-0753","https:\u002F\u002Fdoi.org\u002F10.1109\u002Fmet59151.2023.00009","W4385325964",[11967,23,3788,9784,6853,37,4391,3789,865,3790],"Apollo",{"type":39,"children":11969,"toc":11974},[11970],{"type":42,"tag":43,"props":11971,"children":11972},{},[11973],{"type":47,"value":11955},{"title":8,"searchDepth":49,"depth":49,"links":11975},[],"content:publications:2023:metamorphic-testing-harness-for-the-baidu-apollo-perception-camera-module.md","publications\u002F2023\u002Fmetamorphic-testing-harness-for-the-baidu-apollo-perception-camera-module.md","publications\u002F2023\u002Fmetamorphic-testing-harness-for-the-baidu-apollo-perception-camera-module",{"_path":11980,"_dir":10450,"_draft":7,"_partial":7,"_locale":8,"title":11981,"description":11982,"_hidden":7,"authors":11983,"authors_orcid":11990,"year":10455,"doi":11993,"openalex_id":11994,"venue":21,"abstract_screenshot":21,"keywords":11995,"body":11996,"_type":51,"_id":12004,"_source":53,"_file":12005,"_stem":12006,"_extension":56,"locale":57},"\u002Fpublications\u002F2023\u002Fmetamorphic-testing-of-an-automated-parking-system-an-experience-report","Metamorphic Testing of an Automated Parking System: An Experience Report","Automated Driving Systems (ADSs) have gained popularity recently. However, the unstable and unsafe ADSs have caused many traffic accidents and received widespread attention. One way to alleviate such issues is to enhance the correctness and efficiency of testing ADSs. Due to the difficulty of checking ADSs’ behavior such as parking the car, confirming the correctness of the actual behavior may be non-trivial or impossible. This kind of problem is called the test oracle problem. Unlike traditional software testing, Metamorphic Testing (MT) does not focus on the correctness of the actual strategy but examines whether or not the inputs and outputs of multiple executions of a Software Under Test (SUT) satisfy certain relations of the SUT, called Metamorphic Relations (MRs). The paper also implements Mutation Analysis (MA) on Baidu Apollo ADS to evaluate our MT. MA involves small modifications to a program’s source code to see if test-cases can detect these changes. This work was part of a larger endeavour to create an Open Educational Resource (OER) to support learning about how to apply MT to ADSs. This paper reports on an experience of implementing MT to test the Automated Parking System (APS) of Apollo ADS and applying MA to evaluate the MT.",[595,11984,11985,11986,11987,11988,11989,5407,8041],"Luo, Zepei","Zheng, Ziqi","Zhou, Peijian","Yang, Junbo","Ingkasit, Puttipatt","Lao, Changyang",[599,21,21,11991,11992,21,21,5411,8045],"0000-0001-9738-356X","0009-0003-5990-6931","https:\u002F\u002Fdoi.org\u002F10.1109\u002Fcompsac57700.2023.00274","W4385485107",[3788,23,3789,5015],{"type":39,"children":11997,"toc":12002},[11998],{"type":42,"tag":43,"props":11999,"children":12000},{},[12001],{"type":47,"value":11982},{"title":8,"searchDepth":49,"depth":49,"links":12003},[],"content:publications:2023:metamorphic-testing-of-an-automated-parking-system-an-experience-report.md","publications\u002F2023\u002Fmetamorphic-testing-of-an-automated-parking-system-an-experience-report.md","publications\u002F2023\u002Fmetamorphic-testing-of-an-automated-parking-system-an-experience-report",{"_path":12008,"_dir":10450,"_draft":7,"_partial":7,"_locale":8,"title":12009,"description":12010,"_hidden":7,"authors":12011,"authors_orcid":12013,"year":10455,"doi":12015,"openalex_id":12016,"venue":21,"abstract_screenshot":12017,"keywords":12018,"body":12021,"_type":51,"_id":12029,"_source":53,"_file":12030,"_stem":12031,"_extension":56,"locale":57},"\u002Fpublications\u002F2023\u002Fmulti-agent-intention-recognition-and-progression","Multi-Agent Intention Recognition and Progression","For an agent in a multi-agent environment, it is often beneficial to be able to predict what other agents will do next when deciding how to act. Previous work in multi-agent intention scheduling assumes a priori knowledge of the current goals of other agents. In this paper, we present a new approach to multi-agent intention scheduling in which an agent uses online goal recognition to identify the goals currently being pursued by other agents while acting in pursuit of its own goals. We show how online goal recognition can be incorporated into an MCTS-based intention scheduler, and evaluate our approach in a range of scenarios. The results demonstrate that our approach can rapidly recognise the goals of other agents even when they are pursuing multiple goals concurrently, and has similar performance to agents which know the goals of other agents a priori.",[9976,9416,5786,9977,12012,9978],"Meneguzzi, Felipe",[9980,9422,5788,9981,12014,9982],"0000-0003-3549-6168","https:\u002F\u002Fdoi.org\u002F10.24963\u002Fijcai.2023\u002F11","W4385764878","multi-agent-intention-recognition-and-progression.png",[23,12019,450,9988,12020,37,179],"A priori and a posteriori","Intelligent agent",{"type":39,"children":12022,"toc":12027},[12023],{"type":42,"tag":43,"props":12024,"children":12025},{},[12026],{"type":47,"value":12010},{"title":8,"searchDepth":49,"depth":49,"links":12028},[],"content:publications:2023:multi-agent-intention-recognition-and-progression.md","publications\u002F2023\u002Fmulti-agent-intention-recognition-and-progression.md","publications\u002F2023\u002Fmulti-agent-intention-recognition-and-progression",{"_path":12033,"_dir":10450,"_draft":7,"_partial":7,"_locale":8,"title":12034,"description":12035,"_hidden":7,"Co-Patenting Activity\" authors":12036,"authors_orcid":12040,"year":10455,"doi":12043,"openalex_id":12044,"venue":9362,"abstract_screenshot":21,"keywords":12045,"body":12050,"_type":51,"_id":12058,"_source":53,"_file":12059,"_stem":12060,"_extension":56,"locale":57},"\u002Fpublications\u002F2023\u002Fnetwork-positions-institutional-polycentrism-firm-innovation-evidence-from-co-pa","Network Positions, Institutional Polycentrism, Firm Innovation: Evidence fro","The disparity of sub-national institutions in transitional economies gradually comes into the spotlight, while less attention has been paid to the coexistence and interaction of different institutional arrangements. Combining the social network theory and the institutional polycentrism perspective, this paper examines that the separate and co-moderating effects of different institutions – government intervention and intellectual property right (IPR) enforcement – on the association between structure holes and exploratory and exploitative innovations. The listed companies’ co-patenting network of Chinese patent-intensive industry during 2010-2019 provides empirical evidence to support our study. Specifically, structural holes are beneficial for both types of innovations. In addition, the higher government intervention, the more exploitative and exploratory innovations produced by enterprises occupying more structural holes. The stronger IPR enforcement is, the more exploratory innovation by bridge enterprises. The combination of heavy government intervention and strong IPR enforcement is best for exploratory innovation.",[12037,65,12038,12039],"YANG, Qinjie","Wang, Jiaoe","Zhu, Zhijing",[21,70,12041,12042],"0000-0003-1051-7727","0000-0002-0917-1370","https:\u002F\u002Fdoi.org\u002F10.5465\u002Famproc.2023.16663abstract","W4385212685",[3254,178,3255,12046,8652,12047,5152,4859,12048,12049,953,6600,1358,1380],"Intellectual property","Intervention (counseling)","Bridge (graph theory)","Exploratory analysis",{"type":39,"children":12051,"toc":12056},[12052],{"type":42,"tag":43,"props":12053,"children":12054},{},[12055],{"type":47,"value":12035},{"title":8,"searchDepth":49,"depth":49,"links":12057},[],"content:publications:2023:network-positions-institutional-polycentrism-firm-innovation-evidence-from-co-pa.md","publications\u002F2023\u002Fnetwork-positions-institutional-polycentrism-firm-innovation-evidence-from-co-pa.md","publications\u002F2023\u002Fnetwork-positions-institutional-polycentrism-firm-innovation-evidence-from-co-pa",{"_path":12062,"_dir":10450,"_draft":7,"_partial":7,"_locale":8,"title":12063,"description":12064,"_hidden":7,"Extraction\" authors":12065,"authors_orcid":12068,"year":10455,"doi":12071,"openalex_id":12072,"venue":21,"abstract_screenshot":21,"keywords":12073,"body":12075,"_type":51,"_id":12083,"_source":53,"_file":12084,"_stem":12085,"_extension":56,"locale":57},"\u002Fpublications\u002F2023\u002Fnorb-a-stream-based-and-non-blocking-fpga-accelerator-for-orb-feature-extraction","NORB: A Stream-Based and Non-Blocking FPGA Accelerator for ORB Featur","Oriented FAST and Rotating BRIEF (ORB) is a key technique for visual feature extraction and matching, which forms the foundation of the state-of-the-art ORB-SLAM systems. Due to the computational complexity, FPGA accelerators for ORB computing are usually used when running ORB-SLAM on low-power platforms. Previous implementations of ORB accelerators need to block the input stream when computing the rBRIEF descriptors, and cannot achieve high throughput on all pixels. In this paper, we propose a stream-based accelerator of ORB feature extraction which achieves non-blocking computation by caching the columns of the corresponding window buffer. The proposed accelerator is implemented on a Zynq UltraScale SoC, and the experimental result shows it achieves an average latency of 1.4ms, which is 44% faster than the state-of-the-art approach, with similar output accuracy. The system has a low resource utilization with power consumption being only 1.5W.",[12066,8506,12067,5532,5534],"Zhang, Qixing","Deng, Qi",[12069,8508,12070,5537,5539],"0000-0002-8784-8674","0000-0002-5150-487X","https:\u002F\u002Fdoi.org\u002F10.1109\u002Ficecs58634.2023.10382726","W4390693433",[5747,23,5543,8779,7930,7391,12074,6632,330,5547,5550,37,332,4004,1113],"Blocking (statistics)",{"type":39,"children":12076,"toc":12081},[12077],{"type":42,"tag":43,"props":12078,"children":12079},{},[12080],{"type":47,"value":12064},{"title":8,"searchDepth":49,"depth":49,"links":12082},[],"content:publications:2023:norb-a-stream-based-and-non-blocking-fpga-accelerator-for-orb-feature-extraction.md","publications\u002F2023\u002Fnorb-a-stream-based-and-non-blocking-fpga-accelerator-for-orb-feature-extraction.md","publications\u002F2023\u002Fnorb-a-stream-based-and-non-blocking-fpga-accelerator-for-orb-feature-extraction",{"_path":12087,"_dir":10450,"_draft":7,"_partial":7,"_locale":8,"title":12088,"description":12089,"_hidden":7,"Computing authors":12090,"authors_orcid":12093,"year":10455,"doi":12096,"openalex_id":12097,"venue":21,"abstract_screenshot":21,"keywords":12098,"body":12105,"_type":51,"_id":12113,"_source":53,"_file":12114,"_stem":12115,"_extension":56,"locale":57},"\u002Fpublications\u002F2023\u002Fon-demand-provisioning-of-wearable-sensors-data-processing-services-in-edge-comp","On-Demand Provisioning of Wearable Sensors Data Processing Services in Edge","The wearable sensor applications and services are highly sensible to computation latency. The infrastructure that processes data closer to its source or end user named as multi-access edge computing (MEC) has emerged to push the data processing services away from the centralized nodes to the network edge, enabling wearable sensor applications with the geolocation awareness. In this paper, we introduce on-demand provisioning of wearable sensors processing services in MEC system, a continuous deployment strategy that offer availability of wearable data processing services packaged as an application ready to be provisioned on-demand by the Docker container virtualization technique at the edge of the network. This allows, thus, fulfilling different requirements, such as low latency and accuracy.",[11726,5667,12091,12092,5665],"Go, Kentaro","Mao, Xiaoyang",[11728,5670,12094,12095,5669],"0000-0003-3451-7924","0000-0001-9531-3197","https:\u002F\u002Fdoi.org\u002F10.1109\u002Fsensors56945.2023.10325028","W4389101786",[6973,12099,23,12100,10843,12101,12102,8778,251,12103,1189,8916,6465,4242,249,3123,288,1113,179,12104],"Provisioning","Edge computing","Geolocation","Virtualization","Macrocell","Base station",{"type":39,"children":12106,"toc":12111},[12107],{"type":42,"tag":43,"props":12108,"children":12109},{},[12110],{"type":47,"value":12089},{"title":8,"searchDepth":49,"depth":49,"links":12112},[],"content:publications:2023:on-demand-provisioning-of-wearable-sensors-data-processing-services-in-edge-comp.md","publications\u002F2023\u002Fon-demand-provisioning-of-wearable-sensors-data-processing-services-in-edge-comp.md","publications\u002F2023\u002Fon-demand-provisioning-of-wearable-sensors-data-processing-services-in-edge-comp",{"_path":12117,"_dir":10450,"_draft":7,"_partial":7,"_locale":8,"title":12118,"description":12119,"_hidden":7,"authors":12120,"authors_orcid":12124,"year":10455,"doi":12127,"openalex_id":12128,"venue":21,"abstract_screenshot":21,"keywords":12129,"body":12130,"_type":51,"_id":12138,"_source":53,"_file":12139,"_stem":12140,"_extension":56,"locale":57},"\u002Fpublications\u002F2023\u002Fon-robustness-of-ieee-802-11-wlan-based-human-activity-recognition","On Robustness of IEEE 802.11 WLAN-based Human Activity Recognition","Contact-less or Device-less Human Activity Recognition (HAR) using IEEE 802.11 Wireless Local Area Network (WLAN) has garnered significant interest due to its ubiquitous coverage, convenience, and privacy compared to wearable and vision-based approaches. However, maintaining the accuracy of HAR in varying environments, ranges, and time periods remains a challenge. This work proposes a robust scheme using threshold segmentation, auto-correlation function (ACF), and a lightweight fully connected neural network (FCNN), which can maintain the HAR accuracy across different environments without the need to retrain the model. The proposed scheme is also evaluated across different transceivers’ ranges to understand its deployment constraints. The results demonstrate that the proposed scheme delivers consistent performance across different environments, ranges, and days, achieving an average HAR accuracy of over 97.25% without retraining. This greatly reduces the deployment complexity and enhances its practicality.",[12121,12122,5667,4824,12123],"Li, Yeqin","Chieng, David","Yang, Chenyu",[21,12125,5670,21,12126],"0000-0002-9674-3436","0000-0001-9997-4929","https:\u002F\u002Fdoi.org\u002F10.1109\u002Fcscn60443.2023.10453177","W4392410872",[353,23,251],{"type":39,"children":12131,"toc":12136},[12132],{"type":42,"tag":43,"props":12133,"children":12134},{},[12135],{"type":47,"value":12119},{"title":8,"searchDepth":49,"depth":49,"links":12137},[],"content:publications:2023:on-robustness-of-ieee-802-11-wlan-based-human-activity-recognition.md","publications\u002F2023\u002Fon-robustness-of-ieee-802-11-wlan-based-human-activity-recognition.md","publications\u002F2023\u002Fon-robustness-of-ieee-802-11-wlan-based-human-activity-recognition",{"_path":12142,"_dir":10450,"_draft":7,"_partial":7,"_locale":8,"title":12143,"description":8,"_hidden":7,"authors":12144,"authors_orcid":12147,"year":10455,"doi":12149,"openalex_id":12150,"venue":4049,"abstract_screenshot":21,"keywords":12151,"body":12157,"_type":51,"_id":12161,"_source":53,"_file":12162,"_stem":12163,"_extension":56,"locale":57},"\u002Fpublications\u002F2023\u002Foptimal-low-rank-qr-decomposition-with-an-application-on-rp-tsod","Optimal Low-Rank QR Decomposition with an Application on RP-TSOD",[12145,6111,12,12146],"Yu, Haiyan","Shen, Linlin",[21,6113,15,12148],"0000-0003-1420-0815","https:\u002F\u002Fdoi.org\u002F10.1007\u002F978-981-99-8181-6_35","W4389010735",[12152,12153,12154,10654,12155,6730,7862,23,332,34,12156,76,3597],"QR decomposition","Matrix decomposition","Rank (graph theory)","Singular value decomposition","Eigenvalues and eigenvectors",{"type":39,"children":12158,"toc":12159},[],{"title":8,"searchDepth":49,"depth":49,"links":12160},[],"content:publications:2023:optimal-low-rank-qr-decomposition-with-an-application-on-rp-tsod.md","publications\u002F2023\u002Foptimal-low-rank-qr-decomposition-with-an-application-on-rp-tsod.md","publications\u002F2023\u002Foptimal-low-rank-qr-decomposition-with-an-application-on-rp-tsod",{"_path":12165,"_dir":10450,"_draft":7,"_partial":7,"_locale":8,"title":12166,"description":12167,"_hidden":7,"authors":12168,"authors_orcid":12173,"year":10455,"doi":12178,"openalex_id":12179,"venue":21,"abstract_screenshot":21,"keywords":12180,"body":12184,"_type":51,"_id":12200,"_source":53,"_file":12201,"_stem":12202,"_extension":56,"locale":57},"\u002Fpublications\u002F2023\u002Fpixels-regions-and-objects-multiple-enhancement-for-salient-object-detection","Pixels, Regions, and Objects: Multiple Enhancement for Salient Object Detection","Salient object detection (SOD) aims to mimic the human visual system (HVS) and cognition mechanisms to identify and segment salient objects. However, due to the complexity of these mechanisms, current methods are not perfect. Accuracy and robustness need to be further improved, particularly in complex scenes with multiple objects and background clutter. To address this issue, we propose a novel approach called Multiple Enhancement Network (MENet) that adopts the boundary sensibility, content integrity, iterative refinement, and frequency decomposition mechanisms of HVS. A multi-level hybrid loss is firstly designed to guide the network to learn pixel-level, region-level, and object-level features. A flexible multiscale feature enhancement module (ME-Module) is then designed to gradually aggregate and refine global or detailed features by changing the size order of the input feature sequence. An iterative training strategy is used to enhance boundary features and adaptive features in the dual-branch decoder of MENet. Comprehensive evaluations on six challenging benchmark datasets show that MENet achieves state-of-the-art results. Both the codes and results are publicly available at https:\u002F\u002Fgithub.com\u002Fyiwangtz\u002FMENet.",[12169,12170,12171,12172,8931],"Wang, Yi","Wang, Ruili","Fan, Xin","Wang, Tianzhu",[12174,12175,12176,12177,8937],"0000-0001-8659-4724","0000-0001-7117-2772","0000-0002-8991-4188","0000-0002-9360-7287","https:\u002F\u002Fdoi.org\u002F10.1109\u002Fcvpr52729.2023.00967","W4386072314",[23,353,37,12181,9091,209,12182,4876,6875,12183,11808,4391],"Salient","Clutter","GRASP",{"type":39,"children":12185,"toc":12198},[12186],{"type":42,"tag":43,"props":12187,"children":12188},{},[12189,12191,12197],{"type":47,"value":12190},"Salient object detection (SOD) aims to mimic the human visual system (HVS) and cognition mechanisms to identify and segment salient objects. However, due to the complexity of these mechanisms, current methods are not perfect. Accuracy and robustness need to be further improved, particularly in complex scenes with multiple objects and background clutter. To address this issue, we propose a novel approach called Multiple Enhancement Network (MENet) that adopts the boundary sensibility, content integrity, iterative refinement, and frequency decomposition mechanisms of HVS. A multi-level hybrid loss is firstly designed to guide the network to learn pixel-level, region-level, and object-level features. A flexible multiscale feature enhancement module (ME-Module) is then designed to gradually aggregate and refine global or detailed features by changing the size order of the input feature sequence. An iterative training strategy is used to enhance boundary features and adaptive features in the dual-branch decoder of MENet. Comprehensive evaluations on six challenging benchmark datasets show that MENet achieves state-of-the-art results. Both the codes and results are publicly available at ",{"type":42,"tag":1574,"props":12192,"children":12195},{"href":12193,"rel":12194},"https:\u002F\u002Fgithub.com\u002Fyiwangtz\u002FMENet",[4520],[12196],{"type":47,"value":12193},{"type":47,"value":1645},{"title":8,"searchDepth":49,"depth":49,"links":12199},[],"content:publications:2023:pixels-regions-and-objects-multiple-enhancement-for-salient-object-detection.md","publications\u002F2023\u002Fpixels-regions-and-objects-multiple-enhancement-for-salient-object-detection.md","publications\u002F2023\u002Fpixels-regions-and-objects-multiple-enhancement-for-salient-object-detection",{"_path":12204,"_dir":10450,"_draft":7,"_partial":7,"_locale":8,"title":12205,"description":12206,"_hidden":7,"authors":12207,"authors_orcid":12208,"year":10455,"doi":12209,"openalex_id":12210,"venue":10804,"abstract_screenshot":21,"keywords":12211,"body":12213,"_type":51,"_id":12221,"_source":53,"_file":12222,"_stem":12223,"_extension":56,"locale":57},"\u002Fpublications\u002F2023\u002Fpre-impact-firefighter-fall-detection-using-machine-learning-on-the-edge","Pre-Impact Firefighter Fall Detection Using Machine Learning on the Edge","Falling is one of the primary causes of firefighter casualties. Therefore, early fall detection, followed by reliable and timely notification, is vital to ensure the survival of firefighters. However, due to complex and diverse firefighting scenarios, current fall detection systems (FDSs) are inadequate, especially in terms of accuracy and real-time applications. Hence, in this study, a wearable pre-impact FDS (PIFDS) for firefighters is proposed. We also evaluated the feasibility of using machine learning (ML) and ensemble learning (EL) methods deployed on the edge node to simultaneously improve the real-time performance and accuracy. Moving thresholding method is introduced to overcome the class-imbalanced issue due to fewer samples acquired during the pre-impact (PI) phase. Based on 14 firefighters’ data collection, the experimental results revealed that a Decision Tree classifier with optimized parameters (DT-ED4) outperformed other ML and EL methods in a tradeoff between processing time and accuracy. The results also showed that our system can detect falls before the impact with an average lead time of 447.9 ms, sensitivity of 95.10%, and specificity of 97.99%. The system’s heterogeneous IoT network architecture facilitated remote monitoring and alerts that enabled the incident commander (IC) to execute the rescue mission immediately upon notification. This study enhances the practicability of PIFDS and extends the application range of PIFDS from healthcare to firefighting.",[8463,5667,5407,7746,12122,5665],[8466,5670,5411,21,12125,5669],"https:\u002F\u002Fdoi.org\u002F10.1109\u002Fjsen.2023.3279858","W4378194824",[23,3203,8471,7752,7281,6465,3662,37,6973,12212,215,984,4242],"Decision tree learning",{"type":39,"children":12214,"toc":12219},[12215],{"type":42,"tag":43,"props":12216,"children":12217},{},[12218],{"type":47,"value":12206},{"title":8,"searchDepth":49,"depth":49,"links":12220},[],"content:publications:2023:pre-impact-firefighter-fall-detection-using-machine-learning-on-the-edge.md","publications\u002F2023\u002Fpre-impact-firefighter-fall-detection-using-machine-learning-on-the-edge.md","publications\u002F2023\u002Fpre-impact-firefighter-fall-detection-using-machine-learning-on-the-edge",{"_path":12225,"_dir":10450,"_draft":7,"_partial":7,"_locale":8,"title":12226,"description":8,"_hidden":7,"survival scores authors":12227,"authors_orcid":12228,"year":10455,"doi":12230,"openalex_id":12231,"venue":10364,"abstract_screenshot":21,"keywords":12232,"body":12244,"_type":51,"_id":12248,"_source":53,"_file":12249,"_stem":12250,"_extension":56,"locale":57},"\u002Fpublications\u002F2023\u002Fpredicting-loss-given-default-of-unsecured-consumer-loans-with-time-varying-surv","Predicting loss given default of unsecured consumer loans with time-varying",[10334,10333,4189],[12229,10337,4191],"0000-0001-9459-5540","https:\u002F\u002Fdoi.org\u002F10.1016\u002Fj.pacfin.2023.101949","W4318426676",[12233,12234,287,12235,12236,6687,3666,12237,12238,12239,12240,12241,3663,23,10345,12242,173,36,10344,34,12243,429],"Loss given default","Covariate","Tobit model","Proportional hazards model","Hazard","Logistic regression","Multiplicative function","Logit","Linear regression","Credit score","Capital requirement",{"type":39,"children":12245,"toc":12246},[],{"title":8,"searchDepth":49,"depth":49,"links":12247},[],"content:publications:2023:predicting-loss-given-default-of-unsecured-consumer-loans-with-time-varying-surv.md","publications\u002F2023\u002Fpredicting-loss-given-default-of-unsecured-consumer-loans-with-time-varying-surv.md","publications\u002F2023\u002Fpredicting-loss-given-default-of-unsecured-consumer-loans-with-time-varying-surv",{"_path":12252,"_dir":10450,"_draft":7,"_partial":7,"_locale":8,"title":12253,"description":12254,"_hidden":7,"authors":12255,"authors_orcid":12257,"year":10455,"doi":12259,"openalex_id":12260,"venue":34,"abstract_screenshot":21,"keywords":12261,"body":12264,"_type":51,"_id":12272,"_source":53,"_file":12273,"_stem":12274,"_extension":56,"locale":57},"\u002Fpublications\u002F2023\u002Fprediction-and-analysis-of-container-terminal-logistics-arrival-time-based-on-si","Prediction and Analysis of Container Terminal Logistics Arrival Time Based on Simulation Interactive Modeling: A Case Study of Ningbo Port","This study is a driving analysis of the transfer data of container terminals based on simulation interactive modeling technology. In the context of a container yard, a model was established to analyze and predict the arrival time and influencing factors of container transportation through the data from the control center of the yard. The economic benefit index in the index system was determined through expert consultation, the automatic terminal can be obtained by acquiring the actual operating parameters of the terminal, and the terminal to be built can be acquired mainly through simulation modeling. Therefore, when determining the design scheme before constructing the automated container terminal, a terminal simulation model needs to be established that meets the requirements of loading and unloading operations and terminal production operations. In addition, an automated container terminal simulation model needs to be implemented to verify the feasibility of the evaluation model. The results reveal that the accuracy of the current prediction model is still limited—the highest accuracy is only 72%, whether there are continuous or discrete variables, traffic or weather variables. Moreover, the study denotes that the relationship between weather and specific time factors and the arrival time of containers is weak, even negligible. This study provides guidance and decision-making support for the construction of automated terminals.",[12256,157,12],"Wang, Ruoqi",[12258,162,15],"0000-0002-6431-9374","https:\u002F\u002Fdoi.org\u002F10.3390\u002Fmath11153271","W4385273111",[1189,3199,3202,133,1192,23,984,24,12262,834,12263,3203,454,179,251],"Arrival time","Simulation modeling",{"type":39,"children":12265,"toc":12270},[12266],{"type":42,"tag":43,"props":12267,"children":12268},{},[12269],{"type":47,"value":12254},{"title":8,"searchDepth":49,"depth":49,"links":12271},[],"content:publications:2023:prediction-and-analysis-of-container-terminal-logistics-arrival-time-based-on-si.md","publications\u002F2023\u002Fprediction-and-analysis-of-container-terminal-logistics-arrival-time-based-on-si.md","publications\u002F2023\u002Fprediction-and-analysis-of-container-terminal-logistics-arrival-time-based-on-si",{"_path":12276,"_dir":10450,"_draft":7,"_partial":7,"_locale":8,"title":12277,"description":8,"_hidden":7,"Using Supervised Machine Learning authors":12278,"authors_orcid":12280,"year":10455,"doi":12281,"openalex_id":12282,"venue":12283,"abstract_screenshot":21,"keywords":12284,"body":12290,"_type":51,"_id":12294,"_source":53,"_file":12295,"_stem":12296,"_extension":56,"locale":57},"\u002Fpublications\u002F2023\u002Fprotocol-for-classification-single-cell-pbmc-types-from-pathological-samples-usi","Protocol for Classification Single-Cell PBMC Types from Pathological Samples",[7467,12279,7302,7469,7470,7471,5888],"Xin, Lin",[7474,21,7310,7476,7477,7478,5890],"https:\u002F\u002Fdoi.org\u002F10.1007\u002F978-1-0716-3239-0_4","W4378801450","Methods in molecular biology",[7485,37,215,12285,12286,23,3441,8226,12287,4606,12288,8228,8330,380,8329,4608,12289,632],"Preprocessor","Protocol (science)","Immune system","Supervised learning","Pathology",{"type":39,"children":12291,"toc":12292},[],{"title":8,"searchDepth":49,"depth":49,"links":12293},[],"content:publications:2023:protocol-for-classification-single-cell-pbmc-types-from-pathological-samples-usi.md","publications\u002F2023\u002Fprotocol-for-classification-single-cell-pbmc-types-from-pathological-samples-usi.md","publications\u002F2023\u002Fprotocol-for-classification-single-cell-pbmc-types-from-pathological-samples-usi",{"_path":12298,"_dir":10450,"_draft":7,"_partial":7,"_locale":8,"title":12299,"description":8,"_hidden":7,"authors":12300,"authors_orcid":12307,"year":10455,"doi":12314,"openalex_id":12315,"venue":10505,"abstract_screenshot":21,"keywords":12316,"body":12322,"_type":51,"_id":12326,"_source":53,"_file":12327,"_stem":12328,"_extension":56,"locale":57},"\u002Fpublications\u002F2023\u002Fregion-aware-rgb-and-near-infrared-image-fusion","Region-aware RGB and near-infrared image fusion",[12301,12302,12303,12304,12305,5532,12306],"Ying, Jiacheng","Tong, Can","Sheng, Zehua","Yao, Bowen","Cao, Si-Yuan","Shen, Hui‐Liang",[12308,12309,12310,12311,12312,5537,12313],"0000-0002-8721-003X","0000-0002-1446-3810","0000-0002-1721-9143","0000-0003-1448-8898","0000-0001-5143-4501","0000-0001-8469-019X","https:\u002F\u002Fdoi.org\u002F10.1016\u002Fj.patcog.2023.109717","W4378418210",[37,12317,7754,9189,23,4391,12318,12319,9091,12320,10203,4004,3789,3597,8731,12321],"Sky","Specular reflection","Image fusion","Distortion (music)","Astrophysics",{"type":39,"children":12323,"toc":12324},[],{"title":8,"searchDepth":49,"depth":49,"links":12325},[],"content:publications:2023:region-aware-rgb-and-near-infrared-image-fusion.md","publications\u002F2023\u002Fregion-aware-rgb-and-near-infrared-image-fusion.md","publications\u002F2023\u002Fregion-aware-rgb-and-near-infrared-image-fusion",{"_path":12330,"_dir":10450,"_draft":7,"_partial":7,"_locale":8,"title":12331,"description":12332,"_hidden":7,"regression for deep learning authors":12333,"authors_orcid":12335,"year":10455,"doi":12337,"openalex_id":12338,"venue":12339,"abstract_screenshot":21,"keywords":12340,"body":12342,"_type":51,"_id":12350,"_source":53,"_file":12351,"_stem":12352,"_extension":56,"locale":57},"\u002Fpublications\u002F2023\u002Freliable-prediction-intervals-with-directly-optimized-inductive-conformal-regres","Reliable prediction intervals with directly optimized inductive conformal","By generating prediction intervals (PIs) to quantify the uncertainty of each prediction in deep learning regression, the risk of wrong predictions can be effectively controlled. High-quality PIs need to be as narrow as possible, whilst covering a preset proportion of real labels. At present, many approaches to improve the quality of PIs can effectively reduce the width of PIs, but they do not ensure that enough real labels are captured. Inductive Conformal Predictor (ICP) is an algorithm that can generate effective PIs which is theoretically guaranteed to cover a preset proportion of data. However, typically ICP is not directly optimized to yield minimal PI width. In this study, we propose Directly Optimized Inductive Conformal Regression (DOICR) for neural networks that takes only the average width of PIs as the loss function and increases the quality of PIs through an optimized scheme, under the validity condition that sufficient real labels are captured in the PIs. Benchmark experiments show that DOICR outperforms current state-of-the-art algorithms for regression problems using underlying Deep Neural Network structures for both tabular and image data.",[12334,4189],"Lei, Haocheng",[12336,4191],"0000-0002-2351-0439","https:\u002F\u002Fdoi.org\u002F10.1016\u002Fj.neunet.2023.09.008","W4386860576","Neural Networks",[209,3663,7446,632,23,37,1009,100,4876,12341,215,332,181,34,3666],"Prediction interval",{"type":39,"children":12343,"toc":12348},[12344],{"type":42,"tag":43,"props":12345,"children":12346},{},[12347],{"type":47,"value":12332},{"title":8,"searchDepth":49,"depth":49,"links":12349},[],"content:publications:2023:reliable-prediction-intervals-with-directly-optimized-inductive-conformal-regres.md","publications\u002F2023\u002Freliable-prediction-intervals-with-directly-optimized-inductive-conformal-regres.md","publications\u002F2023\u002Freliable-prediction-intervals-with-directly-optimized-inductive-conformal-regres",{"_path":12354,"_dir":10450,"_draft":7,"_partial":7,"_locale":8,"title":12355,"description":12356,"_hidden":7,"authors":12357,"authors_orcid":12358,"year":10455,"doi":12359,"openalex_id":12360,"venue":4068,"abstract_screenshot":21,"keywords":12361,"body":12362,"_type":51,"_id":12370,"_source":53,"_file":12371,"_stem":12372,"_extension":56,"locale":57},"\u002Fpublications\u002F2023\u002Fremaking-the-chinese-academy-of-sciences","Remaking the Chinese Academy of Sciences","Under pressure to reinvent itself, the CAS should concentrate on managing large-scale research infrastructures.",[9894,9895,65],[21,9897,70],"https:\u002F\u002Fdoi.org\u002F10.1126\u002Fscience.add3428","W4317567185",[8303,1358,3745,1380,282,3259,23],{"type":39,"children":12363,"toc":12368},[12364],{"type":42,"tag":43,"props":12365,"children":12366},{},[12367],{"type":47,"value":12356},{"title":8,"searchDepth":49,"depth":49,"links":12369},[],"content:publications:2023:remaking-the-chinese-academy-of-sciences.md","publications\u002F2023\u002Fremaking-the-chinese-academy-of-sciences.md","publications\u002F2023\u002Fremaking-the-chinese-academy-of-sciences",{"_path":12374,"_dir":10450,"_draft":7,"_partial":7,"_locale":8,"title":12375,"description":12376,"_hidden":7,"authors":12377,"authors_orcid":12378,"year":10455,"doi":12379,"openalex_id":12380,"venue":21,"abstract_screenshot":21,"keywords":12381,"body":12388,"_type":51,"_id":12396,"_source":53,"_file":12397,"_stem":12398,"_extension":56,"locale":57},"\u002Fpublications\u002F2023\u002Fsc-gan-structure-consistent-gan-for-modality-transfer-with-fft-and-multi-scale-p","SC-GAN: Structure Consistent GAN for Modality Transfer with FFT and Multi-Scale Perception","The quality of the cornea endothelial microscopy image is critical for clinical analysis. Although the noncontact specular microscope is more user-friendly than the contact confocal microscope, the imaging quality of the specular microscope is lower. The modality transfer is a promising solution for image quality enhancement. This paper proposes a Structure Consistent Generative Adversarial Network (SC-GAN) to transfer the imaging style from the specular microscope to the confocal microscope. Specifically, we use the Fourier frequency domain consistency to preserve cell structure and propose a multi-scale perception discriminator to improve model robustness under cell size variation. Experiment results prove the effectiveness of our method.",[11483,11482,12,11485,8406],[11488,11487,15,11490,8409],"https:\u002F\u002Fdoi.org\u002F10.1109\u002Fisbi53787.2023.10230436","W4386362621",[12382,12318,12383,8731,3961,12384,23,4391,12385,37,12386,353,12387,753,3597,4004],"Microscope","Confocal","Microscopy","Image quality","Optical transfer function","Structured light",{"type":39,"children":12389,"toc":12394},[12390],{"type":42,"tag":43,"props":12391,"children":12392},{},[12393],{"type":47,"value":12376},{"title":8,"searchDepth":49,"depth":49,"links":12395},[],"content:publications:2023:sc-gan-structure-consistent-gan-for-modality-transfer-with-fft-and-multi-scale-p.md","publications\u002F2023\u002Fsc-gan-structure-consistent-gan-for-modality-transfer-with-fft-and-multi-scale-p.md","publications\u002F2023\u002Fsc-gan-structure-consistent-gan-for-modality-transfer-with-fft-and-multi-scale-p",{"_path":12400,"_dir":10450,"_draft":7,"_partial":7,"_locale":8,"title":12401,"description":12402,"_hidden":7,"Internet of Things authors":12403,"authors_orcid":12406,"year":10455,"doi":12407,"openalex_id":12408,"venue":9425,"abstract_screenshot":21,"keywords":12409,"body":12414,"_type":51,"_id":12477,"_source":53,"_file":12478,"_stem":12479,"_extension":56,"locale":57},"\u002Fpublications\u002F2023\u002Fshort-term-and-long-term-throughput-maximization-in-mobile-wireless-powered-inte","Short-Term and Long-Term Throughput Maximization in Mobile Wireless-Powered","With the evolution of Internet of Things (IoT), some IoT nodes possess a certain degree of mobility, and the gains of the corresponding channels vary dramatically, incurring the energy supply problem for IoT nodes. To tackle this problem, we study a wireless-powered IoT (WPIoT), where a static  UUU  -antenna hybrid access point (HAP) coordinates the wireless energy transfer to mobile single-antenna IoT nodes and receives data from these IoT nodes. When IoT nodes have sufficient energy for transmitting generated data packets, we propose a generated data packets-based throughput maximization (GDPTM) algorithm for the short-term throughput maximization, and the GDPTM algorithm is designed to save nodes’ energy while transmitting all the generated data packets. Through monotonicity analysis, we prove the existence of the optimal transmit power that maximizes the throughput. When IoT nodes do not have sufficient energy for transmitting generated data packets, we propose a deep deterministic policy gradient (DDPG)-based multinode resource allocation (DMRA) algorithm. Through designing the action space, we find that the HAP under the DMRA algorithm manages the time, transmit power, and channel allocation of IoT nodes to improve the throughput. Numerical results validate that, when IoT nodes have sufficient energy, the GDPTM algorithm saves nodes’ energy and improves the throughput. When IoT nodes do not have sufficient energy, the DMRA algorithm also improves the throughput.",[9414,12404,12405,9413,9416],"Luo, Rongwei","Wang, Zuxin",[9420,21,21,9419,9422],"https:\u002F\u002Fdoi.org\u002F10.1109\u002Fjiot.2023.3326440","W4387885891",[12410,23,5547,5998,251,12411,12412,6629,12413,288,31],"Term (time)","Mobile telephony","Mobile computing","Mobile radio",{"type":39,"children":12415,"toc":12475},[12416],{"type":42,"tag":43,"props":12417,"children":12418},{},[12419,12421,12473],{"type":47,"value":12420},"With the evolution of Internet of Things (IoT), some IoT nodes possess a certain degree of mobility, and the gains of the corresponding channels vary dramatically, incurring the energy supply problem for IoT nodes. To tackle this problem, we study a wireless-powered IoT (WPIoT), where a static ",{"type":42,"tag":8789,"props":12422,"children":12423},{"xmlns:mml":1465,"xmlnsXLink":8791},[12424,12425],{"type":47,"value":8794},{"type":42,"tag":8796,"props":12426,"children":12427},{"notation":8798},[12428,12472],{"type":42,"tag":809,"props":12429,"children":12431},{"className":12430},[1455],[12432,12454],{"type":42,"tag":809,"props":12433,"children":12435},{"className":12434},[1460],[12436],{"type":42,"tag":1463,"props":12437,"children":12438},{"xmlns":1465},[12439],{"type":42,"tag":1468,"props":12440,"children":12441},{},[12442,12450],{"type":42,"tag":1472,"props":12443,"children":12444},{},[12445],{"type":42,"tag":1494,"props":12446,"children":12447},{},[12448],{"type":47,"value":12449},"U",{"type":42,"tag":2265,"props":12451,"children":12452},{"encoding":2267},[12453],{"type":47,"value":12449},{"type":42,"tag":809,"props":12455,"children":12457},{"className":12456,"ariaHidden":1484},[2274],[12458],{"type":42,"tag":809,"props":12459,"children":12461},{"className":12460},[2279],[12462,12467],{"type":42,"tag":809,"props":12463,"children":12466},{"className":12464,"style":12465},[2284],"height:0.6833em;",[],{"type":42,"tag":809,"props":12468,"children":12470},{"className":12469,"style":2589},[2290,2313],[12471],{"type":47,"value":12449},{"type":47,"value":8794},{"type":47,"value":12474}," -antenna hybrid access point (HAP) coordinates the wireless energy transfer to mobile single-antenna IoT nodes and receives data from these IoT nodes. When IoT nodes have sufficient energy for transmitting generated data packets, we propose a generated data packets-based throughput maximization (GDPTM) algorithm for the short-term throughput maximization, and the GDPTM algorithm is designed to save nodes’ energy while transmitting all the generated data packets. Through monotonicity analysis, we prove the existence of the optimal transmit power that maximizes the throughput. When IoT nodes do not have sufficient energy for transmitting generated data packets, we propose a deep deterministic policy gradient (DDPG)-based multinode resource allocation (DMRA) algorithm. Through designing the action space, we find that the HAP under the DMRA algorithm manages the time, transmit power, and channel allocation of IoT nodes to improve the throughput. Numerical results validate that, when IoT nodes have sufficient energy, the GDPTM algorithm saves nodes’ energy and improves the throughput. When IoT nodes do not have sufficient energy, the DMRA algorithm also improves the throughput.",{"title":8,"searchDepth":49,"depth":49,"links":12476},[],"content:publications:2023:short-term-and-long-term-throughput-maximization-in-mobile-wireless-powered-inte.md","publications\u002F2023\u002Fshort-term-and-long-term-throughput-maximization-in-mobile-wireless-powered-inte.md","publications\u002F2023\u002Fshort-term-and-long-term-throughput-maximization-in-mobile-wireless-powered-inte",{"_path":12481,"_dir":10450,"_draft":7,"_partial":7,"_locale":8,"title":12482,"description":12483,"_hidden":7,"authors":12484,"authors_orcid":12486,"year":10455,"doi":12488,"openalex_id":12489,"venue":5791,"abstract_screenshot":21,"keywords":12490,"body":12494,"_type":51,"_id":12502,"_source":53,"_file":12503,"_stem":12504,"_extension":56,"locale":57},"\u002Fpublications\u002F2023\u002Fsiamese-discriminant-deep-reinforcement-learning-for-solving-jigsaw-puzzles-with","Siamese-Discriminant Deep Reinforcement Learning for Solving Jigsaw Puzzles with Large Eroded Gaps","Jigsaw puzzle solving has recently become an emerging research area. The developed techniques have been widely used in applications beyond puzzle solving. This paper focuses on solving Jigsaw Puzzles with Large Eroded Gaps (JPwLEG). We formulate the puzzle reassembly as a combinatorial optimization problem and propose a Siamese-Discriminant Deep Reinforcement Learning (SD2RL) to solve it. A Deep Q-network (DQN) is designed to visually understand the puzzles, which consists of two sets of Siamese Discriminant Networks, one set to perceive the pairwise relations between vertical neighbors and another set for horizontal neighbors. The proposed DQN considers not only the evidence from the incumbent fragment but also the support from its four neighbors. The DQN is trained using replay experience with carefully designed rewards to guide the search for a sequence of fragment swaps to reach the correct puzzle solution. Two JPwLEG datasets are constructed to evaluate the proposed method, and the experimental results show that the proposed SD2RL significantly outperforms state-of-the-art methods.",[12485,7198,8405,6135,6111,12],"Song, Xingke",[12487,7202,21,6137,6113,15],"0000-0003-1022-6823","https:\u002F\u002Fdoi.org\u002F10.1609\u002Faaai.v37i2.25325","W4382450481",[12491,12492,5304,23,9059,37,101,12493,215,3358,34,866,179],"Jigsaw","Pairwise comparison","Reinforcement",{"type":39,"children":12495,"toc":12500},[12496],{"type":42,"tag":43,"props":12497,"children":12498},{},[12499],{"type":47,"value":12483},{"title":8,"searchDepth":49,"depth":49,"links":12501},[],"content:publications:2023:siamese-discriminant-deep-reinforcement-learning-for-solving-jigsaw-puzzles-with.md","publications\u002F2023\u002Fsiamese-discriminant-deep-reinforcement-learning-for-solving-jigsaw-puzzles-with.md","publications\u002F2023\u002Fsiamese-discriminant-deep-reinforcement-learning-for-solving-jigsaw-puzzles-with",{"_path":12506,"_dir":10450,"_draft":7,"_partial":7,"_locale":8,"title":12507,"description":12508,"_hidden":7,"with Reinforcement Learning authors":12509,"authors_orcid":12511,"year":10455,"doi":12513,"openalex_id":12514,"venue":21,"abstract_screenshot":12515,"keywords":12516,"body":12519,"_type":51,"_id":12527,"_source":53,"_file":12528,"_stem":12529,"_extension":56,"locale":57},"\u002Fpublications\u002F2023\u002Fspot-electricity-market-bidding-strategy-optimization-based-on-risk-analysis-wit","Spot Electricity Market Bidding Strategy Optimization Based on Risk Analysis","Great effort has been made to restructure the traditional monopolization of power industries to introduce fair competition.The deregulation of the electricity market allows the price of electricity to be formulated based on the bidding price.Nevertheless, it is still challenging to derive an optimal bidding strategy with many factors that need to be considered.This paper proposes a reinforcement learning (RL) based method to devise an optimal bidding strategy for maximizing the profit, taking the risk preferences in the spot electricity market into consideration.The problem is formulated based on Markov decision process (MDP), which is a discrete stochastic optimization method.The objective function is to optimize the cumulative profit over the span.This method also employs temporal difference technique and actor-critic learning algorithm for strategy optimization.In addition, the study introduces smartmarket market-clearing method and a Gaussian distribution to formulate the strategy.Two different environmental conditions of the spot electricity market, static and dynamic, are applied in the simulation for analysis completeness.Only the target plant can adjust the bidding strategy in the static environment while all plants can adjust the bidding strategy in the dynamic environment.Simulation cases of nine participants are considered and the obtained results are analyzed.",[11352,12510,5667],"Li, Kengjie",[12512,21,5670],"0000-0001-5453-2377","https:\u002F\u002Fdoi.org\u002F10.46855\u002Fenergy-proceedings-10502","W4383616516","spot-electricity-market-bidding-strategy-optimization-based-on-risk-analysis-wit.png",[743,5304,12517,12518,12493,23,178,7631,37,36,179],"Electricity market","Electricity",{"type":39,"children":12520,"toc":12525},[12521],{"type":42,"tag":43,"props":12522,"children":12523},{},[12524],{"type":47,"value":12508},{"title":8,"searchDepth":49,"depth":49,"links":12526},[],"content:publications:2023:spot-electricity-market-bidding-strategy-optimization-based-on-risk-analysis-wit.md","publications\u002F2023\u002Fspot-electricity-market-bidding-strategy-optimization-based-on-risk-analysis-wit.md","publications\u002F2023\u002Fspot-electricity-market-bidding-strategy-optimization-based-on-risk-analysis-wit",{"_path":12531,"_dir":10450,"_draft":7,"_partial":7,"_locale":8,"title":12532,"description":12533,"_hidden":7,"system and their implications authors":12534,"authors_orcid":12537,"year":10455,"doi":12540,"openalex_id":12541,"venue":12542,"abstract_screenshot":21,"keywords":12543,"body":12547,"_type":51,"_id":12555,"_source":53,"_file":12556,"_stem":12557,"_extension":56,"locale":57},"\u002Fpublications\u002F2023\u002Fstronger-and-more-just-recent-reforms-of-china-s-intellectual-property-rights-sy","Stronger and more just? Recent reforms of China’s intellectual property rights","Purpose Since 2015, China has made efforts to reform its intellectual property rights (IPR) system to better protect and stimulate innovation. These reforms are a result of the demand for more stringent intellectual property (IP) protection from China’s domestic, innovative industries and a measure to ease the pressure exerted by its foreign trading partners, particularly against the background of the US-China trade dispute that started at the beginning of 2018. This paper summarizes these reforms and their implications. Design\u002Fmethodology\u002Fapproach This paper combines a variety of sources, including academic articles, government websites, news reports, industry surveys and expert opinions, to offer insights in China’s IPR system and its recent reforms. Findings This paper summarizes and discusses (1) the state’s law amendments, including the 2015 amendment of the “Law on Promoting the Transformation of Scientific and Technological Achievements”, the second amendment of the “Anti-Unfair Competition Law” with regard to trade secret protection, the fourth amendment of the “Patent Law”, and the legislations and regulations addressing the criticisms of the US administration over China’s so-called “forced” technology transfer policies; (2) the establishment of the specialized IP courts and tribunals since 2014; (3) the restructuring of the State IP Office; and (4) the issuing of an “Outline for Building an IPR Powerhouse (2021–2035)”. Originality\u002Fvalue This paper highlights China’s efforts to make its IPR system stronger and more just. It also discusses international observers’ reactions and pinpoints specific areas for further improvement.",[12535,65,12536],"Huang, Can","Coreynen, Wim",[12538,70,12539],"0009-0006-9126-3069","0000-0003-1448-1530","https:\u002F\u002Fdoi.org\u002F10.1108\u002Fapjie-04-2023-0081","W4389765682","Asia Pacific Journal of Innovation and Entrepreneurship",[12046,282,12544,4263,3255,8021,178,12545,5443,12546,1358,36,3259],"Restructuring","State (computer science)","Law and economics",{"type":39,"children":12548,"toc":12553},[12549],{"type":42,"tag":43,"props":12550,"children":12551},{},[12552],{"type":47,"value":12533},{"title":8,"searchDepth":49,"depth":49,"links":12554},[],"content:publications:2023:stronger-and-more-just-recent-reforms-of-china-s-intellectual-property-rights-sy.md","publications\u002F2023\u002Fstronger-and-more-just-recent-reforms-of-china-s-intellectual-property-rights-sy.md","publications\u002F2023\u002Fstronger-and-more-just-recent-reforms-of-china-s-intellectual-property-rights-sy",{"_path":12559,"_dir":10450,"_draft":7,"_partial":7,"_locale":8,"title":12560,"description":12561,"_hidden":7,"authors":12562,"authors_orcid":12564,"year":10455,"doi":12566,"openalex_id":12567,"venue":12568,"abstract_screenshot":21,"keywords":12569,"body":12574,"_type":51,"_id":12582,"_source":53,"_file":12583,"_stem":12584,"_extension":56,"locale":57},"\u002Fpublications\u002F2023\u002Fstructural-priors-guided-network-for-the-corneal-endothelial-cell-segmentation","Structural Priors Guided Network for the Corneal Endothelial Cell Segmentation","The segmentation of blurred cell boundaries in cornea endothelium microscope images is challenging, which affects the clinical parameter estimation accuracy. Existing deep learning methods only consider pixel-wise classification accuracy and lack of utilization of cell structure knowledge. Therefore, the segmentation of the blurred cell boundary is discontinuous. This paper proposes a structural prior guided network (SPG-Net) for corneal endothelium cell segmentation. We first employ a hybrid transformer convolution backbone to capture more global context. Then, we use Feature Enhancement (FE) module to improve the representation ability of features and Local Affinity-based Feature Fusion (LAFF) module to propagate structural information among hierarchical features. Finally, we introduce the joint loss based on cross entropy and structure similarity index measure (SSIM) to supervise the training process under pixel and structure levels. We compare the SPG-Net with various state-of-the-art methods on four corneal endothelial datasets. The experiment results suggest that the SPG-Net can alleviate the problem of discontinuous cell boundary segmentation and balance the pixel-wise accuracy and structure preservation. We also evaluate the agreement of parameter estimation between ground truth and the prediction of SPG-Net. The statistical analysis results show a good agreement and correlation.",[11482,11483,12563,595,12,11485,8406],"Zeng, Lingxi",[11487,11488,12565,599,15,11490,8409],"0009-0004-0234-4373","https:\u002F\u002Fdoi.org\u002F10.1109\u002Ftmi.2023.3300656","W4385453390","IEEE Transactions on Medical Imaging",[37,12570,9090,23,9091,11495,4876,12571,4391,7391,133,6875,12572,7389,12573],"Ground truth","Corneal endothelium","Scale-space segmentation","Cornea",{"type":39,"children":12575,"toc":12580},[12576],{"type":42,"tag":43,"props":12577,"children":12578},{},[12579],{"type":47,"value":12561},{"title":8,"searchDepth":49,"depth":49,"links":12581},[],"content:publications:2023:structural-priors-guided-network-for-the-corneal-endothelial-cell-segmentation.md","publications\u002F2023\u002Fstructural-priors-guided-network-for-the-corneal-endothelial-cell-segmentation.md","publications\u002F2023\u002Fstructural-priors-guided-network-for-the-corneal-endothelial-cell-segmentation",{"_path":12586,"_dir":10450,"_draft":7,"_partial":7,"_locale":8,"title":12587,"description":12588,"_hidden":7,"Dilated Convolution for Industrial Robots authors":12589,"authors_orcid":12594,"year":10455,"doi":12599,"openalex_id":12600,"venue":12601,"abstract_screenshot":21,"keywords":12602,"body":12603,"_type":51,"_id":12611,"_source":53,"_file":12612,"_stem":12613,"_extension":56,"locale":57},"\u002Fpublications\u002F2023\u002Fsurface-defect-detection-of-hot-rolled-steel-based-on-attention-mechanism-and-di","Surface Defect Detection of Hot Rolled Steel Based on Attention Mechanism and","In the manufacturing process of industrial robots, the defect detection of raw materials includes two types of tasks, which makes the defect detection guarantee its accuracy. It also makes the defect detection task challenging in practical work. In analyzing the disadvantages of the existing defect detection task methods, such as low precision and low generalization ability, a detection method on the basis of attention mechanism and dilated convolution module is proposed. In order to effectively extract features, a two-stage detection framework is chosen by applying Resnet50 as the pre-training network of our model. With this foundation, the attention mechanism and dilated convolution are utilized. With the attention mechanism, the network can focus on the features of effective regions and suppress the invalid regions during detection. With dilated convolution, the receptive field of the model can be increased without increasing the calculation amount of the model. As a result, it can achieve a larger receptive field, which will obtain more dense data and improve the detection effect of small target defects. Finally, great experiments are conducted on the NEU-DET dataset. Compared with the baseline network, the proposed method in this paper achieves 81.79% mAP, which are better results.",[12590,11896,12591,12592,9416,12593],"Yu, Yuanfan","Tang, Tinglong","Zhou, Xiaolong","Zhang, Hongkai",[12595,11901,12596,12597,9422,12598],"0000-0002-7138-1539","0000-0002-6301-3592","0000-0003-0732-5169","0000-0002-5309-1984","https:\u002F\u002Fdoi.org\u002F10.3390\u002Felectronics12081856","W4365512786","Electronics",[6802,23,37,135,7599,7627,6144,529,5417,4876,4391,632,179,34],{"type":39,"children":12604,"toc":12609},[12605],{"type":42,"tag":43,"props":12606,"children":12607},{},[12608],{"type":47,"value":12588},{"title":8,"searchDepth":49,"depth":49,"links":12610},[],"content:publications:2023:surface-defect-detection-of-hot-rolled-steel-based-on-attention-mechanism-and-di.md","publications\u002F2023\u002Fsurface-defect-detection-of-hot-rolled-steel-based-on-attention-mechanism-and-di.md","publications\u002F2023\u002Fsurface-defect-detection-of-hot-rolled-steel-based-on-attention-mechanism-and-di",{"_path":12615,"_dir":10450,"_draft":7,"_partial":7,"_locale":8,"title":12616,"description":12617,"_hidden":7,"stability\" authors":12618,"authors_orcid":12621,"year":10455,"doi":12624,"openalex_id":12625,"venue":12626,"abstract_screenshot":21,"keywords":12627,"body":12635,"_type":51,"_id":12643,"_source":53,"_file":12644,"_stem":12645,"_extension":56,"locale":57},"\u002Fpublications\u002F2023\u002Fthe-appropriate-level-of-financial-inclusion-the-perspective-of-financial-stabil","The appropriate level of financial inclusion: The perspective of financia","We construct a global financial inclusion index using data from the World Bank, IMF, and V-Lab and propose an inverted U-shaped relationship between financial inclusion and financial stability. The empirical evidence supports our hypotheses, and the impact of financial inclusion on financial stability is less prominent under strong regulation and supervision. In addition, we use our constructed financial inclusion index, capital adequacy ratio, market power, and macroeconomic variables to simulate and predict the financial crisis. Our research has important policy implications and provides valuable insights to financial regulatory authorities in making decisions related to financial inclusion and financial stability.",[268,12619,12620],"bi, jianda","Shi, Haoqian",[21,12622,12623],"0000-0001-6423-0225","0000-0002-4649-1752","https:\u002F\u002Fdoi.org\u002F10.1016\u002Fj.ceqi.2023.08.001","W4386469981","China Economic Quarterly International",[7154,834,12628,12629,831,1357,429,12630,12631,12632,12633,36,178,5444,3546,407,12634],"Financial ratio","Financial stability","Financial analysis","Financial regulation","Accounting management","Indirect finance","Accounting information system",{"type":39,"children":12636,"toc":12641},[12637],{"type":42,"tag":43,"props":12638,"children":12639},{},[12640],{"type":47,"value":12617},{"title":8,"searchDepth":49,"depth":49,"links":12642},[],"content:publications:2023:the-appropriate-level-of-financial-inclusion-the-perspective-of-financial-stabil.md","publications\u002F2023\u002Fthe-appropriate-level-of-financial-inclusion-the-perspective-of-financial-stabil.md","publications\u002F2023\u002Fthe-appropriate-level-of-financial-inclusion-the-perspective-of-financial-stabil",{"_path":12647,"_dir":10450,"_draft":7,"_partial":7,"_locale":8,"title":12648,"description":12649,"_hidden":7,"authors":12650,"authors_orcid":12651,"year":10455,"doi":12652,"openalex_id":12653,"venue":12654,"abstract_screenshot":21,"keywords":12655,"body":12656,"_type":51,"_id":12664,"_source":53,"_file":12665,"_stem":12666,"_extension":56,"locale":57},"\u002Fpublications\u002F2023\u002Fthe-political-economy-of-science-technology-and-innovation-in-china","The Political Economy of Science, Technology, and Innovation in China","There are a variety of reasons underlying the remarkable development of science and technology (S&T), and innovation in post-1978 China. This book seeks to achieve an understanding of such development from an institutional or a political economy perspective. Departing from the literature of S&T and innovation studies that treats innovation as a market or enterprise's behavior in Schumpeter's sense, Sun and Cao argue that it involves politics, institutions, and the role of the state. In particular, they examine how the Chinese state has played its visible role in making innovation policies, allocating funding for R&D programs, making efforts to attract talent, and organizing critical S&T programs. This book appeals to scholars in S&T and innovation policy, political economy, innovation governance, and China studies as well as policymakers and business executives.",[3538,65],[3540,70],"https:\u002F\u002Fdoi.org\u002F10.1017\u002F9781108854269","W4385639222","Cambridge University Press eBooks",[282,5153,12545,3257,5443,1358,3468,3712,7728,36,3746],{"type":39,"children":12657,"toc":12662},[12658],{"type":42,"tag":43,"props":12659,"children":12660},{},[12661],{"type":47,"value":12649},{"title":8,"searchDepth":49,"depth":49,"links":12663},[],"content:publications:2023:the-political-economy-of-science-technology-and-innovation-in-china.md","publications\u002F2023\u002Fthe-political-economy-of-science-technology-and-innovation-in-china.md","publications\u002F2023\u002Fthe-political-economy-of-science-technology-and-innovation-in-china",{"_path":12668,"_dir":10450,"_draft":7,"_partial":7,"_locale":8,"title":12669,"description":8,"_hidden":7,"transformations in computer vision authors":12670,"authors_orcid":12672,"year":10455,"doi":12674,"openalex_id":12675,"venue":7279,"abstract_screenshot":21,"keywords":12676,"body":12680,"_type":51,"_id":12684,"_source":53,"_file":12685,"_stem":12686,"_extension":56,"locale":57},"\u002Fpublications\u002F2023\u002Ftoward-extracting-and-exploiting-generalizable-knowledge-of-deep-2d-transformati","Toward extracting and exploiting generalizable knowledge of deep 2D",[12671,9014,8931],"Kang, Jiachen",[12673,9020,8937],"0000-0003-2522-2462","https:\u002F\u002Fdoi.org\u002F10.1016\u002Fj.neucom.2023.126882","W4387502127",[12677,23,37,12678,215,7281,6976,632,6300,12679,4876],"Generalizability theory","Estimator","Knowledge extraction",{"type":39,"children":12681,"toc":12682},[],{"title":8,"searchDepth":49,"depth":49,"links":12683},[],"content:publications:2023:toward-extracting-and-exploiting-generalizable-knowledge-of-deep-2d-transformati.md","publications\u002F2023\u002Ftoward-extracting-and-exploiting-generalizable-knowledge-of-deep-2d-transformati.md","publications\u002F2023\u002Ftoward-extracting-and-exploiting-generalizable-knowledge-of-deep-2d-transformati",{"_path":12688,"_dir":10450,"_draft":7,"_partial":7,"_locale":8,"title":12689,"description":12690,"_hidden":7,"authors":12691,"authors_orcid":12693,"year":10455,"doi":12694,"openalex_id":12695,"venue":9362,"abstract_screenshot":21,"keywords":12696,"body":12704,"_type":51,"_id":12712,"_source":53,"_file":12713,"_stem":12714,"_extension":56,"locale":57},"\u002Fpublications\u002F2023\u002Ftraditional-chinese-culture-approach-to-corporate-social-responsibility","Traditional Chinese Culture Approach to Corporate Social Responsibility","In this study, we adopt case studies of four local corporations in China to explore how traditional Chinese culture (TCC) influences corporate social responsibility (CSR) in a more systematic and in-depth approach. We collected both archival data and first-hand data via 14 in-depth interviews in 2021. The findings extend the roles of TCC in CSR — ‘harmony’, ‘holism and balance’ and ‘detrimental’, uncover Mohist harmony and Confucianism—Legalism balance. Besides, the relationships between TCC and CSR are affected by leadership, corporate culture, human resource management and employee’s engagement. This study enriches the research on management, CSR and culture by connecting ancient wisdom that has guided generations over thousands of years to contemporary issues of business ethics. We provide some managerial implications for CSR practitioners in the Greater China area and East Asia that are deeply rooted in TCC.",[12692,65],"LI, Jianliang",[21,70],"https:\u002F\u002Fdoi.org\u002F10.5465\u002Famproc.2023.15339abstract","W4385225449",[12697,11786,282,12698,12699,11043,12700,12701,12702,12703,1380,6927,1358,178,865,3259,6928,5949],"Harmony (color)","Legalism (Western philosophy)","Holism","Chinese culture","Mohism","Environmental ethics","Balance (ability)",{"type":39,"children":12705,"toc":12710},[12706],{"type":42,"tag":43,"props":12707,"children":12708},{},[12709],{"type":47,"value":12690},{"title":8,"searchDepth":49,"depth":49,"links":12711},[],"content:publications:2023:traditional-chinese-culture-approach-to-corporate-social-responsibility.md","publications\u002F2023\u002Ftraditional-chinese-culture-approach-to-corporate-social-responsibility.md","publications\u002F2023\u002Ftraditional-chinese-culture-approach-to-corporate-social-responsibility",{"_path":12716,"_dir":10450,"_draft":7,"_partial":7,"_locale":8,"title":12717,"description":12718,"_hidden":7,"authors":12719,"authors_orcid":12723,"year":10455,"doi":12726,"openalex_id":12727,"venue":21,"abstract_screenshot":21,"keywords":12728,"body":12730,"_type":51,"_id":12738,"_source":53,"_file":12739,"_stem":12740,"_extension":56,"locale":57},"\u002Fpublications\u002F2023\u002Fug-net-corneal-endothelial-cell-segmentation-based-on-uncertainty-estimation-and","UG-Net: Corneal Endothelial Cell Segmentation Based on Uncertainty Estimation and Soft Spatial Attention","Corneal endothelial cell segmentation of the microscope image is critical for clinical parameters quantification. However, the low-contrast regions are ambiguous and hard to segment. The uncertainty has been proved to be effective for detecting the ambiguous regions. Besides, spatial attention can guide the model to focus on the region of interest during the training process. This paper proposes an Uncertainty Guided Network (UG-Net) for corneal endothelial cell segmentation based on uncertainty estimation and spatial attention. We first use Bayesian approximation to obtain aleatoric and epistemic uncertainty maps. Then, two uncertainty maps are utilized to guide the model to focus on the low-contrast regions with uncertainty-based soft spatial attention. Experimental results show that the proposed method performs better than other state-of-the-art methods.",[11482,12720,12721,12722,595,12,11485,8406],"Wang, Wei","Wang, Biao","Cai, Zichao",[11487,12724,12725,21,599,15,11490,8409],"0009-0005-3401-5184","0000-0003-4656-8278","https:\u002F\u002Fdoi.org\u002F10.1109\u002Fisbi53787.2023.10230682","W4386362599",[9090,9762,37,23,12729,135,11495,5591,9692,4876,4391,215,8731,179],"Contrast (vision)",{"type":39,"children":12731,"toc":12736},[12732],{"type":42,"tag":43,"props":12733,"children":12734},{},[12735],{"type":47,"value":12718},{"title":8,"searchDepth":49,"depth":49,"links":12737},[],"content:publications:2023:ug-net-corneal-endothelial-cell-segmentation-based-on-uncertainty-estimation-and.md","publications\u002F2023\u002Fug-net-corneal-endothelial-cell-segmentation-based-on-uncertainty-estimation-and.md","publications\u002F2023\u002Fug-net-corneal-endothelial-cell-segmentation-based-on-uncertainty-estimation-and",{"_path":12742,"_dir":10450,"_draft":7,"_partial":7,"_locale":8,"title":12743,"description":8,"_hidden":7,"authors":12744,"authors_orcid":12745,"year":10455,"doi":12746,"openalex_id":12747,"venue":10770,"abstract_screenshot":21,"keywords":12748,"body":12750,"_type":51,"_id":12754,"_source":53,"_file":12755,"_stem":12756,"_extension":56,"locale":57},"\u002Fpublications\u002F2023\u002Fusing-digital-pedagogy-to-redefine-design-education","Using Digital Pedagogy to Redefine Design Education",[7077,7078,595,7079],[7081,7082,599,7083],"https:\u002F\u002Fdoi.org\u002F10.1007\u002F978-3-031-32811-4_10","W4385323808",[133,4387,4831,23,12749,1379,179,866,867,629,865,868,289,1358],"Bachelor",{"type":39,"children":12751,"toc":12752},[],{"title":8,"searchDepth":49,"depth":49,"links":12753},[],"content:publications:2023:using-digital-pedagogy-to-redefine-design-education.md","publications\u002F2023\u002Fusing-digital-pedagogy-to-redefine-design-education.md","publications\u002F2023\u002Fusing-digital-pedagogy-to-redefine-design-education",{"_path":12758,"_dir":10450,"_draft":7,"_partial":7,"_locale":8,"title":12759,"description":12760,"_hidden":7,"authors":12761,"authors_orcid":12764,"year":10455,"doi":12766,"openalex_id":12767,"venue":21,"abstract_screenshot":21,"keywords":12768,"body":12769,"_type":51,"_id":12777,"_source":53,"_file":12778,"_stem":12779,"_extension":56,"locale":57},"\u002Fpublications\u002F2023\u002Fusing-obfuscators-to-test-compilers-a-metamorphic-experience","Using Obfuscators to Test Compilers: A Metamorphic Experience","Android compilers play a crucial role in Android app development. The correctness of the apps relies on the compilers because the source code of the app is translated into the target language by the compilers. The use of obfuscators is becoming the standard in app development to prevent reverse engineering or code tampering. Despite their importance, both compilers and obfuscators lack an oracle, which is the mechanism to determine the correctness of the execution, and hence they can be called untestable software. Metamorphic Testing (MT) is a state-of-the-art testing method that can test untestable software. MT tests software based on Metamorphic Relations (MRs). Recent studies have shown that program transformation, an MT-based compiler-testing strategy, is highly effective in revealing bugs in compilers. However, this strategy requires sophisticated tools that could take significant time to develop. Therefore, program transformation using obfuscators is proposed. Based on research into testing obfuscators using MT, it is suggested that an MT-based compiler-testing strategy could be achieved by using obfuscators. In addition, this method has the potential to detect bugs in both compilers and obfuscators. This paper reports on our experience using MT techniques to test compilers and obfuscators. We present three related MRs, two of which uncover evidence of faults.",[12762,595,12763],"Cho, Injae","Kar, Pushpendu",[21,599,12765],"0000-0003-4410-1172","https:\u002F\u002Fdoi.org\u002F10.1109\u002Fcompsac57700.2023.00276","W4385489102",[4359,23,3227,110,5259,607,605,1113],{"type":39,"children":12770,"toc":12775},[12771],{"type":42,"tag":43,"props":12772,"children":12773},{},[12774],{"type":47,"value":12760},{"title":8,"searchDepth":49,"depth":49,"links":12776},[],"content:publications:2023:using-obfuscators-to-test-compilers-a-metamorphic-experience.md","publications\u002F2023\u002Fusing-obfuscators-to-test-compilers-a-metamorphic-experience.md","publications\u002F2023\u002Fusing-obfuscators-to-test-compilers-a-metamorphic-experience",{"_path":12781,"_dir":10450,"_draft":7,"_partial":7,"_locale":8,"title":12782,"description":8,"_hidden":7,"authors":12783,"authors_orcid":12786,"year":10455,"doi":12788,"openalex_id":12789,"venue":12790,"abstract_screenshot":21,"keywords":12791,"body":12794,"_type":51,"_id":12798,"_source":53,"_file":12799,"_stem":12800,"_extension":56,"locale":57},"\u002Fpublications\u002F2023\u002Fwhy-zero-trust-framework-adoption-has-emerged-during-and-after-covid-19-pandemic","Why Zero Trust Framework Adoption has Emerged During and After Covid-19 Pandemic",[12784,8932,8931,12785],"Alalmaie, Abeer Z.","Alayan, Mohrah Saad",[12787,8938,8937,21],"0000-0001-7733-8163","https:\u002F\u002Fdoi.org\u002F10.1007\u002F978-3-031-28694-0_17","W4324277955","Lecture notes in networks and systems",[860,6410,6407,11556,28,7088,178,12792,6927,865,1358,380,179,870,12793],"Severe acute respiratory syndrome coronavirus 2 (SARS-CoV-2)","Virology",{"type":39,"children":12795,"toc":12796},[],{"title":8,"searchDepth":49,"depth":49,"links":12797},[],"content:publications:2023:why-zero-trust-framework-adoption-has-emerged-during-and-after-covid-19-pandemic.md","publications\u002F2023\u002Fwhy-zero-trust-framework-adoption-has-emerged-during-and-after-covid-19-pandemic.md","publications\u002F2023\u002Fwhy-zero-trust-framework-adoption-has-emerged-during-and-after-covid-19-pandemic",{"_path":12802,"_dir":10450,"_draft":7,"_partial":7,"_locale":8,"title":12803,"description":12804,"_hidden":7,"Attention-based CNN-BiLSTM authors":12805,"authors_orcid":12806,"year":10455,"doi":12807,"openalex_id":12808,"venue":21,"abstract_screenshot":21,"keywords":12809,"body":12812,"_type":51,"_id":12820,"_source":53,"_file":12821,"_stem":12822,"_extension":56,"locale":57},"\u002Fpublications\u002F2023\u002Fzero-trust-network-intrusion-detection-system-nids-using-auto-encoder-for-attent","Zero Trust Network Intrusion Detection System (NIDS) using Auto Encoder for","The large number of connected networks that underpin today’s IT ecosystem make them more vulnerable to cyber threats because of their connectivity, user diversity, amount of connected devices, and services and applications that are available worldwide. As a response to these cyberthreats, zero trust security has been recommended. However, it’s crucial to remember that this kind of security monitoring can be done by outside experts. When cloud-based third parties access network traces, there are threats to data security, thus the present trend in security monitoring needs to change to a \"Never Trust, Always Verify\" approach.",[12784,8932,8931],[12787,8938,8937],"https:\u002F\u002Fdoi.org\u002F10.1145\u002F3579375.3579376","W4324031742",[180,23,12810,3123,12811,11556],"Intrusion detection system","Network security",{"type":39,"children":12813,"toc":12818},[12814],{"type":42,"tag":43,"props":12815,"children":12816},{},[12817],{"type":47,"value":12804},{"title":8,"searchDepth":49,"depth":49,"links":12819},[],"content:publications:2023:zero-trust-network-intrusion-detection-system-nids-using-auto-encoder-for-attent.md","publications\u002F2023\u002Fzero-trust-network-intrusion-detection-system-nids-using-auto-encoder-for-attent.md","publications\u002F2023\u002Fzero-trust-network-intrusion-detection-system-nids-using-auto-encoder-for-attent",{"_path":12824,"_dir":12825,"_draft":7,"_partial":7,"_locale":8,"title":12826,"description":8,"_hidden":7,"authors":12827,"authors_orcid":12828,"year":12829,"doi":12830,"openalex_id":12831,"venue":374,"abstract_screenshot":21,"keywords":12832,"body":12836,"_type":51,"_id":12840,"_source":53,"_file":12841,"_stem":12842,"_extension":56,"locale":57},"\u002Fpublications\u002F2024\u002Fa-cascaded-retrieval-while-reasoning-multi-document-comprehension-framework-with","2024","A cascaded retrieval-while-reasoning multi-document comprehension framework with incremental attention for medical question answering",[6482,6111,12,9182,5816],[21,6113,15,9185,9184],2024,"https:\u002F\u002Fdoi.org\u002F10.1016\u002Fj.eswa.2024.125701","W4404734162",[12833,23,12834,6950,12835,37,4479,110],"Question answering","Comprehension","Document retrieval",{"type":39,"children":12837,"toc":12838},[],{"title":8,"searchDepth":49,"depth":49,"links":12839},[],"content:publications:2024:a-cascaded-retrieval-while-reasoning-multi-document-comprehension-framework-with.md","publications\u002F2024\u002Fa-cascaded-retrieval-while-reasoning-multi-document-comprehension-framework-with.md","publications\u002F2024\u002Fa-cascaded-retrieval-while-reasoning-multi-document-comprehension-framework-with",{"_path":12844,"_dir":12825,"_draft":7,"_partial":7,"_locale":8,"title":12845,"description":12846,"_hidden":7,"authors":12847,"authors_orcid":12850,"year":12829,"doi":12853,"openalex_id":12854,"venue":21,"abstract_screenshot":21,"keywords":12855,"body":12860,"_type":51,"_id":12868,"_source":53,"_file":12869,"_stem":12870,"_extension":56,"locale":57},"\u002Fpublications\u002F2024\u002Fa-hierarchical-cooperative-genetic-programming-for-complex-piecewise-symbolic-re","A Hierarchical Cooperative Genetic Programming for Complex Piecewise Symbolic Regression","In regression analysis, methodologies range from black-box approaches like artificial neural networks to white-box techniques like symbolic regression. Renowned for its trans-parency and interpretability, symbolic regression has become increasingly prominent in elucidating complex data relationships. Nevertheless, its effectiveness in managing complex piecewise symbolic regression tasks poses significant challenges. This paper introduces a novel Hierarchical Cooperative Genetic Program-ming (HCGP) framework to address this issue. The HCGP model utilizes a unique hierarchical structure, incorporating dual cooperative genetic programming (GP) populations. This innovative design significantly enhances the capability to solve complex piecewise symbolic regression problems. Implementing a scenario-based GP is central to the HCGP framework, which strategically selects the appropriate underlying calculation GP. This feature enables the system to autonomously learn and adapt to complex scenarios, selecting the most suitable calculation GPs for each case. Our HCGP approach distinguishes itself from traditional and state-of-the-art methods. It demonstrates particular proficiency in modeling piecewise expressions within complex scenarios. The empirical evaluation of our model, conducted using benchmark datasets, has exhibited its superior accuracy and computational efficiency. This progress emphasizes the potential of HCGP in sophisticated data modeling and marks a substantial advancement in a hierarchical structure in complex piecewise symbolic regression.",[5989,12848,12,319,12849],"Yi, Wenjie","Jin, Yaochu",[5991,12851,15,21,12852],"0000-0002-4764-0721","0000-0003-1100-0631","https:\u002F\u002Fdoi.org\u002F10.1109\u002Fcec60901.2024.10611754","W4401415918",[12856,97,12857,23,12858,37,1009,102,215,34,12859],"Symbolic regression","Piecewise","Segmented regression","Polynomial regression",{"type":39,"children":12861,"toc":12866},[12862],{"type":42,"tag":43,"props":12863,"children":12864},{},[12865],{"type":47,"value":12846},{"title":8,"searchDepth":49,"depth":49,"links":12867},[],"content:publications:2024:a-hierarchical-cooperative-genetic-programming-for-complex-piecewise-symbolic-re.md","publications\u002F2024\u002Fa-hierarchical-cooperative-genetic-programming-for-complex-piecewise-symbolic-re.md","publications\u002F2024\u002Fa-hierarchical-cooperative-genetic-programming-for-complex-piecewise-symbolic-re",{"_path":12872,"_dir":12825,"_draft":7,"_partial":7,"_locale":8,"title":12873,"description":12874,"_hidden":7,"authors":12875,"authors_orcid":12877,"year":12829,"doi":12880,"openalex_id":12881,"venue":1103,"abstract_screenshot":21,"keywords":12882,"body":12883,"_type":51,"_id":12891,"_source":53,"_file":12892,"_stem":12893,"_extension":56,"locale":57},"\u002Fpublications\u002F2024\u002Fa-median-based-fuzzy-approach-to-software-quality-evaluation","A Median-Based Fuzzy Approach to Software Quality Evaluation","Software quality evaluation is a challenging task in software engineering. A new group decision-making evaluation model is presented in this work. The new model is based on the Vlsekriterijumska optimizacija i KOmpromisno Resenje (VIKOR) technique, in which a group regret measurement and a group satisfaction measurement are provided to increase the number of reference criteria in the decision-making process. We choose the median to represent the center of the data. Based on this, an entropy-based weighting method is proposed and used to determine the weights of decision makers. A new normalized projection is explored to measure the closeness between two evaluation matrices in a Pythagorean fuzzy setting. Several experimental analyses demonstrate that the entropy-based weighting method developed in this study is superior to traditional weighting methods. The median-based data center provides support for stable decision outcomes. Four dynamic experiments are reported on in this paper: The first one shows that the decision results remain stable throughout the entire experimental range; the second one demonstrates that the proposed normalized projection measure outperforms traditional projection measure; the third one demonstrates that the newly developed VIKOR method outperforms the traditional VIKOR method; and the last one identifies the optimal range for the three parameters of the proposed comprehensive VIKOR model.",[10642,645,595,12876],"Zhou, Ling",[12878,650,599,12879],"0000-0001-9847-149X","0000-0002-8361-7414","https:\u002F\u002Fdoi.org\u002F10.26599\u002Ftst.2024.9010103","W4402435447",[6249,23,1165,747,139,661,181,37,138,179,110,3597],{"type":39,"children":12884,"toc":12889},[12885],{"type":42,"tag":43,"props":12886,"children":12887},{},[12888],{"type":47,"value":12874},{"title":8,"searchDepth":49,"depth":49,"links":12890},[],"content:publications:2024:a-median-based-fuzzy-approach-to-software-quality-evaluation.md","publications\u002F2024\u002Fa-median-based-fuzzy-approach-to-software-quality-evaluation.md","publications\u002F2024\u002Fa-median-based-fuzzy-approach-to-software-quality-evaluation",{"_path":12895,"_dir":12825,"_draft":7,"_partial":7,"_locale":8,"title":12896,"description":12897,"_hidden":7,"authors":12898,"authors_orcid":12900,"year":12829,"doi":12902,"openalex_id":12903,"venue":374,"abstract_screenshot":21,"keywords":12904,"body":12906,"_type":51,"_id":12914,"_source":53,"_file":12915,"_stem":12916,"_extension":56,"locale":57},"\u002Fpublications\u002F2024\u002Fa-pattern-based-algorithm-with-fuzzy-logic-bin-selector-for-online-bin-packing-p","A pattern-based algorithm with fuzzy logic bin selector for online bin packing problem","The online bin packing problem is a well-known optimization challenge that finds application in a wide range of real-world scenarios. In the paper, we propose a novel algorithm called FuzzyPatternPack(FPP), which leverages fuzzy inference and pattern-based predictions of the distribution of item sizes in online bin packing. In comparison to traditional heuristics like BestFit(BF) and FirstFit(FF), as well as the more recent PatternPack(PaP) and ProfilePacking(PrP) algorithm based on online predictions, FPP demonstrates competitive and superior performance in solving various benchmark problems. Particularly, it excels in addressing problems with evolving distributions, making it a promising solution for real-world applications where the item sizes may change over time. This research unveils the promising potential of employing fuzzy logic to effectively address uncertainty in scheduling and planning problems.",[9723,157,709,7302,12,319,12899],"Garibaldi, Jonathan M.",[9725,162,711,7310,15,322,12901],"0000-0002-9690-7074","https:\u002F\u002Fdoi.org\u002F10.1016\u002Fj.eswa.2024.123515","W4391900126",[9732,9733,506,23,209,6249,332,5997,12905,31,450,4649,181,37,34],"Online algorithm",{"type":39,"children":12907,"toc":12912},[12908],{"type":42,"tag":43,"props":12909,"children":12910},{},[12911],{"type":47,"value":12897},{"title":8,"searchDepth":49,"depth":49,"links":12913},[],"content:publications:2024:a-pattern-based-algorithm-with-fuzzy-logic-bin-selector-for-online-bin-packing-p.md","publications\u002F2024\u002Fa-pattern-based-algorithm-with-fuzzy-logic-bin-selector-for-online-bin-packing-p.md","publications\u002F2024\u002Fa-pattern-based-algorithm-with-fuzzy-logic-bin-selector-for-online-bin-packing-p",{"_path":12918,"_dir":12825,"_draft":7,"_partial":7,"_locale":8,"title":12919,"description":8,"_hidden":7,"Energy Harvesting authors":12920,"authors_orcid":12924,"year":12829,"doi":12927,"openalex_id":12928,"venue":74,"abstract_screenshot":21,"keywords":12929,"body":12933,"_type":51,"_id":12937,"_source":53,"_file":12938,"_stem":12939,"_extension":56,"locale":57},"\u002Fpublications\u002F2024\u002Fa-scenario-customizable-and-visual-rendering-simulator-for-on-vehicle-vibration","A Scenario-Customizable and Visual-Rendering Simulator for On-Vehicle Vibration",[12921,9304,12922,12923,6111,5942,157,709,5532],"Guo, Fangcheng","Thein, Chung Ket","Gao, Anqi",[21,9310,12925,21,21,5944,12926,711,5537],"0000-0001-8600-8561","0000-0002-3102-932X","https:\u002F\u002Fdoi.org\u002F10.2139\u002Fssrn.4687809","W4390675637",[12930,23,12931,984,12932,6853,868,8139,3597],"Rendering (computer graphics)","Vibration","Driving simulator",{"type":39,"children":12934,"toc":12935},[],{"title":8,"searchDepth":49,"depth":49,"links":12936},[],"content:publications:2024:a-scenario-customizable-and-visual-rendering-simulator-for-on-vehicle-vibration.md","publications\u002F2024\u002Fa-scenario-customizable-and-visual-rendering-simulator-for-on-vehicle-vibration.md","publications\u002F2024\u002Fa-scenario-customizable-and-visual-rendering-simulator-for-on-vehicle-vibration",{"_path":12941,"_dir":12825,"_draft":7,"_partial":7,"_locale":8,"title":12942,"description":8,"_hidden":7,"collaboration networks on regional innovation\" authors":12943,"authors_orcid":12944,"year":12829,"doi":12945,"openalex_id":12946,"venue":12947,"abstract_screenshot":21,"keywords":12948,"body":12949,"_type":51,"_id":12953,"_source":53,"_file":12954,"_stem":12955,"_extension":56,"locale":57},"\u002Fpublications\u002F2024\u002Fa-tale-of-two-ties-the-impact-of-a-focal-city-s-direct-and-indirect-collaboratio","A tale of two ties: the impact of a focal city’s direct and indirec",[12037,12039,12038,65],[21,12042,12041,70],"https:\u002F\u002Fdoi.org\u002F10.1007\u002Fs10961-024-10161-y","W4404700791","The Journal of Technology Transfer",[3960,178,3958,289],{"type":39,"children":12950,"toc":12951},[],{"title":8,"searchDepth":49,"depth":49,"links":12952},[],"content:publications:2024:a-tale-of-two-ties-the-impact-of-a-focal-city-s-direct-and-indirect-collaboratio.md","publications\u002F2024\u002Fa-tale-of-two-ties-the-impact-of-a-focal-city-s-direct-and-indirect-collaboratio.md","publications\u002F2024\u002Fa-tale-of-two-ties-the-impact-of-a-focal-city-s-direct-and-indirect-collaboratio",{"_path":12957,"_dir":12825,"_draft":7,"_partial":7,"_locale":8,"title":12958,"description":8,"_hidden":7,"scheduling Problem authors":12959,"authors_orcid":12960,"year":12829,"doi":12961,"openalex_id":12962,"venue":12963,"abstract_screenshot":21,"keywords":12964,"body":12965,"_type":51,"_id":12969,"_source":53,"_file":12970,"_stem":12971,"_extension":56,"locale":57},"\u002Fpublications\u002F2024\u002Fa-two-phase-approach-for-solving-the-multi-skilled-and-irregular-personnel-sched","A Two-Phase Approach for Solving the Multi-Skilled and Irregular Personnel",[1181,12,6721,709,7302],[1184,21,6723,711,7310],"https:\u002F\u002Fdoi.org\u002F10.21203\u002Frs.3.rs-4449906\u002Fv1","W4399331293","Research Square",[23,450,31,24,34],{"type":39,"children":12966,"toc":12967},[],{"title":8,"searchDepth":49,"depth":49,"links":12968},[],"content:publications:2024:a-two-phase-approach-for-solving-the-multi-skilled-and-irregular-personnel-sched.md","publications\u002F2024\u002Fa-two-phase-approach-for-solving-the-multi-skilled-and-irregular-personnel-sched.md","publications\u002F2024\u002Fa-two-phase-approach-for-solving-the-multi-skilled-and-irregular-personnel-sched",{"_path":12973,"_dir":12825,"_draft":7,"_partial":7,"_locale":8,"title":12974,"description":12975,"_hidden":7,"authors":12976,"authors_orcid":12979,"year":12829,"doi":12981,"openalex_id":12982,"venue":3356,"abstract_screenshot":21,"keywords":12983,"body":12985,"_type":51,"_id":12993,"_source":53,"_file":12994,"_stem":12995,"_extension":56,"locale":57},"\u002Fpublications\u002F2024\u002Fa-two-stage-algorithm-for-identifying-software-failure-regions","A Two-Stage Algorithm for Identifying Software Failure Regions","Software developers can only obtain a very small amount of information from the individual failure-causing inputs, which makes debugging difficult. Therefore, it is necessary to explore additional failure-causing inputs (failure regions) using the known failure-causing inputs. In order to accurately and efficiently identify the failure region, we propose a novel two-stage search algorithm, TS-FRI. In the initial exploration stage, a round-robin search identifies several boundary failure-causing points, and the failure region's centroid is estimated. During the main search stage, the boundary failure-causing points are identified through iterative division of the input domain with an equally sized partitioning strategy. This results in the boundary points being as dispersed as possible around the failure-region boundary, with the polytope formed by the points approximating the failure region (e.g., a polygon in two dimensions). The proposed algorithm is validated through simulation and empirical analysis: The experimental results show that the TS-FRI accuracy is at least comparable to the best accuracy of the compared three algorithms, and can be ten times better. In addition, TS-FRI only takes a quarter of the computation time and half the failure-validation cost of the other algorithms.",[1095,12977,596,595,12978,3112],"Zhu, Zheng","Wen, Linlin",[1099,12980,600,599,21,3115],"0000-0001-7510-9949","https:\u002F\u002Fdoi.org\u002F10.1109\u002Ftr.2024.3441319","W4401879356",[23,1165,332,139,12984,661,138,179,110],"Software bug",{"type":39,"children":12986,"toc":12991},[12987],{"type":42,"tag":43,"props":12988,"children":12989},{},[12990],{"type":47,"value":12975},{"title":8,"searchDepth":49,"depth":49,"links":12992},[],"content:publications:2024:a-two-stage-algorithm-for-identifying-software-failure-regions.md","publications\u002F2024\u002Fa-two-stage-algorithm-for-identifying-software-failure-regions.md","publications\u002F2024\u002Fa-two-stage-algorithm-for-identifying-software-failure-regions",{"_path":12997,"_dir":12825,"_draft":7,"_partial":7,"_locale":8,"title":12998,"description":12999,"_hidden":7,"Thromboembolism Prophylaxis authors":13000,"authors_orcid":13002,"year":12829,"doi":13003,"openalex_id":13004,"venue":21,"abstract_screenshot":21,"keywords":13005,"body":13010,"_type":51,"_id":13018,"_source":53,"_file":13019,"_stem":13020,"_extension":56,"locale":57},"\u002Fpublications\u002F2024\u002Fa-wearable-lower-extremity-virtual-rehabilitation-system-for-patients-venous-thr","A Wearable Lower Extremity Virtual Rehabilitation System for Patients' Venous","Venous thromboembolism (VTE) is an under-appreciated vascular disease that has been a growing global healthcare challenge, with increasing morbidity, mortality, and associated healthcare costs. Few works have been placed on using the technology-based intervention (TBI) approach to assist patients at risk in actively completing exercise therapy for VTE Prophylaxis. We present a wearable virtual rehabilitation system that could trace and evaluate the patient's exercise therapy progress while offering an immersive experience to guide and motivate the patient to complete the training spontaneously through multi-sensory feedback.",[11550,5667,13001],"Pei, Hualian",[11552,5670,21],"https:\u002F\u002Fdoi.org\u002F10.1145\u002F3675094.3677585","W4402721854",[13006,6973,13007,380,23,9693,13008,10044,4242,13009],"Venous thromboembolism","Rehabilitation","Physical therapy","Thrombosis",{"type":39,"children":13011,"toc":13016},[13012],{"type":42,"tag":43,"props":13013,"children":13014},{},[13015],{"type":47,"value":12999},{"title":8,"searchDepth":49,"depth":49,"links":13017},[],"content:publications:2024:a-wearable-lower-extremity-virtual-rehabilitation-system-for-patients-venous-thr.md","publications\u002F2024\u002Fa-wearable-lower-extremity-virtual-rehabilitation-system-for-patients-venous-thr.md","publications\u002F2024\u002Fa-wearable-lower-extremity-virtual-rehabilitation-system-for-patients-venous-thr",{"_path":13022,"_dir":12825,"_draft":7,"_partial":7,"_locale":8,"title":13023,"description":8,"_hidden":7,"authors":13024,"authors_orcid":13025,"year":12829,"doi":13027,"openalex_id":13028,"venue":13029,"abstract_screenshot":21,"keywords":13030,"body":13031,"_type":51,"_id":13035,"_source":53,"_file":13036,"_stem":13037,"_extension":56,"locale":57},"\u002Fpublications\u002F2024\u002Fadvancing-container-port-traffic-simulation-a-data-driven-machine-learning-appro","Advancing container port traffic simulation: A data-driven machine learning approach in sparse data environments",[5989,319,11507,908,12],[5991,322,13026,913,15],"0000-0001-9184-2622","https:\u002F\u002Fdoi.org\u002F10.1016\u002Fj.asoc.2024.112190","W4402115542","Applied Soft Computing",[23,353,5304,6631,746,1189,3203,215,179],{"type":39,"children":13032,"toc":13033},[],{"title":8,"searchDepth":49,"depth":49,"links":13034},[],"content:publications:2024:advancing-container-port-traffic-simulation-a-data-driven-machine-learning-appro.md","publications\u002F2024\u002Fadvancing-container-port-traffic-simulation-a-data-driven-machine-learning-appro.md","publications\u002F2024\u002Fadvancing-container-port-traffic-simulation-a-data-driven-machine-learning-appro",{"_path":13039,"_dir":12825,"_draft":7,"_partial":7,"_locale":8,"title":13040,"description":13041,"_hidden":7,"handwritten Chinese character legibility of human and machine\" authors":13042,"authors_orcid":13045,"year":12829,"doi":13049,"openalex_id":13050,"venue":7279,"abstract_screenshot":21,"keywords":13051,"body":13060,"_type":51,"_id":13068,"_source":53,"_file":13069,"_stem":13070,"_extension":56,"locale":57},"\u002Fpublications\u002F2024\u002Faldii-adaptive-learning-based-document-image-inpainting-to-enhance-the-handwritt","ALDII: Adaptive Learning-based Document Image Inpainting to enhance th","Document Image Inpainting (DII) has been applied to degraded documents, including financial and historical documents, to enhance the legibility of images for: (1) human readers by providing high visual quality images; and (2) machine recognizers such as Optical Character Recognition (OCR), thereby reducing recognition errors. With the advent of Deep Learning (DL), DL-based DII methods have achieved remarkable enhancements in terms of either human or machine legibility. However, focusing on improving machine legibility causes visual image degradation, affecting human readability. To address this contradiction, we propose an adaptive learning-based DII method, namely ALDII, that applies domain adaptation strategy, our approach acts like a plug-in module that is capable of constraining a total feature space before optimizing legibility of human and machine, respectively. We evaluate our ALDII on a Chinese handwritten character dataset, which includes single-character and text-line images. Compared to other state-of-the-art approaches, experimental results demonstrated superior performance of our ALDII with metrics of both human and machine legibility.",[13043,9304,13044,12763,4189],"Mao, Qinglin","Zhou, Hang",[13046,9310,13047,13048,4191],"0000-0002-0938-0690","0000-0003-1909-6076","0000-0002-0896-0650","https:\u002F\u002Fdoi.org\u002F10.1016\u002Fj.neucom.2024.128897","W4404436774",[13052,13053,13054,37,23,13055,4004,4876,4391,13056,4479,13057,34,13058,13059],"Legibility","Inpainting","Character (mathematics)","Character recognition","Chinese characters","Calligraphy","Art","Visual arts",{"type":39,"children":13061,"toc":13066},[13062],{"type":42,"tag":43,"props":13063,"children":13064},{},[13065],{"type":47,"value":13041},{"title":8,"searchDepth":49,"depth":49,"links":13067},[],"content:publications:2024:aldii-adaptive-learning-based-document-image-inpainting-to-enhance-the-handwritt.md","publications\u002F2024\u002Faldii-adaptive-learning-based-document-image-inpainting-to-enhance-the-handwritt.md","publications\u002F2024\u002Faldii-adaptive-learning-based-document-image-inpainting-to-enhance-the-handwritt",{"_path":13072,"_dir":12825,"_draft":7,"_partial":7,"_locale":8,"title":13073,"description":13074,"_hidden":7,"Catheterization authors":13075,"authors_orcid":13076,"year":12829,"doi":13077,"openalex_id":13078,"venue":13079,"abstract_screenshot":21,"keywords":13080,"body":13081,"_type":51,"_id":13089,"_source":53,"_file":13090,"_stem":13091,"_extension":56,"locale":57},"\u002Fpublications\u002F2024\u002Fanalyzing-surgeon-robot-cooperative-performance-in-robot-assisted-intravascular","Analyzing Surgeon–Robot Cooperative Performance in Robot-Assisted Intravascular","Robot-assisted catheterization offers a promising technique for cardiovascular interventions, addressing the limitations of manual interventional surgery, where precise tool manipulation is critical. In remote-control robotic systems, the lack of force feedback and imprecise navigation challenge cooperation between the surgeon and robot. This study proposes a manipulation-based evaluation framework to assess the cooperative performance between different operators and robot using kinesthetic, kinematic, and haptic data from multi-sensor technologies. The proposed evaluation framework achieves a recognition accuracy of 99.99% in assessing the cooperation between operator and robot. Additionally, the study investigates the impact of delay factors, considering no delay, constant delay, and variable delay, on cooperation characteristics. The findings suggest that variable delay contributes to improved cooperation performance between operator and robot in a primary-secondary isomorphic robotic system, compared to a constant delay factor. Furthermore, operators with experience in manual percutaneous coronary interventions exhibit significantly better cooperative manipulate on with the robot system than those without such experience, with respective synergy ratios of 89.66%, 90.28%, and 91.12% based on the three aspects of delay consideration. Moreover, the study explores interaction information, including distal force of tools-tissue and contact force of hand-control-ring, to understand how operators with different technical skills adjust their control strategy to prevent damage to the vascular vessel caused by excessive force while ensuring enough tension to navigate complex paths. The findings highlight the potential of variable delay to enhance cooperative control strategies in robotic catheterization systems, providing a basis for optimizing surgeon-robot collaboration in cardiovascular interventions.",[9462,11800,9463,9464,9466,11801,8406,5667,9467],[9469,11803,9470,9471,9473,11804,8409,5670,9474],"https:\u002F\u002Fdoi.org\u002F10.1109\u002Fthms.2024.3452975","W4403123013","IEEE Transactions on Human-Machine Systems",[7599,9480,23,380,37,10044],{"type":39,"children":13082,"toc":13087},[13083],{"type":42,"tag":43,"props":13084,"children":13085},{},[13086],{"type":47,"value":13074},{"title":8,"searchDepth":49,"depth":49,"links":13088},[],"content:publications:2024:analyzing-surgeon-robot-cooperative-performance-in-robot-assisted-intravascular.md","publications\u002F2024\u002Fanalyzing-surgeon-robot-cooperative-performance-in-robot-assisted-intravascular.md","publications\u002F2024\u002Fanalyzing-surgeon-robot-cooperative-performance-in-robot-assisted-intravascular",{"_path":13093,"_dir":12825,"_draft":7,"_partial":7,"_locale":8,"title":13094,"description":13095,"_hidden":7,"named entity recognition with domain-adaptive pre-trained large language model authors":13096,"authors_orcid":13105,"year":12829,"doi":13113,"openalex_id":13114,"venue":13115,"abstract_screenshot":21,"keywords":13116,"body":13118,"_type":51,"_id":13126,"_source":53,"_file":13127,"_stem":13128,"_extension":56,"locale":57},"\u002Fpublications\u002F2024\u002Fautomatic-quantitative-stroke-severity-assessment-based-on-chinese-clinical-name","Automatic quantitative stroke severity assessment based on Chinese clinical","BACKGROUND: Stroke is a prevalent disease with a significant global impact. Effective assessment of stroke severity is vital for an accurate diagnosis, appropriate treatment, and optimal clinical outcomes. The National Institutes of Health Stroke Scale (NIHSS) is a widely used scale for quantitatively assessing stroke severity. However, the current manual scoring of NIHSS is labor-intensive, time-consuming, and sometimes unreliable. Applying artificial intelligence (AI) techniques to automate the quantitative assessment of stroke on vast amounts of electronic health records (EHRs) has attracted much interest. OBJECTIVE: This study aims to develop an automatic, quantitative stroke severity assessment framework through automating the entire NIHSS scoring process on Chinese clinical EHRs. METHODS: Our approach consists of two major parts: Chinese clinical named entity recognition (CNER) with a domain-adaptive pre-trained large language model (LLM) and automated NIHSS scoring. To build a high-performing CNER model, we first construct a stroke-specific, densely annotated dataset \"Chinese Stroke Clinical Records\" (CSCR) from EHRs provided by our partner hospital, based on a stroke ontology that defines semantically related entities for stroke assessment. We then pre-train a Chinese clinical LLM coined \"CliRoberta\" through domain-adaptive transfer learning and construct a deep learning-based CNER model that can accurately extract entities directly from Chinese EHRs. Finally, an automated, end-to-end NIHSS scoring pipeline is proposed by mapping the extracted entities to relevant NIHSS items and values, to quantitatively assess the stroke severity. RESULTS: Results obtained on a benchmark dataset CCKS2019 and our newly created CSCR dataset demonstrate the superior performance of our domain-adaptive pre-trained LLM and the CNER model, compared with the existing benchmark LLMs and CNER models. The high F1 score of 0.990 ensures the reliability of our model in accurately extracting the entities for the subsequent automatic NIHSS scoring. Subsequently, our automated, end-to-end NIHSS scoring approach achieved excellent inter-rater agreement (0.823) and intraclass consistency (0.986) with the ground truth and significantly reduced the processing time from minutes to a few seconds. CONCLUSION: Our proposed automatic and quantitative framework for assessing stroke severity demonstrates exceptional performance and reliability through directly scoring the NIHSS from diagnostic notes in Chinese clinical EHRs. Moreover, this study also contributes a new clinical dataset, a pre-trained clinical LLM, and an effective deep learning-based CNER model. The deployment of these advanced algorithms can improve the accuracy and efficiency of clinical assessment, and help improve the quality, affordability and productivity of healthcare services.",[13097,8931,13098,9014,13099,13100,13101,13102,13103,13104],"Gu, Zhanzhong","Yu, Ping","Yang, Xiguang","Peng, Gang","Hu, Penghui","Chen, Shiyan","Chen, Hongjie","Lin, Yiguang",[13106,8937,13107,9020,13108,21,13109,13110,13111,13112],"0000-0002-0628-5575","0000-0002-7910-9396","0000-0002-6441-6836","0000-0003-3876-2732","0000-0002-4195-3014","0009-0009-8968-2047","0000-0002-4637-9701","https:\u002F\u002Fdoi.org\u002F10.1016\u002Fj.artmed.2024.102822","W4392202585","Artificial Intelligence in Medicine",[23,37,4479,1167,13117,215],"Stroke (engine)",{"type":39,"children":13119,"toc":13124},[13120],{"type":42,"tag":43,"props":13121,"children":13122},{},[13123],{"type":47,"value":13095},{"title":8,"searchDepth":49,"depth":49,"links":13125},[],"content:publications:2024:automatic-quantitative-stroke-severity-assessment-based-on-chinese-clinical-name.md","publications\u002F2024\u002Fautomatic-quantitative-stroke-severity-assessment-based-on-chinese-clinical-name.md","publications\u002F2024\u002Fautomatic-quantitative-stroke-severity-assessment-based-on-chinese-clinical-name",{"_path":13130,"_dir":12825,"_draft":7,"_partial":7,"_locale":8,"title":13131,"description":13132,"_hidden":7,"infrastructures shape nations’ domestic and international science production\" authors":13133,"authors_orcid":13134,"year":12829,"doi":13136,"openalex_id":13137,"venue":8298,"abstract_screenshot":13138,"keywords":13139,"body":13141,"_type":51,"_id":13149,"_source":53,"_file":13150,"_stem":13151,"_extension":56,"locale":57},"\u002Fpublications\u002F2024\u002Fbeamtimes-and-knowledge-production-times-how-big-science-research-infrastructure","Beamtimes and knowledge production times: how big-science researc","Frontier scientific discoveries increasingly rely on big-science research infrastructures, such as supercolliders, synchrotron light sources, and space telescopes, whose construction and operation involve intensive international collaboration. This collaborative nature, however, presents a challenge in balancing national interests with the common good, particularly given the substantial fiscal investments involved. This study investigates the effects of one of China’s prominent big-science infrastructures, the Shanghai Synchrotron Radiation Facility (SSRF), on the country’s production of science, differentiating between national and international scientific endeavors. Employing a rigorous difference-in-differences (DID) methodology, it evaluates SSRF’s effects on discipline-level production of publications by domestic researchers and those involving international collaboration. The empirical findings reveal compelling evidence that SSRF has significantly enhanced the production of high-impact national and international publications for disciplines reliant on the facility for experiments, particularly increasing the percentage of high-impact national publications. The findings also underscore the dual role of big-science infrastructures in fostering international research collaboration while simultaneously enhancing nations’ domestic scientific development and competitiveness. Additionally, the study provides valuable insights for research assessment and science policy discussions.",[9894,9895,65],[21,13135,70],"0000-0003-3707-1980","https:\u002F\u002Fdoi.org\u002F10.1057\u002Fs41599-024-03993-4","W4404010026","beamtimes-and-knowledge-production-times-how-big-science-research-infrastructure.png",[13140,927,178,1358,629,23,36],"Knowledge production",{"type":39,"children":13142,"toc":13147},[13143],{"type":42,"tag":43,"props":13144,"children":13145},{},[13146],{"type":47,"value":13132},{"title":8,"searchDepth":49,"depth":49,"links":13148},[],"content:publications:2024:beamtimes-and-knowledge-production-times-how-big-science-research-infrastructure.md","publications\u002F2024\u002Fbeamtimes-and-knowledge-production-times-how-big-science-research-infrastructure.md","publications\u002F2024\u002Fbeamtimes-and-knowledge-production-times-how-big-science-research-infrastructure",{"_path":13153,"_dir":12825,"_draft":7,"_partial":7,"_locale":8,"title":13154,"description":13155,"_hidden":7,"authors":13156,"authors_orcid":13158,"year":12829,"doi":13160,"openalex_id":13161,"venue":13162,"abstract_screenshot":21,"keywords":13163,"body":13164,"_type":51,"_id":13180,"_source":53,"_file":13181,"_stem":13182,"_extension":56,"locale":57},"\u002Fpublications\u002F2024\u002Fcard-semantic-segmentation-with-efficient-class-aware-regularized-decoder","CARD: Semantic Segmentation With Efficient Class-Aware Regularized Decoder","Semantic segmentation has recently achieved notable advances by exploiting “class-level” contextual information during learning, e.g., the Object Contextual Representation (OCR) and Context Prior (CPNet) approaches. However, these approaches simply concatenate class-level information to pixel features to boost pixel representation learning, which cannot fully utilize intra-class and inter-class contextual information. Moreover, these approaches learn soft class centers based on coarse mask prediction, which is prone to error accumulation. To better exploit class-level information, we propose a universal Class-Aware Regularization (CAR) approach to optimize the intra-class variance and inter-class distance during feature learning, motivated by the fact that humans can recognize an object by itself no matter which other objects it appears with. Moreover, we design a dedicated decoder for CAR (named CARD), which consists of a novel spatial token mixer and an upsampling module, to maximize its gain for existing baselines while being highly efficient in terms of computational cost. Specifically, CAR consists of three novel loss functions. The first loss function encourages more compact class representations within each class, the second directly maximizes the distance between different class centers, and the third further pushes the distance between inter-class centers and pixels. Furthermore, the class center in our approach is directly generated from ground truth instead of from the error-prone coarse prediction. CAR can be directly applied to most existing segmentation models during training, including OCR and CPNet, and can largely improve their accuracy at no additional inference overhead. Extensive experiments and ablation studies conducted on multiple benchmark datasets demonstrate that the proposed CAR can boost the accuracy of all baseline models by up to 2.23% mIOU with superior generalization ability. CARD outperforms state-of-the-art approaches on multiple benchmarks with a highly efficient architecture. The code will be available at https:\u002F\u002Fgithub.com\u002Fedwardyehuang\u002FCAR.",[9076,9077,9078,9014,8931,13157,9079,9080],"Duan, Lixin",[9082,9083,9084,9020,8937,13159,9085,9086],"0000-0002-0723-4016","https:\u002F\u002Fdoi.org\u002F10.1109\u002Ftcsvt.2024.3395132","W4396214386","IEEE Transactions on Circuits and Systems for Video Technology",[23,862,9090,37,4479,5210,11495,4876,110],{"type":39,"children":13165,"toc":13178},[13166],{"type":42,"tag":43,"props":13167,"children":13168},{},[13169,13171,13177],{"type":47,"value":13170},"Semantic segmentation has recently achieved notable advances by exploiting “class-level” contextual information during learning, e.g., the Object Contextual Representation (OCR) and Context Prior (CPNet) approaches. However, these approaches simply concatenate class-level information to pixel features to boost pixel representation learning, which cannot fully utilize intra-class and inter-class contextual information. Moreover, these approaches learn soft class centers based on coarse mask prediction, which is prone to error accumulation. To better exploit class-level information, we propose a universal Class-Aware Regularization (CAR) approach to optimize the intra-class variance and inter-class distance during feature learning, motivated by the fact that humans can recognize an object by itself no matter which other objects it appears with. Moreover, we design a dedicated decoder for CAR (named CARD), which consists of a novel spatial token mixer and an upsampling module, to maximize its gain for existing baselines while being highly efficient in terms of computational cost. Specifically, CAR consists of three novel loss functions. The first loss function encourages more compact class representations within each class, the second directly maximizes the distance between different class centers, and the third further pushes the distance between inter-class centers and pixels. Furthermore, the class center in our approach is directly generated from ground truth instead of from the error-prone coarse prediction. CAR can be directly applied to most existing segmentation models during training, including OCR and CPNet, and can largely improve their accuracy at no additional inference overhead. Extensive experiments and ablation studies conducted on multiple benchmark datasets demonstrate that the proposed CAR can boost the accuracy of all baseline models by up to 2.23% mIOU with superior generalization ability. CARD outperforms state-of-the-art approaches on multiple benchmarks with a highly efficient architecture. The code will be available at ",{"type":42,"tag":1574,"props":13172,"children":13175},{"href":13173,"rel":13174},"https:\u002F\u002Fgithub.com\u002Fedwardyehuang\u002FCAR",[4520],[13176],{"type":47,"value":13173},{"type":47,"value":1645},{"title":8,"searchDepth":49,"depth":49,"links":13179},[],"content:publications:2024:card-semantic-segmentation-with-efficient-class-aware-regularized-decoder.md","publications\u002F2024\u002Fcard-semantic-segmentation-with-efficient-class-aware-regularized-decoder.md","publications\u002F2024\u002Fcard-semantic-segmentation-with-efficient-class-aware-regularized-decoder",{"_path":13184,"_dir":12825,"_draft":7,"_partial":7,"_locale":8,"title":13185,"description":13186,"_hidden":7,"Reinforcement Learning authors":13187,"authors_orcid":13191,"year":12829,"doi":13195,"openalex_id":13196,"venue":21,"abstract_screenshot":21,"keywords":13197,"body":13199,"_type":51,"_id":13207,"_source":53,"_file":13208,"_stem":13209,"_extension":56,"locale":57},"\u002Fpublications\u002F2024\u002Fcardinality-and-bounding-constrained-portfolio-optimization-using-safe-reinforce","Cardinality and Bounding Constrained Portfolio Optimization Using Safe","Portfolio optimization is a strategic approach aiming at achieving an optimal balance between risk and returns through the judicious allocation of limited capital across various assets. In recent years, there has been a growing interest in leveraging Deep Reinforcement Learning (DRL) to tackle the complexities of portfolio optimization. Despite its potential, a notable limitation of DRL algorithms is their inherent difficulty in integrating conflicted objectives with the reward functions throughout the learning process. Typically, DRL's reward function prioritizes the maximization of returns or other performance indicators, often overlooking the integration of risk aspects. Furthermore, the standard DRL framework struggles to incorporate practical constraints, such as cardinality and bounding, into the decision process. Without these constraints, the investment strategies developed might be unrealistic and unmanageable. To this end, in this paper, we propose an adaptive and safe DRL framework, which can dynamically optimize the portfolio weights while strictly respecting practical constraints. In our method, any infeasible action (i.e., one that violates the constraints) decided by the RL agent will be mapped to a feasible region using a safety layer. The extended Markowitz Mean-Variance (M-V) model is explicitly encoded in the safety layer to ensure the feasibility of the actions from the alternative views. In addition, we utilize Projection-based Interior-point Policy Optimization (IPO) to resolve multiple objectives and constraints in the examined problem. Extensive results on real-world datasets show that our method is effective in strictly respecting constraints under dynamic market environments, in contrast to prevailing data- driven trading strategies and conventional model-based static solutions.",[13188,13189,12485,10191,709,1181,10477,6111,13190],"Li, Yiran","Du, Nanjiang","Cheah, Wooi Ping",[13192,13193,12487,10196,711,1184,10479,21,13194],"0000-0002-1632-4531","0000-0003-2029-4563","0000-0002-0829-2269","https:\u002F\u002Fdoi.org\u002F10.1109\u002Fijcnn60899.2024.10651491","W4402352370",[5304,13198,23,718,716,31,719,37,34,181,36,283],"Bounding overwatch",{"type":39,"children":13200,"toc":13205},[13201],{"type":42,"tag":43,"props":13202,"children":13203},{},[13204],{"type":47,"value":13186},{"title":8,"searchDepth":49,"depth":49,"links":13206},[],"content:publications:2024:cardinality-and-bounding-constrained-portfolio-optimization-using-safe-reinforce.md","publications\u002F2024\u002Fcardinality-and-bounding-constrained-portfolio-optimization-using-safe-reinforce.md","publications\u002F2024\u002Fcardinality-and-bounding-constrained-portfolio-optimization-using-safe-reinforce",{"_path":13211,"_dir":12825,"_draft":7,"_partial":7,"_locale":8,"title":13212,"description":13213,"_hidden":7,"authors":13214,"authors_orcid":13222,"year":12829,"doi":13230,"openalex_id":13231,"venue":13232,"abstract_screenshot":21,"keywords":13233,"body":13236,"_type":51,"_id":13244,"_source":53,"_file":13245,"_stem":13246,"_extension":56,"locale":57},"\u002Fpublications\u002F2024\u002Fcausal-effects-of-adversarial-attacks-on-ai-models-in-6g-consumer-electronics","Causal Effects of Adversarial Attacks on AI Models in 6G Consumer Electronics","Adversarial examples are security risks in the implementation of artificial intelligence (AI) in 6G Consumer Electronics. Deep learning models are highly susceptible to adversarial attacks, and defense against such attacks is critical to the safety of 6G Consumer Electronics. However, there remains a lack of effective defensive mechanisms against adversarial attacks in the realm of deep learning. The primary issue lies in the fact that it is not yet understood how adversarial examples can deceive deep learning models. The potential operation mechanism of adversarial examples has not been fully explored, which constitutes a bottleneck in adversarial attack defense. This paper focuses on causality in adversarial examples such as combining the adversarial attack algorithms with the causal inference methods. Specifically, we will use a variety of adversarial attack algorithms to generate adversarial samples, and analyze the causal relationship between adversarial samples and original samples through causal inference. At the same time, we will compare and analyze the causal effect between them to reveal the mechanism and discover the reason of miscalculating. The expected contributions of this paper include: (1) Reveal the mechanism and influencing factors of counterattack, and provide theoretical support for the security of deep learning models; (2) Propose a defense strategy based on causal inference method to provide a practical method for the defense of deep learning models; (3) Provide new ideas and methods for adversarial attack defense in deep learning models.",[13215,13216,13217,13218,13219,12,13220,13221],"Guo, Da","Feng, Z.B.","Zhang, Zhen","Khan, Fazlullah","Chen, Chien‐Ming","Omar, Marwan","Kumari, Saru",[13223,13224,13225,13226,13227,15,13228,13229],"0000-0001-7818-5269","0009-0001-4862-1100","0000-0001-8893-3187","0000-0002-6002-7024","0000-0002-6502-472X","0000-0002-3392-0052","0000-0003-4929-5383","https:\u002F\u002Fdoi.org\u002F10.1109\u002Ftce.2024.3443328","W4401879041","IEEE Transactions on Consumer Electronics",[13234,12601,13235,23,179,928,37,6633],"Adversarial system","Power electronics",{"type":39,"children":13237,"toc":13242},[13238],{"type":42,"tag":43,"props":13239,"children":13240},{},[13241],{"type":47,"value":13213},{"title":8,"searchDepth":49,"depth":49,"links":13243},[],"content:publications:2024:causal-effects-of-adversarial-attacks-on-ai-models-in-6g-consumer-electronics.md","publications\u002F2024\u002Fcausal-effects-of-adversarial-attacks-on-ai-models-in-6g-consumer-electronics.md","publications\u002F2024\u002Fcausal-effects-of-adversarial-attacks-on-ai-models-in-6g-consumer-electronics",{"_path":13248,"_dir":12825,"_draft":7,"_partial":7,"_locale":8,"title":13249,"description":13250,"_hidden":7,"authors":13251,"authors_orcid":13254,"year":12829,"doi":13257,"openalex_id":13258,"venue":21,"abstract_screenshot":21,"keywords":13259,"body":13261,"_type":51,"_id":13269,"_source":53,"_file":13270,"_stem":13271,"_extension":56,"locale":57},"\u002Fpublications\u002F2024\u002Fcharacterising-deep-learning-loss-landscapes-with-local-optima-networks","Characterising Deep Learning Loss Landscapes with Local Optima Networks","Deep learning has gained significant popularity in recent years, particularly for tasks like image and speech recognition, natural language processing, and other intricate pattern recognition challenges. However, training a deep learning model involves tuning millions or even billions of parameters. Consequently, this training process becomes a large-scale optimisation problem associated with a mostly unknown but highly non-convex fitness landscape. In recent decades, advances in fitness landscape analysis have revolved around characterizing landscapes representing loss functions, with Local Optima Networks (LONs) emerging as a promising tool. This paper, while focusing on LeNet-5, leverages LON to address four key questions concerning the nature of the learning problem. We emphasize the impact of experimental conditions during the analysis phase on drawing conclusions about the problem's nature. The results shed light on parametrization and optimiser selection to enhance the analysis and comprehension of deep learning loss landscapes. In particular, we identify the presence and number of funnels in the landscape's structure, study the impact of the dataset on the nature of the problem, investigate how the choice of local search optimisers may influence conclusions about the problem's structure. Finally, sensitivity analysis was conducted on the perturbation strength of the Basin-Hopping sampling method for LON construction.",[13252,13253,12],"Zhou, Yuyang","Neri, Ferrante",[13255,13256,15],"0000-0002-2188-2781","0000-0002-6100-6532","https:\u002F\u002Fdoi.org\u002F10.1109\u002Fcec60901.2024.10611772","W4401513631",[23,13260,6976,37],"Local optimum",{"type":39,"children":13262,"toc":13267},[13263],{"type":42,"tag":43,"props":13264,"children":13265},{},[13266],{"type":47,"value":13250},{"title":8,"searchDepth":49,"depth":49,"links":13268},[],"content:publications:2024:characterising-deep-learning-loss-landscapes-with-local-optima-networks.md","publications\u002F2024\u002Fcharacterising-deep-learning-loss-landscapes-with-local-optima-networks.md","publications\u002F2024\u002Fcharacterising-deep-learning-loss-landscapes-with-local-optima-networks",{"_path":13273,"_dir":12825,"_draft":7,"_partial":7,"_locale":8,"title":13274,"description":13275,"_hidden":7,"authors":13276,"authors_orcid":13278,"year":12829,"doi":13280,"openalex_id":13281,"venue":13282,"abstract_screenshot":21,"keywords":13283,"body":13288,"_type":51,"_id":13296,"_source":53,"_file":13297,"_stem":13298,"_extension":56,"locale":57},"\u002Fpublications\u002F2024\u002Fchina-s-international-environment-and-development-challenges","China’s international environment and development challenges","The global economy faces a new complexity with slowing growth and persistent inflation, exacerbated by the pandemic, geopolitical disputes, and underlying structural factors. This paper first analyzes the economic development of the United States and the Eurozone. It then shifts its focus to China, discussing the current dynamics of its economic development landscape. The paper further analyses the Chinese economy’s development challenges brought about by deglobalization trends, intellectual property litigation risks, and problems in industrial upgrading. Finally, the paper provides strategic policy recommendations to navigate these complexities. It emphasizes that China should actively engage in international cooperation, strengthen the development of market infrastructure, and enhance the legal protection for intellectual property rights.",[268,13277,11700],"Li, Haolin",[272,13279,11703],"0000-0001-9779-0675","https:\u002F\u002Fdoi.org\u002F10.1080\u002F17538963.2024.2437865","W4405331773","China Economic Journal",[282,12046,13284,1356,13285,13286,13287,3712,178,36,1358,3259],"Geopolitics","Property rights","Industrial policy","Chinese economy",{"type":39,"children":13289,"toc":13294},[13290],{"type":42,"tag":43,"props":13291,"children":13292},{},[13293],{"type":47,"value":13275},{"title":8,"searchDepth":49,"depth":49,"links":13295},[],"content:publications:2024:china-s-international-environment-and-development-challenges.md","publications\u002F2024\u002Fchina-s-international-environment-and-development-challenges.md","publications\u002F2024\u002Fchina-s-international-environment-and-development-challenges",{"_path":13300,"_dir":12825,"_draft":7,"_partial":7,"_locale":8,"title":13301,"description":13302,"_hidden":7,"authors":13303,"authors_orcid":13305,"year":12829,"doi":13307,"openalex_id":13308,"venue":13309,"abstract_screenshot":21,"keywords":13310,"body":13312,"_type":51,"_id":13320,"_source":53,"_file":13321,"_stem":13322,"_extension":56,"locale":57},"\u002Fpublications\u002F2024\u002Fclimate-policy-shocks-and-crowdfunding-success-of-renewable-technology-campaigns","Climate policy shocks and crowdfunding success of renewable technology campaigns","Abstract This study uses Trump's withdrawal from the Paris Accord as an exogenous policy shock and investigates its impact on crowdfunding outcomes. We find that this major policy change negatively affects the funding success of renewable technology campaigns. Mechanism tests suggest that social trust and availability bias transmit the influence of climate policy shock on crowd backers' decisions. Further analyses indicate that Biden's consequential policy reversal recovers the investors' support towards renewable technology. Overall, the Trump administration's climate policy shock induces significant shifts in the consumption preferences of small investors and incurs negative externalities upon renewable technology in crowdfunding markets.",[11036,268,11877,13304],"Zhang, Huayi",[21,272,11880,13306],"0000-0002-1573-9110","https:\u002F\u002Fdoi.org\u002F10.1111\u002Feufm.12523","W4403602749","European Financial Management",[922,178,3525,13311,36,750,179],"Climate change",{"type":39,"children":13313,"toc":13318},[13314],{"type":42,"tag":43,"props":13315,"children":13316},{},[13317],{"type":47,"value":13302},{"title":8,"searchDepth":49,"depth":49,"links":13319},[],"content:publications:2024:climate-policy-shocks-and-crowdfunding-success-of-renewable-technology-campaigns.md","publications\u002F2024\u002Fclimate-policy-shocks-and-crowdfunding-success-of-renewable-technology-campaigns.md","publications\u002F2024\u002Fclimate-policy-shocks-and-crowdfunding-success-of-renewable-technology-campaigns",{"_path":13324,"_dir":12825,"_draft":7,"_partial":7,"_locale":8,"title":13325,"description":8,"_hidden":7,"authors":13326,"authors_orcid":13327,"year":12829,"doi":13328,"openalex_id":13329,"venue":687,"abstract_screenshot":21,"keywords":13330,"body":13331,"_type":51,"_id":13335,"_source":53,"_file":13336,"_stem":13337,"_extension":56,"locale":57},"\u002Fpublications\u002F2024\u002Fcontainerized-wearable-edge-ai-inference-framework-in-mobile-health-systems","Containerized Wearable Edge AI Inference Framework in Mobile Health Systems",[11726,5667,5665],[11728,5670,5669],"https:\u002F\u002Fdoi.org\u002F10.1007\u002F978-3-031-53830-8_28","W4392250206",[3123,23,12100,6973,1189,8778,4649,6465,8916,249,4242,1113,37,179],{"type":39,"children":13332,"toc":13333},[],{"title":8,"searchDepth":49,"depth":49,"links":13334},[],"content:publications:2024:containerized-wearable-edge-ai-inference-framework-in-mobile-health-systems.md","publications\u002F2024\u002Fcontainerized-wearable-edge-ai-inference-framework-in-mobile-health-systems.md","publications\u002F2024\u002Fcontainerized-wearable-edge-ai-inference-framework-in-mobile-health-systems",{"_path":13339,"_dir":12825,"_draft":7,"_partial":7,"_locale":8,"title":13340,"description":13341,"_hidden":7,"authors":13342,"authors_orcid":13343,"year":12829,"doi":13344,"openalex_id":13345,"venue":1103,"abstract_screenshot":21,"keywords":13346,"body":13348,"_type":51,"_id":13356,"_source":53,"_file":13357,"_stem":13358,"_extension":56,"locale":57},"\u002Fpublications\u002F2024\u002Fconvolutional-neural-network-image-classification-based-on-different-color-space","Convolutional Neural Network Image Classification Based on Different Color Spaces","Although Convolutional Neural Networks (CNNs) have achieved remarkable success in image classification, most CNNs use image datasets in the Red-Green-Blue (RGB) color space (one of the most commonly used color spaces). The existing literature regarding the influence of color space use on the performance of CNNs is limited. This paper explores the impact of different color spaces on image classification using CNNs. We compare the performance of five CNN models with different convolution operations and numbers of layers on four image datasets, each converted to nine color spaces. We find that color space selection can significantly affect classification accuracy, and that some classes are more sensitive to color space changes than others. Different color spaces may have different expression abilities for different image features, such as brightness, saturation, hue, etc. To leverage the complementary information from different color spaces, we propose a pseudo-Siamese network that fuses two color spaces without modifying the network architecture. Our experiments show that our proposed model can outperform the single-color-space models on most datasets. We also find that our method is simple, flexible, and compatible with any CNN and image dataset.",[10643,645,595,10642],[10647,650,599,12878],"https:\u002F\u002Fdoi.org\u002F10.26599\u002Ftst.2024.9010001","W4402435377",[5545,37,23,4876,13347,4004,4391],"Contextual image classification",{"type":39,"children":13349,"toc":13354},[13350],{"type":42,"tag":43,"props":13351,"children":13352},{},[13353],{"type":47,"value":13341},{"title":8,"searchDepth":49,"depth":49,"links":13355},[],"content:publications:2024:convolutional-neural-network-image-classification-based-on-different-color-space.md","publications\u002F2024\u002Fconvolutional-neural-network-image-classification-based-on-different-color-space.md","publications\u002F2024\u002Fconvolutional-neural-network-image-classification-based-on-different-color-space",{"_path":13360,"_dir":12825,"_draft":7,"_partial":7,"_locale":8,"title":13361,"description":13362,"_hidden":7,"Architecture Workshops in a SfHEI\" authors":13363,"authors_orcid":13366,"year":12829,"doi":13369,"openalex_id":13370,"venue":21,"abstract_screenshot":21,"keywords":13371,"body":13373,"_type":51,"_id":13381,"_source":53,"_file":13382,"_stem":13383,"_extension":56,"locale":57},"\u002Fpublications\u002F2024\u002Fcreativity-using-generative-ai-vs-physical-modeling-a-case-study-of-architecture","Creativity Using Generative AI vs. Physical Modeling: A Case Study o","Purpose: This paper reports on an ongoing study examining the implementation of image-based generative AI in higher education to study the impacts and changes to learning behaviors and academic performance of architecture undergraduate students. The findings will be part of a methodological framework to evaluate whether or not AI is a high-value digital tool in this context. Approach: The study is designed through a series of workshops with architecture students, which aim to identify the role of image-based AI in the architecture design process for under-graduate students in Sino-foreign higher education institutions in order to assess the potential of using AI in the future architecture industry, especially for junior architects. Findings: The preliminary findings of this ongoing study indicate that AI increases the creativity of architecture design concepts, especially via better visual presentation for junior students. However, AI does not seem to be able to comprehend basic architecture design principles when it is implemented. Originality\u002Fvalue: The outcomes of this study will aid the larger teaching community when adopting AI in their teaching while mitigating the potential negative impacts on the students' learning experiences.",[13364,7078,595,13365],"Wang, Yimeng","Xie, Jing",[13367,7082,599,13368],"0000-0002-1394-6730","0000-0002-0855-5882","https:\u002F\u002Fdoi.org\u002F10.1109\u002Fcompsac61105.2024.00218","W4401879175",[4268,13372,6300,23,37,4479,5548,865,13059,13058],"Generative grammar",{"type":39,"children":13374,"toc":13379},[13375],{"type":42,"tag":43,"props":13376,"children":13377},{},[13378],{"type":47,"value":13362},{"title":8,"searchDepth":49,"depth":49,"links":13380},[],"content:publications:2024:creativity-using-generative-ai-vs-physical-modeling-a-case-study-of-architecture.md","publications\u002F2024\u002Fcreativity-using-generative-ai-vs-physical-modeling-a-case-study-of-architecture.md","publications\u002F2024\u002Fcreativity-using-generative-ai-vs-physical-modeling-a-case-study-of-architecture",{"_path":13385,"_dir":12825,"_draft":7,"_partial":7,"_locale":8,"title":13386,"description":13387,"_hidden":7,"prediction in cervical tumour authors":13388,"authors_orcid":13396,"year":12829,"doi":13403,"openalex_id":13404,"venue":13405,"abstract_screenshot":21,"keywords":13406,"body":13408,"_type":51,"_id":13416,"_source":53,"_file":13417,"_stem":13418,"_extension":56,"locale":57},"\u002Fpublications\u002F2024\u002Fcross-region-feature-fusion-of-global-and-local-area-for-subtype-classification","Cross-region feature fusion of global and local area for subtype classification","To develop a cross-regional feature fusion model for the classification of cervical tumour subtypes using non-invasive magnetic resonance imaging (MRI), we aimed to explore feature representation in both global and local areas, and to compare their effect on predictive performance. This retrospective study included 100 patients with cervical cancer, approved by the Ethical Review Board Committee. Self-supervised learning-based global features were fused with local features for subtype classification modelling. Global features were extracted from the bottleneck of our 3D autoencoder network, while local features were derived based on a radiomics tool. Utilizing the global and local features, the classification model is based on machine learning algorithms to predict two subtypes with pathologically confirmed cervical squamous cell carcinoma and adenocarcinoma. Comparison performance was accessed using area under the curve (AUC), sensitivity, specificity, F1 score, and precision. The cross-regional feature fusion model showed the best performance (accuracy: 0.95 vs 0.65 in the fusion model and global model) by the support vector machines (SVM) classifier. Even when applied to axial slices with various classification methods, the fusion model consistently yields the best results. Our approach preliminary evidence suggests that the fusion of global and local features provides a significant advantage in the clinical diagnosis of cervical cancer subtypes, warranting further investigation and potential application in cervical cancer diagnosis.",[13389,13390,13391,13392,13393,13394,8931,13395],"He, Jiahui","Xiao, Zhibo","Chen, Fu-qiang","Zheng, Boyun","Tan, Shudong","Xie, Yaoqin","Qin, Wenjian",[13397,13398,13399,13400,21,13401,8937,13402],"0000-0002-2152-4810","0000-0002-7245-3186","0000-0002-4748-6074","0009-0008-8645-376X","0000-0002-1412-2354","0000-0003-2547-0394","https:\u002F\u002Fdoi.org\u002F10.1016\u002Fj.jrras.2024.101097","W4402642886","Journal of Radiation Research and Applied Sciences",[6875,9189,13407,4876,380,37,23,9399,9396],"Cervical cancer",{"type":39,"children":13409,"toc":13414},[13410],{"type":42,"tag":43,"props":13411,"children":13412},{},[13413],{"type":47,"value":13387},{"title":8,"searchDepth":49,"depth":49,"links":13415},[],"content:publications:2024:cross-region-feature-fusion-of-global-and-local-area-for-subtype-classification.md","publications\u002F2024\u002Fcross-region-feature-fusion-of-global-and-local-area-for-subtype-classification.md","publications\u002F2024\u002Fcross-region-feature-fusion-of-global-and-local-area-for-subtype-classification",{"_path":13420,"_dir":12825,"_draft":7,"_partial":7,"_locale":8,"title":13421,"description":8,"_hidden":7,"with Augmented Reality authors":13422,"authors_orcid":13425,"year":12829,"doi":13427,"openalex_id":13428,"venue":687,"abstract_screenshot":21,"keywords":13429,"body":13431,"_type":51,"_id":13435,"_source":53,"_file":13436,"_stem":13437,"_extension":56,"locale":57},"\u002Fpublications\u002F2024\u002Fdeep-learning-approach-for-enhanced-object-recognition-and-assembly-guidance-wit","Deep Learning Approach for Enhanced Object Recognition and Assembly Guidance",[5667,13423,13424,11421,5407,5665],"Wang, Xiaoying","Han, Renzhi",[5670,13426,21,11428,5411,5669],"0000-0001-9822-961X","https:\u002F\u002Fdoi.org\u002F10.1007\u002F978-3-031-53830-8_11","W4392250137",[4387,23,7445,37,868,13430,6976,4391],"Cognitive neuroscience of visual object recognition",{"type":39,"children":13432,"toc":13433},[],{"title":8,"searchDepth":49,"depth":49,"links":13434},[],"content:publications:2024:deep-learning-approach-for-enhanced-object-recognition-and-assembly-guidance-wit.md","publications\u002F2024\u002Fdeep-learning-approach-for-enhanced-object-recognition-and-assembly-guidance-wit.md","publications\u002F2024\u002Fdeep-learning-approach-for-enhanced-object-recognition-and-assembly-guidance-wit",{"_path":13439,"_dir":12825,"_draft":7,"_partial":7,"_locale":8,"title":13440,"description":13441,"_hidden":7,"authors":13442,"authors_orcid":13454,"year":12829,"doi":13461,"openalex_id":13462,"venue":21,"abstract_screenshot":21,"keywords":13463,"body":13466,"_type":51,"_id":13474,"_source":53,"_file":13475,"_stem":13476,"_extension":56,"locale":57},"\u002Fpublications\u002F2024\u002Fdeep-learning-for-retina-structural-biomarker-classification-using-oct-images","Deep learning for retina structural biomarker classification using OCT images","This study presents an approach to identifying retinal structural biomarkers in ophthalmology, which is essential for accurate diagnosis and effective treatment of eye diseases. We develop a multi-modal, multi-task deep learning framework that integrates supervised and semi-supervised training methods. This model effectively processes a combination of 3D Optical Coherence Tomography (OCT) images and one-dimensional clinical data. A key advancement is introducing a custom post-processing method that significantly improves the precision of biomarker detection. Our model successfully identifies six distinct biomarkers in the retina and achieves a notable macro f1-score of 71.62%, representing a substantial 14.48% improvement over the baseline performance. This advancement underscores the potential of deep learning in enhancing diagnostic accuracy and treatment efficacy in ophthalmology.",[13443,13444,13445,13446,13447,13448,13449,13450,13451,13452,13453,8931],"Xu, Chi","Zheng, Huizhong","Liu, Keyi","Chen, Yanming","Chen, Ye","Niu, Chenxi","Jin, Shengji","Li, Yue","Gao, Haowei","Hu, Jingxi","Zou, Yuanhao",[13455,13456,21,13457,13458,21,21,13459,21,13460,21,8937],"0000-0001-7389-5763","0000-0003-1658-6467","0009-0005-2343-4711","0000-0003-1318-5561","0009-0006-5923-6044","0000-0003-4564-710X","https:\u002F\u002Fdoi.org\u002F10.1117\u002F12.3026739","W4396578671",[13464,23,37,13465,6976,4876,4391,10806,4608,7486],"Retina","Biomarker",{"type":39,"children":13467,"toc":13472},[13468],{"type":42,"tag":43,"props":13469,"children":13470},{},[13471],{"type":47,"value":13441},{"title":8,"searchDepth":49,"depth":49,"links":13473},[],"content:publications:2024:deep-learning-for-retina-structural-biomarker-classification-using-oct-images.md","publications\u002F2024\u002Fdeep-learning-for-retina-structural-biomarker-classification-using-oct-images.md","publications\u002F2024\u002Fdeep-learning-for-retina-structural-biomarker-classification-using-oct-images",{"_path":13478,"_dir":12825,"_draft":7,"_partial":7,"_locale":8,"title":13479,"description":13480,"_hidden":7,"authors":13481,"authors_orcid":13482,"year":12829,"doi":13483,"openalex_id":13484,"venue":206,"abstract_screenshot":21,"keywords":13485,"body":13486,"_type":51,"_id":13494,"_source":53,"_file":13495,"_stem":13496,"_extension":56,"locale":57},"\u002Fpublications\u002F2024\u002Fdeep-reinforcement-learning-assisted-genetic-programming-ensemble-hyper-heuristi","Deep Reinforcement Learning Assisted Genetic Programming Ensemble Hyper-Heuristics for Dynamic Scheduling of Container Port Trucks","Efficient truck dispatching is crucial for optimizing container terminal operations within dynamic and complex scenarios. Despite good progress being made recently with more advanced uncertainty-handling techniques, existing approaches still have generalization issues and require considerable expertise and manual interventions in algorithm design. In this work, we present deep reinforcement learning-assisted genetic programming hyper-heuristics (DRL-GPHH) and their ensemble variant (DRL-GPEHH). These frameworks utilize a reinforcement learning agent to orchestrate a set of auto-generated genetic programming (GP) low-level heuristics, leveraging the collective intelligence, ensuring advanced robustness and an increased level of automation of the algorithm development. DRL-GPEHH, notably, excels through its concurrent integration of a GP heuristic ensemble, achieving enhanced adaptability and performance in complex, dynamic optimization tasks. This method effectively navigates traditional convergence issues of deep reinforcement learning (DRL) in sparse reward and vast action spaces, while avoiding the reliance on expert-designed heuristics. It also addresses the inadequate performance of the single GP individual in varying and complex environments and preserves the inherent interpretability of the GP approach. Evaluations across various real port operational instances highlight the adaptability and efficacy of our frameworks. Essentially, innovations in DRL-GPHH and DRL-GPEHH reveal the synergistic potential of reinforcement learning and GP in dynamic truck dispatching, yielding transformative impacts on algorithm design and significantly advancing solutions to complex real-world optimization problems.",[5989,12,319,11507,12849],[5991,15,322,11509,12852],"https:\u002F\u002Fdoi.org\u002F10.1109\u002Ftevc.2024.3381042","W4393171197",[506,23,746,5304,97,450,106,37,5996,3201,1192,1189,31,215,179,332,1113,251,34,250],{"type":39,"children":13487,"toc":13492},[13488],{"type":42,"tag":43,"props":13489,"children":13490},{},[13491],{"type":47,"value":13480},{"title":8,"searchDepth":49,"depth":49,"links":13493},[],"content:publications:2024:deep-reinforcement-learning-assisted-genetic-programming-ensemble-hyper-heuristi.md","publications\u002F2024\u002Fdeep-reinforcement-learning-assisted-genetic-programming-ensemble-hyper-heuristi.md","publications\u002F2024\u002Fdeep-reinforcement-learning-assisted-genetic-programming-ensemble-hyper-heuristi",{"_path":13498,"_dir":12825,"_draft":7,"_partial":7,"_locale":8,"title":13499,"description":8,"_hidden":7,"Portfolio authors":13500,"authors_orcid":13502,"year":12829,"doi":13503,"openalex_id":13504,"venue":74,"abstract_screenshot":21,"keywords":13505,"body":13507,"_type":51,"_id":13511,"_source":53,"_file":13512,"_stem":13513,"_extension":56,"locale":57},"\u002Fpublications\u002F2024\u002Fdeterminants-of-loan-funding-success-and-default-for-a-chinese-microfinance-port","Determinants of Loan Funding Success and Default for a Chinese Microfinance",[13501,10359,4189,268],"Goh, Chang Chuan",[21,10361,4191,272],"https:\u002F\u002Fdoi.org\u002F10.2139\u002Fssrn.5028417","W4404602541",[13506,178,718,6687,6686,1357,429,173,36,3713],"Microfinance",{"type":39,"children":13508,"toc":13509},[],{"title":8,"searchDepth":49,"depth":49,"links":13510},[],"content:publications:2024:determinants-of-loan-funding-success-and-default-for-a-chinese-microfinance-port.md","publications\u002F2024\u002Fdeterminants-of-loan-funding-success-and-default-for-a-chinese-microfinance-port.md","publications\u002F2024\u002Fdeterminants-of-loan-funding-success-and-default-for-a-chinese-microfinance-port",{"_path":13515,"_dir":12825,"_draft":7,"_partial":7,"_locale":8,"title":13516,"description":13517,"_hidden":7,"authors":13518,"authors_orcid":13520,"year":12829,"doi":13522,"openalex_id":13523,"venue":13524,"abstract_screenshot":21,"keywords":13525,"body":13530,"_type":51,"_id":13538,"_source":53,"_file":13539,"_stem":13540,"_extension":56,"locale":57},"\u002Fpublications\u002F2024\u002Fdiscrete-time-survival-models-with-neural-networks-for-age-period-cohort-analysi","Discrete-Time Survival Models with Neural Networks for Age–Period–Cohort Analysis of Credit Risk","Survival models have become popular for credit risk estimation. Most current credit risk survival models use an underlying linear model. This is beneficial in terms of interpretability but is restrictive for real-life applications since it cannot discover hidden nonlinearities and interactions within the data. This study uses discrete-time survival models with embedded neural networks as estimators of time to default. This provides flexibility to express nonlinearities and interactions between variables and hence allows for models with better overall model fit. Additionally, the neural networks are used to estimate age–period–cohort (APC) models so that default risk can be decomposed into time components for loan age (maturity), origination (vintage), and environment (e.g., economic, operational, and social effects). These can be built as general models or as local APC models for specific customer segments. The local APC models reveal special conditions for different customer groups. The corresponding APC identification problem is solved by a combination of regularization and fitting the decomposed environment time risk component to macroeconomic data since the environmental risk is expected to have a strong relationship with macroeconomic conditions. Our approach is shown to be effective when tested on a large publicly available US mortgage dataset. This novel framework can be adapted by practitioners in the financial industry to improve modeling, estimation, and assessment of credit risk.",[13519,4189,319,12],"Wang, Hao",[13521,4191,322,15],"0000-0002-0543-1024","https:\u002F\u002Fdoi.org\u002F10.3390\u002Frisks12020031","W4391542532","Risks",[13526,632,13527,13528,380,13529,287,173,36,23,9399,3666,37,34],"Period (music)","Cohort","Survival analysis","Discrete time and continuous time",{"type":39,"children":13531,"toc":13536},[13532],{"type":42,"tag":43,"props":13533,"children":13534},{},[13535],{"type":47,"value":13517},{"title":8,"searchDepth":49,"depth":49,"links":13537},[],"content:publications:2024:discrete-time-survival-models-with-neural-networks-for-age-period-cohort-analysi.md","publications\u002F2024\u002Fdiscrete-time-survival-models-with-neural-networks-for-age-period-cohort-analysi.md","publications\u002F2024\u002Fdiscrete-time-survival-models-with-neural-networks-for-age-period-cohort-analysi",{"_path":13542,"_dir":12825,"_draft":7,"_partial":7,"_locale":8,"title":13543,"description":13544,"_hidden":7,"Patterns for Dynamic Texture Recognition authors":13545,"authors_orcid":13546,"year":12829,"doi":13547,"openalex_id":13548,"venue":21,"abstract_screenshot":21,"keywords":13549,"body":13552,"_type":51,"_id":13560,"_source":53,"_file":13561,"_stem":13562,"_extension":56,"locale":57},"\u002Fpublications\u002F2024\u002Fdiscriminant-pixel-difference-vector-hashing-of-spatial-temporal-local-binary-pa","Discriminant Pixel-Difference Vector Hashing of Spatial-Temporal Local Binary","Spatial-Temporal Local Binary Pattern (STLBP) has been widely used for dynamic texture (DT) recognition. Hashing Pixel-Difference Vectors (PDVs) into binary codes before forming histogram features has proven its effectiveness in improving the discriminative power of LBP features. However, hashing PDVs and forming histograms are often separated into two steps, resulting in sub-optimal LBP features. To bridge this gap, we propose to integrate the criterion of maximizing the discriminant power of LBP histogram features backwards into PDV hashing. Specifically, during PDV hashing, we propose to add the criteria of maximizing the Bhattacharyya distance between LBP histograms of different classes and minimizing the distance between LBP histograms of the same class. The histograms of hash codes are clustered to form a dictionary, and the generated codewords are used for final classification. The proposed method is evaluated on the DynTex++ dataset and a large fire-detection dataset. It significantly outperforms state-of-the-art STLBP descriptors.",[9271,6111,5532,157,9048],[9273,6113,5537,9274,9051],"https:\u002F\u002Fdoi.org\u002F10.1109\u002Ficassp48485.2024.10447766","W4392904641",[13550,4876,9280,9279,37,10551,9282,23,9091,9281,13551,9056,9283,34,9284,4004,9285],"Bhattacharyya distance","Binary code",{"type":39,"children":13553,"toc":13558},[13554],{"type":42,"tag":43,"props":13555,"children":13556},{},[13557],{"type":47,"value":13544},{"title":8,"searchDepth":49,"depth":49,"links":13559},[],"content:publications:2024:discriminant-pixel-difference-vector-hashing-of-spatial-temporal-local-binary-pa.md","publications\u002F2024\u002Fdiscriminant-pixel-difference-vector-hashing-of-spatial-temporal-local-binary-pa.md","publications\u002F2024\u002Fdiscriminant-pixel-difference-vector-hashing-of-spatial-temporal-local-binary-pa",{"_path":13564,"_dir":12825,"_draft":7,"_partial":7,"_locale":8,"title":13565,"description":13566,"_hidden":7,"authors":13567,"authors_orcid":13570,"year":12829,"doi":13573,"openalex_id":13574,"venue":13575,"abstract_screenshot":13576,"keywords":13577,"body":13579,"_type":51,"_id":13587,"_source":53,"_file":13588,"_stem":13589,"_extension":56,"locale":57},"\u002Fpublications\u002F2024\u002Fdiscriminative-multi-scale-adjacent-feature-for-person-re-identification","Discriminative multi-scale adjacent feature for person re-identification","Abstract Recently, discriminative and robust identification information has played an increasingly critical role in Person Re-identification (Re-ID). It is a fact that the existing part-based methods demonstrate strong performance in the extraction of fine-grained features. However, their intensive partitions lead to semantic information ambiguity and background interference. Meanwhile, we observe that the body with different structural proportions. Hence, we assume that aggregation with the multi-scale adjacent features can effectively alleviate the above issues. In this paper, we propose a novel Discriminative Multi-scale Adjacent Feature (MSAF) learning framework to enrich semantic information and disregard background. In summary, we establish multi-scale interaction in two stages: the feature extraction stage and the feature aggregation stage. Firstly, a Multi-scale Feature Extraction (MFE) module is designed by combining CNN and Transformer structure to obtain the discriminative specific feature, as the basis for the feature aggregation stage. Secondly, a Jointly Part-based Feature Aggregation (JPFA) mechanism is revealed to implement adjacent feature aggregation with diverse scales. The JPFA contains Same-scale Feature Correlation (SFC) and Cross-scale Feature Correlation (CFC) sub-modules. Finally, to verify the effectiveness of the proposed method, extensive experiments are performed on the common datasets of Market-1501, CUHK03-NP, DukeMTMC, and MSMT17. The experimental results achieve better performance than many state-of-the-art methods.",[13568,11896,13569,9416,12592],"Qi, Mengzan","Hong, Feng",[21,11901,13571,9422,13572],"0000-0002-5846-1390","0000-0001-8197-789X","https:\u002F\u002Fdoi.org\u002F10.1007\u002Fs40747-024-01395-2","W4393031985","Complex & Intelligent Systems","discriminative-multi-scale-adjacent-feature-for-person-re-identification.png",[10551,23,4876,6875,7391,37,3387,4265,10042,13578,181,215],"Feature learning",{"type":39,"children":13580,"toc":13585},[13581],{"type":42,"tag":43,"props":13582,"children":13583},{},[13584],{"type":47,"value":13566},{"title":8,"searchDepth":49,"depth":49,"links":13586},[],"content:publications:2024:discriminative-multi-scale-adjacent-feature-for-person-re-identification.md","publications\u002F2024\u002Fdiscriminative-multi-scale-adjacent-feature-for-person-re-identification.md","publications\u002F2024\u002Fdiscriminative-multi-scale-adjacent-feature-for-person-re-identification",{"_path":13591,"_dir":12825,"_draft":7,"_partial":7,"_locale":8,"title":13592,"description":13593,"_hidden":7,"Study\" authors":13594,"authors_orcid":13595,"year":12829,"doi":13596,"openalex_id":13597,"venue":21,"abstract_screenshot":21,"keywords":13598,"body":13599,"_type":51,"_id":13607,"_source":53,"_file":13608,"_stem":13609,"_extension":56,"locale":57},"\u002Fpublications\u002F2024\u002Fenabling-effective-metamorphic-relation-generation-by-novice-testers-a-pilot-stu","Enabling Effective Metamorphic- Relation Generation by Novice Testers: A Pilo","This paper presents a pilot study that examines the capacity of novice testers to generate Metamorphic Relations (MRs) for autonomous driving systems (ADSs), specifically fo-cusing on parking functions. By comparing MRs generated by human participants with those generated by artificial intelligence (AI), we seek to understand the variances in quality, particularly in terms of correctness, applicability, novelty, and utility. Our findings indicate that despite receiving only minimal training, human participants were capable of producing MRs with a wide range of effectiveness. Notably, humans exhibited a potential for creative thinking, contrasting with AI's ability to generate MRs that adhere closely to technical and applicability standards. The study underscores the need for improved educational strategies aimed at enhancing the quality and confidence of MRs produced by humans. Future research directions will explore the optimization of training approaches, particularly within a constrained timeframe to create a positive learning experience and maintain participant engagement, to fully harness the creative capabilities of human learners in the context of ADS testing.",[8041,595,5407],[8045,599,5411],"https:\u002F\u002Fdoi.org\u002F10.1109\u002Fcompsac61105.2024.00384","W4401880185",[4965,23,3788,3789,181,5015],{"type":39,"children":13600,"toc":13605},[13601],{"type":42,"tag":43,"props":13602,"children":13603},{},[13604],{"type":47,"value":13593},{"title":8,"searchDepth":49,"depth":49,"links":13606},[],"content:publications:2024:enabling-effective-metamorphic-relation-generation-by-novice-testers-a-pilot-stu.md","publications\u002F2024\u002Fenabling-effective-metamorphic-relation-generation-by-novice-testers-a-pilot-stu.md","publications\u002F2024\u002Fenabling-effective-metamorphic-relation-generation-by-novice-testers-a-pilot-stu",{"_path":13611,"_dir":12825,"_draft":7,"_partial":7,"_locale":8,"title":13612,"description":13613,"_hidden":7,"authors":13614,"authors_orcid":13615,"year":12829,"doi":13616,"openalex_id":13617,"venue":21,"abstract_screenshot":21,"keywords":13618,"body":13619,"_type":51,"_id":13627,"_source":53,"_file":13628,"_stem":13629,"_extension":56,"locale":57},"\u002Fpublications\u002F2024\u002Fenhancing-ads-testing-an-open-educational-resource-for-metamorphic-testing","Enhancing ADS Testing: An Open Educational Resource for Metamorphic Testing","This study introduces a website serving as an Open Educational Resource (OER), dedicated to Metamorphic Testing (MT) and Metamorphic Relation (MR) generation, with a specific focus on Autonomous Driving Systems (ADSs). It offers a comprehensive introduction to MT and ADSs, and presents a specially designed scenario template that simplifies the MR generation process for ADS functions. This template enhances accessibility, making it more user-friendly for a wider audience, and facilitates systematic application, ensuring that users can apply test case and MR generation in a structured and organized manner. The MR generation guidelines that work with the template lower the learning barrier for beginners in MT, thus facilitating easier adoption and application of MT to ADSs.",[8041,595,5407,1156,596],[8045,599,5411,1158,600],"https:\u002F\u002Fdoi.org\u002F10.1109\u002Fcompsac61105.2024.00029","W4401879214",[23,924,606,3788,3789,139,5015,110,251],{"type":39,"children":13620,"toc":13625},[13621],{"type":42,"tag":43,"props":13622,"children":13623},{},[13624],{"type":47,"value":13613},{"title":8,"searchDepth":49,"depth":49,"links":13626},[],"content:publications:2024:enhancing-ads-testing-an-open-educational-resource-for-metamorphic-testing.md","publications\u002F2024\u002Fenhancing-ads-testing-an-open-educational-resource-for-metamorphic-testing.md","publications\u002F2024\u002Fenhancing-ads-testing-an-open-educational-resource-for-metamorphic-testing",{"_path":13631,"_dir":12825,"_draft":7,"_partial":7,"_locale":8,"title":13632,"description":13633,"_hidden":7,"Serious Gaming and Haptic Feedback authors":13634,"authors_orcid":13635,"year":12829,"doi":13636,"openalex_id":13637,"venue":13638,"abstract_screenshot":21,"keywords":13639,"body":13643,"_type":51,"_id":13651,"_source":53,"_file":13652,"_stem":13653,"_extension":56,"locale":57},"\u002Fpublications\u002F2024\u002Fenhancing-fire-safety-education-through-immersive-virtual-reality-training-with","Enhancing Fire Safety Education Through Immersive Virtual Reality Training with","Over the past decades, China has faced an increasingly severe fire issue, resulting in significant human and financial losses. Consequently, the importance of enhancing fire safety education for citizens has become more pronounced. However, due to safety risks in actual fire scenes, the practical use of firefighting equipment was often learned passively through text or video resources, posing challenges in ensuring users can proficiently operate actual equipment. Virtual reality (VR) emerged as a promising technology to provide users with a low-risk environment to gain hands-on experience with firefighting equipment. Therefore, this study aimed to assess the effectiveness of a specially designed VR game-based firefighting extinguishing equipment training (FEET) that integrated VR with serious gaming elements. The study evaluated the effectiveness of FEET through a comparison between high (HI) and low (LI) immersiveness VR and a non-immersive (NI) setting as a baseline. The study incorporated haptic feedback mechanisms, such as audio and vibration, to enhance user immersiveness within the HI setting. The focus of the study was on evaluating knowledge acquisition, user experiences, and interaction preferences for the proposed FEET design. The study adopted three distinct learning sequences to mitigate the VR halo effects. The results of the study indicated that both VR-based learning methods yielded outstanding user experiences that significantly surpassed the NI setting. Furthermore, the study showed that haptic feedback with richer game contents further enhanced user experiences, underscoring the importance of simulating realistic sensing in improving learning outcomes.",[11421,5667,5665],[11428,5670,5669],"https:\u002F\u002Fdoi.org\u002F10.1080\u002F10447318.2024.2364979","W4399890102","International Journal of Human-Computer Interaction",[13640,4390,3902,868,23,13641,13642,867,984,289],"Haptic technology","Immersion (mathematics)","Serious game",{"type":39,"children":13644,"toc":13649},[13645],{"type":42,"tag":43,"props":13646,"children":13647},{},[13648],{"type":47,"value":13633},{"title":8,"searchDepth":49,"depth":49,"links":13650},[],"content:publications:2024:enhancing-fire-safety-education-through-immersive-virtual-reality-training-with.md","publications\u002F2024\u002Fenhancing-fire-safety-education-through-immersive-virtual-reality-training-with.md","publications\u002F2024\u002Fenhancing-fire-safety-education-through-immersive-virtual-reality-training-with",{"_path":13655,"_dir":12825,"_draft":7,"_partial":7,"_locale":8,"title":13656,"description":13657,"_hidden":7,"augmented reality and game-based learning on student’s intrinsic motivation\" authors":13658,"authors_orcid":13660,"year":12829,"doi":13661,"openalex_id":13662,"venue":5512,"abstract_screenshot":21,"keywords":13663,"body":13665,"_type":51,"_id":13673,"_source":53,"_file":13674,"_stem":13675,"_extension":56,"locale":57},"\u002Fpublications\u002F2024\u002Fenhancing-learning-in-design-for-manufacturing-and-assembly-the-effects-of-augme","Enhancing learning in design for manufacturing and assembly: the effects o","Purpose This study aims to examine the effects on student motivation and perception of technological interventions within undergraduate mechanical engineering and product design and manufacture programs at a Sino-foreign international university. The authors use an augmented reality game application within a class on Design for Manufacturing and Assembly (DfMA) that was developed using the approaches of microlearning and digital game-based learning (DGBL). Design\u002Fmethodology\u002Fapproach Structured as design-based research, the study reports on developing innovative educational interventions and provides an empirical investigation of their effectiveness. Data were collected using a mixed methods approach, using pre- and post-tests and questionnaires, together with researcher observations and participant interviews. Findings Through two rounds of playtests, the game positively affected intrinsic motivation and encouraged higher-order cognitive learning, critical thinking, communication and collaboration. Collaborative learning plays a significant role, DGBL is preferred over traditional methods and microlearning reduces information density and cognitive overload. Originality\u002Fvalue The study contributes to our understanding of digital game-based interventions on students’ intrinsic motivation and provides insights into effective ways to design instructional materials in similar teaching and learning settings.",[7077,7078,13659,11421,595,11423,7079,11425],"Long, Pinzhuang",[7081,7082,21,11428,599,21,7083,11431],"https:\u002F\u002Fdoi.org\u002F10.1108\u002Fitse-11-2023-0221","W4401231826",[4387,13664,866,865,11630,4173,11435,868,23,867,870],"Instructional design",{"type":39,"children":13666,"toc":13671},[13667],{"type":42,"tag":43,"props":13668,"children":13669},{},[13670],{"type":47,"value":13657},{"title":8,"searchDepth":49,"depth":49,"links":13672},[],"content:publications:2024:enhancing-learning-in-design-for-manufacturing-and-assembly-the-effects-of-augme.md","publications\u002F2024\u002Fenhancing-learning-in-design-for-manufacturing-and-assembly-the-effects-of-augme.md","publications\u002F2024\u002Fenhancing-learning-in-design-for-manufacturing-and-assembly-the-effects-of-augme",{"_path":13677,"_dir":12825,"_draft":7,"_partial":7,"_locale":8,"title":13678,"description":8,"_hidden":7,"authors":13679,"authors_orcid":13682,"year":12829,"doi":13684,"openalex_id":13685,"venue":13686,"abstract_screenshot":21,"keywords":13687,"body":13689,"_type":51,"_id":13693,"_source":53,"_file":13694,"_stem":13695,"_extension":56,"locale":57},"\u002Fpublications\u002F2024\u002Fenhancing-online-yard-crane-scheduling-through-a-two-stage-rollout-memetic-genet","Enhancing online yard crane scheduling through a two-stage rollout memetic genetic programming",[13680,12,13252,5989,13681],"Jin, Chenwei","Tan, Leshan",[21,15,13255,5991,13683],"0009-0002-6060-3834","https:\u002F\u002Fdoi.org\u002F10.1007\u002Fs12293-024-00424-4","W4401925239","Memetic Computing",[3202,450,23,24,1222,13688,3201,249,33,179],"Dynamic priority scheduling",{"type":39,"children":13690,"toc":13691},[],{"title":8,"searchDepth":49,"depth":49,"links":13692},[],"content:publications:2024:enhancing-online-yard-crane-scheduling-through-a-two-stage-rollout-memetic-genet.md","publications\u002F2024\u002Fenhancing-online-yard-crane-scheduling-through-a-two-stage-rollout-memetic-genet.md","publications\u002F2024\u002Fenhancing-online-yard-crane-scheduling-through-a-two-stage-rollout-memetic-genet",{"_path":13697,"_dir":12825,"_draft":7,"_partial":7,"_locale":8,"title":13698,"description":13699,"_hidden":7,"authors":13700,"authors_orcid":13705,"year":12829,"doi":13710,"openalex_id":13711,"venue":21,"abstract_screenshot":21,"keywords":13712,"body":13713,"_type":51,"_id":13721,"_source":53,"_file":13722,"_stem":13723,"_extension":56,"locale":57},"\u002Fpublications\u002F2024\u002Fevolution-assisted-deep-reinforcement-learning-for-fast-charging-station-coordin","Evolution-Assisted Deep Reinforcement Learning for Fast Charging Station Coordinated Operation","The shift towards transportation electrification, marked by the rising use of electric vehicles (EVs) and the development of fast charging stations (FCS), plays a crucial role in transport decarbonization initiatives. To optimize the rollout of FCS and set appropriate charging service fees (CSF)-a process referred to as the coupled FCS multi-stage bi-level operation problem (FCS-MBOP)-is essential for improving both investment and operational efficiency within the integrated power distribution and transportation network (CPTN). For operators, it's not only necessary to adapt to short-term fluctuations within the environment but also to swiftly respond to changes in the FCS layout resulting from various long-term investment decisions. To address this complexity, we introduce a dual-timescale evolutionary assist deep reinforcement learning framework, which includes two specialized agents with distinct functions: an investment agent (planner) and an operational agent (operator). The planner focuses on annual investments, evolving long-term strategies that weigh social benefits against investment costs through the use of a genetic algorithm (GA). In contrast, the operator acts on an hourly basis, fine-tuning CSF to alleviate traffic congestion and minimize the social costs, while taking into account the planner's feasible investment decisions. Leveraging the integrated capabilities of a graph neural network (GNN), long-short-term memory (LSTM), and attention mechanisms, our framework's agents are adept at extracting both temporal and spatial features and facilitating the transfer of experiences across different investment stages. Empirical evidence underscores the effectiveness of our approach, showcasing its ability to surpass conventional methodologies in delivering high-quality solutions.",[10191,13701,13702,13188,13703,13189,709,13704,12],"Gu, Yujing","Jia, Fuhua","Wang, Hongru","Ye, Yujian",[13706,21,21,13707,13708,13193,711,13709,15],"0000-0003-4506-4801","0000-0002-1790-4044","0000-0002-9859-4462","0000-0002-9278-9218","https:\u002F\u002Fdoi.org\u002F10.1109\u002Fcec60901.2024.10611768","W4401414786",[5304,23,37],{"type":39,"children":13714,"toc":13719},[13715],{"type":42,"tag":43,"props":13716,"children":13717},{},[13718],{"type":47,"value":13699},{"title":8,"searchDepth":49,"depth":49,"links":13720},[],"content:publications:2024:evolution-assisted-deep-reinforcement-learning-for-fast-charging-station-coordin.md","publications\u002F2024\u002Fevolution-assisted-deep-reinforcement-learning-for-fast-charging-station-coordin.md","publications\u002F2024\u002Fevolution-assisted-deep-reinforcement-learning-for-fast-charging-station-coordin",{"_path":13725,"_dir":12825,"_draft":7,"_partial":7,"_locale":8,"title":13726,"description":13727,"_hidden":7,"Learning Motivation in Physics Education authors":13728,"authors_orcid":13729,"year":12829,"doi":13731,"openalex_id":13732,"venue":21,"abstract_screenshot":21,"keywords":13733,"body":13735,"_type":51,"_id":13743,"_source":53,"_file":13744,"_stem":13745,"_extension":56,"locale":57},"\u002Fpublications\u002F2024\u002Fexploring-collaborative-immersive-virtual-reality-serious-games-for-enhancing-le","Exploring Collaborative Immersive Virtual Reality Serious Games for Enhancing","Physics education posed challenges, with students' limited interest attributed to the subject's abstract nature as well as educators' struggles in conveying complex concepts effectively. To address these challenges, a collaborative-based, high-immersion virtual reality (IVR) game approach for physics education was proposed in this study. The focus of this study was to enhance student motivation and improving learning outcome through the integration of serious game elements. Eight distinct serious game elements were explored, incorporating narrative, autonomy, accomplishment, ownership, social interaction, challenge, and immersion into the game design. Students were assigned to complete three physics experiments within the game where they required to work collaboratively. Results indicated high ratings for integrated game features, with questionnaire responses revealing enhanced motivation among students who found physics less interesting. These findings highlighted the effectiveness of collaborative learning within IVR serious games, offering a valuable framework for future serious game design in physics education.",[11421,5667,12122,4793],[11428,5670,12125,13730],"0000-0002-0056-3052","https:\u002F\u002Fdoi.org\u002F10.1109\u002Fcompsac61105.2024.00026","W4401879052",[4390,868,23,867,13641,13734,866,865],"Physics education",{"type":39,"children":13736,"toc":13741},[13737],{"type":42,"tag":43,"props":13738,"children":13739},{},[13740],{"type":47,"value":13727},{"title":8,"searchDepth":49,"depth":49,"links":13742},[],"content:publications:2024:exploring-collaborative-immersive-virtual-reality-serious-games-for-enhancing-le.md","publications\u002F2024\u002Fexploring-collaborative-immersive-virtual-reality-serious-games-for-enhancing-le.md","publications\u002F2024\u002Fexploring-collaborative-immersive-virtual-reality-serious-games-for-enhancing-le",{"_path":13747,"_dir":12825,"_draft":7,"_partial":7,"_locale":8,"title":13748,"description":13749,"_hidden":7,"Immersive Virtual Reality Exergaming authors":13750,"authors_orcid":13751,"year":12829,"doi":13754,"openalex_id":13755,"venue":21,"abstract_screenshot":21,"keywords":13756,"body":13757,"_type":51,"_id":13765,"_source":53,"_file":13766,"_stem":13767,"_extension":56,"locale":57},"\u002Fpublications\u002F2024\u002Fexploring-emotional-responses-with-dynamic-difficulty-adjustment-adaptation-in-i","Exploring Emotional Responses with Dynamic Difficulty Adjustment Adaptation in","Immersive Virtual Reality (IVR) exergaming presents a promising avenue to integrate physical exercise with engaging virtual experiences, potentially encouraging sustained physical activity. However, maintaining user motivation over extended periods poses a significant challenge. Recent research has introduced the Dynamic Difficulty Adjustment (DDA) mechanism, dynamically regulating exergame difficulty based on specific conditions to enhance user adaptation. While prior studies have predominantly focused on gaming performance to adjust difficulty, they often overlook the emotional impact on user motivation. This study investigates users' emotional responses to the game timer change (TC) as a DDA mechanism during IVR exergaming. Results indicate that subjects in the TC-implemented game displayed more neutral emotions, concomitant with improved gaming performance. Conversely, subjects in the game without TC exhibited a broader range of detected emotions (sad and happy), suggesting difficulties in adapting to in-game difficulty levels incongruent with their gaming abilities. Overall, this study establishes a foundation for future research in affective computing-based IVR exergaming, aiming to develop an intelligent autonomous DDA mechanism tailored to users' physical and mental conditions.",[13424,5667,595,9416,5407],[13752,5670,599,13753,5411],"0000-0002-8202-9186","0000-0002-6282-342X","https:\u002F\u002Fdoi.org\u002F10.1109\u002Fcompsac61105.2024.00089","W4401880645",[4390,5573,868,23,867,865,10806],{"type":39,"children":13758,"toc":13763},[13759],{"type":42,"tag":43,"props":13760,"children":13761},{},[13762],{"type":47,"value":13749},{"title":8,"searchDepth":49,"depth":49,"links":13764},[],"content:publications:2024:exploring-emotional-responses-with-dynamic-difficulty-adjustment-adaptation-in-i.md","publications\u002F2024\u002Fexploring-emotional-responses-with-dynamic-difficulty-adjustment-adaptation-in-i.md","publications\u002F2024\u002Fexploring-emotional-responses-with-dynamic-difficulty-adjustment-adaptation-in-i",{"_path":13769,"_dir":12825,"_draft":7,"_partial":7,"_locale":8,"title":13770,"description":13771,"_hidden":7,"Super-Resolution\" authors":13772,"authors_orcid":13774,"year":12829,"doi":13775,"openalex_id":13776,"venue":11757,"abstract_screenshot":21,"keywords":13777,"body":13783,"_type":51,"_id":13791,"_source":53,"_file":13792,"_stem":13793,"_extension":56,"locale":57},"\u002Fpublications\u002F2024\u002Ffegan-a-feature-oriented-enhanced-gan-for-enhancing-thermal-image-super-resoluti","FEGAN: A Feature-Oriented Enhanced GAN for Enhancing Thermal Imag","Infrared thermal imaging presents significant potential in various domains. However, the widespread development of this technology is hindered by the high cost associated with acquiring high-quality thermal imaging sensors. To overcome this challenge, super-resolution techniques have emerged as a viable solution for extracting valuable information from low-resolution thermal images. While generative adversarial networks (GANs) have been widely adopted for thermal imaging super-resolution, their performance is limited by the inherent lack of detail in low-resolution training images, resulting in reduced fidelity and accuracy in generating high-resolution reconstructions. To tackle this challenge, this letter introduces FEGAN, a novel approach that enhances the performance of GANs by incorporating a feature-oriented enhanced (FE) mechanism within the generative network (GN). The FE plays a pivotal role in extracting high-frequency texture and edge details from lowresolution inputs and reconstructing them into enhanced images. This process substantially improves textures and edges within the training set of thermal images. Furthermore, refinements have been applied to both the GN and the discriminative network (DN) to enhance feature extraction efficiency. The experimental findings unequivocally demonstrate the superior performance of FEGAN compared to state-of-the-art methods. FEGAN achieves impressive performance metrics, including PSNR of 27.18, SSIM of 0.6523, FSIM of 0.5500, and LPIPS of 0.1221, highlighting its remarkable capabilities in the realm of thermal image superresolution.",[9830,7746,5667,11726,5665,13773],"Xu, Gen",[9834,21,5670,11728,5669,21],"https:\u002F\u002Fdoi.org\u002F10.1109\u002Flsp.2024.3356751","W4391092489",[6875,13778,23,4004,13779,7391,13780,4391,37,13781,3389,3961,13782,4876,3597,3959,5592],"Image resolution","Gallium nitride","Thermal","Wide-bandgap semiconductor","Optoelectronics",{"type":39,"children":13784,"toc":13789},[13785],{"type":42,"tag":43,"props":13786,"children":13787},{},[13788],{"type":47,"value":13771},{"title":8,"searchDepth":49,"depth":49,"links":13790},[],"content:publications:2024:fegan-a-feature-oriented-enhanced-gan-for-enhancing-thermal-image-super-resoluti.md","publications\u002F2024\u002Ffegan-a-feature-oriented-enhanced-gan-for-enhancing-thermal-image-super-resoluti.md","publications\u002F2024\u002Ffegan-a-feature-oriented-enhanced-gan-for-enhancing-thermal-image-super-resoluti",{"_path":13795,"_dir":12825,"_draft":7,"_partial":7,"_locale":8,"title":13796,"description":13797,"_hidden":7,"Scheduling in Embedded Systems\" authors":13798,"authors_orcid":13800,"year":12829,"doi":13802,"openalex_id":13803,"venue":6626,"abstract_screenshot":21,"keywords":13804,"body":13806,"_type":51,"_id":13814,"_source":53,"_file":13815,"_stem":13816,"_extension":56,"locale":57},"\u002Fpublications\u002F2024\u002Ffidrl-flexible-invocation-based-deep-reinforcement-learning-for-dvfs-scheduling","FiDRL: Flexible Invocation-Based Deep Reinforcement Learning for DVF","Deep Reinforcement Learning (DRL)-based Dynamic Voltage Frequency Scaling (DVFS) has shown great promise for energy conservation in embedded systems. While many works were devoted to validating its efficacy or improving its performance, few discuss the feasibility of the DRL agent deployment for embedded computing. State-of-the-art approaches focus on the miniaturization of agents’ inferential networks, such as pruning and quantization, to minimize their energy and resource consumption. However, this spatial-based paradigm still proves inadequate for resource-stringent systems. In this paper, we address the feasibility from a temporal perspective, where FiDRL, a flexible invocation-based DRL model is proposed to judiciously invoke itself to minimize the overall system energy consumption, given that the DRL agent incurs non-negligible energy overhead during invocations. Our approach is three-fold: (1) FiDRL that extends DRL by incorporating the agent's invocation interval into the action space to achieve invocation flexibility; (2) a FiDRL-based DVFS approach for both inter- and intra-task scheduling that minimizes the overall execution energy consumption; and (3) a FiDRL-based DVFS platform design and an on\u002Foff-chip hybrid algorithm specialized for training the DRL agent for embedded systems. Experiment results show that FiDRL achieves 55.1% agent invocation cost reduction, under 23.3% overall energy reduction, compared to state-of-the-art approaches.",[9304,5531,9302,9305,12923,5534,13799,12,709,5532],"Özcan, Ender",[9310,5536,9308,9311,21,5539,13801,21,711,5537],"0000-0003-0276-1391","https:\u002F\u002Fdoi.org\u002F10.1109\u002Ftc.2024.3465933","W4402743254",[23,5304,13805,450,6632,249,5548,37,179],"Invocation",{"type":39,"children":13807,"toc":13812},[13808],{"type":42,"tag":43,"props":13809,"children":13810},{},[13811],{"type":47,"value":13797},{"title":8,"searchDepth":49,"depth":49,"links":13813},[],"content:publications:2024:fidrl-flexible-invocation-based-deep-reinforcement-learning-for-dvfs-scheduling.md","publications\u002F2024\u002Ffidrl-flexible-invocation-based-deep-reinforcement-learning-for-dvfs-scheduling.md","publications\u002F2024\u002Ffidrl-flexible-invocation-based-deep-reinforcement-learning-for-dvfs-scheduling",{"_path":13818,"_dir":12825,"_draft":7,"_partial":7,"_locale":8,"title":13819,"description":8,"_hidden":7,"in China’s innovation policy network (1980–2019)\" authors":13820,"authors_orcid":13823,"year":12829,"doi":13826,"openalex_id":13827,"venue":13828,"abstract_screenshot":21,"keywords":13829,"body":13830,"_type":51,"_id":13834,"_source":53,"_file":13835,"_stem":13836,"_extension":56,"locale":57},"\u002Fpublications\u002F2024\u002Ffrom-contributors-to-boundary-spanners-evolving-roles-of-government-agencies-in","From contributors to boundary spanners: Evolving roles of government agencie",[3538,13821,65,13822],"Jiang, Lin","Tseng, Fang-Mei",[3540,13824,70,13825],"0000-0002-0722-5806","0000-0003-2166-3033","https:\u002F\u002Fdoi.org\u002F10.1016\u002Fj.technovation.2024.102974","W4392017343","Technovation",[282,3255,7678,178,6927,3714,1358,3259],{"type":39,"children":13831,"toc":13832},[],{"title":8,"searchDepth":49,"depth":49,"links":13833},[],"content:publications:2024:from-contributors-to-boundary-spanners-evolving-roles-of-government-agencies-in.md","publications\u002F2024\u002Ffrom-contributors-to-boundary-spanners-evolving-roles-of-government-agencies-in.md","publications\u002F2024\u002Ffrom-contributors-to-boundary-spanners-evolving-roles-of-government-agencies-in",{"_path":13838,"_dir":12825,"_draft":7,"_partial":7,"_locale":8,"title":13839,"description":13840,"_hidden":7,"authors":13841,"authors_orcid":13843,"year":12829,"doi":13844,"openalex_id":13845,"venue":21,"abstract_screenshot":21,"keywords":13846,"body":13848,"_type":51,"_id":13856,"_source":53,"_file":13857,"_stem":13858,"_extension":56,"locale":57},"\u002Fpublications\u002F2024\u002Ffrom-syntax-to-semantics-an-oer-powered-sql-learning-and-visualisation-tool","FROM Syntax to Semantics: An OER-Powered SQL Learning and Visualisation Tool","We introduce a web-based SQL query visualisation tool aimed at improving students' understanding of SQL query execution. The tool, available as an Open Educational Resource (OER), allows users to visualise the stages of a SQL query on an uploaded SQLite database. The web interface enables students to interactively explore each stage of the query and view results in a dynamically updated table. This initial version of the tool is intended to inspire further development and enhancement while providing educators with a valuable resource for teaching SQL concepts.",[13842,595,5407],"Zhou, Yuyan",[21,599,5411],"https:\u002F\u002Fdoi.org\u002F10.1109\u002Fcompsac61105.2024.00219","W4401879167",[23,6490,110,5210,13847,9028,4479,37],"SQL",{"type":39,"children":13849,"toc":13854},[13850],{"type":42,"tag":43,"props":13851,"children":13852},{},[13853],{"type":47,"value":13840},{"title":8,"searchDepth":49,"depth":49,"links":13855},[],"content:publications:2024:from-syntax-to-semantics-an-oer-powered-sql-learning-and-visualisation-tool.md","publications\u002F2024\u002Ffrom-syntax-to-semantics-an-oer-powered-sql-learning-and-visualisation-tool.md","publications\u002F2024\u002Ffrom-syntax-to-semantics-an-oer-powered-sql-learning-and-visualisation-tool",{"_path":13860,"_dir":12825,"_draft":7,"_partial":7,"_locale":8,"title":13861,"description":8,"_hidden":7,"authors":13862,"authors_orcid":13865,"year":12829,"doi":13868,"openalex_id":13869,"venue":13686,"abstract_screenshot":21,"keywords":13870,"body":13874,"_type":51,"_id":13878,"_source":53,"_file":13879,"_stem":13880,"_extension":56,"locale":57},"\u002Fpublications\u002F2024\u002Fgase-graph-attention-sampling-with-edges-fusion-for-solving-vehicle-routing-prob","Gase: graph attention sampling with edges fusion for solving vehicle routing problems",[13863,12,13218,13799,13864],"Wang, Zhenwei","Zhang, Tiehua",[13866,15,21,13801,13867],"0000-0003-1323-5303","0000-0001-9724-9432","https:\u002F\u002Fdoi.org\u002F10.1007\u002Fs12293-024-00428-0","W4401363951",[23,13871,9029,5304,102,13872,9955,3331,4649,13873,37,332],"Adjacency matrix","Adjacency list","Graph embedding",{"type":39,"children":13875,"toc":13876},[],{"title":8,"searchDepth":49,"depth":49,"links":13877},[],"content:publications:2024:gase-graph-attention-sampling-with-edges-fusion-for-solving-vehicle-routing-prob.md","publications\u002F2024\u002Fgase-graph-attention-sampling-with-edges-fusion-for-solving-vehicle-routing-prob.md","publications\u002F2024\u002Fgase-graph-attention-sampling-with-edges-fusion-for-solving-vehicle-routing-prob",{"_path":13882,"_dir":12825,"_draft":7,"_partial":7,"_locale":8,"title":13883,"description":13884,"_hidden":7,"Confucian China\" authors":13885,"authors_orcid":13886,"year":12829,"doi":13887,"openalex_id":13888,"venue":9362,"abstract_screenshot":21,"keywords":13889,"body":13890,"_type":51,"_id":13898,"_source":53,"_file":13899,"_stem":13900,"_extension":56,"locale":57},"\u002Fpublications\u002F2024\u002Fglobal-csr-standards-meet-local-culture-case-studies-of-mnc-subsidiaries-in-conf","Global CSR Standards Meet Local Culture: Case Studies of MNC Subsidiaries i","This study examines the global–local corporate social responsibility (CSR) interface in the context of Confucian culture by analyzing four multinational corporation (MNC) subsidiaries in China. We collect both primary data via 18 in-depth interviews and secondary data. Our findings suggest that, driven by the need for internal and external legitimacy, these China-based MNC subsidiaries simultaneously implement global and local CSR practices while adhering to the overarching global CSR strategy formulated by headquarters. Confucianism impacts the social dimensions of CSR practices during local implementation. It also acts as a catalyst for accelerating global CSR efforts and tailoring specific local CSR practices, leading to “glocalization” via a “reconciliation” mechanism, while hindering global CSR initiatives through an “interference” mechanism. Our research carries valuable implications for CSR practitioners operating within the MNC framework.",[12692,65],[21,70],"https:\u002F\u002Fdoi.org\u002F10.5465\u002Famproc.2024.18461abstract","W4400442092",[11785,178,282,11786,7575,1358,9340,6927,429],{"type":39,"children":13891,"toc":13896},[13892],{"type":42,"tag":43,"props":13893,"children":13894},{},[13895],{"type":47,"value":13884},{"title":8,"searchDepth":49,"depth":49,"links":13897},[],"content:publications:2024:global-csr-standards-meet-local-culture-case-studies-of-mnc-subsidiaries-in-conf.md","publications\u002F2024\u002Fglobal-csr-standards-meet-local-culture-case-studies-of-mnc-subsidiaries-in-conf.md","publications\u002F2024\u002Fglobal-csr-standards-meet-local-culture-case-studies-of-mnc-subsidiaries-in-conf",{"_path":13902,"_dir":12825,"_draft":7,"_partial":7,"_locale":8,"title":13903,"description":13904,"_hidden":7,"Robot‐Assisted Intravascular Catheterization":13905,"authors":13906,"authors_orcid":13907,"year":12829,"doi":13908,"openalex_id":13909,"venue":13910,"abstract_screenshot":21,"keywords":13911,"body":13915,"_type":51,"_id":13923,"_source":53,"_file":13924,"_stem":13925,"_extension":56,"locale":57},"\u002Fpublications\u002F2024\u002Fguidewire-endpoint-detection-based-on-pixel-adjacent-relation-during-robot-assis","Guidewire Endpoint Detection Based on Pixel‐Adjacent Relation durin","Existing surgical guidewire endpoint localization methods in X‐ray images face challenges owing to their small size, simple appearance, nonrigid nature of objects, low signal‐to‐noise ratio of X‐ray images, and imbalance between the number of guidewire and background pixels, which lead to errors in surgical navigation. An eight‐neighborhood‐based method for increasing the localization accuracy of guidewire endpoint to improve the safety of interventional procedures is proposed herein. The proposed method includes two stages: 1) An improved U‐Net network is employed for segmenting the data of the guidewire to extract regions of interest containing guidewire endpoints with higher precision and to reduce interference from other anatomical structures and imaging artifacts. 2) The proposed method detects guidewire endpoints using the adjacent relationship between pixels in the eight‐neighborhood regions. This stage covers skeletonization extraction, removal of bifurcation points, and repair of fracture points. This study achieves mean pixel errors of 2.02 and 2.13 pixels in an in vivo rabbit and porcine X‐ray fluoroscopy images, outperforming ten classic heatmap and regression methods, achieving state‐of‐the‐art detection results. The proposed method can also be applied to detect other tiny surgical instruments such as stents and balloons, while preserving the flexibility of the guidewire bending angle.","In Vivo Mammalian Models\"",[9462,11800,9463,9464,11801,9466,8406,5667,9467],[9469,11803,9470,9471,11804,9473,8409,5670,9474],"https:\u002F\u002Fdoi.org\u002F10.1002\u002Faisy.202300687","W4390639624","Advanced Intelligent Systems",[9091,37,13912,13913,4391,23,9090,4093,13914,380,4004,9484],"Fluoroscopy","Skeletonization","Biomedical engineering",{"type":39,"children":13916,"toc":13921},[13917],{"type":42,"tag":43,"props":13918,"children":13919},{},[13920],{"type":47,"value":13904},{"title":8,"searchDepth":49,"depth":49,"links":13922},[],"content:publications:2024:guidewire-endpoint-detection-based-on-pixel-adjacent-relation-during-robot-assis.md","publications\u002F2024\u002Fguidewire-endpoint-detection-based-on-pixel-adjacent-relation-during-robot-assis.md","publications\u002F2024\u002Fguidewire-endpoint-detection-based-on-pixel-adjacent-relation-during-robot-assis",{"_path":13927,"_dir":12825,"_draft":7,"_partial":7,"_locale":8,"title":13928,"description":13929,"_hidden":7,"authors":13930,"authors_orcid":13931,"year":12829,"doi":13932,"openalex_id":13933,"venue":21,"abstract_screenshot":21,"keywords":13934,"body":13943,"_type":51,"_id":13951,"_source":53,"_file":13952,"_stem":13953,"_extension":56,"locale":57},"\u002Fpublications\u002F2024\u002Fhierarchical-perceptual-and-predictive-analogy-inference-network-for-abstract-vi","Hierarchical Perceptual and Predictive Analogy-Inference Network for Abstract Visual Reasoning","Advances in computer vision research enable human-like high-dimensional perceptual induction over analogical visual reasoning problems, such as Raven's Progressive Matrices (RPMs). In this paper, we propose a Hierarchical Perception and Predictive Analogy-Inference network (HP^2AI), consisting of three major components that tackle key challenges of RPM problems. Firstly, in view of the limited receptive fields of shallow networks in most existing RPM solvers, a perceptual encoder is proposed, consisting of a series of hierarchically coupled Patch Attention and Local Context (PALC) blocks, which could capture local attributes at early stages and capture the global panel layout at deep stages. Secondly, most methods seek for object-level similarities to map the context images directly to the answer image, while failing to extract the underlying analogies. The proposed reasoning module, Predictive Analogy-Inference (PredAI), consists of a set of Analogy-Inference Blocks (AIBs) to model and exploit the inherent analogical reasoning rules instead of object similarity. Lastly, the Squeeze-and-Excitation Channel-wise Attention (SECA) in the proposed PredAI discriminates essential attributes and analogies from irrelevant ones. Extensive experiments over four benchmark RPM datasets show that the proposed HP^2AI achieves significant performance gains over all the state-of-the-art methods consistently on all four datasets.",[7409,6111,12,9048],[7415,6113,15,9051],"https:\u002F\u002Fdoi.org\u002F10.1145\u002F3664647.3681246","W4403791457",[13935,4649,23,9784,37,13936,13937,8165,13938,13939,865,6928,13940,13941,13942,5949],"Analogy","Predictive inference","Cognitive science","Opportunistic reasoning","Model-based reasoning","Knowledge representation and reasoning","Frequentist inference","Bayesian inference",{"type":39,"children":13944,"toc":13949},[13945],{"type":42,"tag":43,"props":13946,"children":13947},{},[13948],{"type":47,"value":13929},{"title":8,"searchDepth":49,"depth":49,"links":13950},[],"content:publications:2024:hierarchical-perceptual-and-predictive-analogy-inference-network-for-abstract-vi.md","publications\u002F2024\u002Fhierarchical-perceptual-and-predictive-analogy-inference-network-for-abstract-vi.md","publications\u002F2024\u002Fhierarchical-perceptual-and-predictive-analogy-inference-network-for-abstract-vi",{"_path":13955,"_dir":12825,"_draft":7,"_partial":7,"_locale":8,"title":13956,"description":13957,"_hidden":7,"international crowdfunding projects authors":13958,"authors_orcid":13960,"year":12829,"doi":13963,"openalex_id":13964,"venue":13828,"abstract_screenshot":21,"keywords":13965,"body":13967,"_type":51,"_id":13975,"_source":53,"_file":13976,"_stem":13977,"_extension":56,"locale":57},"\u002Fpublications\u002F2024\u002Fhome-region-orientation-international-intensity-and-funding-performance-of-inter","Home region orientation, international intensity, and funding performance of","This paper investigates whether international reward crowdfunding campaigns effectively attract global backers by testing the global market penetration level and explores the impact of home region orientation and international intensity on crowdfunding performance. Utilising 24,100 Kickstarter reward crowdfunding campaigns in the technology sector across the triad from 2009 to 2019, we find that home-region-specific advantages are important determinants of fundraising success. Our evidence also indicates that home region orientation positively moderates the multi-nationality-crowdfunding performance relationship. Lastly, cross-sectional tests reveal heterogeneous impacts of home-region advantages across backers’ home-country levels of financial inclusion and investor protection. • We examine crowdfunding campaigns and the impact of home region orientation on performance. • Home-region-specific advantages are important determinants of fundraising success. • Home region orientation moderates the multinationality-crowdfunding performance relationship. • Heterogeneous effects of home-region advantages on home-country levels of financial inclusion and investor protection .",[13959,268,13277,1287],"Hu, Jianwei",[13961,21,13962,1291],"0000-0002-7793-3381","0000-0002-3964-4554","https:\u002F\u002Fdoi.org\u002F10.1016\u002Fj.technovation.2024.103164","W4405894323",[178,9957,13966,751,36,3746,3393],"R&D intensity",{"type":39,"children":13968,"toc":13973},[13969],{"type":42,"tag":43,"props":13970,"children":13971},{},[13972],{"type":47,"value":13957},{"title":8,"searchDepth":49,"depth":49,"links":13974},[],"content:publications:2024:home-region-orientation-international-intensity-and-funding-performance-of-inter.md","publications\u002F2024\u002Fhome-region-orientation-international-intensity-and-funding-performance-of-inter.md","publications\u002F2024\u002Fhome-region-orientation-international-intensity-and-funding-performance-of-inter",{"_path":13979,"_dir":12825,"_draft":7,"_partial":7,"_locale":8,"title":13980,"description":8,"_hidden":7,"Convolutional Network and Self-attention Mechanism authors":13981,"authors_orcid":13985,"year":12829,"doi":13988,"openalex_id":13989,"venue":9881,"abstract_screenshot":21,"keywords":13990,"body":13991,"_type":51,"_id":13995,"_source":53,"_file":13996,"_stem":13997,"_extension":56,"locale":57},"\u002Fpublications\u002F2024\u002Fhybrid-semantics-based-vulnerability-detection-incorporating-a-temporal-convolut","Hybrid semantics-based vulnerability detection incorporating a Temporal",[648,13982,13983,4112,595,13984],"Wang, Weijia","Liu, Bo","Wang, Shengran",[651,13986,13987,4116,599,21],"0000-0001-6982-2537","0009-0005-9072-3046","https:\u002F\u002Fdoi.org\u002F10.1016\u002Fj.infsof.2024.107453","W4393238017",[23,5545,6976,37,1107,1405,6875,1407,3876,215,5210,4876,632,181,110],{"type":39,"children":13992,"toc":13993},[],{"title":8,"searchDepth":49,"depth":49,"links":13994},[],"content:publications:2024:hybrid-semantics-based-vulnerability-detection-incorporating-a-temporal-convolut.md","publications\u002F2024\u002Fhybrid-semantics-based-vulnerability-detection-incorporating-a-temporal-convolut.md","publications\u002F2024\u002Fhybrid-semantics-based-vulnerability-detection-incorporating-a-temporal-convolut",{"_path":13999,"_dir":12825,"_draft":7,"_partial":7,"_locale":8,"title":14000,"description":14001,"_hidden":7,"machine learning approach\" authors":14002,"authors_orcid":14007,"year":12829,"doi":14011,"openalex_id":14012,"venue":14013,"abstract_screenshot":14014,"keywords":14015,"body":14021,"_type":51,"_id":14029,"_source":53,"_file":14030,"_stem":14031,"_extension":56,"locale":57},"\u002Fpublications\u002F2024\u002Fidentifying-crowdfunding-storytellers-who-deliver-successful-projects-a-machine","Identifying crowdfunding storytellers who deliver successful projects: ","Abstract Crowdfunding plays a key role in financial technology to provide individuals and enterprises with funding opportunities to establish start-ups and\u002For new business ventures. It is mainly used to link projects’ creators and backers, collect money and plan fundraising projects via social networks. This paper proposes a machine learning-enabled approach to analyse Kickstarter numerical and textual data and predict the successful funding and delivery of crowdfunding projects. It offers crowdfunding stakeholders benefits including creator credibility assessment, project risk reduction, and backer confidence enhancement. This research proposes a data preprocessing approach to prepare the dataset and extract the relevant features for the predictions. Besides, it trains and compares five numerical machine learning classification models and three text-mining methods to find the best-fitted numerical and textual analysis approaches. According to the results, the proposed SVM model outperforms the numerical benchmarks in terms of Accuracy, Precision, Recall, F1 score, and model Training latency. Moreover, BERT gives the best results if the dataset is complex, while Word2vec works better with simple features in textual analysis.",[14003,13959,14004,14005,14006,8214,268],"Ardakani, Saeid Pourroostaei","Zhang, Jing","Jin, Kaifeng","Cai, Tianhong",[14008,13961,14009,21,14010,21,272],"0000-0001-8062-6617","0000-0002-4408-9698","0000-0002-2601-4887","https:\u002F\u002Fdoi.org\u002F10.1007\u002Fs11227-024-06785-4","W4405182124","The Journal of Supercomputing","identifying-crowdfunding-storytellers-who-deliver-successful-projects-a-machine.png",[23,14016,12285,14017,6319,7111,14018,215,14019,37,14020,691,3688,6976,429],"Word2vec","Sentiment analysis","Data pre-processing","Feature engineering","Business plan",{"type":39,"children":14022,"toc":14027},[14023],{"type":42,"tag":43,"props":14024,"children":14025},{},[14026],{"type":47,"value":14001},{"title":8,"searchDepth":49,"depth":49,"links":14028},[],"content:publications:2024:identifying-crowdfunding-storytellers-who-deliver-successful-projects-a-machine.md","publications\u002F2024\u002Fidentifying-crowdfunding-storytellers-who-deliver-successful-projects-a-machine.md","publications\u002F2024\u002Fidentifying-crowdfunding-storytellers-who-deliver-successful-projects-a-machine",{"_path":14033,"_dir":12825,"_draft":7,"_partial":7,"_locale":8,"title":14034,"description":14035,"_hidden":7,"information modeling and blockchain technology authors":14036,"authors_orcid":14037,"year":12829,"doi":14038,"openalex_id":14039,"venue":14040,"abstract_screenshot":21,"keywords":14041,"body":14043,"_type":51,"_id":14051,"_source":53,"_file":14052,"_stem":14053,"_extension":56,"locale":57},"\u002Fpublications\u002F2024\u002Fimpact-factor-analysis-affecting-the-operation-of-asset-lifecycle-by-using-asset","Impact factor analysis affecting the operation of asset lifecycle by using asset","Purpose Currently, owners find it difficult to manage their assets throughout their project life cycle. The fact that asset information models (AIMs) are mandatory as deliverables for building information modeling-driven projects makes it a key requirement for the client to understand in detail those factors affecting asset operation. Hence, because the Kingdom of Saudi Arabia is the most significant market in the Middle East, this study aims to investigate those factors where blockchain and AIMs could impact the asset management (AM) life cycle. Design\u002Fmethodology\u002Fapproach Researchers used a hypothesis-based approach over a systematic literature review and a workshop (descriptive statistics) to understand the current challenges in AM. Later, a second workshop was run to understand the impact factor analysis affecting the operation of the asset life cycle by using asset information modeling and blockchain technology over a multiquantitative method. Findings Results found that factors affecting the operation of assets could be the improvement of trust and stakeholder’s influences; the availability of handover process products’ accurate data; manufacturers providing detailed product models; increasing the speed of preparing holistic and integrated AM systems; improving collaboration between stakeholders; and returning clients’ investments faster. Originality\u002Fvalue Understanding the factors affecting AM life cycle based on the utilization of AIMs and blockchain then allows investors and their team members to work in a secure and collaborative environment that helps them to pre-identify certain risks and improve decision-making in a more effective way, as is required by ISO55000.",[6040,6042,595,6043,6041],[21,6046,599,6047,6045],"https:\u002F\u002Fdoi.org\u002F10.1108\u002Fci-10-2022-0272","W4391439434","Construction Innovation",[5381,244,14042,23,178,170,180],"Factor (programming language)",{"type":39,"children":14044,"toc":14049},[14045],{"type":42,"tag":43,"props":14046,"children":14047},{},[14048],{"type":47,"value":14035},{"title":8,"searchDepth":49,"depth":49,"links":14050},[],"content:publications:2024:impact-factor-analysis-affecting-the-operation-of-asset-lifecycle-by-using-asset.md","publications\u002F2024\u002Fimpact-factor-analysis-affecting-the-operation-of-asset-lifecycle-by-using-asset.md","publications\u002F2024\u002Fimpact-factor-analysis-affecting-the-operation-of-asset-lifecycle-by-using-asset",{"_path":14055,"_dir":12825,"_draft":7,"_partial":7,"_locale":8,"title":14056,"description":14057,"_hidden":7,"authors":14058,"authors_orcid":14059,"year":12829,"doi":14060,"openalex_id":14061,"venue":14062,"abstract_screenshot":21,"keywords":14063,"body":14064,"_type":51,"_id":14072,"_source":53,"_file":14073,"_stem":14074,"_extension":56,"locale":57},"\u002Fpublications\u002F2024\u002Fimplementing-universal-design-through-augmented-reality-game-based-learning","Implementing Universal Design through augmented-reality game-based learning","Technology integration in higher education (HE) provides educators with the opportunity to design stimulating learning environments, especially in design and engineering education (DEE) where it plays a unique role in nurturing creativity, problem-solving and innovation. This study investigates the integration of an augmented reality (AR) educational game in DEE, focusing on the teaching of Design for Manufacturing and Assembly (DfMA) principles. The primary aim of this research is to enhance traditional DfMA teaching and learning (T&L) practices by applying innovative T&L strategies. The resulting AR DfMA game, developed using digital game-based learning, microlearning and collaborative learning techniques, aligns with the Universal Design for Learning framework to create an inclusive learning environment that encourages participation from all students and supports several learning styles. The study tests the individual features designed for personal study opportunities to discover which elements are optimal in that environment, and then on the proposed in-class group components of the AR game, involving 68 participants from the appropriate program, though it is not currently implemented as part of a module. We utilize a mixed methods approach to examine the students’ experience and identify key design features that contribute to an inclusive educational experience. The findings highlight positive student experiences, and preferences for hands-on engagement, multimodal content, and collaborative activities. The AR DfMA game also has the potential to enhance intrinsic motivation and create an active and inclusive learning environment. Challenges and areas for improvement are also discussed.",[7077,7078,595,7079,13659,11421,11423,11425],[7081,7082,599,7083,21,11428,21,21],"https:\u002F\u002Fdoi.org\u002F10.1016\u002Fj.cexr.2024.100070","W4398187611","Computers & Education X Reality",[4387,23,868,11632],{"type":39,"children":14065,"toc":14070},[14066],{"type":42,"tag":43,"props":14067,"children":14068},{},[14069],{"type":47,"value":14057},{"title":8,"searchDepth":49,"depth":49,"links":14071},[],"content:publications:2024:implementing-universal-design-through-augmented-reality-game-based-learning.md","publications\u002F2024\u002Fimplementing-universal-design-through-augmented-reality-game-based-learning.md","publications\u002F2024\u002Fimplementing-universal-design-through-augmented-reality-game-based-learning",{"_path":14076,"_dir":12825,"_draft":7,"_partial":7,"_locale":8,"title":14077,"description":14078,"_hidden":7,"complex-network-community-based relevance metric authors":14079,"authors_orcid":14083,"year":12829,"doi":14086,"openalex_id":14087,"venue":14088,"abstract_screenshot":21,"keywords":14089,"body":14091,"_type":51,"_id":14099,"_source":53,"_file":14100,"_stem":14101,"_extension":56,"locale":57},"\u002Fpublications\u002F2024\u002Fimproving-the-validation-of-multiple-object-detection-using-a-complex-network-co","Improving the validation of multiple-object detection using a","Although many of today’s object detectors (ODs) are fairly powerful and advanced, most of them still suffer from high detection failure rates. To address this issue, we have developed an innovative, multiple-object detection validation method using a complex-network-community-based relevance metric. This metric aims to measure the relevance of multiple objects in the same OD output, based on our observation that a faulty OD output generally includes objects that are irrelevant or unrelated to each other. To verify the effectiveness of our method, we formulated four research questions, and performed an experiment with statistical analyses to address these questions. Our experiment provides strong support that our method (particularly the relevance metric) is highly effective at helping human testers in identifying faulty OD outputs. • Many of today’s object detectors (ODs) suffer from high detection failure rates. • Many ODs ignore the relevance among multiple object instances in the same OD output. • We develop a relevance metric for each object pair in an OD output and use it for validation. • Our method is effective at helping testers in identifying potentially faulty OD outputs.",[14080,4231,14081,595,14082],"Qiu, Kun","Zhao, Shijun","Yu, Lanlin",[14084,4234,21,599,14085],"0000-0002-4121-3665","0000-0002-0664-2464","https:\u002F\u002Fdoi.org\u002F10.1016\u002Fj.knosys.2024.112027","W4399207312","Knowledge-Based Systems",[14090,1008,23,3980,7445,181,37,215,179],"Relevance (law)",{"type":39,"children":14092,"toc":14097},[14093],{"type":42,"tag":43,"props":14094,"children":14095},{},[14096],{"type":47,"value":14078},{"title":8,"searchDepth":49,"depth":49,"links":14098},[],"content:publications:2024:improving-the-validation-of-multiple-object-detection-using-a-complex-network-co.md","publications\u002F2024\u002Fimproving-the-validation-of-multiple-object-detection-using-a-complex-network-co.md","publications\u002F2024\u002Fimproving-the-validation-of-multiple-object-detection-using-a-complex-network-co",{"_path":14103,"_dir":12825,"_draft":7,"_partial":7,"_locale":8,"title":14104,"description":14105,"_hidden":7,"authors":14106,"authors_orcid":14108,"year":12829,"doi":14110,"openalex_id":14111,"venue":4539,"abstract_screenshot":21,"keywords":14112,"body":14115,"_type":51,"_id":14200,"_source":53,"_file":14201,"_stem":14202,"_extension":56,"locale":57},"\u002Fpublications\u002F2024\u002Fincorporating-online-learning-into-mcts-based-intention-progression","Incorporating Online Learning Into MCTS-Based Intention Progression","Agents have been applied to a wide variety of fields, including power systems and spacecraft. Belief-Desire-Intention (BDI) agents, as one of the most widely used and researched architectures, have the advantage of being able to pursue multiple goals in parallel. The problem of deciding “what to do” next at each of the agent's deliberation cycle is therefore critical for BDI agents, which is defined as the intention progression problem (IPP). Among all existing approaches to IPP, the majority of approaches have overlooked the significance of runtime historical data, thereby limiting the adaptability and decision-making capabilities of agents to some extent. In this paper, we propose to incorporate online learning into the current state-of-the- art intention progression approach SA to overcome the limitation that SA cannot utilize historical data to guide the decision-making of agents. This approach not only prevents SA from consuming computational resources on ineffective and inefficient simulations, but also significantly improves the execution efficiency of the agent. Especially when dealing with large-scale problem domains, this improvement significantly enhances the planning capability of the agents. In particular, we have proposed the SAQ and SAL schedulers, both of which can learn how to generate “reasonable” rollouts during the simulation phase of MCTS based on historical simulation data at run time.We compare the performance of our approach with the state-of-the-art SA in a range of scenarios of increasing difficulty. The results demonstrate that our approaches outperform SA , both in terms of the number of goals achieved and the computational overhead required.",[14107,9416,11896],"Song, Chengcheng",[14109,9422,11901],"0009-0009-7444-7597","https:\u002F\u002Fdoi.org\u002F10.1109\u002Faccess.2024.3390796","W4394938979",[23,5443,6631,14113,14114,37,215],"Deliberation","Limiting",{"type":39,"children":14116,"toc":14198},[14117],{"type":42,"tag":43,"props":14118,"children":14119},{},[14120,14122],{"type":47,"value":14121},"Agents have been applied to a wide variety of fields, including power systems and spacecraft. Belief-Desire-Intention (BDI) agents, as one of the most widely used and researched architectures, have the advantage of being able to pursue multiple goals in parallel. The problem of deciding “what to do” next at each of the agent's deliberation cycle is therefore critical for BDI agents, which is defined as the intention progression problem (IPP). Among all existing approaches to IPP, the majority of approaches have overlooked the significance of runtime historical data, thereby limiting the adaptability and decision-making capabilities of agents to some extent. In this paper, we propose to incorporate online learning into the current state-of-the- art intention progression approach ",{"type":42,"tag":9671,"props":14123,"children":14124},{"xmlns:mml":1465,"xmlnsXLink":8791},[14125,14127,14133,14135],{"type":47,"value":14126},"S",{"type":42,"tag":14128,"props":14129,"children":14130},"sub",{},[14131],{"type":47,"value":14132},"A",{"type":47,"value":14134}," to overcome the limitation that ",{"type":42,"tag":9671,"props":14136,"children":14137},{"xmlns:mml":1465,"xmlnsXLink":8791},[14138,14139,14143,14145],{"type":47,"value":14126},{"type":42,"tag":14128,"props":14140,"children":14141},{},[14142],{"type":47,"value":14132},{"type":47,"value":14144}," cannot utilize historical data to guide the decision-making of agents. This approach not only prevents ",{"type":42,"tag":9671,"props":14146,"children":14147},{"xmlns:mml":1465,"xmlnsXLink":8791},[14148,14149,14153,14155],{"type":47,"value":14126},{"type":42,"tag":14128,"props":14150,"children":14151},{},[14152],{"type":47,"value":14132},{"type":47,"value":14154}," from consuming computational resources on ineffective and inefficient simulations, but also significantly improves the execution efficiency of the agent. Especially when dealing with large-scale problem domains, this improvement significantly enhances the planning capability of the agents. In particular, we have proposed the ",{"type":42,"tag":9671,"props":14156,"children":14157},{"xmlns:mml":1465,"xmlnsXLink":8791},[14158,14160,14165,14167],{"type":47,"value":14159},"SA",{"type":42,"tag":14128,"props":14161,"children":14162},{},[14163],{"type":47,"value":14164},"Q",{"type":47,"value":14166}," and ",{"type":42,"tag":9671,"props":14168,"children":14169},{"xmlns:mml":1465,"xmlnsXLink":8791},[14170,14171,14176,14178],{"type":47,"value":14159},{"type":42,"tag":14128,"props":14172,"children":14173},{},[14174],{"type":47,"value":14175},"L",{"type":47,"value":14177}," schedulers, both of which can learn how to generate “reasonable” rollouts during the simulation phase of MCTS based on historical simulation data at run time.We compare the performance of our approach with the state-of-the-art ",{"type":42,"tag":9671,"props":14179,"children":14180},{"xmlns:mml":1465,"xmlnsXLink":8791},[14181,14182,14186,14188],{"type":47,"value":14126},{"type":42,"tag":14128,"props":14183,"children":14184},{},[14185],{"type":47,"value":14132},{"type":47,"value":14187}," in a range of scenarios of increasing difficulty. The results demonstrate that our approaches outperform ",{"type":42,"tag":9671,"props":14189,"children":14190},{"xmlns:mml":1465,"xmlnsXLink":8791},[14191,14192,14196],{"type":47,"value":14126},{"type":42,"tag":14128,"props":14193,"children":14194},{},[14195],{"type":47,"value":14132},{"type":47,"value":14197}," , both in terms of the number of goals achieved and the computational overhead required.",{"title":8,"searchDepth":49,"depth":49,"links":14199},[],"content:publications:2024:incorporating-online-learning-into-mcts-based-intention-progression.md","publications\u002F2024\u002Fincorporating-online-learning-into-mcts-based-intention-progression.md","publications\u002F2024\u002Fincorporating-online-learning-into-mcts-based-intention-progression",{"_path":14204,"_dir":12825,"_draft":7,"_partial":7,"_locale":8,"title":14205,"description":14206,"_hidden":7,"strategies authors":14207,"authors_orcid":14212,"year":12829,"doi":14216,"openalex_id":14217,"venue":14218,"abstract_screenshot":21,"keywords":14219,"body":14221,"_type":51,"_id":14229,"_source":53,"_file":14230,"_stem":14231,"_extension":56,"locale":57},"\u002Fpublications\u002F2024\u002Finvestigation-of-traffic-radar-coverage-efficiency-under-different-placement-str","Investigation of traffic radar coverage efficiency under different placement","This paper presents a comprehensive investigation of traffic radar coverage efficiency under different placement strategies in collaboration with Zhejiang Communications Investment Group Company Limited (CICO). The overall goal is to maximise coverage while minimising blind spots and the number of radars, given the constraints of the road. The NSGA-II multi-objective optimisation algorithm is found to be capable of generating a set of optimal solutions for the proposed radar placement configurations. When aiming for 100% coverage, the results indicate that a multi-antenna radar configuration requires the lowest radar density. Overall, this study provides valuable insights to transportation infrastructure owners in determining the best radar placement strategies for road traffic monitoring.",[14208,14209,12122,4824,5667,14210,14211],"Yao, Shun","Zhou, Jin","Li, J.","Chen, Yusen",[14213,14214,12125,21,5670,14215,21],"0000-0001-9463-9312","0009-0004-3742-2431","0009-0004-0637-342X","https:\u002F\u002Fdoi.org\u002F10.1049\u002Ficp.2024.3951","W4405241693","IET conference proceedings.",[14220,23,454,926,179,288],"Radar",{"type":39,"children":14222,"toc":14227},[14223],{"type":42,"tag":43,"props":14224,"children":14225},{},[14226],{"type":47,"value":14206},{"title":8,"searchDepth":49,"depth":49,"links":14228},[],"content:publications:2024:investigation-of-traffic-radar-coverage-efficiency-under-different-placement-str.md","publications\u002F2024\u002Finvestigation-of-traffic-radar-coverage-efficiency-under-different-placement-str.md","publications\u002F2024\u002Finvestigation-of-traffic-radar-coverage-efficiency-under-different-placement-str",{"_path":14233,"_dir":12825,"_draft":7,"_partial":7,"_locale":8,"title":14234,"description":14235,"_hidden":7,"recognition\" authors":14236,"authors_orcid":14238,"year":12829,"doi":14239,"openalex_id":14240,"venue":14241,"abstract_screenshot":21,"keywords":14242,"body":14244,"_type":51,"_id":14252,"_source":53,"_file":14253,"_stem":14254,"_extension":56,"locale":57},"\u002Fpublications\u002F2024\u002Fiot-far-a-multi-sensor-fusion-approach-for-iot-based-firefighting-activity-recog","IoT-FAR: A multi-sensor fusion approach for IoT-based firefighting activit","Inadequate training poses a significant risk of injury among young firefighters. Although Human Activity Recognition (HAR) algorithms have shown potential in monitoring and evaluating performance, most existing studies focus on daily activities and have difficulty distinguishing complex firefighting tasks. This study introduces the Internet of things (IoT)-based wearable firefighting activity recognition (IoT-FAR) system which employs a multi-modal sensor fusion approach to achieve comprehensive activity recognition during firefighting training. The IoT-FAR comprises five wearable body sensor nodes and a coordinator node. This study explores the significance of features extracted from the surface electromyography, heart rate, and inertial measurement units in firefighting training activity recognition. A hybrid machine learning (HML)-based network is proposed, which integrates three models: one trained with all features (MA), another with upper body features (MU), and a third with lower body features (ML). The proposed HML-SVM-RBF1-RF2 network achieves superior performance, with a mean recall of 93.94%, mean precision of 90.94%, and a mean accuracy rate of 98.29%. Additionally, the study introduces the specialized firefighting training associated activities (SFTAA) dataset, which includes endurance training activities involving self-contained breathing apparatus (SCBA) conducted by eighteen firefighters. This dataset represents preliminary work towards building a comprehensive dataset covering various events and scenarios for tracking firefighter activities. The IoT-FAR system also demonstrates the potential use of misclassified activities as evaluation metrics for assessing firefighter training performance. • A novel multimodal sensor data fusion for firefighting activity recognition. • Hybrid fusion models with inertial and sEMG data from multiple positions. • Wearable sensors integrated into lightweight and custom-designed devices. • Tested on a unique self-gathered endurance training dataset from real firefighters.",[8463,5667,14237,5407,12122,7746,5665],"Hu, Chenhang",[8466,5670,21,5411,12125,21,5669],"https:\u002F\u002Fdoi.org\u002F10.1016\u002Fj.inffus.2024.102650","W4401857182","Information Fusion",[8471,23,6299,14243,6977,5894,9189,180,37,251,4051,289],"Activity recognition",{"type":39,"children":14245,"toc":14250},[14246],{"type":42,"tag":43,"props":14247,"children":14248},{},[14249],{"type":47,"value":14235},{"title":8,"searchDepth":49,"depth":49,"links":14251},[],"content:publications:2024:iot-far-a-multi-sensor-fusion-approach-for-iot-based-firefighting-activity-recog.md","publications\u002F2024\u002Fiot-far-a-multi-sensor-fusion-approach-for-iot-based-firefighting-activity-recog.md","publications\u002F2024\u002Fiot-far-a-multi-sensor-fusion-approach-for-iot-based-firefighting-activity-recog",{"_path":14256,"_dir":12825,"_draft":7,"_partial":7,"_locale":8,"title":14257,"description":8,"_hidden":7,"authors":14258,"authors_orcid":14262,"year":12829,"doi":14265,"openalex_id":14266,"venue":14267,"abstract_screenshot":21,"keywords":14268,"body":14269,"_type":51,"_id":14273,"_source":53,"_file":14274,"_stem":14275,"_extension":56,"locale":57},"\u002Fpublications\u002F2024\u002Fliner-disruption-recovery-problem-with-emission-control-area-policies","Liner disruption recovery problem with emission control area policies",[14259,14260,7302,14261],"Hu, Yuzhen","Liu, Jianxia","Wang, Sirui",[14263,14264,7310,21],"0000-0002-3928-2020","0000-0002-9307-7693","https:\u002F\u002Fdoi.org\u002F10.1016\u002Fj.trd.2024.104227","W4397030341","Transportation Research Part D Transport and Environment",[29,178,926,23,37],{"type":39,"children":14270,"toc":14271},[],{"title":8,"searchDepth":49,"depth":49,"links":14272},[],"content:publications:2024:liner-disruption-recovery-problem-with-emission-control-area-policies.md","publications\u002F2024\u002Fliner-disruption-recovery-problem-with-emission-control-area-policies.md","publications\u002F2024\u002Fliner-disruption-recovery-problem-with-emission-control-area-policies",{"_path":14277,"_dir":12825,"_draft":7,"_partial":7,"_locale":8,"title":14278,"description":14279,"_hidden":7,"experience, and open issues\" authors":14280,"authors_orcid":14288,"year":12829,"doi":14291,"openalex_id":14292,"venue":14293,"abstract_screenshot":21,"keywords":14294,"body":14297,"_type":51,"_id":14305,"_source":53,"_file":14306,"_stem":14307,"_extension":56,"locale":57},"\u002Fpublications\u002F2024\u002Flog-based-anomaly-detection-for-distributed-systems-state-of-the-art-industry-ex","Log‐based anomaly detection for distributed systems: State of the art, industr","Abstract Distributed systems have been widely used in many safety‐critical areas. Any abnormalities (e.g., service interruption or service quality degradation) could lead to application crashes or decrease user satisfaction. These things may cause serious economic losses. Among the various quality assurance approaches for distributed systems, log‐based anomaly detection (LAD) has become a popular research topic. Its popularity relates to system logs being able to record and reveal important run‐time information. This paper presents a general LAD framework for distributed systems. Log grouping and feature‐pattern mining are two crucial LAD components that impact on the anomaly‐detection effectiveness. We also present a systematic survey of techniques in these two directions; propose classification frameworks for log grouping and feature patterns; and summarize four log‐grouping techniques and five feature patterns (which refer to invariant relationships among logs that can be used for anomaly detection). To evaluate their applicability, we report on the findings when applying existing techniques to Ray, a popular industrial distributed system. Based on these findings, several open issues are identified, which provide potential guidance for future research and development.",[14281,14282,1205,595,14283,14284,14285,14286,14287],"Wei, Xinjie","Wang, Jie","Shoufeng, Zhang","Zuo, Wanqing","Yu, Yiming","Ruan, Ruoyi","Song, Guyang",[21,14289,1210,599,21,21,14290,21,21],"0009-0005-9100-4449","0009-0002-6682-7193","https:\u002F\u002Fdoi.org\u002F10.1002\u002Fsmr.2650","W4391649511","Journal of Software Evolution and Process",[860,14295,23,6875,181,14296,5768,240,691],"Anomaly detection","Anomaly (physics)",{"type":39,"children":14298,"toc":14303},[14299],{"type":42,"tag":43,"props":14300,"children":14301},{},[14302],{"type":47,"value":14279},{"title":8,"searchDepth":49,"depth":49,"links":14304},[],"content:publications:2024:log-based-anomaly-detection-for-distributed-systems-state-of-the-art-industry-ex.md","publications\u002F2024\u002Flog-based-anomaly-detection-for-distributed-systems-state-of-the-art-industry-ex.md","publications\u002F2024\u002Flog-based-anomaly-detection-for-distributed-systems-state-of-the-art-industry-ex",{"_path":14309,"_dir":12825,"_draft":7,"_partial":7,"_locale":8,"title":14310,"description":14311,"_hidden":7,"authors":14312,"authors_orcid":14316,"year":12829,"doi":14320,"openalex_id":14321,"venue":14322,"abstract_screenshot":21,"keywords":14323,"body":14324,"_type":51,"_id":14332,"_source":53,"_file":14333,"_stem":14334,"_extension":56,"locale":57},"\u002Fpublications\u002F2024\u002Flow-contrast-medical-image-segmentation-via-transformer-and-boundary-perception","Low-Contrast Medical Image Segmentation via Transformer and Boundary Perception","Low-contrast medical image segmentation is a challenging task that requires full use of local details and global context. However, existing convolutional neural networks (CNNs) cannot fully exploit global information due to limited receptive fields and local weight sharing. On the other hand, the transformer effectively establishes long-range dependencies but lacks desirable properties for modeling local details. This paper proposes a Transformer-embedded Boundary perception Network (TBNet) that combines the advantages of transformer and convolution for low-contrast medical image segmentation. Firstly, the transformer-embedded module uses convolution at the low-level layer to model local details and uses the Enhanced TRansformer (ETR) to capture long-range dependencies at the high-level layer. This module can extract robust features with semantic contexts to infer the possible target location and basic structure in low-contrast conditions. Secondly, we utilize the decoupled body-edge branch to promote general feature learning and precept precise boundary locations. The ETR establishes long-range dependencies across the whole feature map range and is enhanced by introducing local information. We implement it in a parallel mode, i.e., the group of self-attention with multi-head captures the global relationship, and the group of convolution retains local details. We compare TBNet with other state-of-the-art (SOTA) methods on the cornea endothelial cell, ciliary body, and kidney segmentation tasks. The TBNet improves segmentation performance, proving its effectiveness and robustness.",[11482,11483,12720,14313,14314,14315,595,12,11484,11485,8406],"Li, Heng","Hu, Lingxi","Lin, Huiyan",[11487,11488,12724,14317,14318,14319,599,15,11489,11490,8409],"0000-0001-7754-7141","0009-0009-3483-8841","0009-0008-7212-4500","https:\u002F\u002Fdoi.org\u002F10.1109\u002Ftetci.2024.3353624","W4394951203","IEEE Transactions on Emerging Topics in Computational Intelligence",[4391,37,12729,9090,11495,9784,23,865,10806],{"type":39,"children":14325,"toc":14330},[14326],{"type":42,"tag":43,"props":14327,"children":14328},{},[14329],{"type":47,"value":14311},{"title":8,"searchDepth":49,"depth":49,"links":14331},[],"content:publications:2024:low-contrast-medical-image-segmentation-via-transformer-and-boundary-perception.md","publications\u002F2024\u002Flow-contrast-medical-image-segmentation-via-transformer-and-boundary-perception.md","publications\u002F2024\u002Flow-contrast-medical-image-segmentation-via-transformer-and-boundary-perception",{"_path":14336,"_dir":12825,"_draft":7,"_partial":7,"_locale":8,"title":14337,"description":14338,"_hidden":7,"Segmentation\" authors":14339,"authors_orcid":14341,"year":12829,"doi":14343,"openalex_id":14344,"venue":21,"abstract_screenshot":21,"keywords":14345,"body":14346,"_type":51,"_id":14354,"_source":53,"_file":14355,"_stem":14356,"_extension":56,"locale":57},"\u002Fpublications\u002F2024\u002Fmambavesselnet-a-hybrid-cnn-mamba-architecture-for-3d-cerebrovascular-segmentati","MambaVesselNet: A Hybrid CNN-Mamba Architecture for 3D Cerebrovascula","Segmenting vessels in magnetic resonance imaging (MRI) stands as a mainstream approach for evaluating cerebrovascular conditions.Due to the complex semantics and topology of cerebrovascular structures, existing CNN-based segmentation methods often fail to correlate the topological structure and branch vessels, resulting in incomplete segmentation.To address the challenge of global dependencies modelling, transformer architectures have been employed due to their capability of capturing long-range dependencies, and they have shown promise in 3D medical image segmentation.However, the transformer architecture greatly increases the computational burden when processing high-dimensional 3D MRI images.In light of this, a selective state space model (SSM) Mamba has gained recognition for its adeptness in handling long-range dependencies in sequential data, particularly noted for its efficiency and speed in natural language processing applications.Mamba is now widely applied in various computer vision tasks.Based on these findings, in this study, we propose MambaVesselNet, a Hybrid CNN-Mamba network for 3D cerebrovascular segmentation.MambaVesselNet leverages CNNs to capture local features and incorporates the Mamba block at the bottleneck to model long-range dependencies within the whole-volume features.The effectiveness of MambaVesselNet is validated on a public cerebrovascular dataset, and our benchmark demonstrates new state-of-the-art performance.",[13446,14340,8931],"Liu, Ziyu",[21,14342,8937],"0000-0002-3542-6832","https:\u002F\u002Fdoi.org\u002F10.1145\u002F3696409.3700231","W4405869298",[23,6300,9090,37,289,3547],{"type":39,"children":14347,"toc":14352},[14348],{"type":42,"tag":43,"props":14349,"children":14350},{},[14351],{"type":47,"value":14338},{"title":8,"searchDepth":49,"depth":49,"links":14353},[],"content:publications:2024:mambavesselnet-a-hybrid-cnn-mamba-architecture-for-3d-cerebrovascular-segmentati.md","publications\u002F2024\u002Fmambavesselnet-a-hybrid-cnn-mamba-architecture-for-3d-cerebrovascular-segmentati.md","publications\u002F2024\u002Fmambavesselnet-a-hybrid-cnn-mamba-architecture-for-3d-cerebrovascular-segmentati",{"_path":14358,"_dir":12825,"_draft":7,"_partial":7,"_locale":8,"title":14359,"description":14360,"_hidden":7,"authors":14361,"authors_orcid":14364,"year":12829,"doi":14367,"openalex_id":14368,"venue":21,"abstract_screenshot":21,"keywords":14369,"body":14371,"_type":51,"_id":14379,"_source":53,"_file":14380,"_stem":14381,"_extension":56,"locale":57},"\u002Fpublications\u002F2024\u002Fmany-objectives-autonomous-robot-path-planning-with-improved-moea-d","Many Objectives Autonomous Robot Path Planning with Improved MOEA\u002FD","Path planning is the core of autonomous robot navigation, which helps the robot to find a collision-free path to the destination based on the environment information. Most current path planning methods only consider the path length, but the optimal path may deviate from the shortest when considering other environmental factors such as uneven terrain or regions with varying traversal costs. Similarly, in scenarios prioritizing energy efficiency, a sole focus on path length may lead to suboptimal solutions. In this paper, an improved Multi-Objective Evolutionary Algorithm based on Decomposition (MOEA\u002FD) with adaptive weight vector, external archive, and constrained update strategy namely the MOEA\u002FD-EAWA is proposed. This algorithm not only considers the path length but also four additional objectives such as smoothness, traveling time, terrain (elevation), and speed limit (expected delay). In addition, MOEA\u002FD-EAWA is better suited for such many-objective path planning problem which has an irregular, discrete, and sparse Pareto front. The simulation results from 90 map instances demonstrate that the proposed method outperforms the existing approaches.",[14209,12122,5667,14362,14363],"Ji, Junkai","Li, Jianqiang",[21,12125,5670,14365,14366],"0000-0002-1985-938X","0000-0003-1995-9249","https:\u002F\u002Fdoi.org\u002F10.1109\u002Fcec60901.2024.10612154","W4401415964",[14370,23,7599,9514,7755,37,251],"Motion planning",{"type":39,"children":14372,"toc":14377},[14373],{"type":42,"tag":43,"props":14374,"children":14375},{},[14376],{"type":47,"value":14360},{"title":8,"searchDepth":49,"depth":49,"links":14378},[],"content:publications:2024:many-objectives-autonomous-robot-path-planning-with-improved-moea-d.md","publications\u002F2024\u002Fmany-objectives-autonomous-robot-path-planning-with-improved-moea-d.md","publications\u002F2024\u002Fmany-objectives-autonomous-robot-path-planning-with-improved-moea-d",{"_path":14383,"_dir":12825,"_draft":7,"_partial":7,"_locale":8,"title":14384,"description":8,"_hidden":7,"authors":14385,"authors_orcid":14386,"year":12829,"doi":14387,"openalex_id":14388,"venue":374,"abstract_screenshot":21,"keywords":14389,"body":14391,"_type":51,"_id":14395,"_source":53,"_file":14396,"_stem":14397,"_extension":56,"locale":57},"\u002Fpublications\u002F2024\u002Fmedical-chief-complaint-classification-with-hierarchical-structure-of-label-desc","Medical chief complaint classification with hierarchical structure of label descriptions",[9182,5816,6482,12],[9185,5821,21,15],"https:\u002F\u002Fdoi.org\u002F10.1016\u002Fj.eswa.2024.123938","W4394566798",[14390,23,37,4479,6950,4876],"Complaint",{"type":39,"children":14392,"toc":14393},[],{"title":8,"searchDepth":49,"depth":49,"links":14394},[],"content:publications:2024:medical-chief-complaint-classification-with-hierarchical-structure-of-label-desc.md","publications\u002F2024\u002Fmedical-chief-complaint-classification-with-hierarchical-structure-of-label-desc.md","publications\u002F2024\u002Fmedical-chief-complaint-classification-with-hierarchical-structure-of-label-desc",{"_path":14399,"_dir":12825,"_draft":7,"_partial":7,"_locale":8,"title":14400,"description":14401,"_hidden":7,"authors":14402,"authors_orcid":14403,"year":12829,"doi":14405,"openalex_id":14406,"venue":14407,"abstract_screenshot":21,"keywords":14408,"body":14409,"_type":51,"_id":14417,"_source":53,"_file":14418,"_stem":14419,"_extension":56,"locale":57},"\u002Fpublications\u002F2024\u002Fmetamorphic-relation-generation-state-of-the-art-and-research-directions","Metamorphic Relation Generation: State of the Art and Research Directions","Metamorphic testing has become one mainstream technique to address the notorious oracle problem in software testing, thanks to its great successes in revealing real-life bugs in a wide variety of software systems. Metamorphic relations, the core component of metamorphic testing, have continuously attracted research interests from both academia and industry. In the last decade, a rapidly increasing number of studies have been conducted to systematically generate metamorphic relations from various sources and for different application domains. In this article, based on the systematic review on the state of the art for metamorphic relations’ generation, we summarize and highlight visions for further advancing the theory and techniques for identifying and constructing metamorphic relations and discuss promising research directions in related areas.",[6184,593,4231,595,1205,3164,1156,596],[14404,598,4234,599,1210,3168,1158,600],"0000-0002-7669-4112","https:\u002F\u002Fdoi.org\u002F10.1145\u002F3708521","W4405543795","ACM Transactions on Software Engineering and Methodology",[23,4965,3788,12545,3789,110,3790,181],{"type":39,"children":14410,"toc":14415},[14411],{"type":42,"tag":43,"props":14412,"children":14413},{},[14414],{"type":47,"value":14401},{"title":8,"searchDepth":49,"depth":49,"links":14416},[],"content:publications:2024:metamorphic-relation-generation-state-of-the-art-and-research-directions.md","publications\u002F2024\u002Fmetamorphic-relation-generation-state-of-the-art-and-research-directions.md","publications\u002F2024\u002Fmetamorphic-relation-generation-state-of-the-art-and-research-directions",{"_path":14421,"_dir":12825,"_draft":7,"_partial":7,"_locale":8,"title":14422,"description":8,"_hidden":7,"authors":14423,"authors_orcid":14426,"year":12829,"doi":14429,"openalex_id":14430,"venue":74,"abstract_screenshot":21,"keywords":14431,"body":14433,"_type":51,"_id":14437,"_source":53,"_file":14438,"_stem":14439,"_extension":56,"locale":57},"\u002Fpublications\u002F2024\u002Fmetamorphic-testing-and-exploration-for-machine-learning-credit-score-models","Metamorphic Testing and Exploration for Machine Learning Credit Score Models",[8040,4189,14424,14425],"Breeden, Joseph L.","Towey, David",[8044,4191,14427,14428],"0000-0001-6239-7080","0000-0002-6209-3826","https:\u002F\u002Fdoi.org\u002F10.2139\u002Fssrn.4698434","W4390935851",[215,23,14432,37,1008,10344,429,178,865],"Intuition",{"type":39,"children":14434,"toc":14435},[],{"title":8,"searchDepth":49,"depth":49,"links":14436},[],"content:publications:2024:metamorphic-testing-and-exploration-for-machine-learning-credit-score-models.md","publications\u002F2024\u002Fmetamorphic-testing-and-exploration-for-machine-learning-credit-score-models.md","publications\u002F2024\u002Fmetamorphic-testing-and-exploration-for-machine-learning-credit-score-models",{"_path":14441,"_dir":12825,"_draft":7,"_partial":7,"_locale":8,"title":14442,"description":14443,"_hidden":7,"Students-as-Partners Collaboration Experience\" authors":14444,"authors_orcid":14450,"year":12829,"doi":14453,"openalex_id":14454,"venue":21,"abstract_screenshot":21,"keywords":14455,"body":14457,"_type":51,"_id":14465,"_source":53,"_file":14466,"_stem":14467,"_extension":56,"locale":57},"\u002Fpublications\u002F2024\u002Fmetamorphic-testing-of-a-steer-by-wire-system-an-intercultural-students-as-partn","Metamorphic Testing of a Steer-by-Wire System: An Intercultura","This paper explores the educational and practical impacts of integrating metamorphic testing (MT) into a software engineering project conducted by an intercultural group of students. The students designed a Steer-by-Wire (SBW) system to control the steering of a model vehicle and tested using a hybrid approach that combined unit testing and MT. Four metamorphic relations (MRs) were generated and two significant violations were encountered during the testing phase. The first violation, related to steering angle consistency reported by the system, as a case of metamorphic exploration (ME), revealed a common coding mistake where the system failed to maintain consistent steering angles for equivalent inputs in opposite directions, illustrating how ME can enhance comprehension of the system and the testing process itself. It not only deepened the testers' understanding of the integration between software and mechanical systems but also represented valuable insights for others engaged in similar tasks. The second MR violation revealed issues with interruptions and delays when the system switched between manual and automated control modes, demonstrating MT's effectiveness in identifying defects and highlighting MT's importance in real-world software development scenarios. Additionally, the project examined the effectiveness of aligning MT roles to team members based on their Myers-Briggs Type Indicator (MBTI) personalities, suggesting that such alignments can enhance team dynamics and overall project efficiency. This study provides insights into the benefits of using MT in educational settings, the implications of personality-based task assignments, and the enhancement of software reliability and team performance in an intercultural context. The findings of this research reinforce the value of MT in software engineering education and support for the integration of psychological analysis in managing complex projects.",[8041,595,5407,14445,14446,14447,14448,14449],"Qiu, Rui","Jaya, Axel Tan","Huey, Sze","Zhang, Xinyi","Wu, Yuan",[8045,599,5411,21,21,21,14451,14452],"0009-0001-2272-9172","0009-0000-3196-4011","https:\u002F\u002Fdoi.org\u002F10.1145\u002F3679006.3685069","W4402526954",[3788,14456,3789,629,23,865,1379,5015],"Intercultural communication",{"type":39,"children":14458,"toc":14463},[14459],{"type":42,"tag":43,"props":14460,"children":14461},{},[14462],{"type":47,"value":14443},{"title":8,"searchDepth":49,"depth":49,"links":14464},[],"content:publications:2024:metamorphic-testing-of-a-steer-by-wire-system-an-intercultural-students-as-partn.md","publications\u002F2024\u002Fmetamorphic-testing-of-a-steer-by-wire-system-an-intercultural-students-as-partn.md","publications\u002F2024\u002Fmetamorphic-testing-of-a-steer-by-wire-system-an-intercultural-students-as-partn",{"_path":14469,"_dir":12825,"_draft":7,"_partial":7,"_locale":8,"title":14470,"description":14471,"_hidden":7,"Preliminary Study\" authors":14472,"authors_orcid":14473,"year":12829,"doi":14475,"openalex_id":14476,"venue":21,"abstract_screenshot":21,"keywords":14477,"body":14479,"_type":51,"_id":14487,"_source":53,"_file":14488,"_stem":14489,"_extension":56,"locale":57},"\u002Fpublications\u002F2024\u002Fmobile-microlearning-to-scaffold-project-based-learning-using-arcs-model-a-preli","Mobile Microlearning to Scaffold Project-Based Learning Using ARCS Model: ","This study reports on the development and implementation of the Interactive Design Research Toolkit (IDRT), a mobile application that supports the teaching and learning (T&L) of Human-Centered Design (HCD) practices. Guided by the Attention, Relevance, Confidence, and Satisfaction (ARCS) Model of Motivational Design and leveraging mobile microlearning (MML) principles, the IDRT integrates multimodal instructions and gamification features to encourage students to employ HCD. Implemented in a design-project-based class, 37 students' perceptions and engagement were evaluated using the Instructional Materials Motivation Survey. Results indicate positive feedback, high engagement levels, and increased comprehension of HCD. Analysis of design reports reveals a more diverse application of HCD, particularly among higher-performing students, indicating the IDRT's influence on intrinsic motivation. However, challenges were identified among lower-performing students, indicating the need for further research to enhance engagement. Overall, the study underscores the potential of MML as a viable instruction method to influence students' motivation and proficiency positively and to scaffold the T&L of HCD.",[7077,7078,595,7079],[7081,7082,599,14474],"0009-0004-5139-5636","https:\u002F\u002Fdoi.org\u002F10.1109\u002Fcompsac61105.2024.00064","W4401880576",[14478,23,110],"Scaffold",{"type":39,"children":14480,"toc":14485},[14481],{"type":42,"tag":43,"props":14482,"children":14483},{},[14484],{"type":47,"value":14471},{"title":8,"searchDepth":49,"depth":49,"links":14486},[],"content:publications:2024:mobile-microlearning-to-scaffold-project-based-learning-using-arcs-model-a-preli.md","publications\u002F2024\u002Fmobile-microlearning-to-scaffold-project-based-learning-using-arcs-model-a-preli.md","publications\u002F2024\u002Fmobile-microlearning-to-scaffold-project-based-learning-using-arcs-model-a-preli",{"_path":14491,"_dir":12825,"_draft":7,"_partial":7,"_locale":8,"title":14492,"description":14493,"_hidden":7,"authors":14494,"authors_orcid":14496,"year":12829,"doi":14498,"openalex_id":14499,"venue":374,"abstract_screenshot":21,"keywords":14500,"body":14502,"_type":51,"_id":14510,"_source":53,"_file":14511,"_stem":14512,"_extension":56,"locale":57},"\u002Fpublications\u002F2024\u002Fmobile-robot-sequential-decision-making-using-a-deep-reinforcement-learning-hype","Mobile robot sequential decision making using a deep reinforcement learning hyper-heuristic approach","Sequential decision making is an important part of robotic problems that is receiving unprecedented attention from both academia and industry. Recently, Deep Reinforcement Learning (DRL) has shown its promising capabilities in decision making problems. However, traditional DRL algorithms directly operate in the space of low-level actions, when it is applied in the domain of robotics, it can easily result in an exponential growth of computational complexity and suffer from the “curse of dimensionality”, becoming less efficient as the dimensionality of the environment increases. To address this issue, a novel DRL hyper-heuristic approach is proposed in this paper. The proposed approach is tailored to align with a problem taken from a real-world competition by taking advantage of well-developed low-level heuristic actions in order to narrow the search space and speed up the convergence. This fundamental contribution is a significant step forward from earlier approaches that directly exploit the entire low-level action domain. A state augmentation scheme and a novel reward design are utilized to further improve the performance of the proposed method. Moreover, a Real-to-Sim based training framework is developed to reduce the cost of acquiring real-time data and improve the robustness of agent’s decision-making model. Numerous experimental results demonstrate our proposed method can achieve notable performance gains compared to both competitive DRL baselines and heuristic approaches of the same problem in both known environment and previously unseen scenarios.",[709,10191,13702,14495,13704,12],"Jin, J.S.",[711,10196,21,14497,13709,15],"0000-0001-9839-4279","https:\u002F\u002Fdoi.org\u002F10.1016\u002Fj.eswa.2024.124959","W4401354861",[5304,23,37,6827,353,215,329,1034,7599,7597,890,1167,7755,14501,34],"Robot learning",{"type":39,"children":14503,"toc":14508},[14504],{"type":42,"tag":43,"props":14505,"children":14506},{},[14507],{"type":47,"value":14493},{"title":8,"searchDepth":49,"depth":49,"links":14509},[],"content:publications:2024:mobile-robot-sequential-decision-making-using-a-deep-reinforcement-learning-hype.md","publications\u002F2024\u002Fmobile-robot-sequential-decision-making-using-a-deep-reinforcement-learning-hype.md","publications\u002F2024\u002Fmobile-robot-sequential-decision-making-using-a-deep-reinforcement-learning-hype",{"_path":14514,"_dir":12825,"_draft":7,"_partial":7,"_locale":8,"title":14515,"description":14516,"_hidden":7,"Testing\" authors":14517,"authors_orcid":14518,"year":12829,"doi":14519,"openalex_id":14520,"venue":14521,"abstract_screenshot":21,"keywords":14522,"body":14525,"_type":51,"_id":14533,"_source":53,"_file":14534,"_stem":14535,"_extension":56,"locale":57},"\u002Fpublications\u002F2024\u002Fmrgs-art-metamorphic-relation-and-group-selection-based-on-adaptive-random-testi","MRGS‐ART: Metamorphic Relation and Group Selection Based on Adaptive Rando","ABSTRACT Metamorphic testing (MT) is effective in detecting software failures; it detects failures by examining the metamorphic relations (MRs) among source test cases (STCs), follow‐up test cases (FTCs) and their respective outputs. The STCs together with the corresponding FTCs, considered as a whole, are called metamorphic groups (MGs). MT performance relies heavily on the MRs and MGs. Previous studies have mainly focused on improving MT performance by identifying effective MRs, or through generation of MGs with high quality, but have somewhat neglected the selection of MRs and MGs from existing ones. In this paper, we address this issue by introducing a new metric for guiding the selection of effective MR‐MG pairs from a new perspective: The MR‐MG pair is chosen such that the MR makes the current MG as far away as possible from the executed MGs. We design an MR‐MG pair selection algorithm, named metamorphic relation and group selection based on adaptive random testing (MRGS‐ART), to implement our metric. The intuition behind MRGS‐ART is that we attempt to improve MT performance by achieving an even distribution of STCs and FTCs in their corresponding input domains for all the MRs used. Experimental results indicate that MRGS‐ART can enhance MT performance. We believe that this is the first comprehensive and systematic demonstration, from the perspective of both MRs and MGs, that making STCs and FTCs evenly distributed in their corresponding input domains can improve MT performance. Finally, by analysing the experimental results, we provide guidance on how to most effectively implement MRGS‐ART.",[8040,595,4189,1156],[8044,599,4191,1158],"https:\u002F\u002Fdoi.org\u002F10.1002\u002Fstvr.1908","W4404762780","Software Testing Verification and Reliability",[134,14523,4965,3788,14524,23,37,34,3789,181,753,76,3790],"Group (periodic table)","Group testing",{"type":39,"children":14526,"toc":14531},[14527],{"type":42,"tag":43,"props":14528,"children":14529},{},[14530],{"type":47,"value":14516},{"title":8,"searchDepth":49,"depth":49,"links":14532},[],"content:publications:2024:mrgs-art-metamorphic-relation-and-group-selection-based-on-adaptive-random-testi.md","publications\u002F2024\u002Fmrgs-art-metamorphic-relation-and-group-selection-based-on-adaptive-random-testi.md","publications\u002F2024\u002Fmrgs-art-metamorphic-relation-and-group-selection-based-on-adaptive-random-testi",{"_path":14537,"_dir":12825,"_draft":7,"_partial":7,"_locale":8,"title":14538,"description":14539,"_hidden":7,"authors":14540,"authors_orcid":14541,"year":12829,"doi":14542,"openalex_id":14543,"venue":21,"abstract_screenshot":21,"keywords":14544,"body":14545,"_type":51,"_id":14553,"_source":53,"_file":14554,"_stem":14555,"_extension":56,"locale":57},"\u002Fpublications\u002F2024\u002Fmt-part-metamorphic-testing-based-adaptive-random-testing-through-partitioning","MT-PART: Metamorphic-Testing-Based Adaptive Random Testing Through Partitioning","Metamorphic Testing (MT) has been repeatedly proven effective in detecting software faults. MT detects faults by checking the Metamorphic Relations (MRs) among Source Test Cases (STCs) and Follow-up Test Cases (FTCs) and the corresponding outputs. Metamorphic Groups (MGs) denote the associated STCs and FTCs. The performance of MT relates strongly to the MRs and MGs. However, previous studies that on MG generation mainly focused on improving the effectiveness (i.e. fault-detection capability) of MT, but to some extent overlooked the efficiency. This paper proposes a new kind of MG generation algorithms called Metamorphic-Testing-based Adaptive Random Testing through Partitioning (MT-PART). These algorithms at-tempt to improve both the effectiveness and the efficiency of MT by dynamically partitioning the input domain and generating new STCs and FTCs that are uniformly distributed over their corresponding input domains. Through empirical experiments, we found that our algorithms are able to significantly outper-form other existing MG generation algorithms in terms of test efficiency, while maintaining good test effectiveness.",[8040,595,596,1156],[8044,599,600,1158],"https:\u002F\u002Fdoi.org\u002F10.1109\u002Fcompsac61105.2024.00158","W4401880548",[1163,23,3788,606,110,215,3789,139,658,5015],{"type":39,"children":14546,"toc":14551},[14547],{"type":42,"tag":43,"props":14548,"children":14549},{},[14550],{"type":47,"value":14539},{"title":8,"searchDepth":49,"depth":49,"links":14552},[],"content:publications:2024:mt-part-metamorphic-testing-based-adaptive-random-testing-through-partitioning.md","publications\u002F2024\u002Fmt-part-metamorphic-testing-based-adaptive-random-testing-through-partitioning.md","publications\u002F2024\u002Fmt-part-metamorphic-testing-based-adaptive-random-testing-through-partitioning",{"_path":14557,"_dir":12825,"_draft":7,"_partial":7,"_locale":8,"title":14558,"description":8,"_hidden":7,"authors":14559,"authors_orcid":14562,"year":12829,"doi":14563,"openalex_id":14564,"venue":14088,"abstract_screenshot":21,"keywords":14565,"body":14566,"_type":51,"_id":14570,"_source":53,"_file":14571,"_stem":14572,"_extension":56,"locale":57},"\u002Fpublications\u002F2024\u002Fmtdiff-visual-anomaly-detection-with-multi-scale-diffusion-models","MTDiff: Visual anomaly detection with multi-scale diffusion models",[14560,14561,8931],"Wang, Xubin","Li, Wenju",[21,21,8937],"https:\u002F\u002Fdoi.org\u002F10.1016\u002Fj.knosys.2024.112364","W4401503235",[14295,23,353,3876,859,181,37,9091,1057,4265,4876,11166,4094,14296,215,868],{"type":39,"children":14567,"toc":14568},[],{"title":8,"searchDepth":49,"depth":49,"links":14569},[],"content:publications:2024:mtdiff-visual-anomaly-detection-with-multi-scale-diffusion-models.md","publications\u002F2024\u002Fmtdiff-visual-anomaly-detection-with-multi-scale-diffusion-models.md","publications\u002F2024\u002Fmtdiff-visual-anomaly-detection-with-multi-scale-diffusion-models",{"_path":14574,"_dir":12825,"_draft":7,"_partial":7,"_locale":8,"title":14575,"description":14576,"_hidden":7,"authors":14577,"authors_orcid":14579,"year":12829,"doi":14581,"openalex_id":14582,"venue":21,"abstract_screenshot":21,"keywords":14583,"body":14585,"_type":51,"_id":14601,"_source":53,"_file":14602,"_stem":14603,"_extension":56,"locale":57},"\u002Fpublications\u002F2024\u002Fmulti-view-spectrogram-transformer-for-respiratory-sound-classification","Multi-View Spectrogram Transformer for Respiratory Sound Classification","Deep neural networks have been applied to audio spectrograms for respiratory sound classification. Existing models often treat the spectrogram as a synthetic image while overlooking its physical characteristics. In this paper, a Multi-View Spectrogram Transformer (MVST) is proposed to embed different views of time-frequency characteristics into the vision transformer. Specifically, the proposed MVST splits the mel-spectrogram into different-sized patches, representing the multi-view acoustic elements of a respiratory sound. The patches and positional embeddings are fed into transformer encoders to extract the attentional information among patches through a self-attention mechanism. Finally, a gated fusion scheme is designed to automatically weigh the multi-view features to highlight the best one in a specific scenario. Experimental results on the ICBHI dataset demonstrate that the MVST significantly outperforms state-of-the-art methods for classifying respiratory sounds. The code is available at: https:\u002F\u002Fgithub.com\u002Fwentaoheunnc\u002FMVST.",[7409,14578,6111,12,9048],"Yan, Yuchen",[7415,14580,21,15,9051],"0000-0003-3359-4012","https:\u002F\u002Fdoi.org\u002F10.1109\u002Ficassp48485.2024.10445825","W4392903171",[11759,23,14584,9058,6980,37,4876,179],"Transformer",{"type":39,"children":14586,"toc":14599},[14587],{"type":42,"tag":43,"props":14588,"children":14589},{},[14590,14592,14598],{"type":47,"value":14591},"Deep neural networks have been applied to audio spectrograms for respiratory sound classification. Existing models often treat the spectrogram as a synthetic image while overlooking its physical characteristics. In this paper, a Multi-View Spectrogram Transformer (MVST) is proposed to embed different views of time-frequency characteristics into the vision transformer. Specifically, the proposed MVST splits the mel-spectrogram into different-sized patches, representing the multi-view acoustic elements of a respiratory sound. The patches and positional embeddings are fed into transformer encoders to extract the attentional information among patches through a self-attention mechanism. Finally, a gated fusion scheme is designed to automatically weigh the multi-view features to highlight the best one in a specific scenario. Experimental results on the ICBHI dataset demonstrate that the MVST significantly outperforms state-of-the-art methods for classifying respiratory sounds. The code is available at: ",{"type":42,"tag":1574,"props":14593,"children":14596},{"href":14594,"rel":14595},"https:\u002F\u002Fgithub.com\u002Fwentaoheunnc\u002FMVST",[4520],[14597],{"type":47,"value":14594},{"type":47,"value":1645},{"title":8,"searchDepth":49,"depth":49,"links":14600},[],"content:publications:2024:multi-view-spectrogram-transformer-for-respiratory-sound-classification.md","publications\u002F2024\u002Fmulti-view-spectrogram-transformer-for-respiratory-sound-classification.md","publications\u002F2024\u002Fmulti-view-spectrogram-transformer-for-respiratory-sound-classification",{"_path":14605,"_dir":12825,"_draft":7,"_partial":7,"_locale":8,"title":14606,"description":14607,"_hidden":7,"authors":14608,"authors_orcid":14609,"year":12829,"doi":14611,"openalex_id":14612,"venue":21,"abstract_screenshot":21,"keywords":14613,"body":14615,"_type":51,"_id":14623,"_source":53,"_file":14624,"_stem":14625,"_extension":56,"locale":57},"\u002Fpublications\u002F2024\u002Fmultimodality-semisupervised-learning-for-ophthalmic-biomarkers-detection","Multimodality semisupervised learning for ophthalmic biomarkers detection","Ophthalmic Biomarkers, as an objective and quantifiable approach to identifying the ophthalmological disease process, are proven to be useful not only in assisting healthcare professionals in disease diagnosis but also in the identification of phenomena and risk factors in the early stages, which greatly contribute to disease prevention and better treatment of patients. In this study, a deep learning method is introduced to achieve simultaneous automatic recognition of six prevalent ophthalmic biomarkers in the OLIVES dataset. To enhance identification accuracy, semi-supervised learning techniques are adopted in this research and different data modalities are jointly optimized using a guided loss function. The experimental results reveal that the method reaches an F1 score of 0.70 on a test set with 3,872 images.",[13446,13448,13447,13449,13450,13443,13445,13451,13452,13453,13444,8931],[14610,21,13458,21,13459,21,21,21,13460,21,13456,8937],"0000-0002-2747-6637","https:\u002F\u002Fdoi.org\u002F10.1117\u002F12.3019655","W4396578660",[14614,23,37,869],"Multimodality",{"type":39,"children":14616,"toc":14621},[14617],{"type":42,"tag":43,"props":14618,"children":14619},{},[14620],{"type":47,"value":14607},{"title":8,"searchDepth":49,"depth":49,"links":14622},[],"content:publications:2024:multimodality-semisupervised-learning-for-ophthalmic-biomarkers-detection.md","publications\u002F2024\u002Fmultimodality-semisupervised-learning-for-ophthalmic-biomarkers-detection.md","publications\u002F2024\u002Fmultimodality-semisupervised-learning-for-ophthalmic-biomarkers-detection",{"_path":14627,"_dir":12825,"_draft":7,"_partial":7,"_locale":8,"title":14628,"description":8,"_hidden":7,"Games":14629,"authors":14630,"authors_orcid":14631,"year":12829,"doi":14632,"openalex_id":14633,"venue":687,"abstract_screenshot":21,"keywords":14634,"body":14638,"_type":51,"_id":14642,"_source":53,"_file":14643,"_stem":14644,"_extension":56,"locale":57},"\u002Fpublications\u002F2024\u002Foptimizing-interface-and-interaction-design-for-non-immersive-vr-firefighting-ga","Optimizing Interface and Interaction Design for Non-immersive VR Firefightin","A User Experience Approach\"",[11421,5667,5407,5665],[11428,5670,5411,5669],"https:\u002F\u002Fdoi.org\u002F10.1007\u002F978-3-031-53827-8_30","W4392249982",[868,23,14635,4390,8471,133,10627,14636,14637,4387,864,867],"Bespoke","Affordance","User experience design",{"type":39,"children":14639,"toc":14640},[],{"title":8,"searchDepth":49,"depth":49,"links":14641},[],"content:publications:2024:optimizing-interface-and-interaction-design-for-non-immersive-vr-firefighting-ga.md","publications\u002F2024\u002Foptimizing-interface-and-interaction-design-for-non-immersive-vr-firefighting-ga.md","publications\u002F2024\u002Foptimizing-interface-and-interaction-design-for-non-immersive-vr-firefighting-ga",{"_path":14646,"_dir":12825,"_draft":7,"_partial":7,"_locale":8,"title":14647,"description":8,"_hidden":7,"authors":14648,"authors_orcid":14650,"year":12829,"doi":14653,"openalex_id":14654,"venue":74,"abstract_screenshot":21,"keywords":14655,"body":14656,"_type":51,"_id":14660,"_source":53,"_file":14661,"_stem":14662,"_extension":56,"locale":57},"\u002Fpublications\u002F2024\u002Fpattern-based-learning-and-optimisation-through-pricing-for-bin-packing-problem","Pattern Based Learning and Optimisation Through Pricing for Bin Packing Problem",[7412,12,14649,157,9723,6111],"Liu, Tie‐Yan",[14651,15,14652,9726,9725,6113],"0000-0001-6933-0620","0000-0002-0476-8020","https:\u002F\u002Fdoi.org\u002F10.2139\u002Fssrn.4822673","W4396783264",[9732,9733,23,178,31,37,34,332],{"type":39,"children":14657,"toc":14658},[],{"title":8,"searchDepth":49,"depth":49,"links":14659},[],"content:publications:2024:pattern-based-learning-and-optimisation-through-pricing-for-bin-packing-problem.md","publications\u002F2024\u002Fpattern-based-learning-and-optimisation-through-pricing-for-bin-packing-problem.md","publications\u002F2024\u002Fpattern-based-learning-and-optimisation-through-pricing-for-bin-packing-problem",{"_path":14664,"_dir":12825,"_draft":7,"_partial":7,"_locale":8,"title":14665,"description":14666,"_hidden":7,"Understanding\" authors":14667,"authors_orcid":14669,"year":12829,"doi":14671,"openalex_id":14672,"venue":9025,"abstract_screenshot":21,"keywords":14673,"body":14676,"_type":51,"_id":14700,"_source":53,"_file":14701,"_stem":14702,"_extension":56,"locale":57},"\u002Fpublications\u002F2024\u002Fpoint-clouds-are-specialized-images-a-knowledge-transfer-approach-for-3d-underst","Point Clouds are Specialized Images: A Knowledge Transfer Approach for 3","Self-supervised representation learning (SSRL) has gained increasing attention in point cloud understanding, in addressing the challenges posed by 3D data scarcity and high annotation costs. This paper presents PCExpert, a novel SSRL approach that reinterprets point clouds as “specialized images”. This conceptual shift allows PCExpert to leverage knowledge derived from large-scale image modality in a more direct and deeper manner, via extensively sharing the parameters with a pre-trained image encoder in a multi-way Transformer architecture. The parameter sharing strategy, combined with an additional pretext task for pre-training, i.e., transformation estimation, empowers PCExpert to outperform the state of the arts in a variety of tasks, with a remarkable reduction in the number of trainable parameters. Notably, PCExpert's performance under LINEAR fine-tuning (e.g., yielding a 90.02% overall accuracy on ScanObjectNN) has already closely approximated the results obtained with FULL model fine-tuning (92.66%), demonstrating its effective representation capability.",[12671,9014,8931,14668],"Lam, Kin‐Man",[12673,9020,8937,14670],"0000-0002-0422-8454","https:\u002F\u002Fdoi.org\u002F10.1109\u002Ftmm.2024.3412330","W4399526831",[23,14674,14675,10410,37,629],"Point cloud","Knowledge transfer",{"type":39,"children":14677,"toc":14698},[14678],{"type":42,"tag":43,"props":14679,"children":14680},{},[14681,14683,14689,14691,14696],{"type":47,"value":14682},"Self-supervised representation learning (SSRL) has gained increasing attention in point cloud understanding, in addressing the challenges posed by 3D data scarcity and high annotation costs. This paper presents PCExpert, a novel SSRL approach that reinterprets point clouds as “specialized images”. This conceptual shift allows PCExpert to leverage knowledge derived from large-scale image modality in a more direct and deeper manner, via extensively sharing the parameters with a pre-trained image encoder in a multi-way Transformer architecture. The parameter sharing strategy, combined with an additional pretext task for pre-training, i.e., transformation estimation, empowers PCExpert to outperform the state of the arts in a variety of tasks, with a remarkable reduction in the number of trainable parameters. Notably, PCExpert's performance under ",{"type":42,"tag":14684,"props":14685,"children":14686},"monospace",{"xmlns:mml":1465,"xmlnsXLink":8791},[14687],{"type":47,"value":14688},"LINEAR",{"type":47,"value":14690}," fine-tuning (e.g., yielding a 90.02% overall accuracy on ScanObjectNN) has already closely approximated the results obtained with ",{"type":42,"tag":14684,"props":14692,"children":14693},{"xmlns:mml":1465,"xmlnsXLink":8791},[14694],{"type":47,"value":14695},"FULL",{"type":47,"value":14697}," model fine-tuning (92.66%), demonstrating its effective representation capability.",{"title":8,"searchDepth":49,"depth":49,"links":14699},[],"content:publications:2024:point-clouds-are-specialized-images-a-knowledge-transfer-approach-for-3d-underst.md","publications\u002F2024\u002Fpoint-clouds-are-specialized-images-a-knowledge-transfer-approach-for-3d-underst.md","publications\u002F2024\u002Fpoint-clouds-are-specialized-images-a-knowledge-transfer-approach-for-3d-underst",{"_path":14704,"_dir":12825,"_draft":7,"_partial":7,"_locale":8,"title":14705,"description":14706,"_hidden":7,"authors":14707,"authors_orcid":14708,"year":12829,"doi":14709,"openalex_id":14710,"venue":374,"abstract_screenshot":21,"keywords":14711,"body":14716,"_type":51,"_id":14724,"_source":53,"_file":14725,"_stem":14726,"_extension":56,"locale":57},"\u002Fpublications\u002F2024\u002Fprogressively-orthogonally-mapped-efficientnet-for-action-recognition-on-time-ra","Progressively-orthogonally-mapped EfficientNet for action recognition on time-range-Doppler signature","Although 2D radar signal representations, such as spectrograms and range-Doppler maps have been widely used for target recognition, 3D time-range-Doppler (TRD) has been less studied, partially because of the difficulties in extracting features from the TRD representation, i.e., shallow 3D neural networks have limited discriminant power, but repeatedly applying 3D convolutions will lead to an oversized 3D network. A hybrid 3D–2D network architecture, Progressively-Orthogonally-Mapped EfficientNet (POMEN), is proposed to address these challenges. More specifically, the proposed POMEN utilizes 3D convolutions in the earlier stages to capture the information embedded in the sparse 3D TRD representation, and to avoid the oversized feature map caused by excessively applying 3D convolutions, we propose to progressively map the 3D features into three sets of 2D features corresponding to the range-time signature, range-Doppler map and time-Doppler signature (spectrogram), respectively. Subsequently, 2D EfficientNet blocks were designed to extract discriminant information from the three sets of 2D feature maps. This hybrid 3D–2D network design effectively extracts features from the 3D TRD representation, thereby avoiding oversized features from full-sized 3D networks and the information loss of 2D networks on 2D representations. Finally, a homogeneous gated fusion network was designed to fuse the three sets of 2D features. The proposed method was evaluated on the UGRS, MIMOGR, and mmWRWD datasets. The experimental results for all datasets demonstrate that the proposed POMEN significantly and consistently outperforms the state-of-the-art models in both 2D and 3D representations.",[8405,6111,12,4626,8406,9048],[21,6113,15,4637,8409,9051],"https:\u002F\u002Fdoi.org\u002F10.1016\u002Fj.eswa.2024.124824","W4400720222",[14712,23,5997,14713,14714,14715,4876,37,3597,34,3961,3393,862],"Signature (topology)","Action (physics)","Doppler effect","Action recognition",{"type":39,"children":14717,"toc":14722},[14718],{"type":42,"tag":43,"props":14719,"children":14720},{},[14721],{"type":47,"value":14706},{"title":8,"searchDepth":49,"depth":49,"links":14723},[],"content:publications:2024:progressively-orthogonally-mapped-efficientnet-for-action-recognition-on-time-ra.md","publications\u002F2024\u002Fprogressively-orthogonally-mapped-efficientnet-for-action-recognition-on-time-ra.md","publications\u002F2024\u002Fprogressively-orthogonally-mapped-efficientnet-for-action-recognition-on-time-ra",{"_path":14728,"_dir":12825,"_draft":7,"_partial":7,"_locale":8,"title":14729,"description":8,"_hidden":7,"authors":14730,"authors_orcid":14732,"year":12829,"doi":14734,"openalex_id":14735,"venue":7279,"abstract_screenshot":21,"keywords":14736,"body":14740,"_type":51,"_id":14744,"_source":53,"_file":14745,"_stem":14746,"_extension":56,"locale":57},"\u002Fpublications\u002F2024\u002Fpruning-convolutional-neural-networks-for-inductive-conformal-prediction","Pruning convolutional neural networks for inductive conformal prediction",[14731,10477,4189],"Zhao, Xinyao",[14733,10479,4191],"0009-0009-9957-201X","https:\u002F\u002Fdoi.org\u002F10.1016\u002Fj.neucom.2024.128704","W4403155178",[5545,3334,7446,37,23,14737,632,4876,215,34,4608,14738,14739,179,3393],"Inductive bias","Botany","Multi-task learning",{"type":39,"children":14741,"toc":14742},[],{"title":8,"searchDepth":49,"depth":49,"links":14743},[],"content:publications:2024:pruning-convolutional-neural-networks-for-inductive-conformal-prediction.md","publications\u002F2024\u002Fpruning-convolutional-neural-networks-for-inductive-conformal-prediction.md","publications\u002F2024\u002Fpruning-convolutional-neural-networks-for-inductive-conformal-prediction",{"_path":14748,"_dir":12825,"_draft":7,"_partial":7,"_locale":8,"title":14749,"description":14750,"_hidden":7,"prefilling‐based matrix factorizations authors":14751,"authors_orcid":14753,"year":12829,"doi":14754,"openalex_id":14755,"venue":14756,"abstract_screenshot":21,"keywords":14757,"body":14758,"_type":51,"_id":14766,"_source":53,"_file":14767,"_stem":14768,"_extension":56,"locale":57},"\u002Fpublications\u002F2024\u002Fqos-prediction-of-cloud-services-by-selective-ensemble-learning-on-prefilling-ba","QoS prediction of cloud services by selective ensemble learning on","Summary When selecting services from a cloud center to build applications, the quality of service (QoS) is an important nonfunctional attribute to be considered. However, in actual application scenarios, the QoS details for many services may not be available. This has led to a situation where prediction of the missing QoS records for services has become a key problem for service selection. This article presents a selective ensemble learning (SEL) framework for prefilling‐based matrix factorization (PFMF) predictors. In each PFMF predictor, the improved collaborative filtering is defined by examining the stability of the QoS records when measuring the similarity of users (or services), and then used to prefill empty records in the initial QoS matrix. To ensure the diversity of the basic PFMF predictors, various prefilled QoS matrices are constructed for the matrix factorization. In this process, different reference weights are assigned to the original and the prefilled QoS records. Finally, particle swarm optimization is used to set the ensemble weights for the basic PFMF predictors. The proposed SEL on PFMF (SEL‐PFMF) algorithm is validated on a public dataset, where its prediction performance outperforms the state‐of‐the‐art algorithms, and also shows good stability.",[1095,3112,595,14752,12978],"Zhao, Zhuang",[1099,3115,599,21,21],"https:\u002F\u002Fdoi.org\u002F10.1002\u002Fcpe.8282","W4402542691","Concurrency and Computation Practice and Experience",[23,3123,7862,5968,3121,37,215,251,1113],{"type":39,"children":14759,"toc":14764},[14760],{"type":42,"tag":43,"props":14761,"children":14762},{},[14763],{"type":47,"value":14750},{"title":8,"searchDepth":49,"depth":49,"links":14765},[],"content:publications:2024:qos-prediction-of-cloud-services-by-selective-ensemble-learning-on-prefilling-ba.md","publications\u002F2024\u002Fqos-prediction-of-cloud-services-by-selective-ensemble-learning-on-prefilling-ba.md","publications\u002F2024\u002Fqos-prediction-of-cloud-services-by-selective-ensemble-learning-on-prefilling-ba",{"_path":14770,"_dir":12825,"_draft":7,"_partial":7,"_locale":8,"title":14771,"description":14772,"_hidden":7,"authors":14773,"authors_orcid":14774,"year":12829,"doi":14775,"openalex_id":14776,"venue":10505,"abstract_screenshot":21,"keywords":14777,"body":14778,"_type":51,"_id":14795,"_source":53,"_file":14796,"_stem":14797,"_extension":56,"locale":57},"\u002Fpublications\u002F2024\u002Fradar-gait-recognition-using-dual-branch-swin-transformer-with-asymmetric-attent","Radar gait recognition using Dual-branch Swin Transformer with Asymmetric Attention Fusion","Video-based gait recognition suffers from potential privacy issues and performance degradation due to dim environments, partial occlusions, or camera view changes. Radar has recently become increasingly popular and overcome various challenges presented by vision sensors. To capture tiny differences in radar gait signatures of different people, a dual-branch Swin Transformer is proposed, where one branch captures the time variations of the radar micro-Doppler signature and the other captures the repetitive frequency patterns in the spectrogram. Unlike natural images where objects can be translated, rotated, or scaled, the spatial coordinates of spectrograms and CVDs have unique physical meanings, and there is no affine transformation for radar targets in these synthetic images. The patch splitting mechanism in Vision Transformer makes it ideal to extract discriminant information from patches, and learn the attentive information across patches, as each patch carries some unique physical properties of radar targets. Swin Transformer consists of a set of cascaded Swin blocks to extract semantic features from shallow to deep representations, further improving the classification performance. Lastly, to highlight the branch with larger discriminant power, an Asymmetric Attention Fusion is proposed to optimally fuse the discriminant features from the two branches. To enrich the research on radar gait recognition, a large-scale NTU-RGR dataset is constructed, containing 45,768 radar frames of 98 subjects. The proposed method is evaluated on the NTU-RGR dataset and the MMRGait-1.0 database. It consistently and significantly outperforms all the compared methods on both datasets. The codes are available at: https:\u002F\u002Fgithub.com\u002Fwentaoheunnc\u002FNTU-RGR . • The proposed method could well extract complementary information from both spectrograms and CVDs. • The proposed Swin-T could extract discriminant features with physical meanings. • The proposed asymmetric attention fusion could effectively combine features with known importance. • A large-scale benchmark dataset, NTU-RGR dataset, is developed to advance the radar gait recognition.",[7409,6111,12,9048],[7415,6113,15,9051],"https:\u002F\u002Fdoi.org\u002F10.1016\u002Fj.patcog.2024.111101","W4403984679",[37,23,9690,4391,9864,9189,14584,14220,4876,6980,9693,179,288,380,928,13058],{"type":39,"children":14779,"toc":14793},[14780],{"type":42,"tag":43,"props":14781,"children":14782},{},[14783,14785,14791],{"type":47,"value":14784},"Video-based gait recognition suffers from potential privacy issues and performance degradation due to dim environments, partial occlusions, or camera view changes. Radar has recently become increasingly popular and overcome various challenges presented by vision sensors. To capture tiny differences in radar gait signatures of different people, a dual-branch Swin Transformer is proposed, where one branch captures the time variations of the radar micro-Doppler signature and the other captures the repetitive frequency patterns in the spectrogram. Unlike natural images where objects can be translated, rotated, or scaled, the spatial coordinates of spectrograms and CVDs have unique physical meanings, and there is no affine transformation for radar targets in these synthetic images. The patch splitting mechanism in Vision Transformer makes it ideal to extract discriminant information from patches, and learn the attentive information across patches, as each patch carries some unique physical properties of radar targets. Swin Transformer consists of a set of cascaded Swin blocks to extract semantic features from shallow to deep representations, further improving the classification performance. Lastly, to highlight the branch with larger discriminant power, an Asymmetric Attention Fusion is proposed to optimally fuse the discriminant features from the two branches. To enrich the research on radar gait recognition, a large-scale NTU-RGR dataset is constructed, containing 45,768 radar frames of 98 subjects. The proposed method is evaluated on the NTU-RGR dataset and the MMRGait-1.0 database. It consistently and significantly outperforms all the compared methods on both datasets. The codes are available at: ",{"type":42,"tag":1574,"props":14786,"children":14789},{"href":14787,"rel":14788},"https:\u002F\u002Fgithub.com\u002Fwentaoheunnc\u002FNTU-RGR",[4520],[14790],{"type":47,"value":14787},{"type":47,"value":14792}," . • The proposed method could well extract complementary information from both spectrograms and CVDs. • The proposed Swin-T could extract discriminant features with physical meanings. • The proposed asymmetric attention fusion could effectively combine features with known importance. • A large-scale benchmark dataset, NTU-RGR dataset, is developed to advance the radar gait recognition.",{"title":8,"searchDepth":49,"depth":49,"links":14794},[],"content:publications:2024:radar-gait-recognition-using-dual-branch-swin-transformer-with-asymmetric-attent.md","publications\u002F2024\u002Fradar-gait-recognition-using-dual-branch-swin-transformer-with-asymmetric-attent.md","publications\u002F2024\u002Fradar-gait-recognition-using-dual-branch-swin-transformer-with-asymmetric-attent",{"_path":14799,"_dir":12825,"_draft":7,"_partial":7,"_locale":8,"title":14800,"description":14801,"_hidden":7,"Reference Multiplier Generation and SCA-SAT Synergy\" authors":14802,"authors_orcid":14804,"year":12829,"doi":14806,"openalex_id":14807,"venue":8774,"abstract_screenshot":21,"keywords":14808,"body":14811,"_type":51,"_id":14819,"_source":53,"_file":14820,"_stem":14821,"_extension":56,"locale":57},"\u002Fpublications\u002F2024\u002Frefscat-formal-verification-of-logic-optimized-multipliers-via-automated-referen","RefSCAT: Formal Verification of Logic-Optimized Multipliers via Automate","Formally verifying logic-optimized integer multipliers remains a crucial yet insufficiently addressed problem in both industry and academia, presenting significant verification challenges, particularly when verifying the large-scale logic-optimized multipliers with diverse architectures. Satisfiability (SAT)-based methods require structurally similar and known correct reference multipliers, which may not always be readily accessible. Symbolic computer algebra (SCA) techniques can verify multipliers without references but encounter difficulties with optimized multipliers due to unclear adder boundaries. To enable effective formal verification of the optimized multipliers, we propose the RefSCAT framework, which contains a reference multiplier generator that produces references structurally similar to the optimized multiplier with clear adder boundaries, enabling a synergistic SCA-SAT verification flow. First, we propose a reverse engineering algorithm that extracts the essential adder tree from the optimized multiplier, ensuring similarity. Second, since only a partial netlist is extractable after optimization, we propose a constraint satisfaction algorithm to complete the generation using only adders while following the extracted netlist, ensuring both similarity and clear adder boundaries. Third, leveraging the generated reference, we propose a synergized SCA-SAT verification flow that verifies the generated reference using SCA and then uses it as a correct reference for the SAT-based verification. The experiments demonstrate that RefSCAT can successfully verify logic-optimized multipliers with diverse partial-product-based architectures up to 128 bits, outperforming the state-of-the-art methods by verifying at least 29% more benchmarks.",[6184,11085,5532,14803,5531,5534],"Fujita, Masahiro",[11087,11088,5537,14805,5536,5539],"0000-0002-6516-4175","https:\u002F\u002Fdoi.org\u002F10.1109\u002Ftcad.2024.3442987","W4401537203",[14809,23,14810,110,332,34],"Multiplier (economics)","Arithmetic",{"type":39,"children":14812,"toc":14817},[14813],{"type":42,"tag":43,"props":14814,"children":14815},{},[14816],{"type":47,"value":14801},{"title":8,"searchDepth":49,"depth":49,"links":14818},[],"content:publications:2024:refscat-formal-verification-of-logic-optimized-multipliers-via-automated-referen.md","publications\u002F2024\u002Frefscat-formal-verification-of-logic-optimized-multipliers-via-automated-referen.md","publications\u002F2024\u002Frefscat-formal-verification-of-logic-optimized-multipliers-via-automated-referen",{"_path":14823,"_dir":12825,"_draft":7,"_partial":7,"_locale":8,"title":14824,"description":14825,"_hidden":7,"Networks Hyperparameters in Financial Fraud Detection authors":14826,"authors_orcid":14827,"year":12829,"doi":14828,"openalex_id":14829,"venue":21,"abstract_screenshot":21,"keywords":14830,"body":14831,"_type":51,"_id":14839,"_source":53,"_file":14840,"_stem":14841,"_extension":56,"locale":57},"\u002Fpublications\u002F2024\u002Freinforcement-learning-for-optimizing-conditional-tabular-generative-adversarial","Reinforcement Learning for Optimizing Conditional Tabular Generative Adversarial","Financial fraud datasets typically exhibit a pro-nounced class imbalance, leading to elevated false positive rates when employing machine learning classifiers. To mitigate this issue, the Conditional Tabular Generative Adversarial Network (CTGAN), an oversampling technique tailored for tabular data, has emerged as a promising solution by generating additional minority samples. However, it remains pertinent to investigate whether optimizing the hyperparameters governing CTGAN can yield further improvements in performance. In light of the recent application of reinforcement learning (RL) for hyperparameter tuning, this study delves into the potential of harnessing RL mod-els to fine-tune the hyperparameters of CTGAN. The overarching objective is to design an RL-based methodology that automates the optimization of CTGAN hyperparameters. Although the initial findings from this endeavor may be inconclusive, they pave the way for future research avenues, exploring the potential of RL in the context of CTGAN hyperparameter tuning and scrutinizing the nuanced effects of CTGAN hyperparameters on classification performance.",[11577,11578,5667],[11580,11581,5670],"https:\u002F\u002Fdoi.org\u002F10.1109\u002Ficecet61485.2024.10698625","W4403212800",[13234,11587,5304,23,13372,215,37,12493,11469,6976,865],{"type":39,"children":14832,"toc":14837},[14833],{"type":42,"tag":43,"props":14834,"children":14835},{},[14836],{"type":47,"value":14825},{"title":8,"searchDepth":49,"depth":49,"links":14838},[],"content:publications:2024:reinforcement-learning-for-optimizing-conditional-tabular-generative-adversarial.md","publications\u002F2024\u002Freinforcement-learning-for-optimizing-conditional-tabular-generative-adversarial.md","publications\u002F2024\u002Freinforcement-learning-for-optimizing-conditional-tabular-generative-adversarial",{"_path":14843,"_dir":12825,"_draft":7,"_partial":7,"_locale":8,"title":14844,"description":14845,"_hidden":7,"authors":14846,"authors_orcid":14848,"year":12829,"doi":14850,"openalex_id":14851,"venue":5791,"abstract_screenshot":21,"keywords":14852,"body":14854,"_type":51,"_id":14870,"_source":53,"_file":14871,"_stem":14872,"_extension":56,"locale":57},"\u002Fpublications\u002F2024\u002Fscale-optimization-using-evolutionary-reinforcement-learning-for-object-detectio","Scale Optimization Using Evolutionary Reinforcement Learning for Object Detection on Drone Imagery","Object detection in aerial imagery presents a significant challenge due to large scale variations among objects. This paper proposes an evolutionary reinforcement learning agent, integrated within a coarse-to-fine object detection framework, to optimize the scale for more effective detection of objects in such images. Specifically, a set of patches potentially containing objects are first generated. A set of rewards measuring the localization accuracy, the accuracy of predicted labels, and the scale consistency among nearby patches are designed in the agent to guide the scale optimization. The proposed scale-consistency reward ensures similar scales for neighboring objects of the same category. Furthermore, a spatial-semantic attention mechanism is designed to exploit the spatial semantic relations between patches. The agent employs the proximal policy optimization strategy in conjunction with the evolutionary strategy, effectively utilizing both the current patch status and historical experience embedded in the agent. The proposed model is compared with state-of-the-art methods on two benchmark datasets for object detection on drone imagery. It significantly outperforms all the compared methods. Code is available at https:\u002F\u002Fgithub.com\u002FUNNC-CV\u002FEvOD\u002F.",[6997,10191,7409,6111,10031,14847,12,8931,8406],"Zhao, Yitian",[7000,10196,7415,21,10036,14849,15,8937,8409],"0000-0003-4357-4592","https:\u002F\u002Fdoi.org\u002F10.1609\u002Faaai.v38i1.27795","W4393158955",[14853,5304,37,4265,23,4391,7445,215,289,4051,4608],"Drone",{"type":39,"children":14855,"toc":14868},[14856],{"type":42,"tag":43,"props":14857,"children":14858},{},[14859,14861,14867],{"type":47,"value":14860},"Object detection in aerial imagery presents a significant challenge due to large scale variations among objects. This paper proposes an evolutionary reinforcement learning agent, integrated within a coarse-to-fine object detection framework, to optimize the scale for more effective detection of objects in such images. Specifically, a set of patches potentially containing objects are first generated. A set of rewards measuring the localization accuracy, the accuracy of predicted labels, and the scale consistency among nearby patches are designed in the agent to guide the scale optimization. The proposed scale-consistency reward ensures similar scales for neighboring objects of the same category. Furthermore, a spatial-semantic attention mechanism is designed to exploit the spatial semantic relations between patches. The agent employs the proximal policy optimization strategy in conjunction with the evolutionary strategy, effectively utilizing both the current patch status and historical experience embedded in the agent. The proposed model is compared with state-of-the-art methods on two benchmark datasets for object detection on drone imagery. It significantly outperforms all the compared methods. Code is available at ",{"type":42,"tag":1574,"props":14862,"children":14865},{"href":14863,"rel":14864},"https:\u002F\u002Fgithub.com\u002FUNNC-CV\u002FEvOD\u002F",[4520],[14866],{"type":47,"value":14863},{"type":47,"value":1645},{"title":8,"searchDepth":49,"depth":49,"links":14869},[],"content:publications:2024:scale-optimization-using-evolutionary-reinforcement-learning-for-object-detectio.md","publications\u002F2024\u002Fscale-optimization-using-evolutionary-reinforcement-learning-for-object-detectio.md","publications\u002F2024\u002Fscale-optimization-using-evolutionary-reinforcement-learning-for-object-detectio",{"_path":14874,"_dir":12825,"_draft":7,"_partial":7,"_locale":8,"title":14875,"description":14876,"_hidden":7,"authors":14877,"authors_orcid":14878,"year":12829,"doi":14880,"openalex_id":14881,"venue":14521,"abstract_screenshot":21,"keywords":14882,"body":14883,"_type":51,"_id":14891,"_source":53,"_file":14892,"_stem":14893,"_extension":56,"locale":57},"\u002Fpublications\u002F2024\u002Fscenario-driven-metamorphic-testing-for-autonomous-driving-simulators","Scenario‐Driven Metamorphic Testing for Autonomous Driving Simulators","ABSTRACT The proliferation of driver‐assistance features in vehicles has resulted in a growing interest among the public in fully autonomous driving systems (ADSs). However, the integration of software and hardware in these complex systems presents significant testing challenges, particularly with respect to ensuring passenger safety. To address these challenges, simulation has emerged as a crucial step in the testing of ADSs. This paper presents a solution to the challenges faced in testing ADSs, with a focus on the validation of ADS simulators. The proposed approach involves using simulations and metamorphic testing (MT) to generate multiple concrete metamorphic relations (MRs) for testing ADS simulators. In order to accomplish this goal, we introduce three metamorphic relation patterns (MRPs). Each MRP is accompanied by a metamorphic relation input pattern (MRIP) that aids in generating detailed MRs. These MRs are designed to identify potential issues within the ADS simulator. To simplify the testing process and facilitate MT for testers, a self‐evolving scenario‐testing framework is also presented. The framework allows testers to improve test cases and MRs iteratively until issues detected are confirmed. The benefits and limitations of the framework are demonstrated using an industry case study. Overall, this study offers a practical solution to the challenges in testing ADSs and provides useful insights into improving testing efficiency for researchers and practitioners in the field.",[8041,595,5407,7697,1156,11958,11959,11960],[8045,599,5411,21,1158,21,11962,14879],"0000-0001-7423-617X","https:\u002F\u002Fdoi.org\u002F10.1002\u002Fstvr.1892","W4400966026",[4965,23,135,139,3228,984,5211,179,181],{"type":39,"children":14884,"toc":14889},[14885],{"type":42,"tag":43,"props":14886,"children":14887},{},[14888],{"type":47,"value":14876},{"title":8,"searchDepth":49,"depth":49,"links":14890},[],"content:publications:2024:scenario-driven-metamorphic-testing-for-autonomous-driving-simulators.md","publications\u002F2024\u002Fscenario-driven-metamorphic-testing-for-autonomous-driving-simulators.md","publications\u002F2024\u002Fscenario-driven-metamorphic-testing-for-autonomous-driving-simulators",{"_path":14895,"_dir":12825,"_draft":7,"_partial":7,"_locale":8,"title":14896,"description":14897,"_hidden":7,"Testing applied to source and follow-up input domains\" authors":14898,"authors_orcid":14899,"year":12829,"doi":14900,"openalex_id":14901,"venue":9881,"abstract_screenshot":21,"keywords":14902,"body":14903,"_type":51,"_id":14911,"_source":53,"_file":14912,"_stem":14913,"_extension":56,"locale":57},"\u002Fpublications\u002F2024\u002Fsfidmt-art-a-metamorphic-group-generation-method-based-on-adaptive-random-testin","SFIDMT-ART: A metamorphic group generation method based on Adaptive Rando","The performance of metamorphic testing relates strongly to the quality of test cases. However, most related research has only focused on source test cases, ignoring follow-up test cases to some extent. In this paper, we identify a potential problem that may be encountered with existing metamorphic group generation algorithms. We then propose a possible solution to address this problem. Based on this solution, we design a new algorithm for generating effective source and follow-up test cases. To improve the performance (test effectiveness and efficiency) of metamorphic testing. We introduce the concept of the input-domain difference problem, which is likely to affect the performance of metamorphic group generation algorithms. We propose a new test-case distribution criterion for metamorphic testing to address this problem. Based on our proposed criterion, we further present a new metamorphic group generation algorithm, from a black-box perspective, with new distance metrics to facilitate this algorithm. Our algorithm performs significantly better than existing algorithms, in terms of test effectiveness, efficiency and test-case diversity. Through experiments, we find that the input-domain difference problem is likely to affect the performance of metamorphic group generation algorithms. The experimental results demonstrate that our algorithm can achieve good test efficiency, effectiveness, and test-case diversity.",[8040,595,4189,596,1156],[8044,599,4191,600,1158],"https:\u002F\u002Fdoi.org\u002F10.1016\u002Fj.infsof.2024.107528","W4400768472",[332,23,659,1167,14523,37,34],{"type":39,"children":14904,"toc":14909},[14905],{"type":42,"tag":43,"props":14906,"children":14907},{},[14908],{"type":47,"value":14897},{"title":8,"searchDepth":49,"depth":49,"links":14910},[],"content:publications:2024:sfidmt-art-a-metamorphic-group-generation-method-based-on-adaptive-random-testin.md","publications\u002F2024\u002Fsfidmt-art-a-metamorphic-group-generation-method-based-on-adaptive-random-testin.md","publications\u002F2024\u002Fsfidmt-art-a-metamorphic-group-generation-method-based-on-adaptive-random-testin",{"_path":14915,"_dir":12825,"_draft":7,"_partial":7,"_locale":8,"title":14916,"description":8,"_hidden":7,"Ultrasound Image Segmentation\" authors":14917,"authors_orcid":14922,"year":12829,"doi":14928,"openalex_id":14929,"venue":21,"abstract_screenshot":21,"keywords":14930,"body":14931,"_type":51,"_id":14935,"_source":53,"_file":14936,"_stem":14937,"_extension":56,"locale":57},"\u002Fpublications\u002F2024\u002Fsgf-sca-a-spatial-gated-framework-with-shared-channel-attention-for-breast-ultra","SGF-SCA: A Spatial Gated Framework with Shared Channel Attention for Breas",[14918,13450,14919,14920,14921,8931],"Xu, Tianyu","Song, Zixiang","Xu, Yipeng","Wu, Yuzhe",[14923,14924,14925,14926,14927,8937],"0009-0005-2341-7508","0000-0002-6908-3591","0009-0002-1347-5200","0000-0001-6445-7470","0009-0003-5481-7761","https:\u002F\u002Fdoi.org\u002F10.1145\u002F3708568.3708579","W4408023879",[23,9090,4391,11495,37,8734,288],{"type":39,"children":14932,"toc":14933},[],{"title":8,"searchDepth":49,"depth":49,"links":14934},[],"content:publications:2024:sgf-sca-a-spatial-gated-framework-with-shared-channel-attention-for-breast-ultra.md","publications\u002F2024\u002Fsgf-sca-a-spatial-gated-framework-with-shared-channel-attention-for-breast-ultra.md","publications\u002F2024\u002Fsgf-sca-a-spatial-gated-framework-with-shared-channel-attention-for-breast-ultra",{"_path":14939,"_dir":12825,"_draft":7,"_partial":7,"_locale":8,"title":14940,"description":14941,"_hidden":7,"authors":14942,"authors_orcid":14943,"year":12829,"doi":14946,"openalex_id":14947,"venue":21,"abstract_screenshot":21,"keywords":14948,"body":14950,"_type":51,"_id":14958,"_source":53,"_file":14959,"_stem":14960,"_extension":56,"locale":57},"\u002Fpublications\u002F2024\u002Fsize-insensitive-network-for-visible-infrared-image-fusion-model","Size-Insensitive Network for Visible-Infrared Image Fusion Model","Visible-infrared image fusion is a technique that extracts information from different sensors. It could be used to enhance human visual perception of video surveillance under low-light conditions, and provide rich information for subsequent tasks. Vision Transformer (ViT) based fusion algorithms require standardizing input images to a specific height and width that could be divided into a series of blocks of fixed size. Consequently, a scaling operation must be performed on the original image, which frequently decreases the quality of fusion results. This paper proposes a visible-infrared image fusion neural network that is insensitive to input size, by first utilizing a fixed-size image pre-fusion framework to generate lossless instructive fusion results (IFRs), followed by a size-insensitive enhancing framework that refines these preliminary fused images under the guidance of IFRs. It also has potential applicability to other image fusion algorithms, like multi-focus image fusion.",[8210,10031,595],[14944,14945,599],"0000-0002-6706-0257","0000-0003-3041-643X","https:\u002F\u002Fdoi.org\u002F10.1109\u002Fcompsac61105.2024.00220","W4401879705",[14949,23,12319,9189,4391,4004,37,8731,3597],"Infrared",{"type":39,"children":14951,"toc":14956},[14952],{"type":42,"tag":43,"props":14953,"children":14954},{},[14955],{"type":47,"value":14941},{"title":8,"searchDepth":49,"depth":49,"links":14957},[],"content:publications:2024:size-insensitive-network-for-visible-infrared-image-fusion-model.md","publications\u002F2024\u002Fsize-insensitive-network-for-visible-infrared-image-fusion-model.md","publications\u002F2024\u002Fsize-insensitive-network-for-visible-infrared-image-fusion-model",{"_path":14962,"_dir":12825,"_draft":7,"_partial":7,"_locale":8,"title":14963,"description":8,"_hidden":7,"authors":14964,"authors_orcid":14965,"year":12829,"doi":14966,"openalex_id":14967,"venue":687,"abstract_screenshot":21,"keywords":14968,"body":14969,"_type":51,"_id":14973,"_source":53,"_file":14974,"_stem":14975,"_extension":56,"locale":57},"\u002Fpublications\u002F2024\u002Fsmart-iot-based-wearable-lower-limb-rehabilitation-assistance-system","Smart IoT-Based Wearable Lower-Limb Rehabilitation Assistance System",[11550,5667,13001,8463,5665],[11552,5670,21,8466,5669],"https:\u002F\u002Fdoi.org\u002F10.1007\u002F978-3-031-53830-8_24","W4392250111",[23,6973,6299,13007,868,4242,9693,380,13008],{"type":39,"children":14970,"toc":14971},[],{"title":8,"searchDepth":49,"depth":49,"links":14972},[],"content:publications:2024:smart-iot-based-wearable-lower-limb-rehabilitation-assistance-system.md","publications\u002F2024\u002Fsmart-iot-based-wearable-lower-limb-rehabilitation-assistance-system.md","publications\u002F2024\u002Fsmart-iot-based-wearable-lower-limb-rehabilitation-assistance-system",{"_path":14977,"_dir":12825,"_draft":7,"_partial":7,"_locale":8,"title":14978,"description":14979,"_hidden":7,"Cerebrovascular Segmentation\" authors":14980,"authors_orcid":14981,"year":12829,"doi":14982,"openalex_id":14983,"venue":21,"abstract_screenshot":21,"keywords":14984,"body":14985,"_type":51,"_id":14993,"_source":53,"_file":14994,"_stem":14995,"_extension":56,"locale":57},"\u002Fpublications\u002F2024\u002Fss-fs-csa-self-supervised-and-fully-supervised-integration-for-3d-cerebrovascula","SS-FS CSA: Self-Supervised and Fully Supervised Integration for 3","Three-dimensional cerebrovascular segmentation is crucial for accurate diagnosis and treatment planning of cerebrovascular diseases.However, the lack of high-quality publicly labelled datasets can limit sufficient training, leading to inaccurate results.To address this issue, this study proposes a novel method that combines self-supervised and fully supervised learning, termed the SS-FS Cerebrovascular Segmentation Approach (SS-FS CSA).The method introduces publicly available unlabelled databases into the training process, alleviating the problem of insufficient high-quality labelled medical datasets.The SS-FS CSA method achieves a Dice Similarity Coefficient (DSC) of 82.82%, improving over 2% compared to the SOTA baseline, proving its validity and feasibility in 3D segmentation tasks.",[13448,14340,8931],[21,14342,8937],"https:\u002F\u002Fdoi.org\u002F10.1145\u002F3696409.3700291","W4405867860",[23,9090,37,4876],{"type":39,"children":14986,"toc":14991},[14987],{"type":42,"tag":43,"props":14988,"children":14989},{},[14990],{"type":47,"value":14979},{"title":8,"searchDepth":49,"depth":49,"links":14992},[],"content:publications:2024:ss-fs-csa-self-supervised-and-fully-supervised-integration-for-3d-cerebrovascula.md","publications\u002F2024\u002Fss-fs-csa-self-supervised-and-fully-supervised-integration-for-3d-cerebrovascula.md","publications\u002F2024\u002Fss-fs-csa-self-supervised-and-fully-supervised-integration-for-3d-cerebrovascula",{"_path":14997,"_dir":12825,"_draft":7,"_partial":7,"_locale":8,"title":14998,"description":8,"_hidden":7,"authors":14999,"authors_orcid":15002,"year":12829,"doi":15006,"openalex_id":15007,"venue":687,"abstract_screenshot":21,"keywords":15008,"body":15009,"_type":51,"_id":15013,"_source":53,"_file":15014,"_stem":15015,"_extension":56,"locale":57},"\u002Fpublications\u002F2024\u002Ftask-oriented-image-quality-assessment-for-synthesized-images","Task Oriented Image Quality Assessment for Synthesized Images",[15000,10031,15001,10028,5667],"Xu, Kexiang","Yang, Fei",[15003,15004,15005,10033,5670],"0000-0002-9376-5226","0000-0002-1057-7909","0000-0002-1510-0675","https:\u002F\u002Fdoi.org\u002F10.1007\u002F978-3-031-78389-0_10","W4404995133",[23,529,12385,4391,37,4004,747,6853,5211],{"type":39,"children":15010,"toc":15011},[],{"title":8,"searchDepth":49,"depth":49,"links":15012},[],"content:publications:2024:task-oriented-image-quality-assessment-for-synthesized-images.md","publications\u002F2024\u002Ftask-oriented-image-quality-assessment-for-synthesized-images.md","publications\u002F2024\u002Ftask-oriented-image-quality-assessment-for-synthesized-images",{"_path":15017,"_dir":12825,"_draft":7,"_partial":7,"_locale":8,"title":15018,"description":15019,"_hidden":7,"authors":15020,"authors_orcid":15025,"year":12829,"doi":15030,"openalex_id":15031,"venue":15032,"abstract_screenshot":21,"keywords":15033,"body":15035,"_type":51,"_id":15051,"_source":53,"_file":15052,"_stem":15053,"_extension":56,"locale":57},"\u002Fpublications\u002F2024\u002Ftfdet-target-aware-fusion-for-rgb-t-pedestrian-detection","TFDet: Target-Aware Fusion for RGB-T Pedestrian Detection","Pedestrian detection plays a critical role in computer vision as it contributes to ensuring traffic safety. Existing methods that rely solely on RGB images suffer from performance degradation under low-light conditions due to the lack of useful information. To address this issue, recent multispectral detection approaches have combined thermal images to provide complementary information and have obtained enhanced performances. Nevertheless, few approaches focus on the negative effects of false positives (FPs) caused by noisy fused feature maps. Different from them, we comprehensively analyze the impacts of FPs on detection performance and find that enhancing feature contrast can significantly reduce these FPs. In this article, we propose a novel target-aware fusion strategy for multispectral pedestrian detection, named TFDet. The target-aware fusion strategy employs a fusion-refinement paradigm. In the fusion phase, we reveal the parallel- and cross-channel similarities in RGB and thermal features and learn an adaptive receptive field to collect useful information from both features. In the refinement phase, we use a segmentation branch to discriminate the pedestrian features from the background features. We propose a correlation-maximum loss function to enhance the contrast between the pedestrian features and background features. As a result, our fusion strategy highlights pedestrian-related features and suppresses unrelated ones, generating more discriminative fused features. TFDet achieves state-of-the-art performance on two multispectral pedestrian benchmarks, KAIST and LLVIP, with absolute gains of 0.65% and 4.1% over the previous best approaches, respectively. TFDet can easily extend to multiclass object detection scenarios. It outperforms the previous best approaches on two multispectral object detection benchmarks, FLIR and M3FD, with absolute gains of 2.2% and 1.9%, respectively. Importantly, TFDet has comparable inference efficiency to the previous approaches and has remarkably good detection performance even under low-light conditions, which is a significant advancement for ensuring road safety. The code will be made publicly available at https:\u002F\u002Fgithub.com\u002FXueZ-phd\u002FTFDet.git.",[15021,15022,15023,12301,12303,5532,15024,12306],"Zhang, Xue","Zhang, Xiaohan","Wang, Jiangtao","Li, Chunguang",[15026,15027,15028,12308,12310,5537,15029,12313],"0000-0002-7247-3670","0000-0002-1420-1909","0009-0009-5062-6793","0000-0003-3147-1553","https:\u002F\u002Fdoi.org\u002F10.1109\u002Ftnnls.2024.3443455","W4401806723","IEEE Transactions on Neural Networks and Learning Systems",[15034,11735,37,4391,23,9189,7754,4876,179,454],"Pedestrian detection",{"type":39,"children":15036,"toc":15049},[15037],{"type":42,"tag":43,"props":15038,"children":15039},{},[15040,15042,15048],{"type":47,"value":15041},"Pedestrian detection plays a critical role in computer vision as it contributes to ensuring traffic safety. Existing methods that rely solely on RGB images suffer from performance degradation under low-light conditions due to the lack of useful information. To address this issue, recent multispectral detection approaches have combined thermal images to provide complementary information and have obtained enhanced performances. Nevertheless, few approaches focus on the negative effects of false positives (FPs) caused by noisy fused feature maps. Different from them, we comprehensively analyze the impacts of FPs on detection performance and find that enhancing feature contrast can significantly reduce these FPs. In this article, we propose a novel target-aware fusion strategy for multispectral pedestrian detection, named TFDet. The target-aware fusion strategy employs a fusion-refinement paradigm. In the fusion phase, we reveal the parallel- and cross-channel similarities in RGB and thermal features and learn an adaptive receptive field to collect useful information from both features. In the refinement phase, we use a segmentation branch to discriminate the pedestrian features from the background features. We propose a correlation-maximum loss function to enhance the contrast between the pedestrian features and background features. As a result, our fusion strategy highlights pedestrian-related features and suppresses unrelated ones, generating more discriminative fused features. TFDet achieves state-of-the-art performance on two multispectral pedestrian benchmarks, KAIST and LLVIP, with absolute gains of 0.65% and 4.1% over the previous best approaches, respectively. TFDet can easily extend to multiclass object detection scenarios. It outperforms the previous best approaches on two multispectral object detection benchmarks, FLIR and M3FD, with absolute gains of 2.2% and 1.9%, respectively. Importantly, TFDet has comparable inference efficiency to the previous approaches and has remarkably good detection performance even under low-light conditions, which is a significant advancement for ensuring road safety. The code will be made publicly available at ",{"type":42,"tag":1574,"props":15043,"children":15046},{"href":15044,"rel":15045},"https:\u002F\u002Fgithub.com\u002FXueZ-phd\u002FTFDet.git",[4520],[15047],{"type":47,"value":15044},{"type":47,"value":1645},{"title":8,"searchDepth":49,"depth":49,"links":15050},[],"content:publications:2024:tfdet-target-aware-fusion-for-rgb-t-pedestrian-detection.md","publications\u002F2024\u002Ftfdet-target-aware-fusion-for-rgb-t-pedestrian-detection.md","publications\u002F2024\u002Ftfdet-target-aware-fusion-for-rgb-t-pedestrian-detection",{"_path":15055,"_dir":12825,"_draft":7,"_partial":7,"_locale":8,"title":15056,"description":15057,"_hidden":7,"authors":15058,"authors_orcid":15061,"year":12829,"doi":15065,"openalex_id":15066,"venue":21,"abstract_screenshot":21,"keywords":15067,"body":15068,"_type":51,"_id":15076,"_source":53,"_file":15077,"_stem":15078,"_extension":56,"locale":57},"\u002Fpublications\u002F2024\u002Fthe-audience-effect-do-observations-change-outcomes-in-hci-studies","The Audience Effect: Do Observations Change Outcomes in HCI Studies?","Observational studies are widely used in Human-Computer Interaction (HCI) research to evaluate usability and user experience with technologies. However, the act of observation may influence participant behaviour and performance, threatening the validity of study findings. This paper investigates the impact of three observation types on participant outcomes in a simulated HCI study context. Participants completed Sudoku puzzles under baseline (no observation), human observation, sensor-based observation, and combined human\u002Fsensor conditions. Performance was assessed by puzzle completion rates. The mental workload was measured via NASA-TLX surveys, heart rate, galvanic skin response, and infrared thermal imaging. Results showed observations negatively impacted performance versus baseline, with human observers inducing the greatest distraction. Experienced participants were more influenced than novices. Task medium also affected engagement and observation reactivity. Findings demonstrate observations introduce bias in HCI research, emphasising careful consideration of observation methods to improve result validity.",[11525,5667,595,15059,10902,15060,5407],"Chen, Kaiyi","Zhang, Runzhou",[15062,5670,599,15063,10908,15064,5411],"0000-0003-4067-3237","0009-0004-0699-2124","0000-0003-1889-7955","https:\u002F\u002Fdoi.org\u002F10.1109\u002Fcompsac61105.2024.00088","W4401880568",[23,868,867],{"type":39,"children":15069,"toc":15074},[15070],{"type":42,"tag":43,"props":15071,"children":15072},{},[15073],{"type":47,"value":15057},{"title":8,"searchDepth":49,"depth":49,"links":15075},[],"content:publications:2024:the-audience-effect-do-observations-change-outcomes-in-hci-studies.md","publications\u002F2024\u002Fthe-audience-effect-do-observations-change-outcomes-in-hci-studies.md","publications\u002F2024\u002Fthe-audience-effect-do-observations-change-outcomes-in-hci-studies",{"_path":15080,"_dir":12825,"_draft":7,"_partial":7,"_locale":8,"title":15081,"description":15082,"_hidden":7,"Workload and Situational Awareness":15083,"authors":15084,"authors_orcid":15085,"year":12829,"doi":15086,"openalex_id":15087,"venue":3384,"abstract_screenshot":21,"keywords":15088,"body":15092,"_type":51,"_id":15100,"_source":53,"_file":15101,"_stem":15102,"_extension":56,"locale":57},"\u002Fpublications\u002F2024\u002Fthe-impact-of-various-cockpit-display-interfaces-on-novice-pilots-mental-workloa","The Impact of Various Cockpit Display Interfaces on Novice Pilots’ Menta","Future airspace is expected to become more congested with additional in-service cargo and commercial flights. Pilots will face additional burdens in such an environment, given the increasing number of factors that they must simultaneously consider while completing their work activities. Therefore, care and attention must be paid to the mental workload (MWL) experienced by operating pilots. If left unaddressed, a state of mental overload could affect the pilot's ability to complete his or her work activities in a safe and correct manner. This study examines the impact of two different cockpit display interfaces (CDIs), the Steam Gauge panel and the G1000 Glass panel, on novice pilots' MWL and situational awareness (SA) in a flight simulator-based setting. A combination of objective (EEG and HRV) and subjective (NASA-TLX) assessments is used to assess novice pilots' cognitive states during this study. Our results indicate that the gauge design of the CDI affects novice pilots' SA and MWL, with the G1000 Glass panel being more effective in reducing the MWL and improving SA compared with the Steam Gauge panel. The results of this study have implications for the design of future flight deck interfaces and the training of future pilots.","A Comparative Study\"",[11525,5667,595,5407],[15062,5670,599,5411],"https:\u002F\u002Fdoi.org\u002F10.3390\u002Fs24092835","W4396218768",[15089,15090,9150,15091,8473,28,4267,179,984,23,865],"Cockpit","Situation awareness","Crew",{"type":39,"children":15093,"toc":15098},[15094],{"type":42,"tag":43,"props":15095,"children":15096},{},[15097],{"type":47,"value":15082},{"title":8,"searchDepth":49,"depth":49,"links":15099},[],"content:publications:2024:the-impact-of-various-cockpit-display-interfaces-on-novice-pilots-mental-workloa.md","publications\u002F2024\u002Fthe-impact-of-various-cockpit-display-interfaces-on-novice-pilots-mental-workloa.md","publications\u002F2024\u002Fthe-impact-of-various-cockpit-display-interfaces-on-novice-pilots-mental-workloa",{"_path":15104,"_dir":12825,"_draft":7,"_partial":7,"_locale":8,"title":15105,"description":15106,"_hidden":7,"directions\" authors":15107,"authors_orcid":15109,"year":12829,"doi":15110,"openalex_id":15111,"venue":14218,"abstract_screenshot":21,"keywords":15112,"body":15115,"_type":51,"_id":15123,"_source":53,"_file":15124,"_stem":15125,"_extension":56,"locale":57},"\u002Fpublications\u002F2024\u002Fthe-iot-ecosystem-in-ningbo-china-current-status-challenges-and-future-direction","The IoT ecosystem in Ningbo, China: current status, challenges, and futur","This paper briefly summarizes the current development status of the IoT ecosystem in Ningbo, China, overviews the challenges and difficulties faced by the IoT industry in the city, and predicts its future development directions. This paper articulates Ningbo’s efforts and dedication in forming industrial clusters, aligning with its “361” trillion-level industrial cluster development strategy, to create a major centre for intelligent manufacturing innovation. Future mainstream technologies such as edge computing, artificial intelligence, and blockchain are expected to thrive in the city, and IoT applications in fields like digital twins, the metaverse, and healthcare will also flourish.",[15108,5532],"Wang, Steven Peng",[21,5537],"https:\u002F\u002Fdoi.org\u002F10.1049\u002Ficp.2024.3954","W4405241700",[15113,6299,282,15114,3262,178,289,23,926,3526,179,180,4608,928,3547],"Current (fluid)","Ecosystem",{"type":39,"children":15116,"toc":15121},[15117],{"type":42,"tag":43,"props":15118,"children":15119},{},[15120],{"type":47,"value":15106},{"title":8,"searchDepth":49,"depth":49,"links":15122},[],"content:publications:2024:the-iot-ecosystem-in-ningbo-china-current-status-challenges-and-future-direction.md","publications\u002F2024\u002Fthe-iot-ecosystem-in-ningbo-china-current-status-challenges-and-future-direction.md","publications\u002F2024\u002Fthe-iot-ecosystem-in-ningbo-china-current-status-challenges-and-future-direction",{"_path":15127,"_dir":12825,"_draft":7,"_partial":7,"_locale":8,"title":15128,"description":15129,"_hidden":7,"Investment and Firms’ Access to Trade Credit\" authors":15130,"authors_orcid":15132,"year":12829,"doi":15135,"openalex_id":15136,"venue":15137,"abstract_screenshot":21,"keywords":15138,"body":15139,"_type":51,"_id":15147,"_source":53,"_file":15148,"_stem":15149,"_extension":56,"locale":57},"\u002Fpublications\u002F2024\u002Fthe-value-of-being-greener-untangling-the-relationship-between-environmental-inv","The Value of Being Greener: Untangling the Relationship between Environmenta","Abstract This study investigates the relationship between corporate environmental performance, as captured by environmental investment, and firms’ access to trade credit. Using data from Chinese listed firms in heavy pollution industries, we find that corporate environmental performance significantly increases firms’ access to trade credit. The positive effect of environmental investment appears more pronounced for firms with stronger internal incentives to conduct eco‐friendly practices, lower external regulatory pressure and located in regions with higher economic growth rates. Two factors – namely, increased information transparency and reduced exposure to environmental risk – are found to be channels through which environmental investment affects trade credit. This paper provides a nuanced understanding of how a supplier as a stakeholder plays a significant role in financing environmental sustainability. The results are robust to alternative proxies, model specifications, sample compositions and endogeneity concerns.",[10359,268,1287,11700,15131],"Du, Anna Min",[10361,272,1291,15133,15134],"0009-0005-0832-4426","0000-0002-1715-8774","https:\u002F\u002Fdoi.org\u002F10.1111\u002F1467-8551.12883","W4404869746","British Journal of Management",[1441,1438,178,36,9342,1358,34,5153,3666],{"type":39,"children":15140,"toc":15145},[15141],{"type":42,"tag":43,"props":15142,"children":15143},{},[15144],{"type":47,"value":15129},{"title":8,"searchDepth":49,"depth":49,"links":15146},[],"content:publications:2024:the-value-of-being-greener-untangling-the-relationship-between-environmental-inv.md","publications\u002F2024\u002Fthe-value-of-being-greener-untangling-the-relationship-between-environmental-inv.md","publications\u002F2024\u002Fthe-value-of-being-greener-untangling-the-relationship-between-environmental-inv",{"_path":15151,"_dir":12825,"_draft":7,"_partial":7,"_locale":8,"title":15152,"description":15153,"_hidden":7,"Molecular Properties in Drug Discovery authors":15154,"authors_orcid":15158,"year":12829,"doi":15161,"openalex_id":15162,"venue":21,"abstract_screenshot":21,"keywords":15163,"body":15166,"_type":51,"_id":15174,"_source":53,"_file":15175,"_stem":15176,"_extension":56,"locale":57},"\u002Fpublications\u002F2024\u002Fthree-branch-molecular-representation-learning-framework-for-predicting-molecula","Three-Branch Molecular Representation Learning Framework for Predicting","Graph Neural Networks (GNNs) have been widely used to model molecules with a graph representation. However, GNNs face inherent challenges in accurately modeling long-range atomic interactions and identifying complex molecular substructures. This research proposes a novel Three-branch Molecular Representation Learning Framework (TMRLF) for predicting molecular properties: it integrates one branch of a GNN that extracts local molecular structural information with two branches of fully connected networks that capture the chemical substructure based on two fingerprints. Specifically, to better capture the long-range interactions, the GNN is designed with an attention mechanism to enhance the atomic interactions. As the Morgan fingerprint effectively captures functional groups of molecules and another well-used molecular fingerprint in the field of drug discovery, the Extended Reduced Graph (ErG) Fingerprint specifically targets molecular features with pharmacological relevance. These two fingerprints are both utilized to complement the chemical information and long-range information processing at the level of key structural features that GNNs lack. The proposed TMRLF extracts a robust feature representation of molecules, crucial for accurately predicting molecular properties and identifying potential drug candidates. Our proposed TMRLF is compared against six state-of-the-art models on eight benchmark datasets. It demonstrates superior capability in predicting molecular properties. Its effectiveness is further highlighted through proof-of-concept validation in identifying potential inhibitors for the Son of Sevenless Homolog 1 (SOSI) protein in real-world drug discovery scenarios.",[15155,15156,7888,15157,7887,595],"Liu, Yu","Duo, Lihui","Rent, Jianfeng",[15159,15160,7894,21,7893,599],"0009-0002-5231-7360","0000-0001-7453-9330","https:\u002F\u002Fdoi.org\u002F10.1109\u002Fcompsac61105.2024.00317","W4401879069",[7902,23,99,15164,37,215,691,8330,380,15165,4608],"Drug","Pharmacology",{"type":39,"children":15167,"toc":15172},[15168],{"type":42,"tag":43,"props":15169,"children":15170},{},[15171],{"type":47,"value":15153},{"title":8,"searchDepth":49,"depth":49,"links":15173},[],"content:publications:2024:three-branch-molecular-representation-learning-framework-for-predicting-molecula.md","publications\u002F2024\u002Fthree-branch-molecular-representation-learning-framework-for-predicting-molecula.md","publications\u002F2024\u002Fthree-branch-molecular-representation-learning-framework-for-predicting-molecula",{"_path":15178,"_dir":12825,"_draft":7,"_partial":7,"_locale":8,"title":15179,"description":8,"_hidden":7,"Approach\" authors":15180,"authors_orcid":15181,"year":12829,"doi":15182,"openalex_id":15183,"venue":603,"abstract_screenshot":21,"keywords":15184,"body":15185,"_type":51,"_id":15229,"_source":53,"_file":15230,"_stem":15231,"_extension":56,"locale":57},"\u002Fpublications\u002F2024\u002Ftoward-cost-effective-adaptive-random-testing-an-approximate-nearest-neighbor-ap","Toward Cost-Effective Adaptive Random Testing: An Approximate Nearest Neighbo",[645,6820,10404,595,5049,5250],[650,6822,10406,599,5051,6434],"https:\u002F\u002Fdoi.org\u002F10.1109\u002Ftse.2024.3379592","W4393058040",[23,9735,332,181,102,37],{"type":39,"children":15186,"toc":15227},[15187],{"type":42,"tag":9671,"props":15188,"children":15189},{"xmlns:mml":1465,"xmlnsXLink":8791},[15190,15192],{"type":47,"value":15191},"\nAdaptive Random Testing\n\n (ART) enhances the testing effectiveness (including fault-detection capability) of \n",{"type":42,"tag":9671,"props":15193,"children":15194},{"xmlns:mml":1465,"xmlnsXLink":8791},[15195,15197],{"type":47,"value":15196},"\nRandom Testing\n\n (RT) by increasing the diversity of the random test cases throughout the input domain. Many ART algorithms have been investigated such as \n",{"type":42,"tag":9671,"props":15198,"children":15199},{"xmlns:mml":1465,"xmlnsXLink":8791},[15200,15202],{"type":47,"value":15201},"\nFixed-Size-Candidate-Set ART\n\n (FSCS) and \n",{"type":42,"tag":9671,"props":15203,"children":15204},{"xmlns:mml":1465,"xmlnsXLink":8791},[15205,15207],{"type":47,"value":15206},"\nRestricted Random Testing\n\n (RRT), and have been widely used in many practical applications. Despite its popularity, ART suffers from the problem of high computational costs during test-case generation, especially as the number of test cases increases. Although several strategies have been proposed to enhance the ART testing efficiency, such as the \n",{"type":42,"tag":9671,"props":15208,"children":15209},{"xmlns:mml":1465,"xmlnsXLink":8791},[15210,15212],{"type":47,"value":15211},"\nforgetting strategy\n\n and the \n",{"type":42,"tag":9671,"props":15213,"children":15214},{"xmlns:mml":1465,"xmlnsXLink":8791},[15215,15217],{"type":47,"value":15216},"\nk-dimensional tree strategy\n\n , these algorithms still face some challenges, including: (1) Although these algorithms can reduce the computation time, their execution costs are still very high, especially when the number of test cases is large; and (2) To achieve low computational costs, they may sacrifice some fault-detection capability. In this paper, we propose an approach based on \n",{"type":42,"tag":9671,"props":15218,"children":15219},{"xmlns:mml":1465,"xmlnsXLink":8791},[15220,15222],{"type":47,"value":15221},"\nApproximate Nearest Neighbors\n\n (ANNs), called \n",{"type":42,"tag":9671,"props":15223,"children":15224},{"xmlns:mml":1465,"xmlnsXLink":8791},[15225],{"type":47,"value":15226},"\nLocality-Sensitive Hashing ART\n\n (LSH-ART). When calculating distances among different test inputs, LSH-ART identifies the approximate (not necessarily exact) nearest neighbors for candidates in an efficient way. LSH-ART attempts to balance ART testing effectiveness and efficiency.",{"title":8,"searchDepth":49,"depth":49,"links":15228},[],"content:publications:2024:toward-cost-effective-adaptive-random-testing-an-approximate-nearest-neighbor-ap.md","publications\u002F2024\u002Ftoward-cost-effective-adaptive-random-testing-an-approximate-nearest-neighbor-ap.md","publications\u002F2024\u002Ftoward-cost-effective-adaptive-random-testing-an-approximate-nearest-neighbor-ap",{"_path":15233,"_dir":12825,"_draft":7,"_partial":7,"_locale":8,"title":15234,"description":15235,"_hidden":7,"Transformation\" authors":15236,"authors_orcid":15239,"year":12829,"doi":15242,"openalex_id":15243,"venue":603,"abstract_screenshot":21,"keywords":15244,"body":15246,"_type":51,"_id":15254,"_source":53,"_file":15255,"_stem":15256,"_extension":56,"locale":57},"\u002Fpublications\u002F2024\u002Ftransformcode-a-contrastive-learning-framework-for-code-embedding-via-subtree-tr","TransformCode: A Contrastive Learning Framework for Code Embedding via Subtre","Artificial intelligence (AI) has revolutionized software engineering (SE) by enhancing software development efficiency. The advent of pre-trained models (PTMs) leveraging transfer learning has significantly advanced AI for SE. However, existing PTMs that operate on individual code tokens suffer from several limitations: They are costly to train and fine-tune; and they rely heavily on labeled data for fine-tuning on task-specific datasets.In this paper, we present TransformCode, a novel framework that learns code embeddings in a contrastive learning manner. Our framework is encoder-agnostic and language-agnostic, which means that it can leverage any encoder model and handle any programming language.We also propose a novel data-augmentation technique called abstract syntax tree (AST) transformation, which applies syntactic and semantic transformations to the original code snippets, to generate more diverse and robust samples for contrastive learning. Our framework has several advantages over existing methods: (1) It is flexible and adaptable, because it can easily be extended to other downstream tasks that require code representation (such as code-clone detection and classification); (2) it is efficient and scalable, because it does not require a large model or a large amount of training data, and it can support any programming language; (3) it is not limited to unsupervised learning, but can also be applied to some supervised learning tasks by incorporating task-specific labels or objectives; and (4) it can also adjust the number of encoder parameters based on computing resources. We evaluate our framework on several code-related tasks, and demonstrate its effectiveness and superiority over the state-of-the-art methods such as SourcererCC, Code2vec, and InferCode.",[10643,645,595,15237,15238],"Fang, Chunrong","Chen, Zhenyu",[10647,650,599,15240,15241],"0000-0002-9930-7111","0000-0002-9592-7022","https:\u002F\u002Fdoi.org\u002F10.1109\u002Ftse.2024.3393419","W4395470967",[23,110,4241,9955,1405,4240,102,15245,37,4479,607],"Program transformation",{"type":39,"children":15247,"toc":15252},[15248],{"type":42,"tag":43,"props":15249,"children":15250},{},[15251],{"type":47,"value":15235},{"title":8,"searchDepth":49,"depth":49,"links":15253},[],"content:publications:2024:transformcode-a-contrastive-learning-framework-for-code-embedding-via-subtree-tr.md","publications\u002F2024\u002Ftransformcode-a-contrastive-learning-framework-for-code-embedding-via-subtree-tr.md","publications\u002F2024\u002Ftransformcode-a-contrastive-learning-framework-for-code-embedding-via-subtree-tr",{"_path":15258,"_dir":12825,"_draft":7,"_partial":7,"_locale":8,"title":15259,"description":8,"_hidden":7,"authors":15260,"authors_orcid":15261,"year":12829,"doi":15262,"openalex_id":15263,"venue":4049,"abstract_screenshot":21,"keywords":15264,"body":15267,"_type":51,"_id":15271,"_source":53,"_file":15272,"_stem":15273,"_extension":56,"locale":57},"\u002Fpublications\u002F2024\u002Ftransformer-surrogate-genetic-programming-for-dynamic-container-port-truck-dispa","Transformer Surrogate Genetic Programming for Dynamic Container Port Truck Dispatching",[5989,11507,319,12],[5991,13026,322,15],"https:\u002F\u002Fdoi.org\u002F10.1007\u002F978-981-97-2272-3_21","W4394803842",[23,97,15265,14584,1189,15266,24,179,37,215,6633],"Surrogate model","Programming paradigm",{"type":39,"children":15268,"toc":15269},[],{"title":8,"searchDepth":49,"depth":49,"links":15270},[],"content:publications:2024:transformer-surrogate-genetic-programming-for-dynamic-container-port-truck-dispa.md","publications\u002F2024\u002Ftransformer-surrogate-genetic-programming-for-dynamic-container-port-truck-dispa.md","publications\u002F2024\u002Ftransformer-surrogate-genetic-programming-for-dynamic-container-port-truck-dispa",{"_path":15275,"_dir":12825,"_draft":7,"_partial":7,"_locale":8,"title":15276,"description":8,"_hidden":7,"objectives authors":15277,"authors_orcid":15281,"year":12829,"doi":15285,"openalex_id":15286,"venue":15287,"abstract_screenshot":21,"keywords":15288,"body":15291,"_type":51,"_id":15295,"_source":53,"_file":15296,"_stem":15297,"_extension":56,"locale":57},"\u002Fpublications\u002F2024\u002Ftwo-incentive-policies-for-green-shore-power-system-considering-multiple-objecti","Two incentive policies for green shore power system considering multiple",[15278,7302,15279,15280],"Zhong, Ziyi","Sun, Yuyao","Zhou, Yanjie",[15282,7310,15283,15284],"0000-0002-9044-9471","0000-0002-2162-6091","0000-0003-2222-9140","https:\u002F\u002Fdoi.org\u002F10.1016\u002Fj.cie.2024.110338","W4400345391","Computers & Industrial Engineering",[5472,10843,15289,3634,750,4855,1192,450,15290,178,24,179,3262,23,926,33,36],"Shore","Sustainable development",{"type":39,"children":15292,"toc":15293},[],{"title":8,"searchDepth":49,"depth":49,"links":15294},[],"content:publications:2024:two-incentive-policies-for-green-shore-power-system-considering-multiple-objecti.md","publications\u002F2024\u002Ftwo-incentive-policies-for-green-shore-power-system-considering-multiple-objecti.md","publications\u002F2024\u002Ftwo-incentive-policies-for-green-shore-power-system-considering-multiple-objecti",{"_path":15299,"_dir":12825,"_draft":7,"_partial":7,"_locale":8,"title":15300,"description":15301,"_hidden":7,"authors":15302,"authors_orcid":15303,"year":12829,"doi":15304,"openalex_id":15305,"venue":10505,"abstract_screenshot":21,"keywords":15306,"body":15309,"_type":51,"_id":15317,"_source":53,"_file":15318,"_stem":15319,"_extension":56,"locale":57},"\u002Fpublications\u002F2024\u002Ftwo-stage-rule-induction-visual-reasoning-on-rpms-with-an-application-to-video-p","Two-stage Rule-induction visual reasoning on RPMs with an application to video prediction","Raven’s Progressive Matrices (RPMs) are frequently used in evaluating human’s visual reasoning ability. Researchers have made considerable efforts in developing systems to automatically solve the RPM problem, often through a black-box end-to-end convolutional neural network for both visual recognition and logical reasoning tasks. Based on the intrinsic natures of RPM problem, we propose a Two-stage Rule-Induction Visual Reasoner (TRIVR), which consists of a perception module and a reasoning module, to tackle the challenges of real-world visual recognition and subsequent logical reasoning tasks, respectively. For the reasoning module, we further propose a “2+1” formulation that models human’s thinking in solving RPMs and significantly reduces the model complexity. It derives a reasoning rule from each RPM sample, which is not feasible for existing methods. As a result, the proposed reasoning module is capable of yielding a set of reasoning rules modeling human in solving the RPM problems. To validate the proposed method on real-world applications, an RPM-like Video Prediction (RVP) dataset is constructed, where visual reasoning is conducted on RPMs constructed using real-world video frames. Experimental results on various RPM-like datasets demonstrate that the proposed TRIVR achieves a significant and consistent performance gain compared with state-of-the-art models. • A two-stage rule-induction visual reasoner is proposed to solve RPMs. • The proposed method generates one reasoning rule for each sample question. • The proposed method yields reasoning rules modeling human in solving RPMs. • A real-world RPM-like video prediction dataset is developed for evaluation.",[7409,6111,12,9048],[7415,6113,15,9051],"https:\u002F\u002Fdoi.org\u002F10.1016\u002Fj.patcog.2024.111151","W4404171653",[15307,23,15308,37,215,4876],"Stage (stratigraphy)","Rule induction",{"type":39,"children":15310,"toc":15315},[15311],{"type":42,"tag":43,"props":15312,"children":15313},{},[15314],{"type":47,"value":15301},{"title":8,"searchDepth":49,"depth":49,"links":15316},[],"content:publications:2024:two-stage-rule-induction-visual-reasoning-on-rpms-with-an-application-to-video-p.md","publications\u002F2024\u002Ftwo-stage-rule-induction-visual-reasoning-on-rpms-with-an-application-to-video-p.md","publications\u002F2024\u002Ftwo-stage-rule-induction-visual-reasoning-on-rpms-with-an-application-to-video-p",{"_path":15321,"_dir":12825,"_draft":7,"_partial":7,"_locale":8,"title":15322,"description":15323,"_hidden":7,"Research Directions authors":15324,"authors_orcid":15331,"year":12829,"doi":15338,"openalex_id":15339,"venue":4963,"abstract_screenshot":21,"keywords":15340,"body":15341,"_type":51,"_id":15349,"_source":53,"_file":15350,"_stem":15351,"_extension":56,"locale":57},"\u002Fpublications\u002F2024\u002Fuav-assisted-iot-applications-qos-requirements-and-challenges-with-future-resear","UAV-Assisted IoT Applications, QoS Requirements and Challenges with Future","Unmanned Aerial Vehicle (UAV)-assisted Internet of Things application communication is an emerging concept that effectuates the foreknowledge of innovative technologies. With the accelerated advancements in IoT applications, the importance of this technology became more impactful and persistent. Moreover, this technology has demonstrated useful contributions across various domains, ranging from general to specific applications. Examples include wildfire monitoring, coastal area monitoring, deforestation monitoring, and sensitive military operations, where human access is limited or not feasible. These examples underscore the technology’s importance in scenarios where direct human involvement is challenging or impossible. Although this technology offers numerous benefits, it is essential to note that it also faces several challenges. Among these, Quality of Service (QoS) is a key concern, which limits its useability in various applications. Unfortunately, most researchers in the present literature have overlooked this important factor without giving it considerable attention. To fill this gap, we are presenting a systematic review of the present literature associated with the QoS metrics of this emerging technology from 2015 to 2023 to highlight their contributions and limitations. Based on the systematic review, we highlight the open challenges of this technology to set a roadmap for futuristic research. Finally, we compared each portion of this work with the previously published review articles to confirm the essence of this work, along with an explanation of why this survey is needed and in-time.",[15325,15326,15327,15328,8931,15329,15330],"Adil, Muhammad","Song, Houbing","Jan, Mian Ahmad","Khan, Muhammad Khurram","Farouk, Ahmed","Jin, Zhanpeng",[15332,15333,15334,15335,8937,15336,15337],"0000-0003-4494-8576","0000-0003-2631-9223","0000-0002-5298-1328","0000-0001-6636-0533","0000-0001-8702-7342","0000-0002-3020-3736","https:\u002F\u002Fdoi.org\u002F10.1145\u002F3657287","W4394678608",[23,6299,3121,5548,249,607,4242,251],{"type":39,"children":15342,"toc":15347},[15343],{"type":42,"tag":43,"props":15344,"children":15345},{},[15346],{"type":47,"value":15323},{"title":8,"searchDepth":49,"depth":49,"links":15348},[],"content:publications:2024:uav-assisted-iot-applications-qos-requirements-and-challenges-with-future-resear.md","publications\u002F2024\u002Fuav-assisted-iot-applications-qos-requirements-and-challenges-with-future-resear.md","publications\u002F2024\u002Fuav-assisted-iot-applications-qos-requirements-and-challenges-with-future-resear",{"_path":15353,"_dir":12825,"_draft":7,"_partial":7,"_locale":8,"title":15354,"description":15355,"_hidden":7,"Approach\" authors":15356,"authors_orcid":15357,"year":12829,"doi":15358,"openalex_id":15359,"venue":21,"abstract_screenshot":21,"keywords":15360,"body":15361,"_type":51,"_id":15369,"_source":53,"_file":15370,"_stem":15371,"_extension":56,"locale":57},"\u002Fpublications\u002F2024\u002Funcovering-the-metaverse-within-everyday-environments-a-coarse-to-fine-approach","Uncovering the Metaverse within Everyday Environments: A Coarse-to-Fin","The recent release of the Apple Vision Pro has reignited interest in the metaverse, showcasing the intensified efforts of technology giants in developing platforms and devices to facilitate its growth. As the metaverse continues to proliferate, it is foreseeable that everyday environments will become increasingly saturated with its presence. Consequently, uncovering links to these metaverse items will be a crucial first step to interacting with this new augmented world. In this paper, we address the problem of establishing connections with virtual worlds within everyday environments, especially those that are not readily discernible through direct visual inspection. We introduce a vision-based approach leveraging Artcode visual markers to uncover hidden metaverse links embedded in our ambient surroundings. This approach progressively localises the access points to the metaverse, transitioning from coarse to fine localisation, thus facilitating an exploratory interaction process. Detailed experiments are conducted to study the performance of the proposed approach, demonstrating its effectiveness in Artcode localisation and enabling new interaction opportunities.",[4377,595,4378,4379],[4381,599,4382,4383],"https:\u002F\u002Fdoi.org\u002F10.1109\u002Fcompsac61105.2024.00074","W4401879607",[4389,23,868,4390],{"type":39,"children":15362,"toc":15367},[15363],{"type":42,"tag":43,"props":15364,"children":15365},{},[15366],{"type":47,"value":15355},{"title":8,"searchDepth":49,"depth":49,"links":15368},[],"content:publications:2024:uncovering-the-metaverse-within-everyday-environments-a-coarse-to-fine-approach.md","publications\u002F2024\u002Funcovering-the-metaverse-within-everyday-environments-a-coarse-to-fine-approach.md","publications\u002F2024\u002Funcovering-the-metaverse-within-everyday-environments-a-coarse-to-fine-approach",{"_path":15373,"_dir":12825,"_draft":7,"_partial":7,"_locale":8,"title":15374,"description":15375,"_hidden":7,"Review and Future Directions\" authors":15376,"authors_orcid":15386,"year":12829,"doi":15395,"openalex_id":15396,"venue":15397,"abstract_screenshot":21,"keywords":15398,"body":15399,"_type":51,"_id":15407,"_source":53,"_file":15408,"_stem":15409,"_extension":56,"locale":57},"\u002Fpublications\u002F2024\u002Funlocking-the-potential-of-cable-driven-continuum-robots-a-comprehensive-review","Unlocking the Potential of Cable-Driven Continuum Robots: A Comprehensiv","Rigid robots have found wide-ranging applications in manufacturing automation, owing to their high loading capacity, high speed, and high precision. Nevertheless, these robots typically feature joint-based drive mechanisms, possessing limited degrees of freedom (DOF), bulky structures, and low manipulability in confined spaces. In contrast, continuum robots, drawing inspiration from biological structures, exhibit characteristics such as high compliance, lightweight designs, and high adaptability to various environments. Among them, cable-driven continuum robots (CDCRs) driven by multiple cables offer advantages like higher dynamic response compared to pneumatic systems and increased working space and higher loading capacity compared to shape memory alloy (SMA) drives. However, CDCRs also exhibit some shortcomings, including complex motion, drive redundancy, challenging modeling, and control difficulties. This study presents a comprehensive analysis and summary of CDCR research progress across four key dimensions: configuration design, kinematics and dynamics modeling, motion planning, and motion control. The objective of this study is to identify common challenges, propose solutions, and unlock the full potential of CDCRs for a broader range of applications.",[15377,5667,15378,15379,15380,15381,15382,15383,15384,4793,9831,15385],"Bai, Haotian","Yang, Guilin","Shen, Wen‐Jun","Qian, Shuwen","Zhang, Haohao","Zhou, Jianwei","Fang, Zaojun","Zheng, Tianjiang","Yu, Bohan",[15387,5670,15388,15389,15390,21,15391,15392,15393,13730,9835,15394],"0000-0001-8012-8036","0000-0001-6144-3401","0000-0001-5150-1698","0000-0002-5667-8908","0000-0002-7440-4134","0000-0003-4025-039X","0000-0003-2270-1388","0009-0002-7568-936X","https:\u002F\u002Fdoi.org\u002F10.3390\u002Fact13020052","W4391384603","Actuators",[7599,179,23,13937,5211,37,865],{"type":39,"children":15400,"toc":15405},[15401],{"type":42,"tag":43,"props":15402,"children":15403},{},[15404],{"type":47,"value":15375},{"title":8,"searchDepth":49,"depth":49,"links":15406},[],"content:publications:2024:unlocking-the-potential-of-cable-driven-continuum-robots-a-comprehensive-review.md","publications\u002F2024\u002Funlocking-the-potential-of-cable-driven-continuum-robots-a-comprehensive-review.md","publications\u002F2024\u002Funlocking-the-potential-of-cable-driven-continuum-robots-a-comprehensive-review",{"_path":15411,"_dir":12825,"_draft":7,"_partial":7,"_locale":8,"title":15412,"description":8,"_hidden":7,"on Vulnerability detection\" authors":15413,"authors_orcid":15418,"year":12829,"doi":15420,"openalex_id":15421,"venue":15422,"Telecommunications Engineering abstract_screenshot":21,"keywords":15423,"body":15424,"_type":51,"_id":15428,"_source":53,"_file":15429,"_stem":15430,"_extension":56,"locale":57},"\u002Fpublications\u002F2024\u002Fvdabsys-a-novel-security-testing-framework-for-blockchain-systems-based-on-vulne","VDABSys: A Novel Security-Testing Framework for Blockchain Systems Base",[648,15414,4112,15415,595,15416,15417],"Feng, Qiaowei","Shi, Dengzhou","Chen, Yuhao","Wang, Dongjie",[651,21,4116,21,599,15419,21],"0000-0003-1708-5939","https:\u002F\u002Fdoi.org\u002F10.1007\u002F978-3-031-64948-6_15","W4403356891","Lecture notes of the Institute for Computer Sciences, Social Informatics and",[5381,1107,6221,180,23,865],{"type":39,"children":15425,"toc":15426},[],{"title":8,"searchDepth":49,"depth":49,"links":15427},[],"content:publications:2024:vdabsys-a-novel-security-testing-framework-for-blockchain-systems-based-on-vulne.md","publications\u002F2024\u002Fvdabsys-a-novel-security-testing-framework-for-blockchain-systems-based-on-vulne.md","publications\u002F2024\u002Fvdabsys-a-novel-security-testing-framework-for-blockchain-systems-based-on-vulne",{"_path":15432,"_dir":12825,"_draft":7,"_partial":7,"_locale":8,"title":15433,"description":15434,"_hidden":7,"learning in higher education\" authors":15435,"authors_orcid":15436,"year":12829,"doi":15437,"openalex_id":15438,"venue":15439,"abstract_screenshot":21,"keywords":15440,"body":15443,"_type":51,"_id":15451,"_source":53,"_file":15452,"_stem":15453,"_extension":56,"locale":57},"\u002Fpublications\u002F2024\u002Fvirtual-educational-environments-an-investigation-into-interactive-immersive-lea","Virtual educational environments: an investigation into interactive immersiv","The COVID-19 pandemic rapidly accelerated the adoption of technology in educational environments. However, the technology initially employed during this period was limited in terms of interaction, engagement and enhancing motivation. Emerging technologies, such as immersive virtual reality, have the potential to resonate with, engage, and empower learners. This study focuses on the use of immersive virtual reality for the purposes of teaching and learning design history: specifically, the Bauhaus design movement. We examine students' affective-motivational factors and their preferences regarding interaction interfaces and learning presentations, to understand how to inspire students in such a way that they enjoy learning and intrinsically wish to learn more. Results indicate that interaction interfaces and presentation type play pivotal roles in terms of immersion and engagement, which in turn impacts learners' motivation. We also found that immersive virtual reality has the ability to increase intrinsic motivation. Insights and recommendations for instruction designers are provided.",[7077,7078,8865,595,8866,7079],[7081,7082,8868,599,8869,7083],"https:\u002F\u002Fdoi.org\u002F10.1504\u002Fijmlo.2024.139723","W4400398740","International Journal of Mobile Learning and Organisation",[15441,867,23,4173,868,15442,4390,865,866,863,869],"M-learning","Instructional simulation",{"type":39,"children":15444,"toc":15449},[15445],{"type":42,"tag":43,"props":15446,"children":15447},{},[15448],{"type":47,"value":15434},{"title":8,"searchDepth":49,"depth":49,"links":15450},[],"content:publications:2024:virtual-educational-environments-an-investigation-into-interactive-immersive-lea.md","publications\u002F2024\u002Fvirtual-educational-environments-an-investigation-into-interactive-immersive-lea.md","publications\u002F2024\u002Fvirtual-educational-environments-an-investigation-into-interactive-immersive-lea",{"_path":15455,"_dir":12825,"_draft":7,"_partial":7,"_locale":8,"title":15456,"description":15457,"_hidden":7,"authors":15458,"authors_orcid":15462,"year":12829,"doi":15466,"openalex_id":15467,"venue":14218,"abstract_screenshot":21,"keywords":15468,"body":15469,"_type":51,"_id":15477,"_source":53,"_file":15478,"_stem":15479,"_extension":56,"locale":57},"\u002Fpublications\u002F2024\u002Fvirtual-sensing-of-room-activity-using-passive-environmental-sensors","Virtual sensing of room activity using passive environmental sensors","A data-driven approach has been developed to classify indoor activities using only commonly available passive environmental sensors, such as CO2, temperature, humidity, and passive infrared (PIR). An integrated IoT system comprising of sensor nodes, edge node and an intelligent server is designed and developed to provide real-time activity classification. Spectral Clustering and bidirectional long short-term memory (BiLSTM) are employed to achieve automatic labeling and room state prediction. The results show that the overall classification accuracy ranges from 88% to 96% for five target states across three distinct environments using CO2 and PIR values as input variables. Additionally, incorporating more input variables has been evaluated to access the ability of real-time classification of proposed model. An innovative monitoring mode can provide a different approach for detecting activities and occupancy in the future.",[12121,12122,4824,5667,15459,15460,15461],"Zhang, Yunfan","Wang, Yin","Lin, Ting-Jung",[21,12125,21,5670,15463,15464,15465],"0000-0001-5927-7109","0000-0001-5500-1228","0000-0002-5208-482X","https:\u002F\u002Fdoi.org\u002F10.1049\u002Ficp.2024.3952","W4405241710",[23,868,10203,926,289],{"type":39,"children":15470,"toc":15475},[15471],{"type":42,"tag":43,"props":15472,"children":15473},{},[15474],{"type":47,"value":15457},{"title":8,"searchDepth":49,"depth":49,"links":15476},[],"content:publications:2024:virtual-sensing-of-room-activity-using-passive-environmental-sensors.md","publications\u002F2024\u002Fvirtual-sensing-of-room-activity-using-passive-environmental-sensors.md","publications\u002F2024\u002Fvirtual-sensing-of-room-activity-using-passive-environmental-sensors",{"_path":15481,"_dir":12825,"_draft":7,"_partial":7,"_locale":8,"title":15482,"description":15483,"_hidden":7,"pseudo-background priors\" authors":15484,"authors_orcid":15487,"year":12829,"doi":15491,"openalex_id":15492,"venue":10505,"abstract_screenshot":21,"keywords":15493,"body":15496,"_type":51,"_id":15512,"_source":53,"_file":15513,"_stem":15514,"_extension":56,"locale":57},"\u002Fpublications\u002F2024\u002Fwbnet-weakly-supervised-salient-object-detection-via-scribble-and-pseudo-backgro","WBNet: Weakly-supervised salient object detection via scribble an","Weakly supervised salient object detection (WSOD) methods endeavor to boost sparse labels to get more salient cues in various ways. Among them, an effective approach is using pseudo labels from multiple unsupervised self-learning methods, but inaccurate and inconsistent pseudo labels could ultimately lead to detection performance degradation. To tackle this problem, we develop a new multi-source WSOD framework, WBNet, that can effectively utilize pseudo-background (non-salient region) labels combined with scribble labels to obtain more accurate salient features. We first design a comprehensive salient pseudo-mask generator from multiple self-learning features. Then, we pioneer the exploration of generating salient pseudo-labels via point-prompted and box-prompted Segment-Anything Models (SAM). Then, WBNet leverages a pixel-level Feature Aggregation Module (FAM), a mask-level Transformer-decoder (TFD), and an auxiliary Boundary Prediction Module (EPM) with a hybrid loss function to handle complex saliency detection tasks. Comprehensively evaluated with state-of-the-art methods on five widely used datasets, the proposed method significantly improves saliency detection performance. The code and results are publicly available at https:\u002F\u002Fgithub.com\u002Fyiwangtz\u002FWBNet.",[12169,12170,8931,15485,12172,15486,12171],"Lin, Chi","Jia, Qi",[15488,15489,8937,15490,12177,21,12176],"0000-0002-2724-7834","0000-0003-2899-9816","0000-0002-0302-5102","https:\u002F\u002Fdoi.org\u002F10.1016\u002Fj.patcog.2024.110579","W4396834613",[12181,23,37,4876,15494,6875,15495,1405,9091,1407,11808,4391,101],"Prior probability","Generator (circuit theory)",{"type":39,"children":15497,"toc":15510},[15498],{"type":42,"tag":43,"props":15499,"children":15500},{},[15501,15503,15509],{"type":47,"value":15502},"Weakly supervised salient object detection (WSOD) methods endeavor to boost sparse labels to get more salient cues in various ways. Among them, an effective approach is using pseudo labels from multiple unsupervised self-learning methods, but inaccurate and inconsistent pseudo labels could ultimately lead to detection performance degradation. To tackle this problem, we develop a new multi-source WSOD framework, WBNet, that can effectively utilize pseudo-background (non-salient region) labels combined with scribble labels to obtain more accurate salient features. We first design a comprehensive salient pseudo-mask generator from multiple self-learning features. Then, we pioneer the exploration of generating salient pseudo-labels via point-prompted and box-prompted Segment-Anything Models (SAM). Then, WBNet leverages a pixel-level Feature Aggregation Module (FAM), a mask-level Transformer-decoder (TFD), and an auxiliary Boundary Prediction Module (EPM) with a hybrid loss function to handle complex saliency detection tasks. Comprehensively evaluated with state-of-the-art methods on five widely used datasets, the proposed method significantly improves saliency detection performance. The code and results are publicly available at ",{"type":42,"tag":1574,"props":15504,"children":15507},{"href":15505,"rel":15506},"https:\u002F\u002Fgithub.com\u002Fyiwangtz\u002FWBNet",[4520],[15508],{"type":47,"value":15505},{"type":47,"value":1645},{"title":8,"searchDepth":49,"depth":49,"links":15511},[],"content:publications:2024:wbnet-weakly-supervised-salient-object-detection-via-scribble-and-pseudo-backgro.md","publications\u002F2024\u002Fwbnet-weakly-supervised-salient-object-detection-via-scribble-and-pseudo-backgro.md","publications\u002F2024\u002Fwbnet-weakly-supervised-salient-object-detection-via-scribble-and-pseudo-backgro",{"_path":15516,"_dir":12825,"_draft":7,"_partial":7,"_locale":8,"title":15517,"description":8,"_hidden":7,"authors":15518,"authors_orcid":15519,"year":12829,"doi":15520,"openalex_id":15521,"venue":687,"abstract_screenshot":21,"keywords":15522,"body":15523,"_type":51,"_id":15527,"_source":53,"_file":15528,"_stem":15529,"_extension":56,"locale":57},"\u002Fpublications\u002F2024\u002Fwearable-based-slam-with-sensor-fusion-in-firefighting-operations","Wearable-Based SLAM with Sensor Fusion in Firefighting Operations",[7746,5667,5407,9831,5665,13773],[21,5670,5411,9835,5669,21],"https:\u002F\u002Fdoi.org\u002F10.1007\u002F978-3-031-53830-8_21","W4392250215",[23,8471,6973,6977,37,4242,4051],{"type":39,"children":15524,"toc":15525},[],{"title":8,"searchDepth":49,"depth":49,"links":15526},[],"content:publications:2024:wearable-based-slam-with-sensor-fusion-in-firefighting-operations.md","publications\u002F2024\u002Fwearable-based-slam-with-sensor-fusion-in-firefighting-operations.md","publications\u002F2024\u002Fwearable-based-slam-with-sensor-fusion-in-firefighting-operations",{"_path":15531,"_dir":15532,"_draft":7,"_partial":7,"_locale":8,"title":15533,"description":15534,"_hidden":7,"Approach for Consumer Electronics authors":15535,"authors_orcid":15542,"year":15548,"doi":15549,"openalex_id":15550,"venue":13232,"abstract_screenshot":21,"keywords":15551,"body":15552,"_type":51,"_id":15560,"_source":53,"_file":15561,"_stem":15562,"_extension":56,"locale":57},"\u002Fpublications\u002F2025\u002Fa-blockchain-based-distributed-collaborative-sensing-and-spectrum-access-approac","2025","A Blockchain-Based Distributed Collaborative Sensing and Spectrum Access","Cognitive radio (CR) provides key technical support for the seamless communication of consumer electronic (CE) devices through distributed cooperative sensing and spectrum access. However, its openness and dynamic nature introduce potential security risks and challenges. Due to the openness of wireless communication, spectrum sensing and access are vulnerable to malicious attacks, and resource-constrained devices cannot effectively implement artificial intelligence (AI)-driven encryption and access control strategies. To address these limitations, this study proposes a blockchain-based distributed collaborative sensing method for CE devices. In the proposed method, after sensing, the smart contracts verify node legitimacy using the ring signature method. The malicious users are rejected by the outlier detection method, which improves the collaborative anti-interference ability. In addition, by using a centralized training and distributed execution architecture, a secure spectrum sensing strategy based on multi-agent reinforcement learning is designed. The proposed strategy ensures that each node makes independent decisions, which enhances the adaptability of the CE ecosystem. The proposed method is verified by extensive simulations, and the results show that it can maintain spectrum awareness of more than 95.72% and an access success rate of 91.19% under malicious attacks. Moreover, communication overhead is significantly reduced by approximately 93.53%.",[15536,15537,15538,15539,13218,15540,15541],"Peng, Yuhuai","Li, Yuan","Guo, Yu","Zhang, Dawei","Alturki, Ryan","Alshawi, Bandar",[15543,15544,15545,15546,13226,15547,21],"0000-0001-9343-5377","0000-0001-7313-8826","0000-0002-0067-2523","0000-0002-9302-9368","0000-0002-0967-1885",2025,"https:\u002F\u002Fdoi.org\u002F10.1109\u002Ftce.2025.3558629","W4409236050",[5381,12601,23,288,928,180,179],{"type":39,"children":15553,"toc":15558},[15554],{"type":42,"tag":43,"props":15555,"children":15556},{},[15557],{"type":47,"value":15534},{"title":8,"searchDepth":49,"depth":49,"links":15559},[],"content:publications:2025:a-blockchain-based-distributed-collaborative-sensing-and-spectrum-access-approac.md","publications\u002F2025\u002Fa-blockchain-based-distributed-collaborative-sensing-and-spectrum-access-approac.md","publications\u002F2025\u002Fa-blockchain-based-distributed-collaborative-sensing-and-spectrum-access-approac",{"_path":15564,"_dir":15532,"_draft":7,"_partial":7,"_locale":8,"title":15565,"description":8,"_hidden":7,"oversampling methods authors":15566,"authors_orcid":15572,"year":15548,"doi":15576,"openalex_id":15577,"venue":447,"abstract_screenshot":21,"keywords":15578,"body":15581,"_type":51,"_id":15585,"_source":53,"_file":15586,"_stem":15587,"_extension":56,"locale":57},"\u002Fpublications\u002F2025\u002Fa-comprehensive-study-on-the-interplay-between-dataset-characteristics-and-overs","A comprehensive study on the interplay between dataset characteristics and",[11578,15567,15568,13501,15569,15570,4189,5667,15571],"Fang, Tangtangfang","Hu, Jinyang","Zhang, Honghao","Cai, Yongmei","Ming, Zhong",[11581,21,21,21,15573,15574,4191,5670,15575],"0000-0002-2338-6992","0000-0002-6065-2575","0000-0002-6933-5760","https:\u002F\u002Fdoi.org\u002F10.1080\u002F01605682.2025.2450060","W4406544760",[11586,15579,23,177,15580,691,24,287,5211,33,34,179],"Project management","Purchasing",{"type":39,"children":15582,"toc":15583},[],{"title":8,"searchDepth":49,"depth":49,"links":15584},[],"content:publications:2025:a-comprehensive-study-on-the-interplay-between-dataset-characteristics-and-overs.md","publications\u002F2025\u002Fa-comprehensive-study-on-the-interplay-between-dataset-characteristics-and-overs.md","publications\u002F2025\u002Fa-comprehensive-study-on-the-interplay-between-dataset-characteristics-and-overs",{"_path":15589,"_dir":15532,"_draft":7,"_partial":7,"_locale":8,"title":15590,"description":15591,"_hidden":7,"Firefighter Self-Contained Breathing Apparatus Endurance Training authors":15592,"authors_orcid":15594,"year":15548,"doi":15596,"openalex_id":15597,"venue":15598,"abstract_screenshot":21,"keywords":15599,"body":15601,"_type":51,"_id":15609,"_source":53,"_file":15610,"_stem":15611,"_extension":56,"locale":57},"\u002Fpublications\u002F2025\u002Fa-multimodal-decision-fusion-network-approach-for-activity-recognition-in-firefi","A Multimodal Decision–Fusion Network Approach for Activity Recognition in","Insufficient training in firefighting techniques increases the risk of injuries and fatalities among firefighters. Human activity recognition methods show promising potential for performance monitoring and evaluation. However, the present studies focus mainly on individual modalities. This limited scope presents challenges in effectively distinguishing between intricate tasks, such as those encountered in firefighting operations. This study introduces an innovative multimodal decision-fusion network designed to overcome this limitation. This is achieved by integrating vision data sourced from three distinct cameras and sensor data collected from four wearable devices. The proposed network combines a vision-focused Video Swin network with a sensor-driven Sensor Transformer network where the results show that the use of only vision-based methods is insufficient to accurately classify firefighting training activities. The proposed decision-fusion network improves classification with a mean F1-score of 95.73%, outperformed the existing hybrid machine learning network.",[8463,15593,5667,5407,11726,5665],"Yu, J.",[8466,15595,5670,5411,11728,5669],"0000-0003-2173-3994","https:\u002F\u002Fdoi.org\u002F10.1109\u002Flsens.2025.3614427","W4414499322","IEEE Sensors Letters",[14243,8471,6973,3902,14853,9762,15600],"Breathing",{"type":39,"children":15602,"toc":15607},[15603],{"type":42,"tag":43,"props":15604,"children":15605},{},[15606],{"type":47,"value":15591},{"title":8,"searchDepth":49,"depth":49,"links":15608},[],"content:publications:2025:a-multimodal-decision-fusion-network-approach-for-activity-recognition-in-firefi.md","publications\u002F2025\u002Fa-multimodal-decision-fusion-network-approach-for-activity-recognition-in-firefi.md","publications\u002F2025\u002Fa-multimodal-decision-fusion-network-approach-for-activity-recognition-in-firefi",{"_path":15613,"_dir":15532,"_draft":7,"_partial":7,"_locale":8,"title":15614,"description":15615,"_hidden":7,"Code and the LLVM Intermediate Representation authors":15616,"authors_orcid":15618,"year":15548,"doi":15620,"openalex_id":15621,"venue":14293,"abstract_screenshot":21,"keywords":15622,"body":15624,"_type":51,"_id":15640,"_source":53,"_file":15641,"_stem":15642,"_extension":56,"locale":57},"\u002Fpublications\u002F2025\u002Fa-novel-vulnerability-detection-method-based-on-the-semantic-features-of-source","A Novel Vulnerability‐Detection Method Based on the Semantic Features of Source","ABSTRACT With the increasingly frequent attacks on software systems, software security is an issue that must be addressed. Within software security, automated detection of software vulnerabilities is an important subject. Most existing vulnerability detectors rely on the features of a single code type (e.g., source code or intermediate representation IR), which may lead to both the global features of the code slices and the memory operation information not being captured or considered. In particular, vulnerability detection based on source‐code features cannot usually include some macro or type definition content. In this paper, we propose a vulnerability‐detection method that combines the semantic features of source code and the low level virtual machine (LLVM) IR. Our proposed approach starts by slicing (C\u002FC++) source files using improved slicing techniques to cover more comprehensive code information. It then extracts semantic information from the LLVM IR based on the executable source code. This can enrich the features fed to the artificial neural network (ANN) model for learning. We conducted an experimental evaluation using a publicly‐available dataset of 11,381 C\u002FC++ programs. The experimental results show the vulnerability‐detection accuracy of our proposed method to reach over 96% for code slices generated according to four different slicing criteria. This outperforms most other compared detection methods.",[648,15617,10858,595,4112,5250,6242,10859],"Zhou, Jiapeng",[651,21,15619,599,4116,6434,6245,21],"0009-0007-5038-1939","https:\u002F\u002Fdoi.org\u002F10.1002\u002Fsmr.70026","W4409981688",[23,110,1407,1405,99,15623,1107,102,180,4359],"Intermediate language",{"type":39,"children":15625,"toc":15638},[15626],{"type":42,"tag":43,"props":15627,"children":15628},{},[15629,15631,15636],{"type":47,"value":15630},"ABSTRACT With the increasingly frequent attacks on software systems, software security is an issue that must be addressed. Within software security, automated detection of software vulnerabilities is an important subject. Most existing vulnerability detectors rely on the features of a single code type (e.g., source code or intermediate representation ",{"type":42,"tag":809,"props":15632,"children":15633},{},[15634],{"type":47,"value":15635},"IR",{"type":47,"value":15637},"), which may lead to both the global features of the code slices and the memory operation information not being captured or considered. In particular, vulnerability detection based on source‐code features cannot usually include some macro or type definition content. In this paper, we propose a vulnerability‐detection method that combines the semantic features of source code and the low level virtual machine (LLVM) IR. Our proposed approach starts by slicing (C\u002FC++) source files using improved slicing techniques to cover more comprehensive code information. It then extracts semantic information from the LLVM IR based on the executable source code. This can enrich the features fed to the artificial neural network (ANN) model for learning. We conducted an experimental evaluation using a publicly‐available dataset of 11,381 C\u002FC++ programs. The experimental results show the vulnerability‐detection accuracy of our proposed method to reach over 96% for code slices generated according to four different slicing criteria. This outperforms most other compared detection methods.",{"title":8,"searchDepth":49,"depth":49,"links":15639},[],"content:publications:2025:a-novel-vulnerability-detection-method-based-on-the-semantic-features-of-source.md","publications\u002F2025\u002Fa-novel-vulnerability-detection-method-based-on-the-semantic-features-of-source.md","publications\u002F2025\u002Fa-novel-vulnerability-detection-method-based-on-the-semantic-features-of-source",{"_path":15644,"_dir":15532,"_draft":7,"_partial":7,"_locale":8,"title":15645,"description":8,"_hidden":7,"authors":15646,"authors_orcid":15649,"year":15548,"doi":15652,"openalex_id":15653,"venue":13029,"abstract_screenshot":21,"keywords":15654,"body":15657,"_type":51,"_id":15661,"_source":53,"_file":15662,"_stem":15663,"_extension":56,"locale":57},"\u002Fpublications\u002F2025\u002Fa-particle-swarm-optimization-based-ensemble-metaheuristic-for-long-term-transmi","A particle swarm optimization-based ensemble metaheuristic for long-term transmission network expansion planning",[15647,15648,12],"Hong, Libin","Wang, G. Gary",[15650,15651,15],"0000-0003-2579-0523","0009-0005-7284-1612","https:\u002F\u002Fdoi.org\u002F10.1016\u002Fj.asoc.2025.113282","W4410932145",[239,695,12410,23,15655,31,15656,286,8137,332,34,3597],"Multi-swarm optimization","Parallel metaheuristic",{"type":39,"children":15658,"toc":15659},[],{"title":8,"searchDepth":49,"depth":49,"links":15660},[],"content:publications:2025:a-particle-swarm-optimization-based-ensemble-metaheuristic-for-long-term-transmi.md","publications\u002F2025\u002Fa-particle-swarm-optimization-based-ensemble-metaheuristic-for-long-term-transmi.md","publications\u002F2025\u002Fa-particle-swarm-optimization-based-ensemble-metaheuristic-for-long-term-transmi",{"_path":15665,"_dir":15532,"_draft":7,"_partial":7,"_locale":8,"title":15666,"description":8,"_hidden":7,"authors":15667,"authors_orcid":15672,"year":15548,"doi":15676,"openalex_id":15677,"venue":14241,"abstract_screenshot":21,"keywords":15678,"body":15679,"_type":51,"_id":15683,"_source":53,"_file":15684,"_stem":15685,"_extension":56,"locale":57},"\u002Fpublications\u002F2025\u002Fa-review-of-medical-text-analysis-theory-and-practice","A review of medical text analysis: Theory and practice",[15668,15669,12,15670,15671,12170],"Chen, Yani","Zhang, Chunwu","Sun, Tengfang","Ding, Weiping",[15673,15674,15,21,15675,12175],"0000-0002-1642-5690","0000-0002-4162-0738","0000-0002-3180-7347","https:\u002F\u002Fdoi.org\u002F10.1016\u002Fj.inffus.2025.103024","W4407727626",[23,691],{"type":39,"children":15680,"toc":15681},[],{"title":8,"searchDepth":49,"depth":49,"links":15682},[],"content:publications:2025:a-review-of-medical-text-analysis-theory-and-practice.md","publications\u002F2025\u002Fa-review-of-medical-text-analysis-theory-and-practice.md","publications\u002F2025\u002Fa-review-of-medical-text-analysis-theory-and-practice",{"_path":15687,"_dir":15532,"_draft":7,"_partial":7,"_locale":8,"title":15688,"description":8,"_hidden":7,"authors":15689,"authors_orcid":15692,"year":15548,"doi":15695,"openalex_id":15696,"venue":3356,"abstract_screenshot":21,"keywords":15697,"body":15699,"_type":51,"_id":15703,"_source":53,"_file":15704,"_stem":15705,"_extension":56,"locale":57},"\u002Fpublications\u002F2025\u002Fadaptive-random-testing-of-deep-learning-systems-using-image-hashing","Adaptive Random Testing of Deep Learning Systems Using Image Hashing",[15690,6820,645,595,15691],"Yi, Linwei","Wang, Rongcun",[15693,6822,650,599,15694],"0009-0000-6781-1789","0000-0002-9685-9893","https:\u002F\u002Fdoi.org\u002F10.1109\u002Ftr.2025.3607784","W4414349321",[6976,4876,9282,4004,6658,15698,9930,1163],"Probability distribution",{"type":39,"children":15700,"toc":15701},[],{"title":8,"searchDepth":49,"depth":49,"links":15702},[],"content:publications:2025:adaptive-random-testing-of-deep-learning-systems-using-image-hashing.md","publications\u002F2025\u002Fadaptive-random-testing-of-deep-learning-systems-using-image-hashing.md","publications\u002F2025\u002Fadaptive-random-testing-of-deep-learning-systems-using-image-hashing",{"_path":15707,"_dir":15532,"_draft":7,"_partial":7,"_locale":8,"title":15708,"description":8,"_hidden":7,"authors":15709,"authors_orcid":15710,"year":15548,"doi":15711,"openalex_id":15712,"venue":7552,"abstract_screenshot":21,"keywords":15713,"body":15714,"_type":51,"_id":15718,"_source":53,"_file":15719,"_stem":15720,"_extension":56,"locale":57},"\u002Fpublications\u002F2025\u002Fan-adaptive-pairwise-testing-algorithm-based-on-deep-reinforcement-learning","An adaptive pairwise testing algorithm based on deep reinforcement learning",[12978,1095,595,3112],[21,1099,599,3115],"https:\u002F\u002Fdoi.org\u002F10.1016\u002Fj.scico.2025.103353","W4411540579",[23,5304,12492,37,332,215],{"type":39,"children":15715,"toc":15716},[],{"title":8,"searchDepth":49,"depth":49,"links":15717},[],"content:publications:2025:an-adaptive-pairwise-testing-algorithm-based-on-deep-reinforcement-learning.md","publications\u002F2025\u002Fan-adaptive-pairwise-testing-algorithm-based-on-deep-reinforcement-learning.md","publications\u002F2025\u002Fan-adaptive-pairwise-testing-algorithm-based-on-deep-reinforcement-learning",{"_path":15722,"_dir":15532,"_draft":7,"_partial":7,"_locale":8,"title":15723,"description":8,"_hidden":7,"authors":15724,"authors_orcid":15726,"year":15548,"doi":15728,"openalex_id":15729,"venue":15730,"abstract_screenshot":21,"keywords":15731,"body":15737,"_type":51,"_id":15741,"_source":53,"_file":15742,"_stem":15743,"_extension":56,"locale":57},"\u002Fpublications\u002F2025\u002Fan-effective-combination-of-mechanisms-for-particle-swarm-optimization-based-ens","An effective combination of mechanisms for particle swarm optimization-based ensemble strategy",[15647,15725,12,90,13799],"Gu, Zhantao",[21,15727,15,92,13801],"0009-0002-2951-119X","https:\u002F\u002Fdoi.org\u002F10.1016\u002Fj.swevo.2025.102154","W4414152289","Swarm and Evolutionary Computation",[695,15732,952,15733,15734,15735,5968,356,15736],"Inertia","Differential evolution","Quadratic programming","Quadratic equation","Mutation",{"type":39,"children":15738,"toc":15739},[],{"title":8,"searchDepth":49,"depth":49,"links":15740},[],"content:publications:2025:an-effective-combination-of-mechanisms-for-particle-swarm-optimization-based-ens.md","publications\u002F2025\u002Fan-effective-combination-of-mechanisms-for-particle-swarm-optimization-based-ens.md","publications\u002F2025\u002Fan-effective-combination-of-mechanisms-for-particle-swarm-optimization-based-ens",{"_path":15745,"_dir":15532,"_draft":7,"_partial":7,"_locale":8,"title":15746,"description":15747,"_hidden":7,"CT‐guided transformer authors":15748,"authors_orcid":15755,"year":15548,"doi":15760,"openalex_id":15761,"venue":15762,"abstract_screenshot":21,"keywords":15763,"body":15766,"_type":51,"_id":15774,"_source":53,"_file":15775,"_stem":15776,"_extension":56,"locale":57},"\u002Fpublications\u002F2025\u002Fautomatic-dual-modality-breast-tumor-segmentation-in-pet-ct-images-using-ct-guid","Automatic dual‐modality breast tumor segmentation in PET\u002FCT images using","BACKGROUND: Breast tumor segmentation is crucial for the diagnosis of breast cancer, as it enables radiologists to rapidly identify areas of interest and facilitate subsequent analysis, diagnosis, and treatment. Present breast tumor segmentation methods are typically applied to high-resolution computed tomography images. However, fewer segmentation methods are utilized for positron emission tomography\u002Fcomputed tomography (PET\u002FCT) imaging systems. PURPOSE: Our goal is to develop a deep learning algorithm which combines functional and structural information for breast tumor segmentation in PET\u002FCT images. This can enhance analytical accuracy and speed up the process of obtaining segmentation outcomes, thereby assisting physicians in subsequent patient diagnosis and treatment. METHODS: In this study, we explore an automatic image segmentation model to segment breast tumors in PET images. The proposed CT-Guided Transformer modules utilize features of various scales from CT images to generate attention maps for PET features. During the fusion process, effective consensus information is extracted from the features of two different modalities using similarity-based contrastive learning, thus enhancing the segmentation performance. Five evaluation metrics (Jaccard coefficient, Dice score, precision, sensitivity, and Hausdorff distance) are utilized to evaluate segmentation performance. The proposed algorithm is compared to the single-modality method and other multimodal fusion strategies. RESULTS: Experiments are conducted using a collected clinical breast dataset alongside the public QIN-Breast benchmark, and the results show that the proposed algorithm accurately segments the outline of breast tumors, achieving superior performance (86.19% Dice, 75.73% Jaccard) on the primary dataset and outperforming standard cross-attention on the public dataset by 3.86% Dice and 3.64% Jaccard. The quantitative and visualization results confirm that our method outperformed single-modality input methods and fusion methods. Additionally, we evaluate the distribution of metrics collected by cases to further demonstrate the superiority of our approach. CONCLUSION: We present a deep-learning-based method for the joint segmentation of anatomical and functional PET\u002FCT images. Compared to single-modality and dual-modality methods with various fusion strategies, our approach significantly improves the accuracy of breast tumor delineation, demonstrating great potential for breast tumor diagnosis.",[13444,15749,15750,15751,15752,15753,9416,8931,15754],"Shao, Dan","Huang, Zhenxing","Yang, Yongfeng","Zheng, Hairong","Liang, Dong","Hu, Zhanli",[13456,15756,15757,21,21,15758,9422,8937,15759],"0000-0002-9925-0936","0000-0001-5012-1992","0000-0003-1358-9777","0000-0003-0618-6240","https:\u002F\u002Fdoi.org\u002F10.1002\u002Fmp.70136","W4416227602","Medical Physics",[10626,9090,15764,11495,4876,9392,15765,7572],"Medical imaging","Image registration",{"type":39,"children":15767,"toc":15772},[15768],{"type":42,"tag":43,"props":15769,"children":15770},{},[15771],{"type":47,"value":15747},{"title":8,"searchDepth":49,"depth":49,"links":15773},[],"content:publications:2025:automatic-dual-modality-breast-tumor-segmentation-in-pet-ct-images-using-ct-guid.md","publications\u002F2025\u002Fautomatic-dual-modality-breast-tumor-segmentation-in-pet-ct-images-using-ct-guid.md","publications\u002F2025\u002Fautomatic-dual-modality-breast-tumor-segmentation-in-pet-ct-images-using-ct-guid",{"_path":15778,"_dir":15532,"_draft":7,"_partial":7,"_locale":8,"title":15779,"description":15780,"_hidden":7,"circRNA-MiRNA Associations authors":15781,"authors_orcid":15788,"year":15548,"doi":15795,"openalex_id":15796,"venue":15797,"abstract_screenshot":21,"keywords":15798,"body":15801,"_type":51,"_id":15809,"_source":53,"_file":15810,"_stem":15811,"_extension":56,"locale":57},"\u002Fpublications\u002F2025\u002Fautonomously-adjusting-multi-relational-hypergraphs-structure-for-predicting-cir","Autonomously Adjusting Multi-Relational Hypergraphs Structure for Predicting","Identifying circRNA-miRNA associations is critical for understanding gene regulatory mechanisms, discovering new biomarkers, and developing therapeutic strategies. The ongoing advancement of autonomous artificial intelligence (AI) technology, particularly in relational and graph learning, enables researchers to develop autonomous AI prediction models to process and analyze existing associations. These models can autonomously extract meaningful patterns and relationships, thereby accurately predicting unknown associations and providing efficient auxiliary tools for traditional experimental methods. Unfortunately, validated reliable circRNA-miRNA associations are often very sparse, making it difficult to learn the intrinsic associations between circRNAs and miRNAs from a static explicit graph structure. To alleviate this problem, we propose a new autonomous AI prediction framework that combines local simple associations with global high-order interactions for joint learning. The framework captures locally embedded representations based on the similarity relationships of RNA molecule attributes, and aggregates contextual information across the global region in different relational modes by applying message passing on multi-relational hypergraphs. Furthermore, we design an autonomous adjustment strategy for multi-relational hypergraphs. This strategy enables adaptive learning of potential node correlations and autonomous construction of hypergraph structures more suitable for downstream tasks, thereby enhancing higher-order relationships between RNA molecules and improving prediction performance and generalization capabilities. Experimental results on three real-world datasets demonstrate that this framework performs excellently in predicting circRNA-miRNA associations, significantly outperforming existing prediction models.",[15782,15783,15784,15785,15786,13218,15540,15787],"Yin, Wenjing","Wang, Shudong","Zhang, Yuanyuan","Qiao, Sibo","Wang, Shuqiang","Lv, Zhihan",[15789,15790,15791,15792,15793,13226,15547,15794],"0000-0002-8837-9195","0000-0003-4360-6718","0000-0003-3935-3201","0000-0001-6922-5986","0000-0003-1119-320X","0000-0003-2525-3074","https:\u002F\u002Fdoi.org\u002F10.1109\u002Fjbhi.2025.3531427","W4406523235","IEEE Journal of Biomedical and Health Informatics",[23,15799,15800,181,102,37,4608,7906,7486],"microRNA","Relational database",{"type":39,"children":15802,"toc":15807},[15803],{"type":42,"tag":43,"props":15804,"children":15805},{},[15806],{"type":47,"value":15780},{"title":8,"searchDepth":49,"depth":49,"links":15808},[],"content:publications:2025:autonomously-adjusting-multi-relational-hypergraphs-structure-for-predicting-cir.md","publications\u002F2025\u002Fautonomously-adjusting-multi-relational-hypergraphs-structure-for-predicting-cir.md","publications\u002F2025\u002Fautonomously-adjusting-multi-relational-hypergraphs-structure-for-predicting-cir",{"_path":15813,"_dir":15532,"_draft":7,"_partial":7,"_locale":8,"title":15814,"description":8,"_hidden":7,"Gamification authors":15815,"authors_orcid":15817,"year":15548,"doi":15819,"openalex_id":15820,"venue":21,"abstract_screenshot":21,"keywords":15821,"body":15823,"_type":51,"_id":15827,"_source":53,"_file":15828,"_stem":15829,"_extension":56,"locale":57},"\u002Fpublications\u002F2025\u002Fbridging-theory-and-practice-in-machine-learning-education-through-mixed-reality","Bridging Theory and Practice in Machine Learning Education Through Mixed Reality",[15816,5667],"Zhang, Gege",[15818,5670],"0000-0001-6804-4366","https:\u002F\u002Fdoi.org\u002F10.1109\u002Ftale66047.2025.11346761","W7125609646",[6598,11533,15822,6511,3388],"Multimethodology",{"type":39,"children":15824,"toc":15825},[],{"title":8,"searchDepth":49,"depth":49,"links":15826},[],"content:publications:2025:bridging-theory-and-practice-in-machine-learning-education-through-mixed-reality.md","publications\u002F2025\u002Fbridging-theory-and-practice-in-machine-learning-education-through-mixed-reality.md","publications\u002F2025\u002Fbridging-theory-and-practice-in-machine-learning-education-through-mixed-reality",{"_path":15831,"_dir":15532,"_draft":7,"_partial":7,"_locale":8,"title":15832,"description":15833,"_hidden":7,"Synthesis\" authors":15834,"authors_orcid":15842,"year":15548,"doi":15849,"openalex_id":15850,"venue":21,"abstract_screenshot":21,"keywords":15851,"body":15857,"_type":51,"_id":15865,"_source":53,"_file":15866,"_stem":15867,"_extension":56,"locale":57},"\u002Fpublications\u002F2025\u002Fcadgs-modeling-inter-gaussian-mutual-information-for-dynamic-novel-view-synthesi","CaDGS: Modeling Inter-Gaussian Mutual Information for Dynamic Novel Vie","Dynamic novel view synthesis (NVS) aims to render time-varying scenes from arbitrary viewpoints, balancing rendering quality and computational efficiency. While recent 4D Gaussian Splatting approaches offer promising real-time performance, they fundamentally overlook critical interdependence between Gaussians by modeling deformations independently. Our information-theoretic analysis reveals substantial mutual information across the Gaussian field, manifesting as appearance-preserving radiance coherence and motion-consistent deformation propagation. This finding establishes that rendering quality emerges from coordinated transformation rather than independent processing. We propose Correlation-aware Dynamic Gaussian Splatting (CaDGS) with our novel Gaussian Correlation Tensor Projection (GCTP) method, which efficiently transforms the complex O(n3) mutual information tensor into a dual-channel O(n2) spatial matrix, preserving the critical topological structure of Gaussian interactions. Combined with our Spatio-Temporal Deformation Consistency (STDC) learning, which enforces volumetric coherence through tensor-guided regularization across multiple scales, CaDGS prevents geometric distortions and texture inconsistencies common in previous approaches. Experimental results demonstrate state-of-the-art performance, achieving 32.4 PSNR on the Neu3D dataset with fewer Gaussians while maintaining rendering speeds of 323 FPS at 1353 × 1014 resolution.",[15835,15836,15837,15838,15839,8931,15840,15841],"Zhao, Yunlong","Deng, Xiaoheng","Qiu, Zhuohua","Yang, Feng","Xu, Chang","You, Shan","Su, Xiu",[15843,15844,21,15845,15846,8937,15847,15848],"0000-0002-2038-6540","0000-0003-2740-8025","0000-0002-3495-5257","0000-0002-4756-0609","0000-0003-1964-0430","0000-0002-9863-5404","https:\u002F\u002Fdoi.org\u002F10.1145\u002F3746027.3755121","W4415540270",[12930,3689,15852,15853,15854,15855,15856,3686],"Mutual information","View synthesis","Coherence (philosophical gambling strategy)","Tensor (intrinsic definition)","Gaussian network model",{"type":39,"children":15858,"toc":15863},[15859],{"type":42,"tag":43,"props":15860,"children":15861},{},[15862],{"type":47,"value":15833},{"title":8,"searchDepth":49,"depth":49,"links":15864},[],"content:publications:2025:cadgs-modeling-inter-gaussian-mutual-information-for-dynamic-novel-view-synthesi.md","publications\u002F2025\u002Fcadgs-modeling-inter-gaussian-mutual-information-for-dynamic-novel-view-synthesi.md","publications\u002F2025\u002Fcadgs-modeling-inter-gaussian-mutual-information-for-dynamic-novel-view-synthesi",{"_path":15869,"_dir":15532,"_draft":7,"_partial":7,"_locale":8,"title":15870,"description":15871,"_hidden":7,"authors":15872,"authors_orcid":15875,"year":15548,"doi":15878,"openalex_id":15879,"venue":21,"abstract_screenshot":21,"keywords":15880,"body":15882,"_type":51,"_id":15890,"_source":53,"_file":15891,"_stem":15892,"_extension":56,"locale":57},"\u002Fpublications\u002F2025\u002Fceari-co-evolutionary-agents-for-reassembling-and-inpainting-puzzles-with-gaps-a","CEARI: Co-Evolutionary Agents for Reassembling and Inpainting Puzzles with Gaps and Missing Pieces","Puzzle solving has recently become a popular research topic. Existing solvers often overlook puzzles with missing pieces. The missing pieces, together with gaps between pieces, pose significant challenges, amplified by a large solution space. To tackle the challenges, we propose Co-Evolutionary Agents for Reassembling and Inpainting (CEARI), one agent to inpaint missing contents and the other to reassemble the puzzle, with a shared perception network to perceive the puzzle status. The reassembly agent utilizes an evolutionary algorithm to explore the large solution space, to discover a sequence of fragment-swapping actions to efficiently reassemble the puzzle, while the inpainting agent evolves from using a local outpainting network at the early stage to using a global inpainting network at the latter stage. Furthermore, a co-evolutionary training paradigm is designed to iteratively evolve the two agents in a coherent and collaborative manner, improving reassembly accuracy and inpainting quality simultaneously. Experimental results on three datasets show that CEARI largely outperforms state-of-the-art methods in terms of both reassembly accuracy and inpainting quality.",[12485,15873,13188,6997,6111,12,15874,9048],"Shangguan, Jianxu","Chen, Xin",[12487,15876,13192,7000,6113,15,15877,9051],"0009-0008-5280-9182","0000-0002-3685-0854","https:\u002F\u002Fdoi.org\u002F10.1145\u002F3746027.3754695","W4415535492",[13053,3358,747,15881,9784,4004],"Missing data",{"type":39,"children":15883,"toc":15888},[15884],{"type":42,"tag":43,"props":15885,"children":15886},{},[15887],{"type":47,"value":15871},{"title":8,"searchDepth":49,"depth":49,"links":15889},[],"content:publications:2025:ceari-co-evolutionary-agents-for-reassembling-and-inpainting-puzzles-with-gaps-a.md","publications\u002F2025\u002Fceari-co-evolutionary-agents-for-reassembling-and-inpainting-puzzles-with-gaps-a.md","publications\u002F2025\u002Fceari-co-evolutionary-agents-for-reassembling-and-inpainting-puzzles-with-gaps-a",{"_path":15894,"_dir":15532,"_draft":7,"_partial":7,"_locale":8,"title":15895,"description":8,"_hidden":7,"for improved segmentation of heterogeneous medical images\" authors":15896,"authors_orcid":15900,"year":15548,"doi":15905,"openalex_id":15906,"venue":374,"abstract_screenshot":21,"keywords":15907,"body":15908,"_type":51,"_id":15912,"_source":53,"_file":15913,"_stem":15914,"_extension":56,"locale":57},"\u002Fpublications\u002F2025\u002Fcfformer-cross-cnn-transformer-channel-attention-and-spatial-feature-fusion-for","CFFormer: Cross CNN-Transformer channel attention and spatial feature fusio",[15897,15898,8931,14340,15899,12170,319,4665],"Li, Jiaxuan","Xu, Qing","Zhang, Daokun",[15901,15902,8937,15903,15904,12175,322,4670],"0009-0004-5746-222X","0000-0001-6898-0269","0000-0002-2888-3066","0000-0002-1803-5768","https:\u002F\u002Fdoi.org\u002F10.1016\u002Fj.eswa.2025.128835","W4411920948",[23,37,4876,9090,14584,6875,9189,8734,4391,288,6633,928],{"type":39,"children":15909,"toc":15910},[],{"title":8,"searchDepth":49,"depth":49,"links":15911},[],"content:publications:2025:cfformer-cross-cnn-transformer-channel-attention-and-spatial-feature-fusion-for.md","publications\u002F2025\u002Fcfformer-cross-cnn-transformer-channel-attention-and-spatial-feature-fusion-for.md","publications\u002F2025\u002Fcfformer-cross-cnn-transformer-channel-attention-and-spatial-feature-fusion-for",{"_path":15916,"_dir":15532,"_draft":7,"_partial":7,"_locale":8,"title":15917,"description":8,"_hidden":7,"for Improved Segmentation of Low-Quality Medical Images\" authors":15918,"authors_orcid":15919,"year":15548,"doi":15922,"openalex_id":15923,"venue":74,"abstract_screenshot":21,"keywords":15924,"body":15925,"_type":51,"_id":15929,"_source":53,"_file":15930,"_stem":15931,"_extension":56,"locale":57},"\u002Fpublications\u002F2025\u002Fcfformer-cross-cnn-transformer-channel-attention-and-spatial-feature-fusion-for-4410198023","Cfformer: Cross Cnn-Transformer Channel Attention and Spatial Feature Fusio",[15897,15898,8931,14340,15899,12170,319,4665],[15920,15921,8937,15903,15904,12175,322,4670],"0000-0001-7647-6839","0000-0002-8243-6670","https:\u002F\u002Fdoi.org\u002F10.2139\u002Fssrn.5243043","W4410198023",[37,9090,4876,23,14584,6875,8734,9189,4391,179,288,6633,928],{"type":39,"children":15926,"toc":15927},[],{"title":8,"searchDepth":49,"depth":49,"links":15928},[],"content:publications:2025:cfformer-cross-cnn-transformer-channel-attention-and-spatial-feature-fusion-for-4410198023.md","publications\u002F2025\u002Fcfformer-cross-cnn-transformer-channel-attention-and-spatial-feature-fusion-for-4410198023.md","publications\u002F2025\u002Fcfformer-cross-cnn-transformer-channel-attention-and-spatial-feature-fusion-for-4410198023",{"_path":15933,"_dir":15532,"_draft":7,"_partial":7,"_locale":8,"title":15934,"description":15935,"_hidden":7,"Representation Learning authors":15936,"authors_orcid":15937,"year":15548,"doi":15938,"openalex_id":15939,"venue":21,"abstract_screenshot":21,"keywords":15940,"body":15941,"_type":51,"_id":15949,"_source":53,"_file":15950,"_stem":15951,"_extension":56,"locale":57},"\u002Fpublications\u002F2025\u002Fchemically-aware-attention-based-multi-modal-fusion-framework-for-molecular-repr","Chemically-aware Attention-based Multi-modal Fusion Framework for Molecular","Learning effective molecular representations is crucial for accurate property prediction in artificial intelligence (AI)-aided drug discovery. Graph and fingerprint representations have been widely used to encode molecular topological structures and chemical substructures. To enhance the feature embedding of each modality and leverage their complementary strengths, we propose a novel Chemically-aware Attention-based Multi-modal Fusion Framework (CAMFF) for molecular representation learning, which integrates molecular graphs and extended-connectivity fingerprints by exploiting various attention mechanisms. Specifically, the proposed CAMFF consists of three modules: 1) a graph embedding module incorporating multi-head attention to capture local heterogeneous interactions and all-pair self-attention to capture long-range atomic dependencies from molecular graph representations; 2) a fingerprint embedding module using a pre-trained Mol2Vec model to generate dense chemical substructure representations; and 3) a chemically-aware feature interaction and fusion module incorporating self-attention to enable interactions between various chemical substructures and cross-attention to ensure effective multi-modal alignment and fusion. To evaluate the effectiveness of CAMFF, we compare it with 14 state-of-the-art methods across 9 molecular property prediction benchmarks. CAMFF demonstrates competitive predictive performance and improves interpretability through attention-based visualization, showing its potential for real-world drug discovery.",[15155,7888,6111,7887,595],[15159,7894,21,7893,599],"https:\u002F\u002Fdoi.org\u002F10.1109\u002Fcompsac65507.2025.00250","W4413679442",[11118,23,99,9189,37,868,3961,5925],{"type":39,"children":15942,"toc":15947},[15943],{"type":42,"tag":43,"props":15944,"children":15945},{},[15946],{"type":47,"value":15935},{"title":8,"searchDepth":49,"depth":49,"links":15948},[],"content:publications:2025:chemically-aware-attention-based-multi-modal-fusion-framework-for-molecular-repr.md","publications\u002F2025\u002Fchemically-aware-attention-based-multi-modal-fusion-framework-for-molecular-repr.md","publications\u002F2025\u002Fchemically-aware-attention-based-multi-modal-fusion-framework-for-molecular-repr",{"_path":15953,"_dir":15532,"_draft":7,"_partial":7,"_locale":8,"title":15954,"description":15955,"_hidden":7,"authors":15956,"authors_orcid":15958,"year":15548,"doi":15959,"openalex_id":15960,"venue":4539,"abstract_screenshot":21,"keywords":15961,"body":15962,"_type":51,"_id":15970,"_source":53,"_file":15971,"_stem":15972,"_extension":56,"locale":57},"\u002Fpublications\u002F2025\u002Fcnn-lidar-slam-multimodal-fusion-with-object-detection-for-indoor-localization","CNN-LiDAR-SLAM: Multimodal Fusion With Object Detection for Indoor Localization","Simultaneous localization and mapping (SLAM) in indoor environments remains a critical challenge, especially in GPS-denied areas where real-time Performance, low cost, and robustness are required. Traditional 3D LiDAR-based solutions offer accuracy but are expensive and computationally demanding. This paper presents CNN-LIDAR-SLAM, a lightweight, handheld approach that integrates 2D LiDAR, IMU, and a CNN-RNN-based object detection framework. By combining inertial Odometry with learned semantic landmarks, and optimizing with an Iterated Extended Kalman Filter (IEKF), our approach delivers robust and precise localization without relying on loop closure. The proposed system achieves consistent Performance in cluttered, dynamic environments and operates in real-time on modest hardware. Our results validate the system’s effectiveness as a cost-efficient, accurate, and scalable solution for autonomous navigation and indoor mapping.",[15957,5667,5665],"Kalan, Saqi Hussain",[21,5670,5669],"https:\u002F\u002Fdoi.org\u002F10.1109\u002Faccess.2025.3635243","W4416429216",[9840,353,7258,11808,7751,6977,6298,6978,7755],{"type":39,"children":15963,"toc":15968},[15964],{"type":42,"tag":43,"props":15965,"children":15966},{},[15967],{"type":47,"value":15955},{"title":8,"searchDepth":49,"depth":49,"links":15969},[],"content:publications:2025:cnn-lidar-slam-multimodal-fusion-with-object-detection-for-indoor-localization.md","publications\u002F2025\u002Fcnn-lidar-slam-multimodal-fusion-with-object-detection-for-indoor-localization.md","publications\u002F2025\u002Fcnn-lidar-slam-multimodal-fusion-with-object-detection-for-indoor-localization",{"_path":15974,"_dir":15532,"_draft":7,"_partial":7,"_locale":8,"title":15975,"description":15976,"_hidden":7,"Preliminary Study\" authors":15977,"authors_orcid":15978,"year":15548,"doi":15980,"openalex_id":15981,"venue":21,"abstract_screenshot":21,"keywords":15982,"body":15983,"_type":51,"_id":15991,"_source":53,"_file":15992,"_stem":15993,"_extension":56,"locale":57},"\u002Fpublications\u002F2025\u002Fcomparative-analysis-of-styles-in-llm-generated-code-for-leetcode-problems-a-pre","Comparative Analysis of Styles in LLM-Generated Code for LeetCode Problems: ","Large language models (LLMs) have rapidly become a powerful tool in automated code generation, yet most research has focused on their correctness and efficiency rather than the stylistic patterns of their outputs. In this preliminary study, we analyze the code patterns generated by five popular LLMs—ChatGPT, Gemini, Claude, Grok, and DeepSeek—in their free versions, across three LeetCode problems, one top-ranking each from the easy, medium, and hard categories. Our evaluation employs key metrics including inline comment density, naming conventions, and edge case handling, highlighting both similarities and differences in verbosity, comprehensibility, and robustness among the codes generated by models. The findings of this study have important implications for software engineering and education, suggesting that LLM-generated code can serve as both a tool for rapid prototyping and an effective learning resource for beginners. Our future work will extend this analysis to a broader set of coding challenges and compare LLM outputs with human-written code to develop robust criteria for evaluating automated code generation.",[8041,596,645,5407,595,8040,1156],[15979,600,650,5411,599,8044,1158],"0000-0002-9270-0658","https:\u002F\u002Fdoi.org\u002F10.1109\u002Fcompsac65507.2025.00219","W4413640309",[23,1405,110],{"type":39,"children":15984,"toc":15989},[15985],{"type":42,"tag":43,"props":15986,"children":15987},{},[15988],{"type":47,"value":15976},{"title":8,"searchDepth":49,"depth":49,"links":15990},[],"content:publications:2025:comparative-analysis-of-styles-in-llm-generated-code-for-leetcode-problems-a-pre.md","publications\u002F2025\u002Fcomparative-analysis-of-styles-in-llm-generated-code-for-leetcode-problems-a-pre.md","publications\u002F2025\u002Fcomparative-analysis-of-styles-in-llm-generated-code-for-leetcode-problems-a-pre",{"_path":15995,"_dir":15532,"_draft":7,"_partial":7,"_locale":8,"title":15996,"description":8,"_hidden":7,"Confucian critique\" authors":15997,"authors_orcid":15999,"year":15548,"doi":16001,"openalex_id":16002,"venue":16003,"abstract_screenshot":21,"keywords":16004,"body":16007,"_type":51,"_id":16011,"_source":53,"_file":16012,"_stem":16013,"_extension":56,"locale":57},"\u002Fpublications\u002F2025\u002Fcultural-challenges-to-the-adversarial-cooperation-framework-in-bioethics-a-conf","Cultural challenges to the adversarial cooperation framework in bioethics: ",[15998,65],"Wu, Shengbo",[16000,70],"0000-0001-7497-2935","https:\u002F\u002Fdoi.org\u002F10.1136\u002Fjme-2025-111228","W4414575694","Journal of Medical Ethics",[13234,6319,16005,16006,3468],"MEDLINE","Cultural diversity",{"type":39,"children":16008,"toc":16009},[],{"title":8,"searchDepth":49,"depth":49,"links":16010},[],"content:publications:2025:cultural-challenges-to-the-adversarial-cooperation-framework-in-bioethics-a-conf.md","publications\u002F2025\u002Fcultural-challenges-to-the-adversarial-cooperation-framework-in-bioethics-a-conf.md","publications\u002F2025\u002Fcultural-challenges-to-the-adversarial-cooperation-framework-in-bioethics-a-conf",{"_path":16015,"_dir":15532,"_draft":7,"_partial":7,"_locale":8,"title":16016,"description":16017,"_hidden":7,"authors":16018,"authors_orcid":16021,"year":15548,"doi":16023,"openalex_id":16024,"venue":5791,"abstract_screenshot":21,"keywords":16025,"body":16027,"_type":51,"_id":16045,"_source":53,"_file":16046,"_stem":16047,"_extension":56,"locale":57},"\u002Fpublications\u002F2025\u002Fdarr-a-dual-branch-arithmetic-regression-reasoning-framework-for-solving-machine","DARR: A Dual-Branch Arithmetic Regression Reasoning Framework for Solving Machine Number Reasoning","Abstract visual reasoning (AVR) is a critical ability of humans, and it has been widely studied, but arithmetic visual reasoning, a unique task in AVR to reason over number sense, is less studied in the literature. To facilitate this research, we construct a Machine Number Reasoning (MNR) dataset to assess the model's ability in arithmetic visual reasoning over number sense and spatial layouts. To solve the MNR tasks, we propose a Dual-branch Arithmetic Regression Reasoning (DARR) framework, which includes an Intra-Image Arithmetic Regression Reasoning (IIARR) module and a Cross-Image Arithmetic Regression Reasoning (CIARR) module. The IIARR includes a set of Intra-Image Regression Blocks to identify the correct number orders and the underlying arithmetic rules within individual images, and an Order Gate to determine the correct number order. The CIARR establishes the arithmetic relations across different images through a 3-to-1' regressor and a set of 2-to-1' regressors, with a Selection Gate to select the most suitable `2-to-1' regressor and a gated fusion to combine the two kinds of regressors. Experiments on the MNR dataset show that the DARR outperforms state-of-the-art models for arithmetic visual reasoning.",[16019,16020,9302,6111,12,14847,5532,9048],"Li, Chengtai","Tan, Yee Yang",[16022,21,9308,6113,15,14849,5537,9051],"0000-0003-0559-7507","https:\u002F\u002Fdoi.org\u002F10.1609\u002Faaai.v39i2.32127","W4409346642",[14810,23,9864,8167,16026,37,34,866],"Proportional reasoning",{"type":39,"children":16028,"toc":16043},[16029],{"type":42,"tag":43,"props":16030,"children":16031},{},[16032,16034,16041],{"type":47,"value":16033},"Abstract visual reasoning (AVR) is a critical ability of humans, and it has been widely studied, but arithmetic visual reasoning, a unique task in AVR to reason over number sense, is less studied in the literature. To facilitate this research, we construct a Machine Number Reasoning (MNR) dataset to assess the model's ability in arithmetic visual reasoning over number sense and spatial layouts. To solve the MNR tasks, we propose a Dual-branch Arithmetic Regression Reasoning (DARR) framework, which includes an Intra-Image Arithmetic Regression Reasoning (IIARR) module and a Cross-Image Arithmetic Regression Reasoning (CIARR) module. The IIARR includes a set of Intra-Image Regression Blocks to identify the correct number orders and the underlying arithmetic rules within individual images, and an Order Gate to determine the correct number order. The CIARR establishes the arithmetic relations across different images through a ",{"type":42,"tag":16035,"props":16036,"children":16038},"code",{"className":16037},[],[16039],{"type":47,"value":16040},"3-to-1' regressor and a set of ",{"type":47,"value":16042},"2-to-1' regressors, with a Selection Gate to select the most suitable `2-to-1' regressor and a gated fusion to combine the two kinds of regressors. Experiments on the MNR dataset show that the DARR outperforms state-of-the-art models for arithmetic visual reasoning.",{"title":8,"searchDepth":49,"depth":49,"links":16044},[],"content:publications:2025:darr-a-dual-branch-arithmetic-regression-reasoning-framework-for-solving-machine.md","publications\u002F2025\u002Fdarr-a-dual-branch-arithmetic-regression-reasoning-framework-for-solving-machine.md","publications\u002F2025\u002Fdarr-a-dual-branch-arithmetic-regression-reasoning-framework-for-solving-machine",{"_path":16049,"_dir":15532,"_draft":7,"_partial":7,"_locale":8,"title":16050,"description":16051,"_hidden":7,"Autonomous Driving authors":16052,"authors_orcid":16057,"year":15548,"doi":16062,"openalex_id":16063,"venue":13232,"abstract_screenshot":21,"keywords":16064,"body":16065,"_type":51,"_id":16073,"_source":53,"_file":16074,"_stem":16075,"_extension":56,"locale":57},"\u002Fpublications\u002F2025\u002Fdata-driven-dlt3-federated-deep-reinforcement-learning-for-secure-and-efficient","Data-Driven DLT3 Federated Deep Reinforcement Learning for Secure and Efficient","As autonomous vehicles (AVs) become increasingly widespread, the intelligent driving control and safety concerns have emerged. Recent advents in Internet of Things (IoTs) and 6G technologies have vastly boosted AVs’ sensing and communication capabilities, thereby enabling the high-speed and real-time data exchange. However, efficiently utilizing data while safeguarding the privacy remains challenges. Thus, we propose a federated learning (FL) framework with the privacy protection to facilitate the deep reinforcement learning (DRL) for longitudinal vehicle safety tracking control. First, the proposed framework enables the efficient information sharing and policy updates via encrypted policy gradient transmission. Then, the twin delayed deep deterministic policy gradient (TD3) method makes the velocity decision in the local model, while the dual long short-term memory (LSTM) network captures the temporal trajectory information. Finally, stacked denoising autoencoders (SDAE) is used to extract high-level environmental features, and the dual-LSTM-TD3 (DLT3)-SDAE model is introduced to enhance the policy decision efficiency and accuracy. Experimental results demonstrate that within the FL framework supported by homomorphic encryption, the DLT3-SDAE-based AV agent surpasses other DRL methods in terms of collision avoidance and average rewards, in the LAF environment. The safety, efficiency and comfort of the DLT3-SDAE AV agent are also evaluated and demonstrated.",[16053,16054,16055,13218,15540,16056],"Fei, Rong","Li, Qianxi","Wang, Kan","Lan, Dapeng",[16058,16059,16060,13226,15547,16061],"0000-0002-7092-4378","0009-0000-2678-1261","0000-0003-3500-1073","0000-0003-1104-5039","https:\u002F\u002Fdoi.org\u002F10.1109\u002Ftce.2025.3564469","W4409916774",[5304,23,37,4242,249,868],{"type":39,"children":16066,"toc":16071},[16067],{"type":42,"tag":43,"props":16068,"children":16069},{},[16070],{"type":47,"value":16051},{"title":8,"searchDepth":49,"depth":49,"links":16072},[],"content:publications:2025:data-driven-dlt3-federated-deep-reinforcement-learning-for-secure-and-efficient.md","publications\u002F2025\u002Fdata-driven-dlt3-federated-deep-reinforcement-learning-for-secure-and-efficient.md","publications\u002F2025\u002Fdata-driven-dlt3-federated-deep-reinforcement-learning-for-secure-and-efficient",{"_path":16077,"_dir":15532,"_draft":7,"_partial":7,"_locale":8,"title":16078,"description":16079,"_hidden":7,"Segmentation\" authors":16080,"authors_orcid":16086,"year":15548,"doi":16092,"openalex_id":16093,"venue":13162,"abstract_screenshot":21,"keywords":16094,"body":16095,"_type":51,"_id":16111,"_source":53,"_file":16112,"_stem":16113,"_extension":56,"locale":57},"\u002Fpublications\u002F2025\u002Fde-lightsam-modality-decoupled-lightweight-sam-for-generalizable-medical-segment","De-LightSAM: Modality-Decoupled Lightweight SAM for Generalizable Medica","The universality of deep neural networks across different modalities and their generalization capabilities to unseen domains play an essential role in medical image segmentation. The recent segment anything model (SAM) has demonstrated strong adaptability across diverse natural scenarios. However, the huge computational costs, demand for manual annotations as prompts and conflict-prone decoding process of SAM degrade its generalization capabilities in medical scenarios. To address these limitations, we propose a modality-decoupled lightweight SAM for domain-generalized medical image segmentation, named De-LightSAM. Specifically, we first devise a lightweight domain-controllable image encoder (DC-Encoder) that produces discriminative visual features for diverse modalities. Further, we introduce the self-patch prompt generator (SP-Generator) to automatically generate high-quality dense prompt embeddings for guiding segmentation decoding. Finally, we design the query-decoupled modality decoder (QM-Decoder) that leverages a one-to-one strategy to provide an independent decoding channel for every modality, preventing mutual knowledge interference of different modalities. Moreover, we design a multi-modal decoupled knowledge distillation (MDKD) strategy to leverage robust common knowledge to complement domain-specific medical feature representations. Extensive experiments indicate that De-LightSAM outperforms state-of-the-arts in diverse medical imaging segmentation tasks, displaying superior modality universality and generalization capabilities. Especially, De-LightSAM uses only 2.0% parameters compared to SAM-H. The source code is available at https:\u002F\u002Fgithub.com\u002Fxq141839\u002FDe-LightSAM.",[15898,15897,8931,16081,16082,16083,16084,319,12899,16085],"Li, Chenxin","Tesema, Fiseha B.","Duan, Wenting","Chen, Zhen","Chen, Chang Wen",[15902,16087,8937,16088,16089,16090,16091,322,12901,21],"0000-0002-3766-0876","0000-0001-7146-2200","0000-0002-7472-4007","0000-0001-9665-4890","0000-0003-0255-6435","https:\u002F\u002Fdoi.org\u002F10.1109\u002Ftcsvt.2025.3621309","W4415178648",[9090,482,10551,9058,11495,6144,4876,6897,7391],{"type":39,"children":16096,"toc":16109},[16097],{"type":42,"tag":43,"props":16098,"children":16099},{},[16100,16102,16108],{"type":47,"value":16101},"The universality of deep neural networks across different modalities and their generalization capabilities to unseen domains play an essential role in medical image segmentation. The recent segment anything model (SAM) has demonstrated strong adaptability across diverse natural scenarios. However, the huge computational costs, demand for manual annotations as prompts and conflict-prone decoding process of SAM degrade its generalization capabilities in medical scenarios. To address these limitations, we propose a modality-decoupled lightweight SAM for domain-generalized medical image segmentation, named De-LightSAM. Specifically, we first devise a lightweight domain-controllable image encoder (DC-Encoder) that produces discriminative visual features for diverse modalities. Further, we introduce the self-patch prompt generator (SP-Generator) to automatically generate high-quality dense prompt embeddings for guiding segmentation decoding. Finally, we design the query-decoupled modality decoder (QM-Decoder) that leverages a one-to-one strategy to provide an independent decoding channel for every modality, preventing mutual knowledge interference of different modalities. Moreover, we design a multi-modal decoupled knowledge distillation (MDKD) strategy to leverage robust common knowledge to complement domain-specific medical feature representations. Extensive experiments indicate that De-LightSAM outperforms state-of-the-arts in diverse medical imaging segmentation tasks, displaying superior modality universality and generalization capabilities. Especially, De-LightSAM uses only 2.0% parameters compared to SAM-H. The source code is available at ",{"type":42,"tag":1574,"props":16103,"children":16106},{"href":16104,"rel":16105},"https:\u002F\u002Fgithub.com\u002Fxq141839\u002FDe-LightSAM",[4520],[16107],{"type":47,"value":16104},{"type":47,"value":1645},{"title":8,"searchDepth":49,"depth":49,"links":16110},[],"content:publications:2025:de-lightsam-modality-decoupled-lightweight-sam-for-generalizable-medical-segment.md","publications\u002F2025\u002Fde-lightsam-modality-decoupled-lightweight-sam-for-generalizable-medical-segment.md","publications\u002F2025\u002Fde-lightsam-modality-decoupled-lightweight-sam-for-generalizable-medical-segment",{"_path":16115,"_dir":15532,"_draft":7,"_partial":7,"_locale":8,"title":16116,"description":8,"_hidden":7,"edge node overload in edge computing authors":16117,"authors_orcid":16118,"year":15548,"doi":16119,"openalex_id":16120,"venue":16121,"abstract_screenshot":21,"keywords":16122,"body":16124,"_type":51,"_id":16128,"_source":53,"_file":16129,"_stem":16130,"_extension":56,"locale":57},"\u002Fpublications\u002F2025\u002Fdeep-q-learning-with-feature-extraction-and-prioritized-experience-replay-for-ed","Deep Q-learning with feature extraction and prioritized experience replay for",[11726,5667,5665],[11728,5670,5669],"https:\u002F\u002Fdoi.org\u002F10.1016\u002Fj.engappai.2025.112124","W4414573591","Engineering Applications of Artificial Intelligence",[12100,6298,8778,6465,9150,3331,450,16123],"Resource allocation",{"type":39,"children":16125,"toc":16126},[],{"title":8,"searchDepth":49,"depth":49,"links":16127},[],"content:publications:2025:deep-q-learning-with-feature-extraction-and-prioritized-experience-replay-for-ed.md","publications\u002F2025\u002Fdeep-q-learning-with-feature-extraction-and-prioritized-experience-replay-for-ed.md","publications\u002F2025\u002Fdeep-q-learning-with-feature-extraction-and-prioritized-experience-replay-for-ed",{"_path":16132,"_dir":15532,"_draft":7,"_partial":7,"_locale":8,"title":16133,"description":16134,"_hidden":7,"End–Edge–Cloud Computing in Consumer Electronics authors":16135,"authors_orcid":16141,"year":15548,"doi":16146,"openalex_id":16147,"venue":13232,"abstract_screenshot":21,"keywords":16148,"body":16151,"_type":51,"_id":16159,"_source":53,"_file":16160,"_stem":16161,"_extension":56,"locale":57},"\u002Fpublications\u002F2025\u002Fdependent-task-offloading-of-cross-applications-and-service-caching-for-end-edge","Dependent Task Offloading of Cross-Applications and Service Caching for","As consumer electronics (CEs) continue to become more intelligent and interconnected, end-edge-cloud collaborative computing is an essential paradigm to meet the demands of cross-application dependent tasks. However, the limited memory resources and heterogeneous caching capabilities of edge servers intensify competition in multi-dependency task offloading and resource allocation, increasing the complexity of decision-making. To address the above issues, we first propose a Memory Resource Management Strategy (MRMS) that prevents system overload by maintaining server memory utilization within a safe threshold, thereby achieving efficient use of server resources. Then, we propose a Predictive model-based Optimal Edge Server selection (POES) algorithm, which improves offloading decision accuracy by predicting task completion times and selecting the optimal offloading location. Building on POES and the MRMS strategy, we propose a Multi-Application Dependent Task Offloading Strategy (MA-DTOS) algorithm. Our MA-DTOS algorithm incorporates the heterogeneous caching capabilities of edge nodes, determines the execution order based on task priorities, and formulates optimal offloading decisions for each task, thereby minimizing the total completion time of all tasks. Experimental results demonstrate that MA-DTOS reduces the average task completion time by approximately 45% and enhances server resource utilization by about 14.6% compared to existing benchmark algorithms.",[16136,16137,1208,16138,16139,15785,13218,16140,15787],"Wang, Min","Xie, Qin","Wang, Haoyuan","Du, Qifei","Rodrigues, Joel J. P. C.",[16142,21,16143,16144,21,15792,13226,16145,15794],"0000-0002-7571-1662","0000-0002-5543-4979","0009-0001-8530-3435","0000-0001-8657-3800","https:\u002F\u002Fdoi.org\u002F10.1109\u002Ftce.2025.3605671","W4413967101",[3123,23,12601,12100,240,529,6465,16149,16150,251,1113,288,179,928,5211],"Server","End user",{"type":39,"children":16152,"toc":16157},[16153],{"type":42,"tag":43,"props":16154,"children":16155},{},[16156],{"type":47,"value":16134},{"title":8,"searchDepth":49,"depth":49,"links":16158},[],"content:publications:2025:dependent-task-offloading-of-cross-applications-and-service-caching-for-end-edge.md","publications\u002F2025\u002Fdependent-task-offloading-of-cross-applications-and-service-caching-for-end-edge.md","publications\u002F2025\u002Fdependent-task-offloading-of-cross-applications-and-service-caching-for-end-edge",{"_path":16163,"_dir":15532,"_draft":7,"_partial":7,"_locale":8,"title":16164,"description":8,"_hidden":7,"systematic review\" authors":16165,"authors_orcid":16168,"year":15548,"doi":16171,"openalex_id":16172,"venue":16173,"abstract_screenshot":21,"keywords":16174,"body":16183,"_type":51,"_id":16187,"_source":53,"_file":16188,"_stem":16189,"_extension":56,"locale":57},"\u002Fpublications\u002F2025\u002Fdepression-diagnosis-through-emotional-induction-and-physiological-signals-a-sys","Depression diagnosis through emotional induction and physiological signals: ",[16166,8931,3461,16167],"Liu, Jing","Jo, Dong Hyun",[16169,8937,3464,16170],"0000-0002-6720-2171","0000-0002-6320-6829","https:\u002F\u002Fdoi.org\u002F10.1016\u002Fj.neubiorev.2025.106243","W4411918686","Neuroscience & Biobehavioral Reviews",[865,16175,16176,16177,16178,16179,16180,16181,16005,16182],"Narrative review","Depression (economics)","Emotional regulation","Cognitive psychology","Systematic review","Clinical psychology","Emotional well-being","Psychotherapist",{"type":39,"children":16184,"toc":16185},[],{"title":8,"searchDepth":49,"depth":49,"links":16186},[],"content:publications:2025:depression-diagnosis-through-emotional-induction-and-physiological-signals-a-sys.md","publications\u002F2025\u002Fdepression-diagnosis-through-emotional-induction-and-physiological-signals-a-sys.md","publications\u002F2025\u002Fdepression-diagnosis-through-emotional-induction-and-physiological-signals-a-sys",{"_path":16191,"_dir":15532,"_draft":7,"_partial":7,"_locale":8,"title":16192,"description":16193,"_hidden":7,"Reinforcement Learning\" authors":16194,"authors_orcid":16195,"year":15548,"doi":16198,"openalex_id":16199,"venue":21,"abstract_screenshot":21,"keywords":16200,"body":16201,"_type":51,"_id":16228,"_source":53,"_file":16229,"_stem":16230,"_extension":56,"locale":57},"\u002Fpublications\u002F2025\u002Fdesup2-supr-unifying-dvfs-and-early-exit-for-embedded-ai-inference-via-reinforce","De\u003Csup>2\u003C\u002Fsup>r: Unifying DVFS and Early-Exit for Embedded AI Inference vi","Executing neural networks on resource-constrained embedded devices faces challenges. Efforts have been made at the application and system levels to reduce the execution cost. Among them, the early-exit networks reduce computational cost through intermediate exits, while Dynamic Voltage and Frequency Scaling (DVFS) offers system energy reduction. Existing works strive to unify early-exit and DVFS for combined benefits on both timing and energy flexibility, yet limitations exist: 1) varying time constraints that make different exit points become more, or less, important in terms of inference accuracy, are not taken care of, and 2) the optimal decisions of unifying DVFS and early-exit as a multi-objective optimization problem are not achieved due to the large configuration space. To address these challenges, we propose Dr2r, a reinforcement learning-based framework that jointly optimizes early-exit points and DVFS settings for continuous inference. In particular, Dr2r includes a cross-training mechanism that fine-tunes the early-exit network to accommodate dynamic time constraints and system conditions. Experimental results demonstrate that Dr2r achieves up to 22.03% energy reduction and 3.23% accuracy gain compared to contemporary techniques.",[9302,9304,16019,9305,7175,4626,6111,5532],[9308,9310,16022,16196,16197,4637,6113,21],"0000-0002-1525-2900","0000-0003-0608-8093","https:\u002F\u002Fdoi.org\u002F10.23919\u002Fdate64628.2025.10992707","W4410553228",[5304,23,4649,37],{"type":39,"children":16202,"toc":16226},[16203],{"type":42,"tag":43,"props":16204,"children":16205},{},[16206,16208,16212,16214,16218,16220,16224],{"type":47,"value":16207},"Executing neural networks on resource-constrained embedded devices faces challenges. Efforts have been made at the application and system levels to reduce the execution cost. Among them, the early-exit networks reduce computational cost through intermediate exits, while Dynamic Voltage and Frequency Scaling (DVFS) offers system energy reduction. Existing works strive to unify early-exit and DVFS for combined benefits on both timing and energy flexibility, yet limitations exist: 1) varying time constraints that make different exit points become more, or less, important in terms of inference accuracy, are not taken care of, and 2) the optimal decisions of unifying DVFS and early-exit as a multi-objective optimization problem are not achieved due to the large configuration space. To address these challenges, we propose Dr",{"type":42,"tag":11663,"props":16209,"children":16210},{"xmlns:mml":1465,"xmlnsXLink":8791},[16211],{"type":47,"value":1480},{"type":47,"value":16213},"r, a reinforcement learning-based framework that jointly optimizes early-exit points and DVFS settings for continuous inference. In particular, Dr",{"type":42,"tag":11663,"props":16215,"children":16216},{"xmlns:mml":1465,"xmlnsXLink":8791},[16217],{"type":47,"value":1480},{"type":47,"value":16219},"r includes a cross-training mechanism that fine-tunes the early-exit network to accommodate dynamic time constraints and system conditions. Experimental results demonstrate that Dr",{"type":42,"tag":11663,"props":16221,"children":16222},{"xmlns:mml":1465,"xmlnsXLink":8791},[16223],{"type":47,"value":1480},{"type":47,"value":16225},"r achieves up to 22.03% energy reduction and 3.23% accuracy gain compared to contemporary techniques.",{"title":8,"searchDepth":49,"depth":49,"links":16227},[],"content:publications:2025:desup2-supr-unifying-dvfs-and-early-exit-for-embedded-ai-inference-via-reinforce.md","publications\u002F2025\u002Fdesup2-supr-unifying-dvfs-and-early-exit-for-embedded-ai-inference-via-reinforce.md","publications\u002F2025\u002Fdesup2-supr-unifying-dvfs-and-early-exit-for-embedded-ai-inference-via-reinforce",{"_path":16232,"_dir":15532,"_draft":7,"_partial":7,"_locale":8,"title":16233,"description":16234,"_hidden":7,"Total-Body Dynamic PET of Short-Duration Scan authors":16235,"authors_orcid":16243,"year":15548,"doi":16253,"openalex_id":16254,"venue":16255,"abstract_screenshot":21,"keywords":16256,"body":16262,"_type":51,"_id":16270,"_source":53,"_file":16271,"_stem":16272,"_extension":56,"locale":57},"\u002Fpublications\u002F2025\u002Fdiffusion-based-model-for-parametric-i-k-subi-sub-i-generation-from-total-body-d","Diffusion-Based Model for Parametric \u003Ci> K \u003Csub>i\u003C\u002Fsub> \u003C\u002Fi> Generation From","Dynamic positron emission tomography (PET) parametric imaging typically requires a 60-minute acquisition period, causing patient discomfort and reducing clinical efficiency. This study explores the feasibility of generating parametric Ki images from 10-minute dynamic PET images acquired in the early or late scanning phases employing a multi-channel feature fusion cold sampling (MCFFCoS) framework. PET data from 103 patients are acquired using the uEXPLORER total-body PET\u002FCT scanner during 60-minute scans. This study conducts deep learning experiments, taking early-phase or late-phase PET images as input, respectively. The generated Ki images are evaluated by visual quality and quantitative metrics, including root mean squared error (RMSE), structural similarity index (SSIM), and peak signal-to-noise ratio (PSNR). Volumes of interest (VOIs) analysis is performed using linear regression and Bland-Altman plots. In the quantitative evaluation of total-body data, the parametric Ki images generated from late-phase PET data generally outperform those derived from early-phase data. The analysis of VOIs indicates that the appropriate scanning protocol for PET parametric imaging may vary for different body regions. The deep learning approach is able to generate high-quality parametric Ki images from 10-minute dynamic PET scans, bypassing the requirements of long acquisition time for the estimation of blood input function in kinetic modeling.",[16236,16237,15750,8931,16082,16238,16239,16240,16241,15751,15752,15753,16242,15754],"Wen, Meiyuan","Wu, Yaping","Chen, Zixiang","Gao, Yunlong","Li, Wenbo","Yang, Xinlan","Wang, Meiyun",[16244,16245,15757,8937,16089,16246,16247,16248,21,16249,16250,16251,16252,15759],"0009-0001-8726-6017","0000-0002-2979-5332","0000-0002-9042-4477","0009-0005-4858-3545","0009-0004-8574-7046","0000-0003-1642-6631","0000-0002-8558-5102","0000-0001-6257-0875","0000-0001-8779-6184","https:\u002F\u002Fdoi.org\u002F10.1109\u002Ftrpms.2025.3566556","W4410027440","IEEE Transactions on Radiation and Plasma Medical Sciences",[16257,16258,16259,16260,34,380,3666,3597,16261,8139],"Duration (music)","Diffusion","Parametric statistics","Nuclear medicine","Thermodynamics",{"type":39,"children":16263,"toc":16268},[16264],{"type":42,"tag":43,"props":16265,"children":16266},{},[16267],{"type":47,"value":16234},{"title":8,"searchDepth":49,"depth":49,"links":16269},[],"content:publications:2025:diffusion-based-model-for-parametric-i-k-subi-sub-i-generation-from-total-body-d.md","publications\u002F2025\u002Fdiffusion-based-model-for-parametric-i-k-subi-sub-i-generation-from-total-body-d.md","publications\u002F2025\u002Fdiffusion-based-model-for-parametric-i-k-subi-sub-i-generation-from-total-body-d",{"_path":16274,"_dir":15532,"_draft":7,"_partial":7,"_locale":8,"title":16275,"description":16276,"_hidden":7,"authors":16277,"authors_orcid":16278,"year":15548,"doi":16279,"openalex_id":16280,"venue":13309,"abstract_screenshot":21,"keywords":16281,"body":16285,"_type":51,"_id":16293,"_source":53,"_file":16294,"_stem":16295,"_extension":56,"locale":57},"\u002Fpublications\u002F2025\u002Fdo-chinese-firms-esg-activities-mitigate-stock-price-crash-risk","Do Chinese Firms' ESG Activities Mitigate Stock Price Crash Risk?","ABSTRACT We investigate the impact of firms' Environmental, Social and Governance (ESG) activities on stock price crash risk during crises. We use the US–China trade war as a negative external shock and find that higher levels of ESG activities in Chinese firms help mitigate the crash risk. ESG activities help firms gain more resilience as a strategic tool for managing investor expectations by providing more information transparency and improving corporate governance. Further analysis shows that the mitigation effects are more pronounced for privately owned firms than their state‐owned counterparts and for firms challenged by higher market competition than those facing lower competition.",[268,13277,11700],[272,13279,11703],"https:\u002F\u002Fdoi.org\u002F10.1111\u002Feufm.70018","W4414269854",[3257,16282,16283,4858,16284,555,8021],"Crash","Shock (circulatory)","Transparency (behavior)",{"type":39,"children":16286,"toc":16291},[16287],{"type":42,"tag":43,"props":16288,"children":16289},{},[16290],{"type":47,"value":16276},{"title":8,"searchDepth":49,"depth":49,"links":16292},[],"content:publications:2025:do-chinese-firms-esg-activities-mitigate-stock-price-crash-risk.md","publications\u002F2025\u002Fdo-chinese-firms-esg-activities-mitigate-stock-price-crash-risk.md","publications\u002F2025\u002Fdo-chinese-firms-esg-activities-mitigate-stock-price-crash-risk",{"_path":16297,"_dir":15532,"_draft":7,"_partial":7,"_locale":8,"title":16298,"description":16299,"_hidden":7,"authors":16300,"authors_orcid":16305,"year":15548,"doi":16309,"openalex_id":16310,"venue":16121,"abstract_screenshot":21,"keywords":16311,"body":16313,"_type":51,"_id":16321,"_source":53,"_file":16322,"_stem":16323,"_extension":56,"locale":57},"\u002Fpublications\u002F2025\u002Fdsrs-delight-sequential-recommender-system","DSRS: DELIGHT sequential recommender system","Sequential recommendation is becoming more critical in a variety of e-commerce platforms. The aim of sequential recommender systems is to model the dynamic preferences of users based on their previous actions and predict what they will do next. The collected user activity logs on real-world platforms could be quite long. This wealth of information provides options to follow users’ actual interests. Prior efforts primarily aimed at providing recommendations following recent behaviors. Meanwhile, the entire sequential data may not be used efficiently since early actions may influence users’ decisions at present. Furthermore, scanning the whole behavior sequence while doing inference for every user is unbearable due to the need for prompt reaction time in real-world applications. To this end, we propose the DELIGHT Sequential Recommender System (DSRS), which takes the above properties into account to recommend the next item the user might be interested in. DSRS divides the entire user behavior sequence into long- and short-term segments and models them through independent networks before integrating their learned representations. In particular, the first network learns user long-term, whereas the second one learns short-term preferences and then combines them for an efficient joint recommendation. Experimental findings across four datasets show that our model outperforms other state-of-the-art sequential models in apprehending long-term dependence.",[16301,13218,16302,15540,16303,16304],"Shah, Syed Tauhid Ullah","Yamani, Shirin","Gazzawe, Foziah","Razzak, Imran",[16306,13226,21,15547,16307,16308],"0000-0002-6195-0611","0000-0003-1200-9849","0000-0002-3930-6600","https:\u002F\u002Fdoi.org\u002F10.1016\u002Fj.engappai.2024.109936","W4406063205",[23,16312,37,6950],"Recommender system",{"type":39,"children":16314,"toc":16319},[16315],{"type":42,"tag":43,"props":16316,"children":16317},{},[16318],{"type":47,"value":16299},{"title":8,"searchDepth":49,"depth":49,"links":16320},[],"content:publications:2025:dsrs-delight-sequential-recommender-system.md","publications\u002F2025\u002Fdsrs-delight-sequential-recommender-system.md","publications\u002F2025\u002Fdsrs-delight-sequential-recommender-system",{"_path":16325,"_dir":15532,"_draft":7,"_partial":7,"_locale":8,"title":16326,"description":8,"_hidden":7,"Recognizing Keywords and Speakers authors":16327,"authors_orcid":16329,"year":15548,"doi":16332,"openalex_id":16333,"venue":687,"abstract_screenshot":21,"keywords":16334,"body":16336,"_type":51,"_id":16340,"_source":53,"_file":16341,"_stem":16342,"_extension":56,"locale":57},"\u002Fpublications\u002F2025\u002Fdual-branch-starnet-with-mutual-attention-and-u-net-denoising-for-simultaneously","Dual-Branch StarNet with Mutual Attention and U-Net Denoising for Simultaneously",[9302,16019,5532,6111,7175,4626,16328],"Xia, Yinshui",[9308,16022,5537,6113,16330,4637,16331],"0000-0003-2855-9570","0000-0002-3831-3876","https:\u002F\u002Fdoi.org\u002F10.1007\u002F978-981-96-6588-4_20","W4411555784",[23,9864,11359,16335,37,4876,6980,34,5925],"Net (polyhedron)",{"type":39,"children":16337,"toc":16338},[],{"title":8,"searchDepth":49,"depth":49,"links":16339},[],"content:publications:2025:dual-branch-starnet-with-mutual-attention-and-u-net-denoising-for-simultaneously.md","publications\u002F2025\u002Fdual-branch-starnet-with-mutual-attention-and-u-net-denoising-for-simultaneously.md","publications\u002F2025\u002Fdual-branch-starnet-with-mutual-attention-and-u-net-denoising-for-simultaneously",{"_path":16344,"_dir":15532,"_draft":7,"_partial":7,"_locale":8,"title":16345,"description":16346,"_hidden":7,"Healthcare authors":16347,"authors_orcid":16352,"year":15548,"doi":16356,"openalex_id":16357,"venue":9425,"abstract_screenshot":21,"keywords":16358,"body":16359,"_type":51,"_id":16367,"_source":53,"_file":16368,"_stem":16369,"_extension":56,"locale":57},"\u002Fpublications\u002F2025\u002Fdynamic-multimodal-fusion-for-real-time-lung-cancer-diagnostics-in-iomt-enabled","Dynamic Multimodal Fusion for Real-Time Lung Cancer Diagnostics in IoMT-Enabled","The Internet of Medical Things (IoMT) has transformed healthcare by integrating medical devices, wearables, and electronic medical records (EMRs). These technologies enable real-time diagnostics, personalized monitoring, and proactive healthcare delivery. However, applying the IoMT to critical areas like lung cancer detection remains challenging due to multimodal data heterogeneity, real-time processing requirements, and resource constraints nature of the devices. To address these challenges, in this paper, we present a novel IoMT-based framework for lung cancer diagnostics that unifies imaging data, sensor readings, and EMRs into a cohesive pipeline. The proposed framework employs convolutional neural networks, vision transformers for imaging analysis, temporal convolutional networks for time-series sensor data, and an attention-based fusion mechanism for dynamic multimodal integration. These techniques are supported by preprocessing methods such as U-Net++ segmentation and temporal feature extraction to enhance data consistency and efficiency. Additionally, lightweight models are deployed on IoMT devices to ensure scalability and real-time inference, making the framework practical for resource-constrained environments. Extensive evaluation demonstrates that the framework achieves 98% accuracy, 98% F1-score, and 0.99 AUC (area under the curve) of the ROC (receiver operating characteristic (AUC-ROC). These results show the proposed framework outperforms state-of-the-art approaches and showcases its potential for large-scale clinical deployment.",[16348,16349,16350,13218,15540,15541,16351],"Ping, Wei","Sun, Qihang","Wang, Qi","Zhang, Ni",[21,16353,16354,13226,15547,21,16355],"0000-0002-8449-0726","0000-0002-8991-281X","0009-0005-0130-2240","https:\u002F\u002Fdoi.org\u002F10.1109\u002Fjiot.2025.3576482","W4411019678",[23,5896,37],{"type":39,"children":16360,"toc":16365},[16361],{"type":42,"tag":43,"props":16362,"children":16363},{},[16364],{"type":47,"value":16346},{"title":8,"searchDepth":49,"depth":49,"links":16366},[],"content:publications:2025:dynamic-multimodal-fusion-for-real-time-lung-cancer-diagnostics-in-iomt-enabled.md","publications\u002F2025\u002Fdynamic-multimodal-fusion-for-real-time-lung-cancer-diagnostics-in-iomt-enabled.md","publications\u002F2025\u002Fdynamic-multimodal-fusion-for-real-time-lung-cancer-diagnostics-in-iomt-enabled",{"_path":16371,"_dir":15532,"_draft":7,"_partial":7,"_locale":8,"title":16372,"description":16373,"_hidden":7,"Intelligence authors":16374,"authors_orcid":16376,"year":15548,"doi":16378,"openalex_id":16379,"venue":9425,"abstract_screenshot":21,"keywords":16380,"body":16382,"_type":51,"_id":16390,"_source":53,"_file":16391,"_stem":16392,"_extension":56,"locale":57},"\u002Fpublications\u002F2025\u002Fdynamic-transfer-learning-switching-approach-using-resource-benchmark-in-edge-in","Dynamic Transfer Learning Switching Approach Using Resource Benchmark in Edge","Machine learning (ML) techniques are applied for profiling computing and processing resources data collected while running deep neural network models on edge devices. Adaptive deep neural network (DNN) model switching requires proper benchmarking for categorizing AI models based on their applications and computational resources enabled by their processing accelerators. Based on benchmark metrics, DNN models can be classified into tiny, low, small, medium, and large resources, then identify DNN models that perform well within resource constraints. Ensure efficient resource allocation, latency management, and trade-off between accuracy and resource. In this work, we propose a benchmark for edge transfer artificial intelligence learning service (TALS) that uses ML techniques. They aim at classifying DNN models by their target edge applications while running edge inferences. We used both unsupervised learning (UL) and supervised learning (SL) techniques to identify the most effective features for the TALS models and to benchmark the performance of edge devices. To achieve this, two approaches were investigated: first, determining features based on edge inference’s computing resources profiling using principal component analysis; and second, classifying the DNN models at the target application level using a regression approach based on historical resource utilization data. In addition, we propose a dynamic model transfer learning that switches between a set of pre-trained and optimized and quantized DNN models based on the cost function. ML techniques learn resource-aware prediction from new resource allocation data and ensure that the multicriteria switch cost selects the inference task models that meet the edge resource constraint requirements. The experimental results highlight a strong relationship between the supervised learning model and the clustering execution method. The dynamic switching approach on real edge devices demonstrates dynamic switching between models according to inference task complexity. We conclude that dynamic switching models allows to ensure smooth operation without overloading resources in edge intelligence.",[11726,16375,5667,5665],"Rajkumar, Chellakannu",[11728,16377,5670,5669],"0000-0002-0838-5350","https:\u002F\u002Fdoi.org\u002F10.1109\u002Fjiot.2025.3557408","W4409129983",[23,209,16381,6465,37,924,249,215,251],"Transfer of learning",{"type":39,"children":16383,"toc":16388},[16384],{"type":42,"tag":43,"props":16385,"children":16386},{},[16387],{"type":47,"value":16373},{"title":8,"searchDepth":49,"depth":49,"links":16389},[],"content:publications:2025:dynamic-transfer-learning-switching-approach-using-resource-benchmark-in-edge-in.md","publications\u002F2025\u002Fdynamic-transfer-learning-switching-approach-using-resource-benchmark-in-edge-in.md","publications\u002F2025\u002Fdynamic-transfer-learning-switching-approach-using-resource-benchmark-in-edge-in",{"_path":16394,"_dir":15532,"_draft":7,"_partial":7,"_locale":8,"title":16395,"description":16396,"_hidden":7,"and process evaluation via life cycle assessment and machine learning authors":16397,"authors_orcid":16410,"year":15548,"doi":16418,"openalex_id":16419,"venue":16420,"abstract_screenshot":21,"keywords":16421,"body":16426,"_type":51,"_id":16434,"_source":53,"_file":16435,"_stem":16436,"_extension":56,"locale":57},"\u002Fpublications\u002F2025\u002Feco-friendly-production-of-agnps-by-ultrasound-intensified-continuous-method-and","Eco-friendly production of AgNPs by ultrasound-intensified continuous method,","• Eco-friendly ultrasound-intensified continuous preparation of AgNPs was developed. • Key synthesis parameters governed the physicochemical properties of AgNPs. • 2–5 nm spherical AgNPs exhibited enhanced photothermal and antibacterial activity. • Machine Learning was applied to investigate process parameter importance. • The process sustainability was evaluated by Life Cycle Assessment. Owing to their excellent biocompatibility and antibacterial properties, the global annual production of silver nanoparticles (AgNPs) is estimated at 400–800 tons. Therefore, developing a green and safe approach for AgNPs synthesis is urgently required. However, the conventional AgNPs manufacturing methods required toxic reductant and higher energy consumption, which makes the reaction system harmful to humans and environment. In this study, an eco-friendly ultrasound-intensified continuous system employing minimal toxic reagents was developed. The AgNPs formation process was intensified by cavitation instead of using toxic and strong reductants. Several analytical methods were conducted to systematically investigate the mechanism and performance of as-synthesized AgNPs, such as particle size distribution, zeta potential, UV–visible absorption, morphology, yield calculation, as well as in vitro photothermal, and antibacterial. The results clearly indicated that the physicochemical properties of AgNPs could be tuned by adjusting process parameters, including temperature, feeding rate, and ultrasonic power. Specifically, the AgNPs prepared at 90 ℃, 600 W and 50 µL\u002Fmin exhibited smaller size (2–5 nm) with monodisperse, spherical shape, higher yield, enhanced photothermal, and antibacterial activities. Furthermore, life-cycle assessment (LCA) and machine learning (ML) were employed to evaluate the process sustainability and identify the key influencing parameters. Comprehensive consideration of safety, experimental results, and LCA outcomes demonstrated that the ultrasound-intensified continuous method proposed in this study is superior to the traditional NaBH 4 -based batch synthesis at the laboratory scale.",[16398,16399,16400,16401,16402,16403,16404,16405,1181,16406,16407,16408,16409],"Hu, Juncheng","Nie, Wenyu","Zhao, Suxu","Liu, Yong","Zhu, Hengyi","Tu, Shuibin","Zhang, Jiawei","Yang, K.","Lian, Justin Z.","Dong, Bin","Cucurachi, Stefano","Gao, Yuan",[16411,21,21,16412,21,16413,16414,21,1184,21,16415,16416,16417],"0000-0002-2204-4915","0000-0003-4822-8939","0000-0002-9553-6857","0000-0003-3534-9299","0000-0003-4741-3593","0000-0001-9763-2669","0000-0001-9407-1528","https:\u002F\u002Fdoi.org\u002F10.1016\u002Fj.ultsonch.2025.107682","W4416345138","Ultrasonics Sonochemistry",[16422,16423,135,16424,8356,16425,7321,7322],"Silver nanoparticle","Biocompatibility","Zeta potential","Green chemistry",{"type":39,"children":16427,"toc":16432},[16428],{"type":42,"tag":43,"props":16429,"children":16430},{},[16431],{"type":47,"value":16396},{"title":8,"searchDepth":49,"depth":49,"links":16433},[],"content:publications:2025:eco-friendly-production-of-agnps-by-ultrasound-intensified-continuous-method-and.md","publications\u002F2025\u002Feco-friendly-production-of-agnps-by-ultrasound-intensified-continuous-method-and.md","publications\u002F2025\u002Feco-friendly-production-of-agnps-by-ultrasound-intensified-continuous-method-and",{"_path":16438,"_dir":15532,"_draft":7,"_partial":7,"_locale":8,"title":16439,"description":16440,"_hidden":7,"Consumer Electronics authors":16441,"authors_orcid":16445,"year":15548,"doi":16449,"openalex_id":16450,"venue":13232,"abstract_screenshot":21,"keywords":16451,"body":16454,"_type":51,"_id":16462,"_source":53,"_file":16463,"_stem":16464,"_extension":56,"locale":57},"\u002Fpublications\u002F2025\u002Fefficient-resource-allocation-using-service-function-chain-in-agricultural-consu","Efficient Resource Allocation Using Service Function Chain in Agricultural","As the level of intelligence in agricultural consumer electronics continues to advance, data-driven devices are often faced with challenges such as resource shortages, high real-time requirements, and complex data processing. In particular, the diversity and variability of massive agricultural consumer electronics in the agricultural Internet of Things (IoT) complicate the resource allocation process. Traditional centralized cloud computing architectures often struggle to meet these demands. To address these issues, this paper proposes a resource collaborative allocation method for agricultural consumer electronics based on Service Function Chain (SFC). First, we formalize the resource requirements of various agricultural consumer electronics applications based on SFC in a resource mapping model. Subsequently, we develop a multidimensional resource balancing model with computing resources, storage resources, and bandwidth resources requirements of agricultural consumer electronics. We also devise a fine-grained end-to-end latency model to comprehensively consider the effective utilization of multidimensional resources and latency guarantees for agricultural consumer electronics. Finally, we employ a deep reinforcement learning algorithm with experience replay to optimize the resource allocation strategy in real-time, thereby enhancing the agricultural consumer electronics system’s responsiveness and resource utilization efficiency. Experimental results demonstrate that our proposed strategy outperforms existing methods in terms of improving resource utilization and reducing latency.",[16442,15785,16443,13221,16444,13218],"Yao, Jiamin","Xie, Yu","Lin, Qiao",[16446,15792,16447,13229,16448,13226],"0000-0002-7269-2064","0000-0002-0928-3823","0009-0007-7760-993X","https:\u002F\u002Fdoi.org\u002F10.1109\u002Ftce.2025.3541057","W4407361588",[12601,240,100,16452,16123,16453,924,3596,23,288,178,24,750,179,928,751,251,36,289],"Agriculture","Resource management (computing)",{"type":39,"children":16455,"toc":16460},[16456],{"type":42,"tag":43,"props":16457,"children":16458},{},[16459],{"type":47,"value":16440},{"title":8,"searchDepth":49,"depth":49,"links":16461},[],"content:publications:2025:efficient-resource-allocation-using-service-function-chain-in-agricultural-consu.md","publications\u002F2025\u002Fefficient-resource-allocation-using-service-function-chain-in-agricultural-consu.md","publications\u002F2025\u002Fefficient-resource-allocation-using-service-function-chain-in-agricultural-consu",{"_path":16466,"_dir":15532,"_draft":7,"_partial":7,"_locale":8,"title":16467,"description":8,"_hidden":7,"framework with metamorphic relations generated by GPT\" authors":16468,"authors_orcid":16469,"year":15548,"doi":16470,"openalex_id":16471,"venue":9881,"abstract_screenshot":21,"keywords":16472,"body":16473,"_type":51,"_id":16477,"_source":53,"_file":16478,"_stem":16479,"_extension":56,"locale":57},"\u002Fpublications\u002F2025\u002Fenhancing-autonomous-driving-simulations-a-hybrid-metamorphic-testing-framework","Enhancing autonomous driving simulations: A hybrid metamorphic testin",[8041,596,5407,595,8040,1156],[8045,600,5411,599,8044,1158],"https:\u002F\u002Fdoi.org\u002F10.1016\u002Fj.infsof.2025.107828","W4412430569",[3788,23,3789,3790],{"type":39,"children":16474,"toc":16475},[],{"title":8,"searchDepth":49,"depth":49,"links":16476},[],"content:publications:2025:enhancing-autonomous-driving-simulations-a-hybrid-metamorphic-testing-framework.md","publications\u002F2025\u002Fenhancing-autonomous-driving-simulations-a-hybrid-metamorphic-testing-framework.md","publications\u002F2025\u002Fenhancing-autonomous-driving-simulations-a-hybrid-metamorphic-testing-framework",{"_path":16481,"_dir":15532,"_draft":7,"_partial":7,"_locale":8,"title":16482,"description":16483,"_hidden":7,"Split Federated Learning and Deep Learning Optimization authors":16484,"authors_orcid":16488,"year":15548,"doi":16491,"openalex_id":16492,"venue":13232,"abstract_screenshot":21,"keywords":16493,"body":16494,"_type":51,"_id":16502,"_source":53,"_file":16503,"_stem":16504,"_extension":56,"locale":57},"\u002Fpublications\u002F2025\u002Fenhancing-cancer-detection-capabilities-in-medical-consumer-electronics-through","Enhancing Cancer Detection Capabilities in Medical Consumer Electronics Through","The increasing demand for accurate and accessible cancer detection has driven the development of AI-driven diagnostic systems on consumer-grade medical electronics. However, deploying large-scale deep learning models on these devices presents challenges due to limited computational resources, network constraints, and data privacy concerns. In this study, we propose an innovative Split Federated Learning (SFL) framework that synergistically combines the strengths of federated learning and split learning. The SFL framework introduces a novel hybrid architecture where deep learning models are partitioned between client-side and server-side components, enabling efficient local feature extraction while preserving data privacy through secure, encrypted intermediate feature transmission. Experiments conducted on the BreakHis dataset demonstrate the framework’s effectiveness, with the proposed method achieving a 93.1% accuracy while significantly reducing communication overhead. We further analyze the impact of dimensionality reduction techniques and model partitioning configurations to balance accuracy with efficiency. Results show that the SFL framework provides a practical, scalable solution for distributed cancer detection in real-world medical applications, offering a promising approach for privacy-preserving and bandwidth-efficient AI deployment on medical consumer electronics.",[16485,16444,13218,13221,16486,16487],"Li, Xinyue","Alenazi, Mohammed J. F.","Yang, Jing",[21,16448,13226,13229,16489,16490],"0000-0001-6593-112X","0000-0002-0438-6006","https:\u002F\u002Fdoi.org\u002F10.1109\u002Ftce.2025.3545963","W4407937987",[12601,23,9396,9397,6976,37,928,179,380],{"type":39,"children":16495,"toc":16500},[16496],{"type":42,"tag":43,"props":16497,"children":16498},{},[16499],{"type":47,"value":16483},{"title":8,"searchDepth":49,"depth":49,"links":16501},[],"content:publications:2025:enhancing-cancer-detection-capabilities-in-medical-consumer-electronics-through.md","publications\u002F2025\u002Fenhancing-cancer-detection-capabilities-in-medical-consumer-electronics-through.md","publications\u002F2025\u002Fenhancing-cancer-detection-capabilities-in-medical-consumer-electronics-through",{"_path":16506,"_dir":15532,"_draft":7,"_partial":7,"_locale":8,"title":16507,"description":16508,"_hidden":7,"from a Sino-foreign institution\" authors":16509,"authors_orcid":16510,"year":15548,"doi":16511,"openalex_id":16512,"venue":15439,"abstract_screenshot":21,"keywords":16513,"body":16514,"_type":51,"_id":16522,"_source":53,"_file":16523,"_stem":16524,"_extension":56,"locale":57},"\u002Fpublications\u002F2025\u002Fenhancing-higher-education-through-student-staff-collaboration-case-studies-from","Enhancing higher education through student-staff collaboration: case studie","University of Nottingham Ningbo China (UNNC) was the first Sino-foreign higher education institution (SfHEI). It has a history of innovation, including through collaborations with students in research and application projects. This paper reports on three student-staff collaborations to design and create technology-enhanced teaching or training interventions. Case studies are presented for each of the three collaborations. The first case study examines the development of a mobile application to support human-centred design (HCD) education. The second case study focuses on an augmented reality (AR) educational game for teaching Design for Manufacturing and Assembly (DfMA). The third case study investigates the use of mixed reality (MR) for firefighting equipment training. The findings highlight the effectiveness of these digital pedagogies in fostering strong student-staff partnerships, and for enhancing collaborative learning experiences. The paper concludes with pedagogical implications and recommendations for future research in technology-enhanced education.",[5667,7077,5407,11421,8380,595],[5670,7081,5411,11428,8384,599],"https:\u002F\u002Fdoi.org\u002F10.1504\u002Fijmlo.2025.147207","W4412602189",[3095,15441,4831,3903,1379,865,1380,866,1358,23,380,869,3096],{"type":39,"children":16515,"toc":16520},[16516],{"type":42,"tag":43,"props":16517,"children":16518},{},[16519],{"type":47,"value":16508},{"title":8,"searchDepth":49,"depth":49,"links":16521},[],"content:publications:2025:enhancing-higher-education-through-student-staff-collaboration-case-studies-from.md","publications\u002F2025\u002Fenhancing-higher-education-through-student-staff-collaboration-case-studies-from.md","publications\u002F2025\u002Fenhancing-higher-education-through-student-staff-collaboration-case-studies-from",{"_path":16526,"_dir":15532,"_draft":7,"_partial":7,"_locale":8,"title":16527,"description":8,"_hidden":7,"to John the Ripper\" authors":16528,"authors_orcid":16531,"year":15548,"doi":16533,"openalex_id":16534,"venue":4049,"abstract_screenshot":21,"keywords":16535,"body":16536,"_type":51,"_id":16540,"_source":53,"_file":16541,"_stem":16542,"_extension":56,"locale":57},"\u002Fpublications\u002F2025\u002Fenhancing-learning-through-a-web-based-oer-application-of-metamorphic-testing-to","Enhancing Learning Through a Web-Based OER: Application of Metamorphic Testin",[16529,16530,595],"Song, Lindsay Elle Chiara","Lee, Aaron",[21,16532,599],"0000-0002-7452-1648","https:\u002F\u002Fdoi.org\u002F10.1007\u002F978-981-95-4499-8_3","W4416633745",[605,3227,133,8417,139,6924],{"type":39,"children":16537,"toc":16538},[],{"title":8,"searchDepth":49,"depth":49,"links":16539},[],"content:publications:2025:enhancing-learning-through-a-web-based-oer-application-of-metamorphic-testing-to.md","publications\u002F2025\u002Fenhancing-learning-through-a-web-based-oer-application-of-metamorphic-testing-to.md","publications\u002F2025\u002Fenhancing-learning-through-a-web-based-oer-application-of-metamorphic-testing-to",{"_path":16544,"_dir":15532,"_draft":7,"_partial":7,"_locale":8,"title":16545,"description":16546,"_hidden":7,"Search and Ant Colony Optimization-Based Global Search\" authors":16547,"authors_orcid":16548,"year":15548,"doi":16549,"openalex_id":16550,"venue":8774,"abstract_screenshot":21,"keywords":16551,"body":16553,"_type":51,"_id":16561,"_source":53,"_file":16562,"_stem":16563,"_extension":56,"locale":57},"\u002Fpublications\u002F2025\u002Fesaco-fast-e-graph-extraction-via-orchestrated-simulated-annealing-based-local-s","ESACO: Fast E-Graph Extraction via Orchestrated Simulated Annealing-Based Loca","Equality graphs (E-graphs) offer a compact representation for vast sets of equivalent implementations, proving invaluable in hardware synthesis and program optimization. Nevertheless, extracting the optimal implementation from an e-graph constitutes an NP-hard challenge. Current extraction methods face critical limitations: heuristic-based approaches fail to produce high-quality solutions, GPU-accelerated techniques lack determinism and demand excessive memory, exact ILP methods struggle with scalability, and specialized solvers only function for particular e-graph types. To address this, we present ESACO, a novel deterministic framework that rapidly and consistently converges to high-quality solutions across diverse benchmarks by effectively combining Simulated Annealing (SA) for local refinement with Ant Colony Optimization (ACO) for global search. First, we develop a synergistic hybrid-heuristic framework that orchestrates complementary search paradigms, harmonizing ACO’s global exploration capabilities with SA’s targeted local exploitation mechanisms. Second, we introduce an SA-based local search method that employs novel rip-up and repair moves for efficiently refining promising solutions. Third, we propose an ACO-based global search algorithm incorporating strategic restart mechanisms to effectively explore the complex solution space while escaping local optima. Experimental results demonstrate that ESACO achieves up to 42× speedup using a single thread compared to state-of-the-art GPU-accelerated methods while maintaining or improving solution quality.",[6184,11085,5532,5534],[11087,11088,5537,5539],"https:\u002F\u002Fdoi.org\u002F10.1109\u002Ftcad.2025.3611101","W4414310244",[208,211,8777,99,16552,8992,100],"Global optimization",{"type":39,"children":16554,"toc":16559},[16555],{"type":42,"tag":43,"props":16556,"children":16557},{},[16558],{"type":47,"value":16546},{"title":8,"searchDepth":49,"depth":49,"links":16560},[],"content:publications:2025:esaco-fast-e-graph-extraction-via-orchestrated-simulated-annealing-based-local-s.md","publications\u002F2025\u002Fesaco-fast-e-graph-extraction-via-orchestrated-simulated-annealing-based-local-s.md","publications\u002F2025\u002Fesaco-fast-e-graph-extraction-via-orchestrated-simulated-annealing-based-local-s",{"_path":16565,"_dir":15532,"_draft":7,"_partial":7,"_locale":8,"title":16566,"description":8,"_hidden":7,"Comparative Analysis of Traditional Methods and Performance Metrics\" authors":16567,"authors_orcid":16568,"year":15548,"doi":16570,"openalex_id":16571,"venue":16572,"abstract_screenshot":21,"keywords":16573,"body":16574,"_type":51,"_id":16578,"_source":53,"_file":16579,"_stem":16580,"_extension":56,"locale":57},"\u002Fpublications\u002F2025\u002Fevaluating-denoising-approaches-for-rgb-infrared-images-systematic-review-and-co","Evaluating Denoising Approaches for RGB-Infrared Images: Systematic Review an",[11352,5667,10031,709],[11354,5670,21,16569],"0000-0001-7546-1408","https:\u002F\u002Fdoi.org\u002F10.1007\u002Fs11265-025-01957-8","W4410921808","Journal of Signal Processing Systems",[37,4876,23,11359,7754,4391],{"type":39,"children":16575,"toc":16576},[],{"title":8,"searchDepth":49,"depth":49,"links":16577},[],"content:publications:2025:evaluating-denoising-approaches-for-rgb-infrared-images-systematic-review-and-co.md","publications\u002F2025\u002Fevaluating-denoising-approaches-for-rgb-infrared-images-systematic-review-and-co.md","publications\u002F2025\u002Fevaluating-denoising-approaches-for-rgb-infrared-images-systematic-review-and-co",{"_path":16582,"_dir":15532,"_draft":7,"_partial":7,"_locale":8,"title":16583,"description":16584,"_hidden":7,"authors":16585,"authors_orcid":16586,"year":15548,"doi":16587,"openalex_id":16588,"venue":21,"abstract_screenshot":21,"keywords":16589,"body":16590,"_type":51,"_id":16598,"_source":53,"_file":16599,"_stem":16600,"_extension":56,"locale":57},"\u002Fpublications\u002F2025\u002Fevaluation-of-the-code-generated-by-large-language-models-the-state-of-the-art","Evaluation of the Code Generated By Large Language Models: The State of the Art","The rapid development of Large Language Models (LLMs), such as ChatGPT and DeepSeek, has revolutionized software development, particularly in the domain of automated code generation. These models, built on architectures like the Transformer, have demonstrated remarkable capabilities in generating human-like text and source code, significantly enhancing developer productivity and reducing development time. However, the widespread adoption of LLMs for code generation raises concerns regarding the reliability, quality, and potential risks associated with the generated code. This article illustrates and analyzes the state of the art in evaluating LLM-generated code, summarizing research findings, and application areas. This paper highlights the challenges in distinguishing between machine-generated and human-written code, as well as the potential for LLMs to introduce security vulnerabilities and maintainability issues. We discuss the implications of these findings for both researchers and practitioners, emphasizing the need for continued research in the evaluation of LLM-generated code. Finally, we identify gaps in the literature and propose future research directions, such as the development of more robust benchmarks and improved evaluation metrics. By providing a thorough overview of the current landscape, this paper provides a valuable resource for researchers and practitioners interested in LLM’s code generation capabilities and limitations. We also highlight the importance of ongoing evaluation and refinement of these models to ensure their safe and effective integration into software-development practices.",[8040,595,8041],[8044,599,8045],"https:\u002F\u002Fdoi.org\u002F10.1109\u002Fcompsac65507.2025.00064","W4413640018",[23,110,1405,12545,4479],{"type":39,"children":16591,"toc":16596},[16592],{"type":42,"tag":43,"props":16593,"children":16594},{},[16595],{"type":47,"value":16584},{"title":8,"searchDepth":49,"depth":49,"links":16597},[],"content:publications:2025:evaluation-of-the-code-generated-by-large-language-models-the-state-of-the-art.md","publications\u002F2025\u002Fevaluation-of-the-code-generated-by-large-language-models-the-state-of-the-art.md","publications\u002F2025\u002Fevaluation-of-the-code-generated-by-large-language-models-the-state-of-the-art",{"_path":16602,"_dir":15532,"_draft":7,"_partial":7,"_locale":8,"title":16603,"description":16604,"_hidden":7,"Exploration\" authors":16605,"authors_orcid":16606,"year":15548,"doi":16608,"openalex_id":16609,"venue":21,"abstract_screenshot":21,"keywords":16610,"body":16611,"_type":51,"_id":16619,"_source":53,"_file":16620,"_stem":16621,"_extension":56,"locale":57},"\u002Fpublications\u002F2025\u002Fexploring-the-black-box-testing-image-synthesis-systems-through-metamorphic-expl","Exploring the Black-Box: Testing Image Synthesis Systems through Metamorphi","The increasing complexity of deep learning models, especially in black-box scenarios, presents significant challenges to traditional software testing methods. Due to the lack of transparency in neural networks’ decision-making processes and the non-deterministic nature of model outputs, traditional test oracle approaches become inadequate. To address this problem, Metamorphic Testing (MT) and its extended approach, Metamorphic Exploration (ME), provide new ideas for validating deep learning systems by defining Metamorphic Relations (MR) between inputs and outputs. However, existing image transformation-based MR faces new challenges in image synthesis scenarios, as these operations may destroy the contextual information and affect the model’s performance. This paper proposes a novel ME design for deep learning image synthesis networks and demonstrates its effectiveness using a visible-infrared image fusion network as the case study. The result identifies the performance degradation problem due to the tensor dimension manipulation error, which indicates that the ME not only detects defects but also helps developers deeply understand the internal mechanisms of complex systems through the Hypothesized Metamorphic Relation (HMR), thus providing unique value for software quality assurance (SQA) of AI-driven software.",[8210,8040,8041,10031,595],[16607,8044,8045,14945,599],"0000-0001-9680-0894","https:\u002F\u002Fdoi.org\u002F10.1109\u002Fcompsac65507.2025.00317","W4413640218",[8169,23,3788,4004,37,3789,3791],{"type":39,"children":16612,"toc":16617},[16613],{"type":42,"tag":43,"props":16614,"children":16615},{},[16616],{"type":47,"value":16604},{"title":8,"searchDepth":49,"depth":49,"links":16618},[],"content:publications:2025:exploring-the-black-box-testing-image-synthesis-systems-through-metamorphic-expl.md","publications\u002F2025\u002Fexploring-the-black-box-testing-image-synthesis-systems-through-metamorphic-expl.md","publications\u002F2025\u002Fexploring-the-black-box-testing-image-synthesis-systems-through-metamorphic-expl",{"_path":16623,"_dir":15532,"_draft":7,"_partial":7,"_locale":8,"title":16624,"description":16625,"_hidden":7,"Preferences in Collaborative IVR Environments authors":16626,"authors_orcid":16629,"year":15548,"doi":16631,"openalex_id":16632,"venue":21,"abstract_screenshot":21,"keywords":16633,"body":16636,"_type":51,"_id":16644,"_source":53,"_file":16645,"_stem":16646,"_extension":56,"locale":57},"\u002Fpublications\u002F2025\u002Fexploring-the-influence-of-interpersonal-relationships-on-gamification-preferenc","Exploring the Influence of Interpersonal Relationships on Gamification","Recent advancements in immersive virtual reality (IVR) have highlighted its expanding potential in educational settings. However, the influence of learners’ interpersonal relationships on their preferences for gamification elements in collaborative environments remains underexplored. This study introduces an avatar-based multiplayer IVR game designed to promote collaborative learning through improved social interaction. The game features a maze with three challenging puzzles, which require teamwork and problem-solving skills, encouraging communication and information sharing among participants. In addition, the study investigates the impact of different gamification elements on groups consisting of either peers or strangers, involving a total of 44 participants. The findings revealed significant improvements in communication and collaboration skills, along with increased motivation and engagement, across both group types. Moreover, participants exhibited distinct preferences for specific gamification elements, largely influenced by the nature of their social relationships and individual tendencies. This study offers valuable insights into the design of IVR-based collaborative educational environments with an emphasis on social interaction and game mechanics. It also identifies key factors shaping individual preferences for gamification elements, particularly in relation to social dynamics and personal preferences.",[16627,16628,5667],"Ke, Sulun","Zheng, Lijie",[16630,21,5670],"0009-0000-2630-3462","https:\u002F\u002Fdoi.org\u002F10.1109\u002Fvr59515.2025.00035","W4408954410",[16634,23,868,8388,16635,629,865,5926,870],"Interpersonal communication","Interpersonal relationship",{"type":39,"children":16637,"toc":16642},[16638],{"type":42,"tag":43,"props":16639,"children":16640},{},[16641],{"type":47,"value":16625},{"title":8,"searchDepth":49,"depth":49,"links":16643},[],"content:publications:2025:exploring-the-influence-of-interpersonal-relationships-on-gamification-preferenc.md","publications\u002F2025\u002Fexploring-the-influence-of-interpersonal-relationships-on-gamification-preferenc.md","publications\u002F2025\u002Fexploring-the-influence-of-interpersonal-relationships-on-gamification-preferenc",{"_path":16648,"_dir":15532,"_draft":7,"_partial":7,"_locale":8,"title":16649,"description":8,"_hidden":7,"authors":16650,"authors_orcid":16655,"year":15548,"doi":16657,"openalex_id":16658,"venue":21,"abstract_screenshot":21,"keywords":16659,"body":16661,"_type":51,"_id":16665,"_source":53,"_file":16666,"_stem":16667,"_extension":56,"locale":57},"\u002Fpublications\u002F2025\u002Ffinemotion-a-dataset-and-benchmark-with-both-spatial-and-temporal-annotation-for","FineMotion: A Dataset and Benchmark with Both Spatial and Temporal Annotation for Fine-Grained Motion Generation and Editing",[16651,16652,16653,16654,6111,12,319,12146],"Wu, Bizhu","Xie, Jinheng","Ding, Meidan","Kong, Zhe",[21,16656,21,21,21,15,21,21],"0000-0001-5678-4500","https:\u002F\u002Fdoi.org\u002F10.1109\u002Ficcv51701.2025.01284","W7160160155",[209,16660,6979,4876],"Annotation",{"type":39,"children":16662,"toc":16663},[],{"title":8,"searchDepth":49,"depth":49,"links":16664},[],"content:publications:2025:finemotion-a-dataset-and-benchmark-with-both-spatial-and-temporal-annotation-for.md","publications\u002F2025\u002Ffinemotion-a-dataset-and-benchmark-with-both-spatial-and-temporal-annotation-for.md","publications\u002F2025\u002Ffinemotion-a-dataset-and-benchmark-with-both-spatial-and-temporal-annotation-for",{"_path":16669,"_dir":15532,"_draft":7,"_partial":7,"_locale":8,"title":16670,"description":16671,"_hidden":7,"entrepreneurial financing\" authors":16672,"authors_orcid":16673,"year":15548,"doi":16676,"openalex_id":16677,"venue":16678,"abstract_screenshot":21,"keywords":16679,"body":16680,"_type":51,"_id":16688,"_source":53,"_file":16689,"_stem":16690,"_extension":56,"locale":57},"\u002Fpublications\u002F2025\u002Ffintech-and-home-bias-the-power-of-new-social-capital-in-innovative-entrepreneur","Fintech and home bias: The power of new social capital in innovativ","We identify that technology crowdfunding campaigns attracting more domestic investors have a higher probability of project success and examine the role of home bias in supporting online innovative entrepreneurial financing. The extent of the home bias effect among technology entrepreneurs varies and is notably linked to their social capital. When a technology entrepreneur has high “old” social capital, the home bias is strengthened and aligned with a preference-based interpretation. In contrast, technology entrepreneurs' excessive capabilities of creating “new” social capital help mitigate the home bias, reduce the dependence on local investors, and promote more diversified investment decisions, which supports an information-based interpretation. Evidence also reveals that technology entrepreneurs’ home country levels of financial inclusion and investor protection influence the link between home bias and crowdfunding outcomes, indicating that the economic benefits generated in fintech are heterogeneous across different countries. • Technology crowdfunding campaigns attracting more domestic investors have a higher probability of project success. • The extent of the home bias effect among technology entrepreneurs varies and is notably linked to their social capital. • The home bias is strengthened when a technology entrepreneur has high “old” social capital. • Technology entrepreneurs' excessive capabilities of creating “new” social capital help mitigate the home bias.",[13959,268,13277,11700,13304],[13961,21,13962,16674,16675],"0000-0003-0868-5465","0009-0004-7874-8542","https:\u002F\u002Fdoi.org\u002F10.1016\u002Fj.bar.2025.101636","W4408473501","The British Accounting Review",[5855,178,8733,1440,429,36,1380,289],{"type":39,"children":16681,"toc":16686},[16682],{"type":42,"tag":43,"props":16683,"children":16684},{},[16685],{"type":47,"value":16671},{"title":8,"searchDepth":49,"depth":49,"links":16687},[],"content:publications:2025:fintech-and-home-bias-the-power-of-new-social-capital-in-innovative-entrepreneur.md","publications\u002F2025\u002Ffintech-and-home-bias-the-power-of-new-social-capital-in-innovative-entrepreneur.md","publications\u002F2025\u002Ffintech-and-home-bias-the-power-of-new-social-capital-in-innovative-entrepreneur",{"_path":16692,"_dir":15532,"_draft":7,"_partial":7,"_locale":8,"title":16693,"description":8,"_hidden":7,"Students in a Sino-Foreign University authors":16694,"authors_orcid":16696,"year":15548,"doi":16697,"openalex_id":16698,"venue":21,"abstract_screenshot":21,"keywords":16699,"body":16700,"_type":51,"_id":16704,"_source":53,"_file":16705,"_stem":16706,"_extension":56,"locale":57},"\u002Fpublications\u002F2025\u002Fflipping-vr-and-microlearning-oers-to-teach-english-presentation-skills-to-stude","Flipping VR and Microlearning OERs to Teach English Presentation Skills to",[16695,16529,595],"Lee, Anson",[21,21,599],"https:\u002F\u002Fdoi.org\u002F10.1109\u002Ftale66047.2025.11346584","W7125586295",[5921,4831,6511,862],{"type":39,"children":16701,"toc":16702},[],{"title":8,"searchDepth":49,"depth":49,"links":16703},[],"content:publications:2025:flipping-vr-and-microlearning-oers-to-teach-english-presentation-skills-to-stude.md","publications\u002F2025\u002Fflipping-vr-and-microlearning-oers-to-teach-english-presentation-skills-to-stude.md","publications\u002F2025\u002Fflipping-vr-and-microlearning-oers-to-teach-english-presentation-skills-to-stude",{"_path":16708,"_dir":15532,"_draft":7,"_partial":7,"_locale":8,"title":16709,"description":16710,"_hidden":7,"authors":16711,"authors_orcid":16712,"year":15548,"doi":16713,"openalex_id":16714,"venue":16715,"abstract_screenshot":21,"keywords":16716,"body":16722,"_type":51,"_id":16739,"_source":53,"_file":16740,"_stem":16741,"_extension":56,"locale":57},"\u002Fpublications\u002F2025\u002Ffpga-routing-congestion-prediction-via-graph-learning-aided-conditional-gan","FPGA Routing Congestion Prediction via Graph Learning-Aided Conditional GAN","Routing congestion prediction expedites the closure of FPGA placement and routing (PnR). Current prediction methods employ convolutional models, taking advantage of their capacity of dealing with image-style inputs. However, these methods neglect the direct representation of circuit netlist and its information fusion with placement scheme. Moreover, the limited size of the convolutional kernel struggles to capture circuit connectivity in distant geometric regions. To address these issues, this article presents a graph-based routing congestion prediction framework that fuses the information contained in the circuit’s topological netlist and geometric placement scheme, and leverages a conditional generative adversarial network (cGAN) model to achieve optimized prediction performance compared to contemporary approaches. Our framework encompasses three key components: (1) the HeteroGraph, a heterogeneous graph that integrates a netlist subgraph and a layout subgraph by space mapping edges; (2) the HeteroGNN, a heterogeneous graph neural network that learns the latent features of both the circuit netlist and placement scheme through dual-space message-passing; and (3) the HeteroGNN-embedded cGAN, a model that combines the HeteroGNN with a cGAN for accurate FPGA routing congestion prediction. Compared to state-of-the-art approaches, our method reduces the routing congestion prediction’s root-mean-square error by 18.2% on the VTR7 benchmarks and by 15.0% on the large-scale Titan23 benchmarks. The code associated with this article can be found at https:\u002F\u002Fgithub.com\u002FAIPnR\u002FFPGA_Hetero_Congestion_Prediction .",[9305,9304,6184,9302,5534,12146,12,5532],[9311,9310,11087,9308,5539,12148,15,5537],"https:\u002F\u002Fdoi.org\u002F10.1145\u002F3773770","W4415543847","ACM Transactions on Design Automation of Electronic Systems",[16717,250,5545,5543,16718,9029,16719,16720,16721,6319],"Netlist","Control flow graph","Fuse (electrical)","Static routing","Multipath routing",{"type":39,"children":16723,"toc":16737},[16724],{"type":42,"tag":43,"props":16725,"children":16726},{},[16727,16729,16735],{"type":47,"value":16728},"Routing congestion prediction expedites the closure of FPGA placement and routing (PnR). Current prediction methods employ convolutional models, taking advantage of their capacity of dealing with image-style inputs. However, these methods neglect the direct representation of circuit netlist and its information fusion with placement scheme. Moreover, the limited size of the convolutional kernel struggles to capture circuit connectivity in distant geometric regions. To address these issues, this article presents a graph-based routing congestion prediction framework that fuses the information contained in the circuit’s topological netlist and geometric placement scheme, and leverages a conditional generative adversarial network (cGAN) model to achieve optimized prediction performance compared to contemporary approaches. Our framework encompasses three key components: (1) the HeteroGraph, a heterogeneous graph that integrates a netlist subgraph and a layout subgraph by space mapping edges; (2) the HeteroGNN, a heterogeneous graph neural network that learns the latent features of both the circuit netlist and placement scheme through dual-space message-passing; and (3) the HeteroGNN-embedded cGAN, a model that combines the HeteroGNN with a cGAN for accurate FPGA routing congestion prediction. Compared to state-of-the-art approaches, our method reduces the routing congestion prediction’s root-mean-square error by 18.2% on the VTR7 benchmarks and by 15.0% on the large-scale Titan23 benchmarks. The code associated with this article can be found at ",{"type":42,"tag":1574,"props":16730,"children":16733},{"href":16731,"rel":16732},"https:\u002F\u002Fgithub.com\u002FAIPnR\u002FFPGA_Hetero_Congestion_Prediction",[4520],[16734],{"type":47,"value":16731},{"type":47,"value":16736}," .",{"title":8,"searchDepth":49,"depth":49,"links":16738},[],"content:publications:2025:fpga-routing-congestion-prediction-via-graph-learning-aided-conditional-gan.md","publications\u002F2025\u002Ffpga-routing-congestion-prediction-via-graph-learning-aided-conditional-gan.md","publications\u002F2025\u002Ffpga-routing-congestion-prediction-via-graph-learning-aided-conditional-gan",{"_path":16743,"_dir":15532,"_draft":7,"_partial":7,"_locale":8,"title":16744,"description":16745,"_hidden":7,"authors":16746,"authors_orcid":16749,"year":15548,"doi":16753,"openalex_id":16754,"venue":9025,"abstract_screenshot":21,"keywords":16755,"body":16759,"_type":51,"_id":16767,"_source":53,"_file":16768,"_stem":16769,"_extension":56,"locale":57},"\u002Fpublications\u002F2025\u002Ffrfcnet-feature-refinement-and-flexible-concatenation-for-object-detection","FRFCNet: Feature Refinement and Flexible Concatenation for Object Detection","The state-of-the-art YOLO detection algorithms still suffer from the issue of redundant extraction of similar features during feature propagation, and the simplistic stacking approach of connecting different features limits the flexibility of feature fusion. We propose a new feature recombination mechanism involving refining feature extraction and flexible concatenation. It includes the HFConv (Hybrid Flexibility Convolution) module, the MFD (Multivariate Flexibility Downsampling) module, and the DFSPP (Deformable and Flexible Spatial Pyramid Pooling) module. Specifically, the HFConv module employs feature refinement and flexible connection strategies to optimize feature representation and reduce redundancy in a dynamic way, acquiring diverse feature information from local and surrounding regions. The MFD module leverages multiple downsampling methods to address the issue of feature redundancy that may arise from a single downsampling method, thereby enhancing feature diversity. The DFSPP module learns an offset corresponding to the pooling kernel size, allowing for the extraction of the most critical information in a dynamic manner. By incorporating these modules into the YOLO architecture, we develop a more robust network called FRFCNet, and the experimental results show a notable 4.1% and 2.8% improvement in AP values on the VOC2012 and COCO2017 datasets, respectively, compared to the baseline (YOLOV7-Tiny-SiLu), outperforming current one-stage detectors.",[10271,16747,8931,16748],"Wu, Zhiheng","Wu, Qiang",[16750,16751,8937,16752],"0000-0003-3966-4691","0009-0007-5885-4999","0000-0001-5641-2483","https:\u002F\u002Fdoi.org\u002F10.1109\u002Ftmm.2025.3607701","W4414165783",[16756,7391,1079,6875,4876,11808,16757,16758],"Upsampling","Pyramid (geometry)","Feature model",{"type":39,"children":16760,"toc":16765},[16761],{"type":42,"tag":43,"props":16762,"children":16763},{},[16764],{"type":47,"value":16745},{"title":8,"searchDepth":49,"depth":49,"links":16766},[],"content:publications:2025:frfcnet-feature-refinement-and-flexible-concatenation-for-object-detection.md","publications\u002F2025\u002Ffrfcnet-feature-refinement-and-flexible-concatenation-for-object-detection.md","publications\u002F2025\u002Ffrfcnet-feature-refinement-and-flexible-concatenation-for-object-detection",{"_path":16771,"_dir":15532,"_draft":7,"_partial":7,"_locale":8,"title":16772,"description":16773,"_hidden":7,"Physics Education\" authors":16774,"authors_orcid":16776,"year":15548,"doi":16778,"openalex_id":16779,"venue":16780,"abstract_screenshot":16781,"keywords":16782,"body":16783,"_type":51,"_id":16791,"_source":53,"_file":16792,"_stem":16793,"_extension":56,"locale":57},"\u002Fpublications\u002F2025\u002Ffrom-abstract-concepts-to-engaged-learning-an-ivr-game-based-framework-for-physi","From Abstract Concepts to Engaged Learning: An IVR Game-Based Framework fo","Physics education often faces challenges in communicating abstract concepts effectively and maintaining student interest. This study explored the integration of immersive virtual reality (IVR) with game-based learning to improve educational impact and student engagement. The designed IVR game included the principles of inquiry-based, constructivist, and situated learning. It included four levels that mimicked real-world physics situations, each focusing on a particular physics concept and featuring interactive puzzles. This setup enabled students to progress throughout the game while improving their understanding of abstract concepts. The addition of characters such as guides and opponents enriched the storyline and elevated the immersive experience. The experimental results of 19 participants from four different majors demonstrated positive gaming experiences and an improved understanding of the physics concepts. Most of the participants rated the physics education game highly for its positive impact and participation, showing a significant interest in learning through the IVR platform. In general, 95% of the participants gave the game high ratings for its educational value and overall learning experience. The study highlighted the promise of game-based IVR learning in the advancement of physics education and highlighted ways to increase student motivation and participation. Received: 31 October 2024 | Revised: 18 December 2024 | Accepted: 14 February 2025 Conflicts of Interest The authors declare that they have no conflicts of interest to this work. Data Availability Statement The data that support the findings of this study are available upon reasonable request to the corresponding author. Author Contribution Statement Ying Zhang: Conceptualization, Methodology, Validation, Formal analysis, Investigation, Resources, Data curation, Writing – original draft. Ruiqi Zhang: Conceptualization, Methodology, Software, Validation, Formal analysis, Investigation, Writing – review & editing, Visualization. Boon Giin Lee: Conceptualization, Validation, Writing – review & editing, Supervision, Project administration, Funding acquisition.",[16775,11424,5667],"Zhang, Ying",[16777,11430,5670],"0000-0002-6038-7206","https:\u002F\u002Fdoi.org\u002F10.47852\u002Fbonviewijce52024697","W4408216931","International Journal of Changes in Education","from-abstract-concepts-to-engaged-learning-an-ivr-game-based-framework-for-physi.png",[13734,11630,866,23,867,3597,868,865],{"type":39,"children":16784,"toc":16789},[16785],{"type":42,"tag":43,"props":16786,"children":16787},{},[16788],{"type":47,"value":16773},{"title":8,"searchDepth":49,"depth":49,"links":16790},[],"content:publications:2025:from-abstract-concepts-to-engaged-learning-an-ivr-game-based-framework-for-physi.md","publications\u002F2025\u002Ffrom-abstract-concepts-to-engaged-learning-an-ivr-game-based-framework-for-physi.md","publications\u002F2025\u002Ffrom-abstract-concepts-to-engaged-learning-an-ivr-game-based-framework-for-physi",{"_path":16795,"_dir":15532,"_draft":7,"_partial":7,"_locale":8,"title":16796,"description":16797,"_hidden":7,"Motivation and Learning in IVR Education\" authors":16798,"authors_orcid":16799,"year":15548,"doi":16800,"openalex_id":16801,"venue":21,"abstract_screenshot":21,"keywords":16802,"body":16804,"_type":51,"_id":16812,"_source":53,"_file":16813,"_stem":16814,"_extension":56,"locale":57},"\u002Fpublications\u002F2025\u002Ffrom-robots-to-creatures-the-influence-of-pedagogical-agent-design-on-student-mo","From Robots to Creatures: The Influence of Pedagogical Agent Design on Studen","Pedagogical agents (PAs) have been extensively employed in im-mersive virtual reality (IVR) educational settings, yet their specific attributes are not thoroughly investigated. This study explores the impact of PA appearance and knowledge delivery methods on student learning in IVR environments. The findings reveal that the flying robot PA is regarded as the most credible, while cute creature PAs increase motivation but cause some distraction. The integrated text and audio multi-modality approach resulted in the best knowledge retention, though some participants experienced a slower learning pace. These insights are significant for designing and using PAs in IVR educational settings.",[11421,5667,5407,4793,12122],[11428,5670,5411,13730,12125],"https:\u002F\u002Fdoi.org\u002F10.1109\u002Fvrw66409.2025.00276","W4409763013",[16803,7599,868,23,866,37,865],"Creatures",{"type":39,"children":16805,"toc":16810},[16806],{"type":42,"tag":43,"props":16807,"children":16808},{},[16809],{"type":47,"value":16797},{"title":8,"searchDepth":49,"depth":49,"links":16811},[],"content:publications:2025:from-robots-to-creatures-the-influence-of-pedagogical-agent-design-on-student-mo.md","publications\u002F2025\u002Ffrom-robots-to-creatures-the-influence-of-pedagogical-agent-design-on-student-mo.md","publications\u002F2025\u002Ffrom-robots-to-creatures-the-influence-of-pedagogical-agent-design-on-student-mo",{"_path":16816,"_dir":15532,"_draft":7,"_partial":7,"_locale":8,"title":16817,"description":16818,"_hidden":7,"applications in IoT edge computing authors":16819,"authors_orcid":16820,"year":15548,"doi":16821,"openalex_id":16822,"venue":16823,"abstract_screenshot":16824,"keywords":16825,"body":16826,"_type":51,"_id":16834,"_source":53,"_file":16835,"_stem":16836,"_extension":56,"locale":57},"\u002Fpublications\u002F2025\u002Ffunctionality-aware-offloading-technique-for-scheduling-containerized-edge-appli","Functionality-aware offloading technique for scheduling containerized edge","Edge computing (EC) represents a basic functionality to support the efficiency of the future Internet of intelligent things. The EC has promoted container adoption for deploying and managing applications. Current container scheduling techniques on edge infrastructures show multiple limitations. The design scheduler of container applications execute workflow as specified by the container cloud workflow engine assisted by the Kubernetes platform. We model dependency workflow of containerized applications built using microservices as directed acyclic graph (DAG). The structure of DAG allows the system to prepare the scheduling order list of microservices. The Argo workflow is used to prepare the sequence to deploy containerized applications. In addition, edge worker nodes’ resource utilization data enabled assists to select on which edge worker nodes the scheduling will take place. By combining the two mechanism, we termed the scheduling as functionality-aware offloading on scheduling containerized edge applications. We implemented the orchestration prototype and evaluate the performance of the proposed technique under extensive simulations using the ContainerCloudSim simulator with a module that models a lightweight Kubernetes platform in the context of the edge computing infrastructure. To validate our containerized edge inference service and collect data for the simulation setup, we used Raspberry Pis 4, and the cloud core was set up on Amazon Web Services. The workload in the pre-defined workflow using Argo K8s native was performed by calling the pre-trained model (downloaded and stored locally) and then executing the prediction microservice running on Raspberry Pis. The results demonstrate that our proposal outperforms the baseline scheduling offloading technique in edge computing by decreasing the average scheduling time of containerized edge applications by 15%.",[11726,5667,5665],[11728,5670,5669],"https:\u002F\u002Fdoi.org\u002F10.1186\u002Fs13677-025-00737-w","W4407895463","Journal of Cloud Computing Advances Systems and Applications","functionality-aware-offloading-technique-for-scheduling-containerized-edge-appli.png",[23,12100,6299,6465,8778,450,249,5548,4242,3123,1113,288,179],{"type":39,"children":16827,"toc":16832},[16828],{"type":42,"tag":43,"props":16829,"children":16830},{},[16831],{"type":47,"value":16818},{"title":8,"searchDepth":49,"depth":49,"links":16833},[],"content:publications:2025:functionality-aware-offloading-technique-for-scheduling-containerized-edge-appli.md","publications\u002F2025\u002Ffunctionality-aware-offloading-technique-for-scheduling-containerized-edge-appli.md","publications\u002F2025\u002Ffunctionality-aware-offloading-technique-for-scheduling-containerized-edge-appli",{"_path":16838,"_dir":15532,"_draft":7,"_partial":7,"_locale":8,"title":16839,"description":16840,"_hidden":7,"systems\" authors":16841,"authors_orcid":16843,"year":15548,"doi":16844,"openalex_id":16845,"venue":14241,"abstract_screenshot":21,"keywords":16846,"body":16851,"_type":51,"_id":16859,"_source":53,"_file":16860,"_stem":16861,"_extension":56,"locale":57},"\u002Fpublications\u002F2025\u002Ffuse-is-multi-modal-data-fusion-for-carbon-aware-security-in-industrial-energy-s","FUSE-IS: multi-modal data fusion for carbon-aware security in industrial energ","• A novel multi-modal Fusion-based Unified Security and Energy Efficiency approach for Industrial Systems (FUSE-IS) framework • FUSE-IS integrates deep learning, differential privacy, and carbon-aware resource scheduling in industrial energy systems • FUSE-IS provides enhance security, privacy, and energy efficiency in industrial energy systems • FUSE-IS concurrently addresses three critical and interdependent concerns of cybersecurity,data privacy, and carbon-aware efficiency. Modern industrial energy systems are increasingly reliant on heterogeneous data streams from sensors, grid infrastructure, renewable forecasts, and cybersecurity telemetry. Effectively fusing these diverse sources is essential for achieving resilient, efficient, and sustainable operations. In this paper, we present a Fusion-based Unified Security and Energy efficiency approach for Industrial Systems (FUSE-IS), a novel multi-modal data fusion framework. FUSE-IS integrates deep learning-based threat detection, differential privacy mechanisms, and carbon-aware resource scheduling. It enhances security, privacy, and energy efficiency in industrial energy environments. Unlike traditional solutions that address these objectives in isolation, FUSE-IS employs a unified data fusion approach that combines these solutions. As a result, it enabled real-time adaptive decision-making for threat mitigation, data protection, and carbon-optimized computing. Experimental results demonstrate that FUSE-IS achieves 98.5% detection accuracy with only 1.2% false positives, while reducing energy consumption by 24% and carbon emissions by 20% compared to baseline methods. The framework maintains strong privacy guarantees ( ϵ = 0.9) with minimal accuracy degradation (0.7%). A case study on DDoS mitigation illustrates FUSE-IS’s ability to dynamically adjust defense strategies based on carbon intensity fluctuations, resulting in a 27% emission reduction during the attack window.",[16842,13218,15540,15541,8931,16301],"Jiang, Huamao",[21,13226,15547,21,8937,16306],"https:\u002F\u002Fdoi.org\u002F10.1016\u002Fj.inffus.2025.103759","W4414414221",[5544,920,6977,16847,922,16848,924,16849,11470,16850],"Fusion mechanism","Green computing","Energy security","Industrial control system",{"type":39,"children":16852,"toc":16857},[16853],{"type":42,"tag":43,"props":16854,"children":16855},{},[16856],{"type":47,"value":16840},{"title":8,"searchDepth":49,"depth":49,"links":16858},[],"content:publications:2025:fuse-is-multi-modal-data-fusion-for-carbon-aware-security-in-industrial-energy-s.md","publications\u002F2025\u002Ffuse-is-multi-modal-data-fusion-for-carbon-aware-security-in-industrial-energy-s.md","publications\u002F2025\u002Ffuse-is-multi-modal-data-fusion-for-carbon-aware-security-in-industrial-energy-s",{"_path":16863,"_dir":15532,"_draft":7,"_partial":7,"_locale":8,"title":16864,"description":16865,"_hidden":7,"in Medical Consumer Electronics authors":16866,"authors_orcid":16871,"year":15548,"doi":16875,"openalex_id":16876,"venue":13232,"abstract_screenshot":21,"keywords":16877,"body":16879,"_type":51,"_id":16887,"_source":53,"_file":16888,"_stem":16889,"_extension":56,"locale":57},"\u002Fpublications\u002F2025\u002Ffused-fuzzy-deep-learning-and-information-steganography-for-privacy-preservation","Fused Fuzzy Deep Learning and Information Steganography for Privacy Preservation","Medical Consumer Electronics (MCE) have greatly facilitated people’s lives, allowing patients to obtain personal medical information including medical images. These medical images obtained from MCE need to be processed using segmentation, diagnosis, recognition to obtain useful information. Deep learning plays an important role in medical image segmentation and recognition. However, other personal information about the patient, such as previous cases, is often required to determine the final diagnosis. However, sending personal information and medical images generated through MCE to the clinic directly exposes patient privacy. Therefore, in this paper, we propose a digital medical image privacy protection framework based on information steganography with fuzzy deep learning. The proposed framework transforms patient privacy information into invisible noise and hides it in the deep covert space of the image. This method plays a crucial role in ensuring patient privacy and data security. Furthermore, this method can ensure a high level of image segmentation accuracy that supports the development of personalized medical services. The experimental results show that the proposed framework can embed patient information in medical images without affecting the segmentation task, and effectively protect privacy. Finally, the proposed framework provides new possibilities and impetus for the popularization of MCE.",[16867,16868,16869,13218,15540,15541,16870],"Chen, Jingxue","Zhao, Pengbiao","Deng, Erqiang","Xiong, Hu",[16872,21,16873,13226,15547,21,16874],"0000-0002-7931-7558","0000-0001-5902-0020","0000-0001-6137-6667","https:\u002F\u002Fdoi.org\u002F10.1109\u002Ftce.2025.3525536","W4406089602",[12601,16878,23,6249,180,3495,3493,37,867,179,928,9955],"Steganography",{"type":39,"children":16880,"toc":16885},[16881],{"type":42,"tag":43,"props":16882,"children":16883},{},[16884],{"type":47,"value":16865},{"title":8,"searchDepth":49,"depth":49,"links":16886},[],"content:publications:2025:fused-fuzzy-deep-learning-and-information-steganography-for-privacy-preservation.md","publications\u002F2025\u002Ffused-fuzzy-deep-learning-and-information-steganography-for-privacy-preservation.md","publications\u002F2025\u002Ffused-fuzzy-deep-learning-and-information-steganography-for-privacy-preservation",{"_path":16891,"_dir":15532,"_draft":7,"_partial":7,"_locale":8,"title":16892,"description":16893,"_hidden":7,"authors":16894,"authors_orcid":16899,"year":15548,"doi":16904,"openalex_id":16905,"venue":15797,"abstract_screenshot":21,"keywords":16906,"body":16907,"_type":51,"_id":16915,"_source":53,"_file":16916,"_stem":16917,"_extension":56,"locale":57},"\u002Fpublications\u002F2025\u002Fgpt-based-automated-induction-vulnerability-detection-in-medical-software","GPT-Based Automated Induction: Vulnerability Detection in Medical Software","Integrating natural language processing (NLP) with generative pre-trained transformer (GPT) models plays a pivotal role in enhancing the accuracy and efficiency of healthcare software, which is essential for patient safety and providing high-quality care. The precision of healthcare software is fundamental to protecting the patient's well-being. In addition, it can ensure the delivery of superior care, maintain the integrity of healthcare systems, and promote trust and cost-effectiveness. It is necessary to emphasize the importance of software reliability in its development and deployment. Symbolic execution serves as a vital technology in automated vulnerability detection. However, it often faces problems such as path explosion, which seriously affects efficiency. Although several studies have been conducted to reduce the number of computational paths, this problem remains a significant obstacle. Therefore, more efficient solutions are urgently needed to ensure software security. This paper proposes a large-scale language model (LLM) induction method mitigating path explosion applied to symbolic execution engines. In contrast to traditional symbolic execution engines, which often result in timeout or out-of-memory detection, our approach achieves the task of detecting vulnerabilities in seconds. Furthermore, our proposal improves the scalability of symbolic execution, allowing more extensive and complex programs to be analyzed without significant increases in computational resources or time. This scalability is crucial to tackling modern software systems and improving the efficiency and effectiveness of automated defect verification in healthcare software.",[16895,16896,13218,16897,16867,16898],"Deng, Liangjun","Lei, Hang","Srivastava, Gautam","Haque, Mainul",[16900,16901,13226,16902,16872,16903],"0000-0003-4215-182X","0000-0001-7736-2251","0000-0001-9851-4103","0000-0003-1836-8076","https:\u002F\u002Fdoi.org\u002F10.1109\u002Fjbhi.2025.3544560","W4407830460",[23,139,1107,180,1113],{"type":39,"children":16908,"toc":16913},[16909],{"type":42,"tag":43,"props":16910,"children":16911},{},[16912],{"type":47,"value":16893},{"title":8,"searchDepth":49,"depth":49,"links":16914},[],"content:publications:2025:gpt-based-automated-induction-vulnerability-detection-in-medical-software.md","publications\u002F2025\u002Fgpt-based-automated-induction-vulnerability-detection-in-medical-software.md","publications\u002F2025\u002Fgpt-based-automated-induction-vulnerability-detection-in-medical-software",{"_path":16919,"_dir":15532,"_draft":7,"_partial":7,"_locale":8,"title":16920,"description":16921,"_hidden":7,"authors":16922,"authors_orcid":16927,"year":15548,"doi":16930,"openalex_id":16931,"venue":21,"abstract_screenshot":21,"keywords":16932,"body":16935,"_type":51,"_id":16943,"_source":53,"_file":16944,"_stem":16945,"_extension":56,"locale":57},"\u002Fpublications\u002F2025\u002Fgrippy-a-vr-grip-controller-for-combating-sarcopenia-in-elderly","GRIPPY: A VR Grip Controller for Combating Sarcopenia in Elderly","As the global population ages, sarcopenia—age-related muscle decline—demands innovative solutions. This paper introduces GRIPPY, a VR grip controller that transforms basic handgrip exercises into immersive, gamified tasks. By integrating sensor-based interaction and VR gameplay, older adults can strengthen grip while maintaining higher motivation. A preliminary test with three participants (ages 68–80) revealed key usability insights, underscoring GRIPPY’s potential for enhanced rehabilitation. Future work will refine its design and validate long-term efficacy.",[16923,16924,16925,16926,3461,5667],"Leong, Hoilam","Wu, Jiang","Lai, Yoke Chin","Faulon, Loïc",[21,16928,16929,21,21,5670],"0000-0001-9286-4073","0000-0002-7443-3875","https:\u002F\u002Fdoi.org\u002F10.1109\u002Fvrw66409.2025.00473","W4409761373",[16933,9693,23,16934,868,4390,380],"Sarcopenia","Controller (irrigation)",{"type":39,"children":16936,"toc":16941},[16937],{"type":42,"tag":43,"props":16938,"children":16939},{},[16940],{"type":47,"value":16921},{"title":8,"searchDepth":49,"depth":49,"links":16942},[],"content:publications:2025:grippy-a-vr-grip-controller-for-combating-sarcopenia-in-elderly.md","publications\u002F2025\u002Fgrippy-a-vr-grip-controller-for-combating-sarcopenia-in-elderly.md","publications\u002F2025\u002Fgrippy-a-vr-grip-controller-for-combating-sarcopenia-in-elderly",{"_path":16947,"_dir":15532,"_draft":7,"_partial":7,"_locale":8,"title":16948,"description":16949,"_hidden":7,"challenges\" authors":16950,"authors_orcid":16954,"year":15548,"doi":16957,"openalex_id":16958,"venue":16959,"abstract_screenshot":21,"keywords":16960,"body":16966,"_type":51,"_id":16974,"_source":53,"_file":16975,"_stem":16976,"_extension":56,"locale":57},"\u002Fpublications\u002F2025\u002Fguest-editorial-big-data-technologies-and-applications-in-web-3-0-trends-and-cha","Guest editorial: Big data technologies and applications in Web 3.0 – trends an","Web 3.0 is the next era in internet development, and it is characterized as being decentralization, semantic intelligence and user experience oriented. The previous eras focused on user-generated content, but Web 3.0 uses big data, artificial intelligence (AI) and blockchain to create smart and personalized digital environments. Massive volumes of structured and unstructured data generated across devices and platforms fuel adaptive, secure and autonomous services now more and more. Yet, the more these technologies evolve, the more important concerns regarding privacy, scalability and data governance become.This special issue of the International Journal of Web Information Systems explores how Web 3.0 applications are being revolutionized by big data technologies. The accepted pieces cover a range of but connected themes – from personalized learning to AI domain models and privacy in IoT-integrated networks – demonstrating the potential and complexity of this digital revolution. All of the contributions support sustainable development goals (SDGs), including SDG 4 (Quality Education), SDG 9 (Innovation and Infrastructure) and SDG 11 (Sustainable Cities and Communities).The first paper “Personalized and adaptive e-learning systems for semantic Web: a systematic review and roadmap” is a comprehensive survey of intelligent learning systems based on Semantic Web technologies. It addresses the personalization strategies, learner model, adaptive content and ontology-driven architecture for enhancing learning outcomes. The study proposes a roadmap for integrating semantic frameworks with AI to enable personalized, scalable and accessible e-learning systems. This effort is directly contributing to SDG 4 through the promotion of quality and inclusive education that is led by smart Web infrastructures.The second paper, “Chinese named entity recognition in the furniture domain based on ERNIE and adversarial learning,” is suggesting a robust AI model that is intended for a niche but significant industry. The authors develop a framework that integrates ERNIE’s contextual embedding with adversarial learning and BiLSTM-CRF for better Chinese furniture text entity recognition. With a remarkable F1 score of 89.6%, the model demonstrates how domain-specific big data applications can simplify and streamline industrial information extraction and enhance decision-making processes. The research helps SDG 9 through innovation and manufacturing industry efficiency via tailored AI solutions.The third paper, “Privacy Preservation of Internet of Things-Integrated Social Media Networks: A Survey and Future Challenges,” is a timely survey on privacy threats within decentralized rich-data social communities. With the availability of IoT in social sites, sensitive flows of information have increased significantly. The paper elaborates on existing methods – differential privacy, federated learning and blockchain – to prevent threats. It recognizes the strengths of both and the open challenges and demands adaptive and trustworthy privacy-preserving systems. This work enhances SDG 11 by fostering secure and sustainable digital communities.Together, these contributions show how big data technologies can drive smart and context-aware applications for Web 3.0 and address pressing concerns of privacy, flexibility and social good. They demonstrate practical paths for applying AI, semantics and decentralized models in end-to-end systems, linking technological advancement with human development goals. As Web 3.0 continues to evolve, such interdisciplinary work will be even more crucial to shaping an open, secure and intelligent internet future.This paper forms part of a special section “Big data technologies and applications in Web 3.0: trends and challenges”, guest edited by Zhiyuan Tan, Nour Moustafa, Xiangjian He and Kehinde Babaagba.",[16951,16952,8931,16953],"Tan, Zhiyuan","Moustafa, Nour","Babaagba, Kehinde O.",[21,16955,8937,16956],"0000-0001-6127-9349","0000-0003-0786-2618","https:\u002F\u002Fdoi.org\u002F10.1108\u002Fijwis-08-2025-398","W4414298188","International Journal of Web Information Systems",[6023,16961,689,16962,16963,16964,6298,16965,7654],"Web intelligence","Social Semantic Web","Personalization","Data Web","Web engineering",{"type":39,"children":16967,"toc":16972},[16968],{"type":42,"tag":43,"props":16969,"children":16970},{},[16971],{"type":47,"value":16949},{"title":8,"searchDepth":49,"depth":49,"links":16973},[],"content:publications:2025:guest-editorial-big-data-technologies-and-applications-in-web-3-0-trends-and-cha.md","publications\u002F2025\u002Fguest-editorial-big-data-technologies-and-applications-in-web-3-0-trends-and-cha.md","publications\u002F2025\u002Fguest-editorial-big-data-technologies-and-applications-in-web-3-0-trends-and-cha",{"_path":16978,"_dir":15532,"_draft":7,"_partial":7,"_locale":8,"title":16979,"description":16980,"_hidden":7,"authors":16981,"authors_orcid":16986,"year":15548,"doi":16989,"openalex_id":16990,"venue":14088,"abstract_screenshot":21,"keywords":16991,"body":16994,"_type":51,"_id":17002,"_source":53,"_file":17003,"_stem":17004,"_extension":56,"locale":57},"\u002Fpublications\u002F2025\u002Fhfa-unet-hybrid-and-full-attention-unet-for-thyroid-nodule-segmentation","HFA-UNet: hybrid and full attention UNet for thyroid nodule segmentation","Ultrasound imaging is the most commonly used method for screening thyroid nodules due to its low cost and non-invasive nature. Thyroid nodule lesions have variable shapes, rich aspect ratios, unclear boundaries, calcified nodule-induced acoustic shadows, and noise interference, causing challenges in accurate segmentation. Recent methods ignore various scale features and details in different resolutions of images, leading to redundant or missing feature information and then affecting the segmentation performance. In this paper, we introduce a hybrid and full attention UNet model for ultrasound thyroid nodule segmentation. Self, spatial and channel attention are combined in a U-Net-like structure to extract global and local features simultaneously. A novel full attention multi-scale fusion stage is designed to enhance boundary features while suppressing noise features. At the same time, the model dynamically adjusts the number of skip connections corresponding to images of different resolutions to better utilize multi-scale features and detailed information. We evaluate our model on DDTI, TN3K and Stanford Cine-Clip datasets, including internal validation and cross-dataset testing. The results show that our proposed model for internal validation in the DDTI dataset increases the Dice score and mean intersection over union by 2.36 % and 1.04 % compared to the state-of-the-art model. In the TN3K dataset, they increase by 1.66 % and 3.05 %.",[13450,16982,8931,15898,16983,13449,10031,16984,16985],"Zou, Yurong","Liu, Ming","He, Maggie M.","Zhang, Jian",[14924,21,8937,15902,16987,21,21,21,16988],"0009-0006-2658-5678","0000-0003-0365-9022","https:\u002F\u002Fdoi.org\u002F10.1016\u002Fj.knosys.2025.114245","W4413444378",[16992,16993,9090,380,23,9399,37,4608],"Nodule (geology)","Thyroid",{"type":39,"children":16995,"toc":17000},[16996],{"type":42,"tag":43,"props":16997,"children":16998},{},[16999],{"type":47,"value":16980},{"title":8,"searchDepth":49,"depth":49,"links":17001},[],"content:publications:2025:hfa-unet-hybrid-and-full-attention-unet-for-thyroid-nodule-segmentation.md","publications\u002F2025\u002Fhfa-unet-hybrid-and-full-attention-unet-for-thyroid-nodule-segmentation.md","publications\u002F2025\u002Fhfa-unet-hybrid-and-full-attention-unet-for-thyroid-nodule-segmentation",{"_path":17006,"_dir":15532,"_draft":7,"_partial":7,"_locale":8,"title":17007,"description":8,"_hidden":7,"agricultural R&I system transformation in the South? Evidence from UK-China cooperation authors":17008,"authors_orcid":17016,"year":15548,"doi":17020,"openalex_id":17021,"venue":17022,"abstract_screenshot":21,"keywords":17023,"body":17025,"_type":51,"_id":17029,"_source":53,"_file":17030,"_stem":17031,"_extension":56,"locale":57},"\u002Fpublications\u002F2025\u002Fhow-does-global-agricultural-research-and-innovation-cooperation-influence-agric","How does global agricultural research and innovation cooperation influence",[17009,65,17010,17011,17012,17013,17014,17015],"Wu, Bin","Mosey, Simon","Daniell, Tim J.","Noy, Peter","Cui, Yizhe","Rose, M. A.","Snape, Jonathan",[17017,70,17018,17019,21,21,21,21],"0000-0002-7568-1993","0000-0002-3452-5230","0000-0003-0435-4343","https:\u002F\u002Fdoi.org\u002F10.1016\u002Fj.foodpol.2025.102813","W4408057694","Food Policy",[282,16452,4241,178,17024,1356,3958,36,3960,1358,289,4608],"Agricultural economics",{"type":39,"children":17026,"toc":17027},[],{"title":8,"searchDepth":49,"depth":49,"links":17028},[],"content:publications:2025:how-does-global-agricultural-research-and-innovation-cooperation-influence-agric.md","publications\u002F2025\u002Fhow-does-global-agricultural-research-and-innovation-cooperation-influence-agric.md","publications\u002F2025\u002Fhow-does-global-agricultural-research-and-innovation-cooperation-influence-agric",{"_path":17033,"_dir":15532,"_draft":7,"_partial":7,"_locale":8,"title":17034,"description":17035,"_hidden":7,"authors":17036,"authors_orcid":17039,"year":15548,"doi":17040,"openalex_id":17041,"venue":17042,"abstract_screenshot":17043,"keywords":17044,"body":17046,"_type":51,"_id":17054,"_source":53,"_file":17055,"_stem":17056,"_extension":56,"locale":57},"\u002Fpublications\u002F2025\u002Findigenization-and-inclusion-in-chinese-academia","Indigenization and inclusion in Chinese academia","China’s national academies have long served as barometers of academic development and scientific prestige. We use publicly available information to develop a dataset comprising 3,534 academy member profiles spanning 1905 to 2023. Using this dataset, we examine the evolving composition of China’s academic elite. Here we show that despite increasing globalization, the proportion of foreign-educated academy members has declined, while scholars from underrepresented regions—Western China and developing countries (or the Global South)—have benefited from preferential inclusive policies. Some elite-level returnee academics experience research underperformance upon returning. These trends reflect a broader shift towards academic indigenization and have wider implications for meritocracy, mobility and the sustainability of China’s talent strategies. This study examines complex reasons behind the above developments. Huang, Cao and Liu compile a dataset of 3,534 profiles of members of China’s national academies to trace academic exchanges over 120 years and find evidence for a decline in foreign-educated academics.",[17037,65,17038],"Huang, Jianan","Liu, Hong",[21,70,21],"https:\u002F\u002Fdoi.org\u002F10.1038\u002Fs41562-025-02366-4","W7116901507","Nature Human Behaviour","indigenization-and-inclusion-in-chinese-academia.png",[17045,3093,282,7038,745],"Indigenization",{"type":39,"children":17047,"toc":17052},[17048],{"type":42,"tag":43,"props":17049,"children":17050},{},[17051],{"type":47,"value":17035},{"title":8,"searchDepth":49,"depth":49,"links":17053},[],"content:publications:2025:indigenization-and-inclusion-in-chinese-academia.md","publications\u002F2025\u002Findigenization-and-inclusion-in-chinese-academia.md","publications\u002F2025\u002Findigenization-and-inclusion-in-chinese-academia",{"_path":17058,"_dir":15532,"_draft":7,"_partial":7,"_locale":8,"title":17059,"description":17060,"_hidden":7,"authors":17061,"authors_orcid":17064,"year":15548,"doi":17067,"openalex_id":17068,"venue":5147,"abstract_screenshot":21,"keywords":17069,"body":17071,"_type":51,"_id":17079,"_source":53,"_file":17080,"_stem":17081,"_extension":56,"locale":57},"\u002Fpublications\u002F2025\u002Findustrial-policy-congruence-and-innovation-evidence-from-chinese-nasdaq","Industrial policy, congruence, and innovation: Evidence from “Chinese NASDAQ”","This paper investigates the association between firm innovation and endowment-based fundamental factors through the lens of congruence and then examines the impact of a national-level industrial policy on this newly established link. Based on a sample of small and innovative firms listed on the National Equities Exchange and Quotations, China's NASDAQ counterpart, we find that firms with greater congruence with local endowment structure tend to have more innovation inputs and outputs. Additionally, in a quasi-experimental setting, we further examine the effect of the “Made in China 2025” (MC2025) industrial policy. Our findings indicate that MC2025 increases bank loans for treated firms and weakens the positive association between congruence and firm innovation. This suggests that MC2025 has a dual impact: while it increases access to capital, it may also lead to capital misallocations and policy distortions, ultimately hindering long-term innovation capabilities. • Firms more congruent with local endowment structure have better innovation outcomes. • The “Made in China 2025” policy weakens the link between congruence and innovation. • An increase in bank loans for firms in targeted industries may induce misallocations.",[268,11700,17062,17063],"Xia, Junjie","Zhang, Haochen",[21,21,17065,17066],"0000-0002-5109-9915","0000-0001-7664-9074","https:\u002F\u002Fdoi.org\u002F10.1016\u002Fj.respol.2025.105298","W4412463855",[17070,178,36,6600,865,870],"Congruence (geometry)",{"type":39,"children":17072,"toc":17077},[17073],{"type":42,"tag":43,"props":17074,"children":17075},{},[17076],{"type":47,"value":17060},{"title":8,"searchDepth":49,"depth":49,"links":17078},[],"content:publications:2025:industrial-policy-congruence-and-innovation-evidence-from-chinese-nasdaq.md","publications\u002F2025\u002Findustrial-policy-congruence-and-innovation-evidence-from-chinese-nasdaq.md","publications\u002F2025\u002Findustrial-policy-congruence-and-innovation-evidence-from-chinese-nasdaq",{"_path":17083,"_dir":15532,"_draft":7,"_partial":7,"_locale":8,"title":17084,"description":17085,"_hidden":7,"of ChatGPT's Capabilities in Generating Metamorphic Relations\" authors":17086,"authors_orcid":17088,"year":15548,"doi":17091,"openalex_id":17092,"venue":17093,"abstract_screenshot":17094,"keywords":17095,"body":17097,"_type":51,"_id":17105,"_source":53,"_file":17106,"_stem":17107,"_extension":56,"locale":57},"\u002Fpublications\u002F2025\u002Fintegrating-artificial-intelligence-with-human-expertise-an-in-depth-analysis-of","Integrating Artificial Intelligence with Human Expertise: An In-depth Analysi","Context: This paper provides an in-depth examination of the generation and evaluation of Metamorphic Relations (MRs) using GPT models developed by OpenAI, with a particular focus on the capabilities of GPT-4 in software testing environments. Objective: The aim is to examine the quality of MRs produced by GPT-3.5 and GPT-4 for a specific System Under Test (SUT) adopted from an earlier study, and to introduce and apply an improved set of evaluation criteria for a diverse range of SUTs. Method: The initial phase evaluates MRs generated by GPT-3.5 and GPT-4 using criteria from a prior study, followed by an application of an enhanced evaluation framework on MRs created by GPT-4 for a diverse range of nine SUTs, varying from simple programs to complex systems incorporating AI\u002FML components. A custom-built GPT evaluator, alongside human evaluators, assessed the MRs, enabling a direct comparison between automated and human evaluation methods. Results: The study finds that GPT-4 outperforms GPT-3.5 in generating accurate and useful MRs. With the advanced evaluation criteria, GPT-4 demonstrates a significant ability to produce high-quality MRs across a wide range of SUTs, including complex systems incorporating AI\u002FML components. Conclusions: GPT-4 exhibits advanced capabilities in generating MRs suitable for various applications. The research underscores the growing potential of AI in software testing, particularly in the generation and evaluation of MRs, and points towards the complementarity of human and AI skills in this domain.",[8041,595,5407,17087,593,596],"Luu, Quang-Hung",[17089,599,5411,17090,598,600],"0000-0002-0962-8975","0000-0002-7771-9836","https:\u002F\u002Fdoi.org\u002F10.48550\u002Farxiv.2503.22141","W4416422254","ArXiv.org","integrating-artificial-intelligence-with-human-expertise-an-in-depth-analysis-of.png",[139,17096,101,747,5997,9762,1165],"Complementarity (molecular biology)",{"type":39,"children":17098,"toc":17103},[17099],{"type":42,"tag":43,"props":17100,"children":17101},{},[17102],{"type":47,"value":17085},{"title":8,"searchDepth":49,"depth":49,"links":17104},[],"content:publications:2025:integrating-artificial-intelligence-with-human-expertise-an-in-depth-analysis-of.md","publications\u002F2025\u002Fintegrating-artificial-intelligence-with-human-expertise-an-in-depth-analysis-of.md","publications\u002F2025\u002Fintegrating-artificial-intelligence-with-human-expertise-an-in-depth-analysis-of",{"_path":17109,"_dir":15532,"_draft":7,"_partial":7,"_locale":8,"title":17110,"description":17111,"_hidden":7,"authors":17112,"authors_orcid":17117,"year":15548,"doi":17122,"openalex_id":17123,"venue":14088,"abstract_screenshot":21,"keywords":17124,"body":17126,"_type":51,"_id":17134,"_source":53,"_file":17135,"_stem":17136,"_extension":56,"locale":57},"\u002Fpublications\u002F2025\u002Fknowledge-enhancement-and-disentanglement-learning-for-video-captioning","Knowledge enhancement and disentanglement learning for video captioning","Video captioning, bridging computer vision and natural language, is crucial for various knowledge-based systems in the age of video streaming. Recent video captioning approaches have shown promise by integrating additional text-related knowledge to enhance understanding of video content and generate more informative captions. However, methods relying heavily on knowledge graphs face several limitations, including (i) a restricted capacity to reason complex relations among object words due to static logic rules, (ii) a lack of context awareness for spatio-temporal relation analysis in videos, and (iii) the complexity of manually constructing a knowledge graph. These limitations lead to insufficient semantic information and obstruct effective alignment between visual and textual modalities. To tackle these issues, we propose a novel knowledge enhancement and disentanglement learning method for video captioning. Our approach introduces a comprehensive and adaptable knowledge source to enhance text-related knowledge, thus directly improving caption generation. Specifically, we leverage a large language model to infer enriched semantic relations between object words and speech transcripts within video frames. By integrating visual, auditory, and textual information into universal tokens with task-specific prompts, our approach enhances semantic understanding and captures more diverse relations. Furthermore, we propose a novel modality-shared disentanglement learning strategy to better align modalities, enabling a more precise link of visual cues to their corresponding textual descriptions. Specifically, we disentangle two modalities into shared and specific features, leveraging shared features to ensure alignment while mitigating uncorrelated information. Extensive experiments demonstrate that our proposed method outperforms existing methods in both quantitative and qualitative results. • LLM-endowed additional text knowledge is proposed to generate captions. • A disentanglement learning method is proposed for better alignment of semantics. • Pre-trained text and video encoders are used to distill video-related textual features.",[17113,17114,17115,17116,8931,12170],"Wang, Mingyue","Ma, Yong","Cai, Biao","Li, Dongfen",[17118,17119,17120,17121,8937,12175],"0009-0006-3627-0354","0000-0003-0418-9210","0000-0002-2706-4982","0000-0002-3892-4546","https:\u002F\u002Fdoi.org\u002F10.1016\u002Fj.knosys.2025.114003","W4412430533",[17125,23,867,37],"Closed captioning",{"type":39,"children":17127,"toc":17132},[17128],{"type":42,"tag":43,"props":17129,"children":17130},{},[17131],{"type":47,"value":17111},{"title":8,"searchDepth":49,"depth":49,"links":17133},[],"content:publications:2025:knowledge-enhancement-and-disentanglement-learning-for-video-captioning.md","publications\u002F2025\u002Fknowledge-enhancement-and-disentanglement-learning-for-video-captioning.md","publications\u002F2025\u002Fknowledge-enhancement-and-disentanglement-learning-for-video-captioning",{"_path":17138,"_dir":15532,"_draft":7,"_partial":7,"_locale":8,"title":17139,"description":17140,"_hidden":7,"Study\" authors":17141,"authors_orcid":17144,"year":15548,"doi":17147,"openalex_id":17148,"venue":14407,"abstract_screenshot":21,"keywords":17149,"body":17150,"_type":51,"_id":17158,"_source":53,"_file":17159,"_stem":17160,"_extension":56,"locale":57},"\u002Fpublications\u002F2025\u002Flarge-language-models-for-automated-web-form-test-generation-an-empirical-study","Large Language Models for Automated Web-Form-Test Generation: An Empirica","Testing web forms is an essential activity for ensuring the quality of web applications. It typically involves evaluating the interactions between users and forms. Automated test-case generation remains a challenge for web-form testing: Due to the complex, multi-level structure of Web pages, it can be difficult to automatically capture their inherent contextual information for inclusion in the tests. Large Language Models (LLMs) have shown great potential for contextual text generation. This motivated us to explore how they could generate automated tests for web forms, making use of the contextual information within form elements. To the best of our knowledge, no comparative study examining different LLMs has yet been reported for web-form-test generation. To address this gap in the literature, we conducted a comprehensive empirical study investigating the effectiveness of 11 LLMs on 146 web forms from 30 open source Java web applications. In addition, we propose three HTML-structure-pruning methods to extract key contextual information. The experimental results show that different LLMs can achieve different testing effectiveness, with the GPT-4, GLM-4, and Baichuan2 LLMs generating the best web-form tests. Compared with GPT-4, the other LLMs had difficulty generating appropriate tests for the web forms: Their Successfully Submitted Rates (SSRs)—the proportions of the LLMs-generated web-form tests that could be successfully inserted into the web forms and submitted—decreased by 9.10% to 74.15%. Our findings also show that, for all LLMs, when the designed prompts include complete and clear contextual information about the web forms, more effective web-form tests were generated. Specifically, when using Parser-Processed HTML for Task Prompt (PH-P), the SSR averaged 70.63%, higher than the 60.21% for Raw HTML for Task Prompt (RH-P) and 50.27% for LLM-Processed HTML for Task Prompt (LH-P). With RH-P, GPT-4’s SSR was 98.86%, outperforming models like LLaMa2 (7B) with 34.47% and GLM-4V with 0%. Similarly, with PH-P, GPT-4 reached an SSR of 99.54%, the highest among all models and prompt types. Finally, this article also highlights strategies for selecting LLMs based on performance metrics, and for optimizing the prompt design to improve the quality of the web-form tests.",[17142,6820,645,595,17143],"Li, Tao","Ma, Lei",[17145,6822,650,599,17146],"0009-0001-7413-9692","0000-0002-8621-2420","https:\u002F\u002Fdoi.org\u002F10.1145\u002F3735553","W4410344404",[23,659,607,3848,4479,110,869,6950],{"type":39,"children":17151,"toc":17156},[17152],{"type":42,"tag":43,"props":17153,"children":17154},{},[17155],{"type":47,"value":17140},{"title":8,"searchDepth":49,"depth":49,"links":17157},[],"content:publications:2025:large-language-models-for-automated-web-form-test-generation-an-empirical-study.md","publications\u002F2025\u002Flarge-language-models-for-automated-web-form-test-generation-an-empirical-study.md","publications\u002F2025\u002Flarge-language-models-for-automated-web-form-test-generation-an-empirical-study",{"_path":17162,"_dir":15532,"_draft":7,"_partial":7,"_locale":8,"title":17163,"description":17164,"_hidden":7,"in China authors":17165,"authors_orcid":17166,"year":15548,"doi":17167,"openalex_id":17168,"venue":9338,"abstract_screenshot":21,"keywords":17169,"body":17170,"_type":51,"_id":17178,"_source":53,"_file":17179,"_stem":17180,"_extension":56,"locale":57},"\u002Fpublications\u002F2025\u002Fleading-or-facilitating-the-appropriate-role-of-governmental-venture-capital-in","Leading or facilitating? —— The appropriate role of governmental venture capital","This paper examines the influence of syndicated investments involving governmental venture capital (GVC) and private venture capital firms (PVC) on the success of innovative companies in China. By analysing a comprehensive dataset of small and medium-sized firms in China’s third-tier equity market, the National Equities Exchange and Quotations (NEEQ), we demonstrate that compared to the syndicated investment led by GVC, those GVCs playing a facilitating role have a more significant effect on boosting innovation firms' success in NEEQ. We identify three ways syndications help firms graduate to main stock markets: improving resource allocation, enhancing innovation quality, and lowering agency risk. Further investigation based on a quasi-natural experiment indicates that GVC-facilitating syndication impacts are more pronounced after adopting the Government Investment Regulation in 2018. • It analyzes the impact of syndicated investments involving governmental and private VCs on China's innovative companies . • Governmental venture capital (GVC) in a facilitating role significantly boosts success compared to GVC-led syndicates. • Three mechanisms are identified: improved resource allocation, enhanced innovation quality, and reduced agency risk. • The positiveGVC-facilitating syndications' impact became more pronounced following China's Government Investment Regulation .",[11876,268,11700,11877],[21,21,11879,11880],"https:\u002F\u002Fdoi.org\u002F10.1016\u002Fj.ribaf.2025.102807","W4407696335",[7574,282,178,7573,429,1357,36,1358],{"type":39,"children":17171,"toc":17176},[17172],{"type":42,"tag":43,"props":17173,"children":17174},{},[17175],{"type":47,"value":17164},{"title":8,"searchDepth":49,"depth":49,"links":17177},[],"content:publications:2025:leading-or-facilitating-the-appropriate-role-of-governmental-venture-capital-in.md","publications\u002F2025\u002Fleading-or-facilitating-the-appropriate-role-of-governmental-venture-capital-in.md","publications\u002F2025\u002Fleading-or-facilitating-the-appropriate-role-of-governmental-venture-capital-in",{"_path":17182,"_dir":15532,"_draft":7,"_partial":7,"_locale":8,"title":17183,"description":8,"_hidden":7,"authors":17184,"authors_orcid":17191,"year":15548,"doi":17198,"openalex_id":17199,"venue":10505,"abstract_screenshot":21,"keywords":17200,"body":17204,"_type":51,"_id":17208,"_source":53,"_file":17209,"_stem":17210,"_extension":56,"locale":57},"\u002Fpublications\u002F2025\u002Flearning-to-correct-unevenly-exposed-face-images-using-rgb-nir-pairs","Learning to correct unevenly exposed face images using RGB-NIR pairs",[12301,17185,17186,17187,17188,15021,17189,12305,5532,17190,12306],"Zhou, Zili","Zhang, Runmin","Hu, Yifan","Yu, Zhu","Yu, Beinan","Yang, Bailin",[12308,17192,17193,17194,17195,15026,17196,12312,5537,17197,12313],"0009-0008-9515-4024","0000-0002-8545-9966","0009-0004-9393-5004","0009-0003-0636-7743","0000-0002-1557-7166","0000-0003-1754-5595","https:\u002F\u002Fdoi.org\u002F10.1016\u002Fj.patcog.2025.112560","W4415020359",[7754,6875,6924,17201,17202,353,4876,17203],"Luminance","Offset (computer science)","Active appearance model",{"type":39,"children":17205,"toc":17206},[],{"title":8,"searchDepth":49,"depth":49,"links":17207},[],"content:publications:2025:learning-to-correct-unevenly-exposed-face-images-using-rgb-nir-pairs.md","publications\u002F2025\u002Flearning-to-correct-unevenly-exposed-face-images-using-rgb-nir-pairs.md","publications\u002F2025\u002Flearning-to-correct-unevenly-exposed-face-images-using-rgb-nir-pairs",{"_path":17212,"_dir":15532,"_draft":7,"_partial":7,"_locale":8,"title":17213,"description":17214,"_hidden":7,"GNN-Guided Reference Selection\" authors":17215,"authors_orcid":17217,"year":15548,"doi":17219,"openalex_id":17220,"venue":8774,"abstract_screenshot":21,"keywords":17221,"body":17226,"_type":51,"_id":17234,"_source":53,"_file":17235,"_stem":17236,"_extension":56,"locale":57},"\u002Fpublications\u002F2025\u002Flibscat-library-based-formal-verification-of-heavily-optimized-multipliers-via-g","LibSCAT: Library-Based Formal Verification of Heavily Optimized Multipliers vi","Formal verification of heavily optimized multipliers is a critical yet challenging problem in both industry and academia. Current approaches suffer from fundamental limitations: Symbolic Computer Algebra (SCA) techniques struggle with heavily optimized multipliers, Satisfiability (SAT)-based approaches require structurally similar reference designs, and hybrid methods fail to handle Booth multipliers. On the other hand, industrial design flows possess extensive libraries of verified multipliers for optimization workflows, creating an underutilized opportunity for library-based verification. Yet optimal reference selection becomes challenging due to large-scale libraries and optimization-obscured architectural relationships. To address these challenges, we propose LibSCAT, a verification framework that leverages large-scale reference libraries in a scalable manner. First, we propose a reference library-based methodology that adaptively combines SCA and SAT techniques through intelligent reference selection and predictive method choice. Second, we propose a Siamese Graph Neural Network model that captures multiplier structural relationships in latent space from reverse-engineered graphs, generating robust embeddings for efficient reference selection. Third, we propose a Random Forest-based predictor that leverages learned embeddings for accurate selection of verification strategies. Experimental results show our method achieves 88.2% success on heavily optimized simple partial product multipliers and 94.0% success on heavily optimized Booth multipliers, significantly outperforming state-of-the-art methods.",[6184,14803,5532,17216,11085,5534],"Yan, Guangyao",[11087,14805,5537,17218,11088,5539],"0000-0002-8256-7435","https:\u002F\u002Fdoi.org\u002F10.1109\u002Ftcad.2025.3645205","W4417438998",[6298,6090,134,17222,14809,1409,17223,17224,17225],"Formal verification","Dot product","Functional verification","Formal methods",{"type":39,"children":17227,"toc":17232},[17228],{"type":42,"tag":43,"props":17229,"children":17230},{},[17231],{"type":47,"value":17214},{"title":8,"searchDepth":49,"depth":49,"links":17233},[],"content:publications:2025:libscat-library-based-formal-verification-of-heavily-optimized-multipliers-via-g.md","publications\u002F2025\u002Flibscat-library-based-formal-verification-of-heavily-optimized-multipliers-via-g.md","publications\u002F2025\u002Flibscat-library-based-formal-verification-of-heavily-optimized-multipliers-via-g",{"_path":17238,"_dir":15532,"_draft":7,"_partial":7,"_locale":8,"title":17239,"description":8,"_hidden":7,"authors":17240,"authors_orcid":17246,"year":15548,"doi":17252,"openalex_id":17253,"venue":17254,"abstract_screenshot":21,"keywords":17255,"body":17257,"_type":51,"_id":17261,"_source":53,"_file":17262,"_stem":17263,"_extension":56,"locale":57},"\u002Fpublications\u002F2025\u002Flinking-geo-models-for-geomorphological-classification-using-knowledge-graphs","Linking geo-models for geomorphological classification using knowledge graphs",[17241,17242,17243,17244,17245,10477,4626],"Qi, Yanmin","Zhu, Yunqiang","Wang, Shu","Zhong, Yutao","Marsh, Stuart",[17247,17248,17249,17250,17251,10479,4637],"0000-0001-8720-4986","0000-0002-3356-3067","0000-0002-5355-2015","0009-0004-1998-4748","0000-0002-1168-6760","https:\u002F\u002Fdoi.org\u002F10.1016\u002Fj.cageo.2025.105873","W4406788331","Computers & Geosciences",[23,3789,17256,181,37,691],"Knowledge graph",{"type":39,"children":17258,"toc":17259},[],{"title":8,"searchDepth":49,"depth":49,"links":17260},[],"content:publications:2025:linking-geo-models-for-geomorphological-classification-using-knowledge-graphs.md","publications\u002F2025\u002Flinking-geo-models-for-geomorphological-classification-using-knowledge-graphs.md","publications\u002F2025\u002Flinking-geo-models-for-geomorphological-classification-using-knowledge-graphs",{"_path":17265,"_dir":15532,"_draft":7,"_partial":7,"_locale":8,"title":17266,"description":8,"_hidden":7,"convolution\" authors":17267,"authors_orcid":17271,"year":15548,"doi":17273,"openalex_id":17274,"venue":887,"abstract_screenshot":21,"keywords":17275,"body":17277,"_type":51,"_id":17281,"_source":53,"_file":17282,"_stem":17283,"_extension":56,"locale":57},"\u002Fpublications\u002F2025\u002Flitespiralgcn-lightweight-3d-hand-mesh-reconstruction-via-spiral-graph-convoluti","LiteSpiralGCN: Lightweight 3D hand mesh reconstruction via spiral grap",[17268,17269,17270,8931],"Wang, Y.P.","Li, Minqi","Zhang, Kaibing",[21,17272,21,8937],"0009-0001-9196-3712","https:\u002F\u002Fdoi.org\u002F10.1007\u002Fs10489-025-06585-0","W4409948818",[23,6802,9029,17276,37,102,34],"Spiral (railway)",{"type":39,"children":17278,"toc":17279},[],{"title":8,"searchDepth":49,"depth":49,"links":17280},[],"content:publications:2025:litespiralgcn-lightweight-3d-hand-mesh-reconstruction-via-spiral-graph-convoluti.md","publications\u002F2025\u002Flitespiralgcn-lightweight-3d-hand-mesh-reconstruction-via-spiral-graph-convoluti.md","publications\u002F2025\u002Flitespiralgcn-lightweight-3d-hand-mesh-reconstruction-via-spiral-graph-convoluti",{"_path":17285,"_dir":15532,"_draft":7,"_partial":7,"_locale":8,"title":17286,"description":17287,"_hidden":7,"authors":17288,"authors_orcid":17290,"year":15548,"doi":17292,"openalex_id":17293,"venue":17294,"abstract_screenshot":21,"keywords":17295,"body":17298,"_type":51,"_id":17314,"_source":53,"_file":17315,"_stem":17316,"_extension":56,"locale":57},"\u002Fpublications\u002F2025\u002Fllm4netlist-llm-enabled-step-based-netlist-generation-from-natural-language-desc","LLM4Netlist: LLM-Enabled Step-Based Netlist Generation From Natural Language Description","Empowered by Large Language Models (LLMs), substantial progress has been made in enhancing the EDA design flow in terms of high-level synthesis, such as direct translation from high-level language into RTL description. On the other hand, little research has been done for logic synthesis on the netlist generation. A direct application of LLMs for netlist generation presents additional challenges due to the scarcity of netlist-specific data, the need for tailored fine-tuning, and effective generation methods. This work first presents a novel training set and two evaluation sets catered for direct netlist generation LLMs, and an effective dataset construction pipeline to construct these datasets. Then this work proposes LLM4Netlist, a novel step-based netlist generation framework via fine-tuned LLM. The framework consists of a step-based prompt construction module, a fine-tuned LLM, a code confidence estimator, and a feedback loop module, and is able to generate netlist codes directly from natural language functional descriptions. We evaluate the efficacy of our approach with our novel evaluation datasets. The experimental results demonstrate that, compared to the average score of the 10 commercial LLMs listed in our experiments, our method shows a functional correctness increase of 183.41% on the NetlistEval dataset and a 91.07% increase on NGen. The training and testing data, along with the processing code, can be found at https:\u002F\u002Fgithub.com\u002Fklyebit\u002FLLM4Netlist.git.",[17289,9305,5816,5532,709,12,12146],"Ye, Kailiang",[21,9311,17291,5537,711,15,12148],"0000-0001-8719-3690","https:\u002F\u002Fdoi.org\u002F10.1109\u002Fjetcas.2025.3568548","W4410226776","IEEE Journal on Emerging and Selected Topics in Circuits and Systems",[16717,23,17296,110,17297,4479,5550],"Natural language generation","Natural language",{"type":39,"children":17299,"toc":17312},[17300],{"type":42,"tag":43,"props":17301,"children":17302},{},[17303,17305,17311],{"type":47,"value":17304},"Empowered by Large Language Models (LLMs), substantial progress has been made in enhancing the EDA design flow in terms of high-level synthesis, such as direct translation from high-level language into RTL description. On the other hand, little research has been done for logic synthesis on the netlist generation. A direct application of LLMs for netlist generation presents additional challenges due to the scarcity of netlist-specific data, the need for tailored fine-tuning, and effective generation methods. This work first presents a novel training set and two evaluation sets catered for direct netlist generation LLMs, and an effective dataset construction pipeline to construct these datasets. Then this work proposes LLM4Netlist, a novel step-based netlist generation framework via fine-tuned LLM. The framework consists of a step-based prompt construction module, a fine-tuned LLM, a code confidence estimator, and a feedback loop module, and is able to generate netlist codes directly from natural language functional descriptions. We evaluate the efficacy of our approach with our novel evaluation datasets. The experimental results demonstrate that, compared to the average score of the 10 commercial LLMs listed in our experiments, our method shows a functional correctness increase of 183.41% on the NetlistEval dataset and a 91.07% increase on NGen. The training and testing data, along with the processing code, can be found at ",{"type":42,"tag":1574,"props":17306,"children":17309},{"href":17307,"rel":17308},"https:\u002F\u002Fgithub.com\u002Fklyebit\u002FLLM4Netlist.git",[4520],[17310],{"type":47,"value":17307},{"type":47,"value":1645},{"title":8,"searchDepth":49,"depth":49,"links":17313},[],"content:publications:2025:llm4netlist-llm-enabled-step-based-netlist-generation-from-natural-language-desc.md","publications\u002F2025\u002Fllm4netlist-llm-enabled-step-based-netlist-generation-from-natural-language-desc.md","publications\u002F2025\u002Fllm4netlist-llm-enabled-step-based-netlist-generation-from-natural-language-desc",{"_path":17318,"_dir":15532,"_draft":7,"_partial":7,"_locale":8,"title":17319,"description":17320,"_hidden":7,"on Optimal Training Windows\" authors":17321,"authors_orcid":17323,"year":15548,"doi":17326,"openalex_id":17327,"venue":17328,"abstract_screenshot":21,"keywords":17329,"body":17330,"_type":51,"_id":17338,"_source":53,"_file":17339,"_stem":17340,"_extension":56,"locale":57},"\u002Fpublications\u002F2025\u002Fmachine-learning-for-chinese-corporate-fraud-prediction-segmented-models-based-o","Machine Learning for Chinese Corporate Fraud Prediction: Segmented Models Base","We propose a comprehensive and practical framework for Chinese corporate fraud prediction which incorporates classifiers, class imbalance, population drift, segmented models, and model evaluation using machine learning algorithms. Based on a three-stage experiment, we first find that the random forest classifier has the best performance in predicting corporate fraud among 17 machine learning models. We then implement the sliding time window approach to handle population drift, and the optimal training window found demonstrates the existence of population drift in fraud detection and the need to address it for improved model performance. Using the best machine learning model and optimal training window, we build general model and segmented models to compare fraud types and industries based on their respective predictive performance via four evaluation metrics and top features using SHAP. The results indicate that segmented models have a better predictive performance than the general model for fraud types with low fraud rates and are as good as the general model for most industries when controlling for training set size. The dissimilarities between the top features set of the general and segmented models suggest that segmented models are useful in providing a better understanding of fraud occurrence.",[17322,11578,4189,268],"Goh, C",[17324,17325,4191,272],"0009-0007-8302-5172","0000-0002-5755-5395","https:\u002F\u002Fdoi.org\u002F10.3390\u002Finfo16050397","W4410299560","Information",[3902,23,37,215,178],{"type":39,"children":17331,"toc":17336},[17332],{"type":42,"tag":43,"props":17333,"children":17334},{},[17335],{"type":47,"value":17320},{"title":8,"searchDepth":49,"depth":49,"links":17337},[],"content:publications:2025:machine-learning-for-chinese-corporate-fraud-prediction-segmented-models-based-o.md","publications\u002F2025\u002Fmachine-learning-for-chinese-corporate-fraud-prediction-segmented-models-based-o.md","publications\u002F2025\u002Fmachine-learning-for-chinese-corporate-fraud-prediction-segmented-models-based-o",{"_path":17342,"_dir":15532,"_draft":7,"_partial":7,"_locale":8,"title":17343,"description":17344,"_hidden":7,"Segmentation\" authors":17345,"authors_orcid":17348,"year":15548,"doi":17351,"openalex_id":17352,"venue":17353,"abstract_screenshot":21,"keywords":17354,"body":17355,"_type":51,"_id":17371,"_source":53,"_file":17372,"_stem":17373,"_extension":56,"locale":57},"\u002Fpublications\u002F2025\u002Fmambavesselnet-a-hybrid-cnn-mamba-architecture-for-medical-image-segmentation","MambaVesselNet++: A Hybrid CNN-Mamba Architecture for Medical Imag","Medical image segmentation plays an important role in computer-aided diagnosis. Traditional convolution-based U-shape segmentation architectures are usually limited by the local receptive field. Existing vision transformers have been widely applied to diverse medical segmentation frameworks due to their superior capabilities of capturing global contexts. Despite the advantage, the real-world application of vision transformers is challenged by their non-linear self-attention mechanism, requiring huge computational costs. To address this issue, the selective state space model (SSM) Mamba has gained recognition for its adeptness in modeling long-range dependencies in sequential data, particularly noted for its efficient memory costs. In this paper, we propose MambaVesselNet++, a Hybrid CNN-Mamba framework for medical image segmentation. Our MambaVesselNet++ is comprised of a hybrid image encoder (Hi-Encoder) and a bifocal fusion decoder (BF-Decoder). In Hi-Encoder, we first devise the texture-aware layer to capture low-level semantic features by leveraging convolutions. Then, we utilize Mamba to effectively model long-range dependencies with linear complexity. The Bi-Decoder adopts skip connections to combine local and global information of the Hi-Encoder for the accurate generation of segmentation masks. Extensive experiments demonstrate that MambaVesselNet++ outperforms current convolution-based, transformer-based, and Mamba-based state-of-the-arts across diverse medical 2D, 3D, and instance segmentation tasks. The code is available at https:\u002F\u002Fgithub.com\u002FCC0117\u002FMambaVesselNet .",[15898,13446,13450,14340,17346,17347,13444,8931],"Lou, Zhenye","Zhang, Yixuan",[15902,17349,14924,14342,21,17350,13456,8937],"0009-0004-2732-474X","0009-0000-9636-6397","https:\u002F\u002Fdoi.org\u002F10.1145\u002F3757324","W4413682217","ACM Transactions on Multimedia Computing Communications and Applications",[23,6300,37,9090,4391,4004,11495],{"type":39,"children":17356,"toc":17369},[17357],{"type":42,"tag":43,"props":17358,"children":17359},{},[17360,17362,17368],{"type":47,"value":17361},"Medical image segmentation plays an important role in computer-aided diagnosis. Traditional convolution-based U-shape segmentation architectures are usually limited by the local receptive field. Existing vision transformers have been widely applied to diverse medical segmentation frameworks due to their superior capabilities of capturing global contexts. Despite the advantage, the real-world application of vision transformers is challenged by their non-linear self-attention mechanism, requiring huge computational costs. To address this issue, the selective state space model (SSM) Mamba has gained recognition for its adeptness in modeling long-range dependencies in sequential data, particularly noted for its efficient memory costs. In this paper, we propose MambaVesselNet++, a Hybrid CNN-Mamba framework for medical image segmentation. Our MambaVesselNet++ is comprised of a hybrid image encoder (Hi-Encoder) and a bifocal fusion decoder (BF-Decoder). In Hi-Encoder, we first devise the texture-aware layer to capture low-level semantic features by leveraging convolutions. Then, we utilize Mamba to effectively model long-range dependencies with linear complexity. The Bi-Decoder adopts skip connections to combine local and global information of the Hi-Encoder for the accurate generation of segmentation masks. Extensive experiments demonstrate that MambaVesselNet++ outperforms current convolution-based, transformer-based, and Mamba-based state-of-the-arts across diverse medical 2D, 3D, and instance segmentation tasks. The code is available at ",{"type":42,"tag":1574,"props":17363,"children":17366},{"href":17364,"rel":17365},"https:\u002F\u002Fgithub.com\u002FCC0117\u002FMambaVesselNet",[4520],[17367],{"type":47,"value":17364},{"type":47,"value":16736},{"title":8,"searchDepth":49,"depth":49,"links":17370},[],"content:publications:2025:mambavesselnet-a-hybrid-cnn-mamba-architecture-for-medical-image-segmentation.md","publications\u002F2025\u002Fmambavesselnet-a-hybrid-cnn-mamba-architecture-for-medical-image-segmentation.md","publications\u002F2025\u002Fmambavesselnet-a-hybrid-cnn-mamba-architecture-for-medical-image-segmentation",{"_path":17375,"_dir":15532,"_draft":7,"_partial":7,"_locale":8,"title":17376,"description":17377,"_hidden":7,"Estimation authors":17378,"authors_orcid":17380,"year":15548,"doi":17382,"openalex_id":17383,"venue":21,"abstract_screenshot":21,"keywords":17384,"body":17387,"_type":51,"_id":17395,"_source":53,"_file":17396,"_stem":17397,"_extension":56,"locale":57},"\u002Fpublications\u002F2025\u002Fmarker-free-multi-modal-motion-capture-for-6-dof-object-position-and-orientation","Marker-Free Multi-Modal Motion Capture for 6-DoF Object Position and Orientation","In this work, we present a novel multi-modal, end-to-end, marker-free motion capture framework designed to estimate the six degrees of freedom (6-DoF) states of objects. Traditional motion capture systems often rely on infrared optical, inertial, or magnetic markers to identify and track objects. However, in many application scenarios, such as outdoor environments and robotics development, the use of markers interferes with system operation, and the markers themselves are prone to environmental interference. Our proposed framework tackles these challenges using a two-stage approach, leveraging multimodal sensor fusion techniques. The framework integrates cameras and Light Detection and Ranging (Lidar) sensors around the workspace, each operating at different frequencies. A data synchronizer controls the triggering of these sensors, ensuring synchronized data collection from multiple sensor streams. In stage I, the framework focuses on multimodal feature extraction, utilizing multiple modules to process the sensor data streams and extract spatial features. In stage II, the position and pose extraction module calculates the spatial state of the object by combining the extracted features with the object’s spatial state context from previous frames. We validate the framework through experiments on the Nvidia ISAAC digital twin platform and in real-world environments, demonstrating its feasibility and robustness across a variety of test objects. This approach provides a reliable and flexible solution for motion capture in complex environments, eliminating the need for invasive markers. High real-time performance is achieved at each stage and within each submodule by using lightweight neural networks and time-aligned data synchronization. By integrating multimodal sensor fusion and context-based spatial state computation, the proposed method ensures high recognition accuracy, even in challenging symmetrical objects cases.",[13702,10191,17379,1181,157,709],"Wang, Jiamin",[21,13706,17381,1184,9726,21],"0000-0002-3236-9465","https:\u002F\u002Fdoi.org\u002F10.1109\u002Fcism64958.2025.11060859","W4412109191",[8136,4391,9957,23,11118,7445,37,17385,17386,6979,11831,34,3393,3961],"Motion estimation","Motion capture",{"type":39,"children":17388,"toc":17393},[17389],{"type":42,"tag":43,"props":17390,"children":17391},{},[17392],{"type":47,"value":17377},{"title":8,"searchDepth":49,"depth":49,"links":17394},[],"content:publications:2025:marker-free-multi-modal-motion-capture-for-6-dof-object-position-and-orientation.md","publications\u002F2025\u002Fmarker-free-multi-modal-motion-capture-for-6-dof-object-position-and-orientation.md","publications\u002F2025\u002Fmarker-free-multi-modal-motion-capture-for-6-dof-object-position-and-orientation",{"_path":17399,"_dir":15532,"_draft":7,"_partial":7,"_locale":8,"title":17400,"description":17401,"_hidden":7,"Decision-Making\" authors":17402,"authors_orcid":17405,"year":15548,"doi":17408,"openalex_id":17409,"venue":9425,"abstract_screenshot":21,"keywords":17410,"body":17411,"_type":51,"_id":17419,"_source":53,"_file":17420,"_stem":17421,"_extension":56,"locale":57},"\u002Fpublications\u002F2025\u002Fmdnet-multimodal-cooperative-perception-via-spatial-alignment-of-modal-decision","MDNet: Multimodal Cooperative Perception via Spatial Alignment of Moda","Through Internet of Things (IoT) communication technology, collaborative perception enhances a vehicle’s capacity to discern its surroundings while driving by integrating and synchronizing sensor data from multiple agents. With the advancement of cooperative perception techniques in single-modality methods, there has been a growing trend toward integrating multimodal data from heterogeneous sensors in recent years. However, due to the data heterogeneity inherent in diverse sensors, Bird’s Eye View (BEV) maps generated from different types of sensors may exhibit local discrepancies in the spatial representation of entity positions. Furthermore, individual agents may produce uncertain and flawed feature representations in real noisy environments. The influence of this indeterminacy exacerbates the issue of local inconsistency, leading to misalignment of the detected target during BEV alignment and fusion, thereby reducing detection accuracy. To address these problems, we propose a modal decision-making spatial alignment cooperative perception network (MDNet). First, the network generates BEV feature maps through dense depth image supervision for voxel feature extraction and model-guided selective feature fusion. Subsequently, we achieve enhanced accuracy in object detection by performing spatial alignment of BEV representations generated from two distinct sensors, both globally and locally within the spatial domain. Besides, we employ a cascaded centralized pyramid strategy during the message fusion stage, facilitating flexible sampling across horizontal and vertical spatial dimensions, promoting deep interaction among multiple agents. We conduct quantitative and qualitative experiments on the public OPV2V and DAIR-V2X-C benchmarks, and our proposed MDNet exhibits superior performance and stronger robustness in the 3-D object detection task, providing more precise target detection results.",[17403,15836,17404,10271,8931],"He, Junyang","Gui, Jinsong",[17406,15844,17407,16750,8937],"0009-0005-5250-6593","0000-0001-9399-9092","https:\u002F\u002Fdoi.org\u002F10.1109\u002Fjiot.2025.3531145","W4406521384",[11118,23,9784,37],{"type":39,"children":17412,"toc":17417},[17413],{"type":42,"tag":43,"props":17414,"children":17415},{},[17416],{"type":47,"value":17401},{"title":8,"searchDepth":49,"depth":49,"links":17418},[],"content:publications:2025:mdnet-multimodal-cooperative-perception-via-spatial-alignment-of-modal-decision.md","publications\u002F2025\u002Fmdnet-multimodal-cooperative-perception-via-spatial-alignment-of-modal-decision.md","publications\u002F2025\u002Fmdnet-multimodal-cooperative-perception-via-spatial-alignment-of-modal-decision",{"_path":17423,"_dir":15532,"_draft":7,"_partial":7,"_locale":8,"title":17424,"description":17425,"_hidden":7,"authors":17426,"authors_orcid":17428,"year":15548,"doi":17429,"openalex_id":17430,"venue":14521,"abstract_screenshot":21,"keywords":17431,"body":17432,"_type":51,"_id":17440,"_source":53,"_file":17441,"_stem":17442,"_extension":56,"locale":57},"\u002Fpublications\u002F2025\u002Fmetamorphic-relation-patterns-for-metamorphic-testing-exploration-and-robustness","Metamorphic Relation Patterns for Metamorphic Testing, Exploration and Robustness","ABSTRACT Metamorphic testing (MT) is an effective software quality assurance method; it uses metamorphic relations (MRs) to examine the inputs and outputs of multiple test cases. Metamorphic exploration (ME) and metamorphic robustness testing (MRT) are advanced additions to the MT literature: ME can enable better understanding, and thus testing, of systems; MRT can test software robustness without an oracle. Metamorphic relation patterns (MRPs) are abstractions or templates for multiple concrete MRs. The performance of MT\u002FME\u002FMRT relies on the quality of MRs, but the identification of MRs is often a manual task requiring some knowledge of MRPs, creative thinking and a good understanding of the system. In other words, the effective identification of MRs remains a challenge and requires further study. In this paper, we propose formal definitions to describe the relationship between multiple MRPs in order to classify them. We also identify a series of new MRPs and propose a new MT framework that can guide the identification and application of MRPs. Based on our definitions, we present the notion of MRP family trees and further propose two trees by classifying previously published MRPs and our proposed MRPs, in order to make it easier for users to find their target MRPs for reuse, reference or inference. Finally, we report on case studies using the MRPs and our framework to guide the identification of MRs for MT\u002FME\u002FMRT and successfully detect multiple violations.",[8040,595,4189,17427,1156],"Chua, Caslon",[8044,599,4191,21,1158],"https:\u002F\u002Fdoi.org\u002F10.1002\u002Fstvr.70003","W4407650836",[3788,3789,353,3790],{"type":39,"children":17433,"toc":17438},[17434],{"type":42,"tag":43,"props":17435,"children":17436},{},[17437],{"type":47,"value":17425},{"title":8,"searchDepth":49,"depth":49,"links":17439},[],"content:publications:2025:metamorphic-relation-patterns-for-metamorphic-testing-exploration-and-robustness.md","publications\u002F2025\u002Fmetamorphic-relation-patterns-for-metamorphic-testing-exploration-and-robustness.md","publications\u002F2025\u002Fmetamorphic-relation-patterns-for-metamorphic-testing-exploration-and-robustness",{"_path":17444,"_dir":15532,"_draft":7,"_partial":7,"_locale":8,"title":17445,"description":17446,"_hidden":7,"Learning Interfaces\" authors":17447,"authors_orcid":17448,"year":15548,"doi":17450,"openalex_id":17451,"venue":10226,"abstract_screenshot":21,"keywords":17452,"body":17454,"_type":51,"_id":17462,"_source":53,"_file":17463,"_stem":17464,"_extension":56,"locale":57},"\u002Fpublications\u002F2025\u002Fmicrolearning-in-immersive-virtual-reality-a-user-centered-analysis-of-learning","Microlearning in Immersive Virtual Reality: A User-Centered Analysis o","The rapid changes in technology available for teaching and learning have led to a wide variety of potential tools that can be deployed to support a student's education experience. This article examines the learning interfaces for pedagogical virtual reality (VR) environments, including immersive VR (iVR). It also looks at how microlearning (ML) can be employed for instructional design at the sticking points of these interfaces. ML is an approach in which learning materials are provided in small bite-sized quantities and has been embraced as an ideal learning format for the modern learner. This study explores the research gap in ML literature regarding the ideal length of materials and modality when ML is employed for iVR. It does so through two experiments: in the first, students gave feedback on different interfaces for content and in the second, different lengths of text, video, and presentation style were tested for optimal user preference and comprehension. The findings show that preferences must be balanced against expected learning outcomes or desired level of engagement, but that fixed-point interfaces and longer texts may best be avoided. The study can be used to inform technology-enhanced learning delivery and can be used to guide policy regarding effective digital content, particularly within a VR environment.",[7077,7078,11421,595,15816,7079],[7081,7082,11428,599,17449,7083],"0009-0000-1039-9703","https:\u002F\u002Fdoi.org\u002F10.1109\u002Ftlt.2025.3533360","W4406794457",[23,868,4390,13641,867,17453],"User interface",{"type":39,"children":17455,"toc":17460},[17456],{"type":42,"tag":43,"props":17457,"children":17458},{},[17459],{"type":47,"value":17446},{"title":8,"searchDepth":49,"depth":49,"links":17461},[],"content:publications:2025:microlearning-in-immersive-virtual-reality-a-user-centered-analysis-of-learning.md","publications\u002F2025\u002Fmicrolearning-in-immersive-virtual-reality-a-user-centered-analysis-of-learning.md","publications\u002F2025\u002Fmicrolearning-in-immersive-virtual-reality-a-user-centered-analysis-of-learning",{"_path":17466,"_dir":15532,"_draft":7,"_partial":7,"_locale":8,"title":17467,"description":8,"_hidden":7,"Neural Networks authors":17468,"authors_orcid":17469,"year":15548,"doi":17470,"openalex_id":17471,"venue":74,"abstract_screenshot":21,"keywords":17472,"body":17473,"_type":51,"_id":17477,"_source":53,"_file":17478,"_stem":17479,"_extension":56,"locale":57},"\u002Fpublications\u002F2025\u002Fmitigating-population-drift-using-time-dependent-weighted-loss-functions-in-neur","Mitigating Population Drift Using Time-Dependent Weighted Loss Functions in",[17322,4189,268],[17324,4191,272],"https:\u002F\u002Fdoi.org\u002F10.2139\u002Fssrn.5379150","W4412947951",[632,952,23,287,34,37,380],{"type":39,"children":17474,"toc":17475},[],{"title":8,"searchDepth":49,"depth":49,"links":17476},[],"content:publications:2025:mitigating-population-drift-using-time-dependent-weighted-loss-functions-in-neur.md","publications\u002F2025\u002Fmitigating-population-drift-using-time-dependent-weighted-loss-functions-in-neur.md","publications\u002F2025\u002Fmitigating-population-drift-using-time-dependent-weighted-loss-functions-in-neur",{"_path":17481,"_dir":15532,"_draft":7,"_partial":7,"_locale":8,"title":17482,"description":8,"_hidden":7,"multi-pattern and multi-model fusion\" authors":17483,"authors_orcid":17485,"year":15548,"doi":17486,"openalex_id":17487,"venue":7552,"abstract_screenshot":21,"keywords":17488,"body":17490,"_type":51,"_id":17494,"_source":53,"_file":17495,"_stem":17496,"_extension":56,"locale":57},"\u002Fpublications\u002F2025\u002Fmulad-a-log-based-anomaly-detection-approach-for-distributed-systems-using-multi","MulAD: A log-based anomaly detection approach for distributed systems usin",[14281,17484,3163,595],"Sun, Chang-Ai",[21,21,21,599],"https:\u002F\u002Fdoi.org\u002F10.1016\u002Fj.scico.2025.103433","W7116832739",[14295,17489,4876,9029,16259,14296,99,6977],"Interleaving",{"type":39,"children":17491,"toc":17492},[],{"title":8,"searchDepth":49,"depth":49,"links":17493},[],"content:publications:2025:mulad-a-log-based-anomaly-detection-approach-for-distributed-systems-using-multi.md","publications\u002F2025\u002Fmulad-a-log-based-anomaly-detection-approach-for-distributed-systems-using-multi.md","publications\u002F2025\u002Fmulad-a-log-based-anomaly-detection-approach-for-distributed-systems-using-multi",{"_path":17498,"_dir":15532,"_draft":7,"_partial":7,"_locale":8,"title":17499,"description":8,"_hidden":7,"Multi-Person Inertial Navigation System\" authors":17500,"authors_orcid":17502,"year":15548,"doi":17504,"openalex_id":17505,"venue":74,"abstract_screenshot":21,"keywords":17506,"body":17507,"_type":51,"_id":17511,"_source":53,"_file":17512,"_stem":17513,"_extension":56,"locale":57},"\u002Fpublications\u002F2025\u002Fmulti-ins-a-novel-approach-integrating-online-shared-magnetic-fingerprints-for-m","Multi-Ins: A Novel Approach Integrating Online Shared Magnetic Fingerprints fo",[7746,5667,17501,8463,9830,5407,3377],"Chen, Long",[21,5670,17503,8466,9834,5411,3381],"0000-0003-2340-0325","https:\u002F\u002Fdoi.org\u002F10.2139\u002Fssrn.5272676","W4410795882",[10250,23,10252,37,4391,868,3597],{"type":39,"children":17508,"toc":17509},[],{"title":8,"searchDepth":49,"depth":49,"links":17510},[],"content:publications:2025:multi-ins-a-novel-approach-integrating-online-shared-magnetic-fingerprints-for-m.md","publications\u002F2025\u002Fmulti-ins-a-novel-approach-integrating-online-shared-magnetic-fingerprints-for-m.md","publications\u002F2025\u002Fmulti-ins-a-novel-approach-integrating-online-shared-magnetic-fingerprints-for-m",{"_path":17515,"_dir":15532,"_draft":7,"_partial":7,"_locale":8,"title":17516,"description":8,"_hidden":7,"The case of innovation policymaking in China\" authors":17517,"authors_orcid":17518,"year":15548,"doi":17519,"openalex_id":17520,"venue":13828,"abstract_screenshot":21,"keywords":17521,"body":17523,"_type":51,"_id":17527,"_source":53,"_file":17528,"_stem":17529,"_extension":56,"locale":57},"\u002Fpublications\u002F2025\u002Fmultiple-proximities-and-inter-agency-collaboration-within-a-policy-network-the","Multiple proximities and inter-agency collaboration within a policy network",[3538,13821,65],[3540,13824,70],"https:\u002F\u002Fdoi.org\u002F10.1016\u002Fj.technovation.2025.103169","W4406501772",[282,5149,178,17522,751,3958,3714,1358,289,1380],"Regulatory agency",{"type":39,"children":17524,"toc":17525},[],{"title":8,"searchDepth":49,"depth":49,"links":17526},[],"content:publications:2025:multiple-proximities-and-inter-agency-collaboration-within-a-policy-network-the.md","publications\u002F2025\u002Fmultiple-proximities-and-inter-agency-collaboration-within-a-policy-network-the.md","publications\u002F2025\u002Fmultiple-proximities-and-inter-agency-collaboration-within-a-policy-network-the",{"_path":17531,"_dir":15532,"_draft":7,"_partial":7,"_locale":8,"title":17532,"description":17533,"_hidden":7,"Things authors":17534,"authors_orcid":17536,"year":15548,"doi":17539,"openalex_id":17540,"venue":9425,"abstract_screenshot":21,"keywords":17541,"body":17544,"_type":51,"_id":17552,"_source":53,"_file":17553,"_stem":17554,"_extension":56,"locale":57},"\u002Fpublications\u002F2025\u002Fneuro-symbolic-intent-based-intrusion-detection-system-for-internet-of-medical-t","Neuro-Symbolic Intent-Based Intrusion Detection System for Internet of Medical","The Internet of Medical Things (IoMT) introduces complex security challenges as interconnected medical devices enlarge the attack surface and limit the effectiveness of traditional intrusion detection systems (IDS). In this paper, we propose a Neuro-Symbolic Intent-Based Intrusion Detection System (NS-IBN) that integrates deep learning–based pattern recognition with symbolic reasoning to produce interpretable, intent-aligned security decisions. NS-IBN comprises an Intent-to-Symbol Translation Layer, an Intent-Driven Attention Mechanism, a Neural-Symbolic Synchronization Module, and a Symbolic Reasoning Engine that together link administrator-defined security intents to concrete detection behavior. In a representative intensive care unit (ICU) scenario with networked infusion pumps and vital-sign monitors, NS-IBN can be configured to detect lateral movement and unauthorized command injection while limiting disruptive false alarms for clinicians. Evaluation on the IoT-IDS2021 benchmark shows that NS-IBN achieves 98.3% accuracy, an explainability score of 0.94, and a 1.2% false positive rate, providing transparent and auditable intrusion detection for IoMT environments.",[17535,13218,16897,15540,16301,13519],"Sun, Yiya",[17537,13226,16902,15547,16306,17538],"0009-0000-0902-498X","0009-0009-1566-8883","https:\u002F\u002Fdoi.org\u002F10.1109\u002Fjiot.2025.3645938","W4417470019",[12810,209,1108,6193,14114,6299,1107,17542,17543],"Intrusion prevention system","Limit (mathematics)",{"type":39,"children":17545,"toc":17550},[17546],{"type":42,"tag":43,"props":17547,"children":17548},{},[17549],{"type":47,"value":17533},{"title":8,"searchDepth":49,"depth":49,"links":17551},[],"content:publications:2025:neuro-symbolic-intent-based-intrusion-detection-system-for-internet-of-medical-t.md","publications\u002F2025\u002Fneuro-symbolic-intent-based-intrusion-detection-system-for-internet-of-medical-t.md","publications\u002F2025\u002Fneuro-symbolic-intent-based-intrusion-detection-system-for-internet-of-medical-t",{"_path":17556,"_dir":15532,"_draft":7,"_partial":7,"_locale":8,"title":17557,"description":8,"_hidden":7,"domain-generalized nuclei segmentation\" authors":17558,"authors_orcid":17561,"year":15548,"doi":17565,"openalex_id":17566,"venue":14088,"abstract_screenshot":21,"keywords":17567,"body":17569,"_type":51,"_id":17573,"_source":53,"_file":17574,"_stem":17575,"_extension":56,"locale":57},"\u002Fpublications\u002F2025\u002Fnusegdg-integration-of-heterogeneous-space-and-gaussian-kernel-for-domain-genera","NuSegDG: Integration of heterogeneous space and Gaussian kernel fo",[17346,15898,17559,8931,16081,16084,17560,16984,16083],"Jiang, Zekun","Wang, Yifan",[21,15902,17562,8937,16088,17563,17564,21,16090],"0000-0002-3178-7761","0000-0001-8018-9103","0000-0003-3820-2065","https:\u002F\u002Fdoi.org\u002F10.1016\u002Fj.knosys.2025.113641","W4410528390",[17568,1167,27,9090,23,3689,34,37,4876,108,7449,3597],"Kernel (algebra)",{"type":39,"children":17570,"toc":17571},[],{"title":8,"searchDepth":49,"depth":49,"links":17572},[],"content:publications:2025:nusegdg-integration-of-heterogeneous-space-and-gaussian-kernel-for-domain-genera.md","publications\u002F2025\u002Fnusegdg-integration-of-heterogeneous-space-and-gaussian-kernel-for-domain-genera.md","publications\u002F2025\u002Fnusegdg-integration-of-heterogeneous-space-and-gaussian-kernel-for-domain-genera",{"_path":17577,"_dir":15532,"_draft":7,"_partial":7,"_locale":8,"title":17578,"description":17579,"_hidden":7,"authors":17580,"authors_orcid":17583,"year":15548,"doi":17585,"openalex_id":17586,"venue":15797,"abstract_screenshot":21,"keywords":17587,"body":17588,"_type":51,"_id":17596,"_source":53,"_file":17597,"_stem":17598,"_extension":56,"locale":57},"\u002Fpublications\u002F2025\u002Fonline-bayesian-approximation-based-uncertainty-aware-model-for-ophthalmic-image","Online Bayesian Approximation Based Uncertainty Aware Model for Ophthalmic Image Segmentation","The robust segmentation of different targets in multiple modality images is challenging due to factors such as low contrast, variations in target size and shape, and interference from diseases, which may lead to segmentation ambiguity. In addition, the assessment of the reliability of artificial intelligence is crucial for its clinical application. This paper proposes the Online Bayesian approximation based Uncertainty-aware Network (OBU-Net) for robust ophthalmic image segmentation. Our approach introduces an efficient online Bayesian method to update a spatial uncertainty map during training continuously. Then, the Spatial Uncertainty Aware Block (SUA-B) leverages the uncertainty map to localize and prioritize attention to ambiguous regions. Additionally, we extract pixel-wise confidence from multi-scale predictions to integrate hierarchical predictions. We compare OBU-Net with state-of-the-art (SOTA) methods on six datasets. The experimental results demonstrate that our method achieves the best overall performance across different modalities and segmentation tasks, highlighting the robustness of our approach. Additionally, metamorphic testing experiments were conducted, exploring the algorithm's stability against random perturbations. Lastly, we propose an image-level uncertainty score and demonstrate its effectiveness for evaluating the model's segmentation reliability.",[11482,11485,12563,17581,11483,17582,11484,595,12,8406],"Li, Jialin","Liu, Tianhang",[11487,11490,12565,17584,11488,21,11489,599,15,8409],"0009-0006-9328-9465","https:\u002F\u002Fdoi.org\u002F10.1109\u002Fjbhi.2025.3593983","W4412795544",[23,11495,37,5591,9090,4391,4004,4876,215],{"type":39,"children":17589,"toc":17594},[17590],{"type":42,"tag":43,"props":17591,"children":17592},{},[17593],{"type":47,"value":17579},{"title":8,"searchDepth":49,"depth":49,"links":17595},[],"content:publications:2025:online-bayesian-approximation-based-uncertainty-aware-model-for-ophthalmic-image.md","publications\u002F2025\u002Fonline-bayesian-approximation-based-uncertainty-aware-model-for-ophthalmic-image.md","publications\u002F2025\u002Fonline-bayesian-approximation-based-uncertainty-aware-model-for-ophthalmic-image",{"_path":17600,"_dir":15532,"_draft":7,"_partial":7,"_locale":8,"title":17601,"description":17602,"_hidden":7,"Hangzhou for Reducing Carbon Emissions\" authors":17603,"authors_orcid":17606,"year":15548,"doi":17611,"openalex_id":17612,"venue":17613,"abstract_screenshot":21,"keywords":17614,"body":17617,"_type":51,"_id":17625,"_source":53,"_file":17626,"_stem":17627,"_extension":56,"locale":57},"\u002Fpublications\u002F2025\u002Foptimizing-urban-land-use-through-deep-reinforcement-learning-a-case-study-in-ha","Optimizing Urban Land-Use Through Deep Reinforcement Learning: A Case Study i","Urban land-use optimization plays a vital role in mitigating the escalating carbon emissions of rapidly growing cities. This study employs advanced computational intelligence to address urban carbon reduction through optimized spatial configurations. A Deep Reinforcement Learning (DRL) framework is proposed that integrates Points of Interest (POI), Areas of Interest (AOI), and Transportation System Data (TSD) to generate fine-grained carbon emission maps guiding land-use adjustments. In the case study of Hangzhou, China, results show that a carefully designed reward function enables the DRL agent to selectively optimize land-use structures, prioritizing the centralization of residential, dining, and commercial areas to form high-density, mixed-use urban clusters. This spatial reorganization leads to notable reductions in carbon emissions and improvements in resource-use efficiency. The proposed DRL-based framework provides a scientific basis for policy development toward sustainable land-use and urban density optimization. By merging advanced AI techniques with urban planning, this research contributes to the creation of low-carbon, resilient, and environmentally sustainable cities capable of addressing global climate challenges. The optimized DRL agent achieved carbon emission reductions of up to 15% compared to baseline configurations in the Hangzhou case study. Spatial concentration analysis revealed a 23% increase in residential area clustering and 31% increase in commercial zone centralization over 400 training episodes. The PPO-based model demonstrated superior performance compared to genetic algorithm and linear regression baselines, with lower policy loss (converging to \u003C0.01) and critic loss (converging to \u003C0.005) after early stopping at 400 episodes. However, this study is limited by its deterministic environment model, geographic specificity to Hangzhou, and exclusive focus on carbon reduction without incorporating socioeconomic constraints.",[10004,10006,17604,10007,4189,16082,17605],"Chen, Tianyi","Lucchi, Elena",[17607,21,17608,17609,4191,16089,17610],"0000-0001-6608-8517","0000-0001-8893-3486","0000-0003-4747-0344","0000-0002-3671-6460","https:\u002F\u002Fdoi.org\u002F10.3390\u002Fland14122368","W4416958560","Land",[3634,5304,17615,748,3441,3390,15290,17616],"Carbon fibers","Linear programming",{"type":39,"children":17618,"toc":17623},[17619],{"type":42,"tag":43,"props":17620,"children":17621},{},[17622],{"type":47,"value":17602},{"title":8,"searchDepth":49,"depth":49,"links":17624},[],"content:publications:2025:optimizing-urban-land-use-through-deep-reinforcement-learning-a-case-study-in-ha.md","publications\u002F2025\u002Foptimizing-urban-land-use-through-deep-reinforcement-learning-a-case-study-in-ha.md","publications\u002F2025\u002Foptimizing-urban-land-use-through-deep-reinforcement-learning-a-case-study-in-ha",{"_path":17629,"_dir":15532,"_draft":7,"_partial":7,"_locale":8,"title":17630,"description":17631,"_hidden":7,"authors":17632,"authors_orcid":17633,"year":15548,"doi":17634,"openalex_id":17635,"venue":17636,"abstract_screenshot":21,"keywords":17637,"body":17638,"_type":51,"_id":17646,"_source":53,"_file":17647,"_stem":17648,"_extension":56,"locale":57},"\u002Fpublications\u002F2025\u002Fpgu-sgp-a-pheno-geno-unified-surrogate-genetic-programming-for-real-life-contain","PGU-SGP: A Pheno-Geno Unified Surrogate Genetic Programming For Real-life Container Terminal Truck Scheduling","Data-driven genetic programming (GP) has proven highly effective in solving combinatorial optimization problems under dynamic and uncertain environments. A central challenge lies in fast fitness evaluations on large training datasets, especially for complex real-world problems involving time-consuming simulations. Surrogate models, like phenotypic characterization (PC)-based K-nearest neighbors (KNN), have been applied to reduce computational cost. However, the PC-based similarity measure is confined to behavioral characteristics, overlooking genotypic differences, which can limit surrogate quality and impair performance. To address these issues, this paper proposes a pheno-geno unified surrogate GP algorithm, PGU-SGP, integrating phenotypic and genotypic characterization (GC) to enhance surrogate sample selection and fitness prediction. A novel unified similarity metric combining PC and GC distances is proposed, along with an effective and efficient GC representation. Experimental results of a real-life vehicle scheduling problem demonstrate that PGU-SGP reduces training time by approximately 76% while achieving comparable performance to traditional GP. With the same training time, PGU-SGP significantly outperforms traditional GP and the state-of-the-art algorithm on most datasets. Additionally, PGU-SGP shows faster convergence and improved surrogate quality by maintaining accurate fitness rankings and appropriate selection pressure, further validating its effectiveness.",[13681,13680,5989,319,12],[13683,21,5991,322,15],"https:\u002F\u002Fdoi.org\u002F10.1145\u002F3712256.3726326","W4412106607","Proceedings of the Genetic and Evolutionary Computation Conference",[1189,3199,746,23,97,450,179,37,752,251,33,7576],{"type":39,"children":17639,"toc":17644},[17640],{"type":42,"tag":43,"props":17641,"children":17642},{},[17643],{"type":47,"value":17631},{"title":8,"searchDepth":49,"depth":49,"links":17645},[],"content:publications:2025:pgu-sgp-a-pheno-geno-unified-surrogate-genetic-programming-for-real-life-contain.md","publications\u002F2025\u002Fpgu-sgp-a-pheno-geno-unified-surrogate-genetic-programming-for-real-life-contain.md","publications\u002F2025\u002Fpgu-sgp-a-pheno-geno-unified-surrogate-genetic-programming-for-real-life-contain",{"_path":17650,"_dir":15532,"_draft":7,"_partial":7,"_locale":8,"title":17651,"description":17652,"_hidden":7,"Quantum-Inspired Ant Colony Optimization-Based Reference Generation\" authors":17653,"authors_orcid":17654,"year":15548,"doi":17655,"openalex_id":17656,"venue":8774,"abstract_screenshot":21,"keywords":17657,"body":17660,"_type":51,"_id":17668,"_source":53,"_file":17669,"_stem":17670,"_extension":56,"locale":57},"\u002Fpublications\u002F2025\u002Frefscat-2-0-formal-verification-of-large-scale-optimized-multipliers-via-quantum","RefSCAT-2.0: Formal Verification of Large-Scale Optimized Multipliers vi","Formal verification of large-scale optimized integer multipliers remains a critical yet insufficiently addressed challenge in industry and academia. Current methods employ reference multiplier generators to automatically construct structurally similar reference multipliers, which are then used by Satisfiability (SAT)-based techniques to verify equivalence with optimized multipliers. However, these approaches face limitations when generating references for large-scale optimized multipliers within acceptable timeframes. To address these limitations, we introduce the RefSCAT-2.0 framework, designed to rapidly produce high-quality large-scale reference multipliers. Firstly, we generate the macro-architecture to determine the number of adders required for constructing the reference multiplier. We propose a novel Integer Linear Programming (ILP)-based macro-architecture generation algorithm that minimizes the number of allocated adders, thereby reducing the overall problem complexity. Secondly, we organize the allocated adders into groups to simplify the subsequent generation process. We present a multi-level scheduler that automatically decomposes adders into groups with minimized interdependencies, ensuring both the quality of generation and a reduction in overall generation complexity. Thirdly, we generate the micro-architecture for each scheduled group, wherein we finalize the connections between adders. We present a graph-based design space representation coupled with a quantum-inspired ant colony optimization (QACO)-based generation algorithm that can efficiently explores the micro-architectures of each scheduled group. Experimental results show that RefSCAT-2.0 successfully verifies all 124 cases in a 256-bit optimized multiplier benchmark suite, outperforming SCA-based tcad22revsca and hybrid RefSCATTCAD24 methods which solve only 24 cases each.",[6184,11085,5532,14803,5531,5534],[11087,11088,5537,14805,5536,5539],"https:\u002F\u002Fdoi.org\u002F10.1109\u002Ftcad.2025.3567883","W4410153258",[8992,23,4265,17658,17659,17222,31,332,34,3597],"Quantum","ANT",{"type":39,"children":17661,"toc":17666},[17662],{"type":42,"tag":43,"props":17663,"children":17664},{},[17665],{"type":47,"value":17652},{"title":8,"searchDepth":49,"depth":49,"links":17667},[],"content:publications:2025:refscat-2-0-formal-verification-of-large-scale-optimized-multipliers-via-quantum.md","publications\u002F2025\u002Frefscat-2-0-formal-verification-of-large-scale-optimized-multipliers-via-quantum.md","publications\u002F2025\u002Frefscat-2-0-formal-verification-of-large-scale-optimized-multipliers-via-quantum",{"_path":17672,"_dir":15532,"_draft":7,"_partial":7,"_locale":8,"title":17673,"description":17674,"_hidden":7,"Information Retrieval (NeuroPhysIIR 2025) at SIGIR CHIIR 2025 authors":17675,"authors_orcid":17698,"year":15548,"doi":17717,"openalex_id":17718,"venue":17719,"abstract_screenshot":21,"keywords":17720,"body":17723,"_type":51,"_id":17739,"_source":53,"_file":17740,"_stem":17741,"_extension":56,"locale":57},"\u002Fpublications\u002F2025\u002Freport-on-the-3rd-workshop-on-neurophysiological-approaches-for-interactive-info","Report on the 3rd Workshop on NeuroPhysiological Approaches for Interactive","The International Workshop on NeuroPhysiological Approaches for Interactive Information Retrieval (NeuroPhysIIR'25), co-located with ACM SIGIR CHIIR 2025 in Naarm\u002FMelbourne, Australia, included 19 participants who discussed 12 statements addressing open challenges in neurophysiological interactive IR. The report summarizes the statements presented and the discussions held at the full-day workshop. Date: 27 March 2025. Website: https:\u002F\u002Fneurophysiir.github.io\u002Fchiir2025\u002F.",[17676,17677,17678,17679,17680,17681,17682,17683,17684,17685,17686,17687,17688,17689,5667,17690,5407,17691,17692,17693,17694,17695,17696,11525,595,17697],"Spina, Damiano","Gwizdka, Jacek","Ji, Kaixin","Moshfeghi, Yashar","Mostafa, Javed","Ruotsalo, Tuukka","Zhang, Min","Ahmad, Adnan","Lawati, Sara Fahad Dawood Al","Boonprakong, Nattapat","Fernando, N.","He, J.","Hoeber, Orland","Jayawardena, Gavindya","Liu, Haiming","Pirmoradi, Abbas","Nakisa, Bahareh","Rastgoo, Mohammad Naim","Salim, Flora D.","Scott, F. H.","Sun, Shuoqi","Wilson, Max L.",[17699,17700,17701,17702,17703,17704,17705,17706,17707,17708,21,17709,17710,17711,5670,17712,5411,21,17713,17714,17715,21,21,15062,599,17716],"0000-0001-9913-433X","0000-0003-2273-3996","0000-0002-4679-4526","0000-0003-4186-1088","0000-0002-4628-7583","0000-0002-2203-4928","0000-0003-3158-1920","0000-0002-5179-3261","0009-0000-7513-014X","0000-0002-0735-4536","0000-0002-1465-0077","0000-0003-2875-1132","0000-0002-9523-3346","0000-0002-0390-3657","0000-0003-2211-2997","0000-0001-8283-3310","0000-0002-1237-1664","0000-0002-3515-6633","https:\u002F\u002Fdoi.org\u002F10.1145\u002F3769733.3769740","W4415051858","ACM SIGIR Forum",[17721,12835,12833,17722],"Neurophysiology","Cognitive models of information retrieval",{"type":39,"children":17724,"toc":17737},[17725],{"type":42,"tag":43,"props":17726,"children":17727},{},[17728,17730,17736],{"type":47,"value":17729},"The International Workshop on NeuroPhysiological Approaches for Interactive Information Retrieval (NeuroPhysIIR'25), co-located with ACM SIGIR CHIIR 2025 in Naarm\u002FMelbourne, Australia, included 19 participants who discussed 12 statements addressing open challenges in neurophysiological interactive IR. The report summarizes the statements presented and the discussions held at the full-day workshop. Date: 27 March 2025. Website: ",{"type":42,"tag":1574,"props":17731,"children":17734},{"href":17732,"rel":17733},"https:\u002F\u002Fneurophysiir.github.io\u002Fchiir2025\u002F",[4520],[17735],{"type":47,"value":17732},{"type":47,"value":1645},{"title":8,"searchDepth":49,"depth":49,"links":17738},[],"content:publications:2025:report-on-the-3rd-workshop-on-neurophysiological-approaches-for-interactive-info.md","publications\u002F2025\u002Freport-on-the-3rd-workshop-on-neurophysiological-approaches-for-interactive-info.md","publications\u002F2025\u002Freport-on-the-3rd-workshop-on-neurophysiological-approaches-for-interactive-info",{"_path":17743,"_dir":15532,"_draft":7,"_partial":7,"_locale":8,"title":17744,"description":17745,"_hidden":7,"authors":17746,"authors_orcid":17749,"year":15548,"doi":17751,"openalex_id":17752,"venue":14407,"abstract_screenshot":21,"keywords":17753,"body":17754,"_type":51,"_id":17762,"_source":53,"_file":17763,"_stem":17764,"_extension":56,"locale":57},"\u002Fpublications\u002F2025\u002Frequirements-based-test-generation-a-comprehensive-survey","Requirements-Based Test Generation: A Comprehensive Survey","As an important way of assuring software quality, software testing generates and executes test cases to identify software failures. Many strategies have been proposed to guide test-case generation, such as source-code-based approaches and methods based on bug reports. Requirements-based test generation (RBTG) constructs test cases based on specified requirements, aligning with user needs and expectations, without requiring access to the source code. Since its introduction in 1994, there have been many contributions to the development of RBTG, including various approaches, implementations, tools, assessment and evaluation methods, and applications. This paper provides a comprehensive survey on RBTG, categorizing requirements types, classifying approaches, investigating types of test cases, summarizing available tools, and analyzing experimental evaluations. This paper also summarizes the domains and industrial applications of RBTG, and discusses some open research challenges and potential future work.",[17747,645,6820,17748,595],"Zhenzhen, Yang","Niu, Nan",[21,650,6822,17750,599],"0000-0001-5566-2368","https:\u002F\u002Fdoi.org\u002F10.1145\u002F3771727","W4415106599",[659,139,606,662,138,3229,1164,658],{"type":39,"children":17755,"toc":17760},[17756],{"type":42,"tag":43,"props":17757,"children":17758},{},[17759],{"type":47,"value":17745},{"title":8,"searchDepth":49,"depth":49,"links":17761},[],"content:publications:2025:requirements-based-test-generation-a-comprehensive-survey.md","publications\u002F2025\u002Frequirements-based-test-generation-a-comprehensive-survey.md","publications\u002F2025\u002Frequirements-based-test-generation-a-comprehensive-survey",{"_path":17766,"_dir":15532,"_draft":7,"_partial":7,"_locale":8,"title":17767,"description":8,"_hidden":7,"inventory misplacement and deterioration authors":17768,"authors_orcid":17770,"year":15548,"doi":17772,"openalex_id":17773,"venue":74,"abstract_screenshot":21,"keywords":17774,"body":17777,"_type":51,"_id":17781,"_source":53,"_file":17782,"_stem":17783,"_extension":56,"locale":57},"\u002Fpublications\u002F2025\u002Frfid-technology-investment-and-ordering-pricing-decision-for-fresh-products-with","RFID technology investment and ordering-pricing decision for fresh products with",[17769,15278,7302],"Li, Guiping",[17771,15282,7310],"0009-0000-7003-2903","https:\u002F\u002Fdoi.org\u002F10.2139\u002Fssrn.5428242","W4413881180",[1438,178,17775,17776,6600,9342,23,36,287],"Decision model","Inventory investment",{"type":39,"children":17778,"toc":17779},[],{"title":8,"searchDepth":49,"depth":49,"links":17780},[],"content:publications:2025:rfid-technology-investment-and-ordering-pricing-decision-for-fresh-products-with.md","publications\u002F2025\u002Frfid-technology-investment-and-ordering-pricing-decision-for-fresh-products-with.md","publications\u002F2025\u002Frfid-technology-investment-and-ordering-pricing-decision-for-fresh-products-with",{"_path":17785,"_dir":15532,"_draft":7,"_partial":7,"_locale":8,"title":17786,"description":8,"_hidden":7,"comprehensive survey\" authors":17787,"authors_orcid":17791,"year":15548,"doi":17795,"openalex_id":17796,"venue":13029,"abstract_screenshot":21,"keywords":17797,"body":17799,"_type":51,"_id":17803,"_source":53,"_file":17804,"_stem":17805,"_extension":56,"locale":57},"\u002Fpublications\u002F2025\u002Fribonucleic-acid-protein-interaction-prediction-based-on-deep-learning-a-compreh","Ribonucleic-Acid protein interaction prediction based on deep learning: ",[17788,645,6820,595,12876,17789,17790],"Li, Danyu","Tian, Jinyu","Zou, Bin",[17792,650,6822,599,12879,17793,17794],"0009-0009-7455-400X","0000-0002-2449-5277","0000-0002-0064-7424","https:\u002F\u002Fdoi.org\u002F10.1016\u002Fj.asoc.2025.113795","W4413821077",[23,37,6976,215,17798,753,7905],"Protein–protein interaction",{"type":39,"children":17800,"toc":17801},[],{"title":8,"searchDepth":49,"depth":49,"links":17802},[],"content:publications:2025:ribonucleic-acid-protein-interaction-prediction-based-on-deep-learning-a-compreh.md","publications\u002F2025\u002Fribonucleic-acid-protein-interaction-prediction-based-on-deep-learning-a-compreh.md","publications\u002F2025\u002Fribonucleic-acid-protein-interaction-prediction-based-on-deep-learning-a-compreh",{"_path":17807,"_dir":15532,"_draft":7,"_partial":7,"_locale":8,"title":17808,"description":17809,"_hidden":7,"Behavior Prediction authors":17810,"authors_orcid":17815,"year":15548,"doi":17819,"openalex_id":17820,"venue":21,"abstract_screenshot":21,"keywords":17821,"body":17824,"_type":51,"_id":17832,"_source":53,"_file":17833,"_stem":17834,"_extension":56,"locale":57},"\u002Fpublications\u002F2025\u002Fsafety-driven-amr-end-to-end-navigation-framework-based-on-sparse-sensor-human-b","Safety-Driven AMR End-to-End Navigation Framework Based on Sparse Sensor Human","Autonomous Mobile Robots (AMRs) have garnered significant attention and widespread application due to their operational efficiency. However, in human-centered environments, such as warehouses, manufacturing facilities, and public spaces, AMRs face the dual challenge of navigating autonomously while perceiving and adapting to human movements to ensure safety. This work proposes a novel safety-driven end-to-end navigation framework for AMRs that processes navigation commands and sparse data collected by onboard 2D LiDAR and IMU sensors to directly control the robot's velocity. The framework comprises two key modules: a human estimation module and a trajectory generation module. The human estimation module employs an LSTM-based architecture to estimate human positions and movement trends from sparse sensor data, generating a dynamic obstacle map. Based on these predictions, a genetic algorithm -based trajectory generation module creates safe-driven dynamic trajectories subject to dynamic constraints. This approach enables accurate forecasting of pedestrian movements, allowing the AMR to effectively avoid dynamic human obstacles, thereby enhancing its safety and practicality in real-world environments. Our contributions are threefold: dynamic human detection and prediction from sparse onboard sensor data, safety-driven dynamic trajectory planning, and extensive real-world experiments demonstrating feasibility and robustness of the proposed framework.",[13702,17811,17812,17813,10191,17814,5532,709],"Yang, Kai","Xiao, Junlin","Tuo, Hu","Rushworth, Adam",[21,17816,21,17817,10196,17818,5537,711],"0000-0002-6540-7480","0000-0003-4485-6196","0000-0003-3803-7549","https:\u002F\u002Fdoi.org\u002F10.1109\u002Fcies64955.2025.11007636","W4410639798",[17822,23,17823,3203,37,34],"End-to-end principle","Dead end",{"type":39,"children":17825,"toc":17830},[17826],{"type":42,"tag":43,"props":17827,"children":17828},{},[17829],{"type":47,"value":17809},{"title":8,"searchDepth":49,"depth":49,"links":17831},[],"content:publications:2025:safety-driven-amr-end-to-end-navigation-framework-based-on-sparse-sensor-human-b.md","publications\u002F2025\u002Fsafety-driven-amr-end-to-end-navigation-framework-based-on-sparse-sensor-human-b.md","publications\u002F2025\u002Fsafety-driven-amr-end-to-end-navigation-framework-based-on-sparse-sensor-human-b",{"_path":17836,"_dir":15532,"_draft":7,"_partial":7,"_locale":8,"title":17837,"description":17838,"_hidden":7,"authors":17839,"authors_orcid":17841,"year":15548,"doi":17844,"openalex_id":17845,"venue":17636,"abstract_screenshot":21,"keywords":17846,"body":17847,"_type":51,"_id":17855,"_source":53,"_file":17856,"_stem":17857,"_extension":56,"locale":57},"\u002Fpublications\u002F2025\u002Fsiamnas-siamese-surrogate-model-for-dominance-relation-prediction-in-multi-objec","SiamNAS: Siamese Surrogate Model for Dominance Relation Prediction in Multi-objective Neural Architecture Search","Modern neural architecture search (NAS) is inherently multi-objective balancing trade-offs such as accuracy, parameter count, and computational cost. This complexity makes NAS computationally expensive and nearly impossible to solve without efficient approximations. To address this, we propose a novel surrogate modelling approach that leverages an ensemble of Siamese network blocks to predict dominance relationships between candidate architectures. Lightweight and easy to train, the surrogate achieves 92% accuracy and replaces the crowding distance calculation in the survivor selection strategy with a heuristic rule based on model size. Integrated into a framework termed SiamNAS, this design eliminates costly evaluations during the search process. Experiments on NAS-Bench-201 demonstrate the framework's ability to identify Pareto-optimal solutions with significantly reduced computational costs. The proposed SiamNAS identified a final non-dominated set containing the best architecture in NAS-Bench-201 for CIFAR-10 and the second-best for ImageNet, in terms of test error rate, within 0.01 GPU days. This proof-of-concept study highlights the potential of the proposed Siamese network surrogate model to generalise to multi-tasking optimisation, enabling simultaneous optimisation across tasks. Additionally, it offers opportunities to extend the approach for generating Sets of Pareto Sets (SOS), providing diverse Pareto-optimal solutions for heterogeneous task settings.",[13252,13253,17840,12],"Ong, Yew-Soon",[17842,13256,17843,15],"0009-0003-6726-0843","0000-0002-4480-169X","https:\u002F\u002Fdoi.org\u002F10.1145\u002F3712256.3726359","W4412106342",[8995,4965,23,37,6300,632,215,4876,181,4608,289],{"type":39,"children":17848,"toc":17853},[17849],{"type":42,"tag":43,"props":17850,"children":17851},{},[17852],{"type":47,"value":17838},{"title":8,"searchDepth":49,"depth":49,"links":17854},[],"content:publications:2025:siamnas-siamese-surrogate-model-for-dominance-relation-prediction-in-multi-objec.md","publications\u002F2025\u002Fsiamnas-siamese-surrogate-model-for-dominance-relation-prediction-in-multi-objec.md","publications\u002F2025\u002Fsiamnas-siamese-surrogate-model-for-dominance-relation-prediction-in-multi-objec",{"_path":17859,"_dir":15532,"_draft":7,"_partial":7,"_locale":8,"title":17860,"description":17861,"_hidden":7,"Leakage Detection in Digital Healthcare Systems\" authors":17862,"authors_orcid":17866,"year":15548,"doi":17869,"openalex_id":17870,"venue":15797,"abstract_screenshot":21,"keywords":17871,"body":17874,"_type":51,"_id":17882,"_source":53,"_file":17883,"_stem":17884,"_extension":56,"locale":57},"\u002Fpublications\u002F2025\u002Fsibw-a-swarm-intelligence-based-network-flow-watermarking-approach-for-privacy-l","SIBW: A Swarm Intelligence-Based Network Flow Watermarking Approach for Privac","The exponential growth of sensitive patient information and diagnostic records in digital healthcare systems has increased the complexity of data protection, while frequent medical data breaches severely compromise system security and reliability. Existing privacy protection techniques often lack robustness and real-time capabilities in high-noise, high-packet-loss, and dynamic network environments, limiting their effectiveness in detecting healthcare data leaks. To address these challenges, we propose a Swarm Intelligence-Based Network Watermarking (SIBW) method for real-time privacy data leakage detection in digital healthcare systems. SIBW integrates fountain codes with outer error correction codes and employs a Multi-Phase Synergistic Swarm Optimization Algorithm (MPSSOA) to dynamically optimize encoding parameters, significantly enhancing the robustness and interference resistance of watermark detection. Additionally, a reliable synchronization sequence and lightweight embedding mechanism are designed to ensure adaptability to complex, dynamic networks. Experimental results demonstrate that SIBW achieves over 90% detection accuracy under high latency jitter and packet loss conditions, surpassing existing methods in both robustness and efficiency. With a compact design of only 3.7 MB, SIBW is particularly suited for rapid deployment in resource-constrained digital healthcare systems.",[15785,17863,17864,16136,17865,13218,16140,15787],"Guo, Qiang","Shi, Fengdong","Zhu, Haohao",[15792,21,17867,16142,17868,13226,16145,15794],"0000-0003-4352-822X","0000-0003-2352-4854","https:\u002F\u002Fdoi.org\u002F10.1109\u002Fjbhi.2025.3542561","W4407566320",[17872,23,5896,17873,180,3493,37,181],"Digital watermarking","Leakage (economics)",{"type":39,"children":17875,"toc":17880},[17876],{"type":42,"tag":43,"props":17877,"children":17878},{},[17879],{"type":47,"value":17861},{"title":8,"searchDepth":49,"depth":49,"links":17881},[],"content:publications:2025:sibw-a-swarm-intelligence-based-network-flow-watermarking-approach-for-privacy-l.md","publications\u002F2025\u002Fsibw-a-swarm-intelligence-based-network-flow-watermarking-approach-for-privacy-l.md","publications\u002F2025\u002Fsibw-a-swarm-intelligence-based-network-flow-watermarking-approach-for-privacy-l",{"_path":17886,"_dir":15532,"_draft":7,"_partial":7,"_locale":8,"title":17887,"description":17888,"_hidden":7,"motivation for performing exercises for the prevention of venous thromboembolism through loss and avoidance gamification\" authors":17889,"authors_orcid":17890,"year":15548,"doi":17891,"openalex_id":17892,"venue":17893,"abstract_screenshot":17894,"keywords":17895,"body":17896,"_type":51,"_id":17904,"_source":53,"_file":17905,"_stem":17906,"_extension":56,"locale":57},"\u002Fpublications\u002F2025\u002Fsproutfit-an-immersive-seed-planting-virtual-reality-game-to-enhance-patient-mot","Sproutfit: an immersive seed-planting virtual reality game to enhance patien","Sustaining patient engagement in physical rehabilitation for conditions of venous thromboembolism (VTE) prevention is often challenging due to factors such as the repetitive nature of the rehabilitation exercises, and possible insufficient patient motivation. This study investigated the integration of immersive virtual reality (IVR) and gamification to address this challenge. This study explored whether or not integrating the loss and avoidance (LA) gamification dynamic into an IVR rehabilitation game can improve short-term motivation to perform VTE-prevention exercises among middle-aged and older hospital patients. A mixed-design experiment was carried out that involved 28 patients admitted for post-surgical rehabilitation. A smart wearable sensor-based IVR game (SPROUTFIT) was developed, featuring a theme of seed-planting in five stages, where patients perform lower limb exercises to simulate gardening activities. The game employs a level system (“Novice Planter”, “Adept Planter” and, “Master Planter”) to reward performance, with the “loss” component creating a fear of not retaining levels, and the “avoidance” component requiring patients to repeat stages if performance criteria are not met. The patients in the LA-integrated SPROUTFIT (LA-SPROUTFIT) showed significantly higher external regulation compared to the non-LA-integrated SPROUTFIT (NLA-SPROUTFIT) group. LA-SPROUTFIT group also demonstrated significantly higher scores regarding the game experience of competence, flow, and challenge. Game scores were significantly higher in LA-SPROUTFIT group for game stages 2, 4, and 5. Physiological measures indicated that LA-SPROUTFIT resulted in significantly higher heart rate, calorie expenditure, and perceived exertion. Qualitative feedback from interviews revealed that patients generally perceived SPROUTFIT as enjoyable and motivating. However, some patients suggested including various difficulty levels and additional personalization options in future iterations.",[13424,5667,5407,595,9416,11550,5665],[13752,5670,5411,599,13753,11552,5669],"https:\u002F\u002Fdoi.org\u002F10.1007\u002Fs10055-025-01220-2","W4413636636","Virtual Reality","sproutfit-an-immersive-seed-planting-virtual-reality-game-to-enhance-patient-mot.png",[23,4390,13642,867,868,984],{"type":39,"children":17897,"toc":17902},[17898],{"type":42,"tag":43,"props":17899,"children":17900},{},[17901],{"type":47,"value":17888},{"title":8,"searchDepth":49,"depth":49,"links":17903},[],"content:publications:2025:sproutfit-an-immersive-seed-planting-virtual-reality-game-to-enhance-patient-mot.md","publications\u002F2025\u002Fsproutfit-an-immersive-seed-planting-virtual-reality-game-to-enhance-patient-mot.md","publications\u002F2025\u002Fsproutfit-an-immersive-seed-planting-virtual-reality-game-to-enhance-patient-mot",{"_path":17908,"_dir":15532,"_draft":7,"_partial":7,"_locale":8,"title":17909,"description":8,"_hidden":7,"authors":17910,"authors_orcid":17913,"year":15548,"doi":17915,"openalex_id":17916,"venue":74,"abstract_screenshot":21,"keywords":17917,"body":17919,"_type":51,"_id":17923,"_source":53,"_file":17924,"_stem":17925,"_extension":56,"locale":57},"\u002Fpublications\u002F2025\u002Ftdcgait-a-temporal-doppler-concept-tri-branch-framework-for-radar-gait-recogniti","TDCGait: A Temporal-Doppler-Concept Tri-branch Framework for Radar Gait Recognition",[17911,7409,6111,12,17912,9048],"He, Zhongkun","Guo, Lijun",[21,7415,21,15,21,17914],"0000-0003-0799-862X","https:\u002F\u002Fdoi.org\u002F10.2139\u002Fssrn.5436568","W4413949519",[9690,14220,23,14714,17918,37,289,4391,9693,288,380,3597],"Doppler radar",{"type":39,"children":17920,"toc":17921},[],{"title":8,"searchDepth":49,"depth":49,"links":17922},[],"content:publications:2025:tdcgait-a-temporal-doppler-concept-tri-branch-framework-for-radar-gait-recogniti.md","publications\u002F2025\u002Ftdcgait-a-temporal-doppler-concept-tri-branch-framework-for-radar-gait-recogniti.md","publications\u002F2025\u002Ftdcgait-a-temporal-doppler-concept-tri-branch-framework-for-radar-gait-recogniti",{"_path":17927,"_dir":15532,"_draft":7,"_partial":7,"_locale":8,"title":17928,"description":8,"_hidden":7,"authors":17929,"authors_orcid":17932,"year":15548,"doi":17935,"openalex_id":17936,"venue":74,"abstract_screenshot":21,"keywords":17937,"body":17939,"_type":51,"_id":17943,"_source":53,"_file":17944,"_stem":17945,"_extension":56,"locale":57},"\u002Fpublications\u002F2025\u002Ftechnological-substitution-complementarity-and-mergers-and-acquisitions","Technological Substitution, Complementarity, and Mergers and Acquisitions",[17930,268,17931],"Bi, J.","Huang, Jingong",[17933,272,17934],"0009-0001-9216-9932","0000-0001-6670-8093","https:\u002F\u002Fdoi.org\u002F10.2139\u002Fssrn.5228321","W4409713756",[17096,17938,1355,178,36,6600,23,429],"Substitution (logic)",{"type":39,"children":17940,"toc":17941},[],{"title":8,"searchDepth":49,"depth":49,"links":17942},[],"content:publications:2025:technological-substitution-complementarity-and-mergers-and-acquisitions.md","publications\u002F2025\u002Ftechnological-substitution-complementarity-and-mergers-and-acquisitions.md","publications\u002F2025\u002Ftechnological-substitution-complementarity-and-mergers-and-acquisitions",{"_path":17947,"_dir":15532,"_draft":7,"_partial":7,"_locale":8,"title":17948,"description":8,"_hidden":7,"Evaluators\" authors":17949,"authors_orcid":17950,"year":15548,"doi":17951,"openalex_id":17952,"venue":21,"abstract_screenshot":21,"keywords":17953,"body":17957,"_type":51,"_id":17961,"_source":53,"_file":17962,"_stem":17963,"_extension":56,"locale":57},"\u002Fpublications\u002F2025\u002Ftemples-teacher-evaluation-using-metamorphic-mediated-personality-aware-llm-eval","TEMPLEs: Teacher Evaluation using Metamorphic-mediated Personality-aware LL",[595,4189,5407],[599,4191,5411],"https:\u002F\u002Fdoi.org\u002F10.1109\u002Ftale66047.2025.11346704","W7125614317",[17954,17955,747,17956],"Data collection","Program evaluation","Research methodology",{"type":39,"children":17958,"toc":17959},[],{"title":8,"searchDepth":49,"depth":49,"links":17960},[],"content:publications:2025:temples-teacher-evaluation-using-metamorphic-mediated-personality-aware-llm-eval.md","publications\u002F2025\u002Ftemples-teacher-evaluation-using-metamorphic-mediated-personality-aware-llm-eval.md","publications\u002F2025\u002Ftemples-teacher-evaluation-using-metamorphic-mediated-personality-aware-llm-eval",{"_path":17965,"_dir":15532,"_draft":7,"_partial":7,"_locale":8,"title":17966,"description":17967,"_hidden":7,"authors":17968,"authors_orcid":17969,"year":15548,"doi":17972,"openalex_id":17973,"venue":5147,"abstract_screenshot":21,"keywords":17974,"body":17975,"_type":51,"_id":17983,"_source":53,"_file":17984,"_stem":17985,"_extension":56,"locale":57},"\u002Fpublications\u002F2025\u002Fthe-impacts-of-u-s-section-337-investigations-on-chinese-technology-firms","The impacts of U.S. Section 337 investigations on Chinese technology firms","This paper examines the valuation impact of investigations related to the alleged infringement of American intellectual property (IP) rights, specifically Section 337 investigations, on Chinese technology firms. Evidence suggests that the stock market responds negatively to announcements of Section 337 investigations in the short term; however, the long-term price impact varies significantly across firms. When focal firms actively formulate strategic adaptations, such as increasing R&D investments, diversifying international sales, and seeking government support, they enhance their dynamic capabilities, thereby fostering long-term value creation. Moreover, further analysis shows that state-owned enterprises (SOEs) underperform private firms in strategic adaptation and value creation, while firms without venture capital (VC) backing are also worse positioned than VC-backed firms. • The stock market responds negatively to Section 337 investigations in the short term. • The long-term price impact varies significantly across firms. • Firms enhance dynamic capabilities and create value by strategic adaptations. • State-owned enterprises (SOEs) underperform private firms in value creation. • Firms without venture capital (VC) backing are worse positioned than VC-backed firms.",[11699,268,8015,11700,13304],[11702,272,17970,17971,13306],"0000-0003-1267-3643","0000-0003-2507-8333","https:\u002F\u002Fdoi.org\u002F10.1016\u002Fj.respol.2025.105210","W4408177362",[11066,178,751,3960,3958,36,4678,289],{"type":39,"children":17976,"toc":17981},[17977],{"type":42,"tag":43,"props":17978,"children":17979},{},[17980],{"type":47,"value":17967},{"title":8,"searchDepth":49,"depth":49,"links":17982},[],"content:publications:2025:the-impacts-of-u-s-section-337-investigations-on-chinese-technology-firms.md","publications\u002F2025\u002Fthe-impacts-of-u-s-section-337-investigations-on-chinese-technology-firms.md","publications\u002F2025\u002Fthe-impacts-of-u-s-section-337-investigations-on-chinese-technology-firms",{"_path":17987,"_dir":15532,"_draft":7,"_partial":7,"_locale":8,"title":17988,"description":17989,"_hidden":7,"disruptions under crises":17990,"authors":17991,"authors_orcid":17992,"year":15548,"doi":17994,"openalex_id":17995,"venue":17996,"abstract_screenshot":21,"keywords":17997,"body":17998,"_type":51,"_id":18006,"_source":53,"_file":18007,"_stem":18008,"_extension":56,"locale":57},"\u002Fpublications\u002F2025\u002Fthe-mitigating-effects-of-blockchain-adoption-on-supply-chain-financing-disrupti","The mitigating effects of blockchain adoption on supply chain financin","The paper investigates the negative effect of the COVID-19 crisis on supply chain financing in China. It examines the role of blockchain adoption in mitigating such disruptions by using data from Chinese firms between 2015 and 2022 and employs textual analysis to construct indexes on firms' blockchain innovation and supply chain risk exposure. We find that firms with high supply chain risk experience a more significant reduction in formal and informal financing during the COVID-19 pandemic. Nevertheless, blockchain adoption helps provide more resilience to supply chain financing disruptions in the crisis by enhancing information transparency, corporate governance, and production network efficiency. Further analysis shows that the alleviation effect is heterogeneous and more pronounced for firms with private ownership and lower social trust. The main results remain consistent using alternative measures based on Generative Pre-trained Transformer (GPT), a large language model. Our paper highlights the importance of digital technology advancement in protecting supply chain security under crises. • Firms with high supply chain risk experience a reduction in financing during crises. • Blockchain adoption helps provide more resilience by enhancing information transparency, corporate governance, and production network efficiency. • The alleviation effect is more pronounced for firms with private ownership and lower social trust. • It is important to promote digital technology advancement in protecting supply chain security under crises.","Evidence from China\"",[13277,11036,268,11700],[13279,21,21,17993],"0000-0003-4666-2053","https:\u002F\u002Fdoi.org\u002F10.1016\u002Fj.chieco.2025.102502","W4412444598","China Economic Review",[5381,282,3568,178,180,751],{"type":39,"children":17999,"toc":18004},[18000],{"type":42,"tag":43,"props":18001,"children":18002},{},[18003],{"type":47,"value":17989},{"title":8,"searchDepth":49,"depth":49,"links":18005},[],"content:publications:2025:the-mitigating-effects-of-blockchain-adoption-on-supply-chain-financing-disrupti.md","publications\u002F2025\u002Fthe-mitigating-effects-of-blockchain-adoption-on-supply-chain-financing-disrupti.md","publications\u002F2025\u002Fthe-mitigating-effects-of-blockchain-adoption-on-supply-chain-financing-disrupti",{"_path":18010,"_dir":15532,"_draft":7,"_partial":7,"_locale":8,"title":18011,"description":18012,"_hidden":7,"in Sino-U":18013,"Studies, 2024":18017,"authors_orcid":18023,"year":15548,"doi":18024,"openalex_id":18025,"venue":18026,"abstract_screenshot":21,"keywords":18027,"body":18030,"_type":51,"_id":18038,"_source":53,"_file":18039,"_stem":18040,"_extension":56,"locale":57},"\u002Fpublications\u002F2025\u002Fthe-war-for-chinese-talent-in-america-the-politics-of-technology-and-knowledge-i","The War for Chinese Talent in America: The Politics of Technology and Knowledg","The War for Chinese Talent in America: The Politics of Technology and Knowledge in Sino-U.S. Relations David Zweig. Ann Arbor, MI: Association for Asian Studies, 2024. xxiv + 222 pp. $26.00; £22.00 (pbk). ISBN 9781952636493 - Volume 261",{"S":18014},{" Relations David Zweig":18015},{" Ann Arbor, MI":18016},"Association for Asian",{" xxiv + 222 pp":18018},{" $26":18019},{"00; £22":18020},{"00 (pbk)":18021},{" ISBN 9781952636493\" authors":18022},[65],[70],"https:\u002F\u002Fdoi.org\u002F10.1017\u002Fs0305741024001607","W4407109812","The China Quarterly",[1358,5153,18028,18029,3749,5949,3259,6928],"Association (psychology)","Economic history",{"type":39,"children":18031,"toc":18036},[18032],{"type":42,"tag":43,"props":18033,"children":18034},{},[18035],{"type":47,"value":18012},{"title":8,"searchDepth":49,"depth":49,"links":18037},[],"content:publications:2025:the-war-for-chinese-talent-in-america-the-politics-of-technology-and-knowledge-i.md","publications\u002F2025\u002Fthe-war-for-chinese-talent-in-america-the-politics-of-technology-and-knowledge-i.md","publications\u002F2025\u002Fthe-war-for-chinese-talent-in-america-the-politics-of-technology-and-knowledge-i",{"_path":18042,"_dir":15532,"_draft":7,"_partial":7,"_locale":8,"title":18043,"description":18044,"_hidden":7,"Communication Networks (WPAJCN) authors":18045,"authors_orcid":18050,"year":15548,"doi":18055,"openalex_id":18056,"venue":11939,"abstract_screenshot":21,"keywords":18057,"body":18059,"_type":51,"_id":18073,"_source":53,"_file":18074,"_stem":18075,"_extension":56,"locale":57},"\u002Fpublications\u002F2025\u002Fthroughput-improvement-for-ris-empowered-wireless-powered-anti-jamming-communica","Throughput Improvement for RIS-Empowered Wireless Powered Anti-Jamming","In this paper, we propose a reconfigurable intelligent surface (RIS)-aided wireless powered anti-jamming communication network (WPAJCN), where the RIS is utilized to participate in downlink wireless power transfer (WPT), as well as uplink anti-jamming wireless information transfer (AJ-WIT). To evaluate the network anti-jamming performance, we maximize a sum anti-jamming throughput, with the constraints of downlink WPT and uplink AJ-WIT time scheduling, and unit-modulus RIS phase shifts. The formulated problem is not convex in terms of these two types of coupled variables, which cannot be directly solved. To address this problem, the Lagrange dual method and Karush-Kuhn-Tucker conditions are presented to transform its sum-of-logarithmic objective function into the logarithmically fractional counterpart, which reformulate the original problem into that with respect to RIS phase shift vectors and WPT time scheduling. Next, we propose to apply the Dinkelback algorithm to solve a non-linear fractional programming with respect to the downlink WPT and uplink AJ-WIT RIS phase shifts in an alternating fashion, each of which is derived into a semi-closed solution by utilizing the Riemannian Manifold Optimization (RMO). In addition, the optimal WPT time scheduling is obtained by numerical search. Finally, the numerical results are demonstrated to confirm the improved performance of the proposed approach compared to the benchmark counterparts, which highlights the that RIS can effectively enhance the uplink anti-jamming WIT capability as well as the downlink WPT efficiency.",[18046,12122,4824,7302,18047,18048,18049],"Chu, Zheng","Zhu, Zhengyu","Huang, Chongwen","Yuen, Chau",[18051,12125,21,7310,18052,18053,18054],"0000-0001-9715-3190","0000-0001-6562-8243","0000-0001-8398-8437","0000-0002-9307-2120","https:\u002F\u002Fdoi.org\u002F10.1109\u002Ftifs.2025.3563818","W4409723953",[23,5547,251,5998,18058,288],"Jamming",{"type":39,"children":18060,"toc":18071},[18061],{"type":42,"tag":43,"props":18062,"children":18063},{},[18064,18066],{"type":47,"value":18065},"In this paper, we propose a reconfigurable intelligent surface (RIS)-aided wireless powered anti-jamming communication network (WPAJCN), where the RIS is utilized to participate in downlink wireless power transfer (WPT), as well as uplink anti-jamming wireless information transfer (AJ-WIT). To evaluate the network anti-jamming performance, we maximize a sum anti-jamming throughput, with the constraints of downlink WPT and uplink AJ-WIT time scheduling, and unit-modulus RIS phase shifts. The formulated problem is not convex in terms of these two types of coupled variables, which cannot be directly solved. To address this problem, the Lagrange dual method and Karush-Kuhn-Tucker conditions are presented to transform its sum-of-logarithmic objective function into the logarithmically fractional counterpart, which reformulate the original problem into that with respect to RIS phase shift vectors and WPT time scheduling. Next, we propose to apply the Dinkelback algorithm to solve a non-linear fractional programming with respect to the downlink WPT and uplink AJ-WIT RIS phase shifts in an alternating fashion, each of which is derived into a semi-closed solution by utilizing the ",{"type":42,"tag":9671,"props":18067,"children":18068},{"xmlns:mml":1465,"xmlnsXLink":8791},[18069],{"type":47,"value":18070},"Riemannian Manifold Optimization (RMO). In addition, the optimal WPT time scheduling is obtained by numerical search. Finally, the numerical results are demonstrated to confirm the improved performance of the proposed approach compared to the benchmark counterparts, which highlights the that RIS can effectively enhance the uplink anti-jamming WIT capability as well as the downlink WPT efficiency.",{"title":8,"searchDepth":49,"depth":49,"links":18072},[],"content:publications:2025:throughput-improvement-for-ris-empowered-wireless-powered-anti-jamming-communica.md","publications\u002F2025\u002Fthroughput-improvement-for-ris-empowered-wireless-powered-anti-jamming-communica.md","publications\u002F2025\u002Fthroughput-improvement-for-ris-empowered-wireless-powered-anti-jamming-communica",{"_path":18077,"_dir":15532,"_draft":7,"_partial":7,"_locale":8,"title":18078,"description":18079,"_hidden":7,"IoMT-based cancer diagnosis\" authors":18080,"authors_orcid":18086,"year":15548,"doi":18092,"openalex_id":18093,"venue":14241,"abstract_screenshot":21,"keywords":18094,"body":18095,"_type":51,"_id":18103,"_source":53,"_file":18104,"_stem":18105,"_extension":56,"locale":57},"\u002Fpublications\u002F2025\u002Ftinyvit-lightgbm-a-lightweight-and-smart-feature-fusion-framework-for-iomt-based","TinyVit-LightGBM: A lightweight and smart feature fusion framework fo","Cancer remains a leading global health issue, where accurate and timely diagnosis is critical for effective treatment. The Internet of Medical Things (IoMT), an interconnected network of medical devices, offers real-time multimodal and multi-source data acquisition and analysis, facilitating remote monitoring and improving diagnostic precision. However, IoMT-based diagnostic frameworks face major challenges, including limited computational resources of IoMT devices, difficulties in integrating multimodal data from diverse sources, and the necessity for interpretable models to enhance clinical trust. To address these issues, we propose TinyViT-LightGBM, a lightweight and smart multimodal data fusion framework optimized for breast cancer diagnostics in resource-constrained IoMT environments. TinyViT, an efficient Vision Transformer, extracts features from multi-source histopathology images, combined with mammograms and clinical-genetic data through a comprehensive fusion strategy. By using LightGBM for classification, the framework not only achieves high diagnostic accuracy but also enhances interpretability by identifying the most critical diagnostic features. The proposed framework achieves state-of-the-art diagnostic performance, with 97.8% accuracy, a 6.5% improvement over existing methods, alongside gains in precision (97.2%), recall (99.1%), and F1-score (98.1%). Additionally, its low false positive rate (0.0058) and computational efficiency on IoMT devices underscore its scalability and suitability for real-world healthcare applications. • TinyViT-LightGBM is a novel multimodal data fusion framework for IoMT-based breast cancer diagnostics. • The model addresses the issues of computational constraints, multi source data, and data interpretability. • The LightGBM classify the vital feature for accurate decision-making. • The model achieves better diagnostic results with 97.8% accuracy, 97.2% precision, 99.1% recall, and 98.1% F1-score.",[18081,18082,18083,18084,16897,13218,16301,18085],"Wang, Hongwei","Dai, Xu","Ning, Shipeng","Ye, Jinjun","You, Pan",[18087,18088,21,18089,18090,13226,16306,18091],"0000-0003-3380-6935","0009-0009-4702-0635","0000-0002-9529-7016","0000-0002-8703-8903","0000-0003-4110-831X","https:\u002F\u002Fdoi.org\u002F10.1016\u002Fj.inffus.2025.103180","W4409450173",[23,6875,37,4876,181],{"type":39,"children":18096,"toc":18101},[18097],{"type":42,"tag":43,"props":18098,"children":18099},{},[18100],{"type":47,"value":18079},{"title":8,"searchDepth":49,"depth":49,"links":18102},[],"content:publications:2025:tinyvit-lightgbm-a-lightweight-and-smart-feature-fusion-framework-for-iomt-based.md","publications\u002F2025\u002Ftinyvit-lightgbm-a-lightweight-and-smart-feature-fusion-framework-for-iomt-based.md","publications\u002F2025\u002Ftinyvit-lightgbm-a-lightweight-and-smart-feature-fusion-framework-for-iomt-based",{"_path":18107,"_dir":15532,"_draft":7,"_partial":7,"_locale":8,"title":18108,"description":18109,"_hidden":7,"approach based on intelligence augmentation\" authors":18110,"authors_orcid":18117,"year":15548,"doi":18120,"openalex_id":18121,"venue":18122,"abstract_screenshot":21,"keywords":18123,"body":18128,"_type":51,"_id":18136,"_source":53,"_file":18137,"_stem":18138,"_extension":56,"locale":57},"\u002Fpublications\u002F2025\u002Ftowards-empathic-medical-conversation-in-narrative-medicine-a-visualization-appr","Towards empathic medical conversation in Narrative Medicine: A visualizatio","• Intelligence augmentation tool enhances the quality of empathic medical conversation. • EOPD enables empathic opportunity recognition, tailors personalized communication. • Multi-modal emotion data helps physicians understand patients’ emotion and intention. • Empathic opportunity reminding facilitate physicians to express warmth and concern. • Physician-AI collaboration ensures physician's autonomy and mitigate algorithm biases. Empathic medical conversation is central to patient-centered care within Narrative Medicine. However, difficulties, such as physicians’ limited empathic capabilities and lack of time, impede the practice. Research on real-time, on-site empathic medical exchanges has been limited in exploring technology to assist and enhance physicians’ capabilities. This paper proposed the Empathic Opportunity Perception and Distinction (EOPD) framework for building physician-AI collaboration based on Intelligence Augmentation (IA) for empathic conversations. The EOPD integrates two multi-modal machine learning (ML) models based on facial and verbal cues, presenting a physician-AI interaction framework and three distinctive visualization components: emotional reference, opportunity reminding and keyword collection, and situation understanding. To assess EOPD's effectiveness and gauge physicians’ and patients’ receptiveness, a prototype system named EMVIS ( EM otional VIS ualization ) was designed and developed. Results from the study demonstrated improvements in physicians’ empathy efforts and perceived empathy performance when using EMVIS, particularly for junior physicians. Physicians and patients held positive attitudes towards EMVIS, with patients expressing a high expectation that EMVIS would improve the physician-patient relationship. The research showed the efficacy of the multi-modal ML models in supporting complex affective empathy and EMVIS in facilitating and complementing empathy concerns. It highlighted the tailored support to junior and senior physicians and emphasized physician-AI collaboration to maintain user autonomy and mitigate potential biases. Future research should explore extensive system applications, tailor visual and interactive support for physicians, and implement adaptive and reflective ML models to improve the effectiveness and efficiency of empathy communications.",[18111,18112,3461,18113,8931,18114,13444,11037,18115,18116],"Ma, Hua","Law, Effie Lai‐Chong","Yang, Weili","Lawson, Glyn","Li, Qiang","Yuan, Xiaoru",[21,18118,3464,21,8937,18119,21,11039,21,21],"0000-0002-0873-0150","0000-0002-8906-4873","https:\u002F\u002Fdoi.org\u002F10.1016\u002Fj.ijhcs.2025.103506","W4408919807","International Journal of Human-Computer Studies",[18124,18125,9028,18126,865,13937,23,5926,37,870,13058,18127],"Conversation","Narrative","Empathy","Literature",{"type":39,"children":18129,"toc":18134},[18130],{"type":42,"tag":43,"props":18131,"children":18132},{},[18133],{"type":47,"value":18109},{"title":8,"searchDepth":49,"depth":49,"links":18135},[],"content:publications:2025:towards-empathic-medical-conversation-in-narrative-medicine-a-visualization-appr.md","publications\u002F2025\u002Ftowards-empathic-medical-conversation-in-narrative-medicine-a-visualization-appr.md","publications\u002F2025\u002Ftowards-empathic-medical-conversation-in-narrative-medicine-a-visualization-appr",{"_path":18140,"_dir":15532,"_draft":7,"_partial":7,"_locale":8,"title":18141,"description":8,"_hidden":7,"event sequences\" authors":18142,"authors_orcid":18144,"year":15548,"doi":18145,"openalex_id":18146,"venue":7552,"abstract_screenshot":21,"keywords":18147,"body":18148,"_type":51,"_id":18152,"_source":53,"_file":18153,"_stem":18154,"_extension":56,"locale":57},"\u002Fpublications\u002F2025\u002Ftraloganomaly-a-microservice-system-anomaly-detection-approach-based-on-hybrid-e","TraLogAnomaly: A microservice system anomaly detection approach based on hybri",[14281,1205,18143,3163,595],"Yang, Pengpeng",[21,1210,21,3167,599],"https:\u002F\u002Fdoi.org\u002F10.1016\u002Fj.scico.2025.103303","W4408890738",[23,14295,4921,14296,181],{"type":39,"children":18149,"toc":18150},[],{"title":8,"searchDepth":49,"depth":49,"links":18151},[],"content:publications:2025:traloganomaly-a-microservice-system-anomaly-detection-approach-based-on-hybrid-e.md","publications\u002F2025\u002Ftraloganomaly-a-microservice-system-anomaly-detection-approach-based-on-hybrid-e.md","publications\u002F2025\u002Ftraloganomaly-a-microservice-system-anomaly-detection-approach-based-on-hybrid-e",{"_path":18156,"_dir":15532,"_draft":7,"_partial":7,"_locale":8,"title":18157,"description":18158,"_hidden":7,"for Post-Loan Default Detection\" authors":18159,"authors_orcid":18163,"year":15548,"doi":18166,"openalex_id":18167,"venue":17328,"abstract_screenshot":21,"keywords":18168,"body":18171,"_type":51,"_id":18179,"_source":53,"_file":18180,"_stem":18181,"_extension":56,"locale":57},"\u002Fpublications\u002F2025\u002Ftransforming-credit-risk-analysis-a-time-series-driven-rese-bilstm-framework-for","Transforming Credit Risk Analysis: A Time-Series-Driven ResE-BiLSTM Framewor","Credit risk refers to the possibility that a borrower fails to meet contractual repayment obligations, posing potential losses to lenders. This study aims to enhance post-loan default prediction in credit risk management by constructing a time-series modeling framework based on repayment behavior data, enabling the capture of repayment risks that emerge after loan issuance. To achieve this objective, a Residual Enhanced Encoder Bidirectional Long Short-Term Memory (ResE-BiLSTM) model is proposed, in which the attention mechanism is responsible for discovering long-range correlations, while the residual connections ensure the preservation of distant information. This design mitigates the tendency of conventional recurrent architectures to overemphasize recent inputs while underrepresenting distant temporal information in long-term dependency modeling. Using the real-world large-scale Freddie Mac Single-Family Loan-Level Dataset, the model is evaluated on 44 independent cohorts and compared with five baseline models, including Long Short-Term Memory (LSTM), Bidirectional LSTM (BiLSTM), Gated Recurrent Unit (GRU), Convolutional Neural Network (CNN), and Recurrent Neural Network (RNN) across multiple evaluation metrics. The experimental results demonstrate that ResE-BiLSTM achieves superior performance on key indicators such as F1 and AUC, with average values of 0.92 and 0.97, respectively, and demonstrates robust performance across different feature window lengths and resampling settings. Ablation experiments and SHapley Additive exPlanations (SHAP)-based interpretability analyses further reveal that the model captures non-monotonic temporal importance patterns across key financial features. This study advances time-series–based anomaly detection for credit risk prediction by integrating global and local temporal learning. The findings offer practical value for financial institutions and risk management practitioners, while also providing methodological insights and a transferable modeling paradigm for future research on credit risk assessment.",[11578,18160,16775,18161,13501,15567,4189,18162],"Lin, Yuxiang","Su, Zihan","Lee, B. C.",[21,21,18164,21,21,18165,4191,21],"0009-0000-2900-9197","0009-0007-5882-1265","https:\u002F\u002Fdoi.org\u002F10.3390\u002Finfo17010005","W7116984300",[7207,7255,10344,18169,18170,10865,14295,6319,6687,3390],"Risk management","Autoencoder",{"type":39,"children":18172,"toc":18177},[18173],{"type":42,"tag":43,"props":18174,"children":18175},{},[18176],{"type":47,"value":18158},{"title":8,"searchDepth":49,"depth":49,"links":18178},[],"content:publications:2025:transforming-credit-risk-analysis-a-time-series-driven-rese-bilstm-framework-for.md","publications\u002F2025\u002Ftransforming-credit-risk-analysis-a-time-series-driven-rese-bilstm-framework-for.md","publications\u002F2025\u002Ftransforming-credit-risk-analysis-a-time-series-driven-rese-bilstm-framework-for",{"_path":18183,"_dir":15532,"_draft":7,"_partial":7,"_locale":8,"title":18184,"description":8,"_hidden":7,"authors":18185,"authors_orcid":18189,"year":15548,"doi":18192,"openalex_id":18193,"venue":9257,"abstract_screenshot":21,"keywords":18194,"body":18198,"_type":51,"_id":18202,"_source":53,"_file":18203,"_stem":18204,"_extension":56,"locale":57},"\u002Fpublications\u002F2025\u002Ftransitioning-to-electrification-optimal-strategies-for-ship-fleet-replacement","Transitioning to electrification: Optimal strategies for ship fleet replacement",[18186,18187,7302,18188,9251],"Cui, Ziyu","Fu, Xiaowen","Chen, Anthony",[21,18190,7310,18191,9254],"0000-0002-1925-046X","0000-0003-4363-5041","https:\u002F\u002Fdoi.org\u002F10.1016\u002Fj.trc.2025.105079","W4408389778",[18195,454,18196,179,8473,24,23,18197,928,12518],"Electrification","Fleet management","Marine engineering",{"type":39,"children":18199,"toc":18200},[],{"title":8,"searchDepth":49,"depth":49,"links":18201},[],"content:publications:2025:transitioning-to-electrification-optimal-strategies-for-ship-fleet-replacement.md","publications\u002F2025\u002Ftransitioning-to-electrification-optimal-strategies-for-ship-fleet-replacement.md","publications\u002F2025\u002Ftransitioning-to-electrification-optimal-strategies-for-ship-fleet-replacement",{"_path":18206,"_dir":15532,"_draft":7,"_partial":7,"_locale":8,"title":18207,"description":8,"_hidden":7,"authors":18208,"authors_orcid":18213,"year":15548,"doi":18218,"openalex_id":18219,"venue":687,"abstract_screenshot":21,"keywords":18220,"body":18224,"_type":51,"_id":18228,"_source":53,"_file":18229,"_stem":18230,"_extension":56,"locale":57},"\u002Fpublications\u002F2025\u002Ftscf-net-a-temporal-spectral-cross-fusion-network-for-low-channel-eeg-motor-imag","TSCF-Net: A Temporal-Spectral Cross-Fusion Network for Low-Channel EEG Motor Imagery Classification",[18209,18210,18211,12,18212],"Jiao, Yang","Cui, Mingzhe","Chen, Tao","Pan, Yi",[18214,18215,18216,15,18217],"0000-0002-2787-8927","0009-0009-6254-9545","0009-0006-4934-1246","0000-0002-2766-3096","https:\u002F\u002Fdoi.org\u002F10.1007\u002F978-981-95-0695-8_3","W4412806803",[23,18221,7386,37,8734,6980,18222,4876,18223,288,10806,865,3597],"Motor imagery","Spectral analysis","Brain–computer interface",{"type":39,"children":18225,"toc":18226},[],{"title":8,"searchDepth":49,"depth":49,"links":18227},[],"content:publications:2025:tscf-net-a-temporal-spectral-cross-fusion-network-for-low-channel-eeg-motor-imag.md","publications\u002F2025\u002Ftscf-net-a-temporal-spectral-cross-fusion-network-for-low-channel-eeg-motor-imag.md","publications\u002F2025\u002Ftscf-net-a-temporal-spectral-cross-fusion-network-for-low-channel-eeg-motor-imag",{"_path":18232,"_dir":15532,"_draft":7,"_partial":7,"_locale":8,"title":18233,"description":18234,"_hidden":7,"authors":18235,"authors_orcid":18244,"year":15548,"doi":18250,"openalex_id":18251,"venue":21,"abstract_screenshot":21,"keywords":18252,"body":18253,"_type":51,"_id":18261,"_source":53,"_file":18262,"_stem":18263,"_extension":56,"locale":57},"\u002Fpublications\u002F2025\u002Fvirtual-production-global-collaboration-and-challenges","Virtual Production: Global Collaboration and Challenges","Virtual Production (VP) is a novel approach to filmmaking that blends real-time computer graphics, live-action footage, and cutting-edge technologies (such as LED volumes and game engines like Unreal Engine). As China’s higher education (HE) landscape continues to grow and diversify, Sino- foreign higher education institutions (SfHEIs) — partnerships between local Chinese universities and international institutions — have become increasingly prominent: They were created as an innovative solution to challenges such as insufficient domestic capacity, outdated curricula, regional imbalances, limited global engagement, and quality-assurance gaps, and have themselves become centers of pedagogical, research, and institutional innovation. This paper examines the experience of a team of students and faculty at an SfHEI who collaborated on a new approach to support VP, using in-camera virtual effects (ICVFX). The paper explores the background to the project, its core technical innovations, and the team dynamics. Parallel to the technical development work, an Open Educational Resource (OER) was also created. This OER contains not only the technical elements of the project, thus helping future VP\u002FICVFX workers, but also the team-development experiences. The paper will be of interest not only to the VP\u002FICVFX community, but also to SfHEI students and staff, and to the OER community.",[18236,18237,595,18238,18239,3081,18240,18241,18242,18243],"Lam, Juin Yang","Li, Changyu","Chen, Lynne","Dean, Levi","Zahran, Omar Elsaid","Wang, Jianing","Liu, Kebin","Yan, C.",[21,18245,599,21,18246,3087,21,18247,18248,18249],"0009-0009-6090-2050","0000-0003-2010-5435","0000-0002-2385-7184","0000-0003-1965-7240","0000-0003-2927-2176","https:\u002F\u002Fdoi.org\u002F10.1109\u002Fcompsac65507.2025.00334","W4413679538",[23,927],{"type":39,"children":18254,"toc":18259},[18255],{"type":42,"tag":43,"props":18256,"children":18257},{},[18258],{"type":47,"value":18234},{"title":8,"searchDepth":49,"depth":49,"links":18260},[],"content:publications:2025:virtual-production-global-collaboration-and-challenges.md","publications\u002F2025\u002Fvirtual-production-global-collaboration-and-challenges.md","publications\u002F2025\u002Fvirtual-production-global-collaboration-and-challenges",{"_path":18265,"_dir":15532,"_draft":7,"_partial":7,"_locale":8,"title":18266,"description":18267,"_hidden":7,"authors":18268,"authors_orcid":18273,"year":15548,"doi":18278,"openalex_id":18279,"venue":21,"abstract_screenshot":21,"keywords":18280,"body":18285,"_type":51,"_id":18293,"_source":53,"_file":18294,"_stem":18295,"_extension":56,"locale":57},"\u002Fpublications\u002F2025\u002Fvrtalk-real-time-interactive-intelligent-anime-avatars-in-virtual-reality","VRtalk: Real-Time Interactive Intelligent Anime Avatars in Virtual Reality","The convergence of virtual reality live streaming and AI-driven avatars has emerged as a significant technological trend. However, current integration attempts remain in the proof-of-concept stage, with the primary challenge of automatic interaction system establishment. To build interactive intelligence anime avatars within VR frameworks, we have developed a multimodal interaction architecture centered on dialogue agents, realizing comprehensive understanding, reasoning, and response. Our approach 1).proposes high granularity explicit-implicit understanding and a dual-center switchable reasoning mechanism to support flexible responses. 2).innovates a dual-source animation mechanism for co-speech face-body visualization and a textual command module for supervising crossmodal animation, and 3).enhances expressiveness through mapping persona, content, voice, and motion to anime style. Experimental results demonstrate the state-of-the-art performance of VRtalk, highlighting its practical significance and future potential.",[11352,18269,18270,18271,18272,5667],"Xu, Changsheng","Yang, Shirao","Cao, Yu","Wang, Yuyang",[18274,18275,21,18276,18277,5670],"0009-0001-2239-2610","0000-0001-8343-9665","0000-0003-0624-7648","0000-0003-0242-8935","https:\u002F\u002Fdoi.org\u002F10.1109\u002Fismar67309.2025.00125","W4416183436",[18281,18282,4390,18283,9028,7627,18284],"Anime","Avatar","Animation","Computer animation",{"type":39,"children":18286,"toc":18291},[18287],{"type":42,"tag":43,"props":18288,"children":18289},{},[18290],{"type":47,"value":18267},{"title":8,"searchDepth":49,"depth":49,"links":18292},[],"content:publications:2025:vrtalk-real-time-interactive-intelligent-anime-avatars-in-virtual-reality.md","publications\u002F2025\u002Fvrtalk-real-time-interactive-intelligent-anime-avatars-in-virtual-reality.md","publications\u002F2025\u002Fvrtalk-real-time-interactive-intelligent-anime-avatars-in-virtual-reality",{"_path":18297,"_dir":15532,"_draft":7,"_partial":7,"_locale":8,"title":18298,"description":18299,"_hidden":7,"Multi-Target Multi-Camera Tracking Systems in Highway Scenarios authors":18300,"authors_orcid":18305,"year":15548,"doi":18309,"openalex_id":18310,"venue":12601,"abstract_screenshot":21,"keywords":18311,"body":18312,"_type":51,"_id":18320,"_source":53,"_file":18321,"_stem":18322,"_extension":56,"locale":57},"\u002Fpublications\u002F2025\u002Fweak-cue-mixed-similarity-matrix-and-boundary-expansion-clustering-for-multi-tar","Weak-Cue Mixed Similarity Matrix and Boundary Expansion Clustering for","In highway scenarios, factors such as high-speed vehicle movement, lighting conditions, and positional changes significantly affect the quality of trajectories in multi-object tracking. This, in turn, impacts the trajectory clustering process within the multi-target multi-camera tracking (MTMCT) system. To address this challenge, we present the weak-cue mixed similarity matrix and boundary expansion clustering (WCBE) MTMCT system. First, the weak-cue mixed similarity matrix (WCMSM) enhances the original trajectory features by incorporating weak cues. Then, considering the practical scene and incorporating richer information, the boundary expansion clustering (BEC) algorithm improves trajectory clustering performance by taking the distribution of trajectory observation points into account. Finally, to validate the effectiveness of our proposed method, we conduct experiments on both the Highway Surveillance Traffic (HST) dataset developed by our team and the public CityFlow dataset. The results demonstrate promising outcomes, validating the efficacy of our approach.",[11896,18301,7175,9416,18302,18303,18304],"Ni, Shenghao","Hu, Jie","Chen, Xiaoxiang","Li, Suqiang",[11901,21,18306,9422,18307,21,18308],"0009-0001-3779-8656","0000-0003-3296-5459","0000-0003-3262-9236","https:\u002F\u002Fdoi.org\u002F10.3390\u002Felectronics14091896","W4410160240",[3441,3122,7678,4391,23,7862,37,11736,4876,34,4004,7449,3961],{"type":39,"children":18313,"toc":18318},[18314],{"type":42,"tag":43,"props":18315,"children":18316},{},[18317],{"type":47,"value":18299},{"title":8,"searchDepth":49,"depth":49,"links":18319},[],"content:publications:2025:weak-cue-mixed-similarity-matrix-and-boundary-expansion-clustering-for-multi-tar.md","publications\u002F2025\u002Fweak-cue-mixed-similarity-matrix-and-boundary-expansion-clustering-for-multi-tar.md","publications\u002F2025\u002Fweak-cue-mixed-similarity-matrix-and-boundary-expansion-clustering-for-multi-tar",{"_path":18324,"_dir":15532,"_draft":7,"_partial":7,"_locale":8,"title":18325,"description":18326,"_hidden":7,"Firm Performance\" authors":18327,"authors_orcid":18328,"year":15548,"doi":18329,"openalex_id":18330,"venue":9362,"abstract_screenshot":21,"keywords":18331,"body":18334,"_type":51,"_id":18342,"_source":53,"_file":18343,"_stem":18344,"_extension":56,"locale":57},"\u002Fpublications\u002F2025\u002Fwhen-brokers-embrace-time-implications-of-brokerage-structure-and-process-on-fir","When Brokers Embrace Time: Implications of Brokerage Structure and Process o","While brokerage role diversity draws attention from the network research community, the benefits and costs of being a diversified broker rarely being discussed. This paper examines the moderating effects of temporal factors on the association between brokerage role diversity and innovation speed and profitability with the co-patenting network in China during 2005-2018. Specifically, we partition firms’ brokerage roles into three configurations—public, market, and mixed—based on organizational types of brokered partners. Public triads represent brokered parties being all from universities, brokered parties in market triads are all from firms, respectively, and mixed triads consist partners from both universities and firms. Higher diversity of a focal broker’s brokerages is beneficial for speeding innovation up at a firm but hinders the firm’s profitability. In addition, higher frequency, more regular rhythm, and a sequencing (universities as brokered parties at early stage) of conducting diversified brokerage roles boost the speed of innovation for brokers. Meanwhile brokerage duration and a sequencing (only firms as brokered parties at early stage) can mitigate the negative effect of brokerage role diversity on profitability. We extend prior research on the brokerage process with insights for firms undertaking new strategic moves in general.",[12037,65,12038,12039],[21,70,12041,12042],"https:\u002F\u002Fdoi.org\u002F10.5465\u002Famproc.2025.102bp","W4416002404",[1269,953,135,282,18332,16257,18333],"Innovation process","Organizational structure",{"type":39,"children":18335,"toc":18340},[18336],{"type":42,"tag":43,"props":18337,"children":18338},{},[18339],{"type":47,"value":18326},{"title":8,"searchDepth":49,"depth":49,"links":18341},[],"content:publications:2025:when-brokers-embrace-time-implications-of-brokerage-structure-and-process-on-fir.md","publications\u002F2025\u002Fwhen-brokers-embrace-time-implications-of-brokerage-structure-and-process-on-fir.md","publications\u002F2025\u002Fwhen-brokers-embrace-time-implications-of-brokerage-structure-and-process-on-fir",{"_path":18346,"_dir":15532,"_draft":7,"_partial":7,"_locale":8,"title":18347,"description":18348,"_hidden":7,"three top and multidisciplinary journals authors":18349,"authors_orcid":18353,"year":15548,"doi":18356,"openalex_id":18357,"venue":18358,"abstract_screenshot":21,"keywords":18359,"body":18360,"_type":51,"_id":18368,"_source":53,"_file":18369,"_stem":18370,"_extension":56,"locale":57},"\u002Fpublications\u002F2025\u002Fwhy-and-how-academic-olympic-medals-distribute-evidence-from-successors-in-three","Why and how academic Olympic medals distribute? Evidence from successors in","Publishing papers in prestigious journals such as Nature , Science and PNAS is a great feat, like athletes winning Olympics Gold Medals. Under widespread global competition, the law of allocation may prove interesting. In this study, we aimed to understand the distribution mechanism of top journal publishing and collected metadata in Nature , Science and PNAS to discover how successful academic entities distribute. A mathematical formula is used to explain for such distributions in the context of fixed geometric mean and maximum entropy principle. Results show the number of papers published by an academic producer and its rank in the successful community compliance with the power law and the result could enrich Lotka’s law. If the geometric mean of a system such as paper-and-rank distribution is given, then its entropy automatically reaches its maximum value to form the power law and perform a linear distribution. This study finds that power law operates to the top journals’ publication allocation and is the policymakers, scientists and funders in different tiers could choose different strategies to improve their rank in the distribution according to the discoveries.",[18350,18351,65,18352],"Lyu, Peng‐Hui","Zhang, Mingze","Ngai, Eric WT",[18354,18355,70,21],"0000-0001-5765-6885","0000-0002-5142-6074","https:\u002F\u002Fdoi.org\u002F10.1177\u002F01655515251362329","W4413413802","Journal of Information Science",[4413,3745,1358,23,1380,3096],{"type":39,"children":18361,"toc":18366},[18362],{"type":42,"tag":43,"props":18363,"children":18364},{},[18365],{"type":47,"value":18348},{"title":8,"searchDepth":49,"depth":49,"links":18367},[],"content:publications:2025:why-and-how-academic-olympic-medals-distribute-evidence-from-successors-in-three.md","publications\u002F2025\u002Fwhy-and-how-academic-olympic-medals-distribute-evidence-from-successors-in-three.md","publications\u002F2025\u002Fwhy-and-how-academic-olympic-medals-distribute-evidence-from-successors-in-three",{"_path":18372,"_dir":15532,"_draft":7,"_partial":7,"_locale":8,"title":18373,"description":18374,"_hidden":7,"Linear Attention Vision Transformer With Adversarial Learning\" authors":18375,"authors_orcid":18378,"year":15548,"doi":18382,"openalex_id":18383,"venue":18384,"abstract_screenshot":21,"keywords":18385,"body":18386,"_type":51,"_id":18394,"_source":53,"_file":18395,"_stem":18396,"_extension":56,"locale":57},"\u002Fpublications\u002F2025\u002Fwi-vital-domain-generalization-of-wireless-human-activity-recognition-using-line","Wi-ViTAL: Domain Generalization of Wireless Human Activity Recognition Usin","The learning-based, passive, device-free wireless human activity recognition (WHAR) systems still face significant challenges, especially in real-world deployments. Environmental differences and domain diversities cause signals collected in the source domain to have a different distribution from those in the target domain, and this affects the accuracy. To achieve domain generalization (DG), a multi-scale linear attention vision transformer (ViT) based feature extractor and domain adversarial learning with Wasserstein distance are proposed. By aligning both marginal and conditional distributions across different source domains, the adversarial learning reduces the differences between trained and unseen domains. As a result, the extracted features become domain-invariant in the latent space, ensuring accuracy is preserved in new or unseen domains. Extensive evaluations using commercial IEEE 802.11ac routers with human activity data collected over different days, environments, human subjects, and obstacle configurations show that the proposed Wi-ViTAL achieves 97.57% average accuracy for five-label classification and more than 76% for eight-label classification in unseen domains. Wi-ViTAL also demonstrates an overall DG improvement compared to other recent benchmarks.",[12121,12122,5667,4824,18376,18377],"Lim, Kian Ming","Li, Shuyu",[21,12125,5670,18379,18380,18381],"0000-0001-7857-511X","0000-0003-1929-7978","0009-0004-0245-0993","https:\u002F\u002Fdoi.org\u002F10.1109\u002Ftmc.2025.3632752","W4416214671","IEEE Transactions on Mobile Computing",[13234,14584,6144,5998,7391,1167,14243,6875],{"type":39,"children":18387,"toc":18392},[18388],{"type":42,"tag":43,"props":18389,"children":18390},{},[18391],{"type":47,"value":18374},{"title":8,"searchDepth":49,"depth":49,"links":18393},[],"content:publications:2025:wi-vital-domain-generalization-of-wireless-human-activity-recognition-using-line.md","publications\u002F2025\u002Fwi-vital-domain-generalization-of-wireless-human-activity-recognition-using-line.md","publications\u002F2025\u002Fwi-vital-domain-generalization-of-wireless-human-activity-recognition-using-line",{"_path":18398,"_dir":15532,"_draft":7,"_partial":7,"_locale":8,"title":18399,"description":18400,"_hidden":7,"authors":18401,"authors_orcid":18409,"year":15548,"doi":18417,"openalex_id":18418,"venue":21,"abstract_screenshot":18419,"keywords":18420,"body":18422,"_type":51,"_id":18430,"_source":53,"_file":18431,"_stem":18432,"_extension":56,"locale":57},"\u002Fpublications\u002F2025\u002Fwsi-llava-a-multimodal-large-language-model-for-whole-slide-image","WSI-LLaVA: A Multimodal Large Language Model for Whole Slide Image","Recent advancements in computational pathology have produced patch-level Multi-modal Large Language Models (MLLMs), but these models are limited by their inability to analyze whole slide images (WSIs) comprehensively and their tendency to bypass crucial morphological features that pathologists rely on for diagnosis. To address these challenges, we first introduce WSI-Bench, a large-scale morphology-aware benchmark containing 180k VQA pairs from 9,850 WSIs across 30 cancer types, designed to evaluate MLLMs' understanding of morphological characteristics crucial for accurate diagnosis. Building upon this benchmark, we present WSI-LLaVA, a novel framework for gigapixel WSI understanding that employs a three-stage training approach: WSI-text alignment, feature space alignment, and task-specific instruction tuning. To better assess model performance in pathological contexts, we develop two specialized WSI metrics: WSI-Precision and WSI-Relevance. Experimental results demonstrate that WSI-LLaVA outperforms existing models across all capability dimensions, with a significant improvement in morphological analysis, establishing a clear correlation between morphological understanding and diagnostic accuracy.",[18402,18403,18404,16653,18405,8931,18406,18407,4793,18408,12146],"Liang, Yuci","Lyu, Xinheng","Chen, Wenting","Zhang, Jipeng","Wu, Song","Xing, Xiaohan","Wang, Xiyue",[21,18410,18411,21,18412,8937,18413,18414,18415,18416,21],"0009-0009-5342-5495","0000-0001-7912-154X","0000-0002-3269-6992","0000-0003-3504-1630","0000-0002-9992-3387","0000-0002-0639-4122","0000-0002-3597-9090","https:\u002F\u002Fdoi.org\u002F10.1109\u002Ficcv51701.2025.02109","W4405037468","wsi-llava-a-multimodal-large-language-model-for-whole-slide-image.png",[23,4004,18421,4479,37,5925,5949],"Language model",{"type":39,"children":18423,"toc":18428},[18424],{"type":42,"tag":43,"props":18425,"children":18426},{},[18427],{"type":47,"value":18400},{"title":8,"searchDepth":49,"depth":49,"links":18429},[],"content:publications:2025:wsi-llava-a-multimodal-large-language-model-for-whole-slide-image.md","publications\u002F2025\u002Fwsi-llava-a-multimodal-large-language-model-for-whole-slide-image.md","publications\u002F2025\u002Fwsi-llava-a-multimodal-large-language-model-for-whole-slide-image",{"_path":18434,"_dir":18435,"_draft":7,"_partial":7,"_locale":8,"title":18436,"description":18437,"_hidden":7,"non-attenuation-corrected PET scans authors":18438,"authors_orcid":18447,"year":18448,"doi":18449,"openalex_id":18450,"venue":18451,"abstract_screenshot":21,"keywords":18452,"body":18457,"_type":51,"_id":18465,"_source":53,"_file":18466,"_stem":18467,"_extension":56,"locale":57},"\u002Fpublications\u002F2026\u002Fa-rapid-total-body-pet-imaging-approach-for-pediatric-patients-using-non-attenua","2026","A rapid total-body PET imaging approach for pediatric patients using","BACKGROUND: F-FDG PET\u002FCT examinations for staging and response assessment, raising concerns about cumulative radiation dose, particularly from the CT component. We propose SnapPET, a CT-sparing deep learning-based framework that uses 2D ultra-short non-attenuation-corrected (NAC) PET (Maximum intensity projection) MIP images to generate 2D high-quality PET MIP images for rapid screening and triage. METHODS: Two hundred pediatric patients with FDG-avid lymphoma imaged on a total-body PET\u002FCT scanner were retrospectively analyzed. From 10-min list-mode data, non-attenuation-corrected (NAC) PET images at 3-300 s were retrospectively reconstructed, and 600-s attenuation-corrected (AC) PET served as the reference. Whole-body coronal maximum-intensity projections (MIPs) were converted into 2D images and divided into 64 × 64 patches. For each acquisition duration, an independent latent diffusion-based autoencoder was trained to map the corresponding short-duration NAC PET MIPs to AC-like coronal PET MIPs. The intended clinical application was rapid pre-CT triage, with primary emphasis on the ultra-short 3-s setting, while longer durations were analyzed comparatively across count levels. Image quality was evaluated using PSNR, SSIM, and NMSE, as well as lesion ROI-based SUVmax and SUVmean. Three benchmark models (U-Net, GAN, and DDPM) were trained under identical settings for comparison. In addition, two nuclear medicine physicians assessed image quality using 5-point Likert scales, and lesion-level ROC and ALROC analyses were performed. RESULTS: SnapPET substantially improved image quality over NAC input for all acquisition times. For 3-s scans, PSNR increased from 28.6 ± 4.3 to 35.3 ± 6.0 and SSIM from 0.85 ± 0.09 to 0.98 ± 0.02, while NMSE decreased from 0.23 ± 0.18 to 0.03 ± 0.01 (all p \u003C 0.001). SUV metrics in lesion ROIs showed high correlation with reference AC PET, with minimal bias. Compared with UNet, GAN, and DDPM, SnapPET achieved the best quantitative metrics and the highest lesion-level ROC and ALROC curves, indicating superior detectability and localization. Reader scores for noise suppression, artifact reduction, contrast retention, and lesion discrimination were consistently higher for SnapPET images, particularly for 3- and 15-s acquisitions. CONCLUSION: SnapPET enables rapid pediatric PET imaging by generating high-quality, AC-like 2D images directly from ultra-short NAC acquisitions. The method improves image quality, preserves quantitative accuracy, and enhances lesion detectability compared with both NAC input and competing deep-learning baselines. This CT-sparing screening and triage approach has the potential to reduce reliance on attenuation-correction CT and support personalized, lower-dose CT strategies in pediatric lymphoma care.",[13452,18439,18440,18441,18442,18443,18444,15752,15753,15754,18445,8931,18446],"Huang, Y","Zhang, Qiyang","Hu, Yingying","Zhao, Yumo","Zhang, Xu","Fan, Wei","Jiang, Changhui","Zhang, N",[13460,21,21,21,21,21,21,21,21,15759,21,8937,21],2026,"https:\u002F\u002Fdoi.org\u002F10.1186\u002Fs40658-026-00889-x","W7162102087","EJNMMI Physics",[12385,18453,18454,18455,18456,15764,8049],"PET-CT","Coronal plane","Pet imaging","Positron emission tomography",{"type":39,"children":18458,"toc":18463},[18459],{"type":42,"tag":43,"props":18460,"children":18461},{},[18462],{"type":47,"value":18437},{"title":8,"searchDepth":49,"depth":49,"links":18464},[],"content:publications:2026:a-rapid-total-body-pet-imaging-approach-for-pediatric-patients-using-non-attenua.md","publications\u002F2026\u002Fa-rapid-total-body-pet-imaging-approach-for-pediatric-patients-using-non-attenua.md","publications\u002F2026\u002Fa-rapid-total-body-pet-imaging-approach-for-pediatric-patients-using-non-attenua",{"_path":18469,"_dir":18435,"_draft":7,"_partial":7,"_locale":8,"title":18470,"description":18471,"_hidden":7,"Recovering Heart-Attack Patients authors":18472,"authors_orcid":18473,"year":18448,"doi":18474,"openalex_id":18475,"venue":18476,"abstract_screenshot":21,"keywords":18477,"body":18480,"_type":51,"_id":18488,"_source":53,"_file":18489,"_stem":18490,"_extension":56,"locale":57},"\u002Fpublications\u002F2026\u002Fa-virtual-peer-mentor-to-enhance-social-presence-in-vr-rehabilitation-for-recove","A Virtual Peer Mentor to Enhance Social Presence in VR Rehabilitation for","The adoption of immersive virtual reality (IVR) for gamified rehabilitation is increasing. However, a significant challenge relates to perceptions of virtual environments as empty and isolating, potentially increasing stress, particularly among older users (patients). This paper explores the use of a virtual peer mentor (VPM) in a custom IVR-rehabilitation game to provide guidance and companionship. This game specifically targets patients recovering from acute myocardial infarction (AMI), commonly known as a heart attack. Grounded in social support theory, the VPM provides three types of support: (1) informational support, through pre-exercise narratives detailing a shared medical history; (2) instrumental support, through real-time demonstrations of clinically-validated exercise movements; and (3) emotional support, through positive feedback and encouragement. A within-subjects study involving 30 hospitalized AMI patients (all over 47 years old) evaluated the effectiveness of the VPM-integrated IVR-rehabilitation game. Each participant experienced a baseline (no VPM) and VPM-integrated version of the game on separate days. The results from the Intrinsic Motivation Inventory (IMI) and the social presence module of the Game Experience Questionnaire (GEQ-SPM) show that the VPM resulted in significant increases in engagement, and statistically significant lower pressure\u002Ftension. Furthermore, participants exhibited high user acceptance (76.7%) and task-completion rates (98.5%), with minimal cybersickness. The findings demonstrate that a psychologically-grounded VPM can effectively reduce stress in middle- and older-age patients in an IVR rehabilitation setting.",[13424,18162,595,9416,5407],[13752,21,599,21,5411],"https:\u002F\u002Fdoi.org\u002F10.1109\u002Ftvcg.2026.3679134","W7143451859","IEEE Transactions on Visualization and Computer Graphics",[13007,4390,9028,18478,18479],"Data visualization","Task analysis",{"type":39,"children":18481,"toc":18486},[18482],{"type":42,"tag":43,"props":18483,"children":18484},{},[18485],{"type":47,"value":18471},{"title":8,"searchDepth":49,"depth":49,"links":18487},[],"content:publications:2026:a-virtual-peer-mentor-to-enhance-social-presence-in-vr-rehabilitation-for-recove.md","publications\u002F2026\u002Fa-virtual-peer-mentor-to-enhance-social-presence-in-vr-rehabilitation-for-recove.md","publications\u002F2026\u002Fa-virtual-peer-mentor-to-enhance-social-presence-in-vr-rehabilitation-for-recove",{"_path":18492,"_dir":18435,"_draft":7,"_partial":7,"_locale":8,"title":18493,"description":8,"_hidden":7,"authors":18494,"authors_orcid":18496,"year":18448,"doi":18497,"openalex_id":18498,"venue":687,"abstract_screenshot":21,"keywords":18499,"body":18501,"_type":51,"_id":18505,"_source":53,"_file":18506,"_stem":18507,"_extension":56,"locale":57},"\u002Fpublications\u002F2026\u002Fconformal-prediction-and-trustworthy-ai","Conformal Prediction and Trustworthy AI",[4189,18495],"Zhao, Xindi",[4191,21],"https:\u002F\u002Fdoi.org\u002F10.1007\u002F978-3-032-15120-9_10","W7127125051",[7137,6144,10042,860,101,18500],"Mainstream",{"type":39,"children":18502,"toc":18503},[],{"title":8,"searchDepth":49,"depth":49,"links":18504},[],"content:publications:2026:conformal-prediction-and-trustworthy-ai.md","publications\u002F2026\u002Fconformal-prediction-and-trustworthy-ai.md","publications\u002F2026\u002Fconformal-prediction-and-trustworthy-ai",{"_path":18509,"_dir":18435,"_draft":7,"_partial":7,"_locale":8,"title":18510,"description":18511,"_hidden":7,"Engagement in Collaborative Gaming for Unfamiliar Users authors":18512,"authors_orcid":18517,"year":18448,"doi":18518,"openalex_id":18519,"venue":21,"abstract_screenshot":21,"keywords":18520,"body":18524,"_type":51,"_id":18532,"_source":53,"_file":18533,"_stem":18534,"_extension":56,"locale":57},"\u002Fpublications\u002F2026\u002Fdifferential-effects-of-virtual-and-augmented-reality-on-social-presence-and-eng","Differential Effects of Virtual and Augmented Reality on Social Presence and","Many studies have shown that collaborative tasks in immersive virtual reality (VR) and augmented reality (AR) environments can enhance collaborative outcomes in learning, training, and game-based contexts. However, the literature offers limited information on how these environments differentially shape social presence and collaborative engagement, particularly among unfamiliar users. This study addresses this gap by examining differences in social presence and collaborative engagement between VR and AR environments for unfamiliar pairs. A between-subjects experiment used an escape room game that featured three collaborative tasks, identically implemented in both VR and AR. The key difference was that the VR experience was stationary, while the AR experience required physical movement between rooms. The study involved 52 participants, divided into VR and AR groups, where two unfamiliar participants were paired into teams to complete the tasks. The results indicate significant differences in collaborative dynamics and user perception between the two environments. Specifically, VR pairs reported a stronger sense of immersion and flow state, whereas AR pairs demonstrated greater contextual awareness and behavioral coordination. Cybersickness measures also differed between conditions; given the locomotion mismatch, this pattern should be interpreted cautiously and not attributed to the environment alone. This finding improves understanding of the impact of immersive environments on collaborative processes and offers insights for designing collaborative XR applications (e.g., training and game-based teamwork), particularly for unfamiliar users.",[16628,18513,16627,18514,18515,5667,5407,18516],"Cheng, Guoyueyang","Yuan, J T","Fan, Yuchen","Guerra-Manzanares, Alejandro",[21,21,16630,21,21,5670,5411,21],"https:\u002F\u002Fdoi.org\u002F10.1109\u002Fvr67842.2026.00063","W7148402224",[18521,4387,4390,18522,18523,9784],"Differential effects","Differential (mechanical device)","Social relation",{"type":39,"children":18525,"toc":18530},[18526],{"type":42,"tag":43,"props":18527,"children":18528},{},[18529],{"type":47,"value":18511},{"title":8,"searchDepth":49,"depth":49,"links":18531},[],"content:publications:2026:differential-effects-of-virtual-and-augmented-reality-on-social-presence-and-eng.md","publications\u002F2026\u002Fdifferential-effects-of-virtual-and-augmented-reality-on-social-presence-and-eng.md","publications\u002F2026\u002Fdifferential-effects-of-virtual-and-augmented-reality-on-social-presence-and-eng",{"_path":18536,"_dir":18435,"_draft":7,"_partial":7,"_locale":8,"title":18537,"description":8,"_hidden":7,"across China Using Interpretable Deep Learning\" authors":18538,"authors_orcid":18543,"year":18448,"doi":18546,"openalex_id":18547,"venue":74,"abstract_screenshot":21,"keywords":18548,"body":18549,"_type":51,"_id":18553,"_source":53,"_file":18554,"_stem":18555,"_extension":56,"locale":57},"\u002Fpublications\u002F2026\u002Fdl4pv-decoding-regional-heterogeneity-in-macro-scale-photovoltaic-siting-across","DL4PV: Decoding Regional Heterogeneity in Macro-scale Photovoltaic Sitin",[18539,10006,17604,18540,10007,4189,18541,18542],"Shen, J. M.","MA, Yuanli","Tesema, Fiseha Berhanu","Prasad, Deo",[21,21,21,21,18544,4191,21,18545],"0000-0002-2242-490X","0000-0003-4917-1153","https:\u002F\u002Fdoi.org\u002F10.2139\u002Fssrn.6142509","W7125947159",[11467,133,11470,10843,952,210,6976,6249],{"type":39,"children":18550,"toc":18551},[],{"title":8,"searchDepth":49,"depth":49,"links":18552},[],"content:publications:2026:dl4pv-decoding-regional-heterogeneity-in-macro-scale-photovoltaic-siting-across.md","publications\u002F2026\u002Fdl4pv-decoding-regional-heterogeneity-in-macro-scale-photovoltaic-siting-across.md","publications\u002F2026\u002Fdl4pv-decoding-regional-heterogeneity-in-macro-scale-photovoltaic-siting-across",{"_path":18557,"_dir":18435,"_draft":7,"_partial":7,"_locale":8,"title":18558,"description":18559,"_hidden":7,"Planning\" authors":18560,"authors_orcid":18563,"year":18448,"doi":18564,"openalex_id":18565,"venue":21,"abstract_screenshot":21,"keywords":18566,"body":18567,"_type":51,"_id":18575,"_source":53,"_file":18576,"_stem":18577,"_extension":56,"locale":57},"\u002Fpublications\u002F2026\u002Fdynaview-bridging-offline-learning-and-online-adaptation-for-uav-viewpoint-plann","DynaView: Bridging Offline Learning and Online Adaptation for UAV Viewpoin","This work investigates UAV viewpoint planning for high-quality 3D reconstruction and introduces DynaView, a framework that synergizes a learned reconstructability predictor with continuous optimization. The method operates in two phases: an offline phase where a Transformer model predicts point-wise reconstructability, and an online phase where a Viewpoint Utility Learner (VUL) and Marginal Utility Maximizer (MUM) dynamically update the viewpoint set. This hybrid paradigm enables the planner to generate candidates in low-quality regions, admit or remove viewpoints based on marginal gain, and refine orientations, thereby adapting to real-time reconstruction progress while leveraging lightweight geometric descriptors and compact prediction models to keep the online optimization cost modest. Experiments on ten Urban-Scene3D buildings demonstrate that DynaView improves global reconstructability by 19.5% on average over a static baseline. These results indicate that our approach not only raises global reconstruction quality but also utilizes viewpoint resources more effectively.",[18561,18562,1181],"Huang, Jing","Qin, Jiale",[21,21,1184],"https:\u002F\u002Fdoi.org\u002F10.1109\u002Fcai68641.2026.11536261","W7163050079",[6598,6319,5573,3388,133],{"type":39,"children":18568,"toc":18573},[18569],{"type":42,"tag":43,"props":18570,"children":18571},{},[18572],{"type":47,"value":18559},{"title":8,"searchDepth":49,"depth":49,"links":18574},[],"content:publications:2026:dynaview-bridging-offline-learning-and-online-adaptation-for-uav-viewpoint-plann.md","publications\u002F2026\u002Fdynaview-bridging-offline-learning-and-online-adaptation-for-uav-viewpoint-plann.md","publications\u002F2026\u002Fdynaview-bridging-offline-learning-and-online-adaptation-for-uav-viewpoint-plann",{"_path":18579,"_dir":18435,"_draft":7,"_partial":7,"_locale":8,"title":18580,"description":18581,"_hidden":7,"domain adaptation authors":18582,"authors_orcid":18594,"year":18448,"doi":18601,"openalex_id":18602,"venue":18603,"abstract_screenshot":18604,"keywords":18605,"body":18610,"_type":51,"_id":18618,"_source":53,"_file":18619,"_stem":18620,"_extension":56,"locale":57},"\u002Fpublications\u002F2026\u002Fgeneralizable-ct-free-pet-attenuation-and-scatter-correction-via-few-shot-cross","Generalizable CT-free PET attenuation and scatter correction via few-shot cross","The rapid advancements in PET technology, coupled with the need for accurate and efficient imaging, necessitate the development of robust and generalizable methods for CT-free attenuation and scatter correction (ASC). Deep learning offers a promising solution, but exhibits limited performance when tested in diverse clinical settings and varying imaging conditions. We propose a few-shot fine-tuning paradigm that enables efficient adaptation of models from a source domain to a new target domain. Our backbone network incorporates statistical modulation to extract domain-specific distribution information and employs pixel-wise factor scaling modeling to disentangle ASC factor maps from input images. On a large and diverse dataset of 1539 subjects across multiple tracers, scanners, and centers, we evaluate model performance under single-tracer training, multi-tracer joint training, and few-shot adaptation strategies. Although joint training demonstrates strong performance on known tracers, the proposed few-shot adaptation approach, CrossPET-Adapt, excels at adapting to unseen domains with minimal data, outperforming joint training. This method significantly reduces radiation exposure and data requirements, offering a rapid and robust solution for CT-free PET ASC in varied clinical environments.",[18583,16236,18584,18585,18586,18587,18588,18589,18590,18591,18592,15752,15753,8931,15754,18593],"Wang, Hanzhong","Qiao, Xiaoya","Chen, Qianhao","An, Yi","Chen, X","Guo, Rui","Huang, Qiu","Zhu, Xi","Cheng, Zhaoping","Xu, Jiehua","Li, B R",[21,16244,18595,18596,18597,21,21,21,18598,18599,21,21,21,8937,15759,18600],"0000-0001-7226-4054","0000-0003-2782-9217","0009-0003-7661-2767","0000-0003-1342-2221","0000-0001-7217-7284","0000-0002-9189-9300","https:\u002F\u002Fdoi.org\u002F10.1038\u002Fs41746-026-02760-w","W7161136952","npj Digital Medicine","generalizable-ct-free-pet-attenuation-and-scatter-correction-via-few-shot-cross.png",[18606,7572,5573,18607,18608,1167,4876,18609],"Domain adaptation","Attenuation","Correction for attenuation","Joint probability distribution",{"type":39,"children":18611,"toc":18616},[18612],{"type":42,"tag":43,"props":18613,"children":18614},{},[18615],{"type":47,"value":18581},{"title":8,"searchDepth":49,"depth":49,"links":18617},[],"content:publications:2026:generalizable-ct-free-pet-attenuation-and-scatter-correction-via-few-shot-cross.md","publications\u002F2026\u002Fgeneralizable-ct-free-pet-attenuation-and-scatter-correction-via-few-shot-cross.md","publications\u002F2026\u002Fgeneralizable-ct-free-pet-attenuation-and-scatter-correction-via-few-shot-cross",{"_path":18622,"_dir":18435,"_draft":7,"_partial":7,"_locale":8,"title":18623,"description":18624,"_hidden":7,"system management authors":18625,"authors_orcid":18627,"year":18448,"doi":18630,"openalex_id":18631,"venue":741,"abstract_screenshot":21,"keywords":18632,"body":18639,"_type":51,"_id":18647,"_source":53,"_file":18648,"_stem":18649,"_extension":56,"locale":57},"\u002Fpublications\u002F2026\u002Fgeo-fenced-parking-station-planning-and-user-incentive-scheme-for-bike-sharing-s","Geo-fenced parking station planning and user incentive scheme for bike sharing","• Integrates geo-fenced station planning with incentive-based inventory management. • Data-driven clustering optimizes station locations and capacities using historical riding data. • Designs optimal incentives minimizing regulator and firm costs to solve parking issues. • Promotes low-emission, sustainable urban transit via efficient bike-sharing systems. • Proposes a transferable framework readily applicable to diverse urban contexts. Management of dockless bike-sharing systems encounters numerous challenges, including disorderly parking and frequent mismatches between supply and demand in bike inventory, which result in traffic congestion and compromise the efficiency of the entire system. Geo-fenced station restrains the behavior of disorderly parking while eliminating the costs associated with the construction of physical stations. This paper addresses these challenges by investigating two key issues: the location and capacity design of geo-fenced parking stations, and the user incentive scheme for managing the bike-sharing system. The design of station locations and capacities fundamentally serves as a spatial constraint for inventory systems, while inventory levels directly impact station utilization efficiency. This synergistic study improves system’s capability to resolve demand-supply imbalances. Initially, we employ the DBSCAN algorithm to cluster real-world user riding data, which is then utilized as the basis for determining station locations. Furthermore, we develop a consumer choice model aimed at minimizing social costs for the government regulators and operational costs for bike-sharing firms, to derive user incentive strategies based on the dynamic status of the system. Utilizing riding data from a mid-sized Chinese city, extensive experimental results validate the effectiveness in reducing disorderly parking and mismatch of supply and demand applying our proposed methodology.",[9143,7302,9251,18626,1181],"Jiang, Changmin",[18628,7310,18629,21,21],"0009-0005-7045-4096","0009-0003-8985-2989","https:\u002F\u002Fdoi.org\u002F10.1016\u002Fj.tre.2026.104830","W7154132187",[3332,5472,18633,18634,18635,18636,18637,18638],"Bike sharing","Parking guidance and information","Management system","Traffic management","Intelligent transportation system","Parking lot",{"type":39,"children":18640,"toc":18645},[18641],{"type":42,"tag":43,"props":18642,"children":18643},{},[18644],{"type":47,"value":18624},{"title":8,"searchDepth":49,"depth":49,"links":18646},[],"content:publications:2026:geo-fenced-parking-station-planning-and-user-incentive-scheme-for-bike-sharing-s.md","publications\u002F2026\u002Fgeo-fenced-parking-station-planning-and-user-incentive-scheme-for-bike-sharing-s.md","publications\u002F2026\u002Fgeo-fenced-parking-station-planning-and-user-incentive-scheme-for-bike-sharing-s",{"_path":18651,"_dir":18435,"_draft":7,"_partial":7,"_locale":8,"title":17139,"description":18652,"_hidden":7,"Study — RCR Report\" authors":18653,"authors_orcid":18654,"year":18448,"doi":18655,"openalex_id":18656,"venue":14407,"abstract_screenshot":21,"keywords":18657,"body":18660,"_type":51,"_id":18668,"_source":53,"_file":18669,"_stem":18670,"_extension":56,"locale":57},"\u002Fpublications\u002F2026\u002Flarge-language-models-for-automated-web-form-test-generation-an-empirical-study","This report presents a framework that enables the reproduction and extension of our empirical evaluations using Large Language Models (LLMs) for automated web-form-test generation. The framework includes HTML pruning , context construction , prompt design , LLM communication , and web-form-test insertion . It involves the construction of three types of prompts (from HTML) to guide the test generation: Raw HTML for Task Prompt (RH-P); LLM-Processed HTML for Task Prompt (LH-P); and Parser-Processed HTML for Task Prompt (PH-P). The framework provides an LLM communication module that standardizes interactions with provider Application Programming Interfaces (APIs). Our study utilized public-API models and demonstrated that PH-P consistently achieved a higher successfully-submitted rate (SSR) than RH-P and LH-P. To support the replication of our work, we have released the source code, a dataset subset, and the relevant scripts.",[17142,6820,645,595,17143],[21,6822,21,599,21],"https:\u002F\u002Fdoi.org\u002F10.1145\u002F3797275","W7128771428",[3981,529,18658,18479,18659],"Replication (statistics)","Extension (predicate logic)",{"type":39,"children":18661,"toc":18666},[18662],{"type":42,"tag":43,"props":18663,"children":18664},{},[18665],{"type":47,"value":18652},{"title":8,"searchDepth":49,"depth":49,"links":18667},[],"content:publications:2026:large-language-models-for-automated-web-form-test-generation-an-empirical-study.md","publications\u002F2026\u002Flarge-language-models-for-automated-web-form-test-generation-an-empirical-study.md","publications\u002F2026\u002Flarge-language-models-for-automated-web-form-test-generation-an-empirical-study",{"_path":18672,"_dir":18435,"_draft":7,"_partial":7,"_locale":8,"title":18673,"description":8,"_hidden":7,"Explainable Deep Learning authors":18674,"authors_orcid":18676,"year":18448,"doi":18678,"openalex_id":18679,"venue":74,"abstract_screenshot":21,"keywords":18680,"body":18685,"_type":51,"_id":18689,"_source":53,"_file":18690,"_stem":18691,"_extension":56,"locale":57},"\u002Fpublications\u002F2026\u002Flearning-transferable-pv-siting-logic-from-urban-deployment-patterns-with-explai","Learning Transferable PV Siting Logic from Urban Deployment Patterns with",[10004,10006,10007,17604,18675,4189,18541,18542],"Xiong, Suwen",[17607,21,18544,17608,18677,4191,21,18545],"0009-0008-9701-5781","https:\u002F\u002Fdoi.org\u002F10.2139\u002Fssrn.6661886","W7156286400",[10843,11467,18681,18682,18683,18684],"Urban planning","Land use","Megacity","Spatial planning",{"type":39,"children":18686,"toc":18687},[],{"title":8,"searchDepth":49,"depth":49,"links":18688},[],"content:publications:2026:learning-transferable-pv-siting-logic-from-urban-deployment-patterns-with-explai.md","publications\u002F2026\u002Flearning-transferable-pv-siting-logic-from-urban-deployment-patterns-with-explai.md","publications\u002F2026\u002Flearning-transferable-pv-siting-logic-from-urban-deployment-patterns-with-explai",{"_path":18693,"_dir":18435,"_draft":7,"_partial":7,"_locale":8,"title":18694,"description":18695,"_hidden":7,"authors":18696,"authors_orcid":18699,"year":18448,"doi":18702,"openalex_id":18703,"venue":14407,"abstract_screenshot":18704,"keywords":18705,"body":18709,"_type":51,"_id":18717,"_source":53,"_file":18718,"_stem":18719,"_extension":56,"locale":57},"\u002Fpublications\u002F2026\u002Flrasgen-llm-based-restful-api-specification-generation","LRASGen: LLM-based RESTful API Specification Generation","REpresentation State Transfer (REST) is an architectural style for designing web applications that enables scalable, stateless communication between clients and servers via common HTTP techniques. Web APIs that employ the REST style are known as RESTful (or REST) APIs. When using or testing a RESTful API, developers often refer to its specifications, which are typically defined by open-source standards such as the OpenAPI Specification (OAS). However, writing and updating these specifications can be very time-consuming and error-prone, which can negatively affect the use of RESTful APIs, especially when software requirements change. Many tools and methods have been proposed to solve this problem, including Respector and Swagger Core. OAS generation can be regarded as a common text-generation task that produces a formal description of API endpoints from source code. A potential approach for this may involve using Large Language Models (LLMs), which have strong capabilities in both code understanding and text generation. Motivated by this, we propose a novel approach to generate the OASs of RESTful APIs using LLMs: LLM-based RESTful API-Specification Generation (LRASGen). To the best of our knowledge, this is the first technique to use LLMs to generate OASs directly from RESTful API source code. Compared with existing tools and methods, LRASGen can even generate OASs when the implementation is incomplete (e.g., with partial code, missing annotations\u002Fcomments, etc.). To evaluate LRASGen's performance, we conducted a series of empirical studies on 53 real-world RESTful APIs, identifying the following entities: endpoint-methods, endpoint-parameter, parameter-constraint, and endpoint-response. These APIs were developed in five programming languages using ten frameworks. The results show that LRASGen can generate accurate specifications, and can cover an average of 43.54% more entities than the developer-provided specifications. LRASGen also outperforms the current state-of-the-art technique, Respector, across all evaluated APIs, on four identification tasks: LRASGen achieved performance improvements of 54.17% in endpoint-method identification; 28.3% in endpoint-parameter identification; 98.6% in parameter-constraint identification; and 74.8% in endpoint-response identification.",[18697,645,18698,6820,595,15691],"Deng, Sida","Zhang, Man",[18700,650,18701,6822,599,15694],"0009-0006-2819-3862","0000-0003-1204-9322","https:\u002F\u002Fdoi.org\u002F10.1145\u002F3810241","W4415067287","lrasgen-llm-based-restful-api-specification-generation.png",[18706,1105,16149,1106,3848,529,18707,18708,139],"Representational state transfer","Architectural style","Web API",{"type":39,"children":18710,"toc":18715},[18711],{"type":42,"tag":43,"props":18712,"children":18713},{},[18714],{"type":47,"value":18695},{"title":8,"searchDepth":49,"depth":49,"links":18716},[],"content:publications:2026:lrasgen-llm-based-restful-api-specification-generation.md","publications\u002F2026\u002Flrasgen-llm-based-restful-api-specification-generation.md","publications\u002F2026\u002Flrasgen-llm-based-restful-api-specification-generation",{"_path":18721,"_dir":18435,"_draft":7,"_partial":7,"_locale":8,"title":18722,"description":8,"_hidden":7,"Dual-Task Training in Older Adults\" authors":18723,"authors_orcid":18725,"year":18448,"doi":18726,"openalex_id":18727,"venue":21,"abstract_screenshot":21,"keywords":18728,"body":18730,"_type":51,"_id":18734,"_source":53,"_file":18735,"_stem":18736,"_extension":56,"locale":57},"\u002Fpublications\u002F2026\u002Fmahjong-an-augmented-reality-rehabilitation-serious-game-for-motor-cognitive-dua","MAHJONG: An Augmented Reality Rehabilitation Serious Game for Motor-Cognitiv",[18724,5667],"Zuo, Yuchang",[21,5670],"https:\u002F\u002Fdoi.org\u002F10.1109\u002Fvrw70859.2026.00199","W7160315629",[4387,3902,13007,13642,18729],"Quality of life (healthcare)",{"type":39,"children":18731,"toc":18732},[],{"title":8,"searchDepth":49,"depth":49,"links":18733},[],"content:publications:2026:mahjong-an-augmented-reality-rehabilitation-serious-game-for-motor-cognitive-dua.md","publications\u002F2026\u002Fmahjong-an-augmented-reality-rehabilitation-serious-game-for-motor-cognitive-dua.md","publications\u002F2026\u002Fmahjong-an-augmented-reality-rehabilitation-serious-game-for-motor-cognitive-dua",{"_path":18738,"_dir":18435,"_draft":7,"_partial":7,"_locale":8,"title":18739,"description":18740,"_hidden":7,"authors":18741,"authors_orcid":18743,"year":18448,"doi":18746,"openalex_id":18747,"venue":374,"abstract_screenshot":21,"keywords":18748,"body":18751,"_type":51,"_id":18759,"_source":53,"_file":18760,"_stem":18761,"_extension":56,"locale":57},"\u002Fpublications\u002F2026\u002Fmela-a-metacognitive-llm-driven-architecture-for-automatic-heuristic-design","MeLA: A metacognitive LLM-driven architecture for automatic heuristic design","This paper introduces MeLA, a Metacognitive LLM-Driven Architecture that presents a new paradigm for Automatic Heuristic Design (AHD). Traditional nature evolutionary methods operate directly on heuristic code. Existing prompt-evolution methods mainly optimize task descriptions before generation. In contrast, MeLA evolves the instructional prompts used during heuristic generation and focuses on reflective guidance from previous outputs. This new paradigm, termed Metacognitive Prompt Evolution , is driven by a novel metacognitive framework where the system analyzes performance feedback to systematically refine its generative strategy. MeLA’s architecture integrates a problem analyzer to construct an initial strategic prompt, an error diagnosis system to correct faulty code, and a metacognitive search engine that iteratively optimizes the prompt based on heuristic effectiveness. In comprehensive experiments across both benchmark and real-world problems, MeLA achieves competitive performance on classical tasks and demonstrates clear advantages on more complex real-world problems. Ultimately, this research demonstrates the profound potential of using cognitive science as a blueprint for AI architecture, revealing that by enabling an LLM to metacognitively regulate its problem-solving process, we unlock a more robust and interpretable path to AHD.",[18742,5989,17501,12],"Qiu, Zishang",[18744,5991,18745,15],"0009-0000-5670-5171","0000-0003-1110-6495","https:\u002F\u002Fdoi.org\u002F10.1016\u002Fj.eswa.2026.133022","W4417270352",[18749,329,3876,135,18750,209,6300],"Metacognition","Blueprint",{"type":39,"children":18752,"toc":18757},[18753],{"type":42,"tag":43,"props":18754,"children":18755},{},[18756],{"type":47,"value":18740},{"title":8,"searchDepth":49,"depth":49,"links":18758},[],"content:publications:2026:mela-a-metacognitive-llm-driven-architecture-for-automatic-heuristic-design.md","publications\u002F2026\u002Fmela-a-metacognitive-llm-driven-architecture-for-automatic-heuristic-design.md","publications\u002F2026\u002Fmela-a-metacognitive-llm-driven-architecture-for-automatic-heuristic-design",{"_path":18763,"_dir":18435,"_draft":7,"_partial":7,"_locale":8,"title":18764,"description":8,"_hidden":7,"Weighted Loss Functions in Neural Networks authors":18765,"authors_orcid":18766,"year":18448,"doi":18767,"openalex_id":18768,"venue":74,"abstract_screenshot":21,"keywords":18769,"body":18772,"_type":51,"_id":18776,"_source":53,"_file":18777,"_stem":18778,"_extension":56,"locale":57},"\u002Fpublications\u002F2026\u002Fmitigating-population-drift-in-financial-risk-modelling-using-time-dependent-wei","Mitigating Population Drift in Financial Risk Modelling using Time-dependent",[13501,4189,268],[21,4191,21],"https:\u002F\u002Fdoi.org\u002F10.2139\u002Fssrn.6018996","W7120159191",[209,632,952,100,10410,18770,18771],"Carry (investment)","Network model",{"type":39,"children":18773,"toc":18774},[],{"title":8,"searchDepth":49,"depth":49,"links":18775},[],"content:publications:2026:mitigating-population-drift-in-financial-risk-modelling-using-time-dependent-wei.md","publications\u002F2026\u002Fmitigating-population-drift-in-financial-risk-modelling-using-time-dependent-wei.md","publications\u002F2026\u002Fmitigating-population-drift-in-financial-risk-modelling-using-time-dependent-wei",{"_path":18780,"_dir":18435,"_draft":7,"_partial":7,"_locale":8,"title":18781,"description":8,"_hidden":7,"authors":18782,"authors_orcid":18784,"year":18448,"doi":18785,"openalex_id":18786,"venue":374,"abstract_screenshot":21,"keywords":18787,"body":18789,"_type":51,"_id":18793,"_source":53,"_file":18794,"_stem":18795,"_extension":56,"locale":57},"\u002Fpublications\u002F2026\u002Fonline-risk-aware-pattern-adjustment-for-bin-packing-problem","Online risk-aware pattern adjustment for bin packing problem",[7412,18783,12],"Liu, Tie-Yan",[21,21,15],"https:\u002F\u002Fdoi.org\u002F10.1016\u002Fj.eswa.2025.131074","W7121561599",[10460,9732,506,10459,9733,106,18788,12905],"Set packing",{"type":39,"children":18790,"toc":18791},[],{"title":8,"searchDepth":49,"depth":49,"links":18792},[],"content:publications:2026:online-risk-aware-pattern-adjustment-for-bin-packing-problem.md","publications\u002F2026\u002Fonline-risk-aware-pattern-adjustment-for-bin-packing-problem.md","publications\u002F2026\u002Fonline-risk-aware-pattern-adjustment-for-bin-packing-problem",{"_path":18797,"_dir":18435,"_draft":7,"_partial":7,"_locale":8,"title":18798,"description":18799,"_hidden":7,"authors":18800,"authors_orcid":18801,"year":18448,"doi":18803,"openalex_id":18804,"venue":9025,"abstract_screenshot":21,"keywords":18805,"body":18806,"_type":51,"_id":19101,"_source":53,"_file":19102,"_stem":19103,"_extension":56,"locale":57},"\u002Fpublications\u002F2026\u002Fpredictive-reasoning-with-augmented-anomaly-contrastive-learning-for-composition","Predictive Reasoning with Augmented Anomaly Contrastive Learning for Compositional Visual Relations","While visual reasoning for simple analogies has received significant attention, compositional visual relations (CVR) remain relatively unexplored due to their greater complexity. To solve CVR tasks, we propose Predictive Reasoning with Augmented Anomaly Contrastive Learning (PR-A 2^{2}2 CL), i.e., to identify an outlier image given three other images that follow the same compositional rules. To address the challenge of modelling abundant compositional rules, an Augmented Anomaly Contrastive Learning is designed to distil discriminative and generalizable features by maximizing similarity among normal instances while minimizing similarity between normal and anomalous outliers. More importantly, a predict-and-verify paradigm is introduced for rule-based reasoning, in which a series of Predictive Anomaly Reasoning Blocks (PARBs) iteratively leverage features from three out of the four images to predict those of the remaining one. Throughout the subsequent verification stage, the PARBs progressively pinpoint the specific discrepancies attributable to the underlying rules. Experimental results on SVRT, CVR and MC 2^{2}2 R datasets show that PR-A 2^{2}2 CL significantly outperforms state-of-the-art reasoning models.",[16019,9302,6111,12,14847,5532,9048],[21,18802,21,15,21,21,21],"0009-0005-5949-4783","https:\u002F\u002Fdoi.org\u002F10.1109\u002Ftmm.2026.3668614","W7131827550",[8165,10551,6897,7796,14295,3122],{"type":39,"children":18807,"toc":19099},[18808],{"type":42,"tag":43,"props":18809,"children":18810},{},[18811,18813,18909,18911,19003,19005,19097],{"type":47,"value":18812},"While visual reasoning for simple analogies has received significant attention, compositional visual relations (CVR) remain relatively unexplored due to their greater complexity. To solve CVR tasks, we propose Predictive Reasoning with Augmented Anomaly Contrastive Learning (PR-A ",{"type":42,"tag":8789,"props":18814,"children":18815},{"xmlns:mml":1465,"xmlnsXLink":8791},[18816],{"type":42,"tag":8796,"props":18817,"children":18818},{"notation":8798},[18819],{"type":42,"tag":809,"props":18820,"children":18822},{"className":18821},[1455],[18823,18852],{"type":42,"tag":809,"props":18824,"children":18826},{"className":18825},[1460],[18827],{"type":42,"tag":1463,"props":18828,"children":18829},{"xmlns":1465},[18830],{"type":42,"tag":1468,"props":18831,"children":18832},{},[18833,18847],{"type":42,"tag":1472,"props":18834,"children":18835},{},[18836],{"type":42,"tag":18837,"props":18838,"children":18839},"msup",{},[18840,18843],{"type":42,"tag":1472,"props":18841,"children":18842},{},[],{"type":42,"tag":1476,"props":18844,"children":18845},{},[18846],{"type":47,"value":1480},{"type":42,"tag":2265,"props":18848,"children":18849},{"encoding":2267},[18850],{"type":47,"value":18851},"^{2}",{"type":42,"tag":809,"props":18853,"children":18855},{"className":18854,"ariaHidden":1484},[2274],[18856],{"type":42,"tag":809,"props":18857,"children":18859},{"className":18858},[2279],[18860,18865],{"type":42,"tag":809,"props":18861,"children":18864},{"className":18862,"style":18863},[2284],"height:0.8141em;",[],{"type":42,"tag":809,"props":18866,"children":18868},{"className":18867},[2290],[18869,18872],{"type":42,"tag":809,"props":18870,"children":18871},{},[],{"type":42,"tag":809,"props":18873,"children":18875},{"className":18874},[9598],[18876],{"type":42,"tag":809,"props":18877,"children":18879},{"className":18878},[9603],[18880],{"type":42,"tag":809,"props":18881,"children":18883},{"className":18882},[9609],[18884],{"type":42,"tag":809,"props":18885,"children":18887},{"className":18886,"style":18863},[9614],[18888],{"type":42,"tag":809,"props":18889,"children":18891},{"style":18890},"top:-3.063em;margin-right:0.05em;",[18892,18896],{"type":42,"tag":809,"props":18893,"children":18895},{"className":18894,"style":9625},[9624],[],{"type":42,"tag":809,"props":18897,"children":18899},{"className":18898},[9630,9631,9632,9633],[18900],{"type":42,"tag":809,"props":18901,"children":18903},{"className":18902},[2290,9633],[18904],{"type":42,"tag":809,"props":18905,"children":18907},{"className":18906},[2290,9633],[18908],{"type":47,"value":1480},{"type":47,"value":18910}," CL), i.e., to identify an outlier image given three other images that follow the same compositional rules. To address the challenge of modelling abundant compositional rules, an Augmented Anomaly Contrastive Learning is designed to distil discriminative and generalizable features by maximizing similarity among normal instances while minimizing similarity between normal and anomalous outliers. More importantly, a predict-and-verify paradigm is introduced for rule-based reasoning, in which a series of Predictive Anomaly Reasoning Blocks (PARBs) iteratively leverage features from three out of the four images to predict those of the remaining one. Throughout the subsequent verification stage, the PARBs progressively pinpoint the specific discrepancies attributable to the underlying rules. Experimental results on SVRT, CVR and MC ",{"type":42,"tag":8789,"props":18912,"children":18913},{"xmlns:mml":1465,"xmlnsXLink":8791},[18914],{"type":42,"tag":8796,"props":18915,"children":18916},{"notation":8798},[18917],{"type":42,"tag":809,"props":18918,"children":18920},{"className":18919},[1455],[18921,18948],{"type":42,"tag":809,"props":18922,"children":18924},{"className":18923},[1460],[18925],{"type":42,"tag":1463,"props":18926,"children":18927},{"xmlns":1465},[18928],{"type":42,"tag":1468,"props":18929,"children":18930},{},[18931,18944],{"type":42,"tag":1472,"props":18932,"children":18933},{},[18934],{"type":42,"tag":18837,"props":18935,"children":18936},{},[18937,18940],{"type":42,"tag":1472,"props":18938,"children":18939},{},[],{"type":42,"tag":1476,"props":18941,"children":18942},{},[18943],{"type":47,"value":1480},{"type":42,"tag":2265,"props":18945,"children":18946},{"encoding":2267},[18947],{"type":47,"value":18851},{"type":42,"tag":809,"props":18949,"children":18951},{"className":18950,"ariaHidden":1484},[2274],[18952],{"type":42,"tag":809,"props":18953,"children":18955},{"className":18954},[2279],[18956,18960],{"type":42,"tag":809,"props":18957,"children":18959},{"className":18958,"style":18863},[2284],[],{"type":42,"tag":809,"props":18961,"children":18963},{"className":18962},[2290],[18964,18967],{"type":42,"tag":809,"props":18965,"children":18966},{},[],{"type":42,"tag":809,"props":18968,"children":18970},{"className":18969},[9598],[18971],{"type":42,"tag":809,"props":18972,"children":18974},{"className":18973},[9603],[18975],{"type":42,"tag":809,"props":18976,"children":18978},{"className":18977},[9609],[18979],{"type":42,"tag":809,"props":18980,"children":18982},{"className":18981,"style":18863},[9614],[18983],{"type":42,"tag":809,"props":18984,"children":18985},{"style":18890},[18986,18990],{"type":42,"tag":809,"props":18987,"children":18989},{"className":18988,"style":9625},[9624],[],{"type":42,"tag":809,"props":18991,"children":18993},{"className":18992},[9630,9631,9632,9633],[18994],{"type":42,"tag":809,"props":18995,"children":18997},{"className":18996},[2290,9633],[18998],{"type":42,"tag":809,"props":18999,"children":19001},{"className":19000},[2290,9633],[19002],{"type":47,"value":1480},{"type":47,"value":19004}," R datasets show that PR-A ",{"type":42,"tag":8789,"props":19006,"children":19007},{"xmlns:mml":1465,"xmlnsXLink":8791},[19008],{"type":42,"tag":8796,"props":19009,"children":19010},{"notation":8798},[19011],{"type":42,"tag":809,"props":19012,"children":19014},{"className":19013},[1455],[19015,19042],{"type":42,"tag":809,"props":19016,"children":19018},{"className":19017},[1460],[19019],{"type":42,"tag":1463,"props":19020,"children":19021},{"xmlns":1465},[19022],{"type":42,"tag":1468,"props":19023,"children":19024},{},[19025,19038],{"type":42,"tag":1472,"props":19026,"children":19027},{},[19028],{"type":42,"tag":18837,"props":19029,"children":19030},{},[19031,19034],{"type":42,"tag":1472,"props":19032,"children":19033},{},[],{"type":42,"tag":1476,"props":19035,"children":19036},{},[19037],{"type":47,"value":1480},{"type":42,"tag":2265,"props":19039,"children":19040},{"encoding":2267},[19041],{"type":47,"value":18851},{"type":42,"tag":809,"props":19043,"children":19045},{"className":19044,"ariaHidden":1484},[2274],[19046],{"type":42,"tag":809,"props":19047,"children":19049},{"className":19048},[2279],[19050,19054],{"type":42,"tag":809,"props":19051,"children":19053},{"className":19052,"style":18863},[2284],[],{"type":42,"tag":809,"props":19055,"children":19057},{"className":19056},[2290],[19058,19061],{"type":42,"tag":809,"props":19059,"children":19060},{},[],{"type":42,"tag":809,"props":19062,"children":19064},{"className":19063},[9598],[19065],{"type":42,"tag":809,"props":19066,"children":19068},{"className":19067},[9603],[19069],{"type":42,"tag":809,"props":19070,"children":19072},{"className":19071},[9609],[19073],{"type":42,"tag":809,"props":19074,"children":19076},{"className":19075,"style":18863},[9614],[19077],{"type":42,"tag":809,"props":19078,"children":19079},{"style":18890},[19080,19084],{"type":42,"tag":809,"props":19081,"children":19083},{"className":19082,"style":9625},[9624],[],{"type":42,"tag":809,"props":19085,"children":19087},{"className":19086},[9630,9631,9632,9633],[19088],{"type":42,"tag":809,"props":19089,"children":19091},{"className":19090},[2290,9633],[19092],{"type":42,"tag":809,"props":19093,"children":19095},{"className":19094},[2290,9633],[19096],{"type":47,"value":1480},{"type":47,"value":19098}," CL significantly outperforms state-of-the-art reasoning models.",{"title":8,"searchDepth":49,"depth":49,"links":19100},[],"content:publications:2026:predictive-reasoning-with-augmented-anomaly-contrastive-learning-for-composition.md","publications\u002F2026\u002Fpredictive-reasoning-with-augmented-anomaly-contrastive-learning-for-composition.md","publications\u002F2026\u002Fpredictive-reasoning-with-augmented-anomaly-contrastive-learning-for-composition",{"_path":19105,"_dir":18435,"_draft":7,"_partial":7,"_locale":8,"title":19106,"description":19107,"_hidden":7,"authors":19108,"authors_orcid":19112,"year":18448,"doi":19113,"openalex_id":19114,"venue":1055,"abstract_screenshot":21,"keywords":19115,"body":19117,"_type":51,"_id":19125,"_source":53,"_file":19126,"_stem":19127,"_extension":56,"locale":57},"\u002Fpublications\u002F2026\u002Fpreference-agile-multi-objective-optimization-for-real-time-vehicle-dispatching","Preference-agile multi-objective optimization for real-time vehicle dispatching","Multi-objective optimization (MOO) has been widely studied in literature because of its versatility in human-centered decision making in real-life applications. Recently, demand for dynamic MOO is fast-emerging due to tough market dynamics that require real-time re-adjustments of priorities for different objectives. However, most existing studies focus either on deterministic MOO problems which are not practical, or non-sequential dynamic MOO decision problems that cannot deal with some real-life complexities. To address these challenges, a preference-agile multi-objective optimization (PAMOO) is proposed in this paper to permit users to dynamically adjust and interactively assign the preferences on the fly. To achieve this, a novel uniform model within a deep reinforcement learning (DRL) framework is proposed that can take as inputs users’ dynamic preference vectors explicitly. Additionally, a calibration function is fitted to ensure high quality alignment between the preference vector inputs and the output DRL decision policy. Extensive experiments on challenging real-life vehicle dispatching problems at a container terminal showed that PAMOO obtains superior performance and generalization ability when compared with two most popular MOO methods. Our method presents the first dynamic MOO method for challenging dynamic sequential MOO decision problems. • An end-to-end Preference-Agile Multi-Objective Optimization (PAMOO) is proposed. • A novel network architecture is tailored with enhanced generalization. • The proposed method facilitates dynamic and interactive preference adjustment in an online setting. • The method marks the first Dynamic Multi-Objective Reinforcement Learning for port operations.",[7198,19109,319,6111,19110,19111,12],"Zhao, Wenhao","Chen, Xin’an","Zhang, Qingfu",[7202,21,21,6113,21,21,15],"https:\u002F\u002Fdoi.org\u002F10.1016\u002Fj.ejor.2026.04.017","W7154067878",[247,450,3201,19116,720],"Minification",{"type":39,"children":19118,"toc":19123},[19119],{"type":42,"tag":43,"props":19120,"children":19121},{},[19122],{"type":47,"value":19107},{"title":8,"searchDepth":49,"depth":49,"links":19124},[],"content:publications:2026:preference-agile-multi-objective-optimization-for-real-time-vehicle-dispatching.md","publications\u002F2026\u002Fpreference-agile-multi-objective-optimization-for-real-time-vehicle-dispatching.md","publications\u002F2026\u002Fpreference-agile-multi-objective-optimization-for-real-time-vehicle-dispatching",{"_path":19129,"_dir":18435,"_draft":7,"_partial":7,"_locale":8,"title":19130,"description":8,"_hidden":7,"Risk\" authors":19131,"authors_orcid":19135,"year":18448,"doi":19139,"openalex_id":19140,"venue":74,"abstract_screenshot":21,"keywords":19141,"body":19146,"_type":51,"_id":19150,"_source":53,"_file":19151,"_stem":19152,"_extension":56,"locale":57},"\u002Fpublications\u002F2026\u002Fpreventive-regulation-and-spillover-effects-evidence-from-stock-price-crash-risk","Preventive Regulation and Spillover Effects: Evidence from Stock Price Cras",[19132,19133,19134,268],"Huang, Henry He","Zhao, Gang","Yin, Hang",[19136,19137,19138,272],"0000-0001-8410-9457","0000-0003-1884-8432","0000-0002-3187-8874","https:\u002F\u002Fdoi.org\u002F10.2139\u002Fssrn.6550148","W7152626815",[19142,19143,19144,555,19145,3254,4858,5149],"Spillover effect","Accrual","Earnings","Earnings management",{"type":39,"children":19147,"toc":19148},[],{"title":8,"searchDepth":49,"depth":49,"links":19149},[],"content:publications:2026:preventive-regulation-and-spillover-effects-evidence-from-stock-price-crash-risk.md","publications\u002F2026\u002Fpreventive-regulation-and-spillover-effects-evidence-from-stock-price-crash-risk.md","publications\u002F2026\u002Fpreventive-regulation-and-spillover-effects-evidence-from-stock-price-crash-risk",{"_path":19154,"_dir":18435,"_draft":7,"_partial":7,"_locale":8,"title":19155,"description":19156,"_hidden":7,"on Orthogonal Bisections and Imaginary Offsets\" authors":19157,"authors_orcid":19158,"year":18448,"doi":19159,"openalex_id":19160,"venue":5074,"abstract_screenshot":21,"keywords":19161,"body":19163,"_type":51,"_id":19171,"_source":53,"_file":19172,"_stem":19173,"_extension":56,"locale":57},"\u002Fpublications\u002F2026\u002Fproximity-based-filtering-an-improved-adaptive-random-testing-approach-based-on","Proximity‐Based Filtering: An Improved Adaptive Random Testing Approach Base","Random testing (RT) is an essential software testing strategy that selects test cases based on a random distribution. Adaptive RT (ART) encompasses a group of test‐case selection\u002Fgeneration methods that, based on the insight that test cases that are widely spread are more prone to find nonpoint failure‐causing regions, attempts to improve on the failure‐finding ability of traditional RT. Two common approaches to implementing ART are distance‐based ART and partition‐based ART. A well‐studied distance‐based ART method is fixed size candidate set ART (FSCS‐ART), which has been found to have superior effectiveness to RT in terms of failure‐finding ability, but can incur high computational overheads. ART by bisection (ART‐B) is a partition‐based ART method that improves on the time efficiency of FSCS‐ART. A limitation of ART‐B, however, is its potential for selecting very close test cases, which reduces its failure‐finding effectiveness. Adoption of an orthogonal recursive bisection (ORB) strategy in a partition‐based ART method, ART by ORB (ART‐ORB) has shown improvements in both failure‐finding effectiveness and computational overheads; however, it also has the potential for selecting very close test cases. The present paper proposes ART‐ORB with imaginary offsets (ART‐ORBIO), an innovative ART method that combines the advantages of FSCS‐ART, ART‐B, and ART‐ORB. ART‐ORBIO applies a repeating input domain geometric bisection, integrated with a novel concept of imaginary offsets, to enhance the spread of test cases, and minimize the overheads of computation. Our empirical results show that ART‐ORBIO provides better failure‐finding effectiveness than RT and comparable effectiveness to FSCS‐ART. ART‐ORBIO also has significantly improved efficiency, although not comparable to ART‐ORB and is more useful particularly in input domains with larger dimensions.",[4113,648,595,5740,4114,5250],[4117,21,599,21,21,21],"https:\u002F\u002Fdoi.org\u002F10.1049\u002Fsfw2\u002F4814836","W7134212875",[1163,101,5746,658,5747,19162,139],"Bisection",{"type":39,"children":19164,"toc":19169},[19165],{"type":42,"tag":43,"props":19166,"children":19167},{},[19168],{"type":47,"value":19156},{"title":8,"searchDepth":49,"depth":49,"links":19170},[],"content:publications:2026:proximity-based-filtering-an-improved-adaptive-random-testing-approach-based-on.md","publications\u002F2026\u002Fproximity-based-filtering-an-improved-adaptive-random-testing-approach-based-on.md","publications\u002F2026\u002Fproximity-based-filtering-an-improved-adaptive-random-testing-approach-based-on",{"_path":19175,"_dir":18435,"_draft":7,"_partial":7,"_locale":8,"title":19176,"description":19177,"_hidden":7,"authors":19178,"authors_orcid":19181,"year":18448,"doi":19183,"openalex_id":19184,"venue":9025,"abstract_screenshot":21,"keywords":19185,"body":19187,"_type":51,"_id":19580,"_source":53,"_file":19581,"_stem":19582,"_extension":56,"locale":57},"\u002Fpublications\u002F2026\u002Franking-based-self-supervised-representation-learning-for-skeleton-based-action","Ranking-Based Self-Supervised Representation Learning for Skeleton-Based Action Recognition","Recently, researchers have achieved significant results in the skeleton-based action recognition. To better model the skeleton sequences, we drive the encoder to learn more discriminative representations in the self-supervised setting. We find that instead of clustering feature vectors to assign pseudo labels for samples as in DeepCluster, ranking them is a more reasonable, reliable, and efficient way to learn more effective feature representations. With this intuition, we propose a novel self-supervised learning framework, DeepRank. Specifically, we rank triplets of skeleton sequences with the ranking labels, obtained from the relative distances among them. Besides, to deeply mine complementary discriminative information that exists in different modalities of skeleton sequences, we further propose Multi-View DeepRank (MV-DeepRank) to enable encoders to comprehensively learn complementary features from multiple modalities. Extensive experimental results on the NTU RGB+D, NTU RGB+D 120, PKU-MMD I, and PKU-MMD II datasets under various evaluation settings demonstrate the generality, transferability, and superiority of our proposed self-supervised learning frameworks. Notably, our frameworks surpass the previous methods that employ the same backbone networks as ours by at least 1.8% (ST-GCN) and 2.1% (STTFormer) under the finetuning setting. Additionally, DeepRank gains a significant advantage on computational complexities, O(1)O(1)O(1), over the contrastive learning-based methods, O(batchsize)O(\\rm{batch size})O(batchsize), and the clustering-based methods, O(numberofclusters)O(\\rm{number of clusters})O(numberofclusters).",[16651,19179,16652,19180,6111,12,319,12146],"Chen, Junliang","Li, Qiufu",[19182,21,16656,21,21,15,322,21],"0000-0002-6783-6561","https:\u002F\u002Fdoi.org\u002F10.1109\u002Ftmm.2026.3654466","W7124454052",[10551,13578,210,19186,6875,99,18170,3441,4876],"Learning to rank",{"type":39,"children":19188,"toc":19578},[19189],{"type":42,"tag":43,"props":19190,"children":19191},{},[19192,19194],{"type":47,"value":19193},"Recently, researchers have achieved significant results in the skeleton-based action recognition. To better model the skeleton sequences, we drive the encoder to learn more discriminative representations in the self-supervised setting. We find that instead of clustering feature vectors to assign pseudo labels for samples as in DeepCluster, ranking them is a more reasonable, reliable, and efficient way to learn more effective feature representations. With this intuition, we propose a novel self-supervised learning framework, ",{"type":42,"tag":19195,"props":19196,"children":19197},"bold",{"xmlns:mml":1465,"xmlnsXLink":8791},[19198,19200],{"type":47,"value":19199},"DeepRank. Specifically, we rank triplets of skeleton sequences with the ranking labels, obtained from the relative distances among them. Besides, to deeply mine complementary discriminative information that exists in different modalities of skeleton sequences, we further propose ",{"type":42,"tag":19195,"props":19201,"children":19202},{"xmlns:mml":1465,"xmlnsXLink":8791},[19203,19205],{"type":47,"value":19204},"Multi-",{"type":42,"tag":19195,"props":19206,"children":19207},{"xmlns:mml":1465,"xmlnsXLink":8791},[19208,19210],{"type":47,"value":19209},"View ",{"type":42,"tag":19195,"props":19211,"children":19212},{"xmlns:mml":1465,"xmlnsXLink":8791},[19213,19215],{"type":47,"value":19214},"DeepRank (",{"type":42,"tag":19195,"props":19216,"children":19217},{"xmlns:mml":1465,"xmlnsXLink":8791},[19218,19220,19297,19299,19424,19426,19577],{"type":47,"value":19219},"MV-DeepRank) to enable encoders to comprehensively learn complementary features from multiple modalities. Extensive experimental results on the NTU RGB+D, NTU RGB+D 120, PKU-MMD I, and PKU-MMD II datasets under various evaluation settings demonstrate the generality, transferability, and superiority of our proposed self-supervised learning frameworks. Notably, our frameworks surpass the previous methods that employ the same backbone networks as ours by at least 1.8% (ST-GCN) and 2.1% (STTFormer) under the finetuning setting. Additionally, DeepRank gains a significant advantage on computational complexities, ",{"type":42,"tag":8789,"props":19221,"children":19222},{"xmlns:mml":1465,"xmlnsXLink":8791},[19223],{"type":42,"tag":8796,"props":19224,"children":19225},{"notation":8798},[19226],{"type":42,"tag":809,"props":19227,"children":19229},{"className":19228},[1455],[19230,19265],{"type":42,"tag":809,"props":19231,"children":19233},{"className":19232},[1460],[19234],{"type":42,"tag":1463,"props":19235,"children":19236},{"xmlns":1465},[19237],{"type":42,"tag":1468,"props":19238,"children":19239},{},[19240,19260],{"type":42,"tag":1472,"props":19241,"children":19242},{},[19243,19248,19252,19256],{"type":42,"tag":1494,"props":19244,"children":19245},{},[19246],{"type":47,"value":19247},"O",{"type":42,"tag":1482,"props":19249,"children":19250},{"stretchy":1598},[19251],{"type":47,"value":1601},{"type":42,"tag":1476,"props":19253,"children":19254},{},[19255],{"type":47,"value":11667},{"type":42,"tag":1482,"props":19257,"children":19258},{"stretchy":1598},[19259],{"type":47,"value":1639},{"type":42,"tag":2265,"props":19261,"children":19262},{"encoding":2267},[19263],{"type":47,"value":19264},"O(1)",{"type":42,"tag":809,"props":19266,"children":19268},{"className":19267,"ariaHidden":1484},[2274],[19269],{"type":42,"tag":809,"props":19270,"children":19272},{"className":19271},[2279],[19273,19277,19282,19287,19292],{"type":42,"tag":809,"props":19274,"children":19276},{"className":19275,"style":2285},[2284],[],{"type":42,"tag":809,"props":19278,"children":19280},{"className":19279,"style":2352},[2290,2313],[19281],{"type":47,"value":19247},{"type":42,"tag":809,"props":19283,"children":19285},{"className":19284},[2416],[19286],{"type":47,"value":1601},{"type":42,"tag":809,"props":19288,"children":19290},{"className":19289},[2290],[19291],{"type":47,"value":11667},{"type":42,"tag":809,"props":19293,"children":19295},{"className":19294},[2467],[19296],{"type":47,"value":1639},{"type":47,"value":19298},", over the contrastive learning-based methods, ",{"type":42,"tag":8789,"props":19300,"children":19301},{"xmlns:mml":1465,"xmlnsXLink":8791},[19302],{"type":42,"tag":8796,"props":19303,"children":19304},{"notation":8798},[19305],{"type":42,"tag":809,"props":19306,"children":19308},{"className":19307},[1455],[19309,19382],{"type":42,"tag":809,"props":19310,"children":19312},{"className":19311},[1460],[19313],{"type":42,"tag":1463,"props":19314,"children":19315},{"xmlns":1465},[19316],{"type":42,"tag":1468,"props":19317,"children":19318},{},[19319,19377],{"type":42,"tag":1472,"props":19320,"children":19321},{},[19322,19326,19330],{"type":42,"tag":1494,"props":19323,"children":19324},{},[19325],{"type":47,"value":19247},{"type":42,"tag":1482,"props":19327,"children":19328},{"stretchy":1598},[19329],{"type":47,"value":1601},{"type":42,"tag":1472,"props":19331,"children":19332},{},[19333,19373],{"type":42,"tag":1472,"props":19334,"children":19335},{},[19336,19340,19344,19348,19352,19356,19360,19364,19369],{"type":42,"tag":1494,"props":19337,"children":19338},{"mathvariant":1642},[19339],{"type":47,"value":1498},{"type":42,"tag":1494,"props":19341,"children":19342},{"mathvariant":1642},[19343],{"type":47,"value":1574},{"type":42,"tag":1494,"props":19345,"children":19346},{"mathvariant":1642},[19347],{"type":47,"value":1545},{"type":42,"tag":1494,"props":19349,"children":19350},{"mathvariant":1642},[19351],{"type":47,"value":1830},{"type":42,"tag":1494,"props":19353,"children":19354},{"mathvariant":1642},[19355],{"type":47,"value":1550},{"type":42,"tag":1494,"props":19357,"children":19358},{"mathvariant":1642},[19359],{"type":47,"value":1583},{"type":42,"tag":1494,"props":19361,"children":19362},{"mathvariant":1642},[19363],{"type":47,"value":1503},{"type":42,"tag":1494,"props":19365,"children":19366},{"mathvariant":1642},[19367],{"type":47,"value":19368},"z",{"type":42,"tag":1494,"props":19370,"children":19371},{"mathvariant":1642},[19372],{"type":47,"value":1569},{"type":42,"tag":1482,"props":19374,"children":19375},{"stretchy":1598},[19376],{"type":47,"value":1639},{"type":42,"tag":2265,"props":19378,"children":19379},{"encoding":2267},[19380],{"type":47,"value":19381},"O(\\rm{batch size})",{"type":42,"tag":809,"props":19383,"children":19385},{"className":19384,"ariaHidden":1484},[2274],[19386],{"type":42,"tag":809,"props":19387,"children":19389},{"className":19388},[2279],[19390,19394,19399,19404],{"type":42,"tag":809,"props":19391,"children":19393},{"className":19392,"style":2285},[2284],[],{"type":42,"tag":809,"props":19395,"children":19397},{"className":19396,"style":2352},[2290,2313],[19398],{"type":47,"value":19247},{"type":42,"tag":809,"props":19400,"children":19402},{"className":19401},[2416],[19403],{"type":47,"value":1601},{"type":42,"tag":809,"props":19405,"children":19407},{"className":19406},[2290],[19408,19419],{"type":42,"tag":809,"props":19409,"children":19411},{"className":19410},[2290],[19412],{"type":42,"tag":809,"props":19413,"children":19416},{"className":19414},[2290,19415],"mathrm",[19417],{"type":47,"value":19418},"batchsize",{"type":42,"tag":809,"props":19420,"children":19422},{"className":19421},[2467],[19423],{"type":47,"value":1639},{"type":47,"value":19425},", and the clustering-based methods, ",{"type":42,"tag":8789,"props":19427,"children":19428},{"xmlns:mml":1465,"xmlnsXLink":8791},[19429],{"type":42,"tag":8796,"props":19430,"children":19431},{"notation":8798},[19432],{"type":42,"tag":809,"props":19433,"children":19435},{"className":19434},[1455],[19436,19536],{"type":42,"tag":809,"props":19437,"children":19439},{"className":19438},[1460],[19440],{"type":42,"tag":1463,"props":19441,"children":19442},{"xmlns":1465},[19443],{"type":42,"tag":1468,"props":19444,"children":19445},{},[19446,19531],{"type":42,"tag":1472,"props":19447,"children":19448},{},[19449,19453,19457],{"type":42,"tag":1494,"props":19450,"children":19451},{},[19452],{"type":47,"value":19247},{"type":42,"tag":1482,"props":19454,"children":19455},{"stretchy":1598},[19456],{"type":47,"value":1601},{"type":42,"tag":1472,"props":19458,"children":19459},{},[19460,19527],{"type":42,"tag":1472,"props":19461,"children":19462},{},[19463,19467,19471,19475,19479,19483,19487,19491,19495,19499,19503,19507,19511,19515,19519,19523],{"type":42,"tag":1494,"props":19464,"children":19465},{"mathvariant":1642},[19466],{"type":47,"value":1526},{"type":42,"tag":1494,"props":19468,"children":19469},{"mathvariant":1642},[19470],{"type":47,"value":2227},{"type":42,"tag":1494,"props":19472,"children":19473},{"mathvariant":1642},[19474],{"type":47,"value":1813},{"type":42,"tag":1494,"props":19476,"children":19477},{"mathvariant":1642},[19478],{"type":47,"value":1498},{"type":42,"tag":1494,"props":19480,"children":19481},{"mathvariant":1642},[19482],{"type":47,"value":1569},{"type":42,"tag":1494,"props":19484,"children":19485},{"mathvariant":1642},[19486],{"type":47,"value":1540},{"type":42,"tag":1494,"props":19488,"children":19489},{"mathvariant":1642},[19490],{"type":47,"value":1521},{"type":42,"tag":1494,"props":19492,"children":19493},{"mathvariant":1642},[19494],{"type":47,"value":1559},{"type":42,"tag":1494,"props":19496,"children":19497},{"mathvariant":1642},[19498],{"type":47,"value":1830},{"type":42,"tag":1494,"props":19500,"children":19501},{"mathvariant":1642},[19502],{"type":47,"value":1508},{"type":42,"tag":1494,"props":19504,"children":19505},{"mathvariant":1642},[19506],{"type":47,"value":2227},{"type":42,"tag":1494,"props":19508,"children":19509},{"mathvariant":1642},[19510],{"type":47,"value":1583},{"type":42,"tag":1494,"props":19512,"children":19513},{"mathvariant":1642},[19514],{"type":47,"value":1545},{"type":42,"tag":1494,"props":19516,"children":19517},{"mathvariant":1642},[19518],{"type":47,"value":1569},{"type":42,"tag":1494,"props":19520,"children":19521},{"mathvariant":1642},[19522],{"type":47,"value":1540},{"type":42,"tag":1494,"props":19524,"children":19525},{"mathvariant":1642},[19526],{"type":47,"value":1583},{"type":42,"tag":1482,"props":19528,"children":19529},{"stretchy":1598},[19530],{"type":47,"value":1639},{"type":42,"tag":2265,"props":19532,"children":19533},{"encoding":2267},[19534],{"type":47,"value":19535},"O(\\rm{number of clusters})",{"type":42,"tag":809,"props":19537,"children":19539},{"className":19538,"ariaHidden":1484},[2274],[19540],{"type":42,"tag":809,"props":19541,"children":19543},{"className":19542},[2279],[19544,19548,19553,19558],{"type":42,"tag":809,"props":19545,"children":19547},{"className":19546,"style":2285},[2284],[],{"type":42,"tag":809,"props":19549,"children":19551},{"className":19550,"style":2352},[2290,2313],[19552],{"type":47,"value":19247},{"type":42,"tag":809,"props":19554,"children":19556},{"className":19555},[2416],[19557],{"type":47,"value":1601},{"type":42,"tag":809,"props":19559,"children":19561},{"className":19560},[2290],[19562,19572],{"type":42,"tag":809,"props":19563,"children":19565},{"className":19564},[2290],[19566],{"type":42,"tag":809,"props":19567,"children":19569},{"className":19568},[2290,19415],[19570],{"type":47,"value":19571},"numberofclusters",{"type":42,"tag":809,"props":19573,"children":19575},{"className":19574},[2467],[19576],{"type":47,"value":1639},{"type":47,"value":1645},{"title":8,"searchDepth":49,"depth":49,"links":19579},[],"content:publications:2026:ranking-based-self-supervised-representation-learning-for-skeleton-based-action.md","publications\u002F2026\u002Franking-based-self-supervised-representation-learning-for-skeleton-based-action.md","publications\u002F2026\u002Franking-based-self-supervised-representation-learning-for-skeleton-based-action",{"_path":19584,"_dir":18435,"_draft":7,"_partial":7,"_locale":8,"title":19585,"description":8,"_hidden":7,"diversification in China authors":19586,"authors_orcid":19590,"year":18448,"doi":19594,"openalex_id":19595,"venue":19596,"abstract_screenshot":21,"keywords":19597,"body":19600,"_type":51,"_id":19604,"_source":53,"_file":19605,"_stem":19606,"_extension":56,"locale":57},"\u002Fpublications\u002F2026\u002Fregional-patterns-and-drivers-of-green-digital-and-twin-technological-diversific","Regional patterns and drivers of green, digital and twin technological",[19587,19588,19589,268],"Yu, Xiaodan","Li, Hui","Grabner, Simone M.",[19591,19592,19593,272],"0000-0002-1629-976X","0000-0001-9198-3951","0000-0001-5278-8301","https:\u002F\u002Fdoi.org\u002F10.1080\u002F00343404.2026.2650680","W7160616443","Regional Studies",[556,282,19598,19599],"Regional studies","Regional development",{"type":39,"children":19601,"toc":19602},[],{"title":8,"searchDepth":49,"depth":49,"links":19603},[],"content:publications:2026:regional-patterns-and-drivers-of-green-digital-and-twin-technological-diversific.md","publications\u002F2026\u002Fregional-patterns-and-drivers-of-green-digital-and-twin-technological-diversific.md","publications\u002F2026\u002Fregional-patterns-and-drivers-of-green-digital-and-twin-technological-diversific",{"_path":19608,"_dir":18435,"_draft":7,"_partial":7,"_locale":8,"title":19609,"description":8,"_hidden":7,"authors":19610,"authors_orcid":19612,"year":18448,"doi":19613,"openalex_id":19614,"venue":11757,"abstract_screenshot":21,"keywords":19615,"body":19617,"_type":51,"_id":19621,"_source":53,"_file":19622,"_stem":19623,"_extension":56,"locale":57},"\u002Fpublications\u002F2026\u002Fs-sup3-sup-dl-sample-aggregated-structured-supervised-dictionary-learning","S \u003Csup>3\u003C\u002Fsup> DL: Sample-Aggregated Structured Supervised Dictionary Learning",[12145,19611,6111,12146,15874,12],"Peng, Yucheng",[21,21,6113,12148,15877,15],"https:\u002F\u002Fdoi.org\u002F10.1109\u002Flsp.2026.3704064","W7164884300",[19616,4876,7391,12288,6875],"Dictionary learning",{"type":39,"children":19618,"toc":19619},[],{"title":8,"searchDepth":49,"depth":49,"links":19620},[],"content:publications:2026:s-sup3-sup-dl-sample-aggregated-structured-supervised-dictionary-learning.md","publications\u002F2026\u002Fs-sup3-sup-dl-sample-aggregated-structured-supervised-dictionary-learning.md","publications\u002F2026\u002Fs-sup3-sup-dl-sample-aggregated-structured-supervised-dictionary-learning",{"_path":19625,"_dir":18435,"_draft":7,"_partial":7,"_locale":8,"title":19626,"description":8,"_hidden":7,"authors":19627,"authors_orcid":19632,"year":18448,"doi":19634,"openalex_id":19635,"venue":687,"abstract_screenshot":21,"keywords":19636,"body":19640,"_type":51,"_id":19644,"_source":53,"_file":19645,"_stem":19646,"_extension":56,"locale":57},"\u002Fpublications\u002F2026\u002Fscheduling-heuristic-learning-via-genetic-programming-for-dynamic-flexible-job-s","Scheduling Heuristic Learning via Genetic Programming for Dynamic Flexible Job Shop Scheduling with Heterogeneous Batch Arrivals",[19628,19629,19630,19631,12],"Zhu, Luyao","Zhang, Fangfang","Mei, Yi","Zhang, Mengjie",[19633,21,21,21,15],"0009-0006-0584-4183","https:\u002F\u002Fdoi.org\u002F10.1007\u002F978-981-95-7081-2_49","W7130957140",[506,3201,450,13688,19637,19638,250,19639],"Job shop","Job scheduler","Flow shop scheduling",{"type":39,"children":19641,"toc":19642},[],{"title":8,"searchDepth":49,"depth":49,"links":19643},[],"content:publications:2026:scheduling-heuristic-learning-via-genetic-programming-for-dynamic-flexible-job-s.md","publications\u002F2026\u002Fscheduling-heuristic-learning-via-genetic-programming-for-dynamic-flexible-job-s.md","publications\u002F2026\u002Fscheduling-heuristic-learning-via-genetic-programming-for-dynamic-flexible-job-s",{"_path":19648,"_dir":18435,"_draft":7,"_partial":7,"_locale":8,"title":19649,"description":19650,"_hidden":7,"authors":19651,"authors_orcid":19652,"year":18448,"doi":19653,"openalex_id":19654,"venue":3384,"abstract_screenshot":21,"keywords":19655,"body":19656,"_type":51,"_id":19671,"_source":53,"_file":19672,"_stem":19673,"_extension":56,"locale":57},"\u002Fpublications\u002F2026\u002Fsensors-fusion-in-digital-healthcare-applications","Sensors Fusion in Digital Healthcare Applications","Sensors constitute a fundamental element of modern digital healthcare, acting as the primary interface for capturing physiological, environmental, and biomechanical data from patients and clinical settings ....",[5667],[5670],"https:\u002F\u002Fdoi.org\u002F10.3390\u002Fs26061870","W7137197006",[6977,864,9189,6319,5896,3470],{"type":39,"children":19657,"toc":19669},[19658],{"type":42,"tag":43,"props":19659,"children":19660},{},[19661,19663,19668],{"type":47,"value":19662},"Sensors constitute a fundamental element of modern digital healthcare, acting as the primary interface for capturing physiological, environmental, and biomechanical data from patients and clinical settings ",{"type":42,"tag":809,"props":19664,"children":19665},{},[19666],{"type":47,"value":19667},"...",{"type":47,"value":1645},{"title":8,"searchDepth":49,"depth":49,"links":19670},[],"content:publications:2026:sensors-fusion-in-digital-healthcare-applications.md","publications\u002F2026\u002Fsensors-fusion-in-digital-healthcare-applications.md","publications\u002F2026\u002Fsensors-fusion-in-digital-healthcare-applications",{"_path":19675,"_dir":18435,"_draft":7,"_partial":7,"_locale":8,"title":19676,"description":8,"_hidden":7,"diffusion authors":19677,"authors_orcid":19680,"year":18448,"doi":19682,"openalex_id":19683,"venue":326,"abstract_screenshot":21,"keywords":19684,"body":19688,"_type":51,"_id":19692,"_source":53,"_file":19693,"_stem":19694,"_extension":56,"locale":57},"\u002Fpublications\u002F2026\u002Fshort-term-electricity-load-forecasting-with-multi-frequency-reconstruction-diff","Short-term electricity load forecasting with multi-frequency reconstruction",[19678,645,12876,595,17789,19679],"Dong, Qi","Wang, Jianzhou",[19681,21,21,599,21,21],"0009-0008-1737-9324","https:\u002F\u002Fdoi.org\u002F10.1016\u002Fj.ins.2026.123331","W7133325328",[4093,19685,6144,11359,10865,19686,12518,99,19687],"Mean absolute percentage error","Operator (biology)","Approximation error",{"type":39,"children":19689,"toc":19690},[],{"title":8,"searchDepth":49,"depth":49,"links":19691},[],"content:publications:2026:short-term-electricity-load-forecasting-with-multi-frequency-reconstruction-diff.md","publications\u002F2026\u002Fshort-term-electricity-load-forecasting-with-multi-frequency-reconstruction-diff.md","publications\u002F2026\u002Fshort-term-electricity-load-forecasting-with-multi-frequency-reconstruction-diff",{"_path":19696,"_dir":18435,"_draft":7,"_partial":7,"_locale":8,"title":19697,"description":19698,"_hidden":7,"Segmentation\" authors":19699,"authors_orcid":19703,"year":18448,"doi":19706,"openalex_id":19707,"venue":21,"abstract_screenshot":19708,"keywords":19709,"body":19711,"_type":51,"_id":19727,"_source":53,"_file":19728,"_stem":19729,"_extension":56,"locale":57},"\u002Fpublications\u002F2026\u002Ftm-unet-token-memory-enhanced-sequential-modeling-for-efficient-medical-image-se","TM-UNet: Token-Memory Enhanced Sequential Modeling for Efficient Medical Imag","Medical image segmentation is essential for clinical diagnosis and treatment planning. Although transformer-based methods have achieved remarkable results, their high computational cost hinders clinical deployment. To address this issue, we propose TM-UNet, a novel lightweight framework that integrates token sequence modeling with an efficient memory mechanism for efficient medical segmentation. Specifically, we introduce a multi-scale token-memory (MSTM) block that transforms 2D spatial features into token sequences through strategic spatial scanning, leveraging matrix memory cells to selectively retain and propagate discriminative contextual information across tokens. This novel token-memory mechanism acts as a dynamic knowledge store that captures longrange dependencies with linear complexity, enabling efficient global reasoning without redundant computation. Our MSTM block further incorporates exponential gating to identify token effectiveness and multi-scale contextual extraction via parallel pooling operations, enabling hierarchical representation learning without computational overhead. Extensive experiments demonstrate that TM-UNet outperforms state-of-theart methods across diverse medical segmentation tasks with substantially reduced computation cost. The code is available at https:\u002F\u002Fgithub.com\u002Fxq141839\u002FTM-UNet.",[19700,15898,19701,8931,19702,16083],"Jiao, Yaxuan","Luo, Yuxiang","Chen, Zhe",[21,21,19704,8937,19705,16090],"0000-0002-9410-5553","0000-0002-2919-4481","https:\u002F\u002Fdoi.org\u002F10.1109\u002Fisbi61048.2026.11515341","W4416354590","tm-unet-token-memory-enhanced-sequential-modeling-for-efficient-medical-image-se.png",[19710,7930,9090,10551,5470,480,99,4876,6876],"Pooling",{"type":39,"children":19712,"toc":19725},[19713],{"type":42,"tag":43,"props":19714,"children":19715},{},[19716,19718,19724],{"type":47,"value":19717},"Medical image segmentation is essential for clinical diagnosis and treatment planning. Although transformer-based methods have achieved remarkable results, their high computational cost hinders clinical deployment. To address this issue, we propose TM-UNet, a novel lightweight framework that integrates token sequence modeling with an efficient memory mechanism for efficient medical segmentation. Specifically, we introduce a multi-scale token-memory (MSTM) block that transforms 2D spatial features into token sequences through strategic spatial scanning, leveraging matrix memory cells to selectively retain and propagate discriminative contextual information across tokens. This novel token-memory mechanism acts as a dynamic knowledge store that captures longrange dependencies with linear complexity, enabling efficient global reasoning without redundant computation. Our MSTM block further incorporates exponential gating to identify token effectiveness and multi-scale contextual extraction via parallel pooling operations, enabling hierarchical representation learning without computational overhead. Extensive experiments demonstrate that TM-UNet outperforms state-of-theart methods across diverse medical segmentation tasks with substantially reduced computation cost. The code is available at ",{"type":42,"tag":1574,"props":19719,"children":19722},{"href":19720,"rel":19721},"https:\u002F\u002Fgithub.com\u002Fxq141839\u002FTM-UNet",[4520],[19723],{"type":47,"value":19720},{"type":47,"value":1645},{"title":8,"searchDepth":49,"depth":49,"links":19726},[],"content:publications:2026:tm-unet-token-memory-enhanced-sequential-modeling-for-efficient-medical-image-se.md","publications\u002F2026\u002Ftm-unet-token-memory-enhanced-sequential-modeling-for-efficient-medical-image-se.md","publications\u002F2026\u002Ftm-unet-token-memory-enhanced-sequential-modeling-for-efficient-medical-image-se",{"_path":19731,"_dir":18435,"_draft":7,"_partial":7,"_locale":8,"title":19732,"description":19733,"_hidden":7,"Segmentation\" authors":19734,"authors_orcid":19738,"year":18448,"doi":19744,"openalex_id":19745,"venue":9025,"abstract_screenshot":19746,"keywords":19747,"body":19750,"_type":51,"_id":19770,"_source":53,"_file":19771,"_stem":19772,"_extension":56,"locale":57},"\u002Fpublications\u002F2026\u002Funiultra-interactive-parameter-efficient-sam2-for-universal-ultrasound-segmentat","UniUltra: Interactive Parameter-Efficient SAM2 for Universal Ultrasoun","The Segment Anything Model 2 (SAM2) demonstrates remarkable universal segmentation capabilities on natural images. However, its performance on ultrasound images is significantly degraded due to domain disparities. This limitation raises two critical challenges: how to efficiently adapt SAM2 to ultrasound imaging while maintaining parameter efficiency, and how to deploy the adapted model effectively in resource-constrained clinical environments. To address these issues, we propose UniUltra for universal ultrasound segmentation. Specifically, we first introduce a novel context-edge hybrid adapter (CH-Adapter) that enhances fine-grained perception across diverse ultrasound imaging modalities while achieving parameter-efficient fine-tuning. To further improve clinical applicability, we develop a deep-supervised knowledge distillation (DSKD) technique that transfers knowledge from the large image encoder of the fine-tuned SAM2 to a super lightweight encoder, substantially reducing computational requirements without compromising performance. Extensive experiments demonstrate that UniUltra outperforms state-of-the-arts with superior generalization capabilities. Notably, our framework achieves competitive performance using only 8.91% of SAM2's parameters during fine-tuning, and the final compressed model reduces the parameter count by 94.08% compared to the original SAM2, making it highly suitable for practical clinical deployment. The source code is available at https:\u002F\u002Fgithub.com\u002Fxq141839\u002FUniUltra.",[13450,19735,17347,19736,10031,9416,19737,15874,12170,16084,16085],"Xu, Qingsong","He, Xueqiu","Tesem, Fiseha B.",[13459,19739,19740,19741,19742,9422,21,15877,12175,19743,21],"0000-0002-1700-322X","0000-0002-1924-9848","0000-0003-2760-582X","0000-0001-6074-2354","0000-0002-3263-3043","https:\u002F\u002Fdoi.org\u002F10.1109\u002Ftmm.2026.3687007","W4416551711","uniultra-interactive-parameter-efficient-sam2-for-universal-ultrasound-segmentat.png",[9090,9058,19748,6144,4876,19749,1167],"Ultrasound","Ultrasound imaging",{"type":39,"children":19751,"toc":19768},[19752],{"type":42,"tag":43,"props":19753,"children":19754},{},[19755,19757,19767],{"type":47,"value":19756},"The Segment Anything Model 2 (SAM2) demonstrates remarkable universal segmentation capabilities on natural images. However, its performance on ultrasound images is significantly degraded due to domain disparities. This limitation raises two critical challenges: how to efficiently adapt SAM2 to ultrasound imaging while maintaining parameter efficiency, and how to deploy the adapted model effectively in resource-constrained clinical environments. To address these issues, we propose UniUltra for universal ultrasound segmentation. Specifically, we first introduce a novel context-edge hybrid adapter (CH-Adapter) that enhances fine-grained perception across diverse ultrasound imaging modalities while achieving parameter-efficient fine-tuning. To further improve clinical applicability, we develop a deep-supervised knowledge distillation (DSKD) technique that transfers knowledge from the large image encoder of the fine-tuned SAM2 to a super lightweight encoder, substantially reducing computational requirements without compromising performance. Extensive experiments demonstrate that UniUltra outperforms state-of-the-arts with superior generalization capabilities. Notably, our framework achieves competitive performance using only 8.91% of SAM2's parameters during fine-tuning, and the final compressed model reduces the parameter count by 94.08% compared to the original SAM2, making it highly suitable for practical clinical deployment. The source code is available at ",{"type":42,"tag":19758,"props":19759,"children":19760},"uri",{"xmlns:mml":1465,"xmlnsXLink":8791},[19761],{"type":42,"tag":1574,"props":19762,"children":19765},{"href":19763,"rel":19764},"https:\u002F\u002Fgithub.com\u002Fxq141839\u002FUniUltra",[4520],[19766],{"type":47,"value":19763},{"type":47,"value":1645},{"title":8,"searchDepth":49,"depth":49,"links":19769},[],"content:publications:2026:uniultra-interactive-parameter-efficient-sam2-for-universal-ultrasound-segmentat.md","publications\u002F2026\u002Funiultra-interactive-parameter-efficient-sam2-for-universal-ultrasound-segmentat.md","publications\u002F2026\u002Funiultra-interactive-parameter-efficient-sam2-for-universal-ultrasound-segmentat",1782639404248]