• Title/Summary/Keyword: Number of Users

Search Result 3,054, Processing Time 0.032 seconds

Key Update Protocols in Hierarchical Sensor Networks (계층적 센서 네트워크에서 안전한 통신을 위한 키 갱신 프로토콜)

  • Lee, Joo-Young;Park, So-Young;Lee, Sang-Ho
    • The KIPS Transactions:PartC
    • /
    • v.13C no.5 s.108
    • /
    • pp.541-548
    • /
    • 2006
  • Sensor network is a network for realizing the ubiquitous computing circumstances, which aggregates data by means of observation or detection deployed at the inaccessible places with the capacities of sensing and communication. To realize this circumstance, data which sensor nodes gathered from sensor networks are delivered to users, in which it is required to encrypt the data for the guarantee of secure communications. Therefore, it is needed to design key management scheme for encoding appropriate to the sensor nodes which feature continual data transfer, limited capacity of computation and storage and battery usage. We propose a key management scheme which is appropriate to sensor networks organizing hierarchical architecture. Because sensor nodes send data to their parent node, we can reduce routing energy. We assume that sensor nodes have different security levels by their levels in hierarchy. Our key management scheme provides different key establishment protocols according to the security levels of the sensor nodes. We reduce the number of sensor nodes which share the same key for encryption so that we reduce the damage by key exposure. Also, we propose key update protocols which take different terms for each level to update established keys efficiently for secure data encoding.

Improving Performance of Search Engine By Using WordNet-based Collaborative Evaluation and Hyperlink (워드넷 기반 협동적 평가와 하이퍼링크를 이용한 검색엔진의 성능 향상)

  • Kim, Hyun-Gil;Kim, Jun-Tae
    • The KIPS Transactions:PartB
    • /
    • v.11B no.3
    • /
    • pp.369-380
    • /
    • 2004
  • In this paper, we propose a web page weighting scheme based on WordNet-based collaborative evaluation and hyperlink to improve the precision of web search engine. Generally search engines use keyword matching to decide web page ranking. In the information retrieval from huge data such as the Web, simple word comparison cannot distinguish important documents because there exist too many documents with similar relevancy. In this paper, we implement a WordNet-based user interface that helps to distinguish different senses of query word, and constructed a search engine in which the implicit evaluations by multiple users are reflected in ranking by accumulating the number of clicks. In accumulating click counts, they are stored separately according to lenses, so that more accurate search is possible. Weighting of each web page by using collaborative evaluation and hyperlink is reflected in ranking. The experimental results with several keywords show that the precision of proposed system is improved compared to conventional search engines.

An Intelligent Image Retrieval System using XML (XML을 이용한 지능형 이미지 검색 시스템)

  • 홍성용;나연묵
    • Journal of Korea Multimedia Society
    • /
    • v.7 no.1
    • /
    • pp.132-144
    • /
    • 2004
  • With the rapid development of internet technology, the number of internet users and the amount of multimedia information on the internet is ever increasing. Recently, the web sites, such as e-business sites and shopping mall sites, deal with lots of image information. As a result, it is required to support content- based image retrieval efficiently on such image data. This paper proposes an intelligent image retrieval system, which adopts XML, technology. To support object-based col)tent retrieval on product catalog images containing multiple objects, we describe a multi -level metadata structure which represents the local features, global features, and semantics of image data. To enable semantic-based and content-based retrieval on such image data, we design a XML-Schema for the proposed metadata and show how to represent such metadata using XML- documents. We also describe how to automatically transform the retrieval results into the forms suitable for the various user environments, such as web browser or mobile browser, using XSLT The proposed scheme can be easily implemented on any commercial platforms supporting XML technology. It can be utilized to enable efficient image metadata sharing between systems, and it will contribute in improving the retrieval correctness and the user's satisfaction on content-based e-catalog image retrieval.

  • PDF

