Earticle

It is widely said that conjunctive postposition kara means subjective cause and reason while another conjunctive postposition node also means cause and reason but objective one. This subjective versus objective frame work does not tell us clearly when we should use each one. In this article I suggest that we should first make the difference between ‘cause’ and ‘reason’ clear to define the difference between these two controversial postpositions which carry very similar meaning.

지역학이 학문적 영역으로 구축된 것은 1990년대부터이다. 지방자치제가 상징하는 것처럼 정치경제적 토대 변화는 지역성 탐색을 근간에 두고 지역학 범주를 발전시키기 위한 결정적 계기였다. 삼척학의 본격적 전개를 위해서는 상위 범주인 지역학의 개념 정립은 물론 구체적인 방법론 확립을 위한 학제적 협의틀이 우선 설정되어야 한다. 나아가 소멸 위기의 도시를 재생시키기 위한 하나의 기제(dispositif, apparatus)로서 적극 전유되어야 한다. 삼척시의회는 삼척학 연구를 위한 교두보로서의 역할을 수행해 왔다. 삼척학 정책포럼(2019), 삼척학 정립을 위한 연구센터 설립 및 분야별 과제발굴 연구(2020), 삼척의 자랑스러운 근현대 인물 선양방안 연구(2021) 등은 선도적 사례라 할 수 있다. 중요한 것은 관련 대학 등 지역 공동체의 아카데미 내부에서 체계적이고 장기적 인 프로세서를 구축해야 한다는 점이다. 정치한 내용 구성과 대중적 소통을 위해 책임 있는 연구진을 확보하고 학제간 연구틀을 조성하여 장기적으로 추진 해 나갈 필요가 있는 것이다. 이 지점에서 지역 행정기관, 의회, 대학 등의 간섭으로부터 자유로울 수 있는 ‘삼척학 연구센터’의 구성이 재차 요구된다. 향후 독립적이고 협력적인 활동을 통해 지역 인물의 선양은 물론 삼척학 연구의 내용성과 강제성을 담보할 제도적 필요성이 제기되고 있는 실정이다. 삼척학이 존재 가능하고, 그것이 한국학의 폭력적 일반화로부터 벗어나 실정적 삶의 현장 위에서 존재를 증명해야 한다면, 무엇보다도 고유한 지역적 삶의 재현을 통해 긴밀한 결절 단위를 구성해야 한다. 그 속에서 장소성의 전유, 곧 고유의 지역적 경험을 지역학 보편의 영역으로 체현하는 학술적 지평이 성숙해 갈 것이다. 삼척 학을 포함한 기존의 지역학 연구는 다양한 성과에도 불구하고 문제점 역시 노정 하고 있다. 삼척시의회와 같은 민선 기관이 지역에 대한 권능의 합의체로서 향후 삼척학연구센터를 주재하고 강제하는 장치로 기능할 수 있으리라 기대한다.

It was in the 1990s that area studies was established as an academic domain. As the local self-government system symbolizes, the change in the political and economic foundation was a decisive opportunity to develop the category of regional studies based on the search for regionality. For the full-fledged development of Samcheok Studies, an interdisciplinary framework for establishment of specific methodology as well as the establishment of the concept of regional studies, which is the upper category, must first be established. Furthermore, it should be actively appropriated as a dispositif(apparatus) to regenerate a city in danger of extinction. The Samcheok City Council has played a role as a bridgehead for the study of Samcheok Studies. The important thing is to establish a systematic and long-term process within the academy of the local community, such as the relevant university. It is necessary to secure responsible researchers and create an interdisciplinary research framework to promote political content and public communication in the long term. At this point, the formation of the ‘Samcheok Studies Research Center’, which can be free from interference from local administrative agencies, parliaments, and universities, is required again. In the future, through independent and cooperative activities, there is an institutional need to secure the content of Samcheok study as well as the promotion of local figures. If Samcheok Studies can exist, and if it is to prove its existence on the field of real life, away from the violent generalization of Korean Studies, above all, a close nodal unit must be formed through the reproduction of unique local life. Within it, the appropriation of placeness, that is, the academic horizon of embodying the unique regional experience into the universal realm of regional studies will mature. Existing regional studies, including Samcheok studies, are also facing problems despite various achievements. It is expected that a publicly elected organization such as the Samcheok City Council, as a body of authority for the region, will be able to function as a device to preside over and enforce the Samcheok Studies Research Center in the future.

