• 제목/요약/키워드: Operator Sharing

검색결과 52건 처리시간 0.02초

DISTRIBUTION OF VALUES OF DIFFERENCE OPERATORS CONCERNING WEAKLY WEIGHTED SHARING

  • SHAW, ABHIJIT
    • Journal of applied mathematics & informatics
    • /
    • 제40권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.

시공간 데이터 스트림 처리를 위한 영역 기반의 연산자 공유 기법 (Partition-based Operator Sharing Scheme for Spatio-temporal Data Stream Processing)

  • 정원일;김영기
    • 한국산학기술학회논문지
    • /
    • 제11권12호
    • /
    • pp.5042-5048
    • /
    • 2010
  • 유비쿼터스 환경에서 다양한 센서로부터 생성되는 데이터 스트림에 대해 사용자가 요구하는 위치 기반 서비스를 효과적으로 지원하기 위해 연산자 네트워크와 공유 등을 통한 연속 질의 처리 기법이 활용되고 있다. 위치 정보 기반의 연속 질의 처리는 특정 영역을 중심으로 유사 질의가 집중적으로 발생할 수 있으므로, 본 논문에서는 유사한 조건을 갖는 공간 연산을 공유하기 위해 그리드 영역 분할을 이용한 공간 연산 공유 기법을 제안한다. 제안기법은 공간 연산을 직접 공유하지 않고 그리드 셀 별로 이동객체를 공유하기 때문에 유사한 조건을 갖는 공간 연산의 공유가 가능하여 공간 연산의 실행 빈도수를 크게 감소시켜 질의 처리 속도의 향상과 함께 메모리 이용률을 향상시킨다.

MNO와 MVNO 사이의 무선 채널 공유를 위한 게임이론적 모델 (Game Theoretic Model for Radio Channel Sharing between MNO and MVNO)

  • 박재성;김범준
    • 한국정보과학회논문지:정보통신
    • /
    • 제37권4호
    • /
    • pp.312-316
    • /
    • 2010
  • 본 논문에서는 기지국 채널 자원을 MNO(Mobile Network Operator)와 MVNO(Mobile Virtual Network Operator)가 공유할 경우 사업자들에게 채널 자원을 공정하고 효율적으로 할당하기 위한 게임 이론적 모델을 제안한다. 제안 모델은 협상(Bargaining) 게임 이론을 이용하며 MNO와 MVNO의 입력 부하를 고려하여 이들 사이의 기지국 채널 자원을 할당한다. 제안 기법은 사업자별 입력 부하가 비대칭적인 경우 입력 부하가 낮은 사업자보다 입력 부하가 높은 사업자에게 보다 많은 양의 채널을 할당하여 기지국의 채널 이용율을 증가시키며 또한 한 사업자의 과도한 입력 부하로 인해 타 사업자의 서비스 품질이 저하되는 것을 방지한다.

MEROMORPHIC FUNCTION PARTIALLY SHARES SMALL FUNCTIONS OR VALUES WITH ITS LINEAR c-SHIFT OPERATOR

  • Banerjee, Abhijit;Maity, Sayantan
    • 대한수학회보
    • /
    • 제58권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.

UNIQUENESS OF A MEROMORPHIC FUNCTION WITH DIFFERENCE POLYNOMIAL OF DIFFERENCE OPERATOR SHARING TWO VALUES CM

  • H. R. Jayarama;H. Harish;S. H. Naveenkumar;C. N. Chaithra
    • 호남수학학술지
    • /
    • 제46권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.

작업자 공유가 가능한 이기종 병렬기계 작업장에서 작업자 부하균형 문제 (A Load Balancing Problem among Operators in a Nonidentical Parallel Machine Shop Considering Operator Sharing)

  • 문덕희;김대경
    • 산업경영시스템학회지
    • /
    • 제22권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.

  • PDF

작업자 공유가 가능한 병렬기계작업장에서 작업자 부하 균형을 고려한 작업할당문제 (A Load Balancing Problem in a Parallel Machine Shop Considering Operator Sharing)

  • 문덕희;김대경
    • 산업공학
    • /
    • 제12권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.

  • PDF

효율적인 하드웨어 공유를 위한 단어길이 최적화 알고리듬 (A bitwidth optimization algorithm for efficient hardware sharing)

  • 최정일;전홍신;이정주;김문수;황선영
    • 한국통신학회논문지
    • /
    • 제22권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.

  • PDF

Hybrid Fireworks Algorithm with Dynamic Coefficients and Improved Differential Evolution

  • Li, Lixian;Lee, Jaewan
    • 인터넷정보학회논문지
    • /
    • 제22권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.