• Journal of Information Processing Systems
• /
• v.17 no.1
• /
• pp.136-150
• /
• 2021

The modern market is highly competitive. It has progressed from traditional competition between enterprises to competition between supply chains. To ensure that enterprise can form the best strategy consistently, it is necessary to evaluate the trust of other enterprises in the supply chain. First, this paper analyzes the background and significance of supply chain trust research, analyzes and expounds on the qualitative and quantitative methods of supply chain trust evaluation, and summarizes the research in this field. Analytic hierarchy process (AHP) is the most frequently used method in the literature to evaluate and rank criteria through data analysis. However, the input data for AHP analysis is based on human judgment, and hence there is every possibility that the data may be vague to some extent. Therefore, in view of the above problems, this study improves the global trust method based on chain iteration. The improved global trust evaluation method based on chain iteration is more flexible and practical, hence, it can more accurately evaluate supply chain trust. Finally, combined with an actual case of Zhaoxian Chengji Food Co. Ltd., the paper qualitatively analyzes the current situation of supply chain trust management and effectively strengthens the supervision of enterprises to cooperative enterprises. Thus, the company can identify problems on time and strategic adjustments can be implemented accordingly. The effectiveness of the evaluation method proposed in this paper is demonstrated through a quantitative evaluation of its trust in downstream enterprise A. Results suggest that the subjective preferences of and historical transactions together affect the final evaluation of trust.

• Communications for Statistical Applications and Methods
• /
• v.21 no.6
• /
• pp.513-520
• /
• 2014

We study numerical methods to obtain the stationary probabilities of continuous-time Markov chains whose embedded chains are periodic. The power method is applied to the balance equations of the periodic embedded Markov chains. The power method can have the convergence speed of exponential rate that is ambiguous in its application to original continuous-time Markov chains since the embedded chains are discrete-time processes. An illustrative example is presented to investigate the numerical iteration of this paper. A numerical study shows that a rapid and stable solution for stationary probabilities can be achieved regardless of periodicity and initial conditions.

• Proceedings of the KIEE Conference
• /
• 2005.11b
• /
• pp.230-233
• /
• 2005

This paper proposes power qualify assessment using Markov Chain applied to Ergodic theorem. The Ergodic theorem introduces the state of aperiodic, recurrent, and non-null. The proposed method using Markov Chain presents very well generated harmonic characteristics according to the traction's operation of electric railway system. In case of infinite iteration, the characteristic of Markov Chain that converges on limiting probability Is able to expected harmonic currents posterior transient state. TDD(Total Demand Distortion) is also analyzed in expected current of each harmonic. The TDD for power quality assesment is calculated using Markov Chain theory in the Inceon international airport IAT power system.

• Journal of Applied and Pure Mathematics
• /
• v.5 no.5_6
• /
• pp.303-313
• /
• 2023

Generalized strictly diagonally dominant matrices have a wide range of applications in matrix theory and practical applications, so it is of great theoretical and practical value to study their numerical determination methods. In this paper, we study the numerical determination of generalized strictly diagonally dominant matrices by using the properties of generalized strictly diagonally dominant matrices. We obtain a new criterion for subdivision iteration determination of the generalized strictly diagonally dominant matrices by subdividing the set of non-prevailing row indices and constructing new iteration factors for the set of predominant row indices, new elements of the positive diagonal factors are derived. Advantages are illustrated by numerical examples.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.17 no.4
• /
• pp.336-345
• /
• 1992

In this paper, the performance evaluation on the throughput and the delay between station under the interconnected LANs environments is studied. The connection is formed through bridges. Interconnected system is modelled as single-chain and multiple-chain closed queueing networks. For performance enaluation the iteration algorithm, which is based on the MVA(Mean Value Analysis)is proposed, Various system parameters, such as chain population interconnected communication link capacity, and service times of several queues, are used for the investigation of their influence of the station to station performance, Transport and MAC layers are mainly taken into consideration for the layer modeling. The analysis is shown as a graph by computer programming.

• Proceedings of the Korean Society for Technology of Plasticity Conference
• /
• 2007.05a
• /
• pp.272-275
• /
• 2007

This paper is concerned with modified integration algorithm on the strain-space for rate and temperature dependent elasto-plastic constitutive relations in order to obtain more accurate results in numerical implementation. The proposed algorithm is integrated analytically using integration by part and chain rule and then is applied to the 2-stage Lobatto IIIA with second-order accuracy. It has advantage that is able to consider the convective stress rates on the yield surface of the strain-space. Also this paper is carried out the iteration procedure using the Newton-Raphson method to enforce consistency at the end of the step. And the performance of the proposed algorithm for rate and temperature dependent constitutive relation is illustrated by means of analysis of adiabatic shear bands.

