Content Services Research Articles

실감형 관광콘텐츠 서비스 확산모형에 대한 연구

The purpose of this study was to study the relationship between affordance, acceptance factor, and diffusion intention of realistic tourism contents service. <BR> Affordance was classified into cognitive affordance, physical affordance, and sensory affordance based on the classification by Hartson(2003).<BR> In particular, it was analyzed that cognitive and sensory affordances have a significant influence on the acceptance factors of the realistic tourism content service. On the other hand, it was analyzed that there was no significant influence relationship for physical affordance.<BR> In addition, it was analyzed that the acceptance factor of the realistic tourism content service had a significant influence on the intention to spread. <BR> This study has academic significance in that it has identified the factors for stably spreading newly emerging information technologies.

Modern Approaches in Designing Highly Loaded Maps for Object Search

It is hard to imagine our life without maps. Maps are everywhere, even modern watches can have a map. Essentially maps are very complicated from the engineering perspective. Displaying thousands of objects, filtering, clustering, and making it possible on low-end devices are tough tasks.We will investigate modern engineering approaches using a realistic case and provide all key details and motivation behind the architecture. The case will be to develop a web map for searching property all over Ukraine. Key functional requirements: all objects should be on map, filters, text search. Key non-functional requirements: total number of objects, load time, filter time, search speed, amount of users, the budget.There are a lot of map libraries on the market, our research shows one most suitable for us. The map consists of different layers. The basic layer can be provided as a raster image or in vector format. Clustering is a key feature that makes it possible to display a huge amount of points. Clustering can be performed either in the browser or on the server-side. Server-side clustering is the most scalable solution but it creates additional challenges for filtering that is why we should provide different layers for the base layer and for clusters.Baseline architecture consists of the Static Content Server, Tile Server, Search Service, Geocoding Service. Tiles for Tile Server generated from OpenStreetMap data. Search Service uses Realty Database to generate clusters and provide additional information. Realty Storage filled by Realty Fetcher Service who takes them from open sources. Geocoding Service combines data from different providers(internal and external) in order to provide a reach user experience.Modern engineering approaches have distinguishable features: business-oriented, customer-oriented, heavily using open source to meet strict deadlines and budgets, scaleable, adaptable for changes, and fast releases.Manuscript received 31.05.2020

Performance Analysis of Cache Based on Popularity and Class in Named Data Network

The communication network is growing with some unique characteristics, such as consumers repeatedly request the same content to the server, similarity in local demand trend, and dynamic changes to requests within a specific period. Therefore, a different network paradigm is needed to replace the IP network, namely Named Data Network (NDN). The content store, which acts as a crucial component in the NDN nodes is a limited resource. In addition, a cache mechanism is needed to optimize the router’s content store by exploiting the different content services characters in the network. This paper proposes a new caching algorithm called Cache Based on Popularity and Class (CAPIC) with dynamic mechanism, and the detail explanation about the static method also presented. The goal of Static-CAPIC was to enhance the total cache hit ratio on the network by pre-determining the cache proportion for each content class. However, this technique is not appropriate to control the cache hit ratio for priority class. Therefore, the Dynamic-CAPIC is used to provide flexibility to change the cache proportion based on the frequency of requests in real-time. The formula involves considering the consumers’ request all the time. It gives a higher cache hit ratio for the priority content class. This method outperforms Static-CAPIC, and the LCD+sharing scheme in the total network cache hit ratio parameter and channels it to the priority class.

A Study on the Selection Factors of Contents Service for the Popularization of AI Speaker based on AHP

A Study on the Selection Factors of Contents Service for the Popularization of AI Speaker based on AHP

WIDS: An Anomaly Based Intrusion Detection System for Wi-Fi (IEEE 802.11) Protocol

