• 한국컴퓨터정보학회논문지
• /
• 제22권3호
• /
• pp.81-88
• /
• 2017

In this paper, we classified the weaknesses of C/C++ programs listed in CWE based on the diagnostic information produced at each stage of program compilation. Our classification identifies which stages should be responsible for analyzing the weaknesses. We also present algorithmic frameworks for detecting typical weaknesses belonging to the classes to demonstrate validness of our scheme. For the weaknesses that cannot be analyzed by using the diagnostic information, we separated them as a group that are often detectable by the analyses that simulate program execution, for instance, symbolic execution and abstract interpretation. We expect that classification of weaknesses, and diagnostic information accordingly, would contribute to systematic development of static analyzers that minimizes false positives and negatives.

• 전자공학회논문지A
• /
• 제33A권11호
• /
• pp.128-139
• /
• 1996

In this paper, we propose an algorithm to solve the problem of placement of rectangular blocks whose sizes and shpaes are pre-determined. The proposed method solves the placement of many retangular blocks of different sizes and shapes in a hierarchical manner, so as to minimize the chip area. The placement problem is divided into several sub-problems: hierarchical partioning, hierarchical area/shape estimation, hierarchical pattern pacement, overlap removal, and module rotation. After the circuit is recursively partitioned to build a hierarchy tree, the necessary wiring area and module shpaes are estimated using the resutls of the partitioning and the pin information before the placement is performed. The placement templaes are defined to represent the relative positions of the modules. The area and the connectivity are optimized separately at each level of hierachy using the placement templates, so the minimization of chip area and wire length can be achieved in a short execution time. Experiments are made on the MCNC building block benchmark circuits and the results are compared with those of other published methods. The proposed technique is shown to produce good figures in tems of execution time and chip area.

• International journal of advanced smart convergence
• /
• 제7권3호
• /
• pp.92-100
• /
• 2018

In this paper, we propose a fault-tolerant scheduling scheme with energy efficiency for real-time periodic tasks on DVFS-enabled multicore processors. The scheme provides the tolerance of a permanent fault with the primary-backup task model. Also the scheme reduces the energy consumption of real-time tasks with the fully overlapped execution between each primary task and its backup task, whereas most of previous methods tried to minimize the overlapped execution between the two tasks. In order to the leakage energy loss of idle cores, the scheme activates a part of available cores with rarely used cores powered off. Evaluation results show that the proposed scheme saves up to 82% energy consumption of the previous method.

• 한국CDE학회논문집
• /
• 제3권4호
• /
• pp.211-222
• /
• 1998

Parametric design is an important modeling paradigm in CAD/CAM applications, enabling efficient design modifications and variations. One of the major issues in parametric design is to develop a geometric constraint solver that can handle a large set of geometric configurations efficiently and robustly. In this appear, we propose a new approach to geometric constraint solving that employs a graph-based method to solve the ruler-and-compass constructible configurations and a numerical method to solve the ruler-and-compass non-constructible configurations, in a way that combines the advantages of both methods. The geometric constraint solving process consists of two phases: 1) planning phase and 2) execution phase. In the planning phase, a sequence of construction steps is generated by clustering the constrained geometric entities and reducing the constraint graph in sequence. in the execution phase, each construction step is evaluated to determine the geometric entities, using both approaches. By combining the advantages of the graph-based constructive approach with the universality of the numerical approach, the proposed approach can maximize the efficiency, robustness, and extensibility of geometric constraint solver.

• Journal of information and communication convergence engineering
• /
• 제5권3호
• /
• pp.239-244
• /
• 2007

In the telematics system, a reasonable path search time should be guaranteed from a great number of user's queries, even though the optimal path with minimized travel time might be continuously changed by the traffic flows. Thus, the path search method should consider traffic flows of the roads and the search time as well. However, the existing path search methods are not able to cope efficiently with the change of the traffic flows and to search rapidly paths simultaneously. This paper proposes a new path search method for fast computation. It also reflects the traffic flows efficiently. Especially, in order to simplify the computation of variable heuristic values, it employs a simplification method for estimating values of traffic-adaptable heuristics. The experiments are carried out with the $A^*$ algorithm and the proposed method in terms of the execution time, the number of node accesses and the accuracy. The results obtained from the experiments show that the method achieves very fast execution time and the reasonable accuracy as well.

• 한국멀티미디어학회논문지
• /
• 제24권3호
• /
• pp.481-493
• /
• 2021

