With the rise of social network service (SNS) in recent years, the security of SNS users' private information has been a concern for the public. However, due to the anonymity of SNS, identity impersonation is hard to be detected and prevented since users are free to create an account with any username they want. This could lead to cybercrimes like fraud because impersonation allows malicious users to steal private information. Until now, there are few studies about this problem, and none of them can perfectly handle this problem. In this paper, based on an idea from previous work, we combine blockchain technology and security protocol to prevent impersonation in SNS. In our scheme, the defects of complex and duplicated operations in the previous work are improved. And the authentication work of SNS server is also adjusted to resist single-point, attacks. Moreover, the smart contract is introduced to help the whole system runs automatically. Afterward, our proposed scheme is implemented and tested on an Ethereum test network and the result suggests that it is acceptable and suitable for nowadays SNS network.

Following our former works on regular sampling in wavelet subspaces, the paper provides two algorithms to estimate the truncation error and aliasing error respectively when the theorem is applied to calculate concrete signals. Furthermore the shift sampling case is also discussed. Finally some important examples are calculated to show the algorithm.

In this paper, a Happiness Cups (H-cups) system is proposed to bi-directionally convey the holding-cup motions of paired cups between two remote users. To achieve this goal, the H-cups system uses three important components. Firstly, paired cups are embedded with accelerometers and gyro sensors to transmit the three-dimensional acceleration and angular signals to a motion recognizer application. This application is designed on an Android phone. The sensors then receive the remotely recognized motions and flash a specific color on the local cup's RGB-LED via Bluetooth. Secondly, the application considers holding-cup motion recognition from the cup based on long short-term memory (LSTM) and sends the local recognized motion through an intermediate server to transmit to the remote paired cup via the internet. Finally, an intermediate server is established and used to exchange and forward the recognized holding-cup motions between two paired cups, in which five holding-cup motions, including drinking, horizontal shaking, vertical shaking, swaying and raising toasts are proposed and recognized by LSTM. The experimental results indicate that the recognition accuracy of the holding-cup motion can reach 97.3% when using our method.

In next generation mobile multimedia communications, different wireless access networks are expected to cooperate. However, it is a challenging task to choose an optimal transmission path in this scenario. This paper focuses on the problem of selecting the optimal access network for multicast services in the cooperative mobile and broadcasting networks. An algorithm is proposed, which considers multiple decision factors and multiple optimization objectives. An analytic hierarchy process (AHP) method is applied to schedule the service queue and an artificial neural network (ANN) is used to improve the flexibility of the algorithm. Simulation results show that by applying the AHP method, a group of weight ratios can be obtained to improve the performance of multiple objectives. And ANN method is effective to adaptively adjust weight ratios when users' new waiting threshold is generated.

The conditional sum adder (CSA) has been shown to outperform other adders applied in high-speed applications. This investigation proposes a modified CSA called the conditional carry adder (CCA). Based on the proposed adder architecture, six 64-bit hybrid dual-threshold CCAs for power-aware applications were discussed. Architectural modification of the CCA raises the operation speed, decreases the power dissipation, and lowers the hardware overhead. The proposed 64-bit CCA can decrease the number of multiplexers and internal nodes in the adder design by around 27% compared to the 64-bit CSA. Furthermore, components on critical paths use a low threshold voltage to accelerate the speed of operation, and other components use the normal threshold voltage to save power. This feature is very useful in implementing power-aware arithmetic systems. One of the proposed circuits has the lowest power-delay product and energy-delay product. The hybrid circuit represents a fine compromise between power and performance. Its power efficiency is better than that of the single threshold voltage circuit designs.

When an embedded system is designed, system performance and power consumption have to be taken carefully into consideration. In this paper, we focus on reducing the number of memory access times in embedded systems to improve performance and save power. We use the locality of running programs to reduce the number of memory accesses in order to save power and maximize the performance of an embedded system. We use shorter code words to encode the instructions that are frequently executed and then pack continuous code words into a pseudo instruction. Once the decompression engine fetches one pseudo instruction, it can extract multiple instructions. Therefore, the number of memory access times can be efficiently reduced because of space locality. However, the number of the most frequently executed instructions is different due to the program size of different applications; that is, the number of memory access times increases when there are less encoded instructions in a pseudo instruction. This situation results in a degradation of system performance and power consumption. To solve this problem, we also propose the use of multiple reference tables. Multiple reference tables will result in the most frequently executed instructions having shorter encoded code words, thereby improving the performance and power of an embedded system. From our simulation results, our method reduces the memory access frequency by about 60% when a reference table with 256 instructions is used. In addition, when two reference tables that contain 256 instructions each are used, the memory access ratio is 10.69% less than the ratio resulting from one reference table with 512 instructions.

