We surveyed employees who use personal devices for work. Residual analysis for cross-tabulation was carried out for three groups classified based on company rules and regulations established for mobile work. We show that the behavior of employees working with personal devices to process business data changes due to the presence or absence of the company rules and regulations.

This paper proposes a method for human pose estimation in still images. The proposed method achieves occlusion-aware appearance modeling. Appearance modeling with less accurate appearance data is problematic because it adversely affects the entire training process. The proposed method evaluates the effectiveness of mitigating the influence of occluded body parts in training sample images. In order to improve occlusion evaluation by a discriminatively-trained model, occlusion images are synthesized and employed with non-occlusion images for discriminative modeling. The score of this discriminative model is used for weighting each sample in the training process. Experimental results demonstrate that our approach improves the performance of human pose estimation in contrast to base models.

An operating system is an essential piece of software that manages hardware and software resources. Thus, attacks on an operating system kernel using kernel rootkits pose a particularly serious threat. Detecting an attack is difficult when the operating system kernel is infected with a kernel rootkit. For this reason, handling an attack will be delayed causing an increase in the amount of damage done to a computer system. In this paper, we propose Kernel Rootkits Guard (KRGuard), which is a new method to detect kernel rootkits that monitors branch records in the kernel space. Since many kernel rootkits make branches that differ from the usual branches in the kernel space, KRGuard can detect these differences by using the hardware features of commodity processors. Our evaluation shows that KRGuard can detect kernel rootkits that involve new branches in the system call handler processing with small overhead.

We describe a field experiment of flexible modulation format adaptation on a real-time 400Gbit/s/ch DSP-LSI. This real-time DSP-LSI features OSNR estimation, practical simplified back propagation, and high gain soft-decision forward error correction. With these techniques, we have successfully demonstrated modulation format allocation and transmission of 56-channel 400Gbit/s-2SC-PDM-16QAM and 200Gbit/s-2SC-PDM-QPSK signals in 216km and 3246km standard single mode fiber, respectively.

With the expected increase in popularity of device-to-device (D2D) services, the importance of implementing an LTE simulator that enables fast and accurate evaluations of D2D related technologies is clear. In this paper, we report on a network simulator, D2dSim, with the aim of realizing an LTE-Advanced network that utilizes the D2D feature, i.e., in which direct transmission between mobile stations (MSs) is enabled. Using NS-3, one of the most popular network simulation platforms, D2dSim could become one of the first realistic open-source D2D-capable environments, providing realistic and standard-compliant implementations of a subset of Proximity-based Services complying with the LTE-A standard.

With the rapid spread of smart devices, such as smartphones and tablet PCs, user authentication is becoming increasingly important because various kinds of data concerning user privacy are processed within them. At present, in the case of smart devices, password-based authentication is frequently used; however, biometric authentication has attracted more attention as a user authentication technology. A smart device is equipped with various sensors, such as cameras, microphones, and touch panels, many of which enable biometric information to be obtained. While the function of biometric authentication is available in many smart devices, there remain some problems to be addressed for more secure and convenient user authentication. In this paper, we summarize the current problems with user authentication on smart devices and propose a novel user authentication system based on the concept of context awareness to resolve these problems. We also present our evaluation of the performance of the system by using biometric information that was acquired from smart devices. The evaluation demonstrates the effectiveness of our system.

In this paper, we study partial key exposure attacks on RSA where the number of unexposed blocks of the private key is greater than or equal to one. This situation, called generalized framework of partial key exposure attack, was first shown by Sarkar [22] in 2011. Under a certain condition for the values of exposed bits, we present a new attack which needs fewer exposed bits and thus improves the result in [22]. Our work is a generalization of [28], and the approach is based on Coppersmith's method and the technique of unravelled linearization.

Internet of Things (IoT) has been widely applied in various fields. IoT data can also be put to cloud, but there are still concerns regarding security and privacy. Ciphertext-Policy Attribute-Based Encryption (CP-ABE) is attracted attention in cloud storage as a suitable encryption scheme for confidential data share and transmission. In CP-ABE, the secret key of a user is associated with a set of attributes; when attributes satisfy the access structure, the ciphertext is able to be decrypted. It is necessary that multiple authorities issue and manage secret keys independently. Authorities that generate the secret key can be regarded as managing the attributes of a user in CP-ABE. CP-ABE schemes that have multiple authorities have been proposed. The other hand, it should consider that a user's operation at the terminals is not necessary when a user drop an attribute and key is updated and the design of the communication system is a simple. In this paper, we propose CP-ABE scheme that have multiple key authorities and can revoke attribute immediately with no updating user's secret key for attribute revocation. In addition, the length of ciphertext is fixed. The proposed scheme is IND-CPA secure in DBDH assumption under the standard model. We compare the proposed scheme and the other CP-ABE schemes and show that the proposed scheme is more suitable for cloud storage.

