• Title/Summary/Keyword: networking

Search Result 3,312, Processing Time 0.025 seconds

Social Networking Sites for e-Recruitment: A Perspective of Malaysian Employers

  • MEAH, Muneem Mamtaz;SARWAR, Abdullah
    • The Journal of Asian Finance, Economics and Business
    • /
    • v.8 no.8
    • /
    • pp.613-624
    • /
    • 2021
  • The use of social networking sites (SNS) for e-recruitment has shifted the focus away from traditional hiring and selection processes. They are commonly used in the search and acquisition of new employees and are projected to expand in the near future as an e-recruitment tool. However, there is a lack of material on SNS and their impact on an employers' intention to use these sites for e-recruitment, in the context of Malaysia. Hence, there is an acute necessity for research on the extent that the features of SNS can influence the employers' intention to use SNS for e-recruitment and to know how to keep utilizing the platform for future e-recruitment. This study aims to identify the key features of SNS that lead to employers' intention to use SNS for e-recruitment in Malaysia. In this cross-sectional study, random sampling was utilized to obtain data from 198 recruitment professionals using online survey. The findings show that data quality, reliability, networking spectrum and simplicity of navigation of SNS are the key predicting factors for intention to use SNS for e-recruitment. Therefore, employers should acknowledge these key features of SNS to achieve their e-recruitment goals.

The audience's reaction effect based on vicarious emotional experiences and creative rhetorical expressions of the networking media platforms (네트워킹 미디어 플랫폼의 대리적 감정 경험과 크리에이티브의 수사적 표현 방식에 따른 수용자 반응 효과)

  • Choi, Hyuck-Soo
    • Journal of the Korea Convergence Society
    • /
    • v.12 no.4
    • /
    • pp.113-123
    • /
    • 2021
  • This study involves an experiment aimed to reveal the communicative effects by different types of visual expressions in SNS advertisements. This study analyzes consumers' dynamic responses to vicarious emotional experiences and the creative rhetorical expressions of networking media platforms through experiments that sample university students. The vicarious emotional experiences of networking media platforms have a significant effect on the consumers' subsequent reactions. The greater the vicarious emotional experiences are, the more positive this effect is. There is a significant interactive effect between consumers' vicarious emotional experiences and the rhetorical creative types of targeted media.

EHMM-CT: An Online Method for Failure Prediction in Cloud Computing Systems

  • Zheng, Weiwei;Wang, Zhili;Huang, Haoqiu;Meng, Luoming;Qiu, Xuesong
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.10 no.9
    • /
    • pp.4087-4107
    • /
    • 2016
  • The current cloud computing paradigm is still vulnerable to a significant number of system failures. The increasing demand for fault tolerance and resilience in a cost-effective and device-independent manner is a primary reason for creating an effective means to address system dependability and availability concerns. This paper focuses on online failure prediction for cloud computing systems using system runtime data, which is different from traditional tolerance techniques that require an in-depth knowledge of underlying mechanisms. A 'failure prediction' approach, based on Cloud Theory (CT) and the Hidden Markov Model (HMM), is proposed that extends the HMM by training with CT. In the approach, the parameter ω is defined as the correlations between various indices and failures, taking into account multiple runtime indices in cloud computing systems. Furthermore, the approach uses multiple dimensions to describe failure prediction in detail by extending parameters of the HMM. The likelihood and membership degree computing algorithms in the CT are used, instead of traditional algorithms in HMM, to reduce computing overhead in the model training phase. Finally, the results from simulations show that the proposed approach provides very accurate results at low computational cost. It can obtain an optimal tradeoff between 'failure prediction' performance and computing overhead.

