• Title/Summary/Keyword: Weighted Majority

Search Result 35, Processing Time 0.023 seconds

Control of Weighted Mobility Ratio to Enhance the Performance of Bi-Te-based Thermoelectric Materials (Bi-Te계 열전소재 성능 증대를 위한 Weighted Mobility Ratio 제어)

  • Kim, Min Young;Kim, Hyun-Sik;Lee, Kyu Hyoung
    • Journal of the Microelectronics and Packaging Society
    • /
    • v.28 no.4
    • /
    • pp.103-107
    • /
    • 2021
  • Temperature dependences of electronic and thermal transport properties of narrow band gap thermoelectric materials are dependent on the transport behavior of minority carriers as well as majority carriers. Thus, weighted mobility ratio, which is defined the ratio of weighted mobility for majority carriers to that for minority carriers, must be one of the important parameters to enhance the performance of thermoelectric materials. Herein, we provided a practical guide for the development of high-performance Bi-Te-based thermoelectric materials based on the weighted mobility ratio control by considering theoretical backgrounds related to the electronic transport phenomena in semiconductors.

A New Incremental Learning Algorithm with Probabilistic Weights Using Extended Data Expression

  • Yang, Kwangmo;Kolesnikova, Anastasiya;Lee, Won Don
    • Journal of information and communication convergence engineering
    • /
    • v.11 no.4
    • /
    • pp.258-267
    • /
    • 2013
  • New incremental learning algorithm using extended data expression, based on probabilistic compounding, is presented in this paper. Incremental learning algorithm generates an ensemble of weak classifiers and compounds these classifiers to a strong classifier, using a weighted majority voting, to improve classification performance. We introduce new probabilistic weighted majority voting founded on extended data expression. In this case class distribution of the output is used to compound classifiers. UChoo, a decision tree classifier for extended data expression, is used as a base classifier, as it allows obtaining extended output expression that defines class distribution of the output. Extended data expression and UChoo classifier are powerful techniques in classification and rule refinement problem. In this paper extended data expression is applied to obtain probabilistic results with probabilistic majority voting. To show performance advantages, new algorithm is compared with Learn++, an incremental ensemble-based algorithm.

Automatic Segmentation of Femoral Cartilage in Knee MR Images using Multi-atlas-based Locally-weighted Voting (무릎 MR 영상에서 다중 아틀라스 기반 지역적 가중투표를 이용한 대퇴부 연골 자동 분할)

  • Kim, Hyeun A;Kim, Hyeonjin;Lee, Han Sang;Hong, Helen
    • Journal of KIISE
    • /
    • v.43 no.8
    • /
    • pp.869-877
    • /
    • 2016
  • In this paper, we propose an automated segmentation method of femoral cartilage in knee MR images using multi-atlas-based locally-weighted voting. The proposed method involves two steps. First, to utilize the shape information to show that the femoral cartilage is attached to a femur, the femur is segmented via volume and object-based locally-weighted voting and narrow-band region growing. Second, the object-based affine transformation of the femur is applied to the registration of femoral cartilage, and the femoral cartilage is segmented via multi-atlas shape-based locally-weighted voting. To evaluate the performance of the proposed method, we compared the segmentation results of majority voting method, intensity-based locally-weighted voting method, and the proposed method with manual segmentation results defined by expert. In our experimental results, the newly proposed method avoids a leakage into the neighboring regions having similar intensity of femoral cartilage, and shows improved segmentation accuracy.

