• Title/Summary/Keyword: Minimum connection time

Search Result 51, Processing Time 0.03 seconds

A Branch-and-price Approach to the ATM Switching Node Location Problem

  • Kim, Deokseong;Park, Sunsoo;Lee, Kyungsik;Park, Kyungchul
    • Industrial Engineering and Management Systems
    • /
    • v.3 no.2
    • /
    • pp.92-99
    • /
    • 2004
  • We consider the ATM switching node location problem (ANLP). In this problem, there are two kinds of facilities, hub facilities and remote facilities, with different capacities and installation costs. We are given a set of customers with each demand requirements, a set of candidate installation sites of facilities, and connection costs between facilities. We need to determine the locations to place facilities, the number of facilities for each selected location, the set of customers who are connected to each installed hub via installed remote facilities with minimum cost, while satisfying demand requirements of each customer. We formulate this problem as a general integer programming problem and solve it to optimality. In this paper, we present a preprocessing procedure to tighten the formulation and develop a branch-and-price algorithm. In the algorithm, we consider the integer knapsack problem as the column generation problem. Computational experiments show that the algorithm gives optimal solutions in a reasonable time.

Flutter Characteristics ofAircraft Wing Considering Control Surface and Actuator Dynamics with Friction Nonlinearity

  • Lee, Seung-Jun;Lee, In;Shin, Won-Ho
    • International Journal of Aeronautical and Space Sciences
    • /
    • v.8 no.1
    • /
    • pp.140-147
    • /
    • 2007
  • Whenever the hinge axis of aircraft wing rotates, its stiffness varies. Also, there are nonlinearities in the connection of the actuator and the hinge axis, and it is necessary to inspect the coupled effects between the actuator dynamics and the hinge nonlinearity. Nonlinear aeroelastic characteristics are investigated by using the iterative V-g method. Time domain analyses are also performed by using Karpel's minimum state approximation technique. The doublet hybrid method(DHM) is used to calculate the unsteady aerodynamic forces in subsonic regions. Structural nonlinearity located in the load links of the actuator is assumed to be friction. The friction nonlinearity of an actuator is identified by using the describing function technique. The nonlinear flutter analyses have shown that the flutter characteristics significantly depends on the structural nonlinearity as well as the dynamic stiffness of an actuator. Therefore, the dynamic stiffness of an actuator as well as the nonlinear effect of hinge axis are important factors to determine the flutter stability.

FINITE STRIP ANALYSIS OF FOLDED LAMINATED COMPOSITE PLATES (유한대판법에 의한 복합적층절판의 해석)

  • Yoon, Seok Ho;Han, Sung Cheon;Chang, Suk Yoon
    • Journal of Korean Society of Steel Construction
    • /
    • v.13 no.1
    • /
    • pp.41-52
    • /
    • 2001
  • In this paper the analysis of laminate composite folded plates with arbitrary angle connection like box girder is studied by finite strip method Total stiffness of laminated plate is obtained by integration of the stiffness in each layer or lamina through laminate thickness and total stiffness in each layer or lamina through laminate thickness and total tiffness matrix is obtained by substitutionto equilibrium equation derived from the minimum total potential energy theorem. The assumed displacement functions for a finite strip method in plate or box girder analysis are combinations of one-way polynomial functions in the transverse direction and harmonic functions in the span-wise direction. Finite strip method with the merits of the simplification in modeling and the reduction of analytical time is accurate in the analysis of laminate composite folded plates shaped like box firders.

  • PDF

A Study on Virtual Source-based Differentiated Multicast Routing and Wavelength Assignment Algorithms in the Next Generation Optical Internet based on DWDM Technology (DWDM 기반 차세대 광 인터넷 망에서 VS기반의 차등화된 멀티캐스트 라우팅 및 파장할당 알고리즘 연구)

  • Kim, Sung-Un;Park, Seon-Yeong
    • Journal of Korea Multimedia Society
    • /
    • v.14 no.5
    • /
    • pp.658-668
    • /
    • 2011
  • Over the past decade, the improvement of communications technologies and the rapid spread of www (World Wide Web) have brought on the exponential growth of users using Internet and real time multimedia multicast services like video conferencing, tele-immersive virtual reality, and Internet games. The dense-wavelength division multiplexing (DWDM) networks have been widely accepted as a promising approach to meet the ever-increasing bandwidth demands of Internet users, especially in next generation Internet backbone networks for nation-wide or global coverage. A major challenge in the next generation Internet backbone networks based on DWDM technologies is the resolution of the multicasting RWA (Routing and Wavelength Assignment) problem; given a set of wavelengths in the DWDM network, we set up light-paths by routing and assigning a wavelength for each connection so that the multicast connections are set-upped as many as possible. Finding such optimal multicast connections has been proven to be Non-deterministic Polynomial-time-complete. In this paper, we suggest a new heuristic multicast routing and wavelength assignment method for multicast sessions called DVS-PMIPMR (Differentiated Virtual Source-based Priority Minimum Interference Path Multicast Routing algorithm). We measured the performance of the proposed algorithm in terms of number of wavelength and wavelength channel. The simulation results demonstrate that DVS-PMIPMR algorithm is superior to previous multicast routing algorithms.

