• Title/Summary/Keyword: Computer Usage

Search Result 1,234, Processing Time 0.028 seconds

Design of an Efficient Control System for Harbor Terminal based on the Commercial Network (상용망 기반의 항만터미널 효율적인 관제시스템 설계)

  • Kim, Yong-Ho;Ju, YoungKwan;Mun, Hyung-Jin
    • Journal of Industrial Convergence
    • /
    • v.16 no.1
    • /
    • pp.21-26
    • /
    • 2018
  • The Seaborne Trade Volume accounts for 97% of the total. This means that the port operation management system can improve port efficiency, reducing operating costs, and the manager who manages all operations at the port needs to check and respond quickly when delays of work and equipment support is needed. Based on the real-time location information confirmation of yard automation equipment used the existing system GPS, the real-time location information confirmation system is a GPS system of the tablet, rather than a port operation system that monitors location information for the entered information, depending on the completion of the task or the start of the task. Network configurations also reduce container processing delays by using commercial LTE services that do not have shading due to containers in the yard also reduce container processing delays. Trough introduction of smart devices using Android or IOS and container processing scheduling utilizing artificial intelligence, we will build a minimum delay system with Smart Device usage of container processing applications and optimization of container processing schedule. The adoption of smart devices and the minimization of container processing delays utilizing artificial intelligence are expected to improve the quality of port services by confirming the processing containers in real time to consumers who are container information demanders.

Extending the OMA DRM Framework for Supporting an Active Content (능동형 콘텐츠 지원을 위한 OMA DRM 프레임워크의 확장)

  • Kim, Hoo-Jong;Jung, Eun-Su;Lim, Jae-Bong
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.16 no.5
    • /
    • pp.93-106
    • /
    • 2006
  • With the rapid growth of the wireless Internet communication, a new generation of mobile devices have made possible the broad distribution of mobile digital contents, such as image, music, video, games and applications over the wireless Internet. Mobile devices are rapidly becoming the major means to extend communication channels without copy Protection, usage rule controlling and authentication. As a result, mobile digital contents may be illegally altered, copied and distributed among unauthorized mobile devices. In this paper, we take a look at Open Mobile Alliance (OMA) DRM v2.0 in general, its purpose and function. The OMA is uniquely the focal point for development of an open standard for mobile DRM. Next we introduces features for an active content and illustrates the difference between an active content and an inactive content. Enabling fast rendering of an active content, we propose an OMA-based DRM framework. This framework include the following: 1) Extending DCF Header for supporting an selective encryption, 2) Content encryption key management, 3) Rendering API for an active content. Experimental results show that the proposed framework is able to render an active content fast enough to satisfy Quality of Experience. %is framework has been proposed for a mobile device environment, but it is also applicable to other devices, such as portable media players, set-top boxes, or personal computer.

A Study on Elderly Services by Elderly in Public Libraries in A Post-aged Society: Focusing on the Busan Metropolitan City Public Library (초고령사회 공공도서관 노인이용자를 위한 '노노 서비스(老老 service)' 방안 연구 - 부산광역시 공공도서관을 중심으로 -)

  • Myung Sook, Kim
    • Journal of the Korean BIBLIA Society for library and Information Science
    • /
    • v.34 no.1
    • /
    • pp.75-96
    • /
    • 2023
  • The purpose of this study is to prepare and present a plan for the elderly service, in which the elderly become service providers and beneficiaries for the elderly who have emerged as the main library users in the face of a post-aged society. As a result of a survey of 119 elderly users of public libraries in the Busan area and an interview with a focus group of librarians at G Library, it was confirmed that the elderly service was needed. The most necessary services in terms of the beneficiaries of the Elderly Services by Elderly were surveyed in the order of computer information search help service, library usage guide service, book search method guide service, and recommended or popular book guide service. In terms of 'Elderly Services by Elderly' providers, the willingness to participate was the highest among those in their 60s, and the preferred method of participation was paid volunteer work three times a week, within four hours a day. Accordingly, it was analyzed that participants were recruited in connection with the social contribution activities of the government employment program for the elderly and prior training was necessary. In addition, the need for the creation of a community space for the elderly and the participation of retired librarians was raised.

