• Title/Summary/Keyword: user density

Search Result 224, Processing Time 0.029 seconds

GIS-based PM10 Concentration Real-time Service (GIS기반 PM10 미세먼지농도 실시간 서비스)

  • Yoon, Hoon Joo;Han, Gwang In;Cho, Sung Ho;Jung, Byung hyuk
    • Journal of Korean Society for Atmospheric Environment
    • /
    • v.31 no.6
    • /
    • pp.585-592
    • /
    • 2015
  • In this study, by applying mobile based GIS and image analysis of particulate matter ($PM_{10}$) concentration in Seoul and Ulsan in Korea, to identify the user's location and also implemented the application to information exchange. It strengthened citizens' access to air quality information through the application and derived the expanded environment information sharing through real-time user participation. Through atmospheric concentrations image analysis, it showed a new environmental information construction possibility. It had the effect of expanding the information collecting through the local user participation on the limited information collected area which place is not yet constructed atmospheric monitoring network. Location-based particulate matter information service application provides a user location's $PM_{10}$ information from the 25 urban air monitoring network real-time database of the Ministry of Environment. Furthermore, if the user sent a picture of the atmosphere to the server, should match the image density values of the database and express on Seoul's maps through the IDW interpolation. And then a $PM_{10}$ concentration result is transmitted to user in real time.

Connectivity Analysis of Cognitive Radio Ad-hoc Networks with Shadow Fading

  • Dung, Le The;An, Beongku
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.9 no.9
    • /
    • pp.3335-3356
    • /
    • 2015
  • In this paper, we analyze the connectivity of cognitive radio ad-hoc networks in a log-normal shadow fading environment. Considering secondary user and primary user's locations and primary user's active state are randomly distributed according to a homogeneous Poisson process and taking into account the spectrum sensing efficiency of secondary user, we derive mathematical models to investigate the connectivity of cognitive radio ad-hoc networks in three aspects and compare with the connectivity of ad-hoc networks. First, from the viewpoint of a secondary user, we study the communication probability of that secondary user. Second, we examine the possibility that two secondary users can establish a direct communication link between them. Finally, we extend to the case of finding the probability that two arbitrary secondary users can communicate via multi-hop path. We verify the correctness of our analytical approach by comparing with simulations. The numerical results show that in cognitive radio ad-hoc networks, high fading variance helps to remarkably improve connectivity behavior in the same condition of secondary user's density and primary user's average active rate. Furthermore, the impact of shadowing on wireless connection probability dominates that of primary user's average active rate. Finally, the spectrum sensing efficiency of secondary user significantly impacts the connectivity features. The analysis in this paper provides an efficient way for system designers to characterize and optimize the connectivity of cognitive radio ad-hoc networks in practical wireless environment.

Performance Evaluation of App Profile-based Sensor Registry System considering User Mobility and Sensor Density (사용자 이동성과 센서 밀집도를 고려한 앱 프로파일 기반 센서 레지스트리 시스템의 성능 평가)

  • Kim, Jong Hyun;Lee, Sukhoon;Jeong, Dongwon
    • The Journal of Korean Institute of Information Technology
    • /
    • v.17 no.4
    • /
    • pp.87-97
    • /
    • 2019
  • SRS was proposed for immediate processing of the meaning of sensor data on mobile devices independent from specific sensor networks and sensor type. However, each time new sensor data is received, sensor data inspection operations are performed repeatedly, and it cause resulting in low performance. App profile-based SRS has been proposed to resolve the problem. The app profile-based SRS has improved the SRS problem through the profile, but has been tested in a virtual simulation environment. After that the test was experimented in a real-time environment, but has not been tested with a variety of dynamic factors. Therefore, this paper experiment considering such as user mobility and sensor density in real-time environment. And this paper also evaluate performance of the App profile-based through analysis of the results of the experiment. As a result, app profile-based SRS is high influence by density and sensor type, and the number of sensor node is not influence.

Privacy-Preserving Estimation of Users' Density Distribution in Location-based Services through Geo-indistinguishability

  • Song, Seung Min;Kim, Jong Wook
    • Journal of the Korea Society of Computer and Information
    • /
    • v.27 no.12
    • /
    • pp.161-169
    • /
    • 2022
  • With the development of mobile devices and global positioning systems, various location-based services can be utilized, which collects user's location information and provides services based on it. In this process, there is a risk of personal sensitive information being exposed to the outside, and thus Geo-indistinguishability (Geo-Ind), which protect location privacy of LBS users by perturbing their true location, is widely used. However, owing to the data perturbation mechanism of Geo-Ind, it is hard to accurately obtain the density distribution of LBS users from the collection of perturbed location data. Thus, in this paper, we aim to develop a novel method which enables to effectively compute the user density distribution from perturbed location dataset collected under Geo-Ind. In particular, the proposed method leverages Expectation-Maximization(EM) algorithm to precisely estimate the density disribution of LBS users from perturbed location dataset. Experimental results on real world datasets show that our proposed method achieves significantly better performance than a baseline approach.

