• Journal of information and communication convergence engineering
• /
• v.17 no.2
• /
• pp.149-160
• /
• 2019

Web applications typically interact with databases. Therefore, it is very crucial to understand which web components access which database resources when maintaining web apps. Existing research identifies interactions between Java web components, such as JavaServer Pages and servlets but does not extract dependencies between the web components and database resources, such as tables and attributes. This paper proposes a dynamic analysis of Java web apps, which extracts such dependencies from a Java web app and represents them as a graph. The key responsibility of our analysis method is to identify when web components access database resources. To fulfill this responsibility, our method dynamically observes the database-related objects provided in the Java standard library using the proxy pattern, which can be applied to control access to a desired object. This study also experiments with open source web apps to verify the feasibility of the proposed method.

• Journal of Internet Computing and Services
• /
• v.23 no.5
• /
• pp.17-23
• /
• 2022

Network slicing is a promising paradigm and significant evolution for adjusting the heterogeneous services based on different requirements by placing dynamic virtual network functions (VNF) forwarding graph (VNFFG) and orchestrating service function chaining (SFC) based on criticalities of Quality of Service (QoS) classes. In system architecture, software-defined networks (SDN), network functions virtualization (NFV), and edge computing are used to provide resourceful data view, configurable virtual resources, and control interfaces for developing the modified deep reinforcement learning agent (MDRL-A). In this paper, task requests, tolerable delays, and required resources are differentiated for input state observations to identify the non-critical/critical classes, since each user equipment can execute different QoS application services. We design intelligent slicing for handing the cross-domain resource with MDRL-A in solving network problems and eliminating resource usage. The agent interacts with controllers and orchestrators to manage the flow rule installation and physical resource allocation in NFV infrastructure (NFVI) with the proposed formulation of completion time and criticality criteria. Simulation is conducted in SDN/NFV environment and capturing the QoS performances between conventional and MDRL-A approaches.

• Journal of KIISE:Software and Applications
• /
• v.36 no.11
• /
• pp.936-946
• /
• 2009

A graph cuts method has recently attracted a lot of attentions for image segmentation, as it can globally minimize energy functions composed of data term that reflects how each pixel fits into prior information for each class and smoothness term that penalizes discontinuities between neighboring pixels. In previous approaches to graph cuts-based automatic image segmentation, GMM(Gaussian mixture models) is generally used, and means and covariance matrixes calculated by EM algorithm were used as prior information for each cluster. However, it is practicable only for clusters with a hyper-spherical or hyper-ellipsoidal shape, as the cluster was represented based on the covariance matrix centered on the mean. For arbitrary-shaped clusters, this paper proposes graph cuts-based image segmentation using mean shift analysis. As a prior information to estimate the data term, we use the set of mean trajectories toward each mode from initial means randomly selected in $L^*u^*{\upsilon}^*$ color space. Since the mean shift procedure requires many computational times, we transform features in continuous feature space into 3D discrete grid, and use 3D kernel based on the first moment in the grid, which are needed to move the means to modes. In the experiments, we investigate the problems of mean shift-based and normalized cuts-based image segmentation methods that are recently popular methods, and the proposed method showed better performance than previous two methods and graph cuts-based automatic image segmentation using GMM on Berkeley segmentation dataset.

• KIPS Transactions on Software and Data Engineering
• /
• v.1 no.3
• /
• pp.159-168
• /
• 2012

Relation in the new IT environment, such as the SNS, Cloud, Web3.0, has become an important factor. And these relations generate a transaction. However, existing relational database and graph database does not processe graph structure representing the relationships and transactions. This paper, we propose the technique that can be processed concurrently graph structures and transactions in a scalable complex network system. The proposed technique simultaneously save and navigate graph structures and transactions using the Topic Maps data model. Topic Maps is one of ontology language to implement the semantic web(Web 3.0). It has been used as the navigator of the information through the association of the information resources. In this paper, the architecture of the proposed technique was implemented and design using Cassandra - one of column type NoSQL. It is to ensure that can handle up to Big Data-level data using distributed processing. Finally, the experiments showed about the process of storage and query about typical RDBMS Oracle and the proposed technique to the same data source and the same questions. It can show that is expressed by the relationship without the 'join' enough alternative to the role of the RDBMS.

• Journal of dental hygiene science
• /
• v.23 no.4
• /
• pp.320-329
• /
• 2023

Background: Oral frailty has garnered considerable interest following its identification as a risk factor for physical frailty. The Korean oral frailty diagnosis criteria have emphasized the need for extensive research on oral frailty diagnostic items and interventions. Our study performed an in-depth analysis of the tongue-palate pressure patterns in healthy community-dwelling older adults. Methods: Of the 217 older adults aged ≥60 years who visited a senior center in Wonju, 205 participants who completed tongue pressure measurement were included in the final analysis. Pressure changes over time were recorded by instructing the participants to press their tongue against the hard palate with for 7 seconds per cycle. The participants were divided into the normal and abnormal tongue pressure (NTP and ATP, respectively) groups based on whether they achieved the target tongue pressure at least once; tongue pressure patterns were compared between the groups. Furthermore, the average time taken to achieve the standard tongue pressure value was calculated for the participants in the NTP group and used to evaluate the decrease in tongue pressure in the ATP group. Results: Among the 205 participants, 40.5% had ATP. The tongue pressure graph revealed a gentle and consistent incline that was maintained even after achieving standard tongue pressure in the NTP group. The graph was more extreme in the ATP group, and the changes in the pressure type varied across individuals; the tongue pressure was only 48.4%, 40.7%, 31.9%, and 22.6% of the NTP in the participants in their 60s, 70s, 80s, and ≥90s, respectively (p<0.05). Conclusion: Tongue pressure weakness was observed in 40.5% of the healthy community-dwelling older adults. Furthermore, ATP graphs were observed in the patients with tongue pressure weakness. Thus, activities improving the oral function in community-dwelling older adults and systematic oral rehabilitation programs should be devised to promote normal swallowing.

