• Title/Summary/Keyword: time domain data

Search Result 1,310, Processing Time 0.037 seconds

Web Content Loading Speed Enhancement Method using Service Walker-based Caching System (서비스워커 기반의 캐싱 시스템을 이용한 웹 콘텐츠 로딩 속도 향상 기법)

  • Kim, Hyun-gook;Park, Jin-tae;Choi, Moon-Hyuk;Moon, Il-young
    • Journal of Advanced Navigation Technology
    • /
    • v.23 no.1
    • /
    • pp.55-60
    • /
    • 2019
  • The web is one of the most intimate technologies in people's daily lives, and most of the time, people are sharing data on the web. Simple messenger, news, video, as well as various data are now spreading through the web. In addition, with the emergence of Web assembly technology, the programs that run in the existing native environment start to enter the domain of the Web, and the data shared by the Web is now getting wider and larger in terms of VR / AR contents and big data. Therefore, in this paper, we have studied how to effectively deliver web contentsto users who use Web service by using service worker that can operate independently without being dependent on browser and cache API that can effectively store data in web browser.

KNU Korean Sentiment Lexicon: Bi-LSTM-based Method for Building a Korean Sentiment Lexicon (Bi-LSTM 기반의 한국어 감성사전 구축 방안)

  • Park, Sang-Min;Na, Chul-Won;Choi, Min-Seong;Lee, Da-Hee;On, Byung-Won
    • Journal of Intelligence and Information Systems
    • /
    • v.24 no.4
    • /
    • pp.219-240
    • /
    • 2018
  • Sentiment analysis, which is one of the text mining techniques, is a method for extracting subjective content embedded in text documents. Recently, the sentiment analysis methods have been widely used in many fields. As good examples, data-driven surveys are based on analyzing the subjectivity of text data posted by users and market researches are conducted by analyzing users' review posts to quantify users' reputation on a target product. The basic method of sentiment analysis is to use sentiment dictionary (or lexicon), a list of sentiment vocabularies with positive, neutral, or negative semantics. In general, the meaning of many sentiment words is likely to be different across domains. For example, a sentiment word, 'sad' indicates negative meaning in many fields but a movie. In order to perform accurate sentiment analysis, we need to build the sentiment dictionary for a given domain. However, such a method of building the sentiment lexicon is time-consuming and various sentiment vocabularies are not included without the use of general-purpose sentiment lexicon. In order to address this problem, several studies have been carried out to construct the sentiment lexicon suitable for a specific domain based on 'OPEN HANGUL' and 'SentiWordNet', which are general-purpose sentiment lexicons. However, OPEN HANGUL is no longer being serviced and SentiWordNet does not work well because of language difference in the process of converting Korean word into English word. There are restrictions on the use of such general-purpose sentiment lexicons as seed data for building the sentiment lexicon for a specific domain. In this article, we construct 'KNU Korean Sentiment Lexicon (KNU-KSL)', a new general-purpose Korean sentiment dictionary that is more advanced than existing general-purpose lexicons. The proposed dictionary, which is a list of domain-independent sentiment words such as 'thank you', 'worthy', and 'impressed', is built to quickly construct the sentiment dictionary for a target domain. Especially, it constructs sentiment vocabularies by analyzing the glosses contained in Standard Korean Language Dictionary (SKLD) by the following procedures: First, we propose a sentiment classification model based on Bidirectional Long Short-Term Memory (Bi-LSTM). Second, the proposed deep learning model automatically classifies each of glosses to either positive or negative meaning. Third, positive words and phrases are extracted from the glosses classified as positive meaning, while negative words and phrases are extracted from the glosses classified as negative meaning. Our experimental results show that the average accuracy of the proposed sentiment classification model is up to 89.45%. In addition, the sentiment dictionary is more extended using various external sources including SentiWordNet, SenticNet, Emotional Verbs, and Sentiment Lexicon 0603. Furthermore, we add sentiment information about frequently used coined words and emoticons that are used mainly on the Web. The KNU-KSL contains a total of 14,843 sentiment vocabularies, each of which is one of 1-grams, 2-grams, phrases, and sentence patterns. Unlike existing sentiment dictionaries, it is composed of words that are not affected by particular domains. The recent trend on sentiment analysis is to use deep learning technique without sentiment dictionaries. The importance of developing sentiment dictionaries is declined gradually. However, one of recent studies shows that the words in the sentiment dictionary can be used as features of deep learning models, resulting in the sentiment analysis performed with higher accuracy (Teng, Z., 2016). This result indicates that the sentiment dictionary is used not only for sentiment analysis but also as features of deep learning models for improving accuracy. The proposed dictionary can be used as a basic data for constructing the sentiment lexicon of a particular domain and as features of deep learning models. It is also useful to automatically and quickly build large training sets for deep learning models.

