• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제10권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%.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제8권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.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제10권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.

• 공업화학
• /
• 제18권6호
• /
• pp.636-642
• /
• 2007

다양한 크기를 가진 다성분 입자의 충전분율을 정확하게 예측할 수 있는 소프트웨어 프로그램을 개발하였다. 이를 위하여 다양한 크기의 염소산암모늄(Ammonium perchlorate, AP)과 알루미늄(Aluminum, Al) 입자와 혼합물에 대한 충전분율 측정실험을 수행하였다. 실험에 의해 얻어진 충전분율은 개발된 프로그램에 의해 예측된 값과 비교하였다. 크기가 다른 2종류 입자의 혼합 충전의 경우 상대오차가 0.25~13.13%, 3종류 입자의 혼합 충전의 경우 0.13~10.01%로 나타나 실험값과 잘 일치하였다. 목표 충전분율을 얻기 위한 각 구성입자의 질량분율 contour를 프로그램을 통하여 구할 수 있으며 이를 통하여 충전시스템을 최적화 할 수 있다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제13권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.

• Spatial Information Research
• /
• 제14권1호
• /
• pp.151-161
• /
• 2006

본 연구는 MODIS 위성영상을 이용한 산불탐지 성과물을 인터넷 서비스를 통해 지도로 보여줄 수 있는 모니터링 Web GIS시스템을 설계하고 시험/구축하는 것을 목표로 한다. 이를 위하여 위성영상을 이용한 국외 주요 산불 모니터링 시스템을 조사, 분석하여 인터페이스 및 제공 서비스를 분석하고 보다 효율적인 시스템을 설계, 구축하고자 하였다. 구체적으로 신논리적 DFD를 이용하여 시스템의 프로세스 모델링을 수행하였으며, ERSI사의 ArcIMS 4.0과 Microsoft사의 Web 서버인 IIS 5.1을 이용하여 Web GIS 시스템을 구축하였다. 자료의 입력 및 변환의 측면에서는 국내외 산불탐지 알고리즘을 적용한 래스터 형태의 영상 성과물을 Web GIS에 접목시키기 위해 산불탐지 이진영상을 벡터 형태의 데이터로 변환시키는 모듈을 자체 개발하여 적용하였다.

• Smart Structures and Systems
• /
• 제15권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).

• 청정기술
• /
• 제11권4호
• /
• pp.165-170
• /
• 2005

이 연구는 $CO_2$로부터 DMC를 직접 합성하는 공정의 연구를 위한 상평형 자료를 제공하는데 있다. 연구를 위해 Methanol-Water 시스템, Methanol-DMC 시스템, $CO_2$-DMC 시스템, $CO_2$-Methanol 시스템 그리고 DMC-Water 시스템의 상평형 데이터를 수집하였고, 화학 산업에서 널리 쓰이고 있는 Peng-Robinson 상태방정식과 Wong-Sandler 혼합규칙으로 상평형 계산을 수행하였다. 계산 결과 상평형 데이터와 비교적 잘 일치하는 결과를 보였다. 계산을 통해 구한 최적화된 상태방정식의 매개변수는 직접 합성법의 기초연구 및 공정 개발 그리고 공정 최적화에 유용한 자료로 사용될 것으로 생각된다.

• Nuclear Engineering and Technology
• /
• 제46권6호
• /
• pp.847-856
• /
• 2014

Spent resin waste containing a high concentration of $^{14}C$ radionuclide cannot be disposed of directly. A fundamental study on selective $^{14}C$ stripping, especially from the IRN-150 mixed bed resin, was carried out. In single ion-exchange equilibrium isotherm experiments, the ion adsorption capacity of the fresh resin for non-radioactive $HCO_3{^-}$ ion, as the chemical form of $^{14}C$, was evaluated as 11mg-C/g-resin. Adsorption affinity of anions to the resin was derived in order of $NO_3{^-}$ > $HCO_3{^-}{\geq}H_2PO_4{^-}$. Thus the competitive adsorption affinity of $NO_3{^-}$ ion in binary systems appeared far higher than that of $HCO_3{^-}$ or $H_2PO_4{^-}$, and the selective desorption of $HCO_3{^-}$ from the resin was very effective. On one hand, the affinity of $Co^{2+}$ and $Cs^+$ for the resin remained relatively higher than that of other cations in the same stripping solution. Desorption of $Cs^+$ was minimized when the summation of the metal ions in the spent resin and the other cations in solution was near saturation and the pH value was maintained above 4.5. Among the various solutions tested, from the view-point of the simple second waste process, $NH_4H_2PO_4$ solution was preferable for the stripping of $^{14}C$ from the spent resin.

• Journal of Astronomy and Space Sciences
• /
• 제9권1호
• /
• pp.41-51
• /
• 1992

근접쌍성 AO Can과 AW Cam을 1984년의 관측 계절에 소백산 천문대의 61cm 반사 망원경으로 광전 관측하였다. 이 두별의 관측으로 부터 AO Cam의 채 1 극심시각 l개와 AW Cam익 체 1 극심시각 3 개를 각각 구하였다. 여러 문헌으로 부터 수집한 이 두 별의 극심시각들을 이용하여 최소자송법으로 A0 Cam파 AW Cam의 새로운 광도요소를 구하였다. AO Cam의 공전주기는 1980년 10월(JD 2444520) 부터 1985년 2월 (JD 2446107)까지 일정하였다. 그러나 최근에 Mullis와 Faulkner (1991)가 발표한 AO Cam의 l개의 제2극심시각 (JD 2447864. 7879)은 우리가 새로 구한 광도요소와 약 +4.6분 ( (0.0032일)의 큰 차이가 난다. AO Carn의 극심시각의 앞으로의 관측은 이 별의 공전주기 변화 연구에 중요하다. AW Cam의 공전주기는 지난 1930년대 초 이래 현재짜지 약 60년 동안 P=$0^d.77134645$로 일정하다