• Journal of Navigation and Port Research
• /
• v.32 no.10
• /
• pp.851-856
• /
• 2008

Construction of large-scale container ports with the productivity improvements in container cranes shortened time of staying port to increase the level of service it harbors efforts accelerated. About container crane system exerted on the input, which is designed to look good performance considering the states feedback control system. The states observer designed of container cranes state variables that are expected to measurement noise or particular measurement signal. In the status of existing research, the feedback gain matrix and the state observer gain matrix are searched by being separated solving. But the feedback gain matrix and the state observer gain matrix are searched by RCGAs at once that be used robust search method in this paper.

• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.38 no.6
• /
• pp.957-965
• /
• 2018

This study presents a geographic information system based dump truck route exploring system (DRES) which provides construction managers and hauling operators with efficient route information that can improve earthmoving productivity by reducing hauling time. The system is comprised of Network Analyst from Esri as a route exploring engine and a network data model. The network data model includes information on weight limit of bridges, height limit of pedestrian overpasses, and one way that impedes dump trucks' hauling efficiency. A construction manager is expected to input origin and destination point in the user interface, and the system generates an efficient route that avoids bridges with weight limit or pedestrian overpasses with height limit. The system was applied to a real earthmoving project to test its applicability, and it was found that the system functions as intended.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.18 no.6
• /
• pp.75-82
• /
• 2018

In this paper, we consider a precoder design for downlink multiuser multiple-input multiple-output (MU-MIMO) in distributed antenna systems (DAS). In DAS, remote radio heads (RRHs) are placed at geographically different locations within a cell area. Three different precoder design schemes are proposed to maximize the separate or joint signal-to-leakage-plus-noise ratio (SLNR) metrics by considering RRH sum power or per-RRH power constraints. The analytical closed-form form solution for each optimization problem is presented. Through computer simulation, we show that the joint SLNR based precoding schemes have better signal-to-interference-plus-noise ratio (SINR) and bit error rate (BER) performances than the separate SLNR based schemes. Also, it is shown that the precoding scheme with RRH sum power constraint has better performance than the precoding scheme with per-RRH power constraint.

• Journal of Practical Agriculture & Fisheries Research
• /
• v.10 no.1
• /
• pp.29-41
• /
• 2008

This research was conducted to develop a technology transfer and farmer's extension of newly released technology of Bokto seeding method for crop and vegetable production based on the theory of Asian and Pacific Center for Transfer of Technology(APCTT). This technology has recently transferred to not only Korea but also other countries like North Korea, China, Japan, Taiwan, Russia and Africa(Cameroon, Sudan and South Africa) since 2005. It has known as a highly reduction of production cost in terms of labors, chemical fertilizer and pesticides as well as environmental friendly due to a deep and side banded placement of chemical fertilizer at basal application. In addition this technology was proven to a precision farming on sowing depth and mechanism of chemical application method and also highly resistant against disasters like typhoon, flooding, low temperature, drought and lodging due to silicate application. It has improved a constraints such as a poor seedling establishment, weed occurrence, lodging, low yield and poor grain and eating quality in the previous direct seeding methods but still have a problem in occurrence of weedy rice and ununiformed operation of wet or flooded soil condition. Also this technology has a limit in marketing and A/S system. Based on a theory of APCTT evaluation and analysis this technology may be more concentrated on establishment of a special cooperation team among researcher and scientists, extension workers, industry sections and governmental sectors in order to rapidly transfer this technology to farmer's field. Also there will be needed to operate a web site for this newly released technology to inform and exchange an idea, experiences and newly improved information. A feed back system might be operated in this technology as well to improve a technology under way on users' operation. Also user's manual will be internationally released and provided for farmer's instruction and training at field site.

• International conference on construction engineering and project management
• /
• 2022.06a
• /
• pp.304-311
• /
• 2022

