• Title/Summary/Keyword: data memory

Search Result 3,343, Processing Time 0.034 seconds

Improvement of Residual Delay Compensation Algorithm of KJJVC (한일상관기의 잔차 지연 보정 알고리즘의 개선)

  • Oh, Se-Jin;Yeom, Jae-Hwan;Roh, Duk-Gyoo;Oh, Chung-Sik;Jung, Jin-Seung;Chung, Dong-Kyu;Oyama, Tomoaki;Kawaguchi, Noriyuki;Kobayashi, Hideyuki;Kawakami, Kazuyuki;Ozeki, Kensuke;Onuki, Hirohumi
    • Journal of the Institute of Convergence Signal Processing
    • /
    • v.14 no.2
    • /
    • pp.136-146
    • /
    • 2013
  • In this paper, the residual delay compensation algorithm is proposed for FX-type KJJVC. In case of initial version as that design algorithm of KJJVC, the integer calculation and the cos/sin table for the phase compensation coefficient were introduced in order to speed up of calculation. The mismatch between data timing and residual delay phase and also between bit-jump and residual delay phase were found and fixed. In final design of KJJVC residual delay compensation algorithm, the initialization problem on the rotation memory of residual delay compensation was found when the residual delay compensated value was applied to FFT-segment, and this problem is also fixed by modifying the FPGA code. Using the proposed residual delay compensation algorithm, the band shape of cross power spectrum becomes flat, which means there is no significant loss over the whole bandwidth. To verify the effectiveness of proposed residual delay compensation algorithm, we conducted the correlation experiments for real observation data using the simulator and KJJVC. We confirmed that the designed residual delay compensation algorithm is well applied in KJJVC, and the signal to noise ratio increases by about 8%.

A Study on the Verification of the Profile of Seo구s Elderly Stress Scale (SESS) (노인 스트레스 측정 도구(SESS)의 신뢰도 및 타당도 검증 연구)

  • 서현미;유수정;하양숙
    • Journal of Korean Academy of Nursing
    • /
    • v.31 no.1
    • /
    • pp.94-106
    • /
    • 2001
  • The purpose of this study was to verify the use of Seo's Elderly Stress Scale (SESS), which was developed in 1996. Through the modified tool, it is possible to examine the stress of Korean elders and to contribute to the welfare of them. The subjects were 350 elders over 65 years old who live in Seoul, Kwang-Ju, Yang-Ju Gun Kyung-ki Do, Ui-Jong Bu, and Young-Am Kun, Jeun-Ra Nam Do. the data of 331 elders (94%) were analyzed. Data were collected between January and March in 1996 and analyzed using the SPSS Win 8.0. The result are as follows: 1. Items with low correlation with the total items were removed. So 27 items were removed and 37 items remained. This 37 items were death in the family and/or close friends, family member's behavior not meeting expectations, marriage of daughter, marriage of son, friction with daughter- in-law, argument among children, children refuse to live with parent, children leaving home, sex injury or accident, in frequest visits from children and grandchildren, providing care for your daughter or daughter-in-law post-partum, decrease in decision making and authority in home, Lunar new year and the harvest featival, house sitting, working in the house, performing a sacrificial rite, missed birthday, not living with the eldest son, decreased eyesight, decreased strength, decreased memory, sleep pattern changes, thoughts about death, loneliness, decreased hearing, change of dental condition, change in your diet or eating style, difficulty in self care, moving because of disease or aging, argument with friend or neighbour, travel, dealing with the procedure of heritage, loss of money or property, not enough pocket money, hearing on elderly neglect in television or radio, hope of going home and ignorant from others. 2. Overlapped items were discussed by colleagues and were modified. 'marriage of daughter' and 'marriage of son' were modified in 'marriage of children'. 'self injury or accidents' and 'family accidents' were modified in to self or family accidents. 3. Factor analysis was done in order to identify validity and three factors were obtained from the result. The first factor familial relation area, included 17 items. The second factor, physical area, included 9 items. The third factor, psycho-socio-economic area, included 9 items. Cronbach coefficient alpha for the 35 items was .923. 4. Pearson's correlation was .704 between SESS and SOS (Symptoms of Stress) in order to confirm construct validity. Based on the result, the following is suggested; 1. The modified SESS needs to be reverified with elder. 2. Korean elder's health promotion can be made by development of stress intervention which was accurately measured with SESS.

  • PDF

