• Journal of KIISE:Computer Systems and Theory
• /
• v.30 no.12
• /
• pp.708-713
• /
• 2003

For many years clustered heterogeneous web server architecture has been formed on the internet because the explosive internet services and the various quality of requests. The critical point in cluster environment is the mapping schemes of request to server. and recently this is the main issue of internet architecture. The topic of previous mapping methods is to assign equal loads to servers in cluster using the number of requests. But recent growth of various services makes it hard to depend on simple load balancing to satisfy appropriate latency. So mapping based on requested content to decrease response time and to increase cache hit rates on entire servers - so called “content-based” mapping is highly valuated on the internet recently. This paper proposes Prioritized Highest Random Weight mapping(PHRW mapping) that improves content-based mapping to properly fit in the heterogeneous environment. This mapping scheme that assigns requests to the servers with priority, is very effective on heterogeneous web server cluster, especially effective on decreasing latency of reactive data service which has limit on latency. This paper have proved through algorithm and simulation that proposed PHRW mapping show higher-performance by decrease in latency.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.28B no.9
• /
• pp.739-746
• /
• 1991

This paper develops a modified multilayer perceptron architecture which speeds up learning as well as the net's mapping accuracy. In Phase I, a cluster partitioning algorithm like the Kohonen's self-organizing feature map or the leader clustering algorithm is used as the front end that determines the cluster to which the input data belongs. In Phase II, this cluster selects a subset of the hidden layer nodes that combines the input and outputs nodes into a subnet of the full scale backpropagation network. The proposed net has been applied to two mapping problems, one rather smooth and the other highly nonlinear. Namely, the inverse kinematic problem for a 3-link robot manipulator and the 5-bit parity mapping have been chosen as examples. The results demonstrate the proposed net's superior accuracy and convergence properties over the original backpropagation network or its existing improvement techniques.

• The Journal of the Korea Contents Association
• /
• v.14 no.5
• /
• pp.107-116
• /
• 2014

The purpose of this study is to verify the applicability of concept mapping in the process of planning social welfare program based on community network. Concept mapping is a kind of decision-making method that structuralized complex ideas and presented visually. Already, concept mapping is widely utilized in counseling, nursing and public health area to plan and evaluation their program and service. For recent, effectiveness of concept mapping has been reported. Concept mapping is a effective decision-making method that they recognize outcome gap between service provider and client, reach the outcome's consensus in counseling and nursing, medical area. In this study, we conceptualized 3rd year outcomes of Community Impact Project that was supported from Busan Chest using concept mapping. This CI project intervenes children and youth who lives in Buk-gu, Busan. Concept mapping has six stages-preparation, collecting ideas, structuring statements, representing statement, interpreting the results of the analysis, applying the results. We followed these steps. The participants were working at social welfare organizations, total 11 persons. We obtained 60 statements and analyzed using multidimensional scaling. we collected 5 clusters, cluster 1 'awareness and attitude change of children and youth', cluster 2 'social system change of children and youth', cluster 3 'friendly community formation', cluster 4 'community people change', cluster 5 'service provider change'. As a result, among total 5 clusters formed, 'awareness and attitude change of children and youth' came to the strongest outcomes. When concept mapping was applied to the program planning, the consensus of the opinion came easily in the decision-making process, and the participants were empowered. In addition, clear conceptualization on each element of the program planning was made.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.47 no.2
• /
• pp.1-10
• /
• 2010

Mapping virtual process topology to physical processor topology is one of the most important design issues in parallel programming. However, the mapping problem is complicated due to the topology irregularity and routing complexity. This paper proposes a new process mapping scheme called adjacency-based mapping (AM) for irregular cluster systems assuming that the two-dimensional mesh process topology is specified as an interprocess communication pattern. The cluster systems have been studied and developed for many years since they provide high interconnection flexibility, scalability, and expandability which are not attainable in traditional regular networks. The proposed AM tries to map neighboring processes in virtual process topology to adjacent processors in physical processor topology. Simulation study shows that the proposed AM results in better mapping quality and shorter interprocess latency compared to the conventional approaches.

• Proceedings of the Korean Information Science Society Conference
• /
• 2001.04a
• /
• pp.730-732
• /
• 2001

클러스터 환경에서 최근의 다양한 서비스의 증가로 인해 단순한 부하의 균등화만으로 적절한 지연 시간을 기대할 수 없게 되어, 내용-기반 맵핑(content-based mapping)이 제안되었다. 본 논문에서는 요구되는 내용을 기반으로 맵핑하며, 이질적 서버들에 대해 능력에 따라 우선 순위를 부여하여, 내용-기반 맵핑 방식을 이질적 환경에 적합하도록 개선시킨 우선순위 최상임의 가중치 맵핑(Prioritized Highest Random Weight Mapping, PHRW Mapping)을 제안하였다.