Real-Time GPU Task Monitoring and Node List Management Techniques for Container Deployment in a Cluster-Based Container Environment (클러스터 기반 컨테이너 환경에서 실시간 GPU 작업 모니터링 및 컨테이너 배치를 위한 노드 리스트 관리기법)

  • Jihun, Kang;Joon-Min, Gil
    • KIPS Transactions on Computer and Communication Systems
    • /
    • v.11 no.11
    • /
    • pp.381-394
    • /
    • 2022
  • Recently, due to the personalization and customization of data, Internet-based services have increased requirements for real-time processing, such as real-time AI inference and data analysis, which must be handled immediately according to the user's situation or requirement. Real-time tasks have a set deadline from the start of each task to the return of the results, and the guarantee of the deadline is directly linked to the quality of the services. However, traditional container systems are limited in operating real-time tasks because they do not provide the ability to allocate and manage deadlines for tasks executed in containers. In addition, tasks such as AI inference and data analysis basically utilize graphical processing units (GPU), which typically have performance impacts on each other because performance isolation is not provided between containers. And the resource usage of the node alone cannot determine the deadline guarantee rate of each container or whether to deploy a new real-time container. In this paper, we propose a monitoring technique for tracking and managing the execution status of deadlines and real-time GPU tasks in containers to support real-time processing of GPU tasks running on containers, and a node list management technique for container placement on appropriate nodes to ensure deadlines. Furthermore, we demonstrate from experiments that the proposed technique has a very small impact on the system.

Digital technique in diagnosis and restoration of maxillary anterior implant: a case report (디지털 기법을 활용한 상악 전치부의 진단 및 수복 증례)

  • Haemin, Bang;Woohyung, Jang;Chan, Park;Kwi-Dug, Yun;Hyun-Pil, Lim;Sangwon, Park
    • Journal of Dental Rehabilitation and Applied Science
    • /
    • v.38 no.4
    • /
    • pp.249-256
    • /
    • 2022
  • The implant prosthesis of anterior maxilla requires careful consideration in planning. In order to satisfy both esthetic and functional needs of a patient, fusion of intra-oral scan in Cone-beam computed tomography (CBCT) and facial scan can be considered. Bony structures and soft tissues captured in CBCT and occlusal surfaces of intra oral scan were incorporated into personal characteristics from facial scan. The patient had insufficient buccal bone on maxillary anterior area. The maxillary implants could not be placed on the most ideal position. However, the "top down" approach completed by computer-generated arranging of teeth in implant planning and surgery with surgical guide resulted in esthetically and functionally satisfying result regardless of the limitation. Careful diagnosis with digital technique and the usage of surgical guide resulted in successful surgery and esthetic restoration. The temporary fixed prostheses were designed, restored and evaluated. The patient was not satisfied with the first design of temporary prosthesis, which showed uneven space distribution between teeth due to the position of maxillary implant. The design was modified by changing proximal emergence contours and line angle to alter the perceived since of incisors. The patient was satisfied with the new design of provisional restoration. A digital occlusion analyzer (Arcus Digma II, KaVo, Leutkirch, Germany) was used to measure inherent condylar guidance and anterior guidance of a patient to provide a definitive prosthesis.