Over the last few decades, the Internet has seen unprecedented growth, with over 4.57 billion active users as of July 2022, encompassing 59% of the global population. In recent years, we have seen an increase in mobile computing and the Internet of Things (IoT), allowing more users to communicate through the Internet using wireless devices. Modern Internet users use their wireless IoT devices for a wide variety of services that include cloud computing and storage, social networking, content services, online banking, shopping, to name a few. Moreover, with the omnipresence of IoT devices, wireless networks are used for services like device control, user authentication, etc. Wi-Fi is the network of choice for most of these wireless communications. Although Wi-Fi networks have improved over recent years, little has been done to secure Wi-Fi networks against attacks. In this article, we present a Wireless Intrusion Detection System (WIDS); an anomaly behavior analysis approach to detect attacks on Wi-Fi networks with high accuracy and low false alarms. In this approach, we model the normal behavior of the Wi-Fi protocol, using n-grams, and use machine learning models to classify Wi-Fi traffic flows as normal or malicious. We have extensively tested our approach on multiple datasets collected locally at the University of Arizona and AWID family of datasets. Our approach can successfully detect all attacks on Wi-Fi protocols with low false positives (0.0174) and a varying low rate of false negatives for different attacks.

Efficient and Secure Location-Based Services Scheme in VANET

In VANET, the privacy of the query becomes a serious concern for location-based services (LBS). An LBS scheme must, also, not breach the location privacy of the user vehicle. In order to protect query privacy of the vehicle user, the existing state-of-the-art schemes either reduce the accuracy of LBS or insert a trusted third party (TTP) between the vehicle user and the location server hosting the LBS scheme. Cryptographic constructs such as public-key encryption, Oblivious Transfer (OT), Private Information Retrieval (PIR), and homomorphic encryption are used to remove the TTP or increase the accuracy of the previous schemes. The problem with these existing schemes is that some of them are either inefficient or insecure. In order to address the security and privacy issues, we propose an efficient privacy-preserving mechanism for protecting the query privacy of the user, information content of the location server, and location privacy-preserving of the vehicle in the LBS scheme for VANET. In this scheme, the vehicle requests for services from the location server without revealing the query content to the location server. The location server sends all Point of Interests (POIs) to the vehicle, but the vehicle can only obtain the requested query content. The query privacy of the user and content privacy of the location server is preserved in the exchange. The proposed variant of the OT extension protocol is computationally and communicationally efficient and uses a lattice-based ring-Learning With Errors (ring-LWE) scheme as a Base-OT.

Improving Network Throughput by Hardware Realization of a Dynamic Content Caching Scheme for Information-Centric Networking (ICN)

Caching popular content at storage enabled routers or small-cell base stations (SBSs) is a key technology for future communication systems. Primarily limited to wired backbone systems, content-caching techniques are useful to offload mobile data traffic too. Several protocols have been developed towards realization of content-caching, namely, information-centric networking (ICN), content-centric networking, and named data networking. Studies have revealed that incorporating ICN caching schemes at SBSs could significantly enhance the user level performance, i.e., the lesser download delay and the higher throughput. However, smaller coverage area of a SBS would make the communication prone to high handover probability. Therefore, the implementation of ICN caching schemes at SBS requires extremely low processing delay, i.e., delay to search if the requested content is available at the cache, and accordingly make decision to serve the content request or forward it to the content server. In this article, a configurable hardware add-on has been developed to incorporate content caching features in a traditional SBS that can serve the user with extremely low processing delay while optimizing a combination of various network and hardware metrics. Using extensive results being generated from simulations, the usefulness of content caching has been demonstrated, and the effect of several hardware parameters over the latency performance has been studied too. In addition, the caching hardware accelerator has the ability to adapt dynamically to the optimal caching policy required by the prevailing network conditions as well as hardware requirements. An improvement upto 53% in network delay and 15% in handover probability due to the support of hardware-based caching is observed that incurs a negligible $$0.07\,{\hbox {mm}}^2$$ and up to only 11.1 mW energy overhead while operating in the range of 690–910 MHz.

Reliable and Efficient Content Sharing for 5G-Enabled Vehicular Networks

Conditional privacy preservation and message authentication serve as the primary research issues in terms of security in vehicular networks. With the arrival of 5G era, the downloading speed of network services and the message transmission speed have significantly improved. Consequently, the content exchanged by users in vehicular networks is not limited to traffic information, and vehicles moving at high speeds can share a wide variety of contents. However, sharing content reliably and efficiently remains challenging owing to the fast-moving character of vehicles. To solve this problem, we propose a reliable and efficient content sharing scheme in 5G-enabled vehicular networks. The vehicles with content downloading requests quickly filter the adjacent vehicles to choose capable and suitable proxy vehicles and request them for content services. Thus, the purpose of obtaining a good hit ratio, saving network traffic, reducing time delay, and easing congestion during peak hours can be achieved. The security analysis indicates that the proposed scheme meets the security requirements of vehicular networks. Our cryptographic operations are based on the elliptic curve, and finally, the proposed scheme also displays favorable performance compared to other related schemes.

