• Current Optics and Photonics
• /
• v.3 no.2
• /
• pp.105-110
• /
• 2019

The visible-light communication (VLC) system is a promising candidate to fulfill the present and future demands for a high-speed, cost-effective, and larger-bandwidth communication system. VLC modulates the visible-light signals from solid-state LEDs to transmit data between transmitter and receiver, but the broadcasting and the line-of-sight propagation nature of visible-light signals make VLC a communication system with a limited operating range. We present a novel architecture to increase the operating range of VLC. In our proposed architecture, we guide the visible-light signals through the fiber and amplify the dissipated signals using visible-light fiber amplifiers (VLFAs), which are the most important and the novel devices needed for the proposed architecture of the VLC. Therefore, we design, analyze, and apply a VLFA to VLC, to overcome the inherent drawbacks of VLC. Numerical results show that under given constant conditions, the VLFA can amplify the signal up to 35.0 dB. We have analyzed the effects of fiber length, active ion concentration, pump power, and input signal power on the gain and the noise figure (NF).

• International Journal of Computer Science & Network Security
• /
• v.21 no.8
• /
• pp.196-202
• /
• 2021

DNA sequencing provides fundamental data in genomics, bioinformatics, biology and many other research areas. With the emergent evolution in DNA sequencing technology, a massive amount of genomic data is produced every day, mainly DNA sequences, craving for more storage and bandwidth. Unfortunately, managing, analyzing and specifically storing these large amounts of data become a major scientific challenge for bioinformatics. Those large volumes of data also require a fast transmission, effective storage, superior functionality and provision of quick access to any record. Data storage costs have a considerable proportion of total cost in the formation and analysis of DNA sequences. In particular, there is a need of highly control of disk storage capacity of DNA sequences but the standard compression techniques unsuccessful to compress these sequences. Several specialized techniques were introduced for this purpose. Therefore, to overcome all these above challenges, lossless compression techniques have become necessary. In this paper, it is described a new DNA compression mechanism of pattern matching extended Compression algorithm that read the input sequence as segments and find the matching pattern and store it in a permanent or temporary table based on number of bases. The remaining unmatched sequence is been converted into the binary form and then it is been grouped into binary bits i.e. of seven bits and gain these bits are been converted into an ASCII form. Finally, the proposed algorithm dynamically calculates the compression ratio. Thus the results show that pattern matching extended Compression algorithm outperforms cutting-edge compressors and proves its efficiency in terms of compression ratio regardless of the file size of the data.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.16 no.5
• /
• pp.1687-1707
• /
• 2022

With the development of multiuser online meetings, more group-oriented technologies and applications for instance collaborative work are becoming increasingly important. Authenticated Group Key Agreement (AGKA) schemes provide a shared group key for users with after their identities are confirmed to guarantee the confidentiality and integrity of group communications. On the basis of the Public Key Cryptography (PKC) system used, AGKA can be classified as Public Key Infrastructure-based, Identity-based, and Certificateless. Because the latter type can solve the certificate management overhead and the key escrow problems of the first two types, Certificateless-AGKA (CL-AGKA) protocols have become a popular area of research. However, most CL-AGKA protocols are vulnerable to Public Key Replacement Attacks (PKRA) due to the lack of public key authentication. In the present work, we present a CL-AGKA scheme that can resist PKRA in order to solve impersonation attacks caused by those attacks. Beyond security, improving scheme efficiency is another direction for AGKA research. To reduce the communication and computation cost, we present a scheme with only one round of information interaction and construct a CL-AGKA scheme replacing the bilinear pairing with elliptic curve cryptography. Therefore, our scheme has good applicability to communication environments with limited bandwidth and computing capabilities.

• Smart Structures and Systems
• /
• v.33 no.1
• /
• pp.27-39
• /
• 2024

The effectiveness of conventional tuned liquid dampers (TLDs) in controlling the wind-induced response of tall flexible structures has been indicated. However, the impaired control effect in the detuning condition or a considerably high mass cost of liquid may be incurred in ensuring the high-level serviceability. To provide an efficient TLD-based solution for wind-induced vibration control, this study proposes a serviceability-oriented optimal design method for isolated TLDs (ILDs) and derives analytical design formulae. The ILD is implemented by mounting the TLD on the linear isolators. Stochastic response analysis is performed for the ILD-equipped structure subjected to stochastic wind and white noise, and the results are considered to derive the closed-form responses. Correspondingly, an extensive parametric analysis is conducted to clarify a serviceability-oriented optimal design framework by incorporating the comfort demand. The obtained results show that the high-level serviceability demand can be satisfied by the ILD based on the proposed optimal design framework. Analytical design formulae can be preliminarily adopted to ensure the target serviceability demand while enhancing the structural displacement performance to increase the safety level. Compared with conventional TLD systems, the ILD exhibits higher effectiveness and a larger frequency bandwidth for wind-induced vibration control at a small mass ratio.

