• Title/Summary/Keyword: Binary Systems

Search Result 1,169, Processing Time 0.025 seconds

Analysis of Turbo Coding and Decoding Algorithm for DVB-RCS Next Generation (DVB-RCS Next Generation을 위한 터보 부복호화 방식 분석)

  • Kim, Min-Hyuk;Park, Tae-Doo;Lim, Byeong-Su;Lee, In-Ki;Oh, Deock-Gil;Jung, Ji-Won
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.36 no.9C
    • /
    • pp.537-545
    • /
    • 2011
  • This paper analyzed performance of three dimensional turbo code and turbo ${\Phi}$ codes proposed in the next generation DVB-RCS systems. In the view of turbo ${\Phi}$ codes, we proposed the optimal permutation and puncturing patterns for triple binary input data. We also proposed optimal post-encoder types and interleaving algorithm for three dimensional turbo codes. Based on optimal parameters, we simulated both turbo codes, and we confirmed that the performance of turbo ${\Phi}$ codes are better than that of three dimensional turbo codes. However, the complexity of turbo ${\Phi}$ is more complex than that of three dimensional turbo codes by 18%.

Development of Wired Monitoring System for Layers Rearing in Muti-tier Layers Battery by Machine Vision (기계시각을 이용한 고단 직립식 산란계 케이지의 유선 감시시스템 개발)

  • Zheng, S.Y.;Chang, D.I.;Lee, S.J.;So, J.K.
    • Journal of Biosystems Engineering
    • /
    • v.31 no.5 s.118
    • /
    • pp.436-442
    • /
    • 2006
  • This research was conducted to design and develop a wired monitoring system for judging if sick or dead layers (SDL) exist in multi-tier layers battery (MLB) by machine vision, and to analyze its performance. In this study, 20 Brown Leghorn (Hi-Brown) layers aged 37 weeks old, were used as the experimental animals. The intensity of concern paid by layers on feed was over 90% during 5 minutes and 30 seconds after providing feed, and normal layers (NL) had been standing to take feed for that period. Therefore, in this study, the optimal judging time was set by this test result. The wired monitoring system developed was consisted of a driving device for carrying machine vision systems, a control program, a RS232 to RS485 convertor, an automatic positioning system, and an image capture system. An image processing algorithm was developed to find SDL in MLB by the processes of binary processing, erosion, expansion, labeling, and reckoning central coordinate of the captured images. The optimal velocity for driving unit was set up as 0.13 m/s by the test results for wired monitoring system, and the proximity switch was controlled not to be operated for 1.0 second after first image captured. The wired monitoring system developed was tested to evaluate the remote monitoring performance at lab-scale laying hen house. Results showed that its judgement success.ate on normal cage (without SDL) was 87% and that on abnormal cage (with SDL) was 90%, respectively. Therefore, it would be concluded that the wired monitoring system developed in this study was well suited to the purpose of this study.

Managing Deadline-constrained Bag-of-Tasks Jobs on Hybrid Clouds with Closest Deadline First Scheduling

  • Wang, Bo;Song, Ying;Sun, Yuzhong;Liu, Jun
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.10 no.7
    • /
    • pp.2952-2971
    • /
    • 2016
  • Outsourcing jobs to a public cloud is a cost-effective way to address the problem of satisfying the peak resource demand when the local cloud has insufficient resources. In this paper, we studied the management of deadline-constrained bag-of-tasks jobs on hybrid clouds. We presented a binary nonlinear programming (BNP) problem to model the hybrid cloud management which minimizes rent cost from the public cloud while completes the jobs within their respective deadlines. To solve this BNP problem in polynomial time, we proposed a heuristic algorithm. The main idea is assigning the task closest to its deadline to current core until the core cannot finish any task within its deadline. When there is no available core, the algorithm adds an available physical machine (PM) with most capacity or rents a new virtual machine (VM) with highest cost-performance ratio. As there may be a workload imbalance between/among cores on a PM/VM after task assigning, we propose a task reassigning algorithm to balance them. Extensive experimental results show that our heuristic algorithm saves 16.2%-76% rent cost and improves 47.3%-182.8% resource utilizations satisfying deadline constraints, compared with first fit decreasing algorithm, and that our task reassigning algorithm improves the makespan of tasks up to 47.6%.

