Microblog Burst Keywords Detection Based on Social Trust and Dynamics Model

Microblog has emerged as a popular medium for providing new sources of information and rapid communications, particularly during burst topics. Burst keywords detection from real-time microblog streams is important for burst topics detection. The exiting algorithms may detect fake burst keywords without taking into account the trustworthiness of the users and human＇s daily timetable. Our work is the first to combine the trustworthiness of the users with burst keywords detection. We propose a novel approach to detect burst keywords based on social trust and dynamics model. We adapt basic notions of dynamics from physics and model keywords bursts as momentum change of the keywords. On the analogy of physical dynamics model, this approach defines mass as the trustworthiness of user and position as the frequency of keywords. We compute each keyword＇s burst value by using Moving average convergence/divergence （MACD） and determine whether it is a burst keyword in a given time window. The experimental results on large-scale Sina microblog dataset show that the proposed approach can avoid detecting fake burst keywords.     

MTBAC： A Mutual Trust Based Access Control Model in Cloud Computing

As a new computing mode, cloud computing can provide users with virtualized and scalable web services, which faced with serious security challenges, however. Access control is one of the most important measures to ensure the security of cloud computing. But applying traditional access control model into the Cloud directly could not solve the uncertainty and vulnerability caused by the open conditions of cloud computing. In cloud computing environment, only when the security and reliability of both interaction parties are ensured, data security can be effectively guaranteed during interactions between users and the Cloud. Therefore, building a mutual trust relationship between users and cloud platform is the key to implement new kinds of access control method in cloud computing environment. Combining with Trust Management（TM）, a mutual trust based access control （MTBAC） model is proposed in this paper. MTBAC model take both user＇s behavior trust and cloud services node＇s credibility into consideration. Trust relationships between users and cloud service nodes are established by mutual trust mechanism. Security problems of access control are solved by implementing MTBAC model into cloud computing environment. Simulation experiments show that MTBAC model can guarantee the interaction between users and cloud service nodes.     

Self-Organization Approaches for Optimization in Cognitive Radio Networks

Cognitive radio （CR） is regarded as a promising technology for providing a high spectral efficiency to mobile users by using heterogeneous wireless network architectures and dynamic spectrum access techniques. However, cognitive radio networks （CRNs） may also impose some challenges due to the ever increasing complexity of network architecture, the increasing complexity with configuration and management of large-scale networks, fluctuating nature of the available spectrum, diverse Quality-of-Service （QoS） requirements of various applications, and the intensifying difficulties of centralized control, etc. Spectrum management functions with self-organization features can be used to address these challenges and realize this new network paradigm. In this paper, fundamentals of CR, including spectrum sensing, spectrum management, spectrum mobility and spectrum sharing, have been surveyed, with their paradigms of self-organization being emphasized. Variant aspects of self- organization paradigms in CRNs, including critical functionalities of Media Access Control （MAC）- and network-layer operations, are surveyed and compared. Furthermore, new directions and open problems in CRNs are also identified in this survey.     

Optimal energy efficiency capacity under joint design of sensing and transmission duration for cognitive radio system

Due to its opportunistic spectrum sharing capability, cognitive radio （CR） has been proposed as a fundamental solution to alleviate the contradiction between spectrum scarcity and inefficient utilization of licensed spectrum. In CR system （CRS）, to efficiently utilize the spectrum resource, one important issue is to allocate the sensing and transmission duration reasonably. In this paper, the evaluation metric of energy efficiency, which represented the total number of bits that were delivered with per joule of energy consumed, is adopted to evaluate the proposed scheme. We study a joint design of energy efficient sensing and transmission durations to maximize energy efficiency capacity （EEC） of CRS. The tradeoff between EEC and sensing and transmission durations are formulized as an optimization problem under constraints on target detection probability of secondary users （SUs） and toleration interference threshold of primary users （PUs）. To obtain the optimal solution, optimizing sensing duration and transmission duration will be first performed separately. Then, a joint optimization iterative algorithm is proposed to search the optimal pair of sensing and transmission durations. Analytical and simulation results show that there exists a unique duration pair where the EEC is maximized, and that the EEC of the proposed joint optimization algorithm outperforms that of existed algorithms. Furthermore, the simulation results also reveal that the performance of the proposed low complexity iterative algorithm is comparable with that of the exhaustive search scheme.     