• Journal of Cadastre & Land InformatiX
• /
• v.48 no.1
• /
• pp.71-91
• /
• 2018

In recent years, application of UAV(Unmanned Aerial Vehicle) to seed sowing and pest control has been actively carried out in the field of agriculture. In this study, UAS(Unmanned Aerial System) is constructed by combining image sensor of various wavelength band and SfM((Structure from Motion) based image analysis technique in UAV. Utilization of UAS based vegetation survey was investigated and the applicability of precision farming was examined. For this purposes, a UAS consisting of a combination of a VIS_RGB(Visible Red, Green, and Blue) image sensor, a modified BG_NIR(Blue Green_Near Infrared Red) image sensor, and a TIR(Thermal Infrared Red) sensor with a wide bandwidth of $7.5{\mu}m$ to $13.5{\mu}m$ was constructed for a low cost UAV. In addition, a total of ten vegetation indices were selected to investigate the chlorophyll, nitrogen and water contents of plants with visible, near infrared, and infrared wavelength's image sensors. The images of each wavelength band for the test area were analyzed and the correlation between the distribution of vegetation index and the vegetation index were compared with status of the previously surveyed vegetation and ground cover. The ability to perform vegetation state detection using images obtained by mounting multiple image sensors on low cost UAV was investigated. As the utility of UAS equipped with VIS_RGB, BG_NIR and TIR image sensors on the low cost UAV has proven to be more economical and efficient than previous vegetation survey methods that depend on satellites and aerial images, is expected to be used in areas such as precision agriculture, water and forest research.

• Journal of the Korea Society for Simulation
• /
• v.18 no.4
• /
• pp.165-173
• /
• 2009

Recent portable devices are so versatile that they have multiple communication channels and play several multimedia formats. Especially, many services are under development for users who connect Internet or nearby devices via WWAN (Wireless Wide Area Network) and/or WLAN (Wireless LAN). In case of paying the telecommunication cost proportional to the amount of data downloaded, it is necessary to reduce the cost by constructing a special ad hoc network in which each participating peer downloads a specific portion of the want-to-be-shared content over the payable WWAN channel and exchanges the remaining portion with other peers using the cost-free WLAN channel. If all peers participate in forwarding packets, some transmissions are redundant which results in the unnecessary consumption of bandwidth as well as the delayed content distribution time. In order to reduce the redundant transmission, this paper proposes both the excluding method which discourages some peers not to forward redundant packets, and the minimum cover set method in which only the minimum number of peers are in charge of forwarding packets. These two methods obviate redundant packet forwarding, and result in reduction of content distribution time by up to around 29%.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.39 no.4
• /
• pp.188-200
• /
• 2002

The WRR scheduling algorithm is widely used in ATM networks due to its simplicity and the low cost of hardware implementation. It guarantees minimum cell rate according to the weight of each queue. The fairness is a important factor for ABR service. That is, scheduling algorithm allocates network resources fairly to each VC. However, WRR algorithm shows worse performance on bursty traffic. Because it schedules input traffics according to predetermined weight, it can not satisfies fairness criteria, MCR plus equal share and Maximum of MCR or Max-Min share, defined by ATM Forum TM 4.1 specification. The Nabeshima et al algorithm is not adapt to network status rapidly because it is not compensate the weights of unused bandwidth to VCs and assign the unused bandwidth to VCs by RR method. In this paper, we propose a scheduling algorithm for satisfying the two fairness criteria, MCR plus equal share and Maximum of MCR or Max-Min share, among the six criteria defined by ATM Forum TM 4.1 specification. The WRR, Nabeshima et al, and the proposed scheduling algorithms are compared with respect to fairness and convergence time throughout experimental simulation. According to the simulation results, the proposed algorithm shows higher fairness and more rapid convergence than other algorithms.

• The KIPS Transactions:PartB
• /
• v.9B no.6
• /
• pp.835-844
• /
• 2002

The number of channels available to a video server is limited since the number of channels a video server can support is determined by its communication bandwidth. Several approaches such as batching, piggybacking and patching have been proposed to reduce I/O demand on the video server by sharing multicast data. Patching has been shown to be efficient in the matter of the cost for VOD systems. Unlike conventional multicast techniques, patching is a dynamic multicast scheme which enables a new request to join an ongoing multicast. In addition, true VOD can be achieved since a new request can be served immediately without having to wait for the next multicast. In this paper. we propose two types of channel reservation patching algorithm : a fixed channel reservation patching and a variable channel reservation patching. To immediately schedule the requests for popular videos, these algorithms reserve the channels of video server for the fixed number of popular videos or for the variable number of popular videos which is determined dynamically according to the load of video server. The performance of the proposed algorithms is evaluated through simulations, and compared with that of simple patching. Our performance measures are average defection rate, average latency, service fairness and the amount of buffered data according to video server loads. Simulation results show that the proposed channel reservation patching algorithms provide better performance compared to simple patching algorithm.

• Journal of KIISE:Computer Systems and Theory
• /
• v.26 no.11
• /
• pp.1318-1332
• /
• 1999

본 논문에서는 입출력 응용을 위해 collective I/O 기법을 기반으로 한 실행시간 시스템의 설계, 구현 그리고 그 성능평가를 기술한다. 여기서는 모든 프로세서가 동시에 I/O 요구에 따라 스케쥴링하며 I/O를 수행하는 collective I/O 방안과 프로세서들이 여러 그룹으로 묶이어, 다음 그룹이 데이터를 재배열하는 통신을 수행하는 동안 오직 한 그룹만이 동시에 I/O를 수행하는 pipelined collective I/O 등의 두 가지 설계방안을 살펴본다. Pipelined collective I/O의 전체 과정은 I/O 노드 충돌을 동적으로 줄이기 위해 파이프라인된다. 이상의 설계 부분에서는 동적으로 충돌 관리를 위한 지원을 제공한다. 본 논문에서는 다른 노드의 메모리 영역에 이미 존재하는 데이터를 재 사용하여 I/O 비용을 줄이기 위해 collective I/O 방안에서의 소프트웨어 캐슁 방안과 두 가지 모형에서의 chunking과 온라인 압축방안을 기술한다. 그리고 이상에서 기술한 방안들이 입출력을 위해 높은 성능을 보임을 기술하는데, 이 성능결과는 Intel Paragon과 ASCI/Red teraflops 기계 상에서 실험한 것이다. 그 결과 응용 레벨에서의 bandwidth는 peak point가 55%까지 측정되었다.Abstract In this paper we present the design, implementation and evaluation of a runtime system based on collective I/O techniques for irregular applications. We present two designs, namely, "Collective I/O" and "Pipelined Collective I/O". In the first scheme, all processors participate in the I/O simultaneously, making scheduling of I/O requests simpler but creating a possibility of contention at the I/O nodes. In the second approach, processors are grouped into several groups, so that only one group performs I/O simultaneously, while the next group performs communication to rearrange data, and this entire process is pipelined to reduce I/O node contention dynamically. In other words, the design provides support for dynamic contention management. Then we present a software caching method using collective I/O to reduce I/O cost by reusing data already present in the memory of other nodes. Finally, chunking and on-line compression mechanisms are included in both models. We demonstrate that we can obtain significantly high-performance for I/O above what has been possible so far. The performance results are presented on an Intel Paragon and on the ASCI/Red teraflops machine. Application level I/O bandwidth up to 55% of the peak is observed.he peak is observed.

• Journal of the Microelectronics and Packaging Society
• /
• v.17 no.4
• /
• pp.1-9
• /
• 2010

Three-dimensional (3-D) integration is an emerging technology, which vertically stacks and interconnects multiple materials, technologies, and functional components such as processor, memory, sensors, logic, analog, and power ICs into one stacked chip to form highly integrated micro-nano systems. Since CMOS device scaling has stalled, 3D integration technology allows extending Moore's law to ever high density, higher functionality, higher performance, and more diversed materials and devices to be integrated with lower cost. The potential benefits of 3D integration can vary depending on approach; increased multifunctionality, increased performance, increased data bandwidth, reduced power, small form factor, reduced packaging volume, increased yield and reliability, flexible heterogeneous integration, and reduced overall costs. It is expected that the semiconductor industry's paradiam will be shift to a new industry-fusing technology era that will offer tremendous global opportunities for expanded use of 3D based technologies in highly integrated systems. Anticipated applications start with memory, handheld devices, and high-performance computers and extend to high-density multifunctional heterogeneous integration of IT-NT-BT systems. This paper attempts to introduce new 3D integration technologies of the chip self-assembling stacking and 3D heterogeneous opto-electronics integration for realizng the super-chip.