• Kyungpook Mathematical Journal
• /
• 제56권1호
• /
• pp.221-233
• /
• 2016

The present paper proposes a new monotone iteration method for existence as well as approximation of the coupled solutions for a coupled periodic boundary value problem of first order ordinary nonlinear differential equations. A new hybrid coupled fixed point theorem involving the Dhage iteration principle is proved in a partially ordered normed linear space and applied to the coupled periodic boundary value problems for proving the main existence and approximation results of this paper. An algorithm for the coupled solutions is developed and it is shown that the sequences of successive approximations defined in a certain way converge monotonically to the coupled solutions of the related differential equations under some suitable mixed hybrid conditions. A numerical example is also indicated to illustrate the abstract theory developed in the paper.

• 한국경영과학회지
• /
• 제11권1호
• /
• pp.36-43
• /
• 1986

In this study, the fuzzy programming is extended to handle various types of membership functions by transformation of the complicated fuzzy programming problems into the equivalent crisp linear programming problems with single objective. It is well-known that the fuzzy programming problem with linear membership functions (i.e., ramp type) can be easily transformed into a linear programming problem by introducing one dummy variable to minimize the worst unwanted deviation. However, until recently not many researches have been done to handle various general types of complicated linear membership functions which might be more realistic than ramp-or triangular-type functions. In order to handle these complicated membership functions, the goal dividing concept, which is based on the fuzzy set operation (i. e., intersection and union operations), has been prepared. The linear model obtained using the goal dividing concept is more efficient and single than the previous models [4, 8]. In addition, this result can be easily applied to any nonlinear membership functions by piecewise approximation since the membership function is continuous and monotone increasing or decreasing.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제14권3호
• /
• pp.1065-1085
• /
• 2020

With rapid growth of content demands, device-to-device (D2D) content sharing is exploited to effectively improve the service quality of users. Considering the limited storage space and various content demands of users, caching schemes are significant. However, most of them ignore the influence of the asynchronous content reuse and the selfishness of users. In this work, the user preferences are defined by exploiting the user-oriented content popularity and the current caching situation, and further, we propose the social-aware rate, which comprehensively reflects the achievable contents download rate affected by the social ties, the caching indicators, and the user preferences. Guided by this, we model the collaborative caching problem by making a trade-off between the redundancy of caching contents and the cache hit ratio, with the goal of maximizing the sum of social-aware rate over the constraint of limited storage space. Due to its intractability, it is computationally reduced to the maximization of a monotone submodular function, subject to a matroid constraint. Subsequently, two social-aware collaborative caching algorithms are designed by leveraging the standard and continuous greedy algorithms respectively, which are proved to achieve different approximation ratios in unequal polynomial-time. We present the simulation results to illustrate the performance of our schemes.