• 가족자원경영과 정책
• /
• 제18권3호
• /
• pp.103-116
• /
• 2014

The purpose of this study is to examine the influence of family mealtime on the childrens' school adaptation. This study uses data from the 2012 Survey on Child Education and School Involvement of Parents by the Center for Family-School Partnership Policy Research at Seoul National University. Survey data was collected from 1500 parents with school-aged children. For the data analysis, Chi sqaure test and hierarchical linear regression analyses were conducted. The results of these analyses showed that the numbers of family meals shared averaged 4.26 times per week for breakfast and 4.33 times per week for dinner. There were significant differences in the number of family meals shared together according to school level, residence area, and parent employment status, and household income. In addition, childrens' school adaptation was significantly different depending on school level, parent gender, parent education, and parent employment status. Finally, according to the hierarchical regression analyses, the number of family meals shared significantly predicted childrens' school adaptation. The greater number of family meals shared, the stronger the childrens' school adaptation. These results indicate that family mealtime has a positive effect on childrens' school adaptation. This study suggests that family mealtime is an indicator of family strength and it needs to guarantee family shared time at least to have a dinner together. This study could provide grounds for making family policy and education policy in order to guarantee family shared time.

• 유통과학연구
• /
• 제20권10호
• /
• pp.79-91
• /
• 2022

Purpose: As the shared kitchen sector evolves into a new trend in the restaurant industry, not only operational support but also the physical environment for services is ranked as an important success factors. Therefore, the purpose of this thesis is to study the effect of shared kitchen service quality on experiential value, relational commitment, and long-term orientation. Research design, data, and methodology: In this study, a questionnaire was used to verify the structural relationship between shared kitchen service quality, experiential value, relational commitment, and long-term orientation for tenant companies in shared kitchen companies. The data were analyzed by using Partial Least Square-Structural Equation Modeling (PLS-SEM). Result: Facilities and support for the service quality of the shared kitchen had a positive (+) effect on the experiential value, and the environment did not. In addition, experiential value showed a significant positive (+) effect on relationship commitment and long-term orientation, and relationship commitment showed a significant positive (+) effect on long-term orientation. Conclusions: It was confirmed that the support quality among service quality affects the relationship formation. Thus, attention should be paid to activities to support stable business activities from the perspective of B2B services.

• 서비스연구
• /
• 제8권4호
• /
• pp.1-12
• /
• 2018

본 연구는 서비스시대 공유경제모델을 교육서비스에서 구현하는 방안을 제시하였다. 대다수의 공유경제 모델이 기존 경제의 고비용 저품질 구조를 저비용 고품질 구조로 혁신하고 있듯이 교육서비스에서도 고비용 저품질 구조를 저비용 고품질 구조로 개선하는 혁신 모델이 필요하다. 특히 고등교육과 평생교육은 혁신이 시급한 상황이므로 본 연구는 고등교육과 평생교육에 초점을 맞춘 공유대학 모델을 연구하였다. 저비용 고품질로 교육서비스를 제공하기 위해서 는 유휴자원의 활용이 필수적이므로 공유경제 모델 도입이 필요하다. 공유대학은 기존의 제한된 교육 공급자 집단이 대폭 확대되는 모델이므로 효율적이고 효과적인 공급자 품질관리가 필요하다. 교육수요자들을 역량 있는 인재로 양성하기 위해서는 규범적인 품질관리도 필요하다. 또한 저비용으로 고품질의 고등교육 서비스를 제공하기 위해서는 고도의 과학기술이 적용된 프로세스 품질관리가 바탕이 되어야 한다. 따라서 교육서비스 품질관리는 공급자, 수요자, 프로세스 측면에서의 품질관리가 모두 균형있게 잘 이루어지는 품질관리를 의미한다. 본 연구는 이러한 품질관리 모델에 대해 연구하고, 서비스시대의 첨단 교육모델로서 공유대학의 목표 모델을 정립하였다. 본 제안 모델을 구체화하고 구현하기 위한 추가 연구가 필요하다.

• 전자공학회논문지
• /
• 제50권4호
• /
• pp.108-116
• /
• 2013

최근 GPU 시스템과 같은 수백 개의 프로세서로 구성된 대규모 병렬 시스템을 이용하여 성능을 향상시키는 방법들이 많이 개발 되었다. 대표적으로 GPU에서 캐싱(Caching)과 유사한 개념으로 공유 메모리가 사용되었다. 출력 값을 얻기 위해서 이웃 값을 참조하는 이미지 필터와 같은 알고리즘들의 경우 이웃 값의 참조가 빈번하게 발생되므로 공유 메모리를 사용할 경우 성능이 향상되었다. 그러나 공유 메모리를 사용하기 위해서는 기존 코드를 재 구현해야만 하고 이는 코드의 복잡도를 증가시키는 원인이 된다. 최근 GPU 시스템에서는 공유 메모리 뿐 아니라 L1과 L2 캐시 메모리를 지원하도록 하였다. L1 캐시 메모리는 공유 메모리와 동일한 하드웨어에 위치하여 캐시의 사용이 성능향상을 도와줄 것으로 예측된다. 따라서 본 논문에서는 캐시 메모리와 공유 메모리의 성능을 비교하였다. 연구결과 성능 면에서 캐시 메모리를 사용한 알고리즘과 공유메모리를 사용한 알고리즘은 유사하였다. 특히 캐시 메모리를 사용하는 경우 공유메모리 사용 프로그래밍에서 나타나는 코드 복잡도의 증가 문제도 동시에 해결할 수 있었다.

• 한국과학교육학회지
• /
• 제24권1호
• /
• pp.171-182
• /
• 2004

