• Title/Summary/Keyword: park attributes

Search Result 988, Processing Time 0.029 seconds

The Design for Security System of Linux Operating System (리눅스 운영체제를 위한 보안 시스템 설계)

  • Park, JinSeok;Kim, SoonGohn
    • The Journal of Korea Institute of Information, Electronics, and Communication Technology
    • /
    • v.3 no.4
    • /
    • pp.35-42
    • /
    • 2010
  • This paper reviews the current studies about the current secure OS, security module and SELinux, and suggests Linux access control module that uses the user discriminating authentication, security authority inheritance of subjects and objects, reference monitor and MAC class process and real-time audit trailing using DB. First, during the user authentication process, it distinguishes the access permission IP and separates the superuser(root)'s authority from that of the security manager by making the users input the security level and the protection category. Second, when the subjects have access to the objects through security authority inheritance of subjects and objects, the suggested system carries out the access control by comparing the security information of the subjects with that of the objects. Third, this system implements a Reference Monitor audit on every current events happening in the kernel. As it decides the access permission after checking the current MAC security attributes, it can block any malicious intrusion in advance. Fourth, through the real-time audit trailing system, it detects all activities in the operating system, records them in the database and offers the security manager with the related security audit data in real-time.

  • PDF

Non-hierarchical Clustering based Hybrid Recommendation using Context Knowledge (상황 지식을 이용한 비계층적 군집 기반 하이브리드 추천)

  • Baek, Ji-Won;Kim, Min-Jeong;Park, Roy C.;Jung, Hoill;Chung, Kyungyong
    • Journal of the Institute of Convergence Signal Processing
    • /
    • v.20 no.3
    • /
    • pp.138-144
    • /
    • 2019
  • In a modern society, people are concerned seriously about their travel destinations depending on time, economic problem. In this paper, we propose an non-hierarchical clustering based hybrid recommendation using context knowledge. The proposed method is personalized way of recommended knowledge about preferred travel places according to the user's location, place, and weather. Based on 14 attributes from the data collected through the survey, users with similar characteristics are grouped using a non-hierarchical clustering based hybrid recommendation. This makes more accurate recommendation by weighting implicit and explicit data. The users can be recommended a preferred travel destination without spending unnecessary time. The performance evaluation uses accuracy, recall, F-measure. The evaluation result was shown 0.636 accuracy, 0.723 recall, and 0.676 F-measure.

Deriving Local Association Rules by User Segmentation (사용자 구분에 의한 지역적 연관규칙의 유도)

  • Park, Se-Il;Lee, Soo-Wun
    • Journal of KIISE:Software and Applications
    • /
    • v.29 no.1_2
    • /
    • pp.53-64
    • /
    • 2002
  • Association rule discovery is a method that detects associative relationships between items or attributes in transactions. It is one of the most widely studied problems in data mining because it offers useful insight into the types of dependencies that exist in a data set. However, most studies on association rule discovery have the drawback that they can not discover association rules among user groups that have common characteristics. To solve this problem, we segment the set of users into user-subgroups by using feature selection and the user segmentation, thus local association rules in user-subgroup can be discovered. To evaluate that the local association rules are more appropriated than the global association rules in each user-subgroup, derived local association rules are compared with global association rules in terms of several evaluation measures.

Personalized and Social Search by Finding User Similarity based on Social Networks (소셜 네트워크 기반 사용자 유사성 발견을 통한 개인화 및 소셜 검색)

  • Park, Gun-Woo;Oh, Jung-Woon;Lee, Sang-Hoon
    • The KIPS Transactions:PartD
    • /
    • v.16D no.5
    • /
    • pp.683-690
    • /
    • 2009
  • Social Networks which is composed of network with an individual in the center in a web support mutual-understanding of information by searching user profile and forming new link. Therefore, if we apply the Social Network which consists of web users who have similar immanent information to web search, we can improve efficiency of web search and satisfaction of web user about search results. In this paper, first, we make a Social Network using web users linked directly or indirectly. Next, we calculate Similarity among web users using their immanent information according to topics, and then reconstruct Social Network based on varying Similarity according to topics. Last, we compare Similarity with Search Pattern. As a result of this test, we can confirm a result that among users who have high relationship index, that is, who have strong link strength according to personal attributes have similar search pattern. If such fact is applied to search algorithm, it can be possible to improve search efficiency and reliability in personalized and social search.

