• Title/Summary/Keyword: Resource cluster

Search Result 323, Processing Time 0.025 seconds

Knowledge Exchange Activities and Performances in Software Industry Clusters: Focus on Firm Size Effect

  • CHO, Sung Eui
    • The Journal of Economics, Marketing and Management
    • /
    • v.10 no.6
    • /
    • pp.9-16
    • /
    • 2022
  • Purpose: This research investigates the differences in knowledge exchange activities and performances between startups and large companies in software industry clusters. Research design, data, and methodology: Six independent factors of human resource information, R&D and technology, marketing knowledge, government support information, strategic knowledge, and cooperation information were extracted to test the firm size effect in the relationships with two performance factors such as satisfaction with industry cluster location and satisfaction with financial performances. Data were collected through a survey of entrepreneurs, managers, and employees and tested by statistical analysis methodologies. Results: Three independent factors of human resource information, R&D and technology, and cooperation information were particularly significant in the relationship with both dependent factors. Strategic knowledge significantly affected financial performance. Knowledge exchange activities were more important in startups than in large companies for all eight factors. Conclusion: Policies for software industry clusters need a different approach for startups and large companies.

Storing Method of Learning Resources based on Cluster for e-Learning (이러닝을 위한 클러스터 기반 학습 자원의 저장 기법)

  • Yun, Hong-Won
    • The Journal of the Korea Contents Association
    • /
    • v.7 no.1
    • /
    • pp.155-160
    • /
    • 2007
  • A learning resource is a SCO or a collection of on or more assets in the SCORM. A storage policy is required to search rapidly and reuse assets in e-learning environment. However there are not research results about it. In this paper, We propose a storing method for assets based on cluster and define the mathematical formulation of it. Also, we present criteria for assets evaluation and describe procedure to evaluate each asset. We show that the search based on proposed cluster storing method increase performance than the categorization search through performance evaluation.

An Implementation Methodology of the Cluster Aware Application Program (클러스터 인식 응용 프로그램의 구현 기법)

  • 김영수;조익성;임재홍
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 1999.11a
    • /
    • pp.252-259
    • /
    • 1999
  • This paper describes the development of cluster-aware application that provides advanced services such as automatic failover, faster error recovery, easy administration and scalability in clustering environment. For These, total system architecture and algorithm are proposed. For the verification this paper, socket application and cluster resource DLL, administration DLL for the application are implemented and tested. Using the microsoft cluster server, The individual failed services was relocated from one server to another. The result shows that allows applications on the original server to continue running, unaffected tv the failed service.

  • PDF

Optimization for robot operations in cluster tools for concurrent manufacturing of multiple wafer types (복수 타입의 웨이퍼 혼류생산을 위한 클러스터 장비 로봇 운영 최적화)

  • Tae-Sun Yu;Jun-Ho Lee;Sung-Gil Ko
    • Journal of Industrial Technology
    • /
    • v.43 no.1
    • /
    • pp.49-55
    • /
    • 2023
  • Cluster tools are extensively employed in various wafer fabrication processes within the semiconductor manufacturing industry, including photo lithography, etching, and chemical vapor deposition. Contemporary fabrication facilities encounter customer orders with technical specifications that are similar yet slightly varied. Consequently, modern fabrications concurrently manufacture two or three different wafer types using a cluster tool to maximize chamber utilization and streamline the flow of wafer lots between different process stages. In this review, we introduce two methods of concurrent processing of multiple wafer types: 1) concurrent processing of multiple wafer types with different job flows, 2) concurrent processing of multiple wafer types with identical job flows. We describe relevant research trends and achievements and discuss future research directions.

Design and Implementation of Cluster based Routing Protocol using Representative Path in Ubiquitous Sensor Network (무선 센서네트워크에서 대표경로를 이용한 클러스터기반 라우팅 프로토콜의 설계 및 구현)

  • Jang, You-Jin;Kim, Ah-Reum;Chang, Jae-Woo
    • The Journal of the Korea Contents Association
    • /
    • v.10 no.6
    • /
    • pp.91-105
    • /
    • 2010
  • A wireless sensor network communication technique has been broadly studied with continuous advances in ubiquitous computing environment. Especially, because the resource of the sensor node is limited, it is important to reduce the communication energy by using an energy-efficient routing protocol. The existing cluster-based routing protocols have a problem that they cannot select a cluster head efficiently by randomly choosing a head. In addition, because the existing cluster-based routing protocols do not support the large scale of network, they cannot be used for various applications. To solve the above problems, we, in this paper, propose a new cluster-based routing protocol using representative paths. The proposed protocol constructs an efficient cluster with distributed cluster heads by creating representative paths based on hop count. In addition, a new routing protocol supports multi-hop routing for data communication between a cluster member node and a cluster head as well as between cluster heads. Finally, we show that our protocol outperforms LEACH and Multihop-LEACH in terms of reliability and scalability.

