• Title/Summary/Keyword: set sharing

Search Result 346, Processing Time 0.027 seconds

Frequency Sharing with FSS Earth Stations for CBRS Services (CBRS 서비스를 위한 FSS 지구국 주파수 공동사용)

  • Kang, Young-Heung
    • Journal of Advanced Navigation Technology
    • /
    • v.23 no.6
    • /
    • pp.507-514
    • /
    • 2019
  • Federal communications commissions (FCC) has announced the first set of rules for 3.5 GHz (3,550 - 3,700 MHz) band used Navy radar and fixed satellite service (FSS) earth stations as primary service to sharing for citizen broadband radio service (CBRS) enable development of relatively low powered network technologies like small cells. Since CBRS sharing technique based on the 3-tiered spectrum access system (SAS) is able to protect the higher tiered users from harmful interference from lower tiered users, it has been considered actively to be introduced in Korea. However, 3.5 GHz band had been already allocated to the 5G services in Korea, the sharing studies have been carried out for 3,700 - 5,000 MHz, As the result, the 3.8 GHz (3,800 - 3,900 MHz) band used for only FSS system is able to be sharing, and an introduction of CBRS has been proposed in Korea by analyzing the interference to the FSS earth stations.

Enhancing the Security of Credit Card Transaction based on Visual DSC

  • Wei, Kuo-Jui;Lee, Jung-San;Chen, Shin-Jen
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.9 no.3
    • /
    • pp.1231-1245
    • /
    • 2015
  • People have transferred their business model from traditional commerce to e-commerce in recent decades. Both shopping and payment can be completed through the Internet and bring convenience to consumers and business opportunities to industry. These trade techniques are mostly set up based on the Secure Sockets Layer (SSL). SSL provides the security for transaction information and is easy to set up, which makes it is widely accepted by individuals. Although attackers cannot obtain the real content even when the transferred information is intercepted, still there is risk for online trade. For example, it is impossible to prevent credit card information from being stolen by virtual merchant. Therefore, we propose a new mechanism to solve such security problem. We make use of the disposable dynamic security code (DSC) to replace traditional card security code. So even attackers get DSC for that round of transaction, they cannot use it for the next time. Besides, we apply visual secret sharing techniques to transfer the DSC, so that interceptors cannot retrieve the real DSC even for one round of trade. This way, we can improve security of credit card transaction and reliability of online business. The experiments results validate the applicability and efficiency of the proposed mechanism.

Load Sharing Control of Driven Roll in Continuous Caster (연속주조기에서 스트랜드 구동롤의 인발력 분배 제어)

  • 천창근;김철우
    • The Transactions of the Korean Institute of Power Electronics
    • /
    • v.8 no.4
    • /
    • pp.321-327
    • /
    • 2003
  • As the continuous casting process is to product slab with high temperature liquid steel, the main role of strand driven roll is to withdraw slab from mold as operator set up casting speed pattern. The strand driven roll in old cast machine is controlled casting speed only. Due to inaccuracies in drive setting up, varying roll diameters, bulging in the product, withdrawal force was distributed irregularly. As a result, because of horizontal crack in slab comer, high casting speed can't be achieved. In this paper, the correlation between the distribution of withdrawal force and slab quality is investigated and the new control algorithm which can be distributed regularly the withdrawal force of strand driven roll is proposed. The principle of proposed algorithm is not to control motor torque directly but to control motor speed reference according to sharing ratio of withdrawal force which is set up in high level controller. The proposed algorithm implemented in POSCO Kwangyang 1-4 continuous casting plant.

