• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.16 no.10
• /
• pp.3458-3478
• /
• 2022

Automatic modulation recognition is the core algorithm in the field of modulation classification in communication systems. Our investigations show that deep learning (DL) based modulation recognition techniques have achieved effective progress for multiple-input multiple-output (MIMO) systems. However, network complexity is always an additional burden for high-accuracy classifications, which makes it impractical. Therefore, in this paper, we propose a low-complexity dimensional interactive lightweight network (DilNet) for MIMO systems. Specifically, the signals received by different antennas are cooperatively input into the network, and the network calculation amount is reduced through the depth-wise separable convolution. A two-dimensional interactive attention (TDIA) module is designed to extract interactive information of different dimensions, and improve the effectiveness of the cooperation features. In addition, the TDIA module ensures low complexity through compressing the convolution dimension, and the computational burden after inserting TDIA is also acceptable. Finally, the network is trained with a penalized statistical entropy loss function. Simulation results show that compared to existing modulation recognition methods, the proposed DilNet dramatically reduces the model complexity. The dimensional interactive lightweight network trained by penalized statistical entropy also performs better for recognition accuracy in MIMO systems.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.20 no.43
• /
• pp.299-319
• /
• 1997

Since a convergence strategy in interactive procedure is the origin of a lot of the restrictions and inconvenience of many methods, a new flexible convergence strategy is necessary for developing that is applicable for interactive MOLP as well as interactive multiple objective integer programming(MOIP). A method for computing the volume of the interval defined subsets of weighting vector space is developed using Sobol's LP$_{i}$, Generator. Since the interactive procedure requires a number of iterations, with a fixed number of solutions presented per iteration, a convergence strategy is needed to control the rate at which the interactive procedure converges to a final solution. Thus, in this paper, a new convergency strategy is developed.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.40 no.3
• /
• pp.49-61
• /
• 2015

We study the problem of multiple response optimization (MRO) and focus on the selection of input levels which will produce desirable output quality. We propose an interactive multiple objective optimization approach to the input design. The earlier interactive methods utilized for MRO communicate with the decision maker only using the response variable values, in order to improve the current response values, thereby resulting in the corresponding design solution automatically. In their interaction steps of preference articulation, no account is taken of any active changes in design variable values. On the contrary, our approach permits the decision maker to change the design variable values in its interaction stage, which makes possible the consideration of the preference or economics of the design variable side. Using some typical value functions, we also demonstrate that our method converges reasonably well to the known optimal solutions.

• ETRI Journal
• /
• v.26 no.3
• /
• pp.265-268
• /
• 2004

We develop a simple exact solution method for return link capacity allocation scheduling in a satellite interactive network using a hybrid code-division multiple access / time-division multiple access (CDMA/TDMA) scheme.

• Korean Management Science Review
• /
• v.10 no.2
• /
• pp.11-26
• /
• 1993

This paper presents a new interactive procedure for multiple objective linear programming problem (MOLP). In practical multiple objective linear programming applications, there is usually no need for the decision maker to consider solutions which are not efficient. Therefore, the interactive procedure presented here searches only among efficient solutions and terminates with a solution that is guaranteed to be efficient. It also can converge to nonextreme efficient final solutions rather than being restricted to only extreme efficient points of the feasible set. The procedure does not require sophisticated judgements or inputs from the decision maker. One of the most attractive features of the procedure however, is that the method allows the DM to examine the efficient faces it finds. As iteration goes, the DM can explore a wide variety of efficient faces rather than efficient faces confined to only certain subregion of the feasible set of problem MOLP since the efficient faces that the procedure finds need not be adjacent. This helps the DM explore the nature of the efficient set of problem MOLP and also helps the DM have confidence with a final solution. For these reasons, I feel that the procedure offer significant promise in solving multiple objective linear programs rapidly and in a satisfying manner to the DM.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.11 no.5
• /
• pp.56-61
• /
• 2012

Several Visualization techniques have been applied in traffic information area. This work is the basic research for applying of interactive visualization techniques when the traffic information is provided to users. Design of interactive visualization techniques were applied to traffic information services. Previous studies for information visualization with interactive visualization techniques were investigated, and the traffic information services currently provided were analyzed. There are many types of interactive visualization techniques, but this study is mainly focused on selecting, querying, linking, filtering and rearranging techniques. The users can obtain the proper and more suitable information for theie needs, because each interactive visualization techniques support interaction between information and users. The traffic information which has one of interactive techniques can be more effective for decision making and utilization. More attention is given to interactive visualization of data and information techniques in transportation field. By this research, it is expected that traffic information services is more effective and can be a foundation work for various interactive visualization techniques in traffice inforamtion.

• The Journal of the Acoustical Society of Korea
• /
• v.28 no.8
• /
• pp.706-713
• /
• 2009

Standardization of technology for formatting multiple audio tracks and relevant information for interactive music service is in progress owing to the increasing need of consumers for participating in music production to their own taste. In this paper, we introduce the status of MPEG-A Interactive Music Application Format (IM AF) standardization and analyze techniques adopted in the current IM AF.

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

A method of interactive human interface for motion modification of an articulated object model like a human body, a multiple joints robot, etc. has been developed, and implemented to a human body motion model. In the case of computer software models, the initial data setting for overall motion is rather easy. However, modifying or correcting the initially set motion is rather difficult for keeping consistency. In this research, the requirements shown below have mainly been set as the specifications ...

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1992.04b
• /
• pp.117-126
• /
• 1992

This study proposes a new interactive multicriteria method for determining the best levels of the decision variables needed to optimize a stochastic computer simulation with multiple response variables. The method, called the Pairwise Comparison Stochastic Cutting Plane (PCSCP) method, combines good features from interactive multiple objective mathematical programming methods and response surface methodology. The major characteristics of the PCSCP algorithm are: (1) it interacts progressively with the decision maker (DM) to obtain his preferences, (2) it uses good experimental design to adequately explore the decision space while reducing the burden on the DM, and (3) it uses the preference information provided by the DM and the sampling error in the responses to reduce the decision space. This paper presents the basic concepts of the PCSCP method along with its performance for solving randomly selected test problems.

• Proceedings of the Korea Inteligent Information System Society Conference
• /
• 2000.11a
• /
• pp.375-383
• /
• 2000

This research suggests an interactive methodology fur multiple objective linear programming problems to help the group select a compromising solution in the World Wide Web environment. Our methodology lessens the burden of group decision makers, which is one of necessary conditions of the web environment. Only the partial weak order of variables and objectives from the group decision makers are enough for searching the best compromising solution. For such a purpose, we expand the Dror and Gass algorithm to the group decision context. And we suggest the system architecture of a web-based GDSS fur the implementation of our methodology.