• 제목/요약/키워드: Information Source Selection

검색결과 304건 처리시간 0.027초

선행 복호 정보를 활용한 버퍼기반 연쇄적 중계 기법 (A Buffer-Aided Successive Relaying Technique with a Priori Decoding Information)

  • 이병수;정방철;반태원
    • 한국정보통신학회논문지
    • /
    • 제20권2호
    • /
    • pp.275-280
    • /
    • 2016
  • 본 논문은 버퍼가 장착된 복수개의 중계기가 존재하는 연쇄적 데이터 중계 네트워크에서 각 중계기가 이미 복호에 성공한 정보를 활용하여 인접 중계기로부터의 간섭을 원천적으로 제거하는 새로운 중계 기법을 제안한다. 기존의 버퍼기반 중계 선택기술에서는 송신단으로부터 데이터를 수신할 중계기와 수신단으로 데이터를 전송할 중계기를 각각 하나씩 선택한다. 그러나 제안된 중계 기법에서는 수신단으로 데이터를 전송할 중계기가 선택된 후 나머지 모든 중계기들은 송신단으로부터 도착한 신호의 복호를 시도하고 복호에 성공한 모든 중계기들은 자신의 버퍼에 복호된 신호를 저장한다. 제안된 기법에서는 자신이 데이터를 전송했을 때, 자신의 신호가 수신단에 성공적으로 도착하면서 동시에 송신단으로부터 도착한 신호 복호에 성공하는 중계기의 수를 최대화하는 중계기가 선택된다. 컴퓨터 시뮬레이션을 통하여 제안된 중계기 선택 방식이 기존 중계기 선택 기법에 비해 훨씬 더 좋은 성능을 보이는 것을 확인한다.

협력 통신에서 중첩 변조를 활용한 최적의 중계단 선정 및 적응적 전송률 향상 기법 (An Optimal Relay Selection and Adaptive Throughput Enhancement Scheme Utilizing Superposition Modulation)

  • 강성진
    • 한국통신학회논문지
    • /
    • 제40권10호
    • /
    • pp.1934-1936
    • /
    • 2015
  • 본 논문은 협력 통신에서 중첩변조를 활용한 최적의 중계단 선정 및 적응적 전송률 향상 기법을 제안한다. 중첩변조를 활용한 중계단 선정 신호를 활용해 최적의 중계단을 선정함과 동시에 채널 상태를 추정하여 중첩되는 신호의 수를 결정하여 채널 상태에 따라 적응적으로 전송률을 향상시키는 기법을 제안한다.

Selection Based Cooperative Beamforming and Power Allocation for Relay Networks

  • Liu, Yi;Nie, Weiqing
    • Journal of Communications and Networks
    • /
    • 제13권4호
    • /
    • pp.377-384
    • /
    • 2011
  • Cooperative beamforming has previously been proven to be an efficient way to improve the cooperative diversity. This method generally requires all relay nodes to participate in beamforming, which can be seen as "all participate" cooperative beamforming. However, not all relay nodes have constructive impacts on the end-to-end bit error rate (BER) performance. Based on this observation, we propose a new cooperative scheme which only selects those "appropriate" relay nodes to perform cooperative beamforming. Such relay nodes can be simply determined with mean channel gains. Therefore, the selection complexity is significantly reduced as global instantaneous channel state information is not required. This scheme guarantees that energy is only allocated to the "appropriate" relay nodes, and hence provides superior diversity. We also prove that power allocation among source and selected relay nodes is a convex problem, and can be resolved with lower computational complexity. Simulation results demonstrate that our scheme achieves an essential improvement in terms of BER performance for both optimal and limited feedback scenarios, as well as high energy-efficiency for the energy-constrained networks.