Monetizing Edge Service in Mobile Internet Ecosystem

In mobile Internet ecosystem, mobile users (MUs) purchase wireless data services from Internet service provider (ISP) to access to Internet and acquire the interested content services (e.g., online game) from Content Provider (CP). The popularity of intelligent functions (e.g., AI and 3D modeling) increases the computation-intensity of the content services, leading to a growing computation pressure for the MUs&#x2019; resource-limited devices. To this end, <i>edge computing service</i> is emerging as a promising approach to alleviate the MUs&#x2019; computation pressure while keeping their quality-of-service, via offloading some computation tasks of MUs to edge (computing) servers deployed at the local network edge. Thus, edge service provider (ESP), who deploys the edge servers and offers the edge computing service, becomes an upcoming new stakeholder in the ecosystem. In this work, we study the economic interactions of MUs, ISP, CP, and ESP in the new ecosystem with edge computing service, where MUs can acquire the computation-intensive content services (offered by CP) and offload some computation tasks, together with the necessary raw input data, to edge servers (deployed by ESP) through ISP. We first study the MU&#x0027;s Joint Content Acquisition and Task Offloading (J-CATO) problem, which aims to maximize his long-term payoff. We derive the <i>off-line</i> solution with crucial insights, based on which we design an <i>online</i> strategy with provable performance. Then, we study the ESP&#x0027;s edge service monetization problem. We propose a pricing policy that can achieve a <i>constant fraction</i> of the ex post optimal revenue with an extra <i>constant loss</i> for the ESP. Numerical results show that the edge computing service can stimulate the MUs&#x2019; content acquisition and improve the payoffs of MUs, ISP, and CP.

Digital Content Service for the Distance Learning

Digital Content Service for the Distance Learning

Analisis Behavioral Intention Pada Layanan Aplikasi RCTI+

The current era is called the information age, where humans really need information. The existence of the internet on smartphones makes it easier for humans to get information and enjoy content wherever and whenever. One of the content services in Indonesia is the MNC Group's RCTI + application. Although RCTI + is a new company, RCTI + has an active number of users of 302,569 until November 2019. RCTI + has a fairly high market share because the digital era is growing rapidly. This study measures the interest of users of RCTI + applications in Indonesia by using a modified UTAUT2 research model, where researchers analyze the variables Performance Expectancy, Effort Expectancy, Social Influence, Facilitating Conditions, Hedonic Motivation, Habit, and Content on Behavioral Intention. The data used in this study were 89 valid respondents obtained online using a questionnaire. Respondents are users of the RCTI + application. Researchers used Structural Equation Modeling (SEM) with SmartPLS software version 3.0 to test hypotheses. The results showed that Performance Expectancy, Effort Expectancy, Social Influence, Facilitating Conditions, Habit and Content had an influence on Behavioral Intention. However, Hedonic Motivations has a negative influence on Behavioral Intention. The Age variable as a moderator variable influences Content on Behavioral Intention, while Gender has no effect. This study resulted in an R2 of 0,900 and included in the moderate category. This research, has found that the variable that most influences Behavioral Intention is Habit.

CloudIoT-based Jukebox Platform: A Music Player for Mobile Users in Café

Contents services have been provided to people in a variety of ways. Jukebox service is one of the contents streaming which provides an automated music-playing service. User inserts coin and presses a play button, the jukebox automatically selects and plays the record. The Disk Jockey (DJ) in Korean cafeteria (cafe) received contents desired of customer and played them through the speakers in the store. In this paper, we propose a service platform that reinvented the Korean cafe DJ in an integrated environment of IoT and cloud computing. The user in a store can request contents (music, video, and message) through the service platform. The contents are provided through the public screen and speaker in the store where the user is located. This allows people in the same location store to enjoy the contents together. The user information and the usage history are collected and managed in the cloud. Therefore, users can receive customized services regardless of stores. We compare our platform to exist services. As a result of the performance evaluation, the proposed platform shows that contents can be efficiently provided to users and adapts IoT-Cloud integrated environments.

