• Title/Summary/Keyword: Time-based Clustering

Search Result 716, Processing Time 0.026 seconds

Indexing and Retrieval Mechanism using Variation Patterns of Theme Melodies in Content-based Music Information Retrievals (내용 기반 음악 정보 검색에서 주제 선율의 변화 패턴을 이용한 색인 및 검색 기법)

  • 구경이;신창환;김유성
    • Journal of KIISE:Databases
    • /
    • v.30 no.5
    • /
    • pp.507-520
    • /
    • 2003
  • In this paper, an automatic construction method of theme melody index for large music database and an associative content-based music retrieval mechanism in which the constructed theme melody index is mainly used to improve the users' response time are proposed. First, the system automatically extracted the theme melody from a music file by the graphical clustering algorithm based on the similarities between motifs of the music. To place an extracted theme melody into the metric space of M-tree, we chose the average length variation and the average pitch variation of the theme melody as the major features. Moreover, we added the pitch signature and length signature which summarize the pitch variation pattern and the length variation pattern of a theme melody, respectively, to increase the precision of retrieval results. We also proposed the associative content-based music retrieval mechanism in which the k-nearest neighborhood searching and the range searching algorithms of M-tree are used to select the similar melodies to user's query melody from the theme melody index. To improve the users' satisfaction, the proposed retrieval mechanism includes ranking and user's relevance feedback functions. Also, we implemented the proposed mechanisms as the essential components of content-based music retrieval systems to verify the usefulness.

Cluster Cell Separation Algorithm for Automated Cell Tracking (자동 세포 추적을 위한 클러스터 세포 분리 알고리즘)

  • Cho, Mi Gyung;Shim, Jaesool
    • Transactions of the Korean Society of Mechanical Engineers B
    • /
    • v.37 no.3
    • /
    • pp.259-266
    • /
    • 2013
  • An automated cell tracking system is used to automatically analyze and track the changes in cell behavior in time-lapse cell images acquired using a microscope with a cell culture. Clustering is the partial overlapping of neighboring cells in the process of cell change. Separating clusters into individual cells is very important for cell tracking. In this study, we proposed an algorithm for separating clusters by using ellipse fitting based on a direct least square method. We extracted the contours of clusters, divided them into line segments, and then produced their fitted ellipses using a direct least square method for each line segment. All of the fitted ellipses could be used to separate their corresponding clusters. In experiments, our algorithm separated clusters with average precisions of 91% for two overlapping cells, 84% for three overlapping cells, and about 73% for four overlapping cells.

Acute Toxicity of Cadmium on Gene Expression Profiling of Fleshy Shrimp, Fenneropenaeus Chinensis Postlarvae Using a cDNA Microarray (Microarray 분석을 이용한 대하 (Fenneropenaeus chinensis) 유생의 카드뮴 단기 노출에 따른 유전자변화)

  • Kim, Su-Kyoung;Qiao, Guo;Yoon, Jong-Hwa;Jang, In-Kwon
    • Journal of Environmental Science International
    • /
    • v.24 no.5
    • /
    • pp.623-631
    • /
    • 2015
  • Microarray technology provides a unique tool for the determination of gene expression at the level of messenger RNA (mRNA). This study, the mRNA expression profiles provide insight into the mechanism of action of cadmium in Fleshy shrimp (Fenneropenaeus chinensis). The ability of genomic technologies was contributed decisively to development of new molecular biomarkers and to the determination of new possible gene targets. Also, it can be approach for monitoring of trace metal using oligo-chip microarray-based in potential model marine user level organisms. 15K oligo-chip for F. chinensis that include mostly unique sets of genes from cDNA sequences was developed. A total of 13,971 spots (1,181 mRNAs up- regulated and 996 down regulated) were identified to be significantly expressed on microarray by hierarchical clustering of genes after exposure to cadmium for different conditions (Cd24-5000 and Cd48-1000). Most of the changes of mRNA expression were observed at the long time and low concentration exposure of Cd48-1000. But, gene ontology analysis (GO annotation) were no significant different between experiments groups. It was observed that mRNA expression of main genes involved in metabolism, cell component, molecular binding and catalytic function. It was suggested that cadmium inhibited metabolism and growth of F. chinensis.

