Search

This paper investigates the operation of a smart distribution system comprised of multiple microgrids during emergency conditions. It proposes a two-stage hierarchical scheme for outage management in such a system to enhance the security of supply during contingencies. This goal is achieved through sharing the available generation and storage capacities among different microgrids. In doing so, a well-organized framework is devised in order to introduce the roles and tasks of each player in operation stage of a multi-microgrids system. Based on this framework, the general optimization model that needs to be evaluated at each stage of the proposed outage management scheme is formulated. In this regard, a model predictive control (MPC)-based approach is proposed to determine the optimal scheduling policy of microgrids in the first stage. In the second stage, distribution system operator (DSO) as an independent entity coordinates the operation of different microgrids and schedules their unused generation/storage capacities for minimizing load curtailments in the whole system. This method captures the inherent uncertainties of outage duration and significantly increases the resilience of resulting schedule against prediction errors of load and renewable resources. Various features of this scheme are studied through implementation on a test system. The results verify the effectiveness of the proposed scheme in enhancing the reliability of distribution systems and demonstrate the benefits it will bring to both customers and DSOs. Copyright © 2016 John Wiley & Sons, Ltd. [ABSTRACT FROM AUTHOR]

The network-based mobility management is adapted to the OpenFlow architecture for mobility service at Software Defined Networking (SDN), and data structure for mobility service is proposed. SDN is a newly proposed Internet architecture which decouples the data and control planes, and mobility management is one of the most important issues in SDN. In order to provide mobility management service by utilizing the mobility scheme proposed earlier in a new network environment, the existing mobility schemes need to be modified. Particularly, the characters of the network environment need to be considered when designing the function of the network entities and data structure. Our proposed mobility management scheme is focused on the centralized control mechanism of SDN. We referred to Proxy Mobile IPv6 (PMIPv6) and OpenFlow-based PMIPv6 with a centralized mobility management controller (OPMIPv6-C). It has a merged data structure for the mobility service on SDN controller and minimizes the number of switches which need flow table modification at handover. At the performance analysis chapter, we compare the signaling cost at the registration and handover phase, packet delivery cost, and handover latency between the proposed scheme and OPMIPv6-C. [ABSTRACT FROM AUTHOR]

Guidance with traditional trajectory correction scheme usually starts from the trajectory apex time to reduce drag penalties early in flight; however, this method cannot get the max trajectory correction capability of canards according to our analysis. This paper presents an optimized trajectory correction scheme by taking different control phases of canards in ballistic ascending segment and ballistic descending segment. Simulation indicates that the optimized trajectory correction can improve the trajectory correction capability greatly. The result of an example trajectory and Monte Carlo simulations with the predictive guidance law and the trajectory tracking guidance law testifies the effectiveness of the optimized trajectory correction scheme. [ABSTRACT FROM AUTHOR]

The first-order Lax-Friedrichs (LF) scheme is commonly used in conjunction with other schemes to achieve monotone and stable properties with lower numerical diffusion. Nevertheless, the LF scheme and the schemes devised based on it, for example, the first-order centered (FORCE) and the slope-limited centered (SLIC) schemes, cannot achieve a time-step-independence solution due to the excessive numerical diffusion at a small time step. In this work, two time-step-convergence improved schemes, the C-FORCE and C-SLIC schemes, are proposed to resolve this problem. The performance of the proposed schemes is validated in solving the one-layer and two-layer shallow-water equations, verifying their capabilities in attaining time-step-independence solutions and showing robustness of them in resolving discontinuities with high-resolution. [ABSTRACT FROM AUTHOR]

A novel control scheme is proposed to improve the yaw stability of a tractor semitrailer vehicle in critical situations. The control scheme is a two-layer structure consisting of an upper yaw moment controller and a lower brake force distributor. The tractor and the trailer are, respectively, stabilized by two independent fuzzy logic based yaw moment controllers. The controllers for the tractor and the trailer are, respectively, designed to track the reference yaw rate of the tractor and the hitch angle between the tractor and the trailer while considering the variation of the hitch angular rate at the same time. The corrective yaw moments determined by the corresponding upper fuzzy yaw moment controllers are realized by active wheel braking. The performance of the proposed control scheme is evaluated by simulations on a nonlinear vehicle model. The results demonstrate that the proposed control scheme is robust and effective in stabilizing the severe instabilities such as jackknife and trailer oscillation in the chosen simulation scenarios. It is believed that this control scheme is robust to the variation of road adhesion conditions. [ABSTRACT FROM AUTHOR]