Mechanism Design Based Nodes Selection Model for Threshold Key Management in MANETs

The design of threshold based distributed Certification authority （CA） has been proposed to provide secure and efficient key management service in Mobile ad hoc networks （MANETs）, but most of previous work ig- nore the efficiency and effectiveness and assuming there are always honest nodes performing the service. Focus- ing on developing a model to select a coalition of nodes dynamically and optimally to carry out the threshold key management service in MANETs, we formulate the dy- namic nodes selection problem as combinatorial optimiza- tion problem, with the objectives of maximizing the success ratio of the service and minimizing the nodes, cost of secu- rity and energy, and then extend the payment structure of the classical Vickrey, Clarke and Groves （VCG） mechanism design framework to ensure truth-telling is the dominant strategy for any node in our scenario. Compared with ex- isting works in the presence of selfish nodes, the proposed model enjoys an improvement of both the success ratio of key management service and lifetime of the network, and a reduction of both the cost of participating nodes and compromising probability of MANETs.     

A Probability Driven Quadri-Stage Contention Protocol for Mobile Ad Hoc Networks

The paper proposes a new contention based Time division multiple access （TDMA） Medium access control （MAC） protocol in wireless ad hoc networks, which can be termed Quadri-stage contention protocol （QSCP）. The QSCP protocol is free of both the ＂hidden terminal＂ and the ＂exposed terminal＂ problems. It is distributive and arbitrarily scalable. In the dedicated contention stage, nodes exchange their ＂Normalized accumulation and dissipation rate of payload （NADROP）＂ messages in 2-hop neighborhood, and then run a contention probability calculation algorithm to decide the probability of sending a contention frame. The algorithm guaran- tees that the number of time slot reserved by a node is proportional to its NADROP value, which can remarkably improve the end-to-end throughput when network load is heavy, and is more efficient in energy consumption. The simulation results demonstrate that QSCP performs better than the existing protocols.     

Best Effort Spectrum Allocation Scheme for Femtocell Networks in Dense Deployment

In orthogonal frequency division multiple access（OFDMA） based femtocell networks,the co-tier interference among femto base stations（FBS） becomes important in multiuser and densely deployed environment.In order to mitigate the co-tier interference and enhance the system total throughput,this paper proposed a best effort spectrum allocation scheme based on the extension of graph theory.In the scheme,a controller was proposed to collect the channel state information（CSI）of all femtocell user equipments（FUEs） in a certain range.Then,the controller evaluated the signal-to-interference Ratio（SIR） of each FUE and determined the set of its interference neighbors.By calculating the received power matrix（RPM） among FUEs and building interference graph matrix（IGM）,different spectrum resource blocks（RBs） were assigned to the users with interference relation,while users without interference relation shared the same RBs,which could increase the spectrum efficiency.Simulation results show that the proposed algorithm can significantly improve the RB usage efficiency compared with the basic graph coloring theory,and more than 80% improvement can be acquired in dense deployment scenario.Besides,the throughput of both cell edge macro user equipments（MUEs） and cell edge FUEs is guaranteed on the premise of low interference.     

A Scalable Peer-to-Peer Web Services Overlay for Semantic Discovery

The growing number of web services advocates distributed discovery infrastructures which are semantics-enabled. We introduce a novel approach for semantic discovery of web services in structured P2P-based （Peer-to-Peer） registries. We partition concepts into different CGs （Concept groups） and index these ordered concept sets in a two-phase semantic routing mechanism. Each node and query has one concept set as its unique ID. For each concept in the query, current node first route the query to a node with nodeID that shares a prefix as long as with the query, but a longer CG. Second, the query will be routed to a node sharing a longer prefix than that of the current node. Combining with semantic similarity calculation, our proposal guarantees that most existing services matching a query will be found with bounded costs in terms of number of nodes involved. The scalability and reliability of our approach are also confirmed through emulation tests.     

Modeling of a Photovoltaic Module Considering the Solar Energy Available from Horizontal Surfaces over Kuwait Area

