• Title/Summary/Keyword: 컴퓨터시스템

Search Result 14,948, Processing Time 0.04 seconds

Active-Active Message Replica Scheme for Enhancing Performance of Distributed Message Broker (분산 브로커의 가용성 향상을 위한 메시지 레플리카 액티브-액티브 구조 기법)

  • Seo, Kyeonghee;Yeo, Sangho;Oh, Sangyoon
    • KIPS Transactions on Computer and Communication Systems
    • /
    • v.7 no.6
    • /
    • pp.145-154
    • /
    • 2018
  • A loosely coupled message broker system is a popular method for integrating distributed software components. Especially, a distributed broker structure with multiple brokers with active-standby or active-active message replicas are used to enhance availability as well as message processing performance. However, there are problems in both active-standby and active-active replica structure. The active-standby has relatively low processing performance and The active-active structure requires a high synchronization overhead. In this paper, we propose an active-active structure of replicas to increase the availability of the brokers without compromising its high fault-tolerancy. In the proposed structure, standby replicas process the requests of the active replicas so that load balancing is achieved without additional brokers, while the distributed coordinators are used for the synchronization process to decrease the overhead. We formulated the overhead incurred when synchronizing messages among replicas, and the formulation was used to support the experiment results. From the experiment, we observed that replicas of the active-active structure show better performance than the active stand-by structure with increasing number of users.

Enhanced Grid-Based Trajectory Cloaking Method for Efficiency Search and User Information Protection in Location-Based Services (위치기반 서비스에서 효율적 검색과 사용자 정보보호를 위한 향상된 그리드 기반 궤적 클로킹 기법)

  • Youn, Ji-Hye;Song, Doo-Hee;Cai, Tian-Yuan;Park, Kwang-Jin
    • KIPS Transactions on Computer and Communication Systems
    • /
    • v.7 no.8
    • /
    • pp.195-202
    • /
    • 2018
  • With the development of location-based applications such as smart phones and GPS navigation, active research is being conducted to protect location and trajectory privacy. To receive location-related services, users must disclose their exact location to the server. However, disclosure of users' location exposes not only their locations but also their trajectory to the server, which can lead to concerns of privacy violation. Furthermore, users request from the server not only location information but also multimedia information (photographs, reviews, etc. of the location), and this increases the processing cost of the server and the information to be received by the user. To solve these problems, this study proposes the EGTC (Enhanced Grid-based Trajectory Cloaking) technique. As with the existing GTC (Grid-based Trajectory Cloaking) technique, EGTC method divides the user trajectory into grids at the user privacy level (UPL) and creates a cloaking region in which a random query sequence is determined. In the next step, the necessary information is received as index by considering the sub-grid cell corresponding to the path through which the user wishes to move as c(x,y). The proposed method ensures the trajectory privacy as with the existing GTC method while reducing the amount of information the user must listen to. The excellence of the proposed method has been proven through experimental results.

Efficient Collaboration Method Between CPU and GPU for Generating All Possible Cases in Combination (조합에서 모든 경우의 수를 만들기 위한 CPU와 GPU의 효율적 협업 방법)

  • Son, Ki-Bong;Son, Min-Young;Kim, Young-Hak
    • KIPS Transactions on Computer and Communication Systems
    • /
    • v.7 no.9
    • /
    • pp.219-226
    • /
    • 2018
  • One of the systematic ways to generate the number of all cases is a combination to construct a combination tree, and its time complexity is O($2^n$). A combination tree is used for various purposes such as the graph homogeneity problem, the initial model for calculating frequent item sets, and so on. However, algorithms that must search the number of all cases of a combination are difficult to use realistically due to high time complexity. Nevertheless, as the amount of data becomes large and various studies are being carried out to utilize the data, the number of cases of searching all cases is increasing. Recently, as the GPU environment becomes popular and can be easily accessed, various attempts have been made to reduce time by parallelizing algorithms having high time complexity in a serial environment. Because the method of generating the number of all cases in combination is sequential and the size of sub-task is biased, it is not suitable for parallel implementation. The efficiency of parallel algorithms can be maximized when all threads have tasks with similar size. In this paper, we propose a method to efficiently collaborate between CPU and GPU to parallelize the problem of finding the number of all cases. In order to evaluate the performance of the proposed algorithm, we analyze the time complexity in the theoretical aspect, and compare the experimental time of the proposed algorithm with other algorithms in CPU and GPU environment. Experimental results show that the proposed CPU and GPU collaboration algorithm maintains a balance between the execution time of the CPU and GPU compared to the previous algorithms, and the execution time is improved remarkable as the number of elements increases.