Mobile IP local pre-registration scheme for accommodating real-time data traffics in cdma2000 Networks (cdma2000 네트워크에서 실시간 데이터 트래픽을 수용하기 위한 Mobile IP 지역내 사전등록 기법)

  • 박민철;임재성
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.28 no.7A
    • /
    • pp.493-502
    • /
    • 2003
  • In this paper, to solve some problems of the Mobile IP and local registration strategy we propose a method that can effectively support real-time traffics sensitive to delay time and packet loss. The proposed method reduces the registration time after a Mobile Node's movement between networks by carrying out the pre-registration for the domain which it will move into the network information of the link layer of cdma2000 system, at the boundary cell's handoff zone. Through the cost analysis and simulation it is shown that the proposed scheme yield a better performance compared with the Mobile IP and local registration strategies in terms of packet loss for parameters; variation of the velocity of a Mobile Node, and a distance between the Mobile Node and home networks, etc.

A Quantitative Analysis of Nonlinearity Changes of 24 hour Heart Rate Variability of TOF Children Group and Normal Children Group (TOF 소아 집단과 정상 소아 집단의 24 시간 심박동수 변동량의 비선형성 변화에 대한 정량적 분석)

  • Lee, J.M.;Noh, J.I.;Park, K.S.
    • Proceedings of the KOSOMBE Conference
    • /
    • v.1997 no.11
    • /
    • pp.451-454
    • /
    • 1997
  • It has been reported that sudden cardiac death and ventricular tachycardia occur after treatment of tetralogy of fallot(TOF). It is regarded that ventricular arrythmia is the main source or the sudden cardiac death, but it is not verified. It is likely that TOF has effect on the heart rate variability because of the ventricular arrythmia. We study how complex and periodic heart rate dynamics change in the normal children (n=13) and TOF children (n=13) throughout 24 hours. We recorded 24-hour holter ECG, and segmented each ECG data into 1 hour length. We analyze each HR time series, and quantify the overall complexity of each HR time series by its correlation dimension. We also calculate the power spectrum of HR, and obtain low-frequency component (0.03-0.15Hz) and high-frequency component (0.15-0.4Hz). We compare the results between normal and TOF groups throughout 24 hours. TOF group have lower correlation dimension ($4.055{\pm}0.4134$ vs. $4.9310{\pm}0.2054$, p<0.05) than the normal group, even though there are no significant differences in the low($0.9864{\pm}0.5598$ vs. $1.5560{\pm}0.8325$, p<0.05) and high($1.1168{\pm}0.1.1448$ vs. $0.9271{\pm}0.6528$, p<0.05) frequency components. It can be concluded that HR time series of TOF group are more regular than that of normal group, and that correlation dimension reveals a nonlinear characteristics of HR time series which is not determined in the frequency domain.

  • PDF

