• Journal of applied mathematics & informatics
• /
• v.40 no.3_4
• /
• pp.545-562
• /
• 2022

Using the conception of weakly weighted sharing we discussed the value distribution of the differential product functions constructed with a polynomial and difference operator of entire function. Here we established two uniqueness result on product of difference operators when two such functions share a small function.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.11 no.12
• /
• pp.5042-5048
• /
• 2010

In ubiquitous environments, many continuous query processing techniques make use of operator network and sharing methods on continuous data stream generated from various sensors. Since similar continuous queries with the location information intensively occur in specific regions, we suggest a new operator sharing method based on grid partition for the spatial continuous query processing for location-based applications. Due to the proposed method shares moving objects by the given grid cell without sharing spatial operators individually, our approach can not only share spatial operators including similar conditions, but also increase the query processing performance and the utilization of memory by reducing the frequency of use of spatial operators.

• Journal of KIISE:Information Networking
• /
• v.37 no.4
• /
• pp.312-316
• /
• 2010

In this paper, we propose a game theoretic channel sharing model that allocates resources of a base station between MNO(Mobile Network Operator) and MVNO(Mobile Virtual Network Operator) in a fair and efficient manner. Considering the input traffic loads of MNO and MVNO, the proposed model uses the bargaining game theory to allocate channel resources between MNO and MNVO. When the input loads of the carriers are asymmetric, the proposed model increases the resource utilization by allocating more channel resources to the operator with high input load. In addition, the proposed model prevents the quality of service of an operator from degrading even if the input load of the other operators increases excessively.

• Bulletin of the Korean Mathematical Society
• /
• v.58 no.5
• /
• pp.1175-1192
• /
• 2021

In this paper, we have studied on the uniqueness problems of meromorphic functions with its linear c-shift operator in the light of partial sharing. Our two results improve and generalize two very recent results of Noulorvang-Pham [Bull. Korean Math. Soc. 57 (2020), no. 5, 1083-1094] in some sense. In addition, our other results have improved and generalized a series of results due to Lü-Lü [Comput. Methods Funct. Theo. 17 (2017), no. 3, 395-403], Zhen [J. Contemp. Math. Anal. 54 (2019), no. 5, 296-301] and Banerjee-Bhattacharyya [Adv. Differ. Equ. 509 (2019), 1-23]. We have exhibited a number of examples to show that some conditions used in our results are essential.

• Honam Mathematical Journal
• /
• v.46 no.2
• /
• pp.267-278
• /
• 2024

In this paper, we investigate the uniqueness of a meromorphic function f(z) and its difference polynomial of difference operator with two sharing values counting multiplicities. Our two results improve and generalize the recent results of Barki Mahesh, Dyavanal Renukadevi S and Bhoosnurmath Subhas S [4] and for the case q ≥ 2, this allows for a highly unique generalization. To further demonstrate the validity of our main result, we provide an example.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.22 no.51
• /
• pp.41-52
• /
• 1999

In this paper, a load balancing problem among operators is considered, when one or more machines can be assigned to an operator. The machines are grouped into two types and there are more than one machines in each group. The type of machine in which a job can be processed, is determined. However, an operator can handle both types of machine. The elementary operations of a job are classified into three classes : machine-controlled elements, operator-controlled elements and machine/operator- controlled elements. The objective is to balance the workloads among operators under the constraints of available machine-time and operator-time. A heuristic solution procedure is suggested for allocating jobs to machines and allocating machines to operators. The performance of the algorithm is evaluated with various data set.

• IE interfaces
• /
• v.12 no.2
• /
• pp.166-173
• /
• 1999

In this paper, a load balancing problem among operators is considered, when one or more identical machines can be assigned to an operator. The operations of a job are separated into three categories : machine-controlled elements, operator-controlled elements and machine/operator-controlled elements. Machining or forming operations are included into the first category. The second category includes inspection and moving to another machine, and the last category includes setup and loading/unloading operation. The objective is to balance the workloads among operators under the constraints of available machine-time and operator-time. A hierarchical heuristic solution procedure is suggested for allocating jobs to each machine and allocating machines to each operator. The performance of the algorithm is evaluated with various data set.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.22 no.3
• /
• pp.454-468
• /
• 1997

This paper presents a bitwidth optimization algorithm for efficient hardware sharing in digital signal processing system. The proposed algorithm determines the fixed-point representation for each signal through bitwidth optimization to generate the hardware requiring less area. To reduce the operator area, the algorithm partitions the abstract operations in the design description into several groups, such that the operations in the same group can share an operator. The partitioning result are fed to a high-level synthesis system to generate the pipelined fixed-point datapaths. The proposed algorithm has been implemented in SODAS-DSP an automatic synthesis system for fixed-point DSP hardware. Accepting the models of DSP algorithms in schematics, the system automatically generates the fixed-point datapath and controller satisfying the design constraints in area, speed, and SNR(Signal-to-Noise Ratio). Experimental results show that the efficiency of the proposed algorithm by generates the area-efficient DSP hardwares satisfying performance constraints.

• Journal of Internet Computing and Services
• /
• v.22 no.2
• /
• pp.19-27
• /
• 2021

Fireworks Algorithm (FWA) is a new heuristic swarm intelligent algorithm inspired by the natural phenomenon of the fireworks explosion. Though it is an effective algorithm for solving optimization problems, FWA has a slow convergence rate and less information sharing between individuals. In this paper, we improve the FWA. Firstly, explosion operator and explosion amplitude are analyzed in detail. The coefficient of explosion amplitude and explosion operator change dynamically with iteration to balance the exploitation and exploration. The convergence performance of FWA is improved. Secondly, differential evolution and commensal learning (CDE) significantly increase the information sharing between individuals, and the diversity of fireworks is enhanced. Comprehensive experiment and comparison with CDE, FWA, and VACUFWA for the 13 benchmark functions show that the improved algorithm was highly competitive.

• Communications of the Korean Mathematical Society
• /
• v.25 no.4
• /
• pp.547-556
• /
• 2010

In this paper, we present the reprentation of all operators B which are Drazin invertible and sharing the spectral projections at 0 with a given Drazin invertible operator A. Meanwhile, some related results for EP operators with closed range are obtained.