[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"_public_publisher_all{\"sortAscending\":false,\"sortField\":\"updateTime\",\"page\":0,\"size\":10,\"facet\":true,\"searchKey\":\"\"}":3,"_public_publisher_byId_75f60fd6-87da-4d5c-8808-fcc32b67da76":656,"_public_publication_all{\"sortAscending\":false,\"sortField\":\"totalCitation\",\"page\":0,\"size\":10,\"facet\":true,\"searchKey\":\"publisherId:75f60fd6-87da-4d5c-8808-fcc32b67da76,\"}":745},{"meta":4,"data":6},{"total":5},"117",[7,60,176,207,299,413,445,480,543,572],{"id":8,"createTime":9,"updateTime":10,"relativeEntities":11,"slug":12,"properties":13,"entityType":24,"verifyStatus":25,"verifyTime":26,"verifyNote":27,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":29,"subjectFields":30,"manageAffiliations":31,"indexDatabases":32,"url":33,"thumbnailPath":34,"statistic":35,"gsStatistic":26,"type":26,"analyzePriority":26},"5a09599f-54d1-44c3-8f16-3847ac552024","2023-08-17T04:28:50.832+00:00","2025-10-13T23:58:52.517+00:00",[],"T%E1%BA%A1p-ch%C3%AD-Truy%E1%BB%81n-nhi%E1%BB%85m-Vi%E1%BB%87t-Nam",{"country":14,"issn":16,"introduce":18,"title":21},{"VOID":15},"VN",{"VOID":17},"08667829",{"EN":19,"VI":20},"{\"ops\":[{\"insert\":\"Vietnam Journal of Infectious Diseases is a social - professional forum of the Vietnam Society for Infectious Diseases, whose responsibility is to introduce the researches, the scientific advances in Vietnam and from the world; to contribute to the improvement of knowledges for health care staffs about clinic, treatment, guideline, prevention, epidemiology for infectious diseases, HIV\u002FAIDS and community health care; to provide, exchange and publish scientific information to the public accurately and promptly.\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"insert\":\"Vietnam Journal of Infectious Diseases publishes in the whole country; serves the professional work for researchers, clinical staffs, administrators, undergraduate and postgraduate students who are working and studying in the infections, tropical diseases and HIV\u002FAIDS from central to local levels, also organizations and individuals in the world who are interested in infectious and tropical diseases and prevention for HIV\u002FAIDS.\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\\n\"},{\"attributes\":{\"bold\":true},\"insert\":\"Editor in Chief:\"},{\"attributes\":{\"header\":4},\"insert\":\"\\n\"},{\"insert\":\"Prof. Dr. Nguyen Van Kinh. - Chairman of Editorial Board\"},{\"attributes\":{\"align\":\"justify\",\"blockquote\":true},\"insert\":\"\\n\"},{\"insert\":\"Prof. Dr. Nguyen Van Mui.\"},{\"attributes\":{\"align\":\"justify\",\"blockquote\":true},\"insert\":\"\\n\"},{\"attributes\":{\"bold\":true},\"insert\":\"Headquarter:\"},{\"attributes\":{\"header\":4},\"insert\":\"\\n\"},{\"attributes\":{\"bold\":true},\"insert\":\"Address:\"},{\"insert\":\" Level 6, National Hospital for Tropical Diseases, No. 78 Giai Phong Street, Dong Da District, Hanoi city, Vietnam.\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"attributes\":{\"bold\":true},\"insert\":\"Tel:\"},{\"insert\":\" \"},{\"attributes\":{\"color\":\"#008d45\",\"background\":\"transparent\",\"link\":\"https:\u002F\u002Fbvnd.vojs.vn\u002Findex.php\u002Fvjid\u002Fmanagement\u002Fsettings\u002Fcontext\u002Ftel:02435765464\"},\"insert\":\"02435765464\"},{\"insert\":\"; \"},{\"attributes\":{\"color\":\"#008d45\",\"background\":\"transparent\",\"link\":\"https:\u002F\u002Fbvnd.vojs.vn\u002Findex.php\u002Fvjid\u002Fmanagement\u002Fsettings\u002Fcontext\u002Ftel:0913552672\"},\"insert\":\"0913552672\"},{\"insert\":\"; \"},{\"attributes\":{\"color\":\"#008d45\",\"background\":\"transparent\",\"link\":\"https:\u002F\u002Fbvnd.vojs.vn\u002Findex.php\u002Fvjid\u002Fmanagement\u002Fsettings\u002Fcontext\u002Ftel:0913228072\"},\"insert\":\"0913228072\"},{\"insert\":\".\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"attributes\":{\"bold\":true},\"insert\":\"Email\"},{\"insert\":\": \"},{\"attributes\":{\"color\":\"#008d45\",\"background\":\"transparent\",\"link\":\"https:\u002F\u002Fbvnd.vojs.vn\u002Findex.php\u002Findex\u002Fadmin\u002Fcontexts\u002Fmailto:tungphamvan52@gmail.com\"},\"insert\":\"tungphamvan52@gmail.com\"},{\"insert\":\"; \"},{\"attributes\":{\"color\":\"#008d45\",\"background\":\"transparent\",\"link\":\"https:\u002F\u002Fbvnd.vojs.vn\u002Findex.php\u002Fvjid\u002Fmanagement\u002Fsettings\u002Fcontext\u002Fmailto:tapchitruyennhiem@gmail.com\"},\"insert\":\"tapchitruyennhiem@gmail.com\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"attributes\":{\"bold\":true},\"insert\":\"Bank account:\"},{\"insert\":\" 0021000275119, Vietcombank Hanoi Branch. Transaction office No. 7, 402 Tran Khat Chan, Hai Ba Trung District, Hanoi city, Vietnam.\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"insert\":\"\\n\"}]}","{\"ops\":[{\"insert\":\"Tạp chí Truyền nhiễm Việt Nam là cơ quan ngôn luận của Hội Truyền nhiễm Việt Nam, chịu sự lãnh đạo, chỉ đạo trực tiếp của Thường vụ Ban Chấp hành Hội Truyền nhiễm Việt Nam; sự kiểm tra, giám sát về nghiệp vụ báo chí của các cơ quan chức năng quản lý báo chí thuộc Bộ Thông tin và Truyền thông và Ban Tuyên giáo Trung ương Đảng.\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"insert\":\"Tạp chí có trách nhiệm giới thiệu các công trình nghiên cứu khoa học, những tiến bộ khoa học trên thế giới và trong nước, góp phần nâng cao kiến thức khoa học cho cán bộ y tế về lâm sàng, điều trị, hướng dẫn, dự phòng, dịch tễ học các bệnh truyền nhiễm, HIV\u002FAIDS và chăm sóc sức khỏe cộng đồng; cung cấp, trao đổi, phổ biến các thông tin khoa học tới công chúng chính xác và kịp thời.\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"insert\":\"Tạp chí xuất bản 03 tháng\u002F01 kỳ và được phát hành qua Bưu điện và tự phát hành trong phạm vi toàn quốc.\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"insert\":\"Lãnh đạo Tạp chí: \"},{\"attributes\":{\"header\":4},\"insert\":\"\\n\"},{\"insert\":\"Tổng Biên tập: ThS.BSCKII Nguyễn Trung Cấp\"},{\"attributes\":{\"align\":\"justify\",\"blockquote\":true},\"insert\":\"\\n\"},{\"insert\":\"Phó Tổng Biên tập:\"},{\"attributes\":{\"align\":\"justify\",\"blockquote\":true},\"insert\":\"\\n\"},{\"insert\":\"            TS.BSCKII Phạm Ngọc Thạch\"},{\"attributes\":{\"align\":\"justify\",\"blockquote\":true},\"insert\":\"\\n\"},{\"attributes\":{\"bold\":true},\"insert\":\"Trụ sở tòa soạn:\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"insert\":\"Địa chỉ: Tầng 6, Bệnh viện Bệnh Nhiệt đới Trung ương, 78 đường Giải Phóng, phường Phương Mai, quận Đống Đa, thành phố Hà Nội.\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"attributes\":{\"bold\":true},\"insert\":\"Điện thoại:\"},{\"insert\":\" \"},{\"attributes\":{\"color\":\"#008d45\",\"background\":\"transparent\",\"link\":\"https:\u002F\u002Fbvnd.vojs.vn\u002Findex.php\u002Fvjid\u002Fmanagement\u002Fsettings\u002Fcontext\u002Ftel:02435765464\"},\"insert\":\"02435765464\"},{\"insert\":\" - \"},{\"attributes\":{\"color\":\"#008d45\",\"background\":\"transparent\",\"link\":\"https:\u002F\u002Fbvnd.vojs.vn\u002Findex.php\u002Fvjid\u002Fmanagement\u002Fsettings\u002Fcontext\u002Ftel:0913228072\"},\"insert\":\"0913228072\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"attributes\":{\"bold\":true},\"insert\":\"Email\"},{\"insert\":\": \"},{\"attributes\":{\"color\":\"#008d45\",\"background\":\"transparent\",\"link\":\"https:\u002F\u002Fbvnd.vojs.vn\u002Findex.php\u002Findex\u002Fadmin\u002Fcontexts\u002Fmailto:tungphamvan52@gmail.com\"},\"insert\":\"tungphamvan52@gmail.com\"},{\"insert\":\"; \"},{\"attributes\":{\"color\":\"#008d45\",\"background\":\"transparent\",\"link\":\"https:\u002F\u002Fbvnd.vojs.vn\u002Findex.php\u002Fvjid\u002Fmanagement\u002Fsettings\u002Fcontext\u002Fmailto:tapchitruyennhiem@gmail.com\"},\"insert\":\"tapchitruyennhiem@gmail.com\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"attributes\":{\"bold\":true},\"insert\":\"Tài khoản:\"},{\"insert\":\" Số 0021000275119 Ngân hàng Ngoại thương Việt Nam, chi nhánh Hà Nội (Vietcombank Hà Nội). Phòng giao dịch số 7, 402 Trần Khát Chân, quận Hai Bà Trưng, Thành phố Hà Nội.\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"insert\":\"\\n\"}]}",{"EN":22,"VI":23},"Vietnam Journal of Infectious Diseases","Tạp chí Truyền nhiễm Việt Nam","PUBLISHER","VERIFIED",null,"Admin update database","PENDING",51,[],[],[],"https:\u002F\u002Ftruyennhiemvietnam.vn\u002Findex.php\u002Fvjid","\u002Fapi\u002Fpublic\u002Ffile\u002Fpublisher\u002F5a09599f-54d1-44c3-8f16-3847ac552024\u002Fadb0e52bf25e0de580fd4289519cb8bf.jpg",{"impactFactor":36,"impactFactorByYear":37,"i10Index":36,"i10IndexLast5Year":36,"totalPublication":41,"totalPublicationByYear":42,"totalCitation":48,"totalCitationByYear":49,"totalCitationPerPublication":54,"totalCitationPerPublicationByYear":55,"hindexLast5Year":59,"hindex":59},0,{"2022":38,"2023":39,"2024":40},0.01,0.03,0.13,315,{"2020":43,"2021":44,"2022":45,"2023":46,"2024":47},63,58,57,65,72,43,{"2020":50,"2021":51,"2022":52,"2023":53},8,15,9,11,0.14,{"2020":40,"2021":56,"2022":57,"2023":58},0.26,0.16,0.17,3,{"id":61,"createTime":62,"updateTime":63,"relativeEntities":64,"slug":65,"properties":66,"entityType":24,"verifyStatus":25,"verifyTime":78,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":79,"subjectFields":80,"manageAffiliations":81,"indexDatabases":136,"url":137,"thumbnailPath":26,"statistic":138,"gsStatistic":155,"type":175,"analyzePriority":26},"25b6bd10-676c-40c0-8dc3-356d1679a284","2023-05-19T02:22:33.430+00:00","2026-06-18T23:33:57.141+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":67,"issn":68,"introduce":70,"title":73,"gsId":76},{"VOID":15},{"VOID":69},"23541210",{"EN":71,"VI":72},"\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>",{"EN":74,"VI":75},"Cantho Journal of Medicine and Pharmacy","Tạp chí Y Dược học Cần Thơ",{"VOID":77},"wcQ1uqwAAAAJ","2023-05-30T08:17:21.868+00:00",32,[],[82],{"id":83,"createTime":84,"updateTime":85,"relativeEntities":86,"slug":87,"properties":88,"entityType":98,"verifyStatus":25,"verifyTime":99,"verifyNote":26,"syncStatus":28,"languages":100,"translateLanguages":26,"viewCount":103,"url":104,"parentIds":105,"statistic":106},"6413896b-eca9-442b-a73f-182a58a0ce40","2023-06-12T14:59:13.446+00:00","2026-06-19T02:29:32.871+00:00",[],"Tr%C6%B0%E1%BB%9Dng-%C4%90%E1%BA%A1i-h%E1%BB%8Dc-Y-D%C6%B0%E1%BB%A3c-C%E1%BA%A7n-Th%C6%A1",{"country":89,"title":90,"address":93,"abbreviation":96},{"VOID":15},{"EN":91,"VI":92},"Can Tho University of Medicine and Pharmacy","Trường Đại học Y Dược Cần Thơ",{"VI":94,"EN":95},"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","No 179, Nguyen Van Cu street, An Khanh ward, Ninh Kieu district, Can Tho city, Vietnam",{"VOID":97},"ctump","AFFILIATION","2023-08-01T14:07:27.977+00:00",[101,102],"VI","EN",12,"http:\u002F\u002Fwww.ctump.edu.vn\u002F",[],{"impactFactor":36,"impactFactorByYear":107,"i10Index":111,"i10IndexLast5Year":59,"totalPublication":112,"totalPublicationByYear":113,"totalCitation":122,"totalCitationByYear":123,"totalCitationPerPublication":128,"totalCitationPerPublicationByYear":129,"hindexLast5Year":135,"hindex":135},{"2022":108,"2023":109,"2024":110,"2025":38},0.1,0.05,0.07,4,1489,{"2013":114,"2014":115,"2015":115,"2016":111,"2017":115,"2018":59,"2019":114,"2020":116,"2021":117,"2022":118,"2023":119,"2024":120,"2025":121,"2026":111},2,1,10,84,281,680,260,156,313,{"2013":59,"2014":114,"2018":124,"2021":125,"2022":126,"2023":127},17,36,123,132,0.21,{"2013":130,"2014":114,"2018":131,"2021":132,"2022":133,"2023":134},1.5,5.67,0.43,0.44,0.19,6,[],"https:\u002F\u002Ftapchi.ctump.edu.vn\u002Findex.php\u002Fctump",{"impactFactor":36,"impactFactorByYear":139,"i10Index":114,"i10IndexLast5Year":114,"totalPublication":140,"totalPublicationByYear":141,"totalCitation":147,"totalCitationByYear":148,"totalCitationPerPublication":151,"totalCitationPerPublicationByYear":152,"hindexLast5Year":135,"hindex":135},{"2022":38,"2023":36,"2024":39,"2025":38},1956,{"0":114,"2019":114,"2020":50,"2021":142,"2022":143,"2023":144,"2024":145,"2025":146},76,403,789,305,371,524,{"0":114,"2019":135,"2021":124,"2022":149,"2023":150,"2024":111,"2025":114},287,206,0.27,{"0":115,"2019":59,"2021":153,"2022":154,"2023":56,"2024":38,"2025":38},0.22,0.71,{"impactFactor":26,"impactFactorByYear":26,"i10Index":114,"i10IndexLast5Year":114,"totalPublication":156,"totalPublicationByYear":157,"totalCitation":163,"totalCitationByYear":164,"totalCitationPerPublication":169,"totalCitationPerPublicationByYear":170,"hindexLast5Year":135,"hindex":135},461,{"0":158,"2019":114,"2021":159,"2022":160,"2023":161,"2024":158,"2025":162},7,37,296,107,5,419,{"2021":59,"2022":59,"2023":165,"2024":166,"2025":167,"2026":168},71,126,171,41,0.91,{"2021":171,"2022":38,"2023":172,"2024":173,"2025":174},0.08,0.66,18,34.2,"JOURNAL",{"id":177,"createTime":178,"updateTime":179,"relativeEntities":180,"slug":181,"properties":182,"entityType":24,"verifyStatus":25,"verifyTime":193,"verifyNote":26,"syncStatus":28,"languages":194,"translateLanguages":26,"viewCount":36,"subjectFields":195,"manageAffiliations":196,"indexDatabases":197,"url":198,"thumbnailPath":26,"statistic":26,"gsStatistic":199,"type":175,"analyzePriority":26},"f8d0bf97-8d89-482e-b58c-2fc481a0b79b","2025-10-27T06:27:08.591+00:00","2026-06-18T23:33:41.667+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":183,"introduce":184,"gsId":186,"title":188,"issn":191},{"VOID":15},{"EN":185},"\u003Cp style=\"text-align:justify;\">     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;\">        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;\">      Currently, the JTSE is building and perfecting a set of criteria and making efforts to join the List of prestigious  international journals with a roadmap to enter Scopus and SCIE in the coming time.\u003C\u002Fp>",{"VOID":187},"MS2_GJQAAAAJ",{"VI":189,"EN":190},"Tạp chí Khoa học và Công nghệ nhiệt đới","Journal of Tropical Science and Engineering",{"VOID":192},"08667535","2025-10-27T06:27:25.058+00:00",[101,102],[],[],[],"https:\u002F\u002Ftapchikhcnnd.com.vn",{"impactFactor":26,"impactFactorByYear":26,"i10Index":36,"i10IndexLast5Year":36,"totalPublication":200,"totalPublicationByYear":201,"totalCitation":161,"totalCitationByYear":203,"totalCitationPerPublication":153,"totalCitationPerPublicationByYear":205,"hindexLast5Year":114,"hindex":114},481,{"0":115,"2020":115,"2021":115,"2022":114,"2024":115,"2025":202,"2026":115},474,{"2017":114,"2018":115,"2019":111,"2020":162,"2021":162,"2022":116,"2023":50,"2024":162,"2025":204,"2026":52},52,{"2020":162,"2021":162,"2022":162,"2024":162,"2025":206,"2026":52},0.11,{"id":208,"createTime":209,"updateTime":210,"relativeEntities":211,"slug":212,"properties":213,"entityType":24,"verifyStatus":25,"verifyTime":221,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":222,"subjectFields":223,"manageAffiliations":224,"indexDatabases":225,"url":226,"thumbnailPath":26,"statistic":227,"gsStatistic":276,"type":175,"analyzePriority":26},"a3d1e82a-57e2-40f9-940e-f5fa8b9ef64a","2023-06-01T07:11:26.039+00:00","2026-06-18T23:33:28.573+00:00",[],"VNU-Journal-of-Science-Earth-and-Environmental-Sciences",{"issn":214,"title":216,"country":218,"gsId":219},{"VOID":215},"26159279",{"EN":217},"VNU Journal of Science: Earth and Environmental Sciences",{"VOID":15},{"VOID":220},"UmXD8vEAAAAJ","2023-06-01T07:17:59.210+00:00",27,[],[],[],"https:\u002F\u002Fjs.vnu.edu.vn\u002FEES",{"impactFactor":36,"impactFactorByYear":228,"i10Index":234,"i10IndexLast5Year":36,"totalPublication":235,"totalPublicationByYear":236,"totalCitation":246,"totalCitationByYear":247,"totalCitationPerPublication":261,"totalCitationPerPublicationByYear":262,"hindexLast5Year":103,"hindex":103},{"2010":229,"2012":40,"2013":230,"2014":230,"2015":231,"2016":54,"2017":171,"2018":109,"2019":110,"2020":57,"2021":232,"2022":233,"2023":151,"2024":58},0.02,0.04,0.09,0.31,0.4,19,656,{"2008":237,"2009":238,"2010":239,"2011":238,"2012":240,"2013":241,"2014":239,"2015":242,"2016":243,"2017":244,"2018":245,"2019":165,"2020":125,"2021":168,"2022":125,"2023":222,"2024":111},23,24,22,28,25,20,146,29,78,1038,{"2008":248,"2009":249,"2010":250,"2011":251,"2012":252,"2013":253,"2014":254,"2015":255,"2016":256,"2017":257,"2018":161,"2019":258,"2020":259,"2021":29,"2022":260},119,64,66,86,38,73,59,31,129,39,97,53,26,1.58,{"2008":263,"2009":264,"2010":59,"2011":265,"2012":266,"2013":267,"2014":268,"2015":269,"2016":270,"2017":271,"2018":272,"2019":272,"2020":273,"2021":274,"2022":275},5.17,2.67,3.58,1.36,2.92,2.68,1.55,0.88,1.34,1.37,1.47,1.24,0.72,{"impactFactor":26,"impactFactorByYear":26,"i10Index":173,"i10IndexLast5Year":135,"totalPublication":277,"totalPublicationByYear":278,"totalCitation":279,"totalCitationByYear":280,"totalCitationPerPublication":288,"totalCitationPerPublicationByYear":289,"hindexLast5Year":158,"hindex":298},113,{"2007":114,"2008":103,"2009":173,"2010":116,"2011":51,"2012":239,"2013":103,"2014":162,"2015":53,"2016":135},616,{"2009":162,"2010":114,"2011":52,"2012":124,"2013":222,"2014":255,"2015":48,"2016":44,"2017":281,"2018":282,"2019":259,"2020":283,"2021":284,"2022":285,"2023":286,"2024":257,"2025":287,"2026":59},54,60,49,47,34,44,33,5.45,{"2009":290,"2010":291,"2011":292,"2012":293,"2013":294,"2014":295,"2015":296,"2016":297},0.28,0.2,0.6,0.77,2.25,6.2,3.91,9.67,14,{"id":300,"createTime":301,"updateTime":302,"relativeEntities":303,"slug":304,"properties":305,"entityType":24,"verifyStatus":25,"verifyTime":316,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":234,"subjectFields":317,"manageAffiliations":318,"indexDatabases":388,"url":389,"thumbnailPath":390,"statistic":391,"gsStatistic":409,"type":175,"analyzePriority":26},"a7166325-6c9e-4db3-8a59-7c879701a372","2023-07-31T04:28:49.231+00:00","2026-06-18T23:33:22.428+00:00",[],"VNU-Journal-of-Science-Policy-and-Management-Studies",{"country":306,"issn":307,"eissn":309,"title":311,"gsId":314},{"VOID":15},{"VOID":308},"26159295",{"VOID":310},"25881116",{"EN":312,"VI":313},"VNU Journal of Science: Policy and Management Studies","Tạp chí Nghiên cứu Chính sách và Quản lý",{"VOID":315},"xKW2E_cAAAAJ","2023-08-01T03:23:46.688+00:00",[],[319],{"id":320,"createTime":321,"updateTime":322,"relativeEntities":323,"slug":324,"properties":325,"entityType":98,"verifyStatus":25,"verifyTime":335,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":336,"url":337,"parentIds":338,"statistic":339},"12466116-8f60-4b01-8faf-2411483a0977","2023-05-30T09:37:38.472+00:00","2026-06-19T02:14:28.352+00:00",[],"Vietnam-National-University",{"country":326,"title":327,"abbreviation":330,"address":332},{"VOID":15},{"EN":328,"VI":329},"Vietnam National University, Hanoi","Đại học Quốc gia Hà Nội",{"VOID":331},"VNU",{"VI":333,"EN":334},"Số 144 Xuân Thủy, Phường Dịch Vọng Hậu, Quận Cầu Giấy, Hà Nội, Việt Nam","No. 144 Xuan Thuy Street, Dich Vong Hau Ward, Cau Giay District, Hanoi, Vietnam","2023-08-02T13:58:17.029+00:00",16,"http:\u002F\u002Fwww.vnu.edu.vn\u002F",[],{"impactFactor":36,"impactFactorByYear":340,"i10Index":285,"i10IndexLast5Year":162,"totalPublication":344,"totalPublicationByYear":345,"totalCitation":354,"totalCitationByYear":355,"totalCitationPerPublication":368,"totalCitationPerPublicationByYear":369,"hindexLast5Year":336,"hindex":336},{"2014":109,"2015":231,"2016":231,"2017":206,"2018":341,"2019":110,"2020":342,"2021":343,"2022":171,"2023":231,"2024":110,"2025":39},0.06,0.18,0.35,1247,{"2003":115,"2004":115,"2005":114,"2006":59,"2007":111,"2008":162,"2009":59,"2010":50,"2011":124,"2012":336,"2013":260,"2014":244,"2015":250,"2016":281,"2017":346,"2018":347,"2019":348,"2020":349,"2021":350,"2022":351,"2023":352,"2024":353,"2025":255,"2026":50},94,88,83,67,176,185,187,93,1644,{"2004":111,"2005":115,"2006":52,"2007":298,"2008":356,"2009":298,"2010":286,"2011":357,"2012":244,"2013":358,"2014":359,"2015":360,"2016":361,"2017":362,"2018":363,"2019":364,"2020":365,"2021":366,"2022":367,"2023":367,"2024":162},13,81,48,70,151,115,109,259,174,181,121,101,1.32,{"2004":111,"2005":370,"2006":59,"2007":371,"2008":372,"2009":373,"2010":374,"2011":375,"2012":376,"2013":377,"2014":378,"2015":379,"2016":380,"2017":381,"2018":382,"2019":383,"2020":384,"2021":385,"2022":386,"2023":387,"2024":109},0.5,3.5,2.6,4.67,5.5,4.76,1.81,1.85,2.41,2.29,2.13,1.16,2.94,2.1,2.7,0.69,0.55,0.54,[],"https:\u002F\u002Fjs.vnu.edu.vn\u002FPaM","\u002Fapi\u002Fpublic\u002Ffile\u002Fpublisher\u002Fa7166325-6c9e-4db3-8a59-7c879701a372\u002Fecfe83f4bcc60c7023ae04d8900fe0ac.jpg",{"impactFactor":36,"impactFactorByYear":392,"i10Index":111,"i10IndexLast5Year":36,"totalPublication":394,"totalPublicationByYear":395,"totalCitation":399,"totalCitationByYear":400,"totalCitationPerPublication":293,"totalCitationPerPublicationByYear":403,"hindexLast5Year":158,"hindex":158},{"2018":109,"2019":171,"2020":393,"2021":108,"2022":54,"2023":206,"2024":54},0.23,320,{"2015":50,"2016":239,"2017":286,"2018":396,"2019":397,"2020":159,"2021":398,"2022":168,"2023":79,"2024":255},30,35,40,247,{"2015":115,"2016":242,"2017":401,"2018":222,"2019":402,"2020":79,"2021":239,"2022":50,"2023":116},77,50,{"2015":404,"2016":169,"2017":405,"2018":406,"2019":407,"2020":408,"2021":386,"2022":291,"2023":232},0.12,1.75,0.9,1.43,0.86,{"impactFactor":26,"impactFactorByYear":26,"i10Index":36,"i10IndexLast5Year":36,"totalPublication":103,"totalPublicationByYear":410,"totalCitation":234,"totalCitationByYear":411,"totalCitationPerPublication":261,"totalCitationPerPublicationByYear":412,"hindexLast5Year":114,"hindex":59},{"2015":114,"2016":116},{"2016":115,"2017":114,"2018":114,"2019":59,"2020":114,"2021":59,"2022":114,"2023":114,"2024":115,"2026":115},{"2016":108},{"id":414,"createTime":415,"updateTime":416,"relativeEntities":417,"slug":418,"properties":419,"entityType":24,"verifyStatus":25,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":238,"subjectFields":428,"manageAffiliations":429,"indexDatabases":430,"url":431,"thumbnailPath":26,"statistic":432,"gsStatistic":438,"type":175,"analyzePriority":26},"16e65a3f-d274-47dd-8691-56d76eb58c3d","2023-05-30T09:10:06.062+00:00","2026-06-18T23:33:17.679+00:00",[],"Vietnam-Journal-of-Otorhinolaryngology-Head-and-Neck-Surgery",{"country":420,"issn":421,"title":423,"gsId":426},{"VOID":15},{"VOID":422},"18593704",{"EN":424,"VI":425},"Vietnam Journal of Otorhinolaryngology - Head and Neck Surgery","Tạp chí Tai Mũi Họng Việt Nam",{"VOID":427},"L78B_eIAAAAJ",[],[],[],"https:\u002F\u002Ftapchitaimuihong.vn\u002Findex.php\u002Ftmh",{"impactFactor":36,"impactFactorByYear":433,"i10Index":36,"i10IndexLast5Year":36,"totalPublication":434,"totalPublicationByYear":435,"totalCitation":111,"totalCitationByYear":436,"totalCitationPerPublication":230,"totalCitationPerPublicationByYear":437,"hindexLast5Year":115,"hindex":115},{"2024":229},95,{"2022":52,"2023":286,"2024":255,"2025":53},{"2023":111},{"2023":231},{"impactFactor":26,"impactFactorByYear":26,"i10Index":36,"i10IndexLast5Year":36,"totalPublication":240,"totalPublicationByYear":439,"totalCitation":234,"totalCitationByYear":440,"totalCitationPerPublication":441,"totalCitationPerPublicationByYear":442,"hindexLast5Year":114,"hindex":114},{"2023":53,"2024":116,"2025":135,"2026":115},{"2024":59,"2025":298,"2026":114},0.68,{"2024":443,"2025":444,"2026":114},0.3,2.33,{"id":446,"createTime":447,"updateTime":448,"relativeEntities":449,"slug":450,"properties":451,"entityType":24,"verifyStatus":25,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":396,"subjectFields":460,"manageAffiliations":461,"indexDatabases":462,"url":463,"thumbnailPath":464,"statistic":465,"gsStatistic":472,"type":175,"analyzePriority":26},"25988add-c322-4eda-afda-63b1559bb824","2023-04-07T03:49:55.817+00:00","2026-06-18T23:32:23.776+00:00",[],"T%E1%BA%A1p%20ch%C3%AD%20Y%20-%20D%C6%B0%E1%BB%A3c%20h%E1%BB%8Dc%20qu%C3%A2n%20s%E1%BB%B1",{"country":452,"issn":453,"title":455,"gsId":458},{"VOID":15},{"VOID":454},"18590748",{"EN":456,"VI":457},"Journal of Military Pharmaco-medicine","Tạp chí Y - Dược học quân sự",{"VOID":459},"_pmQ8IEAAAAJ",[],[],[],"https:\u002F\u002Fjmpm.vn\u002Findex.php\u002Fjmpm","\u002Fapi\u002Fpublic\u002Ffile\u002Fpublisher\u002F25988add-c322-4eda-afda-63b1559bb824\u002F09c6bc42157cf5ece95edc971ccddb52.jpg",{"impactFactor":36,"impactFactorByYear":466,"i10Index":36,"i10IndexLast5Year":36,"totalPublication":467,"totalPublicationByYear":468,"totalCitation":135,"totalCitationByYear":470,"totalCitationPerPublication":38,"totalCitationPerPublicationByYear":471,"hindexLast5Year":115,"hindex":115},{"2023":229,"2024":38},475,{"2022":168,"2023":365,"2024":469,"2025":124},236,{"2022":114,"2023":111},{"2022":109,"2023":229},{"impactFactor":26,"impactFactorByYear":26,"i10Index":36,"i10IndexLast5Year":36,"totalPublication":277,"totalPublicationByYear":473,"totalCitation":401,"totalCitationByYear":474,"totalCitationPerPublication":441,"totalCitationPerPublicationByYear":475,"hindexLast5Year":59,"hindex":59},{"2015":115,"2018":114,"2019":115,"2020":115,"2021":59,"2022":103,"2023":159,"2024":287,"2025":237},{"2020":115,"2021":115,"2022":115,"2023":52,"2024":237,"2025":79,"2026":116},{"2020":115,"2021":476,"2022":171,"2023":477,"2024":478,"2025":479},0.33,0.24,0.7,1.39,{"id":481,"createTime":482,"updateTime":483,"relativeEntities":484,"slug":485,"properties":486,"entityType":24,"verifyStatus":25,"verifyTime":26,"verifyNote":27,"syncStatus":28,"languages":496,"translateLanguages":26,"viewCount":45,"subjectFields":497,"manageAffiliations":498,"indexDatabases":525,"url":526,"thumbnailPath":527,"statistic":528,"gsStatistic":26,"type":26,"analyzePriority":26},"2b8d7b12-2d20-4777-be98-077f44f03c69","2023-09-07T07:40:58.286+00:00","2025-07-13T21:21:00.542+00:00",[],"VNU-Journal-of-Social-Sciences-and-Humanities",{"country":487,"issn":488,"introduce":490,"title":493},{"VOID":15},{"VOID":489},"23541172",{"EN":491,"VI":492},"{\"ops\":[{\"insert\":\"VNU Journal of Social Sciences and Humanities (ISSN 2354-1172) is a double-blind peer-reviewed journal published by University of Social Sciences and Humanities, Vietnam National University, Hanoi, Vietnam, under the publication permit no. 155\u002FGP-BTTTT, issued on 11\"},{\"attributes\":{\"script\":\"super\"},\"insert\":\"th \"},{\"insert\":\"May, 2015 by Ministry of Information and Communications. The journal publishes four Vietnamese issues and two English issues per year.\\nCurrently, there are 35 reputable professors in the editorial board. The main objectives of the journal include: providing an intellectual platform for Vietnamese and international scholars; promoting interdisciplinary studies in social sciences and humanities; becoming the leading journal in social sciences and humanities in Vietnam; being indexed by worldwide databases and having academic recognition internationally in the near future.\\nThe journal is currently indexed by Google Scholar, WorldCat, Open Archives, Cosmos Impact Factor, Advanced Sciences Index, Scientific Indexing Services, CrossRef, EBSCO Information Services and Vietnam National University’s digital archive.\\n\"},{\"attributes\":{\"bold\":true},\"insert\":\"Journal of Social Sciences and Humanities-Vietnam\"},{\"insert\":\"\\n\"},{\"attributes\":{\"bold\":true},\"insert\":\"ISSN 2354-1172, email: tapchikhxhnv@gmail.com, tckhxhnv@vnu.edu.vn\"},{\"insert\":\"\\n\"}]}","{\"ops\":[{\"insert\":\"Được thành lập ngày 31\u002F8\u002F2015 (giấy phép hoạt động số 155\u002FGP-BVHTT ngày 11 tháng 5 năm 2015 của Bộ Thông tin và Truyền thông, mã số tiêu chuẩn quốc tế ISSN 2354-1172), Tạp chí Khoa học Xã hội và Nhân văn (Journal of Social Sciences and Humanities) là ấn phẩm khoa học chính thức, duy nhất của Trường Đại học Khoa học Xã hội và Nhân văn, ĐHQG Hà Nội, phát triển và kế thừa Chuyên san Khoa học Xã hội và Nhân văn, Tạp chí Khoa học, ĐHQG Hà Nội.\\nTạp chí xuất bản định kỳ (04 số tiếng Việt\u002Fnăm và 02 số tiếng Anh\u002Fnăm), có nhiệm vụ \"},{\"attributes\":{\"italic\":true},\"insert\":\"công bố, giới thiệu các công trình nghiên cứu khoa học khoa học xã hội và nhân văn của các tác giả là các nhà khoa học trong và ngoài nước, phục vụ giảng dạy, học tập và nghiên cứu khoa học\"},{\"insert\":\". Hội đồng biên tập của Tạp chí hiện bao gồm 33 nhà khoa học có uy tín trong nước và quốc tế. Tạp chí tập trung và ưu tiên đăng tải những bài báo theo định hướng của tinh thần cởi mở, sáng tạo, nhanh chóng vươn lên để tiếp cận và sánh ngang với các tạp chí có uy tín hàng đầu của khu vực và trên thế giới. Nội dung chính của Tạp chí bao gồm các Bài nghiên cứu (khoảng 6000 đến 15000 từ), các bài điểm sách, thông tin khoa học (khoảng 300 đến 1500 từ) được trình bày theo đúng cấu trúc và chuẩn mực của một tạp chí khoa học.\\nCác bài viết của Tạp chí hiện đang được trích dẫn bởi Google Scholar, WorldCat, Open Archives, Cosmos Impact Factor, Advanced Sciences Index, Scientific Indexing Services, CrossRef, EBSCO Information Services.\\nMọi thông tin xin liên hệ: \"},{\"attributes\":{\"italic\":true},\"insert\":\"Phòng Tạp chí, 701 - E, Trường Đại học Khoa học Xã hội và Nhân văn, 336 Nguyễn Trãi, Thanh Xuân, Hà Nội. ĐT: 024.35581984; email: tckhxhnv@vnu.edu.vn \"},{\"insert\":\"hoặc \"},{\"attributes\":{\"italic\":true},\"insert\":\"tapchikhxhnv@gmail.com \"},{\"insert\":\"\\n\"}]}",{"EN":494,"VI":495},"VNU Journal of Social Sciences and Humanities","Tạp chí Khoa học Xã hội và Nhân văn",[101,102],[],[499],{"id":500,"createTime":501,"updateTime":502,"relativeEntities":503,"slug":504,"properties":505,"entityType":98,"verifyStatus":25,"verifyTime":509,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":222,"url":26,"parentIds":510,"statistic":511},"8b6e349b-0daf-4895-9c3f-85f30f1bfd42","2023-07-31T12:55:58.430+00:00","2026-06-19T02:30:07.899+00:00",[],"Tr%C6%B0%E1%BB%9Dng-%C4%90%E1%BA%A1i-h%E1%BB%8Dc-Khoa-h%E1%BB%8Dc-X%C3%A3-h%E1%BB%99i-v%C3%A0-Nh%C3%A2n-v%C4%83n-%C4%90%E1%BA%A1i-h%E1%BB%8Dc-Qu%E1%BB%91c-gia-H%C3%A0-N%E1%BB%99i",{"title":506},{"EN":507,"VI":508},"VNU University of Social Sciences and Humanities","Trường Đại học Khoa học Xã hội và Nhân văn, Đại học Quốc gia Hà Nội","2023-08-02T15:28:49.057+00:00",[],{"impactFactor":36,"impactFactorByYear":512,"i10Index":59,"i10IndexLast5Year":115,"totalPublication":514,"totalPublicationByYear":515,"totalCitation":518,"totalCitationByYear":519,"totalCitationPerPublication":520,"totalCitationPerPublicationByYear":521,"hindexLast5Year":162,"hindex":162},{"2016":229,"2017":230,"2018":229,"2021":230,"2022":58,"2023":513,"2024":38},0.15,365,{"2013":115,"2014":158,"2015":125,"2016":252,"2017":44,"2018":516,"2019":286,"2020":396,"2021":259,"2022":517,"2023":396,"2024":115,"2025":59,"2026":115},21,42,169,{"2015":283,"2016":135,"2017":52,"2018":50,"2019":298,"2020":53,"2021":359,"2022":115,"2023":115},0.46,{"2015":266,"2016":57,"2017":57,"2018":522,"2019":523,"2020":524,"2021":368,"2022":229,"2023":39},0.38,0.32,0.37,[],"http:\u002F\u002Fjournal.ussh.vnu.edu.vn\u002Findex.php\u002Fvjossh","\u002Fapi\u002Fpublic\u002Ffile\u002Fpublisher\u002F2b8d7b12-2d20-4777-be98-077f44f03c69\u002F0bd0751202944a4b4165b482e6e623e4.png",{"impactFactor":36,"impactFactorByYear":529,"i10Index":162,"i10IndexLast5Year":115,"totalPublication":530,"totalPublicationByYear":531,"totalCitation":537,"totalCitationByYear":538,"totalCitationPerPublication":343,"totalCitationPerPublicationByYear":540,"hindexLast5Year":135,"hindex":135},{"2016":341,"2017":39,"2018":229,"2019":38,"2020":110,"2021":231,"2022":231,"2023":341,"2024":39},764,{"2015":255,"2016":245,"2017":532,"2018":259,"2019":533,"2020":534,"2021":535,"2022":536,"2023":534,"2024":254,"2025":50},111,106,68,92,89,265,{"2015":539,"2016":241,"2017":168,"2018":51,"2019":349,"2020":260,"2021":244,"2022":298,"2023":114},46,{"2015":541,"2016":523,"2017":524,"2018":290,"2019":542,"2020":522,"2021":523,"2022":57,"2023":39},1.48,0.63,{"id":544,"createTime":545,"updateTime":546,"relativeEntities":547,"slug":548,"properties":549,"entityType":24,"verifyStatus":25,"verifyTime":26,"verifyNote":558,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":50,"subjectFields":559,"manageAffiliations":560,"indexDatabases":561,"url":562,"thumbnailPath":563,"statistic":564,"gsStatistic":26,"type":26,"analyzePriority":26},"6ec01bd0-15c0-469a-86ac-41339076ae0a","2023-08-10T07:08:33.153+00:00","2026-01-31T21:19:06.362+00:00",[],"T%E1%BA%A1p-ch%C3%AD-Da-li%E1%BB%85u-h%E1%BB%8Dc-Vi%E1%BB%87t-Nam",{"country":550,"issn":551,"introduce":553,"title":555},{"VOID":15},{"VOID":552},"18594824",{"VI":554},"{\"ops\":[{\"insert\":\"Tạp chí “Da liễu học Việt Nam” (Tiếng Anh: Vietnamese Journal of Dermatology and Venereology) thuộc Hội Da liễu Việt Nam, xuất bản 4 số mỗi năm bằng tiếng Việt hoặc tiếng Anh.\\nTạp chí Da liễu học Việt Nam hoạt động với mục đích, tôn chỉ là phổ biến, trao đổi thông tin trong lĩnh vực chuyên ngành da liễu; đăng tải các công trình nghiên cứu khoa học; chuyển giao công nghệ - kinh tế và khoa học kỹ thuật liên quan đến lĩnh vực da liễu.\\nPhạm vi của tạp chí là tất cả các bài báo khoa học, bài tổng quan, giới thiệu ca lâm sàng, … có liên quan tới chuyên ngành da liễu trong và ngoài nước. Tạp chí công bố các công trình nghiên cứu liên quan đến mô hình bệnh tật, các phương pháp chẩn đoán, điều trị, dự phòng và phục hồi chức năng các bệnh thuộc chuyên ngành da liễu. Ngoài ra, tạp chí còn đăng tải các bài tổng quan, cập nhật thông tin, kiến thức, hướng dẫn chẩn đoán, điều trị trong chuyên ngành da liễu trong nước và quốc tế; đăng tải các bài ca lâm sàng đặc biệt trong chuyên ngành da liễu.\\nTạp chí Da liễu học Việt Nam được biết tới là một tạp chí chuyên ngành có uy tín trong lĩnh vực da liễu. Các bài báo về nghiên cứu khoa học đăng trong Tạp chí được bình duyệt một cách nghiêm ngặt bởi ít nhất 2 chuyên gia. Hội đồng biên tập tạp chí bao gồm các nhà khoa học có uy tín (Giáo sư, Phó Giáo sư, Tiến sĩ, Bác sĩ…) trong chuyên ngành da liễu nhằm đảm bảo chất lượng và tính khách quan, khoa học cho các bài viết đăng trên Tạp chí.\\n\"}]}",{"EN":556,"VI":557},"Vietnamese Journal of Dermatology and Venereology","Tạp chí Da liễu học Việt Nam","Admin Import",[],[],[],"https:\u002F\u002Fvjdv.vn\u002Findex.php\u002Fvjdv","\u002Fapi\u002Fpublic\u002Ffile\u002Fpublisher\u002F6ec01bd0-15c0-469a-86ac-41339076ae0a\u002F3cbc81720e58429dc7b1c4d7ab1935ca.jpg",{"impactFactor":36,"impactFactorByYear":565,"i10Index":36,"i10IndexLast5Year":36,"totalPublication":566,"totalPublicationByYear":567,"totalCitation":116,"totalCitationByYear":570,"totalCitationPerPublication":109,"totalCitationPerPublicationByYear":571,"hindexLast5Year":115,"hindex":115},{"2023":38,"2024":230},182,{"2022":568,"2023":45,"2024":569},69,56,{"2022":52,"2023":115},{"2022":40,"2023":229},{"id":573,"createTime":574,"updateTime":575,"relativeEntities":576,"slug":577,"properties":578,"entityType":24,"verifyStatus":25,"verifyTime":26,"verifyNote":27,"syncStatus":28,"languages":587,"translateLanguages":26,"viewCount":283,"subjectFields":588,"manageAffiliations":589,"indexDatabases":647,"url":648,"thumbnailPath":649,"statistic":650,"gsStatistic":26,"type":26,"analyzePriority":26},"19221551-7519-47ff-a892-331d1139c64b","2023-09-12T07:03:05.744+00:00","2026-01-24T20:54:40.144+00:00",[],"T%E1%BA%A1p-ch%C3%AD-Khoa-h%E1%BB%8Dc-S%E1%BB%A9c-kho%E1%BA%BB-%C4%90%E1%BA%A1i-h%E1%BB%8Dc-Qu%E1%BB%91c-gia-Th%C3%A0nh-ph%E1%BB%91-H%E1%BB%93-Ch%C3%AD-Minh",{"country":579,"issn":580,"introduce":582,"title":584},{"VOID":15},{"VOID":581},"27349446",{"EN":583},"{\"ops\":[{\"attributes\":{\"bold\":true},\"insert\":\"1. History\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"attributes\":{\"bold\":true},\"insert\":\"Science and Technology Development Journal\"},{\"insert\":\" (STDJ) (ISSN 2734-9446), Vietnam National University - Ho Chi Minh City (VNU-HCM) was established in 1997. And the first issue was published in January 1998 with ISSN 1859-0128. Since then, STDJ has become the most important scientific forum of scientists from VNU-HCM as well as other universities. The magazine has undergone 20 years of development and has become a bridge for scientific exchanges, as well as enriching reference materials for the faculty, doctoral students, students of VNU-HCM in particular and other universities, institutes...\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"insert\":\"Science and Technology Development Journal - Health Sciences (STDJ-HS) is a subjournal of Science and Technology Development Journal since 2020.\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"insert\":\" \"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"attributes\":{\"bold\":true},\"insert\":\"2. Focus and Scope\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"insert\":\"Publishing articles with contents on healthcare, research projects in the field of health, advanced directions in health education and management. Therefore, STDJ-HS will accept articles from doctors, administrators, teachers, researchers, graduate students and fellows. The authors will be responsible for the accuracy of the data, opinions, opinions and material cited in the article.\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"insert\":\"Facilitating the exchange of scientific and technological information and act as a bridge between theory and practice in the community of educators, scientists, managers, policy makers and enterprises in and out of the country.\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"insert\":\"\\n\"}]}",{"EN":585,"VI":586},"VNUHCM JOURNAL OF HEALTH SCIENCES","Tạp chí Khoa học Sức khoẻ Đại học Quốc gia Thành phố Hồ Chí Minh",[101,102],[],[590],{"id":591,"createTime":592,"updateTime":593,"relativeEntities":594,"slug":595,"properties":596,"entityType":98,"verifyStatus":25,"verifyTime":606,"verifyNote":26,"syncStatus":28,"languages":607,"translateLanguages":26,"viewCount":608,"url":609,"parentIds":610,"statistic":611},"fc4c2560-868c-4677-acb1-8686bef88727","2023-06-26T04:48:23.774+00:00","2026-06-19T01:46:17.248+00:00",[],"%C4%90%E1%BA%A1i-h%E1%BB%8Dc-Qu%E1%BB%91c-gia-Th%C3%A0nh-ph%E1%BB%91-H%E1%BB%93-Ch%C3%AD-Minh",{"country":597,"title":598,"abbreviation":601,"address":603},{"VOID":15},{"EN":599,"VI":600},"Vietnam National University Ho Chi Minh City","Đại học Quốc gia Thành phố Hồ Chí Minh",{"VOID":602},"VNUHCM",{"VI":604,"EN":605},"khu phố 6, Phường Linh Trung, Thành phố Thủ Đức, Thành phố Hồ Chí Minh, Việt Nam","Quarter 6, Linh Trung Ward, Thu Duc City, Ho Chi Minh City, Vietnam","2023-08-16T14:13:07.134+00:00",[101,102],45,"https:\u002F\u002Fvnuhcm.edu.vn\u002F",[],{"impactFactor":36,"impactFactorByYear":612,"i10Index":285,"i10IndexLast5Year":51,"totalPublication":613,"totalPublicationByYear":614,"totalCitation":624,"totalCitationByYear":625,"totalCitationPerPublication":634,"totalCitationPerPublicationByYear":635,"hindexLast5Year":124,"hindex":124},{"2014":36,"2015":38,"2016":109,"2017":39,"2018":229,"2019":38,"2020":110,"2021":171,"2022":110,"2023":110,"2024":171,"2025":229},3708,{"2005":115,"2006":115,"2007":115,"2008":135,"2009":111,"2010":53,"2011":52,"2012":568,"2013":615,"2014":351,"2015":616,"2016":469,"2017":617,"2018":127,"2019":618,"2020":619,"2021":620,"2022":621,"2023":622,"2024":623,"2025":159,"2026":50},164,266,177,226,603,931,314,246,74,2399,{"2006":115,"2008":50,"2010":162,"2011":242,"2012":222,"2013":43,"2014":626,"2015":627,"2016":628,"2017":629,"2018":258,"2019":630,"2020":631,"2021":632,"2022":633,"2023":353,"2024":115},250,124,157,162,152,385,559,128,0.65,{"2006":115,"2008":636,"2010":637,"2011":638,"2012":639,"2013":522,"2014":640,"2015":641,"2016":642,"2017":643,"2018":644,"2019":642,"2020":645,"2021":292,"2022":646,"2023":522,"2024":38},1.33,0.45,2.22,0.39,1.35,0.47,0.67,0.92,0.73,0.64,0.41,[],"http:\u002F\u002Fstdjhs.scienceandtechnology.com.vn\u002Findex.php\u002Fstdjhs","\u002Fapi\u002Fpublic\u002Ffile\u002Fpublisher\u002F19221551-7519-47ff-a892-331d1139c64b\u002F2e10768b7d1e380c36a25ed0c714dd7e.png",{"impactFactor":36,"impactFactorByYear":651,"i10Index":36,"i10IndexLast5Year":36,"totalPublication":652,"totalPublicationByYear":653,"totalCitation":516,"totalCitationByYear":654,"totalCitationPerPublication":151,"totalCitationPerPublicationByYear":655,"hindexLast5Year":59,"hindex":59},{"2022":57,"2023":108,"2024":39},79,{"2020":116,"2021":240,"2022":239,"2023":52,"2024":162,"2025":162},{"2020":59,"2021":51,"2022":59},{"2020":443,"2021":387,"2022":54},{"code":657,"data":658,"meta":26},"SUCCESS",{"id":659,"createTime":660,"updateTime":661,"relativeEntities":662,"slug":663,"properties":664,"entityType":24,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36,"subjectFields":675,"manageAffiliations":684,"indexDatabases":705,"url":744,"thumbnailPath":26,"statistic":26,"gsStatistic":26,"type":26,"analyzePriority":26},"75f60fd6-87da-4d5c-8808-fcc32b67da76","2023-05-29T10:39:15.030+00:00","2025-11-21T10:05:13.612+00:00",[],"Communications-of-the-ACM",{"country":665,"issn":667,"introduce":669,"eissn":671,"title":673},{"VOID":666},"US",{"VOID":668},"15577317",{"EN":670},"Communications of the ACM is the leading print and online publication for the computing and information technology fields. Read by computing's leading professionals worldwide, Communications is recognized as the most trusted and knowledgeable source of industry information for today’s computing professional. Following the traditions of the Communications print magazine, which each month brings its readership of over 100,000 ACM members in-depth coverage of emerging areas of computer science, new trends in information technology, and practical applications, the Communications website brings topical and informative news and material to computing professionals each business day. ACM's membership includes the IT industry's most respected leaders and decision makers. Industry leaders have for more than 50 years used the monthly Communications of the ACM magazine as a platform to present and debate various technology implications, public policies, engineering challenges, and market trends. The Communications website continues that practice.",{"VOID":672},"00010782",{"EN":674},"Communications of the ACM",[676],{"id":677,"createTime":678,"updateTime":679,"relativeEntities":680,"label":681,"description":683,"parentId":26,"standard":26,"scholarHubFieldId":26},"b177825c-9d9c-4720-9088-005a06cd20a2","2023-05-29T10:24:12.249+00:00","2023-11-21T07:47:26.903+00:00",[],{"EN":682},"Computer Science (miscellaneous)",{},[685,695],{"id":686,"createTime":687,"updateTime":688,"relativeEntities":689,"slug":690,"properties":691,"entityType":98,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":115,"url":26,"parentIds":694,"statistic":26},"3e1064b5-61a8-4ca3-bf0f-108007c66507","2023-05-29T10:24:25.162+00:00","2025-11-21T10:07:07.489+00:00",[],"Association-for-Computing-Machinery-ACM-",{"title":692},{"EN":693},"Association for Computing Machinery (ACM)",[],{"id":696,"createTime":697,"updateTime":698,"relativeEntities":699,"slug":700,"properties":701,"entityType":98,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":115,"url":26,"parentIds":704,"statistic":26},"e413bfb3-d7e1-44b7-91f5-e2c2169ea732","2023-05-29T12:06:10.964+00:00","2024-02-11T02:11:46.468+00:00",[],"ASSOC-COMPUTING-MACHINERY",{"title":702},{"EN":703},"ASSOC COMPUTING MACHINERY",[],[706,725],{"id":707,"indexDatabase":708,"url":720,"indexYears":721,"academicFieldIds":722,"indexDatabaseRanking":724},"29026179-0e15-4047-9211-4bdbafe18819",{"id":709,"createTime":710,"updateTime":711,"relativeEntities":712,"label":713,"description":715,"key":717,"publicationTags":718,"standard":26},"3c7051d4-eb7d-4c57-a56b-36fc74c5d1e9","2023-05-22T09:57:18.509+00:00","2025-11-21T10:07:52.274+00:00",[],{"EN":714,"VI":714},"Scopus - Elsevier",{"EN":714,"VI":716},"Cơ sở dữ liệu Scopus thuộc Elsevier","scopus",[719],"SCOPUS","https:\u002F\u002Fwww.scopus.com\u002Fsourceid\u002F13675","1958-2025",[723],"06e80d88-c77a-4e7d-afe5-4dd75e7cdac8","SCOPUS__Q1",{"id":726,"indexDatabase":727,"url":741,"indexYears":26,"academicFieldIds":742,"indexDatabaseRanking":26},"acb68c47-e19a-40e2-9bda-f5805aa27644",{"id":728,"createTime":729,"updateTime":730,"relativeEntities":731,"label":732,"description":734,"key":737,"publicationTags":738,"standard":26},"a4921856-b128-4d9f-8f1f-e80813d3bbd4","2023-05-22T09:59:31.026+00:00","2025-11-21T10:07:52.153+00:00",[],{"EN":733,"VI":733},"ISI\u002FSCIE - Science Citation Index Expanded",{"VI":735,"EN":736},"Cơ sở dữ liệu SCIE","SCIE database","scie",[739,740],"SCIE","ISI","https:\u002F\u002Fmjl.clarivate.com\u002Fsearch-results?issn=0001-0782",[743],"874c55e0-262a-4246-b3d1-85e02c3c09db","https:\u002F\u002Fcacm.acm.org\u002F",{"meta":746,"data":748},{"total":747},"155",[749,979,1127,1292,1406,1516,1681,1983,2127,2274],{"id":750,"createTime":751,"updateTime":752,"relativeEntities":753,"slug":754,"properties":755,"entityType":770,"verifyStatus":25,"verifyTime":771,"verifyNote":772,"syncStatus":28,"languages":773,"translateLanguages":774,"viewCount":36,"primaryUrl":775,"fullTextUrl":26,"authors":776,"publicationType":832,"publisherRelationship":833,"citationCount":866,"citationInfo":867,"publishDate":879,"publishYear":880,"citationAnalyzeStatus":28,"lastCitationAnalyze":26,"indexDatabases":26,"openAccess":26,"references":881,"isForceReanalyzing":978},"f7fbd20b-5340-43e2-a0df-bd846bd7bcc5","2024-09-22T04:04:57.481+00:00","2025-02-01T16:48:55.713+00:00",[],"ImageNet-classification-with-deep-convolutional-neural-networks",{"mag":756,"keywords":758,"openalex":760,"abstract":762,"title":765,"doi":768},{"VOID":757},"2618530766",{"VI":759},"ImageNet, mạng nơ-ron tích chập sâu, phân loại hình ảnh, quy tắc dropout, hiệu suất mạng nơ-ron",{"VOID":761},"W2618530766",{"VI":763,"EN":764},"\u003Cjats:p>Chúng tôi đã huấn luyện một mạng nơ-ron tích chập sâu lớn để phân loại 1,2 triệu hình ảnh độ phân giải cao trong cuộc thi ImageNet LSVRC-2010 thành 1000 lớp khác nhau. Trên dữ liệu kiểm tra, chúng tôi đạt được tỷ lệ lỗi top-1 và top-5 lần lượt là 37,5% và 17,0%, điều này tốt hơn nhiều so với công nghệ tiên tiến trước đó. Mạng nơ-ron có 60 triệu tham số và 650.000 nơ-ron, bao gồm năm lớp tích chập, một số lớp có kèm theo lớp max-pooling, và ba lớp liên kết hoàn toàn với softmax 1000 chiều cuối cùng. Để tăng tốc quá trình huấn luyện, chúng tôi đã sử dụng nơ-ron không bão hòa và một triển khai GPU rất hiệu quả của phép toán tích chập. Để giảm thiểu hiện tượng quá khớp trong các lớp liên kết hoàn toàn, chúng tôi đã áp dụng một phương pháp điều hòa được phát triển gần đây gọi là \"dropout\" và đã chứng tỏ rất hiệu quả. Chúng tôi cũng đã tham gia một biến thể của mô hình này trong cuộc thi ILSVRC-2012 và đạt được tỷ lệ lỗi kiểm tra top-5 chiến thắng là 15,3%, so với 26,2% đạt được bởi bài dự thi đứng thứ hai.\u003C\u002Fjats:p>","\u003Cjats:p>We trained a large, deep convolutional neural network to classify the 1.2 million high-resolution images in the ImageNet LSVRC-2010 contest into the 1000 different classes. On the test data, we achieved top-1 and top-5 error rates of 37.5% and 17.0%, respectively, which is considerably better than the previous state-of-the-art. The neural network, which has 60 million parameters and 650,000 neurons, consists of five convolutional layers, some of which are followed by max-pooling layers, and three fully connected layers with a final 1000-way softmax. To make training faster, we used non-saturating neurons and a very efficient GPU implementation of the convolution operation. To reduce overfitting in the fully connected layers we employed a recently developed regularization method called \"dropout\" that proved to be very effective. We also entered a variant of this model in the ILSVRC-2012 competition and achieved a winning top-5 test error rate of 15.3%, compared to 26.2% achieved by the second-best entry.\u003C\u002Fjats:p>",{"VI":766,"EN":767},"Phân loại ImageNet bằng mạng nơ-ron tích chập sâu","ImageNet classification with deep convolutional neural networks",{"VOID":769},"10.1145\u002F3065386","PUBLICATION","2024-09-22T04:04:57.480+00:00","Auto Verify",[102],[101],"https:\u002F\u002Fdl.acm.org\u002Fdoi\u002F10.1145\u002F3065386",[777,797,817],{"id":778,"sortIndex":114,"researcher":26,"roles":779,"affiliations":780,"properties":790},"607bb20e-b1c3-47ef-8777-d344e52405a5",[],[781],{"id":782,"sortIndex":36,"affiliation":783,"properties":26},"19d89e3d-a3e8-4c4c-8c38-1c0843e517f0",{"id":784,"createTime":785,"updateTime":785,"relativeEntities":786,"slug":787,"properties":788,"entityType":98,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36},"2a29dec5-5749-4c64-997d-b92838b2f2f3","2024-09-22T04:04:57.568+00:00",[],"OpenAI",{"title":789},{"EN":787},{"openalex":791,"orcid":793,"title":795},{"VOID":792},"A5024209719",{"VOID":794},"https:\u002F\u002Forcid.org\u002F0000-0001-9789-9355",{"EN":796},"Geoffrey E. Hinton",{"id":798,"sortIndex":115,"researcher":26,"roles":799,"affiliations":800,"properties":812},"683554fb-9db5-494b-a7ff-23600c556a66",[],[801],{"id":802,"sortIndex":36,"affiliation":803,"properties":26},"c2a652a1-23df-4fa4-b9bf-ad03fe8d06df",{"id":804,"createTime":805,"updateTime":806,"relativeEntities":807,"slug":808,"properties":809,"entityType":98,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36},"695e3a95-59da-495b-9a4d-a6534ceb11b8","2023-12-09T00:40:35.404+00:00","2025-02-24T08:32:23.141+00:00",[],"Google-Inc",{"title":810},{"VI":811},"Google Inc",{"openalex":813,"title":815},{"VOID":814},"A5006446297",{"EN":816},"Ilya Sutskever",{"id":818,"sortIndex":36,"researcher":26,"roles":819,"affiliations":820,"properties":827},"c270e70c-95f9-4d2e-abff-75ca91600289",[],[821],{"id":822,"sortIndex":36,"affiliation":823,"properties":26},"c4f35ee7-7b90-488a-a0f0-971846162bfc",{"id":804,"createTime":805,"updateTime":806,"relativeEntities":824,"slug":808,"properties":825,"entityType":98,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36},[],{"title":826},{"VI":811},{"openalex":828,"title":830},{"VOID":829},"A5031152245",{"EN":831},"Alex Krizhevsky","ARTICLE",{"url":26,"publisher":834,"properties":859},{"id":659,"createTime":660,"updateTime":661,"relativeEntities":835,"slug":663,"properties":836,"entityType":24,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36,"subjectFields":842,"manageAffiliations":843,"indexDatabases":844,"url":744,"thumbnailPath":26,"statistic":26,"gsStatistic":26,"type":26,"analyzePriority":26},[],{"country":837,"issn":838,"introduce":839,"eissn":840,"title":841},{"VOID":666},{"VOID":668},{"EN":670},{"VOID":672},{"EN":674},[],[],[845,852],{"id":726,"indexDatabase":846,"url":741,"indexYears":26,"academicFieldIds":851,"indexDatabaseRanking":26},{"id":728,"createTime":729,"updateTime":730,"relativeEntities":847,"label":848,"description":849,"key":737,"publicationTags":850,"standard":26},[],{"EN":733,"VI":733},{"VI":735,"EN":736},[739,740],[743],{"id":707,"indexDatabase":853,"url":720,"indexYears":721,"academicFieldIds":858,"indexDatabaseRanking":724},{"id":709,"createTime":710,"updateTime":711,"relativeEntities":854,"label":855,"description":856,"key":717,"publicationTags":857,"standard":26},[],{"EN":714,"VI":714},{"EN":714,"VI":716},[719],[723],{"volume":860,"pages":862,"issue":864},{"VOID":861},"60",{"VOID":863},"84-90",{"VOID":865},"6",30007,{"total":866,"publishYear":26,"statisticByYear":868},{"2012":115,"2013":48,"2014":569,"2015":869,"2016":870,"2017":871,"2018":872,"2019":873,"2020":874,"2021":875,"2022":876,"2023":877,"2024":878},161,610,962,1333,2101,2965,5281,5239,6915,3575,"2017-05-24",2017,[882,885,888,891,894,897,900,903,906,909,912,915,918,921,924,927,930,933,936,939,942,945,948,951,954,957,960,963,966,969,972,975],{"id":26,"text":883,"url":26,"identifiers":884},"10.1145\u002F1345448.1345465",{"doi":883},{"id":26,"text":886,"url":26,"identifiers":887},"Berg A., 2010, Large scale visual recognition challenge",{},{"id":26,"text":889,"url":26,"identifiers":890},"10.1023\u002FA:1010933404324",{"doi":889},{"id":26,"text":892,"url":26,"identifiers":893},"Cireşan D., 2011, High-performance neural networks for visual object classification. Arxiv preprint arXiv:1102.0183",{},{"id":26,"text":895,"url":26,"identifiers":896},"Cireşan D., 2012, Multi-column deep neural networks for image classification. Arxiv preprint arXiv:1202.2745",{},{"id":26,"text":898,"url":26,"identifiers":899},"Deng J. Berg A. Satheesh S. Su H. Khosla A. Fei-Fei L. In ILSVRC-2012 (2012).  Deng J. Berg A. Satheesh S. Su H. Khosla A. Fei-Fei L. In ILSVRC-2012 (2012).",{},{"id":26,"text":901,"url":26,"identifiers":902},"Deng J., 2009, CVPR09",{},{"id":26,"text":904,"url":26,"identifiers":905},"10.1016\u002Fj.cviu.2005.09.012",{"doi":904},{"id":26,"text":907,"url":26,"identifiers":908},"10.1007\u002FBF00344251",{"doi":907},{"id":26,"text":910,"url":26,"identifiers":911},"He K., 2015, Deep residual learning for image recognition. arXiv preprint arXiv:1512.03385",{},{"id":26,"text":913,"url":26,"identifiers":914},"Hinton G., 2012, Improving neural networks by preventing co-adaptation of feature detectors. arXiv preprint arXiv:1207.0580",{},{"id":26,"text":916,"url":26,"identifiers":917},"10.1109\u002FICCV.2009.5459469",{"doi":916},{"id":26,"text":919,"url":26,"identifiers":920},"Krizhevsky A., 2009, Department of Computer Science",{},{"id":26,"text":922,"url":26,"identifiers":923},"Krizhevsky A., 2010, Convolutional deep belief networks on cifar-10. Unpublished manuscript",{},{"id":26,"text":925,"url":26,"identifiers":926},"Krizhevsky A., 2011, ESANN",{},{"id":26,"text":928,"url":26,"identifiers":929},"LeCun Y., 1990, Advances in Neural Information Processing Systems",{},{"id":26,"text":931,"url":26,"identifiers":932},"LeCun Y., 1985, Une procedure d'apprentissage pour reseau a seuil asymmetrique (a learning scheme for asymmetric threshold networks)",{},{"id":26,"text":934,"url":26,"identifiers":935},"10.5555\u002F1896300.1896315",{"doi":934},{"id":26,"text":937,"url":26,"identifiers":938},"10.1109\u002FISCAS.2010.5537907",{"doi":937},{"id":26,"text":940,"url":26,"identifiers":941},"10.1145\u002F1553374.1553453",{"doi":940},{"id":26,"text":943,"url":26,"identifiers":944},"10.1007\u002FBF01931367",{"doi":943},{"id":26,"text":946,"url":26,"identifiers":947},"Mensink T., 2012, Italy",{},{"id":26,"text":949,"url":26,"identifiers":950},"10.5555\u002F3104322.3104425",{"doi":949},{"id":26,"text":952,"url":26,"identifiers":953},"10.1371\u002Fjournal.pcbi.0040027",{"doi":952},{"id":26,"text":955,"url":26,"identifiers":956},"10.1371\u002Fjournal.pcbi.1000579",{"doi":955},{"id":26,"text":958,"url":26,"identifiers":959},"Rumelhart D.E., 1985, DTIC Document",{},{"id":26,"text":961,"url":26,"identifiers":962},"10.1007\u002Fs11263-007-0090-8",{"doi":961},{"id":26,"text":964,"url":26,"identifiers":965},"10.1109\u002FCVPR.2011.5995504",{"doi":964},{"id":26,"text":967,"url":26,"identifiers":968},"10.5555\u002F938980.939477",{"doi":967},{"id":26,"text":970,"url":26,"identifiers":971},"10.1109\u002FCVPR.2015.7298594",{"doi":970},{"id":26,"text":973,"url":26,"identifiers":974},"10.1162\u002Fneco.2009.10-08-881",{"doi":973},{"id":26,"text":976,"url":26,"identifiers":977},"Werbos P., 1974, Beyond regression: New tools for prediction and analysis in the behavioral sciences",{},false,{"id":980,"createTime":981,"updateTime":982,"relativeEntities":983,"slug":984,"properties":985,"entityType":770,"verifyStatus":25,"verifyTime":1000,"verifyNote":772,"syncStatus":28,"languages":1001,"translateLanguages":1002,"viewCount":36,"primaryUrl":1003,"fullTextUrl":26,"authors":1004,"publicationType":832,"publisherRelationship":1040,"citationCount":1072,"citationInfo":1073,"publishDate":1088,"publishYear":1089,"citationAnalyzeStatus":28,"lastCitationAnalyze":26,"indexDatabases":26,"openAccess":26,"references":1090,"isForceReanalyzing":978},"6c83db88-9bb0-480c-85b0-a053731d1664","2024-09-17T20:59:30.063+00:00","2024-12-29T14:10:01.108+00:00",[],"Random-sample-consensus",{"mag":986,"keywords":988,"openalex":990,"abstract":992,"title":995,"doi":998},{"VOID":987},"2085261163",{"VI":989},"",{"VOID":991},"W2085261163",{"EN":993,"VI":994},"\u003Cjats:p>A new paradigm, Random Sample Consensus (RANSAC), for fitting a model to experimental data is introduced. RANSAC is capable of interpreting\u002Fsmoothing data containing a significant percentage of gross errors, and is thus ideally suited for applications in automated image analysis where interpretation is based on the data provided by error-prone feature detectors. A major portion of this paper describes the application of RANSAC to the Location Determination Problem (LDP): Given an image depicting a set of landmarks with known locations, determine that point in space from which the image was obtained. In response to a RANSAC requirement, new results are derived on the minimum number of landmarks needed to obtain a solution, and algorithms are presented for computing these minimum-landmark solutions in closed form. These results provide the basis for an automatic system that can solve the LDP under difficult viewing\u003C\u002Fjats:p>","\u003Cjats:p>Một cách tiếp cận mới, thỏa thuận mẫu ngẫu nhiên (RANSAC), được giới thiệu để xây dựng mô hình cho dữ liệu thực nghiệm. RANSAC có khả năng diễn giải\u002Flàm mềm dữ liệu chứa một phần trăm cao lỗi nghiêm trọng, do đó rất thích hợp cho các ứng dụng trong phân tích hình ảnh tự động, nơi việc diễn giải dựa trên dữ liệu do các bộ phát hiện đặc trưng dễ bị lỗi cung cấp. Một phần lớn của bài báo này mô tả việc áp dụng RANSAC vào Vấn đề Xác định Vị trí (LDP): Cho một hình ảnh mô tả một tập hợp các điểm mốc với vị trí đã biết, xác định điểm trong không gian từ đó hình ảnh được lấy. Để đáp ứng yêu cầu của RANSAC, các kết quả mới được rút ra về số lượng điểm mốc tối thiểu cần thiết để đạt được một giải pháp, và các thuật toán được trình bày nhằm tính toán các giải pháp tối thiểu về điểm mốc theo dạng đóng. Các kết quả này cung cấp nền tảng cho một hệ thống tự động có thể giải quyết LDP trong những điều kiện xem khó khăn.\u003C\u002Fjats:p>",{"EN":996,"VI":997},"Random sample consensus","Thỏa thuận mẫu ngẫu nhiên",{"VOID":999},"10.1145\u002F358669.358692","2024-09-17T20:59:30.062+00:00",[102],[101],"https:\u002F\u002Fdl.acm.org\u002Fdoi\u002F10.1145\u002F358669.358692",[1005,1025],{"id":1006,"sortIndex":115,"researcher":26,"roles":1007,"affiliations":1008,"properties":1020},"df38b6c9-d57a-415d-86d2-ea721716e5be",[],[1009],{"id":1010,"sortIndex":36,"affiliation":1011,"properties":26},"817fb474-36b6-4182-b34e-5cb51f169840",{"id":1012,"createTime":1013,"updateTime":1014,"relativeEntities":1015,"slug":1016,"properties":1017,"entityType":98,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36},"ab1ae3bf-286f-4da1-86b6-5d04609d44b5","2024-09-17T20:59:30.080+00:00","2024-12-13T21:01:00.851+00:00",[],"SRI-International-Menlo-Park-CA-TAB-",{"title":1018},{"EN":1019},"SRI International, Menlo Park,CA#TAB#",{"openalex":1021,"title":1023},{"VOID":1022},"A5019197436",{"EN":1024},"Robert C. Bolles",{"id":1026,"sortIndex":36,"researcher":26,"roles":1027,"affiliations":1028,"properties":1035},"ff5e84f3-46be-44cd-b2be-2fda70c23de8",[],[1029],{"id":1030,"sortIndex":36,"affiliation":1031,"properties":26},"90b90e61-430b-4cdd-bcc0-003230262eda",{"id":1012,"createTime":1013,"updateTime":1014,"relativeEntities":1032,"slug":1016,"properties":1033,"entityType":98,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36},[],{"title":1034},{"EN":1019},{"openalex":1036,"title":1038},{"VOID":1037},"A5062440435",{"EN":1039},"Martin A. Fischler",{"url":26,"publisher":1041,"properties":1066},{"id":659,"createTime":660,"updateTime":661,"relativeEntities":1042,"slug":663,"properties":1043,"entityType":24,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36,"subjectFields":1049,"manageAffiliations":1050,"indexDatabases":1051,"url":744,"thumbnailPath":26,"statistic":26,"gsStatistic":26,"type":26,"analyzePriority":26},[],{"country":1044,"issn":1045,"introduce":1046,"eissn":1047,"title":1048},{"VOID":666},{"VOID":668},{"EN":670},{"VOID":672},{"EN":674},[],[],[1052,1059],{"id":726,"indexDatabase":1053,"url":741,"indexYears":26,"academicFieldIds":1058,"indexDatabaseRanking":26},{"id":728,"createTime":729,"updateTime":730,"relativeEntities":1054,"label":1055,"description":1056,"key":737,"publicationTags":1057,"standard":26},[],{"EN":733,"VI":733},{"VI":735,"EN":736},[739,740],[743],{"id":707,"indexDatabase":1060,"url":720,"indexYears":721,"academicFieldIds":1065,"indexDatabaseRanking":724},{"id":709,"createTime":710,"updateTime":711,"relativeEntities":1061,"label":1062,"description":1063,"key":717,"publicationTags":1064,"standard":26},[],{"EN":714,"VI":714},{"EN":714,"VI":716},[719],[723],{"volume":1067,"pages":1069,"issue":1071},{"VOID":1068},"24",{"VOID":1070},"381-395",{"VOID":865},22626,{"total":1072,"publishYear":26,"statisticByYear":1074},{"2012":1075,"2013":1076,"2014":1077,"2015":1078,"2016":1079,"2017":1080,"2018":1081,"2019":1082,"2020":1083,"2021":1084,"2022":1085,"2023":1086,"2024":1087},1089,1267,1282,1385,1227,1326,1369,1417,1419,1573,1359,1377,784,"1981-06-01",1981,[1091,1094,1097,1100,1103,1106,1109,1112,1115,1118,1121,1124],{"id":26,"text":1092,"url":26,"identifiers":1093},"Bolles , R.C. , Quam , L.H. , Fischler , M.A. , and Wolf , H.C . The SRI road expert: Image to database correspondence . In Proc. Image Understanding Workshop , Pittsburgh, Pennsylvania , Nov. , 1978 , Bolles, R.C., Quam, L.H., Fischler, M.A., and Wolf, H.C. The SRI road expert: Image to database correspondence. In Proc. Image Understanding Workshop, Pittsburgh, Pennsylvania, Nov., 1978,",{},{"id":26,"text":1095,"url":26,"identifiers":1096},"Chrystal , G. Textbook of Algebra ( Vol 1 ) . Chelsea, New York, New York 1964 , p. 415. Chrystal, G. Textbook of Algebra (Vol 1). Chelsea, New York, New York 1964, p. 415.",{},{"id":26,"text":1098,"url":26,"identifiers":1099},"Church , E. Revised geometry of the aerial photograph. Bull. Aerial Photogrammetry. 15 , 1945 , Syracuse University . Church, E. Revised geometry of the aerial photograph. Bull. Aerial Photogrammetry. 15, 1945, Syracuse University.",{},{"id":26,"text":1101,"url":26,"identifiers":1102},"Conte , S.D. Elementary Numerical Analysis . McGraw Hill , New York , 1965 . Conte, S.D. Elementary Numerical Analysis. McGraw Hill, New York, 1965.",{},{"id":26,"text":1104,"url":26,"identifiers":1105},"Dehn , E. Algebraic Equations . Dover , New York , 1960 . Dehn, E. Algebraic Equations. Dover, New York, 1960.",{},{"id":26,"text":1107,"url":26,"identifiers":1108},"Duda , R.O. , and Hart , P.E . Pattern Classification and Scene Analysis . Wiley-Interscience , New York , 1973 . Duda, R.O., and Hart, P.E. Pattern Classification and Scene Analysis. Wiley-Interscience, New York, 1973.",{},{"id":26,"text":1110,"url":26,"identifiers":1111},"Gennery , D.B. Least-squares stereo-camera calibration. Stanford Artificial Intelligence Project Internal Memo, Stanford , CA 1975. Gennery, D.B. Least-squares stereo-camera calibration. Stanford Artificial Intelligence Project Internal Memo, Stanford, CA 1975.",{},{"id":26,"text":1113,"url":26,"identifiers":1114},"Keller , M. and Tewinkel , G.C . Space resection in photogrammetry. ESSA Tech. Rept C&GS 32 , 1966 , U.S. Coast and Geodetic Survey . Keller, M. and Tewinkel, G.C. Space resection in photogrammetry. ESSA Tech. Rept C&GS 32, 1966, U.S. Coast and Geodetic Survey.",{},{"id":26,"text":1116,"url":26,"identifiers":1117},"Rogers , D.P. and Adams , J.A . Mathematical Elements for Computer Graphics . McGraw Hill , New York , 1976 . Rogers, D.P. and Adams, J.A. Mathematical Elements for Computer Graphics. McGraw Hill, New York, 1976.",{},{"id":26,"text":1119,"url":26,"identifiers":1120},"Sorensen , H.W. Least-squares estimation: from Gauss to Kalman . IEEE Spectrum (July 1970 ), 63-68. Sorensen, H.W. Least-squares estimation: from Gauss to Kalman. IEEE Spectrum (July 1970), 63-68.",{},{"id":26,"text":1122,"url":26,"identifiers":1123},"Wolf , P.R. Elements of Photogrammetry . McGraw Hill , New York , 1974 . Wolf, P.R. Elements of Photogrammetry. McGraw Hill, New York, 1974.",{},{"id":26,"text":1125,"url":26,"identifiers":1126},"Wylie , C.R. Jr. Introduction to Projective Geometry . McGraw- Hill , New York , 1970 . Wylie, C.R. Jr. Introduction to Projective Geometry. McGraw- Hill, New York, 1970.",{},{"id":1128,"createTime":1129,"updateTime":1130,"relativeEntities":1131,"slug":1132,"properties":1133,"entityType":770,"verifyStatus":25,"verifyTime":1145,"verifyNote":772,"syncStatus":28,"languages":1146,"translateLanguages":1147,"viewCount":36,"primaryUrl":1148,"fullTextUrl":26,"authors":1149,"publicationType":832,"publisherRelationship":1189,"citationCount":1222,"citationInfo":1223,"publishDate":1238,"publishYear":1239,"citationAnalyzeStatus":28,"lastCitationAnalyze":26,"indexDatabases":26,"openAccess":26,"references":1240,"isForceReanalyzing":978},"fa6507d6-00b6-47da-b0c7-2a5c0f5d8aa1","2024-12-27T09:53:01.245+00:00","2025-02-01T16:49:50.495+00:00",[],"MapReduce",{"mag":1134,"keywords":1136,"openalex":1137,"abstract":1139,"title":1142,"doi":1143},{"VOID":1135},"2173213060",{"VI":989},{"VOID":1138},"W2173213060",{"VI":1140,"EN":1141},"\u003Cjats:p>\n            MapReduce là một mô hình lập trình và một cách triển khai liên quan để xử lý và sinh ra các tập dữ liệu lớn, phù hợp với nhiều nhiệm vụ trong thực tế. Người dùng xác định phép tính theo các hàm \u003Cjats:italic>map\u003C\u002Fjats:italic> và \u003Cjats:italic>reduce\u003C\u002Fjats:italic>, và hệ thống thực thi nền tảng tự động phân tán phép tính trên các cụm máy lớn, xử lý các sự cố máy móc, và lên lịch giao tiếp giữa các máy để sử dụng hiệu quả mạng và ổ đĩa. Các lập trình viên thấy rằng hệ thống này rất dễ sử dụng: hơn mười nghìn chương trình MapReduce khác nhau đã được triển khai nội bộ tại Google trong bốn năm qua, và trung bình một trăm nghìn công việc MapReduce được thực hiện trên các cụm của Google mỗi ngày, xử lý tổng cộng hơn hai mươi petabyte dữ liệu mỗi ngày.\n          \u003C\u002Fjats:p>","\u003Cjats:p>\n            MapReduce is a programming model and an associated implementation for processing and generating large datasets that is amenable to a broad variety of real-world tasks. Users specify the computation in terms of a\n            \u003Cjats:italic>map\u003C\u002Fjats:italic>\n            and a\n            \u003Cjats:italic>reduce\u003C\u002Fjats:italic>\n            function, and the underlying runtime system automatically parallelizes the computation across large-scale clusters of machines, handles machine failures, and schedules inter-machine communication to make efficient use of the network and disks. Programmers find the system easy to use: more than ten thousand distinct MapReduce programs have been implemented internally at Google over the past four years, and an average of one hundred thousand MapReduce jobs are executed on Google's clusters every day, processing a total of more than twenty petabytes of data per day.\n          \u003C\u002Fjats:p>",{"VI":1132,"EN":1132},{"VOID":1144},"10.1145\u002F1327452.1327492","2024-12-27T09:53:01.244+00:00",[102],[101],"https:\u002F\u002Fdl.acm.org\u002Fdoi\u002F10.1145\u002F1327452.1327492",[1150,1172],{"id":1151,"sortIndex":36,"researcher":26,"roles":1152,"affiliations":1153,"properties":1165},"e4519817-d63e-42c4-ab4c-0a11feffad8b",[],[1154],{"id":1155,"sortIndex":36,"affiliation":1156,"properties":26},"50403772-9228-4eb8-ba96-ecb32ab023f6",{"id":1157,"createTime":1158,"updateTime":1159,"relativeEntities":1160,"slug":1161,"properties":1162,"entityType":98,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36},"83f0ba65-5e79-4c8e-b5ac-909c563139aa","2024-01-10T18:14:50.462+00:00","2024-12-30T09:13:21.244+00:00",[],"Google-Mountain-View-CA",{"title":1163},{"VI":1164},"Google, Mountain View, CA",{"openalex":1166,"orcid":1168,"title":1170},{"VOID":1167},"A5043872671",{"VOID":1169},"https:\u002F\u002Forcid.org\u002F0000-0003-1362-0500",{"EN":1171},"Jay B. Dean",{"id":1173,"sortIndex":115,"researcher":26,"roles":1174,"affiliations":1175,"properties":1182},"1b3299bc-cb4f-4245-aba6-4260f1bf8291",[],[1176],{"id":1177,"sortIndex":36,"affiliation":1178,"properties":26},"ae31dc9c-e47d-4b42-a200-43c034eda268",{"id":1157,"createTime":1158,"updateTime":1159,"relativeEntities":1179,"slug":1161,"properties":1180,"entityType":98,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36},[],{"title":1181},{"VI":1164},{"openalex":1183,"orcid":1185,"title":1187},{"VOID":1184},"A5012998255",{"VOID":1186},"https:\u002F\u002Forcid.org\u002F0009-0005-6843-3093",{"EN":1188},"Sanjay Ghemawat",{"url":26,"publisher":1190,"properties":1215},{"id":659,"createTime":660,"updateTime":661,"relativeEntities":1191,"slug":663,"properties":1192,"entityType":24,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36,"subjectFields":1198,"manageAffiliations":1199,"indexDatabases":1200,"url":744,"thumbnailPath":26,"statistic":26,"gsStatistic":26,"type":26,"analyzePriority":26},[],{"country":1193,"issn":1194,"introduce":1195,"eissn":1196,"title":1197},{"VOID":666},{"VOID":668},{"EN":670},{"VOID":672},{"EN":674},[],[],[1201,1208],{"id":726,"indexDatabase":1202,"url":741,"indexYears":26,"academicFieldIds":1207,"indexDatabaseRanking":26},{"id":728,"createTime":729,"updateTime":730,"relativeEntities":1203,"label":1204,"description":1205,"key":737,"publicationTags":1206,"standard":26},[],{"EN":733,"VI":733},{"VI":735,"EN":736},[739,740],[743],{"id":707,"indexDatabase":1209,"url":720,"indexYears":721,"academicFieldIds":1214,"indexDatabaseRanking":724},{"id":709,"createTime":710,"updateTime":711,"relativeEntities":1210,"label":1211,"description":1212,"key":717,"publicationTags":1213,"standard":26},[],{"EN":714,"VI":714},{"EN":714,"VI":716},[719],[723],{"volume":1216,"pages":1218,"issue":1220},{"VOID":1217},"51",{"VOID":1219},"107-113",{"VOID":1221},"1",18382,{"total":1222,"publishYear":26,"statisticByYear":1224},{"2012":1225,"2013":1226,"2014":1227,"2015":1228,"2016":1229,"2017":1230,"2018":1231,"2019":1232,"2020":1233,"2021":1234,"2022":1235,"2023":1236,"2024":1237},1375,1715,1982,2089,1851,1512,1383,1233,914,664,445,358,235,"2008-01-01",2008,[1241,1244,1247,1250,1253,1256,1259,1262,1265,1268,1271,1274,1277,1280,1283,1286,1289],{"id":26,"text":1242,"url":26,"identifiers":1243},"Hadoop: Open source implementation of MapReduce. http:\u002F\u002Flucene. apache.org\u002Fhadoop\u002F.  Hadoop: Open source implementation of MapReduce. http:\u002F\u002Flucene. apache.org\u002Fhadoop\u002F.",{},{"id":26,"text":1245,"url":26,"identifiers":1246},"The Phoenix system for MapReduce programming. http:\u002F\u002Fcsl.stanford. edu\u002F~christos\u002Fsw\u002Fphoenix\u002F.  The Phoenix system for MapReduce programming. http:\u002F\u002Fcsl.stanford. edu\u002F~christos\u002Fsw\u002Fphoenix\u002F.",{},{"id":26,"text":1248,"url":26,"identifiers":1249},"10.1145\u002F253260.253322",{"doi":1248},{"id":26,"text":1251,"url":26,"identifiers":1252},"10.1109\u002FMM.2003.1196112",{"doi":1251},{"id":26,"text":1254,"url":26,"identifiers":1255},"Bent , J. , Thain , D. , Arpaci-Dusseau , A. C. , Arpaci-Dusseau , R. H. , and Livny , M . 2004. Explicit control in a batch-aware distributed file system . In Proceedings of the 1st USENIX Symposium on Networked Systems Design and Implementation (NSDI). Bent, J., Thain, D., Arpaci-Dusseau, A. C., Arpaci-Dusseau, R. H., and Livny, M. 2004. Explicit control in a batch-aware distributed file system. In Proceedings of the 1st USENIX Symposium on Networked Systems Design and Implementation (NSDI).",{},{"id":26,"text":1257,"url":26,"identifiers":1258},"10.1109\u002F12.42122",{"doi":1257},{"id":26,"text":1260,"url":26,"identifiers":1261},"Chu , C.-T. , Kim , S. K. , Lin , Y. A. , Yu , Y. , Bradski , G. , Ng , A. , and Olukotun , K . 2006. Map-Reduce for machine learning on multicore . In Proceedings of Neural Information Processing Systems Conference (NIPS) . Vancouver, Canada. Chu, C.-T., Kim, S. K., Lin, Y. A., Yu, Y., Bradski, G., Ng, A., and Olukotun, K. 2006. Map-Reduce for machine learning on multicore. In Proceedings of Neural Information Processing Systems Conference (NIPS). Vancouver, Canada.",{},{"id":26,"text":1263,"url":26,"identifiers":1264},"Dean , J. and Ghemawat , S. 2004 . MapReduce: Simplified data processing on large clusters. In Proceedings of Operating Systems Design and Implementation (OSDI). San Francisco , CA. 137 - 150 . Dean, J. and Ghemawat, S. 2004. MapReduce: Simplified data processing on large clusters. In Proceedings of Operating Systems Design and Implementation (OSDI). San Francisco, CA. 137-150.",{},{"id":26,"text":1266,"url":26,"identifiers":1267},"10.1145\u002F268998.266662",{"doi":1266},{"id":26,"text":1269,"url":26,"identifiers":1270},"10.1145\u002F945445.945450",{"doi":1269},{"id":26,"text":1272,"url":26,"identifiers":1273},"Gorlatch , S. 1996. Systematic efficient parallelization of scan and other list homomorphisms . In L. Bouge, P. Fraigniaud, A. Mignotte, and Y. Robert, Eds. Euro-Par'96. Parallel Processing , Lecture Notes in Computer Science , vol. 1124 . Springer-Verlag . 401-408 Gorlatch, S. 1996. Systematic efficient parallelization of scan and other list homomorphisms. In L. Bouge, P. Fraigniaud, A. Mignotte, and Y. Robert, Eds. Euro-Par'96. Parallel Processing, Lecture Notes in Computer Science, vol. 1124. Springer-Verlag. 401-408",{},{"id":26,"text":1275,"url":26,"identifiers":1276},"Gray J. Sort benchmark home page. http:\u002F\u002Fresearch.microsoft.com\u002Fbarc\u002FSortBenchmark\u002F.  Gray J. Sort benchmark home page. http:\u002F\u002Fresearch.microsoft.com\u002Fbarc\u002FSortBenchmark\u002F.",{},{"id":26,"text":1278,"url":26,"identifiers":1279},"Huston , L. , Sukthankar , R. , Wickremesinghe , R. , Satyanarayanan , M. , Ganger , G. R. , Riedel , E. , and Ailamaki , A . 2004. Diamond: A storage architecture for early discard in interactive search . In Proceedings of the 2004 USENIX File and Storage Technologies FAST Conference. Huston, L., Sukthankar, R., Wickremesinghe, R., Satyanarayanan, M., Ganger, G. R., Riedel, E., and Ailamaki, A. 2004. Diamond: A storage architecture for early discard in interactive search. In Proceedings of the 2004 USENIX File and Storage Technologies FAST Conference.",{},{"id":26,"text":1281,"url":26,"identifiers":1282},"10.1145\u002F322217.322232",{"doi":1281},{"id":26,"text":1284,"url":26,"identifiers":1285},"10.1145\u002F62044.62050",{"doi":1284},{"id":26,"text":1287,"url":26,"identifiers":1288},"10.1109\u002FHPCA.2007.346181",{"doi":1287},{"id":26,"text":1290,"url":26,"identifiers":1291},"10.1109\u002F2.928624",{"doi":1290},{"id":1293,"createTime":1294,"updateTime":1295,"relativeEntities":1296,"slug":1297,"properties":1298,"entityType":770,"verifyStatus":25,"verifyTime":1294,"verifyNote":772,"syncStatus":28,"languages":1310,"translateLanguages":1311,"viewCount":36,"primaryUrl":1312,"fullTextUrl":26,"authors":1313,"publicationType":832,"publisherRelationship":1334,"citationCount":1367,"citationInfo":1368,"publishDate":1381,"publishYear":1382,"citationAnalyzeStatus":28,"lastCitationAnalyze":26,"indexDatabases":26,"openAccess":26,"references":1383,"isForceReanalyzing":978},"a3454606-93e9-454a-94b3-c3f4224499e7","2024-09-04T22:54:04.102+00:00","2025-02-01T16:50:46.484+00:00",[],"WordNet",{"mag":1299,"keywords":1301,"openalex":1302,"abstract":1304,"title":1307,"doi":1308},{"VOID":1300},"2081580037",{"VI":989},{"VOID":1303},"W2081580037",{"VI":1305,"EN":1306},"\u003Cjats:p>\n            Bởi vì câu có ý nghĩa được tạo thành từ các từ có nghĩa, bất kỳ hệ thống nào mong muốn xử lý ngôn ngữ tự nhiên như con người phải có thông tin về các từ và ý nghĩa của chúng. Thông tin này thường được cung cấp thông qua từ điển, và các từ điển có thể đọc được bằng máy hiện nay đã trở nên phổ biến. Nhưng các mục từ điển đã được phát triển vì mục đích thuận tiện cho người đọc, không phải cho máy móc. WordNet\n            \u003Cjats:sup>1\u003C\u002Fjats:sup>\n            cung cấp một sự kết hợp hiệu quả hơn giữa thông tin từ điển truyền thống và công nghệ máy tính hiện đại. WordNet là một cơ sở dữ liệu từ vựng trực tuyến được thiết kế để sử dụng dưới sự kiểm soát của chương trình. Các danh từ, động từ, tính từ và trạng từ tiếng Anh được tổ chức thành các tập hợp đồng nghĩa, mỗi tập hợp đại diện cho một khái niệm từ vựng. Các mối quan hệ ngữ nghĩa liên kết các tập hợp đồng nghĩa [4].\n          \u003C\u002Fjats:p>","\u003Cjats:p>\n            Because meaningful sentences are composed of meaningful words, any system that hopes to process natural languages as people do must have information about words and their meanings. This information is traditionally provided through dictionaries, and machine-readable dictionaries are now widely available. But dictionary entries evolved for the convenience of human readers, not for machines. WordNet\n            \u003Cjats:sup>1\u003C\u002Fjats:sup>\n            provides a more effective combination of traditional lexicographic information and modern computing. WordNet is an online lexical database designed for use under program control. English nouns, verbs, adjectives, and adverbs are organized into sets of synonyms, each representing a lexicalized concept. Semantic relations link the synonym sets [4].\n          \u003C\u002Fjats:p>",{"VI":1297,"EN":1297},{"VOID":1309},"10.1145\u002F219717.219748",[102],[101],"https:\u002F\u002Fdl.acm.org\u002Fdoi\u002F10.1145\u002F219717.219748",[1314],{"id":1315,"sortIndex":36,"researcher":26,"roles":1316,"affiliations":1317,"properties":1329},"4f67afcd-c91d-422d-92ec-ea927f8a3dbb",[],[1318],{"id":1319,"sortIndex":36,"affiliation":1320,"properties":26},"45e2e7d4-cac4-4aea-9c69-dcdf66471b61",{"id":1321,"createTime":1322,"updateTime":1323,"relativeEntities":1324,"slug":1325,"properties":1326,"entityType":98,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36},"a8240dd0-f45b-4e75-9583-42c8be71e264","2024-09-04T22:54:04.114+00:00","2025-01-02T03:26:04.951+00:00",[],"Princeton-Univ-Princeton-NJ",{"title":1327},{"EN":1328},"Princeton Univ., Princeton, NJ",{"openalex":1330,"title":1332},{"VOID":1331},"A5027070142",{"EN":1333},"George A. Miller",{"url":26,"publisher":1335,"properties":1360},{"id":659,"createTime":660,"updateTime":661,"relativeEntities":1336,"slug":663,"properties":1337,"entityType":24,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36,"subjectFields":1343,"manageAffiliations":1344,"indexDatabases":1345,"url":744,"thumbnailPath":26,"statistic":26,"gsStatistic":26,"type":26,"analyzePriority":26},[],{"country":1338,"issn":1339,"introduce":1340,"eissn":1341,"title":1342},{"VOID":666},{"VOID":668},{"EN":670},{"VOID":672},{"EN":674},[],[],[1346,1353],{"id":726,"indexDatabase":1347,"url":741,"indexYears":26,"academicFieldIds":1352,"indexDatabaseRanking":26},{"id":728,"createTime":729,"updateTime":730,"relativeEntities":1348,"label":1349,"description":1350,"key":737,"publicationTags":1351,"standard":26},[],{"EN":733,"VI":733},{"VI":735,"EN":736},[739,740],[743],{"id":707,"indexDatabase":1354,"url":720,"indexYears":721,"academicFieldIds":1359,"indexDatabaseRanking":724},{"id":709,"createTime":710,"updateTime":711,"relativeEntities":1355,"label":1356,"description":1357,"key":717,"publicationTags":1358,"standard":26},[],{"EN":714,"VI":714},{"EN":714,"VI":716},[719],[723],{"volume":1361,"pages":1363,"issue":1365},{"VOID":1362},"38",{"VOID":1364},"39-41",{"VOID":1366},"11",13330,{"total":1367,"publishYear":26,"statisticByYear":1369},{"2012":1370,"2013":1371,"2014":119,"2015":1372,"2016":1373,"2017":1374,"2018":1375,"2019":1376,"2020":1377,"2021":1376,"2022":1378,"2023":1379,"2024":1380},532,589,747,741,753,897,1011,1047,685,679,285,"1995-11-01",1995,[1384,1388,1391,1394,1397,1400,1403],{"id":26,"text":1385,"url":26,"identifiers":1386},"Charles W. G., 1988, J. Psycholinguistic Res., 17, 5, 10.1007\u002FBF01067226",{"doi":1387},"10.1007\u002FBF01067226",{"id":26,"text":1389,"url":26,"identifiers":1390},"Francis W. N., 1982, Mass.",{},{"id":26,"text":1392,"url":26,"identifiers":1393},"Leacock C., 1993, Proceedings of the Workshop on the Acquisition of Lexical Knowledge from Text, 10",{},{"id":26,"text":1395,"url":26,"identifiers":1396},"10.1093\u002Fijl\u002F3.4.235",{"doi":1395},{"id":26,"text":1398,"url":26,"identifiers":1399},"10.1080\u002F01690969108406936",{"doi":1398},{"id":26,"text":1401,"url":26,"identifiers":1402},"Miller G. A., 1992, B. Levin and, 197",{},{"id":26,"text":1404,"url":26,"identifiers":1405},"10.3115\u002F1075671.1075742",{"doi":1404},{"id":1407,"createTime":1408,"updateTime":1409,"relativeEntities":1410,"slug":1411,"properties":1412,"entityType":770,"verifyStatus":25,"verifyTime":1408,"verifyNote":772,"syncStatus":28,"languages":1426,"translateLanguages":1427,"viewCount":36,"primaryUrl":1428,"fullTextUrl":26,"authors":1429,"publicationType":832,"publisherRelationship":1452,"citationCount":1484,"citationInfo":1485,"publishDate":1498,"publishYear":1499,"citationAnalyzeStatus":28,"lastCitationAnalyze":26,"indexDatabases":26,"openAccess":26,"references":1500,"isForceReanalyzing":978},"50744c1e-e7e2-4f61-935c-5e61976fca7c","2024-10-04T02:56:20.627+00:00","2025-02-01T16:51:41.319+00:00",[],"How-to-share-a-secret",{"mag":1413,"keywords":1415,"openalex":1416,"abstract":1418,"title":1421,"doi":1424},{"VOID":1414},"2141420453",{"VI":989},{"VOID":1417},"W2141420453",{"VI":1419,"EN":1420},"\u003Cjats:p>\n            Trong bài báo này, chúng tôi trình bày cách chia dữ liệu\n            \u003Cjats:italic>D\u003C\u002Fjats:italic>\n            thành\n            \u003Cjats:italic>n\u003C\u002Fjats:italic>\n            phần sao cho\n            \u003Cjats:italic>D\u003C\u002Fjats:italic>\n            có thể dễ dàng tái tạo từ bất kỳ\n            \u003Cjats:italic>k\u003C\u002Fjats:italic>\n            phần nào, nhưng ngay cả khi có đầy đủ thông tin về\n            \u003Cjats:italic>k\u003C\u002Fjats:italic>\n            - 1 phần thì cũng không tiết lộ bất kỳ thông tin nào về\n            \u003Cjats:italic>D\u003C\u002Fjats:italic>\n            . Kỹ thuật này cho phép xây dựng các sơ đồ quản lý khóa mạnh mẽ cho các hệ thống mã hóa có thể hoạt động an toàn và đáng tin cậy ngay cả khi các sự cố phá hủy một nửa số phần và các lỗ hổng bảo mật tiết lộ tất cả ngoại trừ một trong các phần còn lại.\n          \u003C\u002Fjats:p>","\u003Cjats:p>\n            In this paper we show how to divide data\n            \u003Cjats:italic>D\u003C\u002Fjats:italic>\n            into\n            \u003Cjats:italic>n\u003C\u002Fjats:italic>\n            pieces in such a way that\n            \u003Cjats:italic>D\u003C\u002Fjats:italic>\n            is easily reconstructable from any\n            \u003Cjats:italic>k\u003C\u002Fjats:italic>\n            pieces, but even complete knowledge of\n            \u003Cjats:italic>k\u003C\u002Fjats:italic>\n            - 1 pieces reveals absolutely no information about\n            \u003Cjats:italic>D\u003C\u002Fjats:italic>\n            . This technique enables the construction of robust key management schemes for cryptographic systems that can function securely and reliably even when misfortunes destroy half the pieces and security breaches expose all but one of the remaining pieces.\n          \u003C\u002Fjats:p>",{"VI":1422,"EN":1423},"Cách chia sẻ một bí mật","How to share a secret",{"VOID":1425},"10.1145\u002F359168.359176",[102],[101],"https:\u002F\u002Fdl.acm.org\u002Fdoi\u002F10.1145\u002F359168.359176",[1430],{"id":1431,"sortIndex":36,"researcher":26,"roles":1432,"affiliations":1433,"properties":1445},"144f1187-d2db-4cc8-a33e-83bc228dc8ad",[],[1434],{"id":1435,"sortIndex":36,"affiliation":1436,"properties":26},"b324079a-bade-49b1-9558-8d4568b06a01",{"id":1437,"createTime":1438,"updateTime":1439,"relativeEntities":1440,"slug":1441,"properties":1442,"entityType":98,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36},"6c2b85df-e9b8-4438-9cb8-e76b931bd384","2023-12-06T02:24:38.592+00:00","2025-02-09T23:40:59.267+00:00",[],"Massachusetts-Institute-of-Technology-Cambridge",{"title":1443},{"VI":1444},"Massachusetts Institute of Technology, Cambridge",{"openalex":1446,"orcid":1448,"title":1450},{"VOID":1447},"A5009126679",{"VOID":1449},"https:\u002F\u002Forcid.org\u002F0000-0002-5422-905X",{"EN":1451},"Adi Shamir",{"url":26,"publisher":1453,"properties":1478},{"id":659,"createTime":660,"updateTime":661,"relativeEntities":1454,"slug":663,"properties":1455,"entityType":24,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36,"subjectFields":1461,"manageAffiliations":1462,"indexDatabases":1463,"url":744,"thumbnailPath":26,"statistic":26,"gsStatistic":26,"type":26,"analyzePriority":26},[],{"country":1456,"issn":1457,"introduce":1458,"eissn":1459,"title":1460},{"VOID":666},{"VOID":668},{"EN":670},{"VOID":672},{"EN":674},[],[],[1464,1471],{"id":726,"indexDatabase":1465,"url":741,"indexYears":26,"academicFieldIds":1470,"indexDatabaseRanking":26},{"id":728,"createTime":729,"updateTime":730,"relativeEntities":1466,"label":1467,"description":1468,"key":737,"publicationTags":1469,"standard":26},[],{"EN":733,"VI":733},{"VI":735,"EN":736},[739,740],[743],{"id":707,"indexDatabase":1472,"url":720,"indexYears":721,"academicFieldIds":1477,"indexDatabaseRanking":724},{"id":709,"createTime":710,"updateTime":711,"relativeEntities":1473,"label":1474,"description":1475,"key":717,"publicationTags":1476,"standard":26},[],{"EN":714,"VI":714},{"EN":714,"VI":716},[719],[723],{"volume":1479,"pages":1481,"issue":1483},{"VOID":1480},"22",{"VOID":1482},"612-613",{"VOID":1366},12456,{"total":1484,"publishYear":26,"statisticByYear":1486},{"2012":619,"2013":1487,"2014":1488,"2015":1489,"2016":1490,"2017":1491,"2018":1492,"2019":1493,"2020":1494,"2021":1495,"2022":279,"2023":1496,"2024":1497},662,626,647,562,544,581,684,720,721,643,326,"1979-11-01",1979,[1501,1504,1507,1510,1513],{"id":26,"text":1502,"url":26,"identifiers":1503},"Aho , A. , Hopcroft , J. , and Ullman , J . The Design and Analysis of Computer AIgorithms . Addison-Wesley , Reading, Mass ., 1974 . Aho, A., Hopcroft, J., and Ullman, J. The Design and Analysis of Computer AIgorithms. Addison-Wesley, Reading, Mass., 1974.",{},{"id":26,"text":1505,"url":26,"identifiers":1506},"Blakley , G.R. Safeguarding cryptographic keys . Proc. AFIPS 1979 NCC , Vol. 48 , Arlington, Va. , June 1979 , pp. 313 - 317 . Blakley, G.R. Safeguarding cryptographic keys. Proc. AFIPS 1979 NCC, Vol. 48, Arlington, Va., June 1979, pp. 313-317.",{},{"id":26,"text":1508,"url":26,"identifiers":1509},"Knuth , D. The Art of Computer Programming , Vol. 2 : SeminumericalAlgorithms . Addison-Wesley , Reading, Mass ., 1969 . Knuth, D. The Art of Computer Programming, Vol. 2: SeminumericalAlgorithms. Addison-Wesley, Reading, Mass., 1969.",{},{"id":26,"text":1511,"url":26,"identifiers":1512},"Liu , C.L. Introduction to Combinatorial Mathematics . McGraw- Hill , New York , 1968 . Liu, C.L. Introduction to Combinatorial Mathematics. McGraw- Hill, New York, 1968.",{},{"id":26,"text":1514,"url":26,"identifiers":1515},"10.1145\u002F359340.359342",{"doi":1514},{"id":1517,"createTime":1518,"updateTime":1519,"relativeEntities":1520,"slug":1521,"properties":1522,"entityType":770,"verifyStatus":25,"verifyTime":1518,"verifyNote":772,"syncStatus":28,"languages":1533,"translateLanguages":1534,"viewCount":36,"primaryUrl":1535,"fullTextUrl":26,"authors":1536,"publicationType":832,"publisherRelationship":1587,"citationCount":1620,"citationInfo":1621,"publishDate":1635,"publishYear":1636,"citationAnalyzeStatus":28,"lastCitationAnalyze":26,"indexDatabases":26,"openAccess":26,"references":1637,"isForceReanalyzing":978},"3c5e7f9b-296a-402f-8602-8f8fc836734f","2024-09-05T04:27:53.664+00:00","2025-02-01T16:52:37.952+00:00",[],"A-method-for-obtaining-digital-signatures-and-public-key-cryptosystems",{"keywords":1523,"openalex":1524,"abstract":1526,"title":1529,"doi":1532},{"VI":989},{"VOID":1525},"W4232836212",{"VI":1527,"EN":1528},"\u003Cjats:p>\n            Một phương pháp mã hóa được trình bày với đặc điểm mới là việc công khai một khóa mã hóa không tiết lộ khóa giải mã tương ứng. Điều này có hai hệ quả quan trọng: (1) Không cần đến những người chuyển phát hoặc các phương tiện bảo mật khác để truyền tải khóa, vì một thông điệp có thể được mã hóa bằng khóa mã hóa được công khai bởi người nhận mong muốn. Chỉ có người đó có thể giải mã được thông điệp, vì chỉ có họ biết khóa giải mã tương ứng. (2) Một thông điệp có thể được \"ký\" bằng khóa giải mã được giữ bí mật. Bất kỳ ai cũng có thể xác minh chữ ký này bằng cách sử dụng khóa mã hóa đã được công khai. Chữ ký không thể bị giả mạo và người ký không thể phủ nhận tính hợp lệ của chữ ký của mình. Điều này có áp dụng rõ ràng trong các hệ thống \"thư điện tử\" và \"chuyển khoản điện tử\". Một thông điệp được mã hóa bằng cách đại diện cho nó như một số M, nâng M lên một số mũ e được chỉ định công khai, và sau đó lấy phần dư khi kết quả được chia cho một tích số công khai được chỉ định,\n            \u003Cjats:italic>n\u003C\u002Fjats:italic>\n            , của hai số nguyên tố bí mật lớn p và q. Việc giải mã tương tự; chỉ sử dụng một số mũ bí mật khác, d, trong đó e * d ≡ 1(mod (p - 1) * (q - 1)). Sự an toàn của hệ thống phần nào dựa vào độ khó của việc phân tích thừa số của số chia công khai,\n            \u003Cjats:italic>n\u003C\u002Fjats:italic>\n            .\n          \u003C\u002Fjats:p>","\u003Cjats:p>\n            An encryption method is presented with the novel property that publicly revealing an encryption key does not thereby reveal the corresponding decryption key. This has two important consequences: (1) Couriers or other secure means are not needed to transmit keys, since a message can be enciphered using an encryption key publicly revealed by the intented recipient. Only he can decipher the message, since only he knows the corresponding decryption key. (2) A message can be “signed” using a privately held decryption key. Anyone can verify this signature using the corresponding publicly revealed encryption key. Signatures cannot be forged, and a signer cannot later deny the validity of his signature. This has obvious applications in “electronic mail” and “electronic funds transfer” systems. A message is encrypted by representing it as a number M, raising M to a publicly specified power e, and then taking the remainder when the result is divided by the publicly specified product,\n            \u003Cjats:italic>n\u003C\u002Fjats:italic>\n            , of two large secret primer numbers p and q. Decryption is similar; only a different, secret, power d is used, where e * d ≡ 1(mod (p - 1) * (q - 1)). The security of the system rests in part on the difficulty of factoring the published divisor,\n            \u003Cjats:italic>n\u003C\u002Fjats:italic>\n            .\n          \u003C\u002Fjats:p>",{"VI":1530,"EN":1531},"Phương pháp để thu được chữ ký số và hệ thống mật mã khóa công khai","A method for obtaining digital signatures and public-key cryptosystems",{"VOID":1514},[102],[101],"https:\u002F\u002Fdl.acm.org\u002Fdoi\u002F10.1145\u002F359340.359342",[1537,1556,1570],{"id":1538,"sortIndex":114,"researcher":26,"roles":1539,"affiliations":1540,"properties":1551},"97323dba-3002-4067-9168-2c103bb42830",[],[1541],{"id":1542,"sortIndex":36,"affiliation":1543,"properties":26},"c4e913c7-49c4-4ada-b916-16325da9c42a",{"id":1544,"createTime":1545,"updateTime":1545,"relativeEntities":1546,"slug":1547,"properties":1548,"entityType":98,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36},"57514542-03a0-41cd-809b-abd2b4d48699","2024-09-05T04:27:53.679+00:00",[],"MIT-Lab-for-Computer-Science-and-Department-of-Mathematics-Cambridge-MA",{"title":1549},{"EN":1550},"MIT Lab. for Computer Science and Department of Mathematics, Cambridge, MA",{"openalex":1552,"title":1554},{"VOID":1553},"A5048720314",{"EN":1555},"Leonard M. Adleman",{"id":1557,"sortIndex":115,"researcher":26,"roles":1558,"affiliations":1559,"properties":1566},"db4702be-8ba1-428b-91c2-5b68e7a5e52a",[],[1560],{"id":1561,"sortIndex":36,"affiliation":1562,"properties":26},"fc67fb63-9a59-465d-8fc2-f271185a6cb4",{"id":1544,"createTime":1545,"updateTime":1545,"relativeEntities":1563,"slug":1547,"properties":1564,"entityType":98,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36},[],{"title":1565},{"EN":1550},{"openalex":1567,"orcid":1568,"title":1569},{"VOID":1447},{"VOID":1449},{"EN":1451},{"id":1571,"sortIndex":36,"researcher":26,"roles":1572,"affiliations":1573,"properties":1580},"fd763980-2418-4664-ad36-1f83f72c351d",[],[1574],{"id":1575,"sortIndex":36,"affiliation":1576,"properties":26},"c69995f8-e473-4b57-8c92-1b6b13a6f7a9",{"id":1544,"createTime":1545,"updateTime":1545,"relativeEntities":1577,"slug":1547,"properties":1578,"entityType":98,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36},[],{"title":1579},{"EN":1550},{"openalex":1581,"orcid":1583,"title":1585},{"VOID":1582},"A5051087399",{"VOID":1584},"https:\u002F\u002Forcid.org\u002F0000-0002-7105-3690",{"EN":1586},"Ronald L. Rivest",{"url":26,"publisher":1588,"properties":1613},{"id":659,"createTime":660,"updateTime":661,"relativeEntities":1589,"slug":663,"properties":1590,"entityType":24,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36,"subjectFields":1596,"manageAffiliations":1597,"indexDatabases":1598,"url":744,"thumbnailPath":26,"statistic":26,"gsStatistic":26,"type":26,"analyzePriority":26},[],{"country":1591,"issn":1592,"introduce":1593,"eissn":1594,"title":1595},{"VOID":666},{"VOID":668},{"EN":670},{"VOID":672},{"EN":674},[],[],[1599,1606],{"id":726,"indexDatabase":1600,"url":741,"indexYears":26,"academicFieldIds":1605,"indexDatabaseRanking":26},{"id":728,"createTime":729,"updateTime":730,"relativeEntities":1601,"label":1602,"description":1603,"key":737,"publicationTags":1604,"standard":26},[],{"EN":733,"VI":733},{"VI":735,"EN":736},[739,740],[743],{"id":707,"indexDatabase":1607,"url":720,"indexYears":721,"academicFieldIds":1612,"indexDatabaseRanking":724},{"id":709,"createTime":710,"updateTime":711,"relativeEntities":1608,"label":1609,"description":1610,"key":717,"publicationTags":1611,"standard":26},[],{"EN":714,"VI":714},{"EN":714,"VI":716},[719],[723],{"volume":1614,"pages":1616,"issue":1618},{"VOID":1615},"21",{"VOID":1617},"120-126",{"VOID":1619},"2",11487,{"total":1620,"publishYear":26,"statisticByYear":1622},{"2012":1623,"2013":1624,"2014":1625,"2015":1626,"2016":163,"2017":1627,"2018":1628,"2019":1629,"2020":1630,"2021":1631,"2022":1632,"2023":1633,"2024":1634},378,380,441,417,464,470,540,593,570,633,644,381,"1978-02-01",1978,[1638,1641,1644,1647,1650,1653,1656,1659,1662,1665,1668,1671,1674,1678],{"id":26,"text":1639,"url":26,"identifiers":1640},"10.1109\u002FTIT.1976.1055638",{"doi":1639},{"id":26,"text":1642,"url":26,"identifiers":1643},"10.1109\u002FC-M.1977.217750",{"doi":1642},{"id":26,"text":1645,"url":26,"identifiers":1646},"Knuth , D. E. The Art of Computer Programming , Vol 2: Seminumerical Algorithms . Addison-Wesley , Reading, Mass ., 1969 . Knuth, D. E. The Art of Computer Programming, Vol 2: Seminumerical Algorithms. Addison-Wesley, Reading, Mass., 1969.",{},{"id":26,"text":1648,"url":26,"identifiers":1649},"10.1080\u002F0161-117791832814",{"doi":1648},{"id":26,"text":1651,"url":26,"identifiers":1652},"10.1145\u002F359460.359473",{"doi":1651},{"id":26,"text":1654,"url":26,"identifiers":1655},"10.1145\u002F800116.803773",{"doi":1654},{"id":26,"text":1657,"url":26,"identifiers":1658},"Niven , I. , and Zuckerman , H.S . An Introduction to the Theory of Numbers . Wiley , New York , 1972 . Niven, I., and Zuckerman, H.S. An Introduction to the Theory of Numbers. Wiley, New York, 1972.",{},{"id":26,"text":1660,"url":26,"identifiers":1661},"10.1109\u002FTIT.1978.1055817",{"doi":1660},{"id":26,"text":1663,"url":26,"identifiers":1664},"10.1017\u002FS0305004100049252",{"doi":1663},{"id":26,"text":1666,"url":26,"identifiers":1667},"Potter , R.J. , Electronic mail. Science 195, 4283 (March 1977 ), 1160-1164. Potter, R.J., Electronic mail. Science 195, 4283 (March 1977), 1160-1164.",{},{"id":26,"text":1669,"url":26,"identifiers":1670},"Rabin , M.O. , Probabilistic algorithms . In Algorithms and Complexity, J. F. Traub, Ed., Academic Press , New York , 1976 , pp. 21 - 40 . Rabin, M.O., Probabilistic algorithms. In Algorithms and Complexity, J. F. Traub, Ed., Academic Press, New York, 1976, pp. 21-40.",{},{"id":26,"text":1672,"url":26,"identifiers":1673},"10.1137\u002F0206006",{"doi":1672},{"id":26,"text":1675,"url":26,"identifiers":1676},"Federal Register Vol. 40 No. 52 March 17 1975.  Federal Register Vol. 40 No. 52 March 17 1975.",{"doi":1677},"10.1515\u002F9783112546208-006",{"id":26,"text":1679,"url":26,"identifiers":1680},"Federal Register Vol. 40 No. 149 August 1 1975.  Federal Register Vol. 40 No. 149 August 1 1975.",{},{"id":1682,"createTime":1683,"updateTime":1684,"relativeEntities":1685,"slug":1686,"properties":1687,"entityType":770,"verifyStatus":25,"verifyTime":1683,"verifyNote":772,"syncStatus":28,"languages":1701,"translateLanguages":1702,"viewCount":36,"primaryUrl":1703,"fullTextUrl":26,"authors":1704,"publicationType":832,"publisherRelationship":1884,"citationCount":1917,"citationInfo":1918,"publishDate":1932,"publishYear":1933,"citationAnalyzeStatus":28,"lastCitationAnalyze":26,"indexDatabases":26,"openAccess":26,"references":1934,"isForceReanalyzing":978},"7a2e435f-73d5-4742-853c-4c714282aae2","2024-09-04T15:49:25.570+00:00","2025-02-01T16:53:32.493+00:00",[],"A-view-of-cloud-computing",{"mag":1688,"keywords":1690,"openalex":1691,"abstract":1693,"title":1696,"doi":1699},{"VOID":1689},"2114296561",{"VI":989},{"VOID":1692},"W2114296561",{"VI":1694,"EN":1695},"\u003Cjats:p>Xóa bỏ những mây mù khỏi tiềm năng thực sự và những trở ngại mà khả năng tính toán này gây ra.\u003C\u002Fjats:p>","\u003Cjats:p>Clearing the clouds away from the true potential and obstacles posed by this computing capability.\u003C\u002Fjats:p>",{"VI":1697,"EN":1698},"Một cái nhìn về điện toán đám mây","A view of cloud computing",{"VOID":1700},"10.1145\u002F1721654.1721672",[102],[101],"https:\u002F\u002Fdl.acm.org\u002Fdoi\u002F10.1145\u002F1721654.1721672",[1705,1724,1739,1756,1771,1786,1803,1820,1837,1854,1869],{"id":1706,"sortIndex":111,"researcher":26,"roles":1707,"affiliations":1708,"properties":1719},"5ef81507-282c-4913-90d1-5b2de4cb5455",[],[1709],{"id":1710,"sortIndex":36,"affiliation":1711,"properties":26},"9a2f8c30-8c28-43e6-b564-155c3dae98fb",{"id":1712,"createTime":1713,"updateTime":1713,"relativeEntities":1714,"slug":1715,"properties":1716,"entityType":98,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36},"50064e85-cf1b-48fd-9309-6e4bd16871bf","2024-09-04T15:49:25.586+00:00",[],"UC-Berkeley-Reliable-Adaptive-Distributed-Systems-Laboratory-RAD-Lab-TAB-",{"title":1717},{"EN":1718},"UC Berkeley Reliable Adaptive Distributed Systems Laboratory (RAD Lab)#TAB#",{"openalex":1720,"title":1722},{"VOID":1721},"A5055613222",{"EN":1723},"Randy H. Katz",{"id":1725,"sortIndex":36,"researcher":26,"roles":1726,"affiliations":1727,"properties":1734},"ea80cb7a-d676-4dcb-badd-bb0dc462fdee",[],[1728],{"id":1729,"sortIndex":36,"affiliation":1730,"properties":26},"b6995bd6-a79f-4d8a-b789-890961c7b5c5",{"id":1712,"createTime":1713,"updateTime":1713,"relativeEntities":1731,"slug":1715,"properties":1732,"entityType":98,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36},[],{"title":1733},{"EN":1718},{"openalex":1735,"title":1737},{"VOID":1736},"A5073379366",{"EN":1738},"Michael Armbrust",{"id":1740,"sortIndex":52,"researcher":26,"roles":1741,"affiliations":1742,"properties":1749},"904af641-b1ff-40ad-ba2b-43c4dfa9e045",[],[1743],{"id":1744,"sortIndex":36,"affiliation":1745,"properties":26},"a7ad1333-c0a6-4f49-845e-7c97e5a8b437",{"id":1712,"createTime":1713,"updateTime":1713,"relativeEntities":1746,"slug":1715,"properties":1747,"entityType":98,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36},[],{"title":1748},{"EN":1718},{"openalex":1750,"orcid":1752,"title":1754},{"VOID":1751},"A5041920173",{"VOID":1753},"https:\u002F\u002Forcid.org\u002F0000-0002-5373-0088",{"EN":1755},"Ion Stoica",{"id":1757,"sortIndex":162,"researcher":26,"roles":1758,"affiliations":1759,"properties":1766},"63471d00-7ce0-41c7-8035-d5e8fa079179",[],[1760],{"id":1761,"sortIndex":36,"affiliation":1762,"properties":26},"4bbf3096-f2e6-4715-8176-ceb05f12e3da",{"id":1712,"createTime":1713,"updateTime":1713,"relativeEntities":1763,"slug":1715,"properties":1764,"entityType":98,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36},[],{"title":1765},{"EN":1718},{"openalex":1767,"title":1769},{"VOID":1768},"A5080989652",{"EN":1770},"Andy Konwinski",{"id":1772,"sortIndex":114,"researcher":26,"roles":1773,"affiliations":1774,"properties":1781},"e1b62bc7-9694-4801-b04c-e8394e0d15fe",[],[1775],{"id":1776,"sortIndex":36,"affiliation":1777,"properties":26},"d9575880-0d39-490e-aa38-7a71eabebca9",{"id":1712,"createTime":1713,"updateTime":1713,"relativeEntities":1778,"slug":1715,"properties":1779,"entityType":98,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36},[],{"title":1780},{"EN":1718},{"openalex":1782,"title":1784},{"VOID":1783},"A5035396004",{"EN":1785},"Rean Griffith",{"id":1787,"sortIndex":115,"researcher":26,"roles":1788,"affiliations":1789,"properties":1796},"b4ba03d3-70af-4559-9013-78b7b1a68fdc",[],[1790],{"id":1791,"sortIndex":36,"affiliation":1792,"properties":26},"704c7175-f5ef-411f-a222-0ca61500bb11",{"id":1712,"createTime":1713,"updateTime":1713,"relativeEntities":1793,"slug":1715,"properties":1794,"entityType":98,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36},[],{"title":1795},{"EN":1718},{"openalex":1797,"orcid":1799,"title":1801},{"VOID":1798},"A5088855767",{"VOID":1800},"https:\u002F\u002Forcid.org\u002F0000-0002-6096-4931",{"EN":1802},"Armando Fox",{"id":1804,"sortIndex":59,"researcher":26,"roles":1805,"affiliations":1806,"properties":1813},"46ccaf05-ad6c-40e6-a5ad-b3524b7029c4",[],[1807],{"id":1808,"sortIndex":36,"affiliation":1809,"properties":26},"6d577699-53e8-4117-87b9-a976512d988f",{"id":1712,"createTime":1713,"updateTime":1713,"relativeEntities":1810,"slug":1715,"properties":1811,"entityType":98,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36},[],{"title":1812},{"EN":1718},{"openalex":1814,"orcid":1816,"title":1818},{"VOID":1815},"A5017381278",{"VOID":1817},"https:\u002F\u002Forcid.org\u002F0000-0002-6798-9664",{"EN":1819},"Anthony D. Joseph",{"id":1821,"sortIndex":158,"researcher":26,"roles":1822,"affiliations":1823,"properties":1830},"6cd22076-63b9-42a4-bc23-d2f92b0e85c2",[],[1824],{"id":1825,"sortIndex":36,"affiliation":1826,"properties":26},"6554fe7a-dfe8-4ea9-9189-2ca18da4e9fc",{"id":1712,"createTime":1713,"updateTime":1713,"relativeEntities":1827,"slug":1715,"properties":1828,"entityType":98,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36},[],{"title":1829},{"EN":1718},{"openalex":1831,"orcid":1833,"title":1835},{"VOID":1832},"A5077202069",{"VOID":1834},"https:\u002F\u002Forcid.org\u002F0000-0003-0902-7093",{"EN":1836},"David A. Patterson",{"id":1838,"sortIndex":116,"researcher":26,"roles":1839,"affiliations":1840,"properties":1847},"c1af2a0f-8753-4820-a61b-b632b22ada6f",[],[1841],{"id":1842,"sortIndex":36,"affiliation":1843,"properties":26},"fb440170-6383-4029-9856-bfd2c6ff9651",{"id":1712,"createTime":1713,"updateTime":1713,"relativeEntities":1844,"slug":1715,"properties":1845,"entityType":98,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36},[],{"title":1846},{"EN":1718},{"openalex":1848,"orcid":1850,"title":1852},{"VOID":1849},"A5005554337",{"VOID":1851},"https:\u002F\u002Forcid.org\u002F0000-0002-7547-7204",{"EN":1853},"Matei Zaharia",{"id":1855,"sortIndex":135,"researcher":26,"roles":1856,"affiliations":1857,"properties":1864},"a8fea072-3903-4380-bc0b-2ec2ce585a46",[],[1858],{"id":1859,"sortIndex":36,"affiliation":1860,"properties":26},"147a0933-81f5-4fca-909a-f80b100f3498",{"id":1712,"createTime":1713,"updateTime":1713,"relativeEntities":1861,"slug":1715,"properties":1862,"entityType":98,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36},[],{"title":1863},{"EN":1718},{"openalex":1865,"title":1867},{"VOID":1866},"A5037175646",{"EN":1868},"Gunho Lee",{"id":1870,"sortIndex":50,"researcher":26,"roles":1871,"affiliations":1872,"properties":1879},"9a0075b9-9b71-49a2-b7e0-ee477c4c7161",[],[1873],{"id":1874,"sortIndex":36,"affiliation":1875,"properties":26},"7da87b24-f070-4676-96a7-8fcb99dc46f3",{"id":1712,"createTime":1713,"updateTime":1713,"relativeEntities":1876,"slug":1715,"properties":1877,"entityType":98,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36},[],{"title":1878},{"EN":1718},{"openalex":1880,"title":1882},{"VOID":1881},"A5053175008",{"EN":1883},"Ariel Rabkin",{"url":26,"publisher":1885,"properties":1910},{"id":659,"createTime":660,"updateTime":661,"relativeEntities":1886,"slug":663,"properties":1887,"entityType":24,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36,"subjectFields":1893,"manageAffiliations":1894,"indexDatabases":1895,"url":744,"thumbnailPath":26,"statistic":26,"gsStatistic":26,"type":26,"analyzePriority":26},[],{"country":1888,"issn":1889,"introduce":1890,"eissn":1891,"title":1892},{"VOID":666},{"VOID":668},{"EN":670},{"VOID":672},{"EN":674},[],[],[1896,1903],{"id":726,"indexDatabase":1897,"url":741,"indexYears":26,"academicFieldIds":1902,"indexDatabaseRanking":26},{"id":728,"createTime":729,"updateTime":730,"relativeEntities":1898,"label":1899,"description":1900,"key":737,"publicationTags":1901,"standard":26},[],{"EN":733,"VI":733},{"VI":735,"EN":736},[739,740],[743],{"id":707,"indexDatabase":1904,"url":720,"indexYears":721,"academicFieldIds":1909,"indexDatabaseRanking":724},{"id":709,"createTime":710,"updateTime":711,"relativeEntities":1905,"label":1906,"description":1907,"key":717,"publicationTags":1908,"standard":26},[],{"EN":714,"VI":714},{"EN":714,"VI":716},[719],[723],{"volume":1911,"pages":1913,"issue":1915},{"VOID":1912},"53",{"VOID":1914},"50-58",{"VOID":1916},"4",8571,{"total":1917,"publishYear":26,"statisticByYear":1919},{"2012":1920,"2013":1921,"2014":1922,"2015":1923,"2016":1924,"2017":1925,"2018":1926,"2019":1927,"2020":1928,"2021":1929,"2022":160,"2023":1930,"2024":1931},601,949,1150,1046,899,678,695,583,437,421,245,150,"2010-04-01",2010,[1935,1938,1941,1944,1947,1950,1953,1956,1959,1962,1965,1968,1971,1974,1977,1980],{"id":26,"text":1936,"url":26,"identifiers":1937},"Amazon.com CEO Jeff Bezos on Animoto (Apr. 2008); http:\u002F\u002Fblog.animoto.com\u002F2008\u002F04\u002F21\u002Famazon-ceo-jeff-bezos-on-animoto\u002F.  Amazon.com CEO Jeff Bezos on Animoto (Apr. 2008); http:\u002F\u002Fblog.animoto.com\u002F2008\u002F04\u002F21\u002Famazon-ceo-jeff-bezos-on-animoto\u002F.",{},{"id":26,"text":1939,"url":26,"identifiers":1940},"Amazon S3 Team. Amazon S3 Availability Event (July 20 2008); http:\u002F\u002Fstatus.aws.amazon.com\u002Fs3-20080720.html.  Amazon S3 Team. Amazon S3 Availability Event (July 20 2008); http:\u002F\u002Fstatus.aws.amazon.com\u002Fs3-20080720.html.",{},{"id":26,"text":1942,"url":26,"identifiers":1943},"Amazon Web Services. TC3 Health Case Study; http:\u002F\u002Faws.amazon.com\u002Fsolutions\u002Fcase-studies\u002Ftc3-health\u002F.  Amazon Web Services. TC3 Health Case Study; http:\u002F\u002Faws.amazon.com\u002Fsolutions\u002Fcase-studies\u002Ftc3-health\u002F.",{},{"id":26,"text":1945,"url":26,"identifiers":1946},"10.1109\u002FMC.2007.443",{"doi":1945},{"id":26,"text":1948,"url":26,"identifiers":1949},"Brodkin J. Loss of customer data spurs closure of online storage service 'The Linkup.' Network World (Aug. 2008).  Brodkin J. Loss of customer data spurs closure of online storage service 'The Linkup.' Network World (Aug. 2008).",{},{"id":26,"text":1951,"url":26,"identifiers":1952},"Fink J. FBI agents raid Dallas computer business (Apr. 2009); http:\u002F\u002Fcbs11tv.com\u002Flocal\u002FCore.IP.Networks.2.974706.html.  Fink J. FBI agents raid Dallas computer business (Apr. 2009); http:\u002F\u002Fcbs11tv.com\u002Flocal\u002FCore.IP.Networks.2.974706.html.",{},{"id":26,"text":1954,"url":26,"identifiers":1955},"Freedom OSS. Large data set transfer to the cloud (Apr. 2009); http:\u002F\u002Ffreedomoss.com\u002Fclouddataingestion.  Freedom OSS. Large data set transfer to the cloud (Apr. 2009); http:\u002F\u002Ffreedomoss.com\u002Fclouddataingestion.",{},{"id":26,"text":1957,"url":26,"identifiers":1958},"10.1145\u002F864056.864078",{"doi":1957},{"id":26,"text":1960,"url":26,"identifiers":1961},"Helft M. Google confirms problems with reaching its services (May 14 2009).  Helft M. Google confirms problems with reaching its services (May 14 2009).",{},{"id":26,"text":1963,"url":26,"identifiers":1964},"Jackson T. We feel your pain and we're sorry (Aug. 2008); http:\u002F\u002Fgmailblog.blogspot.com\u002F2008\u002F08\u002Fwefeel-your-pain-and-were-sorry.html.  Jackson T. We feel your pain and we're sorry (Aug. 2008); http:\u002F\u002Fgmailblog.blogspot.com\u002F2008\u002F08\u002Fwefeel-your-pain-and-were-sorry.html.",{},{"id":26,"text":1966,"url":26,"identifiers":1967},"Krebs B. Amazon: Hey spammers Get off my cloud! Washington Post (July 1 2008).  Krebs B. Amazon: Hey spammers Get off my cloud! Washington Post (July 1 2008).",{},{"id":26,"text":1969,"url":26,"identifiers":1970},"McCalpin J. Memory bandwidth and machine balance in current high performance computers. IEEE Technical Committee on Computer Architecture Newsletter (1995) 19--25.  McCalpin J. Memory bandwidth and machine balance in current high performance computers. IEEE Technical Committee on Computer Architecture Newsletter (1995) 19--25.",{},{"id":26,"text":1972,"url":26,"identifiers":1973},"Rivlin G. Wallflower at the Web Party (Oct. 15 2006).  Rivlin G. Wallflower at the Web Party (Oct. 15 2006).",{},{"id":26,"text":1975,"url":26,"identifiers":1976},"Siegele L. Let It Rise: A Special Report on Corporate IT. The Economist (Oct. 2008).  Siegele L. Let It Rise: A Special Report on Corporate IT. The Economist (Oct. 2008).",{},{"id":26,"text":1978,"url":26,"identifiers":1979},"Stern A. Update from Amazon Regarding Friday's S3 Downtime. CenterNetworks (Feb. 2008); http:\u002F\u002Fwww.centernetworks.com\u002Famazon-s3-downtime-update.  Stern A. Update from Amazon Regarding Friday's S3 Downtime. CenterNetworks (Feb. 2008); http:\u002F\u002Fwww.centernetworks.com\u002Famazon-s3-downtime-update.",{},{"id":26,"text":1981,"url":26,"identifiers":1982},"Wilson S. AppEngine Outage. CIO Weblog (June 2008); http:\u002F\u002Fwww.cio-weblog.com\u002F50226711\u002Fappengine\\outage.php.  Wilson S. AppEngine Outage. CIO Weblog (June 2008); http:\u002F\u002Fwww.cio-weblog.com\u002F50226711\u002Fappengine\\outage.php.",{},{"id":1984,"createTime":1985,"updateTime":1985,"relativeEntities":1986,"slug":1987,"properties":1988,"entityType":770,"verifyStatus":25,"verifyTime":1999,"verifyNote":772,"syncStatus":28,"languages":2000,"translateLanguages":26,"viewCount":36,"primaryUrl":2001,"fullTextUrl":26,"authors":2002,"publicationType":832,"publisherRelationship":2025,"citationCount":2057,"citationInfo":2058,"publishDate":2070,"publishYear":2071,"citationAnalyzeStatus":28,"lastCitationAnalyze":26,"indexDatabases":26,"openAccess":26,"references":2072,"isForceReanalyzing":978},"8a94d179-53a5-41ba-98c5-e0a1c81c2e3e","2024-08-31T10:55:57.658+00:00",[],"Maintaining-knowledge-about-temporal-intervals",{"mag":1989,"keywords":1991,"openalex":1992,"abstract":1994,"title":1995,"doi":1997},{"VOID":1990},"2161484642",{},{"VOID":1993},"W2161484642",{},{"EN":1996},"Maintaining knowledge about temporal intervals",{"VOID":1998},"10.1145\u002F182.358434","2024-08-31T10:55:57.657+00:00",[102],"https:\u002F\u002Fdl.acm.org\u002Fdoi\u002F10.1145\u002F182.358434",[2003],{"id":2004,"sortIndex":36,"researcher":26,"roles":2005,"affiliations":2006,"properties":2018},"fe45e18f-2273-45cf-820e-ae313c52f088",[],[2007],{"id":2008,"sortIndex":36,"affiliation":2009,"properties":26},"fd9e5a23-4e19-4756-bdc0-8d94daf73802",{"id":2010,"createTime":2011,"updateTime":2012,"relativeEntities":2013,"slug":2014,"properties":2015,"entityType":98,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36},"27246f8c-b3ad-4476-b6f3-ec9b37b69a02","2023-12-07T02:30:06.584+00:00","2024-10-06T20:25:22.723+00:00",[],"Univ-of-Rochester-Rochester-NY",{"title":2016},{"VI":2017},"Univ of Rochester, Rochester, NY",{"openalex":2019,"orcid":2021,"title":2023},{"VOID":2020},"A5090002679",{"VOID":2022},"https:\u002F\u002Forcid.org\u002F0000-0003-4543-5457",{"EN":2024},"James F. Allen",{"url":26,"publisher":2026,"properties":2051},{"id":659,"createTime":660,"updateTime":661,"relativeEntities":2027,"slug":663,"properties":2028,"entityType":24,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36,"subjectFields":2034,"manageAffiliations":2035,"indexDatabases":2036,"url":744,"thumbnailPath":26,"statistic":26,"gsStatistic":26,"type":26,"analyzePriority":26},[],{"country":2029,"issn":2030,"introduce":2031,"eissn":2032,"title":2033},{"VOID":666},{"VOID":668},{"EN":670},{"VOID":672},{"EN":674},[],[],[2037,2044],{"id":726,"indexDatabase":2038,"url":741,"indexYears":26,"academicFieldIds":2043,"indexDatabaseRanking":26},{"id":728,"createTime":729,"updateTime":730,"relativeEntities":2039,"label":2040,"description":2041,"key":737,"publicationTags":2042,"standard":26},[],{"EN":733,"VI":733},{"VI":735,"EN":736},[739,740],[743],{"id":707,"indexDatabase":2045,"url":720,"indexYears":721,"academicFieldIds":2050,"indexDatabaseRanking":724},{"id":709,"createTime":710,"updateTime":711,"relativeEntities":2046,"label":2047,"description":2048,"key":717,"publicationTags":2049,"standard":26},[],{"EN":714,"VI":714},{"EN":714,"VI":716},[719],[723],{"volume":2052,"pages":2054,"issue":2056},{"VOID":2053},"26",{"VOID":2055},"832-843",{"VOID":1366},7474,{"total":2057,"publishYear":26,"statisticByYear":2059},{"2012":621,"2013":2060,"2014":2061,"2015":2062,"2016":2063,"2017":399,"2018":2064,"2019":2065,"2020":2066,"2021":630,"2022":2067,"2023":2068,"2024":2069},324,286,262,273,207,178,175,103,117,55,"1983-11-01",1983,[2073,2076,2079,2082,2085,2088,2091,2094,2097,2100,2103,2106,2109,2112,2115,2118,2121,2124],{"id":26,"text":2074,"url":26,"identifiers":2075},"Allen J. F., 1982, Proc. Nat. Conf. on Artificial Intelligence, AAAI 82",{},{"id":26,"text":2077,"url":26,"identifiers":2078},"Allen J. F., 1983, Contributions in Artificial Intelligence, 1",{},{"id":26,"text":2080,"url":26,"identifiers":2081},"Allen J. F., 1983, Joint Conf. Artificial Intelligence",{},{"id":26,"text":2083,"url":26,"identifiers":2084},"10.1016\u002F0004-3702(72)90040-9",{"doi":2083},{"id":26,"text":2086,"url":26,"identifiers":2087},"Bubenko J. A., Jr., 1980, Proc. IFIP Congress",{},{"id":26,"text":2089,"url":26,"identifiers":2090},"10.1016\u002F0004-3702(79)90008-0",{"doi":2089},{"id":26,"text":2092,"url":26,"identifiers":2093},"10.5555\u002F1622876.1622939",{"doi":2092},{"id":26,"text":2095,"url":26,"identifiers":2096},"Foderaro J. K., 1980, Berkeley",{},{"id":26,"text":2098,"url":26,"identifiers":2099},"10.1145\u002F322290.322292",{"doi":2098},{"id":26,"text":2101,"url":26,"identifiers":2102},"Hayes P. J., 1979, Edinburgh U. Press",{},{"id":26,"text":2104,"url":26,"identifiers":2105},"Hayes P. J., 1978, Geneva",{},{"id":26,"text":2107,"url":26,"identifiers":2108},"10.1016\u002F0004-3702(73)90010-6",{"doi":2107},{"id":26,"text":2110,"url":26,"identifiers":2111},"10.1016\u002F0004-3702(77)90015-7",{"doi":2110},{"id":26,"text":2113,"url":26,"identifiers":2114},"McCarthy J., 1969, Edinburgh U. Press",{},{"id":26,"text":2116,"url":26,"identifiers":2117},"10.1207\u002Fs15516709cog0602_1",{"doi":2116},{"id":26,"text":2119,"url":26,"identifiers":2120},"10.1007\u002F978-3-7091-7664-1",{"doi":2119},{"id":26,"text":2122,"url":26,"identifiers":2123},"Sacerdoti E. D., 1977, Elsevier North- Holland",{},{"id":26,"text":2125,"url":26,"identifiers":2126},"Vilain M., 1982, Proc. AAAI 82",{},{"id":2128,"createTime":2129,"updateTime":2130,"relativeEntities":2131,"slug":2132,"properties":2133,"entityType":770,"verifyStatus":25,"verifyTime":2129,"verifyNote":772,"syncStatus":28,"languages":2147,"translateLanguages":2148,"viewCount":36,"primaryUrl":2149,"fullTextUrl":26,"authors":2150,"publicationType":832,"publisherRelationship":2205,"citationCount":2237,"citationInfo":2238,"publishDate":2250,"publishYear":2251,"citationAnalyzeStatus":28,"lastCitationAnalyze":26,"indexDatabases":26,"openAccess":26,"references":2252,"isForceReanalyzing":978},"6f9313c9-8356-4904-b426-efe5f6af0742","2024-09-24T10:43:42.655+00:00","2025-02-01T16:54:27.812+00:00",[],"A-vector-space-model-for-automatic-indexing",{"mag":2134,"keywords":2136,"openalex":2137,"abstract":2139,"title":2142,"doi":2145},{"VOID":2135},"2165612380",{"VI":989},{"VOID":2138},"W2165612380",{"VI":2140,"EN":2141},"\u003Cjats:p>Trong một hệ thống truy xuất tài liệu, hoặc môi trường so khớp mẫu khác, nơi mà các thực thể lưu trữ (tài liệu) được so sánh với nhau hoặc với các mẫu đến (yêu cầu tìm kiếm), có vẻ như không gian lập chỉ mục (thuộc tính) tốt nhất là nơi mà mỗi thực thể cách xa nhau nhất có thể; trong những trường hợp này, giá trị của một hệ thống lập chỉ mục có thể được diễn đạt như một hàm của mật độ không gian của đối tượng; đặc biệt, hiệu suất truy xuất có thể tương quan nghịch với mật độ không gian. Một phương pháp dựa trên các phép toán mật độ không gian được sử dụng để chọn một từ vựng lập chỉ mục tối ưu cho một tập hợp các tài liệu. Các kết quả đánh giá điển hình được trình bày, cho thấy tính hữu ích của mô hình.\u003C\u002Fjats:p>","\u003Cjats:p>In a document retrieval, or other pattern matching environment where stored entities (documents) are compared with each other or with incoming patterns (search requests), it appears that the best indexing (property) space is one where each entity lies as far away from the others as possible; in these circumstances the value of an indexing system may be expressible as a function of the density of the object space; in particular, retrieval performance may correlate inversely with space density. An approach based on space density computations is used to choose an optimum indexing vocabulary for a collection of documents. Typical evaluation results are shown, demonstating the usefulness of the model.\u003C\u002Fjats:p>",{"VI":2143,"EN":2144},"Mô hình không gian vector cho việc lập chỉ mục tự động","A vector space model for automatic indexing",{"VOID":2146},"10.1145\u002F361219.361220",[102],[101],"https:\u002F\u002Fdl.acm.org\u002Fdoi\u002F10.1145\u002F361219.361220",[2151,2173,2190],{"id":2152,"sortIndex":114,"researcher":26,"roles":2153,"affiliations":2154,"properties":2166},"dbd95d75-efe9-4cde-9647-ed918e91d78d",[],[2155],{"id":2156,"sortIndex":36,"affiliation":2157,"properties":26},"c6dfb2f8-d027-4a11-b339-186f4b67a0d0",{"id":2158,"createTime":2159,"updateTime":2160,"relativeEntities":2161,"slug":2162,"properties":2163,"entityType":98,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36},"3d634af7-0d66-483a-82a9-4146b055a401","2024-04-13T16:16:28.371+00:00","2024-11-26T20:03:35.182+00:00",[],"-Cornell-Univ-Ithaca-NY-",{"title":2164},{"EN":2165},"[Cornell Univ., Ithaca, NY]",{"openalex":2167,"orcid":2169,"title":2171},{"VOID":2168},"A5051050164",{"VOID":2170},"https:\u002F\u002Forcid.org\u002F0000-0003-4918-961X",{"EN":2172},"Chul‐Su Yang",{"id":2174,"sortIndex":115,"researcher":26,"roles":2175,"affiliations":2176,"properties":2183},"06f5a77a-4cb3-4729-9898-a2b9a59728e9",[],[2177],{"id":2178,"sortIndex":36,"affiliation":2179,"properties":26},"b5f1a7c4-0567-4884-8a26-f198a8a6d91a",{"id":2158,"createTime":2159,"updateTime":2160,"relativeEntities":2180,"slug":2162,"properties":2181,"entityType":98,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36},[],{"title":2182},{"EN":2165},{"openalex":2184,"orcid":2186,"title":2188},{"VOID":2185},"A5025576527",{"VOID":2187},"https:\u002F\u002Forcid.org\u002F0000-0003-0783-5089",{"EN":2189},"Amy Wong",{"id":2191,"sortIndex":36,"researcher":26,"roles":2192,"affiliations":2193,"properties":2200},"7268db54-c479-437b-8d5e-567d6dd825ea",[],[2194],{"id":2195,"sortIndex":36,"affiliation":2196,"properties":26},"adcdf78f-979c-4a7c-a5f4-a99619c2d2fe",{"id":2158,"createTime":2159,"updateTime":2160,"relativeEntities":2197,"slug":2162,"properties":2198,"entityType":98,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36},[],{"title":2199},{"EN":2165},{"openalex":2201,"title":2203},{"VOID":2202},"A5013751265",{"EN":2204},"Gerard Salton",{"url":26,"publisher":2206,"properties":2231},{"id":659,"createTime":660,"updateTime":661,"relativeEntities":2207,"slug":663,"properties":2208,"entityType":24,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36,"subjectFields":2214,"manageAffiliations":2215,"indexDatabases":2216,"url":744,"thumbnailPath":26,"statistic":26,"gsStatistic":26,"type":26,"analyzePriority":26},[],{"country":2209,"issn":2210,"introduce":2211,"eissn":2212,"title":2213},{"VOID":666},{"VOID":668},{"EN":670},{"VOID":672},{"EN":674},[],[],[2217,2224],{"id":726,"indexDatabase":2218,"url":741,"indexYears":26,"academicFieldIds":2223,"indexDatabaseRanking":26},{"id":728,"createTime":729,"updateTime":730,"relativeEntities":2219,"label":2220,"description":2221,"key":737,"publicationTags":2222,"standard":26},[],{"EN":733,"VI":733},{"VI":735,"EN":736},[739,740],[743],{"id":707,"indexDatabase":2225,"url":720,"indexYears":721,"academicFieldIds":2230,"indexDatabaseRanking":724},{"id":709,"createTime":710,"updateTime":711,"relativeEntities":2226,"label":2227,"description":2228,"key":717,"publicationTags":2229,"standard":26},[],{"EN":714,"VI":714},{"EN":714,"VI":716},[719],[723],{"volume":2232,"pages":2234,"issue":2236},{"VOID":2233},"18",{"VOID":2235},"613-620",{"VOID":1366},7165,{"total":2237,"publishYear":26,"statisticByYear":2239},{"2012":202,"2013":2240,"2014":2241,"2015":2242,"2016":2243,"2017":2244,"2018":1634,"2019":2245,"2020":2246,"2021":2247,"2022":2248,"2023":2249,"2024":532},543,516,453,450,372,350,293,278,213,195,"1975-11-01",1975,[2253,2256,2259,2262,2265,2268,2271],{"id":26,"text":2254,"url":26,"identifiers":2255},"Salton , G. Automatic btformation Organiza;ion and Retrieval . McGraw-Hill , New York , 1968 , Ch. 4. Salton, G. Automatic btformation Organiza;ion and Retrieval. McGraw-Hill, New York, 1968, Ch. 4.",{},{"id":26,"text":2257,"url":26,"identifiers":2258},"10.1108\u002Feb026562",{"doi":2257},{"id":26,"text":2260,"url":26,"identifiers":2261},"10.1108\u002Feb026526",{"doi":2260},{"id":26,"text":2263,"url":26,"identifiers":2264},"Williamson , R.E. Real-time document retrieval. Ph.D. Th., Computer Sci. Dep ., Cornell U. , June 1974 . Williamson, R.E. Real-time document retrieval. Ph.D. Th., Computer Sci. Dep., Cornell U., June 1974.",{},{"id":26,"text":2266,"url":26,"identifiers":2267},"Wong , A. An investigation of the effects of different indexing methods on the document space configuration. Sci. Rep. ISR-22 , Computer Sci. Dep. , Cornell U. , Section II , Nov. 1974 . Wong, A. An investigation of the effects of different indexing methods on the document space configuration. Sci. Rep. ISR-22, Computer Sci. Dep., Cornell U., Section II, Nov. 1974.",{},{"id":26,"text":2269,"url":26,"identifiers":2270},"Salton , G. A theory of indexing. Regional Conference Series in Applied Mathematics No. 18 , SIAM , Philadelphia, Pa ., 1975 . Salton, G. A theory of indexing. Regional Conference Series in Applied Mathematics No. 18, SIAM, Philadelphia, Pa., 1975.",{},{"id":26,"text":2272,"url":26,"identifiers":2273},"Salton , G. , Yang , C.S. , and Yu , C.T . Contribution to the theory of indexing . Proc. IFIP Congress 74 , Stockholm , August 1974 . American Elsevier, New York, 1974. Salton, G., Yang, C.S., and Yu, C.T. Contribution to the theory of indexing. Proc. IFIP Congress 74, Stockholm, August 1974. American Elsevier, New York, 1974.",{},{"id":2275,"createTime":2276,"updateTime":2277,"relativeEntities":2278,"slug":2279,"properties":2280,"entityType":770,"verifyStatus":25,"verifyTime":2276,"verifyNote":772,"syncStatus":28,"languages":2294,"translateLanguages":2295,"viewCount":36,"primaryUrl":2296,"fullTextUrl":26,"authors":2297,"publicationType":832,"publisherRelationship":2318,"citationCount":2350,"citationInfo":2351,"publishDate":2364,"publishYear":2251,"citationAnalyzeStatus":28,"lastCitationAnalyze":26,"indexDatabases":26,"openAccess":26,"references":2365,"isForceReanalyzing":978},"66ad2311-2b3c-4465-879e-f15c3bba3583","2024-09-26T03:15:17.629+00:00","2025-02-01T16:55:25.395+00:00",[],"Multidimensional-binary-search-trees-used-for-associative-searching",{"mag":2281,"keywords":2283,"openalex":2284,"abstract":2286,"title":2289,"doi":2292},{"VOID":2282},"2165558283",{"VI":989},{"VOID":2285},"W2165558283",{"VI":2287,"EN":2288},"\u003Cjats:p>\n            Bài báo này phát triển cây tìm kiếm nhị phân đa chiều (hay còn gọi là cây \u003Cjats:italic>k\u003C\u002Fjats:italic>-d, trong đó \u003Cjats:italic>k\u003C\u002Fjats:italic> là số chiều của không gian tìm kiếm) như một cấu trúc dữ liệu để lưu trữ thông tin được truy xuất thông qua các tìm kiếm liên kết. Cây \u003Cjats:italic>k\u003C\u002Fjats:italic>-d được định nghĩa và các ví dụ được đưa ra. Nó cho thấy khá hiệu quả trong yêu cầu lưu trữ. Một lợi thế đáng kể của cấu trúc này là một cấu trúc dữ liệu duy nhất có thể xử lý nhiều loại truy vấn một cách rất hiệu quả. Nhiều thuật toán tiện ích đã được phát triển; thời gian chạy trung bình đã chứng minh của chúng trong một tệp chứa \u003Cjats:italic>n\u003C\u002Fjats:italic> bản ghi là: chèn, \u003Cjats:italic>O\u003C\u002Fjats:italic>(log \u003Cjats:italic>n\u003C\u002Fjats:italic>); xóa gốc, \u003Cjats:italic>O\u003C\u002Fjats:italic>(\u003Cjats:italic>n\u003C\u002Fjats:italic>\u003Cjats:sup>(\u003Cjats:italic>k\u003C\u002Fjats:italic>-1)\u002F\u003Cjats:italic>k\u003C\u002Fjats:italic>\u003C\u002Fjats:sup>); xóa một nút ngẫu nhiên, \u003Cjats:italic>O\u003C\u002Fjats:italic>(log \u003Cjats:italic>n\u003C\u002Fjats:italic>); và tối ưu hóa (đảm bảo hiệu suất logarithmic của các tìm kiếm), \u003Cjats:italic>O\u003C\u002Fjats:italic>(\u003Cjats:italic>n\u003C\u002Fjats:italic> log \u003Cjats:italic>n\u003C\u002Fjats:italic>). Các thuật toán tìm kiếm được đưa ra cho các truy vấn tìm kiếm khớp một phần với \u003Cjats:italic>t\u003C\u002Fjats:italic> khóa được chỉ định [thời gian chạy tối đa đã chứng minh là \u003Cjats:italic>O\u003C\u002Fjats:italic>(\u003Cjats:italic>n\u003C\u002Fjats:italic>\u003Cjats:sup>(\u003Cjats:italic>k\u003C\u002Fjats:italic>-\u003Cjats:italic>t\u003C\u002Fjats:italic>)\u002F\u003Cjats:italic>k\u003C\u002Fjats:italic>\u003C\u002Fjats:sup>)] và cho các truy vấn hàng xóm gần nhất [thời gian chạy trung bình quan sát được thực nghiệm là \u003Cjats:italic>O\u003C\u002Fjats:italic>(log \u003Cjats:italic>n\u003C\u002Fjats:italic>)] . Những hiệu suất này vượt xa so với các thuật toán tốt nhất hiện tại cho những nhiệm vụ này. Một thuật toán được trình bày để xử lý bất kỳ truy vấn giao nhau tổng quát nào. Trọng tâm chính của bài báo này là lý thuyết. Tuy nhiên, chúng tôi cảm thấy rằng cây \u003Cjats:italic>k\u003C\u002Fjats:italic>-d có thể rất hữu ích trong nhiều ứng dụng, và các ví dụ về các ứng dụng tiềm năng được đưa ra.\n          \u003C\u002Fjats:p>","\u003Cjats:p>\n            This paper develops the multidimensional binary search tree (or\n            \u003Cjats:italic>k\u003C\u002Fjats:italic>\n            -d tree, where\n            \u003Cjats:italic>k\u003C\u002Fjats:italic>\n            is the dimensionality of the search space) as a data structure for storage of information to be retrieved by associative searches. The\n            \u003Cjats:italic>k\u003C\u002Fjats:italic>\n            -d tree is defined and examples are given. It is shown to be quite efficient in its storage requirements. A significant advantage of this structure is that a single data structure can handle many types of queries very efficiently. Various utility algorithms are developed; their proven average running times in an\n            \u003Cjats:italic>n\u003C\u002Fjats:italic>\n            record file are: insertion,\n            \u003Cjats:italic>O\u003C\u002Fjats:italic>\n            (log\n            \u003Cjats:italic>n\u003C\u002Fjats:italic>\n            ); deletion of the root,\n            \u003Cjats:italic>O\u003C\u002Fjats:italic>\n            (\n            \u003Cjats:italic>n\u003C\u002Fjats:italic>\n            \u003Cjats:sup>\n              (\n              \u003Cjats:italic>k\u003C\u002Fjats:italic>\n              -1)\u002F\n              \u003Cjats:italic>k\u003C\u002Fjats:italic>\n            \u003C\u002Fjats:sup>\n            ); deletion of a random node,\n            \u003Cjats:italic>O\u003C\u002Fjats:italic>\n            (log\n            \u003Cjats:italic>n\u003C\u002Fjats:italic>\n            ); and optimization (guarantees logarithmic performance of searches),\n            \u003Cjats:italic>O\u003C\u002Fjats:italic>\n            (\n            \u003Cjats:italic>n\u003C\u002Fjats:italic>\n            log\n            \u003Cjats:italic>n\u003C\u002Fjats:italic>\n            ). Search algorithms are given for partial match queries with\n            \u003Cjats:italic>t\u003C\u002Fjats:italic>\n            keys specified [proven maximum running time of\n            \u003Cjats:italic>O\u003C\u002Fjats:italic>\n            (\n            \u003Cjats:italic>n\u003C\u002Fjats:italic>\n            \u003Cjats:sup>\n              (\n              \u003Cjats:italic>k\u003C\u002Fjats:italic>\n              -\n              \u003Cjats:italic>t\u003C\u002Fjats:italic>\n              )\u002F\n              \u003Cjats:italic>k\u003C\u002Fjats:italic>\n            \u003C\u002Fjats:sup>\n            )] and for nearest neighbor queries [empirically observed average running time of\n            \u003Cjats:italic>O\u003C\u002Fjats:italic>\n            (log\n            \u003Cjats:italic>n\u003C\u002Fjats:italic>\n            ).] These performances far surpass the best currently known algorithms for these tasks. An algorithm is presented to handle any general intersection query. The main focus of this paper is theoretical. It is felt, however, that\n            \u003Cjats:italic>k\u003C\u002Fjats:italic>\n            -d trees could be quite useful in many applications, and examples of potential uses are given.\n          \u003C\u002Fjats:p>",{"VI":2290,"EN":2291},"Cây tìm kiếm nhị phân đa chiều được sử dụng cho tìm kiếm liên kết","Multidimensional binary search trees used for associative searching",{"VOID":2293},"10.1145\u002F361002.361007",[102],[101],"https:\u002F\u002Fdl.acm.org\u002Fdoi\u002F10.1145\u002F361002.361007",[2298],{"id":2299,"sortIndex":36,"researcher":26,"roles":2300,"affiliations":2301,"properties":2313},"171b4045-5478-451e-a8fa-94291eee971e",[],[2302],{"id":2303,"sortIndex":36,"affiliation":2304,"properties":26},"f2cfdced-8b38-4aa1-8560-3461c55c6440",{"id":2305,"createTime":2306,"updateTime":2307,"relativeEntities":2308,"slug":2309,"properties":2310,"entityType":98,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36},"260cc35f-a9fa-46bd-9a96-5046ab6b3a7e","2024-09-17T09:34:30.312+00:00","2024-09-26T03:15:17.717+00:00",[],"Stanford-Univ-Stanford-CA",{"title":2311},{"EN":2312},"Stanford Univ., Stanford, CA",{"openalex":2314,"title":2316},{"VOID":2315},"A5017880584",{"EN":2317},"Jon Bentley",{"url":26,"publisher":2319,"properties":2344},{"id":659,"createTime":660,"updateTime":661,"relativeEntities":2320,"slug":663,"properties":2321,"entityType":24,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36,"subjectFields":2327,"manageAffiliations":2328,"indexDatabases":2329,"url":744,"thumbnailPath":26,"statistic":26,"gsStatistic":26,"type":26,"analyzePriority":26},[],{"country":2322,"issn":2323,"introduce":2324,"eissn":2325,"title":2326},{"VOID":666},{"VOID":668},{"EN":670},{"VOID":672},{"EN":674},[],[],[2330,2337],{"id":726,"indexDatabase":2331,"url":741,"indexYears":26,"academicFieldIds":2336,"indexDatabaseRanking":26},{"id":728,"createTime":729,"updateTime":730,"relativeEntities":2332,"label":2333,"description":2334,"key":737,"publicationTags":2335,"standard":26},[],{"EN":733,"VI":733},{"VI":735,"EN":736},[739,740],[743],{"id":707,"indexDatabase":2338,"url":720,"indexYears":721,"academicFieldIds":2343,"indexDatabaseRanking":724},{"id":709,"createTime":710,"updateTime":711,"relativeEntities":2339,"label":2340,"description":2341,"key":717,"publicationTags":2342,"standard":26},[],{"EN":714,"VI":714},{"EN":714,"VI":716},[719],[723],{"volume":2345,"pages":2346,"issue":2348},{"VOID":2233},{"VOID":2347},"509-517",{"VOID":2349},"9",6740,{"total":2350,"publishYear":26,"statisticByYear":2352},{"2012":2353,"2013":1380,"2014":2354,"2015":2355,"2016":1497,"2017":2356,"2018":2357,"2019":2358,"2020":2359,"2021":2360,"2022":2361,"2023":2362,"2024":2363},258,301,319,344,356,431,415,478,386,400,198,"1975-09-01",[2366,2369,2372,2375,2378,2381,2384],{"id":26,"text":2367,"url":26,"identifiers":2368},"Friedman J.H. Bentley J.L. and Finkel R.A. An algorithm for finding best matches in logarithmic time. Stanford CS Rep. 75--482.   Friedman J.H. Bentley J.L. and Finkel R.A. An algorithm for finding best matches in logarithmic time. Stanford CS Rep. 75--482.",{},{"id":26,"text":2370,"url":26,"identifiers":2371},"Blum M. Floyd R.W. Pratt V. Rivest R.L. and Tarjan R.E. Time bounds for selection. Stanford CS Rep. 73-349.  Blum M. Floyd R.W. Pratt V. Rivest R.L. and Tarjan R.E. Time bounds for selection. Stanford CS Rep. 73-349.",{},{"id":26,"text":2373,"url":26,"identifiers":2374},"10.1007\u002FBF00288933",{"doi":2373},{"id":26,"text":2376,"url":26,"identifiers":2377},"Knuth , D.E. The Art of Computer Programming , Vol. 1 : Fundamental Algorithms . Addison-Wesley , Reading, Mass ., 1969 . Knuth, D.E. The Art of Computer Programming, Vol. 1: Fundamental Algorithms. Addison-Wesley, Reading, Mass., 1969.",{},{"id":26,"text":2379,"url":26,"identifiers":2380},"Knuth , D.E. The Art of Computer Programmhtg, Vol. 1li: Sorting and Searching. Addison-Wesley, Reading , Mass. , 1973 . Knuth, D.E. The Art of Computer Programmhtg, Vol. 1li: Sorting and Searching. Addison-Wesley, Reading, Mass., 1973.",{},{"id":26,"text":2382,"url":26,"identifiers":2383},"McCreight , E. Computer Science 144A midterm examination, spring quarter , 1973 . Stanford University . McCreight, E. Computer Science 144A midterm examination, spring quarter, 1973. Stanford University.",{},{"id":26,"text":2385,"url":26,"identifiers":2386},"Rivest R.L. Analysis of associative retrieval algorithms. Stanford CS Rep. 74--415.  Rivest R.L. Analysis of associative retrieval algorithms. Stanford CS Rep. 74--415.",{}]