Analysis of Micro-Doppler Signatures from Rotating Propellers Using Modified HHT Method (수정된 HHT 기법을 이용하여 회전하는 프로펠러 날개에 의한 마이크로 도플러 신호의 해석)

  • Park, Ji-Hoon;Choi, Ik-Hwan;Myung, Noh-Hoon
    • The Journal of Korean Institute of Electromagnetic Engineering and Science
    • /
    • v.23 no.9
    • /
    • pp.1100-1106
    • /
    • 2012
  • This paper has presented the analysis of the micro-Doppler signatures scattered from the blades of the rotating propeller using the modified HHT method, one of the joint time-frequency analysis methods. The field scattered from the blade edge of the propeller was calculated using equivalent current method(ECM). After the acquisition of the scattered field data in the time domain, the modified HHT method was applied to analyze the micro-Doppler signature. The analysis results showed not only a good agreement with the realistic dynamic characteristic of the blade but also sinusoidally varing characteristics of the micro-Doppler signatures generated from rotating objects. It could be concluded that the joint time-frequency analysis via the modified HHT provided the discriminative characteristics for recognizing a small aircraft target with small RCS value.

A Folksonomy Ranking Framework: A Semantic Graph-based Approach (폭소노미 사이트를 위한 랭킹 프레임워크 설계: 시맨틱 그래프기반 접근)

  • Park, Hyun-Jung;Rho, Sang-Kyu
    • Asia pacific journal of information systems
    • /
    • v.21 no.2
    • /
    • pp.89-116
    • /
    • 2011
  • In collaborative tagging systems such as Delicious.com and Flickr.com, users assign keywords or tags to their uploaded resources, such as bookmarks and pictures, for their future use or sharing purposes. The collection of resources and tags generated by a user is called a personomy, and the collection of all personomies constitutes the folksonomy. The most significant need of the folksonomy users Is to efficiently find useful resources or experts on specific topics. An excellent ranking algorithm would assign higher ranking to more useful resources or experts. What resources are considered useful In a folksonomic system? Does a standard superior to frequency or freshness exist? The resource recommended by more users with mere expertise should be worthy of attention. This ranking paradigm can be implemented through a graph-based ranking algorithm. Two well-known representatives of such a paradigm are Page Rank by Google and HITS(Hypertext Induced Topic Selection) by Kleinberg. Both Page Rank and HITS assign a higher evaluation score to pages linked to more higher-scored pages. HITS differs from PageRank in that it utilizes two kinds of scores: authority and hub scores. The ranking objects of these pages are limited to Web pages, whereas the ranking objects of a folksonomic system are somewhat heterogeneous(i.e., users, resources, and tags). Therefore, uniform application of the voting notion of PageRank and HITS based on the links to a folksonomy would be unreasonable, In a folksonomic system, each link corresponding to a property can have an opposite direction, depending on whether the property is an active or a passive voice. The current research stems from the Idea that a graph-based ranking algorithm could be applied to the folksonomic system using the concept of mutual Interactions between entitles, rather than the voting notion of PageRank or HITS. The concept of mutual interactions, proposed for ranking the Semantic Web resources, enables the calculation of importance scores of various resources unaffected by link directions. The weights of a property representing the mutual interaction between classes are assigned depending on the relative significance of the property to the resource importance of each class. This class-oriented approach is based on the fact that, in the Semantic Web, there are many heterogeneous classes; thus, applying a different appraisal standard for each class is more reasonable. This is similar to the evaluation method of humans, where different items are assigned specific weights, which are then summed up to determine the weighted average. We can check for missing properties more easily with this approach than with other predicate-oriented approaches. A user of a tagging system usually assigns more than one tags to the same resource, and there can be more than one tags with the same subjectivity and objectivity. In the case that many users assign similar tags to the same resource, grading the users differently depending on the assignment order becomes necessary. This idea comes from the studies in psychology wherein expertise involves the ability to select the most relevant information for achieving a goal. An expert should be someone who not only has a large collection of documents annotated with a particular tag, but also tends to add documents of high quality to his/her collections. Such documents are identified by the number, as well as the expertise, of users who have the same documents in their collections. In other words, there is a relationship of mutual reinforcement between the expertise of a user and the quality of a document. In addition, there is a need to rank entities related more closely to a certain entity. Considering the property of social media that ensures the popularity of a topic is temporary, recent data should have more weight than old data. We propose a comprehensive folksonomy ranking framework in which all these considerations are dealt with and that can be easily customized to each folksonomy site for ranking purposes. To examine the validity of our ranking algorithm and show the mechanism of adjusting property, time, and expertise weights, we first use a dataset designed for analyzing the effect of each ranking factor independently. We then show the ranking results of a real folksonomy site, with the ranking factors combined. Because the ground truth of a given dataset is not known when it comes to ranking, we inject simulated data whose ranking results can be predicted into the real dataset and compare the ranking results of our algorithm with that of a previous HITS-based algorithm. Our semantic ranking algorithm based on the concept of mutual interaction seems to be preferable to the HITS-based algorithm as a flexible folksonomy ranking framework. Some concrete points of difference are as follows. First, with the time concept applied to the property weights, our algorithm shows superior performance in lowering the scores of older data and raising the scores of newer data. Second, applying the time concept to the expertise weights, as well as to the property weights, our algorithm controls the conflicting influence of expertise weights and enhances overall consistency of time-valued ranking. The expertise weights of the previous study can act as an obstacle to the time-valued ranking because the number of followers increases as time goes on. Third, many new properties and classes can be included in our framework. The previous HITS-based algorithm, based on the voting notion, loses ground in the situation where the domain consists of more than two classes, or where other important properties, such as "sent through twitter" or "registered as a friend," are added to the domain. Forth, there is a big difference in the calculation time and memory use between the two kinds of algorithms. While the matrix multiplication of two matrices, has to be executed twice for the previous HITS-based algorithm, this is unnecessary with our algorithm. In our ranking framework, various folksonomy ranking policies can be expressed with the ranking factors combined and our approach can work, even if the folksonomy site is not implemented with Semantic Web languages. Above all, the time weight proposed in this paper will be applicable to various domains, including social media, where time value is considered important.