A Study on Electromyogram Signals Recognition Technique using Neural Network and Genetic Algorithms (신경회로망과 유전알고리즘을 이용한 근전신호 인식기법)

  • Shin, Chul-Kyu;Lee, Sang-Min;Lee, Eun-Sil;Kwon, Jang-Woo;Jang, Young-Gun;Hong, Seung-Hong
    • Journal of the Korean Institute of Telematics and Electronics S
    • /
    • v.35S no.11
    • /
    • pp.176-183
    • /
    • 1998
  • A new recognition technique using neural network coupled with Genetic Algorithms (GAs) was proposed. This technique concentrate on efficient Electromyography signal recognition through out improving neural network's several demerits. GAs paly a role of selecting Multilayer Perceptron's optimized initial connection weights by its typical global search. Electro Myography signal was pre-processed with Hidden Markov Model (HMM) in order to refect its time-varying property into input pattern except other features such as Zero Crossing Number(ZCN) and Integral Absolute Value (IAV). Results for 6 primitive motions show that the suggested technique has better performance in learning time and recognition rates than already established ordinary methods. Moreover, it performed stable recognition without convergence into a local minimum.

  • PDF

Current and voltage loading tests off resistive SFCL

  • 최효상;현옥배;김혜림;황시돌;박권배
    • Progress in Superconductivity
    • /
    • v.3 no.2
    • /
    • pp.241-246
    • /
    • 2002
  • We have performed the current and voltage loading tests of resistive superconducting fault current limiters (SFCLS) based on $YBa_2$$Cu_3$$O_{7}$(YBCO) films with the diameter of 2 inch. The SFCL consists of meander-type YBCO stripes covered with 200 nm Au layer grown in situ for current shunt and heat dispersion at hot spots. The minimum quench current of an SFCL unit was about 25 Apeak. Seven SFCL units were connected in parallel fur the current load ing tests at power source of 100 $V_{rms}$ $/2,000A_{rms}$. This SFCL units had maximum limiting current of 170 Apeak during the fault instant and then successfully controlled the fault current below 100 Apeak within 1~2 msec after short circuit. Increased short current also reduced the quench completion time with little change of current limiting characterization. We connected six SFCL units in series fur the voltage loading tests at power source of $1,200 V_{rms}$/170 $A_{rms}$ at this time. The shunt resistors were inserted into each SFCL unit to eliminate power imbalance originated from serial connection of SFCL units. Each SFCL unit was quenched simultaneously during the fault condition. The current increased up to 40 $A_{peak}$ and decreased to 14 $A_{peak}$ after 3 cycles. Quench was completed within 1 msec after the fault. We confirmed operating characteristics of 140 kVA($120 A_{rms}$ $\times$ 1,200 $V_{rms}$) SFCL and presented the manufacturing possibility of 3.3 kV SFCL using 4 inch YBCO films.BCO films.lms.

  • PDF

A Study on Application of Teaching-Learning Program based on Constructivist Views for Mathematically gifted Students in Primary School (초등 영재 교육에서의 구성주의 교수.학습 모형 적용 연구 - 알고리즘 문제를 중심으로 -)

  • Choi, Keun-Bae;Kim, Hong-Seon
    • Communications of Mathematical Education
    • /
    • v.21 no.2 s.30
    • /
    • pp.153-176
    • /
    • 2007
  • The purpose of this paper is to analyze teaching-learning program which can be applied to mathematically gifted students in primary school, Our program is based on constructivist views on teaching and learning of mathematics. Mainly, we study the algorithmic thinking of mathematically gifted students in primary school in connection with the network problems; Eulerian graph problem, the minimum connector problem, and the shortest path problem, The above 3-subjects are not familiar with primary school mathematics, so that we adapt teaching-learning model based on the social constructivism. To achieve the purpose of this study, seventeen students in primary school participated in the study, and video type(observation) and student's mathematical note were used for collecting data while the students studied. The results of our study were summarized as follows: First, network problems based on teaching-learning model of constructivist views help students learn the algorithmic thinking. Second, the teaching-learning model based on constructivist views gives an opportunity of various mathematical thinking experience. Finally, the teaching-learning model based on constructivist views needs more the ability of teacher's research and the time of teaching for students than an ordinary teaching-learning model.

  • PDF