Design of Hardwired Variable Length Decoder for H.264/AVC (하드웨어 구조의 H.264/AVC 가변길이 복호기 설계)

  • Yu, Yong-Hoon;Lee, Chan-Ho
    • Journal of the Institute of Electronics Engineers of Korea SD
    • /
    • v.45 no.11
    • /
    • pp.71-76
    • /
    • 2008
  • H.264(or MPEG-4/AVC pt.10) is a high performance video coding standard, and is widely used. Variable length code (VLC) of the H.264 standard compresses data using the statistical distribution of values. A decoder parses the compressed bit stream and searches decoded values in lookup tables, and the decoding process is not easy to implement by hardware. We propose an architecture of variable length decoder(VLD) for the H.264 baseline profile(BP) L4. The CAVLD decodes syntax elements using the combination of arithmetic units and lookup tables for the optimized hardware architecture. A barral shifter and a first 1's detector parse NAL bit stream, and are shared by Exp-Golomb decoder and CAVLD. A FIFO memory between CAVLD and the reorder unit and a buffer at the output of the reorder unit eliminate the bottleneck of data stream. The proposed VLD is designed using Verilog-HDL and is implemented using an FPGA. The synthesis result using a 0.18um standard CMOS technology shows that the gate count is 22,604 and the decoder can process HD($1920{\times}1080$) video at 120MHz.

Timely Sensor Fault Detection Scheme based on Deep Learning (딥 러닝 기반 실시간 센서 고장 검출 기법)

  • Yang, Jae-Wan;Lee, Young-Doo;Koo, In-Soo
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.20 no.1
    • /
    • pp.163-169
    • /
    • 2020
  • Recently, research on automation and unmanned operation of machines in the industrial field has been conducted with the advent of AI, Big data, and the IoT, which are the core technologies of the Fourth Industrial Revolution. The machines for these automation processes are controlled based on the data collected from the sensors attached to them, and further, the processes are managed. Conventionally, the abnormalities of sensors are periodically checked and managed. However, due to various environmental factors and situations in the industrial field, there are cases where the inspection due to the failure is not missed or failures are not detected to prevent damage due to sensor failure. In addition, even if a failure occurs, it is not immediately detected, which worsens the process loss. Therefore, in order to prevent damage caused by such a sudden sensor failure, it is necessary to identify the failure of the sensor in an embedded system in real-time and to diagnose the failure and determine the type for a quick response. In this paper, a deep neural network-based fault diagnosis system is designed and implemented using Raspberry Pi to classify typical sensor fault types such as erratic fault, hard-over fault, spike fault, and stuck fault. In order to diagnose sensor failure, the network is constructed using Google's proposed Inverted residual block structure of MobilieNetV2. The proposed scheme reduces memory usage and improves the performance of the conventional CNN technique to classify sensor faults.

Effects of Self-Identification with Threatened In-Group and System Justification on Within-Domain Consumption

  • CHOI, Nak-Hwan
    • The Journal of Industrial Distribution & Business
    • /
    • v.11 no.8
    • /
    • pp.39-49
    • /
    • 2020
  • Purpose: Current study aimed at exploring the roles of system justification in the effects of consumers' self-identification with the threatened social in-group on the within-domain versus across-domain consumption. It focused on whether there are positive effects of both of the self-definition and the self-investment on the in-group system justification, and also explored whether the system justification, in turn, could make positive effects on the consumption. Research design, data and methodology: The self-identification was approached in view of self-definition and self-investment when the in-group was threatened by members of their out group. The empirical study was performed with the single factor within-subject design based on the feeling of the consumers' being threatened when the in-group was criticized by the others. The in-group threatened was accessed from the memory of each of the undergraduate students participating in the empirical study by asking them to remember the events by which their important in-group was perceived to be threatened in their past life. Questionnaire data collected from the undergraduate students were used to verify research hypotheses by structural equation model in Amos 21.0 program. Results: First, the self-definition positively affected the within-domain versus across-domain consumption, but did not affect the in-group system justification. Second, the self-investment positively affected the in-group system justification. Third, the system justification made positive effects on the within-domain versus the across-domain consumption. Therefore, this article could contribute to the development of the theory related to compensatory consumption in the view that there could be the positive mediation roles of system justification in the effects of consumers' self-investment to their in-group on the within-domain versus across-domain consumption when the in-group is threatened. Conclusions: The results of this study could give managerial implications to brand or product marketing managers. How to vitalize consumers' self-definition with, and self-investment to, the threatened in-group is at issue to the marketers when consumers' important in-group was threatened by others. By evoking the in-group-based self-investment to consumers when the in-group was threatened, the marketers should increase the level of the system justification, and the marketers should promote the consumers to recognize that their products or brands are included into the within-self domain.

