To shut them up or to clarify: restraining the spread of rumors in online social networks

Restraining the spread of rumors in online social networks (OSNs) has long been an important but difficult problem to be addressed. Currently, there are mainly two types of methods 1) blocking rumors at the most influential users or community bridges, or 2) spreading truths to clarify the rumors. Each method claims the better performance among all the others according to their own considerations and environments. However, there must be one standing out of the rest. In this paper, we focus on this part of work. The difficulty is that there does not exist a universal standard to evaluate them. In order to address this problem, we carry out a series of empirical and theoretical analysis on the basis of the introduced mathematical model. Based on this mathematical platform, each method will be evaluated by using real OSN data.We have done three types of analysis in this work. First, we compare all the measures of locating important users. The results suggest that the degree and betweenness measures outperform all the others in the Facebook network. Second, we analyze the method of the truth clarification method, and find that this method has a long-term performance while the degree measure performs well only in the early stage. Third, in order to leverage these two methods, we further explore the strategy of different methods working together and their equivalence. Given a fixed budget in the real world, our analysis provides a potential solution to find out a better strategy by integrating both types of methods together. From both the academic and technical perspective, the work in this paper is an important step towards the most practical and optimal strategies of restraining rumors in OSNs.

Reliable multicast with pipelined network coding using opportunistic feeding and routing

Multicast is an important mechanism in modern wireless networks and has attracted significant efforts to improve its performance with different metrics including throughput, delay, energy efficiency, etc. Traditionally, an ideal loss-free channel model is widely used to facilitate routing protocol design. However, the quality of wireless links is affected or even jeopardized resulting in transmission failures by many factors like collisions, fading or the noise of environment. In this paper, we propose a reliable multicast protocol, called CodePipe, with energy-efficiency, high throughput and fairness in lossy wireless networks. Building upon opportunistic routing and random linear network coding, CodePipe can not only eliminate coordination between nodes, but also improve the multicast throughput significantly by exploiting both intra-batch and inter-batch coding opportunities. In particular, four key techniques, namely, LP-based opportunistic routing structure, opportunistic feeding, fast batch moving and inter-batch coding, are proposed to offer significant improvement in throughput, energy-efficiency and fairness.Moreover, we design an efficient online extension of CodePipe such that it can work in a dynamic network where nodes join and leave the network as time progresses. We evaluate CodePipe on ns2 simulator by comparing with other two state-of-art multicast protocols,MORE and Pacifier. Simulation results show that CodePipe significantly outperforms both of them.

Containing smartphone worm propagation with an influence maximization algorithm

In recent years, wide attention has been drawn to the problem of containing worm propagation in smartphones. Unlike existing containment models for worm propagation, we study how to prevent worm propagation through the immunization of key nodes (e.g.; the top k influential nodes). Thus, we propose a novel containment model based on an influence maximization algorithm. In this model, we introduce a social relation graph to evaluate the influence of nodes and an election mechanism to find the most influential nodes. Finally, this model provides a targeted immunization strategy to disable worm propagation by immunizing the top k influential nodes. The experimental results show that the model not only finds the most influential top k nodes quickly, but also effectively restrains and controls worm propagation.

Can we beat DDoS attacks in clouds?

Cloud is becoming a dominant computing platform. Naturally, a question that arises is whether we can beat notorious DDoS attacks in a cloud environment. Researchers have demonstrated that the essential issue of DDoS attack and defense is resource competition between defenders and attackers. A cloud usually possesses profound resources and has full control and dynamic allocation capability of its resources. Therefore, cloud offers us the potential to overcome DDoS attacks. However, individual cloud hosted servers are still vulnerable to DDoS attacks if they still run in the traditional way. In this paper, we propose a dynamic resource allocation strategy to counter DDoS attacks against individual cloud customers. When a DDoS attack occurs, we employ the idle resources of the cloud to clone sufficient intrusion prevention servers for the victim in order to quickly filter out attack packets and guarantee the quality of the service for benign users simultaneously. We establish a mathematical model to approximate the needs of our resource investment based on queueing theory. Through careful system analysis and real-world data set experiments, we conclude that we can defeat DDoS attacks in a cloud environment. © 2013 IEEE.

Are the popular users always important for information dissemination in online social networks?

