• Journal of Technology Innovation
• /
• v.12 no.1
• /
• pp.115-134
• /
• 2004

In this paper, we tried to find the bottleneck factors of firms' innovative activities using the KIS (Korea Innovation Survey) 2002 data. Employing the method of factor analysis, we identified five bottleneck factors of innovative activities: organizational bottleneck factor, innovative bottleneck factor, economic bottleneck factor, supply-chain bottleneck factor, and market-environment bottleneck factor. Using regression analysis which includes the five bottleneck factors, industry characteristics variables (market concentration, technological opportunity, appropriability), and other control variables, we found (1) that all the five bottleneck factors are negatively related with innovative activities, (2) that technological opportunity and appropriability conditions are positively related with innovative activities, (3) that there is an inverted-U relationship between market concentration and innovative activities, and (4) that firm size has no significant influence on firms' innovative activities.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2000.10a
• /
• pp.681-684
• /
• 2000

본 논문은 Client & Server 모델을 기반으로 선로 이용률과 응답시간을 분석, 조합하여 웹 상에서 해당 목적지 경로 사이에 있을 수 있는 bottleneck 구간을 탐지하기 위한 시스템을 설계하였다. 이를 위해 traceroute를 이용하여 사용자와 해당 목적지 경로 사이의 인터페이스들을 추적하였다. 추적된 인터페이스들의 IP로 TCP/IP 표준 네트워크 망 관리 프로토콜인 SNMP Polling을 하여 인터페이스로부터 각종 MIB 정보들을 가져와 각 인터페이스간의 선로 이용률을 분석해냈으며, 또한 정확한 bottleneck 구간을 알아내고자 각 라우터로 ping을 실행시켜 응답시간을 계산하였다. 이렇게 얻은 선로 이용률과 응답시간으로 보다 정확한 트래픽 정보와 bottleneck 구간을 분석해낼 수 있었다. 이러한 분석 시스템으로 인해 사용자들은 전문적인 지식 없이 단지 자신의 컴퓨터의 웹브라우저를 통한 서버 분석 시스템 접속만으로도 해당 구간의 어떤 부분이 bottleneck 구간인지를 탐지, 분석할 수 있을 것이다.

• Journal of applied mathematics & informatics
• /
• v.28 no.1_2
• /
• pp.531-537
• /
• 2010

In this paper, some vacation policies are considered, which can be related to the past behavior of the system. The server, after serving all customers, stays idle or to wait for some time before a vacation is taken. General formulas for the waiting time and the amount of work in the system are derived for a vacation policy. Using the analysis on the vacation system, we derived the waiting time in the sequential bottleneck station.

• Asian-Australasian Journal of Animal Sciences
• /
• v.18 no.7
• /
• pp.915-921
• /
• 2005

Genetic variation at 25 microsatellite loci, population structure, and genetic bottleneck hypothesis were examined for Ankleshwar poultry population found in Gujrat, India. The estimates of genetic variability such as effective number of alleles and gene diversities revealed substantial genetic variation frequently displayed by microsatellite markers. The average polymorphism across the studied loci and the expected gene diversity in the population were 6.44 and 0.670${\pm}$0.144, respectively. The population was observed to be significantly differentiated into different groups, and showed fairly high level of inbreeding (f = 0.240${\pm}$0.052) and global heterozygote deficit. The bottleneck analysis indicated the absence of genetic bottleneck in the past. The study revealed that the Ankleshwar poultry breed needs appropriate genetic management for its conservation and improvement. The information generated in this study may further be utilized for studying differentiation and relationships among different Indian poultry breeds.

• The KIPS Transactions:PartC
• /
• v.16C no.5
• /
• pp.621-628
• /
• 2009

Wireless sensor networks (WSNs) have been considered as a promising method for reliably monitoring both civil and military environments under hazardous or dangerous conditions. Due to the special property and difference from the traditional wireless network, the lifetime of the whole network is the most important aspect. The bottleneck nodes widely exist in WSNs and lead to decrease the lifetime of the whole network. In order to find out the bottleneck nodes, the traditional centralized bottleneck detection method MINCUT has been proposed as a solution for WSNs. However they are impractical for the networks that have a huge number of nodes. This paper first proposes a distributed algorithm called DBND (Distributed Bottleneck Node detection) that can reduce the time for location information collection, lower the algorithm complexity and find out the bottleneck nodes quickly. We also give two simple suggestions of how to solve the bottleneck problem. The simulation results and analysis show that our algorithm achieves much better performance and our solutions can relax the bottleneck problem, resulting in the prolonging of the network lifetime.

