• Title/Summary/Keyword: Real-time solution

검색결과 1,141건 처리시간 0.029초

광마이크로셀 이동통신망에서의 채널관리를 위한 동적 섹터결정 (Microcell Sectorization for Channel Management in a PCS Network by Tabu Search)

  • 이채영;윤정훈
    • 대한산업공학회지
    • /
    • 제26권2호
    • /
    • pp.155-164
    • /
    • 2000
  • Recently Fiber-optic Micro-cellular Wireless Network is considered to solve frequent handoffs and local traffic unbalance in microcellular systems. In this system, central station which is connected to several microcells by optical fiber manages the channels. We propose an efficient sectorization algorithm which dynamically clusters the microcells to minimize the blocked and handoff calls and to balance the traffic loads in each cell. The problem is formulated as an integer linear programming. The objective is to minimize the blocked and handoff calls. To solve this real time sectorization problem the Tabu Search is considered. In the tabu search intensification by Swap and Delete-then-Add (DTA) moves is implemented by short-term memory embodied by two tabu lists. Diversification is considered to investigate proper microcells to change their sectors. Computational results show that the proposed algorithm is highly effective. The solution is almost near the optimal solution and the computation time of the search is considerably reduced compared to the optimal procedure.

  • PDF

학위논문 심사스케쥴링에 관한 연구 (A Thesis Committee Scheduling)

  • 양광민;신승철
    • 한국경영과학회지
    • /
    • 제15권2호
    • /
    • pp.17-31
    • /
    • 1990
  • This problem analyzed in this paper is to specify a schedule for thesis committee allowing maximum committee members' preference over thesis topics and meeting time-slots while satisfying other related scheduling requirements such as prohibiting simultaneous assignment of a committee member to more than one committee at a time. Two mathematical programming applroaches are presented to solve the thesis committee scheduling problem in a professional graduate school. They include LP-based branch-and-bound approach with network subproblems. Characterization of the problem is analyzed to develop an efficient solution algorithm. Implementation and computational experiments are also performed for real size problems on an IBM PC/AT to show the relative performance of the propsoed approaches along with an ordinary ILP solution approach.

  • PDF

지하철 일간승무계획문제의 정수계획해법 (An Integer Programming Approach to the Subway Daily Crew Scheduling Problem)

  • 변종익;이경식;박성수;강성열
    • 한국경영과학회지
    • /
    • 제27권4호
    • /
    • pp.67-86
    • /
    • 2002
  • This paper considers subway crew scheduling problem. Crew scheduling is concerned with finding a minimum number of assignments of crews to a given timetable satisfying various restrictions. Traditionally, crew scheduling problem has been formulated as a set covering or set partitioning problem possessing exponentially many variables, but even the LP relaxation of the problem is hard to solve due to the exponential number of variables. In this paper. we propose two basic techniques that solve the subway crew scheduling problem in a reasonable time, though the optimality of the solution is not guaranteed. We develop an algorithm that solves the column-generation problem in polynomial time. In addition, the integrality of the solution is accomplished by variable-fixing technique. Computational result for a real instance is reported.

혼합모델 조립라인에서 부품사용의 일정률 유지를 위한 생산순서 결정 : 유전알고리즘 적용 (Sequencing Problem to Keep a Constant Rate of Part Usage In Mixed Model Assembly Lines : A Genetic Algorithm Approach)

  • 현철주
    • 대한안전경영과학회지
    • /
    • 제9권4호
    • /
    • pp.129-136
    • /
    • 2007
  • This paper considers the sequencing of products in mixed model assembly lines under Just-In-Time (JIT) systems. Under JIT systems, the most important goal for the sequencing problem is to keep a constant rate of usage every part used by the systems. The sequencing problem is solved using Genetic Algorithm Genetic Algorithm is a heuristic method which can provide a near optimal solution in real time. The performance of proposed technique is compared with existing heuristic methods in terms of solution quality. Various examples are presented and experimental results are reported to demonstrate the efficiency of the technique.

THERMALLY INDUCED PHASE SEPARATION IN TERNARY POLYMER SOLUTION

  • Jung, Bum-Suk;Kang, Yong-Soo;Jones, Richard-A.L.
    • 한국막학회:학술대회논문집
    • /
    • 한국막학회 1999년도 The 7th Summer Workshop of the Membrane Society of Korea
    • /
    • pp.79-82
    • /
    • 1999
  • Using Small Angle Light Scattering (SALS), the effect of quench depth on the kinetics of phase separation for ternary solution blends was investigated. The system was composed of two polymers (polystyrene and polybutadiene) and a solvent (toluene). The analyses of the early stage of phase separation were based of the Cahn-Hilliard theory [1,5]. Apparent diffusion coefficients and the fastest mode of fluctuations were evaluated, when quench depth of the system were varied near the critical composition of polymer. In the late stage of phase separation, the domain growth showed a power law with the 1/3 exponent, i.e. $q_m(t)~t^{-1/3}$. For comparison between real images and scattering profiles with time, the image of phase domains with time were obtained by using Laser Confocal Scanning Microscopy (LSCM).

  • PDF

냉연 공정에서의 작업단위 편성 (A Job Sequencing Model for Cold Coil Production Processes)

  • 전치혁;이승만;박철순;강상엽;장수영;최인준;강전태
    • 산업공학
    • /
    • 제6권2호
    • /
    • pp.117-131
    • /
    • 1993
  • A job sequencing model is developed and its computer system is tested for processing cold-rolled coils in Tandem Cold Mills(TCM) at the Pohang Iron and Steel Company. Given coils waiting to be processed, this system generates a sequence of jobs satisfying operational constraints for the TCM process. We formulate the problem as a constraint satisfaction problem and employ the backtracking technique combined with looking ahead features in order to generate a feasible solution within a reasonable time. Our system is implemented in C language on 80486-based IBM PC. Some tests based on the real data show that our system is adequate with respect to search time and that it consistantly generates a good feasible solution.

  • PDF