Multi-Dimensional Traveling Salesman Problem Scheme Using Top-n Skyline Query (Top-n 스카이라인 질의를 이용한 다차원 외판원 순회문제 기법)

  • Jin, ChangGyun;Oh, Dukshin;Kim, Jongwan
    • KIPS Transactions on Software and Data Engineering
    • /
    • v.9 no.1
    • /
    • pp.17-24
    • /
    • 2020
  • The traveling salesman problem is an algorithmic problem tasked with finding the shortest route that a salesman visits, visiting each city and returning to the started city. Due to the exponential time complexity of TSP, it's hard to implement on cases like amusement park or delivery. Also, TSP is hard to meet user's demand that is associated with multi-dimensional attributes like travel time, interests, waiting time because it uses only one attribute - distance between nodes. This paper proposed Top-n Skyline-Multi Dimension TSP to resolve formerly adverted problems. The proposed algorithm finds the shortest route faster than the existing method by decreasing the number of operations, selecting multi-dimensional nodes according to the dominance of skyline. In the simulation, we compared computation time of dynamic programming algorithm to the proposed a TS-MDT algorithm, and it showed that TS-MDT was faster than dynamic programming algorithm.

Design and Application of XTML Script Language based on XML (XML을 이용한 스크립트 언어 XTML 의 설계 및 응용)

  • Jeong, Byeong-Hui;Park, Jin-U;Lee, Su-Yeon
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.5 no.6
    • /
    • pp.816-833
    • /
    • 1999
  • 스타일 정보를 중심으로 하는 기존의 워드 프로세서의 출력 문서들을 차세대 인터넷 문서인 XML문서방식에 따라서 표기하고 또한 제목, 초록, 장 및 단락 등과 같은 논리적인 구조를 반영할 수 있도록 구조화함으로써 문서들의 상호교환뿐만 아니라 인터넷에서 유효하게 사용할 수가 있다. 본 논문에서는 스타일 또는 표현 속성 중심으로 하는 다양한 문서의 평면 구조를 XML의 계층적인 논리적인 구조로, 또한 다양한 DTD(Document Type Definition)환경하에서 변경시킬 수가 있는 변환 스크립트 언어를 표현할 수 있도록 하기 위하여 XTML(XML Transformation Markup Language)을 DTD형식으로 정의하고 이를 이용하여 변환 스크립트를 작성하였으며 자동태깅에 적용하여 보았다.XTML은 그 인스턴스에 해당하는 변환 알고리즘의 효과적인 수행을 위하여 즉 기존의 XML문서를 효과적으로 다루기 위하여 문서를 GROVE라는 트리 구조로 만들어 저장하고 또한 이를 조작할 수 있는 기능 및 다양한 명령어 인터페이스를 제공하였다. Abstract Output documents of existing word processors based on style informations or presentation attributes can be structured by converting them into XML(Extensible Markup Language) documents based on hierarchically logical structures such as title, abstract, chapter and so on. If so, it can be very useful to interchange and manipulate documents under Internet environment. The conversion need the complicate process calling auto-tagging by which elements of output documents can be inferred from style informations and sequences of text etc, and which is different from various kinds of simple conversion.In this paper, we defined XTML(XML Transformation Markup Language) of DTD(Document Type Definition) form and also defined the script language as instances of its DTD for the auto-tagging. XTML and its DTD are represented in XML syntax.Especially XTML includes various functions and commands to generate tree structure named as "GROVE" and also to process, store and manipulate the GROVE in order to process efficiently XML documents.documents.