Handover Latency Improvement & Performance Analysis over Inter-LMA (Inter-LMA 이동시 Handover Latency 개선 방안 및 성능 분석)

  • Chang, Jae-Cheol;Park, Byung-Joo;Kim, Dae-Young
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.46 no.8
    • /
    • pp.34-42
    • /
    • 2009
  • Mobile communication traffic is changing from voice to data/internet, e.g. wireless internet access, SMS/MMS. more and more. Therefore many data services are coming out over 3G, Mobile WiMAX(WIBRO), LTE etc. Wireless internet market is growing and MIPv6 is more important and many protocols being studied and developed from MIPv6 to Fast MIPv6, Hierachical MIPv6, Proxy MIPv6, etc. The significant factor over MIPv6 is Hand-over latency and Packet-loss PMIPv6 is efficient for reducing mobility related messages and hand-over latency, but it considers single LMA domain. If mobile node is moving inter-LMAs, hand-over delay time affects the real-time communications. To overcome this hand-over delay, we propose present and new enhanced schemes and analize the performance and show the results.

Hydrologic variability in the Sumjin river dam basin according to typhoon genesis pattern (한반도 영향 태풍의 경로 유형에 따른 섬진강댐 유역의 수문변동 특성분석)

  • Kang, Ho-Yeong;Choi, Ji-Hyeok;Kim, Jong-Suk;Moon, Young-Il
    • Journal of Korea Water Resources Association
    • /
    • v.50 no.4
    • /
    • pp.233-239
    • /
    • 2017
  • In this study, we analyzed typhoon affecting Korean Peninsula and runoff characteristic changes according to the typhoon based on Sumjin river dam, a representative multi-purpose dam. We quantified typhoon flow by applying the typhoon domain, and will provide base data for climate change adaptation and counterstrategy through correlation analysis of the change of typhoon statistical data and Indicators of Hydrologic Alterations (IHA). Korean Peninsula impact typhoon has a great effect on the scale of peak flow and the change of occurrence time. The occurrence frequency and duration of the peak flow were analyzed to be relatively unrelated to the typhoon affected by the Korean peninsula. These changes were also confirmed in the correlation analysis results. Correlation coefficient between the peak flow (0.41) and peak flow occurrence time (correlation coefficient = 0.83) was positively correlated with the Korean peninsula influenced typhoon.