The purpose of this paper is to show that Wuthering Heights can be changed from a ‘text’ to a ‘hypertext’ with active readers and good listeners. Nelly’s story is written in oral language and it has striking resemblances to the modern hypertexts. Nelly’s story in a gossip form requires listeners’ active roles. In doing so, it fosters a communal sense between them. And WH is well represented through the gothic which is an effective storytelling source exciting listeners’ curiosity with thrilling elements. Although it may lack narrative coherence and aesthetic unity, the gothic can be a more developmental genre with the flexibility of mixing other elements. The narrative structure of WH shows the hypertextual characteristics of the work. Nelly is just a ‘node’ or ‘jointing point,’ not a ‘center’ that has an authoritative voice. Various texts are linked to Nelly without any one of them being able to surpass the rest. WH calls for active and sincere listeners like Lockwood who produced his own new text with Nelly’s story. A text written by Emily Brontë can be changed to a hypertext continuing evolution with new elements added by good readers or listeners.

센서 네트워크에서는 데이터의 실시간 처리가 중요한 요소 중의 하나이다. 각 노드들이 감지한 데이터들은 정해진 시간 내에 전송 되어야만 필요한 시기에 정확한 처리가 가능하다. 따라서 노드들이 데이터를 정해진 시간 내에 제대로 전달하고 있는가를 점검하는 것은 매우 중요하다. 최근 리얼타임 임베디드 시스템이 점점 더 정확해져 서 신뢰성 있고 정교한 서비스를 제공할 수 있게 되었다. 임베디드 시스템의 본래의 복잡함 때문에 물리세계에서의 예측의 어려움과 안전한 설계의 어려움은 런타임에서 시스템 제약사항에 위배되는 것과 예상치 못한 상황을 야기시 키는 원인이 된다. 각 노드들이 감지한 데이터를 정해진 시간 내에 전달해야 필요한 시기에 적합한 처리가 가능하기 때문에 본 논문에서는 데이터 전송시간에 대한 모니터링을 통하여 센서 네트워크에 존재하는 노드들이 허용시간 범위 내에서 서버로 데이터를 전송하고 있는가를 확인하기 위한 데이터 전송시간 분석 시스템을 구현 하였다. 시스 템 구현을 위하여 데이터 전송시간 분석을 위한 절차를 제시했고, 제시한 절차에 따라 전송시간을 분석하기 위해 필요한 시간차 분석 방법, 데이터 송수신 시간 수집 방법 및 데이터 전송시간 계산 방법을 제시했다.

Real-time processing of sensor data network, is one of the important factors. Each node in the detected data are required to be transmitted within a certain time since the accurate processing is possible. Thus, the data nodes are successfully delivered within a specified time, it is very important to check whether the. Recently more and more accurate real-time embedded systems are reliable and haejyeoseo been able to provide sophisticated services. Because of the inherent complexity of embedded systems in the physical world and the difficulty of predicting the difficulty of a safe design constraints on the runtime violation of system as to cause unexpected causes. Each node data in time detected by the time required to be passed in the appropriate processing is possible because the data transfer time in this paper, the monitoring of the sensor network through a node are allowed to exist within the time range and transmits data to the server Analysis of the data transfer time for checking whether the system was implemented. Implementation of the data transmission time to the process for analyzing and presenting, according to the procedure suggested by the transit time required for analysis a time difference analysis method, a data collection method and a data transmission time and transmission time calculating method presented.

IT 인프라의 발전은 소프트웨어 개발을 위한 지속적 통합(CI)과 지속적 배포(CD)의 개발을 이끌었다. CI/CD는 빠른 배포와 반복을 가능하게 하지만, 보안 취약점을 신속하게 식별하고 관리하는 데 있어 도전 과제를 제시한다. 본 연구는 Node.js와 GitHub Actions를 기반으로 한 보안 통제 기법을 제안하여 이러한 과제들을 해결하고자 한다. 제안된 기법은 보안을 CI/CD 파이프라인에 직접 통합함으로써, 실시간으로 취약점을 탐지하고 주요 취약점을 완화할 수 있도록 설계되었다. 이 기법은 불필요한 데이터 축적을 최소화하고, 추가적인 인프라 유지보수의 복잡성을 줄이며, 구성 및 분석 과정을 간소화한다. 본 연구는 낮은 컴퓨팅 오버헤드로 높은 수준의 보안 통제를 실현함으로써, 현대 DevSecOps 환경에서 제안된 방법의 실용성과 효율성을 입증한다.

