• 한국방재학회:학술대회논문집
• /
• 2010.02a
• /
• pp.71.1-71.1
• /
• 2010

21C 고도의 도시화로 인하여 인구과밀화 및 초대형 초고층 건물의 비약적인 확산은 재난의 규모와 양상에 변화를 가져오며, 도시형 재난재해에 대비한 새로운 대책의 필요성을 과제로 안기고 있다. 뿐 만 아니라 지구온난화 및 뉴 테러리즘의 경향은 복합적이고 동시다발적인 재난으로 인한 다수인명피해에 대한 방호기능의 중요성과 통합재난관리 시스템의 중요성을 더욱 부각시키고 있다. 이러한 거시환경의 변화에 따라 다양화된 위험요인에 대한 체계적 대비와 효과적 대응을 위해 분야별 전문대응조직과 스페셜리스트 양성이 시급한 과제로 대두되고 있으며, 특히 재난대응단계에서 지진 등 건물붕괴로 인하여 동시다발적인 초대형 재난재해 시 효율적인 인명구조 활동의 대책으로 도시탐색구조 체계의 선진화 방안이 필요하며, 이를 위하여 소방공무원을 대상으로 실시한 의식조사 분석결과를 제시하고자 한다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2008.11a
• /
• pp.1083-1086
• /
• 2008

유비쿼터스 시대를 맞이하여 기존의 클라이언트-서버 모델을 벗어나 분산된 자원을 활용하는 방법이 연구 중인데 그 중 대표적인 것이 멀티 에이전트 시스템이다. 그러나 멀티 에이전트 시스템은 에이전트를 탐색할 때 깊이 우선 탐색 기법을 사용하는데 이는 에이전트 시스템과 맞지 않는 면이 있어 멀티 에이전트 시스템을 분석하여 탐색을 단축하는 기법을 제안하고자 한다. 본 논문에서는 에이전트 시스템의 에이전트 탐색에 매니저 DF를 두어 확률적으로 탐색확률이 높은 에이전트 플랫폼을 우선탐색 함으로써 에이전트 탐색 성능을 향상시킬 수 있다. 또, 매니저 DF에 네트워크 장애 등의 사고를 대비하여 미리 인접한 DF에 자료를 백업해두어 장애 발생 시에도 백업해 둔 자료를 활용하여 빠르게 그 업무를 대체할 수 있도록 하였다.

• Journal of KIISE
• /
• v.43 no.4
• /
• pp.480-488
• /
• 2016

Search-Based Software Testing (SBST) is an effective technique for test data generation on large domain size. Although the performance of SBST seems to be affected by the structural characteristics of Software Under Test (SUT), studies for the comparison of SBST techniques considering structural characteristics are rare. In addition to the comparison study for SBST, we analyzed the best algorithm with different structural characteristics of SUT. For the generalization of experimental results, we automatically generated 19,800 SUTs by combining four metrics, which are expected to affect the performance of SBST. According to the experiment results, Genetic algorithm showed the best performance for SUTs with high complexity and test data evaluation with count ${\leq}20,000$. On the other hand, the genetic simulated annealing and the simulated annealing showed relatively better performance for SUTs with high complexity and test data evaluation with count ${\geq}50,000$. Genetic simulated annealing, simulated annealing and hill climbing showed better performance for SUTs with low complexity.

• Journal of Intelligence and Information Systems
• /
• v.20 no.2
• /
• pp.19-38
• /
• 2014

This study focused on the role of active knowledge seeking (knowledge browsing and knowledge searching) in the context of virtual community of interest. Knowledge seeking is rarely studied as an antecedent in knowledge management (KM) research. Active knowledge seeking is considered as antecedents of sense of virtual community which mediates to knowledge sharing intention and virtual community promotion. Research hypotheses are tested by applying structure equation modeling with survey data from virtual community members in South Korea. Active knowledge seeking behavior was found to be the strong predictor of sense of virtual community, which, in turn, positively affects knowledge sharing intention and virtual community promotion. Implication to practitioners is to understand and accommodate the members' knowledge seeking efforts, who are potential contributors and promoters of the virtual community. Knowledge seeking, knowledge sharing and promoting virtual community are more of human activities than technology and this study extends the understanding of such human activities. By providing a mechanism of how knowledge seeking and sharing could work harmoniously, a virtuous circle with win-win situation could be achieved in virtual communities.

• Journal of Technology Innovation
• /
• v.20 no.1
• /
• pp.17-43
• /
• 2012