The purpose of this study is to analyze lesson plans from third to sixth grades of science and to find out teaching strategies in respects of learning functions provided by preservice elementary teachers in education university. On the whole, to control students' learning process preservice teachers used more shared-regulation strategy than strong teacher-regulation one. Teaching activities for regulative learning function were most used in strategy of strong teacher-regulation, and in strategy of shared-regulation those for cognitive learning functions were most used. But teaching activities for affective learning functions were used a little considered in both teaching strategies. In introduction step of instruction, affective and regulative learning functions were more instructed by strong teacher-regulation strategy and cognitive learning functions were more instructed by shared-regulation strategy. The affective, cognitive, and regulative learning functions were largely planned by shared-regulation teaching strategy in development. The regulative learning functions were planned by strong teacher-regulation strategy than by shared-regulation strategy and affective learning functions were considered a little bit in consolidation. There was a tendency that strong teacherregulation strategy was increased in lessons for fifth and sixth grade.

• 산업경영시스템학회지
• /
• 제36권1호
• /
• pp.64-69
• /
• 2013

In ubiquitous computing, shared environments adjust themselves so that all users in the environments are satisfied as possible. Inevitably, some of users sacrifice their satisfactions while the shared environments maximize the sum of all users' satisfactions. In our previous work, we have proposed social welfare functions to avoid a situation which some users in the system face the worst setting of environments. In this work, we consider a more direct approach which is a preference based clustering to handle this issue. In this approach, first, we categorize all users into several subgroups in which users have similar tastes to environmental parameters based on their preference information. Second, we assign the subgroups into different time or space of the shared environments. Finally, each shared environments can be adjusted to maximize satisfactions of each subgroup and consequently the optimal of overall system can be achieved. We demonstrate the effectiveness of our approach with a numerical analysis.

• 한국정보처리학회:학술대회논문집
• /
• 한국정보처리학회 2009년도 추계학술발표대회
• /
• pp.543-544
• /
• 2009

본 논문은 Linux에서 사용되는 Shared Memory는 동일한 메모리 영역에 여러 개의 프로세스가 접근할 수 있도록 해 주는 기술이다. 본 논문에서는 Shared Memory의 큰 두 갈래 중 커널 단계에서 처리 되는 SVR(System V Release) 형식의 Shared Memory를 다룬다. 본 논문에서는 리눅스 운영체제의 공유 메모리 기능을 Dual Core 시스템에서 동작하도록 구현한다.

• World Technopolis Review
• /
• 제5권1호
• /
• pp.47-60
• /
• 2016

In today's digital non-linear global business environment, innovation initiatives are influenced by inter-organizational, political, economic, environmental, technological systems, as well as by decisions made individually by key actors in these systems. Network-based structures emerge from social linkages and collaborations among various actors, creating innovation ecosystems, complex adaptive systems in which entities co-create value. A shared vision of value co-creation allows people operating individually to arrive together at the same future. Yet, relationships are difficult to see, continually changing and challenging to manage. The Innovation Ecosystem Transformation Framework construct includes three core components to make innovation relationships visible and articulate networks of relational capital for the wellbeing, sustainability and business success of innovation ecosystems: data-driven visualizations, storytelling and shared vision. Access to data facilitates building evidence-based visualizations using relational data. This has dramatically altered the way leaders can use data-driven analysis to develop insights and provide ongoing feedback needed to orchestrate relational capital and build shared vision for high quality decisions about innovation. Enabled by a shared vision, relational capital can guide decisions that catalyze, support and sustain an ecosystemic milieu conducive to innovation for business growth.

• 한국컴퓨터정보학회논문지
• /
• 제23권10호
• /
• pp.73-80
• /
• 2018

The shared economy began with the concept of sharing the physical and intellectual assets of individuals with others. Nowadays, the concept of shared economy is becoming one of the industries as an enterprise type. Especially, with the development of the Internet and smart devices, various forms of shared economy have been developed in accordance with the need of sharing of individual income. Digital content is also a shareable commodity and it is seeking to utilize it as an item of shared economy. Accordingly, when digital contents are used as a shared economy, there are various possible threats -security threats that may arise in the course of transactions, potential for theft, alteration and hacking of contents. In this paper, we propose transaction method and content protection method using block chain-ethereum technology to reduce security threats and transparent transactions that can occur in digital contents transactions. Through the proposed method, the trust of the consumer and the supplier can be measured and the encryption can be performed considering the characteristics of the data to be traded. Through this paper, it is possible to increase the transparency of smart transaction of digital contents and to reduce the risk of content distortion, hacking, etc.

• Journal of Communications and Networks
• /
• 제9권2호
• /
• pp.198-209
• /
• 2007

This paper provides a thorough study on shared segment protection (SSP) for mesh communication networks in the complete routing information scenario, where the integer linear program (ILP) in [1] is extended such that the following two constraints are well addressed: (a) The restoration time constraint for each connection request, and (b) the switching/merging capacity constraint at each node. A novel approach, called SSP algorithm, is developed to reduce the extremely high computation complexity in solving the ILP formulation. Basically, our approach is to derive a good approximation on the parameters in the ILP by referring to the result of solving the corresponding shared path protection (SPP) problem. Thus, the design space can be significantly reduced by eliminating some edges in the graphs. We will show in the simulation that with our approach, the optimality can be achieved in most of the cases. To verify the proposed formulation and investigate the performance impairment in terms of average cost and success rate by the additional two constraints, extensive simulation work has been conducted on three network topologies, in which SPP and shared link protection (SLP) are implemented for comparison. We will demonstrate that the proposed SSP algorithm can effectively and efficiently solve the survivable routing problem with constraints on restoration time and switching/merging capability of each node. The comparison among the three protection types further verifies that SSP can yield significant advantages over SPP and SLP without taking much computation time.