• Journal of Positioning, Navigation, and Timing
• /
• v.10 no.2
• /
• pp.145-151
• /
• 2021

According to the Korea Augmentation Satellite System (KASS) system milestone, Site Acceptance Test (SAT) has three steps test until the end of the project. SAT#1 is the first time of SAT steps and verify the KASS Reference Station (KRS) and Sub System (S/S) for the monitoring and controllable. After the equipment and software were installed at the Mission Control Center (MCC) with Central Monitoring and Control Simulator (CMS) for the SAT#1, the 1:1 test was progressed when the KRS and S/S are ready to test. SAT#1 has a 10 steps test case and it was progressed each KRS sites. The test was finished throughout the real-time monitoring and the data collection including the data analysis all of the 7 KRS sites. Finally SAT#1 was completed on December 2020 with successfully.

• Journal of KIISE:Software and Applications
• /
• v.34 no.7
• /
• pp.616-624
• /
• 2007

Sudoku can be regarded as a SAT problem. Various encodings are known for encoding Sudoku as a Conjunctive Normal Form (CNF) formula, which is the standard input for most SAT solvers. Using these encodings for large Sudoku, however, generates too many clauses, which impede the performance of state-of-the-art SAT solvers. This paper presents an optimized CNF encodings of Sudoku to deal with large instances of the puzzle. We use fixed cells in Sudoku to remove redundant clauses during the encoding phase. This results in reducing the number of clauses and a significant speedup in the SAT solving time.

• Journal of Astronomy and Space Sciences
• /
• v.32 no.3
• /
• pp.257-268
• /
• 2015

Characteristics of delta-V requirements for deploying an impactor from a mother-ship at different orbital altitudes are analyzed in order to prepare for a future lunar CubeSat impactor mission. A mother-ship is assumed to be orbiting the moon with a circular orbit at a 90 deg inclination and having 50, 100, 150, 200 km altitudes. Critical design parameters that are directly related to the success of the impactor mission are also analyzed including deploy directions, CubeSat flight time, impact velocity, and associated impact angles. Based on derived delta-V requirements, required thruster burn time and fuel mass are analyzed by adapting four different miniaturized commercial onboard thrusters currently developed for CubeSat applications. As a result, CubeSat impact trajectories as well as thruster burn characteristics deployed at different orbital altitudes are found to satisfy the mission objectives. It is concluded that thrust burn time should considered as the more critical design parameter than the required fuel mass when deducing the onboard propulsion system requirements. Results provided through this work will be helpful in further detailed system definition and design activities for future lunar missions with a CubeSat-based payload.

• Journal of Information Technology Services
• /
• v.7 no.2
• /
• pp.127-135
• /
• 2008

The concept of preprocessing is widely used in various computer science area such as compiler and software engineering for the purpose of macro processing and optimization. In addition, preprocessing is also used in SAT solvers in order to eliminate redundant literals and clauses to speed up its solving time before searching the state space. However, there is an unexpected run-time error such as stack-overflow during this step, in case the size of a given set of clauses is huge which impedes SAT solvers. In this case, the preprocessing should be applied at the encoding time to optimize its size. In this paper this idea is applied to several Sudoku problems. As a result, significant improvements are obtained with respect to the number of variables and clauses as well as the solving time compared to the previous works.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.23 no.1
• /
• pp.157-162
• /
• 2023

To NP-complete 3-SAT problem, this paper proposes a O(nm) polynomial time algorithm, where n is the number of literals and m is the total frequency of all literals in equation f. The algorithm firstly decides a truth value of a literal in sequence of previously-set priority. The priority order is as follows: a literal whose occurrence in a clause is 1(k=1), a literal which is k≥2 and whose truth value is either 0 or 1, and a literal with the minimum frequency. Then, literals whose truth value is determined are then deleted from clause T and the remaining clauses. This process is repeated l times, the number of literals. As a result, the proposed algorithm has been successful in accurately determining the satisfiability of a given equation f and in deciding the truth value of all the literals. This paper, therefore, provides not only a linear-time algorithm as a viable solution to the SAT problem, but also a basis for solving the P versus NP problem.

• Journal of the Ergonomics Society of Korea
• /
• v.26 no.2
• /
• pp.103-112
• /
• 2007

