• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.17 no.6
• /
• pp.1743-1758
• /
• 2023

Automatic modulation classification is a critical algorithm for non-cooperative communication systems. This paper addresses the challenging problem of closed-set and open-set signal modulation classification in complex channels. We propose a novel approach that incorporates a self-learning filter and center-loss in Deep Residual Shrinking Networks (DRSN) for closed-set modulation classification, and the Opendistance method for open-set modulation classification. Our approach achieves better performance than existing methods in both closed-set and open-set recognition. In closed-set recognition, the self-learning filter and center-loss combination improves recognition performance, with a maximum accuracy of over 92.18%. In open-set recognition, the use of a self-learning filter and center-loss provide an effective feature vector for open-set recognition, and the Opendistance method outperforms SoftMax and OpenMax in F1 scores and mean average accuracy under high openness. Overall, our proposed approach demonstrates promising results for automatic modulation classification, providing better performance in non-cooperative communication systems.

• 제어로봇시스템학회:학술대회논문집
• /
• 1993.10b
• /
• pp.316-320
• /
• 1993

Electromagnetic suspension (E.M.S) type levitation system is studied in the control system design viewpoint. Dynamic characteristics in theoretical analysis as well as hardware implementation is considered. Open loop unstable, non-linear and timevarying characteristics are reviewed in the theoretcal section, while levitation control system for multi-vehicle train as well as magnet drive system is reviewed in the practical section. This paper suggests not only some well-known problem appearing in levitation control system design but also a subtle problem and solution candidates. But there exist many unmentioned problems wating for a smart problem solver.

• East Asian mathematical journal
• /
• v.38 no.1
• /
• pp.85-94
• /
• 2022

Recently, an LWE-based commitment scheme is proposed. Their construction is statistically hiding as well as computationally binding. On the other hand, the construction of related zero-knowledge protocols is left as an open problem. In this paper, we present zero-knowledge protocols with hardness based on the LWE problem. we show how to instantiate efficient zero-knowledge protocols that can be used to prove linear and sum relations among these commitments. In addition, we show how the variant of LWE, spLWE problem, can be used to instantiate efficient zero-knowledge protocols.

• Journal of Elementary Mathematics Education in Korea
• /
• v.14 no.3
• /
• pp.723-744
• /
• 2010

The aim of this study was to find the effects of open-ended problems on mathematical creativity and brain function. In this study, one class of first grade students were allocated randomly into two groups. Each group solved different problems. The experimental group solved the open-ended problems and the comparison group solved the closed-problems. Mathematical creativity was tested by the paper test. And Brain function was tested by an EEG(electroencephalogram) tester. The results of this study are as follows. Firstly, this study analyzed how the open-ended problems are effective on mathematical creativity. This analysis showed that it had a meaningful influence on the mathematical creativity(p=0.46). Accordingly, we could find out that open-ended problems make the student connect the mathematical concept and idea and think variously. Secondly, this study analyzed the effect of open-ended problems on brain function. This analysis showed that it did not have a meaningful influence on the brain function(p=.073) statistically but the experimental group's evaluation was higher than comparison groups' at the post-test. It also had a meaningful influence on the brain attention quotient(left) (p=.007), attention quotient(right) (p=.023) and emotion tendency quotient(p=.025). As a result of such tests, we could find out that open-ended problems are effective on brain function, especially on the attention ability. With the use of the open-ended problems, students could show quick understanding and response. An emotion tendency is also developed in the process. Because various answers are accepted, the students gain an internal reward at the process of finding an answer. Putting the above results together, we could find that open-ended problem is effective on mathematical creativity and brain function.

• Journal of Korea Spatial Information System Society
• /
• v.9 no.2
• /
• pp.1-11
• /
• 2007

Recently, with the development of collecting methods of spatial data, the spatial data is produced, circulated, and used in various fields of industry and research. To manage the mass spatial data efficiently, the researches on extension of the existing commercial DBMS, such as ESRI's ArcSDE or Oracle's Oracle Spatial, is making progress actively. However, the usage of the extension of the commercial DBMS Incurs an additional expense and causes an interoperability problem due to differences in spatial data types and spatial operators. Therefore, in this paper, we developed an OpenGIS Spatial Interface for Oracle, which supports a standard interface by fellowing the "Simple Features Specification for SQL" proposed by OGC(Open Geospatial Consortium). Since the OpenGIS Spatial Interface provides all spatial data types and spatial operators proposed in "Simple Features Specification for SQL", users can manage mass spatial data of Oracle efficiently by using the standard interface without additional expense. In addition, we proved that the OpenGIS Spatial Interface is superior to the Oracle Spatial in the response time through the performance evaluation.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.28 no.4
• /
• pp.191-198
• /
• 2003