The advancement of IT infrastructure has led to the development of continuous integration and continuous deployment (CI/CD) for software development. CI/CD enables rapid deployment and iteration but presents challenges in swiftly identifying and managing security vulnerabilities. This study addresses these challenges by proposing a security control technique based on Node.js and GitHub Actions. The proposed technique integrates security directly into the CI/CD pipeline, ensuring real-time vulnerability detection and mitigation for critical vulnerabilities (CRITICAL level). It minimizes unnecessary data accumulation, reduces the complexity of maintaining additional infrastructure, and simplifies the configuration and analysis processes. By achieving highly effective security control with reduced computational overhead, the study demonstrates the practical applicability and efficiency of the proposed method within modern DevSecOps environments.

This paper proposes a method to find a tree with the maximum number of terminals that can be connected by a given length when numerous terminals distributed in a cluster form are given to the Euclidean plane R2 with several constraints. First constraint is that a given terminal is distributed in a cluster form, second is that a given length cannot connect all terminals in the tree, and third is that there is no curved connection between each terminal. This paper proposes a method to establish more efficient interconnections within terminals distributed in a cluster form by improving a randomly distributed memetic genetic algorithm. The construction of interconnections has been extensively used in design-related fields, from networking to architecture. Additionally, in real life, the construction of interconnections is mostly distributed in the form of clusters. Therefore, the heuristic algorithm proposed in this paper can be effectively utilized in real life and is expected to provide various cost savings.

This paper proposes a solution to the problem of finding a subgraph for a given instance of many terminals on a Euclidean plane. The subgraph is a tree, whose nodes represent the chosen terminals from the problem instance, and whose edges are line segments that connect two corresponding terminals. The tree is required to have the maximum number of nodes while the length is limited and is not sufficient to interconnect all the given terminals. The problem is shown to be NP-hard, and therefore a genetic algorithm is designed as an efficient practical approach. The method is suitable to various probable applications in layout optimization in areas such as communication network construction, industrial construction, and a variety of machine and electronics design problems. The proposed heuristic can be used as a general-purpose practical solver to reduce industrial costs by determining feasible interconnections among many types of components over different types of physical planes.

This paper presents processing-node status-based message scattering and gathering algorithms for multi-processor systems on chip to reduce the communication time between processors. In the message-scattering part of the message-passing interface (MPI) scatter function, data transmissions are ordered according to the proposed linear algorithm, based on the processor status. The MPI hardware unit in the root processing node checks whether each processing node's status is 'free' or 'busy' when an MPI scatter message is received. Then, it first transfers the data to a 'free' processing node, thereby reducing the scattering completion time. In the message-gathering part of the MPI gather function, the data transmissions are ordered according to the proposed linear algorithm, and the gathering is performed. The root node receives data from the processing node that wants to transfer first, and reduces the completion time during the gathering. The experimental results show that the performance of the proposed algorithm increases at a greater rate as the number of processing nodes increases.

선택 스플라이싱은 유전자 발현의 중요한 과정 중 하나이다. 선택 스플라이싱이 발생함에 따라, 돌연변가 발생하여, 질병을 일으킬 수 있다. 대부분의 선택 스플라이싱 연구는 EST(Expressed Sequence Tag)를 이용한다. 그러나, EST를 이용하여 선택 스플라싱을 예측하는 데는 몇 가지 단점이 있다. EST가 저장되어 있는 라이브러리가 잘 정돈되어 있지 않거나, 잘못 열거되어 있을 경우, 실험 시 EST를 잘못 선택할 수 있다. 또한, EST가 아직 발견되지 않은 유전 서열에서는 선택 스플라이싱을 찾을 방법이 없다. 이 논문에서는 이러한 EST 기반 연구의 약점을 개선하고, 선택 스플라이싱의 탐지 및 예측의 질을 높이기 위해서, pre-mRNA에서 One-leaf One-node Tree 알고리즘을 제안한다. 이 트리는 Arabidopsis thaliana의 각 염색체에 대해서 실험되었다. 실험 결과, 모든 염색체에서 codons에 따라 일반 스플라싱과 선택 스플라싱이 다른 패턴을 가지는 것으로 나타났다. 트리 알고리즘에서 도출된 패턴으로 부터, 아직 발견되지 않은 선택 스플라싱도 예측할 수 있다.

