• Journal of Internet Computing and Services
• /
• v.25 no.4
• /
• pp.7-21
• /
• 2024

There are various machine learning techniques such as Reinforcement Learning, Deep Learning, Neural Network Learning, and so on. In recent, Large Language Models (LLMs) are popularly used for Generative AI based on Reinforcement Learning. It makes decisions with the most optimal rewards through the fine tuning process in a particular situation. Unfortunately, LLMs can not provide any explanation for how they reach the goal because the training is based on learning of black-box AI. Reinforcement Learning as black-box AI is based on graph-evolving structure for deriving enhanced solution through adjustment by human feedback or reinforced data. In this research, for mutually exclusive decision-making, Mutually Exclusive Learning (MEL) is proposed to provide explanations of the chosen goals that are achieved by a decision on both ends with specified conditions. In MEL, decision-making process is based on the tree-based structure that can provide processes of pruning branches that are used as explanations of how to achieve the goals. The goal can be reached by trade-off among mutually exclusive alternatives according to the specific contextual conditions. Therefore, the tree-based structure is adopted to provide feasible solutions with the explanations based on the pruning branches. The sequence of pruning processes can be used to provide the explanations of the inferences and ways to reach the goals, as Explainable AI (XAI). The learning process is based on the pruning branches according to the multi-dimensional contextual conditions. To deep-dive the search, they are composed of time window to determine the temporal perspective, depth of phases for lookahead and decision criteria to prune branches. The goal depends on the policy of the pruning branches, which can be dynamically changed by configured situation with the specific multi-dimensional contextual conditions at a particular moment. The explanation is represented by the chosen episode among the decision alternatives according to configured situations. In this research, MEL adopts the tree-based learning model to provide explanation for the goal derived with specific conditions. Therefore, as an example of mutually exclusive problems, employment process is proposed to demonstrate the decision-making process of how to reach the goal and explanation by the pruning branches. Finally, further study is discussed to verify the effectiveness of MEL with experiments.

• Health Policy and Management
• /
• v.34 no.3
• /
• pp.226-237
• /
• 2024

This paper reviewed on understanding the disease network model which represents the relationships, such as risks, pathways, and progression trajectories, among various diseases. By utilizing the disease network models, it visualized the trajectories paths of diseases over time and captured potential relationships between diseases that were previously undiscovered, thereby providing novel insights. This study introduced research cases of disease networks using various domestic and international healthcare data based on graph theory and network models, reviewed the methodologies and applications for constructing disease networks, and suggested the potential for their application in health insurance big data. The paper also discussed the limitations of disease network research and proposed future research directions.

• Journal of Intelligence and Information Systems
• /
• v.18 no.3
• /
• pp.97-117
• /
• 2012

Nowadays, Internet users tend to do a variety of actions at the same time such as web browsing, social networking and multimedia consumption. While watching a video, once a user is interested in any product, the user has to do information searches to get to know more about the product. With a conventional approach, user has to search it separately with search engines like Bing or Google, which might be inconvenient and time-consuming. For this reason, a video annotation platform has been developed in order to provide users more convenient and more interactive ways with video content. In the future of smart TV environment, users can follow annotated information, for example, a link to a vendor to buy the product of interest. It is even better to enable users to search for information by directly discussing with friends. Users can effectively get useful and relevant information about the product from friends who share common interests or might have experienced it before, which is more reliable than the results from search engines. Social networking services provide an appropriate environment for people to share products so that they can show new things to their friends and to share their personal experiences on any specific product. Meanwhile, they can also absorb the most relevant information about the product that they are interested in by either comments or discussion amongst friends. However, within a very huge graph of friends, determining the most appropriate persons to ask for information about a specific product has still a limitation within the existing conventional approach. Once users want to share or discuss a product, they simply share it to all friends as new feeds. This means a newly posted article is blindly spread to all friends without considering their background interests or knowledge. In this way, the number of responses back will be huge. Users cannot easily absorb the relevant and useful responses from friends, since they are from various fields of interest and knowledge. In order to overcome this limitation, we propose a method to filter a user's friends for information search, which leverages semantic video annotation and social networking services. Our method filters and brings out who can give user useful information about a specific product. By examining the existing Facebook information regarding users and their social graph, we construct a user profile of product interest. With user's permission and authentication, user's particular activities are enriched with the domain-specific ontology such as GoodRelations and BestBuy Data sources. Besides, we assume that the object in the video is already annotated using Linked Data. Thus, the detail information of the product that user would like to ask for more information is retrieved via product URI. Our system calculates the similarities among them in order to identify the most suitable friends for seeking information about the mentioned product. The system filters a user's friends according to their score which tells the order of whom can highly likely give the user useful information about a specific product of interest. We have conducted an experiment with a group of respondents in order to verify and evaluate our system. First, the user profile accuracy evaluation is conducted to demonstrate how much our system constructed user profile of product interest represents user's interest correctly. Then, the evaluation on filtering method is made by inspecting the ranked results with human judgment. The results show that our method works effectively and efficiently in filtering. Our system fulfills user needs by supporting user to select appropriate friends for seeking useful information about a specific product that user is curious about. As a result, it helps to influence and convince user in purchase decisions.

