• Title/Summary/Keyword: Fast Data

Search Result 3,838, Processing Time 0.034 seconds

Adaptive Modulation System Using SNR Estimation Method Based on Correlation of Decision Feedback Signal (Decision Feedback 신호의 자기 상관 기반 SNR 추정 방법을 적용한 적응 변조 시스템)

  • Kim, Seon-Ae;Ryu, Heung-Gyoon
    • The Journal of Korean Institute of Electromagnetic Engineering and Science
    • /
    • v.22 no.3
    • /
    • pp.282-291
    • /
    • 2011
  • Adaptive modulation(AM) is an important technique to increase the system efficiency, in which transmitter selects the most suitable modulation mode adaptively according to channel state in the temporary and spatially varying communication environment. Fixed modulation on channels with varying signal-to-noise ratio(SNR) is that the bit-errorrate(BER) probability performance is changing with the channel quality. An adaptive modulation scheme can be designed to have a BER which is constant for all channel SNRs. The correct as well as fast and simple SNR estimation is required essentially for this adaptive modulation. In order to operate adaptive modulation system effectively, in this paper, we analyze the effect of SNR estimation performance to it through the average BER and data throughput. Applying SNR estimation based on auto-correlation of decision feedback signal and others to adaptive modulation system, we also confirm performance degradation or improvement of its which is decided by SNR estimation error at each transition point of modulation level. Since SNR estimation based on auto-correlation of decision feedback signal shows stable estimation performance for various quadrature amplitude modulation(QAM) comparatively, this can be reduced degradation than others at each transition point of modulation level.

An Item-based Collaborative Filtering Technique by Associative Relation Clustering in Personalized Recommender Systems (개인화 추천 시스템에서 연관 관계 군집에 의한 아이템 기반의 협력적 필터링 기술)

  • 정경용;김진현;정헌만;이정현
    • Journal of KIISE:Software and Applications
    • /
    • v.31 no.4
    • /
    • pp.467-477
    • /
    • 2004
  • While recommender systems were used by a few E-commerce sites former days, they are now becoming serious business tools that are re-shaping the world of I-commerce. And collaborative filtering has been a very successful recommendation technique in both research and practice. But there are two problems in personalized recommender systems, it is First-Rating problem and Sparsity problem. In this paper, we solve these problems using the associative relation clustering and “Lift” of association rules. We produce “Lift” between items using user's rating data. And we apply Threshold by -cut to the association between items. To make an efficiency of associative relation cluster higher, we use not only the existing Hypergraph Clique Clustering algorithm but also the suggested Split Cluster method. If the cluster is completed, we calculate a similarity iten in each inner cluster. And the index is saved in the database for the fast access. We apply the creating index to predict the preference for new items. To estimate the Performance, the suggested method is compared with existing collaborative filtering techniques. As a result, the proposed method is efficient for improving the accuracy of prediction through solving problems of existing collaborative filtering techniques.

Identification of Voice for Listeners who Feel Favor Using Voice Analysis (음성 분석을 이용한 청자가 호감을 느끼는 목소리에 대한 규명)

  • Choi, Ji Hyun;Cho, Dong Uk;Jeong, Yeon Man
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.41 no.1
    • /
    • pp.122-131
    • /
    • 2016
  • In the smart societies, such as the current unlike in the past, the voice that listeners will feel favor is changing through the development of ICT technologies and infrastructure. In other words, in the past, loud, intensive and fast voice is a favorite but now a new social and cultural situation that is changing them with ICT technologies. Now, this becomes one of the important things that we clarify 'Is it a voice that feels a favor?'. For this, in this paper, we identified what voice that listeners feel favor by applying ICT technologies. Studies were carried out to proceed largely divided into two categories. Firstly, as the quantified data, we extracted the impact on favorable feeling of listeners which related with emotional speech by empirical analysis work. To do this, we performed the experiment for the public. Secondly, we identified what kind of voice which listeners feel a good impression. For this, we identified voice characteristics that there are people who are influential in the real society. Also, we extracted both the voice characteristics of each influential people and common voice characteristics. In addition, we want to overcome the problems of qualitative methods that have originally limitations in objective respects which is significant to the voice analysis. For this, we performed the experiments of the voice analysis by numerical and visual approaches.

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.

