• Proceedings of the Korean Institute of Electrical and Electronic Material Engineers Conference
• /
• 2003.07b
• /
• pp.616-619
• /
• 2003

This work presents the design, fabrication and microwave performance of distributed analog phase shifter (DAPS) fabricated on $(Ba,\;Sr)TiO_3$ (BST) thin films for X-band applications. Ferroelectric BST thin films were deposited on MgO substrates by pulsed laser deposition. The DAPS consists of high impedance coplanar waveguide (CPW) and periodically loaded tunable BST interdigitated capacitors (IDC). In order to reduce the insertion loss of DAPS and to remove the alteration of unloaded CPW properties according to an applied dc bias voltage, BST layer under transmission lines were removed by photolithography and RF-ion milling. The measured results are in good agreement with the simulated results at the frequencies of interest. The measured differential phase shift based on BST thin films was $24^{\circ}$ and the insertion loss decreased from 1.1 dB to 0.7 dB with increasing the bias voltage from 0 to 40V at 10 GHz.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.53 no.5
• /
• pp.168-173
• /
• 2016

The latest drone market is evolving rapidly. The commercial drone market developed rapid growth. Up to now, one controller had controlled the only one drone. So Remote control and information collection of the remote drone was impossible. Therefore we suggests drone intercommunication distributed network based on the MANET. Subsequently classified according to the characteristics of the drone intercommunication distributed network(speed, distance, applications) and chose a MANET routing protocol in accordance with the classification result.

• Transactions of the Korean Society of Mechanical Engineers B
• /
• v.21 no.8
• /
• pp.1024-1033
• /
• 1997

The past several years have witnessed an ever-increasing acceptance and adoption of parallel processing, both for high performance scientific computing as well as for more general purpose applications. Furthermore with increasing needs to perform the complex flow calculations in an efficient manner, the use of the message passing model on distributed networks has emerged as an important alternative to the expensive supercomputers. This work attempts to provide a generic framework to enable the parallelization of all CFD-related works using the master-slave model. This framework consists of (1) input geometry, (2) domain decomposition, (3) grid generation, (4) flow computations, (5) flow visualization, and (6) output display as the sequential components, but performs computations for (2) to (5) in parallel on the workstation clustering. The flow computations are parallized by having multiple copies of the flow-code to solve a PDE on different spatial regions on different processors, while their flow data are exchanged across the region boundaries, and the solution is time-stepped. The Parallel Virtual Machine (PVM) is used for distributed communication in this work.

• Proceedings of the Korean Information Science Society Conference
• /
• 2010.06d
• /
• pp.360-365
• /
• 2010

In this paper, we present a distributed algorithm for detecting dynamic event regions in wireless sensor network with the consideration on energy saving. Our model is that the sensing field is monitored by a large number of randomly distributed sensors with low-power battery and limited functionality, and that the event region is dynamic with motion or changing the shape. At any time that the event happens, we need some sensors awake to detect it and to wake up its k-hop neighbors to detect further events. Scheduling for the network to save the total power-cost or to maximize the monitoring time has been studied extensively. Our scheme is that some predetermined sensors, called critical sensors are awake all the time and when the event is detected by a critical sensor the sensor broadcasts to the neighbors to check their sensing area. Then the neighbors check their area and decide whether they wake up or remain in sleeping mode with certain criteria. Our algorithm uses only 2 bit of information in communication between sensors, thus the total communication cost is low, and the speed of detecting all event region is high. We adapt two kinds of measure for the wake-up decision. With suitable threshold values, our algorithm can be applied for many applications and for the trade-off between energy saving and the efficiency of event detection.

• Journal of Digital Contents Society
• /
• v.6 no.3
• /
• pp.163-168
• /
• 2005

Computing infrastructures and technologies are moving into the distributed environments. Due to increase of M&A, and outsourcing processes, or increase or development of various system in an organizations, there are various problems resing such as difficulties in maintenance and repairment, repetition or inconsistency of data, and lacks of interconnection between different of difficulties in financing and selecting an adequate solutionas. This study presents a method to integrate systems adopting massage middleware as an efficient alternative for integration of applications and data between different models under distributed system environments. We expect that the integration method presented in this study, adopting massage middleware between system, will be an efficient alternative to build up interface between small system in terms of expense and efficiency.

• International Journal of Reliability and Applications
• /
• v.11 no.2
• /
• pp.89-106
• /
• 2010

