• Tribology and Lubricants
• /
• 제16권6호
• /
• pp.461-468
• /
• 2000

In this study, a neural network based diagnostic system of a rotating spindle system supported by ball bearings was introduced. In order to create actual failure situations, two exemplary abnormal status were made. Out of several possible data source locations, ten measurement spots were chosen. In order to discriminate multiple abnormal status, a neural network system was introduced using back propagation algorithm updating connecting weight between each nodes. In order to find the optimal structure of the neural network system reducing the information sources, magnitude of the weight of the network was referred. Hinton diagram was used to visually inspect the least sensitive weight connecting between input and hidden layers. Number of input node was reduced from 10 to 7 and prediction rate was increased to 100%.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 한국경영과학회/대한산업공학회 2003년도 춘계공동학술대회
• /
• pp.409-416
• /
• 2003

We consider the problem of grouping orders into lots. The problem is modelled by a graph G = (V, E). where each node $\nu\;\in\;V$ denotes order specification and its weight $\omega(\nu)$ the orders on hand for the specification. We ran construct a lot simply from orders or single specification For a set of nodes (specifications) $\theta\;\subseteq\;V$, if the distance or any two nodes in $\theta$ is at most d, it is also possible to make a lot using orders on the nodes. The objective is to maximize the number of lots with size exactly $\lambda$. In this paper, we prove that our problem is NP-Complete when d = 2, $\lambda\;=\;3$ and each weight is 0 or 1. Moreover, it is also shown to be NP-Complete when d = 1, $\lambda\;=\;3$ and each weight is 1, 2 or 3

• Journal of Korean Institute of Industrial Engineers
• /
• 제29권4호
• /
• pp.253-258
• /
• 2003

We consider the problem of grouping orders into lots. The problem is modelled by a graph G=(V,E), where each node ${\nu}{\in}V$ denotes order specification and its weight ${\omega}(\nu)$ the orders on hand for the specification. We can construct a lot simply from orders of single specification. For a set of nodes (specifications) ${\theta}{\subseteq}V$, if the distance of any two nodes in $\theta$ is at most d, it is also possible to make a lot using orders on the nodes. The objective is to maximize the number of lots with size exactly $\lambda$. In this paper, we prove that our problem is NP-Complete when $d=2,{\lambda}=3$ and each weight is 0 or 1. Moreover, it is also shown to be NP-Complete when $d=1,{\lambda}=3$ and each weight is 1,2 or 3.

• Journal of Sericultural and Entomological Science
• /
• 12호
• /
• pp.1-4
• /
• 1970

The experimental studies were intended to clarify the effects of leaf yield calculations, and also aimed at estimating the correlations between some characters for the selection of desirable stocks of mulberry trees. The analysis of covariances was the variance components procedures in a replicated trial for the varieties, and also it was used to obtain the genotypic, phenotypic and environmental correlations between the eight characters-branch length, node number, branch diameter, branch number per stock, total branch weight, old branch weight, new shoot and leaf weight, and leaf weight, etc. The results obtained are summarized as follows: Phenotypic, genotypic and environmental covariances are shown in Table 1 and phenotypic correlations, genotypic correlations and environmental correlations are shown in Table 2. Genotypic correlations were slightly higher than the corresponding phenotypic correlations between the characters in the varieties, but the variation in values due to the change of environment appeared between the characters. Genotypic correlations between the leaf yield of mulberry trees and other characters indicated that high leaf yield was genetically correlated with six characters namely branch length, node number, branch number per stock, total branch weight, old branch weight and new shoot weight, etc. It was also observed that lower correlations were appeared between the leaf yield and branch diameter, and branch diameter and other all characters studied in both genotypic and phenotypic correlation coefficients.

• The KIPS Transactions:PartB
• /
• 제11B권4호
• /
• pp.471-476
• /
• 2004

Recently, provides information which is most necessary to the user the research against the web information recommendation system for the Internet shopping mall is actively being advanced. the back which it will drive in the object. In that Dynamic Web Recommendation Method Using SOM (Self-Organizing Feature Maps) has the advantages of speedy execution and simplicity but has the weak points such as the lack of explanation on models and fired weight values for each node of the output layer on the established model. The method proposed in this study solves the lack of explanation using the Bayesian reasoning method. It does not give fixed weight values for each node of the output layer. Instead, the distribution includes weight using Hybrid SOM. This study designs and implements Dynamic Web Recommendation Method Using Hybrid SOM. The result of the existing Web Information recommendation methods has proved that this study's method is an excellent solution.

