• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1996.10a
• /
• pp.295-298
• /
• 1996

We consider a nonpreemptive single-machine scheduling problem to minimize the mean squared deviation(MSD) of job completion times about a common due date d with a maximum tardiness constraint, i.e., maximum tardiness is less than or equal to the given allowable amount, .DELTA.(MSD/T$_{max}$ problem). We classify the .DELTA.-unconstrained cases in the MSD/T$_{max}$ problem. We provide bounds to discern each case for the problem. It is also shown that the .DELTA.-unconstrained MSD/T$_{max}$ problem is equivalent to the unconstrained MSD problem and the tightly .DELTA.-constrained MSD/T$_{max}$ problem with n jobs and a maximum allowable tardiness .DELTA. can be converted into the constrained MSD problem with a common due date .DELTA. and n-1 jobs. Finally, the solution procedure for MSD/T$_{max}$ problem is provided. provided.

• Communications of the Korean Mathematical Society
• /
• v.35 no.1
• /
• pp.137-149
• /
• 2020

Let γ⁽ⁿ⁾ ≡ {γ_ij} (0 ≤ i+j ≤ 2n, |i-j| ≤ n) be a sequence in the complex number set ℂ and let E (n) be the Embry truncated moment matrices corresponding from γ⁽ⁿ⁾. For an odd number n, it is known that γ⁽ⁿ⁾ has a rank E (n)-atomic representing measure if and only if E(n) ≥ 0 and E(n) admits a flat extension E(n + 1). In this paper we suggest a related problem: if E(n) is positive and nonsingular, does E(n) have a flat extension E(n + 1)? and give a negative answer in the case of E(3). And we obtain some necessary conditions for positive and nonsingular matrix E (3), and also its sufficient conditions.

• KIPS Transactions on Software and Data Engineering
• /
• v.9 no.1
• /
• pp.17-24
• /
• 2020

The traveling salesman problem is an algorithmic problem tasked with finding the shortest route that a salesman visits, visiting each city and returning to the started city. Due to the exponential time complexity of TSP, it's hard to implement on cases like amusement park or delivery. Also, TSP is hard to meet user's demand that is associated with multi-dimensional attributes like travel time, interests, waiting time because it uses only one attribute - distance between nodes. This paper proposed Top-n Skyline-Multi Dimension TSP to resolve formerly adverted problems. The proposed algorithm finds the shortest route faster than the existing method by decreasing the number of operations, selecting multi-dimensional nodes according to the dominance of skyline. In the simulation, we compared computation time of dynamic programming algorithm to the proposed a TS-MDT algorithm, and it showed that TS-MDT was faster than dynamic programming algorithm.

• Journal of Korean Institute of Industrial Engineers
• /
• v.23 no.4
• /
• pp.661-667
• /
• 1997

We consider a generalized problem of the continuous multiple choice knapsack problem and study on the LP relaxation of the candidate problems which are generated in the branch and bound algorithm for solving the generalized problem. The LP relaxed candidate problem is called the generalized continuous multiple choice linear knapsack problem and characterized by some variables which are partitioned into continuous multiple choice constraints and the others which only belong to simple upper bound constraints. An efficient algorithm of order O($n^2logn$) is developed by exploiting some structural properties and applying binary search to ordered solution sets, where n is the total number of variables. A numerical example is presented.

• Journal of applied mathematics & informatics
• /
• v.9 no.2
• /
• pp.695-703
• /
• 2002

The fractional order evolutionary integral equations have been considered by first author in [6], the existence, uniqueness and some other properties of the solution have been proved. Here we study the continuation of the solution and its fractional order derivative. Also we study the generality of this problem and prove that the fractional order diffusion problem, the fractional order wave problem and the initial value problem of the equation of evolution are special cases of it. The abstract diffusion-wave problem will be given also as an application.

• Journal of applied mathematics & informatics
• /
• v.28 no.1_2
• /
• pp.1-11
• /
• 2010

The conditional covering problem is an important variation of well studied set covering problem. In the set covering problem, the problem is to find a minimum cardinality vertex set which will cover all the given demand points. The conditional covering problem asks to find a minimum cardinality vertex set that will cover not only the given demand points but also one another. This problem is NP-complete for general graphs. In this paper, we present an efficient algorithm to solve the conditional covering problem on interval graphs with n vertices which runs in O(n)time.

