• Journal of Korea Multimedia Society
• /
• v.12 no.5
• /
• pp.767-776
• /
• 2009

The purpose of this paper is to design, implement and test the automatic marking system for programming languages using key-words and boolean operations to solve the processing problems of natural languages. There are accurate grammar systems and key-words in programming languages. Using these characteristics, We have designed, programmed, and tested automatic marking system for programming languages through key-words and boolean operations in this paper. We have categorized programming languages into 7 types as the type of answer and when a professor input any key-words, the system make him put conjunction with the special character. It can be logical expressions instantly so that the system easily operates. We asked 10 students who are majoring in computer engineering to take a test on the paper and web to show how well automatic marking system that we have programmed works. Then We requested 3 professors if the subject problems marked objectively. As a result, automatic marking system proved to be appropriate. We have proposed the way of using key-words and boolean operation for prohibiting huge natural language processing in marking of subjective question. It promotes efficiency rate of programming, objectivity and speed through the transferal to the web for marking since the system prohibits marker to include personal opinion on marking and gives feedback quickly

• Journal of the Korea Computer Graphics Society
• /
• v.4 no.1
• /
• pp.11-19
• /
• 1998

Non-manifold topological operations such as Euler and Boolean operations provide a versatile environment for modeling domains. The implementation of these operations raises geometrical issues that need to be addressed to ensure the topological validity of the underlying model, and they uses the glue operation which provides a basic method to modify the topology of non-manifold models when vertices, edges and faces are contacting each other. Topological information such as adjacency relationships should be inferred when gluing non-manifold models. Two methods of reasoning can be employed to find the topological information : topological reasoning and geometrical reasoning. The topological method can infer the adjacency relationships by using stored topological information. On the other hand, the geometrical method can find topological ambiguities by considering the geometrical shape at the local area of gluing when the topological relations were not stored. This paper describes the geometrical reasoning method.

• Proceedings of the KSME Conference
• /
• 2007.05a
• /
• pp.1338-1343
• /
• 2007

High-efficient machining, which means cutting a part in the least amount of time, is the most effective tool to improve productivity. In this study, a new feed optimization method based on the cutting power regulation was proposed to realize the high-efficient machining in turning process. The cutting area was evaluated by using the Boolean intersection operation between the cutting tool and workpiece. And the cutting force and power were predicted from the cutting parameters such as feed, depth of cut, spindle speed, specific cutting force, and so on. Especially, the reliability of the proposed optimization method was validated by comparing the predicted and measured cutting forces. The simulation results showed that the proposed optimization method could effectively enhance the productivity in turning process.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.31 no.9
• /
• pp.960-966
• /
• 2007

High-efficient machining, which means to machine a part in the least amount of time, is the most effective tool to improve productivity. In this study, a new feed optimization method based on virtual manufacturing was proposed to realize the high-efficient machining in turning process through the cutting power regulation. The cutting area was evaluated by using the Boolean intersection operation between the cutting tool and workpiece. And the cutting force and power were predicted from the cutting parameters such as feed, depth of cut, spindle speed, specific cutting force, and so on. Especially, the reliability of the proposed optimization method was validated by comparing the predicted and measured cutting forces. The simulation results showed that the proposed optimization method could effectively enhance the productivity in turning process.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 2006.05a
• /
• pp.453-454
• /
• 2006

This paper describes a processing verification technique for developing about end-milling cutters. Developed software is processing verification module for manufacturing. By using cutting simulation method, we can obtain center points of finding wheel via Boolean operation between a grinding wheel and a cylindrical workpiece. The obtained CL data can be used for calculating NC data. After then, we can simulate by using designed grinding machine and NC data. This research has been implemented on a commercial CAD system by using the API function programming. The operator can evaluate the cutting simulation process and reduce the time of design and manufacturing.

• Journal of Ship and Ocean Technology
• /
• v.9 no.1
• /
• pp.47-63
• /
• 2005

In the present study, we suggest a new method for designing complex ship hull forms with multiple domain B-spline surfaces accounting for their topological arrangement, where all subdomains are fully defined in terms of form parameters, e.g., positional, differential and integral descriptors. For the construction of complex hull forms, free-form elementary models such as forebody, afterbody and bulbs are united by Boolean operation and blending surfaces in compliance with the sectional area curve (SAC) of the whole ship. This new design process in this paper is called Sectional Area Curve-Balanced Parametric Design (SAC-BPD).

• Journal of Applied Reliability
• /
• v.8 no.4
• /
• pp.181-192
• /
• 2008

In this paper, we proposed effective algorithm that do Availability of communication network account using total probability formula. Use path tracing method about PSTN linked with MSC in WCDMA considering occasion that do not consider mobility of terminal and Availability did account. First, express minimum path series gathering by structure function after network that do modeling by stochastic graph for communication network saves all minimal path sets between particular two abutments and we gain Availability value in angular variable after express structure function by Boolean operation form and Availability between two abutments did account.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2012.11a
• /
• pp.1009-1012
• /
• 2012

프록시 재암호화 기법이란 위임하는 사람의 공개키로 암호화된 암호문을 신뢰기관의 도움 없이 위임 받는 사람의 개인키로 복호화할 수 있도록 변환하는 기법이다. 이후 특정 조건을 만족하는 사용자만 복호화할 수 있도록 하기 위해 조건부 프록시 재암호화 기법이 제안되었다. 2009 년 Weng 등에 의해 조건부 프록시 재암호화 기법이 제안된 이래 조건에 대해 Boolean 연산자를 모두 지원하는 방법은 아직까지 Open Problem 으로 남아있다. 현재 AND 연산에 대해서는 기존의 기법을 확장하여 지원할 수 있으나 OR, NOT 등에 대해서는 아직 제안되지 않았다. 본 논문에서는 기존의 기법을 확장하여 AND 연산과 함께 OR 연산도 지원할 수 있는 조건부 프록시 재암호화 기법을 제안한다

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.23 no.2
• /
• pp.197-205
• /
• 1986

In this paper, we present an efficient test algorithm for data processing function of MC68000 \ulcorner. The test vector for functional testing is determined by stuck-at, coupling and transition fault for data storage and transfer. But for data manipulation it is determined by a boolean function of micro-operation. This test algorithm is composed of 3 parts, choosing optimum test instructions for maximizing fault coverage and minimizing test process time, deciding the test order for minimizing test ambiguity, and processing the actual test.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.5 no.4
• /
• pp.1-8
• /
• 1968

A TANT network is a three-level network composed solely of NAND gates having only true(i.e. uncomplemented) inputs. The paper presents a technique for finding for any given Boolean function a least-cost TANT network. The first step of the technique is to determine essential prime implicants(EPI) by Quine-McCluskey procedure or other methods and generate prime implicants(PI) hving the same head as any one of EPI by consensus operation. The second step is to select common factors among the usable tail factors. The selcetion phase is analogous to the use of C-C table. The last step is to minimize inputs by deleting the redundant PI. the technique permits hand solution of typical five-and six-variable problems.