The prediction Models for Clearance Times for the unexpected Incidences According to Traffic Accident Classifications in Highway (고속도로 사고등급별 돌발상황 처리시간 예측모형 및 의사결정나무 개발)

  • Ha, Oh-Keun;Park, Dong-Joo;Won, Jai-Mu;Jung, Chul-Ho
    • The Journal of The Korea Institute of Intelligent Transport Systems
    • /
    • v.9 no.1
    • /
    • pp.101-110
    • /
    • 2010
  • In this study, a prediction model for incident reaction time was developed so that we can cope with the increasing demand for information related to the accident reaction time. For this, the time for dealing with accidents and dependent variables were classified into incident grade, A, B, and C. Then, fifteen independent variables including traffic volume, number of accident-related vehicles and the accidents time zone were utilized. As a result, traffic volume, possibility of including heavy vehicles, and an accident time zone were found as important variables. The results showed that the model has some degree of explanatory power. In addition, when the CHAID Technique was applied, the Answer Tree was constructed based on the variables included in the prediction model for incident reaction time. Using the developed Answer Tree model, accidents firstly were classified into grades A, B, and C. In the secondary classification, they were grouped according to the traffic volume. This study is expected to make a contribution to provide expressway users with quicker and more effective traffic information through the prediction model for incident reaction time and the Answer Tree, when incidents happen on expressway

The Design and Implementation of Secure Instant Messaging System (안전한 단문 전송 시스템 설계 및 구현)

  • Song, Gi-Pyeung;Sohn, Hong;Jo, In-June;Ju, Young-Ki;Lee, Dal-Won
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.5 no.2
    • /
    • pp.357-364
    • /
    • 2001
  • The Instant Messenger(IM) is the most popular personal communication tool today. IM is a tool that can substitute E-mail for a person, and can secure the user for a company. Further, it is claimed as it has a limitless potential. However, there has been several reports on security issues. It has known that the transmitting message is not secured for the attacks, and hacking tools has been developed. In addition, several reports has been made regards to the vulnerability. In other words, anyone can peep through and manipulate the messages that are sent or received via IM. This is a barrier for the IM to be developed as a corporate's strategic tool, and furthermore, it will create serious personal privacy issue. IETF IMPP Working (:roup is preparing a standard mutual relationship between IM. However, it is complicated due to the American On-Lines's absence, whom has ensured the most number of IM users. There was a discussion only about the form of the transmitting data, but it is insufficient state to discuss the security service for general. In this paper, 1 design and implement the Secure Instant Messaging System, to solve the IM's vulnerability and the security issue presented above.

  • PDF

Active-Active Message Replica Scheme for Enhancing Performance of Distributed Message Broker (분산 브로커의 가용성 향상을 위한 메시지 레플리카 액티브-액티브 구조 기법)

  • Seo, Kyeonghee;Yeo, Sangho;Oh, Sangyoon
    • KIPS Transactions on Computer and Communication Systems
    • /
    • v.7 no.6
    • /
    • pp.145-154
    • /
    • 2018
  • A loosely coupled message broker system is a popular method for integrating distributed software components. Especially, a distributed broker structure with multiple brokers with active-standby or active-active message replicas are used to enhance availability as well as message processing performance. However, there are problems in both active-standby and active-active replica structure. The active-standby has relatively low processing performance and The active-active structure requires a high synchronization overhead. In this paper, we propose an active-active structure of replicas to increase the availability of the brokers without compromising its high fault-tolerancy. In the proposed structure, standby replicas process the requests of the active replicas so that load balancing is achieved without additional brokers, while the distributed coordinators are used for the synchronization process to decrease the overhead. We formulated the overhead incurred when synchronizing messages among replicas, and the formulation was used to support the experiment results. From the experiment, we observed that replicas of the active-active structure show better performance than the active stand-by structure with increasing number of users.

Influence of COVID-19 on Public Transportation Mode Change and Countermeasures (COVID-19에 따른 대중교통수단 변화에 미치는 영향 분석 및 대책에 관한 연구)

  • Kim, Su Min;Jung, Hun Young
    • KSCE Journal of Civil and Environmental Engineering Research
    • /
    • v.42 no.3
    • /
    • pp.379-389
    • /
    • 2022
  • The number of public transportation users has dropped drastically due to COVID-19. In this work, my survey was conducted to uncover the factors that influence citizens' travel patterns. Data were collected and logistic regression analysis on the shifts in transportation was undertaken. Additionally, an importance-performance analysis was carried out to investigate how to effectively operate public transportation systems and improve facilities. The main research findings were as follows: First, the more individuals were concerned about COVID-19 (+) and being infected when using public transportation (+), the greater the tendency to switch to private transportation modes. Secondly, when it came to personal traits, respondents who could drive a car (+) or owned a car (+)or did more online shopping (+) or used public transportation for trips (+) tended to switch over, compared with respondents who could not drive or did not own a caror used public transportation to commute. In addition, respondents who were vaccinated (-) or had more household members tended not to switch transportation modes, compared with those who were not vaccinated or had fewer household members. Third, it is important to continue the following efforts to safeguardhygiene linked to public transportation: wearing masks, disinfecting hands, controlling diseases, and general cleaning. The conclusion was that it is important to put traffic congestion and ventilation issues first, especially in regards public transportation, which was not rated as satisfactory enough compared to its importance. The research findings can provide useful basic data when establishing countermeasures to the current COVID-19 circumstances in the areas of public transportation operation and management and in the event of an infectious disease outbreak in the future.