This paper deals with the reliability and availability characteristics of three different series system configurations with warm standby components and a repairable service station. The failure time of the primary and warm standby are assumed to be exponentially distributed with parameters ${\lambda}$ and ${\alpha}$ respectively. The repair time distribution of each server is also exponentially distributed with parameter ${\mu}$. The breakdown time and the repair time of the service station are also assumed exponentially distributed with parameters ${\gamma}$ and ${\beta}$ respectively. We derive the reliability dependent on time, availability dependent on time, the mean time to failure, $MTTF_i$, and the steady-state availability $A_i$(${\infty}$) for three configurations and perform comparisons. Comparisons are made for specific values of distribution parameters and of the cost of the components. The three configurations are ranked based on: $MTTF_i$, $A_i$(${\infty}$), and $C_i/B_i$ where $B_i$ is either $MTTF_i$ or $A_i$(${\infty}$).

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2002.05a
• /
• pp.285-292
• /
• 2002

A cluster tool for semiconductor manufacturing is an integrated device that consists of several single wafer processing modules and a wafer transport module based on a robot. The distributed module controllers are integrated by an inter-module communication network and coordinated by a centralized controller, called a cluster tool controller (CTC). Since the CTC monitors and coordinates the distributed complex module controllers for advanced process control, complex commuication messaging and services between the CTC and the module controllers are required. A SEMI standard, CTMC(Cluster Tool Module Communication), specifies application-level communication service requirements for inter-module communication. We propose the use of high-level fieldbuses, for instance. PROFIBUS-FMS, for implementing CTMC since the high-level fieldbuses are well suited for complex real-time distributed manufacturing control applications. We present a way of implementing CTMC using PROFIBUS-FMS as the communication enabler. We first propose improvements of a key object of CTMC for material transfer and the part transfer protocol to meet the functional requirements of modem advanced cluster tools. We also discuss mapping objects and services of CTMC to PROFIBUS-FMS communication objects and services. Finally, we explain how to implement the mappings.

• Journal of the Korea Society of Computer and Information
• /
• v.3 no.4
• /
• pp.110-119
• /
• 1998

This paper describes a C-API (Cryptographic-Application program Interface) mechanism that can serve cryptographic service to one or more application programmers in an open distributed computing system. Generic cryptographic service, provides application Programmers with cryptographic algorithms and interfaces which can be shared so that the programmers can program distributed applications containing security services even though they have no detailed knowledge of cryptographic algorithms. Therefore, in this paper, a generic C-API mechanism is designed that can be used independently from various application environments and basic system structures so that programmers can use it commonly. This mechanism has the advantage that allows application programmers be able to use some cryptographic services and key management services not considering of the application program and operating system.

• Annual Conference of KIPS
• /
• 2013.11a
• /
• pp.1367-1369
• /
• 2013

Applying Application-Level Multicast technology (ALM) to Distributed Interactive Applications (DIAs) becomes more and more popular. Especially for DIAs embedded priority that the sender forwards data to receivers due to their respective priorities. The priority-based directed minimum spanning tree (PST) algorithm was designed for these DIAs. However, the PST has no efficient priority selection and filtering mechanism. The system will consume a tremendous amount of resource for reconstructing distribution tree and becomes unstable and unscalable. In this paper, First, We propose a novel priority-based application level multicast algorithm: Predict-and-Quantize for Priority with directed minimum Spanning Tree (PQPST), which can efficiently predict efficient priorities for the receivers and quantize the predicted priorities to build the multicast distribution tree. Second, we propose Priority Discrepancy Heuristic Mechanism (PDHM), which sets different thresholds of priority discrepancy within the priority discrepancy interval to control the distribution tree construction can efficiently decrease the repeated distribution tree construction, and we get the best heuristic priority discrepancy interval by PQPST. According to the simulation results, the PQPST and PDHM can efficiently improve the performance of the PST algorithm.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.20 no.3
• /
• pp.105-111
• /
• 2010

We propose a practical privacy-preserving clustering protocol over horizontally partitioned data. We extend the DBSCAN clustering algorithm into a distributed protocol in which data providers mix real data with fake data to provide privacy. Our privacy-preserving clustering protocol is very efficient whereas the previous privacy-preserving protocols in the distributed environments are not practical to be used in real applications. The efficiency of our privacy-preserving clustering protocol over horizontally partitioned data is comparable with those of privacy-preserving clustering protocols in the non-distributed environments.