• Journal of the Korea Society of Computer and Information
• /
• v.23 no.1
• /
• pp.33-39
• /
• 2018

In this paper, We studied the possibility of SoC(System On Chip) design using infrared image processing IP(Intellectual Property). And, we studied NUC(Non Uniformity Correction), BPR(Bad Pixel Recovery), and CEM(Contrast Enhancement) processing, the infrared image processing algorithm implemented by IP. We showed the logic and timing diagram implemented through the hardware block designed based on each algorithm. Each algorithm was coded as RTL(Register Transfer Level) using Verilog HDL(Hardware Description Language), ALTERA QUARTUS synthesis, and programed in FPGA(Field Programmable Gated Array). In addition, we have verified that the image data is processed at each algorithm without any problems by integrating the infrared image processing algorithm. Particularly, using the directly manufactured electronic board, Processor, SRAM, and FLASH are interconnected and tested and the verification result is presented so that the SoC type can be realized later. The infrared image processing IP proposed and verified in this study is expected to be of high value in the future SoC semiconductor fabrication. In addition, we have laid the basis for future application in the camera SoC industry.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.22 no.5
• /
• pp.105-110
• /
• 2022

Domestically, we are capable of designing high-end memory semiconductors, but not in processors, resulting in unbalance. Using Vivado as a development enivronment and implementing the processor on a Xilinx FPGA reduces time and cost dramatically. In this paper, the popular language VHDL which is widely used in Europe, universities, and research centers around the world for the digital system design is used for designing a pipelined 32-bit ARM processor, implemented on FPGA and verified by Integrated Logic Analyzer. As a result, the ARM processor implemented on FPGA could execute ARM instructions successfully.

• Nuclear Engineering and Technology
• /
• v.55 no.8
• /
• pp.2952-2965
• /
• 2023

Advanced reactors, such as Small Modular Reactors or existing Nuclear Power Plants, often use Field Programmable Gate Array (FPGA) based controllers in new Instrumentation and Control (I&C) system architectures or as an alternative to existing analog-based I&C systems. Compared to CPU-based Programmable Logic Controllers (PLCs), FPGAs offer better overall performance. However, programming functions on FPGAs can be challenging due to the requirement for a hardware description language that does not explicitly support the operation of real numbers. This study aims to implement the Reactor Trip (RT) functions of the existing analog-based Reactor Protection System (RPS) using FPGAs. The RT equations for Overtemperature delta Temperature and Overpower delta Temperature involve dynamic compensators expressed with the Laplace transform variable, 's', which is not directly supported by FPGAs. To address this issue, the trip equations with the Laplace variable in the continuous-time domain are transformed to the discrete-time domain using the Z-transform. Additionally, a new operation based on a relative value for the equation range is introduced for the handling of real numbers in the RT functions. The proposed approach can be utilized for upgrading the existing analog-based RPS as well as digitalizing control systems in advanced reactor systems.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.23 no.3
• /
• pp.153-158
• /
• 2023

Domestically, the importance of system semiconductor design is increasing, and the balanced development with the high-end memory semiconductors should be promoted. Using Xilinx Vivado as a development enivronment tool, it reduces time and cost dramatically in implementing the processor on FPGA. In this paper, the VHDL language which provides record data structure for an efficient digital system design is used for designing a pipelined out-of-order superscalar processor. It has been simulated extensively, synthesized and implemented on FPGA and verified by Integrated Logic Analyzer. As a result, the pipelined out-of-order superscalar processor could be executed successfully.

• KIPS Transactions on Software and Data Engineering
• /
• v.11 no.8
• /
• pp.315-324
• /
• 2022

In this paper, we propose KoEPT, a Transformer-based generative model for automatic math word problems solving. A math word problem written in human language which describes everyday situations in a mathematical form. Math word problem solving requires an artificial intelligence model to understand the implied logic within the problem. Therefore, it is being studied variously across the world to improve the language understanding ability of artificial intelligence. In the case of the Korean language, studies so far have mainly attempted to solve problems by classifying them into templates, but there is a limitation in that these techniques are difficult to apply to datasets with high classification difficulty. To solve this problem, this paper used the KoEPT model which uses 'expression' tokens and pointer networks. To measure the performance of this model, the classification difficulty scores of IL, CC, and ALG514, which are existing Korean mathematical sentence problem datasets, were measured, and then the performance of KoEPT was evaluated using 5-fold cross-validation. For the Korean datasets used for evaluation, KoEPT obtained the state-of-the-art(SOTA) performance with 99.1% in CC, which is comparable to the existing SOTA performance, and 89.3% and 80.5% in IL and ALG514, respectively. In addition, as a result of evaluation, KoEPT showed a relatively improved performance for datasets with high classification difficulty. Through an ablation study, we uncovered that the use of the 'expression' tokens and pointer networks contributed to KoEPT's state of being less affected by classification difficulty while obtaining good performance.

• Journal of International Area Studies (JIAS)
• /
• v.13 no.1
• /
• pp.345-368
• /
• 2009

