• Title/Summary/Keyword: Fixed clustering

Search Result 87, Processing Time 0.023 seconds

Robust Most Significant Periods of Developments In Time Dominated Data

  • Aboukalam, F.
    • International Journal of Reliability and Applications
    • /
    • v.7 no.2
    • /
    • pp.101-110
    • /
    • 2006
  • Let E be a set of n quantitative observations under the time control. The interval of time is to be split into several subintervals such that the observations in each subinterval are almost similar, whereas the observations between the subintervals are very dissimilar. The corresponding time-subintervals become periods or phases of the development that exist in the underlying phenomenon. Aboukalam(2005) proposes a robust solution based on some initial subintervals and a technique for combining any two successive groups in that starter using a t-test under a fixed significant level ($\alpha$). The inconvenience is that; the technique reliability is not released from the level $\alpha$ which must not be defined apart from the number of the periods that is, in its turn, unknown. To avoid this, we propose what so called; most significant periods solution. The new technique constructs its own initial subintervals and uses another way for combining the groups. However, the way of determining and treating outliers has not changed. This paper conducts many empirical simulations using different possible time dominated data in order to illustrate the reliability of the proposed technique. Finally, we apply both techniques on some real time dominated data to explain the advantage of the proposal.

  • PDF

Extraction of Waterline Using Low Altitude Remote Sensing (저고도 원격탐사 영상 분석을 통한 수륙경계선 추출)

  • Jung, Dawoon;Lee, Jong-Seok;Baek, Ji-Yeon;Jo, Young-Heon
    • Korean Journal of Remote Sensing
    • /
    • v.36 no.2_2
    • /
    • pp.337-349
    • /
    • 2020
  • In this study, Helikite, Low Altitude Remote Sensing (LARS) platform, was used to acquire coastal images. In the obtained image, the land and water masses were divided using four types of region clustering algorithms, and then waterline was extracted using edge detection. Quantitative comparisons were not possible due to the lack of in-situ waterline data. But, based on the image of the infrared band where water masses and land are relatively clear, the waterlines extracted by each algorithm were compared. As a result, it was found that each algorithm differed significantly in the part where the distinction between water masses and land was ambiguous. This is considered to be a difference in the process of selecting the threshold value of the digital number that each algorithm uses to distinguish the regions. The extraction of waterlines through various algorithms is expected to be used in conjunction with a Low Altitude Remote Sensing system that can be continuously monitored in the future to explain the rapid changes in coastal shape through several years of long-term data from fixed areas.

Analysis on Scalability of Proactive Routing Protocols in Mobile Ad Hoc Networks (Ad Hoc 네트워크에서 테이블 기반 라우팅 프로토콜의 확장성 분석)

  • Yun, Seok-Yeol;Oh, Hoon
    • The KIPS Transactions:PartC
    • /
    • v.14C no.2
    • /
    • pp.147-154
    • /
    • 2007
  • Network topology in ad hoc networks keeps changing because of node mobility and no limitation in number of nodes. Therefore, the scalability of routing protocol is of great importance, However, table driven protocols such as DSDV have been known to be suitable for relatively small number of nodes and low node mobility, Various protocols like FSR, OLSR, and PCDV have been proposed to resolve scalability problem but vet remain to be proven for their comparative superiority for scalability, In this paper, we compare and amine them by employing various network deployment scenarios as follows: network dimension increase's while keeping node density constant node density increases while keeping network dimension fixed, and the number of sessions increase with the network dimension and the number of nodes fixed. the DSDV protocol showed a low scalability despite that it imposes a low overhead because its convergence speed against topology change is slow, The FSR's performance decreased according to the increase of overhead corresponding to increasing number of nodes, The OLSR with the shortest convergence time among them shows a good scalability, but turned out to be less scalable than the PCDV that uses a clustering because of its relatively high overhead.

LARGE SDSS QUASAR GROUPS AND THEIR STATISTICAL SIGNIFICANCE

  • Park, Changbom;Song, Hyunmi;Einasto, Maret;Lietzen, Heidi;Heinamaki, Pekka
    • Journal of The Korean Astronomical Society
    • /
    • v.48 no.1
    • /
    • pp.75-82
    • /
    • 2015
  • We use a volume-limited sample of quasars in the Sloan Digital Sky Survey (SDSS) DR7 quasar catalog to identify quasar groups and address their statistical significance. This quasar sample has a uniform selection function on the sky and nearly a maximum possible contiguous volume that can be drawn from the DR7 catalog. Quasar groups are identified by using the Friend-of-Friend algorithm with a set of fixed comoving linking lengths. We find that the richness distribution of the richest 100 quasar groups or the size distribution of the largest 100 groups are statistically equivalent with those of randomly-distributed points with the same number density and sky coverage when groups are identified with the linking length of $70h^{-1}Mpc$. It is shown that the large-scale structures like the huge Large Quasar Group (U1.27) reported by Clowes et al. (2013) can be found with high probability even if quasars have no physical clustering, and does not challenge the initially homogeneous cosmological models. Our results are statistically more reliable than those of Nadathur (2013), where the test was made only for the largest quasar group. It is shown that the linking length should be smaller than $50h^{-1}Mpc$ in order for the quasar groups identified in the DR7 catalog not to be dominated by associations of quasars grouped by chance. We present 20 richest quasar groups identified with the linking length of $70h^{-1}Mpc$ for further analyses.

