• 제목/요약/키워드: Same data

Search Result 10,938, Processing Time 0.044 seconds

Object-Size and Call-Site Tracing based Shared Memory Allocator for False Sharing Reduction in DSM Systems (분산 공유 메모리 시스템에서 거짓 공유를 줄이는 객체-크기 및 호출지-추적 기반 공유 메모리 할당 기법)

  • Lee, Jong-Woo;Park, Young-Ho;Yoon, Yong-Ik
    • Journal of Digital Contents Society
    • /
    • v.9 no.1
    • /
    • pp.77-86
    • /
    • 2008
  • False sharing is a result of co-location of unrelated data in the same unit of memory coherency, and is one source of unnecessary overhead being of no help to keep the memory coherency in multiprocessor systems. Moreover, the damage caused by false sharing becomes large in proportion to the granularity of memory coherency. To reduce false sharing in page-based DSM systems, it is necessary to allocate unrelated data objects that have different access patterns into the separate shared pages. In this paper we propose sized and call-site tracing-based shared memory allocator, shortly SCSTallocator. SCSTallocator places each data object requested from the different call-sites into the separate shared pages, and at the same time places each data object that has different size into different shared pages. Consequently data objects that have the different call-site and different object size prohibited from being allocated to the same shared page. Our observations show that our SCSTallocator outperforms the existing dynamic shared memory allocators. By combining the two existing allocation technique, we can reduce a considerable amount of false sharing misses.

  • PDF

Proposal Ultra-fast Multimedia Optical Subscriber Access Network to Guarantee the same Performance Regardless of Data Rates using Optical Frequency Domain CDMA Method (데이터속도에 무관하게 동일 성능을 보장하는 광주파수영역 CDMA를 이용한 초고속 멀티미디어 광 가입자망의 제안)

  • Park, Sang-Jo;Kim, Bong-Kyu
    • The KIPS Transactions:PartC
    • /
    • v.11C no.5
    • /
    • pp.671-676
    • /
    • 2004
  • In this paper, we propose ultra-fast multimedia optical subscriber access network using optical frequency domain CDMA method in order to access the multimedia with multiple data rates. We numerically analyze the effects of spectral power distortion in the light source for the optical CDMA system modified PN codes and FBG(Fiber Bragg Grating)s. In the proposed multiple-rate multimedia access optical networks, the performances such as BER(Bit Error Rate) are the same for all data regardless of data rates in the case of the same number of simultaneous ONU. In the proposed ultra-fast multimedia optical subscriber access network, the performances for all data are much more improved than those in the conventional system.

The Study on the Different Moderation Effect of Contingency Variable (Focused on SPSS statistics and AOMS program) (상황변수의 조절효과 차이에 관한 연구 (SPSS와 AMOS프로그램을 중심으로))

  • Choi, Chang-Ho;You, Yen-Yoo
    • Journal of Digital Convergence
    • /
    • v.15 no.2
    • /
    • pp.89-98
    • /
    • 2017
  • This study analyzed empirically the same data through SPSS statistics(regression analysis) and AMOS program(structural equation model) used for cause and effect analysis. The result of empirical analysis of moderation effect was as follows. Meanwhile, SPSS statistics(regression analysis) did not pictured moderation effect in the categorical data(sex) and continous data(satisfaction of consunting), AMOS program(structural equation model) pictured partial moderation effect about the effecting of consultant's capability and attitude on the consulting repurchase within 10% level of significant. Eventually, This study showed that AMOS program and SPSS statistics used different methology in moderation effect, thus the different outcomes appeared although using the same data.

An Efficient LWE-Based Reusable Fuzzy Extractor (효율적인 LWE 기반 재사용 가능한 퍼지 추출기)

  • Kim, Juon;Lee, Kwangsu;Lee, Dong Hoon
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.32 no.5
    • /
    • pp.779-790
    • /
    • 2022
  • Fuzzy extractor is a biometric encryption that generates keys from biometric data where input values are not always the same due to the noisy data, and performs authentication securely without exposing biometric information. However, if a user registers biometric data on multiple servers, various attacks on helper data which is a public information used to extract keys during the authentication process of the fuzzy extractor can expose the keys. Therefore many studies have been conducted on reusable fuzzy extractors that are secure to register biometric data of the same person on multiple servers. But as the key length increases, the studies presented so far have gradually increased the number of key recovery processes, making it inefficient and difficult to utilize in security systems. In this paper, we design an efficient and reusable fuzzy extractor based on LWE with the same or similar number of times of the authentication process even if the key length is increased, and show that the proposed algorithm is reusably-secure defined by Apon et al.[5].

Optimal Thoracic Sound Data Extraction Using Principal Component Analysis (주성분 분석을 이용한 최적 흉부음 데이터 검출)

  • 임선희;박기영;최규훈;박강서;김종교
    • Proceedings of the IEEK Conference
    • /
    • 2003.07e
    • /
    • pp.2156-2159
    • /
    • 2003
  • Thoracic sound has been widely known as a good method to examine thoracic disease. But, it's difficult to diagnose with correct data according to patient's thoracic position from same patient who has thoracic disease. Therefore, it is necessary to normalize the data for lung sound objectively In this paper, we'd like to detect a useful data for medical examination by applying PCA(Principal Component Analysis) to thoracic sound data and then present a objective data about lung and heart sound for thoracic disease.

  • PDF

