• Smart Structures and Systems
• /
• v.24 no.4
• /
• pp.475-490
• /
• 2019

The detection of structural damage without a priori information on the healthy state is challenging. In order to address the issue, the study presents a baseline-free approach to detect damage in beam structures based on an actual influence line. In particular, a multi-segment function-fitting calculation is developed to extract the actual deflection influence line (DIL) of a damaged beam from bridge responses due to a passing vehicle. An intact basis function based on the measurement position is introduced. The damage index is defined as the difference between the actual DIL and a constructed function related to the intact basis, and the damage location is indicated based on the local peak value of the damage index curve. The damage basis function is formulated by using the detected damage location. Based on the intact and damage basis functions, damage severity is quantified by fitting the actual DIL using the least-square calculation. Both numerical and experimental examples are provided to investigate the feasibility of the proposed method. The results indicate that the present baseline-free approach is effective in detecting the damage of beam structures.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.15 no.8
• /
• pp.2923-2943
• /
• 2021

The double helix structure of DNA makes it diverse, stable and can store information with high density, and these characteristics are consistent with the requirements of molecular communication for transport carriers. In this paper, a specific structure of molecular communication system based on DNA length coding is proposed. Transmitter (Tx) adopts the multi-layer golden foil design to control the release of DNA molecules of different lengths accurately, and receiver (Rx) adopts an effective and sensitive design of nanopore, and the biological information can be converted to the electric signal at Rx. The effect of some key factors, e.g., the length of time slot, transmission distance, the number of releasing molecules, the priori probability, on channel capacity is demonstrated exhaustively. Moreover, we also compare the transmission capacity of DNA-based molecular communication (DNA-MC) system and concentration-based molecular communication (MC) system under the same parameter setting, and the peak value of capacity of DNA-MC system can achieve 0.08 bps, while the capacity of MC system remains 0.025 bps. The simulation results show that DNA-MC system has obvious advantages over MC system in saving molecular resources and improving transmission stability.

• ETRI Journal
• /
• v.41 no.2
• /
• pp.176-183
• /
• 2019

Spectrum sensing plays an important role in spectrum sharing. Energy detection is generally used because it does not require a priori knowledge of primary user (PU) signals; however, it is sensitive to noise uncertainty. An order statistics (OS) detector provides inherent protection against nonhomogeneous background signals. However, no analysis has been conducted yet to apply OS detection to spectrum sensing in a wireless channel to solve noise uncertainty. In this paper, we propose a robust spectrum sensing scheme based on generalized order statistics (GOS) and analyze the exact false alarm and detection probabilities under noise uncertainty. From the equation of the exact false alarm probability, the threshold value is calculated to maintain a constant false alarm rate. The detection probability is obtained from the calculated threshold under noise uncertainty. As a fusion rule for cooperative spectrum sensing, we adopt an OR rule, that is, a 1-out-of-N rule, and we call the proposed scheme GOS-OR. The analytical results show that the GOS-OR scheme can achieve optimum performance and maintain the desired false alarm rates if the coefficients of the GOS-OR detector can be correctly selected.

• Journal of applied mathematics & informatics
• /
• v.39 no.3_4
• /
• pp.419-435
• /
• 2021

This paper deals with numerical treatment of singularly perturbed differential equations involving small delays. The highest order derivative in the equation is multiplied by a perturbation parameter 𝜀 taking arbitrary values in the interval (0, 1]. For small 𝜀, the problem involves a boundary layer of width O(𝜀), where the solution changes by a finite value, while its derivative grows unboundedly as 𝜀 tends to zero. The considered problem contains delay on the convection and reaction terms. The terms with the delays are approximated using Taylor series approximations resulting to asymptotically equivalent singularly perturbed BVPs. Inducing exponential fitting factor for the term containing the singular perturbation parameter and using central finite difference for the derivative terms, numerical scheme is developed. The stability and uniform convergence of difference schemes are studied. Using a priori estimates we show the convergence of the scheme in maximum norm. The scheme converges with second order of convergence for the case 𝜀 = O(N^-1) and for the case 𝜀 ≪ N^-1, the scheme converge uniformly with first order of convergence, where N is number of mesh intervals in the domain discretization. We compare the accuracy of the developed scheme with the results in the literature. It is found that the proposed scheme gives accurate result than the one in the literatures.

• Journal of Intelligence and Information Systems
• /
• v.9 no.1
• /
• pp.71-89
• /
• 2003

Although many studies demonstrate that one technique outperforms the others for a given data set, there is often no way to tell a priori which of these techniques will be most effective in the classification problems. Alternatively, it has been suggested that a better approach to classification problem might be to integrate several different forecasting techniques. This study proposes the linearly combining methodology of different classification techniques. The methodology is developed to find the optimal combining weight and compute the weighted-average of different techniques' outputs. The proposed methodology is represented as the form of mixed integer programming. The objective function of proposed combining methodology is to minimize total misclassification cost which is the weighted-sum of two types of misclassification. To simplify the problem solving process, cutoff value is fixed and threshold function is removed. The form of mixed integer programming is solved with the branch and bound methods. The result showed that proposed methodology classified more accurately than any of techniques individually did. It is confirmed that Proposed methodology Predicts significantly better than individual techniques and the other combining methods.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.16 no.10
• /
• pp.7118-7125
• /
• 2015