Application of KOMPSAT-5 SAR Interferometry by using SNAP Software (SNAP 소프트웨어를 이용한 KOMPSAT-5 SAR 간섭기법 구현)

  • Lee, Hoonyol
    • Korean Journal of Remote Sensing
    • /
    • v.33 no.6_3
    • /
    • pp.1215-1221
    • /
    • 2017
  • SeNtinel's Application Platform (SNAP) is an open source software developed by the European Space Agency and consists of several toolboxes that process data from Sentinel satellite series, including SAR (Synthetic Aperture Radar) and optical satellites. Among them, S1TBX (Sentinel-1 ToolBoX)is mainly used to process Sentinel-1A/BSAR images and interferometric techniques. It provides flowchart processing method such as Graph Builder, and has convenient functions including automatic downloading of DEM (Digital Elevation Model) and image mosaicking. Therefore, if computer memory is sufficient, InSAR (Interferometric SAR) and DInSAR (Differential InSAR) perform smoothly and are widely used recently in the world through rapid upgrades. S1TBX also includes existing SAR data processing functions, and since version 5, the processing capability of KOMPSAT-5 has been added. This paper shows an example of processing the interference technique of KOMPSAT-5 SAR image using S1TBX of SNAP. In the open mine of Tavan Tolgoi in Mongolia, the difference between DEM obtained in KOMPSAT-5 in 2015 and SRTM 1sec DEM obtained in 2000 was analyzed. It was found that the maximum depth of 130 meters was excavated and the height of the accumulated ore is over 70 meters during 15 years. Tidal and topographic InSAR signals were observed in the glacier area near Jangbogo Antarctic Research Station, but SNAP was not able to treat it due to orbit error and DEM error. In addition, several DInSAR images were made in the Iraqi desert region, but many lines appearing in systematic errors were found on coherence images. Stacking for StaMPS application was not possible due to orbit error or program bug. It is expected that SNAP can resolve the problem owing to a surge in users and a very fast upgrade of the software.

A Study on a Coping Method of the Family Caregivers of Demented Patients (치매노인 가족부양자의 대처방법에 관한 연구)

  • You, Kwang-Soo
    • Research in Community and Public Health Nursing
    • /
    • v.13 no.4
    • /
    • pp.648-667
    • /
    • 2002
  • This was a descriptive study designed to identify the level of coping method and its influencing factors on the family caregivers of demented patients, and resolve the family caregivers' level of stress. The data were collected from September 10 to October 10, 2001. Subjects for this study were recruited from four clinics, which were chosen from 15 clinics located in Chunbuk-Do as the study sites because of their cooperation for the study. They were similar in terms of size, the characteristics of the local community. and the population and registration status of the demented patients. The instruments used for the study were as follows: 1. Problematic behaviors of demented patients are measured by the Memory and Behavior Problem Checklist (Zarit, 1980), and the Linguistic Communication Symptoms Questionnaire (Bayles and Tomoeda, 1991) 2. The ability to carry out daily activities was measured using the Barthel Index (1965) and Katz Index (1963), which as well-known ADL assessment methods. 3. Burden was measured using Cost of Care Index by the Kosberg and Cairl (1986). 4. Coping strategy was measured Bell's 18 methods (1977). The data were analyzed using SPSS/PC. The study results were as follows: 1. The total stress score was 2.90 out of a maximum score of 5. The highest score reported was 3.09 on the dimension of restriction of individual and social activities, and the lowest region reported was 2.58 on the dimension of mental and physical health. 2. The total score of the coping method was 2.65 out of a maximum score of 5. The highest score reported was 4.01 on the dimension of thinking that includes an ideation such that it is better than any possible worst case, and the lowest score reported was 1.45 on the dimension of the self-image as a scapegoat. 3. There were significant differences in coping method among the subjects by age (F=2.752 p=0.04), caregiver (F=4.33 p=0.003), care-giving period (F=2.68 p=0.049), and dementia stage (F=2.87 p=0.034). 4. There were highly negative correlations ($\gamma$=-0.301 p=0.000) between problematic behaviors of demented patients and the coping method of their family caregivers. The highest correlation coefficient ($\gamma$=-0.339 p=0.000) was found between aggressive behaviors of the demented patients and the coping method of their family caregivers. 5. There was a low negative correlation ($\gamma$=-0.201 p=0.019) between the ADL of the demented patients and the coping method of their family caregivers. 6. There were highly negative correlations ($\gamma$=-0.213 p=0.005) between stress and the coping method of the family caregivers. The highest correlation was found between financial burden ($\gamma$=-.327 P=.000) and the coping method of the family caregivers. There was no significant correlation among unpleasant aspects of the demented patients, willingness to the demented patients, and the coping method of the family caregivers.

  • PDF

