• Journal of KIISE:Databases
• /
• v.27 no.1
• /
• pp.13-21
• /
• 2000

Online analytical processing (OLAP) systems are introduced to support decision support systems. Many researches focussed on efficient processing of aggregate functions that usually occur in OLAP queries. However, most previous researches in the literature are deal with the situation in which aggregate functions arc applied to all the values in a given range. Since those approaches utilize characteristic of aggregate functions applied to a range, they are difficult to be applied to a muitipoint query that is a query considering only some points in a given range. In this paper, we propose the Ranking Index and the flanking Decision Tree (RDT) for efficient evaluation of multipoints MAX/MIN queries. The ranking of possible MAX/MIN values are computed with RDT Then MAX/MIN values can be acquired from the Ranking Index. We show through experiments that our method provides high performance in most situations. In other words, the proposed method is robust as well as efficient. A single common set of precomputed results for both MAX and MIN values is another advantage of the proposed method.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.13 no.5
• /
• pp.2030-2037
• /
• 2012

The purpose of this research is to suggest a model or method of needs analysis for designing syllabuses. As the learner-centered approach in teaching and learning methods becomes general, the learners' needs or wants should be reflected on the syllabus design. However, standardized scores in the previous research have disadvantages to be distorted in data interpretations because the difference between the maximum value and minimum value is so big compared to the Likert 5 scales. To solve this disadvantage, the Max-Min method is used in the needs analysis for the syllabus design. So, the differences are presented. Needs analyses need to be selected variously according to situations. Thus, further researches are needed to develop several new methods as well as the Max-Min method or the standardized score method for the whole needs analyses.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.21 no.47
• /
• pp.1-10
• /
• 1998

Testing high reliability devices under nomal operating condition is difficult, because the devices are not likely to fail in the relatively short time available for tests. For most applications it is necessary to accelerate the causes of failure by increasing a stress above its nomal value. Previous accelerated life test(ALT) plans have shown how to find optimum allocation, lowest stress and sample size subject to minimizing the variance of mean life estimator. In these ALT plans, the highest acceptable test-stress was assumed to be specified in advance by the experimenter but there is no guidance for selecting it. This assumption is, however, inappropriate for many applications. Testing devices at too-high stress levels can invalidate the extrapolation model, or introduce failure mechanisms that are not anticipated under nomal operating conditions. In this paper, we propose new 4:2:1 compromise plans using Min-Max method to minimize this risk and present minimized test-stress levels(max, middle, min), and find sample allocation based on Min-Max 4:2:1 compromise plans. In result, we compare previous 4:2:1 compromise plans specified maximum test-stress with Min-Max 4:2:1 compromise plans minimized maximum test-stress.

• 한국전산유체공학회:학술대회논문집
• /
• 2009.04a
• /
• pp.269-276
• /
• 2009

The local preconditioning method has both robust convergence and accurate solutions by using local flow properties for parameters in the preconditioning matrix. Preconditioning methods have been very effective to low speed inviscid flows. In the viscous and turbulent flows, deterioration of convergence should be overcame on the high aspect ratio grids to get better convergence and accuracy. In the present study, the local time stepping and min-CFL/max-VNN definitions are applied to compare the results and we propose the method that switches between two methods. The min-CFL definition is applied for inviscid flow problems and the min-CFL/max-VNN definition is implemented to viscous and turbulent flow problems.

• Journal of the Korea Society of Computer and Information
• /
• v.12 no.2 s.46
• /
• pp.77-82
• /
• 2007

In this paper, we proposed the image processing techniques for extracting the cracks in a concrete surface crack image and the enhanced Max-Min neural network for recognizing the directions of the extracted cracks. The image processing techniques used are the closing operation or morphological techniques, the Sobel masking for extracting for edges of the cracks, and the iterated binarization for acquiring the binarized image from the crack image. The cracks are extracted from the concrete surface image after applying two times of noise reduction to the binarized image. We proposed the method for automatically recognizing the directions of the cracks with the enhanced Max-Min neural network. Also, we propose an enhanced Max-Min neural network by auto-tuning of learning rate using delta-bar-delta algorithm. The experiments using real concrete crack images showed that the cracks in the concrete crack images were effectively extracted and the enhanced Max-Min neural network was effective in the recognition of direction of the extracted cracks.

• Journal of the Korea Society of Computer and Information
• /
• v.17 no.10
• /
• pp.155-165
• /
• 2012

This paper suggests traveling salesman problem algorithm that have been unsolved problem with NP-Hard. The proposed algorithm is a heuristic with edge-swap method. The classical method finds the initial solution starts with first node and visits to mostly adjacent nodes then decides the traveling path. This paper selects minimum weight edge for each nodes, then perform Min-Min method that start from minimum weight edge among the selected edges and Min-Max method that starts from maximum weight edges among it. Then we decide tie initial solution to minimum path length between Min-Min and Min-Max method. To get the final optimal solution, we apply previous two-opt to initial solution. Also, we suggest extended 3-opt and 4-opt additionally. For the 7 actual experimental data, this algorithm can be get the optimal solutions of state-of-the-art with fast and correct.

• The Korean Journal of Nuclear Medicine Technology
• /
• v.18 no.2
• /
• pp.8-16
• /
• 2014

