• 융합신호처리학회논문지
• /
• 제12권1호
• /
• pp.20-25
• /
• 2011

부밴드 구조에서 투사차원이 P인 전밴드 인접투사 적응필터는 최대 군위상 분해와 노블아이덴티티를 적용함으로써 P개의 적응 부필터로 분해된다. 각각의 적용 부필터는 투사차원이 1인 간단한 계수 갱신식을 갖게 된다. 이러한 부밴드 분해기법은 구현관점에서 가장 실용적인 해법 중 하나이다. 많은 응용에서 활용을 위해 MPDSAP 적응 필터의 최적 스텝사이즈 해석이 필요하다. 본 논문은 MPDSAP 적응 필터의 MSE에 대한 개선된 해석 모델을 제안하고 초기 최적 스텝사이즈를 유도한다. 컴퓨터 시뮬레이션을 통해 MSE의 개선된 해석 모텔과 유도된 최적 초기 스텝사이즈에 대해 이론과 실험적 결과 사이의 일치함을 확인하였다.

• 한국멀티미디어학회논문지
• /
• 제6권4호
• /
• pp.676-684
• /
• 2003

eLearning can be defined as an approach to teaching and teaming that utilises Internet technologies to communicate and collaborate in an educational context. This includes technology that supplements traditional classroom training with web-based components and learning environments where the educational process is experienced online. The use of hypertext as an educational tool has a very rich history. The advent of the internet and one of its major application, the world wide web (WWW), has given a tremendous boost to the theory and practice of hypermedia systems for educational purposes. However, the web suffers from an inability to satisfy the heterogeneous needs of a large number of users. For example, web-based courses present the same static teaming material to students with widely differing knowledge of the subject. Adaptive hypermedia techniques can be used to improve the adaptability of eLearning. In this paper we report an approach to the design a unified implementation framework suitable for web-based eLearning that accommodates the three main dimensions of hypermedia adaptation: content, navigation, and presentation. The framework externalises the adaptation strategies using XML notation. The separation of the adaptation strategies from the source code of the eLearning software enables a system using the framework to quickly implement a variety of adaptation strategies. This work is a part of our more general ongoing work on the design of a framework for adaptive content delivery. parts of the framework discussed in this paper have been imulemented in a commercial eLearning engine.

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

In this paper, we focus on the total transmission power minimization problem for downlink beamforming multiple-input multiple-output (MIMO) orthogonal frequency division multiplexing (OFDM) systems while ensuring each user's QoS requirement. Although the linear integer programming (LIP) solution we formulate provides the performance upper bound of the margin adaptive (MA) optimization problem, it is hard to be implemented in practice due to its high computational complexity. By regarding each user's equivalent channel gain as approximate independent values and using iterative descent method, we present a heuristic MA resource allocation algorithm. Simulation results show that the proposed algorithm efficiently converges to the local optimum, which is very close to the performance of the optimal LIP solution. Compared with existing space division multiple access (SDMA) OFDM systems with or without adaptive resource allocation, the proposed algorithm achieves significant performance improvement by exploiting the frequency diversity and multi-user diversity in downlink multiple-input single-output (MISO) OFDM systems.

• 디지털융복합연구
• /
• 제16권8호
• /
• pp.151-159
• /
• 2018

본 연구는 서비스 접점에서 개별 고객의 욕구에 맞춰 다양한 형태의 감정들을 반응해야 하는 영업사원의 긍정 탐색과 감정노동이 적응적 판매행동 및 고객만족에 미치는 영향을 중심으로 분석하였다. 115명의 자동차 영업사원들과 해당 영업사원으로부터 서비스를 제공받은 고객 2명씩 230명으로부터 이원적(dyadic) 설문자료를 수집하였다. 총 345명을 대상을 구조방정식모형으로 분석하였다. 분석결과, 긍정 탐색은 심층행동과 표면행동에 유의하게 긍정적인 영향을 미치는 것으로 나타났다. 심층행동만 적응적 판매행동에 긍정적인 영향을 미치는 것으로 나타났으며, 표면행동과는 유의미하지 않게 나타났다. 마지막으로 적응적 판매행동은 고객만족에 긍정적인 영향을 미치는 것으로 나타났다. 본 연구는 이론적으로 영원사원의 긍정 탐색(AI) 접근의 본질을 규명하고, 긍정 탐색(AI) 실천과 관련된 감정노동을 통한 적응적 판매행동을 활성화시키는데 기여할 것이다.

• 한국전산구조공학회논문집
• /
• 제23권3호
• /
• pp.331-340
• /
• 2010

적응적 hp-세분화 기법과 그 기법의 효과적인 구성방법을 포함한 새로운 적응적 유한요소 알고리즘의 기초이론 및 적용이 이 연구를 통해 제시되었다. 적응적 hp-세분화 기초의 유한요소기법은 적분형 르장드르 형상함수와 요소별로 불균등한차수의 분배 및 비정형적인 절점연결과 관련된 연속조건을 만족시킬 수 있는 제약조건을 필요로 한다. 따라서 요소간의 접합부분에서 적응적 hp-유한요소망의 연속성이 중요한 문제로 대두된다. 이러한 문제를 요소경계에 연속성 제약조건을 절점연결 사상행렬을 적용하여 해결하였다. 또한, 적분형 르장드르 형상함수의 계층성질을 이용하여 제시된 알고리즘의 효율적 정식화 방안을 제시하였다. 간단한 캔틸레버문제가 h-세분화, p-세분화 그리고 hp-세분화 방법에 의해 계산되었다. hp-세분화의 결과는 다른 방식의 세분화에 비해 보다 빠른 수렴성을 보여 주는 것이 확인되었다. 그러므로 제시된 hp-세분화 알고리즘은 실제문제에 효율적으로 적용될 수 있을 것으로 생각된다.