Cybersickness and Experience of Viewing VR Contents in Augmented Reality (증강현실에서의 가상현실 콘텐츠 시청 경험과 사이버 멀미)

  • Jiyoung Oh;Minseong Jin;Zion Park;Seyoon Song;Subin Jeon;Yoojung Lee;Haeji Shin;Chai-Youn Kim
    • Science of Emotion and Sensibility
    • /
    • v.26 no.4
    • /
    • pp.103-114
    • /
    • 2023
  • Augmented reality (AR) and virtual reality (VR) differ fundamentally, with AR overlaying computer-generated information onto the real world in a nonimmersive way. Despite extensive research on cybersickness in VR, its occurrence in AR has received less attention (Vovk et al., 2018). This study examines cybersickness and discomfort associated with AR usage, focusing on the impact of content intensity and exposure time. Participants viewed 30-minute racing simulation game clips through AR equipment, varying in racing speed to alter content intensity. Cybersickness was assessed subjectively using the Simulator sickness questionnaire (SSQ; Kennedy et al., 1993). Findings revealed a progressive increase in cybersickness with longer exposure, persisting even after removing the AR equipment. Contrarily, content intensity did not significantly influence cybersickness levels. Analysis of the SSQ subscales revealed higher oculomotor (O) scores compared to nausea (N) and disorientation (D), suggesting that discomfort primarily stemmed from oculomotor strain. The study highlights distinct differences in user experience between AR and VR, specifically in subjective responses.

The Family History of Chronic Diseases, Food Group Intakes, and Physical Activity Practices among School Children in Seoul, Korea (서울지역 일부 초등학생의 생활 습관병 가족력, 식품군 섭취 형태 및 활동량 평가)

  • Lee, Young-Nam;Ha, Ae-Wha
    • Journal of the East Asian Society of Dietary Life
    • /
    • v.17 no.5
    • /
    • pp.644-652
    • /
    • 2007
  • In this study, we examined family history of chronic diseases, food group intake and physical activity in $5^{th}\;and\; 6^{th}$ grade elementary school children. Food group intake was compared with the KDRI food guides for children. The measurements of daily physical activity, television viewing, computer use, and daily servings of five food groups, including grains, meats, dairy products, fruits, and vegetables, were based on child and parent self-reports. As indices of obesity, the obesity index(%) and BMI(Body Mass Index) were used. The results were as follows. In boys, 83.2% were normal weight with 7.4% slightly obese, 7.4% moderately obese, and 2.0 were highly obese while the percentages of normal and slightly obese in girls were 89.9% and 6.2% respectively (p<0.05). The boys had more hours of daily physical activity(p<0.05) and more hours of computer usage(Internet searching or games)(p<0.05) than the girls. Slightly over 50% of the subjects met the daily recommended servings of grains, dairy products, fruits, and vegetables according to the KDRI food guides. However, only 26% of boys and 27% of girls met the recommended daily servings of protein foods such as meats, beans, and eggs. Thirty two percent(32%) of girls consumed high fat snacks everyday while 32% consumed high sugar snacks every day. The girls consumed more vegetables(p<0.05) and more high sugar snacks(p<0.05) than the boys. The children with family histories of obesity showed greater obesity rates(p<0.05) and sedentary lifestyles(p< 0.05) than those children without a family history of obesity. Children with family histories of high blood pressure consumed more sewings of vegetables and high fat snacks than the controls(p<0.05). The children with family histories of obesity consumed more high sugar or high fat snacks than the controls(p<0.05).

  • PDF