• Journal of Physiology & Pathology in Korean Medicine
• /
• 제23권5호
• /
• pp.993-1002
• /
• 2009

The object of this study was to evaluate the single dose toxicity of Taeumjowui-tang(TUJWT), a polyherbal formula have been traditionally used as prevention or treatment agent for obesity, in male and female mice. Aqueous extracts of TUJWT (Yield = 10.5%) was administered to female and male ICR mice as an oral dose of 2000, 1000 and 500 mg/kg (body wt.) according to the recommendation of KFDA Guidelines. Animals were monitored for the mortality and changes in body weight, clinical signs and gross observation during 14 days after dosing, upon necropsy, organ weight and histopathology of 12 principle organs were examined. As results, we could not find any mortality, clinical signs, and changes in the body and organ weight except for diarrhea restricted in TUJWT 2000 mg/kg treated one male mouse at 1 day after administration, and increases of popliteal lymph node weights in all TUJWT administered groups. In addition, no TUJWT-treatment related abnormal gross findings and changes in histopathology of principle organs were detected except for increases of the frequency of hypertrophy and hyperplasia of lymphoid cells in the popliteal lymph nodes in all TUJWT treatment groups with some sporadic accidental findings. These increases of popliteal lymph node weights with hypertrophy and hyperplasia of lymphoid cells were considered that related to the immune modulate effect of TUJWT not toxicological signs. The results obtained in this study suggest that the TUJWT does not cause any toxicological signs. The 50% lethal dose and approximate lethal dose of TUJWT aqueous extracts in both female and male mice were considered as over 2000 mg/kg.

• ETRI Journal
• /
• 제36권1호
• /
• pp.183-186
• /
• 2014

In this letter, we consider a cooperation system with multiple untrusted relays (URs). To keep the transmitted information confidential, we obtain joint channel characteristics (JCCs) through combining the channels from the source to the destination. Then, in the null space of the JCCs, jammers construct artificial noise to confuse URs when the source node broadcasts its data. Through a distributed implementation algorithm, the weight of each node can be obtained from its own channel state information. Simulation results show that high-level security of the system can be achieved when internal and external eavesdroppers coexist.

• Journal of information and communication convergence engineering
• /
• 제15권1호
• /
• pp.7-13
• /
• 2017

We consider a distributed estimation where many nodes remotely placed at known locations collect the measurements of the parameter of interest, quantize these measurements, and transmit the quantized data to a fusion node; this fusion node performs the parameter estimation. Noting that quantizers at nodes should operate in a non-regular framework where multiple codewords or quantization partitions can be mapped from a single measurement to improve the system performance, we propose a low-weight estimation algorithm that finds the most feasible combination of codewords. This combination is found by computing the weighted sum of the possible combinations whose weights are obtained by counting their occurrence in a learning process. Otherwise, tremendous complexity will be inevitable due to multiple codewords or partitions interpreted from non-regular quantized data. We conduct extensive experiments to demonstrate that the proposed algorithm provides a statistically significant performance gain with low complexity as compared to typical estimation techniques.

• Plant Resources
• /
• 제4권2호
• /
• pp.97-101
• /
• 2001

This study was carried out to determine the effect of sowing time on the flowering, growth and yield of Schizonepeta tenuifolia Briquet. Emergence and flowering dates in the sowing time from March 30 to April 30 were earlier than those of the other sowing times. In the sowing time from March 30 to April 30, length and diameter of main stem, number of node per main stem, number of branch per plant and fresh, and dry weight of stem were greater than those of the other sowing times. Yield components such as ear length, main stem length and diameter, branches per plant, number of node and ears per plant, yield of stem in fresh and dry were the highest at the sowing time from March 30 to April 30. Optimum sowing time of Schizonepeta tenuifolia Briquet were shown to be from March 30 to April 30 in southern areas of Korea.

• Journal of Korean Institute of Industrial Engineers
• /
• 제24권4호
• /
• pp.571-578
• /
• 1998

In this paper, we deal with a node weighted Steiner Ring Problem (SRP) arising from the deployment of Synchronous Optical Networks (SONET), a standard of transmission using optical fiber technology. The problem is to find a minimum weight cycle (ring) covering a subset of nodes in the network considering node and link weights. We have developed two mathematical models, one of which is stronger than the other in terms of LP bounds, whereas the number of constraints of the weaker one is polynomially bounded. In order to solve the problem optimally, we have developed some preprocessing rules and valid inequalities. We have also prescribed an effective heuristic procedure for providing tight upper bounds. Computational results show that the stronger model is better in terms of computation time, and valid inequalities and preprocessing rules are effective for solving the problem optimally.