• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.1
• /
• pp.68-86
• /
• 2015

Future wireless network aims to integrate different radio access networks (RANs) to provide a seamless access and service continuity. In this paper, a new resource denotation method is proposed in the WLAN and LTE heterogeneous networks based on a concept of spectral bandwidth mapping. This method simplifies the denotation of system resources and makes it possible to calculate system residual capacity, upon which an economic model-based network selection algorithm is designed in both under-loaded and over-loaded scenarios in the heterogeneous networks. The simulation results show that this algorithm achieves better performance than the utility function-based access selection (UFAS) method proposed in [12] in increasing system capacity and system revenue, achieving load balancing and reducing the new call blocking probability in the heterogeneous networks.

• Proceedings of the Korea Society for Simulation Conference
• /
• 1998.10a
• /
• pp.128-132
• /
• 1998

This research is concerned with buffer management in a multi-cell FMS(Flexible Manufacturing System) with an AGVS(Automated Guided Vehicle System). To reduce blocking and starving caused by breakdowns, variablility in process times, and diversity of part routing, buffer is needed. Due to the high per unit buffer cost, which primarily consists of floor space and equipment cost, the total capacity of buffers in an FMS is very limited. Therefore, proper buffer management can provide a high system efficiency. This paper presents a buffer management model for a multi-cell FMS with an AGVS and a simulation study to compare the proposed model to a conventional buffer management model in a job shop FMS.

• Journal of the Korea Institute of Military Science and Technology
• /
• v.15 no.4
• /
• pp.442-449
• /
• 2012

Cognitive Radio(CR) is the technology that allocates the frequency by using dynamic spectrum access. We proposed a model to calculate the optimal level of the cognitive radiotelegraph, where secondary users opportunistically share the spectrum with primary users through the spectrum sensing. When secondary user with cognitive radio detects the arrival of a primary user in its current channel, the secondary user moves to the idle channel or be placed in the virtual queue. We assume that the primary users have finite buffers and the population of secondary users is finite. Using a two-dimensional Makov model with preemptive priority queueing, we could derive the blocking and waiting probability as well as the optimal level of cognitive radiotelegraph under a various range of parameter circumstances.

• Journal of information and communication convergence engineering
• /
• v.21 no.4
• /
• pp.329-336
• /
• 2023

This paper introduces an edge AI-based scene-specific object detection system for long-term traffic management, focusing on analyzing congestion and movement via cameras. It aims to balance fast processing and accuracy in traffic flow data analysis using edge computing. We adapt the YOLOv5 model, with four heads, to a scene-specific model that utilizes the fixed camera's scene-specific properties. This model selectively detects objects based on scale by blocking nodes, ensuring only objects of certain sizes are identified. A decision module then selects the most suitable object detector for each scene, enhancing inference speed without significant accuracy loss, as demonstrated in our experiments.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.39 no.3
• /
• pp.58-65
• /
• 2002

In order to reduce blocking artifacts in inter-frame coded images, we propose a new image restoration algorithm, which directly processes differential images before reconstruction. We note that blocking artifact in inter-frame coded images is caused by both 8$\times$8 DCT and 16$\times$16 macroblock based motion compensation, while that of intra-coded images is caused by 8$\times$8 DCT only. According to the observation, we Propose a new degradation model for differential images and the corresponding restoration algorithm that utilizes additional constraints and convex sets for discontinuity inside blocks. The proposed restoration algorithm is a modified version of standard regularization that incorporate!; spatially adaptive lowpass filtering with consideration of edge directions by utilizing a part of DCT coefficients. Most of video coding standard adopt a hybrid structure of block-based motion compensation and block discrete cosine transform (BDCT). By this reason, blocking artifacts are occurred on both block boundary and block interior For more complete removal of both kinds of blocking artifacts, the restored differential image must satisfy two constraints, such as, directional discontinuities on block boundary and block interior Those constraints have been used for defining convex sets for restoring differential images.

• Membrane Journal
• /
• v.19 no.1
• /
• pp.34-46
• /
• 2009