Since the censored characteristics are unmonitored effectively in the manufacturing process, the produced product tends to have an unexpected high infant failure rate. Thus, this paper analyzes the associated relationship between product reliability and censored quality characteristics in manufacturing process firstly, and the dynamic and universal control demands for censored characteristics are presented. In view that traditional CEV-based control charts are usually confined to some specific types when dealing with censored characteristics, which greatly restrict the wide application of censored control charts in the high-quality manufacturing process, the convergent CEV technique based on the principle of asymptotic reduction is proposed to be better applied in the analysis of censored characteristics. And novel design procedures and simple but practical performance indicator in the form of the most dangerous alarm distance for censored characteristics of Weibull distribution are put forward. Finally, the validity of the proposed method is verified by a case study of monitoring a censored characteristic relative to lifetime of some aeronautical bearings, and the result proves that the sensitivity of the proposed control chart increased 79.96% compared to traditional CEV chart and is proved to be applicable to monitoring mixed censored characteristics affecting product reliability in manufacturing process. [ABSTRACT FROM AUTHOR]

Because the static cloud platform cannot satisfy the diversity of mobile Internet service and inefficient data mining problems, we presented a reliable and efficient data mining cloud platform construction scheme based on the mobile Internet service opportunistic driving and application perception. In this scheme, first of all data selection mechanism was established based on mobile Internet service opportunistic drive. Secondly, through the cloud platform different cloud and channel aware, nonlinear mapping from the service to a data set of proposed perceptual model is applied. Finally, on the basis of the driving characteristics and extraction of perceptual features, the cloud platform would be constructed through the service opportunities of mobile Internet applications, which could provide robust and efficient data mining services. The experimental results show that the proposed mechanism, compared to the cloud platform based on distributed data mining, has obvious advantages in system running time, memory usage, and data clustering required time, as well as average clustering quality. [ABSTRACT FROM AUTHOR]

It is well known that the Internet application of cloud services may be affected by the inefficiency of cloud computing and inaccurate evaluation of quality of experience (QoE) seriously. In our paper, based on construction algorithms of cooperative cognitive cloud platform and optimization algorithm of opportunities weight particle swarm clustering, the QoE guarantee mechanism was proposed. The mechanism, through the sending users of requests and the cognitive neighbor users’ cooperation, combined the cooperation of subcloud platforms and constructed the optimal cloud platform with the different service. At the same time, the particle swarm optimization algorithm could be enhanced dynamically according to all kinds of opportunity request weight, which could optimize the cooperative cognitive cloud platform. Finally, the QoE guarantee scheme was proposed with the opportunity weight particle swarm optimization algorithm and collaborative cognitive cloud platform. The experimental results show that the proposed mechanism compared is superior to the QoE guarantee scheme based on cooperative cloud and QoE guarantee scheme based on particle swarm optimization, compared with optimization fitness and high cloud computing service execution efficiency and high throughput performance advantages. [ABSTRACT FROM AUTHOR]

With the popularity of IEEE 802.11 based wireless fidelity (Wi-Fi) portable devices, it becomes increasingly significant to support the mobile users carrying Wi-Fi devices to access the Internet of Things (IoT) so that the communications between the mobile users and the smart objects deployed in the IoT stay uninterrupted when the mobile users are in movement. A scheme using Extended Service Set- (ESS-) based architecture is presented to implement the proxy mobile IPv6 protocol, that is, PMIPv6, for IEEE 802.11 infrastructure Wireless Local Area Networks (WLANs). The key signaling packets together with their time sequences for the mobility management in the proposed scheme are proposed. Moreover, the handoff delay in the proposed scheme is derived, through which the performance of the proposed scheme is analyzed. Numerical analysis indicates that the proposed scheme considerably outperforms the existing scheme that uses the Basic Service Set (BSS) based architecture in terms of handoff delay in the case when the delay between Mobile Access Gateway (MAG) and local mobile anchor (LMA) is relatively large. [ABSTRACT FROM AUTHOR]