• Journal of information and communication convergence engineering
• /
• v.10 no.1
• /
• pp.1-4
• /
• 2012

Given separated points divided by a line, called a wall, in a plane, we aim to make a gate in the wall to connect the separated points to each other. In this setting, the problem is to find a location for the gate that minimizes the average distance between the points. The problem is a variant of the well-known facility location problem, which is extensively studied in the fields of operations research, location theory, theoretical computer science, and so on. In this paper, we consider the $L^1$-distance of the points in the plane. The points are projected onto the wall and so the problem is transformed to a proximity problem of points on a line. Then it is shown that the transformed problem is related to the weighted median problem of points on the line. Therefore, we obtain an O(n log n)-time algorithm to solve our problem.

• Research in Community and Public Health Nursing
• /
• v.13 no.4
• /
• pp.786-794
• /
• 2002

Purpose: The aim of the study was to investigate how adolescents' behavior is correlated with child abuse they experience, and how childrearing attitude of mothers perceived by the adolescents is correlated with child abuse experience by the adolescents. Method: A convenient sampling strategy was used. A total of 160 adolescents participated in this study. Of the 160 responses, 116 were used for final analysis. The data were analyzed using K-YSR program and SPSSWIN. Result: The results were as follows. Mild child abuse experiences reported by the subjects were Throwing the object at me (12.9%, N = 15), Clutching and pushing (12.9%, N = 15), and Slapping on the cheek (14.7%, N = 17)'. Severe child abuse experiences reported by the subjects were Kicking, pounding and biting (10.3%, N = 10), Rod, stick, belt, broom beating using various objects (41.4%, N = 38), and Beating all over the body (6.7%, N = 8). Very severe child abuse experiences reported by the subjects were Burning with cigarette (0.4%, N = 1), Threatening me with objects such as a knife, a hammer, an axe, or a gimlet (0.8%, N = 2). Injuring me with the objects (0.4%, N = 1), and Hospitalized by belting (0.4%, N = 1). In terms of correlations among the main study variables, physical child abuse had significant positive correlations with externalizing problem (r=.271, p=.001) and total behavioral problem (r=.288, p=.002). Physical child abuse also had a significant positive correlation with authoritarian childrearing attitude of mother (r=.363, p=.000). Physical child abuse had significant negative correlations with mothers affectionate childrearing attitude (r=-.191, p=.050) and active participative childrearing attitude (r=-.101, p=.035). Conclusion: Mothers childrearing attitude is a salient factor for preventing child abuse. In addition, child abuse is an important factor for preventing adolescent's behavioral problem.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.21 no.4
• /
• pp.753-758
• /
• 2017

The ray-shooting problem is to find the first intersection point on the surface of given geometric objects where a ray moving along a straight line hits. Since rays are usually given in the form of queries, this problem is typically solved as follows. First, a data structure for a collection of objects is constructed as preprocessing. Then, the answer for each query ray is quickly computed using the data structure. In this paper, we consider the ray-shooting problem about the set of vertical line segments on the x-axis. We present a new data structure called a convex layer tree for n vertical line segments given by input. This is a tree structure consisting of layers of convex hulls of vertical line segments. It can be constructed in O(n log n) time and O(n) space and is easy to implement. We also present an algorithm to solve each query in O(log n) time using this data structure.

• Smart Media Journal
• /
• v.10 no.4
• /
• pp.15-20
• /
• 2021

The distributed trigger counting problem is to notify the user when the total number of triggers received from a distributed system consisting of n nodes reaches a predefined value w. The distributed trigger counting problem is used for monitoring and global snapshots in various distributed systems. In this paper, we propose a simple and efficient algorithm for the distributed trigger counting problem. The proposed algorithm operates based on a tree structure of degree $\sqrt{n}$ and height 2. The proposed algorithm operates in three different phases based on the remaining number of triggers. Experimental results show that the proposed algorithm has a smaller message complexity than CoinRand, and MaxRcv also performed better when the number of nodes is not large.