An Adaptable Destination-Based Dissemination Algorithm Using a Publish/Subscribe Model in Vehicular Networks

  • Morales, Mildred Madai Caballeros;Haw, Rim;Cho, Eung-Jun;Hong, Choong-Seon;Lee, Sung-Won
    • Journal of Computing Science and Engineering
    • /
    • v.6 no.3
    • /
    • pp.227-242
    • /
    • 2012
  • Vehicular Ad Hoc Networks (VANETs) are highly dynamic and unstable due to the heterogeneous nature of the communications, intermittent links, high mobility and constant changes in network topology. Currently, some of the most important challenges of VANETs are the scalability problem, congestion, unnecessary duplication of data, low delivery rate, communication delay and temporary fragmentation. Many recent studies have focused on a hybrid mechanism to disseminate information implementing the store and forward technique in sparse vehicular networks, as well as clustering techniques to avoid the scalability problem in dense vehicular networks. However, the selection of intermediate nodes in the store and forward technique, the stability of the clusters and the unnecessary duplication of data remain as central challenges. Therefore, we propose an adaptable destination-based dissemination algorithm (DBDA) using the publish/subscribe model. DBDA considers the destination of the vehicles as an important parameter to form the clusters and select the intermediate nodes, contrary to other proposed solutions. Additionally, DBDA implements a publish/subscribe model. This model provides a context-aware service to select the intermediate nodes according to the importance of the message, destination, current location and speed of the vehicles; as a result, it avoids delay, congestion, unnecessary duplications and low delivery rate.

The Policy of Industry-University Network Building and the Firm Networking: A Focus on the Daegu-Gyeongbuk Region (정부의 산.학.연 네트워크 형성 정책과 기업의 네트워킹 활동 - 대구.경북 지역을 중심으로 -)

  • Choi, Kyung-Hee
    • Journal of the Economic Geographical Society of Korea
    • /
    • v.15 no.3
    • /
    • pp.404-423
    • /
    • 2012
  • This study is aimed at exploring the impact of the characteristics of the firms on firm's networking. We develop a framework theorizing firm's networking according to sales, size, research facility, the percentage of R&D staff to total employees, the percentage of R&D investment to total sales, the number of the certification, the intention of attending seminars, the experience of participating in the government subsidy program. The results of the analysis show that research capacity, openness to a variety of information source, the experience of participating in the government subsidy program are significant in determining the firm's networking. The government needs to encourage the firms to improve their research capacity, and to train the coordinators to help the firms get higher openness to a variety of information source, use the government subsidy program.

  • PDF

SPMLD: Sub-Packet based Multipath Load Distribution for Real-Time Multimedia Traffic

  • Wu, Jiyan;Yang, Jingqi;Shang, Yanlei;Cheng, Bo;Chen, Junliang
    • Journal of Communications and Networks
    • /
    • v.16 no.5
    • /
    • pp.548-558
    • /
    • 2014
  • Load distribution is vital to the performance of multipath transport. The task becomes more challenging in real-time multimedia applications (RTMA), which impose stringent delay requirements. Two key issues to be addressed are: 1) How to minimize end-to-end delay and 2) how to alleviate packet reordering that incurs additional recovery time at the receiver. In this paper, we propose sub-packet based multipath load distribution (SPMLD), a new model that splits traffic at the granularity of sub-packet. Our SPMLD model aims to minimize total packet delay by effectively aggregating multiple parallel paths as a single virtual path. First, we formulate the packet splitting over multiple paths as a constrained optimization problem and derive its solution based on progressive approximation method. Second, in the solution, we analyze queuing delay by introducing D/M/1 model and obtain the expression of dynamic packet splitting ratio for each path. Third, in order to describe SPMLD's scheduling policy, we propose two distributed algorithms respectively implemented in the source and destination nodes. We evaluate the performance of SPMLD through extensive simulations in QualNet using real-time H.264 video streaming. Experimental results demonstrate that: SPMLD outperforms previous flow and packet based load distribution models in terms of video peak signal-to-noise ratio, total packet delay, end-to-end delay, and risk of packet reordering. Besides, SPMLD's extra overhead is tiny compared to the input video streaming.

Investigation for Applicability of Bluetooth Mesh Networking in Underground Space (BMN(Bluetooth Mesh Networking)의 지하공간 적용성에 대한 사례 조사)

  • Lee, Chulho;Choi, Soon-Wook;Kang, Tae-Ho;Jeon, Jinoh;Ahn, Cheongjin;Song, Tae-Geon
    • Tunnel and Underground Space
    • /
    • v.29 no.6
    • /
    • pp.367-378
    • /
    • 2019
  • As the development of IT technology, the way to manage the underground construction site in real time using wireless network communication is being considered. Underground space is limited area compared to the ground site due to the enclosed communication environment and spatial characteristics. BMN (Bluetooth Mesh Networking) technology is a recently introduced wireless communication technology that bluetooth device acts as a repeater to form a networking mesh and monitor individual devices. This article examines the areas to be considered for analyzing the applicability of BMN technology to underground spaces, and the cases studies of wireless communication monitoring systems currently being developed. And the BMN technology which is being developed for the underground application is also introduced.

