• Journal of Korean Society of Archives and Records Management
• /
• v.16 no.1
• /
• pp.195-221
• /
• 2016

In a situation where the recognition of archival services remains minimal, an evaluation of archival information services by users could provide a better understanding of users' practical needs and present helpful information for improved services. A service evaluation by users using questionnaires was conducted in university archives, which can similarly categorize their user groups and have frequent interactions with the users for the provision of services. Questionnaires suitable for the evaluation of university archives were developed based on the review of the evaluation tools in archival information services. From April to October 2015, 113 users' evaluation results were collected from 13 university archives. As a result of goodness of fit tests, the users' service evaluation items were categorized into four parts: Use Results, Provision of Information on Archives, Accessibility to Archives, and Interaction. For those four parts, evaluation by descriptive statistics, T-test, correlation analysis, and regression analysis were conducted. Users evaluated Interaction parts highly while they were less satisfied with Provision of Information on Archives. T-test results showed that university archives with search engines and with electronic records management systems were evaluated higher than archives without such technology. In the regression analysis, the Interaction and Provision of Information on Archives parts were found to have an influence on the Use Results part.

• Food Science and Preservation
• /
• v.15 no.3
• /
• pp.456-460
• /
• 2008

Santalum album has been used as a folk medicine for treatment of skin diseases, inflammation, gonorrhea, gleet, and cystitis in India and other Asian countries. In a search for possible bioactive agents from natural sources, we found that the various solvent extracts of S. album showed significant antioxidative effect in 1,1-diphenyl-2-picrylhydrazyl (DPPH) radical scavenging activity test and moderate other biological functions submitted to the several bioassay systems for whitening and cytotoxicity evaluations. Among the tested extracts displayed DPPH radical scavenging activity, and the 70% acetone extract showed the most potent activity with an $IC_{50}$ value of $18.6\;{\mu}g/ml$, more potent than a positive control, L-ascorbic acid ($IC_{50}$, $28.7\;{\mu}g/mL$). Also, anti-lipid peroxidation, tyrosinase inhibitory, and cytotoxic effects were determined in each experiment. Total phenolic content of 70% acetone extract was found to be 117.1 mg equivalent of gallic acid per g of extract. Previous phytochemical investigation reveals the presence of phenolic compounds. The results indicate that S. album possess potential antioxidant activity and phenolic constituents are responsible for this capacity.

• Journal of Intelligence and Information Systems
• /
• v.9 no.3
• /
• pp.155-175
• /
• 2003

In context of e-commerce, negotiation is a procedure to help negotiate between buyer and seller by adjusting their negotiation issues such as price and in terms of payment. We used intelligent agent and mobile device to promote new framework of e-commerce. Moreover, this framework can help buyers and sellers to carry their commercial transactions effectively. In regard to that issue, we need to carry out the research of negotiation agent that can be used in e-commerce fields. In this paper, we modeled the negotiation using CSP for the performance of agent in m-commerce environment. Furthermore we implemented interface for mobile device to extract buyer's requirement and preference easily Besides that we used utility function to make a decision for various evaluation functions and suggestions that are used for evaluation of negotiation issues. A difficulty of generating offer is dependent on the number of negotiation issues and the range of the values. Therefore, if any offer has a number of negotiation issues and the range of values are wide, the search space will be exponentially expanded. There have been many studies fur solving this problem, we applied those techniques to improve the agent's ability of negotiation. For example, a contract can be accomplished by exchanging seller and buyer's offer that is generated by agent to adjust the requisite profit for each party. Finally, we show the improvement of satisfaction as the negotiation is processed.

• Journal of Intelligence and Information Systems
• /
• v.15 no.2
• /
• pp.33-48
• /
• 2009