This article verifies the importance of popular users in OSNs. The results are counter-intuitive. First, for dissemination speed, a large amount of users can swiftly distribute information to the masses, but they are not highly-connected users. Second, for dissemination scale, many powerful forwarders in OSNs cannot be identified by the degree measure. Furthermore, to control dissemination, popular users cannot capture most bridges of social communities.

Joint resource allocation for max-min throughput in multicell networks

We investigate the resource-allocation problem in multicell networks targeting the max-min throughput of all cells. A joint optimization over power control, channel allocation, and user association is considered, and the problem is then formulated as a nonconvex mixed-integer nonlinear problem (MINLP). To solve this problem, we proposed an alternating-optimization-based algorithm, which applies branch-and-bound and simulated annealing in solving subproblems at each optimization step. We also demonstrate the convergence and efficiency of the proposed algorithms by thorough numerical experiments. The experimental results show that joint optimization over all resources outperforms the restricted optimization over individual resources significantly.

Analysis of backward congestion notification with delay for enhanced Ethernet networks

At present, companies and standards organizations are enhancing Ethernet as the unified switch fabric for all of the TCP/IP traffic, the storage traffic and the high performance computing traffic in data centers. Backward congestion notification (BCN) is the basic mechanism for the end-to-end congestion management enhancement of Ethernet. To fulfill the special requirements of the unified switch fabric, i.e., losslessness and low transmission delay, BCN should hold the buffer occupancy around a target point tightly. Thus, the stability of the control loop and the buffer size are critical to BCN. Currently, the impacts of delay on the performance of BCN are unidentified. When the speed of Ethernet increases to 40 Gbps or 100 Gbps in the near future, the number of on-the-fly packets becomes the same order with the buffer size of switch. Accordingly, the impacts of delay will become significant. In this paper, we analyze BCN, paying special attention on the delay. We model the BCN system with a set of segmented delayed differential equations, and then deduce sufficient condition for the uniformly asymptotic stability of BCN. Subsequently, the bounds of buffer occupancy are estimated, which provides direct guidelines on setting buffer size. Finally, numerical analysis and experiments on the NetFPGA platform verify our theoretical analysis.

On optimally reducing power loss in micro-grids with power storage devices

Smart micro-grids can produce 'renewable' energy and store them in power storage devices. Power loss, however, is a significant problem in power exchange among the micro-grids and between the macro-station and individual micro-grids. To optimally reduce the total power losses in such a power grid system, in this paper, a greedy coalition formation algorithm is proposed, which allows the macro-station to coordinate mutual power exchange among the micro-grids and between each micro-grid and the macro-station. Our algorithm optimizes the total power losses across the entire power grid, including the cost of charging and discharging power storage devices and power losses due to power transfers. The algorithm creates exchange pairs among the micro-grids, giving priority to pairs with higher power loss reduction per exchanged power unit. Through computer-based simulations, we demonstrate that the proposed approach significantly reduces the average power loss compared with the conventional noncooperative method. The simulations also demonstrate that the communications overhead of our proposal (due to negotiations aimed at forming coalitions) does not significantly affect the available communication resource. © 2014 IEEE.

Characterization and optimization to improve uneven surface on MEMS bridge fabrication

This paper presents an optimized fabrication method for developing a freestanding bridge for RF MEMS switches. In this method, the sacrificial layer is patterned and hard baked a 220°C for 3min, after filling the gap between the slots of the coplanar waveguide. Measurement results by AFM and SEM demonstrate that this technique significantly improves the planarity of the sacrificial layer, reducing the uneven surface to less than 20nm, and the homogeneity of the Aluminum thickness across the bridge. Moreover, a mixture of O2, Ar and CF4 was used and optimized for dry releasing of the bridge. A large membrane (200×100μm2) was released without any surface bending. Therefore, this method not only simplifies the fabrication process, but also improves the surface flatness and edge smoothness of the bridge. This fabrication method is fully compatible with standard silicon IC technology.

Adaptive fuzzy multi-surface sliding control of multiple-input and multiple-output autonomous flight systems

In this study, we proposed an adaptive fuzzy multi-surface sliding control (AFMSSC) for trajectory tracking of 6 degrees of freedom inertia coupled aerial vehicles with multiple inputs and multiple outputs (MIMO). It is shown that an adaptive fuzzy logic-based function approximator can be used to estimate the system uncertainties and an iterative multi-surface sliding control design can be carried out to control flight. Using AFMSSC on MIMO autonomous flight systems creates confluent control that can account for both matched and mismatched uncertainties, system disturbances and excitation in internal dynamics. It is proved that the AFMSSC system guarantees asymptotic output tracking and ultimate uniform boundedness of the tracking error. Simulation results are presented to validate the analysis.