Our research task have goal to describe a treaty rhetoric known as 『La Rhétorique ou L'Art de Parler』(1688) which corresponds to a very wide field of which the step is not yet dubious in our country. Thus to study the rhetoric of Lamy borrowed from the thought of Descartes, we left the concept d' origin of language in traditional rhetoric in connection with logic and grammar (in first part). Also the second part is devoted to the tropes and the figures that are modified and deteriorated by the language of passion called 'rhetoric of passion or psychological of figure', etc. And the third part interests in the body of the speech being the character of l' heart. Under the influence of the rhetoric of Lamy, French rhetoric at the 17th century is held for an essential text when one interests in the history of the ideas and rhetoric, marked in its specificity (passion). The project of Lamy registered in the concept of passion like 'manners of speaking'. To close this study, which does one have to retain? The first remark to note is that Lamy founds his rhetoric in opposition to traditional designs dating from the beginning of Aristote. Second remark is the idea that one finds based in famous the books of Dumarsais at the 18th century and Fontanier at the 19th century. Admittedly, Lamy is a true rhetorician, grammairien which interests in the question of passions in the speech forces to reconsider the idea spread since Mr. Foucault, and makes it possible to understand the passage of the Great century at the Century of Lumuères. Even if this opinion is not shared, it will be agreed that the work of Lamy on passions or the phenomena sensory and psychological in the center of the language deserves reflexion.

• Archives of design research
• /
• v.17 no.2
• /
• pp.279-288
• /
• 2004

Corporate design activities have expanded from being exclusive and passive responsibilities to active participation in planning, marketing, technology and corporate brand image differentiation for successful business. Thus the communications between designers and other functions come to include critical decision making, information sharing, and objective reasoning. Given that design activities now have to involve various functions in product development, the styling-related design process, which is still developed by designer's intuition and experience, poses as an obstacle not just between various functions involved, but even within the design function. To overcome this obstacle and to lead more effective design decision process, a means for product form development assessment and management is necessary. This research proposes a foundation for managing and assessing product form based on the hypothesis and demonstration of discovering a system of formative factor and order a product form expresses that can be shared as an objective and logical system. As a result of this demonstration, the form as a unique visual expression and the factors related to the form and its co-relationship are examined. The factors are called formative parameters and the system is named as the product form alignment method. Based on the logic derived from the system, the process for developing an image that aligns with the predefined goal is explained. The method defines a balance between a designer's intuitive creativity and the extracted logic, which can act as a basis for designers to share design language among themselves and for communication between design and other functions. Based on this system, designers are able to align design work with the set goal, and focus and limit the range of form development, which is anticipated to result in lead-time reduction and minimizing unnecessary obstacles and mistakes.

• Journal of KIISE:Software and Applications
• /
• v.37 no.4
• /
• pp.282-296
• /
• 2010

OWL is an ontology language for the Semantic Web, and suited to modelling the knowledge of a specific domain in the real-world. Ontology also can infer new implicit knowledge from the explicit knowledge. However, the modeled knowledge cannot be complete as the whole of the common-sense of the human cannot be represented totally. Ontology do not concern handling nonmonotonic reasoning to detect incomplete modeling such as the integrity constraints and exceptions. A default rule can handle the exception about a specific class in ontology. Integrity constraint can be clear that restrictions on class define which and how many relationships the instances of that class must hold. In this paper, we propose a practical reasoning system for open and closed-world reasoning that supports a novel hybrid integration of ontology based on open world assumption (OWA) and non-monotonic rule based on closed-world assumption (CWA). The system utilizes a method to solve the problem which occurs when dealing with the incomplete knowledge under the OWA. The method uses the answer set programming (ASP) to find a solution. ASP is a logic-program, which can be seen as the computational embodiment of non-monotonic reasoning, and enables a query based on CWA to knowledge base (KB) of description logic. Our system not only finds practical cases from examples by the Protege, which require non-monotonic reasoning, but also estimates novel reasoning results for the cases based on KB which realizes a transparent integration of rules and ontologies supported by some well-known projects.

• Korean Journal of Logic
• /
• v.22 no.1
• /
• pp.43-86
• /
• 2019

If 1st order ZFC is consistent(has a model($M_1$)) it has a transitive denumerable model($M_2$). This leads to a paradoxical situation called 'Skolem paradox'. This can be easily resolved by Skolem's typical resolution. but In the process, we must accept the model theoretic relativity for the concept of set. This relativity can generate a situation where the meaning of the set concept, for example, is given differently depending on the two models. The problem is next. because the sentence '¬denu(PN)' which indicate that PN is not denumerable is equally true in two models, A indistinguishability problem that the concept <¬denu> is not formally indistinguishable in ZFC arise. First, I will give a detail analysis of what the nature of this problem is. And I will provide three ways of responding to this problem from the standpoint of supporting ZFC. First, I will argue that <¬denu> concept, which can be relative to the different models, can be 'almost' distinguished in ZFC by using the formalization of model theory in ZFC. Second, I will show that <¬denu> can change its meaning intrinsically or naturally, by its contextual dependency from the semantic considerations about quantifier that plays a key role in the relativity of <¬denu>. Thus, I will show the model-relative meaning change of <¬denu> concept is a natural phenomenon external to the language, not a matter of responsible for ZFC.

• Journal of the Korea Society of Computer and Information
• /
• v.25 no.6
• /
• pp.1-8
• /
• 2020

Communication between system modules is applied using the Modbus protocol in industrial sites including smart factories, industrial drones, building energy management systems, PLCs, ships, trains, and airplanes. The existing Modbus was used for serial communication, but the recent Modbus protocol is used for TCP/IP communication.The Modbus protocol supports RTU, TCP and ASCII, and implements and uses protocols in embedded systems. However, the transmission I/O devices for RTU, TCP, and ASCII-based protocols may differ. For example, RTU and ASCII communications transmit on a serial-based communication protocol, but in some cases, Ethernet TCP/IP transmission is required. In particular, since the C language (object-oriented) is used in embedded systems, the complexity of source code related to I/O registers increases. In this study, we designed software that can logically separate I/O functions from embedded devices, and designed the execution logic of each instance requiring I/O processing through a delegate class instance with Modbus RTU, TCP, and ASCII protocol generation. We designed and experimented with software that can separate communication I/O processing and logical execution logic for each instance.