• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제13권12호
• /
• pp.5826-5841
• /
• 2019

In our previous research, we proposed a tag emotion-based item recommendation scheme. The ternary associations among users, items, and tags are described as a three-order tensor in order to capture the emotions in tags. The candidates for recommendation are created based on the latent semantics derived by a high-order singular value decomposition technique (HOSVD). However, the tensor is very sparse because the number of tagged items is smaller than the amount of all items. The previous research do not consider the previous behaviors of users and items. To mitigate the problems, in this paper, the item-based collaborative filtering scheme is used to build an extended data. We also apply the probabilistic ranking algorithm considering the user and item profiles to improve the recommendation performance. The proposed method is evaluated based on Movielens dataset, and the results show that our approach improves the performance compared to other methods.

• ETRI Journal
• /
• 제39권5호
• /
• pp.695-706
• /
• 2017

This paper presents a caching algorithm that offers better reconstructed data quality to the requesters than a probabilistic caching scheme while maintaining comparable network performance. It decides whether an incoming data packet must be cached based on the dynamic caching probability, which is adjusted according to the priorities of content carried by the data packet, the uncertainty of content popularities, and the records of cache events in the router. The adaptation of caching probability depends on the priorities of content, the multiplication factor adaptation, and the addition factor adaptation. The multiplication factor adaptation is computed from an instantaneous cache-hit ratio, whereas the addition factor adaptation relies on a multiplication factor, popularities of requested contents, a cache-hit ratio, and a cache-miss ratio. We evaluate the performance of the caching algorithm by comparing it with previous caching schemes in network simulation. The simulation results indicate that our proposed caching algorithm surpasses previous schemes in terms of data quality and is comparable in terms of network performance.

• 산업경영시스템학회지
• /
• 제40권4호
• /
• pp.260-267
• /
• 2017

Quantum-inspired Genetic Algorithm (QGA) is a probabilistic search optimization method combined quantum computation and genetic algorithm. In QGA, the chromosomes are encoded by qubits and are updated by quantum rotation gates, which can achieve a genetic search. Asset-based weapon target assignment (WTA) problem can be described as an optimization problem in which the defenders assign the weapons to hostile targets in order to maximize the value of a group of surviving assets threatened by the targets. It has already been proven that the WTA problem is NP-complete. In this study, we propose a QGA and a hybrid-QGA to solve an asset-based WTA problem. In the proposed QGA, a set of probabilistic superposition of qubits are coded and collapsed into a target number. Q-gate updating strategy is also used for search guidance. The hybrid-QGA is generated by incorporating both the random search capability of QGA and the evolution capability of genetic algorithm (GA). To observe the performance of each algorithm, we construct three synthetic WTA problems and check how each algorithm works on them. Simulation results show that all of the algorithm have good quality of solutions. Since the difference among mean resulting value is within 2%, we run the nonparametric pairwise Wilcoxon rank sum test for testing the equality of the means among the results. The Wilcoxon test reveals that GA has better quality than the others. In contrast, the simulation results indicate that hybrid-QGA and QGA is much faster than GA for the production of the same number of generations.

• 한국인터넷방송통신학회논문지
• /
• 제11권2호
• /
• pp.197-203
• /
• 2011

애드 혹 네트워크는 네트워크의 구성 요소를 관리하는 AP가 없는 대신 각각의 노드가 라우팅 알고리즘에 의한 동작으로 노드간에 정보를 전송한다. 이 때 네트워크 내 모든 노드로 정보를 전송하는 브로드캐스팅 과정이 필수적이다. 브로드캐스팅 과정에서는 네트워크를 구성하는 노드에 대한 충분한 정보 없이 모든 노드로 패킷을 전송하므로 동일한 패킷의 중복 수신이 발생하며, 이는 네트워크의 전력 효율을 감소시키는 원인이 된다. 본 논문에서는 전송 효율을 증가시키기 위하여 패킷 수신 횟수에 의한 확률적 브로드캐스트 기법을 제안한다. 각 노드는 과거 패킷 수신 횟수에 근거하여 신뢰성이 보장된 범위 내에서 높은 전송 효율을 갖는 브로드캐스트 확률을 계산하고 이 확률에 따라 각 노드는 브로드캐스트를 수행한다. 본 논문에서는 모의 실험을 통하여 제안 기법의 성능을 검증하였다.

• Communications for Statistical Applications and Methods
• /
• 제14권3호
• /
• pp.583-592
• /
• 2007

Given the moments of a symmetric random variable, its density and distribution functions can be accurately approximated by making use of the algorithm proposed in this paper. This algorithm is specially designed for approximating symmetric distributions and comprises of four phases. This approach is essentially based on the transformation of variable technique and moment-based density approximants expressed in terms of the product of an appropriate initial approximant and a polynomial adjustment. Probabilistic quantities such as percentage points and percentiles can also be accurately determined from approximation of the corresponding distribution functions. This algorithm is not only conceptually simple but also easy to implement. As illustrated by the first two numerical examples, the density functions so obtained are in good agreement with the exact values. Moreover, the proposed approximation algorithm can provide the more accurate quantities than direct approximation as shown in the last example.

