[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"_public_publisher_byId_eff147ed-7ecc-4193-b911-5b562b6351f9":3,"_public_publisher_all{\"sortAscending\":false,\"sortField\":\"updateTime\",\"page\":0,\"size\":10,\"facet\":true,\"searchKey\":\"\"}":38,"_public_publication_all{\"sortAscending\":false,\"sortField\":\"totalCitation\",\"page\":0,\"size\":10,\"facet\":true,\"searchKey\":\"publisherId:eff147ed-7ecc-4193-b911-5b562b6351f9,\"}":892},{"code":4,"data":5,"meta":18},"SUCCESS",{"id":6,"createTime":7,"updateTime":8,"relativeEntities":9,"slug":10,"properties":11,"entityType":16,"verifyStatus":17,"verifyTime":18,"verifyNote":18,"languages":18,"translateLanguages":18,"viewCount":19,"subjectFields":20,"manageAffiliations":21,"indexDatabases":22,"url":18,"thumbnailPath":18,"statistic":18,"gsStatistic":18,"type":18,"analyzePriority":18},"eff147ed-7ecc-4193-b911-5b562b6351f9","2024-09-01T08:10:40.735+00:00","2025-11-21T09:59:25.840+00:00",[],"Association-for-Computing-Machinery-ACM-",{"issn":12,"title":14},{"VOID":13},"0097-8930",{"EN":15},"Association for Computing Machinery (ACM)","PUBLISHER","PENDING",null,0,[],[],[23],{"id":24,"indexDatabase":25,"url":35,"indexYears":36,"academicFieldIds":18,"indexDatabaseRanking":37},"d75aa84c-f0c6-4ac5-b959-8ecb58980758",{"id":26,"createTime":18,"updateTime":18,"relativeEntities":27,"label":28,"description":30,"key":32,"publicationTags":33,"standard":18},"3c7051d4-eb7d-4c57-a56b-36fc74c5d1e9",[],{"EN":29,"VI":29},"Scopus - Elsevier",{"EN":29,"VI":31},"Cơ sở dữ liệu Scopus thuộc Elsevier","scopus",[34],"SCOPUS","https:\u002F\u002Fwww.scopus.com\u002Fsourceid\u002F34597","1978-1988,1990,1992-2011","SCOPUS__Q4",{"meta":39,"data":41},{"total":40},"117",[42,88,278,327,411,506,567,678,742,776],{"id":43,"createTime":44,"updateTime":45,"relativeEntities":46,"slug":47,"properties":48,"entityType":16,"verifyStatus":60,"verifyTime":61,"verifyNote":18,"languages":62,"translateLanguages":18,"viewCount":19,"subjectFields":65,"manageAffiliations":66,"indexDatabases":67,"url":68,"thumbnailPath":18,"statistic":18,"gsStatistic":69,"type":87,"analyzePriority":18},"f8d0bf97-8d89-482e-b58c-2fc481a0b79b","2025-10-27T06:27:08.591+00:00","2026-08-27T01:57:29.562+00:00",[],"T%E1%BA%A1p-ch%C3%AD-Khoa-h%E1%BB%8Dc-v%C3%A0-C%C3%B4ng-ngh%E1%BB%87-nhi%E1%BB%87t-%C4%91%E1%BB%9Bi",{"country":49,"issn":51,"title":53,"introduce":56,"gsId":58},{"VOID":50},"VN",{"VOID":52},"08667535",{"EN":54,"VI":55},"Journal of Tropical Science and Engineering","Tạp chí Khoa học và Công nghệ nhiệt đới",{"EN":57},"\u003Cp style=\"text-align:justify;\">&nbsp; &nbsp; &nbsp;Journal of Tropical Science and Engineering (JTSE) is a multidisciplinary scientific journal, licensed to operate as a print journal in 2012 and an electronic journal in 2024 (License No.1479\u002FGP-BTTTT dated August 20, 2012 and No.91\u002FGP-BTTTT dated April 9, 2024 issued by the Ministry of Information and Communications of Vietnam). The JTSE is headquartered in Hanoi.\u003C\u002Fp>\u003Cp style=\"text-align:justify;\">&nbsp; &nbsp; &nbsp; &nbsp; The JTSE is published every 3 months (4 issues\u002Fyear), publishing research results and overview articles in 3 groups of fields: Tropical Ecology and Environment; Chemistry and Material Sciences; Biomedicine and Pharmacy. In 2022, the JTSE registered the international identifier Digital Object Identifier (DOI): 10.58334\u002Fvrtc.jtst and assigned DOI codes to all articles of the journal. The members of the Editorial Board of the JTSE are prestigious scientists and leading scientists from Vietnam and many countries in the world. The JTSE has been recognized by the Vietnam State Council for Professorship to score scientific articles in Chemistry, Medicine and Biology with scores ranging from 0-0.75 points.\u003C\u002Fp>\u003Cp style=\"text-align:justify;\">&nbsp; &nbsp; &nbsp; Currently, the JTSE is building and perfecting a set of criteria and making efforts to join the List of prestigious&nbsp; international journals with a roadmap to enter Scopus and SCIE in the coming time.\u003C\u002Fp>",{"VOID":59},"MS2_GJQAAAAJ","VERIFIED","2025-10-27T06:27:25.058+00:00",[63,64],"VI","EN",[],[],[],"https:\u002F\u002Ftapchikhcnnd.com.vn",{"impactFactor":18,"impactFactorByYear":18,"i10Index":19,"i10IndexLast5Year":19,"totalPublication":70,"totalPublicationByYear":71,"totalCitation":75,"totalCitationByYear":76,"totalCitationPerPublication":84,"totalCitationPerPublicationByYear":85,"hindexLast5Year":74,"hindex":74},483,{"0":72,"2020":72,"2021":72,"2022":72,"2024":72,"2025":73,"2026":74},1,475,3,117,{"2017":72,"2018":72,"2019":77,"2020":78,"2021":78,"2022":79,"2023":80,"2024":81,"2025":82,"2026":83},4,5,11,6,7,53,15,0.24,{"2020":78,"2021":78,"2022":79,"2024":81,"2025":86,"2026":78},0.11,"JOURNAL",{"id":89,"createTime":90,"updateTime":45,"relativeEntities":91,"slug":92,"properties":93,"entityType":16,"verifyStatus":60,"verifyTime":18,"verifyNote":18,"languages":18,"translateLanguages":18,"viewCount":101,"subjectFields":102,"manageAffiliations":103,"indexDatabases":116,"url":133,"thumbnailPath":18,"statistic":134,"gsStatistic":227,"type":87,"analyzePriority":18},"cc3aedc1-bd17-441e-b403-4be82349b362","2023-05-29T12:05:16.902+00:00",[],"Vietnam-Journal-of-Mechanics",{"country":94,"issn":95,"title":97,"gsId":99},{"VOID":50},{"VOID":96},"08667136",{"EN":98},"Vietnam Journal of Mechanics",{"VOID":100},"B98qpzgAAAAJ",29,[],[104],{"id":105,"createTime":18,"updateTime":18,"relativeEntities":106,"slug":18,"properties":107,"entityType":18,"verifyStatus":18,"verifyTime":18,"verifyNote":18,"languages":18,"translateLanguages":18,"viewCount":18,"url":114,"parentIds":115,"statistic":18},"5bf72910-eb8d-41eb-b358-ea294f24f765",[],{"title":108,"country":111,"abbreviation":112},{"EN":109,"VI":110},"Vietnam Academy of Science and Technology","Viện Hàn lâm Khoa học và Công nghệ Việt Nam",{"VOID":50},{"VOID":113},"VAST","https:\u002F\u002Fvast.gov.vn\u002F",[],[117],{"id":118,"indexDatabase":119,"url":129,"indexYears":130,"academicFieldIds":131,"indexDatabaseRanking":18},"61d05d3d-1119-4247-9062-3944e6a8afd5",{"id":120,"createTime":18,"updateTime":18,"relativeEntities":121,"label":122,"description":124,"key":126,"publicationTags":127,"standard":18},"7c6668cf-5dbb-472f-ac65-0e3d0d95e1c2",[],{"EN":123,"VI":123},"ACI - Asean Citation Index",{"EN":125,"VI":125},"Cơ sở dữ liệu ACI","aci",[128],"ACI","https:\u002F\u002Fasean-cites.org\u002Fjournal_info?jid=10758","2018-2022",[132],"007635a4-2624-49b8-a8f3-fec188e6a80e","http:\u002F\u002Fvjs.ac.vn\u002Findex.php\u002Fvjmech\u002Findex",{"impactFactor":19,"impactFactorByYear":135,"i10Index":154,"i10IndexLast5Year":155,"totalPublication":156,"totalPublicationByYear":157,"totalCitation":175,"totalCitationByYear":176,"totalCitationPerPublication":195,"totalCitationPerPublicationByYear":196,"hindexLast5Year":178,"hindex":178},{"1994":136,"1995":137,"1997":86,"1998":138,"1999":137,"2000":139,"2001":140,"2002":139,"2003":139,"2004":141,"2005":142,"2006":143,"2007":137,"2008":142,"2010":144,"2011":145,"2012":146,"2013":147,"2014":137,"2015":148,"2016":143,"2017":148,"2018":149,"2019":141,"2020":150,"2021":151,"2022":147,"2023":152,"2024":153},0.12,0.08,0.05,0.02,0.1,0.15,0.14,0.09,0.07,0.21,0.73,0.52,0.13,0.26,0.36,0.61,0.64,0.27,23,2,1046,{"1979":158,"1980":159,"1981":160,"1982":161,"1983":83,"1984":161,"1985":162,"1986":160,"1987":83,"1988":83,"1989":154,"1990":160,"1991":161,"1992":160,"1993":163,"1994":164,"1995":165,"1996":165,"1997":164,"1998":163,"1999":160,"2000":154,"2001":166,"2002":162,"2003":167,"2004":154,"2005":168,"2006":165,"2007":169,"2008":170,"2009":163,"2010":166,"2011":79,"2012":171,"2013":163,"2014":166,"2015":163,"2016":167,"2017":172,"2018":164,"2019":163,"2020":173,"2021":154,"2022":174,"2023":162,"2024":155},12,17,18,19,20,25,28,27,22,21,24,38,35,37,26,39,36,1403,{"1980":72,"1982":72,"1983":72,"1991":164,"1992":77,"1993":80,"1994":81,"1995":177,"1996":178,"1997":166,"1998":172,"1999":79,"2000":168,"2001":159,"2002":160,"2003":179,"2004":180,"2005":163,"2006":181,"2007":182,"2008":183,"2009":184,"2010":185,"2011":186,"2012":187,"2013":188,"2014":184,"2015":189,"2016":190,"2017":170,"2018":191,"2019":192,"2020":191,"2021":193,"2022":194,"2023":77},9,13,31,30,46,40,65,43,119,105,89,72,63,66,70,59,68,58,1.34,{"1980":197,"1982":138,"1983":144,"1991":198,"1992":199,"1993":84,"1994":200,"1995":201,"1996":202,"1997":203,"1998":204,"1999":151,"2000":204,"2001":205,"2002":206,"2003":207,"2004":208,"2005":204,"2006":209,"2007":210,"2008":211,"2009":212,"2010":213,"2011":214,"2012":215,"2013":216,"2014":217,"2015":218,"2016":219,"2017":220,"2018":221,"2019":222,"2020":223,"2021":224,"2022":225,"2023":226},0.06,1.47,0.22,0.25,0.33,0.48,0.79,1.04,0.77,0.9,1.48,1.3,1.7,1.05,1.86,1.72,5.41,9.55,2.41,2.88,1.95,2.52,3.14,1.35,2.5,2.36,1.79,2.96,1.61,0.2,{"impactFactor":18,"impactFactorByYear":18,"i10Index":228,"i10IndexLast5Year":160,"totalPublication":229,"totalPublicationByYear":230,"totalCitation":235,"totalCitationByYear":236,"totalCitationPerPublication":251,"totalCitationPerPublicationByYear":252,"hindexLast5Year":158,"hindex":231},42,1244,{"0":179,"1979":178,"1980":159,"1981":159,"1982":231,"1983":231,"1984":161,"1985":161,"1986":160,"1987":161,"1988":83,"1989":172,"1990":159,"1991":161,"1992":161,"1993":165,"1994":179,"1995":164,"1996":101,"1997":164,"1998":163,"1999":166,"2000":172,"2001":163,"2002":166,"2003":163,"2004":165,"2005":164,"2006":163,"2007":232,"2008":170,"2009":172,"2010":164,"2011":154,"2012":233,"2013":164,"2014":172,"2015":180,"2016":154,"2017":234,"2018":101,"2019":172,"2020":101,"2021":164,"2022":171,"2023":162,"2024":165,"2025":163,"2026":170},16,47,41,32,2194,{"1997":158,"1998":237,"1999":158,"2000":177,"2001":177,"2002":158,"2003":237,"2004":159,"2005":161,"2006":178,"2007":164,"2008":168,"2009":79,"2010":163,"2011":170,"2012":238,"2013":239,"2014":240,"2015":194,"2016":241,"2017":241,"2018":242,"2019":243,"2020":244,"2021":245,"2022":246,"2023":247,"2024":248,"2025":249,"2026":250},10,54,64,62,93,123,118,122,168,159,177,205,255,154,1.76,{"1997":253,"1998":254,"1999":255,"2000":256,"2001":150,"2002":255,"2003":254,"2004":257,"2005":258,"2006":147,"2007":259,"2008":260,"2009":261,"2010":262,"2011":263,"2012":264,"2013":265,"2014":266,"2015":267,"2016":268,"2017":269,"2018":270,"2019":271,"2020":272,"2021":80,"2022":273,"2023":274,"2024":275,"2025":276,"2026":277},0.43,0.4,0.55,0.35,0.63,0.68,0.6,0.69,0.42,0.89,1.52,1.32,2.29,2.38,1.93,4.04,2.91,4.24,4.54,4.21,4.3,8.85,7.59,10.2,4.4,{"id":279,"createTime":280,"updateTime":45,"relativeEntities":281,"slug":282,"properties":283,"entityType":16,"verifyStatus":60,"verifyTime":293,"verifyNote":18,"languages":18,"translateLanguages":18,"viewCount":179,"subjectFields":294,"manageAffiliations":295,"indexDatabases":296,"url":305,"thumbnailPath":18,"statistic":306,"gsStatistic":322,"type":87,"analyzePriority":18},"b5209d2b-2258-40ef-8732-874e80fe24a5","2023-08-01T04:13:30.887+00:00",[],"VNU-Journal-of-Science-Medical-and-Pharmaceutical-Sciences",{"country":284,"eissn":285,"issn":287,"title":289,"gsId":291},{"VOID":50},{"VOID":286},"25881132",{"VOID":288},"26159309",{"EN":290},"VNU Journal of Science: Medical and Pharmaceutical Sciences",{"VOID":292},"nxupvWQAAAAJ","2023-08-01T04:16:22.633+00:00",[],[],[297],{"id":298,"indexDatabase":299,"url":304,"indexYears":18,"academicFieldIds":18,"indexDatabaseRanking":18},"1c684ac3-c7bf-4466-8841-3c6146083c3c",{"id":120,"createTime":18,"updateTime":18,"relativeEntities":300,"label":301,"description":302,"key":126,"publicationTags":303,"standard":18},[],{"EN":123,"VI":123},{"EN":125,"VI":125},[128],"https:\u002F\u002Fasean-cites.org\u002Fjournal_info?jid=11969","https:\u002F\u002Fjs.vnu.edu.vn\u002FMPS",{"impactFactor":19,"impactFactorByYear":307,"i10Index":19,"i10IndexLast5Year":19,"totalPublication":308,"totalPublicationByYear":309,"totalCitation":314,"totalCitationByYear":315,"totalCitationPerPublication":316,"totalCitationPerPublicationByYear":317,"hindexLast5Year":77,"hindex":77},{"2019":138,"2020":142,"2021":136,"2022":136,"2023":141,"2024":140},360,{"2016":172,"2017":310,"2018":101,"2019":180,"2020":311,"2021":232,"2022":312,"2023":313,"2024":232},34,48,49,50,163,{"2016":177,"2017":177,"2018":167,"2019":172,"2020":82,"2021":167,"2022":160,"2023":80},0.45,{"2016":256,"2017":149,"2018":318,"2019":319,"2020":320,"2021":316,"2022":321,"2023":136},0.72,0.87,1.1,0.37,{"impactFactor":18,"impactFactorByYear":18,"i10Index":19,"i10IndexLast5Year":19,"totalPublication":168,"totalPublicationByYear":323,"totalCitation":159,"totalCitationByYear":324,"totalCitationPerPublication":325,"totalCitationPerPublicationByYear":326,"hindexLast5Year":155,"hindex":74},{"0":155,"2014":72,"2015":72,"2016":162},{"2016":72,"2019":155,"2021":155,"2023":77,"2024":74,"2025":72,"2026":72},0.71,{"2016":138},{"id":328,"createTime":329,"updateTime":45,"relativeEntities":330,"slug":331,"properties":332,"entityType":16,"verifyStatus":60,"verifyTime":18,"verifyNote":18,"languages":18,"translateLanguages":18,"viewCount":83,"subjectFields":342,"manageAffiliations":343,"indexDatabases":344,"url":345,"thumbnailPath":18,"statistic":346,"gsStatistic":381,"type":87,"analyzePriority":18},"e7ce3904-ad2d-4341-b39e-98ebe8da5908","2023-06-13T10:30:04.853+00:00",[],"Communications-in-Physics",{"country":333,"eissn":334,"issn":336,"title":338,"gsId":340},{"VOID":50},{"VOID":335},"28155947",{"VOID":337},"08863166",{"EN":339},"Communications in Physics",{"VOID":341},"FStER9AAAAAJ",[],[],[],"https:\u002F\u002Fvjs.ac.vn\u002Findex.php\u002Fcip",{"impactFactor":19,"impactFactorByYear":347,"i10Index":231,"i10IndexLast5Year":77,"totalPublication":353,"totalPublicationByYear":354,"totalCitation":358,"totalCitationByYear":359,"totalCitationPerPublication":367,"totalCitationPerPublicationByYear":368,"hindexLast5Year":158,"hindex":158},{"2008":142,"2009":348,"2010":197,"2011":349,"2012":349,"2013":144,"2014":350,"2015":137,"2016":140,"2017":148,"2018":350,"2019":84,"2020":351,"2021":316,"2022":352,"2023":148,"2024":254},0.3,0.03,0.16,0.34,0.28,738,{"2007":355,"2008":177,"2009":177,"2010":168,"2011":171,"2012":356,"2013":170,"2014":183,"2015":101,"2016":183,"2017":357,"2018":174,"2019":82,"2020":233,"2021":173,"2022":184,"2023":182,"2024":310,"2025":155},14,107,56,947,{"2007":180,"2008":81,"2009":81,"2010":159,"2011":360,"2012":187,"2013":310,"2014":361,"2015":238,"2016":362,"2017":363,"2018":364,"2019":365,"2020":366,"2021":159,"2022":164,"2023":180},52,94,86,129,76,91,106,1.28,{"2007":369,"2008":370,"2009":370,"2010":325,"2011":371,"2012":372,"2013":373,"2014":374,"2015":211,"2016":264,"2017":375,"2018":376,"2019":212,"2020":377,"2021":378,"2022":379,"2023":380},2.14,0.78,1.41,0.83,0.97,1.45,2.3,2.11,2.59,0.44,0.65,0.75,{"impactFactor":18,"impactFactorByYear":18,"i10Index":165,"i10IndexLast5Year":177,"totalPublication":382,"totalPublicationByYear":383,"totalCitation":387,"totalCitationByYear":388,"totalCitationPerPublication":395,"totalCitationPerPublicationByYear":396,"hindexLast5Year":177,"hindex":355},1117,{"0":80,"1972":72,"1991":159,"1992":83,"1993":81,"1994":79,"1995":355,"1996":74,"1997":72,"1998":178,"1999":178,"2000":237,"2001":79,"2002":160,"2003":168,"2004":164,"2005":168,"2006":180,"2007":173,"2008":181,"2009":384,"2010":385,"2011":228,"2012":240,"2013":312,"2014":386,"2015":182,"2016":360,"2017":169,"2018":174,"2019":357,"2020":184,"2021":171,"2022":171,"2023":174,"2024":180,"2025":179,"2026":164},33,44,92,1611,{"2004":78,"2005":389,"2006":79,"2007":79,"2008":158,"2009":172,"2010":101,"2011":179,"2012":179,"2013":179,"2014":240,"2015":385,"2016":233,"2017":312,"2018":193,"2019":390,"2020":244,"2021":363,"2022":244,"2023":391,"2024":392,"2025":393,"2026":394},8,85,153,178,188,132,1.44,{"2004":397,"2005":201,"2006":321,"2007":352,"2008":149,"2009":203,"2010":398,"2011":399,"2012":400,"2013":257,"2014":401,"2015":320,"2016":203,"2017":402,"2018":403,"2019":263,"2020":404,"2021":405,"2022":406,"2023":407,"2024":408,"2025":409,"2026":410},0.18,0.66,0.74,0.5,0.67,1.29,1.89,2.84,3.49,3.3,4.25,5.93,6.06,4.71,{"id":412,"createTime":413,"updateTime":414,"relativeEntities":415,"slug":416,"properties":417,"entityType":16,"verifyStatus":60,"verifyTime":18,"verifyNote":18,"languages":426,"translateLanguages":18,"viewCount":159,"subjectFields":427,"manageAffiliations":428,"indexDatabases":436,"url":450,"thumbnailPath":18,"statistic":451,"gsStatistic":478,"type":87,"analyzePriority":18},"2300fd63-13a8-4ee9-92b0-d24d9e616c6b","2023-05-29T12:05:31.684+00:00","2026-08-27T01:57:29.561+00:00",[],"Journal-of-Computer-Science-and-Cybernetics",{"country":418,"issn":419,"title":421,"gsId":424},{"VOID":50},{"VOID":420},"18139663",{"EN":422,"VI":423},"Journal of Computer Science and Cybernetics","Tạp chí tin học và điều khiển học",{"VOID":425},"hVh9fuMAAAAJ",[63,64],[],[429],{"id":105,"createTime":18,"updateTime":18,"relativeEntities":430,"slug":18,"properties":431,"entityType":18,"verifyStatus":18,"verifyTime":18,"verifyNote":18,"languages":18,"translateLanguages":18,"viewCount":18,"url":114,"parentIds":435,"statistic":18},[],{"title":432,"country":433,"abbreviation":434},{"EN":109,"VI":110},{"VOID":50},{"VOID":113},[],[437],{"id":438,"indexDatabase":439,"url":444,"indexYears":445,"academicFieldIds":446,"indexDatabaseRanking":18},"0c897c2c-8ca4-4a7a-91b9-14955abc3043",{"id":120,"createTime":18,"updateTime":18,"relativeEntities":440,"label":441,"description":442,"key":126,"publicationTags":443,"standard":18},[],{"EN":123,"VI":123},{"EN":125,"VI":125},[128],"https:\u002F\u002Fasean-cites.org\u002Fjournal_info?jid=11305","2019-2021",[132,447,448,449],"a24a4497-b6ac-43f3-ae94-c044be819e49","b2d37900-0c9f-4074-a519-9ee0b570caa7","37da756c-1c5e-4925-87f2-a9bd3ce5859c","http:\u002F\u002Fvjs.ac.vn\u002Findex.php\u002Fjcc",{"impactFactor":19,"impactFactorByYear":452,"i10Index":161,"i10IndexLast5Year":74,"totalPublication":457,"totalPublicationByYear":458,"totalCitation":463,"totalCitationByYear":464,"totalCitationPerPublication":470,"totalCitationPerPublicationByYear":471,"hindexLast5Year":355,"hindex":355},{"2013":139,"2014":139,"2015":143,"2016":397,"2017":139,"2018":453,"2019":149,"2020":454,"2021":259,"2022":455,"2023":400,"2024":456},0.04,0.32,0.39,0.57,1184,{"2012":459,"2013":390,"2014":310,"2015":460,"2016":461,"2017":83,"2018":462,"2019":180,"2020":162,"2021":168,"2022":231,"2023":164,"2024":74},473,71,251,134,995,{"2012":465,"2013":466,"2014":466,"2015":365,"2016":467,"2017":468,"2018":469,"2019":243,"2020":313,"2021":466,"2022":158,"2023":184},149,45,114,51,232,0.84,{"2012":454,"2013":472,"2014":264,"2015":367,"2016":316,"2017":473,"2018":474,"2019":475,"2020":221,"2021":476,"2022":380,"2023":477},0.53,3.4,1.73,3.93,1.88,1.54,{"impactFactor":18,"impactFactorByYear":18,"i10Index":182,"i10IndexLast5Year":164,"totalPublication":479,"totalPublicationByYear":480,"totalCitation":481,"totalCitationByYear":482,"totalCitationPerPublication":224,"totalCitationPerPublicationByYear":492,"hindexLast5Year":83,"hindex":231},1105,{"0":79,"1981":72,"1985":231,"1986":167,"1987":168,"1988":355,"1989":158,"1990":231,"1991":159,"1992":158,"1993":79,"1994":161,"1995":162,"1996":164,"1997":174,"1998":180,"1999":233,"2000":228,"2001":385,"2002":385,"2003":384,"2004":164,"2005":163,"2006":180,"2007":179,"2008":165,"2009":163,"2010":171,"2011":233,"2012":313,"2013":174,"2014":234,"2015":101,"2016":172,"2017":168,"2018":172,"2019":166,"2020":166,"2021":165,"2022":166,"2023":166,"2024":168,"2025":81},3272,{"2007":177,"2008":355,"2009":78,"2010":80,"2011":161,"2012":180,"2013":172,"2014":101,"2015":184,"2016":192,"2017":194,"2018":483,"2019":484,"2020":485,"2021":486,"2022":487,"2023":488,"2024":489,"2025":490,"2026":491},109,173,236,318,398,469,442,440,297,{"2007":493,"2008":147,"2009":226,"2010":350,"2011":494,"2012":259,"2013":318,"2014":495,"2015":207,"2016":496,"2017":497,"2018":498,"2019":499,"2020":500,"2021":501,"2022":502,"2023":503,"2024":504,"2025":505},0.29,0.46,0.91,2.27,2.42,4.19,7.86,10.73,11.78,18.09,21.32,18.42,62.86,{"id":507,"createTime":508,"updateTime":414,"relativeEntities":509,"slug":510,"properties":511,"entityType":16,"verifyStatus":60,"verifyTime":523,"verifyNote":18,"languages":18,"translateLanguages":18,"viewCount":234,"subjectFields":524,"manageAffiliations":525,"indexDatabases":541,"url":542,"thumbnailPath":18,"statistic":543,"gsStatistic":557,"type":87,"analyzePriority":18},"25b6bd10-676c-40c0-8dc3-356d1679a284","2023-05-19T02:22:33.430+00:00",[],"T%E1%BA%A1p-ch%C3%AD-Y-D%C6%B0%E1%BB%A3c-h%E1%BB%8Dc-C%E1%BA%A7n-Th%C6%A1",{"country":512,"issn":513,"title":515,"introduce":518,"gsId":521},{"VOID":50},{"VOID":514},"23541210",{"EN":516,"VI":517},"Cantho Journal of Medicine and Pharmacy","Tạp chí Y Dược học Cần Thơ",{"EN":519,"VI":520},"\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">04\u002F10\u002F2015 Ministry of Information and Communications allowed Can Tho journal of medicine and pharmacy to operate (102 \u002FGP-BTTTT)\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">07\u002F16\u002F2015 Can Tho journal of medicine and pharmacy is internationally recognized: ISSN 2354-1210\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">In 2016, The journal has been included in the list of medical science journals by The State Council for professorship which is awarded a work score of 0-0.5 points for a published article.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Can Tho Journal of Medicine and Pharmacy welcome original works that haven’t been submitted or published in other medical journals. Posts must contain content related to one of the journal’s categories.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">The content published\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">The journal is divided into 3 categories:\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">- Scientific research article: are valuable scientific works, which have been researched and accepted.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">- Overview of medicine, biology and pharmacy: serving the objective of continuing training in the fields of medicine, biology and pharmacy; to systematize classical and modern knowledge.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">- Update information on new knowledge about medicine, biology, pharmacy in the country and in the world.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Scope\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">- Publication and introduction of scientific research in the fields:\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">+ Medicine (internal medicine, surgery, pediatrics, obstetrics and gynecology, odonto-stomatology, laboratory, oncology, traditional medicine, nursing).\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">+ Biology (genetics, biotechnology).\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">+ Pharmacology (pharmaceutics, drug quality analysis-control, synthetic pharmaceutical chemistry, biochemistry, pharmacognosy, botany, clinical pharmacy).\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">- To enhance the quality of undergraduate, postgraduate education, scientifically researching and meet the necessary treatment in hospital.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">- Introducing the updated domestic and oversea information about science technology to promote scientific research and exchanging technology in local, other universities.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">- Exchanging pharmaceutical and medical information for social health developing in the Mekong Delta and Vietnam.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">The object\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Postgraduate students, student of Can Tho University of Medicine and Pharmacy, scientists from schools, research institutes, hospitals, health centers, pharmaceutical companies of the Mekong Delta; other provinces and regions in Vietnam and other country.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Address\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Headquarters of Can Tho Journal of Medicine and Pharmacy, located Scientific Research and International Cooperation Office: 179 Nguyen Van Cu Street, An Khanh Ward, Ninh Kieu District, Can Tho City, Vietnam.\u003C\u002Fspan>\u003C\u002Fp>","\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Ngày 16\u002F7\u002F2015, Tạp chí Y Dược học Cần Thơ được cấp chỉ số quốc tế: ISSN 2354-1210.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Từ tháng 4\u002F2016, Tạp chí đã được Hội đồng Giáo sư ngành Y đưa vào danh sách các tạp chí khoa học Y học được tính điểm công trình 0-0,5 điểm cho một bài báo đăng.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Năm 2020 Tạp chí Y Dược học Cần Thơ đã được phê duyệt vào danh mục của các Hội đồng Giáo sư ngành Dược học được tính điểm công trình 0-0,5 điểm cho một bài báo đăng.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Tạp chí Y Dược học Cần Thơ ra 12 số\u002Fnăm, 180-200 trang\u002Fsố.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Từ tháng 12\u002F2022 Tạp chí Y Dược học Cần Thơ là thành viên của hệ thống Crossref và từ tháng 01\u002F2023 tạp chí thực hiện bình duyệt online kín 2 chiều nhằm tăng tính minh bạch, tin cậy của các công trình nghiên cứu khoa học và đảm bảo tốt nhất chất lượng khoa học của bài viết.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Tôn chỉ, mục đích và phạm vi của tạp chí\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Tôn chỉ và mục đích hoạt động của tạp chí: xuất bản nhằm mục đích phổ biến kết quả từ các đề tài nghiên cứu khoa học; giao lưu trao đổi khoa học, chia sẻ kinh nghiệm, học tập, đồng thời cập nhật thông tin khoa học mới trong các lĩnh vực y, sinh, dược học trong và ngoài nước.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Phạm vi của tạp chí: Tạp chí xuất bản được chia thành 3 chuyên mục: (i) Bài báo nghiên cứu khoa học là kết quả công trình nghiên cứu khoa học có giá trị đã được triển khai nghiên cứu, (ii) Bài tổng quan y, sinh, dược học: phục vụ mục tiêu đào tạo liên tục trong lĩnh vực y, sinh, dược học; nhằm hệ thống hóa những kiến thức kinh điển và hiện đại; (iii) Thông tin cập nhật kiến thức mới về y, sinh, dược học trong nước và trên thế giới.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Chính sách truy cập mở\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Tạp chí Y Dược học Cần Thơ áp dụng chính sách truy cập mở đối với các bài báo đã xuất bản đến với độc giả, nhằm mở rộng cơ hội tiếp cận các kết quả nghiên cứu chất lượng cao và tăng cường trao đổi kiến thức. Tạp chí đăng tải trực tuyến (miễn phí) toàn văn các bài báo được công bố trên website của Tạp chí (https:\u002F\u002Ftapchi.ctump.edu.vn).\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Đạo đức xuất bản\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Tạp chí Y Dược học Cần Thơ cam kết tuân thủ đạo đức xuất bản phù hợp với các hướng dẫn và tiêu chuẩn của the Committee on Publication Ethics (COPE), tuân thủ các nguyên tắc của COPE’s Core Practices, Best Practices Guidelines for Journal Editors và Guidelines on Good Publication Practices.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Bản thảo bài báo chỉ được chấp nhận khi được tác giả chịu trách nhiệm chính cam kết các nội dung sau: Các nội dung của bản thảo chưa được đăng tải toàn bộ hoặc một phần ở các tạp chí khác; Tất cả các tác giả đều có đóng góp một cách đáng kể vào quá trình nghiên cứu hoặc chuẩn bị bản thảo và cùng chịu trách nhiệm về các nội dung của bản thảo; Tuân thủ các biện pháp đảm bảo đạo đức nghiên cứu (ví dụ thỏa thuận đồng ý tham gia nghiên cứu).\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Cam kết bảo mật\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Tạp chí cam kết thực hiện và tuân thủ các quy định của luật và các văn bản hướng dẫn liên quan đến bảo mật thông tin cá nhân trên không gian mạng. Các thông tin mà người dùng (tác giả, độc giả, biên tập viên, người phản biện) nhập vào các biểu mẫu trên Hệ thống Quản lý xuất bản trực tuyến của tạp chí chỉ được sử dụng vào các mục đích đã được tuyên bố rõ ràng và sẽ không được cung cấp cho bất kỳ bên thứ ba nào khác, hay dùng vào bất kỳ mục đích nào khác.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Phí gửi bài\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Lệ phí gửi đăng bài: 1.000.000đ\u002Fbài báo\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Lệ phí gửi đăng nhanh: 1.500.000đ\u002Fbài báo\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Đối với tác giả là cán bộ viên chức thuộc Trường Đại học Y Dược Cần Thơ thì được hỗ trợ 50% lệ phí gửi đăng bài.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Đối với sinh viên thực hiện đề tài nghiên cứu khoa học cấp trường được hỗ trợ 100% lệ phí đăng bài ( Tác giả gửi đính kèm “ Quyết định về việc giao tổ chức thực hiện đề tài nghiên cứu khoa học cấp Trường của sinh viên”).\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Hình thức nộp lệ phí:\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">1. Tiền mặt:\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Nộp trực tiếp tại Phòng Tài chính - Kế toán, Trường Đại học Y Dược Cần Thơ, số 179 Nguyễn Văn Cừ, P. An Khánh, Q. Ninh Kiều, thành phố Cần Thơ.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">2. Chuyển khoản:\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Tên Tài khoản: Trường ĐHYD Cần Thơ, Số TK: 0111000115668, tại ngân hàng Vietcombank chi nhánh Cần Thơ.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Thời gian: Áp dụng từ ngày 01\u002F02\u002F2023.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">* Phí gửi bài không được hoàn trả khi bài viết bị từ chối hoặc tác giả xin rút bài viết.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Quy trình phản biện bài báo\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Tạp chí Y Dược học Cần Thơ thực hiện quy trình phản biện kín hai chiều nghiêm ngặt. Danh tính của những người phản biện không được tiết lộ cho các tác giả và ngược lại. Quy trình thẩm định bài báo đăng gồm các bước sau:\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Tiếp nhận bản thảo\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Tác giả liên hệ gửi bản thảo đến Tạp chí qua hệ thống trực tuyến tại website: https:\u002F\u002Ftapchi.ctump.edu.vn. Hướng dẫn về cách đăng ký, gửi bài và chuẩn bị bản thảo được cung cấp trên website của Tạp chí.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Sàng lọc sơ bộ\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Sau khi Tòa soạn nhận được bài báo của tác giả, Ban Thư ký sẽ tiến hành kiểm tra sơ bộ bài báo (các yêu cầu về nội dung và hình thức). Những bài báo không đúng quy cách hoặc có nội dung không phù hợp hoặc vi phạm bản quyền sẽ bị từ chối (Ban Thư ký thông báo phản hồi đến tác giả trong vòng 1 tuần). Những bài báo đủ điều kiện, được Ban Thư ký tòa soạn chuyển đến Ban Biên tập có cùng chuyên môn với nội dung bài báo để đề xuất người phản biện. Thời gian kể từ khi Ban Biên tập nhận bài báo đến khi đề xuất người phản biện bài báo chậm nhất là 5 ngày.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Vòng phản biện\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">1. Ban Thư ký gửi bài và yêu cầu phản biện đến 02 phản biện độc lập.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">2. Các phản biện gởi nhận xét cho Ban Thư ký. Thời gian từ khi gửi bài cho phản biện đến khi nhận ý kiến của phản biện tối đa là 20 ngày.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Xử ký kết quả phản biện\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">1. Nếu ý kiến đồng ý cho đăng và không cần chỉnh sửa, Ban Thư ký tiếp tục đăng bài theo qui trình.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">2. Nếu ý kiến đồng ý đăng và cần chỉnh sửa, Ban Thư ký sẽ thông tin đến tác giả chỉnh sửa theo yêu cầu của người phản biện. Thời gian chỉnh sửa và gửi lại kéo dài không quá 2 tuần, từ khi tác giả bài báo nhận được thông tin (Quá trình này có thể lặp lại tối đa 2 lần\u002F1 bài báo). Khi có sự thống nhất, đồng ý của người phản biện; bài báo được tiếp tục đăng theo qui trình.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">3. Những bài báo có chất lượng không đạt yêu cầu, cả 2 phản biện không đồng ý cho đăng sẽ bị Tòa soạn từ chối đăng.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Xuất bản\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">1. Ban Thư ký tổng hợp các bản thảo đã được tác giả hoàn thiện sau thẩm định trình Ban Biên tập xem xét, Tổng Biên tập phê duyệt, quyết định bài đăng theo các tiêu chí: sự phù hợp nội dung với tôn chỉ và mục đích, thể loại bài viết (ưu tiên các bài có bài có nghiên cứu chuyên sâu, hàm lượng khoa học cao), đóng góp mới bài báo, bài báo được ưu tiên đăng trong số gần nhất của Tạp chí theo thứ tự: tính thời sự, chất lượng bài báo và thời gian gửi bài.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">2. Ban Biên tập và Ban Thư ký biên tập bản thảo, chế bản, đọc rà soát lỗi. Thời gian hoàn thành từ 10-15 ngày.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">3. Ban Thư ký có trách nhiệm thông báo cho tác giả bài báo (bằng e-mail) về tình hình phê duyệt bài báo, thời gian, số kỳ, tập xuất bản bài báo theo qui định.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">4. Danh sách bài báo theo số Tạp chí được in ấn và phát hành trong năm định kỳ được công bố chính thức trên website: https:\u002F\u002Ftapchi.ctump.edu.vn\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>",{"VOID":522},"wcQ1uqwAAAAJ","2023-05-30T08:17:21.868+00:00",[],[526],{"id":527,"createTime":18,"updateTime":18,"relativeEntities":528,"slug":18,"properties":529,"entityType":18,"verifyStatus":18,"verifyTime":18,"verifyNote":18,"languages":18,"translateLanguages":18,"viewCount":18,"url":539,"parentIds":540,"statistic":18},"6413896b-eca9-442b-a73f-182a58a0ce40",[],{"title":530,"address":533,"country":536,"abbreviation":537},{"EN":531,"VI":532},"Can Tho University of Medicine and Pharmacy","Trường Đại học Y Dược Cần Thơ",{"EN":534,"VI":535},"No 179, Nguyen Van Cu street, An Khanh ward, Ninh Kieu district, Can Tho city, Vietnam","Số 179, đường Nguyễn Văn Cừ, phường An Khánh, quận Ninh Kiều, thành phố Cần Thơ, Việt Nam",{"VOID":50},{"VOID":538},"ctump","http:\u002F\u002Fwww.ctump.edu.vn\u002F",[],[],"https:\u002F\u002Ftapchi.ctump.edu.vn\u002Findex.php\u002Fctump",{"impactFactor":19,"impactFactorByYear":544,"i10Index":19,"i10IndexLast5Year":19,"totalPublication":546,"totalPublicationByYear":547,"totalCitation":552,"totalCitationByYear":553,"totalCitationPerPublication":140,"totalCitationPerPublicationByYear":555,"hindexLast5Year":77,"hindex":77},{"2022":545,"2023":143,"2024":138},0.01,1556,{"2020":79,"2021":548,"2022":549,"2023":550,"2024":551,"2025":154},57,306,801,358,161,{"2021":178,"2022":312,"2023":554},99,{"2021":556,"2022":350,"2023":136},0.23,{"impactFactor":18,"impactFactorByYear":18,"i10Index":155,"i10IndexLast5Year":155,"totalPublication":558,"totalPublicationByYear":559,"totalCitation":558,"totalCitationByYear":560,"totalCitationPerPublication":72,"totalCitationPerPublicationByYear":563,"hindexLast5Year":81,"hindex":81},476,{"0":237,"2019":155,"2021":171,"2022":491,"2023":483,"2024":389,"2025":81,"2026":80},{"2021":74,"2022":155,"2023":193,"2024":561,"2025":392,"2026":562},136,83,{"2021":137,"2022":545,"2023":564,"2024":159,"2025":565,"2026":566},0.62,25.43,13.83,{"id":568,"createTime":569,"updateTime":414,"relativeEntities":570,"slug":571,"properties":572,"entityType":16,"verifyStatus":60,"verifyTime":18,"verifyNote":18,"languages":584,"translateLanguages":18,"viewCount":165,"subjectFields":585,"manageAffiliations":586,"indexDatabases":587,"url":588,"thumbnailPath":589,"statistic":590,"gsStatistic":626,"type":87,"analyzePriority":18},"6984a56a-db70-403b-9cc4-4013e1ceaffa","2023-05-09T06:47:40.346+00:00",[],"T%E1%BA%A1p%20ch%C3%AD%20Nghi%C3%AAn%20c%E1%BB%A9u%20n%C6%B0%E1%BB%9Bc%20ngo%C3%A0i",{"country":573,"issn":574,"title":576,"introduce":579,"gsId":582},{"VOID":50},{"VOID":575},"25252445",{"EN":577,"VI":578},"VNU Journal of Foreign Studies","Tạp chí Nghiên cứu nước ngoài",{"EN":580,"VI":581},"{\"ops\":[{\"insert\":\"\\n\\nThe \\n\"},{\"attributes\":{\"italic\":true},\"insert\":\"VNU Journal of Science\"},{\"insert\":\"\\n was established in 1985 for the publication of national and international research papers in all fields of natural sciences and technology, social sciences and humanities. Since then, the journal has grown in quality, size and scope and now comprises a dozen of serials spanning academic research. In 2002, with the rapid expansion of the field of Foreign Languages and International Studies, the \\n\"},{\"attributes\":{\"italic\":true},\"insert\":\"VNU Journal of Science\"},{\"insert\":\"\\n was delighted to announce the launch of the \\n\"},{\"attributes\":{\"italic\":true},\"insert\":\"VNU Journal of Science: Foreign Studies\"},{\"insert\":\"\\n.\\n\\n\\nSince 2017, as a natural development from its predecessor \\n\"},{\"attributes\":{\"italic\":true},\"insert\":\"VNU Journal of Science: Foreign Studies\"},{\"insert\":\"\\n, the\\n\"},{\"attributes\":{\"bold\":true},\"insert\":\" \"},{\"attributes\":{\"italic\":true,\"bold\":true},\"insert\":\"VNU Journal of Foreign Studies \"},{\"insert\":\"\\ncontinues to be an official, independent publication of the University of Languages and International Studies (ULIS) under Vietnam National University (VNU).\\nThe\\n\"},{\"attributes\":{\"italic\":true,\"bold\":true},\"insert\":\" VNU Journal of Foreign Studies\"},{\"attributes\":{\"italic\":true},\"insert\":\" \"},{\"insert\":\"\\npublishes \\n\"},{\"attributes\":{\"italic\":true},\"insert\":\"blind\"},{\"insert\":\"\\n \\n\"},{\"attributes\":{\"italic\":true},\"insert\":\"peer-reviewed\"},{\"insert\":\"\\n research papers, discussions and reviews concerning:\\nLinguisticsForeign language educationInternational studiesRelated social sciences and humanities\\nBimonthly in 4 English editions and 2 Vietnamese editions in the current year in both print and electronic forms, the journal provides maximum exposure for published articles, making research available to all to read and share.\\n\\n\\n\"}]}","{\"ops\":[{\"attributes\":{\"italic\":true},\"insert\":\"Tạp chí Khoa học, Đại học Quốc gia Hà Nội\"},{\"insert\":\"\\n được thành lập năm 1985 với mục đích xuất bản các bài báo nghiên cứu trong nước và quốc tế về tất cả các lĩnh vực khoa học tự nhiên và công nghệ, khoa học xã hội và nhân văn. Kể từ đó, tạp chí đã phát triển về chất lượng, quy mô và phạm vi với hàng chục số báo liên quan đến nghiên cứu học thuật. Năm 2002, với sự phát triển nhanh chóng của lĩnh vực Ngoại ngữ và Quốc tế học, \\n\"},{\"attributes\":{\"italic\":true},\"insert\":\"Tạp chí Khoa học Đại học Quốc gia Hà Nội\"},{\"insert\":\"\\n đã vui mừng thông báo ra mắt Chuyên san \\n\"},{\"attributes\":{\"italic\":true},\"insert\":\"Nghiên cứu Nước ngoài.\"},{\"insert\":\"\\n\\n\\nKể từ năm 2017, như một sự kế thừa và phát triển từ tiền thân Chuyên san \\n\"},{\"attributes\":{\"italic\":true},\"insert\":\"Nghiên cứu Nước ngoài\"},{\"insert\":\"\\n của Tạp chí Khoa học, Đại học Quốc gia Hà Nội, \\n\"},{\"attributes\":{\"bold\":true},\"insert\":\"Tạp chí\"},{\"insert\":\"\\n\"},{\"attributes\":{\"bold\":true},\"insert\":\" \"},{\"insert\":\"\\n\"},{\"attributes\":{\"italic\":true,\"bold\":true},\"insert\":\"Nghiên cứu nước ngoài \"},{\"insert\":\"\\ntiếp tục là ấn phẩm khoa học chính thức và độc lập của Trường Đại học Ngoại ngữ, Đại học Quốc gia Hà Nội.\\nTạp chí \\n\"},{\"attributes\":{\"italic\":true,\"bold\":true},\"insert\":\"Nghiên cứu nước ngoài\"},{\"insert\":\"\\n xuất bản các bài báo nghiên cứu, trao đổi và đánh giá đã được phản biện kín về:\\nNgôn ngữ họcGiảng dạy ngoại ngữ\u002Fngôn ngữQuốc tế họcCác ngành khoa học xã hội và nhân văn có liên quan\\nTạp chí xuất bản định kì 06 số\u002Fnăm (gồm 04 số tiếng Anh\u002Fnăm và 2 số tiếng Việt\u002Fnăm) dưới dạng bản in và bản điện tử. Tạp chí cung cấp khả năng tiếp cận tối đa tới các bài báo đã xuất bản nhằm giúp độc giả dễ dàng đọc và chia sẻ.\\n\"}]}",{"VOID":583},"jyihv3YAAAAJ",[63,64],[],[],[],"https:\u002F\u002Fjfs.ulis.vnu.edu.vn\u002Findex.php\u002Ffs","\u002Fapi\u002Fpublic\u002Ffile\u002Fpublisher\u002F6984a56a-db70-403b-9cc4-4013e1ceaffa\u002F92693604f5caf63c64520c5c2cd756b5.jpg",{"impactFactor":19,"impactFactorByYear":591,"i10Index":592,"i10IndexLast5Year":237,"totalPublication":593,"totalPublicationByYear":594,"totalCitation":600,"totalCitationByYear":601,"totalCitationPerPublication":611,"totalCitationPerPublicationByYear":612,"hindexLast5Year":172,"hindex":172},{"2007":349,"2010":144,"2011":141,"2012":453,"2013":197,"2014":453,"2015":453,"2016":143,"2017":148,"2018":136,"2019":141,"2020":352,"2021":316,"2022":200,"2023":148,"2024":140},67,1200,{"2002":83,"2003":83,"2004":79,"2005":384,"2006":174,"2007":163,"2008":179,"2009":171,"2010":310,"2011":170,"2012":101,"2013":238,"2014":169,"2015":101,"2016":228,"2017":595,"2018":241,"2019":596,"2020":597,"2021":598,"2022":562,"2023":599,"2024":460,"2025":313},130,78,90,80,61,3204,{"2002":74,"2003":155,"2004":155,"2005":602,"2006":79,"2007":159,"2008":603,"2009":604,"2010":228,"2011":605,"2012":162,"2013":592,"2014":606,"2015":181,"2016":357,"2017":607,"2018":608,"2019":609,"2020":610,"2021":485,"2022":238,"2023":237,"2025":83},189,223,765,246,98,171,377,355,199,2.67,{"2002":226,"2003":148,"2004":397,"2005":613,"2006":614,"2007":258,"2008":615,"2009":616,"2010":617,"2011":618,"2012":260,"2013":617,"2014":619,"2015":620,"2016":621,"2017":264,"2018":622,"2019":623,"2020":624,"2021":625,"2022":379,"2023":350,"2025":348},5.73,0.31,7.19,20.68,1.24,7.03,2.58,1.59,1.33,4.05,4.55,2.21,2.95,{"impactFactor":18,"impactFactorByYear":18,"i10Index":627,"i10IndexLast5Year":628,"totalPublication":629,"totalPublicationByYear":630,"totalCitation":641,"totalCitationByYear":642,"totalCitationPerPublication":657,"totalCitationPerPublicationByYear":658,"hindexLast5Year":174,"hindex":184},379,311,2120,{"0":393,"1960":72,"1971":72,"1975":72,"1987":72,"1988":72,"1989":72,"1990":77,"1992":72,"1993":72,"1994":78,"1995":78,"1996":77,"1997":74,"1998":81,"1999":74,"2000":155,"2001":74,"2002":80,"2003":78,"2004":177,"2005":163,"2006":83,"2007":163,"2008":167,"2009":178,"2010":159,"2011":154,"2012":180,"2013":384,"2014":233,"2015":181,"2016":631,"2017":632,"2018":633,"2019":241,"2020":634,"2021":635,"2022":636,"2023":637,"2024":638,"2025":639,"2026":640},77,75,97,143,167,156,182,231,230,128,13225,{"2003":181,"2004":182,"2005":233,"2006":228,"2007":189,"2008":468,"2009":360,"2010":643,"2011":644,"2012":365,"2013":554,"2014":645,"2015":552,"2016":646,"2017":647,"2018":648,"2019":649,"2020":650,"2021":651,"2022":652,"2023":653,"2024":654,"2025":655,"2026":656},74,88,146,228,310,347,413,636,944,1261,1400,1846,2511,1882,6.24,{"2003":659,"2004":660,"2005":661,"2006":662,"2007":218,"2008":663,"2009":77,"2010":664,"2011":665,"2012":666,"2013":74,"2014":667,"2015":668,"2016":224,"2017":669,"2018":670,"2019":660,"2020":671,"2021":672,"2022":673,"2023":674,"2024":675,"2025":676,"2026":677},9.2,4.44,1.64,2.8,2.43,4.35,3.83,3.03,3.56,3.5,4.13,3.58,4.45,5.65,8.08,7.69,7.99,10.92,14.7,{"id":679,"createTime":680,"updateTime":414,"relativeEntities":681,"slug":682,"properties":683,"entityType":16,"verifyStatus":60,"verifyTime":18,"verifyNote":696,"languages":697,"translateLanguages":18,"viewCount":174,"subjectFields":698,"manageAffiliations":699,"indexDatabases":700,"url":709,"thumbnailPath":710,"statistic":711,"gsStatistic":731,"type":87,"analyzePriority":18},"21d239d8-ac9d-48c7-a176-9d8aadc5eba5","2023-08-21T02:43:48.721+00:00",[],"Khoa-h%E1%BB%8Dc-%C4%90HQGHN-Khoa-h%E1%BB%8Dc-T%E1%BB%B1-nhi%C3%AAn-v%C3%A0-C%C3%B4ng-ngh%E1%BB%87",{"country":684,"eissn":685,"issn":687,"title":689,"introduce":692,"gsId":694},{"VOID":50},{"VOID":686},"25881140",{"VOID":688},"26159317",{"EN":690,"VI":691},"VNU Journal of Science: Natural Science and Technology","Khoa học ĐHQGHN: Khoa học Tự nhiên và Công nghệ",{"EN":693},"{\"ops\":[{\"insert\":\"The \"},{\"attributes\":{\"italic\":true},\"insert\":\"Journal\"},{\"insert\":\" \"},{\"attributes\":{\"italic\":true},\"insert\":\"of\"},{\"insert\":\" \"},{\"attributes\":{\"italic\":true},\"insert\":\"Science\"},{\"insert\":\" was established in 1985 for the publication of national and international research papers in all fields of natural sciences and technology, social sciences and humanities. Since then, the journal has grown in quality, size and scope and now comprises a dozen of serials spanning academic research.\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"insert\":\"With the rapid expansion of the field of Economics, the VNU \"},{\"attributes\":{\"italic\":true},\"insert\":\"Journal\"},{\"insert\":\" \"},{\"attributes\":{\"italic\":true},\"insert\":\"of\"},{\"insert\":\" \"},{\"attributes\":{\"italic\":true},\"insert\":\"Science\"},{\"insert\":\" is delighted to announce the launch of the \"},{\"attributes\":{\"italic\":true},\"insert\":\"VNU Journal of Science: Natural Sciences and Technology (JS: NST) \"},{\"insert\":\"since 1985. This serial publication provides researchers with the opportunity to publish research covering aspects in these areas in the popular \"},{\"attributes\":{\"italic\":true},\"insert\":\"VNU Journal of Science\"},{\"insert\":\" series.\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"insert\":\"As a fully open access publication, the journal will provide maximum exposure for published articles, making the research available to all to read and share. The journal will be published quarterly in March, June, September and December.\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"attributes\":{\"bold\":true},\"insert\":\"Scope\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"insert\":\"JS: NST is an open access journal publishing double-blinded peer-reviewed research papers, communications and reviews dealing with Biology, Bio-technology, Chemistry, Chemical engineering, Energy, Environmental technology and Materials engineering.\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"attributes\":{\"bold\":true},\"insert\":\"Publication Ethics\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"insert\":\"VNUJS is committed to maintaining the highest standards of publication ethics and takes all possible measures against any publication malpractices. The journal follows the guidelines and recommendations of the Committee on Publication Ethics (C.O.P.E) to ensure ethical publishing practices.\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"insert\":\"Plagiarism is strictly prohibited and will not be tolerated. Any form of plagiarism, including but not limited to copying, paraphrasing, or reusing previously published work without proper attribution, will result in rejection of the manuscript and potential sanctions against the author. VNUJS utilizes DoIt as plagiarism detection software to verify the originality of submitted manuscripts.\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"insert\":\"The publication ethics statement with full detail of the responsibilities of authors, reviewers and editors can be found \"},{\"attributes\":{\"bold\":true,\"color\":\"#464d50\",\"background\":\"transparent\",\"link\":\"https:\u002F\u002Fjs.vnu.edu.vn\u002FNST\u002Fethics\"},\"insert\":\"here\"},{\"attributes\":{\"bold\":true},\"insert\":\".\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"attributes\":{\"bold\":true},\"insert\":\"Peer Review Process\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"insert\":\"Any manuscript followed the journal’s scope and author guideline will be assigned to the managing editors. All manuscripts have undergone editorial screening and anonymous double-blind peer-review by the at least one independent expert in the field. The managing editor makes an editorial decision, which is subject to endorsement by the Editor – in - Chief.\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"insert\":\"The journal publishing process can be found in detail \"},{\"attributes\":{\"bold\":true,\"color\":\"#464d50\",\"background\":\"transparent\",\"link\":\"https:\u002F\u002Fdrive.google.com\u002Ffile\u002Fd\u002F136BOGahfq9_5BB3TzSBsLBkQKfCUe5yN\u002Fview?usp=share_link\"},\"insert\":\"here\"},{\"insert\":\".\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"insert\":\"\\n\"}]}",{"VOID":695},"ZfBridMAAAAJ","Admin update database",[63,64],[],[],[701],{"id":702,"indexDatabase":703,"url":708,"indexYears":18,"academicFieldIds":18,"indexDatabaseRanking":18},"6684da33-2cb9-49f9-8332-28f0bcd72e39",{"id":120,"createTime":18,"updateTime":18,"relativeEntities":704,"label":705,"description":706,"key":126,"publicationTags":707,"standard":18},[],{"EN":123,"VI":123},{"EN":125,"VI":125},[128],"https:\u002F\u002Fasean-cites.org\u002Fjournal_info?jid=11968","https:\u002F\u002Fjs.vnu.edu.vn\u002FNST","\u002Fapi\u002Fpublic\u002Ffile\u002Fpublisher\u002F21d239d8-ac9d-48c7-a176-9d8aadc5eba5\u002Fb081d4211e382646c2cdc054ead551b3.jpg",{"impactFactor":19,"impactFactorByYear":712,"i10Index":162,"i10IndexLast5Year":72,"totalPublication":714,"totalPublicationByYear":715,"totalCitation":717,"totalCitationByYear":718,"totalCitationPerPublication":723,"totalCitationPerPublicationByYear":724,"hindexLast5Year":79,"hindex":79},{"2000":349,"2005":545,"2007":139,"2010":545,"2011":349,"2012":138,"2013":139,"2014":349,"2015":139,"2016":139,"2017":453,"2018":349,"2019":453,"2020":145,"2021":614,"2022":713,"2023":226,"2024":136},0.19,1700,{"1985":163,"1986":385,"1987":162,"1988":101,"1989":101,"1990":232,"1991":228,"1992":178,"1993":311,"1994":180,"1995":232,"1996":233,"1999":310,"2000":172,"2001":160,"2002":234,"2003":385,"2004":170,"2005":234,"2006":168,"2007":310,"2008":171,"2009":169,"2010":173,"2011":310,"2012":164,"2013":234,"2014":234,"2015":310,"2016":716,"2017":391,"2018":192,"2019":194,"2020":313,"2021":189,"2022":468,"2023":390,"2024":168,"2025":167},165,870,{"1995":155,"1999":155,"2001":77,"2002":162,"2003":72,"2004":155,"2005":74,"2007":101,"2008":719,"2009":384,"2010":720,"2011":169,"2012":159,"2013":79,"2014":78,"2015":178,"2016":363,"2017":721,"2018":363,"2019":722,"2020":385,"2021":599,"2022":162,"2023":389},82,60,55,102,0.51,{"1995":453,"1999":197,"2001":199,"2002":564,"2003":139,"2004":197,"2005":143,"2007":725,"2008":726,"2009":319,"2010":477,"2011":727,"2012":151,"2013":351,"2014":350,"2015":728,"2016":370,"2017":150,"2018":729,"2019":251,"2020":730,"2021":373,"2022":455,"2023":143},0.85,2.22,1.12,0.38,2.19,0.88,{"impactFactor":18,"impactFactorByYear":18,"i10Index":158,"i10IndexLast5Year":155,"totalPublication":602,"totalPublicationByYear":732,"totalCitation":733,"totalCitationByYear":734,"totalCitationPerPublication":735,"totalCitationPerPublicationByYear":736,"hindexLast5Year":78,"hindex":237},{"0":80,"1999":178,"2000":79,"2001":77,"2002":72,"2003":231,"2004":155,"2005":74,"2006":155,"2007":177,"2008":177,"2009":78,"2010":81,"2011":79,"2012":79,"2013":81,"2014":77,"2015":77,"2016":189,"2017":72},425,{"2008":74,"2009":389,"2010":79,"2011":83,"2012":231,"2013":167,"2014":355,"2015":83,"2016":310,"2017":101,"2018":101,"2019":169,"2020":174,"2021":172,"2022":180,"2023":154,"2024":234,"2025":167,"2026":158},2.25,{"2008":201,"2009":737,"2010":738,"2011":739,"2012":374,"2013":74,"2014":668,"2015":740,"2016":741,"2017":101},1.6,1.57,1.36,3.75,0.54,{"id":743,"createTime":744,"updateTime":414,"relativeEntities":745,"slug":746,"properties":747,"entityType":16,"verifyStatus":60,"verifyTime":18,"verifyNote":696,"languages":18,"translateLanguages":18,"viewCount":182,"subjectFields":759,"manageAffiliations":760,"indexDatabases":761,"url":762,"thumbnailPath":763,"statistic":764,"gsStatistic":770,"type":87,"analyzePriority":18},"954132b5-ca74-461c-b819-45ad6e49a404","2023-08-17T03:30:52.301+00:00",[],"HPU2-Journal-of-Science-Natural-Sciences-and-Technology",{"country":748,"issn":749,"title":751,"introduce":754,"gsId":757},{"VOID":50},{"VOID":750},"28155637",{"EN":752,"VI":753},"HPU2 Journal of Science: Natural Sciences and Technology","TẠP CHÍ KHOA HỌC TRƯỜNG ĐHSP HÀ NỘI 2: CHUYÊN SAN KHOA HỌC TỰ NHIÊN VÀ CÔNG NGHỆ",{"EN":755,"VI":756},"{\"ops\":[{\"insert\":\"HPU2 journal of Science aims to provide an interdisciplinary platform for the dissemination of advances in sciences and technology. The journal publishes original papers of scientific or technological value in all areas of natural, social or educational sciences.\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"insert\":\"The main interest of HPU2 Journal of Science: Natural sciences and technology is in papers that describe valuable findings in physics, mathematics, chemistry, biology; solving engineering or technological problems.\"},{\"attributes\":{\"align\":\"justify\",\"list\":\"bullet\"},\"insert\":\"\\n\"},{\"insert\":\"The main interest of HPU2 Journal of Science: Social Sciences and Humanity is to facilitate the publication of high-quality papers in various areas of social sciences and studies for human development.\"},{\"attributes\":{\"align\":\"justify\",\"list\":\"bullet\"},\"insert\":\"\\n\"},{\"insert\":\"The main interest of HPU2 Journal of Science: Educational Sciences is to publish papers in the field of educational sciences and applications of advances to education for improving and enhancing science education at all levels.\"},{\"attributes\":{\"align\":\"justify\",\"list\":\"bullet\"},\"insert\":\"\\n\"},{\"insert\":\"Papers that are published by HPU2 Journal of Science are doubled-blind, peer-reviewed by at least two experts, are evaluated by the section editor and editor in chief.\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"attributes\":{\"bold\":true},\"insert\":\"Types of Articles\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"insert\":\"Research articles\"},{\"attributes\":{\"align\":\"justify\",\"list\":\"bullet\"},\"insert\":\"\\n\"},{\"insert\":\"Academic reports of original research that have never been published elsewhere in any languages. Manuscripts, where appropriate, should contain the following sections in the order: Title, Authors, Author affiliations, Email address of corresponding authors, Abstract, Keywords, Nomenclature (if any), Introduction, Experiment, Theory, Results and Discussion, Conclusions, Conflict of Interest, Acknowledgments (if any), References, Appendix (if any). Pre-published are to be formatted according to Templates (MS-Word version). \"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"insert\":\"Review articles\"},{\"attributes\":{\"align\":\"justify\",\"list\":\"bullet\"},\"insert\":\"\\n\"},{\"insert\":\"In addition to invited reviews, literature reviews, systematic reviews, and critical reviews will be accepted for consideration. The manuscript should be composed and organized according to the required sequence: Titles, Author names, Affiliations, Email addresses, Abstract, Keywords, Main text, Conclusion, Conflict of Interest, Acknowledgments (if any), References. Although, the main text structure may vary based on the review subtopics, the articles should be formatted according to suitable Templates as research articles.\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"insert\":\"\\n\"}]}","{\"ops\":[{\"insert\":\"Tạp chí Khoa học Trường ĐHSP Hà Nội 2 nhằm mục đích cung cấp một nền tảng liên ngành của sự phổ biến những tiến bộ của khoa học và công nghệ. Tạp chí xuất bản các bài báo gốc có giá trị khoa học hoặc công nghệ trong tất cả các lĩnh vực khoa học tự nhiên, xã hội hoặc giáo dục.\\n\"},{\"attributes\":{\"bold\":true},\"insert\":\"Chuyên san Khoa học tự nhiên và công nghệ:\"},{\"insert\":\" Là các bài báo mô tả những phát hiện có giá trị trong vật lý, toán học, hóa học, sinh học; giải quyết các vấn đề kỹ thuật hoặc công nghệ.\"},{\"attributes\":{\"list\":\"bullet\"},\"insert\":\"\\n\"},{\"attributes\":{\"bold\":true},\"insert\":\"Chuyên san Khoa học Xã hội và Nhân văn:\"},{\"insert\":\" là các bài báo xuất bản chất lượng cao trong các lĩnh vực khác nhau của khoa học xã hội và nghiên cứu phát triển con người.\"},{\"attributes\":{\"list\":\"bullet\"},\"insert\":\"\\n\"},{\"attributes\":{\"bold\":true},\"insert\":\"Chuyên san Khoa học giáo dục:\"},{\"insert\":\" là các bài báo xuất bản trong lĩnh vực khoa học giáo dục và các ứng dụng của tiến bộ vào giáo dục để cải thiện và nâng cao giáo dục khoa học ở tất cả các cấp.\"},{\"attributes\":{\"list\":\"bullet\"},\"insert\":\"\\n\"},{\"insert\":\"Tạp chí trường ĐHSP Hà Nội 2 xuất bản được phản biện kín, xét duyệt bởi ít nhất 02 chuyên gia, và được đánh giá, chọn lựa từ ban biên tập và Tổng biên tập.\\n\"},{\"attributes\":{\"bold\":true},\"insert\":\"Các loại bài báo\"},{\"insert\":\":\\nBài báo nghiên cứu:\"},{\"attributes\":{\"list\":\"ordered\"},\"insert\":\"\\n\"},{\"insert\":\"Báo cáo học thuật về nghiên cứu ban đầu chưa từng được xuất bản ở bất kỳ nơi nào, hay bằng bất kỳ ngôn ngữ nào khác. Bản thảo thích hợp, nên chứa các phần sau theo thứ tự: Tiêu đề, Tác giả, Liên kết tác giả, Địa chỉ email của tác giả tương ứng, Tóm tắt, Từ khóa, Danh pháp (nếu có), Giới thiệu, Thử nghiệm, Lý thuyết, Kết quả và thảo luận, Kết luận, Xung đột quan tâm, Lời cảm ơn (nếu có), Tài liệu tham khảo, Phụ lục (nếu có). Bản xuất bản trước phải được định dạng theo Mẫu (phiên bản MS-Word).\\n2. Bài báo tổng quan:\\nNgoài các bài phê bình được mời, các bài phê bình tài liệu, bài phê bình có hệ thống và bài phê bình sẽ được chấp nhận để xem xét. Bản thảo cần được soạn thảo và sắp xếp theo trình tự yêu cầu: Tên sách, Tên tác giả, Liên kết, Địa chỉ email, Tóm tắt, Từ khóa, Nội dung chính, Kết luận, Xung đột lợi ích, Lời cảm ơn (nếu có), Tài liệu tham khảo. Mặc dù, cấu trúc văn bản chính có thể thay đổi dựa trên các chủ đề phụ của bài đánh giá, các bài báo nên được định dạng theo các Mẫu phù hợp như các bài báo nghiên cứu.\\n\"}]}",{"VOID":758},"YPoBvsIAAAAJ",[],[],[],"https:\u002F\u002Fsj.hpu2.edu.vn\u002Findex.php\u002Fjournal","\u002Fapi\u002Fpublic\u002Ffile\u002Fpublisher\u002F954132b5-ca74-461c-b819-45ad6e49a404\u002F2790ef1d0a7d7a40a504c2fc1647f670.jpg",{"impactFactor":19,"impactFactorByYear":765,"i10Index":19,"i10IndexLast5Year":19,"totalPublication":361,"totalPublicationByYear":767,"totalCitation":166,"totalCitationByYear":768,"totalCitationPerPublication":556,"totalCitationPerPublicationByYear":769,"hindexLast5Year":155,"hindex":155},{"2024":766},0.17,{"2022":168,"2023":310,"2024":174},{"2022":389,"2023":158,"2024":155},{"2022":201,"2023":256,"2024":197},{"impactFactor":18,"impactFactorByYear":18,"i10Index":77,"i10IndexLast5Year":77,"totalPublication":362,"totalPublicationByYear":771,"totalCitation":186,"totalCitationByYear":772,"totalCitationPerPublication":773,"totalCitationPerPublicationByYear":774,"hindexLast5Year":78,"hindex":78},{"0":155,"2022":166,"2023":168,"2024":101,"2025":177},{"2023":78,"2024":168,"2025":233,"2026":310},1.22,{"2023":145,"2024":372,"2025":775},4.56,{"id":777,"createTime":778,"updateTime":779,"relativeEntities":780,"slug":781,"properties":782,"entityType":16,"verifyStatus":60,"verifyTime":18,"verifyNote":18,"languages":18,"translateLanguages":18,"viewCount":101,"subjectFields":794,"manageAffiliations":795,"indexDatabases":803,"url":844,"thumbnailPath":18,"statistic":845,"gsStatistic":877,"type":87,"analyzePriority":18},"21ccdb34-414d-420f-8a60-a592a2fa848e","2023-05-29T10:42:53.358+00:00","2026-08-27T01:57:29.560+00:00",[],"Vietnam-Journal-of-Earth-Sciences",{"country":783,"eissn":784,"issn":786,"title":788,"introduce":790,"gsId":792},{"VOID":50},{"VOID":785},"26159783",{"VOID":787},"08667187",{"EN":789},"Vietnam Journal of Earth Sciences",{"EN":791},"Science of the Earth, formerly Vietnam Journal of Earth Sciences, is a peer-reviewed journal to publish high-quality articles on the entire range of earth sciences and the environment, focused on the Asia Pacific region and their correlations and connections to the globe. The journal publishes fundamental and applied research in earth sciences and the environment, including geology, geophysics, geography, soil science, hydrology, meteorology, oceanography, petroleum, geohazards, environmental sciences, environmental engineering, sustainable development, geoinformatics, geodesy, GIS, and remote sensing.",{"VOID":793},"5htfr3YAAAAJ",[],[796],{"id":105,"createTime":18,"updateTime":18,"relativeEntities":797,"slug":18,"properties":798,"entityType":18,"verifyStatus":18,"verifyTime":18,"verifyNote":18,"languages":18,"translateLanguages":18,"viewCount":18,"url":114,"parentIds":802,"statistic":18},[],{"title":799,"country":800,"abbreviation":801},{"EN":109,"VI":110},{"VOID":50},{"VOID":113},[],[804,821,833],{"id":805,"indexDatabase":806,"url":818,"indexYears":18,"academicFieldIds":819,"indexDatabaseRanking":18},"06f278ee-37b9-41eb-a9b0-3d2d77fa502b",{"id":807,"createTime":18,"updateTime":18,"relativeEntities":808,"label":809,"description":811,"key":814,"publicationTags":815,"standard":18},"88bab0f7-443b-476c-a72a-7fa5222da393",[],{"EN":810,"VI":810},"ISI\u002FESCI  - Emerging Sources Citation Index",{"EN":812,"VI":813},"ESCI database","Cơ sở dữ liệu ESCI","esci",[816,817],"ESCI","ISI","https:\u002F\u002Fmjl.clarivate.com\u002Fsearch-results?issn=0866-7187",[820],"0db73426-2364-455f-81a4-efe0f91d712e",{"id":822,"indexDatabase":823,"url":828,"indexYears":829,"academicFieldIds":830,"indexDatabaseRanking":832},"6ace2085-a177-4a27-b309-8813b832111e",{"id":26,"createTime":18,"updateTime":18,"relativeEntities":824,"label":825,"description":826,"key":32,"publicationTags":827,"standard":18},[],{"EN":29,"VI":29},{"EN":29,"VI":31},[34],"https:\u002F\u002Fwww.scopus.com\u002Fsourceid\u002F21101039869","2018-2024",[831],"1689391c-5702-4349-aaa7-d720ee4321fc","NONE",{"id":834,"indexDatabase":835,"url":840,"indexYears":841,"academicFieldIds":842,"indexDatabaseRanking":18},"dadb15a8-ee22-41c2-a287-49e969d9a998",{"id":120,"createTime":18,"updateTime":18,"relativeEntities":836,"label":837,"description":838,"key":126,"publicationTags":839,"standard":18},[],{"EN":123,"VI":123},{"EN":125,"VI":125},[128],"https:\u002F\u002Fasean-cites.org\u002Fjournal_info?jid=10629","2016-2022",[843],"e04f14cf-280b-4aa8-b711-b77ddd79cbaf","https:\u002F\u002Fvjs.ac.vn\u002Findex.php\u002Fjse\u002F",{"impactFactor":19,"impactFactorByYear":846,"i10Index":183,"i10IndexLast5Year":164,"totalPublication":851,"totalPublicationByYear":852,"totalCitation":854,"totalCitationByYear":855,"totalCitationPerPublication":865,"totalCitationPerPublicationByYear":866,"hindexLast5Year":161,"hindex":161},{"2007":545,"2008":545,"2010":545,"2011":139,"2012":545,"2013":545,"2014":349,"2015":139,"2016":86,"2017":200,"2018":254,"2019":847,"2020":848,"2021":403,"2022":477,"2023":849,"2024":850},1.03,1.08,1.49,1.43,1180,{"2000":721,"2001":720,"2002":313,"2003":192,"2004":311,"2005":357,"2006":548,"2007":169,"2008":232,"2009":194,"2010":468,"2011":853,"2012":466,"2013":721,"2014":312,"2015":184,"2016":182,"2017":180,"2018":384,"2019":179,"2020":184,"2021":101,"2022":180,"2023":312,"2024":171,"2025":77},79,2421,{"2000":237,"2001":83,"2002":177,"2003":178,"2004":158,"2005":83,"2006":162,"2007":160,"2008":159,"2009":184,"2010":154,"2011":169,"2012":599,"2013":232,"2014":856,"2015":719,"2016":857,"2017":858,"2018":859,"2019":860,"2020":861,"2021":862,"2022":863,"2023":864,"2024":177,"2025":72},73,197,219,380,281,328,148,183,160,2.05,{"2000":397,"2001":200,"2002":397,"2003":199,"2004":200,"2005":153,"2006":256,"2007":867,"2008":150,"2009":399,"2010":316,"2011":202,"2012":739,"2013":725,"2014":849,"2015":868,"2016":869,"2017":870,"2018":871,"2019":872,"2020":873,"2021":874,"2022":875,"2023":876,"2024":84,"2025":200},0.47,1.91,4.93,7.3,11.52,9.06,7.63,5.1,6.1,3.27,{"impactFactor":18,"impactFactorByYear":18,"i10Index":467,"i10IndexLast5Year":187,"totalPublication":162,"totalPublicationByYear":878,"totalCitation":879,"totalCitationByYear":880,"totalCitationPerPublication":887,"totalCitationPerPublicationByYear":888,"hindexLast5Year":168,"hindex":165},{"1017":72,"2015":72,"2016":155,"2017":74,"2018":74,"2019":72,"2020":77,"2022":155,"2023":155,"2024":72},3528,{"2014":355,"2015":172,"2016":233,"2017":190,"2018":554,"2019":645,"2020":881,"2021":882,"2022":733,"2023":883,"2024":884,"2025":885,"2026":886},280,403,436,525,589,366,176.4,{"2015":172,"2016":889,"2017":166,"2018":384,"2019":645,"2020":191,"2022":890,"2023":891,"2024":884},20.5,212.5,218,{"meta":893,"data":895},{"total":894},"10",[896,1083,1276,1466,1668,1800,1897,2021,2078,2191],{"id":897,"createTime":898,"updateTime":898,"relativeEntities":899,"slug":900,"properties":901,"entityType":910,"verifyStatus":60,"verifyTime":898,"verifyNote":911,"languages":912,"translateLanguages":18,"viewCount":19,"primaryUrl":913,"fullTextUrl":18,"authors":914,"publicationType":947,"publisherRelationship":948,"citationCount":970,"citationInfo":971,"publishDate":983,"publishYear":972,"citationAnalyzeStatus":17,"lastCitationAnalyze":18,"indexDatabases":984,"openAccess":18,"references":985,"isForceReanalyzing":1082},"43860a23-b0ae-495a-afb9-67e7cda9f6e6","2024-09-19T20:11:44.311+00:00",[],"Marching-cubes-A-high-resolution-3D-surface-construction-algorithm",{"openalex":902,"abstract":904,"title":906,"doi":908},{"VOID":903},"W4233857083",{"EN":905},"\u003Cjats:p>\n            We present a new algorithm, called\n            \u003Cjats:italic>marching cubes\u003C\u002Fjats:italic>\n            , that creates triangle models of constant density surfaces from 3D medical data. Using a divide-and-conquer approach to generate inter-slice connectivity, we create a case table that defines triangle topology. The algorithm processes the 3D medical data in scan-line order and calculates triangle vertices using linear interpolation. We find the gradient of the original data, normalize it, and use it as a basis for shading the models. The detail in images produced from the generated surface models is the result of maintaining the inter-slice connectivity, surface data, and gradient information present in the original 3D data. Results from computed tomography (CT), magnetic resonance (MR), and single-photon emission computed tomography (SPECT) illustrate the quality and functionality of\n            \u003Cjats:italic>marching cubes\u003C\u002Fjats:italic>\n            . We also discuss improvements that decrease processing time and add solid modeling capabilities.\n          \u003C\u002Fjats:p>",{"EN":907},"Marching cubes: A high resolution 3D surface construction algorithm",{"VOID":909},"10.1145\u002F37402.37422","PUBLICATION","Auto Verify",[64],"https:\u002F\u002Fdl.acm.org\u002Fdoi\u002F10.1145\u002F37402.37422",[915,932],{"id":916,"sortIndex":19,"researcher":18,"roles":917,"affiliations":918,"properties":927,"displayName":929,"givenName":18,"familyName":18},"9321ce2a-d91b-48b3-a89c-2e615e7c6167",[],[919],{"id":920,"sortIndex":19,"affiliation":921,"properties":18},"46aaf2fc-fa28-4026-9c84-e6d27f3cc9ed",{"id":920,"createTime":18,"updateTime":18,"relativeEntities":922,"slug":18,"properties":923,"entityType":18,"verifyStatus":18,"verifyTime":18,"verifyNote":18,"languages":18,"translateLanguages":18,"viewCount":18,"url":18,"parentIds":926,"statistic":18},[],{"title":924},{"EN":925},"General Electric Company, Schenectady, NY",[],{"title":928,"openalex":930},{"EN":929},"William E. Lorensen",{"VOID":931},"A5068438875",{"id":933,"sortIndex":72,"researcher":18,"roles":934,"affiliations":935,"properties":942,"displayName":944,"givenName":18,"familyName":18},"21544e8b-312a-455d-9112-74d4a68a272c",[],[936],{"id":920,"sortIndex":19,"affiliation":937,"properties":18},{"id":920,"createTime":18,"updateTime":18,"relativeEntities":938,"slug":18,"properties":939,"entityType":18,"verifyStatus":18,"verifyTime":18,"verifyNote":18,"languages":18,"translateLanguages":18,"viewCount":18,"url":18,"parentIds":941,"statistic":18},[],{"title":940},{"EN":925},[],{"title":943,"openalex":945},{"EN":944},"H. E. Cline",{"VOID":946},"A5011090347","ARTICLE",{"url":18,"publisher":949,"properties":963},{"id":6,"createTime":7,"updateTime":8,"relativeEntities":950,"slug":10,"properties":951,"entityType":16,"verifyStatus":17,"verifyTime":18,"verifyNote":18,"languages":18,"translateLanguages":18,"viewCount":19,"subjectFields":954,"manageAffiliations":955,"indexDatabases":956,"url":18,"thumbnailPath":18,"statistic":18,"gsStatistic":18,"type":18,"analyzePriority":18},[],{"issn":952,"title":953},{"VOID":13},{"EN":15},[],[],[957],{"id":24,"indexDatabase":958,"url":35,"indexYears":36,"academicFieldIds":18,"indexDatabaseRanking":37},{"id":26,"createTime":18,"updateTime":18,"relativeEntities":959,"label":960,"description":961,"key":32,"publicationTags":962,"standard":18},[],{"EN":29,"VI":29},{"EN":29,"VI":31},[34],{"issue":964,"pages":966,"volume":968},{"VOID":965},"4",{"VOID":967},"163-169",{"VOID":969},"21",7753,{"total":970,"publishYear":972,"statisticByYear":973},1987,{"2012":647,"2013":974,"2014":975,"2015":976,"2016":605,"2017":977,"2018":978,"2019":979,"2020":980,"2021":981,"2022":982,"2023":558,"2024":639},317,265,275,263,261,260,316,409,427,"1987-08-01",[37],[986,989,992,995,998,1001,1004,1007,1010,1013,1016,1019,1022,1025,1028,1031,1034,1037,1040,1043,1046,1049,1052,1055,1058,1061,1064,1067,1070,1073,1076,1079],{"id":18,"text":987,"url":18,"identifiers":988},"Artzy , E. , Frieder , G. , and Herman , G.T. The Theory , Design, Implementation and Evaluation of a Three-Dimensional Surface Detection Algorithm. Comptlter Graphics and Ima~,,e Processinj ,, 15 , 1 ( January 1981 ), 1-24. Artzy, E., Frieder, G., and Herman, G.T. The Theory, Design, Implementation and Evaluation of a Three-Dimensional Surface Detection Algorithm. Comptlter Graphics and Ima~,,e Processinj,, 15, 1 (January 1981), 1-24.",{},{"id":18,"text":990,"url":18,"identifiers":991},"Barillot , C. , Gibaud , B. , Scarabin , J. , and Coatrieux , J. 3D Reconstruction of Cerebral Blood Vessels. IEEE Comlmwr Graphk's attd Applk'ations 5 , 12 ( December 1985 ), 13-19. Barillot, C., Gibaud, B., Scarabin, J., and Coatrieux, J. 3D Reconstruction of Cerebral Blood Vessels. IEEE Comlmwr Graphk's attd Applk'ations 5, 12 (December 1985), 13-19.",{},{"id":18,"text":993,"url":18,"identifiers":994},"Bates , R. H. , Garden , K. L. , and Peters , T. M. Overview of Computerized Tomography with Emphasis on Future Developments. Proc. of the IEEE 71 , 3 ( March 1983 ), 356-372. Bates, R. H., Garden, K. L., and Peters, T. M. Overview of Computerized Tomography with Emphasis on Future Developments. Proc. of the IEEE 71, 3 (March 1983), 356-372.",{},{"id":18,"text":996,"url":18,"identifiers":997},"10.1109\u002FPROC.1983.12593",{"doi":996},{"id":18,"text":999,"url":18,"identifiers":1000},"10.1109\u002FMCG.1984.6429351",{"doi":999},{"id":18,"text":1002,"url":18,"identifiers":1003},"Burk , D. L. , Mears , D. C. , Kennedy , W. H. , Cooperstein , L. A. , and Herbert , D. L. Three-Dimensional Computed Tomography of Acetabula Fractures. Radiology 155 , 1 ( 1985 ), 183-186. Burk, D. L., Mears, D. C., Kennedy, W. H., Cooperstein, L. A., and Herbert, D. L. Three-Dimensional Computed Tomography of Acetabula Fractures. Radiology 155, 1 (1985), 183-186.",{},{"id":18,"text":1005,"url":18,"identifiers":1006},"10.1109\u002FMCG.1985.276388",{"doi":1005},{"id":18,"text":1008,"url":18,"identifiers":1009},"10.1145\u002F965139.807388",{"doi":1008},{"id":18,"text":1011,"url":18,"identifiers":1012},"Cline , H. E. , Dumoulin , C. L. , Lorensen , W. E. , Hart , H. R. , and Ludke , S . 3D Reconstruction of the Brain from Magnetic Resonance Images. Magnetic Resonance Imaging ( 1987 , to appear). Cline, H. E., Dumoulin, C. L., Lorensen, W. E., Hart, H. R., and Ludke, S. 3D Reconstruction of the Brain from Magnetic Resonance Images. Magnetic Resonance Imaging (1987, to appear).",{},{"id":18,"text":1014,"url":18,"identifiers":1015},"Cline , H. E. , Lorensen , W. E. , Ludke , S ,, Crawford , C. R. , and Teeter , B. C . High-Resolution Three- Dimensional Reconstruction of Tomograms. Medical Physics ( 1987 , to appear). Cline, H. E., Lorensen, W. E., Ludke, S,, Crawford, C. R., and Teeter, B. C. High-Resolution Three- Dimensional Reconstruction of Tomograms. Medical Physics (1987, to appear).",{},{"id":18,"text":1017,"url":18,"identifiers":1018},"Cook , L. T. , Dwyer , S. J. , Batnitzky , S. , and Lee , K. R. A Three-Dimensional Display System for Diagnostic Imaging Applications. IEEE Computer Graphics and Applications 3 , 5 ( August 1983 ), 13-19. Cook, L. T., Dwyer, S. J., Batnitzky, S., and Lee, K. R. A Three-Dimensional Display System for Diagnostic Imaging Applications. IEEE Computer Graphics and Applications 3, 5 (August 1983), 13-19.",{},{"id":18,"text":1020,"url":18,"identifiers":1021},"Farrell , E. J. Color Display and Interactive Interpretation of Three-Dimensional Data. IBM J. Res. Develop 27 , 4 ( July 1983 ), 356-366. Farrell, E. J. Color Display and Interactive Interpretation of Three-Dimensional Data. IBM J. Res. Develop 27, 4 (July 1983), 356-366.",{},{"id":18,"text":1023,"url":18,"identifiers":1024},"10.1109\u002FMCG.1984.275989",{"doi":1023},{"id":18,"text":1026,"url":18,"identifiers":1027},"10.1145\u002F359842.359846",{"doi":1026},{"id":18,"text":1029,"url":18,"identifiers":1030},"Gordon , D. and Reynolds , R. A. Image Space Shading of 3- Dimensional Objects. Computer Graphics and Image Processing 29 , 3 ( March 1985 ), 361-376. Gordon, D. and Reynolds, R. A. Image Space Shading of 3-Dimensional Objects. Computer Graphics and Image Processing 29, 3 (March 1985), 361-376.",{},{"id":18,"text":1032,"url":18,"identifiers":1033},"10.1148\u002Fradiology.157.3.4059560",{"doi":1032},{"id":18,"text":1035,"url":18,"identifiers":1036},"Hemmy , D. C. , David , D. J. , and Herman , G. T. Three-Dimensional Reconstruction of Craniofacial Deformity Using Computed Tomography. Neurosurgery 13 , 5 ( November 1983 ), 534-541. Hemmy, D. C., David, D. J., and Herman, G. T. Three-Dimensional Reconstruction of Craniofacial Deformity Using Computed Tomography. Neurosurgery 13, 5 (November 1983), 534-541.",{},{"id":18,"text":1038,"url":18,"identifiers":1039},"Hemmy , D. C. and Tessier , P. L. CT of Dry Skulls with Craniofacial Deformities: Accuracy of Three- Dimensional Reconstruction. Radiology 157 , 1 ( October 1985 ), 113-116. Hemmy, D. C. and Tessier, P. L. CT of Dry Skulls with Craniofacial Deformities: Accuracy of Three- Dimensional Reconstruction. Radiology 157, 1 (October 1985), 113-116.",{},{"id":18,"text":1041,"url":18,"identifiers":1042},"10.1109\u002FMCG.1983.263213",{"doi":1041},{"id":18,"text":1044,"url":18,"identifiers":1045},"Hinshaw , W. S. and Lent , A. H. An Introduction to NMR Imaging : From the Bloch Equation to the Imaging Equation. Proc. of the IEEE 71 , 3 ( March 1983 ), 338-350. Hinshaw, W. S. and Lent, A. H. An Introduction to NMR Imaging: From the Bloch Equation to the Imaging Equation. Proc. of the IEEE 71, 3 (March 1983), 338-350.",{},{"id":18,"text":1047,"url":18,"identifiers":1048},"10.1148\u002Fradiology.155.3.4001378",{"doi":1047},{"id":18,"text":1050,"url":18,"identifiers":1051},"10.1109\u002FTMI.1986.4307738",{"doi":1050},{"id":18,"text":1053,"url":18,"identifiers":1054},"10.1147\u002Frd.191.0002",{"doi":1053},{"id":18,"text":1056,"url":18,"identifiers":1057},"Knoll , G. F. Single-Photon Emission Computed Tomography. Proc. of the IEEE 71 , 3 ( March 1983 ), 320-329. Knoll, G. F. Single-Photon Emission Computed Tomography. Proc. of the IEEE 71, 3 (March 1983), 320-329.",{},{"id":18,"text":1059,"url":18,"identifiers":1060},"10.1016\u002F0146-664X(82)90104-6",{"doi":1059},{"id":18,"text":1062,"url":18,"identifiers":1063},"Robb , R. A. , Hoffman , E. A. , Sinak , L. J. , Harris , L. D. , and Ritman , E. L. High-Speed Three-Dimensional X-Ray Computed Tomography: The Dynamic Spatial Reconstructor. Proc. of the IEEE 71 , 3 ( March 1983 ), 308-319. Robb, R. A., Hoffman, E. A., Sinak, L. J., Harris, L. D., and Ritman, E. L. High-Speed Three-Dimensional X-Ray Computed Tomography: The Dynamic Spatial Reconstructor. Proc. of the IEEE 71, 3 (March 1983), 308-319.",{},{"id":18,"text":1065,"url":18,"identifiers":1066},"10.1145\u002F965139.807390",{"doi":1065},{"id":18,"text":1068,"url":18,"identifiers":1069},"10.1145\u002F360767.360802",{"doi":1068},{"id":18,"text":1071,"url":18,"identifiers":1072},"10.1109\u002FTMI.1986.4307755",{"doi":1071},{"id":18,"text":1074,"url":18,"identifiers":1075},"Udupa , J. K. Interactive Segmentation and Boundary Surface Formation for 3- D Digital Images. Computer Graphics and Image Processing 18 , 3 ( March 1982 ), 213-235. Udupa, J. K. Interactive Segmentation and Boundary Surface Formation for 3-D Digital Images. Computer Graphics and Image Processing 18, 3 (March 1982), 213-235.",{},{"id":18,"text":1077,"url":18,"identifiers":1078},"Vannier , M. W. , Marsh , J. L. , and Warren , J. O. Three Dimensional CT Reconstruction Images for Craniofacial Surgical Planning and Evaluation. Radiology 150 , 1 ( January 1984 ), 179-184. Vannier, M. W., Marsh, J. L., and Warren, J. O. Three Dimensional CT Reconstruction Images for Craniofacial Surgical Planning and Evaluation. Radiology 150, 1 (January 1984), 179-184.",{},{"id":18,"text":1080,"url":18,"identifiers":1081},"10.1109\u002FTPAMI.1981.4767105",{"doi":1080},false,{"id":1084,"createTime":1085,"updateTime":1085,"relativeEntities":1086,"slug":1087,"properties":1088,"entityType":910,"verifyStatus":60,"verifyTime":1085,"verifyNote":911,"languages":1097,"translateLanguages":18,"viewCount":19,"primaryUrl":1098,"fullTextUrl":18,"authors":1099,"publicationType":947,"publisherRelationship":1119,"citationCount":1139,"citationInfo":1140,"publishDate":983,"publishYear":972,"citationAnalyzeStatus":17,"lastCitationAnalyze":18,"indexDatabases":1153,"openAccess":18,"references":1154,"isForceReanalyzing":1082},"e23e673b-746c-42f1-844a-d716ac0d20f3","2024-09-05T01:18:17.612+00:00",[],"Flocks-herds-and-schools-A-distributed-behavioral-model",{"openalex":1089,"abstract":1091,"title":1093,"doi":1095},{"VOID":1090},"W4234406933",{"EN":1092},"\u003Cjats:p>The aggregate motion of a flock of birds, a herd of land animals, or a school of fish is a beautiful and familiar part of the natural world. But this type of complex motion is rarely seen in computer animation. This paper explores an approach based on simulation as an alternative to scripting the paths of each bird individually. The simulated flock is an elaboration of a particle systems, with the simulated birds being the particles. The aggregate motion of the simulated flock is created by a distributed behavioral model much like that at work in a natural flock; the birds choose their own course. Each simulated bird is implemented as an independent actor that navigates according to its local perception of the dynamic environment, the laws of simulated physics that rule its motion, and a set of behaviors programmed into it by the \"animator.\" The aggregate motion of the simulated flock is the result of the dense interaction of the relatively simple behaviors of the individual simulated birds.\u003C\u002Fjats:p>",{"EN":1094},"Flocks, herds and schools: A distributed behavioral model",{"VOID":1096},"10.1145\u002F37402.37406",[64],"https:\u002F\u002Fdl.acm.org\u002Fdoi\u002F10.1145\u002F37402.37406",[1100],{"id":1101,"sortIndex":19,"researcher":18,"roles":1102,"affiliations":1103,"properties":1112,"displayName":1116,"givenName":18,"familyName":18},"f15f54f9-c6c4-477e-9f54-093d3441a83c",[],[1104],{"id":1105,"sortIndex":19,"affiliation":1106,"properties":18},"bdc97d11-3c8b-4f7a-9b4e-3fc25e825103",{"id":1105,"createTime":18,"updateTime":18,"relativeEntities":1107,"slug":18,"properties":1108,"entityType":18,"verifyStatus":18,"verifyTime":18,"verifyNote":18,"languages":18,"translateLanguages":18,"viewCount":18,"url":18,"parentIds":1111,"statistic":18},[],{"title":1109},{"EN":1110},"Symbolics Graphics Division, Los Angeles, CA",[],{"orcid":1113,"title":1115,"openalex":1117},{"VOID":1114},"https:\u002F\u002Forcid.org\u002F0000-0001-8203-712X",{"EN":1116},"Craig W. Reynolds",{"VOID":1118},"A5082797111",{"url":18,"publisher":1120,"properties":1134},{"id":6,"createTime":7,"updateTime":8,"relativeEntities":1121,"slug":10,"properties":1122,"entityType":16,"verifyStatus":17,"verifyTime":18,"verifyNote":18,"languages":18,"translateLanguages":18,"viewCount":19,"subjectFields":1125,"manageAffiliations":1126,"indexDatabases":1127,"url":18,"thumbnailPath":18,"statistic":18,"gsStatistic":18,"type":18,"analyzePriority":18},[],{"issn":1123,"title":1124},{"VOID":13},{"EN":15},[],[],[1128],{"id":24,"indexDatabase":1129,"url":35,"indexYears":36,"academicFieldIds":18,"indexDatabaseRanking":37},{"id":26,"createTime":18,"updateTime":18,"relativeEntities":1130,"label":1131,"description":1132,"key":32,"publicationTags":1133,"standard":18},[],{"EN":29,"VI":29},{"EN":29,"VI":31},[34],{"issue":1135,"pages":1136,"volume":1138},{"VOID":965},{"VOID":1137},"25-34",{"VOID":969},4684,{"total":1139,"publishYear":972,"statisticByYear":1141},{"2012":1142,"2013":1143,"2014":1144,"2015":1145,"2016":1146,"2017":1147,"2018":1148,"2019":1145,"2020":1149,"2021":1150,"2022":1151,"2023":1152,"2024":243},238,245,242,269,252,262,290,268,299,298,212,[37],[1155,1158,1161,1164,1167,1170,1173,1176,1179,1182,1185,1188,1191,1194,1197,1200,1203,1206,1209,1212,1215,1218,1221,1225,1228,1231,1234,1237,1240,1243,1246,1249,1252,1255,1258,1261,1264,1267,1270,1273],{"id":18,"text":1156,"url":18,"identifiers":1157},"Abelson , H. , and diSessa , A. , \" Maneuvering a Three Dimensional Turtle\" in Turtle Geometry : The Computer as a Medium for Exploring Mathematics , The MIT Press , Cambridge, Massachusetts , 1981 , pp. 140 - 159 . Abelson, H., and diSessa, A., \"Maneuvering a Three Dimensional Turtle\" in Turtle Geometry: The Computer as a Medium for Exploring Mathematics, The MIT Press, Cambridge, Massachusetts, 1981, pp. 140-159.",{},{"id":18,"text":1159,"url":18,"identifiers":1160},"10.5555\u002F7929",{"doi":1159},{"id":18,"text":1162,"url":18,"identifiers":1163},"Amkraut , S. , personal communication , January 8 , 1987 . Amkraut, S., personal communication, January 8, 1987.",{},{"id":18,"text":1165,"url":18,"identifiers":1166},"Amkraut , S. , Girard , M. , Karl , G. , \"motion studies for a work in progress entitled \" Eurythmy' \" in SIGGRAPH Video Review , Issue 21 (second item, time code 3:58 to 7:35) , 1985 , produced at the Computer Graphics Research Group, Ohio State University, Columbus , Ohio . Amkraut, S., Girard, M., Karl, G., \"motion studies for a work in progress entitled \"Eurythmy' \" in SIGGRAPH Video Review, Issue 21 (second item, time code 3:58 to 7:35), 1985, produced at the Computer Graphics Research Group, Ohio State University, Columbus, Ohio.",{},{"id":18,"text":1168,"url":18,"identifiers":1169},"Austin , H. , \" The Logo Primer ,\" M|T A.I. Lab, Logo Working Paper 19 , 1974 . Austin, H., \"The Logo Primer,\" M|T A.I. Lab, Logo Working Paper 19, 1974.",{},{"id":18,"text":1171,"url":18,"identifiers":1172},"Braitenberg , V. , Vehicles : Experiments in Synthetic Psychology , The MIT Press , Cambridge, Massachusetts , 1984 . Braitenberg, V., Vehicles: Experiments in Synthetic Psychology, The MIT Press, Cambridge, Massachusetts, 1984.",{},{"id":18,"text":1174,"url":18,"identifiers":1175},"Burton R. Bird Behavior Alfred A. Knopf Inc. 1985.  Burton R. Bird Behavior Alfred A. Knopf Inc. 1985.",{},{"id":18,"text":1177,"url":18,"identifiers":1178},"Davis , J. R. , Kay , A. , Marion , A. , unpublished research on behavioral simulation and animation , Atari Research , 1983 . Davis, J. R., Kay, A., Marion, A., unpublished research on behavioral simulation and animation, Atari Research, 1983.",{},{"id":18,"text":1180,"url":18,"identifiers":1181},"10.1145\u002F325165.325244",{"doi":1180},{"id":18,"text":1183,"url":18,"identifiers":1184},"Goldberg , A. , Robson , D. , SMALLTALK-80 , The Language and its Implementation , Addison-Wesley Publishing Company , Reading Massachusetts , 1983 . Goldberg, A., Robson, D., SMALLTALK-80, The Language and its Implementation, Addison-Wesley Publishing Company, Reading Massachusetts, 1983.",{},{"id":18,"text":1186,"url":18,"identifiers":1187},"Goldberg , A. , Kay , A. , SMALLTALK-72 Instruction Manual , Learning research group , Xerox Palo Alto Research Center , 1976 . Goldberg, A., Kay, A., SMALLTALK-72 Instruction Manual, Learning research group, Xerox Palo Alto Research Center, 1976.",{},{"id":18,"text":1189,"url":18,"identifiers":1190},"10.1145\u002F512950.512975",{"doi":1189},{"id":18,"text":1192,"url":18,"identifiers":1193},"10.1145\u002F800248.807416",{"doi":1192},{"id":18,"text":1195,"url":18,"identifiers":1196},"10.1145\u002F4547.4552",{"doi":1195},{"id":18,"text":1198,"url":18,"identifiers":1199},"Lipton , J. , An Exaltation of Larks (or , The Venereal Game) , Grossman Publishers, 1977 . Reprinted by Penguin Books 1977, 1980, 1982, 1983, 1984, 1985. Lipton, J., An Exaltation of Larks (or, The Venereal Game), Grossman Publishers, 1977. Reprinted by Penguin Books 1977, 1980, 1982, 1983, 1984, 1985.",{},{"id":18,"text":1201,"url":18,"identifiers":1202},"Maciejewski A. A. Klein C.A. \"Obstacle Avoidance for Kinematically Redundant Manipulators in Dynamically Varying Environments \" to appear in International Journal of Robotic Research.  Maciejewski A. A. Klein C.A. \"Obstacle Avoidance for Kinematically Redundant Manipulators in Dynamically Varying Environments \" to appear in International Journal of Robotic Research.",{},{"id":18,"text":1204,"url":18,"identifiers":1205},"10.5555\u002F4132",{"doi":1204},{"id":18,"text":1207,"url":18,"identifiers":1208},"Marion A. \"Artificially Motivated Objects;' {installation  Marion A. \"Artificially Motivated Objects;' {installation",{},{"id":18,"text":1210,"url":18,"identifiers":1211},"10.1145\u002F28697.28698",{"doi":1210},{"id":18,"text":1213,"url":18,"identifiers":1214},"Myers , R. , Broadwell , P. , Schaufler , R. , \" Plasm : Fish Sample,\" {installation piece} , ACM SIGGRAPH art show , 1985 . Myers, R., Broadwell, P., Schaufler, R., \"Plasm: Fish Sample,\" {installation piece}, ACM SIGGRAPH art show, 1985.",{},{"id":18,"text":1216,"url":18,"identifiers":1217},"Papert , S. , \" Teaching Children to be Mathematicians vs. Teaching Them About Mathematics \" International Journal of Mathematical Education and Sciences, V3 , pp. 249 - 262 , 1972 . Papert, S., \"Teaching Children to be Mathematicians vs. Teaching Them About Mathematics\" International Journal of Mathematical Education and Sciences, V3, pp. 249-262, 1972.",{},{"id":18,"text":1219,"url":18,"identifiers":1220},"10.1038\u002Fscientificamerican0682-114",{"doi":1219},{"id":18,"text":1222,"url":18,"identifiers":1223},"Pitcher T. J. Partridge B. L.; Wardle C. S. \"Blind Fish Can School \" Science 194 #4268 (1976) p. 964.  Pitcher T. J. Partridge B. L.; Wardle C. S. \"Blind Fish Can School \" Science 194 #4268 (1976) p. 964.",{"doi":1224},"10.1126\u002Fscience.982056",{"id":18,"text":1226,"url":18,"identifiers":1227},"10.1038\u002F309344a0",{"doi":1226},{"id":18,"text":1229,"url":18,"identifiers":1230},"10.1145\u002F948576.948587",{"doi":1229},{"id":18,"text":1232,"url":18,"identifiers":1233},"10.1145\u002F357318.357320",{"doi":1232},{"id":18,"text":1235,"url":18,"identifiers":1236},"Reynolds , C. W. , Computer Animation in the World of Actors and Scripts, SM thesis , MIT (the Architecture Machine Group) , May 1978 . Reynolds, C. W., Computer Animation in the World of Actors and Scripts, SM thesis, MIT (the Architecture Machine Group), May 1978.",{},{"id":18,"text":1238,"url":18,"identifiers":1239},"10.1145\u002F800064.801293",{"doi":1238},{"id":18,"text":1241,"url":18,"identifiers":1242},"Reynolds C. W. \"Description and Control of Time and Dynamics in Computer Animation\" in the notes for the course on Advanced Computer Animation at acm SIGGRAPH '85 and reprinted for the notes of the same course in 1986.  Reynolds C. W. \"Description and Control of Time and Dynamics in Computer Animation\" in the notes for the course on Advanced Computer Animation at acm SIGGRAPH '85 and reprinted for the notes of the same course in 1986.",{},{"id":18,"text":1244,"url":18,"identifiers":1245},"Selous E. Thought-transference (or what?) in Birds Constable London 1931.  Selous E. Thought-transference (or what?) in Birds Constable London 1931.",{},{"id":18,"text":1247,"url":18,"identifiers":1248},"Scheffer , V. B. , Spires of Form : Glimpses of Evolution , Harcourt Brace Jovanovich , San Diego , 1983 (reprinted 1985 by Harvest\u002F HBJ), p. 64 . Scheffer, V. B., Spires of Form: Glimpses of Evolution, Harcourt Brace Jovanovich, San Diego, 1983 (reprinted 1985 by Harvest\u002F HBJ), p. 64.",{},{"id":18,"text":1250,"url":18,"identifiers":1251},"Shaw , E. , \" Schooling in Fishes : Critique and Review\" in Development and Evolution of Behavior . W. H. Freeman and Company , San Francisco , 1970 , pp. 452 - 480 . Shaw, E., \"Schooling in Fishes: Critique and Review\" in Development and Evolution of Behavior. W. H. Freeman and Company, San Francisco, 1970, pp. 452-480.",{},{"id":18,"text":1253,"url":18,"identifiers":1254},"Shaw , E. , \" Fish in Schools ,\" Natural History 84 , no. 8 ( 1975 ), pp. 40~ 16 . Shaw, E., \"Fish in Schools,\" Natural History 84, no. 8 (1975), pp. 40~16.",{},{"id":18,"text":1256,"url":18,"identifiers":1257},"Sims , K. , Locomotion of Jointed Figures Over Complex Terrain , SM thesis, MIT Media Lab, currently in preparation , April 1987 . Sims, K., Locomotion of Jointed Figures Over Complex Terrain, SM thesis, MIT Media Lab, currently in preparation, April 1987.",{},{"id":18,"text":1259,"url":18,"identifiers":1260},"Symbolics Graphics Division S-Dynamics (user's manual) Symbolics Inc. November 1986.  Symbolics Graphics Division S-Dynamics (user's manual) Symbolics Inc. November 1986.",{},{"id":18,"text":1262,"url":18,"identifiers":1263},"Symbolics Graphics Division S-Geometry (user's mafiual) Symbolics Inc. October 1986.  Symbolics Graphics Division S-Geometry (user's mafiual) Symbolics Inc. October 1986.",{},{"id":18,"text":1265,"url":18,"identifiers":1266},"Pinker , S. (editor), Visual Cognition , The MIT Press, Cambridge , Massachusetts , 1985 . Pinker, S. (editor), Visual Cognition, The MIT Press, Cambridge, Massachusetts, 1985.",{},{"id":18,"text":1268,"url":18,"identifiers":1269},"Thomas , F. , Johnson , O. , Disney Animation: The Illusion of Life , Abbeville Press , New York , 1981 , pp. 47 - 69 . Thomas, F., Johnson, O., Disney Animation: The Illusion of Life, Abbeville Press, New York, 1981, pp. 47-69.",{},{"id":18,"text":1271,"url":18,"identifiers":1272},"10.1109\u002F38.55148",{"doi":1271},{"id":18,"text":1274,"url":18,"identifiers":1275},"10.1007\u002FBF02021814",{"doi":1274},{"id":1277,"createTime":1278,"updateTime":1278,"relativeEntities":1279,"slug":1280,"properties":1281,"entityType":910,"verifyStatus":60,"verifyTime":1278,"verifyNote":911,"languages":1292,"translateLanguages":18,"viewCount":19,"primaryUrl":1293,"fullTextUrl":18,"authors":1294,"publicationType":947,"publisherRelationship":1363,"citationCount":1383,"citationInfo":1384,"publishDate":983,"publishYear":972,"citationAnalyzeStatus":17,"lastCitationAnalyze":18,"indexDatabases":1386,"openAccess":18,"references":1387,"isForceReanalyzing":1082},"d39ae924-d4c2-484e-8a62-24fd90205cfe","2025-01-25T12:13:07.647+00:00",[],"Elastically-deformable-models",{"openalex":1282,"mag":1284,"abstract":1286,"title":1288,"doi":1290},{"VOID":1283},"W3006964082",{"VOID":1285},"3006964082",{"EN":1287},"\u003Cjats:p>The theory of elasticity describes deformable materials such as rubber, cloth, paper, and flexible metals. We employ elasticity theory to construct differential equations that model the behavior of non-rigid curves, surfaces, and solids as a function of time. Elastically deformable models are active: they respond in a natural way to applied forces, constraints, ambient media, and impenetrable obstacles. The models are fundamentally dynamic and realistic animation is created by numerically solving their underlying differential equations. Thus, the description of shape and the description of motion are unified.\u003C\u002Fjats:p>",{"EN":1289},"Elastically deformable models",{"VOID":1291},"10.1145\u002F37402.37427",[64],"https:\u002F\u002Fdl.acm.org\u002Fdoi\u002F10.1145\u002F37402.37427",[1295,1312,1331,1346],{"id":1296,"sortIndex":19,"researcher":18,"roles":1297,"affiliations":1298,"properties":1307,"displayName":1309,"givenName":18,"familyName":18},"ed5405b2-ec36-4a5c-aa43-623571fb9722",[],[1299],{"id":1300,"sortIndex":19,"affiliation":1301,"properties":18},"0ba52821-2aff-475f-bef9-ac7c61c6be39",{"id":1300,"createTime":18,"updateTime":18,"relativeEntities":1302,"slug":18,"properties":1303,"entityType":18,"verifyStatus":18,"verifyTime":18,"verifyNote":18,"languages":18,"translateLanguages":18,"viewCount":18,"url":18,"parentIds":1306,"statistic":18},[],{"title":1304},{"EN":1305},"Schlumberger Palo Alto Research, Palo Alto, CA",[],{"title":1308,"openalex":1310},{"EN":1309},"Demetri Terzopoulos",{"VOID":1311},"A5034397232",{"id":1313,"sortIndex":72,"researcher":18,"roles":1314,"affiliations":1315,"properties":1324,"displayName":1328,"givenName":18,"familyName":18},"552f39d4-896d-48ee-ae09-0332a08ae974",[],[1316],{"id":1317,"sortIndex":19,"affiliation":1318,"properties":18},"152af4f2-9bed-4e67-8bcb-78a09ba7a4b0",{"id":1317,"createTime":18,"updateTime":18,"relativeEntities":1319,"slug":18,"properties":1320,"entityType":18,"verifyStatus":18,"verifyTime":18,"verifyNote":18,"languages":18,"translateLanguages":18,"viewCount":18,"url":18,"parentIds":1323,"statistic":18},[],{"title":1321},{"VI":1322},"California Institute of Technology, Pasadena",[],{"orcid":1325,"title":1327,"openalex":1329},{"VOID":1326},"https:\u002F\u002Forcid.org\u002F0000-0002-5652-5303",{"EN":1328},"John Platt",{"VOID":1330},"A5073032636",{"id":1332,"sortIndex":155,"researcher":18,"roles":1333,"affiliations":1334,"properties":1341,"displayName":1343,"givenName":18,"familyName":18},"17e7d5d4-5c70-45f7-951f-c57641f15cf2",[],[1335],{"id":1317,"sortIndex":19,"affiliation":1336,"properties":18},{"id":1317,"createTime":18,"updateTime":18,"relativeEntities":1337,"slug":18,"properties":1338,"entityType":18,"verifyStatus":18,"verifyTime":18,"verifyNote":18,"languages":18,"translateLanguages":18,"viewCount":18,"url":18,"parentIds":1340,"statistic":18},[],{"title":1339},{"VI":1322},[],{"title":1342,"openalex":1344},{"EN":1343},"Alan H. Barr",{"VOID":1345},"A5029476039",{"id":1347,"sortIndex":74,"researcher":18,"roles":1348,"affiliations":1349,"properties":1356,"displayName":1360,"givenName":18,"familyName":18},"9e85fab9-9022-45ce-897d-e142097a1959",[],[1350],{"id":1300,"sortIndex":19,"affiliation":1351,"properties":18},{"id":1300,"createTime":18,"updateTime":18,"relativeEntities":1352,"slug":18,"properties":1353,"entityType":18,"verifyStatus":18,"verifyTime":18,"verifyNote":18,"languages":18,"translateLanguages":18,"viewCount":18,"url":18,"parentIds":1355,"statistic":18},[],{"title":1354},{"EN":1305},[],{"orcid":1357,"title":1359,"openalex":1361},{"VOID":1358},"https:\u002F\u002Forcid.org\u002F0009-0007-1768-4591",{"EN":1360},"Kurt Fleischer",{"VOID":1362},"A5041276996",{"url":18,"publisher":1364,"properties":1378},{"id":6,"createTime":7,"updateTime":8,"relativeEntities":1365,"slug":10,"properties":1366,"entityType":16,"verifyStatus":17,"verifyTime":18,"verifyNote":18,"languages":18,"translateLanguages":18,"viewCount":19,"subjectFields":1369,"manageAffiliations":1370,"indexDatabases":1371,"url":18,"thumbnailPath":18,"statistic":18,"gsStatistic":18,"type":18,"analyzePriority":18},[],{"issn":1367,"title":1368},{"VOID":13},{"EN":15},[],[],[1372],{"id":24,"indexDatabase":1373,"url":35,"indexYears":36,"academicFieldIds":18,"indexDatabaseRanking":37},{"id":26,"createTime":18,"updateTime":18,"relativeEntities":1374,"label":1375,"description":1376,"key":32,"publicationTags":1377,"standard":18},[],{"EN":29,"VI":29},{"EN":29,"VI":31},[34],{"issue":1379,"pages":1380,"volume":1382},{"VOID":965},{"VOID":1381},"205-214",{"VOID":969},1085,{"total":1383,"publishYear":972,"statisticByYear":1385},{"2012":184,"2013":234,"2014":171,"2015":180,"2016":310,"2017":234,"2018":384,"2019":172,"2020":166,"2021":172,"2022":163,"2023":154,"2024":159},[37],[1388,1391,1394,1397,1400,1403,1406,1409,1412,1415,1418,1421,1424,1427,1430,1433,1436,1439,1442,1445,1448,1451,1454,1457,1460,1463],{"id":18,"text":1389,"url":18,"identifiers":1390},"Armstrong , W.W. , and Green , M ., \" The dynamics of articulated rigid bodies for purposes of animation,\" Proc . Graphics Interface '85 , Montreal, Canada , 1985 , 407 - 415 . Armstrong, W.W., and Green, M., \"The dynamics of articulated rigid bodies for purposes of animation,\" Proc. Graphics Interface '85, Montreal, Canada, 1985, 407-415.",{},{"id":18,"text":1392,"url":18,"identifiers":1393},"10.1145\u002F800031.808573",{"doi":1392},{"id":18,"text":1395,"url":18,"identifiers":1396},"Courant , R. , and Hilbert , D. , Methods of Mathematical Physics , Vol. I , Interscienee , London , 1953 . Courant, R., and Hilbert, D., Methods of Mathematical Physics, Vol. I, Interscienee, London, 1953.",{},{"id":18,"text":1398,"url":18,"identifiers":1399},"Dahlquist , G. , and Bjorek , A. , Numerical Methods , Prentice-HM1 , Englewood Cliffs , N J , 1974 . Dahlquist, G., and Bjorek, A., Numerical Methods, Prentice-HM1, Englewood Cliffs, N J, 1974.",{},{"id":18,"text":1401,"url":18,"identifiers":1402},"10.1007\u002F978-1-4612-6333-3",{"doi":1401},{"id":18,"text":1404,"url":18,"identifiers":1405},"do Carmo , M.P. , Differential Geometry of Curves and Surfaces , Prentice-Hall , Englewood Cliffs , N J, 1974 . do Carmo, M.P., Differential Geometry of Curves and Surfaces, Prentice-Hall, Englewood Cliffs, N J, 1974.",{},{"id":18,"text":1407,"url":18,"identifiers":1408},"Faux , ,I.D., and Pratt~ M.J. , Computational Geometry for Design and Manufacture , Halstead Press , Horwood, NY , 1981 . Faux, ,I.D., and Pratt~ M.J., Computational Geometry for Design and Manufacture, Halstead Press, Horwood, NY, 1981.",{},{"id":18,"text":1410,"url":18,"identifiers":1411},"10.1145\u002F15886.15894",{"doi":1410},{"id":18,"text":1413,"url":18,"identifiers":1414},"Fung , Y.C. , Foundations of Solid Mechanics , Prentice- Hall, Englewood Cliffs , N J , 1965 . Fung, Y.C., Foundations of Solid Mechanics, Prentice- Hall, Englewood Cliffs, N J, 1965.",{},{"id":18,"text":1416,"url":18,"identifiers":1417},"Gelfand~ I.M. ~ and Fomin , S.V. , Calculus of Variations , Prentice-Hall , Englewood Cliffs , N J, 1963 . Gelfand~ I.M.~ and Fomin, S.V., Calculus of Variations, Prentice-Hall, Englewood Cliffs, N J, 1963.",{},{"id":18,"text":1419,"url":18,"identifiers":1420},"Goldsteln~ H. ClassicalMechanics Addison-Wesley Reading MA 1950.  Goldsteln~ H. ClassicalMechanics Addison-Wesley Reading MA 1950.",{},{"id":18,"text":1422,"url":18,"identifiers":1423},"10.1145\u002F15886.15901",{"doi":1422},{"id":18,"text":1425,"url":18,"identifiers":1426},"10.1145\u002F15886.15902",{"doi":1425},{"id":18,"text":1428,"url":18,"identifiers":1429},"10.1145\u002F800031.808594",{"doi":1428},{"id":18,"text":1431,"url":18,"identifiers":1432},"Landau , L.D. , and Lifshitz , E.M. , Theory of Elasticity , Pergamon Press , London, UK , 1959 . Landau, L.D., and Lifshitz, E.M., Theory of Elasticity, Pergamon Press, London, UK, 1959.",{},{"id":18,"text":1434,"url":18,"identifiers":1435},"Lapidus , L. , and Pinder , G.F. , Numerical Solution of Partial Differential Equations in Science and Engineering , Wiley , New York, NY , 1982 . Lapidus, L., and Pinder, G.F., Numerical Solution of Partial Differential Equations in Science and Engineering, Wiley, New York, NY, 1982.",{},{"id":18,"text":1437,"url":18,"identifiers":1438},"10.1145\u002F15886.15893",{"doi":1437},{"id":18,"text":1440,"url":18,"identifiers":1441},"10.1145\u002F15886.15903",{"doi":1440},{"id":18,"text":1443,"url":18,"identifiers":1444},"Stoker , J . J . , Nonlinear Elasticity , New York, NY , 1968 . Stoker, J .J ., Nonlinear Elasticity, New York, NY, 1968.",{},{"id":18,"text":1446,"url":18,"identifiers":1447},"10.1016\u002F0734-189X(83)90020-8",{"doi":1446},{"id":18,"text":1449,"url":18,"identifiers":1450},"10.1109\u002FTPAMI.1986.4767807",{"doi":1449},{"id":18,"text":1452,"url":18,"identifiers":1453},"Terzopoulos , D. ~ \" On matching deformable models to images: Direct and iterative solutions,\" Topical Meeting on Machine Vision , Technical Digest Series , Vol. 1~., Optical Society of America, Washington, DC, 1987 , 160 - 167 . Terzopoulos, D.~ \"On matching deformable models to images: Direct and iterative solutions,\" Topical Meeting on Machine Vision, Technical Digest Series, Vol. 1~., Optical Society of America, Washington, DC, 1987, 160-167.",{},{"id":18,"text":1455,"url":18,"identifiers":1456},"10.1145\u002F15886.15891",{"doi":1455},{"id":18,"text":1458,"url":18,"identifiers":1459},"10.5555\u002F20313.20331",{"doi":1458},{"id":18,"text":1461,"url":18,"identifiers":1462},"10.1145\u002F15886.15895",{"doi":1461},{"id":18,"text":1464,"url":18,"identifiers":1465},"Zienkiewicz , O.C. , The Finite Element Method ; Third edition, McGraw-Hill , London , 1977 . Zienkiewicz, O.C., The Finite Element Method; Third edition, McGraw-Hill, London, 1977.",{},{"id":1467,"createTime":1468,"updateTime":1468,"relativeEntities":1469,"slug":1470,"properties":1471,"entityType":910,"verifyStatus":60,"verifyTime":1468,"verifyNote":911,"languages":1482,"translateLanguages":18,"viewCount":19,"primaryUrl":1483,"fullTextUrl":18,"authors":1484,"publicationType":947,"publisherRelationship":1564,"citationCount":1586,"citationInfo":1587,"publishDate":1590,"publishYear":1588,"citationAnalyzeStatus":17,"lastCitationAnalyze":18,"indexDatabases":1591,"openAccess":18,"references":1592,"isForceReanalyzing":1082},"ab353c63-7efd-4668-89bb-911958410073","2024-10-01T07:53:37.131+00:00",[],"Surface-reconstruction-from-unorganized-points",{"openalex":1472,"mag":1474,"abstract":1476,"title":1478,"doi":1480},{"VOID":1473},"W2998115525",{"VOID":1475},"2998115525",{"EN":1477},"\u003Cjats:p>\n            We describe and demonstrate an algorithm that takes as input an unorganized set of points {x\n            \u003Cjats:sub>l\u003C\u002Fjats:sub>\n            , . . . . x\n            \u003Cjats:sub>n\u003C\u002Fjats:sub>\n            } ⊂ R\n            \u003Cjats:sup>3\u003C\u002Fjats:sup>\n            on or near an unknown manifold M, and produces as output a simplicial surface that approximates M. Neither the topology, the presence of boundaries, nor the geometry of M are assumed to be known in advance - all are inferred automatically from the data. This problem naturally arises in a variety of practical situations such as range scanning an object from multiple view points, recovery of biological shapes from two-dimensional slices, and interactive surface sketching.\n          \u003C\u002Fjats:p>",{"EN":1479},"Surface reconstruction from unorganized points",{"VOID":1481},"10.1145\u002F142920.134011",[64],"https:\u002F\u002Fdl.acm.org\u002Fdoi\u002F10.1145\u002F142920.134011",[1485,1504,1519,1534,1549],{"id":1486,"sortIndex":19,"researcher":18,"roles":1487,"affiliations":1488,"properties":1497,"displayName":1501,"givenName":18,"familyName":18},"72ab286c-126d-47fc-ade7-0123412e019a",[],[1489],{"id":1490,"sortIndex":19,"affiliation":1491,"properties":18},"66105dfd-12f7-42f7-85d5-39cd80e16a44",{"id":1490,"createTime":18,"updateTime":18,"relativeEntities":1492,"slug":18,"properties":1493,"entityType":18,"verifyStatus":18,"verifyTime":18,"verifyNote":18,"languages":18,"translateLanguages":18,"viewCount":18,"url":18,"parentIds":1496,"statistic":18},[],{"title":1494},{"VI":1495},"University of Washington, Seattle, WA",[],{"orcid":1498,"title":1500,"openalex":1502},{"VOID":1499},"https:\u002F\u002Forcid.org\u002F0000-0002-9699-2539",{"EN":1501},"Hugues Hoppe",{"VOID":1503},"A5056912277",{"id":1505,"sortIndex":72,"researcher":18,"roles":1506,"affiliations":1507,"properties":1514,"displayName":1516,"givenName":18,"familyName":18},"1b15da21-ff24-4889-b98f-e1bee714836b",[],[1508],{"id":1490,"sortIndex":19,"affiliation":1509,"properties":18},{"id":1490,"createTime":18,"updateTime":18,"relativeEntities":1510,"slug":18,"properties":1511,"entityType":18,"verifyStatus":18,"verifyTime":18,"verifyNote":18,"languages":18,"translateLanguages":18,"viewCount":18,"url":18,"parentIds":1513,"statistic":18},[],{"title":1512},{"VI":1495},[],{"title":1515,"openalex":1517},{"EN":1516},"Tony DeRose",{"VOID":1518},"A5030916311",{"id":1520,"sortIndex":155,"researcher":18,"roles":1521,"affiliations":1522,"properties":1529,"displayName":1531,"givenName":18,"familyName":18},"44d8f54f-fccc-49ba-ae2a-b57530610904",[],[1523],{"id":1490,"sortIndex":19,"affiliation":1524,"properties":18},{"id":1490,"createTime":18,"updateTime":18,"relativeEntities":1525,"slug":18,"properties":1526,"entityType":18,"verifyStatus":18,"verifyTime":18,"verifyNote":18,"languages":18,"translateLanguages":18,"viewCount":18,"url":18,"parentIds":1528,"statistic":18},[],{"title":1527},{"VI":1495},[],{"title":1530,"openalex":1532},{"EN":1531},"Tom Duchamp",{"VOID":1533},"A5007625906",{"id":1535,"sortIndex":74,"researcher":18,"roles":1536,"affiliations":1537,"properties":1544,"displayName":1546,"givenName":18,"familyName":18},"7c762966-e3f8-4c2d-a2fe-13f6f888727d",[],[1538],{"id":1490,"sortIndex":19,"affiliation":1539,"properties":18},{"id":1490,"createTime":18,"updateTime":18,"relativeEntities":1540,"slug":18,"properties":1541,"entityType":18,"verifyStatus":18,"verifyTime":18,"verifyNote":18,"languages":18,"translateLanguages":18,"viewCount":18,"url":18,"parentIds":1543,"statistic":18},[],{"title":1542},{"VI":1495},[],{"title":1545,"openalex":1547},{"EN":1546},"John A. McDonald",{"VOID":1548},"A5104357810",{"id":1550,"sortIndex":77,"researcher":18,"roles":1551,"affiliations":1552,"properties":1559,"displayName":1561,"givenName":18,"familyName":18},"662af4a2-f724-4af5-8601-0dda676b297d",[],[1553],{"id":1490,"sortIndex":19,"affiliation":1554,"properties":18},{"id":1490,"createTime":18,"updateTime":18,"relativeEntities":1555,"slug":18,"properties":1556,"entityType":18,"verifyStatus":18,"verifyTime":18,"verifyNote":18,"languages":18,"translateLanguages":18,"viewCount":18,"url":18,"parentIds":1558,"statistic":18},[],{"title":1557},{"VI":1495},[],{"title":1560,"openalex":1562},{"EN":1561},"Werner Stuetzle",{"VOID":1563},"A5027273230",{"url":18,"publisher":1565,"properties":1579},{"id":6,"createTime":7,"updateTime":8,"relativeEntities":1566,"slug":10,"properties":1567,"entityType":16,"verifyStatus":17,"verifyTime":18,"verifyNote":18,"languages":18,"translateLanguages":18,"viewCount":19,"subjectFields":1570,"manageAffiliations":1571,"indexDatabases":1572,"url":18,"thumbnailPath":18,"statistic":18,"gsStatistic":18,"type":18,"analyzePriority":18},[],{"issn":1568,"title":1569},{"VOID":13},{"EN":15},[],[],[1573],{"id":24,"indexDatabase":1574,"url":35,"indexYears":36,"academicFieldIds":18,"indexDatabaseRanking":37},{"id":26,"createTime":18,"updateTime":18,"relativeEntities":1575,"label":1576,"description":1577,"key":32,"publicationTags":1578,"standard":18},[],{"EN":29,"VI":29},{"EN":29,"VI":31},[34],{"issue":1580,"pages":1582,"volume":1584},{"VOID":1581},"2",{"VOID":1583},"71-78",{"VOID":1585},"26",1052,{"total":1586,"publishYear":1588,"statisticByYear":1589},1992,{"2012":232,"2013":179,"2014":180,"2015":182,"2016":384,"2017":310,"2018":170,"2019":184,"2020":312,"2021":173,"2022":599,"2023":170,"2024":160},"1992-07-01",[37],[1593,1596,1599,1602,1605,1608,1611,1614,1617,1620,1623,1626,1629,1632,1635,1638,1641,1644,1647,1650,1653,1656,1659,1662,1665],{"id":18,"text":1594,"url":18,"identifiers":1595},"10.1137\u002F0722020",{"doi":1594},{"id":18,"text":1597,"url":18,"identifiers":1598},"10.1145\u002F358841.358850",{"doi":1597},{"id":18,"text":1600,"url":18,"identifiers":1601},"10.1109\u002F34.31446",{"doi":1600},{"id":18,"text":1603,"url":18,"identifiers":1604},"10.1109\u002FTPAMI.1985.4767682",{"doi":1603},{"id":18,"text":1606,"url":18,"identifiers":1607},"10.1145\u002F88560.88575",{"doi":1606},{"id":18,"text":1609,"url":18,"identifiers":1610},"John A. Eisenman . Graphical editing of composite bezier curves. Master's thesis , Department of Electrical Engineering and Computer Science , M.I.T. , 1988 . John A. Eisenman. Graphical editing of composite bezier curves. Master's thesis, Department of Electrical Engineering and Computer Science, M.I.T., 1988.",{},{"id":18,"text":1612,"url":18,"identifiers":1613},"10.1007\u002F978-1-4899-3442-0_27",{"doi":1612},{"id":18,"text":1615,"url":18,"identifiers":1616},"10.5555\u002F578533",{"doi":1615},{"id":18,"text":1618,"url":18,"identifiers":1619},"10.1080\u002F01621459.1989.10478797",{"doi":1618},{"id":18,"text":1621,"url":18,"identifiers":1622},"Averill M. Law and W. David Kelton . Simulation Modeling and Analysis . McGraw-Hill, Inc. , second edition, 1991 . Averill M. Law and W. David Kelton. Simulation Modeling and Analysis. McGraw-Hill, Inc., second edition, 1991.",{},{"id":18,"text":1624,"url":18,"identifiers":1625},"Marshal L. Merriam . Experience with the cyberware 3D digitizer . In NCGA Proceedings , pages 125 - 133 , March 1992 . Marshal L. Merriam. Experience with the cyberware 3D digitizer. In NCGA Proceedings, pages 125-133, March 1992.",{},{"id":18,"text":1627,"url":18,"identifiers":1628},"David Meyers , Shelly Skinner , and Kenneth Sloan . Surfaces from contours: The correspondence and branching problems . In Proceedings of Graphics Interface '91 , pages 246 - 254 , June 1991 . David Meyers, Shelly Skinner, and Kenneth Sloan. Surfaces from contours: The correspondence and branching problems. In Proceedings of Graphics Interface '91, pages 246-254, June 1991.",{},{"id":18,"text":1630,"url":18,"identifiers":1631},"Doug Moore and Joe Warren . Approximation of dense scattered data using algebraic surfaces. TR 90-135 , Rice University , October 1990 . Doug Moore and Joe Warren. Approximation of dense scattered data using algebraic surfaces. TR 90-135, Rice University, October 1990.",{},{"id":18,"text":1633,"url":18,"identifiers":1634},"Doug Moore and Joe Warren . Adaptive mesh generation ii: Packing solids. TR 90-139 , Rice University , March 1991 . Doug Moore and Joe Warren. Adaptive mesh generation ii: Packing solids. TR 90-139, Rice University, March 1991.",{},{"id":18,"text":1636,"url":18,"identifiers":1637},"10.1145\u002F127719.122743",{"doi":1636},{"id":18,"text":1639,"url":18,"identifiers":1640},"10.1109\u002F38.79453",{"doi":1639},{"id":18,"text":1642,"url":18,"identifiers":1643},"Barrett O'Neill . Elementary Differential Geometry . Academic Press , Orlando, Florida , 1966 . Barrett O'Neill. Elementary Differential Geometry. Academic Press, Orlando, Florida, 1966.",{},{"id":18,"text":1645,"url":18,"identifiers":1646},"10.1145\u002F37402.37420",{"doi":1645},{"id":18,"text":1648,"url":18,"identifiers":1649},"10.1109\u002F38.103389",{"doi":1648},{"id":18,"text":1651,"url":18,"identifiers":1652},"10.5555\u002F77587",{"doi":1651},{"id":18,"text":1654,"url":18,"identifiers":1655},"Philip J. Schneider . Phoenix: An interactive curve design system based on the automatic fitting of hand-sketched curves. Master's thesis , Department of Computer Science , U. of Washington , 1988 . Philip J. Schneider. Phoenix: An interactive curve design system based on the automatic fitting of hand-sketched curves. Master's thesis, Department of Computer Science, U. of Washington, 1988.",{},{"id":18,"text":1657,"url":18,"identifiers":1658},"R.B. Schudy and D. H , Ballard . Towards an anatomical model of heart motion as seen in 4-d cardiac ultrasound data . In Proceedings of the 6th Conference on Computer Applications in Radiology and Computer.Aided Analysis of Radiological Images , 1979 . R.B. Schudy and D. H, Ballard. Towards an anatomical model of heart motion as seen in 4-d cardiac ultrasound data. In Proceedings of the 6th Conference on Computer Applications in Radiology and Computer.Aided Analysis of Radiological Images, 1979.",{},{"id":18,"text":1660,"url":18,"identifiers":1661},"10.1145\u002F127719.122745",{"doi":1660},{"id":18,"text":1663,"url":18,"identifiers":1664},"10.1016\u002F0262-8856(86)90029-6",{"doi":1663},{"id":18,"text":1666,"url":18,"identifiers":1667},"10.1007\u002FBF01900346",{"doi":1666},{"id":1669,"createTime":1670,"updateTime":1670,"relativeEntities":1671,"slug":1672,"properties":1673,"entityType":910,"verifyStatus":60,"verifyTime":1670,"verifyNote":911,"languages":1683,"translateLanguages":18,"viewCount":19,"primaryUrl":1684,"fullTextUrl":18,"authors":1685,"publicationType":947,"publisherRelationship":1703,"citationCount":1723,"citationInfo":1724,"publishDate":983,"publishYear":972,"citationAnalyzeStatus":17,"lastCitationAnalyze":18,"indexDatabases":1726,"openAccess":18,"references":1727,"isForceReanalyzing":1082},"436e52ec-7e06-44e0-81d4-284e760686f3","2024-10-11T13:09:05.168+00:00",[],"Direct-least-squares-fitting-of-algebraic-surfaces",{"openalex":1674,"mag":1676,"abstract":1678,"title":1680,"doi":1682},{"VOID":1675},"W3000400585",{"VOID":1677},"3000400585",{"EN":1679},"\u003Cjats:p>\n            In the course of developing a system for fitting smooth curves to camera input we have developed several direct (i.e. noniterative) methods for fitting a shape (line, circle, conic, cubic, plane, sphere, quadric, etc.) to a set of points, namely exact fit, simple fit, spherical fit, and blend fit. These methods are all dimension-independent, being just as suitable for 3D surfaces as for the 2D curves they were originally developed for.Exact fit generalizes to arbitrary shapes (in the sense of the term defined in this paper) the well-known determinant method for planar exact fit. Simple fit is a naive reduction of the general overconstrained case to the exact case. Spherical fit takes advantage of a special property of circles and spheres that permits robust fitting; no prior direct circle fitters have been as robust, and there have been no previous sphere fitters. Blend fit finds the best fit to a set of points of a useful generalization of Middleditch-Sears blending curves and surfaces, via a nonpolynomial generalization of planar fit.These methods all require (\n            \u003Cjats:italic>am\u003C\u002Fjats:italic>\n            +\n            \u003Cjats:italic>bn\u003C\u002Fjats:italic>\n            )\n            \u003Cjats:italic>n\u003C\u002Fjats:italic>\n            \u003Cjats:sup>2\u003C\u002Fjats:sup>\n            operations for fitting a surface of order\n            \u003Cjats:italic>n\u003C\u002Fjats:italic>\n            to\n            \u003Cjats:italic>m\u003C\u002Fjats:italic>\n            points, with\n            \u003Cjats:italic>a\u003C\u002Fjats:italic>\n            = 2 and\n            \u003Cjats:italic>b\u003C\u002Fjats:italic>\n            = 1\u002F3 typically, except for spherical fit where\n            \u003Cjats:italic>b\u003C\u002Fjats:italic>\n            is larger due to the need to extract eigenvectors. All these methods save simple fit achieve a robustness previously attained by direct algorithms only for fitting planes. All admit incremental batched addition and deletion of points at cost\n            \u003Cjats:italic>an\u003C\u002Fjats:italic>\n            \u003Cjats:sup>2\u003C\u002Fjats:sup>\n            per point and\n            \u003Cjats:italic>bn\u003C\u002Fjats:italic>\n            \u003Cjats:sup>3\u003C\u002Fjats:sup>\n            per batch.\n          \u003C\u002Fjats:p>",{"EN":1681},"Direct least-squares fitting of algebraic surfaces",{"VOID":1645},[64],"https:\u002F\u002Fdl.acm.org\u002Fdoi\u002F10.1145\u002F37402.37420",[1686],{"id":1687,"sortIndex":19,"researcher":18,"roles":1688,"affiliations":1689,"properties":1698,"displayName":1700,"givenName":18,"familyName":18},"b4995eab-6505-41bf-9cf4-f1dcaf51c040",[],[1690],{"id":1691,"sortIndex":19,"affiliation":1692,"properties":18},"3ca6b6da-0e36-4941-b95d-654f6d3e2558",{"id":1691,"createTime":18,"updateTime":18,"relativeEntities":1693,"slug":18,"properties":1694,"entityType":18,"verifyStatus":18,"verifyTime":18,"verifyNote":18,"languages":18,"translateLanguages":18,"viewCount":18,"url":18,"parentIds":1697,"statistic":18},[],{"title":1695},{"EN":1696},"Sun Microsystems, Inc.",[],{"title":1699,"openalex":1701},{"EN":1700},"Vaughan Pratt",{"VOID":1702},"A5052139381",{"url":18,"publisher":1704,"properties":1718},{"id":6,"createTime":7,"updateTime":8,"relativeEntities":1705,"slug":10,"properties":1706,"entityType":16,"verifyStatus":17,"verifyTime":18,"verifyNote":18,"languages":18,"translateLanguages":18,"viewCount":19,"subjectFields":1709,"manageAffiliations":1710,"indexDatabases":1711,"url":18,"thumbnailPath":18,"statistic":18,"gsStatistic":18,"type":18,"analyzePriority":18},[],{"issn":1707,"title":1708},{"VOID":13},{"EN":15},[],[],[1712],{"id":24,"indexDatabase":1713,"url":35,"indexYears":36,"academicFieldIds":18,"indexDatabaseRanking":37},{"id":26,"createTime":18,"updateTime":18,"relativeEntities":1714,"label":1715,"description":1716,"key":32,"publicationTags":1717,"standard":18},[],{"EN":29,"VI":29},{"EN":29,"VI":31},[34],{"issue":1719,"pages":1720,"volume":1722},{"VOID":965},{"VOID":1721},"145-152",{"VOID":969},451,{"total":1723,"publishYear":972,"statisticByYear":1725},{"2012":161,"2013":160,"2014":231,"2015":167,"2016":231,"2017":158,"2018":83,"2019":163,"2020":101,"2021":179,"2022":164,"2023":234,"2024":159},[37],[1728,1731,1734,1737,1740,1743,1746,1749,1752,1755,1758,1761,1764,1767,1770,1773,1776,1779,1782,1785,1788,1791,1794,1797],{"id":18,"text":1729,"url":18,"identifiers":1730},"10.1016\u002F0146-664X(74)90008-2",{"doi":1729},{"id":18,"text":1732,"url":18,"identifiers":1733},"10.1177\u002F00220345720510055101",{"doi":1732},{"id":18,"text":1735,"url":18,"identifiers":1736},"10.1016\u002F0146-664X(79)90082-0",{"doi":1735},{"id":18,"text":1738,"url":18,"identifiers":1739},"10.1109\u002FTC.1976.1674543",{"doi":1738},{"id":18,"text":1741,"url":18,"identifiers":1742},"C. de Boor , A P r a c t i c a l Guide t o Splines , Springer-Verlag , 1978 . C. de Boor, A P r a c t i c a l Guide t o Splines, Springer-Verlag, 1978.",{},{"id":18,"text":1744,"url":18,"identifiers":1745},"I.D. Faux and M.J. Pratt , Computational Geometry for Design and Manufacture , Ellis Horwood , 1978 . I.D. Faux and M.J. Pratt, Computational Geometry for Design and Manufacture, Ellis Horwood, 1978.",{},{"id":18,"text":1747,"url":18,"identifiers":1748},"Y. Gordon , Numerical Methods for CAD , MIT Press , 1986 . Y. Gordon, Numerical Methods for CAD, MIT Press, 1986.",{},{"id":18,"text":1750,"url":18,"identifiers":1751},"A.A. Giordano and F.M. Hsu , L e a s t Squares E s t i m a t i o n w i t h A p p l i c a t i o n s t o D i g i t a l S i g n a l P r o c e s s i n g , Wiley , 1985 . A.A. Giordano and F.M. Hsu, L e a s t Squares E s t i m a t i o n w i t h A p p l i c a t i o n s t o D i g i t a l S i g n a l P r o c e s s i n g , Wiley, 1985.",{},{"id":18,"text":1753,"url":18,"identifiers":1754},"R. Gnanadesikan , Methods for S t a t i s t i c a l Data A n a l y s i s o f M u l t i v a r i a t e O b s e r v a t i o n s , Wiley , 1977 . R. Gnanadesikan, Methods for S t a t i s t i c a l Data A n a l y s i s o f M u l t i v a r i a t e O b s e r v a t i o n s , Wiley, 1977.",{},{"id":18,"text":1756,"url":18,"identifiers":1757},"C. Hoffman and J. Hopcroft , Automatic Surface Generation in Computer Aided Design, The Visual Computer , 1 , 2 , 92-100 ( 1985 ). C. Hoffman and J. Hopcroft, Automatic Surface Generation in Computer Aided Design, The Visual Computer, 1, 2, 92-100 (1985).",{},{"id":18,"text":1759,"url":18,"identifiers":1760},"10.1016\u002F0010-4485(86)90091-6",{"doi":1759},{"id":18,"text":1762,"url":18,"identifiers":1763},"C.L. Lawson and R.J. Hanson , Solving Least-Squares P r o b - lems , Prentice-Hall , 1974 . C.L. Lawson and R.J. Hanson, Solving Least-Squares P r o b - lems, Prentice-Hall, 1974.",{},{"id":18,"text":1765,"url":18,"identifiers":1766},"E.A. Lord and C.B. Wilson , The Mathematical D e s c r i p t i o n o f Shape and Form , Ellis Horwood , Chichester , 1984 . E.A. Lord and C.B. Wilson, The Mathematical D e s c r i p t i o n o f Shape and Form, Ellis Horwood, Chichester, 1984.",{},{"id":18,"text":1768,"url":18,"identifiers":1769},"10.1145\u002F325165.325231",{"doi":1768},{"id":18,"text":1771,"url":18,"identifiers":1772},"V.S. Nalwa and E. Pauchon , Edgel-Aggregation and Edge-Description , Eighth International Conference on Pattern Rccogrdtion, 604-609 , Paris , Oct. 1986 , V.S. Nalwa and E. Pauchon, Edgel-Aggregation and Edge-Description, Eighth International Conference on Pattern Rccogrdtion, 604-609, Paris, Oct. 1986,",{},{"id":18,"text":1774,"url":18,"identifiers":1775},"10.1016\u002F0031-3203(70)90040-3",{"doi":1774},{"id":18,"text":1777,"url":18,"identifiers":1778},"10.1145\u002F357314.357315",{"doi":1777},{"id":18,"text":1780,"url":18,"identifiers":1781},"K. Pearson , On lines and planes of closest fit to systems of points in space , Philos. Mag. Eer. 6 , 2 ,559, 1901 . K. Pearson, On lines and planes of closest fit to systems of points in space, Philos. Mag. Eer. 6, 2,559, 1901.",{},{"id":18,"text":1783,"url":18,"identifiers":1784},"C. Pearson , Numerical Methods in Engineering and Science , Van Nostrand Reinhold , 1986 . C. Pearson, Numerical Methods in Engineering and Science, Van Nostrand Reinhold, 1986.",{},{"id":18,"text":1786,"url":18,"identifiers":1787},"M.A. Penna and R.R. Patterson , P r o j e c t i v e Geometry and i t s A p p l i c a t i o n s t o Computer G r a p h i c s , Prentice-HMl , New Jersey , 1986 . M.A. Penna and R.R. Patterson, P r o j e c t i v e Geometry and i t s A p p l i c a t i o n s t o Computer G r a p h i c s , Prentice-HMl, New Jersey, 1986.",{},{"id":18,"text":1789,"url":18,"identifiers":1790},"10.1145\u002F800059.801153",{"doi":1789},{"id":18,"text":1792,"url":18,"identifiers":1793},"10.1145\u002F325165.325225",{"doi":1792},{"id":18,"text":1795,"url":18,"identifiers":1796},"D. Proflltt , The Measurement of Circularity and Ellipticity on a Digital Grid , Pattern Recognition 15 , 5 , 383-387, 1982 . D. Proflltt, The Measurement of Circularity and Ellipticity on a Digital Grid, Pattern Recognition 15, 5, 383-387, 1982.",{},{"id":18,"text":1798,"url":18,"identifiers":1799},"10.1016\u002F0146-664X(82)90101-0",{"doi":1798},{"id":1801,"createTime":1802,"updateTime":1802,"relativeEntities":1803,"slug":1804,"properties":1805,"entityType":910,"verifyStatus":60,"verifyTime":1816,"verifyNote":911,"languages":1817,"translateLanguages":18,"viewCount":19,"primaryUrl":1818,"fullTextUrl":18,"authors":1819,"publicationType":947,"publisherRelationship":1837,"citationCount":1859,"citationInfo":1860,"publishDate":1863,"publishYear":1861,"citationAnalyzeStatus":17,"lastCitationAnalyze":18,"indexDatabases":1864,"openAccess":18,"references":1865,"isForceReanalyzing":1082},"832608df-5f9d-44d6-b63e-044403445572","2024-09-05T18:19:36.748+00:00",[],"Juno-a-constraint-based-graphics-system",{"openalex":1806,"mag":1808,"abstract":1810,"title":1812,"doi":1814},{"VOID":1807},"W1982530240",{"VOID":1809},"1982530240",{"EN":1811},"\u003Cjats:p>Juno is a system that harmoniously integrates a language for describing pictures with a what-you-see-is-what-you-get image editor. Two of Juno's novelties are that geometric constraints are used to specify locations, and that the text of a Juno program is modified in response to the interactive editing of the displayed image that the program produces.\u003C\u002Fjats:p>",{"EN":1813},"Juno, a constraint-based graphics system",{"VOID":1815},"10.1145\u002F325165.325241","2024-09-05T18:19:36.747+00:00",[64],"https:\u002F\u002Fdl.acm.org\u002Fdoi\u002F10.1145\u002F325165.325241",[1820],{"id":1821,"sortIndex":19,"researcher":18,"roles":1822,"affiliations":1823,"properties":1832,"displayName":1834,"givenName":18,"familyName":18},"1ac7b94a-a3fb-4b87-9ab2-9df0305a67a5",[],[1824],{"id":1825,"sortIndex":19,"affiliation":1826,"properties":18},"4883ac36-307f-4cdc-8399-8f69a4c93c3d",{"id":1825,"createTime":18,"updateTime":18,"relativeEntities":1827,"slug":18,"properties":1828,"entityType":18,"verifyStatus":18,"verifyTime":18,"verifyNote":18,"languages":18,"translateLanguages":18,"viewCount":18,"url":18,"parentIds":1831,"statistic":18},[],{"title":1829},{"EN":1830},"DEC Systems Research Center, Xerox Palo Alto Research Center#TAB#",[],{"title":1833,"openalex":1835},{"EN":1834},"Greg Nelson",{"VOID":1836},"A5020128040",{"url":18,"publisher":1838,"properties":1852},{"id":6,"createTime":7,"updateTime":8,"relativeEntities":1839,"slug":10,"properties":1840,"entityType":16,"verifyStatus":17,"verifyTime":18,"verifyNote":18,"languages":18,"translateLanguages":18,"viewCount":19,"subjectFields":1843,"manageAffiliations":1844,"indexDatabases":1845,"url":18,"thumbnailPath":18,"statistic":18,"gsStatistic":18,"type":18,"analyzePriority":18},[],{"issn":1841,"title":1842},{"VOID":13},{"EN":15},[],[],[1846],{"id":24,"indexDatabase":1847,"url":35,"indexYears":36,"academicFieldIds":18,"indexDatabaseRanking":37},{"id":26,"createTime":18,"updateTime":18,"relativeEntities":1848,"label":1849,"description":1850,"key":32,"publicationTags":1851,"standard":18},[],{"EN":29,"VI":29},{"EN":29,"VI":31},[34],{"issue":1853,"pages":1855,"volume":1857},{"VOID":1854},"3",{"VOID":1856},"235-243",{"VOID":1858},"19",258,{"total":1859,"publishYear":1861,"statisticByYear":1862},1985,{"2012":77,"2013":155,"2015":74,"2016":77,"2018":72,"2019":155,"2020":72,"2023":155},"1985-07-01",[37],[1866,1869,1872,1875,1878,1881,1884,1887,1891,1894],{"id":18,"text":1867,"url":18,"identifiers":1868},"P. C. Baudelaire. Draw Manual. Alto User's Handbook Xerox Corp. Palo Alto CA 1979. Referenced by {101.  P. C. Baudelaire. Draw Manual. Alto User's Handbook Xerox Corp. Palo Alto CA 1979. Referenced by {101.",{},{"id":18,"text":1870,"url":18,"identifiers":1871},"Borning Alan, 1979, Xerox PARC",{},{"id":18,"text":1873,"url":18,"identifiers":1874},"Conte S. D., 1972, McGraw-Hill",{},{"id":18,"text":1876,"url":18,"identifiers":1877},"1956, Heath",{},{"id":18,"text":1879,"url":18,"identifiers":1880},"Dijkstra Edsger W., 1976, Prentice-Hall",{},{"id":18,"text":1882,"url":18,"identifiers":1883},"Knuth Donald E., 1979, Digital Press",{},{"id":18,"text":1885,"url":18,"identifiers":1886},"Bruce Lucas. Private communication February 1985.  Bruce Lucas. Private communication February 1985.",{},{"id":18,"text":1888,"url":18,"identifiers":1889},"Ivan Sutherland. Sketchpad A Man-Machine Graphical Communication System. PhD thesis MIT January 1963.  Ivan Sutherland. Sketchpad A Man-Machine Graphical Communication System. PhD thesis MIT January 1963.",{"doi":1890},"10.1145\u002F1461551.1461591",{"id":18,"text":1892,"url":18,"identifiers":1893},"Teitelman Warren, 1984, Xerox PARC",{},{"id":18,"text":1895,"url":18,"identifiers":1896},"10.1145\u002F357299.357303",{"doi":1895},{"id":1898,"createTime":1899,"updateTime":1899,"relativeEntities":1900,"slug":1901,"properties":1902,"entityType":910,"verifyStatus":60,"verifyTime":1899,"verifyNote":911,"languages":1913,"translateLanguages":18,"viewCount":19,"primaryUrl":1914,"fullTextUrl":18,"authors":1915,"publicationType":947,"publisherRelationship":1948,"citationCount":1969,"citationInfo":1970,"publishDate":1973,"publishYear":1971,"citationAnalyzeStatus":17,"lastCitationAnalyze":18,"indexDatabases":1974,"openAccess":18,"references":1975,"isForceReanalyzing":1082},"546c7d45-f84a-4e15-94c8-3ace2f9ccea7","2024-09-01T08:10:40.694+00:00",[],"A-system-for-algorithm-animation",{"openalex":1903,"mag":1905,"abstract":1907,"title":1909,"doi":1911},{"VOID":1904},"W2972748662",{"VOID":1906},"2972748662",{"EN":1908},"\u003Cjats:p>A software environment is described which provides facilities at a variety of levels for “animating” algorithms: exposing properties of programs by displaying multiple dynamic views of the program and associated data structures. The system is operational on a network of graphics-based, personal workstations and has been used successfully in several applications for teaching and research in computer science and mathematics. In this paper, we outline the conceptual framework that we have developed for animating algorithms, describe the system that we have implemented, and give several examples drawn from the host of algorithms that we have animated.\u003C\u002Fjats:p>",{"EN":1910},"A system for algorithm animation",{"VOID":1912},"10.1145\u002F964965.808596",[64],"https:\u002F\u002Fdl.acm.org\u002Fdoi\u002F10.1145\u002F964965.808596",[1916,1933],{"id":1917,"sortIndex":19,"researcher":18,"roles":1918,"affiliations":1919,"properties":1928,"displayName":1930,"givenName":18,"familyName":18},"79cde9be-f323-4882-8270-0221887347c2",[],[1920],{"id":1921,"sortIndex":19,"affiliation":1922,"properties":18},"b628c14c-67ae-4871-8434-12a1cd1e040c",{"id":1921,"createTime":18,"updateTime":18,"relativeEntities":1923,"slug":18,"properties":1924,"entityType":18,"verifyStatus":18,"verifyTime":18,"verifyNote":18,"languages":18,"translateLanguages":18,"viewCount":18,"url":18,"parentIds":1927,"statistic":18},[],{"title":1925},{"EN":1926},"Dept. of Computer Science, Brown University, Providence, RI",[],{"title":1929,"openalex":1931},{"EN":1930},"Marc H. Brown",{"VOID":1932},"A5100915322",{"id":1934,"sortIndex":72,"researcher":18,"roles":1935,"affiliations":1936,"properties":1943,"displayName":1945,"givenName":18,"familyName":18},"0c6901d8-e56e-4cb4-91f0-8d26cbf11310",[],[1937],{"id":1921,"sortIndex":19,"affiliation":1938,"properties":18},{"id":1921,"createTime":18,"updateTime":18,"relativeEntities":1939,"slug":18,"properties":1940,"entityType":18,"verifyStatus":18,"verifyTime":18,"verifyNote":18,"languages":18,"translateLanguages":18,"viewCount":18,"url":18,"parentIds":1942,"statistic":18},[],{"title":1941},{"EN":1926},[],{"title":1944,"openalex":1946},{"EN":1945},"Robert Sedgewick",{"VOID":1947},"A5077370067",{"url":18,"publisher":1949,"properties":1963},{"id":6,"createTime":7,"updateTime":8,"relativeEntities":1950,"slug":10,"properties":1951,"entityType":16,"verifyStatus":17,"verifyTime":18,"verifyNote":18,"languages":18,"translateLanguages":18,"viewCount":19,"subjectFields":1954,"manageAffiliations":1955,"indexDatabases":1956,"url":18,"thumbnailPath":18,"statistic":18,"gsStatistic":18,"type":18,"analyzePriority":18},[],{"issn":1952,"title":1953},{"VOID":13},{"EN":15},[],[],[1957],{"id":24,"indexDatabase":1958,"url":35,"indexYears":36,"academicFieldIds":18,"indexDatabaseRanking":37},{"id":26,"createTime":18,"updateTime":18,"relativeEntities":1959,"label":1960,"description":1961,"key":32,"publicationTags":1962,"standard":18},[],{"EN":29,"VI":29},{"EN":29,"VI":31},[34],{"issue":1964,"pages":1965,"volume":1967},{"VOID":1854},{"VOID":1966},"177-186",{"VOID":1968},"18",222,{"total":1969,"publishYear":1971,"statisticByYear":1972},1984,{"2012":77,"2013":72,"2014":72,"2015":78,"2016":155,"2017":77,"2018":74,"2019":170,"2020":72,"2021":78,"2022":72},"1984-07-01",[37],[1976,1979,1982,1985,1988,1991,1994,1997,2000,2003,2006,2009,2012,2015,2018],{"id":18,"text":1977,"url":18,"identifiers":1978},"10.1145\u002F953064.811152",{"doi":1977},{"id":18,"text":1980,"url":18,"identifiers":1981},"Baecker , Ronald , \"Sorting out Sorting ,\" 16mm color sound file , 25 minutes , 1981 . (SIGGRAPH 1981, Dallas, Texas) Baecker, Ronald, \"Sorting out Sorting,\" 16mm color sound file, 25 minutes, 1981. (SIGGRAPH 1981, Dallas, Texas)",{},{"id":18,"text":1983,"url":18,"identifiers":1984},"Booth , Kellogg , \" PQ Trees ,\" 16mm color silent file , 12 minutes , 1975 . Booth, Kellogg, \"PQ Trees,\" 16mm color silent file, 12 minutes, 1975.",{},{"id":18,"text":1986,"url":18,"identifiers":1987},"10.1145\u002F952980.808630",{"doi":1986},{"id":18,"text":1989,"url":18,"identifiers":1990},"10.1016\u002FS0146-664X(78)80016-1",{"doi":1989},{"id":18,"text":1992,"url":18,"identifiers":1993},"Goldberg Adele Smalltalk Addison-Wesley Reading MA 1983.  Goldberg Adele Smalltalk Addison-Wesley Reading MA 1983.",{},{"id":18,"text":1995,"url":18,"identifiers":1996},"Guibas , Leo and Sedgewick , Robert , \" A Dichromatic Framework for Balanced Trees ,\" in Proc. 19th Annual Symp. on Foundations of Computer Science , October 1978 , pp. 8 - 21 . Guibas, Leo and Sedgewick, Robert, \"A Dichromatic Framework for Balanced Trees,\" in Proc. 19th Annual Symp. on Foundations of Computer Science, October 1978, pp.8-21.",{},{"id":18,"text":1998,"url":18,"identifiers":1999},"Herot , Christopher F . , et. al., \"An Integrated Environment for Program Visualization,\" in Automated Tools for Information Systems Design , H.J. Schneider and A.I. Wasserman, Ed., North Holland Publishing Co. , 1982 , pp. 237 - 259 . Herot, Christopher F., et. al., \"An Integrated Environment for Program Visualization,\" in Automated Tools for Information Systems Design, H.J. Schneider and A.I. Wasserman, Ed., North Holland Publishing Co., 1982, pp. 237-259.",{},{"id":18,"text":2001,"url":18,"identifiers":2002},"Knowlton , Kenneth C . , \"L6 : Bell Telephone Laboratories Low-Level Linked List Language,\" two black and white sound films , 1966 . Knowlton, Kenneth C., \"L6: Bell Telephone Laboratories Low-Level Linked List Language,\" two black and white sound films, 1966.",{},{"id":18,"text":2004,"url":18,"identifiers":2005},"Myers Brad A. \"Displaying Data Structures for Interactive Debugging \" CSL-80-7 Xerox PARC Palo Alto CA 1980. (Summary in SIGGRAPH 1983)  Myers Brad A. \"Displaying Data Structures for Interactive Debugging \" CSL-80-7 Xerox PARC Palo Alto CA 1980. (Summary in SIGGRAPH 1983)",{},{"id":18,"text":2007,"url":18,"identifiers":2008},"10.1109\u002FC-M.1981.220255",{"doi":2007},{"id":18,"text":2010,"url":18,"identifiers":2011},"Reiss , Steven P . , \" PECAN : A Program Development System that Supports Multiple Views,\" Orlando , FL , March , 1984 . Reiss, Steven P., \"PECAN: A Program Development System that Supports Multiple Views,\" Orlando, FL, March, 1984.",{},{"id":18,"text":2013,"url":18,"identifiers":2014},"Sedgewick , Robert , Algorithms , Addison-Wesley , Reading, MA , 1983 . Sedgewick, Robert, Algorithms, Addison-Wesley, Reading, MA, 1983.",{},{"id":18,"text":2016,"url":18,"identifiers":2017},"Tufte , Edward R . , The Visual Display of Quantitative Information , Graphics Press , Cheshire, CT , 1983 . Tufte, Edward R., The Visual Display of Quantitative Information, Graphics Press, Cheshire, CT, 1983.",{},{"id":18,"text":2019,"url":18,"identifiers":2020},"Vitter , Jeffrey S . , \"USe R : Undo, Skip, et Redo,\" Pittsburg , PA , April , 1984 . Vitter, Jeffrey S., \"USeR: Undo, Skip, et Redo,\" Pittsburg, PA, April, 1984.",{},{"id":2022,"createTime":2023,"updateTime":2023,"relativeEntities":2024,"slug":2025,"properties":2026,"entityType":910,"verifyStatus":17,"verifyTime":2023,"verifyNote":2034,"languages":2035,"translateLanguages":18,"viewCount":19,"primaryUrl":2036,"fullTextUrl":18,"authors":2037,"publicationType":947,"publisherRelationship":2049,"citationCount":2071,"citationInfo":2072,"publishDate":2075,"publishYear":2073,"citationAnalyzeStatus":17,"lastCitationAnalyze":18,"indexDatabases":2076,"openAccess":18,"references":2077,"isForceReanalyzing":1082},"960a3fea-393b-4ec3-a116-f17558900f6e","2024-09-21T17:44:02.296+00:00",[],"Re",{"openalex":2027,"mag":2029,"title":2031,"doi":2032},{"VOID":2028},"W2046250219",{"VOID":2030},"2046250219",{"EN":2025},{"VOID":2033},"10.1145\u002F378267.378271","Author affiliation is blank",[64],"https:\u002F\u002Fdl.acm.org\u002Fdoi\u002F10.1145\u002F378267.378271",[2038],{"id":2039,"sortIndex":19,"researcher":18,"roles":2040,"affiliations":2041,"properties":2042,"displayName":2046,"givenName":18,"familyName":18},"c1517489-7875-49e3-8db0-a2bdd7b9f270",[],[],{"orcid":2043,"title":2045,"openalex":2047},{"VOID":2044},"https:\u002F\u002Forcid.org\u002F0000-0001-7568-0766",{"EN":2046},"Martin J. Dürst",{"VOID":2048},"A5005400588",{"url":18,"publisher":2050,"properties":2064},{"id":6,"createTime":7,"updateTime":8,"relativeEntities":2051,"slug":10,"properties":2052,"entityType":16,"verifyStatus":17,"verifyTime":18,"verifyNote":18,"languages":18,"translateLanguages":18,"viewCount":19,"subjectFields":2055,"manageAffiliations":2056,"indexDatabases":2057,"url":18,"thumbnailPath":18,"statistic":18,"gsStatistic":18,"type":18,"analyzePriority":18},[],{"issn":2053,"title":2054},{"VOID":13},{"EN":15},[],[],[2058],{"id":24,"indexDatabase":2059,"url":35,"indexYears":36,"academicFieldIds":18,"indexDatabaseRanking":37},{"id":26,"createTime":18,"updateTime":18,"relativeEntities":2060,"label":2061,"description":2062,"key":32,"publicationTags":2063,"standard":18},[],{"EN":29,"VI":29},{"EN":29,"VI":31},[34],{"issue":2065,"pages":2067,"volume":2069},{"VOID":2066},"5",{"VOID":2068},"243",{"VOID":2070},"22",138,{"total":2071,"publishYear":2073,"statisticByYear":2074},1988,{"2012":74,"2013":155,"2014":77,"2015":72,"2016":72,"2017":155,"2018":72,"2019":72,"2020":77,"2021":81,"2022":72,"2024":155},"1988-10-01",[37],[],{"id":2079,"createTime":2080,"updateTime":2080,"relativeEntities":2081,"slug":2082,"properties":2083,"entityType":910,"verifyStatus":60,"verifyTime":2080,"verifyNote":911,"languages":2094,"translateLanguages":18,"viewCount":19,"primaryUrl":2095,"fullTextUrl":18,"authors":2096,"publicationType":947,"publisherRelationship":2146,"citationCount":167,"citationInfo":2167,"publishDate":2170,"publishYear":2168,"citationAnalyzeStatus":17,"lastCitationAnalyze":18,"indexDatabases":2171,"openAccess":18,"references":2172,"isForceReanalyzing":1082},"555ecc88-1366-4212-91ef-3131e8e0a56e","2024-09-02T08:18:15.616+00:00",[],"Creating-repeating-hyperbolic-patterns",{"openalex":2084,"mag":2086,"abstract":2088,"title":2090,"doi":2092},{"VOID":2085},"W3180965450",{"VOID":2087},"3180965450",{"EN":2089},"\u003Cjats:p>A process for creating repeating patterns of the hyperbolic plane is described. Unlike the Euclidean plane, the hyperbolic plane has infinitely many different kinds of repeating patterns. The Poincare circle model of hyperbolic geometry has been used by the artist M. C. Escher to display interlocking, repeating, hyperbolic patterns. A program has been designed which will do this automatically. The user enters a motif, or basic subpattern, which could theoretically be replicated to fill the hyperbolic plane. In practice, the replication process can be iterated sufficiently often to appear to fill the circle model. There is an interactive “boundary procedure” which allows the user to design a motif Which will be replicated into a completely interlocking pattern. Duplication of two of Escher's patterns and some entirely new patterns are included in the paper.\u003C\u002Fjats:p>",{"EN":2091},"Creating repeating hyperbolic patterns",{"VOID":2093},"10.1145\u002F965161.806808",[64],"https:\u002F\u002Fdl.acm.org\u002Fdoi\u002F10.1145\u002F965161.806808",[2097,2114,2129],{"id":2098,"sortIndex":19,"researcher":18,"roles":2099,"affiliations":2100,"properties":2109,"displayName":2111,"givenName":18,"familyName":18},"89ed34ea-7a9d-4213-8842-67d7d8ec8f4a",[],[2101],{"id":2102,"sortIndex":19,"affiliation":2103,"properties":18},"d010dbc0-9185-4970-a39e-d0ba887a2209",{"id":2102,"createTime":18,"updateTime":18,"relativeEntities":2104,"slug":18,"properties":2105,"entityType":18,"verifyStatus":18,"verifyTime":18,"verifyNote":18,"languages":18,"translateLanguages":18,"viewCount":18,"url":18,"parentIds":2108,"statistic":18},[],{"title":2106},{"EN":2107},"Department of Mathematical Sciences, University of Minnesota, Duluth, Duluth, MN",[],{"title":2110,"openalex":2112},{"EN":2111},"Douglas Dunham",{"VOID":2113},"A5024413844",{"id":2115,"sortIndex":72,"researcher":18,"roles":2116,"affiliations":2117,"properties":2124,"displayName":2126,"givenName":18,"familyName":18},"473fb47b-550e-446e-a63c-d5b0c791c17a",[],[2118],{"id":2102,"sortIndex":19,"affiliation":2119,"properties":18},{"id":2102,"createTime":18,"updateTime":18,"relativeEntities":2120,"slug":18,"properties":2121,"entityType":18,"verifyStatus":18,"verifyTime":18,"verifyNote":18,"languages":18,"translateLanguages":18,"viewCount":18,"url":18,"parentIds":2123,"statistic":18},[],{"title":2122},{"EN":2107},[],{"title":2125,"openalex":2127},{"EN":2126},"John A. Lindgren",{"VOID":2128},"A5002445513",{"id":2130,"sortIndex":155,"researcher":18,"roles":2131,"affiliations":2132,"properties":2141,"displayName":2143,"givenName":18,"familyName":18},"3abea19d-84af-4419-8e43-031c90bd61cd",[],[2133],{"id":2134,"sortIndex":19,"affiliation":2135,"properties":18},"ace9f335-6688-44dc-a077-25a096d0e579",{"id":2134,"createTime":18,"updateTime":18,"relativeEntities":2136,"slug":18,"properties":2137,"entityType":18,"verifyStatus":18,"verifyTime":18,"verifyNote":18,"languages":18,"translateLanguages":18,"viewCount":18,"url":18,"parentIds":2140,"statistic":18},[],{"title":2138},{"EN":2139},"Department of Mathematics, University of Chicago, Chicago, IL",[],{"title":2142,"openalex":2144},{"EN":2143},"David Witte",{"VOID":2145},"A5077081255",{"url":18,"publisher":2147,"properties":2161},{"id":6,"createTime":7,"updateTime":8,"relativeEntities":2148,"slug":10,"properties":2149,"entityType":16,"verifyStatus":17,"verifyTime":18,"verifyNote":18,"languages":18,"translateLanguages":18,"viewCount":19,"subjectFields":2152,"manageAffiliations":2153,"indexDatabases":2154,"url":18,"thumbnailPath":18,"statistic":18,"gsStatistic":18,"type":18,"analyzePriority":18},[],{"issn":2150,"title":2151},{"VOID":13},{"EN":15},[],[],[2155],{"id":24,"indexDatabase":2156,"url":35,"indexYears":36,"academicFieldIds":18,"indexDatabaseRanking":37},{"id":26,"createTime":18,"updateTime":18,"relativeEntities":2157,"label":2158,"description":2159,"key":32,"publicationTags":2160,"standard":18},[],{"EN":29,"VI":29},{"EN":29,"VI":31},[34],{"issue":2162,"pages":2163,"volume":2165},{"VOID":1854},{"VOID":2164},"215-223",{"VOID":2166},"15",{"total":167,"publishYear":2168,"statisticByYear":2169},1981,{"2012":155,"2018":72,"2019":155,"2021":72,"2022":72},"1981-08-01",[37],[2173,2176,2179,2182,2185,2188],{"id":18,"text":2174,"url":18,"identifiers":2175},"Alexander H., 1978, Realized by Means of Computer plus Plotter",{},{"id":18,"text":2177,"url":18,"identifiers":2178},"Coxeter H.S.M., 1957, Trans. Royal Soc. Canada (3), 51, 1",{},{"id":18,"text":2180,"url":18,"identifiers":2181},"Coxeter H. S.M., 1961, Introduction to Geometry, 2",{},{"id":18,"text":2183,"url":18,"identifiers":2184},"10.1007\u002F978-3-662-25739-5",{"doi":2183},{"id":18,"text":2186,"url":18,"identifiers":2187},"Fricke R., 1890, Vorlesungen uber die Theorie der elliptischen Modulfunktionen",{},{"id":18,"text":2189,"url":18,"identifiers":2190},"Locher J. L., 1971, The World of M. C. Escher",{},{"id":2192,"createTime":2193,"updateTime":2193,"relativeEntities":2194,"slug":2195,"properties":2196,"entityType":910,"verifyStatus":60,"verifyTime":2205,"verifyNote":911,"languages":2206,"translateLanguages":18,"viewCount":19,"primaryUrl":2207,"fullTextUrl":18,"authors":2208,"publicationType":947,"publisherRelationship":2228,"citationCount":231,"citationInfo":2249,"publishDate":2252,"publishYear":2250,"citationAnalyzeStatus":17,"lastCitationAnalyze":18,"indexDatabases":2253,"openAccess":18,"references":2254,"isForceReanalyzing":1082},"5e5130a8-a6a2-41ae-8820-132d1c6797aa","2024-09-27T15:13:26.796+00:00",[],"A-generalization-of-algebraic-surface-drawing",{"openalex":2197,"abstract":2199,"title":2201,"doi":2203},{"VOID":2198},"W4234811689",{"EN":2200},"\u003Cjats:p>The mathematical description of three dimensional surfaces usually falls in one of two classifications: parametric and algebraic. The form is defined as all points which satisfy some equation: F(x,y,z)=0. This form is ideally suited for image space shaded picture drawing, the pixel coordinates are substituted for x and y and the equation is solved for z. Algorithms for drawing such objects have been developed primarily for first and second order polynomial functions. This paper presents a new algorithm applicable to other functional forms, in particular to the summation of several gaussian density distributions. The algorithm was created to model electron density maps of molecular structures but can be used for other artistically interesting shapes.\u003C\u002Fjats:p>",{"EN":2202},"A generalization of algebraic surface drawing",{"VOID":2204},"10.1145\u002F965145.801290","2024-09-27T15:13:26.795+00:00",[64],"https:\u002F\u002Fdl.acm.org\u002Fdoi\u002F10.1145\u002F965145.801290",[2209],{"id":2210,"sortIndex":19,"researcher":18,"roles":2211,"affiliations":2212,"properties":2221,"displayName":2225,"givenName":18,"familyName":18},"9dc5764e-5020-43ca-9236-db567eb669ad",[],[2213],{"id":2214,"sortIndex":19,"affiliation":2215,"properties":18},"1af6ef18-db57-4c51-b1a5-659303e0f695",{"id":2214,"createTime":18,"updateTime":18,"relativeEntities":2216,"slug":18,"properties":2217,"entityType":18,"verifyStatus":18,"verifyTime":18,"verifyNote":18,"languages":18,"translateLanguages":18,"viewCount":18,"url":18,"parentIds":2220,"statistic":18},[],{"title":2218},{"VI":2219},"Jet Propulsion Laboratory, California Institute of Technology",[],{"orcid":2222,"title":2224,"openalex":2226},{"VOID":2223},"https:\u002F\u002Forcid.org\u002F0009-0003-9603-6031",{"EN":2225},"J.F. Blinn",{"VOID":2227},"A5063881476",{"url":18,"publisher":2229,"properties":2243},{"id":6,"createTime":7,"updateTime":8,"relativeEntities":2230,"slug":10,"properties":2231,"entityType":16,"verifyStatus":17,"verifyTime":18,"verifyNote":18,"languages":18,"translateLanguages":18,"viewCount":19,"subjectFields":2234,"manageAffiliations":2235,"indexDatabases":2236,"url":18,"thumbnailPath":18,"statistic":18,"gsStatistic":18,"type":18,"analyzePriority":18},[],{"issn":2232,"title":2233},{"VOID":13},{"EN":15},[],[],[2237],{"id":24,"indexDatabase":2238,"url":35,"indexYears":36,"academicFieldIds":18,"indexDatabaseRanking":37},{"id":26,"createTime":18,"updateTime":18,"relativeEntities":2239,"label":2240,"description":2241,"key":32,"publicationTags":2242,"standard":18},[],{"EN":29,"VI":29},{"EN":29,"VI":31},[34],{"issue":2244,"pages":2245,"volume":2247},{"VOID":1854},{"VOID":2246},"273",{"VOID":2248},"16",{"total":231,"publishYear":2250,"statisticByYear":2251},1982,{"2012":155,"2013":72,"2015":72,"2021":72,"2023":155,"2024":72},"1982-07-01",[37],[]]