A (k,t,n) verifiable multi-secret sharing scheme based on adversary structure

  • Li, Jing;Wang, Licheng;Yan, Jianhua;Niu, Xinxin;Yang, Yixian
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.8 no.12
    • /
    • pp.4552-4567
    • /
    • 2014
  • A (n,t,n) secret sharing scheme is to share a secret among n group members, where each member also plays a role of a dealer,and any t shares can be used to recover the secret. In this paper, we propose a strong (k,t,n) verifiable multi-secret sharing scheme, where any k out of n participants operate as dealers. The scheme realizes both threshold structure and adversary structure simultaneously, and removes a trusted third party. The secret reconstruction phase is performed using an additive homomorphism for decreasing the storage cost. Meanwhile, the scheme achieves the pre-verification property in the sense that any participant doesn't need to reveal any information about real master shares in the verification phase. We compare our proposal with the previous (n,t,n) secret sharing schemes from the perspectives of what kinds of access structures they achieve, what kinds of functionalities they support and whether heavy storage cost for secret share is required. Then it shows that our scheme takes the following advantages: (a) realizing the adversary structure, (b) allowing any k out of n participants to operate as dealers, (c) small sized secret share. Moreover, our proposed scheme is a favorable candidate to be used in many applications, such as secure multi-party computation and privacy preserving data mining, etc.

Relay of Remote Control Signal for Spacecraft in Deep Space via FHLH (FHLH를 매개로 한 심우주 우주선 원격 제어 신호 중계)

  • Koo, Cheol Hea;Kim, Hyungshin
    • Journal of the Korean Society for Aeronautical & Space Sciences
    • /
    • v.48 no.4
    • /
    • pp.295-301
    • /
    • 2020
  • When a spacecraft in deep space falls into an abnormal state, an emergency communication channel between ground and the spacecraft is essential in order to perform analysis to the cause of the anomaly, and to remedy the spacecraft from the distressed state. Because the recovery actions generally comprises of long and complicated sequences of commands, the transmission of the recovery commands may require a reliable and a delay tolerant networking technology based on bundle routing. While the delay tolerant networking protocol becomes a prominent method interfacing ground and space into a internet-like Solar system network because it can address the issues of the severe communication problems in deep space, the communication system on the spacecraft which based on space packet protocol cannot use the delay tolerant networking technology directly. So a community of the consultative committee for space data systems starts a discussion of the first-hop last-hop mechanism to establish a feasible concept and standardization. This paper presents an enhanced concept of the first-hop last-hop by applying it a virtual cislunar communication environment, and we believe this contributes to make a way applicable to an interoperable relay concept of the first hop last hop between the delay tolerant networking and space packet protocol standard.

Self-organization Networking Scheme for Constructing Infrastructure-less based IoT Network (비인프라 기반 사물인터넷 구축을 위한 자율네트워킹 기법)

  • Youn, Joosang
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.22 no.1
    • /
    • pp.196-201
    • /
    • 2018
  • Recently, various infrastructure-less IoT networking schemes have been studied to construct local IoT networks based on self-organization. This is, because RPL protocol, which is to support infrastructure based network construction is used to construct local IoT networks. Thus, a self-organization networking and ad hoc path between client and server in local IoT networks is not supported in basis RPL protocol. In this paper, we propose a self-organization networking scheme which support infrastructure-less based IoT network construction in low-power and lossy network based IoT environments consisting of IoT devices with the constrained feature, such as low power, the limited transmission rate and low computing capacity. Through simulation, we show that the proposed self-organization networking scheme improves the performance, in terms of the number of packets generated for end-to end data transmission and the end-to-end delay, compared to basis RPL protocol.