Construction inspection is a crucial stage that ensures that all contractual requirements of a construction project are verified. The construction inspection capabilities among state highway agencies have been greatly affected due to budget reduction. As a result, efficient inspection practices such as risk-based inspection are required to optimize the use of limited resources without compromising inspection quality. Automated prioritization of textual requirements according to their criticality would be extremely helpful since contractual requirements are typically presented in an unstructured natural language in voluminous text documents. The current study introduces a novel model for predicting the risk level of requirements using machine learning (ML) algorithms. The ML algorithms tested in this study included naïve Bayes, support vector machines, logistic regression, and random forest. The training data includes sequences of requirement texts which were labeled with risk levels (such as very low, low, medium, high, very high) using the fuzzy logic systems. The fuzzy model treats the three risk factors (severity, probability, detectability) as fuzzy input variables, and implements the fuzzy inference rules to determine the labels of requirements. The performance of the model was examined on labeled dataset created by fuzzy inference rules and three different membership functions. The developed requirement risk prediction model yielded a precision, recall, and f-score of 78.18%, 77.75%, and 75.82%, respectively. The proposed model is expected to provide construction inspectors with a means for the automated prioritization of voluminous requirements by their importance, thus help to maximize the effectiveness of inspection activities under resource constraints.

• Proceedings of the Korean Society for Bioinformatics Conference
• /
• 2005.09a
• /
• pp.267-271
• /
• 2005

The goal of data mining is to extract new and useful knowledge from large scale datasets. As the amount of available data grows explosively, it became vitally important to develop faster data mining algorithms for various types of data. Recently, an interest in developing data mining algorithms that operate on graphs has been increased. Especially, mining frequent patterns from structured data such as graphs has been concerned by many research groups. A graph is a highly adaptable representation scheme that used in many domains including chemistry, bioinformatics and physics. For example, the chemical structure of a given substance can be modelled by an undirected labelled graph in which each node corresponds to an atom and each edge corresponds to a chemical bond between atoms. Internet can also be modelled as a directed graph in which each node corresponds to an web site and each edge corresponds to a hypertext link between web sites. Notably in bioinformatics area, various kinds of newly discovered data such as gene regulation networks or protein interaction networks could be modelled as graphs. There have been a number of attempts to find useful knowledge from these graph structured data. One of the most powerful analysis tool for graph structured data is frequent subgraph analysis. Recurring patterns in graph data can provide incomparable insights into that graph data. However, to find recurring subgraphs is extremely expensive in computational side. At the core of the problem, there are two computationally challenging problems. 1) Subgraph isomorphism and 2) Enumeration of subgraphs. Problems related to the former are subgraph isomorphism problem (Is graph A contains graph B?) and graph isomorphism problem(Are two graphs A and B the same or not?). Even these simplified versions of the subgraph mining problem are known to be NP-complete or Polymorphism-complete and no polynomial time algorithm has been existed so far. The later is also a difficult problem. We should generate all of 2$^n$ subgraphs if there is no constraint where n is the number of vertices of the input graph. In order to find frequent subgraphs from larger graph database, it is essential to give appropriate constraint to the subgraphs to find. Most of the current approaches are focus on the frequencies of a subgraph: the higher the frequency of a graph is, the more attentions should be given to that graph. Recently, several algorithms which use level by level approaches to find frequent subgraphs have been developed. Some of the recently emerging applications suggest that other constraints such as connectivity also could be useful in mining subgraphs : more strongly connected parts of a graph are more informative. If we restrict the set of subgraphs to mine to more strongly connected parts, its computational complexity could be decreased significantly. In this paper, we present an efficient algorithm to mine frequent subgraphs that are more strongly connected. Experimental study shows that the algorithm is scaling to larger graphs which have more than ten thousand vertices.

• Journal of Korea Water Resources Association
• /
• v.44 no.4
• /
• pp.295-304
• /
• 2011

For effective water quality management, it is necessary to secure reliable water quality information. There are many variables that need to be included in a comprehensive practical monitoring network : representative sampling locations, suitable sampling frequencies, water quality variable selection, and budgetary and logistical constraints are examples, especially sampling location is considered to be the most important issues. Until now, monitoring network design for water quality management was set according to the qualitative judgments, which is a problem of representativeness. In this paper, we propose network design system for optimal water quality monitoring using the scientific statistical techniques. Network design system is made based on the SAS program of version 9.2 and configured with simple input system and user friendly outputs considering the convenience of users. It applies to Excel data format for ease to use and all data of sampling location is distinguished to sheet base. In this system, time plots, dendrogram, and scatter plots are shown as follows: Time plots of water quality variables are graphed for identifying variables to classify sampling locations significantly. Similarities of sampling locations are calculated using euclidean distances of principal component variables and dimension coordinate of multidimensional scaling method are calculated and dendrogram by clustering analysis is represented and used for users to choose an appropriate number of clusters. Scatter plots of principle component variables are shown for clustering information with sampling locations and representative location.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1993.10a
• /
• pp.12-19
• /
• 1993