Quantitative assessment of ADL: a pilot study of upper extremity reaching tasks

Effective telerehabilitation technologies enable patients with certain physiological disabilities to engage in rehabilitative exercises for performing Activities of Daily Living (ADLs). Therefore, training and assessment scenarios for the performance of ADLs are vital for the promotion for telerehabilitation. In this paper we investigate quantitatively and automatically assessing patient's kinematic ability to perform functional upper extremity reaching tasks. The shape of the movement trajectory and the instantaneous acceleration of kinematically crucial body parts, such as wrists, are used to compute the approximate entropy of the motions to represent stability (smoothness) in addition to the duration of the activity. Computer simulations were conducted to illustrate the consistency, sensitivity and robustness of the proposed method. A preliminary experiment with kinematic data captured from healthy subjects mimicking a reaching task with dyskinesia showed a high degree of correlation (Cohen's kappa 0.85 with p < 0.05) between a human observer and the proposed automatic classification tool in terms of assigning the datasets to various levels to represent the subjects' kinematic abilities to perform reaching tasks. This study supported the use of Microsoft Kinect to quantitatively evaluate the ability of individuals with involuntary movements to perform an upper extremity reaching task.

A review on computational intelligence methods for controlling traffic signal timing

Urban traffic as one of the most important challenges in modern city life needs practically effective and efficient solutions. Artificial intelligence methods have gained popularity for optimal traffic light control. In this paper, a review of most important works in the field of controlling traffic signal timing, in particular studies focusing on Q-learning, neural network, and fuzzy logic system are presented. As per existing literature, the intelligent methods show a higher performance compared to traditional controlling methods. However, a study that compares the performance of different learning methods is not published yet. In this paper, the aforementioned computational intelligence methods and a fixed-time method are implemented to set signals times and minimize total delays for an isolated intersection. These methods are developed and compared on a same platform. The intersection is treated as an intelligent agent that learns to propose an appropriate green time for each phase. The appropriate green time for all the intelligent controllers are estimated based on the received traffic information. A comprehensive comparison is made between the performance of Q-learning, neural network, and fuzzy logic system controller for two different scenarios. The three intelligent learning controllers present close performances with multiple replication orders in two scenarios. On average Q-learning has 66%, neural network 71%, and fuzzy logic has 74% higher performance compared to the fixed-time controller.

Discrete Wirtinger-based inequality and its application

In this paper, we derive a new inequality, which encompasses the discrete Jensen inequality. The new inequality is applied to analyze stability of linear discrete systems with an interval time-varying delay and a less conservative stability condition is obtained. Two numerical examples are given to show the effectiveness of the obtained stability condition.

Noncontact detection and analysis of respiratory function using microwave Doppler Radar

Real-time respiratory measurement with Doppler Radar has an important advantage in the monitoring of certain conditions such as sleep apnoea, sudden infant death syndrome (SIDS), and many other general clinical uses requiring fast nonwearable and non-contact measurement of the respiratory function. In this paper, we demonstrate the feasibility of using Doppler Radar in measuring the basic respiratory frequencies (via fast Fourier transform) for four different types of breathing scenarios: normal breathing, rapid breathing, slow inhalation-fast exhalation, and fast inhalation-slow exhalation conducted in a laboratory environment. A high correlation factor was achieved between the Doppler Radar-based measurements and the conventional measurement device, a respiration strap. We also extended this work from basic signal acquisition to extracting detailed features of breathing function (I: E ratio). This facilitated additional insights into breathing activity and is likely to trigger a number of new applications in respiratory medicine.

RFID translation into Australian hospitals: an exploration through Actor-Network Theoretical(ANT) Lens

Radio Frequency Identification (RFID) is a technology that has been deployed successfully for asset tracking within hospitals aimed at improving the quality of processes. In the Australian hospitals context however, adoption of this technology seem sporadic. This research reports on a long-term investigation to gain a deeper understanding of the socio-technical factors involved in the adoption of RFID in Australian hospitals. The research was conducted using interpretive multiple case methodology and results analyzed through the Actor-Network Theoretical (ANT) Lens. © 2013 Infonomics Society.