Alliance formation has been recognized as an important strategy for firms who seek to survive through acquisition of sustainable competitive advantages. Specifically in high-tech industries, firms may consider formation of strategic alliances in order to access valuable external knowledge. These firms tend to be situated in a dilemma that they should choose between exploration and exploitation, which are two types of strategic choices suggested by March (1991). Working out the dilemma has been extensively discussed in the area of strategy or organization learning. Recently, however, an increasing number of studies have stressed on a balance between exploration and exploitation. Regarded as 'ambidextrous organizations' (Lavie and Rosenkopf, 2006), these firms that simultaneously pursue exploration and exploitation have emerged in high-tech industries, and many studies have provided evidence of positive association between organizational ambidexterity and firm performance. In the strategic alliance research, accordingly, scholars began to pay attention to the balanced choice between exploration-and exploitation-oriented alliances. Given these backgrounds, this study examines the relationship between alliance ambidexterity and firm performance. While previous research approached alliance ambidexterity mainly from the number of alliances, our study suggests ambidexterity in terms of alliance portfolio and alliance partner. Our dataset consists of biotechnology or pharmaceutical firms in the United States, which spans time period between 1990 and 2005. We conduct panel data analysis. The results show the strong link between alliance ambidexterity and firm performance, highlighting the balance between exploration and exploitation when firms make strategic decisions.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.12 no.6
• /
• pp.1-9
• /
• 2013

The studies on the shortest path algorithms based on Dijkstra algorithm has been done continuously to decrease the time for searching. $A^*$ algorithm is the most represented one. Although fast searching speed is the major point of $A^*$ algorithm, there are high rates of failing in search of the shortest path, because of complex and irregular networks. The failure of the search means that it either did not find the target node, or found the shortest path, witch is not true. This study proposed $A^*$ algorithm applying method that can reduce searching failure rates, preferentially organizing the relations between the starting node and the targeting node, and appling it in reverse according to the organized path. This proposed method may not build exactly the shortest path, but the entire failure in search of th path would not occur. Following the developed algorithm tested in a real complex networks, it revealed that this algorithm increases the amount of time than the usual $A^*$ algorithm, but the accuracy rates of the shortest paths built is very high.

• Journal of Global Scholars of Marketing Science
• /
• v.16 no.3
• /
• pp.143-167
• /
• 2006

Despite the popularity of e-commerce, the understanding of preferred product types for information searches and purchase on the internet are not sufficient. This paper studies the effect of risk perception on information search behavior through online only, offline only, and on-offline together. Specially, this study classifies product types into search goods, experience goods, and credence goods. The study attempts to determine how the relationship between the perceived risk and the information search is influenced by the product knowledge level. The results show that the higher the risk perceptions about experience goods and credence goods, the more the consumer searches information through online and offline together when the consumer's knowledge level is low. When the consumer's knowledge level is high, however, the higher the risk perception regarding search goods, the more the consumer searches information through online only.

• Journal of Global Scholars of Marketing Science
• /
• v.14
• /
• pp.17-37
• /
• 2004

This research is speak that is tendencious in comprehension of external consumer information search behavior using on-line external information source to consumers who use on-line that is used as corporations' main strategic means. That is, classify consumer groups which was atomized according to type inflict consumer's information search knowledge level and shopping value study which use on-line, and decision factors of information search that these groups can influence a difference or each group which use information sources grasped what it is. Result that investigate information search knowledge level difference about study finding on-line information source utilization used mainly portal site, comparison site, auction site. And, utilization shopping pursuit value group used information source by portal site, auction site, niche shopping mall site and hedonic shopping pursuit value group used information source by portal site, auction site, shopping mall site. It confirmed that all variables(i.e. consumer-based variable and web site-based variable) are influencing variously in on-line external information search types. Finally, we proposed different way to erect strategic model about consumers that use on-line with study finding that see.

• Journal of Digital Convergence
• /
• v.18 no.10
• /
• pp.207-217
• /
• 2020

The purpose of this study is to examine the structural relationship between the digital platform capabilities of financial institutions and the impact of customer orientation on service innovation behavior through exploitation/exploration. A survey was conducted on employees of financial institutions to verify the research model, and the final 280 copies of the questionnaire were analyzed using SPSS 25 and SmartPLS 2.0. As a major research result, First, digital platform competency has a positive effect on exploitation and exploration. Second, customer orientation has a positive effect on exploitation, but not on exploration. Third, both exploitation and exploration have a positive impact on service innovation behavior. Through this research, this study shed new light on the relationship between digital platform capability and customer orientation that affects service innovation behavior of financial institutions, and expanded the scope of research through empirical research. Future research will require research attempts on various variables and research samples.

• Journal of the Korea Society of Computer and Information
• /
• v.11 no.1 s.39
• /
• pp.129-138
• /
• 2006

Various techniques have been applied to solve the maximal covering problem. Tabu search is also one of them. But, existing researches were lacking of the synthetic analysis and the effort for performance improvement about neighborhood search techniques such as hill-climbing search and simulated annealing including tabu search. In this paper, I introduce the way to improve performance of neighborhood search techniques through various experiments and analyses. Basically, all neighborhood search algorithms use the k-exchange neighborhood generation method. And I analyzed how the performance of each algorithm changes according to various parameter settings. Experimental results have shown that simple hill-climbing search and simulated annealing can produce better results than any other techniques. And I confirmed that simple hill-climbing search can produce similar results as simulated annealing unlike general case.