Arab Spring Effects on Meanings for Islamist Web Terms and on Web Hyperlink Networks among Muslim-Majority Nations: A Naturalistic Field Experiment

  • Danowski, James A.;Park, Han Woo
    • Journal of Contemporary Eastern Asia
    • /
    • v.13 no.2
    • /
    • pp.15-39
    • /
    • 2014
  • This research conducted a before/after naturalistic field experiment, with the early Arab Spring as the treatment. Compared to before the early Arab Spring, after the observation period the associations became stronger among the Web terms: 'Jihad, Sharia, innovation, democracy and civil society.' The Western concept of civil society transformed into a central Islamist ideological component. At another level, the inter-nation network based on Jihad-weighted Web hyperlinks between pairs of 46 Muslim Majority (MM) nations found Iran in one of the top two positions of flow betweenness centrality, a measure of network power, both before and after early Arab Spring. In contrast, Somalia, UAE, Egypt, Libya, and Sudan increased most in network flow betweenness centrality. The MM 'Jihad'-centric word co-occurrence network more than tripled in size, and the semantic structure more became entropic. This media "cloud" perhaps billowed as Islamist groups changed their material-level relationships and the corresponding media representations of Jihad among them changed after early Arab Spring. Future research could investigate various rival explanations for this naturalistic field experiment's findings.

K-Nearest Neighbor Associative Memory with Reconfigurable Word-Parallel Architecture

  • An, Fengwei;Mihara, Keisuke;Yamasaki, Shogo;Chen, Lei;Mattausch, Hans Jurgen
    • JSTS:Journal of Semiconductor Technology and Science
    • /
    • v.16 no.4
    • /
    • pp.405-414
    • /
    • 2016
  • IC-implementations provide high performance for solving the high computational cost of pattern matching but have relative low flexibility for satisfying different applications. In this paper, we report an associative memory architecture for k nearest neighbor (KNN) search, which is one of the most basic algorithms in pattern matching. The designed architecture features reconfigurable vector-component parallelism enabled by programmable switching circuits between vector components, and a dedicated majority vote circuit. In addition, the main time-consuming part of KNN is solved by a clock mapping concept based weighted frequency dividers that drastically reduce the in principle exponential increase of the worst-case search-clock number with the bit width of vector components to only a linear increase. A test chip in 180 nm CMOS technology, which has 32 rows, 8 parallel 8-bit vector-components in each row, consumes altogether in peak 61.4 mW and only 11.9 mW for nearest squared Euclidean distance search (at 45.58 MHz and 1.8 V).

MRI-Based Stepwise Approach to Anterior Mediastinal Cystic Lesions for Diagnosis and Further Management

  • Jong Hee Kim;Jooae Choe;Hong Kwan Kim;Ho Yun Lee
    • Korean Journal of Radiology
    • /
    • v.24 no.1
    • /
    • pp.62-78
    • /
    • 2023
  • As the majority of incidentally detected lesions in the anterior mediastinum is small nodules with soft tissue appearance, the differential diagnosis has typically included thymic neoplasm and prevascular lymph node, with benign cyst. Overestimation or misinterpretation of these lesions can lead to unnecessary surgery for ultimately benign conditions. Diagnosing mediastinal cysts using MRI serves as a problem-solving modality in distinguishing between surgical and nonsurgical anterior mediastinal lesions. The pitfalls of MRI evaluation for anterior mediastinal cystic lesions are as follows: first, we acknowledge the limitation of T2-weighted images for evaluating benign cystic lesions. Due to variable contents within benign cystic lesions, such as hemorrhage, T2 signal intensity may be variable. Second, owing to extensive necrosis and cystic changes, the T2 shine-through effect may be seen on diffusion-weighted images (DWI), and small solid portions might be missed on enhanced images. Therefore, both enhancement and DWI with apparent diffusion coefficient values should be considered. An algorithm will be suggested for the diagnostic evaluation of anterior mediastinal cystic lesions, and finally, a management strategy based on MRI features will be suggested.