Performance Analysis and Improvement of WANProxy (WANProxy의 성능 분석 및 개선)

  • Kim, Haneul;Ji, Seungkyu;Chung, Kyusik
    • KIPS Transactions on Computer and Communication Systems
    • /
    • v.9 no.3
    • /
    • pp.45-58
    • /
    • 2020
  • In the current trend of increasing network traffic due to the popularization of cloud service and mobile devices, WAN bandwidth is very low compared to LAN bandwidth. In a WAN environment, a WAN optimizer is needed to overcome performance problems caused by transmission protocol, packet loss, and network bandwidth limitations. In this paper, we analyze the data deduplication algorithm of WANProxy, an open source WAN optimizer, and evaluate its performance in terms of network latency and WAN bandwidth. Also, we evaluate the performance of the two-stage compression method of WANProxy and Zstandard. We propose a new method to improve the performance of WANProxy by revising its data deduplication algorithm and evaluate its performance improvement. We perform experiments using 12 data files of Silesia with a data segment size of 2048 bytes. Experimental results show that the average compression rate by WANProxy is 150.6, and the average network latency reduction rates by WANProxy are 95.2% for a 10 Mbps WAN environment and 60.7% for a 100 Mbps WAN environment, respectively. Compared with WANProxy, the two-stage compression of WANProxy and Zstandard increases the average compression rate by 33%. However, it increases the average network latency by 2.1% for a 10 Mbps WAN environment and 5.27% for a 100 Mbps WAN environment, respectively. Compared with WANProxy, our proposed method increases the average compression rate by 34.8% and reduces the average network latency by 13.8% for a 10 Mbps WAN and 12.9% for a 100 Mbps WAN, respectively. Performance analysis results of WANProxy show that its performance improvement in terms of network latency and WAN bandwidth is excellent in a 10Mbps or less WAN environment while superior in a 100 Mbps WAN environment.

A RSU-Aided Resource Search and Cloud Construction Mechanism in VANETs (차량 네트워크에서 RSU를 이용한 리소스 검색 및 클라우드 구축 방안)

  • Lee, Yoonhyeong;Lee, Euisin
    • KIPS Transactions on Computer and Communication Systems
    • /
    • v.9 no.3
    • /
    • pp.67-76
    • /
    • 2020
  • With the fast development in wireless communications and vehicular technologies, vehicular ad hoc networks (VANETs) have enabled to deliver data between vehicles. Recently, VANETs introduce a Vehicular Cloud (VC) model for collaborating to share and use resources of vehicles to create value-added services. To construct a VC, a vehicle should search vehicles that intend to provide their own resource. The single-hop search cannot search enough provider vehicles due to a small coverage and non-line-of-sights of communications. On the other hand, the multi-hop search causes very high traffics for large coverage searching and frequent connection breakages. Recently, many Roadside Units (RSUs) have been deployed on roads to collect the information of vehicles in their own coverages and to connect them to Internet. Thus, we propose a RSU-aided vehicular resource search and cloud construction mechanism in VANETS. In the proposed mechanism, a RSU collects the information of location and mobility of vehicles and selects provider vehicles enabled to provide resources needed for constructing a VC of a requester vehicle based on the collected information. In the proposed mechanism, the criteria for determining provider vehicles to provide resources are the connection duration between each candidate vehicle and the requester vehicle, the resource size of each candidate vehicle, and its connection starting time to the requester vehicle. Simulation results verify that the proposed mechanism achieves better performance than the existing mechanism.

Data Replicas Relocation Strategy in Mobile Computing System Environment (이동 컴퓨팅 시스템 환경에서 데이터 복제 재배치 기법)

  • Choe, Gang-Hui;Jo, Tae-Nam
    • The Transactions of the Korea Information Processing Society
    • /
    • v.6 no.10
    • /
    • pp.2587-2596
    • /
    • 1999
  • Recently, by the extension of skills like LAN, the wireless telecommunication network and the satelite services make it possible for the mobile computer users to access a database. A method to use the replicated database on a server to get new data without missing any information has been being studied. So far we have used the Static Replica Allocation(SRA) for the replication which is the method of the replication on the server. This method is to replicate the data on the replica server after a moving host is transferred to a cell. Since the network of the SRA is very good, and if there are few moving users, no trouble will happen. But if there is no moving users in a cell, the data will not be shared. Therefore, this paper is about the study of the method of relocation after replicating the data to the cells for the users(User Select Replica Allocation : USRA). We also analyze the access rate and the possibility which are closely related to the moving frequency of the mobile hosts and the numbers of the cells. As a result, We show that the 120% lower access cost and the 40%∼50% gains are achieved from the low mobility

  • PDF