In this paper, extended polar codes based on re-polarization technique are proposed. The presented schemes extend a conventional polar code of length N to length N+q, which stand in contrast to known length-compatible schemes such as puncturing and shortening techniques that reduce the length from N to N-q. For certain specific lengths, the waterfall region performance of our extended polar code is superior to that of other length-compatible polar codes. It provides better reliability and reduces the management overhead in several storage devices and communications systems. In essence, extended polar codes are created by re-polarizing the q least reliable nonfrozen bit-channels with the help of q additional frozen bit-channels. It is proved that this re-polarization enhances the reliability of these bits. Moreover, the extended schemes can be not only modified to improve decoding performance, but generalized as a m-stage scheme to improve throughput significantly. With parallel operation, the throughput is improved around 2m-1 times when q is small. Compared to a shortened polar code with length 1536, the encoding and decoding complexities of an extended polar code are only 50% and 60.5%, respectively.

The purpose of this research is to support learners in self-directed learning on the Internet using automatically generated support using the current state of the semantic web. The main issue of creating meaningful content-dependent questions automatically is that it requires the machine to understand the concepts in the learning domain. The originality of this work is that it uses Linked Open Data (LOD) to enable meaningful content-dependent support in open learning space. Learners are supported by a learning environment, the Semantic Open Learning Space (SOLS). Learners use the system to build a concept map representing their knowledge. SOLS supports learners following the principle of inquiry-based learning. Learners that request help are provided with automatically generated questions that give them learning objectives. To verify whether the current system can support learners with fully automatically generated support, we evaluated the system with three objectives: judge whether the LOD based support was feasible and useful, whether the question support improved the development of historical considerations in the learners' mind and whether the engagement of learners was improved by the question support. The results showed that LOD based support was feasible. Learners felt that the support provided was useful and helped them learn. The question support succeeded in improving the development of learners' deep historical considerations. In addition, the engagement and interest in history of learners was improved by the questions. The results are meaningful because they show that LOD based question support can be a viable tool to support self-directed learning in open learning space.

Improving energy efficiency is critical for embedded systems in our rapidly evolving information society. Near real-time data processing tasks, such as multimedia streaming applications, exhibit a common fact that their deadline periods are longer than their input intervals due to buffering. In general, executing tasks at lower performance is more energy efficient. On the other hand, higher performance is necessary for huge tasks to meet their deadlines. To minimize the energy consumption while meeting deadlines strictly, adaptive task scheduling including dynamic performance mode selection is very important. In this work, we propose an energy efficient slack-based task scheduling algorithm for such tasks by adapting to task size variations and applying DVFS with the help of statistical analysis. We confirmed that our proposal can further reduce the energy consumption when compared to oracle frame-based scheduling.

In this letter, three types of constructions for multipermutation codes are investigated by using interleaving technique and single-deletion permutation codes to correct a predetermined number of adjacent deletions. The decoding methods for the proposed codes are provided in proofs and verified with examples. The rates of these multipermutation codes are also compared.

A fast parameter estimation method with a coarse estimation and a fine estimation for polyphase P coded signals is proposed. For a received signal with N sampling points, the proposed method has an improved performance when the signal-to-noise ratio (SNR) is larger than 2dB and a lower computational complexity O(N logs N) compared with the latest time-frequency rate estimation method whose computational complexity is O(N2).

We demonstrate on the basis of ab initio calculations that metal-oxide-nitride-oxide-semiconductor (MONOS) memory is one of the most promising future high-density archive memories. We find that O related defects in a MONOS memory cause irreversible structural changes to the SiO2/Si3N4 interface at the atomistic level during program/erase (P/E) cycles. Carrier injection during the programming operation makes the structure energetically very stable, because all the O atoms in this structure take on three-fold-coordination. The estimated lifespan of the programmed state is of the order of a thousand years.

In order to support seamless mobility in the Information-Centric Networking (ICN) Architecture we propose the Named-Node Network Architecture (3NA). 3NA introduces two independent namespaces to ICN, the 3N namespace used to uniquely identify nodes within a network and the Point of Attachment (PoA) namespace to identify a node's PoA to the network. The mappings between the two namespaces, along with all the necessary mechanisms to keep the mappings updated over time, are used when routing ICN packets to improve delay and the goodput when either the producer or the consumer are mobile. To support simultaneous producer and consumer mobility, we expand on the 3NA by adding a new Protocol Data Unit (PDU), the DU PDU. The DU PDU permits the encapsulation of ICN packets in a header that has source and destination name fields which belong to 3NA's 3N namespace. The new PDU permits seamless connectivity as long as 3NA's point of attachment signaling is strictly followed. We demonstrate the performance of the DU PDU against our previous defined communication methods and Named Data Networking's (NDN) Smart Flooding forwarding strategy using our open source nnnSIM module for the ns-3 framework. The new PDU outperforms all existing alternatives when the producer or both consumer and provider are mobile, obtaining overall lower mean network delay and higher median goodput.