Object-oriented Classification and QuickBird Multi-spectral Imagery in Forest Density Mapping

  • Jayakumar, S.;Ramachandran, A.;Lee, Jung-Bin;Heo, Joon
    • Korean Journal of Remote Sensing
    • /
    • v.23 no.3
    • /
    • pp.153-160
    • /
    • 2007
  • Forest cover density studies using high resolution satellite data and object oriented classification are limited in India. This article focuses on the potential use of QuickBird satellite data and object oriented classification in forest density mapping. In this study, the high-resolution satellite data was classified based on NDVI/pixel based and object oriented classification methods and results were compared. The QuickBird satellite data was found to be suitable in forest density mapping. Object oriented classification was superior than the NDVI/pixel based classification. The Object oriented classification method classified all the density classes of forest (dense, open, degraded and bare soil) with higher producer and user accuracies and with more kappa statistics value compared to pixel based method. The overall classification accuracy and Kappa statistics values of the object oriented classification were 83.33% and 0.77 respectively, which were higher than the pixel based classification (68%, 0.56 respectively). According to the Z statistics, the results of these two classifications were significantly different at 95% confidence level.

Behavior Realization of Multi-Robots Responding to User's Input Characters (사용자 입력 문자에 반응하는 군집 로봇 행동 구현)

  • Jo, Young-Rae;Lee, Kil-Ho;Jo, Sung-Ho;Shin, In-Sik
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.18 no.5
    • /
    • pp.419-425
    • /
    • 2012
  • This paper presents an approach to implement the behaviors of multi-robots responding to user's input characters. The robots are appropriately displaced to express any input characters. Using our method, any user can easily and friendly control multirobots. The responses of the robots to the user's input are intuitive. We utilize the centroidal Voronoi algorithm and the continuoustime Lloyd algorithm, which have popularly been used for the optimal sensing coverage problems. Collision protection is considered to be applied for real robots. LED sensors are used to identify positions of multi-robots. Our approach is evaluated through experiments with five mobile robots. When a user draw alphabets, the robots are deployed correspondingly. By checking position errors, the feasibility of our method is validated.

How to Reflect User's Intention to Improve Virtual Object Selection Task in VR (VR 환경에서 가상 객체 선택 상호작용 개선을 위한 사용자 의도 반영 방법)

  • Kim, Chanhee;Nam, Hyeongil;Park, Jong-Il
    • Journal of Broadcast Engineering
    • /
    • v.26 no.6
    • /
    • pp.704-713
    • /
    • 2021
  • This paper proposes a method to prioritize the virtual objects to be selected, considering both the user's hand and the geometric relationship with the virtual objects and the user's intention which is recognized in advance. Picking up virtual objects in VR content is an essential and most commonly used interaction. When virtual objects are located close to each other in VR, a situation occurs in which virtual objects that are different from the user's intention are selected. To address this issue, this paper provides different weights for user intentions and distance between user's hand and virtual objects to derive priorities in order to generate interactions appropriately according to the situation. We conducted the experiment in the situation where the number of virtual objects and the distance between virtual objects are diversified. Experiments demonstrate the effectiveness of the proposed method when the density between virtual objects is high and the distance between each other is close, user satisfaction increases to 20.34% by increasing the weight ratio of the situation awareness. We expect the proposed method to contribute to improving interaction skills that can reflect users' intentions.