In-network data aggregation is a widely used method for collecting data efficiently in wireless sensor networks (WSNs). The authors focus on how to achieve high aggregation efficiency and prolonging networks’ lifetime. Firstly, this paper proposes an adaptive spanning tree algorithm (AST), which can adaptively build and adjust an aggregation spanning tree. Owing to the strategies of random waiting and alternative father nodes, AST can achieve a relatively balanced spanning tree and flexible tree adjustment. Then a redundant aggregation scheme (RAG) is illustrated. In RAG, interior nodes help to forward data for their sibling nodes and thus provide reliable data transmission for WSN. Finally, the simulations demonstrate that (1) AST can prolong the lifetime and (2) RAG makes a better trade-off between storage and aggregation ratio, comparing to other aggregation schemes. [ABSTRACT FROM AUTHOR]

Video transmission is a real challenge for wireless multihop networks with high packet loss rate. This paper proposes a cross layer video transmission scheme which combines the geographic routing in network layer and the short-length Luby transform (LT) codes in transport layer. We first analyze the effect of bit error rate (BER) on the retransmission load and the effect of payload length and LT symbols size on network efficiency. Then, based on the product of the link quality and the distance from destination, we design a routing metric for geographic routing. We further propose a cross layer transmission scheme, which adaptively adjusts payload length to encapsulate short-length LT encoded symbols and selects routes based on the new routing metric. The simulation results show that our cross layer scheme can decrease the decoding overhead and the packet loss rate, while improving the video transmission quality and the network efficiency. [ABSTRACT FROM AUTHOR]

This paper presents a solution to satisfy the increasing requirements for secure medical image transmission and storage over public networks. The proposed scheme can simultaneously encrypt and compress the medical image using compressive sensing (CS) and pixel swapping based permutation approach. In the CS phase, the plain image is compressed and encrypted by chaos-based Bernoulli measurement matrix, which is generated under the control of the introduced Chebyshev map. The quantized measurements are then encrypted by permutation-diffusion type chaotic cipher for the second level protection. Simulations and extensive security analyses have been performed. The results demonstrate that at a large scale of compression ratio the proposed cryptosystem can provide satisfactory security level and reconstruction quality. [ABSTRACT FROM AUTHOR]

Plenty of hazards underlie complex systems, which have negative effects on the normal functionality of engineering events. To minimize the uncertainty, a comprehensive preevent checkout is necessarily required to judge if the engineering events will be carried out successfully under current circumstance, through which further improvements can be made. A generic belief rule-based safety evaluation approach for large-scale complex systems is proposed. The overall system is firstly decomposed and filtered into the measurable attributes that may potentially contribute to uncertainty. Belief structure is then applied to measure the uncertainty of vagueness and incompleteness and represent heterologous information in a unified scheme. With this scheme, a rule base is established with all antecedents, consequents, and attributes presented in belief degrees, which is used to determine the relationship between attributes, aggregate the influences, and generate the final inference with evidential reasoning algorithm. In the end, an estimation of uncertainty is achieved in the representation of distribution. It describes how the systems perform with given conditions and sources. A numeric case in aerospace program is provided for feasibility illustration. [ABSTRACT FROM AUTHOR]

The keypoint detection and its description are two critical aspects of local keypoints matching which is vital in some computer vision and pattern recognition applications. This paper presents a new scale-invariant and rotation-invariant detector and descriptor, coined, respectively, DDoG and FBRK. At first the Hilbert curve scanning is applied to converting a two-dimensional (2D) digital image into a one-dimensional (1D) gray-level sequence. Then, based on the 1D image sequence, an approximation of DoG detector using second-order difference-of-Gaussian function is proposed. Finally, a new fast binary ratio-based keypoint descriptor is proposed. That is achieved by using the ratio-relationships of the keypoint pixel value with other pixel of values around the keypoint in scale space. Experimental results show that the proposed methods can be computed much faster and approximate or even outperform the existing methods with respect to performance. [ABSTRACT FROM AUTHOR]