Optimal Design of Long-fiber Composite Cover Plate with Ribs (리브를 가진 장섬유 복합재료 커버 플레이트의 최적설계)

  • Han, Min-Gu;Bae, Ji-Hun;Lee, Sung-Woo;Chang, Seung-Hwan
    • Composites Research
    • /
    • v.30 no.1
    • /
    • pp.65-70
    • /
    • 2017
  • Carbon fiber reinforced composites have light weight and high mechanical properties. These materials are only applicable in limited shape structure cause by complex curing process and low drapability. To solve this problem, Long Fiber Prepreg Sheet (LFPS) has been proposed. In this research, electric device cover plate was selected and designed by using LFPS. Before the design process, we analyzed the target structure to which the rib structures were applied. And 8-inch tablet PC product was selected. For FE analysis, simple loading and boundary conditions were applied. Stiffness of rib structure was investigated according to the rib pattern and shape changes. Rib pattern and shape were selected based on fixed volume condition analysis results. And uneven rib width model was selected for the best case whose deflection was reduced 6~10% than uniform rib model.

Improvement of Classification Rate of Handwritten Digits by Combining Multiple Dynamic Topology-Preserving Self-Organizing Maps (다중 동적 위상보존 자기구성 지도의 결합을 통한 필기숫자 데이타의 분류율 향상)

  • Kim, Hyun-Don;Cho, Sung-Bae
    • Journal of KIISE:Software and Applications
    • /
    • v.28 no.12
    • /
    • pp.875-884
    • /
    • 2001
  • Although the self organizing map (SOM) is widely utilized in such fields of data visualization and topology preserving mapping, since it should have the topology fixed before trained, it has some shortcomings that it is difficult to apply it to practical problems, and classification capability is quite low despite better clustering performance. To overcome these points this paper proposes the dynamic topology preserving self-organizing map(DTSOM) that dynamically splits the output nodes on the map and trains them, and attempts to improve the classification capability by combining multiple DTSOMs K-Winner method has been applied to combine DTSOMs which produces K outputs with winner node selection method. This produces even better performance than the conventional combining methods such as majority voting weighting, BKS Bayesian, Borda, Condorect and reliability sum. DTSOM remedies the shortcoming of determining the topology in advance, and the classification rate increases significantly by combing multiple maps trained with different features. Experimental results with handwritten digit recognition indicate that the proposed method works out to problems of conventional SOM effectively so to improve the classification rate to 98.1%.

  • PDF

Virtual Flight Test for Conceptual Lunar Lander Demonstrator (달 착륙선 개념설계형상 검증모델 가상비행시험)

  • Lee, Won-Beom;Rew, Dong-Young
    • Aerospace Engineering and Technology
    • /
    • v.12 no.1
    • /
    • pp.87-93
    • /
    • 2013
  • The conceptual design lunar lander demonstrator has been developed to use as a test bed for advanced spacecraft technologies and to test a prototype planetary lander capable of vertical takeoff and landing. Size of the lunar lander demonstrator is the same as that of lunar lander conceptually designed, however, the weight of lunar lander demonstrator is designed in 1/6 scale in consideration of gravity difference between moon and earth. The thruster clustering and virtual flight test were performed in the demonstrator fixed on the ground. The demonstrator ground test has been conducted for two months in the test site for the solid motor combustion of the Goheung Flight Center. The purposes of ground test of demonstrator are to demonstrate and verify essential electronics, propulsion system, control algorithm, embedded software, structure and system operation technologies before developing the flight model lander. This paper is described about the virtual flight test including test configuration, test aims and test facilities

An Efficient Cluster Management Scheme Using Wireless Power Transfer for Mobile Sink Based Solar-Powered Wireless Sensor Networks

  • Son, Youngjae;Kang, Minjae;Noh, Dong Kun
    • Journal of the Korea Society of Computer and Information
    • /
    • v.25 no.2
    • /
    • pp.105-111
    • /
    • 2020
  • In this paper, we propose a scheme that minimizes the energy imbalance problem of solar-powered wireless sensor network (SP-WSN) using both a mobile sink capable of wireless power transfer and an efficient clustering scheme (including cluster head election). The proposed scheme charges the cluster head using wireless power transfer from a mobile sink and mitigates the energy hotspot of the nodes nearby the head. SP-WSNs can continuously harvest energy, alleviating the energy constraints of battery-based WSN. However, if a fixed sink is used, the energy imbalance problem, which is energy consumption rate of nodes located near the sink is relatively increased, cannot be solved. Thus, recent research approaches the energy imbalance problem by using a mobile sink in SP-WSN. Meanwhile, with the development of wireless power transmission technology, a mobile sink may play a role of energy charging through wireless power transmission as well as data gathering in a WSN. Simulation results demonstrate that increase the amount of collected data by the sink using the proposed scheme.