Feature Selection to Mine Joint Features from High-dimension Space for Android Malware Detection

  • Xu, Yanping;Wu, Chunhua;Zheng, Kangfeng;Niu, Xinxin;Lu, Tianling
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제11권9호
    • /
    • pp.4658-4679
    • /
    • 2017
  • Android is now the most popular smartphone platform and remains rapid growth. There are huge number of sensitive privacy information stored in Android devices. Kinds of methods have been proposed to detect Android malicious applications and protect the privacy information. In this work, we focus on extracting the fine-grained features to maximize the information of Android malware detection, and selecting the least joint features to minimize the number of features. Firstly, permissions and APIs, not only from Android permissions and SDK APIs but also from the developer-defined permissions and third-party library APIs, are extracted as features from the decompiled source codes. Secondly, feature selection methods, including information gain (IG), regularization and particle swarm optimization (PSO) algorithms, are used to analyze and utilize the correlation between the features to eliminate the redundant data, reduce the feature dimension and mine the useful joint features. Furthermore, regularization and PSO are integrated to create a new joint feature mining method. Experiment results show that the joint feature mining method can utilize the advantages of regularization and PSO, and ensure good performance and efficiency for Android malware detection.

A Global Graph-based Approach for Transaction and QoS-aware Service Composition

  • Liu, Hai;Zheng, Zibin;Zhang, Weimin;Ren, Kaijun
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제5권7호
    • /
    • pp.1252-1273
    • /
    • 2011
  • In Web Service Composition (WSC) area, services selection aims at selecting an appropriate candidate from a set of functionally-equivalent services to execute the function of each task in an abstract WSC according to their different QoS values. In despite of many related works, few of previous studies consider transactional constraints in QoS-aware WSC, which guarantee reliable execution of Composite Web Service (CWS) that is composed by a number of unpredictable web services. In this paper, we propose a novel global selection-optimal approach in WSC by considering both transactional constraints and end-to-end QoS constraints. With this approach, we firstly identify building rules and the reduction method to build layer-based Directed Acyclic Graph (DAG) model which can model transactional relationships among candidate services. As such, the problem of solving global optimal QoS utility with transactional constraints in WSC can be regarded as a problem of solving single-source shortest path in DAG. After that, we present Graph-building algorithms and an optimal selection algorithm to explain the specific execution procedures. Finally, comprehensive experiments are conducted based on a real-world web service QoS dataset. The experimental results show that our approach has better performance over other competing selection approaches on success ratio and efficiency.

Energy Efficiency Enhancement of TICK -based Fuzzy Logic for Selecting Forwarding Nodes in WSNs

  • Ashraf, Muhammad;Cho, Tae Ho
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제12권9호
    • /
    • pp.4271-4294
    • /
    • 2018
  • Communication cost is the most important factor in Wireless Sensor Networks (WSNs), as exchanging control keying messages consumes a large amount of energy from the constituent sensor nodes. Time-based Dynamic Keying and En-Route Filtering (TICK) can reduce the communication costs by utilizing local time values of the en-route nodes to generate one-time dynamic keys that are used to encrypt reports in a manner that further avoids the regular keying or re-keying of messages. Although TICK is more energy efficient, it employs no re-encryption operation strategy that cannot determine whether a healthy report might be considered as malicious if the clock drift between the source node and the forwarding node is too large. Secure SOurce-BAsed Loose Synchronization (SOBAS) employs a selective encryption en-route in which fixed nodes are selected to re-encrypt the data. Therefore, the selection of encryption nodes is non-adaptive, and the dynamic network conditions (i.e., The residual energy of en-route nodes, hop count, and false positive rate) are also not focused in SOBAS. We propose an energy efficient selection of re-encryption nodes based on fuzzy logic. Simulation results indicate that the proposed method achieves better energy conservation at the en-route nodes along the path when compared to TICK and SOBAS.

인터넷 쇼핑 성향에 따른 한국과 중국 소비자의 의류 제품 구매행동 (Apparel Purchase Behaviors of Korean and Chinese Consumers according to Internet Shopping Orientation)

  • 주예;이지연;박재옥
    • 한국의상디자인학회지
    • /
    • 제15권3호
    • /
    • pp.51-67
    • /
    • 2013
  • This study aims to examine impacts of the Internet shopping orientation of Korean and Chinese consumers on their selection criteria of shopping malls and apparel products, frequencies and amounts of purchase, and information search in the Internet shopping mall. A survey was carried out with Korean and Chinese female consumers in their 20s and 30s who have the Internet shopping experiences. The results of this study were as follows: First, the Internet shopping orientation of Korean and Chinese respondents clearly showed factorial structures including the pleasure-conscious, fashion-conscious, price-conscious, and convenience-conscious orientation. From a result of the cluster analysis on four factors of the Internet shopping orientation, Korean and Chinese respondents were classified into three groups of the Internet shopping-unconscious, the Internet shopping-loyalty, and pleasure convenience-conscious. Second, there were significant differences in selection criteria of both the Internet shopping mall and apparel products among three groups of the Internet shopping orientation in Korea and China. Third, significant differences were identified in visiting frequencies, apparel purchase frequencies and amounts, payment methods, and information sources during the Internet shopping among three groups of the Internet shopping orientation in Korea and China.

  • PDF