A joint encryption and reversible data hiding (joint encryption-RDH) scheme is proposed in this paper. The cover image is transformed to the frequency domain with integer discrete wavelet transform (integer DWT) for the encryption and data hiding. Additional data is hidden into the permuted middle (LH, HL) and high (HH) frequency subbands of integer DWT coefficients with a histogram modification based method. A combination of permutations both in the frequency domain and in the spatial domain is imposed for the encryption. In the receiving end, the encrypted image with hidden data can be decrypted to the image with hidden data, which is similar to the original image without hidden data, by only using the encryption key; if someone has both the data hiding key and the encryption key, he can both extract the hidden data and reversibly recover the original image. Experimental results demonstrate that, compared with existing joint encryption-RDH schemes, the proposed scheme has gained larger embedding capacity, and the distribution of the encrypted image with data hidden has a random like behavior. It can also achieve the lossless restoration of the cover image. [ABSTRACT FROM AUTHOR]

The root extraction problem over quaternion rings modulo an RSA integer is defined, and the intractability of the problem is examined. A signature scheme is constructed based on the root extraction problem. It is proven that an adversary can forge a signature on a message if and only if he can extract the roots for some quaternion integers. The performance and other security related issues are also discussed. [ABSTRACT FROM AUTHOR]

With apparent advantages of the severalGHz license-free spectrums, 10Wmaximumtransmit power, and so forth, 60GHz wireless communication technology has become the first choice for Gbps level short-range wireless communications. This paper researches 60GHz wireless communications over the additive white Gaussian noise channel. Channel capacity with quadrature amplitude modulation (QAM) is investigated for the unlicensed 59-64GHz radio spectrum set aside by FCC. Moreover, the capacity with QAM is compared to that with phase shift keying (PSK). It is shown that QAM is capable of providing Gbps data rate and outperforms PSK especially when the modulation order is large. The results prove that QAM is an attractive scheme for 60GHz wireless communications. [ABSTRACT FROM AUTHOR]

Nowadays, internet is becoming a suitable way of accessing the databases. Such data are exposed to various types of attack with the aim to confuse the ownership proofing or the content protection. In this paper, we propose a new approach based on fragile zero watermarking for the authentication of numeric relational data. Contrary to some previous databases watermarking techniques which cause some distortions in the original database and may not preserve the data usability constraints, our approach simply seeks to generate the watermark from the original database. First, the adopted method partitions the database relation into independent square matrix groups. Then, group-based watermarks are securely generated and registered in a trusted third party. The integrity verification is performed by computing the determinant and the diagonal's minor for each group. As a result, tampering can be localized up to attribute group level. Theoretical and experimental results demonstrate that the proposed technique is resilient against tuples insertion, tuples deletion, and attributes values modification attacks. Furthermore, comparison with recent related effort shows that our scheme performs better in detecting multifaceted attacks. [ABSTRACT FROM AUTHOR]

As intelligent ubiquitous devices become more popular, security threats targeting them are increasing; security is seen as one of the major challenges of the ubiquitous computing. Nowa days, applying ubiquitous computing in number of fields for human safety and convenience was immensely increased in recent years. The popularity of the technology is rising day by day, and hence the security is becoming the main focused point with the advent and rising popularity of the applications. In particular, the number of wireless networks based on ubiquitous devices has increased rapidly; these devices support transmission for many types of data traffic. The convenient portability of ubiquitous devices makes them vulnerable to security threats, such as loss, theft, data modification, and wiretapping. Developers and users should seriously consider employing data encryption to protect data from such vulnerabilities. In this paper, we propose a Rhythm Key based Encryption scheme for ubiquitous devices (Ubi-RKE). The concept of Rhythm Key based Encryption has been applied to numerous real world applications in different domains. It provides key memorability and secure encryption through user touching rhythm on ubiquitous devices. Our proposed scheme is more efficient for users than existing schemes, by providing a strong cipher. [ABSTRACT FROM AUTHOR]

One of the key steps in the iris recognition system is the accurate iris segmentation from its surrounding noises including pupil, sclera, eyelashes, and eyebrows of a captured eye-image. This paper presents a novel iris segmentation scheme which utilizes the orientation matching transform to outline the outer and inner iris boundaries initially. It then employs Delogne-Kåsa circle fitting (instead of the traditional Hough transform) to further eliminate the outlier points to extract a more precise iris area from an eyeimage. In the extracted iris region, the proposed scheme further utilizes the differences in the intensity and positional characteristics of the iris, eyelid, and eyelashes to detect and delete these noises. The scheme is then applied on iris image database, UBIRIS.v1. The experimental results show that the presented scheme provides a more effective and efficient iris segmentation than other conventional methods. [ABSTRACT FROM AUTHOR]