In general, the line balancing problem is defined as of finding an assignment of the given jobs to the workstations under the precedence constraints given to the set of jobs. Usually, the objective is either minimizing the cycle time under the given number of workstations or minimizing the number of workstations under the given cycle time. In this paper, we present a new type of an assembly line balancing problem which occurs in an electronics company manufacturing home appliances. The main difference of the problem compared to the general line balancing problem lies in the structure of the precedence given to the set of jobs. In the problem, the set of jobs is partitioned into two disjoint subjects. One is called the set of fixed jobs and the other, the set of floating jobs. The fixed jobs should be processed in the linear order and some pair of the jobs should not be assigned to the same workstations. Whereas, to each floating job, a set of ranges is given. The range is given in terms of two fixed jobs and it means that the floating job can be processed after the first job is processed and before the second job is processed. There can be more than one range associated to a floating job. We present a procedure to find an approximate solution to the problem. The procedure consists of two major parts. One is to find the assignment of the floating jobs under the given (feasible) assignment of the fixed jobs. The problem can be viewed as a constrained bin packing problem. The other is to find the assignment of the whole jobs under the given linear precedence on the set of the floating jobs. First problem is NP-hard and we devise a heuristic procedure to the problem based on the transportation problem and matching problem. The second problem can be solved in polynomial time by the shortest path method. The algorithm works in iterative manner. One step is composed of two phases. In the first phase, we solve the constrained bin packing problem. In the second phase, the shortest path problem is solved using the phase 1 result. The result of the phase 2 is used as an input to the phase 1 problem at the next step. We test the proposed algorithm on the set of real data found in the washing machine assembly line.

• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.46 no.8
• /
• pp.639-651
• /
• 2018

An analytical solution to generate attitude command profile for agile spacecraft is proposed. In realistic environment, obtaining analytical minimum-time optimal solution is very difficult because of following constraints-: 1) actuator saturation, 2) flexible mode excitation, 3) uplink command bandwidth limit. For that reasons, this paper applies two simplifications, an eigen-axis rotation and a finite-jerk approximated profile, to derive the solution in an analytical manner. The resulting attitude profile can be used as a feedforward or reference input to on-board attitude controller, and it can enhance spacecraft agility. Equations of attitude command profile are derived in two general boundary conditions: rest-to-rest maneuver and spin-to-spin maneuver. Simulation results demonstrate that the initial and final boundary conditions, in terms of time, attitude, and angular velocities, are well satisfied with the proposed analytical solution. The derived attitude command generation algorithm may be used to minimize a number of parameters to be uploaded to spacecraft or to automate a sequence of attitude command generation on-board.

• The Journal of the Korea Contents Association
• /
• v.9 no.5
• /
• pp.61-75
• /
• 2009

Generally, the development of the database application includes the requirement analysis phase of creating ERD (Entity Relationship Diagram) and process models, coding, and testing. From the above phases, the analysis phase is not most formalized. It is usually hard task because (1) customers don't know the details of the desired system; (2) developers can't with ease understand the business logic of the customers; (3) the outcomes of the analysis, which are ERD and process models, are not easy to understand to the customers. This paper propose that the executional forms, which are better to understand the systems, should be presented to the customers instead of the ERD. These forms should accept the data input so that customers can review the various aspects of the outcome models. The developers should be able to instantly implement the business logic and also should be able to visually demonstrate the logic in order to get the details of it. For this goal, the customer supplied business logic should be able to be implemented by the references between forms, actions, constraints from the perspective of the data flow. The customers try to execute the forms implementing the business logic and review their supplied logic find new necessary business logic of their own. Iterating these processes for the requirement analysis would result in the success of the analysis which is sufficiently detailed without conflicts.