Stationary queue and server content distribution of a batch-size-dependent service queue with batch Markovian arrival process:

Queueing systems with batch Markovian arrival process (BMAP) have paramount applications in the domain of wireless communication. The BMAP has been used to model the superposition of video sources and to approximate the super-position of data, voice and video traffic. This article analyzes an infinite-buffer generally distributed batch-service queue with BMAP, general bulk service (a, b) rule and batch-size-dependent service time. In this proposed analysis, we mainly focus on deriving the bivariate vector generating function of queue and server content distribution together at departure epoch using supplementary variable technique. The mathematical procedure for the complete extraction of distribution at departure epoch has been discussed and using those extracted probabilities, we achieve the queue and server content distribution at arbitrary epoch. Finally, numerical illustrations have been carried out in order to make a deep insight to the readers which contains deterministic as well as phase-type service time distributions.

RETRACTED ARTICLE: Architectural framework and simulation of quantum key optimization techniques in healthcare networks for data security

Healthcare systems are heterogeneous by nature, where each device is running on different architectures, platform and operating system. This heterogeneity affects the communication performance in-terms of delay and security threats. An optimized quantum key management technique has been proposed for the purpose of managing the keys with little overhead, which enhances the health care information security by reducing the threats. And also the communication with the key authority is simulated with the quantum channel. The generated key is distributed via a dedicated quantum channel in terms of quantum bits which decreases the eavesdropping rate, transmission error, and leakage to maximum extent which improves the security further. Healthcare User group and content server communicate with the key server via a quantum channel sending them photons. Then they discuss results using a public channel. After getting an encryption key from the key server via the quantum channel, the content server can encrypt their healthcare content and send them by any public channel to the healthcare user groups. This proposed research work investigates group secret key generation problems for different types of Healthcare networks and also addresses the quantum key distribution which enhances the key security in healthcare networks. The analysis shows that the two algorithms yield optimal group key rates in healthcare networks. Numerical results are also provided to validate the performance of the proposed key generation, optimization and quantum distribution. The key generation, optimization and healthcare content encryption and decryption using those keys enhances the security of patient data and quantum simulation shows that about 90% of eavesdropping rate is reduced in healthcare network.

YouTube of porn: longitudinal measurement, analysis, and characterization of a large porn streaming service

Video content on user-generated content services has redefined entertainment and business on the Internet. Adult video streaming services have embraced this evolution to form YouTube style porn sites which combine the features of video hosting websites and online social media services. This paper presents a comprehensive measurement study of one of the most popular new-age porn websites with social networking features—xHamster. Using active measurements, we have obtained metadata on almost 4 million unique videos that span the lifetime of xHamster from 2007 to 2018. An analysis of this corpus allowed us to characterize the service and gain insights into the key players of the website including the website owners, video uploaders, and the viewers. By studying the characteristics of videos such as views, duration, the number of uploads, tags, ratings and comments, we give an overview of xHamster’s current state, compare it to traditional and adult streaming services, and find the niche that xHamster occupies as an amateur content focused service. We find that there are significant differences between adult streaming services and traditional streaming services. The injection rate of new videos is lower but the website does not need a large number of new uploads as long as the front page is constantly refreshed. The length of an average adult video is shorter than that of the average video on traditional streaming services, and we find that there is minimal engagement with ratings and comments. Video tags are actively used to organize and filter through content, and we observe that the more tags a video has, the more views it is likely to obtain.

An equity-based incentive mechanism for persistent virtual world content service

