• Bulletin of the Korean Mathematical Society
• /
• v.38 no.3
• /
• pp.565-573
• /
• 2001

In this paper, we first rove the strict quasi-concavity of maximizing function, and next prove a new maximum theorem using Fan’s generalization of the classical KKM theorem. Also an existence theorem of social equilibrium can be proved when an additional assumption on the constraint correspondence is assumed. Finally, we give illustrative two examples of constrained optimization problems.

• Journal of the Korean Data and Information Science Society
• /
• v.16 no.4
• /
• pp.1141-1145
• /
• 2005

In this note, we show that Theorem 2.1[Kybernetika, 28(1992) 45-49], a result of a functional relationship between the membership function of LR fuzzy numbers of T-sum and T-product, remains valid for convex additive generator and concave shape functions L and R with simple proof. We also consider the case for 0-symmetric R fuzzy numbers.

• Journal of Information Science Theory and Practice
• /
• v.1 no.3
• /
• pp.6-11
• /
• 2013

A new explanation, using exponential functions, is given for the S-shaped functional relation between the mean citation score and the proportion of top 10% (and other percentages) publications for the 500 Leiden Ranking universities. With this new model we again obtain an explanation for the concave or convex relation between the proportion of top $100{\theta}%$ publications, for different fractions of ${\theta}$.

• Journal of Biosystems Engineering
• /
• v.16 no.2
• /
• pp.142-147
• /
• 1991

Because combine cylinders account for up to 80 percent of the power requirements to harvest grain, it is important to have a reliable method to predict and analyze power consumption. An equation was derived to meet the prediction needs. The equation contains the variables number of bars on the cylinder, concave clearance, concave length, thickness of the feed material, feed rate, and cylinder speed. Indirectly, cylinder diameter was also considered. The derived equation was verified to be a reliable function for three of the variables and the equation was judged to be a reliable power prediction equation.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.41 no.11
• /
• pp.1630-1638
• /
• 2016

In this paper, we consider multiuser massive multiple-input and multiple-output (MIMO) system where multiusers simultaneously utilize massive antennas of base station (BS). With a downlink frame structure considering pilot signals, we derive the ergodic cell capacity based on zero-forcing beamforming (ZFBF) technique. This paper proves that the ergodic cell capacity is concave function with respect to the numbers of BS antennas and users, and derives the optimum numbers of BS antennas and users maximizing ergodic cell capacity. From the simulation results, it is shown that the derived numbers of BS antennas and users has the optimum value for the maximum ergodic cell capacity, and the ergodic cell capacity with the derived optimum values increases with respect to the transmit SNR(Signal to Noise Ratio).

• Journal of Broadcast Engineering
• /
• v.25 no.6
• /
• pp.836-844
• /
• 2020

A very large number of pixels is required to generate a computer generated hologram (CGH) with a large-size and wide viewing angle equivalent to that of an analog hologram, which incurs a very large amount of computation. For this reason, a high-performance computing device and long computation time were required to generate high-definition CGH. To solve these problems, in this paper, we propose a technique for generating high-definition CGH by arraying the pre-calculated low-definition CGH and multiplying the appropriately-shifted concave lens function. Using the proposed technique, 0.1 Gigapixel CGH recorded by the point cloud method can be used to calculate 2.5 Gigapixels CGH at a very high speed, and the recorded hologram image was successfully reconstructed through the experiment.

• Journal of Korea Society of Industrial Information Systems
• /
• v.27 no.4
• /
• pp.37-45
• /
• 2022

In this paper, a multi agent-multi task assignment problem, which is a representative problem of combinatorial optimization, is presented. The objective of the problem is to determine the coordinated agent-task assignment that maximizes the sum of the achievement rates of each task. The achievement rate is represented as a concave down increasing function according to the number of agents assigned to the task. The problem is expressed as an NP-hard problem with a non-linear objective function. In this paper, to solve the assignment problem, we propose a hybrid cross-entropy algorithm as an effective and efficient solution methodology. In fact, the general cross-entropy algorithm might have drawbacks (e.g., slow update of parameters and premature convergence) according to problem situations. Compared to the general cross-entropy algorithm, the proposed method is designed to be less likely to have the two drawbacks. We show that the performances of the proposed methods are better than those of the general cross-entropy algorithm through numerical experiments.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.41 no.1
• /
• pp.110-117
• /
• 2018