A Semi-fragile Image Watermarking Scheme Exploiting BTC Quantization Data

  • Zhao, Dongning;Xie, Weixin
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.8 no.4
    • /
    • pp.1499-1513
    • /
    • 2014
  • This paper proposes a novel blind image watermarking scheme exploiting Block Truncation Coding (BTC). Most of existing BTC-based watermarking or data hiding methods embed information in BTC compressed images by modifying the BTC encoding stage or BTC-compressed data, resulting in watermarked images with bad quality. Other than existing BTC-based watermarking schemes, our scheme does not really perform the BTC compression on images during the embedding process but uses the parity of BTC quantization data to guide the watermark embedding and extraction processes. In our scheme, we use a binary image as the original watermark. During the embedding process, the original cover image is first partitioned into non-overlapping $4{\times}4$ blocks. Then, BTC is performed on each block to obtain its BTC quantized high mean and low mean. According to the parity of high mean and the parity of low mean, two watermark bits are embedded in each block by modifying the pixel values in the block to make sure that the parity of high mean and the parity of low mean in the modified block are equal to the two watermark bits. During the extraction process, BTC is first performed on each block to obtain its high mean and low mean. By checking the parity of high mean and the parity of low mean, we can extract the two watermark bits in each block. The experimental results show that the proposed watermarking method is fragile to most image processing operations and various kinds of attacks while preserving the invisibility very well, thus the proposed scheme can be used for image authentication.

Optimal Relay Selection and Power Allocation in an Improved Low-Order-Bit Quantize-and-Forward Scheme

  • Bao, Jianrong;He, Dan;Xu, Xiaorong;Jiang, Bin;Sun, Minhong
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.10 no.11
    • /
    • pp.5381-5399
    • /
    • 2016
  • Currently, the quantize-and-forward (QF) scheme with high order modulation and quantization has rather high complexity and it is thus impractical, especially in multiple relay cooperative communications. To overcome these deficiencies, an improved low complex QF scheme is proposed by the combination of the low order binary phase shift keying (BPSK) modulation and the 1-bit and 2-bit quantization, respectively. In this scheme, the relay selection is optimized by the best relay position for best bit-error-rate (BER) performance, where the relays are located closely to the destination node. In addition, an optimal power allocation is also suggested on a total power constraint. Finally, the BER and the achievable rate of the low order 1-bit, 2-bit and 3-bit QF schemes are simulated and analyzed. Simulation results indicate that the 3-bit QF scheme has about 1.8~5 dB, 4.5~7.5 dB and 1~2.5 dB performance gains than those of the decode-and-forward (DF), the 1-bit and 2-bit QF schemes, at BER of $10^{-2}$, respectively. For the 2-bit QF, the scheme of the normalized Source-Relay (S-R) distance with 0.9 has about 5dB, 7.5dB, 9dB and 15dB gains than those of the distance with 0.7, 0.5, 0.3 and 0.1, respectively, at BER of $10^{-3}$. In addition, the proposed optimal power allocation saves about 2.5dB much more relay power on an average than that of the fixed power allocation. Therefore, the proposed QF scheme can obtain excellent features, such as good BER performance, low complexity and high power efficiency, which make it much pragmatic in the future cooperative communications.

Software Development for the Analysis and Prediction of Packing Density of Multi-sized Mixture Particles (Multi-sized 혼합입자의 충전 분율 해석 및 예측을 위한 소프트웨어 개발)

  • Oh, Min;Hong, Seong Uk
    • Applied Chemistry for Engineering
    • /
    • v.18 no.6
    • /
    • pp.636-642
    • /
    • 2007
  • Software program to predict the packing density of multi-sized and multi-component particulate system was developed. For this purpose, the experiment to measure the packing density of AP (ammonium perchlorate) and Al (aluminum) particles with different sizes and their mixtures was carried out. The packing densities obtained from various experiments were compared with the predicted data from the developed software program. In the case of the packing density of the binary system, which is comprised of two different size particles and/or two different components, the relative errors were ranged 0.25~13.13%, and in the same venue the relative errors of the ternary system were 0.25~13.13%. Agreement between experimental data and the predicted results is reasonably accurate. In order to achieve the targeted packing density, the software program calculated the contour of the component particles and this will contribute the formulation of optimal packing systems.

