• 제목/요약/키워드: 선택적 공유

검색결과 408건 처리시간 0.031초

Implementation of a Schedule Management Planner using ChatGPT (ChatGPT를 활용한 일정관리 플래너 구현)

  • Seong-Eun Bong;Ji-Hyeon Lee;Hyun-Su Park;Seo-Youn Chae;Sang-Ho Lee
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • 제24권6호
    • /
    • pp.223-229
    • /
    • 2024
  • Schedule management is an important factor in maintaining a successful work and personal life in modern society. However, many people are unable to make systematic plans due to their busy schedules, resulting in wasted time and decreased productivity. To solve this problem, this paper develops a schedule management system using ChatGPT. This system makes it easy to register schedules through ChatGPT's interactive function, and provides reminder notifications and schedule performance confirmation functions to ensure you don't miss important schedules. This system allows you to share personal schedules with team members and manage schedules on a team basis through the team collaboration function. Furthermore, ChatGPT analyzes the user's schedule data and provides daily analysis, monthly goal recommendation, and one-line evaluation function to help with efficient time management and promote a stable daily life. Unlike existing planner systems, this system provides users with a more convenient experience by allowing them to register schedules through conversation and choose whether or not to complete the schedule through notifications.

Trend Analysis of Corona Virus(COVID-19) based on Social Media (소셜미디어에 나타난 코로나 바이러스(COVID-19) 인식 분석)

  • Yoon, Sanghoo;Jung, Sangyun;Kim, Young A
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • 제22권5호
    • /
    • pp.317-324
    • /
    • 2021
  • This study deals with keywords from social media on domestic portal sites related to COVID-19, which is spreading widely. The data were collected between January 20 and August 15, 2020, and were divided into three stages. The precursor period is before COVID-19 started spreading widely between January 20 and February 17, the serious period denotes the spread in Daegu between February 18 and April 20, and the stable period is the decrease in numbers of confirmed infections up to August 15. The top 50 words were extracted and clustered based on TF-IDF. As a result of the analysis, the precursor period keywords corresponded to congestion of the Situation. The frequent keywords in the serious period were Nation and Infection Route, along with instability surrounding the Treatment of COVID-19. The most common keywords in all periods were infection, mask, person, occurrence, confirmation, and information. People's emotions are becoming more positive as time goes by. Cafes and blogs share text containing writers' thoughts and subjectivity via the internet, so they are the main information-sharing spaces in the non-face-to-face era caused by COVID-19. However, since selectivity and randomness in information delivery exists, a critical view of the information produced on social media is necessary.

Effects of Barbiturates on Transbilayer Fluidity Domains of Phospholipid Model Membrane Monolayers (Barbiturates가 소의 대뇌피질 Synaptosomal Plasma Membrane Vesicles로 부터 추출 제제한 총지질 및 총인지질 인공세포막에 형성된 비대칭적 유동성에 미치는 비대칭적 영향)

  • Yun, Il;Kang, Jung-Sook
    • The Korean Journal of Pharmacology
    • /
    • 제28권1호
    • /
    • pp.103-114
    • /
    • 1992
  • Selective quenching of 1,6-diphenyl-1,3,5-hexatriene (DPH) by trinitrophenyl groups was utilized to examine the transbilayer fluidity domains of the model membranes of total lipids (SPMVTL) and phospholipids (SPMVPL) extracted from synaptosomal plasma membrane vesicles. At 37C, all anisotropy (r), limiting anisotropy (r), and order parameter (S) values of DPH in the SPMVTL were larger than those in SPMVPL. The anisotropy, limiting anisotropy, and order parameter of DPH in the inner monolayer were 0.025, 0.033, and 0.070, respectively, greater than calculated for the outer monolayer of SPMVTL. In SPMVPL, the anisotropy, limiting anisotropy, and order parameter of DPH in the inner monolayer were 0.014, 0.018, and 0.047, respectively, greater than calculated for the outer monolayer. Selective quenching of DPH by trinitrophenyl groups was also utilized to examine the effects of barbiturates on the transbilayer fluidity domains of SPMVTL and SPMVPL. Barbiturates did not affect the anisotropy of DPH in the transbilayer domains of SPMVTL. In contrast, barbiturates increased the fluorescence anisotropy, limiting anisotropy, and order parameter of DPH in the SPMVPL in a dose-dependent manner. Barbiturates showed a greater ordering effect on the outer monolayer as compared to the inner monolayer of SPMVPL. Hence, it has been demonstrated for the first time that the Sheetz-Singer hypothesis (1974) may be valid for phospholipid model membranes.

  • PDF