Online Reorganization of B+ tree in a Scalable and Highly Available Database Cluster (확장 가능한 고가용 데이터베이스 클러스터에서 B+ 트리 색인의 온-라인 재조직 기법)

  • Lee, Chung-Ho;Bae, Hea-Young
    • The KIPS Transactions:PartD
    • /
    • v.9D no.5
    • /
    • pp.801-812
    • /
    • 2002
  • On-line reorganization in a shared nothing database cluster is crucial to the performance of the database system in a dynamic environment like WWW where the number of users grows rapidly and changing access patterns may exhibit high skew. In the existing method of on-line reorganization have a drawback that needs excessive data migrations in case more than two nodes within a cluster have overload at the same time. In this paper, we propose an advanced B$^{+}$ tree based on-line reorganization method that solves data skew on multi-nodes. Our method facilitates fast and efficient data migration by including spare nodes that are added to cluster through on-line scaling. Also we apply CSB$^{+}$ tree (Cache Sensitive B$^{+}$ tree) to our method instead of B$^{+}$ tree for fast select and update queries. We conducted performance study and implemented the method on Ultra Fault-Tolerant Database Cluster developed for high scalability and availability. Empirical results demonstrate that our proposed method is indeed effective and fast than the existing method. method.

Can Online Community Managers Enhance User Engagement?: Evidence from Anonymous Social Media Postings (온라인 커뮤니티 이용자 참여 증진을 위한 관리자의 운영 전략: 대학별 대나무숲 분석을 중심으로)

  • Kim, Hyejeong;Hwang, Seungyeup;Kwak, Youshin;Choi, Jeonghye
    • Knowledge Management Research
    • /
    • v.23 no.2
    • /
    • pp.211-228
    • /
    • 2022
  • As social media marketing becomes prevalent, it is necessary to understand the administrative role of managers in promoting user engagement. However, little is known about how community managers enhance user engagement in social media. In this research, we study how managers can boost online user participation, including clicking likes and writing comments. Using the SUR (Seemingly Unrelated Regression) model, we find out that the active participation of managers increases user engagement of both passive (likes) and active (comments) ones. In addition, we find that the number of emotional words included in posts has a positive effect on the passive engagement whereas it negatively affects the active engagement. Lastly, the congruency between posts and comments positively affects users' passive engagement. This study contributes to prior literature related to online community management and text analyses. Furthermore, our findings offer managerial insights for practitioners and social media managers to further facilitate user engagement.

An Improvement of Kubernetes Auto-Scaling Based on Multivariate Time Series Analysis (다변량 시계열 분석에 기반한 쿠버네티스 오토-스케일링 개선)

  • Kim, Yong Hae;Kim, Young Han
    • KIPS Transactions on Computer and Communication Systems
    • /
    • v.11 no.3
    • /
    • pp.73-82
    • /
    • 2022
  • Auto-scaling is one of the most important functions for cloud computing technology. Even if the number of users or service requests is explosively increased or decreased, system resources and service instances can be appropriately expanded or reduced to provide services suitable for the situation and it can improves stability and cost-effectiveness. However, since the policy is performed based on a single metric data at the time of monitoring a specific system resource, there is a problem that the service is already affected or the service instance that is actually needed cannot be managed in detail. To solve this problem, in this paper, we propose a method to predict system resource and service response time using a multivariate time series analysis model and establish an auto-scaling policy based on this. To verify this, implement it as a custom scheduler in the Kubernetes environment and compare it with the Kubernetes default auto-scaling method through experiments. The proposed method utilizes predictive data based on the impact between system resources and response time to preemptively execute auto-scaling for expected situations, thereby securing system stability and providing as much as necessary within the scope of not degrading service quality. It shows results that allow you to manage instances in detail.