Virtual world has the potential to become a future global electronic marketplace, integrating many isolated markets in many areas. To achieve this goal, future virtual world is required to be persistent, implying that a virtual world together with its accumulated content shall exist forever regardless of dynamic changes of its users and owners. Unfortunately, existing virtual worlds, owning by some entities, are not immune from death due to business entity failure. To provide a persistent virtual world, a decentralized architecture is explored, which is constructed on user contributed devices. However, there are many challenges to realize a decentralized virtual world. One important issue is user cooperation in reliable content storage. The devices contributed by users may not be reliable for maintaining all user contents, but users do not have the incentive to provide reliable devices for others. This paper addresses the issue by two steps. First, an indicator, called replica group reliability, is provided to users, which is based on the proposed replicability index. Based on the indicator, users can learn the reliability of their content storage. Then, a new user incentive mechanism, called equity-based node allocation strategy, is proposed to promote user cooperation to collectively maintain reliable content storage. A decentralized algorithm implementing the strategy is designed and the evaluation results show its effectiveness and efficiency.

A discrete-time batch transmission channel with random serving capacity under batch-size-dependent service:

Discrete-time queues have increasingly diverse spectrum of applications in the modern packet-basedcommunication systems. Due to the wide range of applicability of such queues, we analyze a discrete-time queue with group-arrival and batch-service, where transmission time depends on the batch-size. The arrival occurs according tothe batch Bernoulli process and service is provided according to the random serving capacity rule. First, we obtain the bivariate probability generating function of the joint distribution of queue and server content at post transmission epoch. After the determination of unknown probabilities, the complete joint distribution has been extracted. We also acquire the probability distribution at random and pre-arrival epochs. An approximation of the tail distribution is also discussed so that it will be useful to improve the cell loss ratio. Some assorted numerical examples are incorporated to validate the analytic procedure and results.

On steady-state joint distribution of an infinite buffer batch service Poisson queue with single and multiple vacation

This article considers a single server, infinite buffer, bulk service Poisson queue with single and multiple vacation. The customers are served in batches following ‘general bulk service’ (GBS) rule. The customers are arriving according to the Poisson process, and the service time of the batches follows an exponential distribution. Using bivariate probability generating function (PGF) method the steady-state joint distributions of the queue content and server content (when server is busy), and joint distribution of the queue content and type of the vacation taken by the server (when server is in vacation) have been obtained. Here by the ‘type of the vacation’ we mean the queue length at vacation initiation epoch. The information about these joint distributions may help in increasing the system performance. Finally, several numerical examples are carried out using MAPLE software to verify the analytical results.

Decentralized Caching Framework Toward Edge Network Based on Blockchain

Edge cache service (ECS), as a prospective edge network service paradigm, can significantly reduce the data transmission latency and improve the Quality of Service (QoS) of digital content providers by offloading content data to edge devices in the network. Compared to centralized content service, ECS can provide digital content from nearby edge devices via a high-speed wireless network with fewer hops. However, how to motivate edge devices to share their cache resource and ensure the reliability of content data under the diversity of device behavior remains a challenging issue. In this article, we aim to design an ECS framework for cache resource trading and digital content sharing in the edge network. By using blockchain-based credentials, we first provide the cache resource trading mechanism for the trading between the content provider and edge devices. Then, we give a double auction mechanism for digital content trading between edge devices. The experimental results show the proposed framework can greatly improve the matching efficiency of cache resources and reduce the data transmission overhead in edge networks.

A Web Server to Store the Modeled Behavior Data and Zone Information of the Multidisciplinary Product Model in the CAD Systems

This work focuses on the Human Computer Interaction (HCI) for the multidisciplinary product modeling. Requirement Functional Logical Physical (RFLP) structure has emerged as one of the prominent approaches for modeling the multidisciplinary products. To simplify HCI of a RFLP structured product model, Information Content (IC)provides effective communication and interaction. Though it controls the RFLP level by the Multilevel Abstraction based Self-Adaptive Denition (MAAD) structure. However, it needs a application to represent the modeled behavior data and zone information of an multidisciplinary product model. Further, IC application require a interface to interact with the Computer-Aided Design (CAD) based an multidisciplinary product model application and exchange the information between the database of the servers. As per the knowledge of authors, no work has been done yet on the HCI of the IC. Therefore, this paper propose a Content Web server, where IC application is used to store the modeled behavior data and zone information of the multidisciplinary product model. Then, Content database is created to store the Layer Info-Chunk (LiC) entities information of the multidisciplinary product model. Finally, communication between the Content server and CAD server is done to represent the IC application interface in the multidisciplinary product application. The Apache Tomcat server, PostgreSQL database and RESTful web service are used to implement the operations.