Purpose The quantitative analysis of gallbladder emptying is very important in diagnosis of motility disorder of gallbladder and in biliary physiology. The GBEF obtain the statics aquisition method or the dynamic acquisition method in two ways. The purpose of this study is to compare the GBEF value of statics acquisition method and the dynamic acquisition method. And we find the best way for calculate GBEF. Materials and Methods The quantitative hepatobiliary scan with $^{99m}Tc$-mebrofenin was performed of 27 patients. Initial images were acquired statically, for 60 min after injection of the radioactive tracer. And if the gallbladder is visualized to 60 min, performed stimulation of gallbladder (1egg, 200 mL milk). After that, started acquisition of dynamic image for 30 min. After that, image of after fatty meal of the statics method were acquired on equal terms with 60 min image. The statics GBEF was calculated using the images of before fatty meal and post fatty meal by the statics method. The dynamic GBEF was calculated using the images of time of maximum bile juice uptake ($T_{max}$) and time of minimum bile juice uptake ($T_{min}$) images from the gallbladder time-activity curve. A bile juice is secreted from gallbladder while eating a fatty meal. that is named early GBEF and that was calculated using before fatty meal image of the statics method and 1 min image of the dynamic method. Results The result saw very big difference between two according to $T_{max}$. The result, were as follows. 1) In case of less than 1 min, the dynamic mean GBEF was $40.1{\pm}21.7%$, the statics mean GBEF was $51.5{\pm}23.6%$ in 16 cases. The early mean GBEF was $14.0{\pm}29.1%$. The GBEF of statics method was higher because that include secreted bile juice while performed stimulation of gallbladder. A difference of GB counts according to acquisition method and the early bile juice counts was $17.6{\pm}14.8%$ and $13.5{\pm}15.3%$. 2) In case of exceed than 1 min, the dynamic mean GBEF was $31.0{\pm}19.7%$, the statics mean GBEF was $21.3{\pm}19.4%$ in 7 cases. The early GBEF was $-6.9{\pm}4.9%$. The GBEF of dynamic method was higher because that include concentrated bile juice to $T_{max}$. A difference of GB counts according to acquisition method and the early bile juice counts was $14.3{\pm}7.3%$ and $5.9{\pm}3.9%$. Conclusion The statics method is very easy and simple, but in case of $T_{max}$ delay, the GBEF can be lower. The dynamic method is able to calculate accurately in case of $T_{max}$ delay, but in case of $T_{max}$ is less than 1 min, the GBEF can be lower because dynamic GBEF exclude secreted bile juice while performed stimulation of gallbladder. The best way to calculate GBEF is to scan with dynamic method preferentially and to choose suitable method between the two way after conform $T_{max}$ on the T-A curve of the dynamic method.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2022.11a
• /
• pp.79-81
• /
• 2022

MPEG-VCM(Video Coding for Machines)에서는 머신비전(machine vision) 네트워크의 백본(backbone)에서 추출된 이미지/비디오 특징 압축을 위한 표준화를 진행하고 있다. 현재 VCM 표준기술 탐색 과정에서 가장 좋은 압축 성능을 보이는 MSFC(Multi-Scale Feature compression) 기반 압축 네트워크 모델은 추출된 멀티-스케일 특징을 단일-스케일 특징으로 변환하여 특징맵으로 구성하고 이를 VVC 로 압축한다. 본 논문에서는 MSFC 기반 압축 모델에서 Min-Max 값 시그널링을 제외한 최소-최대(Min-Max) 정규화를 포함한 개선된 특징맵 생성 기법을 제시한다. 즉, 제안기법은 VCM 디코더에서의 특징맵 복원을 위한 Min-Max 값을 학습 기반으로 생성함으로써 Min-Max 시그널링의 비트 오버헤드 절감뿐만 아니라 별도의 시그널링 기제를 생략한 보다 단순한 전송 비트스트림 구성을 가능하게 한다. 실험결과 제안기법은 이미지 앵커(Anchor) 대비 BPP-mAP 성능에서 83.24% BD-rate 이득을 보이며, 이는 기존 MSFC 보다 1.74%정도 다소 떨어지지만 별도의 Min-Max 시그널링 없이도 기존의 성능을 유지할 수 있음을 보인다.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.15 no.7
• /
• pp.1457-1464
• /
• 2011

In this paper, we go one step further in that the number of competitive layers is not determined by experience but can be determined by fuzzy control rules based on input pattern information. In our method, we design a set of membership functions and corresponding rules and used Max-Min reasoning proposed by Mamdani. Also, we use centroid method as a defuzzification. In experiment that has various patterns of English inputs, this new method works beautifully to determine the number of competitive layers and also efficient in overall accuracy as a result.

• 제어로봇시스템학회:학술대회논문집
• /
• 2001.10a
• /
• pp.106.2-106
• /
• 2001

The two typical composite operations of fuzzy relation are the max-min and the min-max composite operations. It is known that the two operations can be completely dual. This paper pays attention to the nature that these two typical operations are completely dual and investigates the correlation between the max-min composite relation equation and the min-max composite relation equation. An important scheme of correlation is in the characteristic of solution sets derived from these two fuzzy relation equations. The paper explains that one of the composite fuzzy relation equations is solvable using the solution method of the other fuzzy relation equation. The above-mentioned duality plays an important role in this solution procedure. Since it is not necessary to build the solution method separately like before, calculation efficiency can be raised. Moreover, the solution for the relation ...