Analysis and Performance Evaluation of Pattern Condensing Techniques used in Representative Pattern Mining (대표 패턴 마이닝에 활용되는 패턴 압축 기법들에 대한 분석 및 성능 평가)

  • Lee, Gang-In;Yun, Un-Il
    • Journal of Internet Computing and Services
    • /
    • v.16 no.2
    • /
    • pp.77-83
    • /
    • 2015
  • Frequent pattern mining, which is one of the major areas actively studied in data mining, is a method for extracting useful pattern information hidden from large data sets or databases. Moreover, frequent pattern mining approaches have been actively employed in a variety of application fields because the results obtained from them can allow us to analyze various, important characteristics within databases more easily and automatically. However, traditional frequent pattern mining methods, which simply extract all of the possible frequent patterns such that each of their support values is not smaller than a user-given minimum support threshold, have the following problems. First, traditional approaches have to generate a numerous number of patterns according to the features of a given database and the degree of threshold settings, and the number can also increase in geometrical progression. In addition, such works also cause waste of runtime and memory resources. Furthermore, the pattern results excessively generated from the methods also lead to troubles of pattern analysis for the mining results. In order to solve such issues of previous traditional frequent pattern mining approaches, the concept of representative pattern mining and its various related works have been proposed. In contrast to the traditional ones that find all the possible frequent patterns from databases, representative pattern mining approaches selectively extract a smaller number of patterns that represent general frequent patterns. In this paper, we describe details and characteristics of pattern condensing techniques that consider the maximality or closure property of generated frequent patterns, and conduct comparison and analysis for the techniques. Given a frequent pattern, satisfying the maximality for the pattern signifies that all of the possible super sets of the pattern must have smaller support values than a user-specific minimum support threshold; meanwhile, satisfying the closure property for the pattern means that there is no superset of which the support is equal to that of the pattern with respect to all the possible super sets. By mining maximal frequent patterns or closed frequent ones, we can achieve effective pattern compression and also perform mining operations with much smaller time and space resources. In addition, compressed patterns can be converted into the original frequent pattern forms again if necessary; especially, the closed frequent pattern notation has the ability to convert representative patterns into the original ones again without any information loss. That is, we can obtain a complete set of original frequent patterns from closed frequent ones. Although the maximal frequent pattern notation does not guarantee a complete recovery rate in the process of pattern conversion, it has an advantage that can extract a smaller number of representative patterns more quickly compared to the closed frequent pattern notation. In this paper, we show the performance results and characteristics of the aforementioned techniques in terms of pattern generation, runtime, and memory usage by conducting performance evaluation with respect to various real data sets collected from the real world. For more exact comparison, we also employ the algorithms implementing these techniques on the same platform and Implementation level.

Improving Performance of Recommendation Systems Using Topic Modeling (사용자 관심 이슈 분석을 통한 추천시스템 성능 향상 방안)

  • Choi, Seongi;Hyun, Yoonjin;Kim, Namgyu
    • Journal of Intelligence and Information Systems
    • /
    • v.21 no.3
    • /
    • pp.101-116
    • /
    • 2015
  • Recently, due to the development of smart devices and social media, vast amounts of information with the various forms were accumulated. Particularly, considerable research efforts are being directed towards analyzing unstructured big data to resolve various social problems. Accordingly, focus of data-driven decision-making is being moved from structured data analysis to unstructured one. Also, in the field of recommendation system, which is the typical area of data-driven decision-making, the need of using unstructured data has been steadily increased to improve system performance. Approaches to improve the performance of recommendation systems can be found in two aspects- improving algorithms and acquiring useful data with high quality. Traditionally, most efforts to improve the performance of recommendation system were made by the former approach, while the latter approach has not attracted much attention relatively. In this sense, efforts to utilize unstructured data from variable sources are very timely and necessary. Particularly, as the interests of users are directly connected with their needs, identifying the interests of the user through unstructured big data analysis can be a crew for improving performance of recommendation systems. In this sense, this study proposes the methodology of improving recommendation system by measuring interests of the user. Specially, this study proposes the method to quantify interests of the user by analyzing user's internet usage patterns, and to predict user's repurchase based upon the discovered preferences. There are two important modules in this study. The first module predicts repurchase probability of each category through analyzing users' purchase history. We include the first module to our research scope for comparing the accuracy of traditional purchase-based prediction model to our new model presented in the second module. This procedure extracts purchase history of users. The core part of our methodology is in the second module. This module extracts users' interests by analyzing news articles the users have read. The second module constructs a correspondence matrix between topics and news articles by performing topic modeling on real world news articles. And then, the module analyzes users' news access patterns and then constructs a correspondence matrix between articles and users. After that, by merging the results of the previous processes in the second module, we can obtain a correspondence matrix between users and topics. This matrix describes users' interests in a structured manner. Finally, by using the matrix, the second module builds a model for predicting repurchase probability of each category. In this paper, we also provide experimental results of our performance evaluation. The outline of data used our experiments is as follows. We acquired web transaction data of 5,000 panels from a company that is specialized to analyzing ranks of internet sites. At first we extracted 15,000 URLs of news articles published from July 2012 to June 2013 from the original data and we crawled main contents of the news articles. After that we selected 2,615 users who have read at least one of the extracted news articles. Among the 2,615 users, we discovered that the number of target users who purchase at least one items from our target shopping mall 'G' is 359. In the experiments, we analyzed purchase history and news access records of the 359 internet users. From the performance evaluation, we found that our prediction model using both users' interests and purchase history outperforms a prediction model using only users' purchase history from a view point of misclassification ratio. In detail, our model outperformed the traditional one in appliance, beauty, computer, culture, digital, fashion, and sports categories when artificial neural network based models were used. Similarly, our model outperformed the traditional one in beauty, computer, digital, fashion, food, and furniture categories when decision tree based models were used although the improvement is very small.