Alternative splicing is an important process in gene expression. Alternative Splicing can lead to mutations and diseases. Most studies detect alternatively spliced genes with ESTs (Expressed Sequence Tags). However, reliance on ESTs might have some weaknesses in predicting alternative splicing. ESTs have been stored in the libraries. The EST libraries are often not clearly organized and annotated. We can pick erroneous ESTs. It is also difficult to predict whether or not alternative splicing exists for those genes where ESTs are not available. To address these issues and to improve the quality of detection and prediction for alternative splicing, we propose the One-leaf One-node Tree Algorithm that uses pre-mRNAs. It is achieved by codons, three nucleotides, as attributes for each chromosome in Arabidopsis thaliana. The proposed decision tree shows that alternative and normal splicing have different splicing patterns according to triplet nucleotides in each chromosome. Based on the patterns, alternative splicing of unlabeled genes can also be predicted.

As the resolution of climate change scenario data applied with regional models increased, Earth System Grid Federation (ESGF) was established around major climate-related organizations to jointly operated and manage large-scale climate data. ESGF developed standard software to provide model output, observation data management, dissemination, and analysis using Peer to Peer (P2P) computing technology. Roles of each institution were divided into index and data nodes. Therefore, ESGF data node was established at APEC Climate Center in Korea on behalf of Asia to share data on climate change scenarios of CORDEX-East Asia (CORDEX-EA) to study climate changes in Eastern Asia. Climate researchers are expected to play a large role in researching causes of global warming and responding to climate change by providing CORDEX-EA regional model data to the world through ESGF data node.

In clustering-based approaches, cluster heads closer to the sink are usually burdened with much more relay traffic and thus, tend to die early. To address this problem, distance-aware clustering approaches, such as energy-efficient unequal clustering (EEUC), that adjust the cluster size according to the distance between the sink and each cluster head have been proposed. However, the network lifetime of such approaches is highly dependent on the distribution of the sensor nodes, because, in randomly distributed sensor networks, the approaches do not guarantee that the cluster energy consumption will be proportional to the cluster size. To address this problem, we propose a novel approach called CACD (Clustering Algorithm Considering node Distribution), which is not only distance-aware but also node density-aware approach. In CACD, clusters are allowed to have limited member nodes, which are determined by the distance between the sink and the cluster head. Simulation results show that CACD is 20%-50% more energy-efficient than previous work under various operational conditions considering the network lifetime.

Wireless sensor networks are usually characterized by dense deployment of energy constrained nodes. Due to the usage of a large number of sensor nodes in uncontrolled hostile or harsh environments, node failure is a common event in these systems. Another common reason for node failure is the exhaustion of their energy resources and node inactivation. Such failures can have adverse effects on the quality of the real-time services in Wireless Sensor Networks (WSNs). To avoid such degradations, it is necessary that the failures be recovered in a proper manner to sustain network operation. In this paper we present a dynamic Energy efficient Real-Time Job Allocation (ERTJA) algorithm for handling node failures in a cluster of sensor nodes with the consideration of communication energy and time overheads besides the nodes' characteristics. ERTJA relies on the computation power of cluster members for handling a node failure. It also tries to minimize the energy consumption of the cluster by minimum activation of the sleeping nodes. The resulting system can then guarantee the Quality of Service (QoS) of the cluster application. Further, when the number of sleeping nodes is limited, the proposed algorithm uses the idle times of the active nodes to engage a graceful QoS degradation in the cluster. Simulation results show significant performance improvements of ERTJA in terms of the energy conservation and the probability of meeting deadlines compared with the other studied algorithms.

Peer-to-Peer (P2P) networks are attracting considerable research interest because of their scalability and high performance relative to cost. One of the important services on a P2P network is the streaming service. However, because each node in the P2P network is autonomous, it is difficult to provide a stable streaming service on the network. Therefore, for a stable streaming service on the P2P network, a fault-tolerant scheme must be provided. In this paper, we propose two new node selection schemes, Playback Node First (PNF) and Playback Node first with Prefetching (PNF-P) that can be used for a service migration-based fault-tolerant streaming service. The proposed schemes exploit the fact that the failure probability of a node currently being served is lower than that of a node not being served. Simulation results show that the proposed schemes outperform traditional node selection schemes.