Group-based speaker embeddings for text-independent speaker verification (문장 독립 화자 검증을 위한 그룹기반 화자 임베딩)

  • Jung, Youngmoon;Eom, Youngsik;Lee, Yeonghyeon;Kim, Hoirin
    • The Journal of the Acoustical Society of Korea
    • /
    • v.40 no.5
    • /
    • pp.496-502
    • /
    • 2021
  • Recently, deep speaker embedding approach has been widely used in text-independent speaker verification, which shows better performance than the traditional i-vector approach. In this work, to improve the deep speaker embedding approach, we propose a novel method called group-based speaker embedding which incorporates group information. We cluster all speakers of the training data into a predefined number of groups in an unsupervised manner, so that a fixed-length group embedding represents the corresponding group. A Group Decision Network (GDN) produces a group weight, and an aggregated group embedding is generated from the weighted sum of the group embeddings and the group weights. Finally, we generate a group-based embedding by adding the aggregated group embedding to the deep speaker embedding. In this way, a speaker embedding can reduce the search space of the speaker identity by incorporating group information, and thereby can flexibly represent a significant number of speakers. We conducted experiments using the VoxCeleb1 database to show that our proposed approach can improve the previous approaches.

Bankruptcy Type Prediction Using A Hybrid Artificial Neural Networks Model (하이브리드 인공신경망 모형을 이용한 부도 유형 예측)

  • Jo, Nam-ok;Kim, Hyun-jung;Shin, Kyung-shik
    • Journal of Intelligence and Information Systems
    • /
    • v.21 no.3
    • /
    • pp.79-99
    • /
    • 2015
  • The prediction of bankruptcy has been extensively studied in the accounting and finance field. It can have an important impact on lending decisions and the profitability of financial institutions in terms of risk management. Many researchers have focused on constructing a more robust bankruptcy prediction model. Early studies primarily used statistical techniques such as multiple discriminant analysis (MDA) and logit analysis for bankruptcy prediction. However, many studies have demonstrated that artificial intelligence (AI) approaches, such as artificial neural networks (ANN), decision trees, case-based reasoning (CBR), and support vector machine (SVM), have been outperforming statistical techniques since 1990s for business classification problems because statistical methods have some rigid assumptions in their application. In previous studies on corporate bankruptcy, many researchers have focused on developing a bankruptcy prediction model using financial ratios. However, there are few studies that suggest the specific types of bankruptcy. Previous bankruptcy prediction models have generally been interested in predicting whether or not firms will become bankrupt. Most of the studies on bankruptcy types have focused on reviewing the previous literature or performing a case study. Thus, this study develops a model using data mining techniques for predicting the specific types of bankruptcy as well as the occurrence of bankruptcy in Korean small- and medium-sized construction firms in terms of profitability, stability, and activity index. Thus, firms will be able to prevent it from occurring in advance. We propose a hybrid approach using two artificial neural networks (ANNs) for the prediction of bankruptcy types. The first is a back-propagation neural network (BPN) model using supervised learning for bankruptcy prediction and the second is a self-organizing map (SOM) model using unsupervised learning to classify bankruptcy data into several types. Based on the constructed model, we predict the bankruptcy of companies by applying the BPN model to a validation set that was not utilized in the development of the model. This allows for identifying the specific types of bankruptcy by using bankruptcy data predicted by the BPN model. We calculated the average of selected input variables through statistical test for each cluster to interpret characteristics of the derived clusters in the SOM model. Each cluster represents bankruptcy type classified through data of bankruptcy firms, and input variables indicate financial ratios in interpreting the meaning of each cluster. The experimental result shows that each of five bankruptcy types has different characteristics according to financial ratios. Type 1 (severe bankruptcy) has inferior financial statements except for EBITDA (earnings before interest, taxes, depreciation, and amortization) to sales based on the clustering results. Type 2 (lack of stability) has a low quick ratio, low stockholder's equity to total assets, and high total borrowings to total assets. Type 3 (lack of activity) has a slightly low total asset turnover and fixed asset turnover. Type 4 (lack of profitability) has low retained earnings to total assets and EBITDA to sales which represent the indices of profitability. Type 5 (recoverable bankruptcy) includes firms that have a relatively good financial condition as compared to other bankruptcy types even though they are bankrupt. Based on the findings, researchers and practitioners engaged in the credit evaluation field can obtain more useful information about the types of corporate bankruptcy. In this paper, we utilized the financial ratios of firms to classify bankruptcy types. It is important to select the input variables that correctly predict bankruptcy and meaningfully classify the type of bankruptcy. In a further study, we will include non-financial factors such as size, industry, and age of the firms. Thus, we can obtain realistic clustering results for bankruptcy types by combining qualitative factors and reflecting the domain knowledge of experts.