• East Asian mathematical journal
• /
• 제23권2호
• /
• pp.197-206
• /
• 2007

The purpose of this paper is to show some results of M. Bresar and J. Vukman concerning orthogonal derivations of semiprime rings in [3] for (${\sigma},\;{\tau}$)-derivations and generalized (${\sigma},\;{\tau}$)-derivations in $\Gamma$-rings.

• 충청수학회지
• /
• 제35권2호
• /
• pp.115-124
• /
• 2022

In this paper, we introduce the notion of orthogonal reserve derivation on semiprime 𝚪-semirings. Some characterizations of semiprime 𝚪-semirimgs are obtained by means of orthogonal reverse derivations. We also investigate conditions for two reverse derivations on semiprime 𝚪-semiring to be orthogonal.

• Korean Journal of Mathematics
• /
• 제30권2호
• /
• pp.341-349
• /
• 2022

In this paper, we introduce the notion of orthogonal reserve derivation on semiprime semirings. Some characterizations of semiprime semirimgs are obtained by means of orthogonal reverse derivations. We also investigate conditions for two reverse derivations on semiring to be orthogonal.

• 한국수학교육학회지시리즈B:순수및응용수학
• /
• 제13권4호
• /
• pp.303-310
• /
• 2006

M. $Bre\v{s}ar$ and J. Vukman obtained some results concerning orthogonal derivations in semiprime rings which are related to the result that is well-known to a theorem of Posner for the product of two derivations in prime rings. In this paper, we present orthogonal generalized derivations in semiprime near-rings.

• East Asian mathematical journal
• /
• 제24권4호
• /
• pp.389-398
• /
• 2008

In this paper, some results of [6] concerning orthogonal ($\sigma$, $\tau$)-derivations and generalized ($\sigma$, $\tau$)-derivations are generalized for a nonzero ideal of a semiprime ring.

• Kyungpook Mathematical Journal
• /
• 제50권3호
• /
• pp.379-387
• /
• 2010

In this paper, we present some results concerning orthogonal generalized (${\sigma},{\tau}$)-derivations in semiprime near-rings. These results are a generalization of result of Bresar and Vukman, which are related to a theorem of Posner for the product of two derivations in prime rings.

• Nonlinear Functional Analysis and Applications
• /
• 제28권1호
• /
• pp.95-105
• /
• 2023

In the present paper, we introduce a new system of functional equations, known as orthogonal Pexider hom-derivation and Pexider hom-Pexider derivation (briefly, (Pexider) hom-derivation). Using the fixed point method, we investigate the stability of Pexider hom-derivations and (Pexider) hom-derivations on Banach algebras.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제16권6호
• /
• pp.2094-2114
• /
• 2022

Due to the wide application of fifth generation communication, wireless sensor networks have become an indispensable part in our daily life. In this paper, we analyze physical layer security for two-way relay with energy harvesting (EH), where power splitter is considered at relay. And two kinds of combined methods, i.e., selection combining (SC) and maximum ratio combining (MRC) schemes, are employed at eavesdropper. What's more, the closed-form expressions for security performance are derived. For comparison purposes, this security behaviors for orthogonal multiple access (OMA) networks are also investigated. To gain deeper insights, the end-to-end throughput and approximate derivations of secrecy outage probability (SOP) under the high signal-to-noise ratio (SNR) regime are studied. Practical Monte-Carlo simulative results verify the numerical analysis and indicate that: i) The secure performance of SC scheme is superior to MRC scheme because of being applied on eavesdropper; ii) The secure behaviors can be affected by various parameters like power allocation coefficients, transmission rate, etc; iii) In the low and medium SNR region, the security and channel capacity are higher for cooperative non-orthogonal multiple access (NOMA) systems in contrast with OMA systems; iv) The systematic throughput can be improved by changing the energy conversion efficiency and power splitting factor. The purpose of this study is to provide theoretical direction and design of secure communication.

• Journal of Communications and Networks
• /
• 제12권3호
• /
• pp.222-230
• /
• 2010

In this paper, we present a closed-form approximation of the average sum rate of zero-forcing (ZF) beamforming (BF) with semi-orthogonal user selection (SUS). We first derive the survival probability associated with the SUS that absolute square of the channel correlation between two users is less than the orthogonalization level threshold (OLT).With this result, each distribution for the number of surviving users at each iteration of the SUS and the number of streams for transmission is calculated. Secondly, the received signal power of ZF-BF is represented as a function of the elements of the upper triangular matrix from QR decomposition of the channel matrix. Thirdly, we approximate the received signal power of ZF-BF with the SUS as the maximum of scaled chisquare random variables where the scaling factor is approximated as a function of both OLT and the number of users in the system. Putting all the above derivations and order statistics together, the approximated ergodic sum rate of ZF-BF with the SUS is shown in a closed form. The simulation results verify that the approximation tightly matches with the sample average for any OLT and even for a small number of users.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2002년도 ITC-CSCC -2
• /
• pp.1015-1018
• /
• 2002

We show how any discrete wavelet transform or two band subband filtering with finite filters can be decomposed onto a finite sequence of simple filtering steps, which we call lifting steps but that are also known as ladder structures, We present a self-contained derivations, building the decomposition from the basic principles such as the Euclidean algorithm, with a focus on a applying it to wavelet filtering. This factorization provides an alternative for the lattice factorization, with the advantage that it can also be used in the bi-orthogonal, i.e, non-unitary case. Lifting leads to a speed-up when compared to the standard implementation. We show that this lifting scheme can be applied in image compression efficiently