The generalized knapsack problem or gknap is the combinatorial optimization problem of optimizing a nonnegative linear function over the integral hull of the intersection of a polynomially separable 0-1 polytope and a knapsack constraint. The knapsack, the restricted shortest path, and the constrained spanning tree problem are a partial list of gknap. More interesting1y, all the problem that are known to have a fully polynomial approximation scheme, or FPTAS are gknap. We establish some necessary and sufficient conditions for a gknap to admit an FPTAS. To do so, we recapture the standard scaling and approximate binary search techniques in the framework of gknap. This also enables us to find a weaker sufficient condition than the strong NP-hardness that a gknap does not have an FPTAS. Finally, we apply the conditions to explore the fully polynomial approximability of the constrained spanning problem whose fully polynomial approximability is still open.

• Tunnel and Underground Space
• /
• v.24 no.1
• /
• pp.11-20
• /
• 2014

This study analyzed the optimal routes of auxiliary vehicles in an open-pit mine that need to traverse the entire mine through many working points. Unlike previous studies which usually used the Dijkstra's algorithm, this study utilized a heuristic algorithm for the Traveling Salesman Problem(TSP). Thus, the optimal routes of auxiliary vehicles could be determined by considering the visiting order of multiple working points. A case study at the Pasir open-pit coal mine, Indonesia was conducted to analyze the travel route of an auxiliary vehicle that monitors the working condition by traversing the entire mine without stopping. As a result, we could know that the heuristic TSP algorithm is more efficient than intuitive judgment in determining the optimal travel route; 20 minutes can be shortened when the auxiliary vehicle traverses the entire mine through 25 working points according to the route determined by the heuristic TSP algorithm. It is expected that the results of this study can be utilized as a basis to set the direction of future research for the system optimization of auxiliary vehicles in open-pit mines.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.21 no.4
• /
• pp.89-96
• /
• 2021

The number of confirmed cases of coronavirus-19 is soaring around the world and has caused numerous deaths. Wearing a mask is very important to prevent infection. Incidents and accidents have occurred due to the recommendation to wear a mask in public places such as buses and subways, and it has emerged as a serious social problem. To solve this problem, this paper proposes an open source-based face mask wearing monitoring system. We used open source software, web-based artificial intelligence tool teachable machine and open source hardware Arduino. It judges whether the mask is worn, and performs commands such as guidance messages and alarms. The learning parameters of the teachable machine were learned with the optimal values of 50 learning times, 32 batch sizes, and 0.001 learning rate, resulting in an accuracy of 1 and a learning error of 0.003. We designed and implemented a mask wearing monitoring system that can perform commands such as guidance messages and alarms by determining whether to wear a mask using a web-based artificial intelligence tool teachable machine and Arduino to prove its validity.

• Journal of Magnetics
• /
• v.18 no.2
• /
• pp.130-134
• /
• 2013

Most electrical machines like motor, generator and transformer are symmetric in terms of magnetic field distribution and mechanical structure. In order to analyze these problems effectively, many coupling techniques have been introduced. This paper deals with a coupling scheme for open boundary problem of symmetric and periodic structure. It couples an analytical solution of Fourier series expansion with the standard finite element method. The analytical solution is derived for the magnetic field in the outside of the boundary, and the finite element method is for the magnetic field in the inside with source current and magnetic materials. The main advantage of the proposed method is that it retains sparsity and symmetry of system matrix like the standard FEM and it can also be easily applied to symmetric and periodic problems. Also, unknowns of finite elements at the boundary are coupled with Fourier series coefficients. The boundary conditions are used to derive a coupled system equation expressed in matrix form. The proposed algorithm is validated using a test model of a bush bar for the power supply. And the each result is compared with analytical solution respectively.

• Journal of Creative Information Culture
• /
• v.5 no.1
• /
• pp.53-61
• /
• 2019

Recently, there are various reports on the case of using an Online Judge(OJ) system that enables students to develop problem solving abilities based on algorithms and programming. If informatics teachers and prospective informatics teachers have the ability to build and operate these systems for their school and students, they will be equipped with powerful instructional competencies related to computational thinking and problem solving ability. Therefore, this paper studied how to build and customize HUSTOJ-based open source online judge systems for school informatics education, and suggested the direction to apply it effectively at the school.