WSN (wireless sensor network) is a perfect tool of temperature monitoring in coal goaf. Based on the three-zone theory of goaf, the GtmWSN model is proposed, and its dynamic features are analyzed. Accordingly, a data transmission scheme, named DTDGD, is worked out. Firstly, sink nodes conduct dynamic grid division on the GtmWSN according to virtual semicircle. Secondly, each node will confirm to which grid it belongs based on grid number. Finally, data will be delivered to sink nodes with greedy forward and hole avoidance. Simulation results and field data showed that the GtmWSN and DTDGD satisfied the lifetime need of goaf temperature monitoring. [ABSTRACT FROM AUTHOR]

This paper demonstrates the implementation of a model-based vehicle estimator, which can be used for lateral tire force estimation without using any highly nonlinear tire-road friction models. The lateral tire force estimation scheme has been designed, and it consists of the following three steps: the yaw moment estimation based on a disturbance observer, the sum of the lateral tire force of two front tires and two rear tires estimation based on a least-square method, and individual lateral tire force estimation based on a heuristic method. The proposed estimator is evaluated under two typical driving conditions and the estimation values are compared with simulator data fromCarSimand experimental data provided by GM. Results to date indicate that this is an effective approach, which is considered to be of potential benefit to the automotive industry. [ABSTRACT FROM AUTHOR]

In wireless sensor networks, a geographical positioning scheme is one of core technologies for sensor applications such as disaster monitoring, environment monitoring, and military services. For this reason, the research for range-free positioning schemes had progressing actively. And a density probability scheme based on the central limit theorem and normal distribution theory has been proposed to improve the location accuracy in nonuniform sensor network environments. The density probability scheme estimates 1-hop distance by using communication between nodes. After that, it estimates the final position of an unknown node. But the density probability scheme has a problem thatit has equivalent 1-hop distance for all of nodes in the same area. To overcome this problem, we propose a novel sensor positioning scheme in non-uniform wireless sensor networks. As a result, the proposed scheme ensures the high accuracy of sensor positioning in non-uniform networks. To show the superiority of our proposed scheme, we compare it with the existing scheme such as DV-based position scheme. Our experimental results show that the proposed scheme improves by about 36% sensor positioning accuracy over the existing scheme on average even in non-uniform wireless sensor networks. [ABSTRACT FROM AUTHOR]

This paper presents a design and analyzes the performance of an actuator operation scheduler for wireless sensor and actuator networks, aiming at efficiently managing power consumption and distributing peak load in smart grid buildings. To create a schedule within an acceptable response time, a genetic algorithm is designed, and the scheduler places the operations of activated tasks to appropriate time slots in the allocation table. For genetic operations, each schedule is encoded to an integer-valued vector, where each element represents either start time or binary allocation map of the associated task according to the task type. The fitness function evaluates the schedule quality by estimating the load of the peaking slot. Out-task model defines P-Penalty and N-Penalty to account for the extrapower load brought by the delayed start of task operation. The performance measurement results obtained from a prototype implementation reveal that our genetic scheduler reduces the peak load by up to 35.2% for the given parameter set compared with the Earliest scheduling scheme, intelligently compromising two conflicting requirements of even load distribution and small initiation delay. [ABSTRACT FROM AUTHOR]

This paper studies the achievable data rate of the two-transmitter and two-receiver interference channel model with cooperative transmission. To implement the cooperation, a finite rate conferencing link is deployed at the transmitters side in order to share the message. A new transmit scheme with private message sharing is proposed based on the dirty paper coding. The achievable rate region is established in both strong interference regime and weak interference regime. In weak interference regime, the asymptotically rate region shows the conferencing link can improve the achievable rate region for cooperative receiver. In strong interference regime, the conferencing link not only improves the achievable rate for cooperative receiver but also improves the sum rate of the cooperative network. Numerical results demonstrate these theories in a Gaussian interference channel. [ABSTRACT FROM AUTHOR]

Message delivery in a mobile social network (MSN) is difficult due to the fact that the topology of such network is sparse and unstable. Various routing schemes for MSNs were proposed to make the message delivery robust and efficient. However, little research has been conducted to explore how much delay has to be tolerated for the message delivery from the source to the destination. Since the social relationships among nodes are stable during a certain period of time, it is expected that the delay of message delivery in MSNs could be modeled with a probability model. In this paper, we take the first step to address this issue. We firstly extract three routing models from the existing routing schemes for MSNs and then develop the probability models of the message transmission delay for each abstract routing model. The simulation results show that the theoretical models match very well the simulation trace statistics. [ABSTRACT FROM AUTHOR]