Atomic Absorption Spectrophotometric Determination of Trace Cadimuim after Preconcentration by Extracting Its 8-Hydroxyquinoline Complex into Molten Benzophenone

  • 최희선;김영상
    • Bulletin of the Korean Chemical Society
    • /
    • 제17권4호
    • /
    • pp.338-342
    • /
    • 1996
  • A sensitive method for the determination of trace cadmium after the preconcentration by extracting its 8-hydroxyquinoline complex into a molten benzophenone was developed. Several experimental conditions such as the pH of solution, the amounts of 8-hydroxyquinoline and benzophenone, stirring time, and standing time were optimized. Trace cadmium in 100 mL water sample was chelated with 2.5 mL of 0.001 M 8-hydroxyquinoline at pH 8.0. After 0.07 g benzophenone was added, the solution was heated to about 70 ℃ and stirred vigorously for 1 minute to dissolve the complex quantitatively in a molten benzophenone, and stood for 30 minutes to reproduce the microcrystalline benzophenone. The benzophenone containing Cd-8-hydroxyquinoline complex was filtered and dissolved in acetone. Cadmium was determined by a flame atomic absorption spectrophotometry. The interfering effects of diverse concomitant ions were investigated and eliminated. This method could be applied to natural water samples and the recovery of more than 90% was obtained in the real samples.

이중 협상 해법을 이용한 새로운 다중 접속 네트워크에서 자원 할당 기법 (A New Dual Connective Network Resource Allocation Scheme Using Two Bargaining Solution)

  • 전우선;김승욱
    • 정보처리학회논문지:컴퓨터 및 통신 시스템
    • /
    • 제10권8호
    • /
    • pp.215-222
    • /
    • 2021
  • 이중 연결 네트워크(Dual Connectivity Network)는 소몰 셀 기지국(SBS: Smallcell Base Station)의 제한된 자원 문제와 간섭 문제를 완화하기 위해 스몰 셀 기지국과 매크로 셀 기지국(MBS: Macrocell Base Station)이 협력하여 서비스를 지원하는 기술이다. 하지만 이중 연결 네트워크 역시 한정된 자원을 분배해주는 기술이기 때문에 자원 할당 방식은 매우 중요한 문제이다. 그래서 본 논문에서는 이중 연결 네트워크에서 효율적이고 공정한 자원할당을 위해 일반화된 강한 포부 협상 해법(GTABS: Generalizing Tempered Aspiration Bargaining Solution)과 굽타 리빈 협상 해법(GLBS:Gupta and Livne Bargaining Solution)을 이용한 두 단계 자원 분배 알고리즘을 제안한다. 단계 자원 분배 알고리즘은 다음과 같다. 첫 번째 단계인 그룹 자원 분배 알고리즘에서는 GTABS를 이용하여 각 기지국의 무선 자원을 실시간 그룹과 비 실시간 그룹에게 효율적으로 할당한다. 두 번째 단계인 사용자 자원 분배 알고리즘에서는 GLBS를 이용하여 각 그룹으로 나누어진 자원을 각 그룹의 사용자들에게 최적으로 할당한다. 이러한 두 단계 자원 분배 방식은 5G 무선 자원을 최적으로 할당하여 네트워크 시스템 성능 최대화와 사용자 만족도를 동시에 보장한다. 마지막으로 본 논문에서는 성능 평가를 통해 제안된 방식이 서비스 요청 증가에 따라 전체 시스템 처리량, 공정성, 통신 장애율 측면에서 비교 방식들 보다 모두 10% 이상의 효율성을 입증했다.

Mitigating the Impact of Mobility on H.264 Real-Time Video Streams Using Multiple Paths

  • Calafate, Carlos T.;Malumbres, Manuel P.;Manzoni, Pietro
    • Journal of Communications and Networks
    • /
    • 제6권4호
    • /
    • pp.387-396
    • /
    • 2004
  • One of the main problems associated with MANETs is that mobility and the associated route discovery and maintenance procedures of reactive routing protocols cause severe interruptions on real-time video streams. Some of these interruptions are too large to be concealed using any sort of video technology, resulting in communications breaks unpleasant for the final end user. We present a solution for enhanced video transmission that increases route stability by using an improved route discovery process based on the DSR routing protocol, along with traffic splitting algorithms and a preventive route discovery mechanism. We also present some video adaptative mechanisms that improve the overall performance of multipath routing in terms of video data replication and video packet splitting strategies. Combining our proposals, we achieve up to 97% less interruptions on communication with high mobility and over 1.2 dB of improvements in terms of video distortion.

SPR-based Antibody-Antigen Interaction for Real Time Analysis of Carbamate Pesticide Residues

  • Yang, Gil-Mo;Kang, Suk-Won
    • Food Science and Biotechnology
    • /
    • 제17권1호
    • /
    • pp.15-19
    • /
    • 2008
  • This research was conducted to develop a quick and sensitive method of detecting carbamate residues using the immobilization of antibody-antigen interactions with surface plasmon resonance (SPR). We have used commercialized surface plasmon resonance equipment (Biacore 3000). The antibody used for the immunoassay was specific for glutathione-s-transferase (GST) and the antigens included several carbamate pesticides (carbofuran, carbaryl, and benfuracarb). When antigens were applied to the protein GST, the detection limit was 2 ng/mL of carbamate pesticide. The fabricated protein GST maintained its activity for over 200 measurements. Thus we determined that the SPR biosensors could detect the specific reversible binding of a reactant in solution to a binding partner immobilized on the surface of the sensor and allow real-time detection and monitoring.