A Near Optimal Data Allocation Scheme for Multiple Broadcast-Channel Environments (다중 방송 채널 환경을 위한 유사 최적화 데이터 할당 기법)

  • Kwon, Hyeok-Min
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.12 no.1
    • /
    • pp.17-27
    • /
    • 2012
  • Broadcast-based data dissemination has become a widely accepted approach of communication in the mobile computing environment. However, with a large set of data items, the expected delay of receiving a desired data increases due to the sequential nature of the broadcast channel. This paper explores the issue of designing proper data allocation on multiple broadcast channels to reduce this wait time, and proposes a new data allocation scheme named near optimal data allocation(NODA). The proposed scheme first partitions all data items in K group based on the theoretical lower-bound of the average expected delay to determine data items which each broadcast channel has to broadcast. Then, NODA further partitions each group of data items in B groups using extended dynamic programming algorithm to broadcast data items allocated on the same broadcast channel in different frequencies. The proposed scheme is capable of minimizing the average expected delay time since it can broadcast data items allocated on the same channel reflecting their popularities.

WWW Cache Replacement Algorithm Based on the Network-distance

  • Kamizato, Masaru;Nagata, Tomokazu;Taniguchi, Yuji;Tamaki, Shiro
    • Proceedings of the IEEK Conference
    • /
    • 2002.07a
    • /
    • pp.238-241
    • /
    • 2002
  • With the popularity of utilization of the Internet among people, the amount of data in the network rapidly increased. So that, the fall of response time from WWW server, which is caused by the network traffic and the burden on m server, has become more of an issue. This problem is encouraged the rearch by redundancy of requesting the same pages by many people, even though they browse the same the ones. To reduce these redundancy, WWW cache server is used commonly in order to store m page data and reuse them. However, the technical uses of WWW cache that different from CPU and Disk cache, is known for its difficulty of improving the cache hit rate. Consecuently, it is difficult to choose effective WWW data to be stored from all data flowing through the WWW cache server. On the other hand, there are room for improvement in commonly used cache replacement algorithms by WWW cache server. In our study, we try to realize a WWW cache server that stresses on the improvement of the stresses of response time. To this end, we propose the new cache replacement algorithm by focusing on the utilizable information of network distance from the WWW cache server to WWW server that possessing the page data of the user requesting.

  • PDF

A Biomechanical Analysis of Lower Extremity Kinematics and Kinetics During Level Walking (평지를 걸어갈 때 하지운동과 작용하는 하중에 대한 생체역학적 해석)

  • Son, Kwon;Choi, Gi-Yeong;Chung, Min-Keun
    • Transactions of the Korean Society of Mechanical Engineers
    • /
    • v.18 no.8
    • /
    • pp.2101-2112
    • /
    • 1994
  • A two-dimensional biomechanical model was developed in order to calculated the lower extremity kinematics and kinetics during level walking. This model consists of three segments : the thigh, calf, and foot. Each segment was assumed to be a rigid body ; its motion to be planar in the sagittal plane. Five young males were involved in the gait experiment and their anthropometric data were measured for the calculation of segmental masses and moments of inertial. Six markers were used to obtain the kinematic data of the right lower extremity for at least three trials of walking at 1.0m/s, and simultaneously a Kistler force plate was used to obtain the foot-floor reaction data. Based on the experimental data acquired for the stance phase of the right foot, calculated vertical joint forces reached up to 0.91, 1.05, and 1.11 BW(body weight) at the hip, the knee, the ankle joints, respectively. The flexion-extension moments reached up to 69.7, 52.3, and 98.8 Nm in magnitude at the corresponding three joints. It was found that the calculated joint loadings of a subject were statistically the same for all his three trials, but not the same for all five subjects involved in the gait study.

Storage Feature-Based Watermarking Algorithm with Coordinate Values Preservation for Vector Line Data

  • Zhou, Qifei;Ren, Na;Zhu, Changqing;Tong, Deyu
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.12 no.7
    • /
    • pp.3475-3496
    • /
    • 2018
  • Most of current watermarking algorithms for GIS vector data embed copyright information by means of modifying the coordinate values, which will do harm to its quality and accuracy. To preserve the fidelity of vector line data and protect its copyright at the same time, a lossless watermarking algorithm is proposed based on storage feature in this paper. Firstly, the superiority of embedding watermark based on storage feature is demonstrated theoretically and technically. Then, the basic concepts and operations on storage feature have been defined including length and angle of the polyline feature. In the process of embedding watermark, the watermark information is embedded into directions of polyline feature by the quantitative mechanism, while the positions of embedding watermark are determined by the feature length. Hence, the watermark can be extracted by the same geometric features without original data or watermark. Finally, experiments have been conducted to show that coordinate values remain unchanged after embedding watermark. Moreover, experimental results are presented to illustrate the effectiveness of the method.

Understanding Recreational Choice Behavior: Application of Theory of Planned Behavior (레크레이션 선택행동의 체계적 이해 : 계측행동이론의 적용으로)

    • Journal of the Korean Institute of Landscape Architecture
    • /
    • v.25 no.4
    • /
    • pp.18-29
    • /
    • 1998
  • This study was carried out to test the theory of planned behavior in recreational choices behavior. Lotte World was chosen as study area, and college students were selected by nonprobability sampling for two waves of data collection. The first wave of data were collected one weeks into the spring semester : intention, attitude, subjective norm, and perceived behavioral control were measured. To collect the data of the second wave, the same resondents were asked their behavior, one week data of the second wave, the same respondents were asked their behavior , one week prior to the final examination : whether they visited the Lotte World or not. Polychoric correlation among variables were calculated by the PRELIS because behavior was nominal variable. Then, weighted least square method was utilized to calibrate structural equation model by the LISREL version 7.2. Structural link effect on intention among three determinants : the direct effect on intention was 0.421 and the indirect effect via intention on behavior was 0.145, respectively. However, its effect on behavior was insignificant because actual control over 'visiting of Lotte World' was relatively high. A few comments were sugested on data collection, and inclusion of new variables was discussed for the sufficiency f the theory of planned behavior.

  • PDF