Explainable artificial intelligence is a method that explains how a complex model (e.g., a deep neural network) yields its output from a given input. Recently, graph-type data have been widely used in various fields, and diverse graph neural networks (GNNs) have been developed for graph-type data. However, methods to explain the behavior of GNNs have not been studied much, and only a limited understanding of GNNs is currently available. Therefore, in this paper, we propose an explanation method for node classification using graph convolutional networks (GCNs), which is a representative type of GNN. The proposed method finds out which features of each node have the greatest influence on the classification of that node using GCN. The proposed method identifies influential features by backtracking the layers of the GCN from the output layer to the input layer using the gradients. The experimental results on both synthetic and real datasets demonstrate that the proposed explanation method accurately identifies the features of each node that have the greatest influence on its classification.

Extensible 3D (X3D) is the ISO standard for defining 3D interactive web- and broadcast-based 3D content integrated with multimedia. With the advent of this integration of interactive 3D graphics into the web, users can easily produce 3D scenes within web contents. Even though there are diverse texture nodes in X3D, projective textures are not provided. We enable X3D to provide SingularProjectiveTexture and MultiProjectiveTexture nodes by materializing independent nodes of projector nodes for a singular projector and multi-projector. Our approach takes the creation of an independent projective texture node instead of Kamburelis's method, which requires inconvenient and duplicated specifications of two nodes, ImageTexture and Texture Coordinate.

본 논문에서는 비화특성을 가진 새로운 FEC(Forward Error Correction) 부호기법으로 RCNC (Random Connection Node Convolutional) 부호화방식을 소개한다. 최근의 무선통신시스템은 다양한 멀티미디어 데이터 서비스를 하고 있다. 이러한 시스템은 전송 중 발생한 오류에 대한 정정 능력과 더불어 인증 사용자의 접근에 대한 비화 특성이 중요시된다. 이러한 문제를 해결하기 위한 방안으로 RCNC 부호화 방식은 전송 중 발생한 에러에 대한 오류 정정 기능을 가지면서, 전송데이터에 대한 비화성질을 부가하여 허용된 사용자 이외에는 접근이 불가능하도록 하는 암호화 특성을 가진다는 점이다. 본 논문에서는 RCNC 부호화 기법의 동작과 특성을 설명하고 있으며, 또한 컴퓨터 시뮬레이션을 이용하여 에러 정정 능력과 사용자 접근 허용정도를 검증하였다.

In this paper, we propose the new FEC(Forward Error Correction) code method, so called RCNC(Random Connection Node Convolutional) code with security property. Recently, many wireless communication systems, which can prouide integrated semices of various media types and hil rales, are required to haue the ability of secreting information and error correclion. This code system is a kind qf conuolulional code, but it Ius various code formats as each node is connected differently. And systems hy using RCNC codes haue all. ability of error correction as well as information protection. We describe the principle of operating RCNC codes, including operation examples. In this paper, we also show the peiformance of BER(Bit Error Rate) and verify authority of network system with computer simulation.

This work investigates the problem of efficient packet scheduling and transmission for IEEE 802.15.4e TSCH based on the Traffic-Aware Scheduling Algorithm (TASA). Three Integer Linear Programming (ILP) formulations are proposed, namely ILP1, ILP2, and ILP3, to comprehensively address key aspects of how packets are optimally delivered from child nodes to the root node, including node parent selection, packet scheduling, and frequency assignment. ILP1 is proposed to model the fundamental operations of TASA including packet scheduling and frequency assignment, while ILP2 further takes node parent selection into consideration for jointly optimizing node parent selection, packet scheduling, and frequency assignment. Despite its superior performance, ILP2 is only applicable to relatively small network problems due to high computational complexity. Therefore, we finally propose ILP3 for fast and efficient node parent selection. ILP3 can be combined with ILP1 and, most importantly, TASA for achieving effective node parent selection atop packet scheduling and frequency assignment for practical TSCH networks. ILP3 combined with ILP 1 led to computational complexity while ILP3 combined with TASA yielded good performance where it required less than one second of execution time and less packet delivery time.

The stability and resistance of the plates under in-plane loading is crucial in the design of structures. For the assessment of structural stability, it is necessarily required to have accurate finite element technologies. Therefore, the enhanced 9-node plate (Q9-ANS) element is introduced for the linear buckling analysis of plate where the critical buckling load has to be determined. The Q9-ANS is developed with the Reissner-Mindlin (RM) assumptions which consider transverse shear deformation of the plate. Assumed shear strain is used to alleviate the shear locking phenomenon. Numerical examples are carried out to verify the performance of the Q9-ANS element in calculation of critical buckling load of the plates.