Due to the advancement of network technology, video-on-demand (VoD) services are growing in popularity. However, individual stream allocation for client requests easily causes a VoD system overload; when its network and disk bandwidth cannot match client growth. This study thus presents a fundamentally different approach by focusing solely on a class of applications identified as latency tolerant applications. Because video broadcasting does not provide interactive (i.e., VCR) functions, a client is able to tolerate playback latency froma video server. One efficient broadcasting method is periodic broadcasting, which divides a video into smaller segments and broadcasts these segments periodically on multiple channels. However, numerous practical systems, such as digital video broadcasting-handheld (DVB-H), do not allow clients to download video data frommultiple channels because clients usually only have one tuner. To resolve this problem in multiple-channel broadcasting, this study proposes a novel single-channel broadcasting scheme, which leverages segment-broadcasting capability further for more efficient video delivery. The comparison results show that, with the same settings of broadcasting bandwidth, the proposed scheme outperforms the alternative broadcasting scheme, the hopping insertion scheme, SingBroad, PAS, and the reverse-order scheduling scheme for the maximal waiting time. [ABSTRACT FROM AUTHOR]

We propose a fast and stable numerical method to evaluate two-dimensional partial differential equation (PDE) for pricing arithmetic average Asian options. The numerical method is deduced by combining an alternating-direction technique and the central difference scheme on a piecewise uniform mesh. The numerical scheme is stable in the maximum norm, which is true for arbitrary volatility and arbitrary interest rate. It is proved that the scheme is second-order convergent with respect to the asset price. Numerical results support the theoretical results. [ABSTRACT FROM AUTHOR]

Vision-aided inertial navigation is an important and practical mode of integrated navigation for aerial vehicles. In this paper, a novel fusion scheme is proposed and developed by using the information from inertial navigation system (INS) and vision matching subsystem. This scheme is different from the conventional Kalman filter (CKF); CKF treats these two information sources equally even though vision-aided navigation is linked to uncertainty and inaccuracy. Eventually, by concentrating on reliability of vision matching, the fusion scheme of integrated navigation is upgraded. Not only matching positions are used, but also their reliable extents are considered. Moreover, a fusion algorithmis designed and proved to be the optimal as it minimizes the variance in terms of mean square error estimation. Simulations are carried out to validate the effectiveness of this novel navigation fusion scheme. Results show the new fusion scheme outperforms CKF and adaptive Kalman filter (AKF) in vision/INS estimation under given scenarios and specifications. [ABSTRACT FROM AUTHOR]

As the photovoltaic system consists of many equipment components, manual inspection will be very costly. This study proposes the photovoltaic system fault diagnosis based on chaotic signal synchronization. First, MATLAB was used to simulate the fault conditions of solar system, and the maximum power point tracking (MPPT) was used to ensure the system's stable power and capture and record the system fault feature signals. The dynamic errors of various fault signals were extracted by chaotic signal synchronization, and the dynamic error data of various fault signals were recorded completely. In the photovoltaic system, the captured output voltage signal was used as the characteristic values for fault recognition, and the extension theory was used to create the joint domain and classical domain of various fault conditions according to the collected feature data. Thematter-elementmodel of extension engineering was constructed. Finally, the whole fault diagnosis system is only needed to capture the voltage signal of the solar photovoltaic system, so as to know the exact fault condition effectively and rapidly. The proposed fault diagnostor can be implemented by embedded system and be combined with ZigBee wireless network module in the future, thus reducing labor cost and building a complete portable renewable energy system fault diagnostor. [ABSTRACT FROM AUTHOR]

