• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.43 no.9
• /
• pp.787-798
• /
• 2015

The emergence of mid-to-small satellites has created a need for rapid development with a relatively low cost. However, the development of mid-to-small satellites requires considerable time and cost in early phase, in particular, during the development of mission and system requirements through iterations of conceptual design and mission design. In this research, Spacecraft Conceptual Design Tool(SCDT) which is based on Graphical User Interface(GUI) was developed to reduce the time and cost for early phase development. Furthermore, GUI-based software can make the input values to be editable easily and show users design results in various way. In this paper, the development results of MATLAB GUI-based SCDT are introduced.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.21 no.1
• /
• pp.87-92
• /
• 2021

Bias, variance, error and learning are important factors for performance in modeling a big data based recommendation system. The recommendation model in this system must reduce complexity while maintaining the explanatory diagram. In addition, the sparsity of the dataset and the prediction of the system are more likely to be inversely proportional to each other. Therefore, a product recommendation model has been proposed through learning the similarity between products by using a factorization method of the sparsity of the dataset. In this paper, the generalization ability of the model is improved by applying the max-norm regularization as an optimization method for the loss function of this model. The solution is to apply a stochastic projection gradient descent method that projects a gradient. The sparser data became, it was confirmed that the propsed regularization method was relatively effective compared to the existing method through lots of experiment.

• Architectural research
• /
• v.21 no.4
• /
• pp.111-116
• /
• 2019

The premise of this research is the recent advancement of Building Information Modeling(BIM) Technology and Laser Scanning Technology(3D Scanning). The purpose of the paper is to amplify the potential offered by the combination of BIM and Point Cloud Data (PCD) for structural analysis. Today, enormous amounts of construction site data can be potentially categorized and quantified through BIM software. One of the extraordinary strengths of BIM software comes from its collaborative feature, which can combine different sources of data and knowledge. There are vastly different ways to obtain multiple construction site data, and 3D scanning is one of the effective ways to collect close-to-reality construction site data. The objective of this paper is to emphasize the prospects of pre-scanning and post-scanning automation algorithms. The research aims to stimulate the recent development of 3D scanning and BIM technology to develop Scan-to-BIM. The paper will review the current issues of Scan-to-BIM tasks to achieve As-Built BIM and suggest how it can be improved. This paper will propose a method of coordinating and utilizing PCD for construction and structural analysis during construction.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.2
• /
• pp.611-627
• /
• 2017

For enhancing the coverage of wireless networks and increasing the spectrum efficiency, small cell networks (SCNs) are considered to be one of the most prospective schemes. Most of the existing literature on resource allocation among non-cooperative small cell base stations (SBSs) has widely drawn close attention and there are only a small number of the cooperative ideas in SCNs. Based on the motivation, we further investigate the cooperative approach, which is formulated as a coalition formation game with power control algorithm (CFG-PC). First, we formulate the downlink sub-channel resource allocation problem in an SCN as a coalition formation game. Pareto order and utilitarian order are applied to form coalitions respectively. Second, to achieve more availability and efficiency power assignment, we expand and solve the power control using particle swarm optimization (PSO). Finally, with our proposed algorithm, each SBS can cooperatively work and eventually converge to a stable SBS partition. As far as the transmit rate of per SBS and the system rate are concerned respectively, simulation results indicate that our proposed CFG-PC has a significant advantage, relative to a classical coalition formation algorithm and the non-cooperative case.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.17 no.3
• /
• pp.794-815
• /
• 2023

The rapid development of mobile communication not only has made the industry gradually diversified, but also has enhanced the service quality requirements of users. In this regard, it is imperative to consider jointly network slicing and mobile edge computing. The former mainly ensures the requirements of varied vertical services preferably, and the latter solves the conflict between the user's own energy and harsh latency. At present, the integration of the two faces many challenges and need to carry out at different levels. The main target of the paper is to minimize the energy consumption of the system, and introduce a multi-slice joint task offloading and resource allocation scheme for massive multiple input multiple output enabled heterogeneous networks. The problem is formulated by collaborative optimizing offloading ratios, user association, transmission power and resource slicing, while being limited by the dissimilar latency and rate of multi-slice. To solve it, assign the optimal problem to two sub-problems of offloading decision and resource allocation, then solve them separately by exploiting the alternative optimization technique and Karush-Kuhn-Tucker conditions. Finally, a novel slices task offloading and resource allocation algorithm is proposed to get the offloading and resource allocation strategies. Numerous simulation results manifest that the proposed scheme has certain feasibility and effectiveness, and its performance is better than the other baseline scheme.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.17 no.4
• /
• pp.1200-1215
• /
• 2023

