http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
Romeo B. Galang, Jr. 국립민속박물관 2012 International Journal of Intangible Heritage Vol.7 No.-
In the town of Cabiao, as in other towns in the Philippines,Holy Week culminates in the commemoration of thepassion, death and resurrection of Jesus. Tableaux of theimages of Christ, Mary, the disciples and other saints -called santos - are borne in procession through the mainstreets of the town. Members of the town ‘élite’commissioned the images and now stage the processions. To better understand their role, this paper analyses thedynamics of this form of sponsorship, including thesystems, structures and practices of santo patronage,using the older images to help identify sponsors in theSpanish period. I used documents to find out more aboutthe background of members of this élite – the estates andproperties they owned and the political posts they held. The manuscripts also gave some clues about how and whythe sponsorship of santos developed as it did in the mid-19th century. NB. ‘Élite’ is used here to refer to a particular strata ofPhilippine rural society. It does not have the negativeconnotations (uncaring wealth and privilege) that the termsuggests in many other parts of the English-speakingworld.
WEAKLY DENSE IDEALS IN PRIVALOV SPACES OF HOLOMORPHIC FUNCTIONS
Romeo Mestrovic,Zarko Pavicevic 대한수학회 2011 대한수학회지 Vol.48 No.2
In this paper we study the structure of closed weakly dense ideals in Privalov spaces N^p (1 < p < ∞) of holomorphic functions on the disk D : <수식>. The space Np with the topology given by Stoll's metric [21] becomes an F-algebra. N. Mochizuki [16] proved that a closed ideal in N^p is a principal ideal generated by an inner function. Consequently,a closed subspace E of N^p is invariant under multiplication by z if and only if it has the form IN^p for some inner function I. We prove that if M is a closed ideal in Np that is dense in the weak topology of N^p, then M is generated by a singular inner function. On the other hand, if Sμis a singular inner function whose associated singular measure μ has the modulus of continuity <수식> then we prove that the ideal SμN^p is weakly dense in N^p. Consequently, for such singular inner function Sμ,the quotient space N^p=SμN^p is an F-space with trivial dual, and hence N^p does not have the separation property.
( Romeo Mark A. Mateo ),( Jaewan Lee ) 한국인터넷정보학회 2011 KSII Transactions on Internet and Information Syst Vol.5 No.12
The key issue in providing fast and reliable access on cloud services is the effective management of resources in a cloud system. However, the high variation in cloud service access rates affects the system performance considerably when there are no default routines to handle this type of occurrence. Adaptive techniques are used in resource management to support robust systems and maintain well-balanced loads within the servers. This paper presents an adaptive resource management for cloud systems which supports the integration of intelligent methods to promote quality of service (QoS) in provisioning of cloud services. A technique of dynamically assigning cloud services to a group of cloud servers is proposed for the adaptive resource management. Initially, cloud services are collected based on the excess cloud services load and then these are deployed to the assigned cloud servers. The assignment function uses the proposed proportional ordering which efficiently assigns cloud services based on its resource consumption. The difference in resource consumption rate in all nodes is analyzed periodically which decides the execution of service assignment. Performance evaluation showed that the proposed dynamic service assignment (DSA) performed best in throughput performance compared to other resource allocation algorithms.
Scalable Search based on Fuzzy Clustering for Interest-based P2P Networks
( Romeo Mark A. Mateo ),( Jaewan Lee ) 한국인터넷정보학회 2011 KSII Transactions on Internet and Information Syst Vol.5 No.1
An interest-based P2P constructs the peer connections based on similarities for efficient search of resources. A clustering technique using peer similarities as data is an effective approach to group the most relevant peers. However, the separation of groups produced from clustering lowers the scalability of a P2P network. Moreover, the interest-based approach is only concerned with user-level grouping where topology-awareness on the physical network is not considered. This paper proposes an efficient scalable search for the interest-based P2P system. A scalable multi-ring (SMR) based on fuzzy clustering handles the grouping of relevant peers and the proposed scalable search utilizes the SMR for scalability of peer queries. In forming the multi-ring, a minimized route function is used to determine the shortest route to connect peers on the physical network. Performance evaluation showed that the SMR acquired an accurate peer grouping and improved the connectivity rate of the P2P network. Also, the proposed scalable search was efficient in finding more replicated files throughout the peer network compared to other traditional P2P approaches.
Intelligent Search Mechanism based on Neuro-fuzzy System for the Distributed Object Groups
Romeo Mark A. Mateo,Jaewan Lee 보안공학연구지원센터 2008 International Journal of Security and Its Applicat Vol.2 No.1
Current research in distributed systems focuses on object group models which are designed for scalable systems and provide accessible objects to the entire group. However, dynamic grouping using knowledge extraction from group of objects is not considered which provides accurate search for appropriate objects. In this paper, an integration of intelligent models in distributed object groups is presented in intelligent distributed framework. This paper proposes a locator service for the framework which implements the intelligent search mechanism based on neuro-fuzzy system. To have an accurate search of objects, the fuzzy system of the locator service is trained using the neuron-fuzzy algorithm. The proposed method is compared to other methods in accuracy of classification and result shows that it outperformed other algorithm based on processing time and accuracy.
Healthcare Expert System based on Group Cooperation Model
Romeo Mark A. Mateo,Jaewan Lee,Bobby D. Gerardo 보안공학연구지원센터 2008 International Journal of Software Engineering and Vol.2 No.1
Expert systems for healthcare are widely studied where accuracy of diagnosis and efficiency of the system for various healthcare services are examined. Also, recent researches include decision support services, expert medical services and autonomous management, which are based on multi-agent systems. The cooperation of agents is crucial in analyzing, and managing the data of patient in order to detect abnormal patterns so that it can provide an advance treatment. This research shows the implementation of healthcare expert system (HES) based on group cooperation model. Communications through the components of the group cooperation model are designed based on multi-agent approach. The proposed agent managers effectively coordinate the processing of client requests. Replica managers provide quality of service for clients by replicating objects. An adaptive scheme using round robin and fuzzy least load algorithms is managed by load balancing service. And in this paper, we presented the implementation by using CORBA for distributed objects and Jade Framework for agents..
그리드 시스템에서 그룹유사함수를 이용한 확장성 있는 자원공유
마테오로미오 ( Romeo Mark A. Mateo ),이재완 ( Jaewan Lee ),이말례 ( Malrey Lee ) 한국인터넷정보학회 2010 인터넷정보학회논문지 Vol.11 No.4
그리드 시스템에서의 확장성은 점증하고 있는 그리드 이용자를 수용하기 위해 효율적으로 설계되어야 한다. 본 논문은 그리드환경에서 확장성 가상조직(SVO: Scalable Virtual Organization)을 사용하여 VO들 간의 확장형 자원 공유 기법을 제시한다. 제안하는 그리드 구조는 SVO를 관리하기 위한 그리드 시스템의 표준 서비스들로 구성되며, 통합할 VO들을 선택하기 위해, VO들 간의 유사도를 결정하는 데 사용하는 그룹 유사함수를 제시한다. 다른 유사 함수들을 제시한 기법(GSF)과 비교하고, 시뮬레이션을 통해 SVO의 성능을 평가하였다. The scalability of a grid system should be efficiently designed to handle the increasing number of grid users. This paper presents a scalable resource sharing mechanism among virtual organizations (VO) in grid environment by the scalable virtual organizations (SVO). The proposed grid architecture is composed of standard services of a grid system to manage the SVO. We propose a group similarity function which is used to determine similarities among VOs to select the VOs to merge. We compared other similarity functions to the GSF and determined the throughput performance of the SVO using simulation for grid system.