Regional brands are recognized for their importance as one of the local public relations policies, but only the methods promoted by local government officials and outside experts are revealing limitations in self-reliance and sustainability. In order for a regional brand to succeed, it is necessary to develop and manage a brand that fits the characteristics of the region together with various stakeholders including residents. In this study, it was confirmed that regional brand evaluation indicators may vary depending on the stage of co-creation in the design process for regional brand development, and the type of value co-creation was determined through a classification method using the results of the evaluation index. According to the results of the study, the type of value co-creation that fits the local situation and characteristics can be derived by adjusting the stage of co-creation execution in the design process.

• 대한전자공학회논문지
• /
• 제23권3호
• /
• pp.357-363
• /
• 1986

In the design of PLA's of VLSI, as the number of subsets of functions from which common preme implicants must be determined increases, the execution time increases by a factor of O(2\ulcorner. When the number of functions N is a large number, this poses a serious problem in minumization of multiple-output logic functions. In this paper a new algorithm that minimizes multiple-output logic functions is proposed. The algorithm requires less number of Fortran statements, less execution time, and less memory area than existing methods. The bases of this algorithm are explained and verified, and the sequential operation for preparation of the program is discussed.

• 말소리와 음성과학
• /
• 제7권4호
• /
• pp.93-99
• /
• 2015

In case of PAS test, the air is sometimes leaked although the mask is tightly attached to the face, which is not reliable on the measured values. Therefore, this study aimed to assist the clinical practice suggesting the test method of PAS without air leakage. In the healthy subjects with 12 males and 12 females over 19 years old, three types of tests were performed on the voicing efficiency among the protocol of PAS Model 6600. They are; first, to attach the mask tightly to the face holding the handle of PAS with the subject's two hands (Method 1); second, to attach the mask tightly to the face holding the handle of PAS with the subject's one hand and pushing the body of PAS strongly with the other hand (Method 2); and third, to attach the mask tightly to the face pushing the upper part of the mask by the tester when the subject attached the mask to his or her face holding the handle of PAS with two hands (Method 3). Upon the study analyses, the mean negative pressure, the mean phonogram, subglottic air pressure, and voicing efficiency were shown to be statistically significantly different during PAS test in males depending on the methods. (p<.05) In case of females, only the target airflow rate showed significant difference depending on the methods during PAS test. (p<.001) In conclusion, Method 2 enhanced the noise level and strength while Method 1 was likely to leak the air more compared to the other two methods in males. In case of females, Method 1 showed significant leakage of the air flow. Not to allow the air flow leakage without affecting the outcome of PAS test, it will be the most useful for the tester to push the mask to the subject's face tightly (Method 3).

• 한국통신학회논문지
• /
• 제37권7A호
• /
• pp.586-599
• /
• 2012

본 논문에서는 RGB영상과 깊이영상을 사용하여 얼굴검출 및 추적을 고속으로 수행할 수 있는 방법을 제안한다. 이 방법은 얼굴검출 과정과 얼굴추적 과정으로 구성되며, 얼굴검출 과정은 기본적으로 기존의 Adaboost 방법을 사용하나, 깊이영상을 사용하여 탐색영역을 축소한다. 얼굴추적은 템플릿 매칭방법을 사용하며, 조기종료 기법을 사용하여 수행시간을 줄였다. 이 방법들을 구현하여 실험한 결과, 얼굴검출 방법은 기존의 방법에 비해 약 39%의 수행시간을 보였으며, 얼굴추적 방법은 $640{\times}480$ 해상도의 프레임 당 2.48ms의 추적시간을 보였다. 또한 검출율에 있어서도 제안한 얼굴검출 방법은 기존의 방법에 비해 약간 낮은 검출률을 보였으나, 얼굴로 인식하였지만 실제로는 얼굴이 아닌 경우의 오검출률에 있어서는 기존방법의 약 38% 향상된 성능을 보였다. 또한 얼굴추적 방법은 추적시간과 추적 정확도에 있어서 상보적인 관계를 가지며, 특별한 경우를 제외한 모든 경우에서 약 1%의 낮은 추적오차율을 보였다. 따라서 제안한 얼굴검출 및 추적방법은 각각 또는 결합하여 고속 동작과 높은 정확도를 필요로 하는 응용분야에 사용될 수 있을 것으로 기대된다.

• 대한수학회보
• /
• 제53권5호
• /
• pp.1439-1446
• /
• 2016

The execution complexities of the major time memory data tradeoff methods are analyzed in this paper. The multi-target tradeoffs covered are the classical Hellman, distinguished point, and fuzzy rainbow methods, both in their non-perfect and perfect table versions for the latter two methods. We show that their computational complexities are identical to those of the corresponding single-target methods executed under certain matching parameters and conclude that the perfect table fuzzy rainbow tradeoff method is most preferable.