This study examined one of the concerned or even imperative issues in the field of contemporary finance related to approaching an optimal level of cash holdings for the firms belonging to the chaebols in the Korean domestic capital markets. However, the subject may not have been drawn much attention so far, even if there are still ongoing and active debates among the interest parties at the macro- or micro-level. Two primary hypotheses were postulated to be empirically tested. On the results of the first hypothesis test for the existence of an optimal cash reserves for the sample firms, two estimation techniques were performed in terms of a quadratic regression equation and a relationship between a firm's value and the residuals derived from the static panel date model. As a primary financial implication of the study which may contribute to the practitioners and the academics in finance, the optimal level of cash holdings can be estimated by controlling for the a priori significant components for the sample firms towards maximizing firm value.

• Asian-Australasian Journal of Animal Sciences
• /
• v.33 no.10
• /
• pp.1558-1565
• /
• 2020

Objective: The objective of this study was to characterize the number of loci affecting growth traits and the distribution of single nucleotide polymorphism (SNP) effects on growth traits, and to understand the genetic architecture for growth traits in Hanwoo (Korean cattle) using genome-wide association study (GWAS), genomic partitioning, and hierarchical Bayesian mixture models. Methods: GWAS: A single-marker regression-based mixed model was used to test the association between SNPs and causal variants. A genotype relationship matrix was fitted as a random effect in this linear mixed model to correct the genetic structure of a sire family. Genomic restricted maximum likelihood and BayesR: A priori information included setting the fixed additive genetic variance to a pre-specified value; the first mixture component was set to zero, the second to 0.0001×σ²_g, the third 0.001×σ²_g, and the fourth to 0.01×σ²_g. BayesR fixed a priori information was not more than 1% of the genetic variance for each of the SNPs affecting the mixed distribution. Results: The GWAS revealed common genomic regions of 2 Mb on bovine chromosome 14 (BTA14) and 3 had a moderate effect that may contain causal variants for body weight at 6, 12, 18, and 24 months. This genomic region explained approximately 10% of the variance against total additive genetic variance and body weight heritability at 12, 18, and 24 months. BayesR identified the exact genomic region containing causal SNPs on BTA14, 3, and 22. However, the genetic variance explained by each chromosome or SNP was estimated to be very small compared to the total additive genetic variance. Causal SNPs for growth trait on BTA14 explained only 0.04% to 0.5% of the genetic variance Conclusion: Segregating mutations have a moderate effect on BTA14, 3, and 19; many other loci with small effects on growth traits at different ages were also identified.

• Journal of Korean Philosophical Society
• /
• v.129
• /
• pp.141-166
• /
• 2014

Xìng $sh{\grave{a}}n$(性善) theory of Mencius combined xìng(性) that means physical characteristic of human together $sh{\grave{a}}n$(善) that means moral value or moral behavior. Therefore in other to verify the meaning of xìng $sh{\grave{a}}n$(性善) we need to analysis human nature in Psychology and moral norm in Ethics simultaneously. And that necessity justified Moral Psychological approach to xìng $sh{\grave{a}}n$(性善). Mencius combined a priori morality and a priori moral norm and asserted xìng $sh{\grave{a}}n$(性善). And than he presented an example for a basis or a clue of mora norm and explained grounds of moral behavior. But various theory Moral Psychology considered morality as an attachment or derivation of human nature. So another new Moral Psychology is needed to investigate Mencius Xìng $sh{\grave{a}}n$(性善) theory in a viewpoint of Moral Psychology. And than that must managed morality and moral norm as essential problems firstly. That because Mencius considered human as a moral subjectivity and seek the clue or basis morality and moral norm in human nature. And secondly that must managed moral intelligence as a emotional intelligence, because of $li{\acute{a}}ng$ $n{\acute{e}}ng$(良能) $li{\acute{a}}ng$ zhī(良知) of Mencius meaned moral intelligence which was derived from blood tied and moral emotion.

• Asia pacific journal of information systems
• /
• v.19 no.3
• /
• pp.51-67
• /
• 2009