• Journal of KIISE:Software and Applications
• /
• v.32 no.10
• /
• pp.974-983
• /
• 2005

In genetic algorithms with lotus-based encoding, static gene reordering is to locate the highly related genes closely together. It helps the genetic algorithms to create and preserve the schema of high-quality effectively. In this paper, we propose a static reordering framework for linear locus-based encoding. It differs from existing reorderings in that it is independent of problem-specific knowledge. It makes a complete graph where weights represent the interelationship between each pair of genes. And, it transforms the graph into a unweighted sparse graph by choosing the edges having relatively high weight. It finds a gene reordering by graph search method. Through the wide experiments about several problems, the method proposed in this paper shows significant performance improvement as compared with the genetic algorithm that does not rearrange genes.

• School Mathematics
• /
• v.4 no.2
• /
• pp.161-192
• /
• 2002

This paper investigated the teaching and teaming of contents-related graphing in Korean secondary textbooks and suggested the improved methods of graph instruction through this analysis. reification-the case of function, In Harel, G., Dubinsky(Eds.), The Concept of Function : Aspects of Epistemology and Pedagogy Textbooks are analyzed from the viewpoint of the proportion of graphing contents, their sequencing, the proportion of each domain in graphing activities (interpretation vs. construction, quantitative vs. qualitative aspect, local vs. global aspect) and tasks (prediction, translation, scaling), and the difference in the graphing contents between the sixth and the seventh curriculum. This analysis demonstrates that graphing contents are increasing in textbooks, therefore the high school textbooks appear in almost every content area. The graphing activities concentrate on the construction, the quantitative aspects, and the local aspects, and are gradually focusing on the interpretation and global aspects of high school textbooks. Furthermore, most of graphing tasks favor translation. In contrast, the current seventh curriculum includes a balance of interpretation and construction activities and has more global aspects than the sixth curriculum based textbooks; however, the qualitative approach still rarely appears. For the graphing tasks, translation is still prevalent, but the importances of prediction tasks based on graph have increased in comparison with the sixth curriculum textbooks. Further, the seventh curriculum based textbooks are designed to stimulate more dynamic graphing instruction by introducing new tools such as graphing calculators and computer software. We suggest that the qualitative and global aspects should be emphasized in early graph instruction, a variety of graph activities in realistic contexts should be performed, and educational technology such as graphing calculator and computer can be efficient to implement these ideas.

• Journal of KIISE:Software and Applications
• /
• v.34 no.1
• /
• pp.52-58
• /
• 2007

In this paper we propose a new robust method to extract accurate human silhouettes indoors with active stereo camera. A prime application is for gesture recognition of mobile robots. The segmentation of distant moving objects includes many problems such as low resolution, shadows, poor stereo matching information and instabilities of the object and background color distributions. There are many object segmentation methods based on color or stereo information but they alone are prone to failure. Here efficient color, stereo and image segmentation methods are fused to infer object and background areas of high confidence. Then the inferred areas are incorporated in graph cut to make human silhouette extraction robust and accurate. Some experimental results are presented with image sequences taken using pan-tilt stereo camera. Our proposed algorithms are evaluated with respect to ground truth data and proved to outperform some methods based on either color/stereo or color/contrast alone.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.10
• /
• pp.4703-4723
• /
• 2018

In recent years, dense small cell network has been deployed to address the challenge that has resulted from the unprecendented growth of mobile data traffic and users. It has proven to be a cost efficeient solution to offload traffic from macro-cells. Software defined heterogeneous wireless network can decouple the control plane from the data plane. The control signal goes through the macro-cell while the data traffic can be offloaded by small cells. In this paper, we propose a framework for cell virtualization and user association in order to satisfy versatile requirements of multiple tenants. In the proposed framework, we propose an interference graph partioning based virtual-cell association and customized physical-cell association for multi-homed users in a software defined small cell network. The proposed user association scheme includes 3 steps: initialization, virtual-cell association and physical-cell association. Simulation results show that the proposed virtual-cell association outperforms the other schemes. For physical-cell association, the results on resource utilization and user fairness are examined for mobile users and infrastructure providers.

• The KIPS Transactions:PartD
• /
• v.10D no.6
• /
• pp.999-1010
• /
• 2003

Program slicing is s method to extract the statements from the program which have an influence on the value of a variable at a paricular point of the program. Program slicing is applied for many applications, such as program degugging, program testing, program integration, parallel program execution, software metrics, reverse engineering, and software maintenance, etc. This paper is the study to create the exact slice in the presence of Object Reference State Graph to generate more exactly static analysis information of objects in the program of the presence of complicated data structure.