With the development of IoT and artificial intelligence, location-based services are getting more and more attention. For solving the current problem that indoor positioning error is large and generalization is poor, this paper proposes a Model Stacking Algorithm for Indoor Positioning System using WiFi fingerprinting. Firstly, we adopt a model stacking method based on Bayesian optimization to predict the location of indoor targets to improve indoor localization accuracy and model generalization. Secondly, Taking the predicted position based on model stacking as the observation value of particle filter, collaborative particle filter localization based on model stacking algorithm is realized. The experimental results show that the algorithm can control the position error within 2m, which is superior to KNN, GBDT, Xgboost, LightGBM, RF. The location accuracy of the fusion particle filter algorithm is improved by 31%, and the predicted trajectory is close to the real trajectory. The algorithm can also adapt to the application scenarios with fewer wireless access points.

• The KIPS Transactions:PartB
• /
• v.19B no.3
• /
• pp.155-164
• /
• 2012

This study aims to identify the multidimensional variables and sub-variables and study their relative weight in music recommender systems when maximizing the rating function R. To undertake the task, a optimization formula and variables for a research model were derived from the review of prior works on recommender systems, which were then used to establish the research model for an empirical test. With the research model and the actual log data of real customers obtained from an on line music provider in Korea, multiple regression analysis was conducted to induce the optimal correlation of variables in the multidimensional model. The results showed that the correlation value against the rating function R for Items was highest, followed by Social Relations, Users and Contexts. Among sub-variables, popular music from Social Relations, genre, latest music and favourite artist from Items were high in the correlation with the rating function R. Meantime, the derived multidimensional recommender systems revealed that in a comparative analysis, it outperformed two dimensions(Users, Items) and three dimensions(Users, Items and Contexts, or Users, items and Social Relations) based recommender systems in terms of adjusted $R^2$ and the correlation of all variables against the values of the rating function R.

• Journal of Intelligence and Information Systems
• /
• v.23 no.2
• /
• pp.19-38
• /
• 2017

