• Nuclear Engineering and Technology
• /
• v.37 no.5
• /
• pp.491-502
• /
• 2005

Reliable human performance is a prerequisite in securing the safety of complicated process systems such as nuclear power plants. However, the amount of available knowledge that can explain why operators deviate from an expected performance level is so small because of the infrequency of real accidents. Therefore, in this study, a database that contains a set of useful information extracted from simulated emergencies was developed in order to provide important clues for understanding the change of operators' performance under stressful conditions (i.e., real accidents). The database was developed under Microsoft Windows TM environment using Microsoft Access $97^{TM}$ and Microsoft Visual Basic $6.0^{TM}$. In the database, operators' performance data obtained from the analysis of over 100 audio-visual records for simulated emergencies were stored using twenty kinds of distinctive data fields. A total of ten kinds of operators' performance data are available from the developed database. Although it is still difficult to predict operators' performance under stressful conditions based on the results of simulated emergencies, simulation studies remain the most feasible way to scrutinize performance. Accordingly, it is expected that the performance data of this study will provide a concrete foundation for understanding the change of operators' performance in emergency situations.

• Journal of Communications and Networks
• /
• v.13 no.1
• /
• pp.1-5
• /
• 2011

Feedback with carry shift registers (FCSRs) over 2-adic number would be suitable in hardware implementation, but the are not efficient in software implementation since their basic unit (the size of register clls) is 1-bit. In order to improve the efficiency we consider FCSRs over $2^{\ell}$-adic number (i.e., FCSRs with register cells of size ${\ell}$-bit) that produce ${\ell}$ bits at every clocking where ${\ell}$ will be taken as the size of normal words in modern CPUs (e.g., ${\ell}$ = 32). But, it is difficult to deal with the carry that happens when the size of summation results exceeds that of normal words. We may use long variables (declared with 'unsigned _int64' or 'unsigned long long') or conditional operators (such as 'if' statement) to handle the carry, but both the arithmetic operators over long variables and the conditional operators are not efficient comparing with simple arithmetic operators (such as shifts, maskings, xors, modular additions, etc.) over variables of size ${\ell}$-hit. In this paper, we propose some conditions for FCSRs over $2^{\ell}$-adic number which admit fast software implementations using only simple operators. Moreover, we give two implementation examples for the FCSRs. Our simulation result shows that the proposed methods are twice more efficient than usual methods using conditional operators.

• Journal of the Korean Mathematical Society
• /
• v.51 no.4
• /
• pp.773-789
• /
• 2014

We consider linear operators on square matrices over antinegative semirings. Let ${\varepsilon}_k$ denote the set of all primitive matrices of exponent k. We characterize those linear operators which preserve the set ${\varepsilon}_1$ and the set ${\varepsilon}_2$, and those that preserve the set ${\varepsilon}_{n^2-2n+2}$ and the set ${\varepsilon}_{n^2-2n+1}$. We also characterize those linear operators that strongly preserve ${\varepsilon}_2$, ${\varepsilon}_{n^2-2n+2}$ or ${\varepsilon}_{n^2-2n+1}$.

• The Pure and Applied Mathematics
• /
• v.22 no.3
• /
• pp.275-283
• /
• 2015

Let T be a bounded linear operator on a complex Hilbert space H. For a positive integer k, an operator T is said to be a k-quasi-2-isometric operator if T^∗k(T^∗2T² − 2T^∗T + I)T^k = 0, which is a generalization of 2-isometric operator. In this paper, we consider basic structural properties of k-quasi-2-isometric operators. Moreover, we give some examples of k-quasi-2-isometric operators. Finally, we prove that generalized Weyl’s theorem holds for polynomially k-quasi-2-isometric operators.

• Nonlinear Functional Analysis and Applications
• /
• v.26 no.3
• /
• pp.451-474
• /
• 2021

In this paper, we investigate a hybrid algorithm for finding zeros of the sum of maximal monotone operators and Lipschitz continuous monotone operators which is also a common fixed point problem for finite family of relatively quasi-nonexpansive mappings and split feasibility problem in uniformly convex real Banach spaces which are also uniformly smooth. The iterative algorithm employed in this paper is design in such a way that it does not require prior knowledge of operator norm. We prove a strong convergence result for approximating the solutions of the aforementioned problems and give applications of our main result to minimization problem and convexly constrained linear inverse problem.

• Honam Mathematical Journal
• /
• v.43 no.2
• /
• pp.167-181
• /
• 2021

In this paper, the Saigo's k-fractional integral and derivative operators involving k-hypergeometric function in the kernel are applied to the generalized k-Bessel function; results are expressed in term of k-Wright function, which are used to present image formulas of integral transforms including beta transform. Also special cases related to fractional calculus operators and Bessel functions are considered.

• 제어로봇시스템학회:학술대회논문집
• /
• 2005.06a
• /
• pp.1283-1286
• /
• 2005

Multimodal optimization is one of the most interesting topics in evolutionary computational discipline. Simple genetic algorithm, a basic and good-performance genetic algorithm, shows bad performance on multimodal problems, taking long generation time to obtain the optimum, converging on the local extrema in early generation. In this paper, we propose a new genetic algorithm with two new genetic mutational operators, i.e. global and local mutation operators, and no genetic crossover. The proposed algorithm is similar to Simple GA and the two genetic operators are as simple as the conventional mutation. They just mutate the genes from left or right end of a chromosome till the randomly selected gene is replaced. In fact, two operators are identical with each other except for the direction where they are applied. Their roles of shaking the population (global searching) and fine tuning (local searching) make the diversity of the individuals being maintained through the entire generation. The proposed algorithm is, therefore, robust and powerful.

• Journal of Integrative Natural Science
• /
• v.10 no.2
• /
• pp.115-118
• /
• 2017

We study a notion of $\mathcal{A}$-frequent hypercyclicity of linear maps between the Banach algebras consisting of operators on a separable infinite dimensional Banach space. We prove a sufficient condition for a linear map to satisfy the $\mathcal{A}$-frequent hypercyclicity in the strong operator topology.

• Journal of the Korean Mathematical Society
• /
• v.48 no.6
• /
• pp.1125-1142
• /
• 2011

In this paper, we define some new sequence spaces of infinite matrices regarded as operators on $l_2$ by using algebraic properties of such the matrices under the Schur product multiplication. Some of their basic properties as well as duality and preduality are discussed.

• Journal of the Korean Mathematical Society
• /
• v.34 no.2
• /
• pp.371-381
• /
• 1997

Our basic concern in this paper is to investigate some geometric properties of the graph of a maximal monotone operator in the one dimensional case. Using a well-known theorem of Minty, we answer S. Simon's questions affirmatively in the one dimensional case. Further developments of these results are also treated. In addition, we provide a new proof of Rockafellar's characterization of maximal monotone operators on R: every maximal monotne operator from R to $2^R$ is the subdifferential of a proper convex lower semicontinuous function.