Capsule endoscopy is one of the most remarkable inventions in last ten years. Causing less pain for patients, diagnosis for entire digestive system has been considered as a most convenience method over a normal endoscope. However, it is known that the diagnosis process typically requires very long inspection time for clinical experts because of considerably many duplicate images of same areas in human digestive system due to uncontrollable movement of a capsule endoscope. In this paper, we propose a method for clinical diagnosticians to get highly valuable information from capsule-endoscopy video. Our software system consists of three global maps, such as movement map, characteristic map, and brightness map, in temporal domain for entire sequence of the input video. The movement map can be used for effectively removing duplicated adjacent images. The characteristic and brightness maps provide frame content analyses that can be quickly used for segmenting regions or locating some features(such as blood) in the stream. Our experiments show the results of four patients having different health conditions. The result maps clearly capture the movements and characteristics from the image frames. Our method may help the diagnosticians quickly search the locations of lesion, bleeding, or some other interesting areas.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.42 no.3
• /
• pp.639-648
• /
• 2017

Electronic warfare systems for extracting information of the threat signals can be employed under the circumstance where the power of the received signal is weak. To precisely and rapidly detect the threat signals, it is required to use methods exploiting whole energy of the received signals instead of conventional methods using a single received signal input. To utilize the whole energy, numerous sizes of windows need to be implemented in a detector for dealing with all possible unknown length of the received signal because it is assumed that there is no preliminary information of the uncooperative signals. However, this grid search method requires too large computational complexity to be practically implemented. In order to resolve this complexity problem, an approach that reduces the number of windows by selecting the smaller number of representative windows can be considered. However, each representative window in this approach needs to cover a certain amount of interval divided from the considering range. Consequently, the discordance between the length of the received signal and the window sizes results in degradation of the detection performance. Therefore, we propose the weighted energy detector which results in improved detection performance comparing with the conventional energy detector under circumstance where the window size is smaller than the length of the received signal. In addition, it is shown that the proposed method exhibits the same performance under other circumstances.

• KIPS Transactions on Computer and Communication Systems
• /
• v.7 no.8
• /
• pp.195-202
• /
• 2018

With the development of location-based applications such as smart phones and GPS navigation, active research is being conducted to protect location and trajectory privacy. To receive location-related services, users must disclose their exact location to the server. However, disclosure of users' location exposes not only their locations but also their trajectory to the server, which can lead to concerns of privacy violation. Furthermore, users request from the server not only location information but also multimedia information (photographs, reviews, etc. of the location), and this increases the processing cost of the server and the information to be received by the user. To solve these problems, this study proposes the EGTC (Enhanced Grid-based Trajectory Cloaking) technique. As with the existing GTC (Grid-based Trajectory Cloaking) technique, EGTC method divides the user trajectory into grids at the user privacy level (UPL) and creates a cloaking region in which a random query sequence is determined. In the next step, the necessary information is received as index by considering the sub-grid cell corresponding to the path through which the user wishes to move as c(x,y). The proposed method ensures the trajectory privacy as with the existing GTC method while reducing the amount of information the user must listen to. The excellence of the proposed method has been proven through experimental results.

• KIPS Transactions on Computer and Communication Systems
• /
• v.7 no.9
• /
• pp.219-226
• /
• 2018

One of the systematic ways to generate the number of all cases is a combination to construct a combination tree, and its time complexity is O($2^n$). A combination tree is used for various purposes such as the graph homogeneity problem, the initial model for calculating frequent item sets, and so on. However, algorithms that must search the number of all cases of a combination are difficult to use realistically due to high time complexity. Nevertheless, as the amount of data becomes large and various studies are being carried out to utilize the data, the number of cases of searching all cases is increasing. Recently, as the GPU environment becomes popular and can be easily accessed, various attempts have been made to reduce time by parallelizing algorithms having high time complexity in a serial environment. Because the method of generating the number of all cases in combination is sequential and the size of sub-task is biased, it is not suitable for parallel implementation. The efficiency of parallel algorithms can be maximized when all threads have tasks with similar size. In this paper, we propose a method to efficiently collaborate between CPU and GPU to parallelize the problem of finding the number of all cases. In order to evaluate the performance of the proposed algorithm, we analyze the time complexity in the theoretical aspect, and compare the experimental time of the proposed algorithm with other algorithms in CPU and GPU environment. Experimental results show that the proposed CPU and GPU collaboration algorithm maintains a balance between the execution time of the CPU and GPU compared to the previous algorithms, and the execution time is improved remarkable as the number of elements increases.

• Journal of Intelligence and Information Systems
• /
• v.14 no.1
• /
• pp.117-129
• /
• 2008