An oversampling theorem for regular sampling in wavelet subspaces is established. The sufficient-necessary condition for which it holds is found. Meanwhile the truncation error and aliasing error are estimated respectively when the theorem is applied to reconstruct discretely sampled signals. Finally an algorithm is formulated and an example is calculated to show the algorithm.

In this paper, the design of a QoS scheduling scheme for the Internet traffic is proposed by considering the correlation property of the arriving traffic. The basic concept of the Weighted Fair Queuing (WFQ) is adopted in the proposed scheme, however, the correlation property of the traffic stream is applied as the heuristic to adjust the share weight factors of each traffic type dynamically. The Auto Regressive Integrated Moving Average (ARIMA) model is applied in this paper to characterize the correlation property of the Internet traffic. And the share weight factors are derived from the parameters of the AR part and MA part. Experimental simulations are performed to illustrate the effectiveness of the proposed scheme. In addition to comparing the performance of each service types, we also define a fair play parameter (FPP) to examine the fairness index among various traffic streams of the proposed scheme. The experimental results indicate that the proposed scheme demonstrates a quite good performance in scheduling the integrated services and the fairness among service classes can also be achieved, especially when the link capacity is limited.

In this letter, we study cell cooperation in the downlink OFDMA cellular networks. The proposed cooperation scheme is based on fractional frequency reuse (FFR), where a cooperation group consists of three sector antennas from three adjacent cells and the subchannels of each cooperation group are allocated coordinately to users. Simulation results demonstrate the effectiveness of the proposed schemes in terms of throughput and fairness.

The AODV routing protocol, which is simple and efficient, is often used in wireless sensor networks to transmit data. The AODV routing protocol constructs a path from the source node, which detects the target, to the sink node. Whenever the target moves, the path will be reconstructed and the RREQ packet will be broadcasted to flood the wireless sensor network. The localization repair routing protocol sets up a reconstruction area and restricts the broadcast of the RREQ packet to that area to avoid broadcast storm. However, this method cannot reconstruct the path once the target moves out of the reconstruction area. In this paper, we propose a lightweight routing protocol for mobile target detection. When the path breaks because of the movement of the target, the nodes can repair the path effectively using the presented routing information to achieve the lightweight effect.

Outside wireless signals often obstruct GNSS receivers from acquiring satellite signals. Traditional anti-jamming algorithms are used to suppress interference using a convex optimization method based on minimizing output power. These algorithms can reduce interference. However, these models suppress satellite signals as well as jamming interference. Under the high-dynamic condition, the output signal-to-interference-and-noise ratio (SINR) deteriorates seriously and the success rate in acquiring satellite signals falls accordingly. This paper introduces a novel, broadened model with a no-main-lobe-and-multi-virtual-null-constraints (NMLCB) method based on maximizing output power and constraining interference sources. With the new method, GNSS receivers can receive satellite signals more easily than using the power inversion (PI) and power minimization with derivative constraints null (NB) methods under the high-dynamic condition.

The paper obtains an algorithm to estimate the irregular sampling in wavelet subspaces. Compared to our former work on the problem, the new estimate is relaxed for some wavelet subspaces.

Effective communication strategies with a properly designed source precoding matrix (PM) and a properly designed relay beamforming matrix (BM) can significantly improve the spectral efficiency of multiple-input multiple-output (MIMO) relaying broadcast channels (RBCs). In the present paper, we first propose a general communication scheme with non-regenerative relay that can overcome the half-duplex relay constraint of the general MIMO-RBC. Based on the proposed scheme, the robust source PM and relay BM are designed for imperfect channel state information at the transmitter (CSIT). In contrast to the conventional non-regenerative relaying communication scheme for the MIMO-RBC, in the proposed scheme, the source can send information continuously to the relay and users during two phases. Furthermore, in conjunction with the advanced precoding strategy, the proposed scheme can achieve a full-degree-of-freedom (DoF) MIMO-RBC with that each entry in the related channel matrix is considered to an i.i.d. complex Gaussian variable. The robust source PM and relay BM designs were investigated based on both throughput and fairness criteria with imperfect CSIT. However, solving the problems associated with throughput and fairness criteria for the robust source PM and relay BM designs is computationally intractable because these criteria are non-linear and non-convex. In order to address these difficulties, we first set up equivalent optimization problems based on a tight lower bound of the achievable rate. We then decompose the equivalent throughput problem into several decoupled subproblems with tractable solutions. Finally, we obtain the suboptimal solution for the throughput problem by an alternating optimization approach. We solve the fairness problem by introducing an adjusted algorithm according to the throughput problem. Finally, we demonstrate that, in both cases of throughput and fairness criteria, the proposed relaying communication scheme with precoding algorithms outperforms existing methods.

