• Journal of information and communication convergence engineering
• /
• 제16권4호
• /
• pp.213-220
• /
• 2018

With the exponential developments of social network, their fundamental role as a medium to spread information, ideas, and influence has gained importance. It can be expressed by the relationships and interactions within a group of individuals. Therefore, some models and researches from various domains have been in response to the influence maximization problem for the effects of "word of mouth" of new products. For example, in reality, more than two related social groups such as commercial companies and service providers exist within the same market issue. Under such a scenario, they called social adversaries competitively try to occupy their market influence against each other. To address the influence maximization (IM) problem between them, we propose a novel IM problem for social adversarial players (IM-SA) which are exploiting the social network attributes to infer the unknown adversary's network configuration. We sophisticatedly define mathematical closed form to demonstrate that the proposed scheme can have a near-optimal solution for a player.

• Journal of information and communication convergence engineering
• /
• 제19권2호
• /
• pp.67-72
• /
• 2021

Wireless sensor networks (WSNs) require an enormous number of sensor nodes (SNs) to maintain processing, sensing, and communication capabilities for monitoring targeted sensing regions. SNs are generally operated by batteries and have a significantly restricted energy consumption; therefore, it is necessary to discover optimization techniques to enhance network lifetime by saving energy. The principal focus is on reducing the energy consumption of packet sharing (transmission and receiving) and improving the network lifespan. To achieve this objective, this paper presents a novel improved energy-efficient cluster-based routing protocol (IECRP) that aims to accomplish this by decreasing the energy consumption in data forwarding and receiving using a clustering technique. Doing so, we successfully increase node energy and network lifetime. In order to confirm the improvement of our algorithm, a simulation is done using matlab, in which analysis and simulation results show that the performance of the proposed algorithm is better than that of two well-known recent benchmarks.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제18권3호
• /
• pp.653-669
• /
• 2024

Dynamic scene deblurring is a complex computer vision problem owing to its difficulty to model mathematically. In this paper, we present a novel approach for image deblurring with the help of the sharp reference image, which utilizes the reference image for high-quality and high-frequency detail results. To better utilize the clear reference image, we develop an encoder-decoder network and two novel modules are designed to guide the network for better image restoration. The proposed Reference Extraction and Aggregation Module can effectively establish the correspondence between blurry image and reference image and explore the most relevant features for better blur removal and the proposed Spatial Feature Fusion Module enables the encoder to perceive blur information at different spatial scales. In the final, the multi-scale feature maps from the encoder and cascaded Reference Extraction and Aggregation Modules are integrated into the decoder for a global fusion and representation. Extensive quantitative and qualitative experimental results from the different benchmarks show the effectiveness of our proposed method.

• Journal of Computing Science and Engineering
• /
• 제6권3호
• /
• pp.179-192
• /
• 2012

This paper presents novel statistical algorithms for protecting the iTrust information retrieval network against malicious attacks. In iTrust, metadata describing documents, and requests containing keywords, are randomly distributed to multiple participating nodes. The nodes that receive the requests try to match the keywords in the requests with the metadata they hold. If a node finds a match, the matching node returns the URL of the associated information to the requesting node. The requesting node then uses the URL to retrieve the information from the source node. The novel detection algorithm determines empirically the probabilities of the specific number of matches based on the number of responses that the requesting node receives. It also calculates the analytical probabilities of the specific numbers of matches. It compares the observed and the analytical probabilities to estimate the proportion of subverted or non-operational nodes in the iTrust network using a window-based method and the chi-squared statistic. If the detection algorithm determines that some of the nodes in the iTrust network are subverted or non-operational, then the novel defensive adaptation algorithm increases the number of nodes to which the requests are distributed to maintain the same probability of a match when some of the nodes are subverted or non-operational as compared to when all of the nodes are operational. Experimental results substantiate the effectiveness of the detection and defensive adaptation algorithms for protecting the iTrust information retrieval network against malicious attacks.

• 한국위성정보통신학회논문지
• /
• 제9권3호
• /
• pp.80-85
• /
• 2014

본 논문에서 우리는 최근 신속하게 발전되고있는 유비쿼터스 홈 네트워크 시스템 구현에 있어서 적용 가능한 새로운 신호 검출 기법 및 동기화 기법을 제안하고 그 성능을 분석하였다. 개인용 전자기기 및 건물에 설치되는 Access point 등 무선 통신 인프라가 다양하게 공존하는 유비쿼터스 홈 네트워크 시스템에서는 본 논문의 핵심 기술인 무선 간섭환경에서의 동기화 장치와 신호 검출 장치에 대한 연구가 필수적이며 구현에 있어서 매우 중요한 부분을 차지하고 있다. 그래서 우리는 디지털 워터마킹 시퀀스를 이용하여 시스템에 오버헤드 없이 멀티페스 페이딩을 비롯한 다양한 간섭환경에서 성공적으로 신호를 검출할 수 있는 제안한 시스템에 대한 성능을 모의실험을 통해 나타내었다. 본 논문 결과를 이용하여 다양한 전자기기간 서로의 신호들이 독립성을 보장받아 공존하는 유비쿼터스 홈 네트워크 시스템의 구현을 기대한다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제12권6호
• /
• pp.2680-2696
• /
• 2018