Machines and facilities are physically or chemically degenerated by continuous usage. One of the results of this degeneration is the process mean shift. By the result of degeneration, non-conforming products and malfunction of machine occur. Therefore a periodic preventive resetting the process is necessary. This type of preventive action is called 'preventive maintenance policy.' Preventive maintenance presupposes that the preventive (resetting the process) cost is smaller than the cost of failure caused by the malfunction of machine. The process mean shift problem is a field of preventive maintenance. This field deals the interrelationship between the quality cost and the process resetting cost before machine breaks down. Quality cost is the sum of the non-conforming item cost and quality loss cost. Quality loss cost is due to the deviation between the quality characteristics from the target value. Under the process mean shift, the quality cost is increasing continuously whereas the process resetting cost is constant value. The objective function is total costs per unit wear, the decision variables are the wear limit (resetting period) and the initial process mean. Comparing the previous studies, we set the process variance as an increasing concave function and set the quality loss function as Cpm+ simultaneously. In the Cpm+, loss function has different cost coefficients according to the direction of the quality characteristics from target value. A numerical example is presented.

• Journal of the Society of Naval Architects of Korea
• /
• v.55 no.1
• /
• pp.66-74
• /
• 2018

In order to evaluate the precision degree of the blocks on the dock, the shipyards recently started to use the point cloud approaches using the 3D scanners. However, they hesitate to use it due to the limited time, cost, and elaborative effects for the post-works. Although it is somewhat traditional instead, they have still used the electro-optical wave devices which have a characteristic of having less dense point set (usually 1 point per meter) around the contact section of two blocks. This paper tried to expand the usage of point sets. Our approach can estimate the rework time to weld between the Pre-Erected(PE) Block and Erected(ER) block as well as the precision of block construction. In detail, two algorithms were applied to increase the efficiency of estimation process. The first one is K-mean clustering algorithm which is used to separate only the related contact point set from others not related with welding sections. The second one is the Concave hull algorithm which also separates the inner point of the contact section used for the delayed outfitting and stiffeners section, and constructs the concave outline of contact section as the primary objects to estimate the rework time of welding. The main purpose of this paper is that the rework cost for welding is able to be obtained easily and precisely with the defective point set. The point set on the blocks' outline are challenging to get the approximated mathematical curves, owing to the lots of orthogonal parts and lack of number of point. To solve this problems we compared the Radial based function-Multi-Layer(RBF-ML) and Akima interpolation method. Collecting the proposed methods, the paper suggested the noble point matching method for minimizing the rework time of block-welding on the dock, differently the previous approach which had paid the attention of only the degree of accuracy.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1995.04a
• /
• pp.306-315
• /
• 1995

This paper presents a bin picking method using a slit beam laser in which a robot recognizes all of the unoccluded objects from the top of jumbled objects, and picks them up one by one. Once those unoccluded objects are removed, newly developed unoccluded objects underneath are recognized and the same process is continued until the bin gets empty. To recognize unoccluded objects, a new algorithm to link edges on slices which are generated by the orthogonally mounted laser on the xy table is proposed. The edges on slices are partitioned and classified using convex and concave function with a distance parameter. The edge types on the neighborhood slices are compared, then the hamming distances among identical kinds of edges are extracted as the features of fuzzy membership function. The sugeno fuzzy integration about features is used to determine linked edges. Finally, the pick-up sequence based on MaxMin theory is determined to cause minimal disturbance to the pile. This proposed method may provide a solution to the automation of part handling in manufacturing environments such as in punch press operation or part assembly.