The cost-based scheduling work has been done in both the Operations Research (OR) and Artificial Intelligence (AI) literature. To deal with more realistic problems, AI-based heuristic scheduling approach with non-regular performance measures has been studied. However, there has been little research effort to develop a full inter-job cost propagation algorithm (CPA) for different jobs having multiple downstream and upstream activities. Without such a CPA, decision-making in scheduling heuristics relies upon local, incomplete cost information, resulting in poor schedule performance from the overall cost minimizing objective. For such a purpose, we need two types of CPAs : intra-job CPA and inter-job CPA. Whenever there is a change in cost information of an activity in a job in the process of scheduling, the intra-job CPA updates cost curves of other activities connected through temporal constraints within the same job. The inter-job CPA extends cost propagation into other jobs connected through precedence relationships. By utilizing the cost information provided by CPAs, we propose cost-based scheduling heuristics that attempt to minimize the total schedule cost. This paper develops inter-job CPAs that create and update cost curves of each activity in each search state, and propagate cost information throughout a whole network of temporal constraints. Also we propose various cost-based scheduling heuristics that attempt to minimize the total schedule cost by utilizing the cost propagation algorithm.

• Journal of the Korean Institute of Landscape Architecture International Edition
• /
• no.2
• /
• pp.81-87
• /
• 2004

The objective of our research was an international comparison focusing on studies conducted on parks and green spaces undertaken in Japan and Korea. We also aim to clarify the similarities and differences between the two countries and consider the key features of the researches on the field of landscape architecture. We compared the recent trends of Japanese institute with Korean observed in the theme of research papers adopt title of them. The research period spanned approximately twenty years, from 1980 to 2003. We employed the Table of Contents information search system to research academic journal articles and to select the journals that included articles with the key words [park(s)] or [green space(s)] in their title. We chronologically arranged the journals for each country, based on the total number of journals and classification categories. We then conducted a comparative examination among the two countries. We also contributed information on the circumstances behind the formulation or amendment of some policies and laws and we checked the results against the research trend. Among the selected journals, the number of papers was the highest by the Institute of Landscape Architecture. But the reason for increase of the number of papers on green spaces in Japanese journals was not published by the Institute of Landscape Architecture but by the City Planning Institute and the Architecture Institute. In Japan, the papers on parks categorized under historical study were the highest among all categories. On the other hand, in Korean journals, papers on parks categorized under historical study were few. A similar trend was recognized in papers on green spaces. Every society is concerned with the study of function and effect. However, some exact differences have been observed by category classification. In Japan, the percentage of function and effect papers on parks was less than those on green spaces. In Korea, both percentages for these groups were high. The category of system and policy accounted for $17\%$ of the papers on green spaces in Korea. This result was higher than the number of papers on green spaces and parks in Japan and parks in Korea. Recently, the number of papers focusing on large-scale green space system has decreased in Japan. The trend in the study of parks and green spaces on a regional scale or at an individual level will be closely monitored. Systems and modeling studies have been focusing in Korea. The understanding between the administration and the citizens was peculiar to each country.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.18 no.8
• /
• pp.2043-2050
• /
• 2014

As most the scanning systems developed until now provide radiation scan plane images of the inspected objects, there has been a limitation in judging exactly the shape of the objects inside a logistics container exactly with only 2-D radiation image information. As a radiation image is just the density information of the scanned object, the direct application of general stereo image processing techniques is inefficient. So we propose that a new volume-based 3-D reconstruction algorithm. Experimental results show the proposed new volume based reconstruction technique can provide more efficient visualization for X-ray inspection. For validation of the proposed shape reconstruction algorithm using volume, 15 samples were scanned and reconstructed to restore the shape using an X-ray stereo inspection system. Reconstruction results of the objects show a high degree of accuracy compared to the width (2.56%), height (6.15%) and depth (7.12%) of the measured value for a real object respectively. In addition, using a K-Mean clustering algorithm a detection efficiency of 97% is achieved. The results of the reconstructed shape information using the volume based shape reconstruction algorithm provide the depth information of the inspected object with stereo X-ray inspection. Depth information used as an identifier for an automated search is possible and additional studies will proceed to retrieve an X-ray inspection system that can greatly improve the efficiency of an inspection.