Difference of Facial Skin Temperature Responses between Fear and Joy (공포와 기쁨 정서 간 안면온도 반응의 차이)

  • Eum, Yeong-Ji;Eom, Jin-Sup;Sohn, Jin-Hun
    • Science of Emotion and Sensibility
    • /
    • v.15 no.1
    • /
    • pp.1-8
    • /
    • 2012
  • There have been many emotion researches to investigate physiological responses on specific emotions with physiological parameters such as heart rate, blood volume flow, and skin conductance. Very few researches, however, exists by detecting them with facial skin temperature. The purpose of present study was to observe the differences of facial skin temperature by using thermal camera, when participants stimulated by monitor scenes which could evoke fear or joy. There were totally 98 of participants; undergraduate students who were in their adult age and middle, high school students who were in their adolescence. We measured their facial temperature, before and after presenting emotional stimulus to see changes between both times. Temperature values were extracted in these regions; forehead, inner corners of the eyes, bridge of the nose, end of the nose, and cheeks. Temperature values in bridge and end of the nose were significantly decreased in fear emotion stimulated. There was also significant temperature increase in the area of forehead and the inner corners of the eyes, while the temperature value in end of the nose decreased. It showed decrease in both stimulated fear and joy. These results might be described as follows: When arousal level going up, sympathetic nervous activity increases, and in turn it makes blood flow in peripheral vessels under the nose decrease. Facial temperature changes by fear or joy in this study were the same as the previous studies which measured temperature of finger tip, when participants experiencing emotions. Our results may help to develop emotion-measuring techniques and establish computer system bases which are to detect human emotions.

  • PDF

AT-DMB Reception Method with Eigen-space Beamforming Algorithm (고유 공간 빔형성 알고리즘을 이용한 AT-DMB 수신 방법)

  • Lee, Jae-Hong;Choi, Seung-Won
    • Journal of Broadcast Engineering
    • /
    • v.15 no.1
    • /
    • pp.122-132
    • /
    • 2010
  • AT-DMB system has been developed to increase data rate up to double of conventional T-DMB in the same bandwidth while maintaining backward compatibility. The AT-DMB system adopted hierarchical modulation which adds BPSK or QPSK signal as enhancement layer to existing DQPSK signal. The enhancement layer signal should be small enough to maintain backward compatibility and to minimize the coverage loss of conventional T-DMB service coverage. But this causes the enhancement layer signal of AT-DMB susceptible to fading effect in transmission channel. A turbo code which has improved error correction capability than convolutional code, is applied to the enhancement layer signal of the AT-DMB system for compensating channel distortion. However there is a need for other solutions for better reception of AT-DMB signal in receiver side without increasing transmitting power. In this paper, we propose adaptive array antenna system with Eigen-space beamforming algorithm which benefits beamforming gain along with diversity gain. We analyzed the reception performances of AT-DMB system in indoor and mobile environments when this new smart antenna system and algorithm is introduced. The computer simulation results are presented along with analysis comments.

Contents application airport security equipment·facility for terror prevention (테러방지를 위한 콘텐츠 응용 공항보안 장비·시설)

  • Kang, maeng-jin
    • Proceedings of the Korea Contents Association Conference
    • /
    • 2008.05a
    • /
    • pp.228-235
    • /
    • 2008
  • Terror for airplane, airport and passengers of the problems is being threat over the world. and since 9.11 terror of 2001 year, many countries have endeavored to prevent terror and have manipulate airport security part as important field. Especially, The U.S.A made Transportation security Administration in Homeland security adminstration and strongly execute for policies related anti-terror. many countries over the world enforce airport and airplane security facilities with science-technology contents. and with security exploitation for the passengers and freight security inspection level enforcement, many countries also make effort to interupt aviation terror threat. In this process, in the center of developed countries that need science-technology contents adaption, much budget and personals are invested and exploited a security inspection instrument and complimented of many facilities As a result, according to the development of science-technology, prevention of Terror have much developed. The contents using intelligence-communication technology inevitably needed on the goal of terror prevention and safty. From simple monitoring for the people who come in and out airport to boarding process and inspection for the freight, security inspection process for the passengers, bio information input, confirmation, of the level that there is no cases of adaption of contents, The reality have generalized of using contents. The study is going to research contents application situation.

  • PDF

A Study on the Safety Grounding for Prevention of Electric Shock Hazard in Construction of Industrial Plant in Maritime Landfill Area (해상 매립 지역 산업 플랜트 건설 시 감전 재해 예방을 위한 안전 접지에 관한 연구)

  • Kim, Hong-Yong;Jang, Ung-Burm
    • Journal of the Society of Disaster Information
    • /
    • v.13 no.3
    • /
    • pp.305-312
    • /
    • 2017
  • In our society, the advanced, advanced, and information industries have continued to grow and now live in the era of the fourth industrial revolution. As the industry develops, the load of the users has also increased so much that it is deepened by the energy shortage phenomenon and the construction of additional energy facilities is required. Therefore, energy plant construction work is being actively carried out in the coastal area. In particular, it is common to build a plant in the ground by filling the coast with soil in other regions, reflecting the fact that Korea is lacking in the country when constructing power plants, gas and petrochemical plants. Current domestic grounding designs are designed or constructed to suit only the use of grounding resistors based on the electrical equipment design technical standards. However, in the case of a plant facility constructed in the untested buried soil, when the lightning current and the abnormal current are inputted, the facility operator or the user due to the elevation of the ground potential is seriously exposed to the risk of electric shock disaster. In this paper, we analyze the ground resistivity of the landfilled soil and use a computer program (CDEGS) based on KS C IEC 61936-1, We analyze the contact voltage and stratification voltage and propose a grounding design optimized for plant installation.