The Redundancy Reduction Using Fuzzy C-means Clustering and Cosine Similarity on a Very Large Gas Sensor Array for Mimicking Biological Olfaction (생물학적 후각 시스템을 모방한 대규모 가스 센서 어레이에서 코사인 유사도와 퍼지 클러스터링을 이용한 중복도 제거 방법)

  • Kim, Jeong-Do;Kim, Jung-Ju;Park, Sung-Dae;Byun, Hyung-Gi;Persaud, K.C.;Lim, Seung-Ju
    • Journal of Sensor Science and Technology
    • /
    • v.21 no.1
    • /
    • pp.59-67
    • /
    • 2012
  • It was reported that the latest sensor technology allow an 65536 conductive polymer sensor array to be made with broad but overlapping selectivity to different families of chemicals emulating the characteristics found in biological olfaction. However, the supernumerary redundancy always accompanies great error and risk as well as an inordinate amount of computation time and local minima in signal processing, e.g. neural networks. In this paper, we propose a new method to reduce the number of sensor for analysis by reducing redundancy between sensors and by removing unstable sensors using the cosine similarity method and to decide on representative sensor using FCM(Fuzzy C-Means) algorithm. The representative sensors can be just used in analyzing. And, we introduce DWT(Discrete Wavelet Transform) for data compression in the time domain as preprocessing. Throughout experimental trials, we have done a comparative analysis between gas sensor data with and without reduced redundancy. The possibility and superiority of the proposed methods are confirmed through experiments.

On Efficient Processing of Temporal Aggregates in Temporal Databases (시간지원데이타베이스에서의 효과적인 시간지원집계 처리 기법)

  • Gang, Seong-Tak;Kim, Jong-Su;Kim, Myeong-Ho
    • Journal of KIISE:Software and Applications
    • /
    • v.26 no.12
    • /
    • pp.1418-1427
    • /
    • 1999
  • 시간지원 데이타베이스 시스템은 자료의 과거 및 현재, 그리고 미래의 상태까지 관리함으로써, 사용자에게 시간에 따라 변화하는 자료에 대한 저장 및 질의 수단을 제공한다. 시간지원 데이타베이스는 경향 분석, 버전 관리, 의료 기록 관리 및 비디오 데이타 관리 등과 같이 자료의 시간적 특성이 중요시 되는 모든 분야에 폭 넓게 응용될 수 있다. 시간지원 데이타베이스에서의 집계는 시간 애트리뷰트를 고려하지 않은 기존의 집계와는 큰 차이가 있으며, 기존의 집계 처리 기법을 이용하여 효과적으로 처리될 수 없다. 본 논문에서는 시간지원 집계를 효율적으로 처리하기 위한 새로운 자료 구조인 PA-트리를 제안하고, 이를 이용한 시간지원 집계 처리 기법을 제안한다. 또한 본 논문에서는 제안된 PA-트리를 이용한 기법과 기존의 집계 트리를 이용한 기법의 성능을 최악 경우 분석과 실험을 통해 비교한다.Abstract Temporal databases manage time-evolving data. They provide built-in supports for efficient recording and querying of temporal data. Many application area such as trend analysis, version management, and medical record management have temporal aspects, and temporal databases can handle these temporal aspects efficiently. The aggregate in temporal databases, that is, temporal aggregate is an extension of conventional aggregate on the domain and range of aggregation to include time concept. The basic techniques behind computing aggregates in conventional databases are not efficient when applied to temporal databases. In this paper, we propose a new tree structure for temporal aggregation, called PA-tree, and aggregate processing method based on the PA-tree. We compare the PA-tree with the existing aggregation tree which has been proposed for temporal aggregate.