Effect of backflushing on the membrane fouling for polyethylene capillary membranes was examined by measuring the flux of $Al_2O_3$ colloidal suspensions through the cross flow microfiltration. In the comparison of with and without the application of backflushing, the hydraulic resistance to permeate flow of the suspension was less with backfluslng, but the Increasing rate in permeate resistance was higher. Regardless of backflushing, the cake filtration was dominant at the initial period of filtration with backflushing, being followed by the pore blocking. And at steady state, the fouling mechanism is almost governed by the cake filtration model. On the contrary, the pore blocking preceded the cake filtration in the initial stage of the original membrane before backflushing. And irrespective of backflushing, the ratio of cake filtration to total fouling increased, compared with that fur before backflushing. For the membrane with $0.24{\mu}m$ pore size, the permeate resistance was higher than that of $0.34{\mu}m$ pore size membrane. but the ratio of cake filtration was smaller than that of large pore membrane. In comparing the ratio of each fouling component to the total fouling for the case with backflushing pore blocking was 7.8% and cake filtration was 92.2%. for the case without backflushing, total fouling was composed of 9.6% pore blocking and 90.4% cake filtration.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.30 no.3
• /
• pp.119-135
• /
• 2005

Design of location erea(LA) in a cellular network is to partition the network into clusters of cells so as to minimize the cost of location updating and paging. Most research works dealing with the LA design problem assume that the call. arrival rate and mobile flow rate are fixed parameters which can be estimated independently. In this aspect, most Problems addressed so far are deterministic LA design problems(DLADP), known to be NP hard. The mobile flow and call arrival rate are, however, varying with time and should be treated simultaneously because the call arrival rate in a cell during a day is influenced by the change of a population size of the cell. This Paper Presents a new model on IA design problems considering the time-dependent call arrival and mobile flow rate. The new model becomes a stochastic LA design problem(SLADP) because It takes into account the possibility of paging waiting and blocking caused by the changing call arrival rate and finite paging capacity. Un order to obtain the optimal solution of the LA design problem, the SIADP is transformed Into the DLADP by introducing the utilization factor of paging channels and the problem is solved iteratively until the required paging quality is satisfied. Finally, an illustrative example reflecting the metropolitan area, Seoul, is provided and the optimal partitions of a cell structure are presented.

• Convergence Security Journal
• /
• v.11 no.6
• /
• pp.67-72
• /
• 2011

A system that provides a ubiquitous service is a networked system that has to overcome their circumstances that the service survivability is weak. the survivability of a networked system is defined as an ability of the system that can offer their services without interruption, regardless of whether components comprising the system are under failures, crashes, or physical attacks. This paper presents an approach that end users can obtain a quantitative evaluation of U-service survivability to reflect intended cyber attacks causing the networked system to fall into byzantine failures in addition to the definition of the survivability. In this paper, a Jini system based on wireless local area networks is used as an example for quantitative evaluation of U-service survivability. This paper also presents an continuous time markov chain (CTMC) Model for evaluation of survivability of U-service that a Jini system provides, and an approach to evaluate the survivability of the U-service as a blocking probability that end users can not access U-services.

• The KIPS Transactions:PartC
• /
• v.10C no.4
• /
• pp.463-470
• /
• 2003

Many types of switching fabrics have been proposed for use in ATM networks. Multistage Interconnection Networks (MINs) constitute a large class of ATM switching systems that are widely used in today´s internetworking. One of the most veil-known types of multistage networks is the banyan network. The banyan network is attractive for its simple routing scheme and low hardware complexity, but its throughput is very limited due to internal blocking and output contention. In this paper, we propose an input-buffered dual-banyan switch model with multiple switching fabric between switch input and output to avoid internal and Head-of Line blocking. By performance analysis and simulation, we show that our model has a lower ceil delay and 96% throughput which is much better than other banyan-type switch architecture.

• The Transactions of the Korea Information Processing Society
• /
• v.3 no.7
• /
• pp.1727-1738
• /
• 1996

This paper proposes a extended service filtering technique to solve overload control problems inService Con-trol Poin(SCP) due to Televoting (VOT) services with heavy traffic characteristics. Also, this paper compares this new technique with existing IN overload control lechniques, and calculate steady state call blocking probabilities in In under overload conditions. The proposed technique considers SCP overload and IN CS-1services such as VOT service that need to use the specialized resources of IP. This technique uses first an activating step which SCP sends service filtering request to SSP and IP for the start of service filtering. Then, in the filtering step SSP sendas filtering results to SCP periodically or each N-calls.Also,when filtering time-out timer expired or call counter value exceeded maximum number of calls,SSP stops service filtering,and sends ser-vice filteing response to SCP in the deactivating step. The application of this techique to VOT service defined in IN CS-1 service is investigated and analyzed by using an analytical VOT service model.In order to apply this technique to VOT service, this paper also discusses VOT service and the corresponding N architecture including Service Switching Point(SSP),SCP and IP. Then this paper also constructs an analytical VOT service model,and calculates SCP and SSP/IP(circuit)call blocking probablities.With the application of this new technique,this paper shows good performance enhancements in SCP call blocking probability.