The paper identifies and analyzes the geographical and temporal variability of solar energy in Kuwait. The fundamental solar trigonometric model has been modified to estimate daily and hourly solar radiation on horizontal surfaces on the basis of the more readily available meteorological data. The results demonstrate that Kuwait has an abundance of solar energy capability. An overview of the production and consumption of electrical energy, installed capacity, and peak loads in Kuwait is also presented. Finally, it is shown how the power produced from the photovoitaic （PV） cells depends on the solar radiation. The proposed PV module is made up of a combination of series and parallel cells to increase power, while the IoV characteristic and output power of the module each month may be obtained from the model.     

Novel Active Contour Model for Image Segmentation Based on Local Fuzzy Gaussian Distribution Fitting

A novel active contour model is proposed, which incorporates local information distributions in a fuzzy energy function to effectively deal with the intensity inhomogeneity. Moreover, the proposed model is convex with respect to the variable which is used for extracting the contour. This makes the model independent on the initial condition and suitable for an automatic segmentation. Furthermore, the energy function is minimized in a computationally efficient way by calculating the fuzzy energy alterations directly. Experiments are carried out to prove the performance of the proposed model over some existing methods. The obtained results confirm the efficiency of the method.     

PTCP Incast in Data Center Networks

In recent years, dual-homed topologies have appeared in data centers in order to offer higher aggregate bandwidth by using multiple paths simultaneously. Multipath TCP （MPTCP） has been proposed as a replacement for TCP in those topologies as it can efficiently offer improved throughput and better fairness. However, we have found that MPTCP has a problem in terms of incast collapse where the receiver suffers a drastic goodput drop when it simultaneously requests data over multiple servers. In this paper, we investigate why the goodput collapses even if MPTCP is able to actively relieve hot spots. In order to address the problem, we propose an equally-weighted congestion control algorithm for MPTCP, namely EW-MPTCP, without need for centralized control, additional infrastructure and a hardware upgrade. In our scheme, in addition to the coupled congestion control performed on each subflow of an MPTCP connection, we allow each subflow to perform an additional congestion control operation by weighting the congestion window in reverse proportion to the number of servers. The goal is to mitigate incast collapse by allowing multiple MPTCP subflows to compete fairly with a single-TCP flow at the shared bottleneck. The simulation results show that our solution mitigates the incast problem and noticeably improves goodput in data centers.     

A New Key Management Protocol to MANET

MANET （Mobile ad-hoc networks） are networks in which nodes are mobile and link connectivity might be changing all the time. The wireless and dis- tributed nature of MANET pose a great challenge to system security. Key management is an important and complex problem to the authentication and system security. The paper proposes a new method to the key management with high efficiency. Which,making use of the ideas of self-organization and local driven by intercross authenti-cation of CAs and threshold encryption. It＇s proved that the new method can reduce the communications delay and time delay in the key management process compared to other methods. So, it is a contribution to the field of key management in MANET.     

Action-Based Access Control Modelt

Access control is one of the powerful and generalized approaches for restricted resource access. The environmental state is introduced and the term “action” is defined based on roles, temporal states and environmental states. Actions can be used to capture security-relevant aspects of roles, environmental and temporal states in different information systems. Then, the action hierarchy, environmental hierarchy, temporal hierarchy and Action- based access control （ABAC） model are presented. ABAC is compared with the existing models and the result shows that the ABAC model can solve the problem of access control in information systems with mobile computation for its convenient and flexible designs. An application example of ABAC model is described at the end of the paper.     

New Method for Constructing Non-malleable Commitment Schemes

Non-malleable commitment represents a central research focuses in the international cryptographic community, with many important applications in e-commerce, e-government and in constructing other cryptographic protocols etc. Existing non-malleable commitments schemes suffer from computational and communication complexity and cannot prevent copying commitment attack. Based on discrete logarithm assumption and RSA assumption, this study proposed a new method for constructing non-malleable commitment schemes, which required that different committers make their commitment computation on the base of their own public parameters. Two efficient, non-malleable commitment protocols showed that this new method offers low computational and communication complexity and can prevent copying commitment attack.     

On the Design and Temporal Petri Net Verification of Grid Commerce Architecture

The emergence of Grid Computing settings lays a solid foundation for designing and constructing a next generation E-commerce environment. This work presents a new E-commerce architecture based on a Grid Computing environment, and models and analyzes the architecture using Temporal Petri nets （TPNs）. It can make sufficiently use of the Grid resources to implement various electronic bargains between the geographically dispersed users. By means of its TPN model, some main temporal properties are represented and verified formally.     