Centralized Channel Allocation Schemes for Incomplete Medium Sharing Systems with General Channel Access Constraints (불완전매체공유 시스템을 위한 집중방식 채널할당기법)

  • Kim Dae-Woo;Lee Byoung-Seok;Choe Jin-Woo
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.31 no.3B
    • /
    • pp.183-198
    • /
    • 2006
  • We define the incomplete medium sharing system as a multi-channel shared medium communication system where constraints are imposed to the set of channels that may be allocated to some transmitter-receiver node pairs. To derive a centralized MAC scheme of a incomplete medium sharing system, we address the problem of optimal channel allocation The optimal channel allocation problem is then translated into a max-flow problem in a multi-commodity flow graph, and it is shown that the optimal solution can then be obtained by solving a linear programming problem. In addition, two suboptimal channel allocation schemes are proposed to bring down the computational complexity to a practical/feasible level; (1) one is a modified iSLIP channel allocation scheme, (2) the other is sequential channel allocation scheme. From the results of a extensive set of numerical experiments, it is found that the suboptimal schemes evaluate channel utilization close to that of the optimal schemes while requiring much less amount of computation than the optimal scheme. In particular, the sequential channel allocation scheme is shown to achieve higher channel utilization with less computational complexity than . the modified iSLIP channel allocation scheme.

Ontology Mapping using Semantic Relationship Set of the WordNet (워드넷의 의미 관계 집합을 이용한 온톨로지 매핑)

  • Kwak, Jung-Ae;Yong, Hwan-Seung
    • Journal of KIISE:Databases
    • /
    • v.36 no.6
    • /
    • pp.466-475
    • /
    • 2009
  • Considerable research in the field of ontology mapping has been done when information sharing and reuse becomes necessary by a variety of ontology development. Ontology mapping method consists of the lexical, structural, instance, and logical inference similarity computing. Lexical similarity computing used in most ontology mapping methods performs an ontology mapping by using the synonym set defined in the WordNet. In this paper, we define the Super Word Set including the hypenym, hyponym, holonym, and meronym set and propose an ontology mapping method using the Super Word Set. The results of experiments show that our method improves the performance by up to 12%, compared with previous ontology mapping method.

A Study of Vlog that Analyze Variables Affecting Perceived Enjoyment : Using Social Communication as a Control Variable

  • Yu, Giseob;Lim, Jeong Hun;Cho, Namjae
    • Journal of Information Technology Applications and Management
    • /
    • v.27 no.5
    • /
    • pp.23-33
    • /
    • 2020
  • As the 4G and 5G Internet technologies become more common and developed, an environment for uploading and watching videos is created and spread, in addition to simply uploading posts. Watching and sharing daily life among media contents called Vlog, are very common more than ever. This means that individual users could access Vlog easily and the situation could be new trend. Additionally, academic research about Volg is increasing. We analyzed three independent variables affecting a perceived enjoyment we set up the dependent variable. Information search, self-expression, and social need are set as independent variables and social interaction is set as the control variable. Information search and self-expression are significant effect to perceived enjoyment except social need. In particular, social interaction as a control variable has effect to all relationships.

A Coordinated Planning Model with Price-Dependent Demand

  • Nagarur, Nagendra N.;Iaprasert, Wipanan
    • Industrial Engineering and Management Systems
    • /
    • v.8 no.1
    • /
    • pp.1-13
    • /
    • 2009
  • This paper presents a coordinated planning model of price-dependent demand for a single-manufacturer and a single-retailer. The demand is assumed to be normally distributed, with its mean being price dependent. The manufacturer and retailer coordinate with each other to jointly and simultaneously determine the retail selling price and the retailer order quantity to maximize the joint expected total profit. This model is then compared to a 'returns' policy model where manufacturer buys back unsold items from the retailers. It is shown that the optimal total profit is higher for coordinated planning model than that for the returns policy model, in which the retail price is set by the retailer. A compensation or profit sharing scheme is then suggested and it is shown that the coordinated model with profit sharing yields a 'win-win' situation. Numerical results are presented to illustrate the profit patterns for both linear and nonlinear demand functions. The coordinated planning model, in addition, has a lower optimal price than for a returns policy model, which would result in higher sales, thus expanding the markets for the whole supply chain.