The Seamless Handoff Algorithm based on Multicast Group Mechanism among RNs in a PDSN Area (PDSN 영역내의 여러 RN간 멀티캐스트 그룹 메커니즘 기반의 Seamless 핸드오프 알고리즘)

  • Shin, Dong-Jin;Kim, Su-Chang;Lim, Sun-Bae;Oh, Jae-Chun;Song, Byeong-Kwon;Jeong, Tae-Eui
    • The KIPS Transactions:PartC
    • /
    • v.9C no.1
    • /
    • pp.97-106
    • /
    • 2002
  • In 3GPP2 standard, MIP is used and a PDSN performs the function of FA to support macro mobility. When a MS is roaming from a PDSN area to another, the mobility supported is called macro mobility, while it is called micro mobility when a MS is roaming from a RN area to another in a PDSN area. Since a PDSN performs the function of FA in 3GPP2 standard, it is possible to support mobility but its mechanism is actually for supporting macro mobility, not for micro mobility, thus it is weak in processing fast and seamless handoff to support micro mobility. In this paper, we suggest the seamless handoff algorithm barred on multicast group mechanism to support micro mobility. Depending on the moving direction and velocity of a MS, the suggested algorithm constructs a multicast group of RNs on the forecasted MS's moving path, and maximally delays RNs'joining to a multicast group to increase the network efficiency. Moreover, to resolve the buffer overhead problem of the existent multicast scheme, the algorithm suggests that each RN buffers data only after the forecasted handoff time. To prove deadlock freeness and liveness of the algorithm. we use state transition diagrams, a Petri-net modeling and its reachability tree. Then, we evaluate the performance by simulation.

Medical Image Compression Using JPEG International Standard (JPEG 표준안을 이용한 의료 영상 압축)

  • Ahn, Chang-Beom;Han, Sang-Woo;Kim, Il-Yoen
    • Proceedings of the KIEE Conference
    • /
    • 1993.07a
    • /
    • pp.504-506
    • /
    • 1993
  • The Joint Photographic Experts Group (JPEG) standard was proposed by the International Standardization Organization (ISO/SC 29/WG 10) and the CCITT SG VIII as an international standard for digital continuous-tone still image compression. The JPEG standard has been widely accepted in electronic imaging, computer graphics, and multi-media applications, however, due to the lossy character of the JPEG compression its application in the field of medical imaging has been limited. In this paper, the JPEG standard was applied to a series of head sections of magnetic resonance (MR) images (256 gray levels, $256{\times}256$ size) and its performance was investigated. For this purpose, DCT-based sequential mode of the JPEG standard was implemented using the CL550 compression chip and progressive and lossless coding was implemented by software without additional hardware. From the experiment, it appears that the compression ratio of about 10 to 20 was obtained for the MR images without noticeable distortion. It is also noted that the error signal between the reconstructed image by the JPEG and the original image was nearly random noise without causing any special-pattern-related artifact. Although the coding efficiency of the progressive and hierarchical coding is identical to that of the sequential coding in compression ratio and SNR, it has useful features In fast search of patient Image from huge image data base and in remote diagnosis through slow public communication channel.

  • PDF

Application of Ferrate(VI) on the Decomplexation of Cu(II)-EDTA

  • Tiwari, Diwakar;Yang, Jae-Kyu;Chang, Yoon-Young;Lee, Seung-Mok
    • Environmental Engineering Research
    • /
    • v.13 no.3
    • /
    • pp.131-135
    • /
    • 2008
  • In this study, Fe(VI) was employed as a multi-functional agent to treat the simulated industrial wastewater contaminated with Cu(II)-EDTA through oxidation of EDTA, decomplexation of Cu(II)-EDTA and subsequent removal of free copper through precipitation. The decomplexation of $10^{-4}\;M$ Cu(II)-EDTA species was performed as a function of pH at excess concentration of Fe(VI). It was noted that the acidic conditions favor the decomplexation of Cu(II)-EDTA as the decomplxation was almost 100% up to pH 6.5, while it was only 35% at pH 9.9. The enhanced degradation of Cu(II)-EDTA with decreasing the pH could be explained by the different speciation of Fe(VI). $HFeO_4^-$ and $H_2FeO_4$, which are relatively more reactive than the unprotonated species $FeO_4^{2-}$, are predominant species below neutral pH. It was noted that the decomplexation reaction is extremely fast and within 5 to10 min of contact, 100% of Cu(II)-EDTA was decomplexed at pH 4.0. However, at higher pH (i.e., pH 10.0) the decomplexation process was relatively slow and it was observed that even after 180 min of contact, maximum ca 37% of Cu(II)-EDTA was decomplexed. In order to discuss the kinetics of the decomplexation of Cu(II)-EDTA, the data was slightly fitted better for the second order rate reaction than the first order rate reaction in the excess of Fe(VI) concentration. On the other hand, the removal efficiency of free Cu(II) ions was also obtained at pH 4.0 and 10.0. It was probably removed through adsorption/coagulation with the reduced iron i.e., Fe(III). The removal of total Cu(II) was rapid at pH 4.0 whereas, it was slow at pH 10.0. Although the decomplexation was 100% at lower pH, the removal of free Cu(II) was relatively slow. This result may be explicable due to the reason that at lower pH values the adsorption/coagulation capacity of Fe(III) is greatly retarded. On the other hand, at higher pH values the decomplexation of Cu(II)-EDTA was partial, hence, slower Cu(II) removal was occurred.