A previous study proposed a downlink scheduling of real time variable rate (RT-VR), non real time variable rate (NRT-VR), and best effort (BE) traffic forwarding classes[1] to support QoS of the WiMax network. However, the study did not consider scheduling extended real time variable rate (ERT-VR) service, which defines the additional requirement of jitter performance when compared with RT-VR service. This article studies the supplementing function in ERT-VR service to complete QoS scheduling of downlink traffic in the WiMax network. Simulation results indicate that the proposed scheme not only satisfies delay time, but also guarantees the jitter requirement of ERT-VR traffic.

This paper proposes two topology discovery algorithms for IP networks, namely, a network layer topology discovery algorithm and a link layer topology discovery algorithm. The network layer topology discovery algorithm discovers the subnets and devices in the network of interest and the connections among them. The devices in a subnet can be found by a network layer topology discovery algorithm; however, the connections among the devices cannot be obtained. The link layer topology discovery algorithm is proposed to find the devices in a subnet and the connections among them. The two algorithm are integrated to find the detailed topology map of an IP network. The proposed topology discovery algorithms are implemented based on the Tcl/Tk and Scotty environment. Some implementation details are discussed.

Interactions between ESD protection devices and other components of a chip can lead to complex and not easily anticipated discharge bevahior. Triggering of a protection MOSFET is equivalent to the closing of a fast switch and can cause substantial transient discharge currents. The peak value of this current depends on the chip capacitance, resistance, properties of the protection clamp, etc. Careful optimization of the protection circuit is therefore necessary to avoid current overstress and circuit failure.

In this paper, we present a revision of using eigenvalues of covariance matrices proposed by Tsai et al. as a measure of significance (i.e., curvature) for boundary-based corner detection. We first show the pitfall of Tsai et al.'s approach. We then further investigate the properties of eigenvalues of covariance matrices of three different types of curves and point out a mistake made by Tsai et al.'s method. Finally, we propose a modification of using eigenvalues as a measure of significance for corner detection to remedy their defect. The experiment results show that under the same conditions of the test patterns, in addition to correctly detecting all true corners, the spurious corners detected by Tsai et al.'s method disappear in our modified measure of significance.

Handoff plays an important role in vehicular networks due to high movement of vehicles. To provide seamless connectivity under Access Points (AP), this paper proposes an adaptive handoff triggering method to minimize communication time for a vehicle with an AP switch (i.e., whether and when to trigger a handoff process). In the proposed method, combined with an improved data transmission rate based trigger, handoff triggering decision is executed based on three different communication methods (called C-Dire, C-Relay and C-ALLRelay) to minimize the transmission delay when a vehicle moves from an AP to another. Transmission delay is derived through considering vehicle mobility and transmission rate diversity. The simulation results show that the proposed method is proven to be adaptive to vehicular networks.

In the more general framework "shift invariant subspace," the paper obtains a different estimate of sampling in function subspace to our former work, by using the Frame Theory. The derived formula is easy to be calculated, and the estimate is relaxed in some shift invariant subspaces. The former work is now, however, a special case of the present.

To lengthen the operational time of mobile devices, power must be managed effectively. To achieve this objective, a Discontinuous Reception (DRX) mechanism is proposed for use in the long-term evolution (LTE) network to enable user equipment (UE) to consume power efficiently. The DRX mechanism provides parameters related to base stations such as evolved Node B (eNB) to configure and manage the transition of UEs between idle (sleep) and active states. Although these parameters can be adjusted dynamically in cooperation with the traffic scheduler, a high signaling overhead and processing load might be introduced in practical deployment if the parameters are adjusted too frequently. In this study, to examine power-saving efficiency, distinct traffic types were scheduled that were constrained by various quality of service (QoS) factors without dynamically changing the DRX parameters. The concept of burst-based scheduling is proposed, based on considering the state transitions and channel conditions of each UE, to increase power-saving efficiency while concurrently satisfying the desired QoS. Both Hypertext Transfer Protocol (HTTP) and video-stream traffic models were exhaustively simulated to examine the performance of the proposed scheme and numerous scheduling alternatives were tested to compare the proposed scheme with other schemes. The simulation results indicate that video-streaming traffic is more sensitive to the scheduling schemes than HTTP traffic. The simulation results were further analyzed in terms of traffic scheduling and parameter adjustment and the analysis results can help design future studies on power management in the LTE network.