The application of Intelligent Transport Systems (ITS) transmits data with road-to-vehicle communication (RVC) and inter-vehicle communication (IVC). Digital signature is essential to provide security for RVC and IVC. The public key certificate is used to verify that a public key belongs to an individual prover such as user or terminal. A certificate revocation list (CRL) is used for verifying validity of the public key certificate. A certificate authority (CA) publishes a CRL and distributes it to vehicles. CRL distribution traffic disturbs ITS application traffic because of sharing wireless channel between them. To distribute it on low bit rate will help to ease the disturbance. Although multiplex transmitting is effective in reliable communication, a duplication of received packets is waste of bandwidth as a consequence. This paper proposes a CRL distribution scheme based on random network coding which can reduce duplicate packets. The simulation results show that the number of duplicate packets of the proposed scheme is less than that of a simple error correction (EC)-based scheme and the proposed one can distribute CRL to more vehicles than EC-based ones.

In recent years, spectrum sharing has received much attention as a technique for more efficient spectrum use. In the case in which all providers are cooperative, spectrum sensing can easily be realized and can improve user throughput (on average). If that is not the case, providers are not cooperative, i.e., spectrum trading, spectrum bands are rented to promote spectrum sharing. To ensure more profit, however, non-cooperative providers must correctly estimate the fluctuation of the number of connected users to be able to determine the offered channel price. In this paper, we propose a spectrum sharing method to achieve both higher throughput and provider profit via appropriate pricing using a disaggregate behavioral model. Finally, we confirm the effectiveness of the proposed method using simulation experiments.

Recently, P2PTV is a popular application to deliver video streaming data over the Internet. On the overlay network, P2PTV applications create logical links between pairs of peers considering round trip time (RTT) without physical network consideration. P2PTV packets are shared over a network without localization awareness which is a serious problem for Internet Service Providers (ISPs). A delay-insertion-based traffic localization scheme was proposed for solving this problem. However, this scheme sometimes leads the newly joining peer to download streaming traffic from a local neighbor peer which has only scarce upload bandwidth. This paper proposes a novel scheme of delay-insertion-based traffic localization in which the router estimates relay capability to each relay peer candidate and leads the newly joining peer to connect to a neighbor peer with sufficient performance for relaying video data. Parameters were evaluated for the optimized condition in the relay capability estimation process. In addition, experiments conducted on a real network show that our proposed scheme can prevent the newly joining peer from downloading video data from peers with insufficient relay capability and maintain video quality close to normal in a P2PTV system while ensuring efficient traffic localization at the level of the Autonomous System (AS) network.

A novel element is proposed for manipulating two orthogonally-polarized electromagnetic waves, resulting in a polarization-reconfigurable flat transmitarray. This element consists of four identical metallic patterns, including a square frame loaded with short stubs and an internal crossed dipole, which are printed on the two sides of three identical flat dielectric slabs, with no air gap among them. With a linearly-polarized (LP) feeder, the flat transmitarray can transform the LP incident wave into a circular, horizontal or vertical polarization wave in a convenient way. By rotating the LP feeder so that the polarization angle is 0°, 45°, 90° or 135°, the waves of linear horizontal, right-handed circular, linear vertical or left-handed circular polarization can be obtained alternately. Simulations and experiments are conducted to validate the performance. The measured axial ratio bandwidths for RHCP and LHCP transmitarrays are about 7.1% and 5.1%, respectively, the 3dB gain bandwidths are 16.19% and 22.4%, and the peak gains are 25.56dBi and 24.2dBi, respectively.

With the increasing demand of Internet-of-Things applicability in various devices and location-based services (LBSs) with positioning capabilities, we proposed simple and effective post-processing techniques to reduce positioning error and provide more precise navigation to users in a pedestrian environment in this letter. The proposed positioning error reduction techniques (Technique 1-minimum range securement and bounce elimination, Technique 2-direction vector-based error correction) were studied considering low complexity and wide applicability to various types of positioning systems, e.g., global positioning system (GPS). Through the real field tests in urban areas, we have verified that an average positioning error of the proposed techniques is significantly decreased compared to that of a GPS-only environment.