Scalable Collaborative Filtering Technique based on Adaptive Clustering (적응형 군집화 기반 확장 용이한 협업 필터링 기법)

  • Lee, O-Joun;Hong, Min-Sung;Lee, Won-Jin;Lee, Jae-Dong
    • Journal of Intelligence and Information Systems
    • /
    • v.20 no.2
    • /
    • pp.73-92
    • /
    • 2014
  • An Adaptive Clustering-based Collaborative Filtering Technique was proposed to solve the fundamental problems of collaborative filtering, such as cold-start problems, scalability problems and data sparsity problems. Previous collaborative filtering techniques were carried out according to the recommendations based on the predicted preference of the user to a particular item using a similar item subset and a similar user subset composed based on the preference of users to items. For this reason, if the density of the user preference matrix is low, the reliability of the recommendation system will decrease rapidly. Therefore, the difficulty of creating a similar item subset and similar user subset will be increased. In addition, as the scale of service increases, the time needed to create a similar item subset and similar user subset increases geometrically, and the response time of the recommendation system is then increased. To solve these problems, this paper suggests a collaborative filtering technique that adapts a condition actively to the model and adopts the concepts of a context-based filtering technique. This technique consists of four major methodologies. First, items are made, the users are clustered according their feature vectors, and an inter-cluster preference between each item cluster and user cluster is then assumed. According to this method, the run-time for creating a similar item subset or user subset can be economized, the reliability of a recommendation system can be made higher than that using only the user preference information for creating a similar item subset or similar user subset, and the cold start problem can be partially solved. Second, recommendations are made using the prior composed item and user clusters and inter-cluster preference between each item cluster and user cluster. In this phase, a list of items is made for users by examining the item clusters in the order of the size of the inter-cluster preference of the user cluster, in which the user belongs, and selecting and ranking the items according to the predicted or recorded user preference information. Using this method, the creation of a recommendation model phase bears the highest load of the recommendation system, and it minimizes the load of the recommendation system in run-time. Therefore, the scalability problem and large scale recommendation system can be performed with collaborative filtering, which is highly reliable. Third, the missing user preference information is predicted using the item and user clusters. Using this method, the problem caused by the low density of the user preference matrix can be mitigated. Existing studies on this used an item-based prediction or user-based prediction. In this paper, Hao Ji's idea, which uses both an item-based prediction and user-based prediction, was improved. The reliability of the recommendation service can be improved by combining the predictive values of both techniques by applying the condition of the recommendation model. By predicting the user preference based on the item or user clusters, the time required to predict the user preference can be reduced, and missing user preference in run-time can be predicted. Fourth, the item and user feature vector can be made to learn the following input of the user feedback. This phase applied normalized user feedback to the item and user feature vector. This method can mitigate the problems caused by the use of the concepts of context-based filtering, such as the item and user feature vector based on the user profile and item properties. The problems with using the item and user feature vector are due to the limitation of quantifying the qualitative features of the items and users. Therefore, the elements of the user and item feature vectors are made to match one to one, and if user feedback to a particular item is obtained, it will be applied to the feature vector using the opposite one. Verification of this method was accomplished by comparing the performance with existing hybrid filtering techniques. Two methods were used for verification: MAE(Mean Absolute Error) and response time. Using MAE, this technique was confirmed to improve the reliability of the recommendation system. Using the response time, this technique was found to be suitable for a large scaled recommendation system. This paper suggested an Adaptive Clustering-based Collaborative Filtering Technique with high reliability and low time complexity, but it had some limitations. This technique focused on reducing the time complexity. Hence, an improvement in reliability was not expected. The next topic will be to improve this technique by rule-based filtering.

Analysis of Crowding by User′s Number - Case study of Dalsung and Jungang Park in Daegu city - (이용자 수에 다른 혼잡분석 - 대구시 달성, 중앙공원을 대상으로-)

  • 이현택
    • Journal of the Korean Institute of Landscape Architecture
    • /
    • v.18 no.2
    • /
    • pp.15-19
    • /
    • 1990
  • This survey was carried to determine the crowd In the city parks on the basis of the crowding and using denSity. The using density was vary different by season and day, and the density was much higher in this experiment than in the case of the foreign countries. This survey shows a high correlation between the using density and crowd as the crowd level was more influenced by the increasing number of park - users in the case of low using density than the high using density. The possible using space per individual was around 10㎥ in the parks, which means a strong endurance of the surveying group to the massing space, in the saturated crowding value that the crowd was not significantly affected by the increasing number of users.

  • PDF

Modeling the Relationship between Process Parameters and Bulk Density of Barium Titanates

  • Park, Sang Eun;Kim, Hong In;Kim, Jeoung Han;Reddy, N.S.
    • Journal of Powder Materials
    • /
    • v.26 no.5
    • /
    • pp.369-374
    • /
    • 2019
  • The properties of powder metallurgy products are related to their densities. In the present work, we demonstrate a method to apply artificial neural networks (ANNs) trained on experimental data to predict the bulk density of barium titanates. The density is modeled as a function of pressure, press rate, heating rate, sintering temperature, and soaking time using the ANN method. The model predictions with the training and testing data result in a high coefficient of correlation (R2 = 0.95 and Pearson's r = 0.97) and low average error. Moreover, a graphical user interface for the model is developed on the basis of the transformed weights of the optimally trained model. It facilitates the prediction of an infinite combination of process parameters with reasonable accuracy. Sensitivity analysis performed on the ANN model aids the identification of the impact of process parameters on the density of barium titanates.