• Journal of The Institute of Information and Telecommunication Facilities Engineering
• /
• v.8 no.4
• /
• pp.170-181
• /
• 2009

When a slow-moving vehicle occupies one of the lanes of a multi-lane highway, it often causes queuing behind, unlike one is caused by an actual stoppage on that lane. This happens when the traffic flow rate upstream from the slow vehicle exceeds a certain critical value. This phenomena is called as the Moving Bottleneck, defined by Gazis and Herman (1992), Newell (1998) [3], and Munoz and Daganzo (2002), who conducted the flow estimates of upstream and downstream and considered slow-moving vehicle speed and the flow ratio exceeding slow vehicle and the microscopic traffic flow characteristics of moving bottleneck. But, a study of delay on moving bottleneck was not conducted until now. So this study provides a average delay time model related to upstream flow and the speed of slow vehicle. We have chosen the two-lane highway and homogeneous traffic flow. A slow-moving vehicle occupies one of the two lanes. Average delay time value is a result of AIMSUN[9], the microscopic traffic flow simulator. We developed a multiple regression model based on that value. Average delay time has a high value when the speed of slow vehicle is decreased and traffic flow is increased. Conclusively, the model is formulated by the negative exponential function.

• Journal of the Korean Mathematical Society
• /
• v.35 no.3
• /
• pp.727-740
• /
• 1998

Controlling traffic lights at a bottleneck, in [5] a time of open passage is called optimal, if it minimizes the first moment of the asymptotic distribution of the queue length. The discussion of the first moment as function of the time of open passage is based on an analysis of the behavior of a fixed point when varying control parameters and delivers theoretical and computational aspects of the traffic problem.

• Culinary science and hospitality research
• /
• v.13 no.1 s.32
• /
• pp.179-191
• /
• 2007

This paper aims to improve management and make the bakery business stable by investigating the difficulties in bakery management and the current management conditions of bakery businesses. Using Windows SPSS 11.0, the bottleneck in bakery management and its influence on sales and job satisfaction were analyzed. Besides, a regression analysis was conducted to investigate the effect of difficulties in bakery management on sales and job satisfaction. According to the analysis, a total of 44 variables were observed as the difficulties in bakery management. Among them, 34 variables were caused by 7 factors: facility, product, employee, finance, production, external advertisement. In the regression analysis, it has turned out that the difficulties in management had influence on sales dissatisfaction in facility, product, employee, finance, production, and external factors. Especially, employee factor turned out the most influential one on sales dissatisfaction. Furthermore, it has turned out that the bottleneck in management had influence on job dissatisfaction in all 7 factors. Above all, the external factor turned out the most influential one.

• ETRI Journal
• /
• v.22 no.4
• /
• pp.1-12
• /
• 2000

Designing a reliable multicast-based network that scales to the size of a multicast group member is difficult because of the diversity of user demands. The loss inferences of internal nodes by end-to-end measurements do not require the use of complete statistics because of the use of maximum likelihood estimation. These schemes are very efficient and the inferred value converges fast to its true value. In the theoretical analysis, internal delay estimation is possible but the analysis is very complex due to the continuity property of the delay. In this paper, we propose the use of a bottleneck location estimator. This can overcome the analytical difficulty of the delay estimation using the power spectrum of the packet interarrival time as the performance metric. Both theoretical analysis and simulation results show that the proposed scheme can be used for bottleneck location inference of internal links in scalable multicasting.

• Journal of KIISE:Information Networking
• /
• v.29 no.1
• /
• pp.40-47
• /
• 2002

This paper analyzes the performance of an optical line termination system in ATM based Passive Optical Network(PON) using the operational analysis. We analyze it using system parameters such as utilization, throughput and routing frequency based on the buffer structure in each block of ATM-PON. Furthermore, we derive the mean response time and the visit ratio of each block, and then search the bottleneck block that hinders the system performance. We found that the 622Mbps 16x16 switching block is the bottleneck block for ATM-PON. In this bottleneck block, the loss probability increases rapidly when the cell arrival rate increases.