Subsequent application of self-organizing map and hidden Markov models infer community states of stream benthic macroinvertebrates

  • Kim, Dong-Hwan;Nguyen, Tuyen Van;Heo, Muyoung;Chon, Tae-Soo
    • Journal of Ecology and Environment
    • /
    • v.38 no.1
    • /
    • pp.95-107
    • /
    • 2015
  • Because an ecological community consists of diverse species that vary nonlinearly with environmental variability, its dynamics are complex and difficult to analyze. To investigate temporal variations of benthic macroinvertebrate community, we used the community data that were collected at the sampling site in Baenae Stream near Busan, Korea, which is a clean stream with minimum pollution, from July 2006 to July 2013. First, we used a self-organizing map (SOM) to heuristically derive the states that characterizes the biotic condition of the benthic macroinvertebrate communities in forms of time series data. Next, we applied the hidden Markov model (HMM) to fine-tune the states objectively and to obtain the transition probabilities between the states and the emission probabilities that show the connection of the states with observable events such as the number of species, the diversity measured by Shannon entropy, and the biological water quality index (BMWP). While the number of species apparently addressed the state of the community, the diversity reflected the state changes after the HMM training along with seasonal variations in cyclic manners. The BMWP showed clear characterization of events that correspond to the different states based on the emission probabilities. The environmental factors such as temperature and precipitation also indicated the seasonal and cyclic changes according to the HMM. Though the usage of the HMM alone can guarantee the convergence of the training or the precision of the derived states based on field data in this study, the derivation of the states by the SOM that followed the fine-tuning by the HMM well elucidated the states of the community and could serve as an alternative reference system to reveal the ecological structures in stream communities.

Performance Analysis and Design of Multiservice Network for Constant- and Adaptive-rate Services (고정 전송율 및 가변 전송율 서비스를 지원하는 다중 서비스 네트워크의 성능 분석 및 설계)

  • 이태진
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.26 no.11C
    • /
    • pp.33-42
    • /
    • 2001
  • We consider a model describing large scale performance of multiservice networks supporting both constant- and adaptive-rate services. As the number of constant-rate connection changes over time in multiservice networks, the available bandwidth for adaptive-rate connections changes as well. We estimate the available bandwidth for adaptive-rate service in a dynamically changing traffic environment based on Erlang fixed point equation and Little\`s law. The bandwidth allocation for adaptive-rate service is determined by the max-min fairness criterion. We find an upper bound on the average minimum throughput for adaptive-rate service, and 7how that the bound is achieved in large-capacity networks. This is verified using network examples. Since max-min fair allocation may not maximize the total throughput or revenue in a network, we consider adjustments via network level priority schemes to increase efficiency.

  • PDF

An Automatic Portscan Detection System with Adaptive Threshold Setting

  • Kim, Sang-Kon;Lee, Seung-Ho;Seo, Seung-Woo
    • Journal of Communications and Networks
    • /
    • v.12 no.1
    • /
    • pp.74-85
    • /
    • 2010
  • For the purpose of compromising hosts, attackers including infected hosts initially perform a portscan using IP addresses in order to find vulnerable hosts. Considerable research related to portscan detection has been done and many algorithms have been proposed and implemented in the network intrusion detection system (NIDS). In order to distinguish portscanners from remote hosts, most portscan detection algorithms use a fixed threshold that is manually managed by the network manager. Because the threshold is a constant, even though the network environment or the characteristics of traffic can change, many false positives and false negatives are generated by NIDS. This reduces the efficiency of NIDS and imposes a high processing burden on a network management system (NMS). In this paper, in order to address this problem, we propose an automatic portscan detection system using an fast increase slow decrease (FISD) scheme, that will automatically and adaptively set the threshold based on statistical data for traffic during prior time periods. In particular, we focus on reducing false positives rather than false negatives, while the threshold is adaptively set within a range between minimum and maximum values. We also propose a new portscan detection algorithm, rate of increase in the number of failed connection request (RINF), which is much more suitable for our system and shows better performance than other existing algorithms. In terms of the implementation, we compare our scheme with other two simple threshold estimation methods for an adaptive threshold setting scheme. Also, we compare our detection algorithm with other three existing approaches for portscan detection using a real traffic trace. In summary, we show that FISD results in less false positives than other schemes and RINF can fast and accurately detect portscanners. We also show that the proposed system, including our scheme and algorithm, provides good performance in terms of the rate of false positives.