• Proceedings of the National Institute of Ecology of the Republic of Korea
• /
• v.2 no.3
• /
• pp.144-152
• /
• 2021

Sanankerto is one of pilot projects for tourism villages in Indonesia due to its natural tourism potential with a 24-ha bamboo forest located in Boon Pring Andeman area. However, the distribution of existing bamboo has never been identified or mapped. Thus, the mana gement is facing difficulty in planning and developing tourism potential as well as spatial management in the area. Therefore, the objectives of this study were to identify and analyze the structure of bamboo vegetation in the Boon Pring Tourism village an d to perform vegetation mapping. The type of research was descriptive exploratory with a cluster sampling technique (i.e., a two-stage cluster) covering an area of ± 10 ha. Bamboo vegetation analysis was performed by calculating diversity index (H'), evenness index (E), and Species Richness index (R). Data were collected through observation and interviews with local people and the manager to determine zonation division. Mapping of bamboo vegetation based on zoning was processed into thematic maps using ArcG is 10.3. Micro climatic factors were measured with three replications for each sub -cluster. Data were analyzed descriptively and quantitatively. Nine species of bamboo identified. Diversity, evenness, and species richness indices differed at each location. Activities of local communities, tourists, and manager determined the presence, number, and distribution of bamboo species. These bamboo distribution maps in three zoning (utilization, buffer, and core) can be used by manager for planning and developing natural tourism potential.

• Korean Business Review
• /
• v.18 no.2
• /
• pp.197-223
• /
• 2005

The industrial cluster policy of 21st century rise to the focus method of regional economic promotion, therefore, the importance of study in cluster identification and mapping as policy task will bring into relief. This paper will confirms the estimate index and policy of industrial clusters with regional industry. The result in this case study, Cluster development should embrace the pursuit of competitive advantage and specialization rather than simply imitate successful clusters in other locations. This requires building on local sources of uniqueness. Government should reinforce and building on existing and emerging clusters rather than attempt to create entirely new ones. This sort of role for government is very different from industrial policy. The aim of cluster policy is to reinforce the development of all clusters. Not all clusters will succeed, but market forces should determine the outcomes. In other words, government should build on market- oriented system and innovative infra. The result of this study is meaning to the development of objectivity estimate index and derivation of cluster-focused policy with a case study of industrial clusters.

• The Bulletin of The Korean Astronomical Society
• /
• v.43 no.2
• /
• pp.37.1-37.1
• /
• 2018

ZwCL 1447.2+2619 is a merging galaxy cluster at z=0.37 with clear substructures in X-ray emission and galaxy distribution. In addition, the system possesses distinct radio relics. In order to constrain the merger scenario, it is necessary to measure both the distribution and mass of the cluster dark matter. We perform a weak lensing analysis of ZwCL 1447.2+2619 using Subaru imaging data. After carefully addressing instrumental systematics, we detect significant lensing signals. In this talk, our methodology, weak lensing results, and possible merging scenarios will be presented.

• Journal of information and communication convergence engineering
• /
• v.5 no.2
• /
• pp.131-135
• /
• 2007

In this paper, The proposed algorithm consists of three steps. In the first step, TD(Transition Density) calculation has to be performed. a CLB-based CPLD low-power technology mapping algorithm considered a Trade-off is proposed. To perform low-power technology mapping for CPLDs, a given Boolean network has to be represented in a DAG. Total power consumption is obtained by calculating the switching activity of each node in a DAG. In the second step, the feasible clusters are generated by considering the following conditions: the number of inputs and outputs, the number of OR terms for CLB within a CPLD. The common node cluster merging method, the node separation method, and the node duplication method are used to produce the feasible clusters. In the final step, low-power technology mapping based on the CLBs packs the feasible clusters. The proposed algorithm is examined using SIS benchmarks. When the number of OR terms is five, the experiment results show that power consumption is reduced by 30.73% compared with TEMPLA, and by 17.11 % compared with PLA mapping.

• Journal of information and communication convergence engineering
• /
• v.5 no.1
• /
• pp.59-63
• /
• 2007

In this paper, a CLB-based CPLD low-power technology mapping algorithm considered a Trade-off is proposed. To perform low-power technology mapping for CPLDs, a given Boolean network has to be represented in a DAG. The proposed algorithm consists of three steps. In the first step, TD(Transition Density) calculation has to be performed. Total power consumption is obtained by calculating the switching activity of each node in a DAG. In the second step, the feasible clusters are generated by considering the following conditions: the number of inputs and outputs, the number of OR terms for CLB within a CPLD. The common node cluster merging method, the node separation method, and the node duplication method are used to produce the feasible clusters. In the final step, low-power technology mapping based on the CLBs packs the feasible clusters. The proposed algorithm is examined using SIS benchmarks. When the number of OR terms is five, the experiment results show that power consumption is reduced by 30.73% compared with TEMPLA, and by 17.11 % compared with PLA mapping.