Data Aggregation and Transmission Mechanism for Energy Adaptive Node in Wireless Sensor Networks (무선 센서네트워크 환경에서 에너지를 고려한 노드 적응적 데이터 병합 및 전달 기법)

  • Cho, Young-Bok;You, Mi-Kyung;Lee, Sang-Ho
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.36 no.11A
    • /
    • pp.903-911
    • /
    • 2011
  • In this paper we proposed an energy adaptive data aggregation and transmission mechanism to solve the problem of energy limitation in wireless sensor networks (WSNs). Hierarchical structure methods are wildly used in WSNs to improve the energy efficiency. LEACH and TEEN protocols are the typical techniques. In these methods, all nodes, including nodes who have sensed data to transmit and nodes who haven't, are set frame timeslots in every round. MNs (member nodes) without sensed data keep active all the time, too. These strategies caused energy waste. Furthermore, if data collection in MNs is same to the previous transmission, it increases energy consumption. Most hierarchical structure protocols are developed based on LEACH. To solve the above problems, this paper proposed a method in which only MNs with sensed data can obtain allocated frame to transmit data. Moreover, if the MNs have same sensed data with previous, MNs turn to sleep mode. By this way redundant data transmission is avoided and aggregation in CH is lightened, too.

A Selection of the Point Rainfall Process Model Considered on Temporal Clustering Characteristics (시간적 군집특성을 고려한 강우모의모형의 선정)

  • Kim, Kee-Wook;Yoo, Chul-Sang
    • Journal of Korea Water Resources Association
    • /
    • v.41 no.7
    • /
    • pp.747-759
    • /
    • 2008
  • This study, a point rainfall process model, which could represent appropriately observed rainfall data, was to select. The point process models-rectangular pulses Poisson process model(RPPM), Neyman-Scott rectangular pulses Poisson process model(NS-RPPM), and modified Neyman-Scott rectangular pulses Poisson process model(modified NS-RPPM)-all based on Poisson process were considered as possible rainfall models, whose statistical analyses were performed with their simulation rainfall data. As results, simulated rainfall data using the NS-RPPM and the modified NS-RPPM represent appropriately statistics of observed data for several aggregation levels. Also, simulated rainfall data using the modified NS-RPPM shows similar characteristics of rainfall occurrence to the observed rainfall data. Especially, the modified NS-RPPM reproduces high-intensity rainfall events that contribute largely to occurrence of natural harzard such as flood and landslides most similarly. Also, the modified NS-RPPM shows the best results with respect to the total rainfall amount, duration, and inter-event time. In conclusions, the modified NS-RPPM was found to be the most appropriate model for the long-term simulation of rainfall.

Efficient Disk Access Method Using Region Storage Structure in Spatial Continuous Query Processing (공간 연속질의 처리에서 영역 기반의 저장 구조를 이용한 효율적인 디스크 접근 방법)

  • Chung, Weon-Il
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.12 no.5
    • /
    • pp.2383-2389
    • /
    • 2011
  • Ubiquitous applications require hybrid continuous query processing which processes both on-line data stream and spatial data in the disk. In the hybrid continuous spatial query processing, disk access costs for the high-volume spatial data should be minimized. However, previous indexing methods cannot reduce the disk seek time, because it is difficult that the data are stored in contiguity with others. Also, existing methods for the space-filling curve considering data cluster have the problem which does not cluster available data for queries. Therefore, we propose the region storage structure for efficient data access in hybrid continues spatial query processing. This paper shows that there is an obvious improvement of query processing costs through the contiguous data storing method and the group processing for user queries based on the region storage structure.