Finding Weighted Sequential Patterns over Data Streams via a Gap-based Weighting Approach (발생 간격 기반 가중치 부여 기법을 활용한 데이터 스트림에서 가중치 순차패턴 탐색)

  • Chang, Joong-Hyuk
    • Journal of Intelligence and Information Systems
    • /
    • v.16 no.3
    • /
    • pp.55-75
    • /
    • 2010
  • Sequential pattern mining aims to discover interesting sequential patterns in a sequence database, and it is one of the essential data mining tasks widely used in various application fields such as Web access pattern analysis, customer purchase pattern analysis, and DNA sequence analysis. In general sequential pattern mining, only the generation order of data element in a sequence is considered, so that it can easily find simple sequential patterns, but has a limit to find more interesting sequential patterns being widely used in real world applications. One of the essential research topics to compensate the limit is a topic of weighted sequential pattern mining. In weighted sequential pattern mining, not only the generation order of data element but also its weight is considered to get more interesting sequential patterns. In recent, data has been increasingly taking the form of continuous data streams rather than finite stored data sets in various application fields, the database research community has begun focusing its attention on processing over data streams. The data stream is a massive unbounded sequence of data elements continuously generated at a rapid rate. In data stream processing, each data element should be examined at most once to analyze the data stream, and the memory usage for data stream analysis should be restricted finitely although new data elements are continuously generated in a data stream. Moreover, newly generated data elements should be processed as fast as possible to produce the up-to-date analysis result of a data stream, so that it can be instantly utilized upon request. To satisfy these requirements, data stream processing sacrifices the correctness of its analysis result by allowing some error. Considering the changes in the form of data generated in real world application fields, many researches have been actively performed to find various kinds of knowledge embedded in data streams. They mainly focus on efficient mining of frequent itemsets and sequential patterns over data streams, which have been proven to be useful in conventional data mining for a finite data set. In addition, mining algorithms have also been proposed to efficiently reflect the changes of data streams over time into their mining results. However, they have been targeting on finding naively interesting patterns such as frequent patterns and simple sequential patterns, which are found intuitively, taking no interest in mining novel interesting patterns that express the characteristics of target data streams better. Therefore, it can be a valuable research topic in the field of mining data streams to define novel interesting patterns and develop a mining method finding the novel patterns, which will be effectively used to analyze recent data streams. This paper proposes a gap-based weighting approach for a sequential pattern and amining method of weighted sequential patterns over sequence data streams via the weighting approach. A gap-based weight of a sequential pattern can be computed from the gaps of data elements in the sequential pattern without any pre-defined weight information. That is, in the approach, the gaps of data elements in each sequential pattern as well as their generation orders are used to get the weight of the sequential pattern, therefore it can help to get more interesting and useful sequential patterns. Recently most of computer application fields generate data as a form of data streams rather than a finite data set. Considering the change of data, the proposed method is mainly focus on sequence data streams.