University Students' Perception of Childbirth according to the Types of Family Values (남녀 대학생의 가족가치관 유형에 따른 자녀출산에 대한 인식)

  • Lee, Yon-Suk;Kim, Hanui;Lee, Jeong-Woo
    • Journal of Family Resource Management and Policy Review
    • /
    • v.20 no.1
    • /
    • pp.109-140
    • /
    • 2016
  • The primary objective of this study was to classify different family values and to examine how university students' perceptions of childbirth differ according to the types of family values. The sample for this study consisted of 601 university students living in the cities of Seoul, Incheon, and the Gyeonggi province. The data were collected using structured questionnaires distributed through an online survey. Descriptive statistics including frequencies, percentages, means and standard deviation and cluster analysis, One-Way ANOVA and $X^2$ test are applied to analyze the data. The major results of this study are as follows: 1. The values of the university students regarding marriage, children, and familism were used as parameters to categorize the different types of family values on the cluster analysis. The results of the cluster analysis showed that the university students' family values could be classified into three types; "family-centered values", "individual-centered values", and "familism children-centered value". 2. The family values of the university students differed according to each student's gender, age, religion, socioeconomic status, gender-role attitude, and relationships with his or her father and or mother. 3. On average, the number of children that the students would like to have in the future is higher than the number of children that they actually plan to have. 4. The students' perceptions of family planning and low birthrate circumstances differed according to their family values. The university students categorized as having "family-centered values" planned to have the highest number of children in the future and thought that the low birthrate was a very serious issue, whereas the students with "individual-centered values" planned to have the lowest the number of children in the future. 5. To conclude the study, recommendations were made for the government to improve the low birthrate and for facilitate further research regarding this issue.

Efficient Load Balancing Scheme using Resource Information in Web Server System (웹 서버 시스템에서의 자원 정보를 이용한 효율적인 부하분산 기법)

  • Chang Tae-Mu;Myung Won-Shig;Han Jun-Tak
    • The KIPS Transactions:PartA
    • /
    • v.12A no.2 s.92
    • /
    • pp.151-160
    • /
    • 2005
  • The exponential growth of Web users requires the web serves with high expandability and reliability. It leads to the excessive transmission traffic and system overload problems. To solve these problems, cluster systems are widely studied. In conventional cluster systems, when the request size is large owing to such types as multimedia and CGI, the particular server load and response time tend to increase even if the overall loads are distributed evenly. In this paper, a cluster system is proposed where each Web server in the system has different contents and loads are distributed efficiently using the Web server resource information such as CPU, memory and disk utilization. Web servers having different contents are mutually connected and managed with a network file system to maintain information consistency required to support resource information updates, deletions, and additions. Load unbalance among contents group owing to distribution of contents can be alleviated by reassignment of Web servers. Using a simulation method, we showed that our method shows up to $50\%$ about average throughput and processing time improvement comparing to systems using each LC method and RR method.

HRKT: A Hierarchical Route Key Tree based Group Key Management for Wireless Sensor Networks

  • Jiang, Rong;Luo, Jun;Wang, Xiaoping
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.7 no.8
    • /
    • pp.2042-2060
    • /
    • 2013
  • In wireless sensor networks (WSNs), energy efficiency is one of the most essential design considerations, since sensor nodes are resource constrained. Group communication can reduce WSNs communication overhead by sending a message to multiple nodes in one packet. In this paper, in order to simultaneously resolve the transmission security and scalability in WSNs group communications, we propose a hierarchical cluster-based secure and scalable group key management scheme, called HRKT, based on logic key tree and route key tree structure. The HRKT scheme divides the group key into cluster head key and cluster key. The cluster head generates a route key tree according to the route topology of the cluster. This hierarchical key structure facilitates local secure communications taking advantage of the fact that the nodes at a contiguous place usually communicate with each other more frequently. In HRKT scheme, the key updates are confined in a cluster, so the cost of the key updates is reduced efficiently, especially in the case of massive membership changes. The security analysis shows that the HRKT scheme meets the requirements of group communication. In addition, performance simulation results also demonstrate its efficiency in terms of low storage and flexibility when membership changes massively.

Design of Dynamic Buffer Assignment and Message model for Large-scale Process Monitoring of Personalized Health Data (개인화된 건강 데이터의 대량 처리 모니터링을 위한 메시지 모델 및 동적 버퍼 할당 설계)

  • Jeon, Young-Jun;Hwang, Hee-Joung
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.15 no.6
    • /
    • pp.187-193
    • /
    • 2015
  • The ICT healing platform sets a couple of goals including preventing chronic diseases and sending out early disease warnings based on personal information such as bio-signals and life habits. The 2-step open system(TOS) had a relay designed between the healing platform and the storage of personal health data. It also took into account a publish/subscribe(pub/sub) service based on large-scale connections to transmit(monitor) the data processing process in real time. In the early design of TOS pub/sub, however, the same buffers were allocated regardless of connection idling and type of message in order to encode connection messages into a deflate algorithm. Proposed in this study, the dynamic buffer allocation was performed as follows: the message transmission type of each connection was first put to queuing; each queue was extracted for its feature, computed, and converted into vector through tf-idf, then being entered into a k-means cluster and forming a cluster; connections categorized under a certain cluster would re-allocate the resources according to the resource table of the cluster; the centroid of each cluster would select a queuing pattern to represent the cluster in advance and present it as a resource reference table(encoding efficiency by the buffer sizes); and the proposed design would perform trade-off between the calculation resources and the network bandwidth for cluster and feature calculations to efficiently allocate the encoding buffer resources of TOS to the network connections, thus contributing to the increased tps(number of real-time data processing and monitoring connections per unit hour) of TOS.