• Journal of the Korean Institute of Landscape Architecture
• /
• v.32 no.1
• /
• pp.23-32
• /
• 2004

This study aims to examine constraints on visits to urban community parks and to find ways to elevate the efficient use of parks. To achieve this, the study relied on empirical study method and the descriptive method; additionally, present condition survey was performed with a user interview, on the assumption that a park visit is a form of leisure. As a result, the item of 'insufficient lighting facilities' shows the highest mean and the item of 'low quality of park' follows Previous research also revealed that the item of 'the lack of lighting facilities' is a major factor on user dissatisfaction, so a design and management program for night time users are fully researched and elaborately accomplished. Also, the high response of 'low quality of park' shows that the park supply policy in Korea focusses mainly on quantity so far, and it shows that user's dissatisfaction for park facilities becomes one of the major constraints of park visit. The factor analysis, on the object of 35 items except 2 items, appeared 5 factors: accessibility, inner discord, companion, family matters, park-itself-matters. Oneway Anova test showed that 4 factors except 'park-itself-matters' have reliable difference in constraint cognition by age and education. The visit constraint of 'park-itself-matters' did not appear different by any personal characteristics. Without regard to personal characteristics, it is regarded that this factor has the greatest effect upon park visits. In general, people who are disadvantaged strongly cognize constraints even in leisure such as a park visit, which is a simple and inexpensive leisure activity. Therefore, a park like a pocket park, which is small but located in a neighborhood, is more needed than a central park like a symbolic and huge park in every new city. Careful concern for night activity should be accomplished in the planning process.

• Journal of Korean Society of Transportation
• /
• v.24 no.3 s.89
• /
• pp.7-15
• /
• 2006

A large sample can Provide more information about the Population. As the sample size Increases, analysts will be more confident about the survey results. On the other hand, the costs for survey will increase in time and manpower. Therefore, determination of the sample size is a trade-off between the required accuracy and the cost. In addition, permitted error and significance level should be considered. Sample size determination in surveys for O/D estimation is also connected with confidence of survey result. However, the past methods were usually too simple to consider confidence. Therefore, a new method for O/D surveys was Proposed and it was accurate enough, but it has too large sample size when we have current budget constraint. In this research, several minimum sample size determination methods for origin-destination survey under budget constraint were proposed. Each method decreased sample size, but has its own advantages. Selection of the sample size will depend on the study Purpose and budget constraint.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.16 no.3
• /
• pp.571-578
• /
• 2012

In this paper, we propose two main points. The first is the constraint for logic synthesis, and the second is an efficient logic synthesis method. Logic synthesis is a process to obtain the gate-level netlist from RTL (register transfer level) codes using logic mapping and optimization with the specified constraints. The result of logic synthesis is tightly dependent on constraint and logic synthesis method. Since the size and timing can be dramatically changed by these, we should precisely consider them. In this paper, we present the considering items in the process of logic synthesis by using our experience and experimental results. The proposed techniques was applied to a circuit with the hardware resource of about 650K gates. The synthesis time for the hybrid method was reduced by 47% comparing the bottom-up method and It has better timing property about slack than top-down method.

• Journal of the Korea Society of Computer and Information
• /
• v.13 no.2
• /
• pp.51-57
• /
• 2008

We present a modeling of constraint satisfaction problems and provide heuristic algorithms of backtracking search to optimize the frequency assignment. Our research objective is to find a frequency assignment that satisfies all the constraints using minimum number of frequencies while maximizing the number of community radio stations served for a given area. In order to get a effective solution, some ordering heuristics such as variable orderings and value orderings are provided to minimize the backtracking in finding all solutions within a limited time. To complement the late detection of inconsistency in the backtracking, we provide the consistency enforcing technique or constraint propagation to eliminate the values that are inconsistent with some constraints. By integrating backtracking search algorithms with consistency enforcing techniques, it is possible to obtain more powerful and effective algorithms of constraint satisfaction problems. We also provide the performance evaluation of proposed algorithms by comparing the theoretical lower bound and our computed solution.

• Journal of the Korea Society of Computer and Information
• /
• v.15 no.9
• /
• pp.47-55
• /
• 2010