There is an acceleration of adoption of cloud computing among enterprises. However, moving the infrastructure and sensitive data fromtrusted domain of the data owner to public cloudwill pose severe security and privacy risks. Attribute-based encryption (ABE) is a newcryptographic primitivewhich provides a promising tool for addressing the problem of secure and fine-grained data sharing and decentralized access control. Key-policy attribute-based encryption (KP-ABE) is an important type of ABE, which enables senders to encrypt messages under a set of attributes and private keys are associated with access structures that specify which ciphertexts the key holder will be allowed to decrypt. In most existing KP-ABE scheme, the ciphertext size grows linearly with the number of attributes embedded in ciphertext. In this paper, we propose a new KP-ABE construction with constant ciphertext size. In our construction, the access policy can be expressed as any monotone access structure. Meanwhile, the ciphertext size is independent of the number of ciphertext attributes, and the number of bilinear pairing evaluations is reduced to a constant. We prove that our scheme is semantically secure in the selective-set model based on the general Diffie-Hellman exponent assumption. [ABSTRACT FROM AUTHOR]

In these days there are plenty of signature schemes such as the (t, n) threshold proxy signature scheme (Kumar and Verma 2010). Thenetwork is a shared medium so that the weakness security attacks such as eavesdropping, replay attack, and modification attack. Thus, we have to establish a common key for encrypting/decrypting our communications over an insecure network. In this scheme, a (t, n) threshold proxy signature scheme based on RSA, any t or more proxy signers can cooperatively generate a proxy signature while t - 1 or fewer of them cannot do it. The threshold proxy signature scheme uses the RSA cryptosystem to generate the private and the public key of the signers (Rivest et al., 1978). Comparison is done on the basis of time complexity, space complexity, and communication overhead. We compare the performance of four schemes (Hwang et al. (2003), Kuo and Chen (2005), Yong-Jun et al. (2007), and Li et al. (2007), with the performance of a scheme that has been proposed earlier by the authors of this paper. In the proposed scheme, both the combiner and the secret share holder can verify the correctness of the information that they are receiving from each other. Therefore, the enhanced threshold proxy signature scheme is secure and efficient against notorious conspiracy attacks. [ABSTRACT FROM AUTHOR]

This paper presents a coordination scheme for a single period newsvendor problem when both supplier and retailer of the supply chain agree to change the business operation from a market decision power sharing system (Model 1) to a unique decision maker system (Model 2). The supplier is assumed to be a risk-averse decision maker and he will undertake the product quality risk in both models. Model 1 is game theoretic, where the supplier controls the wholesale price, but the retailer controls the order quantity and market price. The bargaining process ends when the supplier has found a wholesale price that maximizes the value of his sales revenue minus the product quality cost. Model 2 is a centralized system where the supplier possesses all decision powers of the market. In general, Model 2 will generate higher total revenue than Model 1. The aim of this research is to propose a satisfying compromise based on consignment policy to resolve the revenue-sharing conflict in Model 2 due to the additional revenue. An example is provided to illustrate the two models and the proposed coordination scheme, along with managerial insights on the models' benefits. The impacts of several parameters on the scheme are also presented and discussed. [ABSTRACT FROM AUTHOR]

The stabilization problem is investigated in this paper for a class of nonlinear systems with disturbances. The disturbances are supposed to be classified into two types. One type in the input channel is generated by an exogenous system, which can represent the constant or harmonic signals with unknown phase and magnitude. The other type is stochastic disturbance. Two kinds of nonlinear dynamics in the plants are considered, respectively, which correspond to the known and unknown functions. By integrating the disturbance observers with conventional control method, the first type of disturbances can be estimated and rejected. Simultaneously, the desired dynamic performances can be guaranteed. An example is given to show the effectiveness of the proposed scheme. [ABSTRACT FROM AUTHOR]

Expensive computational cost is a severe limitation in CT reconstruction for clinical applications that need real-time feedback. A primary example is bolus-chasing computed tomography (CT) angiography (BCA) that we have been developing for the past several years. To accelerate the reconstruction process using the filtered backprojection (FBP) method, specialized hardware or graphics cards can be used. However, specialized hardware is expensive and not flexible. The graphics processing unit (GPU) in a current graphic card can only reconstruct images in a reduced precision and is not easy to program. In this paper, an acceleration scheme is proposed based on a multi-core PC. In the proposed scheme, several techniques are integrated, including utilization of geometric symmetry, optimization of data structures, single-instruction multiple-data (SIMD) processing, multithreaded computation, and an Intel C++ compilier. Our scheme maintains the original precision and involves no data exchange between the GPU and CPU. Themerits of our scheme are demonstrated in numerical experiments against the traditional implementation. Our scheme achieves a speedup of about 40, which can be further improved by several folds using the latest quad-core processors. [ABSTRACT FROM AUTHOR]