• Title/Summary/Keyword: Optimal number of users

Search Result 150, Processing Time 0.029 seconds

A Service Selection Method using Trust Evaluation in QoS based Web Services Composition (QoS 기반 웹서비스 조합에서 신뢰성 평가를 통한 서비스 선택 기법)

  • Kim, Yu-Kyong;Ko, Byung-Sun
    • Journal of KIISE:Software and Applications
    • /
    • v.36 no.1
    • /
    • pp.1-9
    • /
    • 2009
  • In heterogeneous and distributed computing environments, with an increasing number of Web services providing similar functionalities, the reliability of Web services is a critical decision factor. To fulfill the open business model such as cooperation among enterprises, several Web services can be composed into the upper level business transaction. In Web services composition, the reliability of services is more and more critical. Though each unit Web service can be reliable, the reliability of the composed service is not guaranteed. Thus a way to efficiently assess and select composed Web services is needed. In this paper, we define new metrics for measuring the trust value of Web services, and propose an evaluation method to predict the trustworthy degree of the composed services based on the metrics. We also define a conceptual framework to support optimal Web services selection based on the proposed trust evaluation method. By selecting using the quantitative measurement rather than intuitive selection of the service user, it allows the service users to select the high reliable service meeting their quality requirements well.

A Study on Database System for Hostorical Booking of Korean Railroad (한국철도의 예약실적 데이터베이스 시스템에 관한 연구)

  • Oh, Seog-Moon;Hwang, Jong-Gyu;Hyeon, Seung-Ho;Kim, Yong-Gyu;Lee, Jong-Woo;Kim, Young-Hoon;Hong, Soon-Heum;Park, Jong-Bin
    • Proceedings of the KIEE Conference
    • /
    • 1998.07a
    • /
    • pp.371-374
    • /
    • 1998
  • The construction of the transportation history database system is to serve the scheduling and seat inventory controling. Recently, lots of countries have been faced with the advance era because of the new railway transportation system, like the high speed railway and/or magnetic levitation vehicle system. This can be reasonably translated as those of operators are willing to provide the more various and high quality schedule to the customer. Those operators these ideas make possible to forecast that scheduling process is going to be complicated more and more. The seat inventory control, so to speak Yield Management System(YMS), goes a long way to improve the total passenger revenue at the railway business. The YMS forecasts the number of the last reservation value(DCP# END) and recommends the optimal values on the seat sales. The history database system contains infra-data(ie, train, seat, sales) that will be the foundation of scheduling and seat inventory control application programs. The development of the application programs are reserved to the next step. The database system is installed on the pc platform (IBM compatible), using the DB2(RDBMS). And at next step, the platform and DBMS will be considered whether they can meet the users' requirement or not.

  • PDF

Development of Tree Structures and Algorithms for the Efficient Group Key Management in Multicast Environment (멀티캐스트 환경에서 효율적인 그룹키 관리를 위한 트리구조 및 알고리즘 개발)

  • Han, Keun-Hee
    • The KIPS Transactions:PartB
    • /
    • v.9B no.5
    • /
    • pp.587-598
    • /
    • 2002
  • In multicast environment, the main objective of group key management is to provide security services to group communications by sharing a single group key among all the members of the group and subsequently encrypting and decrypting all the communication messages exchanged among the members of the group. Up to now, there has been no effort to develop group key management mechanism that considers the rate of users' join/leave operations. Hence, in this research, we propose group key management mechanisms that consider the rate of user's join/leave operations. We also define a new tree structure called variable tree which is much more flexible than full regular trees and show that variable trees are more efficient than full regular trees for group key management. Especially, we propose an algorithm that minimizes the necessary number of rekey messages according to the rate of join and leave operations. We also shows that if the rate of leave operation is greater than 50%, then the tree structure with degrees 2 or 3 are the optimal structures.

Interference Analysis of the European Digital Terrestrial Broadcasting Service and the Personal/Portable TVBD based on Spectrum Cognition (유럽형 디지털 지상파 방송 서비스와 스펙트럼 인지 기반 개인/휴대형 TVBD와의 간섭분석)

  • Choi, Joo-Pyoung;Chang, Hyung-Min;Lee, Won-Cheol
    • Journal of Satellite, Information and Communications
    • /
    • v.7 no.3
    • /
    • pp.1-7
    • /
    • 2012
  • In this paper, we was performed the interference analysis to determine an optimal coexisting criteria for the european digital video broadcasting service (DVB-T2) and the IMT-advanced LTE based TV Band Device (TVBD). The TVBD was equipped with the spectrum cognition method. To this end, we set the various transmission parameters, that includes the emission and blocking mask, antenna height and gain, transmission power and bandwidth, channel model etc. Based on this parameters, we were calculated the allowable transmit power, the number of TVBD and the change in probability of interference for the TVBD user operating in the adjacent channels of the DVB-T2 user. Also this paper presents how many TVBD users can sharing with DVB-T2 for spectral cognition performance.

A Cognitive Study on the Usability of Cross-referencing link ad Multiple hierarchies (교차적 연결과 다계층구조의 유용성에 관한 인지적 연구 : 사이버쇼핑몰의 커스터머 인터페이스를 중심으로)

  • 이정원;김진우
    • Korean Journal of Cognitive Science
    • /
    • v.10 no.1
    • /
    • pp.25-43
    • /
    • 1999
  • The focus of this study is on the elements of structure design that facilitate u user interaction with applications within cyberspace Structure design entails decisions regarding the optimal classification and hierarchical organization of information into s successively higher units. i.e .. the grouping of highly related information in the form of nodes of a site and the subsequent connection of nodes that are inter-related. The decisions are based on the designer's subjective classification framework. which is not always compatible with that of the user. We propose that the ensuing cognitive dissonance can be reduced via the employment of multiple hierarchies and cross-referencing links. Multiple hierarchies represent a single information space in terms of a number of single hierarchies. each of which represent a different perspective Cross-referencing refers to the inter-connection between the constituent hierarchies by providing a link to the alternate hierarchy for information that is most likely to be categorized in diverse manners by users with differing perspectives. In this study we conducted two empirical studies to gauge the effectiveness of multiple hierarchies and Cross-referencing links in the domain of cyber shopping malls. In the first phase. an experiment was conducted to determine how subjects classified given products with respect to two different perspectives for categorization. Experimental cyber malls were developed based on the results from the first phase to test the effectiveness of multiple hierarchies and cross-referencing links. Results show that the ease of navigation was higher for cyber malls that had implemented cross-referencing links are of greater value when used in conjunction with single hierarchical designs rather than multiple hierarchies. Users satisfaction with and ease of navigation was higher for cyber malls that had not implemented multiple hierarchies. This paper concludes with discussion of these results and their implications for designers of cyber malls.

  • PDF

A Study on the Development Strategy of VR Game Content by Group Based on Conjoint Analysis (컨조인트 분석을 통한 집단별 VR게임콘텐츠의 개발 전략에 관한 연구)

  • Lee, Ho Seok;Jeong, Jong In;Lee, Bong Gyou
    • Journal of Internet Computing and Services
    • /
    • v.21 no.1
    • /
    • pp.137-146
    • /
    • 2020
  • VR(Virtual Reality), which has drawn attention as a major area in ICT, is currently being used in various fields, including medical care, movies and architecture. Although VR technology is used in various fields, contents are mainly developed by creators where needs of users are easily left out of consideration leading to failure in forming a consensus between UI(User Interface) and UX(user experience). To identify the consumer preference and attribute level of VR game content, which is responsible for the largest proportion of VR contents, this study was designed to examine the consumers' preference properties of VR game contents through a Conjoint Analysis and derive the relative importance and weightings of each group. The study collected 166 questionnaires over a total of three months from May to July 2019, 150 of which were completed (90.4%). Statistic analysis was conducted using SPSS Ver. 25.0. The results of the study showed that the genre of the game (42.6%), number of players (24.0%), price for payment (20.3%) and game planning (13.1%) were important attributes in choosing VR games. The optimal mix of attributes was derived with new games, RPGs, multi-play and medium price (22,000 KRW). Before mentioning technology in the expectations of users who use VR game content, which is the most preferred among VR contents, this study recognized the need to have a fun and new experience through VR game content. Therefore, it is expected that this will serve as a reference for consumer behavior of VR game contents and research on VR game contents development.

A Study on Virtual Source-based Differentiated Multicast Routing and Wavelength Assignment Algorithms in the Next Generation Optical Internet based on DWDM Technology (DWDM 기반 차세대 광 인터넷 망에서 VS기반의 차등화된 멀티캐스트 라우팅 및 파장할당 알고리즘 연구)

  • Kim, Sung-Un;Park, Seon-Yeong
    • Journal of Korea Multimedia Society
    • /
    • v.14 no.5
    • /
    • pp.658-668
    • /
    • 2011
  • Over the past decade, the improvement of communications technologies and the rapid spread of www (World Wide Web) have brought on the exponential growth of users using Internet and real time multimedia multicast services like video conferencing, tele-immersive virtual reality, and Internet games. The dense-wavelength division multiplexing (DWDM) networks have been widely accepted as a promising approach to meet the ever-increasing bandwidth demands of Internet users, especially in next generation Internet backbone networks for nation-wide or global coverage. A major challenge in the next generation Internet backbone networks based on DWDM technologies is the resolution of the multicasting RWA (Routing and Wavelength Assignment) problem; given a set of wavelengths in the DWDM network, we set up light-paths by routing and assigning a wavelength for each connection so that the multicast connections are set-upped as many as possible. Finding such optimal multicast connections has been proven to be Non-deterministic Polynomial-time-complete. In this paper, we suggest a new heuristic multicast routing and wavelength assignment method for multicast sessions called DVS-PMIPMR (Differentiated Virtual Source-based Priority Minimum Interference Path Multicast Routing algorithm). We measured the performance of the proposed algorithm in terms of number of wavelength and wavelength channel. The simulation results demonstrate that DVS-PMIPMR algorithm is superior to previous multicast routing algorithms.

Dynamic Price-Based Call, Admission Control Algorithm for Multi-Class Communication Networks (다중클래스 통신망을 위한 동적 과금 기반의 호수락 제어 알고리즘)

  • Gong, Seong-Lyong;Lee, Jang-Won
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.33 no.8B
    • /
    • pp.681-688
    • /
    • 2008
  • In this paper, we propose a new price-based call admission control algorithm for multi-class communication networks. When a call arrives at the network, it informs the network of the number of requested circuits and the minimum amount of time that it will require. The network provides the optimal price for the arrived call with which it tries to maximize its expected revenue. The optimal price is dynamically adjusted based on the information of the arrived call, and the present and the estimated future congestion level of the network during the reservation time of the call. If the call accepts the price, it is admitted. Otherwise, it is rejected. We compare the performance of our dynamic pricing algorithm with that of the static pricing algorithm by Courcoubetis and Reiman [1], and Paschalidis and Tsitsiklis [2]. By the comparison, we show that our dynamic pricing algorithm has better performance aspects such as higher call admission ratio and lower price than the static pricing algorithm, although these two algorithms result in almost the same revenue as shown in [2]. This implies that, in the competitive situation, the dynamic pricing algorithm can attract more users than the static pricing algorithm, generating more revenue. Moreover, we show that if a certain fixed connection fee is introduced to the price for a call, our dynamic pricing algorithm yields more revenue.

Personalized Recommendation System for IPTV using Ontology and K-medoids (IPTV환경에서 온톨로지와 k-medoids기법을 이용한 개인화 시스템)

  • Yun, Byeong-Dae;Kim, Jong-Woo;Cho, Yong-Seok;Kang, Sang-Gil
    • Journal of Intelligence and Information Systems
    • /
    • v.16 no.3
    • /
    • pp.147-161
    • /
    • 2010
  • As broadcasting and communication are converged recently, communication is jointed to TV. TV viewing has brought about many changes. The IPTV (Internet Protocol Television) provides information service, movie contents, broadcast, etc. through internet with live programs + VOD (Video on demand) jointed. Using communication network, it becomes an issue of new business. In addition, new technical issues have been created by imaging technology for the service, networking technology without video cuts, security technologies to protect copyright, etc. Through this IPTV network, users can watch their desired programs when they want. However, IPTV has difficulties in search approach, menu approach, or finding programs. Menu approach spends a lot of time in approaching programs desired. Search approach can't be found when title, genre, name of actors, etc. are not known. In addition, inserting letters through remote control have problems. However, the bigger problem is that many times users are not usually ware of the services they use. Thus, to resolve difficulties when selecting VOD service in IPTV, a personalized service is recommended, which enhance users' satisfaction and use your time, efficiently. This paper provides appropriate programs which are fit to individuals not to save time in order to solve IPTV's shortcomings through filtering and recommendation-related system. The proposed recommendation system collects TV program information, the user's preferred program genres and detailed genre, channel, watching program, and information on viewing time based on individual records of watching IPTV. To look for these kinds of similarities, similarities can be compared by using ontology for TV programs. The reason to use these is because the distance of program can be measured by the similarity comparison. TV program ontology we are using is one extracted from TV-Anytime metadata which represents semantic nature. Also, ontology expresses the contents and features in figures. Through world net, vocabulary similarity is determined. All the words described on the programs are expanded into upper and lower classes for word similarity decision. The average of described key words was measured. The criterion of distance calculated ties similar programs through K-medoids dividing method. K-medoids dividing method is a dividing way to divide classified groups into ones with similar characteristics. This K-medoids method sets K-unit representative objects. Here, distance from representative object sets temporary distance and colonize it. Through algorithm, when the initial n-unit objects are tried to be divided into K-units. The optimal object must be found through repeated trials after selecting representative object temporarily. Through this course, similar programs must be colonized. Selecting programs through group analysis, weight should be given to the recommendation. The way to provide weight with recommendation is as the follows. When each group recommends programs, similar programs near representative objects will be recommended to users. The formula to calculate the distance is same as measure similar distance. It will be a basic figure which determines the rankings of recommended programs. Weight is used to calculate the number of watching lists. As the more programs are, the higher weight will be loaded. This is defined as cluster weight. Through this, sub-TV programs which are representative of the groups must be selected. The final TV programs ranks must be determined. However, the group-representative TV programs include errors. Therefore, weights must be added to TV program viewing preference. They must determine the finalranks.Based on this, our customers prefer proposed to recommend contents. So, based on the proposed method this paper suggested, experiment was carried out in controlled environment. Through experiment, the superiority of the proposed method is shown, compared to existing ways.

Estimation of Hourly Variations in Public Transit Demand according to the Addition of Sales Facilities to Railway Stations: Focusing on Metro and Bus Transit Demand (철도역사 판매시설 증축에 따른 시간대별 대중교통 수요 변화 추정: 지하철 및 버스 수요를 중심으로)

  • Jang, Jaemin;Moon, Dae Seop;Kim, Sujeong;Gim, Tae-Hyoung Tommy
    • Journal of the Korean Society for Railway
    • /
    • v.18 no.6
    • /
    • pp.630-638
    • /
    • 2015
  • The total number of passengers on the KTX since its construction in 2004 surpassed 500 million in October, 2015. The operation of KTX made it possible to reach anywhere in a country in half a day, which subsequently altered people's lifestyle. As the KTX has become an important mode of transportation, there is a growing interest in the optimal size and location of its stations. Currently, the stations are constructed through public-private partnerships since a sufficient amount of budget is hard to secure only from the public sector; however, because railway stations are traditionally aimed at promoting public interests, an emphasis on the profitability of the private sector could compromise public interests. At this juncture, this study separately computes the number of users based on each of the two primary functions of the stations-as a railway station and as a sales facility-and estimates the numbers of people according to various transportation modes that are taken to access the stations. This estimation is applied to the case of Dongdaegu Station, which will open in 2016. Such an application helps to predict and respond to possible congestion as brought about by the expansion of the sales facility.