The collaborative content caching system is an effective solution developed in recent years to reduce transmission delay and network traffic. In order to decrease the service end-to-end transmission delay for future 5G ultra-dense networks (UDN), this paper proposes a novel service migration method that can guarantee the continuity of service and simultaneously reduce the traffic flow in the network. In this paper, we propose a service migration optimization model that minimizes the cumulative transmission delay within the constraints of quality of service (QoS) guarantee and network condition. Subsequently, we propose an improved firefly algorithm to solve this optimization problem. Simulation results show that compared to traditional collaborative content caching schemes, the proposed algorithm can significantly decrease transmission delay and network traffic flow.

• Journal of Communications and Networks
• /
• 제18권1호
• /
• pp.123-131
• /
• 2016

The high-availability seamless redundancy (HSR) protocol is one of the most important redundancy IEC standards that has garnered a great deal of attention because it offers a redundancy with zero recovery time, which is a feature that is required by most of the modern substation, smart grid, and industrial field applications. However, the HSR protocol consumes a lot of network bandwidth compared to the Ethernet standard. This is due to the duplication process for every sent frame in the HSR networks. In this paper, a novel algorithm known as the reducing multicast traffic (RMT) is presented to reduce the unnecessary redundant multicast traffic in HSR networks by limiting the spreading of the multicast traffic to only the rings that have members associated with that traffic instead of spreading the traffic into all the network parts, as occurs in the standard HSR protocol. The mathematical and the simulation analyses show that the RMT algorithm offers a traffic reduction percentage with a range of about 60-87% compared to the standard HSR protocol. Consequently, the RMT algorithm will increase the network performance by freeing more bandwidth so as to reduce HSR network congestion and also to minimize any intervention from the network administrator that would be required when using traditional traffic filtering techniques.

• International Journal of Computer Science & Network Security
• /
• 제23권7호
• /
• pp.71-78
• /
• 2023

Employee turnover is one of the most important challenges facing modern organizations. It causes job experiences and skills such as distinguished faculty members in universities, rare-specialized doctors, innovative engineers, and senior administrators. HR analytics has enhanced the area of data analytics to an extent that institutions can figure out their employees' characteristics; where inaccuracy leads to incorrect decision making. This paper aims to develop a novel model that can help decision-makers to classify the problem of Employee Turnover. By using feature selection methods: Information Gain and Chi-Square, the most important four features have been extracted from the dataset. These features are over time, job level, salary, and years in the organization. As one of the important results of this research, these features should be planned carefully to keep organizations their employees as valuable assets. The proposed model based on machine learning algorithms. Classification algorithms were used to implement the model such as Decision Tree, SVM, Random Frost, Neuronal Network, and Naive Bayes. The model was trained and tested by using a dataset that consists of 1470 records and 25 features. To develop the research model, many experiments had been conducted to find the best one. Based on implementation results, the Neural Network algorithm is selected as the best one with an Accuracy of 84 percents and AUC (ROC) 74 percents. By validation mechanism, the model is acceptable and reliable to help origination decision-makers to manage their employees in a good manner.

• Journal of Information Processing Systems
• /
• 제14권6호
• /
• pp.1464-1479
• /
• 2018

In face recognition, sometimes the number of available training samples for single category is insufficient. Therefore, the performances of models trained by convolutional neural network are not ideal. The small sample face recognition algorithm based on novel Siamese network is proposed in this paper, which doesn't need rich samples for training. The algorithm designs and realizes a new Siamese network model, SiameseFacel, which uses pairs of face images as inputs and maps them to target space so that the $L_2$ norm distance in target space can represent the semantic distance in input space. The mapping is represented by the neural network in supervised learning. Moreover, a more lightweight Siamese network model, SiameseFace2, is designed to reduce the network parameters without losing accuracy. We also present a new method to generate training data and expand the number of training samples for single category in AR and labeled faces in the wild (LFW) datasets, which improves the recognition accuracy of the models. Four loss functions are adopted to carry out experiments on AR and LFW datasets. The results show that the contrastive loss function combined with new Siamese network model in this paper can effectively improve the accuracy of face recognition.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2005년도 추계종합학술대회
• /
• pp.1027-1030
• /
• 2005

We proposed and demonstrated a novel technology for IP network setup in a mobile Ad-Hoc network. The proposed method enables the users to setup connections automatically between Ad-Hoc nodes.