• Title/Summary/Keyword: K-best

Search Result 15,196, Processing Time 0.05 seconds

PROXIMITY MAPS FOR CERTAIN SPACES

  • Lee, Mun-Bae;Park, Sung-Ho
    • Bulletin of the Korean Mathematical Society
    • /
    • v.34 no.2
    • /
    • pp.259-271
    • /
    • 1997
  • Let K be a nonempty subset of a normed linear space X and let x $\in$ X. An element k$_0$ in K satisfying $\$\mid$$x - k$_0$$\$\mid$$ = d(x, K) := (equation omitted) $\$\mid$$x - k$\$\mid$$ is called a best approximation to x from K. For any x $\in$ X, the set of all best approximations to x from K is denoted by P$_K$(x) = {k $\in$ K : $\$\mid$$ x - k $\$\mid$$ = d(x, K)}. (omitted)

  • PDF

A Study on Fabric Adhesive Interlining (1) (직물접착심지에 관한 연구(I))

  • Cho, Cha
    • Journal of the Korean Home Economics Association
    • /
    • v.29 no.2
    • /
    • pp.35-46
    • /
    • 1991
  • After adhering theone-sided non-woven adhesive interlining to the polyester/cotton fabrics and making experiments under the various conditions by L27 Orthogonal Array Table, we examined and analyzed the breaking away strength. The rusults are summarized as follows : 1. The best length of the adhering time is 15 secs. 2. As the adehesive interlining for blouse and jacket, B3 is best 3. The pressure for the adhesion is best under the pressure of 6.2Kg. 4. The temperature for the adhesion is best at 140$^{\circ}C$. 5. As for the direction of the adhesion, three directions appear much the same breaking away strength. 6. For the better adhesion power, if the less adhering power, if the less adhering pressure is applied, the adhering time must be extended(15-20 secs), and if much stronger adhering pressure is applied, the time must be shortened(10-15 secs). In general, it is the best way for the adhesion to apply under the pressure of 6.2Kg, for 15 secs long, and at 140$^{\circ}C$ of the adhering temperature.

  • PDF

Social Withdrawal and Friendships in Childhood (학령기 아동의 사회적 위축성과 친구관계)

  • Shin, Yoolim
    • Korean Journal of Child Studies
    • /
    • v.28 no.5
    • /
    • pp.193-207
    • /
    • 2007
  • The present study investigated the influence of withdrawal on children's best friendship including prevalence of best friendship, friendship quality, and friends' psychosocial characteristics. Subjects were 471 fifth and sixth graders recruited from two public schools. The peer nomination index was used to assess peer victimization, withdrawal, and prosocial behavior. Peer rejection and acceptance were also measured. Children reported on the quality of their friendships using the Friendship Quality Scale(Bukowsi et al., 1994). Results showed that compared to control group, withdrawn children had fewer best friends and perceived their friendship quality more negatively. Moreover, withdrawn children are similar with their best friends in respect with prosocial behavior, withdrawal, peer victimization, and peer rejection level.

  • PDF

Economics of Supply Chain Contracting for Quality

  • Kim Taeho
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 2004.10a
    • /
    • pp.539-553
    • /
    • 2004
  • This paper models and solves contracting schemes for both when quality is perfectly observable and when quality is not perfectly observable in supply chain. When quality is perfectly observable, the first-best optimal solution which is that the marginal utility of procurer obtained from the quantity and quality supplied by suppliers (the price) is equal to the marginal cost to produce the quantity and quality is obtained. However, when quality is not perfectly observable to procurers the optimal solution cannot be the first-best but the second-best where the price is greater than the marginal cost to produce the quantity and quality and social welfare is less than that of the first-best solution.

  • PDF

A hybrid CSS and PSO algorithm for optimal design of structures

  • Kaveh, A.;Talatahari, S.
    • Structural Engineering and Mechanics
    • /
    • v.42 no.6
    • /
    • pp.783-797
    • /
    • 2012
  • A new hybrid meta-heuristic optimization algorithm is presented for design of structures. The algorithm is based on the concepts of the charged system search (CSS) and the particle swarm optimization (PSO) algorithms. The CSS is inspired by the Coulomb and Gauss's laws of electrostatics in physics, the governing laws of motion from the Newtonian mechanics, and the PSO is based on the swarm intelligence and utilizes the information of the best fitness historically achieved by the particles (local best) and by the best among all the particles (global best). In the new hybrid algorithm, each agent is affected by local and global best positions stored in the charged memory considering the governing laws of electrical physics. Three different types of structures are optimized as the numerical examples with the new algorithm. Comparison of the results of the hybrid algorithm with those of other meta-heuristic algorithms proves the robustness of the new algorithm.

A Best View Selection Method in Videos of Interested Player Captured by Multiple Cameras (다중 카메라로 관심선수를 촬영한 동영상에서 베스트 뷰 추출방법)

  • Hong, Hotak;Um, Gimun;Nang, Jongho
    • Journal of KIISE
    • /
    • v.44 no.12
    • /
    • pp.1319-1332
    • /
    • 2017
  • In recent years, the number of video cameras that are used to record and broadcast live sporting events has increased, and selecting the shots with the best view from multiple cameras has been an actively researched topic. Existing approaches have assumed that the background in video is fixed. However, this paper proposes a best view selection method for cases in which the background is not fixed. In our study, an athlete of interest was recorded in video during motion with multiple cameras. Then, each frame from all cameras is analyzed for establishing rules to select the best view. The frames were selected using our system and are compared with what human viewers have indicated as being the most desirable. For the evaluation, we asked each of 20 non-specialists to pick the best and worst views. The set of the best views that were selected the most coincided with 54.5% of the frame selection using our proposed method. On the other hand, the set of views most selected as worst through human selection coincided with 9% of best view shots selected using our method, demonstrating the efficacy of our proposed method.

DECIDING ON HOW TO DECIDE BEST

  • Cho, Keun Tae;Kwon, Cheol Shin
    • Management Science and Financial Engineering
    • /
    • v.7 no.2
    • /
    • pp.31-57
    • /
    • 2001
  • Regarding all methods of decision making as parts of the same subject, one is astounded to find that the field speaks to the practitioners about multicriteria decision making with a multi-forked tongue, different methods give different and conflicting outcomes even for very simple decisions. In this paper, five well-known decision theories are described and used to work out a simple decision to choose the best of three cars. The outcomes turn out not to be the same for all the methods, which is troubling because one would expect unique answers in decision making. Several "meta" criteria that are essential for making a decision theory to make a choice as to which decision approach is best.h is best.

  • PDF

A Modified Particle Swarm Optimization Algorithm : Information Diffusion PSO (새로운 위상 기반의 Particle Swarm Optimization 알고리즘 : 정보파급 PSO)

  • Park, Jun-Hyuk;Kim, Byung-In
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.37 no.3
    • /
    • pp.163-170
    • /
    • 2011
  • This paper proposes a modified version of Particle Swarm Optimization (PSO) called Information Diffusion PSO (ID-PSO). In PSO algorithms, premature convergence of particles could be prevented by defining proper population topology. In this paper, we propose a variant of PSO algorithm using a new population topology. We draw inspiration from the theory of information diffusion which models the transmission of information or a rumor as one-to-one interactions between people. In ID-PSO, a particle interacts with only one particle at each iteration and they share their personal best solutions and recognized best solutions. Each particle recognizes the best solution that it has experienced or has learned from another particle as the recognized best. Computational experiments on the benchmark functions show the effectiveness of the proposed algorithm compared with the existing methods which use different population topologies.