Joint Optimization of Subchannel Reassignment and Power Adaptation for Multicarrier Cooperative Systems

An amplify-and-forward multicarrier cooperative system was proposed in this paper. The optimal resource-allocation problem was investigated in terms of improving data rate. An effective resource-allocation algorithm was proposed based on three techniques, adaptive modulation, subchannel reassignment design and transmit power adaptation. The designed subchannel reassignment not only increases the average data rate, but also raises the threshold of ＂water-filling＂ in optimizing power allocation that can further increase data rate. Since the power allocation is based on the designed subchannel reassignment, the complexity of the proposed algorithm is reduced greatly. Simulation results show that the proposed algorithm effectively increases the system＇s average data rate.     

Home Energy Management System Using NILM and Low-Cost HAN

Home energy management systems(HEMs) are used to provide comfortable life for consumers as well as to save energy. An essential component of HEMs is a home area network(HAN) that is used to remotely control the electric devices at homes and buildings. Although HAN prices have dropped in recent years but they are still expensive enough to prohibit a mass scale deployments. In this paper, a very low cost alternative to the expensive HANs is presented. We have applied a combination of non-intrusive load monitoring(NILM) and very low cost one-way HAN to develop a HEM. By using NILM and machine learning algorithms we find the status of devices and their energy consumption from a central meter and communicate with devices through the one-way HAN. The evaluations show that the proposed machine learning algorithm for NILM achieves up to 99% accuracy in certain cases. On the other hand our radio frequency(RF)-based one-way HAN achieves a range of 80 feet in all settings.     

An Effective Gated Scheduling with Pre-defined QoS Cross-layer Design for Wireless Networks

The proposed M-gated scheduling algorithm rules the server in wireless networks stays with a station for at most M times gated services. By the method of embedded Markov chain and probability generating function we developed a model with vacations and acquired the theoretical value of average queue length and packet delay. Like E-limlted scheduling algorithm, its performance is close to that of the optimal polling scheme, exhaustive scheduling, but the inherent unfairness problem for the latter is avoided. And it also does not require the server to know the status of stations, queues information. Compared with E-limited, M-gated has less jitter and is more robust. We then use the derived quality of service parameter as the basis for cross-layer design. Simulations results show the network is more stable and can keep the queue length and the packets delay under QoS level. When putting E- limited and M-gated scheduling in the same cross-layer design scheme, the latter has less overhead especially when the system is heavily loaded.     

A Novel Surface Treatment Method for Improving the Antenna System Performance of Mobile Phones with Stainless Steel Frame

A novel surface treatment method of plat-ing Cu＋PPS film/coating on a mobile phone＇s stainless steel frame for improving the antenna system efficiencies is proposed. The mobile phone was measured in free space, in a silicon cover, and in the hand and cover si- multaneously. It＇s found that with this surface treat-ment, the total efficiency of the antenna system can be improved in all the four cases respectively by 14.22%, 1.38%, 15.19% and 1.72% at 940MHz （GSM900：880- 960MHz）, 2.59%, 3.21%, 4.81% and 1.43% at 1720MHz （DCS：1710-1880MHz） and 6.34%, 2.85%, 9.83% and 2.32% at 2100 MHz （WCDMA：1920-2170MHz）. This low- cost surface treatment method is an important break- through to improve antenna system performance of mobile phones especially for those with a stainless steel frame, and suitable for mass production.     

Spaceborne/Airborne Hybrid Bistatic SAR Frequency Domain Imaging Processing Algorithm

An imaging algorithm mainly processed in the frequency domain for the hybrid spaceborne/airborne BSAR is presented. The key point of deriving the algo- rithm is the analytical evaluation of the system transfer function＇s 2-D spectrum. To overcome the difficulty of resolving analytical solution for the stationary phase point, the spectrum＇s phase is approximated by two-order Taylor expanding around the point, which is in the neighborhood of the system＇s corresponding stationary phase point and can be obtained analytically. Thus the approximated analytical spectrum is pretty close to the actual one. In the imaging algorithm, both range-dependent range cell migration and azimuth-dependent range cell migration are compensated in two steps： Scaled inverse Fourier trans- form （SIFT）, which can be realized through the chirp z-transform, and phase multiplication. The validity of the algorithm is demonstrated by simulation with both the point target and area target.