A Study on Economic Analysis Algorithm for Energy Storage System Considering Peak Reduction and a Special Tariff (피크저감과 특례요금제를 고려한 ESS 경제성 분석 알고리즘에 관한 연구)

  • Son, Joon-Ho
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.67 no.10
    • /
    • pp.1278-1285
    • /
    • 2018
  • For saving electricity bill, energy storage system(ESS) is being installed in factories, public building and commercial building with a Time-of-Use(TOU) tariff which consists of demand charge(KRW/kW) and energy charge(KRW/kWh). However, both of peak reduction and ESS special tariff are not considered in an analysis of initial cost payback period(ICPP) on ESS. Since it is difficult to reflect base rate by an amount of uncertain peak demand reduction during mid-peak and on-peak periods in the future days. Therefore, the ICPP on ESS can be increased. Based on this background, this paper presents the advanced analysis method for the ICPP on ESS. In the proposed algorithm, the representative days of monthly electricity consumption pattern for the amount of peak reduction can be found by the k­means clustering algorithm. Moreover, the total expected energy costs of representative days are minimized by optimal daily ESS operation considering both peak reduction and the special tariff through a mixed-integer linear programming(MILP). And then, the amount of peak reduction becomes a value that the sum of the expected energy costs for 12 months is maximum. The annual benefit cost is decided by the amount of annual peak reduction. Two simulation cases are considered in this study, which one only considers the special tariff and another considers both of the special tariff and amount of peak reduction. The ICPP in the proposed method is shortened by 18 months compared to the conventional method.

Content_based Load Balancing Technique In Web Server Cluster (웹 서버 클러스터에서 내용 기반으로한 부하 분산 기법)

  • Myung, Won-Shig;Jang, Tea-Mu
    • The KIPS Transactions:PartA
    • /
    • v.10A no.6
    • /
    • pp.729-736
    • /
    • 2003
  • With the rapid growth of the Internet, popular Web sites are visited so frequently that these cannot be constructed with a single server or mirror site of high performance. The rapid increase of Internet uses and uses raised the problems of overweighted transmission traffic and difficult load balancing. To solve these, various schemes of server clustering have been surveyed. Especially, in order to fully utilize the performance of computer systems in a cluster, a good scheduling method that distributes user requests evenly to servers in required. In this paper, we propose a new method for reducing the service latency. In our method, each Web server in the cluster has different content. This helps to reduce the complexity of load balancing algorithm and the service latency The Web server that received a request from the load balancer responds to the client directly without passing through the load balancer. Simulation studies show that our method performs better than other traditional methods. In terms of response time, our method shows shorter latency than RR (Round Robin) and LC (Least Connection) by about 16%, 14% respectively.

Analysis of Extension Pattern for Network of Movie Stars from Korea Movies 100 (한국영화 100선에 등장하는 영화배우 네트워크 확장 패턴 분석)

  • Ryu, Jea-Woon;Kim, Hak-Yong
    • The Journal of the Korea Contents Association
    • /
    • v.10 no.7
    • /
    • pp.420-428
    • /
    • 2010
  • The advancement of the Science for complex systems enables the analysis of many social networks. We constructed and analyzed a Korean movie star network as one of social networks, based on the 100 Korean movie selection for a main data source. Until now, the research trend has been the structural analysis of network, focused on link numbers, such as degree, betweenness and clustering coefficient. But it is time that the research is not limited by the structural analysis of networks only. Rather, the research goal should be aimed to an information analysis, performed by identifying and analyzing central modules that are regarded as the core of complex networks, using k-core analysis method. In this research, we constructed a network of movie stars who have appeared in 100 Korean movie selection, provided by Korean movie database, also we analyzed its core modules with and without weights, and the trend of seasonal expansion of the network. We expect our findings can be used as the basic data applicable to a model for understanding of the expansion and evolution of networks.

Energy conserving routing algorithm based on the direction for Mobile Ad-hoc network (모바일 에드 혹 네트워크에서 노드의 방향성을 고려한 에너지 효율적 라우팅 알고리즘 연구)

  • Oh, Young-Jun;Lee, Kong-Whan
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.17 no.11
    • /
    • pp.2699-2707
    • /
    • 2013
  • We proposed the context-awareness routing algorithm DDV (Dynamic Direction Vector)-hop algorithm at Mobile Ad-hoc Network(MANET). MANET has problem about dynamic topology, the lack of scalability of the network by mobile of node. By mobile of node, energy consumption rate is different. So it is important choosing routing algorithms for the minium of energy consumption rate. DDV-hop algorithms considers of the attribute of mobile node, create a cluster and maintain. And it provides a path by searching a route more energy efficient. We apply mobile of node by direction and time, the alogorighm of routning path and energy efficiency clustering is provided, it is shown the result of enery consumption that is optimized for the network.