A Study on Post-Admission Satisfaction Level among Dental Hygiene Students in Colleges (전문대학 치위생과 학생의 학과선택 및 실습실에 대한 만족도)

  • Park, Il-Soon;Lee, Kyung-Hee
    • Journal of Korean society of Dental Hygiene
    • /
    • v.6 no.4
    • /
    • pp.349-359
    • /
    • 2006
  • The purpose of this study was to help improve the quality of education to keep up with fast-changing environments in educating sector. Relevant literature and data were reviewed, and the subjects in this study were dental hygiene juniors at seven two-year colleges in the Seoul metropolitan area and other regions, on whom a survey was conducted for about three months from August through October, 2004, to assess their satisfaction level with their major and educational environments. And it's concluded that in order to attract more new students and foster qualified students, dental hygiene practice labs should be improved on a large scale, and that there should be a great deal of investment in teaching facilities. The major findings of the study were as follows: 1. As for satisfaction with major choice, 57.5% of the students investigated, the largest percentage, expressed satisfaction with their major. 27.8%, the second largest group, found their choice not to be bad. 2. Regarding satisfaction with the state of practice labs, 41.9% were pleased with practice labs. This rate was quite lower than that of nursing students, as 64.2% of nursing students were pleased with their practice labs.7) 3. As to satisfaction with individual practice labs, oral prophylaxis labs were considered most satisfactory, as 53.9% were satisfied with them. Digital radiation labs appeared to be satisfactory the least, which made 77.0% dissatisfied. 4. Whether there were any connections between their working experience as a clinical worker and satisfaction level was investigated. In terms of their satisfaction with major choice and the state of practice labs, the students who had ever worked as a clinical worker were relatively pleased with the state of practice labs. As for satisfaction with each practice lab, those who had ever served as a clinical worker before being admitted into college expressed more satisfaction with radiation practice labs(p<0.05) and digital radiation labs(p<.05) than the others who hadn't. The gap between the two was statistically significant. 5. In regard to the causes of dissatisfaction with practice labs, 93.7 and 80.0% were respectively dissatisfied with digital radiation labs and basic dental hygiene labs because their colleges were devoid of those labs. 51.6%, the largest group, found oral prophylaxis labs unsatisfactory because of their frequent breakdown. In the event of most of the other practice labs, the greatest percentage were discontented due to a shortage of equipment.

  • PDF

Efficient Local Decoding Using Bit Stream Map for High Resolution Video (비트 스트림 지도를 이용한 고해상도 영상의 효율적인 지역복호화)

  • Park Sungwon;Won Jongwoo;Lee Sunyoung;Kim Wookjoong;Kim Kyuheon;Jang Euee S
    • Journal of Broadcast Engineering
    • /
    • v.9 no.4 s.25
    • /
    • pp.391-401
    • /
    • 2004
  • In this paper, we introduce a novel coding method to efficiently enable spatial random access for high resolution video. In terms of resolution and display size, standard display devices (such as cathode-ray tubes. monitors. PDAs, and LCDs) do not sufficiently support high resolution video such as digital cinema and panoramic video. Currently, users have no choice but to view video at lower resolution as a result of down-sampling, or only a partial region of the video due to display size limitations. Our proposed method. which we call the B-map, represents the set of starting locations of the coded segments in a picture frame. This information, or B-map, is first sent to the decoder prior to the coded data stream of the frame and is then used for fast local decoding. To test our method, we compare our B-map with JPEG tiling and the JPEG Resynchronization marker. Experimental results show that the proposed coding method requires less overhead than existing methods during the same decoding time. The results show promise for future panoramic or digital cinema applications.

Bone Segmentation Method based on Multi-Resolution using Iterative Segmentation and Registration in 3D Magnetic Resonance Image (3차원 무릎 자기공명영상 내에서 영역화와 정합 기법을 반복적으로 이용한 다중 해상도 기반의 뼈 영역화 기법)

  • Park, Sang-Hyun;Lee, Soo-Chan;Yun, Il-Dong;Lee, Sang-Uk
    • Journal of Broadcast Engineering
    • /
    • v.17 no.1
    • /
    • pp.73-80
    • /
    • 2012
  • Recently, medical equipments are developed and used for diagnosis or studies. In addition, demand of techniques which automatically deal with three dimensional medical images obtained from the medical equipments is growing. One of the techniques is automatic bone segmentation which is expected to enhance the diagnosis efficiency of osteoporosis, fracture, and other bone diseases. Although various researches have been proposed to solve it, they are unable to be used in practice since a size of the medical data is large and there are many low contrast boundaries with other tissues. In this paper, we present a fast and accurate automatic framework for bone segmentation based on multi-resolutions. On a low resolution step, a position of the bone is roughly detected using constrained branch and mincut which find the optimal template from the training set. Then, the segmentation and the registration are iteratively conducted on the multiple resolutions. To evaluate the performance of the proposed method, we make an experiment with femur and tibia from 50 test knee magnetic resonance images using 100 training set. The proposed method outperformed the constrained branch and mincut in aspect of segmentation accuracy and implementation time.