• Communications of the Korean Mathematical Society
• /
• v.19 no.4
• /
• pp.619-637
• /
• 2004

In this paper, a left module over an associative ring with identity is defined to be openly semiprimitive (strongly semiprimitive, respectively) by the zero intersection of all maximal open fully invariant submodules (all maximal open submodules which are fully invariant, respectively) of it. For any projective module, the openly semiprimitivity of the projective module is an equivalent condition of the semiprimitivity of endomorphism ring of the projective module and the strongly semiprimitivity of the projective module is an equivalent condition of the endomorphism ring of the projective module being a sub direct product of a set of subdivisions of division rings.

• Journal of Environmental Science International
• /
• v.13 no.11
• /
• pp.993-1000
• /
• 2004

As an effort to clarify the ecosystem of Osaka Bay, a semi-enclosed coastal area under the influence of stratification, a three-dimensional water quality model with combination of the baroclinic flow model and primitive eco-system model was constructed. The proposed model succeeded in simulating the time-depending flow and density structure and the baroclinic residual currents in Osaka Bay. In present study, we tried to improve the model by taking account of the benthic-pelagic interaction and exchange of nutrients between sea bottom sediments and overlaying water. On vertical structure, the model consists of 13 layers of water and eight layers of sediments. Long-term prediction of water quality was conducted from 1964 to 1985. This period is characterized by rapid water pollution and its decrease by the cutoff reduction of COD and P flowed into Osaka Bay. By combining the sediment model into original model, the numerical model was confirmed to shows more reasonable results in simulating the water quality in Osaka Bay.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.7
• /
• pp.2703-2718
• /
• 2015

Nowadays, public cloud storage is gaining popularity and a growing number of users are beginning to use the public cloud storage for online data storing and sharing. However, how the encrypted data stored in public clouds can be effectively shared becomes a new challenge. Proxy re-encryption is a public-key primitive that can delegate the decryption right from one user to another. In a proxy re-encryption system, a semi-trusted proxy authorized by a data owner is allowed to transform an encrypted data under the data owner's public key into a re-encrypted data under an authorized recipient's public key without seeing the underlying plaintext. Hence, the paradigm of proxy re-encryption provides a promising solution to effectively share encrypted data. In this paper, we propose a new certificate-based proxy re-encryption scheme for encrypted data sharing in public clouds. In the random oracle model, we formally prove that the proposed scheme achieves chosen-ciphertext security. The simulation results show that it is more efficient than the previous certificate-based proxy re-encryption schemes.

• Korean Journal of Computational Design and Engineering
• /
• v.11 no.3
• /
• pp.211-222
• /
• 2006

In collaborative environment, it is necessary that the participants in collaboration should share the same understanding about the semantics of terms. For example, they should know that 'COMPONENT' and 'ITEM' are different word-expressions for the same meaning. In order to handle such problems in information sharing, an information system needs to automatically recognize that the terms have the same semantics. So we develop an algorithm mapping two terms based on their ontological definitions and their similarities. The proposed algorithm consists of four steps: the character matching, the inferencing, the definition comparing and the similarity checking. In the similarity checking step, we consider relation similarity and hierarchical similarity. The algorithm is very primitive, but it shows the possibility of semi-automatic mapping using ontology. In addition, we design a mapping procedure for a mapping system, called SOM (semantic ontology mapper).

• Bulletin of the Korean Mathematical Society
• /
• v.60 no.2
• /
• pp.339-348
• /
• 2023

It is shown that every nilpotent-invariant module can be decomposed into a direct sum of a quasi-injective module and a square-free module that are relatively injective and orthogonal. This paper is also concerned with rings satisfying every cyclic right R-module is nilpotent-invariant. We prove that R ≅ R₁ × R₂, where R₁, R₂ are rings which satisfy R₁ is a semi-simple Artinian ring and R₂ is square-free as a right R₂-module and all idempotents of R₂ is central. The paper concludes with a structure theorem for cyclic nilpotent-invariant right R-modules. Such a module is shown to have isomorphic simple modules eR and fR, where e, f are orthogonal primitive idempotents such that eRf ≠ 0.

• Korean Journal of Fisheries and Aquatic Sciences
• /
• v.30 no.4
• /
• pp.667-678
• /
• 1997

A primitive equation numerical model driven only by $M_2$ tide is used to examine role of tide in the temperature and velocity fields of Deukryang Bay. The numerical model reproduces several features of the observational temperature fields such that the isotherms tend to be parallel to the coast in the bay, and the colder water exists at the right hand side in the bay. The horizontal temperature and velocity fields in the model are dominantly influenced by bottom topography. The model also shows that the surface colder water in the bay is accompanied by strong-alongshore current during the flood tide. An investigation for baroclinicity in the bay by additional numerical experiment indicates that the baroclinirity in velocity field is very weak. The model, however, did not reproduce a stratification in the observation, implying that the model needs to add other semi-diurnal components such as $S_2,\;O_2\;or\;K_2$ tides to $M_2$ tide.

• Journal of the Korean Society of Propulsion Engineers
• /
• v.3 no.2
• /
• pp.1-9
• /
• 1999

Applicability of the pressure gradient method which is formulated based on pressure gradient is verified against turbulent flow analysis. In the pressure gradient method, pressure gradient instead of pressure itself is obtained using continuity constraint. Since correct pressure gradient is found only when mass conservation is satisfied, pressure gradient method can reflect physics of flow field properly The pressure gradient method is formulated with semi-staggered grid system which locates each primitive variables on the same grid point but evaluates pressure gradient in-between. This grid system ensures easy programming and reflection of correct physics in analysis. For verifying applicability of this method, the pressure gradient method is applied to turbulent flow analysis with low Reynolds number $\kappa$-$\varepsilon$ model. Turbulent flows include fully developed channel flow, backward-facing step flow, and conical diffuser flow. Prediction results show that the pressure gradient method can be applied to turbulent flow analysis. However, the pressure gradient method requires somewhat long computation time. Proper way to find optimum under-relaxation factor, $\gamma$, is also need to be developed.