Design and Implementation of An I/O System for Irregular Application under Parallel System Environments (병렬 시스템 환경하에서 비정형 응용 프로그램을 위한 입출력 시스템의 설계 및 구현)

  • No, Jae-Chun;Park, Seong-Sun;;Gwon, O-Yeong
    • 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.

A Bit-Map Trie for the High-Speed Longest Prefix Search of IP Addresses (고속의 최장 IP 주소 프리픽스 검색을 위한 비트-맵 트라이)

  • 오승현;안종석
    • Journal of KIISE:Information Networking
    • /
    • v.30 no.2
    • /
    • pp.282-292
    • /
    • 2003
  • This paper proposes an efficient data structure for forwarding IPv4 and IPv6 packets at the gigabit speed in backbone routers. The LPM(Longest Prefix Matching) search becomes a bottleneck of routers' performance since the LPM complexity grows in proportion to the forwarding table size and the address length. To speed up the forwarding process, this paper introduces a data structure named BMT(Bit-Map Tie) to minimize the frequent main memory accesses. All the necessary search computations in BMT are done over a small index table stored at cache. To build the small index table from the tie representation of the forwarding table, BMT represents a link pointer to the child node and a node pointer to the corresponding entry in the forwarding table with one bit respectively. To improve the poor performance of the conventional tries when their height becomes higher due to the increase of the address length, BMT adopts a binary search algorithm for determining the appropriate level of tries to start. The simulation experiments show that BMT compacts the IPv4 backbone routers' forwarding table into a small one less than 512-kbyte and achieves the average speed of 250ns/packet on Pentium II processors, which is almost the same performance as the fastest conventional lookup algorithms.

A Scalable OWL Horst Lite Ontology Reasoning Approach based on Distributed Cluster Memories (분산 클러스터 메모리 기반 대용량 OWL Horst Lite 온톨로지 추론 기법)

  • Kim, Je-Min;Park, Young-Tack
    • Journal of KIISE
    • /
    • v.42 no.3
    • /
    • pp.307-319
    • /
    • 2015
  • Current ontology studies use the Hadoop distributed storage framework to perform map-reduce algorithm-based reasoning for scalable ontologies. In this paper, however, we propose a novel approach for scalable Web Ontology Language (OWL) Horst Lite ontology reasoning, based on distributed cluster memories. Rule-based reasoning, which is frequently used for scalable ontologies, iteratively executes triple-format ontology rules, until the inferred data no longer exists. Therefore, when the scalable ontology reasoning is performed on computer hard drives, the ontology reasoner suffers from performance limitations. In order to overcome this drawback, we propose an approach that loads the ontologies into distributed cluster memories, using Spark (a memory-based distributed computing framework), which executes the ontology reasoning. In order to implement an appropriate OWL Horst Lite ontology reasoning system on Spark, our method divides the scalable ontologies into blocks, loads each block into the cluster nodes, and subsequently handles the data in the distributed memories. We used the Lehigh University Benchmark, which is used to evaluate ontology inference and search speed, to experimentally evaluate the methods suggested in this paper, which we applied to LUBM8000 (1.1 billion triples, 155 gigabytes). When compared with WebPIE, a representative mapreduce algorithm-based scalable ontology reasoner, the proposed approach showed a throughput improvement of 320% (62k/s) over WebPIE (19k/s).