Localization Scheme with Weighted Multiple Rings in Wireless Sensor Networks (무선 센서 네트워크에서 가중 다중 링을 이용한 측위 기법)

  • Ahn, Hong-Beom;Hong, Jin-Pyo
    • Journal of KIISE:Information Networking
    • /
    • v.37 no.5
    • /
    • pp.409-414
    • /
    • 2010
  • The applications based on geographical location are increasing rapidly in wireless sensor networks (WSN). Recently, various localization algorithms have been proposed but the majority of algorithms rely on the specific hardware to measure the distance from the signal sources. In this paper, we propose the Weighted Multiple Rings Localization(WMRL). We assume that each deployed anchor node may periodically emit the successive beacon signals of the different power level. Then, the beacon signals form the concentric rings depending on their emitted power level, theoretically. The proposed algorithm defines the different weighting factor based on the ratio of each radius of ring. Also, If a sensor node may listen, it can find the innermost ring of the propagated signal for each anchor node. Based on this information, the location of a sensor node is derived by a weighted sum of coordinates of the surrounding anchor nodes. Our proposed algorithm is fully distributed and does not require any additional hardwares and the unreliable distance indications such as RSSI and LQI. Nevertheless, the simulation results show that the WMRL with two rings twice outperforms centroid algorithm. In the case of WMRL with three rings, the accuracy is approximately equal to WCL(Weighted Centroid Localization).

Weighted L1-Norm Support Vector Machine for the Classification of Highly Imbalanced Data (불균형 자료의 분류분석을 위한 가중 L1-norm SVM)

  • Kim, Eunkyung;Jhun, Myoungshic;Bang, Sungwan
    • The Korean Journal of Applied Statistics
    • /
    • v.28 no.1
    • /
    • pp.9-21
    • /
    • 2015
  • The support vector machine has been successfully applied to various classification areas due to its flexibility and a high level of classification accuracy. However, when analyzing imbalanced data with uneven class sizes, the classification accuracy of SVM may drop significantly in predicting minority class because the SVM classifiers are undesirably biased toward the majority class. The weighted $L_2$-norm SVM was developed for the analysis of imbalanced data; however, it cannot identify irrelevant input variables due to the characteristics of the ridge penalty. Therefore, we propose the weighted $L_1$-norm SVM, which uses lasso penalty to select important input variables and weights to differentiate the misclassification of data points between classes. We demonstrate the satisfactory performance of the proposed method through simulation studies and a real data analysis.

Uniqueness of an Optimal Run-up for a Steep Incline of a Train

  • Vu, Xuan
    • International Journal of Railway
    • /
    • v.2 no.2
    • /
    • pp.70-79
    • /
    • 2009
  • An optimal driving strategy of a train in a long journey on a nonsteep track has four phases: an initial power phase, a long hold speed phase, a coast phase and a final brake phase. The majority of the journey is speed holding. On a track with steep gradients, it becomes necessary to vary the strategy around steep sections of track because it is not possible to hold a constant steep on steep track. Instead we must interrupt the speed hold phase with a power phase. The aim of this paper is to show that there is a unique power phase that satisfies the necessary conditions for an optimal journey. The problem is developed and solved for various cases, from a simple single steep gradient to a complicated multiple steep gradient section. For each case, we construct a set of new conditions for optimality of the power phase that minimises the energy used during the power phase subject to a weighted time penalty. We then use the new necessary conditions to develop a calculate scheme for finding an optimal power phase for a steep incline. We also present an example to confirm the uniqueness of an optimal power phase.

  • PDF

Sequence driven features for prediction of subcellular localization of proteins

  • Kim, Jong-Kyoung;Bang, Sung-Yang;Choi, Seung-Jin
    • Proceedings of the Korean Society for Bioinformatics Conference
    • /
    • 2005.09a
    • /
    • pp.237-242
    • /
    • 2005
  • Predicting the cellular location of an unknown protein gives a valuable information for inferring the possible function of the protein. For more accurate prediction system, we need a good feature extraction method that transforms the raw sequence data into the numerical feature vector, minimizing information loss. In this paper, we propose new methods of extracting underlying features only from the sequence data by computing pairwise sequence alignment scores. In addition, we use composition based features to improve prediction accuracy. To construct an SVM ensemble from separately trained SVM classifiers, we propose specificity based weighted majority voting. The overall prediction accuracy evaluated by the 5-fold cross-validation reached 88.53% for the eukaryotic animal data set. By comparing the prediction accuracy of various feature extraction methods, we could get the biological insight on the location of targeting information. Our numerical experiments confirm that our new feature extraction methods are very useful for predicting subcellular localization of proteins.

  • PDF