User-to-User Matching Services through Prediction of Mutual Satisfaction Based on Deep Neural Network

  • Kim, Jinah;Moon, Nammee
    • Journal of Information Processing Systems
    • /
    • v.18 no.1
    • /
    • pp.75-88
    • /
    • 2022
  • With the development of the sharing economy, existing recommender services are changing from user-item recommendations to user-user recommendations. The most important consideration is that all users should have the best possible satisfaction. To achieve this outcome, the matching service adds information between users and items necessary for the existing recommender service and information between users, so higher-level data mining is required. To this end, this paper proposes a user-to-user matching service (UTU-MS) employing the prediction of mutual satisfaction based on learning. Users were divided into consumers and suppliers, and the properties considered for recommendations were set by filtering and weighting. Based on this process, we implemented a convolutional neural network (CNN)-deep neural network (DNN)-based model that can predict each supplier's satisfaction from the consumer perspective and each consumer's satisfaction from the supplier perspective. After deriving the final mutual satisfaction using the predicted satisfaction, a top recommendation list is recommended to all users. The proposed model was applied to match guests with hosts using Airbnb data, which is a representative sharing economy platform. The proposed model is meaningful in that it has been optimized for the sharing economy and recommendations that reflect user-specific priorities.

Automated Signature Sharing to Enhance the Coverage of Zero-day Attacks (제로데이 공격 대응력 향상을 위한 시그니처 자동 공유 방안)

  • Kim, Sung-Ki;Jang, Jong-Soo;Min, Byoung-Joon
    • Journal of KIISE:Information Networking
    • /
    • v.37 no.4
    • /
    • pp.255-262
    • /
    • 2010
  • Recently, automated signature generation systems(ASGSs) have been developed in order to cope with zero-day attacks with malicious codes exploiting vulnerabilities which are not yet publically noticed. To enhance the usefulness of the signatures generated by (ASGSs) it is essential to identify signatures only with the high accuracy of intrusion detection among a number of generated signatures and to provide them to target security systems in a timely manner. This automated signature exchange, distribution, and update operations have to be performed in a secure and universal manner beyond the border of network administrations, and also should be able to eliminate the noise in a signature set which causes performance degradation of the security systems. In this paper, we present a system architecture to support the identification of high quality signatures and to share them among security systems through a scheme which can evaluate the detection accuracy of individual signatures, and also propose a set of algorithms dealing with exchanging, distributing and updating signatures. Though the experiment on a test-bed, we have confirmed that the high quality signatures are automatically saved at the level that the noise rate of a signature set is reduced. The system architecture and the algorithm proposed in the paper can be adopted to a automated signature sharing framework.

Distributed CSMA/CA Medium Access Control for Incomplete Medium Sharing Systems with General Channel Access Constraints (불완전매체공유 환경을 위한 CSMA/CA기반 분산방식 매체접근제어기법)

  • Lee Byoung-Seok;Jeon Byoung-Wook;Choe Jin-Woo
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.31 no.5B
    • /
    • pp.365-377
    • /
    • 2006
  • We define the incomplete medium sharing system as a multi-channel shared medium communication system where any types of constraints are imposed to the set of channels that may be allocated to any transmitter-receiver node pair. A set of distributed MAC schemes are proposed, all of which are based on the CSMA/CA scheme employed in IEEE 802. 11 WLAN standards. Distributed MAC schemes are proposed in three different forms, which can be differentiated by the number and the location of back-off timers; that is, (1) one timer for all queues destined for different receiver nodes, (2) multiple timers at individual transmission queues, (3) multiple timers for individual channels. Through an extensive set of computer simulations, the performances of the proposed MAC schemes show that the MAC scheme with timers at individual transmission queues outperform the others in terms of throughput and delay for most cases considered. The complexity of the proposed schemes is also compared, and the first scheme obviously turned out to be the simplest, and the complexity of the second and third schemes depends on the number of receiver nodes and the number of channels, respectively.