Content Creation and Flow: Why They Clik or Create UCCs (콘텐츠 창조와 플로우:동영상 UCC 이용 동기)

  • Chun, Bang-Jee
    • The Journal of the Korea Contents Association
    • /
    • 제8권12호
    • /
    • pp.222-235
    • /
    • 2008
  • This study looks at motivations of video UCC users as a member of creative class. A qualitative research method was used for analyzing data collected by interviews. Killing time users, active clickers and creators are distinguished as different types of UCC users and their differing motivations are explored. The findings of the study are as follows: First, information sharing, self presentation, communication needs, ease of use for self presentation, usefulness are expressed as motivating factors for both active clickers and creators, Pleasure motivates every type of users. However, content creators experience a specific type of pleasure which is the pleasure of creativity or flow, which this study highlights as a key driving factor for content creators. The study adds to the findings of UCC user research which applies the TAM and the PAD model by revealing what pleasure and flow specifically mean for different types of UCC users.

Dynamic Resource Ranking and Grouping Algorithm for Grid Computing (그리드 컴퓨팅을 위한 동적 자원 랭킹 및 그룹핑 알고리즘)

  • Yi Jinsung;Park Kiejin;Choi Changyeol;Kim Sungsoo
    • Journal of KIISE:Information Networking
    • /
    • 제32권4호
    • /
    • pp.471-482
    • /
    • 2005
  • The high-speed network permits Grid computing to handle large problem of management areas and share various computational resources. As there are many resources and changes of them in Grid computing, the resources should be detected effectively and matched correctly with tasks to provide high performance. In this paper, we propose a mechanism that maximizes the performance of Grid computing systems. According to a priority, grade and site of heterogeneous resources, we assign tasks to those resources. Initially, a volunteer's priority and ranking are determined by static information like as CPU speed, RAM size, storage size and network bandwidth. And then, the rank of resources is decided by considering dynamic information such as correctness, response time, and error rate. We find that overall Grid system performance is improved and high correctness using resource reallocation mechanism is achieved.

Binary Negative-Exponential Backoff Algorithm to Enhance The Performance of IEEE 802.11 WLAN (IEEE 802.11 무선랜의 성능 향상을 위한 Binary Negative-Exponential Backoff 알고리즘)

  • Ki, Hyung-Joo;Choi, Seung-Hyuk;Chung, Min-Young;Lee, Tae-Jin
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • 제31권12A호
    • /
    • pp.1229-1237
    • /
    • 2006
  • IEEE 802.11 has employed distributed coordination function (DCF) adopting carrier sense multiple access with collision avoidance (CSMA/CA). To effectively resolve collisions, DCF uses binary exponential backoff (BEB) algorithm with three parameters, i.e., backoff stage, backoff counter and contention window. If a collision occurs, stations involving in the collision increase their backoff stages by one and double their contention window sizes. However, DCF with BEB wastes wireless resource when there are many contending stations. Therefore, in this paper, to enhance the performance of wireless LAN, we propose binary negative-exponential backoff (BNEB) algorithm which maintains a maximum contention window size during collisions and reduces a contention window size to half after successful transmission of a frame without retransmissions. For IEEE 802.11, 802.11a and 802.11b standards, we also compare the performance of DCF with BEB to that with BNEB.