• Korean Journal of Radiology
• /
• 제21권6호
• /
• pp.756-763
• /
• 2020

Objective: To evaluate the effects of attenuation threshold on CT pulmonary vascular volume ratios in children and young adults with congenital heart disease, and to suggest an optimal attenuation threshold. Materials and Methods: CT percentages of right pulmonary vascular volume were compared and correlated with percentages calculated from nuclear medicine right lung perfusion in 52 patients with congenital heart disease. The selected patients had undergone electrocardiography-synchronized cardiothoracic CT and lung perfusion scintigraphy within a 1-year interval, but not interim surgical or transcatheter intervention. The percentages of CT right pulmonary vascular volumes were calculated with fixed (80-600 Hounsfield units [HU]) and adaptive thresholds (average pulmonary artery enhancement [PA_avg] divided by 2.50, 2.00, 1.75, 1.63, 1.50, and 1.25). The optimal threshold exhibited the smallest mean difference, the lowest p-value in statistically significant paired comparisons, and the highest Pearson correlation coefficient. Results: The PA_avg value was 529.5 ± 164.8 HU (range, 250.1-956.6 HU). Results showed that fixed thresholds in the range of 320-400 HU, and adaptive thresholds of PA_avg/1.75-1.50 were optimal for quantifying CT pulmonary vascular volume ratios. The optimal thresholds demonstrated a small mean difference of ≤ 5%, no significant difference (> 0.2 for fixed thresholds, and > 0.5 for adaptive thresholds), and a high correlation coefficient (0.93 for fixed thresholds, and 0.91 for adaptive thresholds). Conclusion: The optimal fixed and adaptive thresholds for quantifying CT pulmonary vascular volume ratios appeared equally useful. However, when considering a wide range of PAavg, application of optimal adaptive thresholds may be more suitable than fixed thresholds in actual clinical practice.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제14권7호
• /
• pp.3057-3075
• /
• 2020

End-to-end network delay plays an vital role in distributed services. This delay is used to measure QoS (Quality-of-Service). It would be beneficial to know all node-pair delay information, but unfortunately it is not feasible in practice because the use of active probing will cause a quadratic growth in overhead. Alternatively, using the measured network delay to estimate the unknown network delay is an economical method. In this paper, we adopt the state-of-the-art matrix completion technology to better estimate the network delay from limited measurements. Although the number of measurements required for an exact matrix completion is theoretically bounded, it is practically less helpful. Therefore, we propose an online adaptive sampling algorithm to measure network delay in which statistical leverage scores are used to select potential matrix elements. The basic principle behind is to sample the elements with larger leverage scores to keep the traits of important rows or columns in the matrix. The amount of samples is adaptively decided by a proposed stopping condition. Simulation results based on real delay matrix show that compared with the traditional sampling algorithm, our proposed sampling algorithm can provide better performance (smaller estimation error and less convergence pressure) at a lower cost (fewer samples and shorter processing time).

• 한국정보과학회논문지:시스템및이론
• /
• 제33권8호
• /
• pp.547-553
• /
• 2006

본 논문에서는 3 차원 메쉬의 기하데이타 압축을 위한 새로운 알고리즘을 소개하고자 한다. 광역좌표계에 의거한 기하데이타 압축방법은 구현이 쉽고 단순하게 양자화가 결정되지만 압축효율은 지역 화표계를 이용한 방법보다 떨어지는 단점이 있다. 반면에 지역좌표계에 기초한 방법은 광역좌표계 방법보다 압축효율은 우수하나 양자화가 사용자의 시행착오에 전적으로 의존하므로, 비체계적이고 시간이 많이 소요되는 단점이 있다. 본 논문에서는 지역좌표계영역에 적용형 세분화를 도입하여 체계적인 양자화가 가능하도록 하였다. 또한 문맥 모델링기법을 적용하여 연결데이타 압축효율도 더욱 향상시켰다. 결과적으로, 본 논문의 새로운 압축 알고리즘은 압축 효율성을 유지하면서, 동시에 체계적이고 직관적인 방법으로 왜곡율과압축률간의 균형을 제어할 수 있도록 하여 알고리즘의 신뢰성을 높였다.

• 한국경영과학회지
• /
• 제27권2호
• /
• pp.33-49
• /
• 2002

CBM (Condition-Based Maintenance) has increasingly drawn attention in industry because of its many benefits. CBM Problem Is characterized as a state-dependent scheduling model that demands simultaneous maintenance actions, each for an attribute that influences on machine condition. This problem is very hard to solve within conventional Markov decision process framework. In this paper, we present an intelligent machine maintenance scheduler, for which a new incremental decision tree learning method as evolutionary system identification model and shortest path problem as schedule generation model are developed. Although our approach does not guarantee an optimal scheduling policy in mathematical viewpoint, we verified through simulation based experiment that the intelligent scheduler is capable of providing good scheduling policy that can be used in practice.

• 경영과학
• /
• 제4권
• /
• pp.84-98
• /
• 1987

After a brief discussion of the reality of OR/MS, a detailed examination is made of the impacts of academic OR/MS on its practice. These impacts include the dispersion of OR/MS in organizations, the traditional role of OR/MS, researchers, and the narrow interpretation of decision making process of current OR/MS, and the dissolution of its interdiciplinarity. The changes in OR/MS environment which should have evoked adaptive responses from it, but were not considered. The increasing inappropriateness of OR/MS methodology is discussed by focusing on the deficiencies of its concept and practice of optimization and academic role of OR/MS researchers. These deficiencies, it is argued, can be overcome by a comprehensive reconceptualization of the field, its methodology, the extended role of OR/MS researchers. Finally, the example of realizing New Paradigm, the Full Corporate Modelling with Simulation, is presented.