Linear constraint satisfaction optimization problem is a kind of combinatorial optimization problem involving linearly expressed objective function and complex constraints. Integer programming is known as a very effective technique for such problem but require very much time and memory until finding a suboptimal solution. In this paper, we propose a method to improve the search performance by integrating local search and integer programming. Basically, simple hill-climbing search, which is the simplest form of local search, is used to solve the given problem and integer programming is applied to generate a neighbor solution. In addition, constraint programming is used to generate an initial solution. Through the experimental results using N-Queens maximization problems, we confirmed that the proposed method can produce far better solutions than any other search methods.

• International Journal of Naval Architecture and Ocean Engineering
• /
• v.9 no.3
• /
• pp.315-325
• /
• 2017

The design dimension may not be satisfactory at the final stage due to the welding during the assembly stage, leading to cutting or adding the components in large structure constructions. The productivity is depend on accuracy of the welding quality especially at assembly stage. Therefore, it is of utmost importance to decide the component dimension during each assembly stage considering the above situations during the designing stage by exactly predicting welding deformation before the welding is done. Further, if the system that predicts whether welding deformation is equipped, it is possible to take measures to reduce deformation through FE analysis, helping in saving time for correcting work by arresting the parts which are prone to having welding deformation. For the FE analysis to predict the deformation of a large steel structure, calculation time, modeling, constraints in each assembly stage and critical welding length have to be considered. In case of fillet welding deformation, around 300 mm is sufficient as a critical welding length of the specimen as proposed by the existing researches. However, the critical length in case of butt welding is around 1000 mm, which is far longer than that suggested in the existing researches. For the external constraint, which occurs as the geometry of structure is changed according to the assembly stage, constraint factor is drawn from the elastic FE analysis and test results, and the magnitude of equivalent force according to constraint is decided. The comparison study for the elastic FE analysis result and measurement for the large steel structure based on the above results reveals that the analysis results are in the range of 80-118% against measurement values, both matching each other well. Further, the deformation of fillet welding in the main plate among the total block occupies 66-89%, making welding deformation in the main plate far larger than the welding deformation in the longitudinal and transverse girders.

• Journal of Navigation and Port Research
• /
• v.27 no.4
• /
• pp.397-402
• /
• 2003

Generally, container arrangement has been carried out based on the Classification guidelines. However, guidelines provide only container securing forces for the given container arrangement and Classification requirements of the forces. In order to design container arrangement additional information is needed such as container securing forces and arrangement that accounts for lashing bridges, vertical lashing, vertical center of gravity (VCG), and maximum stack weight. Trial and error method using the existing guidelines requires excessive amount of calculation time and cannot provide accurate results of the calculations. In order to fulfill this need, a new container securing system has been established based on the equilibrium conditions that include lashing bridges and vertical lashing. An optimization algorithm has been developed for the new system since current optimization methods such as genetic algorithms and evolution strategies are unsuitable for the container securing problems, which involve equality constraint. Design variables are container weights of tier and objective function is either total container weight or VCG of a stack. The newly developed system provides optimum arrangement of containers for both maximum stack weight and maximum VCG. It also greatly reduces time for designing container arrangement.

• Journal of the Korea Society of Computer and Information
• /
• v.4 no.3
• /
• pp.35-46
• /
• 1999

In this paper, we propose a new CPLD technology mapping algorithm improving run-time under time constraint. In our technology mapping algorithm. a given logic equation is constructed as the DAG type. then the DAG is reconstructed by replicating the node that outdegree is more than or equal to 2. As a result, it makes delay time and the number of CLBs, run-time to be minimized. Also. after the number of multi-level is defined and cost of each nodes is calculated, the graph is partitioned in order to fit to k that is the number of OR term within Cl.B. The partitioned nodes are merged through collapsing and bin packing is performed in order to fit to the number of OR term within CLB. In the results of experiments to MCNC circuits for logic synthesis benchmark, we can shows that proposed technology mapping algorithm reduces run-time much more than the TMCPLD.

• Proceedings of the Korean Information Science Society Conference
• /
• 2007.06a
• /
• pp.5-6
• /
• 2007

• 제어로봇시스템학회:학술대회논문집
• /
• 1990.10b
• /
• pp.868-871
• /
• 1990

We derive an intelgral-type constraint on the complementary sensitivity function in digital control systems. Some design guidances are proposed for the pole assignment of digital controller with computation-time delay to improve the complementary sensitivity characteristics.