Developing an agile recommender system for nomadic users has been regarded as a promising application in mobile and ubiquitous settings. To increase the quality of personalized recommendation in terms of accuracy and elapsed time, estimating future context of the user in a correct way is highly crucial. Traditionally, time series analysis and Makovian process have been adopted for such forecasting. However, these methods are not adequate in predicting context data, only because most of context data are represented as nominal scale. To resolve these limitations, the alignment-prediction algorithm has been suggested for context prediction, especially for future context from the low-level context. Recently, an ontological approach has been proposed for guided context prediction without context history. However, due to variety of context information, acquiring sufficient context prediction knowledge a priori is not easy in most of service domains. Hence, the purpose of this paper is to propose a novel context prediction methodology, which does not require a priori knowledge, and to increase accuracy and decrease elapsed time for service response. To do so, we have newly developed pattern-based context prediction approach. First of ail, a set of individual rules is derived from each context attribute using context history. Then a pattern consisted of results from reasoning individual rules, is developed for pattern learning. If at least one context property matches, say R, then regard the pattern as right. If the pattern is new, add right pattern, set the value of mismatched properties = 0, freq = 1 and w(R, 1). Otherwise, increase the frequency of the matched right pattern by 1 and then set w(R,freq). After finishing training, if the frequency is greater than a threshold value, then save the right pattern in knowledge base. On the other hand, if at least one context property matches, say W, then regard the pattern as wrong. If the pattern is new, modify the result into wrong answer, add right pattern, and set frequency to 1 and w(W, 1). Or, increase the matched wrong pattern's frequency by 1 and then set w(W, freq). After finishing training, if the frequency value is greater than a threshold level, then save the wrong pattern on the knowledge basis. Then, context prediction is performed with combinatorial rules as follows: first, identify current context. Second, find matched patterns from right patterns. If there is no pattern matched, then find a matching pattern from wrong patterns. If a matching pattern is not found, then choose one context property whose predictability is higher than that of any other properties. To show the feasibility of the methodology proposed in this paper, we collected actual context history from the travelers who had visited the largest amusement park in Korea. As a result, 400 context records were collected in 2009. Then we randomly selected 70% of the records as training data. The rest were selected as testing data. To examine the performance of the methodology, prediction accuracy and elapsed time were chosen as measures. We compared the performance with case-based reasoning and voting methods. Through a simulation test, we conclude that our methodology is clearly better than CBR and voting methods in terms of accuracy and elapsed time. This shows that the methodology is relatively valid and scalable. As a second round of the experiment, we compared a full model to a partial model. A full model indicates that right and wrong patterns are used for reasoning the future context. On the other hand, a partial model means that the reasoning is performed only with right patterns, which is generally adopted in the legacy alignment-prediction method. It turned out that a full model is better than a partial model in terms of the accuracy while partial model is better when considering elapsed time. As a last experiment, we took into our consideration potential privacy problems that might arise among the users. To mediate such concern, we excluded such context properties as date of tour and user profiles such as gender and age. The outcome shows that preserving privacy is endurable. Contributions of this paper are as follows: First, academically, we have improved sequential matching methods to predict accuracy and service time by considering individual rules of each context property and learning from wrong patterns. Second, the proposed method is found to be quite effective for privacy preserving applications, which are frequently required by B2C context-aware services; the privacy preserving system applying the proposed method successfully can also decrease elapsed time. Hence, the method is very practical in establishing privacy preserving context-aware services. Our future research issues taking into account some limitations in this paper can be summarized as follows. First, user acceptance or usability will be tested with actual users in order to prove the value of the prototype system. Second, we will apply the proposed method to more general application domains as this paper focused on tourism in amusement park.

• Proceedings of the Korean Society of Near Infrared Spectroscopy Conference
• /
• 2001.06a
• /
• pp.1131-1131
• /
• 2001

To develop a nondestructive quality evaluation technique of fruits, a K-mean algorism is applied to near infrared (NIR) spectroscopy of apples. The K-mean algorism is one of neural network partition methods and the goal is to partition the set of objects O into K disjoint clusters, where K is assumed to be known a priori. The algorism introduced by Macqueen draws an initial partition of the objects at random. It then computes the cluster centroids, assigns objects to the closest of them and iterates until a local minimum is obtained. The advantage of using neural network is that the spectra at the wavelengths having absorptions against chemical bonds including C-H and O-H types can be selected directly as input data. In conventional multiple regression approaches, the first wavelength is selected manually around the absorbance wavelengths as showing a high correlation coefficient between the NIR $2^{nd}$ derivative spectrum and Brix value with a single regression. After that, the second and following wavelengths are selected statistically as the calibration equation shows a high correlation. Therefore, the second and following wavelengths are selected not in a NIR spectroscopic way but in a statistical way. In this research, the spectra at the six wavelengths including 900, 904, 914, 990, 1000 and 1016nm are selected as input data for K-mean analysis. 904nm is selected because the wavelength shows the highest correlation coefficients and is regarded as the absorbance wavelength. The others are selected because they show relatively high correlation coefficients and are revealed as the absorbance wavelengths against the chemical structures by B. G. Osborne. The experiment was performed with two phases. In first phase, a reflectance was acquired using fiber optics. The reflectance was calculated by comparing near infrared energy reflected from a Teflon sphere as a standard reference, and the $2^{nd}$ derivative spectra were used for K-mean analysis. Samples are intact 67 apples which are called Fuji and cultivated in Aomori prefecture in Japan. In second phase, the Brix values were measured with a commercially available refractometer in order to estimate the result of K-mean approach. The result shows a partition of the spectral data sets of 67 samples into eight clusters, and the apples are classified into samples having high Brix value and low Brix value. Consequently, the K-mean analysis realized the classification of apples on the basis of the Brix values.