Restricted Multi-hop Information Lookahead Scheme for Real-Time Data Dissemination in Wireless Sensor Networks (무선 센서 망에서 실시간 데이터 전송을 위한 제한적 멀티-홉 정보 예측 기법)

  • Jung, Ju-Hyun;Oh, Seung-Min;Lee, Jeong-Cheol;Park, Ho-Sung;Yim, Yong-Bin;Kim, Sang-Ha
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • 제35권7A호
    • /
    • pp.706-714
    • /
    • 2010
  • In wireless sensor networks, real-time data delivery schemes typically achieve a desired delivery speed by performing one-hop lookahead. Recently, to reduce the deadline miss ratio against the desired delivery speed, a study has proposed a real-time routing protocol based on proactively performing two-hop lookahead. However, the study might cause heavy message exchange overhead and high computing complexity to carry out obtainment of two-hop neighborhood speed information in the entire sensor nodes whether data are delivered or not. Moreover, although multi-hop lookahead provides the least deadline miss ratio, due to the restriction from the overhead and the complexity, the recent study merely adopts the two-hop lookahead manner. In this paper, we propose a novel real-time routing protocol that adopts on-demand neighborhood multi-hop information obtainments only around data forwarding paths. Simulation results prove that the proposed routing protocol offers better performances with respect to deadline miss ratio, total communication costs, energy efficiency, and network lifetime.

A Study on the Perception of Stakeholders on Sunken Costs of an Urban Development Project (도시재생 사업의 매몰비용에 관한 이해집단간의 의식조사 연구)

  • Shin, Seungil;Lee, Ung-Kyun;Cho, Hunhee;Kang, Kyung-In
    • Journal of the Korea Institute of Building Construction
    • /
    • 제14권6호
    • /
    • pp.591-596
    • /
    • 2014
  • This study investigates the perception of the sunken costs of an urban development project, which is currently a social problem through a questionnaire survey. The results indicate that local and federal governments, political authorities, association members, landowners, etc. partially recognize their responsibility in bearing the sunken cost. It is also found that all stakeholders who participated in the maintenance project felt shared responsibility of bearing the sunken costs and exchanging solutions to mitigate the same, rather than making one party deal with the same. This study also suggests that with regard to reducing these sunken costs, the public sector should offer indirect support (by bearing the cost of infrastructure, tax benefits, regulation relaxation, etc.) rather than direct support so that the association members can make a reasonable choice on the project execution.

Improving Diversity of Keyword Search on Graph-structured Data by Controlling Similarity of Content Nodes (콘텐트 노드의 유사성 제어를 통한 그래프 구조 데이터 검색의 다양성 향상)

  • Park, Chang-Sup
    • The Journal of the Korea Contents Association
    • /
    • 제20권3호
    • /
    • pp.18-30
    • /
    • 2020
  • Recently, as graph-structured data is widely used in various fields such as social networks and semantic Webs, needs for an effective and efficient search on a large amount of graph data have been increasing. Previous keyword-based search methods often find results by considering only the relevance to a given query. However, they are likely to produce semantically similar results by selecting answers which have high query relevance but share the same content nodes. To improve the diversity of search results, we propose a top-k search method that finds a set of subtrees which are not only relevant but also diverse in terms of the content nodes by controlling their similarity. We define a criterion for a set of diverse answer trees and design two kinds of diversified top-k search algorithms which are based on incremental enumeration and A heuristic search, respectively. We also suggest an improvement on the A search algorithm to enhance its performance. We show by experiments using real data sets that the proposed heuristic search method can find relevant answers with diverse content nodes efficiently.

A Study on the Annotation of Digital Content (디지털 콘텐트의 어노테이션에 관한 연구)

  • Kwak, Seung-Jin
    • Journal of the Korean Society for Library and Information Science
    • /
    • 제40권4호
    • /
    • pp.267-286
    • /
    • 2006
  • Tools are needed to have access to more effective information and to select it in the environment of digital information where information pours in. and some of the advanced techniques to make up these tools are metadata and annotation. Annotation additionally records the marks for the supplementary explanation of and emphasis on a specific part of the original text and kas more various merits than metadata in terms of the search and use of digital resources. This research aims at suggesting methods that annotation. which has a range of functions including access to information. its reuse and sharing in the digital surroundings of late, can be applied to digital contents such as web services, digital libraries and electronic books. As to the research method, the case studies of annotation systems applied to web services and digital libraries have been carried out, and the metadata formation of the systems has been analyzed.