http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
개별검색 DB통합검색이 안되는 DB는 DB아이콘을 클릭하여 이용하실 수 있습니다.
통계정보 및 조사
예술 / 패션
<해외전자자료 이용권한 안내>
- 이용 대상 : RISS의 모든 해외전자자료는 교수, 강사, 대학(원)생, 연구원, 대학직원에 한하여(로그인 필수) 이용 가능
- 구독대학 소속 이용자: RISS 해외전자자료 통합검색 및 등록된 대학IP 대역 내에서 24시간 무료 이용
- 미구독대학 소속 이용자: RISS 해외전자자료 통합검색을 통한 오후 4시~익일 오전 9시 무료 이용
※ 단, EBSCO ASC/BSC(오후 5시~익일 오전 9시 무료 이용)
'스콜라' 이용 시 소속기관이 구독 중이 아닌 경우, 오후 4시부터 익일 오전 7시까지 원문보기가 가능합니다.
For the increasing demand for the validation of analytical results, one of the important concerns of the analyst is to be assured that the instrumentation is working to qualified conditions. In this study, we have investigated and compared several validation guidelines of the performance verification of UV-VIS spectrophotometer used in pharmacopoeias of major countries and UV-VIS instrument analytical companies, and we proposed the practically useful validation guidelines of UV-VIS spectrophotometer. Based on our proposed validation guidelines of UV-VIS spectrophotometer, several UV-vis spectrophotometers used in drug manufacturing laboratories were validated for their performances.
Nowaday it becomes necessary to store and to retrieve the time series pattern, such as speech waves, on-line hand written characters, on-line signatures, which are treated as multimedia data. To reduce the search space for the large volume of time series patterns, an extended multidimensional dynamic index based on the Euclidean distance and the rotation split policy was proposed. In this paper, we present an improved multidimensional dynamic index structure and new algorithms. The index structure based on the maximum distance split policy simplify the structure and reduce the search space. This paper concludes with the performance analysis which focus on the view of structure and algorithms in the old and the new indexing method.
It is instructive to examine what alogorithmic advantage is provided by concurrent accesses to memory. In this paper, we shall show that there are some problems on which a CRCW alogorithm outperforms the best possible EREW algorithm. For the problem of finding the maximum element in an array, concurrent-write permit a faster alogorithm.
The Extended Entity Relational Model(EER) can support a lot of functions which are not covered with existential Entity Relational Model. However, some respects in the Object Model, such as inheritance and generalization, are not able to be supported in the EER Model. We compare the EER Model with the Object Model by mapping their properties. Especially we analyze generalization and inheritance in the Object Model and introduce them into the EER Model.
The selection is a problem of finding the Kth smallest key in array L which is containing n keys. It can be solved in general by sorting L. In that case, sorting requires O(n log₂n) key comparisions. In this paper we establish a lower bound of O(n) for selection problem using adversary argument in the worst case.