Collaborative filtering (CF) algorithm has been popularly used for implementing recommender systems. Until now, there have been many prior studies to improve the accuracy of CF. Among them, some recent studies adopt 'hybrid recommendation approach', which enhances the performance of conventional CF by using additional information. In this research, we propose a new hybrid recommender system which fuses CF and the results from the social network analysis on trust and distrust relationship networks among users to enhance prediction accuracy. The proposed algorithm of our study is based on memory-based CF. But, when calculating the similarity between users in CF, our proposed algorithm considers not only the correlation of the users' numeric rating patterns, but also the users' in-degree centrality values derived from trust and distrust relationship networks. In specific, it is designed to amplify the similarity between a target user and his or her neighbor when the neighbor has higher in-degree centrality in the trust relationship network. Also, it attenuates the similarity between a target user and his or her neighbor when the neighbor has higher in-degree centrality in the distrust relationship network. Our proposed algorithm considers four (4) types of user relationships - direct trust, indirect trust, direct distrust, and indirect distrust - in total. And, it uses four adjusting coefficients, which adjusts the level of amplification / attenuation for in-degree centrality values derived from direct / indirect trust and distrust relationship networks. To determine optimal adjusting coefficients, genetic algorithms (GA) has been adopted. Under this background, we named our proposed algorithm as SNACF-GA (Social Network Analysis - based CF using GA). To validate the performance of the SNACF-GA, we used a real-world data set which is called 'Extended Epinions dataset' provided by 'trustlet.org'. It is the data set contains user responses (rating scores and reviews) after purchasing specific items (e.g. car, movie, music, book) as well as trust / distrust relationship information indicating whom to trust or distrust between users. The experimental system was basically developed using Microsoft Visual Basic for Applications (VBA), but we also used UCINET 6 for calculating the in-degree centrality of trust / distrust relationship networks. In addition, we used Palisade Software's Evolver, which is a commercial software implements genetic algorithm. To examine the effectiveness of our proposed system more precisely, we adopted two comparison models. The first comparison model is conventional CF. It only uses users' explicit numeric ratings when calculating the similarities between users. That is, it does not consider trust / distrust relationship between users at all. The second comparison model is SNACF (Social Network Analysis - based CF). SNACF differs from the proposed algorithm SNACF-GA in that it considers only direct trust / distrust relationships. It also does not use GA optimization. The performances of the proposed algorithm and comparison models were evaluated by using average MAE (mean absolute error). Experimental result showed that the optimal adjusting coefficients for direct trust, indirect trust, direct distrust, indirect distrust were 0, 1.4287, 1.5, 0.4615 each. This implies that distrust relationships between users are more important than trust ones in recommender systems. From the perspective of recommendation accuracy, SNACF-GA (Avg. MAE = 0.111943), the proposed algorithm which reflects both direct and indirect trust / distrust relationships information, was found to greatly outperform a conventional CF (Avg. MAE = 0.112638). Also, the algorithm showed better recommendation accuracy than the SNACF (Avg. MAE = 0.112209). To confirm whether these differences are statistically significant or not, we applied paired samples t-test. The results from the paired samples t-test presented that the difference between SNACF-GA and conventional CF was statistical significant at the 1% significance level, and the difference between SNACF-GA and SNACF was statistical significant at the 5%. Our study found that the trust/distrust relationship can be important information for improving performance of recommendation algorithms. Especially, distrust relationship information was found to have a greater impact on the performance improvement of CF. This implies that we need to have more attention on distrust (negative) relationships rather than trust (positive) ones when tracking and managing social relationships between users.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.1
• /
• pp.21-40
• /
• 2018

In this paper, we propose the distributed robust beamforming design scheme in cognitive two-way amplify-and-forward (AF) relay networks with imperfect channel state information (CSI). Assuming the CSI errors follow a complex Gaussian distribution, the objective of this paper is to design the robust beamformer which minimizes the total transmit power of the collaborative relays. This design will guarantee the outage probability of signal-to-interference-plus-noise ratio (SINR) beyond a target level at each secondary user (SU), and satisfies the outage probability of interference generated on the primary user (PU) above the predetermined maximum tolerable interference power. Due to the multiple CSI uncertainties in the two-way transmission, the probabilistic constrained optimization problem is intractable and difficult to obtain a closed-form solution. To deal with this, we reformulate the problem to the standard form through a series of matrix transformations. We then accomplish the problem by using the probabilistic approach based on two sorts of Bernstein-type inequalities and the worst-case approach based on S-Procedure. The simulation results indicate that the robust beamforming designs based on the probabilistic method and the worst-case method are both robust to the CSI errors. Meanwhile, the probabilistic method can provide higher feasibility rate and consumes less power.

• ETRI Journal
• /
• v.40 no.1
• /
• pp.10-25
• /
• 2018

The 5GCHAMPION Europe-Korea collaborative project provides the first fully-integrated and operational 5G prototype in 2018, in conjunction with the 2018 PyeongChang Winter Olympic Games. The corresponding technological advances comprise both an evolution and optimization of existing technological solutions and disruptive new features, which substantially outpace previous generations of technology. In this article, we focus on a subset of three disruptive technological solutions developed and experimented on by 5GCHAMPION during the 2018 PyeongChang Olympic Games: high speed communications, direct satellite-user equipment communications, and post-sale evolution of wireless equipment through software reconfiguration. Evaluating effectiveness and performing trials for these key 5G features permit us to learn about the actual maturity of 5G technology prototyping and the potential of new 5G services for vertical markets and end user enhanced experience two years before the launch of large-scale 5G services.