• Journal of the Korean Society of Radiology
• /
• v.12 no.6
• /
• pp.755-762
• /
• 2018

The purpose of this study was to compare the FA(faractional anisotropy) and ADC(apparent diffusion coefficient) values, which were derived from diffusion tensor imaging in breast cancer patients. The diffusion gradient used in this study was derived from quantitative diffusion indices using 20 directions(b-value, 0 and $1,000s/mm^2$). Quantitative analysis was analyzed using Pearson's correction and qualitative analysis using for correction coefficients. As a result, $FA_{min}$, $FA_{mean}$ and $FA_{max}$ were $0.098{\pm}0.065$, $0.302{\pm}0.142$ and $0.634{\pm}0.236$, respectively(p > 0.05). The $ADC_{min}$, $ADC_{mean}$ and $ADC_{max}$ were $0.741{\pm}0.403$, $1.095{\pm}0.394$ and $1.530{\pm}0.447$, respectively(p > 0.05). The $FA_{min}$, $FA_{mean}$, and $FA_{max}$ mean values were $0.132{\pm}0.050$, $0.418{\pm}0.094$, and $0.770{\pm}0.164$ for Category 6 and Kinetic Curve Pattern III, respectively. $ADC_{min}$, $ADC_{mean}$, and $ADC_{max}$ were $0.753{\pm}0.189$, $1.120{\pm}0.236$, and $1.615{\pm}0.372$, respectively. Quantitative analysis showed negative correlation between $ADC_{mean}-FA_{mean}$ and $ADC_{max}-FA_{max}$(p = 0.001, 0.003). The qalitative analysis showed ADC 0.628(p = 0.001), FA 0.620(p = 0.001) in the internal evaluations, ADC 0.677(p = 0.001), FA 0.695(p = 0.001) in external evaluations. In conclusion, based on the morphological examination, time to signal intensity graph is the form of wash-out(pattern III) in the dynamic contrast enhance examination, As a result, the $ADC_{mean}$ $1.120{\pm}0.236$ and $FA_{mean}$ values were $0.032{\pm}0.142$ with a negative correlation (Y=1.44-1.12X). Therefore, If we understand the shape of time to signal intensity graph and the relationship between ADC and FA, It will be a criterion for distinguishing malignant diseases in breast cancer.

• Radiation Oncology Journal
• /
• v.9 no.1
• /
• pp.1-6
• /
• 1991

The effect of 2-deoxy-d-glucose (2-DDG) on $C_3H$ mouse fibrosarcoma(FSall) was studied. Metabolic status, especially for energy metabolism, was studied using in vivo $^{31}P$-MRS, proliferative capacity was observed on flow cytometry(FC) and growth rate was measured after transplantation of $10^6$ viable tumor cells in the dorsum of foot of $C_3Hf/Sed$ mice. One gram of 2-DDG Per kg of body weight was injected intraperitoneally on 12th day of implantation. Average tumor size on 12th day of implantion was $250mm^3$. Growth rate of Fsall tumor was measured by tumor doubling time and slope on semilog plot. After 2-DDG injection, growth rate slowed down. Tumor doubling time between tumor age 5-12 days was 0.84 days with slope 0.828 and tumor doubling time between tumor age 13-28 days was 3.2 days with slope 0.218 in control group. After 2-DDG injection, tumor doubling time was elongated to 5.1 days with slope 0.136. The effect of 2-DDG studied in vivo $^{31}P$-MRS suggested that the increase of phosphomonoester (PME) and inorganic phosphate (Pi) by increasing size of tumor, slowed down after 2-DDG injection. Flow cytometry showed significantly increased S-phase and $G_2+M$ phase fraction suggesting increased proliferative capacity of tumor cells in the presence of 2-DDG. Authors observed an interesting effect of 2-DDG on FSall tumor and attempt to utilize as an adjunct for radiotherapy.

• The Journal of the Korea Contents Association
• /
• v.18 no.4
• /
• pp.480-494
• /
• 2018

The purpose of this study is to develop a nursing activity cost calculation program based on Lee's doctoral dissertation using TD-ABC. The developed program has been supplemented with data storage, print out, and graph conversion functions to expand the application possibility. The development of the program consisted of three steps: program requirements analysis, program design and development, and program validation. This program was designed not only to do the cost calculation, but also to compare the cost-effectiveness and cost consumption trends. Consequently, this program is meaningful in that the nursing manager can obtain the cost information necessary for nursing unit management and extend the utilization so that the cost management strategy can be established based on the cost information. Therefore, we propose that the cost-management capacity of clinical nurses should be strengthened and the nursing performance measurement research should be expanded by applying it to various actual clinical nursing management settings. It is suggested that this program should be used as a training medium to strengthen nurse cost management capacity by combining nursing management curriculum at undergraduate level.