This study was designed to validate Spreading Activation Theory (SAT) for an evaluation methodology for menu structure through Eye-Tracking approach. When a visual search is on the way, more eye fixations and time are necessary to visually process complex and vague area. From the aspect of recognition, well-designed menu structures were hypothesized to have fewer numbers of fixations and shorter duration because well-designed menu structures reflecting the users' mental model would be well matched with the product's menu structure, resulting in reducing the number of fixations and duration time. The results show that the shorter reaction times for SAT had significantly fewer numbers of fixation and shorter duration time as the hypothesis for this study stated. In conclusion, SAT was proved to be an effective evaluation methodology for menu structure with the eye tracking equipment. In addition, using SAT instead of the real performance experiment would be useful for designing user-centered systems and convenient information structures because SAT was proven to be the theoretical background for design and evaluation of menu structures.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2022.10a
• /
• pp.556-558
• /
• 2022

This paper proposes a CanSat system with a vehicle tracking function based on Jetson Nano, a high-performance small computer capable of operating artificial intelligence algorithms. The CanSat system consists of a CanSat and a ground station. The CanSat falls in the atmosphere and transmits the data obtained through the installed sensors to the ground station using wireless communication. The existing CanSat is limited to the mission of simply transmitting the collected information to the ground station, and there is a limit to efficiently performing the mission due to the limited fall time and bandwidth limitation of wireless communication. The Jetson Nano based CanSat proposed in this paper uses a pre-trained neural network model to detect the location of a vehicle in each image taken from the air in real time, and then uses a 2-axis motor to move the camera to track the vehicle.

• Journal of Soil and Groundwater Environment
• /
• v.10 no.5
• /
• pp.18-24
• /
• 2005

Water quality changes of wastewater effluent in the shallow aquifier condition was investigated using laboratory unsaturated and saturated SAT columns for over five months. Average DOC removal was 31.9% in the unsaturated SAT column whereas no removal occurred in the saturated SAT column. Under the shallow aquifer condition, nitrification was not completed in the unsaturated SAT column, releasing residual ammonium nitrogen into the saturated SAT column. Short retention time (one day) in the shallow unsaturated SAT column rendered DO of about 2 mg/L to the influent of the saturated SAT column. Phosphate was not removed at all in the unsaturated SAT column while complete removal was achieved in the saturated column. Consequently, organic and inorganic compounds were removed under the shallow aquifer condition as effectively as was in deep aquifer, except for the release of ammonium and relatively high DO into the saturated SAT column.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2008.10a
• /
• pp.8-23
• /
• 2008

The purpose of this study is to develop a Cross Impact System Alternatives Tree(CISAT) model necessary for selecting the interdependent R&D planning system alternatives. This model modifies System Alternatives Tree(SAT) model developed by Kwon et al.. The SAT model is composed of several functions necessary for the achievement of a final goal and several subsystems for satisfying each function. In case that the relationship of technology alternatives is interdependent, this model overlooked a relative importance derived from occurrence or nonoccurrence of the technology alternatives in the future time varience. However, a complex evaluation process within the ballot system is another disadvantage of the SAT. To solve such problems, the Cross Impact Analysis(CIA) model is applied in the SAT model so as to consider the cross impact among interdependent system alternatives.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.23 no.6
• /
• pp.125-132
• /
• 2023

To NP-complete 3-SAT problem, this paper proposes a O(nm) polynomial time algorithm, where n is the number of literals and m is the total frequency of all literals in equation f. Conventionally well-known DPLLs should perform O(2^𝑙) in the worst case by performing backtracking if they fail to find a solution in a brute-force search of a branch-and-bound for the number of literals 𝑙. DPLL forms the core of the SAT Solver by substituting true(T) or false(F) for a literal so that a clause containing the least frequency literal is true(T) and removing a clause containing that literal. Contrary to DPLL, the proposed algorithm selects a literal _max𝑙 with the maximum frequency and sets $_{\max}({\mid}l{\mid},{\mid}{\bar{l}}{\mid})=1$. It then deletes 𝑙∈c_i clause in addition to ${\bar{l}}$ from ${\bar{l}}{\in}c_i$ clause. Its test results on various k-SAT problems not only show that it performs less than existing DPLL algorithm, but prove its simplicity in satisfiability verification.