Neighborhood 러프집합 모델을 활용한 유방 종양의 진단적 특징 선택 (A Diagnostic Feature Subset Selection of Breast Tumor Based on Neighborhood Rough Set Model)

  • 손창식;최락현;강원석;이종하
    • 한국산업정보학회논문지
    • /
    • 제21권6호
    • /
    • pp.13-21
    • /
    • 2016
  • 특징선택은 데이터 마이닝, 기계학습 분야에서 가장 중요한 이슈 중 하나로, 원본 데이터에서 가장 좋은 분류 성능을 보여줄 수 있는 특징들을 찾아내는 방법이다. 본 논문에서는 정보 입자성을 기반으로 한 neighborhood 러프집합 모델을 이용한 특징선택 방법을 제안한다. 제안된 방법의 효과성은 5,252명의 유방 초음파 영상으로부터 추출된 298가지의 특징들 중에서 유방 종양의 진단과 관련된 유용한 특징들을 선택하는 문제에 적용되었다. 실험결과 19가지의 진단적 특징을 찾을 수 있었고, 이때에 평균 분류 정확성은 97.6%를 보였다.

골프장 트러스구조 구조안전성 검토사례 (Analysis of structure stability of Golf structure of truss)

  • 강동균;윤성원;홍현표
    • 한국공간정보시스템학회:학술대회논문집
    • /
    • 한국공간정보시스템학회 2004년도 춘계 학술발표회 논문집 제1권1호(통권1호)
    • /
    • pp.275-278
    • /
    • 2004
  • This paper focused on problems of design, construction, and maintenance caused by construction implementation processes. They were analyzed through case study of structure safety diagnosis projects. From the case study, it is expected that the introduction of Construction Management from the first stage of procurement will improve construction cost increase or burden on small design company. It strengthens coherent management from design and source contractor selection to build review of responsibility. The coherency will prevent changes in designing or infirm unreliable construction. It is desirable that expert opinions are considered when structure changes and establishment occur and that, if necessary, actions such as source selection, periodic audits, and diagnosis arc checked and fed back to maintenance.

  • PDF

Gateway Discovery Algorithm Based on Multiple QoS Path Parameters Between Mobile Node and Gateway Node

  • Bouk, Safdar Hussain;Sasase, Iwao;Ahmed, Syed Hassan;Javaid, Nadeem
    • Journal of Communications and Networks
    • /
    • 제14권4호
    • /
    • pp.434-442
    • /
    • 2012
  • Several gateway selection schemes have been proposed that select gateway nodes based on a single Quality of Service (QoS) path parameter, for instance path availability period, link capacity or end-to-end delay, etc. or on multiple non-QoS parameters, for instance the combination of gateway node speed, residual energy, and number of hops, for Mobile Ad hoc NETworks (MANETs). Each scheme just focuses on the ment of improve only a single network performance, i.e., network throughput, packet delivery ratio, end-to-end delay, or packet drop ratio. However, none of these schemes improves the overall network performance because they focus on a single QoS path parameter or on set of non-QoS parameters. To improve the overall network performance, it is necessary to select a gateway with stable path, a path with themaximum residual load capacity and the minimum latency. In this paper, we propose a gateway selection scheme that considers multiple QoS path parameters such as path availability period, available capacity and latency, to select a potential gateway node. We improve the path availability computation accuracy, we introduce a feedback system to updated path dynamics to the traffic source node and we propose an efficient method to propagate QoS parameters in our scheme. Computer simulations show that our gateway selection scheme improves throughput and packet delivery ratio with less per node energy consumption. It also improves the end-to-end delay compared to single QoS path parameter gateway selection schemes. In addition, we simulate the proposed scheme by considering weighting factors to gateway selection parameters and results show that the weighting factors improve the throughput and end-to-end delay compared to the conventional schemes.