• Smart Structures and Systems
• /
• 제15권4호
• /
• pp.1121-1137
• /
• 2015

This study presents probabilistic-based damage identification technique for highlighting damage in metallic structures. This technique utilizes distributed piezoelectric transducers to generate and monitor the ultrasonic Lamb wave with narrowband frequency. Diagnostic signals were used to define the scatter signals of different paths. The energy of scatter signals till different times were calculated by taking root mean square of the scatter signals. For each pair of parallel paths an error function based on the energy of scatter signals is introduced. The resultant error function then is used to estimate the probability of the presence of damage in the monitoring area. The presented method with an autofocusing feature is applied to aluminum plates for method verification. The results identified using both simulation and experimental Lamb wave signals at different central frequencies agreed well with the actual situations, demonstrating the potential of the presented algorithm for identification of damage in metallic structures. An obvious merit of the presented technique is that in addition to damages located inside the region between transducers; those who are outside this region can also be monitored without any interpretation of signals. This novelty qualifies this method for online structural health monitoring.

• Geomechanics and Engineering
• /
• 제25권1호
• /
• pp.17-30
• /
• 2021

This paper develops a convenient approach for deterministic and probabilistic evaluations of tunnel face stability using support vector machine classifiers. The proposed method is comprised of two major steps, i.e., construction of the training dataset and determination of instance-based classifiers. In step one, the orthogonal design is utilized to produce representative samples after the ranges and levels of the factors that influence tunnel face stability are specified. The training dataset is then labeled by two-dimensional strength reduction analyses embedded within OptumG2. For any unknown instance, the second step applies the training dataset for classification, which is achieved by an ad hoc Python program. The classification of unknown samples starts with selection of instance-based training samples using the k-nearest neighbors algorithm, followed by the construction of an instance-based SVM-KNN classifier. It eventually provides labels of the unknown instances, avoiding calculate its corresponding performance function. Probabilistic evaluations are performed by Monte Carlo simulation based on the SVM-KNN classifier. The ratio of the number of unstable samples to the total number of simulated samples is computed and is taken as the failure probability, which is validated and compared with the response surface method.

• Structural Engineering and Mechanics
• /
• 제81권4호
• /
• pp.429-441
• /
• 2022

A probabilistic assessment of the seismic-excited buildings with a multiple-tuned-mass-damper (MTMD) system is carried out in the presence of uncertainties of the structural model, MTMD system, and the stochastic model of the seismic excitations. A free search optimization procedure of the individual mass, stiffness and, damping parameters of the MTMD system based on the snap-drift cuckoo search (SDCS) optimization algorithm is proposed for the optimal design of the MTMD system. Considering a 10-story structure in three cases equipped with single tuned mass damper (STMS), 5-TMD and 10-TMD, sensitivity analyses are carried out using Sobol' indices based on the Monte Carlo simulation (MCS) method. Considering different seismic performance levels, the reliability analyses are done using MCS and kriging-based MCS methods. The results show the maximum structural responses are more affected by changes in the PGA and the stiffness coefficients of the structural floors and TMDs. The results indicate the kriging-based MCS method can estimate the accurate amount of failure probability by spending less time than the MCS. The results also show the MTMD gives a significant reduction in the structural failure probability. The effect of the MTMD on the reduction of the failure probability is remarkable in the performance levels of life safety and collapse prevention. The maximum drift of floors may be reduced for the nominal structural system by increasing the TMDs, however, the complexity of the MTMD model and increasing its corresponding uncertainty sources can be caused a slight increase in the failure probability of the structure.

• 전자공학회논문지B
• /
• 제31B권1호
• /
• pp.107-114
• /
• 1994

Hardware implementation of the on-chip learning artificial neural networks is important for real-time processing. A pRAM model is based on probabilistic firing of a biological neuron and can be implemented in the VLSI circuit with learning capability. We derive a backpropagation learning algorithm for the pRAM networks and present its circuit implementation with stochastic computation. The simulation results confirm the good convergence of the learning algorithm for the pRAM networks.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2002년도 ICCAS
• /
• pp.92.3-92
• /
• 2002

A lot of localization algorithms have been developed in order to achieve autonomous navigation. However, most of localization algorithms are restricted to certain conditions. In this paper, Monte Carlo localization scheme with a map-matching algorithm is suggested as a robust localization method for the Public Service Robot to accomplish its tasks autonomously. Monte Carlo localization can be applied to local, global and kidnapping localization problems. A range image based measure function and a geometric pattern matching measure function are applied for map matching algorithm. This map matching method can be applied to both polygonal environments and un-polygonal environments and achieves...