• Journal of the Korean Institute of Telematics and Electronics C
• /
• v.36C no.10
• /
• pp.17-28
• /
• 1999

In this paper, an ASIC emulation system called ACE (ASIC Emulator) is proposed. It can produce the prototype of target ASIC in a short time and verify the function of ASIC circuit immediately The ACE is consist of emulation software in which there are EDIF reader, library translator, technology mapper, circuit partitioner and LDF generator and emulation hardware including emulation board and logic analyzer. Technology mapping is consist of three steps such as circuit partitioning and extraction of logic function, minimization of logic function and grouping of logic function. During those procedures, the number of basic logic blocks and maximum levels are minimized by making the output to be assigned in a same block sharing product-terms and input variables as much as possible. Circuit partitioner obtain chip-level netlists satisfying some constraints on routing structure of emulation board as well as the architecture of FPGA chip. A new partitioning algorithm whose objective function is the minimization of the number of interconnections among FPGA chips and among group of FPGA chips is proposed. The routing structure of emulation board take the advantage of complete graph and partial crossbar structure in order to minimize the interconnection delay between FPGA chips regardless of circuit size. logic analyzer display the waveform of probing signal on PC monitor that is designated by user. In order to evaluate the performance of the proposed emulation system, video Quad-splitter, one of the commercial ASIC, is implemented on the emulation board. Experimental results show that it is operated in the real time of 14.3MHz and functioned perfectly.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.12 no.5
• /
• pp.129-139
• /
• 2012

Given digraph network $D=(N,A),n{\in}N,a=c(u,v){\in}A$ with source s and sink t, the maximum flow from s to t is determined by cut (S, T) that splits N to $s{\in}S$ and $t{\in}T$ disjoint sets with minimum cut value. The Ford-Fulkerson (F-F) algorithm with time complexity $O(NA^2)$ has been well known to this problem. The F-F algorithm finds all possible augmenting paths from s to t with residual capacity arcs and determines bottleneck arc that has a minimum residual capacity among the paths. After completion of algorithm, you should be determine the minimum cut by combination of bottleneck arcs. This paper suggests maximum adjacency merging and compute cut value method is called by MA-merging algorithm. We start the initial value to S={s}, T={t}, Then we select the maximum capacity $_{max}c(u,v)$ in the graph and merge to adjacent set S or T. Finally, we compute cut value of S or T. This algorithm runs n-1 times. We experiment Ford-Fulkerson and MA-merging algorithm for various 8 digraph. As a results, MA-merging algorithm can be finds minimum cut during the n-1 running times with time complexity O(N).

• Journal of the Institute of Electronics and Information Engineers
• /
• v.52 no.3
• /
• pp.116-126
• /
• 2015

In a distributed heterogeneous computing system, the performance of a parallel application greatly depends on its task scheduling algorithm. Therefore, in order to improve the performance, it is essential to consider some factors that can have effect on the performance of the parallel application in a given environment. One of the most important factors that affects the total execution time is a critical path. In this paper, we propose the CLTS algorithm for a task scheduling. The CLTS sets the priorities of all nodes to improve overall performance by applying leveling method to improve parallelism of task execution and by reducing the delay caused by waiting for execution of critical nodes in priority phase. After that, it conditionally uses insertion based policy or duplication based policy in processor allocation phase to reduce total schedule time. To evaluate the performance of the CLTS, we compared the CLTS with the DCPD and the HCPFD in our simulation. The results of the simulations show that the CLTS is better than the HCPFD by 7.29% and the DCPD by 8.93%. with respect to the average SLR, and also better than the HCPFD by 9.21% and the DCPD by 7.66% with respect to the average speedup.

• The KIPS Transactions:PartD
• /
• v.12D no.1 s.97
• /
• pp.165-178
• /
• 2005

A product classification scheme is the foundation on which product databases are designed, and plays a central role in almost all aspects of management and use of product information. It needs to meet diverse user views to support efficient and convenient use of product information. It needs to be changed and evolved very often without breaking consistency in the cases of introduction of new products, extinction of existing products, class reorganization, and class specialization. It also needs to be merged and mapped with other classification schemes without information loss when B2B transactions occur. For these requirements, a classification scheme should be so dynamic that it takes in them within right time and cost. The existing classification schemes widely used today such as UNSPSC and eCl@ss, however, have a lot of limitations to meet these requirements for dynamic features of classification. Product information implies a plenty of semantics such as class attributes like material, time, place, etc., and integrity constraints. In this Paper, we analyze the dynamic features of product databases and the limitation of existing code based classification schemes, and describe the semantic classification model proposed in [1], which satisfies the requirements for dynamic features of product databases. It provides a means to explicitly and formally express more semantics for product classes and organizes class relationships into a graph.