• Food Science and Preservation
• /
• v.15 no.5
• /
• pp.617-621
• /
• 2008

Sequential passes through $Sephadex^{TM}$ columns were used to select phages that displays ligands for dextran ($\alpha$-1,6 linked linear chains) from a phage antibody library. Those phages that bound to the $Sephadex^{TM}$ in each iteration were replicated in E. coli. A phage preparation isolated on the third round selection produced 5.4 nephelos turbidity units (NTU) in a dextran specific immunonephelometric assay, a 2.2 fold higher value than the phage preparation from the first round selection. This phage gave $72\;{\pm}\;10$ normalized intensity (N.I.) in a dip-stick assay against high molecular size dextran (T2000, $2\;{\times}\;10^6) and significantly lower color ($30\;{\pm}\;6$ N.I.) against low molecular size dextran (T10, $10^4$). The presence of an Fab insert in each of these phages was confirmed using a $\beta-galactosidase linked assay and polymerase chain reaction.

• Journal of the Korea Society for Simulation
• /
• v.26 no.2
• /
• pp.31-39
• /
• 2017

This paper analyses the effectiveness of Kill Chain (KC) and Korea Air and Missile Defense (KAMD), also known as the K2 systems, using monte carlo simulation. It is assumed that the K2 systems are consisted with unitary KC and multi-layered (upper-tier and lower-tier) KAMD. And each system has two or three arbitrary weapon systems and its combination makes 12 scenarios. Measures of effectiveness (MOE) of the K2 systems were defined as ratio of eliminated ballistic missiles from total threats. And total cost was calculated by number of weapon launched and its unit cost. MOE and total cost of the K2 systems were estimated using monte carlo simulation with a thousand iteration for each scenario. Cost-effectiveness analysis was performed and the best candidate was selected using fixed effectiveness approach. As a result, the performances of KC are prime factor that affects both effectiveness and total cost of the K2 systems. It is also, acquired proper level of lower-tier KAMD to achieve desired defense effectiveness. For future work, it needs to be performed cost-effectiveness analysis based on practical specification and life cycle cost of weapon systems.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.11 no.3
• /
• pp.179-196
• /
• 1986

In this paper, the peformance of a statistical packet voice/data multiplexer is studied. In ths study we assume that in the packet voice/data multiplexer two separate finite queues are used for voice and data traffics, and that voice traffic gets priority over data. For the performance analysis we divide the output link of the multiplexer into a sequence of time slots. The voice signal is modeled as an (M+1) - state Markov process, M being the packet generation period in slots. As for the data traffic, it is modeled by a simple Poisson process. In our discrete time domain analysis, the queueing behavior of voice traffic is little affected by the data traffic since voice signal has priority over data. Therefore, we first analyze the queueing behavior of voice traffic, and then using the result, we study the queueing behavior of data traffic. For the packet voice multiplexer, both inpur state and voice buffer occupancy are formulated by a two-dimensional Markov chain. For the integrated voice/data multiplexer we use a three-dimensional Markov chain that represents the input voice state and the buffer occupancies of voice and data. With these models, the numerical results for the performance have been obtained by the Gauss-Seidel iteration method. The analytical results have been verified by computer simylation. From the results we have found that there exist tradeoffs among the number of voice users, output link capacity, voic queue size and overflow probability for the voice traffic, and also exist tradeoffs among traffic load, data queue size and oveflow probability for the data traffic. Also, there exists a tradeoff between the performance of voice and data traffics for given inpur traffics and link capacity. In addition, it has been found that the average queueing delay of data traffic is longer than the maximum buffer size, when the gain of time assignment speech interpolation(TASI) is more than two and the number of voice users is small.

• Journal of the Korean Society for Marine Environment & Energy
• /
• v.7 no.4
• /
• pp.185-191
• /
• 2004

A mooring system can be applied to keep the position of a floating structures. In this study, the structural analysis is carried out to analyze the dynamic characteristics of a mooring line for a floating breakwater. A three-dimensional equations of motion for a submerged chain are derived. Bending stiffness is considered for the necessary restoring force in the regions of zero tension. A fortran program is to be developed by employing finite difference method. In the algorithm, an implicit time integration and Newton-Raphson iteration are adopted. The results of simulation show good agreement in tension response pattern with the experimental results of a reference. The results of this study can contribute for the design of mooring system for a floating breakwater.