Heterogeneous Sensor Data Analysis Using Efficient Adaptive Artificial Neural Network on FPGA Based Edge Gateway

  • Gaikwad, Nikhil B.;Tiwari, Varun;Keskar, Avinash;Shivaprakash, NC
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.13 no.10
    • /
    • pp.4865-4885
    • /
    • 2019
  • We propose a FPGA based design that performs real-time power-efficient analysis of heterogeneous sensor data using adaptive ANN on edge gateway of smart military wearables. In this work, four independent ANN classifiers are developed with optimum topologies. Out of which human activity, BP and toxic gas classifier are multiclass and ECG classifier is binary. These classifiers are later integrated into a single adaptive ANN hardware with a select line(s) that switches the hardware architecture as per the sensor type. Five versions of adaptive ANN with different precisions have been synthesized into IP cores. These IP cores are implemented and tested on Xilinx Artix-7 FPGA using Microblaze test system and LabVIEW based sensor simulators. The hardware analysis shows that the adaptive ANN even with 8-bit precision is the most efficient IP core in terms of hardware resource utilization and power consumption without compromising much on classification accuracy. This IP core requires only 31 microseconds for classification by consuming only 12 milliwatts of power. The proposed adaptive ANN design saves 61% to 97% of different FPGA resources and 44% of power as compared with the independent implementations. In addition, 96.87% to 98.75% of data throughput reduction is achieved by this edge gateway.

Designing and Building a Fire Monitoring Web GIS System Using MODIS Image - Using ArcIMS 4.0 - (MODIS 위성영상을 이용한 산불 모니터링 Web GIS 시스템 설계 및 구축 - ArcIMS 4.0을 활용하여 -)

  • Son Jeong-Hoon;Huh Yong;Byun Young-Gi;Yu Ki-Yun;Kim Yong-Il
    • Spatial Information Research
    • /
    • v.14 no.1 s.36
    • /
    • pp.151-161
    • /
    • 2006
  • This paper has a goal to construct monitoring web GIS system which displays maps that are results of the fire detecting algorithms using MODIS image. To design and build more efficient system, foreign fire monitoring systems using satellite image are researched and analyzed. As a result of that, the information about interfaces and services provided by them are obtained. In concretely, new logical DFD is used to do a process modelling. ArcIMS 4.0 of ESRI, IIS 5.1 of Microsoft are utilized to build the web GIS System. In the aspects of data input and transfer, a specific module, which converts a binary image to a kind of vector file, is developed to adjust raster data to the web GIS system.

  • PDF

Health monitoring sensor placement optimization for Canton Tower using virus monkey algorithm

  • Yi, Ting-Hua;Li, Hong-Nan;Zhang, Xu-Dong
    • Smart Structures and Systems
    • /
    • v.15 no.5
    • /
    • pp.1373-1392
    • /
    • 2015
  • Placing sensors at appropriate locations is an important task in the design of an efficient structural health monitoring (SHM) system for a large-scale civil structure. In this paper, a hybrid optimization algorithm called virus monkey algorithm (VMA) based on the virus theory of evolution is proposed to seek the optimal placement of sensors. Firstly, the dual-structure coding method is adopted instead of binary coding method to code the solution. Then, the VMA is designed to incorporate two populations, a monkey population and a virus population, enabling the horizontal propagation between the monkey and virus individuals and the vertical inheritance of monkey's position information from the previous to following position. Correspondingly, the monkey population in this paper is divided into the superior and inferior monkey populations, and the virus population is divided into the serious and slight virus populations. The serious virus is used to infect the inferior monkey to make it escape from the local optima, while the slight virus is adopted to infect the superior monkey to let it find a better result in the nearby area. This kind of novel virus infection operator enables the coevolution of monkey and virus populations. Finally, the effectiveness of the proposed VMA is demonstrated by designing the sensor network of the Canton Tower, the tallest TV Tower in China. Results show that innovations in the VMA proposed in this paper can improve the convergence of algorithm compared with the original monkey algorithm (MA).

Modelling Phase Equilibria of Binary Mixtures for the Direct Synthesis of Dimethyl Carbonate from CO2 (직접 합성법을 이용한 dimethyl carbonate제조공정을 위한 공정 혼합물의 상평형 모델링)

  • Im, Jihoon;Lee, Gangwon;An, Jichul;Kim, Hwayong
    • Clean Technology
    • /
    • v.11 no.4
    • /
    • pp.165-170
    • /
    • 2005
  • The aim of this study is to provide vapor-liquid equilibrium (VLE) information for the study of process which directly synthesize dimethyl carbonate (DMC) from $CO_2$. For this study we collected some necessary VLE systems data of Methanol-Water, Methanol-DMC, $CO_2$-DMC, $CO_2$-Methanol, $CO_2$-Methanol, and performed VLE calculation with Peng-Robinson equation of state, Wong-Sandler mixing rules that widely used in chemical industry. These calculation results relatively agreed with VLE data well. Optimized Parameters of EoS given through this calculation will be used as some valuable information for fundamental study, process development and process optimization of DMC direct synthesis.

  • PDF