Partition and Caching Mechanism for GML Visualization on Mobile Device (모바일 디바이스에서 GML 가시화를 위한 분할 및 캐싱 기법)

  • Song, Eun-Ha;Park, Yong-Jin;Han, Won-Hee;Jeong, Young-Sik
    • Journal of Korea Multimedia Society
    • /
    • v.11 no.7
    • /
    • pp.1025-1034
    • /
    • 2008
  • In this paper, we developed GridGML for efficiently supplying a GML and visualizing the map with partitioning map and caching method to a mobile device. In order to overcome the weighting of a file, which is the biggest weakness of a GML, GridGML extracts only the most necessary parts for the visualization of the map among GML attributes, and makes the file light as a class instance by applying an offset value. GridGML manages a partition based on the visualization area of a mobile device to visualize the map to a mobile device in real time, and transmits the partition area by serializing it for the benefit of transmission. Also, the received partition area is compounded in a mobile device and is visualized by being partitioned again as four visible areas based on the display of a mobile device. Then, the area is managed by applying a caching algorithm in consideration of repetitiveness for a received map for the efficient operation of resources. Also, in order to prevent the delay in transmission time as regards the instance density area of the map, an adaptive map partition mechanism is proposed for maintaining the transmission time uniformly.

  • PDF

Preparation and Quality Properties of Fish Paste Containing Styela plicata (오만둥이 함유 어묵의 제조 및 품질 특성)

  • Park, Sun-Min;Seo, Hye-Kyung;Lee, Seung-Cheol
    • Journal of the Korean Society of Food Science and Nutrition
    • /
    • v.35 no.9
    • /
    • pp.1256-1260
    • /
    • 2006
  • To provide functional properties in fish paste, Styela plicata (Korean name: omandungi) having antioxidant and anticarcinogenic activity was added at 0, 5, 10, 15, and 20%. The fried fish pastes were investigated for color, textural properties, and sensory attributes. Fish paste containing 15% S. plicata showed the lowest values in lightness (L) and the highest values in redness (a) and yellowness (b). All test samples with 3 mm thickness had good flexibility and did not break even after folding 4 times. Fish paste containing 20% S. plicata showed the highest values in strength, hardness, and adhesiveness. In overall acceptance of sensory evaluation, fish paste containing 15% S. plicata acquired the highest score. These results support that S. plicata can be applied to fish paste products for the purpose of high quality and functionality.

Quality Properties of Fish Paste Containing Styela clava (미더덕 함유 어묵의 품질 특성)

  • Park, Sun-Min;Lee, Bo-Bae;Hwang, Young-Man;Lee, Seung-Cheol
    • Journal of the Korean Society of Food Science and Nutrition
    • /
    • v.35 no.7
    • /
    • pp.908-911
    • /
    • 2006
  • Fish paste containing Styela clava (Korean name: miduduk) was prepared for the supplementary value of the product, and it was evaluated for the color, textural properities, and sensory attributes. Increasing the amount of S. clava in the fish paste tended to increase the lightness (L), the redness (a), and the yellowness (b) in Hunter color values. All test samples with 3 mm thickness had good flexibility and did not break even after 4 times folds. Fish paste containing 20% S. clava showed the highest values in strength, hardness, and adhesiveness. In overall acceptance of sensory evaluation, fish paste containing 5% S. clava did not show any difference in comparison with non added control. These results suggest that S. clava can be applied to fish paste products to improve the quality and functionality.

Analysis of Convergence Level and Exit Criteria on Traffic Assignment Algorithms (통행배정모형의 수렴성 판단 및 종료기준 설정)

  • Kim, Joo-Young;Kim, Jae-Young;Park, Sang-Jun;Lee, Seung-Jae
    • The Journal of The Korea Institute of Intelligent Transport Systems
    • /
    • v.14 no.1
    • /
    • pp.31-45
    • /
    • 2015
  • Existing link-based Frank-Wolfe algorithm has been widely used, thanks to its ease of simulation and stable results; however, it comes with low convergence issue towards near the optimum value. Such issue was not considered as a major drawback in the past. However, in the present, some arguments have occurred over the method's stability, analysis time, and other limits as the size and details of the fundamental data for traffic analysis have vastly improved. Therefore, this paper compared the theoretical attributes and the pros and cons between the Frank-Wolfe algorithm and the Origin-based algorithm and Path-based algorithm newly being developed. As a result of this paper, there is possibility that a problem of stability may arise depending on the convergence and exit criteria. Thus, In practice, this effort to derive the appropriate level of convergence is required to secure and stable results.