연구성과로 돌아가기
2024 연구성과 (243 / 286)
※ 컨트롤 + 클릭으로 열별 다중 정렬 가능합니다.
Excel 다운로드
| WoS | SCOPUS | Document Type | Document Title | Abstract | Authors | Affiliation | ResearcherID (WoS) | AuthorsID (SCOPUS) | Author Email(s) | Journal Name | JCR Abbreviation | ISSN | eISSN | Volume | Issue | WoS Edition | WoS Category | JCR Year | IF | JCR (%) | FWCI | FWCI Update Date | WoS Citation | SCOPUS Citation | Keywords (WoS) | KeywordsPlus (WoS) | Keywords (SCOPUS) | KeywordsPlus (SCOPUS) | Language | Publication Stage | Publication Year | Publication Date | DOI | JCR Link | DOI Link | WOS Link | SCOPUS Link |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| ○ | Article | A Connectivity Provisioning Method for Reducing Transmission Delay of Orphan Nodes in Wi-SUN FAN | Wi-SUN is a future technology that is gaining popularity to meet the demand for wireless networks such as smart grids and smart cities. It can be supported with minimal hardware and software changes depending on the application. However, Wi-SUN also has problem as bottleneck, which can be solved by limiting the number of child nodes of a parent node using the Nₘₐₓ method. This method has additional problems with orphan nodes. To solve these issues, this paper proposes a method that provides connectivity to prevent orphan nodes and solves congestion. The proposed method is evaluated for performance using Network Simulator 3(NS-3). © 2024, Korean Institute of Communications and Information Sciences. All rights reserved. | Kim, Sunghyun; Seo, Junho; Lee, Sungwon; Kim, Dongkyun | Kyungpook National University, School of Computer Science & Engineering, South Korea; Kyungpook National University, School of Computer Science & Engineering, South Korea; Daegu Haany University, Department of Computer Engineering, South Korea; Kyungpook National University, School of Computer Science & Engineering, South Korea | 58805776300; 57208740581; 57219637666; 35753648800 | lsw5359@dhu.ac.kr;dongkyun@knu.ac.kr; | Journal of Korean Institute of Communications and Information Sciences | 1226-4717 | 49 | 2 | 0 | 2025-05-07 | 0 | FAN; Load Balancing; Orphan Node; RPL; Wi-SUN | Korean | Final | 2024 | 10.7840/kics.2024.49.2.217 | 바로가기 | 바로가기 | ||||||||||||||||
| ○ | Article | A context-sensitive multi-tier deep learning framework for multimodal sentiment analysis | One of the most appealing multidisciplinary research areas in Artificial Intelligence (AI) is Sentiment Analysis (SA). Due to the intricate and complementary interactions between several modalities, Multimodal Sentiment Analysis (MSA) is an extremely difficult work that has a wide range of applications. In the subject of multimodal sentiment analysis, numerous deep learning models and different techniques have been suggested, but they do not investigate the explicit context of words and are unable to model diverse components of a sentence. Hence, the full potential of such diverse data has not been explored. In this research, a Context-Sensitive Multi-Tier Deep Learning Framework (CS-MDF) is proposed for sentiment analysis on multimodal data. The CS-MDF uses a three-tier architecture for extracting context-sensitive information. The first tier utilizes Convolutional Neural Network (CNN) for extracting text-based features, 3D-CNN model for extracting visual features and open-Source Media Interpretation by Large feature-space Extraction (openSMILE) tool kit for audio feature extraction.The first tier focuses on extracting the unimodal features from the utterances. This level of extraction ignores context-sensitive data while determining the feature.CNNs are suitable for text data because they are particularly useful for identifying local patterns and dependencies in data.The second tier uses the features extracted from the first tier.The context-sensitive unimodal characteristics are extracted in this tier using the Bi-directional Gated Recurrent Unit (BiGRU), which is used to comprehend inter-utterance links and uncover contextual evidence.The output from tier two is combined and passed to the third tier, which fuses the features from different modalities and trains a single BiGRU model that provides the final classification.This method applies the BiGRU model to sequential data processing, using the advantages of both modalities and capturing their interdependencies.Experimental results obtained on six real-life datasets (Flickr Images dataset, Multi-View Sentiment Analysis dataset, Getty Images dataset, Balanced Twitter for Sentiment Analysis dataset, CMU-MOSI Dataset) show that the proposed CS-MDF model has achieved better performance compared with ten state-of-the-art approaches, which are validated by F1 score, precision, accuracy, and recall metrics.An ablation study is carried out on the proposed framework that demonstrates the viability of the design. The GradCAM visualization technique is applied to visualize the aligned input image-text pairs learned by the proposed CS-MDF model. © The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2023. | P, Ganesh Kumar; S, Arul Antran Vijay; V, Jothi Prakash; Paul, Anand; Nayyar, Anand | Department of Computer Science and Engineering, College of Engineering, Guindy, Anna University, Tamil Nadu, Chennai, India; Karpagam College of Engineering, Tamil Nadu, Coimbatore, India; Karpagam College of Engineering, Tamil Nadu, Coimbatore, India; The School of Computer Science and Engineering, Kyungpook National University, Daegu, South Korea; School of Computer Science, Faculty of Information Technology, Duy Tan University, Da Nang, Viet Nam | 57221938993; 36440327400; 57214457052; 56650522400; 55201442200 | arulantranvijay@gmail.com;jothiprakashv@gmail.com; | Multimedia Tools and Applications | 1380-7501 | 83 | 18 | 3.9 | 2025-05-07 | 17 | Deep learning; Gated recurrent unit; Information retrieval; Multimedia analysis; Multimodal sentiment analysis; Sentiment analysis | Convolutional neural networks; Data handling; Data mining; Deep learning; Extraction; Information retrieval; Modal analysis; Context-sensitive; Deep learning; Gated recurrent unit; Learning frameworks; Multi-media analysis; Multi-modal; Multi-tier; Multimodal sentiment analyse; Sentiment analysis; Sentiment analysis | English | Final | 2024 | 10.1007/s11042-023-17601-1 | 바로가기 | 바로가기 | |||||||||||||||
| ○ | Article | A Convolutional Neural Network Combined with Local Binary Pattern and Self-Attention Mechanism based on MC4LDevicefor Indoor Positioning | In earlier research, we proposed a vision-based ranging algorithm based on a Monocular Camera and four Lasers (MC4L) device for indoor positioning in dark environment call as Logarithmic Regression Algorithm (LRA). The linear relationship between the irradiation area and the real distance is established based on a LRA to control the positioning error within 2.4 cm. However, limited by the ranging mode of MC4Ldevice, the indoor positioning algorithm cannot distinguish whether the measured object is a wall or an obstacle. Hence, its application in environments with obstacles is limited. In order to address this issue, we proposed a Convolutional Neural Networks (CNNs) combined with a Local Binary Pattern (LBP) and self-attention mechanism called as LBP-CNNs model. This LBP-CNNs model can achieve distance measurement and obstacle recognition by modifying activation function and loss function of output layer. Experimental results show that the LBP-CNNs model can reduce the indoor positioning error to 1.27 cm, and the obstacle recognition accuracy reaches 92.3%. © 2024, Korean Institute of Communications and Information Sciences. All rights reserved. | Yinw, Nan; Zou, Zhengyang; Sun, Yuxiang; Kim, Jaesoo | Kyungpook National University, Computer Science and Engineering, South Korea; Kyungpook National University, Department of French Language and Literature, South Korea; Kyungpook National University, Software Technology Research Institute, South Korea; Kyungpook National University, Computer Science and Engineering, South Korea | 59143277000; 59144096500; 57202927837; 57191684854 | kjs@knu.ac.kr; | Journal of Korean Institute of Communications and Information Sciences | 1226-4717 | 49 | 6 | 0.45 | 2025-05-07 | 1 | Convolutional neural networks; Local binary pattern; Self-attention mechanism | English | Final | 2024 | 10.7840/kics.2024.49.6.883 | 바로가기 | 바로가기 | ||||||||||||||||
| ○ | ○ | Proceedings Paper | A D-band Power-Combined Stacked Common-Base Power Amplifier Achieving 20.9 dBm Psat and 24.3 % PAE in a 250-nm InP HBT Technology | This paper presents a high-power high-efficiency stacked D-band power amplifier (PA) in a 250-nm HBT technology. The pseudo-differential PA is 2-way power-combined with a power combining network exhibiting a single-transformer footprint and a low loss by reflecting asymmetry leaking to the common mode. The presented PA has a saturated output power of 20.9 dBm and a peak power-added efficiency (PAE) of 24.3 %. A small-signal gain of 14.2 dB is obtained with a 3-dB bandwidth of 19 GHz. | Hemelhof, Arno; Park, Sehoon; Zhang, Yang; Ingels, Mark; Gramegna, Giuseppe; Vaesen, Kristof; Yan, Dongyang; Wambacq, Piet | Imec, Kapeldreef 75, B-3001 Leuven, Belgium; Vrije Univ Brussel, Dept Elect & Informat ETRO1, Pleinlaan 2, B-1050 Brussels1, Belgium; Kyungpook Natl Univ, Sch Elect Engn, 80,Daehak Ro, Daegu, South Korea | 58801253400; 57216542195; 56798176200; 6701650643; 57191801642; 6603232413; 57215298143; 35569567100 | arno.hemelhof@imec.be; | 2024 IEEE BICMOS AND COMPOUND SEMICONDUCTOR INTEGRATED CIRCUITS AND TECHNOLOGY SYMPOSIUM, BCICTS | 2831-4972 | 3.98 | 2025-05-07 | 1 | 1 | power amplifier; D-band; InP; millimeter-wave; stacked PA; common-base | common-base; D-band; InP; millimeter-wave; power amplifier; stacked PA | Common-base; D-band; HBT technology; High power; InP; InP-HBT; Power; Power-added-efficiency; Stacked power amplifier; Semiconducting indium phosphide | English | 2024 | 2024 | 10.1109/bcicts59662.2024.10745714 | 바로가기 | 바로가기 | 바로가기 | |||||||||||||
| ○ | ○ | Proceedings Paper | A Data-Gathering Underwater Medium Access Control Scheme Using Carrier Sensing Associated Machine Learning | In this paper, we propose a medium access control method in underwater sensor networks aimed at gathering data from multiple sensor nodes to a sink node. Considering the long propagation delay of underwater acoustic channels, exchanging control packets between nodes is inefficient. In our work, sensor nodes are trained through a machine learning and determine the correct timing for data transmission to avoid possible collisions without exchanging control packets. To learn varying channel conditions, sensor nodes employ a carrier sensing. Simulation results reveal that among machine learning models, the proposed scheme utilizing the MLP model exhibits the most outstanding performance. | Lee, Jong-Won; Park, Shin-Young; Do, Eun-Ju; Cho, Ho-Shin | Kyungpook Natl Univ, Daegu, South Korea | 55689939800; 59443954900; 59886852000; 35316924900 | 2048jw@knu.ac.kr;sarah7993@knu.ac.kr;ij020226@naver.com;hscho@ee.knu.ac.kr; | 2024 FIFTEENTH INTERNATIONAL CONFERENCE ON UBIQUITOUS AND FUTURE NETWORKS, ICUFN 2024 | 2165-8528 | 2165-8536 | 0 | 2025-05-07 | 0 | 0 | Underwater Sensor Networks (UWSNs); Machine Learning; Medium Access Control; Carrier Sensing | Carrier Sensing; Machine Learning; Medium Access Control; Underwater Sensor Networks (UWSNs) | Access control; Carrier sense multiple access; Delay control systems; Underwater acoustics; Carrier sensing; Control methods; Control packets; Data gathering; Machine-learning; Medium access; Medium access control scheme; Multiple sensors; Underwater sensor network; Underwater sensor networks; Sensor nodes | English | 2024 | 2024 | 10.1109/icufn61752.2024.10625189 | 바로가기 | 바로가기 | 바로가기 | ||||||||||||
| ○ | ○ | Proceedings Paper | A General Variable Neighborhood Search Approach for the Clustered Traveling Salesman Problem with d-Relaxed Priority Rule | This paper presents a multi-start general variable neighborhood search approach (MSGVNS) for solving the clustered traveling salesman problem with the d-relaxed priority rule (CTSP-d). In clustered traveling salesman problem, vertices excluding the starting vertex or depot, are divided into clusters based on their urgency levels and higher-urgency vertices must be visited before lower-urgency ones. This leads to inefficient travel costs. To address this, a d-relaxed priority rule is employed in CTSP-d to balance travel cost and urgency level by relaxing the urgency-oriented restriction to some extent. CTSP-d is NP-hard as it can be considered as a generalization of traveling salesman problem (TSP). The proposed MSGVNS approach combines a variable neighborhood descent (VND) strategy utilizing five different neighborhoods with a shaking procedure to enhance the solution. The performance of the MSGVNS is evaluated on 148 standard benchmark instances from literature. The computational results demonstrate the effectiveness of the proposed approach in generating high-quality solutions within reasonable computational times compared to the existing best approaches. Furthermore, the approach improves upon the best-known solution values on six large instances. | Dasari, Kasi Viswanath; Singh, Alok; Mallipeddi, Rammohan | Univ Hyderabad, Sch Comp & Informat Sci, Hyderabad 500046, Telangana, India; Kyungpook Natl Univ, Dept Artificial Intelligence, Sch Elect Engn, Daegu 41566, South Korea | Mallipeddi, Rammohan/AAL-5306-2020; viswanath, kasi/O-5251-2016 | 57223887452; 35254330000; 25639919900 | dasarivisu@gmail.com;alokcs@uohyd.ernet.in;mallipeddi.ram@gmail.com; | DISTRIBUTED COMPUTING AND INTELLIGENT TECHNOLOGY, ICDCIT 2024 | 0302-9743 | 1611-3349 | 14501 | 0 | 2025-04-16 | 0 | 0 | Intelligent optimization; Variable neighborhood search; Traveling salesman problem; Clustered traveling salesman problem; d-relaxed priority rule | ALGORITHM | Clustered traveling salesman problem; d-relaxed priority rule; Intelligent optimization; Traveling salesman problem; Variable neighborhood search | Benchmarking; Cluster-based; Clustered traveling salesman problems; D-relaxed priority rule; Generalisation; Intelligent optimization; Multistart; NP-hard; Priority rules; Travel costs; Variable neighborhood search; Traveling salesman problem | English | 2024 | 2024 | 10.1007/978-3-031-50583-6_24 | 바로가기 | 바로가기 | 바로가기 | |||||||||
| ○ | Book chapter | A Global Perspective of Beginning to the End of the Microplastics in the Aquatic Environment: Tracing the Missing Link – Bioplastics | Plastic is one of the materials that can be easily manufactured and can be used in a variety of applications. Plastics have massive social and economic value when compared to natural materials. The improper management of waste materials made of plastic could lead to an increase of as considerable as 265 million Mt/y by the year 2060. The rapid decomposition of plastics resulting in the formation of tiny particles called microplastics (5 mm in size) which actively migrate into the marine environment during the rainy season or they may be formed in the marine environment itself by the plastics dumped therein. As a result, there is a high accumulation of plastic debris in marine water and sediment, which has a variety of effects on marine biota. These microplastics are consumed by various animals and humans through the food chain, resulting in various health issues such as endocrine disruption, cancer, neurobehavioral variations, neurotoxicity, and reproductive toxicity. At present, several technologies (including chemical and biological processes) have been used to combat plastic pollution; however, these techniques have several drawbacks. Therefore, the development of bioplastic materials is a feasible way to reduce microplastic contamination. Microbes and different waste materials including animal wastes and plant residues are suitable for the development of environment-friendly bioplastics. © 2025 selection and editorial matter, A. Arun, Kunyu Zhang, Sudhakar Muniyasamy and Rathinam Raja; individual chapters, the contributors. | Sabapathi, Durgadevi; Anitha, Selvaraj; Yuvaraj, Anathanarayanan; Govarthanan, Muthusamy; Karmegam, Nachimuthu; Biruntha, Muniyandi; Sivakumar, Gnanasekaran; Arun, A.; Kumar, Ponnuchamy | Toxicogenomics and Systems Toxicology Lab, Department of Animal Health and Management, Alagappa University, Tamil Nadu, Karaikudi, India; Toxicogenomics and Systems Toxicology Laboratory, Department of Animal Health and Management, Alagappa University, Tamil Nadu, Karaikudi, India; Department of Zoology, Periyar University, Tamil Nadu, Salem, India; Department of Environmental Engineering, Kyungpook National University, Deagu, South Korea; Department of Botany, Government Arts College (Autonomous), Tamil Nadu, Salem, India; Vermitechnology Laboratory, Department of Animal Health and Management, Alagappa University, Tamil Nadu, Karaikudi, India; College of Education, Alagappa University, Tamil Nadu, Karaikudi, India; Department of Microbiology, Alagappa University, Tamilnadu, Karaikudi, India; Toxicogenomics and Systems Toxicology Lab, Department of Animal Health and Management, Alagappa University, Tamil Nadu, Karaikudi, India | 57858444700; 57957509000; 57202376867; 54881927600; 6506043230; 57203752025; 59386285800; 57078221100; 55173720800 | Biodegradable Polymers, Blends and Biocomposites: Trends and Applications | 0 | 2025-05-07 | 0 | English | Final | 2024 | 10.1201/9781003304142-14 | 바로가기 | 바로가기 | |||||||||||||||||||||
| ○ | ○ | Proceedings Paper | A Novel GNN-based Decoding Scheme for Sparse Code Multiple Access (SCMA) | Sparse Code Multiple Access (SCMA) is a promising code-based multiple access technique for achieving higher spectral efficiency and massive connectivity that is crucially required in the B5G applications such as massive machine-type communication (mMTC). Traditional SCMA receivers use Maximum Likelihood (ML) and Message Passing Algorithm (MPA) for signal decoding, which nonetheless suffer from extremely high computational complexity. To resolve the issue, we propose to use Graph Neural Networks (GNN) to replace MPA for decoding, aiming at reducing the decoding complexity while maintaining satisfactory Bit Error Rate (BER) performance. Simulation results show that our proposed solution can achieve much higher decoding accuracy and faster decoding speed. | Chen, ZiJian; Peng, Limei; Ho, Pin-Han | Kyungpook Natl Univ, Sch Comp Sci & Engn, Deagu, South Korea; Univ Waterloo, Dept Elect & Comp Engn, Waterloo, ON, Canada; UESTC, Shenzhen Inst Adv Study, Shenzhen, Peoples R China | 58696045200; 7201574271; 7402211578 | chenzijian0@knu.ac.kr;auroraplm@knu.ac.kr;p4ho@uwaterloo.ca; | 2024 INTERNATIONAL CONFERENCE ON NETWORKING AND NETWORK APPLICATIONS, NANA 2024 | 0 | 2025-05-07 | 0 | 0 | Sparse Code Multiple Access (SCMA); Graph Neural Network (GNN); message passing algorithm (MPA) | Graph Neural Network (GNN); message passing algorithm (MPA); Sparse Code Multiple Access (SCMA) | Code division multiple access; Decoding; Graph algorithms; Maximum likelihood; Network coding; Decoding scheme; Graph neural network; Graph neural networks; Message passing algorithm; Message-passing algorithm; Multiple access; Multiple access techniques; Network-based; Sparse code multiple access; Sparse codes; Graph neural networks | English | 2024 | 2024 | 10.1109/nana63151.2024.00033 | 바로가기 | 바로가기 | 바로가기 | ||||||||||||||
| ○ | Article | A novel multi-level evaluation approach for human-coupled IoT applications: High-level DEVS smart object system modeling and multi-level co-simulation for human-coupled iot design | The recent emerging trend to promote the harmonious interactions between human and smart objects in Internet of Things (IoT) applications has led to the rising demand for the comprehensive exploration of associated IoT design spaces, considering system-, network-, and human-level perspectives. The traditional design approach of networked smart objects tends to ignore the effects caused by human interactions so that the existing approach has the limited capability in joint system/network/human multi-level exploration. In this paper, we propose a high-level system modeling and multi-level simulation approach for microsystem models to interoperate with high-level models in the human-level perspective and to provide comprehensive co-exploration. The high-level system modeling enables one to abstract the detailed operations of hardware platforms using power and timing data obtained by the proposed high-level state-based profiling method and using the event-driven modeling concept. For the event-driven system modeling, we utilize the discrete-event system specification (DEVS) to support scalable model-driven prototyping. To represent the coupled relationship of network-level system activity and human-level interactions between node systems and humans, we employ a general-purpose network simulator to model the operation and communication of network modules in smart objects and developed agent-based human behavioral models. For the co-simulation of multi-level models, we designed a distributed simulation platform to enable the interoperation between the DEVS simulator and the network simulator using a runtime infrastructure. The proposed modeling and simulation approach is applied for the multi-level evaluation of a smart museum application to estimate the effect of energy-efficiency policies. © The Author(s) 2018. corrected publication 2021. | Seok, Moon Gi; Park, Daejin | Arizona State University, Tempe, AZ, United States; Kyungpook National University, Daegu, South Korea | 36683242700; 55463943600 | boltanut@knu.ac.kr; | Journal of Ambient Intelligence and Humanized Computing | 1868-5137 | 15 | 2 | 0 | 2025-05-07 | 3 | DEVS; Human-coupled Internet-of-Thing; Multi-level modeling and simulation; NS-3; Smart object | Behavioral research; Discrete event simulation; Energy efficiency; Simulation platform; Simulators; Specifications; Discrete-Event System Specification; Human levels; Human-coupled internet-of-thing; Model and simulation; Multi-level modeling and simulation; Multilevel modeling; Multilevels; NS-3; Smart objects; System models; Internet of things | English | Final | 2024 | 10.1007/s12652-018-0943-8 | 바로가기 | 바로가기 | |||||||||||||||
| ○ | Proceedings Paper | A Novel Voltage based Synchronization Method for Maximum Power Factor Injection of Grid-Tied Converter in Extremely Weak Grid | As the penetration of power electronic converter-based resources in the power system increases, the robustness of the grid weakens. In a weak grid with relatively high equivalent system impedance, the voltage magnitude at the point of common coupling (PCC) fluctuates significantly due to voltage drop when injecting active power. This reduces the stability of the phase-locked loop (PLL) used for synchronizing grid-connected converters with the power grid and decreases the power factor that the grid can accommodate. This paper analyzes the transient stability of grid-connected converters using V-delta curve and proposes a method for ensuring stable synchronization with the weak grid while injecting power at the maximum power factor, even under extremely weak grid conditions. | Kim, Ki-Hyun; Cui, Shenghui; Jung, Jae-Jung | Kyungpook Natl Univ, Sch Elect & Elect Engn, Daegu, South Korea; Seoul Natl Univ, Dept Elect & Comp Engn, Seoul, South Korea | rlarlgus5615@knu.ac.kr;cuish@snu.ac.kr;jj.jung@knu.ac.kr; | 2024 9TH IEEE WORKSHOP ON THE ELECTRONIC GRID, EGRID | 2831-364X | 0 | Grid following (GFL); short circuit ratio (SCR); synchronization; phase locked loop (PLL); weak grid | English | 2024 | 2024 | 10.1109/egrid62045.2024.10842776 | 바로가기 | 바로가기 | |||||||||||||||||||||
| ○ | Conference paper | A Numerical Study on the Frictional Resistance Adjacent the Pile Tip in Clayey Sand | Pile foundations are a commonly used option for constructing buildings, bridges, embankments, and other structures. However, there are several methods available for determining the load-carrying capacity of piles, such as Meyerhof's method, Terzaghi, Peck and Mesri (1996), and the Japanese Institute of Architecture. These methods provide predictions of pile load-capacity but may differ from the results of the pile static test conducted in the field. However, the calculation methods for determining the bearing capacity of piles take into account the frictional resistance that occurs along the entire length of the pile. However, the frictional resistance along the pile body is affected by the displacement of the pile as it slides into the soil, and the displacement of the soil around the pile tip also affects the frictional resistance near the pile tip. Using numerical methods (specifically Plaxis 3D), the research team simulated and investigated the displacement of soil around pile tips of varying diameters in sandy soil located in Ho Chi Minh City. This study revealed that the frictional resistance near the pile tip decreased at a position equal to 0.865 times the pile diameter. © 2024, The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. | Nguyen, Nhut-Nhut; Tran, Dong-Kiem-Lam; Nguyen, Tan-No; Hwang, Keum-Bee; Woo, Seung-Wook; Park, Sung-Sik | Ho Chi Minh City University of Technology (HCMUT), 268 Ly Thuong Kiet Street, District 10, Ho Chi Minh City, Viet Nam, Vietnam National University Ho Chi Minh City, Linh Trung Ward, Thu Duc City, Ho Chi Minh City, Viet Nam, Department of Civil Engineering, Kyungpook National University, Daegu, South Korea; Department of Civil Engineering, Kyungpook National University, Daegu, South Korea; Department of Civil Engineering, Kyungpook National University, Daegu, South Korea; Department of Civil Engineering, Kyungpook National University, Daegu, South Korea; Department of Civil Engineering, Kyungpook National University, Daegu, South Korea; Department of Civil Engineering, Kyungpook National University, Daegu, South Korea | 57211211964; 57217738208; 57862912800; 57347017900; 57212917862; 36241850300 | nguyennhutnhut@hcmut.edu.vn; | Lecture Notes in Civil Engineering | 2366-2557 | 442 | 0 | 2025-04-16 | 0 | Finite element; Pile foundation; Pile load-capacity; Plaxis | Bridges; Finite element method; Friction; Numerical methods; Pile foundations; Soils; Clayey sands; Finite element; Frictional resistance; Load capacity; Pile load; Pile load-capacity; Pile tip; Plaxis; Research teams; Static tests; Piles | English | Final | 2024 | 10.1007/978-981-99-7434-4_104 | 바로가기 | 바로가기 | ||||||||||||||||
| ○ | ○ | Article | A progress-based analysis of the progressive in English | Linguistic Research 41(3): 517-545. Much of the literature on the English progressive has focused on the relationship between an event in progress and its potential future culmination, often overlooking its broader range of uses- event-in-progress, characterizing, and futurate readings. Event-based analyses have struggled to establish a unified core meaning that accounts for these interpretations. In response, this study advances a process-based approach, positing that the progressive aspect systematically emphasizes a process unfolding within a specific reference time. By foregrounding the ongoing process as the fundamental element, this account provides a cohesive explanation for the progressive across its diverse readings. Additionally, it addresses or resolves longstanding challenges in the semantics of the progressive-such as the Imperfective Paradox, Existential Generalization, (Un)Interruption, and Contextual Influence-in a more principled manner | Kim, Nam-Hee; Kim, Ji-Hee; Lee, Yae-Sheik | Kyungpook Natl Univ, Dept English Educ, 80 Daehak Ro, Daegu 41566, South Korea | 59498476900; 59497960300; 37088920300 | boodem@naver.com;yrkb0502@gmail.com;yaesheik@knu.ac.kr; | LINGUISTIC RESEARCH | LINGUIST RES | 1229-1374 | 41 | 3 | ESCI | LANGUAGE & LINGUISTICS | 2024 | 0.2 | 0 | 2025-05-07 | 0 | 0 | progressive aspect in English; process-based analysis; event culmination; diverse interpretations; unified analysis; imperfective paradox; existential; generalization; contextual influence | contextual influence; diverse interpretations; event culmination; existential generalization; imperfective paradox; process-based analysis; progressive aspect in English; unified analysis | English | 2024 | 2024 | 10.17250/khisli.41.3.202412.008 | 바로가기 | 바로가기 | 바로가기 | 바로가기 | ||||||
| ○ | Article | A Proposal for Improvement of Korean Science Inquiry Activities through an Analysis of Practicals of the IB DP Physics; [IB DP 물리학의 탐구 활동 운영 및 평가 분석을 통한 과학 탐구 활동의 개선방안 제언] | This study analyzed the operation of inquiry activities and internal assessment in the IB DP Physics course and examined the implications for science education in Korea. I found that IB DP(International Baccalaureate Diploma Programme) requires students to conduct quantitative experiments by giving specific guidelines on the number of class periods, types of inquiry activities, and evaluation in the Physics guide, and that it is operated as an open inquiry that only outlines the topic and approach to inquiry, and requires quantitative analysis and data processing of the results of the experiments. I also found that IB DP requires students to conduct self-directed inquiry activities through internal assessment to finally evaluate their inquiry competence. Through this study, it was suggested that self-directed inquiry activities and approaches for quantitative interpretation of data should be discussed in terms of the operation of inquiry activities, and that the development of inquiry activity evaluation criteria and the need for teacher-training program in inquiry activity evaluation are needed in terms of the evaluation of inquiry activities. © 2024 Korean Physical Society. All rights reserved. | Kwon, Munho | Kyungpook National University High School, Daegu, 41950, South Korea | 57208348111 | likethomson@gmail.com; | New Physics: Sae Mulli | 0374-4914 | 74 | 4 | 0 | 2025-05-07 | 0 | IB DP; Internal assessment; Science inquiry activity | Korean | Final | 2024 | 10.3938/npsm.74.379 | 바로가기 | 바로가기 | ||||||||||||||||
| ○ | Article | A Robust Decryption Technique Using Letter Frequency Analysis for Short Monoalphabetic Substitution Ciphers | Substitution ciphers—where characters are systematically replaced with different ones—have represented a vital tool in safeguarding sensitive information for centuries, eventually laying the foundation for modern encryption techniques. Despite their large key space, substitution ciphers are susceptible to frequency analysis that leverages common English letter patterns. While existing research has suggested certain methods that can improve decryption accuracy using ngram frequencies, these methods face difficulties when used with short ciphertexts due to incomplete letter distribution representation. The present study examines the limitations of current frequency analysis in decrypting short ciphertexts, with the results revealing that deterministic bigram approaches can reduce accuracy in certain cases. To address this shortcoming, we introduce a novel algorithm that uses randomized index selection based on letter distribution to generate multiple candidate keys. We also present a word-level key guessing method using these candidates that maps prominent English words to uncover a secret key. The results of tests with 200 ciphertexts of varying lengths showed an average decryption accuracy of 84.1% for 200-character ciphertexts, an improvement of 147.1% over existing methods. In experiments without dictionary-based decryption, an accuracy of 77.6% was achieved with a decryption time of approximately 0.27 seconds, which is a reasonable completion time. Altogether, these results highlight the efficiency and practicality of our approach for decrypting short ciphertexts. © 2024. The Korean Institute of Information Scientists and Engineers | Kang, Dayeong; Lee, Jiyeon | School of Computer Science and Engineering, Kyungpook National University, Daegu, South Korea; School of Computer Science and Engineering, Kyungpook National University, Daegu, South Korea | 59417154400; 58377757200 | jiyeon@knu.ac.kr; | Journal of Computing Science and Engineering | 1976-4677 | 18 | 3 | 0 | 2025-05-07 | 0 | Cryptoanalysis; Cryptography; Letter frequency analysis; Monoalphabetic cipher | Encryption algorithms; Ciphertexts; Cryptoanalysis; Encryption technique; Frequency Analysis; Letter frequency analyze; Monoalphabetic cipher; N-grams; Sensitive informations; Short ciphertext; Substitution ciphers; Ciphertext | English | Final | 2024 | 10.5626/jcse.2024.18.3.144 | 바로가기 | 바로가기 | |||||||||||||||
| ○ | ○ | Proceedings Paper | A Sink-Triggered Data Gathering Protocol in Underwater Sensor Network | This paper proposes a medium access control(MAC) protocol that allows a centralized sink to trigger scattered sensors to transmit data according to the sink's arbitrary scheduled times. It doesn't require any synchronization procedure to acquire the propagation delay between the sink and sensors. The proposed protocol aims to adapt to the heterogeneous traffic demands of each sensor by allocating different numbers of time-slots. Results show that the proposed scheme outperforms a time division multiple access(TDMA) which is a typical MAC protocol for data gathering in terms of packet delay and channel utilization under conditions of uneven traffic demands among sensors. | Park, Shin-Young; Do, Eun-Ju; Lee, Jong-Won; Cho, Ho-Shin | Kyungpook Natl Univ, Dept Elect Engn, Daegu, South Korea | 59443954900; 59886852000; 55689939800; 35316924900 | 2024 FIFTEENTH INTERNATIONAL CONFERENCE ON UBIQUITOUS AND FUTURE NETWORKS, ICUFN 2024 | 2165-8528 | 2165-8536 | 0 | 2025-05-07 | 0 | 0 | Underwater Sensor Networks(UWSNs); Data Gathering Protocol; Triggering message; Dynamic Slot Allocation; Uneven traffic | Data Gathering Protocol; Dynamic Slot Allocation; Triggering message; Underwater Sensor Networks(UWSNs); Uneven traffic | Internet protocols; Sensor networks; Centralised; Data gathering protocols; Dynamic slot allocation; Medium access control protocols; Scattered sensors; Traffic demands; Transmit data; Triggering message; Underwater sensor networks; Uneven traffic; Time division multiple access | English | 2024 | 2024 | 10.1109/icufn61752.2024.10625147 | 바로가기 | 바로가기 | 바로가기 |
페이지 이동: