Science.gov

Sample records for allocation scheme based

  1. Rate Distortion Analysis and Bit Allocation Scheme for Wavelet Lifting-Based Multiview Image Coding

    NASA Astrophysics Data System (ADS)

    Lasang, Pongsak; Kumwilaisak, Wuttipong

    2009-12-01

    This paper studies the distortion and the model-based bit allocation scheme of wavelet lifting-based multiview image coding. Redundancies among image views are removed by disparity-compensated wavelet lifting (DCWL). The distortion prediction of the low-pass and high-pass subbands of each image view from the DCWL process is analyzed. The derived distortion is used with different rate distortion models in the bit allocation of multiview images. Rate distortion models including power model, exponential model, and the proposed combining the power and exponential models are studied. The proposed rate distortion model exploits the accuracy of both power and exponential models in a wide range of target bit rates. Then, low-pass and high-pass subbands are compressed by SPIHT (Set Partitioning in Hierarchical Trees) with a bit allocation solution. We verify the derived distortion and the bit allocation with several sets of multiview images. The results show that the bit allocation solution based on the derived distortion and our bit allocation scheme provide closer results to those of the exhaustive search method in both allocated bits and peak-signal-to-noise ratio (PSNR). It also outperforms the uniform bit allocation and uniform bit allocation with normalized energy in the order of 1.7-2 and 0.3-1.4 dB, respectively.

  2. Hybrid Resource Allocation Scheme with Proportional Fairness in OFDMA-Based Cognitive Radio Systems

    NASA Astrophysics Data System (ADS)

    Li, Li; Xu, Changqing; Fan, Pingzhi; He, Jian

    In this paper, the resource allocation problem for proportional fairness in hybrid Cognitive Radio (CR) systems is studied. In OFDMA-based CR systems, traditional resource allocation algorithms can not guarantee proportional rates among CR users (CRU) in each OFDM symbol because the number of available subchannels might be smaller than that of CRUs in some OFDM symbols. To deal with this time-varying nature of available spectrum resource, a hybrid CR scheme in which CRUs are allowed to use subchannels in both spectrum holes and primary users (PU) bands is adopted and a resource allocation algorithm is proposed to guarantee proportional rates among CRUs with no undue interference to PUs.

  3. Network coding based joint signaling and dynamic bandwidth allocation scheme for inter optical network unit communication in passive optical networks

    NASA Astrophysics Data System (ADS)

    Wei, Pei; Gu, Rentao; Ji, Yuefeng

    2014-06-01

    As an innovative and promising technology, network coding has been introduced to passive optical networks (PON) in recent years to support inter optical network unit (ONU) communication, yet the signaling process and dynamic bandwidth allocation (DBA) in PON with network coding (NC-PON) still need further study. Thus, we propose a joint signaling and DBA scheme for efficiently supporting differentiated services of inter ONU communication in NC-PON. In the proposed joint scheme, the signaling process lays the foundation to fulfill network coding in PON, and it can not only avoid the potential threat to downstream security in previous schemes but also be suitable for the proposed hybrid dynamic bandwidth allocation (HDBA) scheme. In HDBA, a DBA cycle is divided into two sub-cycles for applying different coding, scheduling and bandwidth allocation strategies to differentiated classes of services. Besides, as network traffic load varies, the entire upstream transmission window for all REPORT messages slides accordingly, leaving the transmission time of one or two sub-cycles to overlap with the bandwidth allocation calculation time at the optical line terminal (the OLT), so that the upstream idle time can be efficiently eliminated. Performance evaluation results validate that compared with the existing two DBA algorithms deployed in NC-PON, HDBA demonstrates the best quality of service (QoS) support in terms of delay for all classes of services, especially guarantees the end-to-end delay bound of high class services. Specifically, HDBA can eliminate queuing delay and scheduling delay of high class services, reduce those of lower class services by at least 20%, and reduce the average end-to-end delay of all services over 50%. Moreover, HDBA also achieves the maximum delay fairness between coded and uncoded lower class services, and medium delay fairness for high class services.

  4. A Subcarrier-Pair Based Resource Allocation Scheme Using Proportional Fairness for Cooperative OFDM-Based Cognitive Radio Networks

    PubMed Central

    Ma, Yongtao; Zhou, Liuji; Liu, Kaihua

    2013-01-01

    The paper presents a joint subcarrier-pair based resource allocation algorithm in order to improve the efficiency and fairness of cooperative multiuser orthogonal frequency division multiplexing (MU-OFDM) cognitive radio (CR) systems. A communication model where one source node communicates with one destination node assisted by one half-duplex decode-and-forward (DF) relay is considered in the paper. An interference-limited environment is considered, with the constraint of transmitted sum-power over all channels and aggregate average interference towards multiple primary users (PUs). The proposed resource allocation algorithm is capable of maximizing both the system transmission efficiency and fairness among secondary users (SUs). Besides, the proposed algorithm can also keep the interference introduced to the PU bands below a threshold. A proportional fairness constraint is used to assure that each SU can achieve a required data rate, with quality of service guarantees. Moreover, we extend the analysis to the scenario where each cooperative SU has no channel state information (CSI) about non-adjacent links. We analyzed the throughput and fairness tradeoff in CR system. A detailed analysis of the performance of the proposed algorithm is presented with the simulation results. PMID:23939586

  5. Suboptimal greedy power allocation schemes for discrete bit loading.

    PubMed

    Al-Hanafy, Waleed; Weiss, Stephan

    2013-01-01

    We consider low cost discrete bit loading based on greedy power allocation (GPA) under the constraints of total transmit power budget, target BER, and maximum permissible QAM modulation order. Compared to the standard GPA, which is optimal in terms of maximising the data throughput, three suboptimal schemes are proposed, which perform GPA on subsets of subchannels only. These subsets are created by considering the minimum SNR boundaries of QAM levels for a given target BER. We demonstrate how these schemes can significantly reduce the computational complexity required for power allocation, particularly in the case of a large number of subchannels. Two of the proposed algorithms can achieve near optimal performance including a transfer of residual power between subsets at the expense of a very small extra cost. By simulations, we show that the two near optimal schemes, while greatly reducing complexity, perform best in two separate and distinct SNR regions.

  6. Suboptimal Greedy Power Allocation Schemes for Discrete Bit Loading

    PubMed Central

    2013-01-01

    We consider low cost discrete bit loading based on greedy power allocation (GPA) under the constraints of total transmit power budget, target BER, and maximum permissible QAM modulation order. Compared to the standard GPA, which is optimal in terms of maximising the data throughput, three suboptimal schemes are proposed, which perform GPA on subsets of subchannels only. These subsets are created by considering the minimum SNR boundaries of QAM levels for a given target BER. We demonstrate how these schemes can significantly reduce the computational complexity required for power allocation, particularly in the case of a large number of subchannels. Two of the proposed algorithms can achieve near optimal performance including a transfer of residual power between subsets at the expense of a very small extra cost. By simulations, we show that the two near optimal schemes, while greatly reducing complexity, perform best in two separate and distinct SNR regions. PMID:24501578

  7. Optimizing congestion and emissions via tradable credit charge and reward scheme without initial credit allocations

    NASA Astrophysics Data System (ADS)

    Zhu, Wenlong; Ma, Shoufeng; Tian, Junfang

    2017-01-01

    This paper investigates the revenue-neutral tradable credit charge and reward scheme without initial credit allocations that can reassign network traffic flow patterns to optimize congestion and emissions. First, we prove the existence of the proposed schemes and further decentralize the minimum emission flow pattern to user equilibrium. Moreover, we design the solving method of the proposed credit scheme for minimum emission problem. Second, we investigate the revenue-neutral tradable credit charge and reward scheme without initial credit allocations for bi-objectives to obtain the Pareto system optimum flow patterns of congestion and emissions; and present the corresponding solutions are located in the polyhedron constituted by some inequalities and equalities system. Last, numerical example based on a simple traffic network is adopted to obtain the proposed credit schemes and verify they are revenue-neutral.

  8. Superframe Duration Allocation Schemes to Improve the Throughput of Cluster-Tree Wireless Sensor Networks

    PubMed Central

    Leão, Erico; Montez, Carlos; Moraes, Ricardo; Portugal, Paulo; Vasques, Francisco

    2017-01-01

    The use of Wireless Sensor Network (WSN) technologies is an attractive option to support wide-scale monitoring applications, such as the ones that can be found in precision agriculture, environmental monitoring and industrial automation. The IEEE 802.15.4/ZigBee cluster-tree topology is a suitable topology to build wide-scale WSNs. Despite some of its known advantages, including timing synchronisation and duty-cycle operation, cluster-tree networks may suffer from severe network congestion problems due to the convergecast pattern of its communication traffic. Therefore, the careful adjustment of transmission opportunities (superframe durations) allocated to the cluster-heads is an important research issue. This paper proposes a set of proportional Superframe Duration Allocation (SDA) schemes, based on well-defined protocol and timing models, and on the message load imposed by child nodes (Load-SDA scheme), or by number of descendant nodes (Nodes-SDA scheme) of each cluster-head. The underlying reasoning is to adequately allocate transmission opportunities (superframe durations) and parametrize buffer sizes, in order to improve the network throughput and avoid typical problems, such as: network congestion, high end-to-end communication delays and discarded messages due to buffer overflows. Simulation assessments show how proposed allocation schemes may clearly improve the operation of wide-scale cluster-tree networks. PMID:28134822

  9. Superframe Duration Allocation Schemes to Improve the Throughput of Cluster-Tree Wireless Sensor Networks.

    PubMed

    Leão, Erico; Montez, Carlos; Moraes, Ricardo; Portugal, Paulo; Vasques, Francisco

    2017-01-27

    The use ofWireless Sensor Network (WSN) technologies is an attractive option to support wide-scale monitoring applications, such as the ones that can be found in precision agriculture, environmental monitoring and industrial automation. The IEEE 802.15.4/ZigBee cluster-tree topology is a suitable topology to build wide-scale WSNs. Despite some of its known advantages, including timing synchronisation and duty-cycle operation, cluster-tree networks may suffer from severe network congestion problems due to the convergecast pattern of its communication traffic. Therefore, the careful adjustment of transmission opportunities (superframe durations) allocated to the cluster-heads is an important research issue. This paper proposes a set of proportional Superframe Duration Allocation (SDA) schemes, based on well-defined protocol and timing models, and on the message load imposed by child nodes (Load-SDA scheme), or by number of descendant nodes (Nodes-SDA scheme) of each cluster-head. The underlying reasoning is to adequately allocate transmission opportunities (superframe durations) and parametrize buffer sizes, in order to improve the network throughput and avoid typical problems, such as: network congestion, high end-to-end communication delays and discarded messages due to buffer overflows. Simulation assessments show how proposed allocation schemes may clearly improve the operation of wide-scale cluster-tree networks.

  10. An Efficient Radio Resource Allocation Scheme for Minimum Outage Probability Using Cooperation in OFDMA Systems

    NASA Astrophysics Data System (ADS)

    Jung, Junwoo; Park, Hyungwon; Lim, Jae-Sung

    Cooperation can increase the system performance by obtaining the spatial diversity. While most of the present works concentrate on the analysis of the cooperation based on the inter-user channel response and developing a scheme for higher cooperative diversity, in this paper, we focus on practical resource allocation in OFDMA systems. Since the user who uses the same center frequency can not receive the signal when transmitting, this constraint should be considered to apply the cooperation to OFDMA systems. In this paper, we propose the pair-based OFDMA frame structure that overcomes this constraint. Also in this frame structure to achieve the minimum outage probability of system, we select the best partner among the candidate neighbors and allocate the suitable subchannels to bandwidth requested users through a cooperative subchannel allocation (CSA) algorithm. In order to evaluate the proposed resource allocation scheme, we carry out simulations based on IEEE 802.16e. The simulation results show that our proposed algorithm offers smaller outage probability than one based on non-cooperative communications and we get the minimum outage probability when a threshold for selection of candidate neighbors is 10dB. We analyze that these results can be achieved by helping users located around the edge of the cell.

  11. The UK Pancreas Allocation Scheme for Whole Organ and Islet Transplantation.

    PubMed

    Hudson, A; Bradbury, L; Johnson, R; Fuggle, S V; Shaw, J A M; Casey, J J; Friend, P J; Watson, C J E

    2015-09-01

    In order to develop a national allocation scheme for donor pancreases, factors affecting waiting time and transplant outcomes in the United States (US) and United Kingdom (UK) were analyzed and compared. Blood group, sensitization, dialysis requirement, and whether the patient was waiting for a kidney and pancreas or pancreas alone affected waiting time in both countries; ethnicity and body mass index (BMI) also affected waiting time in the US. Ninety-day pancreas survival was similar in the UK and US, and was poorer for patients receiving a pancreas alone, with older donors, higher BMI and longer duration of ischemia in both countries. Factors affecting outcome, together with published data on factors affecting islet transplantation, informed the development of a points based allocation scheme for deceased donor pancreases in the UK providing equitable access for both whole organ and islet recipients through a single waiting list. Analysis of the allocation scheme 3 years after its introduction in December 2010 showed that the results were broadly as simulated, with a significant reduction in the number of long waiting patients and an increase in the number of islet transplants. There remains a surplus of highly sensitized patients in the waiting list, which the scheme should address in time.

  12. A Scratchpad Memory Allocation Scheme for Dataflow Models

    DTIC Science & Technology

    2008-08-25

    perform via static analysis of C/C++. We use the heterochronous dataflow (HDF) model of computation [16, 39] in Ptolemy II [11] as a means to specify the...buffer data) as the key memory requirements [9]. 4.1 Structure of an HDF Model We use Ptolemy II’s graphical interface and the HDF domain to specify...algorithm. The allocation algorithm was implemented in Ptolemy II [11], a Java-based framework for studying modeling, simulation and design of concurrent

  13. Smart LED allocation scheme for efficient multiuser visible light communication networks.

    PubMed

    Sewaiwar, Atul; Tiwari, Samrat Vikramaditya; Chung, Yeon Ho

    2015-05-18

    In a multiuser bidirectional visible light communication (VLC), a large number of LEDs or an LED array needs to be allocated in an efficient manner to ensure sustainable data rate and link quality. Moreover, in order to support an increasing or decreasing number of users in the network, the LED allocation is required to be performed dynamically. In this paper, a novel smart LED allocation scheme for efficient multiuser VLC networks is presented. The proposed scheme allocates RGB LEDs to multiple users in a dynamic and efficient fashion, while satisfying illumination requirements in an indoor environment. The smart LED array comprised of RGB LEDs is divided into sectors according to the location of the users. The allocated sectors then provide optical power concentration toward the users for efficient and reliable data transmission. An algorithm for the dynamic allocation of the LEDs is also presented. To verify its effective resource allocation feature of the proposed scheme, simulations were performed. It is found that the proposed smart LED allocation scheme provides the effect of optical beamforming toward individual users, thereby increasing the collective power concentration of the optical signals on the desirable users and resulting in significantly increased data rate, while ensuring sufficient illumination in a multiuser VLC environment.

  14. Continuity Aware Spectrum Allocation Schemes for Virtual Optical Network Embedding in Elastic Optical Networks

    NASA Astrophysics Data System (ADS)

    Wang, Wei; Zhao, Yongli; He, Ruiying; Yu, Xiaosong; Zhang, Jie; Zheng, Haomian; Lin, Yi; Han, Jianrui

    2016-05-01

    Optical network virtualization has been studied as a promising technique for optical network resources provisioning. In the virtualization context of Elastic Optical Network (EON), Virtual Optical Network Embedding (VONE) is investigated as a key issue for allocating spectrum resources to VON requests. This paper discusses the continuity constraint for the VONE problem in EONs, and presents three continuity-aware spectrum allocation schemes according to strict and relaxed continuity constraints. We have demonstrated the proposed schemes on emulated testbed to verify the feasibility of composing VON with discontiguous spectrum resources. Additionally, the performances of the proposed schemes are compared via simulation in terms of blocking probability, spectrum resource utilization and discontinuity degree.

  15. A novel dynamic wavelength bandwidth allocation scheme over OFDMA PONs

    NASA Astrophysics Data System (ADS)

    Yan, Bo; Guo, Wei; Jin, Yaohui; Hu, Weisheng

    2011-12-01

    With rapid growth of Internet applications, supporting differentiated service and enlarging system capacity have been new tasks for next generation access system. In recent years, research in OFDMA Passive Optical Networks (PON) has experienced extraordinary development as for its large capacity and flexibility in scheduling. Although much work has been done to solve hardware layer obstacles for OFDMA PON, scheduling algorithm on OFDMA PON system is still under primary discussion. In order to support QoS service on OFDMA PON system, a novel dynamic wavelength bandwidth allocation (DWBA) algorithm is proposed in this paper. Per-stream QoS service is supported in this algorithm. Through simulation, we proved our bandwidth allocation algorithm performs better in bandwidth utilization and differentiate service support.

  16. Resource Allocation Scheme in MIMO-OFDMA System for User's Different Data Throughput Requirements

    NASA Astrophysics Data System (ADS)

    Sann Maw, Maung; Sasase, Iwao

    In the subcarrier and power allocation schemes in Multi-Input Multi-Output and Orthogonal Frequency Division Multiple Access (MIMO-OFDMA) systems, only equal fairness among users has been considered and no scheme for proportional data rate fairness has been considered. In this paper, a subcarrier, bit and power allocation scheme is proposed to maximize the total throughput under the constraints of total power and proportional data rate fairness among users. In the proposed scheme, joint subchannel allocation and adaptive bit loading is firstly performed by using singular value decomposition (SVD) of channel matrix under the constraint of users' data throughput requirements, and then adaptive power loading is applied. Simulation results show that effective performance of the system has been improved as well as each throughput is proportionally distributed among users in MIMO-OFDMA systems.

  17. Dynamic resource allocation scheme for distributed heterogeneous computer systems

    NASA Technical Reports Server (NTRS)

    Liu, Howard T. (Inventor); Silvester, John A. (Inventor)

    1991-01-01

    This invention relates to a resource allocation in computer systems, and more particularly, to a method and associated apparatus for shortening response time and improving efficiency of a heterogeneous distributed networked computer system by reallocating the jobs queued up for busy nodes to idle, or less-busy nodes. In accordance with the algorithm (SIDA for short), the load-sharing is initiated by the server device in a manner such that extra overhead in not imposed on the system during heavily-loaded conditions. The algorithm employed in the present invention uses a dual-mode, server-initiated approach. Jobs are transferred from heavily burdened nodes (i.e., over a high threshold limit) to low burdened nodes at the initiation of the receiving node when: (1) a job finishes at a node which is burdened below a pre-established threshold level, or (2) a node is idle for a period of time as established by a wakeup timer at the node. The invention uses a combination of the local queue length and the local service rate ratio at each node as the workload indicator.

  18. Classroom Games: The Allocation of Renewable Resources under Different Property Rights and Regulation Schemes.

    ERIC Educational Resources Information Center

    Giraud, Kelly L.; Herrmann, Mark

    2002-01-01

    Describes a renewable resource allocation game designed to stimulate student interest in and understanding of market failure associated with open-access types of resource use. Employs the game to discuss advantages and disadvantages of property rights and regulation schemes. States the game benefits noneconomics majors in natural resource…

  19. Performance Improvement of Proportional Fairness-Based Resource Allocation in OFDMA Downlink Systems

    NASA Astrophysics Data System (ADS)

    Ruangchaijatupon, Nararat; Ji, Yusheng

    We have developed a novel downlink packet scheduling scheme for a multiuser OFDMA system in which a subchannel can be time-multiplexed among multiple users. This scheme which is called Matrixed-based Proportional Fairness can provide a high system throughput while ensuring fairness. The scheme is based on a Proportional Fairness (PF) utility function and can be applied to any of the PF-based schedulers. Our scheduler explores multichannel multiuser diversity by using a two-dimensional matrix combining user selection, subchannel assignment, and time slot allocation. Furthermore, unlike other PF-based schemes, our scheme considers finitely backlogged queues during the time slot allocation. By doing so, it can exploit multichannel multiuser diversity to utilize bandwidth efficiently and with throughput fairness. Additionally, fairness in the time domain is enhanced by limiting the number of allocated time slots. Intensive simulations considering finitely backlogged queues and user mobility prove the scheme's effectiveness.

  20. A Novel Joint Power and Feedback Bit Allocation Interference Alignment Scheme for Wireless Sensor Networks

    PubMed Central

    Li, Shibao; He, Chang; Wang, Yixin; Zhang, Yang; Liu, Jianhang; Huang, Tingpei

    2017-01-01

    It is necessary to improve the energy efficiency of batteries in wireless sensor networks (WSNs). The multiple-input multiple-output (MIMO) technique has become an important means to ameliorate WSNs, and interference management is the core of improving energy efficiency. A promising approach is interference alignment (IA), which effectively reduces the interference and improves the throughput of a system in the MIMO interference channels. However, the IA scheme requires perfect channel state information (CSI) at all transceivers in practice, which results in considerable feedback overhead. Thus, limited IA feedback has attracted much attention. In this paper, we analyze the throughput loss of the K-user MIMO interference channels when each transmitter delivers multiple streams in one slot, and derives the upper-bound of the system interference leakage and throughput loss. Then, to reduce the interference leakage and throughput loss for the MIMO interference alignment with limited feedback, a joint power and feedback bit allocation optimization scheme is proposed. The simulation results show that, compared with the conventional schemes, the presented optimal scheme achieves less residual interference and better performance in the system throughput. PMID:28287434

  1. Analysis of QoS-Based Band Power Allocation for Broadband Multi-Cell Forward Link Environments

    NASA Astrophysics Data System (ADS)

    Son, Hyukmin; Lee, Sanghoon

    ICI (Inter-Cell Interference) mitigation schemes at the cell border are frequently dealt with as a special issue in 3GPP LTE (Long Term Evolution). However, few papers have analyzed the outage performance for the ICI mitigation schemes. In this paper, we propose a generalized cell planning scheme termed QBPA (Quality of Service based Band Power Allocation). Utilizing the QBPA scheme, we measure how much increase in channel capacity can be obtained through the flexible control of bandwidth and power in multi-cell forward-link environments. In addition, the feasible performance of the conventional schemes can be evaluated as long as those schemes are specific forms of the QBPA.

  2. 47 CFR 69.502 - Base factor allocation.

    Code of Federal Regulations, 2014 CFR

    2014-10-01

    ... 47 Telecommunication 3 2014-10-01 2014-10-01 false Base factor allocation. 69.502 Section 69.502... Segregation of Common Line Element Revenue Requirement § 69.502 Base factor allocation. Projected revenues from the following shall be deducted from the base factor portion to determine the amount that...

  3. 47 CFR 69.502 - Base factor allocation.

    Code of Federal Regulations, 2010 CFR

    2010-10-01

    ... 47 Telecommunication 3 2010-10-01 2010-10-01 false Base factor allocation. 69.502 Section 69.502... Segregation of Common Line Element Revenue Requirement § 69.502 Base factor allocation. Projected revenues from the following shall be deducted from the base factor portion to determine the amount that...

  4. 47 CFR 69.502 - Base factor allocation.

    Code of Federal Regulations, 2013 CFR

    2013-10-01

    ... 47 Telecommunication 3 2013-10-01 2013-10-01 false Base factor allocation. 69.502 Section 69.502... Segregation of Common Line Element Revenue Requirement § 69.502 Base factor allocation. Projected revenues from the following shall be deducted from the base factor portion to determine the amount that...

  5. 47 CFR 69.502 - Base factor allocation.

    Code of Federal Regulations, 2012 CFR

    2012-10-01

    ... 47 Telecommunication 3 2012-10-01 2012-10-01 false Base factor allocation. 69.502 Section 69.502... Segregation of Common Line Element Revenue Requirement § 69.502 Base factor allocation. Projected revenues from the following shall be deducted from the base factor portion to determine the amount that...

  6. 47 CFR 69.502 - Base factor allocation.

    Code of Federal Regulations, 2011 CFR

    2011-10-01

    ... 47 Telecommunication 3 2011-10-01 2011-10-01 false Base factor allocation. 69.502 Section 69.502... Segregation of Common Line Element Revenue Requirement § 69.502 Base factor allocation. Projected revenues from the following shall be deducted from the base factor portion to determine the amount that...

  7. Stereoscopic Visual Attention-Based Regional Bit Allocation Optimization for Multiview Video Coding

    NASA Astrophysics Data System (ADS)

    Zhang, Yun; Jiang, Gangyi; Yu, Mei; Chen, Ken; Dai, Qionghai

    2010-12-01

    We propose a Stereoscopic Visual Attention- (SVA-) based regional bit allocation optimization for Multiview Video Coding (MVC) by the exploiting visual redundancies from human perceptions. We propose a novel SVA model, where multiple perceptual stimuli including depth, motion, intensity, color, and orientation contrast are utilized, to simulate the visual attention mechanisms of human visual system with stereoscopic perception. Then, a semantic region-of-interest (ROI) is extracted based on the saliency maps of SVA. Both objective and subjective evaluations of extracted ROIs indicated that the proposed SVA model based on ROI extraction scheme outperforms the schemes only using spatial or/and temporal visual attention clues. Finally, by using the extracted SVA-based ROIs, a regional bit allocation optimization scheme is presented to allocate more bits on SVA-based ROIs for high image quality and fewer bits on background regions for efficient compression purpose. Experimental results on MVC show that the proposed regional bit allocation algorithm can achieve over [InlineEquation not available: see fulltext.]% bit-rate saving while maintaining the subjective image quality. Meanwhile, the image quality of ROIs is improved by [InlineEquation not available: see fulltext.] dB at the cost of insensitive image quality degradation of the background image.

  8. Scientific program construction principles and time allocation scheme for the World Space Observatory—Ultraviolet mission

    NASA Astrophysics Data System (ADS)

    Malkov, Oleg; Sachkov, Mikhail; Shustov, Boris; Kaigorodov, Pavel; Yáñez, Francisco Javier; Gómez de Castro, Ana Ines

    2011-09-01

    We present scientific program construction principles and a time allocation scheme developed for the World Space Observatory—Ultraviolet (WSO-UV) mission, which is an international space observatory for observation in UV spectral range 100-300 nm. The WSO-UV consists of a 1.7 m aperture telescope with instrumentation designed to carry out high resolution spectroscopy, long-slit low resolution spectroscopy and direct sky imaging. The WSO-UV Ground Segment is under development by Spain and Russia. They will coordinate the Mission and Science Operations and provide the satellite tracking stations for the project. The WSO-UV will work as a targeted scientific observatory. Three scientific programs will be carried out at the observatory. Core Program of scientific observations, which deserves large amounts of observing time, will be defined by the WSO-UV Science Committee to allow the conduction of high impact or legacy scientific projects. Funding Bodies Program is the guaranteed time granted to each one of the national bodies funding the WSO-UV project. Guest observer program for everyone, or Open Program, consists of astronomical observations obtained with the WSO-UV by astronomers who may or may not belong to the WSO-UV international consortium. It is open to excellent scientific projects from the world-wide community and occupies up to 40% of total observational time. Apart from the particularities associated to a science mission, this new mission will be affected by a new concept of observations management, trying to maximize the scientific return of this mission, and the shared operations between the two sites located in Spain and Russia. A brief summary of the algorithmic strategies analyzed for scheduling optimization is also given in the paper.

  9. Valuing certainty in a consensus-based water allocation mechanism

    NASA Astrophysics Data System (ADS)

    Pande, Saket; McKee, Mac

    2007-02-01

    We present an interdisciplinary approach to attach economic value to model certainty. The central theme of this paper concerns valuing certainty in water resource management, specifically resource allocation. A conceptual framework is developed to study (1) a hypothetical scenario of three water users attempting to mutually agree on allocation of some fixed amount of water amongst themselves and (2) California water policy negotiations along the lines of Adams et al. (1996). We attempt to answer how uncertainty in a policy variable affects the "allocation solution" in such consensus-based decision-making processes. This study finally evolves into economic valuation of uncertainty reduction and willingness to pay for the same.

  10. A perceptual-based approach to bit allocation for H.264 encoder

    NASA Astrophysics Data System (ADS)

    Ou, Tao-Sheng; Huang, Yi-Hsin; Chen, Homer H.

    2010-07-01

    Since the ultimate receivers of encoded video are human eyes, the characteristics of human visual system should be taken into consideration in the design of bit allocation to improve the perceptual video quality. In this paper, we incorporate the structural similarity index as a distortion metric and propose a novel rate-distortion model to characterize the relationship between rate and the structural similarity index. Based on the model, we develop an optimum bit allocation and rate control scheme for H.264 encoders. Experimental results show that up to 25% bitrate reduction over the JM reference software can be achieved. Subjective evaluation further confirms that the proposed scheme preserves more structural information and improves the perceptual quality of the encoded video.

  11. Multi-robot task allocation based on two dimensional artificial fish swarm algorithm

    NASA Astrophysics Data System (ADS)

    Zheng, Taixiong; Li, Xueqin; Yang, Liangyi

    2007-12-01

    The problem of task allocation for multiple robots is to allocate more relative-tasks to less relative-robots so as to minimize the processing time of these tasks. In order to get optimal multi-robot task allocation scheme, a twodimensional artificial swarm algorithm based approach is proposed in this paper. In this approach, the normal artificial fish is extended to be two dimension artificial fish. In the two dimension artificial fish, each vector of primary artificial fish is extended to be an m-dimensional vector. Thus, each vector can express a group of tasks. By redefining the distance between artificial fish and the center of artificial fish, the behavior of two dimension fish is designed and the task allocation algorithm based on two dimension artificial swarm algorithm is put forward. At last, the proposed algorithm is applied to the problem of multi-robot task allocation and comparer with GA and SA based algorithm is done. Simulation and compare result shows the proposed algorithm is effective.

  12. Block-layer bit allocation for quality constrained video encoding based on constant perceptual quality

    NASA Astrophysics Data System (ADS)

    Wang, Chao; Mou, Xuanqin; Hong, Wei; Zhang, Lei

    2013-02-01

    In lossy image/video encoding, there is a compromise between the number of bits (rate) and the extent of distortion. Bits need to be properly allocated to different sources, such as frames and macro blocks (MBs). Since the human eyes are more sensitive to the difference than the absolute value of signals, the MINMAX criterion suggests to minimizing the maximum distortion of the sources to limit quality fluctuation. There are many works aimed to such constant quality encoding, however, almost all of them focus on the frame layer bit allocation, and use PSNR as the quality index. We suggest that the bit allocation for MBs should also be constrained in the constant quality, and furthermore, perceptual quality indices should be used instead of PSNR. Based on this idea, we propose a multi-pass block-layer bit allocation scheme for quality constrained encoding. The experimental results show that the proposed method can achieve much better encoding performance. Keywords: Bit allocation, block-layer, perceptual quality, constant quality, quality constrained

  13. Energy Efficient Cluster Based Scheduling Scheme for Wireless Sensor Networks.

    PubMed

    Janani, E Srie Vidhya; Kumar, P Ganesh

    2015-01-01

    The energy utilization of sensor nodes in large scale wireless sensor network points out the crucial need for scalable and energy efficient clustering protocols. Since sensor nodes usually operate on batteries, the maximum utility of network is greatly dependent on ideal usage of energy leftover in these sensor nodes. In this paper, we propose an Energy Efficient Cluster Based Scheduling Scheme for wireless sensor networks that balances the sensor network lifetime and energy efficiency. In the first phase of our proposed scheme, cluster topology is discovered and cluster head is chosen based on remaining energy level. The cluster head monitors the network energy threshold value to identify the energy drain rate of all its cluster members. In the second phase, scheduling algorithm is presented to allocate time slots to cluster member data packets. Here congestion occurrence is totally avoided. In the third phase, energy consumption model is proposed to maintain maximum residual energy level across the network. Moreover, we also propose a new packet format which is given to all cluster member nodes. The simulation results prove that the proposed scheme greatly contributes to maximum network lifetime, high energy, reduced overhead, and maximum delivery ratio.

  14. Auction-based resource allocation game under a hierarchical structure

    NASA Astrophysics Data System (ADS)

    Cui, Yingying; Zou, Suli; Ma, Zhongjing

    2016-01-01

    This paper studies a class of auction-based resource allocation games under a hierarchical structure, such that each supplier is assigned a certain amount of resource from a single provider and allocates it to its buyers with auction mechanisms. To implement the efficient allocations for the underlying hierarchical system, we first design an auction mechanism, for each local system composed of a supplier and its buyers, which inherits the advantages of the progressive second price mechanism. By employing a dynamic algorithm, each local system converges to its own efficient Nash equilibrium, at which the efficient resource allocation is achieved and the bidding prices of all the buyers in this local system are identical with each other. After the local systems reach their own equilibria respectively, the resources assigned to suppliers are readjusted via a dynamic hierarchical algorithm with respect to the bidding prices associated with the implemented equilibria of local systems. By applying the proposed hierarchical process, the formulated hierarchical system can converge to the efficient allocation under certain mild conditions. The developed results in this work are demonstrated with simulations.

  15. Adjacency Matrix-Based Transmit Power Allocation Strategies in Wireless Sensor Networks

    PubMed Central

    Consolini, Luca; Medagliani, Paolo; Ferrari, Gianluigi

    2009-01-01

    In this paper, we present an innovative transmit power control scheme, based on optimization theory, for wireless sensor networks (WSNs) which use carrier sense multiple access (CSMA) with collision avoidance (CA) as medium access control (MAC) protocol. In particular, we focus on schemes where several remote nodes send data directly to a common access point (AP). Under the assumption of finite overall network transmit power and low traffic load, we derive the optimal transmit power allocation strategy that minimizes the packet error rate (PER) at the AP. This approach is based on modeling the CSMA/CA MAC protocol through a finite state machine and takes into account the network adjacency matrix, depending on the transmit power distribution and determining the network connectivity. It will be then shown that the transmit power allocation problem reduces to a convex constrained minimization problem. Our results show that, under the assumption of low traffic load, the power allocation strategy, which guarantees minimal delay, requires the maximization of network connectivity, which can be equivalently interpreted as the maximization of the number of non-zero entries of the adjacency matrix. The obtained theoretical results are confirmed by simulations for unslotted Zigbee WSNs. PMID:22346705

  16. Adjacency matrix-based transmit power allocation strategies in wireless sensor networks.

    PubMed

    Consolini, Luca; Medagliani, Paolo; Ferrari, Gianluigi

    2009-01-01

    In this paper, we present an innovative transmit power control scheme, based on optimization theory, for wireless sensor networks (WSNs) which use carrier sense multiple access (CSMA) with collision avoidance (CA) as medium access control (MAC) protocol. In particular, we focus on schemes where several remote nodes send data directly to a common access point (AP). Under the assumption of finite overall network transmit power and low traffic load, we derive the optimal transmit power allocation strategy that minimizes the packet error rate (PER) at the AP. This approach is based on modeling the CSMA/CA MAC protocol through a finite state machine and takes into account the network adjacency matrix, depending on the transmit power distribution and determining the network connectivity. It will be then shown that the transmit power allocation problem reduces to a convex constrained minimization problem. Our results show that, under the assumption of low traffic load, the power allocation strategy, which guarantees minimal delay, requires the maximization of network connectivity, which can be equivalently interpreted as the maximization of the number of non-zero entries of the adjacency matrix. The obtained theoretical results are confirmed by simulations for unslotted Zigbee WSNs.

  17. Analysis and simulation of the dynamic spectrum allocation based on parallel immune optimization in cognitive wireless networks.

    PubMed

    Huixin, Wu; Duo, Mo; He, Li

    2014-01-01

    Spectrum allocation is one of the key issues to improve spectrum efficiency and has become the hot topic in the research of cognitive wireless network. This paper discusses the real-time feature and efficiency of dynamic spectrum allocation and presents a new spectrum allocation algorithm based on the master-slave parallel immune optimization model. The algorithm designs a new encoding scheme for the antibody based on the demand for convergence rate and population diversity. For improving the calculating efficiency, the antibody affinity in the population is calculated in multiple computing nodes at the same time. Simulation results show that the algorithm reduces the total spectrum allocation time and can achieve higher network profits. Compared with traditional serial algorithms, the algorithm proposed in this paper has better speedup ratio and parallel efficiency.

  18. Allocating Great Lakes forage bases in response to multiple demand

    USGS Publications Warehouse

    Brown, Edward H.; Busiahn, Thomas R.; Jones, Michael L.; Argyle, Ray L.; Taylor, William W.; Ferreri, C. Paola

    1999-01-01

    Forage base allocation, which has become an important issue because of major changes in the fish communities and fisheries of the Great Lakes since the 1950s is examined and documented in this chapter. Management initiatives that were used to address the issue, and supporting research and development that provided new or improved methods of field sampling and analysis are also highlighted.

  19. Stability Properties and Cross Coupling Performance of the Control Allocation Scheme CAPIO

    NASA Technical Reports Server (NTRS)

    Yildiz, Yildiray; Kolmanovsky, Ilya V.

    2010-01-01

    This paper presents a stability analysis and an application of a recently developed Control Allocator for recovery from Pilot Induced Oscillations (CAPIO). When actuators are rate-saturated due to either aggressive pilot commands, high gain ight control systems or some anomaly in the system, the effective delay in the control loop may increase. This effective delay increase manifests itself as a phase shift between the commanded and actual system signals and can instigate Pilot induced Oscillations (PIO). CAPIO reduces the e ective time delay by minimizing the phase shift between the commanded and the actual attitude accelerations. We present a stability analysis of CAPIO for a scalar system. In addition, we present simulation results for aircraft with cross-coupling which demonstrates the potential of CAPIO serving as an effective PIO handler in adverse conditions.

  20. PIYAS-Proceeding to Intelligent Service Oriented Memory Allocation for Flash Based Data Centric Sensor Devices in Wireless Sensor Networks

    PubMed Central

    Rizvi, Sanam Shahla; Chung, Tae-Sun

    2010-01-01

    Flash memory has become a more widespread storage medium for modern wireless devices because of its effective characteristics like non-volatility, small size, light weight, fast access speed, shock resistance, high reliability and low power consumption. Sensor nodes are highly resource constrained in terms of limited processing speed, runtime memory, persistent storage, communication bandwidth and finite energy. Therefore, for wireless sensor networks supporting sense, store, merge and send schemes, an efficient and reliable file system is highly required with consideration of sensor node constraints. In this paper, we propose a novel log structured external NAND flash memory based file system, called Proceeding to Intelligent service oriented memorY Allocation for flash based data centric Sensor devices in wireless sensor networks (PIYAS). This is the extended version of our previously proposed PIYA [1]. The main goals of the PIYAS scheme are to achieve instant mounting and reduced SRAM space by keeping memory mapping information to a very low size of and to provide high query response throughput by allocation of memory to the sensor data by network business rules. The scheme intelligently samples and stores the raw data and provides high in-network data availability by keeping the aggregate data for a longer period of time than any other scheme has done before. We propose effective garbage collection and wear-leveling schemes as well. The experimental results show that PIYAS is an optimized memory management scheme allowing high performance for wireless sensor networks. PMID:22315541

  1. PIYAS-proceeding to intelligent service oriented memory allocation for flash based data centric sensor devices in wireless sensor networks.

    PubMed

    Rizvi, Sanam Shahla; Chung, Tae-Sun

    2010-01-01

    Flash memory has become a more widespread storage medium for modern wireless devices because of its effective characteristics like non-volatility, small size, light weight, fast access speed, shock resistance, high reliability and low power consumption. Sensor nodes are highly resource constrained in terms of limited processing speed, runtime memory, persistent storage, communication bandwidth and finite energy. Therefore, for wireless sensor networks supporting sense, store, merge and send schemes, an efficient and reliable file system is highly required with consideration of sensor node constraints. In this paper, we propose a novel log structured external NAND flash memory based file system, called Proceeding to Intelligent service oriented memorY Allocation for flash based data centric Sensor devices in wireless sensor networks (PIYAS). This is the extended version of our previously proposed PIYA [1]. The main goals of the PIYAS scheme are to achieve instant mounting and reduced SRAM space by keeping memory mapping information to a very low size of and to provide high query response throughput by allocation of memory to the sensor data by network business rules. The scheme intelligently samples and stores the raw data and provides high in-network data availability by keeping the aggregate data for a longer period of time than any other scheme has done before. We propose effective garbage collection and wear-leveling schemes as well. The experimental results show that PIYAS is an optimized memory management scheme allowing high performance for wireless sensor networks.

  2. Network Allocation Vector (NAV) Optimization for Underwater Handshaking-Based Protocols

    PubMed Central

    Cho, Junho; Shitiri, Ethungshan; Cho, Ho-Shin

    2016-01-01

    In this paper, we obtained the optimized network allocation vector (NAV) for underwater handshaking-based protocols, as inefficient determination of the NAV leads to unnecessarily long silent periods. We propose a scheme which determines the NAV by taking into account all possible propagation delays: propagation delay between a source and a destination; propagation delay between a source and the neighbors; and propagation delay between a destination and the neighbors. Such an approach effectively allows the NAV to be determined precisely equal to duration of a busy channel, and the silent period can be set commensurate to that duration. This allows for improvements in the performance of handshaking-based protocols, such as the carrier sense multiple access/collision avoidance (CSMA/CA) protocol, in terms of throughput and fairness. To evaluate the performance of the proposed scheme, performance comparisons were carried out through simulations with prior NAV setting methods. The simulation results show that the proposed scheme outperforms the other schemes in terms of throughput and fairness. PMID:28029122

  3. Network Allocation Vector (NAV) Optimization for Underwater Handshaking-Based Protocols.

    PubMed

    Cho, Junho; Shitiri, Ethungshan; Cho, Ho-Shin

    2016-12-24

    In this paper, we obtained the optimized network allocation vector (NAV) for underwater handshaking-based protocols, as inefficient determination of the NAV leads to unnecessarily long silent periods. We propose a scheme which determines the NAV by taking into account all possible propagation delays: propagation delay between a source and a destination; propagation delay between a source and the neighbors; and propagation delay between a destination and the neighbors. Such an approach effectively allows the NAV to be determined precisely equal to duration of a busy channel, and the silent period can be set commensurate to that duration. This allows for improvements in the performance of handshaking-based protocols, such as the carrier sense multiple access/collision avoidance (CSMA/CA) protocol, in terms of throughput and fairness. To evaluate the performance of the proposed scheme, performance comparisons were carried out through simulations with prior NAV setting methods. The simulation results show that the proposed scheme outperforms the other schemes in terms of throughput and fairness.

  4. [Optimal allocation of irrigation water resources based on systematical strategy].

    PubMed

    Cheng, Shuai; Zhang, Shu-qing

    2015-01-01

    With the development of the society and economy, as well as the rapid increase of population, more and more water is needed by human, which intensified the shortage of water resources. The scarcity of water resources and growing competition of water in different water use sectors reduce water availability for irrigation, so it is significant to plan and manage irrigation water resources scientifically and reasonably for improving water use efficiency (WUE) and ensuring food security. Many investigations indicate that WUE can be increased by optimization of water use. However, present studies focused primarily on a particular aspect or scale, which lack systematic analysis on the problem of irrigation water allocation. By summarizing previous related studies, especially those based on intelligent algorithms, this article proposed a multi-level, multi-scale framework for allocating irrigation water, and illustrated the basic theory of each component of the framework. Systematical strategy of optimal irrigation water allocation can not only control the total volume of irrigation water on the time scale, but also reduce water loss on the spatial scale. It could provide scientific basis and technical support for improving the irrigation water management level and ensuring the food security.

  5. S-EMG signal compression based on domain transformation and spectral shape dynamic bit allocation

    PubMed Central

    2014-01-01

    Background Surface electromyographic (S-EMG) signal processing has been emerging in the past few years due to its non-invasive assessment of muscle function and structure and because of the fast growing rate of digital technology which brings about new solutions and applications. Factors such as sampling rate, quantization word length, number of channels and experiment duration can lead to a potentially large volume of data. Efficient transmission and/or storage of S-EMG signals are actually a research issue. That is the aim of this work. Methods This paper presents an algorithm for the data compression of surface electromyographic (S-EMG) signals recorded during isometric contractions protocol and during dynamic experimental protocols such as the cycling activity. The proposed algorithm is based on discrete wavelet transform to proceed spectral decomposition and de-correlation, on a dynamic bit allocation procedure to code the wavelets transformed coefficients, and on an entropy coding to minimize the remaining redundancy and to pack all data. The bit allocation scheme is based on mathematical decreasing spectral shape models, which indicates a shorter digital word length to code high frequency wavelets transformed coefficients. Four bit allocation spectral shape methods were implemented and compared: decreasing exponential spectral shape, decreasing linear spectral shape, decreasing square-root spectral shape and rotated hyperbolic tangent spectral shape. Results The proposed method is demonstrated and evaluated for an isometric protocol and for a dynamic protocol using a real S-EMG signal data bank. Objective performance evaluations metrics are presented. In addition, comparisons with other encoders proposed in scientific literature are shown. Conclusions The decreasing bit allocation shape applied to the quantized wavelet coefficients combined with arithmetic coding results is an efficient procedure. The performance comparisons of the proposed S-EMG data

  6. Cognitive radio based optimal channel sensing and resources allocation

    NASA Astrophysics Data System (ADS)

    Vijayasarveswari, V.; Khatun, S.; Fakir, M. M.; Nayeem, M. N.; Kamarudin, L. M.; Jakaria, A.

    2017-03-01

    Cognitive radio (CR) is the latest type of wireless technoloy that is proposed to mitigate spectrum saturation problem. İn cognitve radio, secondary user will use primary user's spectrum during primary user's absence without interupting primary user's transmission. This paper focuses on practical cognitive radio network development process using Android based smart phone for the data transmission. Energy detector based sensing method was proposed and used here because it doesnot require primary user's information. Bluetooth and Wi-fi are the two available types of spectrum that was sensed for CR detection. Simulation showed cognitive radio network can be developed using Android based smart phones. So, a complete application was developed using Java based Android Eclipse program. Finally, the application was uploaded and run on Android based smart phone to form and verify CR network for channel sensing and resource allocation. The observed efficiency of the application was around 81%.

  7. A QoS aware resource allocation strategy for 3D A/V streaming in OFDMA based wireless systems.

    PubMed

    Chung, Young-Uk; Choi, Yong-Hoon; Park, Suwon; Lee, Hyukjoon

    2014-01-01

    Three-dimensional (3D) video is expected to be a "killer app" for OFDMA-based broadband wireless systems. The main limitation of 3D video streaming over a wireless system is the shortage of radio resources due to the large size of the 3D traffic. This paper presents a novel resource allocation strategy to address this problem. In the paper, the video-plus-depth 3D traffic type is considered. The proposed resource allocation strategy focuses on the relationship between 2D video and the depth map, handling them with different priorities. It is formulated as an optimization problem and is solved using a suboptimal heuristic algorithm. Numerical results show that the proposed scheme provides a better quality of service compared to conventional schemes.

  8. Capacity allocation mechanism based on differentiated QoS in 60 GHz radio-over-fiber local access network

    NASA Astrophysics Data System (ADS)

    Kou, Yanbin; Liu, Siming; Zhang, Weiheng; Shen, Guansheng; Tian, Huiping

    2017-03-01

    We present a dynamic capacity allocation mechanism based on the Quality of Service (QoS) for different mobile users (MU) in 60 GHz radio-over-fiber (RoF) local access networks. The proposed mechanism is capable for collecting the request information of MUs to build a full list of MU capacity demands and service types at the Central Office (CO). A hybrid algorithm is introduced to implement the capacity allocation which can satisfy the requirements of different MUs at different network traffic loads. Compared with the weight dynamic frames assignment (WDFA) scheme, the Hybrid scheme can keep high priority MUs in low delay and maintain the packet loss rate less than 1% simultaneously. At the same time, low priority MUs have a relatively better performance.

  9. Three-dimensional compression scheme based on wavelet transform

    NASA Astrophysics Data System (ADS)

    Yang, Wu; Xu, Hui; Liao, Mengyang

    1999-03-01

    In this paper, a 3D compression method based on separable wavelet transform is discussed in detail. The most commonly used digital modalities generate multiple slices in a single examination, which are normally anatomically or physiologically correlated to each other. 3D wavelet compression methods can achieve more efficient compression by exploring the correlation between slices. The first step is based on a separable 3D wavelet transform. Considering the difference between pixel distances within a slice and those between slices, one biorthogonal Antoninin filter bank is applied within 2D slices and a second biorthogonal Villa4 filter bank on the slice direction. Then, S+P transform is applied in the low-resolution wavelet components and an optimal quantizer is presented after analysis of the quantization noise. We use an optimal bit allocation algorithm, which, instead of eliminating the coefficients of high-resolution components in smooth areas, minimizes the system reconstruction distortion at a given bit-rate. Finally, to remain high coding efficiency and adapt to different properties of each component, a comprehensive entropy coding method is proposed, in which arithmetic coding method is applied in high-resolution components and adaptive Huffman coding method in low-resolution components. Our experimental results are evaluated by several image measures and our 3D wavelet compression scheme is proved to be more efficient than 2D wavelet compression.

  10. Energy-efficient orthogonal frequency division multiplexing-based passive optical network based on adaptive sleep-mode control and dynamic bandwidth allocation

    NASA Astrophysics Data System (ADS)

    Zhang, Chongfu; Xiao, Nengwu; Chen, Chen; Yuan, Weicheng; Qiu, Kun

    2016-02-01

    We propose an energy-efficient orthogonal frequency division multiplexing-based passive optical network (OFDM-PON) using adaptive sleep-mode control and dynamic bandwidth allocation. In this scheme, a bidirectional-centralized algorithm named the receiver and transmitter accurate sleep control and dynamic bandwidth allocation (RTASC-DBA), which has an overall bandwidth scheduling policy, is employed to enhance the energy efficiency of the OFDM-PON. The RTASC-DBA algorithm is used in an optical line terminal (OLT) to control the sleep mode of an optical network unit (ONU) sleep and guarantee the quality of service of different services of the OFDM-PON. The obtained results show that, by using the proposed scheme, the average power consumption of the ONU is reduced by ˜40% when the normalized ONU load is less than 80%, compared with the average power consumption without using the proposed scheme.

  11. Multiview image compression based on LDV scheme

    NASA Astrophysics Data System (ADS)

    Battin, Benjamin; Niquin, Cédric; Vautrot, Philippe; Debons, Didier; Lucas, Laurent

    2011-03-01

    In recent years, we have seen several different approaches dealing with multiview compression. First, we can find the H264/MVC extension which generates quite heavy bitstreams when used on n-views autostereoscopic medias and does not allow inter-view reconstruction. Another solution relies on the MVD (MultiView+Depth) scheme which keeps p views (n > p > 1) and their associated depth-maps. This method is not suitable for multiview compression since it does not exploit the redundancy between the p views, moreover occlusion areas cannot be accurately filled. In this paper, we present our method based on the LDV (Layered Depth Video) approach which keeps one reference view with its associated depth-map and the n-1 residual ones required to fill occluded areas. We first perform a global per-pixel matching step (providing a good consistency between each view) in order to generate one unified-color RGB texture (where a unique color is devoted to all pixels corresponding to the same 3D-point, thus avoiding illumination artifacts) and a signed integer disparity texture. Next, we extract the non-redundant information and store it into two textures (a unified-color one and a disparity one) containing the reference and the n-1 residual views. The RGB texture is compressed with a conventional DCT or DWT-based algorithm and the disparity texture with a lossless dictionary algorithm. Then, we will discuss about the signal deformations generated by our approach.

  12. Dynamic bandwidth allocation algorithms for local storage based VoD delivery: Comparison between single and dual receiver configurations

    NASA Astrophysics Data System (ADS)

    Abeywickrama, Sandu; Wong, Elaine

    2015-02-01

    The benefits of using distributed caching servers to optimize the traditional video-on-demand delivery have been extensively discussed in literature. In our previous work, we introduced a dual-receiver based dynamic bandwidth allocation algorithm to improve video-on-demand services using a local storage placed within the access network. The main drawback of this algorithm lies in the additional power consumption at the optical network unit that arises from using two receivers. In this paper, we present two novel single-receiver based dynamic bandwidth allocation algorithms to further optimize local storage aided video-on-demand over passive optical networks. The quality-of-service and power performances of the algorithms are critically analyzed using packet level simulations and formulation of power consumption models. We show that the energy-efficiency of a local storage based video-on-demand scheme can be increased without compromising the quality-of-service by the use of single receiver algorithms. Further, we compare the two newly introduced algorithms against dual-receiver based and without local storage schemes to find the most appropriate bandwidth allocation algorithm for local storage based video-on-demand delivery over passive optical networks.

  13. Quantum group signature scheme based on controlled quantum teleportation

    NASA Astrophysics Data System (ADS)

    Chen, F. L.; Han, Z. F.

    2016-11-01

    Group signature scheme is a method of allowing a member of a group to sign a message anonymously on behalf of the group. The group administrator is in charge of adding group members and has the ability to reveal the original signer in the event of disputes. Based on controlled quantum teleportation with three-particle entangled W states, we propose a new quantum group signature scheme with designated receiver. Security analysis proves that the proposed scheme possesses the characteristics of group signature and resists the usual attacks. Compared with previous proposed schemes, this scheme follows security definition of group signature fully and meets its basic requirements.

  14. Spatial dimming scheme for optical OFDM based visible light communication.

    PubMed

    Yang, Yang; Zeng, Zhimin; Cheng, Julian; Guo, Caili

    2016-12-26

    A new dimming control scheme termed spatial dimming orthogonal frequency division multiplexing (SD-OFDM) is proposed for multiple-input and multiple output OFDM based visible light communication. The basic idea of SD-OFDM is that the illumination can be represented by the number of glared light emitting diodes (LEDs) in an LED lamp. As the biasing level of LEDs does not adjust to represent the required illumination level, the proposed scheme can significantly mitigate the clipping noise compared to analogue dimming schemes. Furthermore, unlike digital dimming schemes that control illumination levels by setting different duty cycles of pulse width modulation, the proposed scheme is always in the "on-state" for varied illumination levels. Both analytical and simulation results indicate that the proposed scheme is an efficient and feasible dimmable scheme.

  15. Quantum scheme for secret sharing based on local distinguishability

    NASA Astrophysics Data System (ADS)

    Rahaman, Ramij; Parker, Matthew G.

    2015-02-01

    In this paper, we analyze the (im)possibility of the exact distinguishability of orthogonal multipartite entangled states under restricted local operation and classical communication. Based on this local distinguishability analysis, we propose a quantum secret sharing scheme (which we call LOCC-QSS). Our LOCC-QSS scheme is quite general and cost efficient compared to other schemes. In our scheme, no joint quantum operation is needed to reconstruct the secret. We also present an interesting (2 ,n ) -threshold LOCC-QSS scheme, where any two cooperating players, one from each of two disjoint groups of players, can always reconstruct the secret. This LOCC-QSS scheme is quite uncommon, as most (k ,n ) -threshold quantum secret sharing schemes have the restriction k ≥⌈n/2 ⌉ .

  16. A chaos secure communication scheme based on multiplication modulation

    NASA Astrophysics Data System (ADS)

    Fallahi, Kia; Leung, Henry

    2010-02-01

    A secure spread spectrum communication scheme using multiplication modulation is proposed. The proposed system multiplies the message by chaotic signal. The scheme does not need to know the initial condition of the chaotic signals and the receiver is based on an extended Kalman filter (EKF). This signal encryption scheme lends itself to cheap implementation and can therefore be used effectively for ensuring security and privacy in commercial consumer electronics products. To illustrate the effectiveness of the proposed scheme, a numerical example based on Genesio-Tesi system and also Chen dynamical system is presented and the results are compared.

  17. Efficient Unrestricted Identity-Based Aggregate Signature Scheme

    PubMed Central

    Yuan, Yumin; Zhan, Qian; Huang, Hua

    2014-01-01

    An aggregate signature scheme allows anyone to compress multiple individual signatures from various users into a single compact signature. The main objective of such a scheme is to reduce the costs on storage, communication and computation. However, among existing aggregate signature schemes in the identity-based setting, some of them fail to achieve constant-length aggregate signature or require a large amount of pairing operations which grows linearly with the number of signers, while others have some limitations on the aggregated signatures. The main challenge in building efficient aggregate signature scheme is to compress signatures into a compact, constant-length signature without any restriction. To address the above drawbacks, by using the bilinear pairings, we propose an efficient unrestricted identity-based aggregate signature. Our scheme achieves both full aggregation and constant pairing computation. We prove that our scheme has existential unforgeability under the computational Diffie-Hellman assumption. PMID:25329777

  18. Efficient unrestricted identity-based aggregate signature scheme.

    PubMed

    Yuan, Yumin; Zhan, Qian; Huang, Hua

    2014-01-01

    An aggregate signature scheme allows anyone to compress multiple individual signatures from various users into a single compact signature. The main objective of such a scheme is to reduce the costs on storage, communication and computation. However, among existing aggregate signature schemes in the identity-based setting, some of them fail to achieve constant-length aggregate signature or require a large amount of pairing operations which grows linearly with the number of signers, while others have some limitations on the aggregated signatures. The main challenge in building efficient aggregate signature scheme is to compress signatures into a compact, constant-length signature without any restriction. To address the above drawbacks, by using the bilinear pairings, we propose an efficient unrestricted identity-based aggregate signature. Our scheme achieves both full aggregation and constant pairing computation. We prove that our scheme has existential unforgeability under the computational Diffie-Hellman assumption.

  19. New RSA-Based (Selectively) Convertible Undeniable Signature Schemes

    NASA Astrophysics Data System (ADS)

    Phong, Le Trieu; Kurosawa, Kaoru; Ogata, Wakaha

    In this paper, we design and analyze some new and practical (selectively) convertible undeniable signature (SCUS) schemes in both random oracle and standard model, which enjoy several merits over existing schemes in the literature. In particular, we design the first practical RSA-based SCUS schemes secure in the standard model. On the path, we also introduce two moduli RSA assumptions, including the strong twin RSA assumption, which is the RSA symmetry of the strong twin Diffie-Hellman assumption (Eurocrypt'08).

  20. Breast Histopathological Image Retrieval Based on Latent Dirichlet Allocation.

    PubMed

    Ma, Yibing; Jiang, Zhiguo; Zhang, Haopeng; Xie, Fengying; Zheng, Yushan; Shi, Huaqiang; Zhao, Yu

    2016-09-20

    In the field of pathology, whole slide image (WSI) has become the major carrier of visual and diagnostic information. Content based image retrieval among WSIs can aid the diagnosis of an unknown pathological image by finding its similar regions in WSIs with diagnostic information. However, the huge size and complex content of WSI pose several challenges for retrieval. In this paper, we propose an unsupervised, accurate and fast retrieval method for breast histopathological image. Specifically, the method presents local statistical feature of nuclei for morphology and distribution of nuclei, and employs Gabor feature to describe texture information. Latent Dirichlet Allocation model is utilized for high-level semantic mining. Locality- Sensitive Hashing is used to speed up the search. Experiments on a WSI database with over 8000 images from 15 types of breast histopathology demonstrate that our method achieves about 0.9 retrieval precision as well as promising efficiency. Based on the proposed framework, we are developing a search engine for an online digital slide browsing and retrieval platform, which can be applied in computer-aided diagnosis, pathology education, WSI archiving and management.

  1. A group-based tasks allocation algorithm for the optimization of long leave opportunities in academic departments

    NASA Astrophysics Data System (ADS)

    Eyono Obono, S. D.; Basak, Sujit Kumar

    2011-12-01

    The general formulation of the assignment problem consists in the optimal allocation of a given set of tasks to a workforce. This problem is covered by existing literature for different domains such as distributed databases, distributed systems, transportation, packets radio networks, IT outsourcing, and teaching allocation. This paper presents a new version of the assignment problem for the allocation of academic tasks to staff members in departments with long leave opportunities. It presents the description of a workload allocation scheme and its algorithm, for the allocation of an equitable number of tasks in academic departments where long leaves are necessary.

  2. Quantum fully homomorphic encryption scheme based on universal quantum circuit

    NASA Astrophysics Data System (ADS)

    Liang, Min

    2015-08-01

    Fully homomorphic encryption enables arbitrary computation on encrypted data without decrypting the data. Here it is studied in the context of quantum information processing. Based on universal quantum circuit, we present a quantum fully homomorphic encryption (QFHE) scheme, which permits arbitrary quantum transformation on any encrypted data. The QFHE scheme is proved to be perfectly secure. In the scheme, the decryption key is different from the encryption key; however, the encryption key cannot be revealed. Moreover, the evaluation algorithm of the scheme is independent of the encryption key, so it is suitable for delegated quantum computing between two parties.

  3. Call Admission Control Scheme Based on Statistical Information

    NASA Astrophysics Data System (ADS)

    Fujiwara, Takayuki; Oki, Eiji; Shiomoto, Kohei

    A call admission control (CAC) scheme based on statistical information is proposed, called the statistical CAC scheme. A conventional scheme needs to manage session information for each link to update the residual bandwidth of a network in real time. This scheme has a scalability problem in terms of network size. The statistical CAC rejects session setup requests in accordance to a pre-computed ratio, called the rejection ratio. The rejection ratio is computed by using statistical information about the bandwidth requested for each link so that the congestion probability is less than an upper bound specified by a network operator. The statistical CAC is more scalable in terms of network size than the conventional scheme because it does not need to keep accommodated session state information. Numerical results show that the statistical CAC, even without exact session state information, only slightly degrades network utilization compared with the conventional scheme.

  4. Copyright protection scheme based on chaos and secret sharing techniques

    NASA Astrophysics Data System (ADS)

    Lou, Der-Chyuan; Shieh, Jieh-Ming; Tso, Hao-Kuan

    2005-11-01

    A copyright protection scheme based on chaos and secret sharing techniques is proposed. Instead of modifying the original image to embed a watermark in it, the proposed scheme extracts a feature from the image first. Then, the extracted feature and the watermark are scrambled by a chaos technique. Finally, the secret sharing technique is used to construct a shadow image. The watermark can be retrieved by performing an XOR operation between the shadow images. The proposed scheme has the following advantages. Firstly, the watermark retrieval does not need the original image. Secondly, the scheme does not need to modify the original image for embedding the watermark. Thirdly, compared with several schemes, the scheme is secure and robust in resisting various attacks.

  5. An Analysis of Shelf Space Allocation at the Wright-Patterson Air Force Base Commissary.

    DTIC Science & Technology

    1987-09-01

    techniques, the allocation of shelf space decisions differ. Management can get many different allocations, depending on the way the data are defined and tne...oe associated witn change in facings made during the reallocation. Population Tne population under study is defined as t.le daily sales of products in...the available space will be allocated equally among the products based on turnover ratio. Turnover is defined as product sold divided by product

  6. Comparison of two SVD-based color image compression schemes.

    PubMed

    Li, Ying; Wei, Musheng; Zhang, Fengxia; Zhao, Jianli

    2017-01-01

    Color image compression is a commonly used process to represent image data as few bits as possible, which removes redundancy in the data while maintaining an appropriate level of quality for the user. Color image compression algorithms based on quaternion are very common in recent years. In this paper, we propose a color image compression scheme, based on the real SVD, named real compression scheme. First, we form a new real rectangular matrix C according to the red, green and blue components of the original color image and perform the real SVD for C. Then we select several largest singular values and the corresponding vectors in the left and right unitary matrices to compress the color image. We compare the real compression scheme with quaternion compression scheme by performing quaternion SVD using the real structure-preserving algorithm. We compare the two schemes in terms of operation amount, assignment number, operation speed, PSNR and CR. The experimental results show that with the same numbers of selected singular values, the real compression scheme offers higher CR, much less operation time, but a little bit smaller PSNR than the quaternion compression scheme. When these two schemes have the same CR, the real compression scheme shows more prominent advantages both on the operation time and PSNR.

  7. Comparison of two SVD-based color image compression schemes

    PubMed Central

    Li, Ying; Wei, Musheng; Zhang, Fengxia; Zhao, Jianli

    2017-01-01

    Color image compression is a commonly used process to represent image data as few bits as possible, which removes redundancy in the data while maintaining an appropriate level of quality for the user. Color image compression algorithms based on quaternion are very common in recent years. In this paper, we propose a color image compression scheme, based on the real SVD, named real compression scheme. First, we form a new real rectangular matrix C according to the red, green and blue components of the original color image and perform the real SVD for C. Then we select several largest singular values and the corresponding vectors in the left and right unitary matrices to compress the color image. We compare the real compression scheme with quaternion compression scheme by performing quaternion SVD using the real structure-preserving algorithm. We compare the two schemes in terms of operation amount, assignment number, operation speed, PSNR and CR. The experimental results show that with the same numbers of selected singular values, the real compression scheme offers higher CR, much less operation time, but a little bit smaller PSNR than the quaternion compression scheme. When these two schemes have the same CR, the real compression scheme shows more prominent advantages both on the operation time and PSNR. PMID:28257451

  8. A FRACTAL-BASED STOCHASTIC INTERPOLATION SCHEME IN SUBSURFACE HYDROLOGY

    EPA Science Inventory

    The need for a realistic and rational method for interpolating sparse data sets is widespread. Real porosity and hydraulic conductivity data do not vary smoothly over space, so an interpolation scheme that preserves irregularity is desirable. Such a scheme based on the properties...

  9. Random property allocation: A novel geographic imputation procedure based on a complete geocoded address file.

    PubMed

    Walter, Scott R; Rose, Nectarios

    2013-09-01

    Allocating an incomplete address to randomly selected property coordinates within a locality, known as random property allocation, has many advantages over other geoimputation techniques. We compared the performance of random property allocation to four other methods under various conditions using a simulation approach. All methods performed well for large spatial units, but random property allocation was the least prone to bias and error under volatile scenarios with small units and low prevalence. Both its coordinate based approach as well as the random process of assignment contribute to its increased accuracy and reduced bias in many scenarios. Hence it is preferable to fixed or areal geoimputation for many epidemiological and surveillance applications.

  10. Utility-based uplink joint power and subcarrier allocation in SC-FDMA wireless networks

    NASA Astrophysics Data System (ADS)

    Eleni Tsiropoulou, Eirini; Papavassiliou, Symeon

    2011-11-01

    In this letter, the problem of optimal joint uplink power and subcarrier allocation in single-carrier frequency-division multiple access wireless networks with real-time services is addressed, via the introduction and adoption of a utility-based framework. A joint optimisation power and subcarrier allocation problem is formulated and the optimal power allocation is determined, while an iterative algorithm to realise the joint allocation is presented. Finally, numerical results are provided that demonstrate the effectiveness of the proposed approach in terms of power savings and user satisfaction.

  11. A Proxy Signature Scheme Based on Coding Theory

    NASA Astrophysics Data System (ADS)

    Jannati, Hoda; Falahati, Abolfazl

    Proxy signature helps the proxy signer to sign messages on behalf of the original signer. This signature is used when the original signer is not available to sign a specific document. In this paper, we introduce a new proxy signature scheme based on Stern's identification scheme whose security depends on syndrome decoding problem. The proposed scheme is the first code-based proxy signature and can be used in a quantum computer. In this scheme, the operations to perform are linear and very simple thus the signature is performed quickly and can be implemented using smart card in a quite efficient way. The proposed scheme also satisfies unforgeability, undeniability, non-transferability and distinguishability properties which are the security requirements for a proxy signature.

  12. Evidence-based medicine: a new tool for resource allocation?

    PubMed

    Nunes, Rui

    2003-01-01

    Evidence-Based Medicine (EBM) is defined as the conscious, and judicious use of current best evidence in making decisions about the care of individual patients. The greater the level of evidence the greater the grade of recommendation. This pioneering explicit concept of EBM is embedded in a particular view of medical practice namely the singular nature of the patient-physician relation and the commitment of the latter towards a specific goal: the treatment and the well being of his or her client. Nevertheless, in many European countries as well as in the United States, this "integration of the best evidence from systematic research with clinical expertise and patient values" appears to be re-interpreted in light of the scarcity of healthcare resources. The purpose of this paper is double. First, to claim that from an ethical perspective EBM should be a guideline to clinical practice; and second, that in specific circumstances EBM might be a useful tool in macro-allocation of healthcare resources. Methodologically the author follows Norman Daniels' theory of "democratic accountability" to justify this assumption. That is, choices in healthcare must be accountable by democratic procedures. This perspective of distributive justice is responsible for the scope and limits of healthcare services. It follows that particular entitlements to healthcare--namely expensive innovative treatments and medicines--may be fairly restricted as long as this decision is socially and democratically accountable and imposed by financial restrictions of the system. In conclusion, the implementation of EBM, as long as it limits the access to drugs and treatments of unproven scientific results is in accordance with this perspective. The use of EBM is regarded as an instrument to facilitate the access of all citizens to a reasonable level of healthcare and to promote the efficiency of the system.

  13. Triangle based TVD schemes for hyperbolic conservation laws

    NASA Technical Reports Server (NTRS)

    Durlofsky, Louis J.; Osher, Stanley; Engquist, Bjorn

    1990-01-01

    A triangle based total variation diminishing (TVD) scheme for the numerical approximation of hyperbolic conservation laws in two space dimensions is constructed. The novelty of the scheme lies in the nature of the preprocessing of the cell averaged data, which is accomplished via a nearest neighbor linear interpolation followed by a slope limiting procedures. Two such limiting procedures are suggested. The resulting method is considerably more simple than other triangle based non-oscillatory approximations which, like this scheme, approximate the flux up to second order accuracy. Numerical results for linear advection and Burgers' equation are presented.

  14. Splitting based finite volume schemes for ideal MHD equations

    NASA Astrophysics Data System (ADS)

    Fuchs, F. G.; Mishra, S.; Risebro, N. H.

    2009-02-01

    We design finite volume schemes for the equations of ideal magnetohydrodynamics (MHD) and based on splitting these equations into a fluid part and a magnetic induction part. The fluid part leads to an extended Euler system with magnetic forces as source terms. This set of equations are approximated by suitable two- and three-wave HLL solvers. The magnetic part is modeled by the magnetic induction equations which are approximated using stable upwind schemes devised in a recent paper [F. Fuchs, K.H. Karlsen, S. Mishra, N.H. Risebro, Stable upwind schemes for the Magnetic Induction equation. Math. Model. Num. Anal., Available on conservation laws preprint server, submitted for publication, URL: ]. These two sets of schemes can be combined either component by component, or by using an operator splitting procedure to obtain a finite volume scheme for the MHD equations. The resulting schemes are simple to design and implement. These schemes are compared with existing HLL type and Roe type schemes for MHD equations in a series of numerical experiments. These tests reveal that the proposed schemes are robust and have a greater numerical resolution than HLL type solvers, particularly in several space dimensions. In fact, the numerical resolution is comparable to that of the Roe scheme on most test problems with the computational cost being at the level of a HLL type solver. Furthermore, the schemes are remarkably stable even at very fine mesh resolutions and handle the divergence constraint efficiently with low divergence errors.

  15. An expert system based intelligent control scheme for space bioreactors

    NASA Technical Reports Server (NTRS)

    San, Ka-Yiu

    1988-01-01

    An expert system based intelligent control scheme is being developed for the effective control and full automation of bioreactor systems in space. The scheme developed will have the capability to capture information from various resources including heuristic information from process researchers and operators. The knowledge base of the expert system should contain enough expertise to perform on-line system identification and thus be able to adapt the controllers accordingly with minimal human supervision.

  16. Classification Based on Tree-Structured Allocation Rules

    ERIC Educational Resources Information Center

    Vaughn, Brandon K.; Wang, Qui

    2008-01-01

    The authors consider the problem of classifying an unknown observation into 1 of several populations by using tree-structured allocation rules. Although many parametric classification procedures are robust to certain assumption violations, there is need for classification procedures that can be used regardless of the group-conditional…

  17. Dropping out of Ethiopia's community-based health insurance scheme.

    PubMed

    Mebratie, Anagaw D; Sparrow, Robert; Yilma, Zelalem; Alemu, Getnet; Bedi, Arjun S

    2015-12-01

    Low contract renewal rates have been identified as one of the challenges facing the development of community-based health insurance (CBHI) schemes. This article uses longitudinal household survey data gathered in 2012 and 2013 to examine dropout in the case of Ethiopia's pilot CBHI scheme. We treat dropout as a function of scheme affordability, health status, scheme understanding and quality of care. The scheme saw enrolment increase from 41% 1 year after inception to 48% a year later. An impressive 82% of those who enrolled in the first year renewed their subscriptions, while 25% who had not enrolled joined the scheme. The analysis shows that socioeconomic status, a greater understanding of health insurance and experience with and knowledge of the CBHI scheme are associated with lower dropout rates. While there are concerns about the quality of care and the treatment meted out to the insured by providers, the overall picture is that returns from the scheme are overwhelmingly positive. For the bulk of households, premiums do not seem to be onerous, basic understanding of health insurance is high and almost all those who are currently enrolled signalled their desire to renew contracts.

  18. Impact-Based Area Allocation for Yield Optimization in Integrated Circuits

    NASA Astrophysics Data System (ADS)

    Abraham, Billion; Widodo, Arif; Chen, Poki

    2016-06-01

    In analog integrated circuit (IC) layout, area allocation is a very important issue for achieving good mismatch cancellation. However, most IC layout papers focus only on layout strategy to reduce systematic mismatch. In 2006, an outstanding paper presenting area allocation strategy was published to introduce technique for random mismatch reduction. Instead of using general theoretical study to prove the strategy, this research presented close-to-optimum simulations only on case-bycase basis. The impact-based area allocation for yield optimization in integrated circuits is proposed in this chapter. To demonstrate the corresponding strategy, not only a theoretical analysis but also an integral nonlinearity-based yield simulation will be given to derive optimum area allocation for binary weighted current steering digital-to-analog converter (DAC). The result will be concluded to convince IC designers how to allocate area for critical devices in an optimum way.

  19. Rate Adaptive Based Resource Allocation with Proportional Fairness Constraints in OFDMA Systems.

    PubMed

    Yin, Zhendong; Zhuang, Shufeng; Wu, Zhilu; Ma, Bo

    2015-09-25

    Orthogonal frequency division multiple access (OFDMA), which is widely used in the wireless sensor networks, allows different users to obtain different subcarriers according to their subchannel gains. Therefore, how to assign subcarriers and power to different users to achieve a high system sum rate is an important research area in OFDMA systems. In this paper, the focus of study is on the rate adaptive (RA) based resource allocation with proportional fairness constraints. Since the resource allocation is a NP-hard and non-convex optimization problem, a new efficient resource allocation algorithm ACO-SPA is proposed, which combines ant colony optimization (ACO) and suboptimal power allocation (SPA). To reduce the computational complexity, the optimization problem of resource allocation in OFDMA systems is separated into two steps. For the first one, the ant colony optimization algorithm is performed to solve the subcarrier allocation. Then, the suboptimal power allocation algorithm is developed with strict proportional fairness, and the algorithm is based on the principle that the sums of power and the reciprocal of channel-to-noise ratio for each user in different subchannels are equal. To support it, plenty of simulation results are presented. In contrast with root-finding and linear methods, the proposed method provides better performance in solving the proportional resource allocation problem in OFDMA systems.

  20. Rate Adaptive Based Resource Allocation with Proportional Fairness Constraints in OFDMA Systems

    PubMed Central

    Yin, Zhendong; Zhuang, Shufeng; Wu, Zhilu; Ma, Bo

    2015-01-01

    Orthogonal frequency division multiple access (OFDMA), which is widely used in the wireless sensor networks, allows different users to obtain different subcarriers according to their subchannel gains. Therefore, how to assign subcarriers and power to different users to achieve a high system sum rate is an important research area in OFDMA systems. In this paper, the focus of study is on the rate adaptive (RA) based resource allocation with proportional fairness constraints. Since the resource allocation is a NP-hard and non-convex optimization problem, a new efficient resource allocation algorithm ACO-SPA is proposed, which combines ant colony optimization (ACO) and suboptimal power allocation (SPA). To reduce the computational complexity, the optimization problem of resource allocation in OFDMA systems is separated into two steps. For the first one, the ant colony optimization algorithm is performed to solve the subcarrier allocation. Then, the suboptimal power allocation algorithm is developed with strict proportional fairness, and the algorithm is based on the principle that the sums of power and the reciprocal of channel-to-noise ratio for each user in different subchannels are equal. To support it, plenty of simulation results are presented. In contrast with root-finding and linear methods, the proposed method provides better performance in solving the proportional resource allocation problem in OFDMA systems. PMID:26426016

  1. High order accurate finite difference schemes based on symmetry preservation

    NASA Astrophysics Data System (ADS)

    Ozbenli, Ersin; Vedula, Prakash

    2016-11-01

    A new algorithm for development of high order accurate finite difference schemes for numerical solution of partial differential equations using Lie symmetries is presented. Considering applicable symmetry groups (such as those relevant to space/time translations, Galilean transformation, scaling, rotation and projection) of a partial differential equation, invariant numerical schemes are constructed based on the notions of moving frames and modified equations. Several strategies for construction of invariant numerical schemes with a desired order of accuracy are analyzed. Performance of the proposed algorithm is demonstrated using analysis of one-dimensional partial differential equations, such as linear advection diffusion equations inviscid Burgers equation and viscous Burgers equation, as our test cases. Through numerical simulations based on these examples, the expected improvement in accuracy of invariant numerical schemes (up to fourth order) is demonstrated. Advantages due to implementation and enhanced computational efficiency inherent in our proposed algorithm are presented. Extension of the basic framework to multidimensional partial differential equations is also discussed.

  2. A dynamic programming approach to water allocation for seasonally dry area, based on stochastic soil moisture

    NASA Astrophysics Data System (ADS)

    Lu, Z.; Porporato, A. M.

    2012-12-01

    seasonally dry areas, which are widely distributed in the world, are usually facing an intensive disparity between the lack of natural resource and the great demand of social development. In dry seasons of such areas, the distribution/allocation of water resource is an extremely critical and sensitive issue, and conflicts often occur due to lack of appropriate water allocation scheme. Among the many uses of water, the need of agricultural irrigation water is highly elastic, but this factor has not yet been made full use to free up water from agriculture use. The primary goal of this work is to design an optimal distribution scheme of water resource for dry seasons to maximize benefits from precious water resources, considering the high elasticity of agriculture water demand due to the dynamic of soil moisture affected by the uncertainty of precipitation and other factors like canopy interception. A dynamic programming model will be used to figure out an appropriate allocation of water resources among agricultural irrigation and other purposes like drinking water, industry, and hydropower, etc. In this dynamic programming model, we analytically quantify the dynamic of soil moisture in the agricultural fields by describing the interception with marked Poisson process and describing the rainfall depth with exponential distribution. Then, we figure out a water-saving irrigation scheme, which regulates the timetable and volumes of water in irrigation, in order to minimize irrigation water requirement under the premise of necessary crop yield (as a constraint condition). And then, in turn, we provide a scheme of water resource distribution/allocation among agriculture and other purposes, taking aim at maximizing benefits from precious water resources, or in other words, make best use of limited water resource.

  3. On System Engineering a Barter-Based Re-allocation of Space System Key Development Resources

    NASA Astrophysics Data System (ADS)

    Kosmann, William J.

    NASA has had a decades-long problem with cost growth during the development of space science missions. Numerous agency-sponsored studies have produced average mission level development cost growths ranging from 23 to 77%. A new study of 26 historical NASA science instrument set developments using expert judgment to re-allocate key development resources has an average cost growth of 73.77%. Twice in history, during the Cassini and EOS-Terra science instrument developments, a barter-based mechanism has been used to re-allocate key development resources. The mean instrument set development cost growth was -1.55%. Performing a bivariate inference on the means of these two distributions, there is statistical evidence to support the claim that using a barter-based mechanism to re-allocate key instrument development resources will result in a lower expected cost growth than using the expert judgment approach. Agent-based discrete event simulation is the natural way to model a trade environment. A NetLogo agent-based barter-based simulation of science instrument development was created. The agent-based model was validated against the Cassini historical example, as the starting and ending instrument development conditions are available. The resulting validated agent-based barter-based science instrument resource re-allocation simulation was used to perform 300 instrument development simulations, using barter to re-allocate development resources. The mean cost growth was -3.365%. A bivariate inference on the means was performed to determine that additional significant statistical evidence exists to support a claim that using barter-based resource re-allocation will result in lower expected cost growth, with respect to the historical expert judgment approach. Barter-based key development resource re-allocation should work on science spacecraft development as well as it has worked on science instrument development. A new study of 28 historical NASA science spacecraft

  4. Measuring health indicators and allocating health resources: a DEA-based approach.

    PubMed

    Yang, Chih-Ching

    2016-02-03

    This paper suggests new empirical DEA models for the measurement of health indicators and the allocation of health resources. The proposed models were developed by first suggesting a population-based health indicator. By introducing the suggested indicator into DEA models, a new approach that solves the problem of health resource allocation has been developed. The proposed models are applied to an empirical study of Taiwan's health system. Empirical findings show that the suggested indicator can successfully accommodate the differences in health resource demands between populations, providing more reliable performance information than traditional indicators such as physician density. Using our models and a commonly used allocation mechanism, capitation, to allocate medical expenditures, it is found that the proposed model always obtains higher performance than those derived from capitation, and the superiority increases as allocated expenditures rise.

  5. Neural Network Based Modeling and Analysis of LP Control Surface Allocation

    NASA Technical Reports Server (NTRS)

    Langari, Reza; Krishnakumar, Kalmanje; Gundy-Burlet, Karen

    2003-01-01

    This paper presents an approach to interpretive modeling of LP based control allocation in intelligent flight control. The emphasis is placed on a nonlinear interpretation of the LP allocation process as a static map to support analytical study of the resulting closed loop system, albeit in approximate form. The approach makes use of a bi-layer neural network to capture the essential functioning of the LP allocation process. It is further shown via Lyapunov based analysis that under certain relatively mild conditions the resulting closed loop system is stable. Some preliminary conclusions from a study at Ames are stated and directions for further research are given at the conclusion of the paper.

  6. Dynamic Channel Allocation

    DTIC Science & Technology

    2003-09-01

    7 1 . Fixed Channel Allocation (FCA) ........................................................7 2. Dynamic Channel ...19 7. CSMA/CD-Based Multiple Network Lines .....................................20 8. Hybrid Channel Allocation in Wireless Networks...28 1 . Channel Allocation

  7. Edge-based finite element scheme for the Euler equations

    NASA Astrophysics Data System (ADS)

    Luo, Hong; Baum, Joseph D.; Loehner, Rainald

    1994-06-01

    This paper describes the development, validation, and application of a new finite element scheme for the solution of the compressible Euler equations on unstructured grids. The implementation of the numerical scheme is based on an edge-based data structure, as opposed to a more element-based data structure. The use of this edge-based data structure not only improves the efficiency of the algorithm but also enables a straightforward implementation of the upwind schemes in the context of finite element methods. The algorithm has been tested and validated on some well documented configurations. A flow solution about a complete F-18 fighter is shown to demonstrate the accuracy and robustness of the proposed algorithm.

  8. Edge-based finite element scheme for the Euler equations

    NASA Astrophysics Data System (ADS)

    Luo, Hong; Baum, Joseph D.; Lohner, Rainald

    1994-06-01

    This paper describes the development, validation, and application of a new finite element scheme for the solution of the compressible Euler equations on unstructured grids. The implementation of the numerical scheme is based on an edge-based data structure, as opposed to a more traditional element-based data structure. The use of this edge-based data structure not only improves the efficiency of the algorithm but also enables a straightforward implementation of upwind schemes in the context of finite element methods. The algorithm has been tested and validated on some well-documented configurations. A flow solution about a complete F-18 fighter is shown to demonstrate the accuracy and robustness of the proposed algorithm.

  9. Packet Forwarding Scheme Based on Interworking Architecture for Future Internet

    NASA Astrophysics Data System (ADS)

    Kim, Seokhoon; Ryoo, Intae

    This paper introduces a packet forwarding scheme based on interworking architecture that can provide quite a good QoS by minimizing processing delay which is the major part of the timeliness factor in New Generation IP-based networks. Based on path and resource reservation mechanism, the POSIA makes routers on the packet forwarding path synchronize with each other and then forward packets. We have shown that the POSIA outperforms the existing packet forwarding schemes like IntServ, DiffServ and MPLS through computer simulations using OPNET.

  10. Web based tool for resource allocation in multiple mass casualty incidents.

    PubMed

    Inampudi, Venkata S; Ganz, Aura

    2009-01-01

    In this paper we introduce a web based real time resource allocation tool that can assist the incident commanders and resource managers in the complex task of resource allocation and transportation for multiple simultaneous incidents that occur in close geographical proximity. The tool takes real time inputs like the location of emergency sites and damaged routes from Google Maps, generates an optimal transportation plan so that emergency sites with highest priorities for a resource are assigned the resources in the least amount of time. The optimal solution is presented graphically using Google Maps. Our solution can be used for emergency resource allocation at both the initial response stage and later stages.

  11. Adaptive PCA based fault diagnosis scheme in imperial smelting process.

    PubMed

    Hu, Zhikun; Chen, Zhiwen; Gui, Weihua; Jiang, Bin

    2014-09-01

    In this paper, an adaptive fault detection scheme based on a recursive principal component analysis (PCA) is proposed to deal with the problem of false alarm due to normal process changes in real process. Our further study is also dedicated to develop a fault isolation approach based on Generalized Likelihood Ratio (GLR) test and Singular Value Decomposition (SVD) which is one of general techniques of PCA, on which the off-set and scaling fault can be easily isolated with explicit off-set fault direction and scaling fault classification. The identification of off-set and scaling fault is also applied. The complete scheme of PCA-based fault diagnosis procedure is proposed. The proposed scheme is first applied to Imperial Smelting Process, and the results show that the proposed strategies can be able to mitigate false alarms and isolate faults efficiently.

  12. Antenna allocation in MIMO radar with widely separated antennas for multi-target detection.

    PubMed

    Gao, Hao; Wang, Jian; Jiang, Chunxiao; Zhang, Xudong

    2014-10-27

    In this paper, we explore a new resource called multi-target diversity to optimize the performance of multiple input multiple output (MIMO) radar with widely separated antennas for detecting multiple targets. In particular, we allocate antennas of the MIMO radar to probe different targets simultaneously in a flexible manner based on the performance metric of relative entropy. Two antenna allocation schemes are proposed. In the first scheme, each antenna is allocated to illuminate a proper target over the entire illumination time, so that the detection performance of each target is guaranteed. The problem is formulated as a minimum makespan scheduling problem in the combinatorial optimization framework. Antenna allocation is implemented through a branch-and-bound algorithm and an enhanced factor 2 algorithm. In the second scheme, called antenna-time allocation, each antenna is allocated to illuminate different targets with different illumination time. Both antenna allocation and time allocation are optimized based on illumination probabilities. Over a large range of transmitted power, target fluctuations and target numbers, both of the proposed antenna allocation schemes outperform the scheme without antenna allocation. Moreover, the antenna-time allocation scheme achieves a more robust detection performance than branch-and-bound algorithm and the enhanced factor 2 algorithm when the target number changes.

  13. Improved Readout Scheme for SQUID-Based Thermometry

    NASA Technical Reports Server (NTRS)

    Penanen, Konstantin

    2007-01-01

    An improved readout scheme has been proposed for high-resolution thermometers, (HRTs) based on the use of superconducting quantum interference devices (SQUIDs) to measure temperature- dependent magnetic susceptibilities. The proposed scheme would eliminate counting ambiguities that arise in the conventional scheme, while maintaining the superior magnetic-flux sensitivity of the conventional scheme. The proposed scheme is expected to be especially beneficial for HRT-based temperature control of multiplexed SQUIDbased bolometer sensor arrays. SQUID-based HRTs have become standard for measuring and controlling temperatures in the sub-nano-Kelvin temperature range in a broad range of low-temperature scientific and engineering applications. A typical SQUIDbased HRT that utilizes the conventional scheme includes a coil wound on a core made of a material that has temperature- dependent magnetic susceptibility in the temperature range of interest. The core and the coil are placed in a DC magnetic field provided either by a permanent magnet or as magnetic flux inside a superconducting outer wall. The aforementioned coil is connected to an input coil of a SQUID. Changes in temperature lead to changes in the susceptibility of the core and to changes in the magnetic flux detected by the SQUID. The SQUID readout instrumentation is capable of measuring magnetic-flux changes that correspond to temperature changes down to a noise limit .0.1 nK/Hz1/2. When the flux exceeds a few fundamental flux units, which typically corresponds to a temperature of .100 nK, the SQUID is reset. The temperature range can be greatly expanded if the reset events are carefully tracked and counted, either by a computer running appropriate software or by a dedicated piece of hardware.

  14. FOR Allocation to Distribution Systems based on Credible Improvement Potential (CIP)

    NASA Astrophysics Data System (ADS)

    Tiwary, Aditya; Arya, L. D.; Arya, Rajesh; Choube, S. C.

    2017-02-01

    This paper describes an algorithm for forced outage rate (FOR) allocation to each section of an electrical distribution system subject to satisfaction of reliability constraints at each load point. These constraints include threshold values of basic reliability indices, for example, failure rate, interruption duration and interruption duration per year at load points. Component improvement potential measure has been used for FOR allocation. Component with greatest magnitude of credible improvement potential (CIP) measure is selected for improving reliability performance. The approach adopted is a monovariable method where one component is selected for FOR allocation and in the next iteration another component is selected for FOR allocation based on the magnitude of CIP. The developed algorithm is implemented on sample radial distribution system.

  15. Block-based adaptive lifting schemes for multiband image compression

    NASA Astrophysics Data System (ADS)

    Masmoudi, Hela; Benazza-Benyahia, Amel; Pesquet, Jean-Christophe

    2004-02-01

    In this paper, we are interested in designing lifting schemes adapted to the statistics of the wavelet coefficients of multiband images for compression applications. More precisely, nonseparable vector lifting schemes are used in order to capture simultaneously the spatial and the spectral redundancies. The underlying operators are then computed in order to minimize the entropy of the resulting multiresolution representation. To this respect, we have developed a new iterative block-based classification algorithm. Simulation tests carried out on remotely sensed multispectral images indicate that a substantial gain in terms of bit-rate is achieved by the proposed adaptive coding method w.r.t the non-adaptive one.

  16. A second order derivative scheme based on Bregman algorithm class

    NASA Astrophysics Data System (ADS)

    Campagna, Rosanna; Crisci, Serena; Cuomo, Salvatore; Galletti, Ardelio; Marcellino, Livia

    2016-10-01

    The algorithms based on the Bregman iterative regularization are known for efficiently solving convex constraint optimization problems. In this paper, we introduce a second order derivative scheme for the class of Bregman algorithms. Its properties of convergence and stability are investigated by means of numerical evidences. Moreover, we apply the proposed scheme to an isotropic Total Variation (TV) problem arising out of the Magnetic Resonance Image (MRI) denoising. Experimental results confirm that our algorithm has good performance in terms of denoising quality, effectiveness and robustness.

  17. A privacy authentication scheme based on cloud for medical environment.

    PubMed

    Chen, Chin-Ling; Yang, Tsai-Tung; Chiang, Mao-Lun; Shih, Tzay-Farn

    2014-11-01

    With the rapid development of the information technology, the health care technologies already became matured. Such as electronic medical records that can be easily stored. However, how to get medical resources more convenient is currently concerning issue. In spite of many literatures discussed about medical systems, these literatures should face many security challenges. The most important issue is patients' privacy. Therefore, we propose a privacy authentication scheme based on cloud environment. In our scheme, we use mobile device's characteristics, allowing peoples to use medical resources on the cloud environment to find medical advice conveniently. The digital signature is used to ensure the security of the medical information that is certified by the medical department in our proposed scheme.

  18. New optical scheme for a polarimetric-based glucose sensor

    NASA Technical Reports Server (NTRS)

    Ansari, Rafat R.; Bockle, Stefan; Rovati, Luigi

    2004-01-01

    A new optical scheme to detect glucose concentration in the aqueous humor of the eye is presented. The ultimate aim is to apply this technique in designing a new instrument for, routinely and frequently, noninvasively monitoring blood glucose levels in diabetic patients without contact (no index matching) between the eye and the instrument. The optical scheme exploits the Brewster reflection of circularly polarized light off of the lens of the eye. Theoretically, this reflected linearly polarized light on its way to the detector is expected to rotate its state of polarization, owing to the presence of glucose molecules in the aqueous humor of a patient's eye. An experimental laboratory setup based on this scheme was designed and tested by measuring a range of known concentrations of glucose solutions dissolved in water. (c) 2004 Society of Photo-Optical Instrumentation Engineers.

  19. An ICA based MIMO-OFDM VLC scheme

    NASA Astrophysics Data System (ADS)

    Jiang, Fangqing; Deng, Honggui; Xiao, Wei; Tao, Shaohua; Zhu, Kaicheng

    2015-07-01

    In this paper, we propose a novel ICA based MIMO-OFDM VLC scheme, where ICA is applied to convert the MIMO-OFDM channel into several SISO-OFDM channels to reduce computational complexity in channel estimation, without any spectral overhead. Besides, the FM is first investigated to further modulate the OFDM symbols to eliminate the correlation of the signals, so as to improve the separation performance of the ICA algorithm. In the 4×4MIMO-OFDM VLC simulation experiment, LOS path and NLOS paths are both considered, each transmitting signal at 100 Mb/s. Simulation results show that the BER of the proposed scheme reaches the 10-5 level at SNR=20 dB, which is a large improvement compared to the traditional schemes.

  20. A trust-based sensor allocation algorithm in cooperative space search problems

    NASA Astrophysics Data System (ADS)

    Shen, Dan; Chen, Genshe; Pham, Khanh; Blasch, Erik

    2011-06-01

    Sensor allocation is an important and challenging problem within the field of multi-agent systems. The sensor allocation problem involves deciding how to assign a number of targets or cells to a set of agents according to some allocation protocol. Generally, in order to make efficient allocations, we need to design mechanisms that consider both the task performers' costs for the service and the associated probability of success (POS). In our problem, the costs are the used sensor resource, and the POS is the target tracking performance. Usually, POS may be perceived differently by different agents because they typically have different standards or means of evaluating the performance of their counterparts (other sensors in the search and tracking problem). Given this, we turn to the notion of trust to capture such subjective perceptions. In our approach, we develop a trust model to construct a novel mechanism that motivates sensor agents to limit their greediness or selfishness. Then we model the sensor allocation optimization problem with trust-in-loop negotiation game and solve it using a sub-game perfect equilibrium. Numerical simulations are performed to demonstrate the trust-based sensor allocation algorithm in cooperative space situation awareness (SSA) search problems.

  1. Image classification based on scheme of principal node analysis

    NASA Astrophysics Data System (ADS)

    Yang, Feng; Ma, Zheng; Xie, Mei

    2016-11-01

    This paper presents a scheme of principal node analysis (PNA) with the aim to improve the representativeness of the learned codebook so as to enhance the classification rate of scene image. Original images are normalized into gray ones and the scale-invariant feature transform (SIFT) descriptors are extracted from each image in the preprocessing stage. Then, the PNA-based scheme is applied to the SIFT descriptors with iteration and selection algorithms. The principal nodes of each image are selected through spatial analysis of the SIFT descriptors with Manhattan distance (L1 norm) and Euclidean distance (L2 norm) in order to increase the representativeness of the codebook. With the purpose of evaluating the performance of our scheme, the feature vector of the image is calculated by two baseline methods after the codebook is constructed. The L1-PNA- and L2-PNA-based baseline methods are tested and compared with different scales of codebooks over three public scene image databases. The experimental results show the effectiveness of the proposed scheme of PNA with a higher categorization rate.

  2. Developing Subdomain Allocation Algorithms Based on Spatial and Communicational Constraints to Accelerate Dust Storm Simulation

    PubMed Central

    Gui, Zhipeng; Yu, Manzhu; Yang, Chaowei; Jiang, Yunfeng; Chen, Songqing; Xia, Jizhe; Huang, Qunying; Liu, Kai; Li, Zhenlong; Hassan, Mohammed Anowarul; Jin, Baoxuan

    2016-01-01

    Dust storm has serious disastrous impacts on environment, human health, and assets. The developments and applications of dust storm models have contributed significantly to better understand and predict the distribution, intensity and structure of dust storms. However, dust storm simulation is a data and computing intensive process. To improve the computing performance, high performance computing has been widely adopted by dividing the entire study area into multiple subdomains and allocating each subdomain on different computing nodes in a parallel fashion. Inappropriate allocation may introduce imbalanced task loads and unnecessary communications among computing nodes. Therefore, allocation is a key factor that may impact the efficiency of parallel process. An allocation algorithm is expected to consider the computing cost and communication cost for each computing node to minimize total execution time and reduce overall communication cost for the entire simulation. This research introduces three algorithms to optimize the allocation by considering the spatial and communicational constraints: 1) an Integer Linear Programming (ILP) based algorithm from combinational optimization perspective; 2) a K-Means and Kernighan-Lin combined heuristic algorithm (K&K) integrating geometric and coordinate-free methods by merging local and global partitioning; 3) an automatic seeded region growing based geometric and local partitioning algorithm (ASRG). The performance and effectiveness of the three algorithms are compared based on different factors. Further, we adopt the K&K algorithm as the demonstrated algorithm for the experiment of dust model simulation with the non-hydrostatic mesoscale model (NMM-dust) and compared the performance with the MPI default sequential allocation. The results demonstrate that K&K method significantly improves the simulation performance with better subdomain allocation. This method can also be adopted for other relevant atmospheric and numerical

  3. Developing Subdomain Allocation Algorithms Based on Spatial and Communicational Constraints to Accelerate Dust Storm Simulation.

    PubMed

    Gui, Zhipeng; Yu, Manzhu; Yang, Chaowei; Jiang, Yunfeng; Chen, Songqing; Xia, Jizhe; Huang, Qunying; Liu, Kai; Li, Zhenlong; Hassan, Mohammed Anowarul; Jin, Baoxuan

    2016-01-01

    Dust storm has serious disastrous impacts on environment, human health, and assets. The developments and applications of dust storm models have contributed significantly to better understand and predict the distribution, intensity and structure of dust storms. However, dust storm simulation is a data and computing intensive process. To improve the computing performance, high performance computing has been widely adopted by dividing the entire study area into multiple subdomains and allocating each subdomain on different computing nodes in a parallel fashion. Inappropriate allocation may introduce imbalanced task loads and unnecessary communications among computing nodes. Therefore, allocation is a key factor that may impact the efficiency of parallel process. An allocation algorithm is expected to consider the computing cost and communication cost for each computing node to minimize total execution time and reduce overall communication cost for the entire simulation. This research introduces three algorithms to optimize the allocation by considering the spatial and communicational constraints: 1) an Integer Linear Programming (ILP) based algorithm from combinational optimization perspective; 2) a K-Means and Kernighan-Lin combined heuristic algorithm (K&K) integrating geometric and coordinate-free methods by merging local and global partitioning; 3) an automatic seeded region growing based geometric and local partitioning algorithm (ASRG). The performance and effectiveness of the three algorithms are compared based on different factors. Further, we adopt the K&K algorithm as the demonstrated algorithm for the experiment of dust model simulation with the non-hydrostatic mesoscale model (NMM-dust) and compared the performance with the MPI default sequential allocation. The results demonstrate that K&K method significantly improves the simulation performance with better subdomain allocation. This method can also be adopted for other relevant atmospheric and numerical

  4. Threshold secret sharing scheme based on phase-shifting interferometry.

    PubMed

    Deng, Xiaopeng; Shi, Zhengang; Wen, Wei

    2016-11-01

    We propose a new method for secret image sharing with the (3,N) threshold scheme based on phase-shifting interferometry. The secret image, which is multiplied with an encryption key in advance, is first encrypted by using Fourier transformation. Then, the encoded image is shared into N shadow images based on the recording principle of phase-shifting interferometry. Based on the reconstruction principle of phase-shifting interferometry, any three or more shadow images can retrieve the secret image, while any two or fewer shadow images cannot obtain any information of the secret image. Thus, a (3,N) threshold secret sharing scheme can be implemented. Compared with our previously reported method, the algorithm of this paper is suited for not only a binary image but also a gray-scale image. Moreover, the proposed algorithm can obtain a larger threshold value t. Simulation results are presented to demonstrate the feasibility of the proposed method.

  5. A Cartesian grid-based unified gas kinetic scheme

    NASA Astrophysics Data System (ADS)

    Chen, Songze; Xu, Kun

    2014-12-01

    A Cartesian grid-based unified gas kinetic scheme is developed. In this approach, any oriented boundary in a Cartesian grid is represented by many directional boundary points. The numerical flux is evaluated on each boundary point. Then, a boundary flux interpolation method (BFIM) is constructed to distribute the boundary effect to the flow evolution on regular Cartesian grid points. The BFIM provides a general strategy to implement any kind of boundary condition on Cartesian grid. The newly developed technique is implemented in the unified gas kinetic scheme, where the scheme is reformulated into a finite difference format. Several typical test cases are simulated with different geometries. For example, the thermophoresis phenomenon for a plate with infinitesimal thickness immersed in a rarefied flow environment is calculated under different orientations on the same Cartesian grid. These computational results validate the BFIM in the unified scheme for the capturing of different thermal boundary conditions. The BFIM can be extended to the moving boundary problems as well.

  6. Word Learning and Attention Allocation Based on Word Class and Category Knowledge

    ERIC Educational Resources Information Center

    Hupp, Julie M.

    2015-01-01

    Attention allocation in word learning may vary developmentally based on the novelty of the object. It has been suggested that children differentially learn verbs based on the novelty of the agent, but adults do not because they automatically infer the object's category and thus treat it like a familiar object. The current research examined…

  7. An Optimization Model for the Allocation of University Based Merit Aid

    ERIC Educational Resources Information Center

    Sugrue, Paul K.

    2010-01-01

    The allocation of merit-based financial aid during the college admissions process presents postsecondary institutions with complex and financially expensive decisions. This article describes the application of linear programming as a decision tool in merit based financial aid decisions at a medium size private university. The objective defined for…

  8. Enhancing Community Detection By Affinity-based Edge Weighting Scheme

    SciTech Connect

    Yoo, Andy; Sanders, Geoffrey; Henson, Van; Vassilevski, Panayot

    2015-10-05

    Community detection refers to an important graph analytics problem of finding a set of densely-connected subgraphs in a graph and has gained a great deal of interest recently. The performance of current community detection algorithms is limited by an inherent constraint of unweighted graphs that offer very little information on their internal community structures. In this paper, we propose a new scheme to address this issue that weights the edges in a given graph based on recently proposed vertex affinity. The vertex affinity quantifies the proximity between two vertices in terms of their clustering strength, and therefore, it is ideal for graph analytics applications such as community detection. We also demonstrate that the affinity-based edge weighting scheme can improve the performance of community detection algorithms significantly.

  9. Demographic and Socioeconomic Factors Influencing Public Attitudes Toward a Presumed Consent System for Organ Donation Without and With a Priority Allocation Scheme

    PubMed Central

    Tumin, Makmor; Tafran, Khaled; Mutalib, Muzalwana Abdul Talib @ Abdul; Satar, NurulHuda Mohd; Said, Saad Mohd; Adnan, Wan Ahmad Hafiz Wan Md; Lu, Yong Sook

    2015-01-01

    Abstract The influence of demographic and socioeconomic factors on the public's attitude towards a presumed consent system (PCS) of organ donation was estimated in 2 scenarios: without and with a priority allocation scheme (PAS). Self-administered questionnaires were completed by 775 respondents. Using multiple logistic regressions, respondents’ objections to donating organs in both scenarios were estimated. In total, 63.9% of respondents would object to donating under a PCS, whereas 54.6% would object under a PCS with a PAS. Respondents with pretertiary education were more likely to object than were respondents with tertiary education, in both the first (adjusted odds ratio [AOR] = 1.615) and second (AOR = 1.728) scenarios. Young respondents were less likely to object than were middle-aged respondents, in both the first (AOR = 0.648) and second (AOR = 0.572) scenarios. Respondents with mid-ranged personal monthly income were more likely to object than were respondents with low income, in both the first (AOR = 1.994) and second (AOR = 1.519) scenarios. It does not seem that Malaysia is ready to implement a PCS. The educational level, age, and income of the broader public should be considered if a PCS, without or with a PAS, is planned for implementation in Malaysia. PMID:26496282

  10. Research on multirobot pursuit task allocation algorithm based on emotional cooperation factor.

    PubMed

    Fang, Baofu; Chen, Lu; Wang, Hao; Dai, Shuanglu; Zhong, Qiubo

    2014-01-01

    Multirobot task allocation is a hot issue in the field of robot research. A new emotional model is used with the self-interested robot, which gives a new way to measure self-interested robots' individual cooperative willingness in the problem of multirobot task allocation. Emotional cooperation factor is introduced into self-interested robot; it is updated based on emotional attenuation and external stimuli. Then a multirobot pursuit task allocation algorithm is proposed, which is based on emotional cooperation factor. Combined with the two-step auction algorithm recruiting team leaders and team collaborators, set up pursuit teams, and finally use certain strategies to complete the pursuit task. In order to verify the effectiveness of this algorithm, some comparing experiments have been done with the instantaneous greedy optimal auction algorithm; the results of experiments show that the total pursuit time and total team revenue can be optimized by using this algorithm.

  11. Kinetic energy decomposition scheme based on information theory.

    PubMed

    Imamura, Yutaka; Suzuki, Jun; Nakai, Hiromi

    2013-12-15

    We proposed a novel kinetic energy decomposition analysis based on information theory. Since the Hirshfeld partitioning for electron densities can be formulated in terms of Kullback-Leibler information deficiency in information theory, a similar partitioning for kinetic energy densities was newly proposed. The numerical assessments confirm that the current kinetic energy decomposition scheme provides reasonable chemical pictures for ionic and covalent molecules, and can also estimate atomic energies using a correction with viral ratios.

  12. A public key encryption scheme based on idempotent semirings

    NASA Astrophysics Data System (ADS)

    Durcheva, Mariana; Rachev, Martin

    2015-11-01

    The problem of solving two sided linear equations in the idempotent semirings R¯m a x and R¯m i n has been proved to be reducible to the problem mean payoff game which is of the NP∩ coNP type. In the present paper, we use the mentioned security results and construct a new public key encryption scheme based on the hardness of the problem of solving two sided linear equations in the idempotent semirings.

  13. Revisiting Quantum Authentication Scheme Based on Entanglement Swapping

    NASA Astrophysics Data System (ADS)

    Naseri, Mosayeb

    2016-05-01

    The crucial issue of quantum communication protocol is its security. In this paper, the security of the Quantum Authentication Scheme Based on Entanglement Swapping proposed by Penghao et al. (Int J Theor Phys., doi: 10.1007/s10773-015-2662-7) is reanalyzed. It is shown that the original does not complete the task of quantum authentication and communication securely. Furthermore a simple improvement on the protocol is proposed.

  14. Energy-saving scheme based on downstream packet scheduling in ethernet passive optical networks

    NASA Astrophysics Data System (ADS)

    Zhang, Lincong; Liu, Yejun; Guo, Lei; Gong, Xiaoxue

    2013-03-01

    With increasing network sizes, the energy consumption of Passive Optical Networks (PONs) has grown significantly. Therefore, it is important to design effective energy-saving schemes in PONs. Generally, energy-saving schemes have focused on sleeping the low-loaded Optical Network Units (ONUs), which tends to bring large packet delays. Further, the traditional ONU sleep modes are not capable of sleeping the transmitter and receiver independently, though they are not required to transmit or receive packets. Clearly, this approach contributes to wasted energy. Thus, in this paper, we propose an Energy-Saving scheme that is based on downstream Packet Scheduling (ESPS) in Ethernet PON (EPON). First, we design both an algorithm and a rule for downstream packet scheduling at the inter- and intra-ONU levels, respectively, to reduce the downstream packet delay. After that, we propose a hybrid sleep mode that contains not only ONU deep sleep mode but also independent sleep modes for the transmitter and the receiver. This ensures that the energy consumed by the ONUs is minimal. To realize the hybrid sleep mode, a modified GATE control message is designed that involves 10 time points for sleep processes. In ESPS, the 10 time points are calculated according to the allocated bandwidths in both the upstream and the downstream. The simulation results show that ESPS outperforms traditional Upstream Centric Scheduling (UCS) scheme in terms of energy consumption and the average delay for both real-time and non-real-time packets downstream. The simulation results also show that the average energy consumption of each ONU in larger-sized networks is less than that in smaller-sized networks; hence, our ESPS is better suited for larger-sized networks.

  15. Efficient Allocation of Resources for Defense of Spatially Distributed Networks Using Agent-Based Simulation.

    PubMed

    Kroshl, William M; Sarkani, Shahram; Mazzuchi, Thomas A

    2015-09-01

    This article presents ongoing research that focuses on efficient allocation of defense resources to minimize the damage inflicted on a spatially distributed physical network such as a pipeline, water system, or power distribution system from an attack by an active adversary, recognizing the fundamental difference between preparing for natural disasters such as hurricanes, earthquakes, or even accidental systems failures and the problem of allocating resources to defend against an opponent who is aware of, and anticipating, the defender's efforts to mitigate the threat. Our approach is to utilize a combination of integer programming and agent-based modeling to allocate the defensive resources. We conceptualize the problem as a Stackelberg "leader follower" game where the defender first places his assets to defend key areas of the network, and the attacker then seeks to inflict the maximum damage possible within the constraints of resources and network structure. The criticality of arcs in the network is estimated by a deterministic network interdiction formulation, which then informs an evolutionary agent-based simulation. The evolutionary agent-based simulation is used to determine the allocation of resources for attackers and defenders that results in evolutionary stable strategies, where actions by either side alone cannot increase its share of victories. We demonstrate these techniques on an example network, comparing the evolutionary agent-based results to a more traditional, probabilistic risk analysis (PRA) approach. Our results show that the agent-based approach results in a greater percentage of defender victories than does the PRA-based approach.

  16. Adverse drug reactions: a hospital pharmacy-based reporting scheme.

    PubMed Central

    Winstanley, P A; Irvin, L E; Smith, J C; Orme, M L; Breckenridge, A M

    1989-01-01

    A pharmacy-based adverse drug reaction (ADR) reporting scheme, using pharmacists, nurses and medical practitioners as initiators of reports, was set up at the end of 1984 in the Royal Liverpool Hospital in order to encourage reporting. New reports were inspected at weekly intervals by a staff pharmacist, and a clinical pharmacologist. Reports were forwarded to the Committee on Safety of Medicines if the reaction was considered to be serious by the clinicians, or the ADR team or involved 'black triangle' drugs. The total number of ADR reports was increased eightfold by the introduction of the scheme (from 14 in 1984 to 76, 102 and 94 in 1985, 1986 and 1987 respectively), and this rate of reporting has been sustained. PMID:2775609

  17. Prediction-based association control scheme in dense femtocell networks

    PubMed Central

    Pham, Ngoc-Thai; Huynh, Thong; Hwang, Won-Joo; You, Ilsun; Choo, Kim-Kwang Raymond

    2017-01-01

    The deployment of large number of femtocell base stations allows us to extend the coverage and efficiently utilize resources in a low cost manner. However, the small cell size of femtocell networks can result in frequent handovers to the mobile user, and consequently throughput degradation. Thus, in this paper, we propose predictive association control schemes to improve the system’s effective throughput. Our design focuses on reducing handover frequency without impacting on throughput. The proposed schemes determine handover decisions that contribute most to the network throughput and are proper for distributed implementations. The simulation results show significant gains compared with existing methods in terms of handover frequency and network throughput perspective. PMID:28328992

  18. Link prediction in complex networks based on an information allocation index

    NASA Astrophysics Data System (ADS)

    Pei, Panpan; Liu, Bo; Jiao, Licheng

    2017-03-01

    An important issue in link prediction of complex networks is to make full use of different kinds of available information simultaneously. To tackle this issue, recently, an information-theoretic model has been proposed and a novel Neighbor Set Information Index (NSI) has been designed. Motivated by this work, we proposed a more general information-theoretic model by further distinguishing the contributions from different variables of the available features. Then, by introducing the resource allocation process into the model, we designed a new index based on neighbor sets with a virtual information allocation process: Neighbor Set Information Allocation Index(NSIA). Experimental studies on real world networks from disparate fields indicate that NSIA performs well compared with NSI as well as other typical proximity indices.

  19. An improved biometrics-based remote user authentication scheme with user anonymity.

    PubMed

    Khan, Muhammad Khurram; Kumari, Saru

    2013-01-01

    The authors review the biometrics-based user authentication scheme proposed by An in 2012. The authors show that there exist loopholes in the scheme which are detrimental for its security. Therefore the authors propose an improved scheme eradicating the flaws of An's scheme. Then a detailed security analysis of the proposed scheme is presented followed by its efficiency comparison. The proposed scheme not only withstands security problems found in An's scheme but also provides some extra features with mere addition of only two hash operations. The proposed scheme allows user to freely change his password and also provides user anonymity with untraceability.

  20. Design and implementation of priority and time-window based traffic scheduling and routing-spectrum allocation mechanism in elastic optical networks

    NASA Astrophysics Data System (ADS)

    Wang, Honghuan; Xing, Fangyuan; Yin, Hongxi; Zhao, Nan; Lian, Bizhan

    2016-02-01

    With the explosive growth of network services, the reasonable traffic scheduling and efficient configuration of network resources have an important significance to increase the efficiency of the network. In this paper, an adaptive traffic scheduling policy based on the priority and time window is proposed and the performance of this algorithm is evaluated in terms of scheduling ratio. The routing and spectrum allocation are achieved by using the Floyd shortest path algorithm and establishing a node spectrum resource allocation model based on greedy algorithm, which is proposed by us. The fairness index is introduced to improve the capability of spectrum configuration. The results show that the designed traffic scheduling strategy can be applied to networks with multicast and broadcast functionalities, and makes them get real-time and efficient response. The scheme of node spectrum configuration improves the frequency resource utilization and gives play to the efficiency of the network.

  1. Biometrics based authentication scheme for session initiation protocol.

    PubMed

    Xie, Qi; Tang, Zhixiong

    2016-01-01

    Many two-factor challenge-response based session initiation protocol (SIP) has been proposed, but most of them are vulnerable to smart card stolen attacks and password guessing attacks. In this paper, we propose a novel three-factor SIP authentication scheme using biometrics, password and smart card, and utilize the pi calculus-based formal verification tool ProVerif to prove that the proposed protocol achieves security and authentication. Furthermore, our protocol is highly efficient when compared to other related protocols.

  2. Intra-District Resource Allocation and Criteria Used for Student Based Funding in Urban School Districts

    ERIC Educational Resources Information Center

    Aloo, Peter Mangla

    2011-01-01

    Resource allocation to school sites in public school districts is inequitable. While Student Based Funding (SBF) has been implemented in several major urban school districts, there are few empirical studies about how SBF policies are derived and implemented. Current efforts to align resources with student need are hindered by a lack of systematic,…

  3. Dynamic resource allocation in a hierarchical multiprocessor system: A preliminary study

    NASA Technical Reports Server (NTRS)

    Ngai, Tin-Fook

    1986-01-01

    An integrated system approach to dynamic resource allocation is proposed. Some of the problems in dynamic resource allocation and the relationship of these problems to system structures are examined. A general dynamic resource allocation scheme is presented. A hierarchial system architecture which dynamically maps between processor structure and programs at multiple levels of instantiations is described. Simulation experiments were conducted to study dynamic resource allocation on the proposed system. Preliminary evaluation based on simple dynamic resource allocation algorithms indicates that with the proposed system approach, the complexity of dynamic resource management could be significantly reduced while achieving reasonable effective dynamic resource allocation.

  4. A global trait-based approach to estimate leaf nitrogen functional allocation from observations.

    PubMed

    Ghimire, Bardan; Riley, William J; Koven, Charles D; Kattge, Jens; Rogers, Alistair; Reich, Peter B; Wright, Ian J

    2017-03-28

    Nitrogen is one of the most important nutrients for plant growth and a major constituent of proteins that regulate photosynthetic and respiratory processes. However, a comprehensive global analysis of nitrogen allocation in leaves for major processes with respect to different plant functional types is currently lacking. This study integrated observations from global databases with photosynthesis and respiration models to determine plant-functional-type-specific allocation patterns of leaf nitrogen for photosynthesis (Rubisco, electron transport, light absorption) and respiration (growth and maintenance), and by difference from observed total leaf nitrogen, an unexplained "residual" nitrogen pool. Based on our analysis, crops partition the largest fraction of nitrogen to photosynthesis (57%) and respiration (5%) followed by herbaceous plants (44% and 4%). Tropical broadleaf evergreen trees partition the least to photosynthesis (25%) and respiration (2%) followed by needle-leaved evergreen trees (28% and 3%). In trees (especially needle-leaved evergreen and tropical broadleaf evergreen trees) a large fraction (70% and 73% respectively) of nitrogen was not explained by photosynthetic or respiratory functions. Compared to crops and herbaceous plants, this large residual pool is hypothesized to emerge from larger investments in cell wall proteins, lipids, amino acids, nucleic acid, CO2 fixation proteins (other than Rubisco), secondary compounds, and other proteins. Our estimates are different from previous studies due to differences in methodology and assumptions used in deriving nitrogen allocation estimates. Unlike previous studies, we integrate and infer nitrogen allocation estimates across multiple plant functional types, and report substantial differences in nitrogen allocation across different plant functional types. The resulting pattern of nitrogen allocation provides insights on mechanisms that operate at a cellular scale within leaves, and can be integrated

  5. A global trait-based approach to estimate leaf nitrogen functional allocation from observations

    DOE PAGES

    Ghimire, Bardan; Riley, William J.; Koven, Charles D.; ...

    2017-03-28

    Nitrogen is one of the most important nutrients for plant growth and a major constituent of proteins that regulate photosynthetic and respiratory processes. However, a comprehensive global analysis of nitrogen allocation in leaves for major processes with respect to different plant functional types is currently lacking. This study integrated observations from global databases with photosynthesis and respiration models to determine plant-functional-type-specific allocation patterns of leaf nitrogen for photosynthesis (Rubisco, electron transport, light absorption) and respiration (growth and maintenance), and by difference from observed total leaf nitrogen, an unexplained “residual” nitrogen pool. Based on our analysis, crops partition the largest fractionmore » of nitrogen to photosynthesis (57%) and respiration (5%) followed by herbaceous plants (44% and 4%). Tropical broadleaf evergreen trees partition the least to photosynthesis (25%) and respiration (2%) followed by needle-leaved evergreen trees (28% and 3%). In trees (especially needle-leaved evergreen and tropical broadleaf evergreen trees) a large fraction (70% and 73% respectively) of nitrogen was not explained by photosynthetic or respiratory functions. Compared to crops and herbaceous plants, this large residual pool is hypothesized to emerge from larger investments in cell wall proteins, lipids, amino acids, nucleic acid, CO2 fixation proteins (other than Rubisco), secondary compounds, and other proteins. Our estimates are different from previous studies due to differences in methodology and assumptions used in deriving nitrogen allocation estimates. Unlike previous studies, we integrate and infer nitrogen allocation estimates across multiple plant functional types, and report substantial differences in nitrogen allocation across different plant functional types. Furthermore, the resulting pattern of nitrogen allocation provides insights on mechanisms that operate at a cellular scale within leaves

  6. A secure biometrics-based authentication scheme for telecare medicine information systems.

    PubMed

    Yan, Xiaopeng; Li, Weiheng; Li, Ping; Wang, Jiantao; Hao, Xinhong; Gong, Peng

    2013-10-01

    The telecare medicine information system (TMIS) allows patients and doctors to access medical services or medical information at remote sites. Therefore, it could bring us very big convenient. To safeguard patients' privacy, authentication schemes for the TMIS attracted wide attention. Recently, Tan proposed an efficient biometrics-based authentication scheme for the TMIS and claimed their scheme could withstand various attacks. However, in this paper, we point out that Tan's scheme is vulnerable to the Denial-of-Service attack. To enhance security, we also propose an improved scheme based on Tan's work. Security and performance analysis shows our scheme not only could overcome weakness in Tan's scheme but also has better performance.

  7. A proposed classification scheme for Ada-based software products

    NASA Technical Reports Server (NTRS)

    Cernosek, Gary J.

    1986-01-01

    As the requirements for producing software in the Ada language become a reality for projects such as the Space Station, a great amount of Ada-based program code will begin to emerge. Recognizing the potential for varying levels of quality to result in Ada programs, what is needed is a classification scheme that describes the quality of a software product whose source code exists in Ada form. A 5-level classification scheme is proposed that attempts to decompose this potentially broad spectrum of quality which Ada programs may possess. The number of classes and their corresponding names are not as important as the mere fact that there needs to be some set of criteria from which to evaluate programs existing in Ada. An exact criteria for each class is not presented, nor are any detailed suggestions of how to effectively implement this quality assessment. The idea of Ada-based software classification is introduced and a set of requirements from which to base further research and development is suggested.

  8. Multi-Agent Based Simulation of Optimal Urban Land Use Allocation in the Middle Reaches of the Yangtze River, China

    NASA Astrophysics Data System (ADS)

    Zeng, Y.; Huang, W.; Jin, W.; Li, S.

    2016-06-01

    The optimization of land-use allocation is one of important approaches to achieve regional sustainable development. This study selects Chang-Zhu-Tan agglomeration as study area and proposed a new land use optimization allocation model. Using multi-agent based simulation model, the future urban land use optimization allocation was simulated in 2020 and 2030 under three different scenarios. This kind of quantitative information about urban land use optimization allocation and urban expansions in future would be of great interest to urban planning, water and land resource management, and climate change research.

  9. Comprehensive reliability allocation method for CNC lathes based on cubic transformed functions of failure mode and effects analysis

    NASA Astrophysics Data System (ADS)

    Yang, Zhou; Zhu, Yunpeng; Ren, Hongrui; Zhang, Yimin

    2015-03-01

    Reliability allocation of computerized numerical controlled(CNC) lathes is very important in industry. Traditional allocation methods only focus on high-failure rate components rather than moderate failure rate components, which is not applicable in some conditions. Aiming at solving the problem of CNC lathes reliability allocating, a comprehensive reliability allocation method based on cubic transformed functions of failure modes and effects analysis(FMEA) is presented. Firstly, conventional reliability allocation methods are introduced. Then the limitations of direct combination of comprehensive allocation method with the exponential transformed FMEA method are investigated. Subsequently, a cubic transformed function is established in order to overcome these limitations. Properties of the new transformed functions are discussed by considering the failure severity and the failure occurrence. Designers can choose appropriate transform amplitudes according to their requirements. Finally, a CNC lathe and a spindle system are used as an example to verify the new allocation method. Seven criteria are considered to compare the results of the new method with traditional methods. The allocation results indicate that the new method is more flexible than traditional methods. By employing the new cubic transformed function, the method covers a wider range of problems in CNC reliability allocation without losing the advantages of traditional methods.

  10. Knowledge-based load leveling and task allocation in human-machine systems

    NASA Technical Reports Server (NTRS)

    Chignell, M. H.; Hancock, P. A.

    1986-01-01

    Conventional human-machine systems use task allocation policies which are based on the premise of a flexible human operator. This individual is most often required to compensate for and augment the capabilities of the machine. The development of artificial intelligence and improved technologies have allowed for a wider range of task allocation strategies. In response to these issues a Knowledge Based Adaptive Mechanism (KBAM) is proposed for assigning tasks to human and machine in real time, using a load leveling policy. This mechanism employs an online workload assessment and compensation system which is responsive to variations in load through an intelligent interface. This interface consists of a loading strategy reasoner which has access to information about the current status of the human-machine system as well as a database of admissible human/machine loading strategies. Difficulties standing in the way of successful implementation of the load leveling strategy are examined.

  11. Cryptanalysis and Improvement of a Biometric-Based Multi-Server Authentication and Key Agreement Scheme

    PubMed Central

    Wang, Chengqi; Zhang, Xiao; Zheng, Zhiming

    2016-01-01

    With the security requirements of networks, biometrics authenticated schemes which are applied in the multi-server environment come to be more crucial and widely deployed. In this paper, we propose a novel biometric-based multi-server authentication and key agreement scheme which is based on the cryptanalysis of Mishra et al.’s scheme. The informal and formal security analysis of our scheme are given, which demonstrate that our scheme satisfies the desirable security requirements. The presented scheme provides a variety of significant functionalities, in which some features are not considered in the most of existing authentication schemes, such as, user revocation or re-registration and biometric information protection. Compared with several related schemes, our scheme has more secure properties and lower computation cost. It is obviously more appropriate for practical applications in the remote distributed networks. PMID:26866606

  12. Improved dynamic ID-based authentication scheme for telecare medical information systems.

    PubMed

    Cao, Tianjie; Zhai, Jingxuan

    2013-04-01

    In order to protect users' identity privacy, Chen et al. proposed an efficient dynamic ID-based authentication scheme for telecare medical information systems. However, Chen et al.'s scheme has some weaknesses. In Chen et al.'s scheme, an attacker can track a user by a linkability attack or an off-line identity guessing attack. Chen et al.'s scheme is also vulnerable to an off-line password guessing attack and an undetectable on-line password guessing attack when user's smart card is stolen. In server side, Chen et al.'s scheme needs large computational load to authentication a legal user or reject an illegal user. To remedy the weaknesses in Chen et al.'s scheme, we propose an improved smart card based password authentication scheme. Our analysis shows that the improved scheme can overcome the weaknesses in Chen et al.'s scheme.

  13. A secure smart-card based authentication and key agreement scheme for telecare medicine information systems.

    PubMed

    Lee, Tian-Fu; Liu, Chuan-Ming

    2013-06-01

    A smart-card based authentication scheme for telecare medicine information systems enables patients, doctors, nurses, health visitors and the medicine information systems to establish a secure communication platform through public networks. Zhu recently presented an improved authentication scheme in order to solve the weakness of the authentication scheme of Wei et al., where the off-line password guessing attacks cannot be resisted. This investigation indicates that the improved scheme of Zhu has some faults such that the authentication scheme cannot execute correctly and is vulnerable to the attack of parallel sessions. Additionally, an enhanced authentication scheme based on the scheme of Zhu is proposed. The enhanced scheme not only avoids the weakness in the original scheme, but also provides users' anonymity and authenticated key agreements for secure data communications.

  14. Perceptual quality-regulable video coding system with region-based rate control scheme.

    PubMed

    Wu, Guan-Lin; Fu, Yu-Jie; Huang, Sheng-Chieh; Chien, Shao-Yi

    2013-06-01

    In this paper, we discuss a region-based perceptual quality-regulable H.264 video encoder system that we developed. The ability to adjust the quality of specific regions of a source video to a predefined level of quality is an essential technique for region-based video applications. We use the structural similarity index as the quality metric for distortion-quantization modeling and develop a bit allocation and rate control scheme for enhancing regional perceptual quality. Exploiting the relationship between the reconstructed macroblock and the best predicted macroblock from mode decision, a novel quantization parameter prediction method is built and used to achieve the target video quality of the processed macroblock. Experimental results show that the system model has only 0.013 quality error in average. Moreover, the proposed region-based rate control system can encode video well under a bitrate constraint with a 0.1% bitrate error in average. For the situation of the low bitrate constraint, the proposed system can encode video with a 0.5% bit error rate in average and enhance the quality of the target regions.

  15. A Bayesian formulation for auction-based task allocation in heterogeneous multi-agent teams

    NASA Astrophysics Data System (ADS)

    Pippin, Charles E.; Christensen, Henrik

    2011-06-01

    In distributed, heterogeneous, multi-agent teams, agents may have different capabilities and types of sensors. Agents in dynamic environments will need to cooperate in real-time to perform tasks with minimal costs. Some example scenarios include dynamic allocation of UAV and UGV robot teams to possible hurricane survivor locations, search and rescue and target detection. Auction based algorithms scale well because agents generally only need to communicate bid information. In addition, the agents are able to perform their computations in parallel and can operate on local information. Furthermore, it is easy to integrate humans and other vehicle types and sensor combinations into an auction framework. However, standard auction mechanisms do not explicitly consider sensors with varying reliability. The agents sensor qualities should be explicitly accounted. Consider a scenario with multiple agents, each carrying a single sensor. The tasks in this case are to simply visit a location and detect a target. The sensors are of varying quality, with some having a higher probability of target detection. The agents themselves may have different capabilities, as well. The agents use knowledge of their environment to submit cost-based bids for performing each task and an auction is used to perform the task allocation. This paper discusses techniques for including a Bayesian formulation of target detection likelihood into this auction based framework for performing task allocation across multi-agent heterogeneous teams. Analysis and results of experiments with multiple air systems performing distributed target detection are also included.

  16. An Arbitrated Quantum Signature Scheme Based on Hyperchaotic Quantum Cryptosystem

    NASA Astrophysics Data System (ADS)

    Guo, Ying; Sun, Xin; Zhang, Wei

    2013-07-01

    A chaos-based arbitrated quantum signature (AQS) scheme is designed on the basis of an improved quantum chaotic encryption algorithm whose security is ensured due to the implementation of the quantum one-time pad that embraces the key-dependent chaotic operation string. It involves in a small-scale quantum computation network with three participants in three phases, i.e. initializing phase, signing phase and verifying phase. The signatory signs the encrypted message and then the receiver verifies the signature is valid with the aid of an arbitrator who plays a crucial role when a dispute arises. Analysis shows that the signature can neither be forged nor disavowed by the malicious attackers.

  17. Genetic comparison of breeding schemes based on semen importation and local breeding schemes: framework and application to Costa Rica.

    PubMed

    Vargas, B; van Arendonk, J A M

    2004-05-01

    Local breeding schemes for Holstein cattle of Costa Rica were compared with the current practice based on continuous semen importation (SI) by deterministic simulation. Comparison was made on the basis of genetic response and correlation between breeding goals. A local breeding goal was defined on the basis of prevailing production circumstances and compared against a typical breeding goal for an exporting country. Differences in genetic response were <3%, and the correlation between breeding goals was 0.99. Therefore, difference between breeding objectives proved negligible. For the evaluation of genetic response, the current scheme based on SI was evaluated against a progeny testing (PT) scheme and a closed nucleus (CN) breeding scheme, both local. Selection intensities and accuracy of selection were defined according to current population size and reproduction efficiency parameters. When genotype x environment interaction (G x E) was ignored, SI was the strategy with the highest genetic response: 5.0% above the CN breeding scheme and 33.2% above PT. A correlation between breeding values in both countries lower than one was assumed to assess the effect of G x E. This resulted in permanent effects on the relative efficiencies of breeding strategies because of the reduction in the rate of genetic response when SI was used. When the genetic correlation was assumed equal to 0.75, the genetic response achieved with SI was reduced at the same level as local PT. When an initial difference in average genetic merit of the populations was assumed, this only had a temporal effect on the relative ranking of strategies, which is reverted after some years of selection because the rate of change in genetic responses remains unchanged. Given that the actual levels of genetic correlation between countries may be around 0.60, it was concluded that a local breeding scheme based on a nucleus herd could provide better results than the current strategy based on SI.

  18. Designing a robust feature extraction method based on optimum allocation and principal component analysis for epileptic EEG signal classification.

    PubMed

    Siuly, Siuly; Li, Yan

    2015-04-01

    The aim of this study is to design a robust feature extraction method for the classification of multiclass EEG signals to determine valuable features from original epileptic EEG data and to discover an efficient classifier for the features. An optimum allocation based principal component analysis method named as OA_PCA is developed for the feature extraction from epileptic EEG data. As EEG data from different channels are correlated and huge in number, the optimum allocation (OA) scheme is used to discover the most favorable representatives with minimal variability from a large number of EEG data. The principal component analysis (PCA) is applied to construct uncorrelated components and also to reduce the dimensionality of the OA samples for an enhanced recognition. In order to choose a suitable classifier for the OA_PCA feature set, four popular classifiers: least square support vector machine (LS-SVM), naive bayes classifier (NB), k-nearest neighbor algorithm (KNN), and linear discriminant analysis (LDA) are applied and tested. Furthermore, our approaches are also compared with some recent research work. The experimental results show that the LS-SVM_1v1 approach yields 100% of the overall classification accuracy (OCA), improving up to 7.10% over the existing algorithms for the epileptic EEG data. The major finding of this research is that the LS-SVM with the 1v1 system is the best technique for the OA_PCA features in the epileptic EEG signal classification that outperforms all the recent reported existing methods in the literature.

  19. Dynamic bandwidth allocation by using efficient threshold reporting for quality of service in Ethernet passive optical networks

    NASA Astrophysics Data System (ADS)

    Yang, Yeon-Mo; Nho, Ji-Myong; Perros, Harry G.; Mahalik, N. P.; Kim, Kiseon; Ahn, Byung-Ha

    2006-03-01

    We present a dynamic bandwidth allocation scheme for Ethernet passive optical networks. This scheme, referred to as TDBA, is based on efficient threshold reporting and provides quality of service (QoS) to three different classes of packets. It is shown that network resources are efficiently allocated among the three traffic classes while guaranteeing the requested QoS by avoiding nearly all fragmentation losses. Simulation results using OPNET show that the TDBA scheme provides better packet delay and channel utilization than the other previously published allocation schemes.

  20. Learning automata-based solutions to the nonlinear fractional knapsack problem with applications to optimal resource allocation.

    PubMed

    Granmo, Ole-Christoffer; Oommen, B John; Myrer, Svein Arild; Olsen, Morten Goodwin

    2007-02-01

    This paper considers the nonlinear fractional knapsack problem and demonstrates how its solution can be effectively applied to two resource allocation problems dealing with the World Wide Web. The novel solution involves a "team" of deterministic learning automata (LA). The first real-life problem relates to resource allocation in web monitoring so as to "optimize" information discovery when the polling capacity is constrained. The disadvantages of the currently reported solutions are explained in this paper. The second problem concerns allocating limited sampling resources in a "real-time" manner with the purpose of estimating multiple binomial proportions. This is the scenario encountered when the user has to evaluate multiple web sites by accessing a limited number of web pages, and the proportions of interest are the fraction of each web site that is successfully validated by an HTML validator. Using the general LA paradigm to tackle both of the real-life problems, the proposed scheme improves a current solution in an online manner through a series of informed guesses that move toward the optimal solution. At the heart of the scheme, a team of deterministic LA performs a controlled random walk on a discretized solution space. Comprehensive experimental results demonstrate that the discretization resolution determines the precision of the scheme, and that for a given precision, the current solution (to both problems) is consistently improved until a nearly optimal solution is found--even for switching environments. Thus, the scheme, while being novel to the entire field of LA, also efficiently handles a class of resource allocation problems previously not addressed in the literature.

  1. Performance Ratio Based Resource Allocation Decision-Making in Genomic Medicine.

    PubMed

    Fragoulakis, Vasilios; Mitropoulou, Christina; Katelidou, Daphne; van Schaik, Ron H; Maniadakis, Nikolaos; Patrinos, George P

    2017-02-01

    In modern healthcare systems, the available resources may influence the morbidity, mortality, and-consequently-the level of healthcare provided in every country. This is of particular interest in developing countries where the resources are limited and must be spent wisely to address social justice and the right for equal access in healthcare services by all the citizens in economically viable terms. In this light, the current allocation is, in practice, inefficient and rests mostly on each country's individual political and historical context and, thus, does not always incorporate decision-making enabled by economic models. In this study, we present a new economic model, specifically for resource allocation for genomic medicine, based on performance ratio, with potential applications in diverse healthcare sectors, which are particularly appealing for developing countries and low-resource environments. The model proposes a new method for resource allocation taking into account (1) the size of innovation of a new technology, (2) the relative effectiveness in comparison with social preferences, and (3) the cost of the technology, which permits the measurement of effectiveness to be determined differently in the context of a specific disease and then to be expressed in a relative form using a common performance ratio. The present work expands on previous work for innovation in economic models pertaining to genomic medicine and supports translational science.

  2. Opportunistic Capacity-Based Resource Allocation for Chunk-Based Multi-Carrier Cognitive Radio Sensor Networks

    PubMed Central

    Huang, Jie; Zeng, Xiaoping; Jian, Xin; Tan, Xiaoheng; Zhang, Qi

    2017-01-01

    The spectrum allocation for cognitive radio sensor networks (CRSNs) has received considerable research attention under the assumption that the spectrum environment is static. However, in practice, the spectrum environment varies over time due to primary user/secondary user (PU/SU) activity and mobility, resulting in time-varied spectrum resources. This paper studies resource allocation for chunk-based multi-carrier CRSNs with time-varied spectrum resources. We present a novel opportunistic capacity model through a continuous time semi-Markov chain (CTSMC) to describe the time-varied spectrum resources of chunks and, based on this, a joint power and chunk allocation model by considering the opportunistically available capacity of chunks is proposed. To reduce the computational complexity, we split this model into two sub-problems and solve them via the Lagrangian dual method. Simulation results illustrate that the proposed opportunistic capacity-based resource allocation algorithm can achieve better performance compared with traditional algorithms when the spectrum environment is time-varied. PMID:28106803

  3. On the Security of Provably Secure Multi-Receiver ID-Based Signcryption Scheme

    NASA Astrophysics Data System (ADS)

    Tan, Chik-How

    Recently, Duan and Cao proposed an multi-receiver identity-based signcryption scheme. They showed that their scheme is secure against adaptive chosen ciphertext attacks in the random oracle model. In this paper, we show that their scheme is in fact not secure against adaptive chosen ciphertext attacks under their defined security model.

  4. An Anonymous Voting Scheme based on Confirmation Numbers

    NASA Astrophysics Data System (ADS)

    Alam, Kazi Md. Rokibul; Tamura, Shinsuke; Taniguchi, Shuji; Yanase, Tatsuro

    This paper proposes a new electronic voting (e-voting) scheme that fulfills all the security requirements of e-voting i.e. privacy, accuracy, universal verifiability, fairness, receipt-freeness, incoercibility, dispute-freeness, robustness, practicality and scalability; usually some of which are found to be traded. When compared with other existing schemes, this scheme requires much more simple computations and weaker assumptions about trustworthiness of individual election authorities. The key mechanism is the one that uses confirmation numbers involved in individual votes to make votes verifiable while disabling all entities including voters themselves to know the linkages between voters and their votes. Many existing e-voting schemes extensively deploy zero-knowledge proof (ZKP) to achieve verifiability. However, ZKP is expensive and complicated. The confirmation numbers attain the verifiability requirement in a much more simple and intuitive way, then the scheme becomes scalable and practical.

  5. Comparing administered and market-based water allocation systems through a consistent agent-based modeling framework.

    PubMed

    Zhao, Jianshi; Cai, Ximing; Wang, Zhongjing

    2013-07-15

    Water allocation can be undertaken through administered systems (AS), market-based systems (MS), or a combination of the two. The debate on the performance of the two systems has lasted for decades but still calls for attention in both research and practice. This paper compares water users' behavior under AS and MS through a consistent agent-based modeling framework for water allocation analysis that incorporates variables particular to both MS (e.g., water trade and trading prices) and AS (water use violations and penalties/subsidies). Analogous to the economic theory of water markets under MS, the theory of rational violation justifies the exchange of entitled water under AS through the use of cross-subsidies. Under water stress conditions, a unique water allocation equilibrium can be achieved by following a simple bargaining rule that does not depend upon initial market prices under MS, or initial economic incentives under AS. The modeling analysis shows that the behavior of water users (agents) depends on transaction, or administrative, costs, as well as their autonomy. Reducing transaction costs under MS or administrative costs under AS will mitigate the effect that equity constraints (originating with primary water allocation) have on the system's total net economic benefits. Moreover, hydrologic uncertainty is shown to increase market prices under MS and penalties/subsidies under AS and, in most cases, also increases transaction, or administrative, costs.

  6. Multiparty quantum secret sharing scheme based on the phase shift operations

    NASA Astrophysics Data System (ADS)

    Du, Yu-tao; Bao, Wan-su

    2013-11-01

    Based on a kind of multiparty quantum secret sharing schemes with Bell states, we propose a novel collective attack strategy in this paper. In our strategy, the group of in-attackers can obtain the entire secret information without introducing any error. More interestingly, a new multiparty quantum secret sharing scheme is proposed based on the 3-element phase shift operations. The scheme can resist not only the existing attacks, but also the cheating attack from the dishonest agent. Meanwhile, the scheme improves the efficiency of scheme by reducing the number of the eavesdropping detections and the computation complexity.

  7. An efficient and provable secure revocable identity-based encryption scheme.

    PubMed

    Wang, Changji; Li, Yuan; Xia, Xiaonan; Zheng, Kangjia

    2014-01-01

    Revocation functionality is necessary and crucial to identity-based cryptosystems. Revocable identity-based encryption (RIBE) has attracted a lot of attention in recent years, many RIBE schemes have been proposed in the literature but shown to be either insecure or inefficient. In this paper, we propose a new scalable RIBE scheme with decryption key exposure resilience by combining Lewko and Waters' identity-based encryption scheme and complete subtree method, and prove our RIBE scheme to be semantically secure using dual system encryption methodology. Compared to existing scalable and semantically secure RIBE schemes, our proposed RIBE scheme is more efficient in term of ciphertext size, public parameters size and decryption cost at price of a little looser security reduction. To the best of our knowledge, this is the first construction of scalable and semantically secure RIBE scheme with constant size public system parameters.

  8. An Efficient and Provable Secure Revocable Identity-Based Encryption Scheme

    PubMed Central

    Wang, Changji; Li, Yuan; Xia, Xiaonan; Zheng, Kangjia

    2014-01-01

    Revocation functionality is necessary and crucial to identity-based cryptosystems. Revocable identity-based encryption (RIBE) has attracted a lot of attention in recent years, many RIBE schemes have been proposed in the literature but shown to be either insecure or inefficient. In this paper, we propose a new scalable RIBE scheme with decryption key exposure resilience by combining Lewko and Waters’ identity-based encryption scheme and complete subtree method, and prove our RIBE scheme to be semantically secure using dual system encryption methodology. Compared to existing scalable and semantically secure RIBE schemes, our proposed RIBE scheme is more efficient in term of ciphertext size, public parameters size and decryption cost at price of a little looser security reduction. To the best of our knowledge, this is the first construction of scalable and semantically secure RIBE scheme with constant size public system parameters. PMID:25238418

  9. An Identity-Based (IDB) Broadcast Encryption Scheme with Personalized Messages (BEPM).

    PubMed

    Xu, Ke; Liao, Yongjian; Qiao, Li; Liu, Zhangyun; Yang, Xiaowei

    2015-01-01

    A broadcast encryption scheme with personalized messages (BEPM) is a scheme in which a broadcaster transmits not only encrypted broadcast messages to a subset of recipients but also encrypted personalized messages to each user individually. Several broadcast encryption (BE) schemes allow a broadcaster encrypts a message for a subset S of recipients with public keys and any user in S can decrypt the message with his/her private key. However, these BE schemes can not provide an efficient way to transmit encrypted personalized messages to each user individually. In this paper, we propose a broadcast encryption scheme with a transmission of personalized messages. Besides, the scheme is based on multilinear maps ensure constant ciphertext size and private key size of each user and the scheme can achieve statically security. More realistically, the scheme can be applied to the Conditional Access System (CAS) of pay television (pay-TV) efficiently and safely.

  10. An Identity-Based (IDB) Broadcast Encryption Scheme with Personalized Messages (BEPM)

    PubMed Central

    Xu, Ke; Liao, Yongjian; Qiao, Li

    2015-01-01

    A broadcast encryption scheme with personalized messages (BEPM) is a scheme in which a broadcaster transmits not only encrypted broadcast messages to a subset of recipients but also encrypted personalized messages to each user individually. Several broadcast encryption (BE) schemes allow a broadcaster encrypts a message for a subset S of recipients with public keys and any user in S can decrypt the message with his/her private key. However, these BE schemes can not provide an efficient way to transmit encrypted personalized messages to each user individually. In this paper, we propose a broadcast encryption scheme with a transmission of personalized messages. Besides, the scheme is based on multilinear maps ensure constant ciphertext size and private key size of each user and the scheme can achieve statically security. More realistically, the scheme can be applied to the Conditional Access System (CAS) of pay television (pay-TV) efficiently and safely. PMID:26629817

  11. A dynamic identity based authentication scheme using chaotic maps for telecare medicine information systems.

    PubMed

    Wang, Zhiheng; Huo, Zhanqiang; Shi, Wenbo

    2015-01-01

    With rapid development of computer technology and wide use of mobile devices, the telecare medicine information system has become universal in the field of medical care. To protect patients' privacy and medial data's security, many authentication schemes for the telecare medicine information system have been proposed. Due to its better performance, chaotic maps have been used in the design of authentication schemes for the telecare medicine information system. However, most of them cannot provide user's anonymity. Recently, Lin proposed a dynamic identity based authentication scheme using chaotic maps for the telecare medicine information system and claimed that their scheme was secure against existential active attacks. In this paper, we will demonstrate that their scheme cannot provide user anonymity and is vulnerable to the impersonation attack. Further, we propose an improved scheme to fix security flaws in Lin's scheme and demonstrate the proposed scheme could withstand various attacks.

  12. Asymmetric programming: a highly reliable metadata allocation strategy for MLC NAND flash memory-based sensor systems.

    PubMed

    Huang, Min; Liu, Zhaoqing; Qiao, Liyan

    2014-10-10

    While the NAND flash memory is widely used as the storage medium in modern sensor systems, the aggressive shrinking of process geometry and an increase in the number of bits stored in each memory cell will inevitably degrade the reliability of NAND flash memory. In particular, it's critical to enhance metadata reliability, which occupies only a small portion of the storage space, but maintains the critical information of the file system and the address translations of the storage system. Metadata damage will cause the system to crash or a large amount of data to be lost. This paper presents Asymmetric Programming, a highly reliable metadata allocation strategy for MLC NAND flash memory storage systems. Our technique exploits for the first time the property of the multi-page architecture of MLC NAND flash memory to improve the reliability of metadata. The basic idea is to keep metadata in most significant bit (MSB) pages which are more reliable than least significant bit (LSB) pages. Thus, we can achieve relatively low bit error rates for metadata. Based on this idea, we propose two strategies to optimize address mapping and garbage collection. We have implemented Asymmetric Programming on a real hardware platform. The experimental results show that Asymmetric Programming can achieve a reduction in the number of page errors of up to 99.05% with the baseline error correction scheme.

  13. Machine learning-based coding unit depth decisions for flexible complexity allocation in high efficiency video coding.

    PubMed

    Zhang, Yun; Kwong, Sam; Wang, Xu; Yuan, Hui; Pan, Zhaoqing; Xu, Long

    2015-07-01

    In this paper, we propose a machine learning-based fast coding unit (CU) depth decision method for High Efficiency Video Coding (HEVC), which optimizes the complexity allocation at CU level with given rate-distortion (RD) cost constraints. First, we analyze quad-tree CU depth decision process in HEVC and model it as a three-level of hierarchical binary decision problem. Second, a flexible CU depth decision structure is presented, which allows the performances of each CU depth decision be smoothly transferred between the coding complexity and RD performance. Then, a three-output joint classifier consists of multiple binary classifiers with different parameters is designed to control the risk of false prediction. Finally, a sophisticated RD-complexity model is derived to determine the optimal parameters for the joint classifier, which is capable of minimizing the complexity in each CU depth at given RD degradation constraints. Comparative experiments over various sequences show that the proposed CU depth decision algorithm can reduce the computational complexity from 28.82% to 70.93%, and 51.45% on average when compared with the original HEVC test model. The Bjøntegaard delta peak signal-to-noise ratio and Bjøntegaard delta bit rate are -0.061 dB and 1.98% on average, which is negligible. The overall performance of the proposed algorithm outperforms those of the state-of-the-art schemes.

  14. Asymmetric Programming: A Highly Reliable Metadata Allocation Strategy for MLC NAND Flash Memory-Based Sensor Systems

    PubMed Central

    Huang, Min; Liu, Zhaoqing; Qiao, Liyan

    2014-01-01

    While the NAND flash memory is widely used as the storage medium in modern sensor systems, the aggressive shrinking of process geometry and an increase in the number of bits stored in each memory cell will inevitably degrade the reliability of NAND flash memory. In particular, it's critical to enhance metadata reliability, which occupies only a small portion of the storage space, but maintains the critical information of the file system and the address translations of the storage system. Metadata damage will cause the system to crash or a large amount of data to be lost. This paper presents Asymmetric Programming, a highly reliable metadata allocation strategy for MLC NAND flash memory storage systems. Our technique exploits for the first time the property of the multi-page architecture of MLC NAND flash memory to improve the reliability of metadata. The basic idea is to keep metadata in most significant bit (MSB) pages which are more reliable than least significant bit (LSB) pages. Thus, we can achieve relatively low bit error rates for metadata. Based on this idea, we propose two strategies to optimize address mapping and garbage collection. We have implemented Asymmetric Programming on a real hardware platform. The experimental results show that Asymmetric Programming can achieve a reduction in the number of page errors of up to 99.05% with the baseline error correction scheme. PMID:25310473

  15. A Malware Detection Scheme Based on Mining Format Information

    PubMed Central

    Bai, Jinrong; Wang, Junfeng; Zou, Guozhong

    2014-01-01

    Malware has become one of the most serious threats to computer information system and the current malware detection technology still has very significant limitations. In this paper, we proposed a malware detection approach by mining format information of PE (portable executable) files. Based on in-depth analysis of the static format information of the PE files, we extracted 197 features from format information of PE files and applied feature selection methods to reduce the dimensionality of the features and achieve acceptable high performance. When the selected features were trained using classification algorithms, the results of our experiments indicate that the accuracy of the top classification algorithm is 99.1% and the value of the AUC is 0.998. We designed three experiments to evaluate the performance of our detection scheme and the ability of detecting unknown and new malware. Although the experimental results of identifying new malware are not perfect, our method is still able to identify 97.6% of new malware with 1.3% false positive rates. PMID:24991639

  16. A rhythm-based authentication scheme for smart media devices.

    PubMed

    Lee, Jae Dong; Jeong, Young-Sik; Park, Jong Hyuk

    2014-01-01

    In recent years, ubiquitous computing has been rapidly emerged in our lives and extensive studies have been conducted in a variety of areas related to smart devices, such as tablets, smartphones, smart TVs, smart refrigerators, and smart media devices, as a measure for realizing the ubiquitous computing. In particular, smartphones have significantly evolved from the traditional feature phones. Increasingly higher-end smartphone models that can perform a range of functions are now available. Smart devices have become widely popular since they provide high efficiency and great convenience for not only private daily activities but also business endeavors. Rapid advancements have been achieved in smart device technologies to improve the end users' convenience. Consequently, many people increasingly rely on smart devices to store their valuable and important data. With this increasing dependence, an important aspect that must be addressed is security issues. Leaking of private information or sensitive business data due to loss or theft of smart devices could result in exorbitant damage. To mitigate these security threats, basic embedded locking features are provided in smart devices. However, these locking features are vulnerable. In this paper, an original security-locking scheme using a rhythm-based locking system (RLS) is proposed to overcome the existing security problems of smart devices. RLS is a user-authenticated system that addresses vulnerability issues in the existing locking features and provides secure confidentiality in addition to convenience.

  17. A Rhythm-Based Authentication Scheme for Smart Media Devices

    PubMed Central

    Lee, Jae Dong; Park, Jong Hyuk

    2014-01-01

    In recent years, ubiquitous computing has been rapidly emerged in our lives and extensive studies have been conducted in a variety of areas related to smart devices, such as tablets, smartphones, smart TVs, smart refrigerators, and smart media devices, as a measure for realizing the ubiquitous computing. In particular, smartphones have significantly evolved from the traditional feature phones. Increasingly higher-end smartphone models that can perform a range of functions are now available. Smart devices have become widely popular since they provide high efficiency and great convenience for not only private daily activities but also business endeavors. Rapid advancements have been achieved in smart device technologies to improve the end users' convenience. Consequently, many people increasingly rely on smart devices to store their valuable and important data. With this increasing dependence, an important aspect that must be addressed is security issues. Leaking of private information or sensitive business data due to loss or theft of smart devices could result in exorbitant damage. To mitigate these security threats, basic embedded locking features are provided in smart devices. However, these locking features are vulnerable. In this paper, an original security-locking scheme using a rhythm-based locking system (RLS) is proposed to overcome the existing security problems of smart devices. RLS is a user-authenticated system that addresses vulnerability issues in the existing locking features and provides secure confidentiality in addition to convenience. PMID:25110743

  18. Noninvasive blood pressure measurement scheme based on optical fiber sensor

    NASA Astrophysics Data System (ADS)

    Liu, Xianxuan; Yuan, Xueguang; Zhang, Yangan

    2016-10-01

    Optical fiber sensing has many advantages, such as volume small, light quality, low loss, strong in anti-jamming. Since the invention of the optical fiber sensing technology in 1977, optical fiber sensing technology has been applied in the military, national defense, aerospace, industrial, medical and other fields in recent years, and made a great contribution to parameter measurement in the environment under the limited condition .With the rapid development of computer, network system, the intelligent optical fiber sensing technology, the sensor technology, the combination of computer and communication technology , the detection, diagnosis and analysis can be automatically and efficiently completed. In this work, we proposed a noninvasive blood pressure detection and analysis scheme which uses optical fiber sensor. Optical fiber sensing system mainly includes the light source, optical fiber, optical detector, optical modulator, the signal processing module and so on. wavelength optical signals were led into the optical fiber sensor and the signals reflected by the human body surface were detected. By comparing actual testing data with the data got by traditional way to measure the blood pressure we can establish models for predicting the blood pressure and achieve noninvasive blood pressure measurement by using spectrum analysis technology. Blood pressure measurement method based on optical fiber sensing system is faster and more convenient than traditional way, and it can get accurate analysis results in a shorter period of time than before, so it can efficiently reduce the time cost and manpower cost.

  19. Deriving effective vaccine allocation strategies for pandemic influenza: Comparison of an agent-based simulation and a compartmental model

    PubMed Central

    Dalgıç, Özden O.; Özaltın, Osman Y.; Ciccotelli, William A.; Erenay, Fatih S.

    2017-01-01

    Individuals are prioritized based on their risk profiles when allocating limited vaccine stocks during an influenza pandemic. Computationally expensive but realistic agent-based simulations and fast but stylized compartmental models are typically used to derive effective vaccine allocation strategies. A detailed comparison of these two approaches, however, is often omitted. We derive age-specific vaccine allocation strategies to mitigate a pandemic influenza outbreak in Seattle by applying derivative-free optimization to an agent-based simulation and also to a compartmental model. We compare the strategies derived by these two approaches under various infection aggressiveness and vaccine coverage scenarios. We observe that both approaches primarily vaccinate school children, however they may allocate the remaining vaccines in different ways. The vaccine allocation strategies derived by using the agent-based simulation are associated with up to 70% decrease in total cost and 34% reduction in the number of infections compared to the strategies derived by using the compartmental model. Nevertheless, the latter approach may still be competitive for very low and/or very high infection aggressiveness. Our results provide insights about potential differences between the vaccine allocation strategies derived by using agent-based simulations and those derived by using compartmental models. PMID:28222123

  20. Integer programming-based approach to allocation of reporter genes for cell array analysis.

    PubMed

    Hayashida, Morihiro; Sun, Fuyan; Aburatani, Sachiyo; Horimoto, Katsuhisa; Akutsu, Tatsuya

    2008-01-01

    In this paper, we consider the problem of selecting the most effective set of reporter genes for analysis of biological networks using cell microarrays. We propose two graph theoretic formulations of the reporter gene allocation problem, and show that both problems are hard to approximate. We propose integer programming-based methods for solving practical instances of these problems optimally. We apply them to apoptosis pathway maps, and discuss the biological significance of the result. We also apply them to artificial networks, the result of which shows that optimal solutions can be obtained within several seconds for networks with 10,000 nodes.

  1. Arbitrated quantum signature scheme based on cluster states

    NASA Astrophysics Data System (ADS)

    Yang, Yu-Guang; Lei, He; Liu, Zhi-Chao; Zhou, Yi-Hua; Shi, Wei-Min

    2016-06-01

    Cluster states can be exploited for some tasks such as topological one-way computation, quantum error correction, teleportation and dense coding. In this paper, we investigate and propose an arbitrated quantum signature scheme with cluster states. The cluster states are used for quantum key distribution and quantum signature. The proposed scheme can achieve an efficiency of 100 %. Finally, we also discuss its security against various attacks.

  2. Novel Threshold Changeable Secret Sharing Schemes Based on Polynomial Interpolation

    PubMed Central

    Li, Mingchu; Guo, Cheng; Choo, Kim-Kwang Raymond; Ren, Yizhi

    2016-01-01

    After any distribution of secret sharing shadows in a threshold changeable secret sharing scheme, the threshold may need to be adjusted to deal with changes in the security policy and adversary structure. For example, when employees leave the organization, it is not realistic to expect departing employees to ensure the security of their secret shadows. Therefore, in 2012, Zhang et al. proposed (t → t′, n) and ({t1, t2,⋯, tN}, n) threshold changeable secret sharing schemes. However, their schemes suffer from a number of limitations such as strict limit on the threshold values, large storage space requirement for secret shadows, and significant computation for constructing and recovering polynomials. To address these limitations, we propose two improved dealer-free threshold changeable secret sharing schemes. In our schemes, we construct polynomials to update secret shadows, and use two-variable one-way function to resist collusion attacks and secure the information stored by the combiner. We then demonstrate our schemes can adjust the threshold safely. PMID:27792784

  3. Novel Threshold Changeable Secret Sharing Schemes Based on Polynomial Interpolation.

    PubMed

    Yuan, Lifeng; Li, Mingchu; Guo, Cheng; Choo, Kim-Kwang Raymond; Ren, Yizhi

    2016-01-01

    After any distribution of secret sharing shadows in a threshold changeable secret sharing scheme, the threshold may need to be adjusted to deal with changes in the security policy and adversary structure. For example, when employees leave the organization, it is not realistic to expect departing employees to ensure the security of their secret shadows. Therefore, in 2012, Zhang et al. proposed (t → t', n) and ({t1, t2,⋯, tN}, n) threshold changeable secret sharing schemes. However, their schemes suffer from a number of limitations such as strict limit on the threshold values, large storage space requirement for secret shadows, and significant computation for constructing and recovering polynomials. To address these limitations, we propose two improved dealer-free threshold changeable secret sharing schemes. In our schemes, we construct polynomials to update secret shadows, and use two-variable one-way function to resist collusion attacks and secure the information stored by the combiner. We then demonstrate our schemes can adjust the threshold safely.

  4. Energy-efficient optical line terminal for WDM-OFDM-PON based on two-dimensional subcarrier and layer allocation.

    PubMed

    Hu, Xiaofeng; Cao, Pan; Zhuang, Zhiming; Zhang, Liang; Yang, Qi; Su, Yikai

    2012-11-05

    We propose and experimentally demonstrate a scheme to reduce the energy consumption of optical line terminal (OLT) in wavelength division multiplexing - orthogonal frequency division multiplexing - passive optical networks (WDM-OFDM-PONs). In our scheme, a wireless communication technique, termed layered modulation, is introduced to maximize the transmission capacity of OFDM modulation module in the OLT by multiplexing data from different ONU groups with signal-to-noise ratio (SNR) margins onto the same subcarriers. With adaptive and dynamic subcarrier and layer allocation, several ONU groups with low traffic demands can share one OFDM modulation module to deliver their data during non-peak hours of a day, thus greatly reducing the number of running devices and minimizing the energy consumption of the OLT. Numerical calculation shows that an energy efficiency improvement of 28.3% in the OLT can be achieved by using proposed scheme compared to the conventional WDM-OFDM-PON.

  5. Index-based reactive power compensation scheme for voltage regulation

    NASA Astrophysics Data System (ADS)

    Dike, Damian Obioma

    2008-10-01

    Increasing demand for electrical power arising from deregulation and the restrictions posed to the construction of new transmission lines by environment, socioeconomic, and political issues had led to higher grid loading. Consequently, voltage instability has become a major concern, and reactive power support is vital to enhance transmission grid performance. Improved reactive power support to distressed grid is possible through the application of relatively unfamiliar emerging technologies of "Flexible AC Transmission Systems (FACTS)" devices and "Distributed Energy Resources (DERS)." In addition to these infrastructure issues, a lack of situational awareness by system operators can cause major power outages as evidenced by the August 14, 2003 widespread North American blackout. This and many other recent major outages have highlighted the inadequacies of existing power system indexes. In this work, a novel "Index-based reactive compensation scheme" appropriate for both on-line and off-line computation of grid status has been developed. A new voltage stability index (Ls-index) suitable for long transmission lines was developed, simulated, and compared to the existing two-machine modeled L-index. This showed the effect of long distance power wheeling amongst regional transmission organizations. The dissertation further provided models for index modulated voltage source converters (VSC) and index-based load flow analysis of both FACTS and microgrid interconnected power systems using the Newton-Raphson's load flow model incorporated with multi-FACTS devices. The developed package has been made user-friendly through the embodiment of interactive graphical user interface and implemented on the IEEE 14, 30, and 300 bus systems. The results showed reactive compensation has system wide-effect, provided readily accessible system status indicators, ensured seamless DERs interconnection through new islanding modes and enhanced VSC utilization. These outcomes may contribute

  6. An improved biometrics-based authentication scheme for telecare medical information systems.

    PubMed

    Guo, Dianli; Wen, Qiaoyan; Li, Wenmin; Zhang, Hua; Jin, Zhengping

    2015-03-01

    Telecare medical information system (TMIS) offers healthcare delivery services and patients can acquire their desired medical services conveniently through public networks. The protection of patients' privacy and data confidentiality are significant. Very recently, Mishra et al. proposed a biometrics-based authentication scheme for telecare medical information system. Their scheme can protect user privacy and is believed to resist a range of network attacks. In this paper, we analyze Mishra et al.'s scheme and identify that their scheme is insecure to against known session key attack and impersonation attack. Thereby, we present a modified biometrics-based authentication scheme for TMIS to eliminate the aforementioned faults. Besides, we demonstrate the completeness of the proposed scheme through BAN-logic. Compared to the related schemes, our protocol can provide stronger security and it is more practical.

  7. A chaotic map-based authentication scheme for telecare medicine information systems.

    PubMed

    Hao, Xinhong; Wang, Jiantao; Yang, Qinghai; Yan, Xiaopeng; Li, Ping

    2013-04-01

    With the development of Internet, patients could enjoy health-care delivery services through telecare medicine information systems (TMIS) in their home. To control the access to remote medical servers' resources, many authentication schemes using smart cards have been proposed. However, the performance of these schemes is not satisfactory since modular exponential operations are used in these schemes. In the paper, we propose a chaotic map-based authentication scheme for telecare medicine information systems. The security and performance analysis shows our scheme is more suitable for TMIS.

  8. Allocation of Periodic Tasks with Precedences on Transputer-Based Systems

    DTIC Science & Technology

    1992-09-01

    MARSH2.OCC .......... ................. 78 C. OCCAM HARNESSES ON PROCESSOR PLUTO .. ...... 78 1. PLUTOH.OCC ............ ................. 78 2...ALLOCATION OF CHANNELS ON PLUTO ......... .. 11 Table III: ALLOCATION OF CHANNELS ON SATURN ...... .. 12 Table IV: ALLOCATION OF CHANNELS ON VENUS...HARNESSES ON PROCESSOR PLUTO ..... .. 14 Table VIII: OCCAM HARNESSES ON PROCESSOR SATURN . . .. 15 Table IX: OCCAM HARNESSES ON PROCESSOR VENUS ..... 15

  9. An efficient and secure attribute based signcryption scheme with LSSS access structure.

    PubMed

    Hong, Hanshu; Sun, Zhixin

    2016-01-01

    Attribute based encryption (ABE) and attribute based signature (ABS) provide flexible access control with authentication for data sharing between users, but realizing both functions will bring about too much computation burden. In this paper, we combine the advantages of CP-ABE with ABS and propose a ciphertext policy attribute based signcryption scheme. In our scheme, only legal receivers can decrypt the ciphertext and verify the signature signed by data owner. Furthermore, we use linear secret sharing scheme instead of tree structure to avoid the frequent calls of recursive algorithm. By security and performance analysis, we prove that our scheme is secure as well as gains higher efficiency.

  10. Functional Allocation for Ground-Based Automated Separation Assurance in NextGen

    NASA Technical Reports Server (NTRS)

    Prevot, Thomas; Mercer, Joey; Martin, Lynne; Homola, Jeffrey; Cabrall, Christopher; Brasil, Connie

    2010-01-01

    As part of an ongoing research effort into functional allocation in a NextGen environment, a controller-in-the-loop study on ground-based automated separation assurance was conducted at NASA Ames' Airspace Operations Laboratory in February 2010. Participants included six FAA front line managers, who are currently certified professional controllers and four recently retired controllers. Traffic scenarios were 15 and 30 minutes long where controllers interacted with advanced technologies for ground-based separation assurance, weather avoidance, and arrival metering. The automation managed the separation by resolving conflicts automatically and involved controllers only by exception, e.g., when the automated resolution would have been outside preset limits. Results from data analyses show that workload was low despite high levels of traffic, Operational Errors did occur but were closely tied to local complexity, and safety acceptability ratings varied with traffic levels. Positive feedback was elicited for the overall concept with discussion on the proper allocation of functions and trust in automation.

  11. K-Shortest-Path-Based Evacuation Routing with Police Resource Allocation in City Transportation Networks.

    PubMed

    He, Yunyue; Liu, Zhong; Shi, Jianmai; Wang, Yishan; Zhang, Jiaming; Liu, Jinyuan

    2015-01-01

    Emergency evacuation aims to transport people from dangerous places to safe shelters as quickly as possible. Police play an important role in the evacuation process, as they can handle traffic accidents immediately and help people move smoothly on roads. This paper investigates an evacuation routing problem that involves police resource allocation. We propose a novel k-th-shortest-path-based technique that uses explicit congestion control to optimize evacuation routing and police resource allocation. A nonlinear mixed-integer programming model is presented to formulate the problem. The model's objective is to minimize the overall evacuation clearance time. Two algorithms are given to solve the problem. The first one linearizes the original model and solves the linearized problem with CPLEX. The second one is a heuristic algorithm that uses a police resource utilization efficiency index to directly solve the original model. This police resource utilization efficiency index significantly aids in the evaluation of road links from an evacuation throughput perspective. The proposed algorithms are tested with a number of examples based on real data from cities of different sizes. The computational results show that the police resource utilization efficiency index is very helpful in finding near-optimal solutions. Additionally, comparing the performance of the heuristic algorithm and the linearization method by using randomly generated examples indicates that the efficiency of the heuristic algorithm is superior.

  12. K-Shortest-Path-Based Evacuation Routing with Police Resource Allocation in City Transportation Networks

    PubMed Central

    He, Yunyue; Liu, Zhong; Shi, Jianmai; Wang, Yishan; Zhang, Jiaming; Liu, Jinyuan

    2015-01-01

    Emergency evacuation aims to transport people from dangerous places to safe shelters as quickly as possible. Police play an important role in the evacuation process, as they can handle traffic accidents immediately and help people move smoothly on roads. This paper investigates an evacuation routing problem that involves police resource allocation. We propose a novel k-th-shortest-path-based technique that uses explicit congestion control to optimize evacuation routing and police resource allocation. A nonlinear mixed-integer programming model is presented to formulate the problem. The model’s objective is to minimize the overall evacuation clearance time. Two algorithms are given to solve the problem. The first one linearizes the original model and solves the linearized problem with CPLEX. The second one is a heuristic algorithm that uses a police resource utilization efficiency index to directly solve the original model. This police resource utilization efficiency index significantly aids in the evaluation of road links from an evacuation throughput perspective. The proposed algorithms are tested with a number of examples based on real data from cities of different sizes. The computational results show that the police resource utilization efficiency index is very helpful in finding near-optimal solutions. Additionally, comparing the performance of the heuristic algorithm and the linearization method by using randomly generated examples indicates that the efficiency of the heuristic algorithm is superior. PMID:26226109

  13. Computationally Efficient Power Allocation Algorithm in Multicarrier-Based Cognitive Radio Networks: OFDM and FBMC Systems

    NASA Astrophysics Data System (ADS)

    Shaat, Musbah; Bader, Faouzi

    2010-12-01

    Cognitive Radio (CR) systems have been proposed to increase the spectrum utilization by opportunistically access the unused spectrum. Multicarrier communication systems are promising candidates for CR systems. Due to its high spectral efficiency, filter bank multicarrier (FBMC) can be considered as an alternative to conventional orthogonal frequency division multiplexing (OFDM) for transmission over the CR networks. This paper addresses the problem of resource allocation in multicarrier-based CR networks. The objective is to maximize the downlink capacity of the network under both total power and interference introduced to the primary users (PUs) constraints. The optimal solution has high computational complexity which makes it unsuitable for practical applications and hence a low complexity suboptimal solution is proposed. The proposed algorithm utilizes the spectrum holes in PUs bands as well as active PU bands. The performance of the proposed algorithm is investigated for OFDM and FBMC based CR systems. Simulation results illustrate that the proposed resource allocation algorithm with low computational complexity achieves near optimal performance and proves the efficiency of using FBMC in CR context.

  14. A secure quantum group signature scheme based on Bell states

    NASA Astrophysics Data System (ADS)

    Zhang, Kejia; Song, Tingting; Zuo, Huijuan; Zhang, Weiwei

    2013-04-01

    In this paper, we propose a new secure quantum group signature with Bell states, which may have applications in e-payment system, e-government, e-business, etc. Compared with the recent quantum group signature protocols, our scheme is focused on the most general situation in practice, i.e. only the arbitrator is trusted and no intermediate information needs to be stored in the signing phase to ensure the security. Furthermore, our scheme has achieved all the characteristics of group signature—anonymity, verifiability, traceability, unforgetability and undeniability, by using some current developed quantum and classical technologies. Finally, a feasible security analysis model for quantum group signature is presented.

  15. Agent-based evacuation simulation for spatial allocation assessment of urban shelters

    NASA Astrophysics Data System (ADS)

    Yu, Jia; Wen, Jiahong; Jiang, Yong

    2015-12-01

    The construction of urban shelters is one of the most important work in urban planning and disaster prevention. The spatial allocation assessment is a fundamental pre-step for spatial location-allocation of urban shelters. This paper introduces a new method which makes use of agent-based technology to implement evacuation simulation so as to conduct dynamic spatial allocation assessment of urban shelters. The method can not only accomplish traditional geospatial evaluation for urban shelters, but also simulate the evacuation process of the residents to shelters. The advantage of utilizing this method lies into three aspects: (1) the evacuation time of each citizen from a residential building to the shelter can be estimated more reasonably; (2) the total evacuation time of all the residents in a region is able to be obtained; (3) the road congestions in evacuation in sheltering can be detected so as to take precautionary measures to prevent potential risks. In this study, three types of agents are designed: shelter agents, government agents and resident agents. Shelter agents select specified land uses as shelter candidates for different disasters. Government agents delimitate the service area of each shelter, in other words, regulate which shelter a person should take, in accordance with the administrative boundaries and road distance between the person's position and the location of the shelter. Resident agents have a series of attributes, such as ages, positions, walking speeds, and so on. They also have several behaviors, such as reducing speed when walking in the crowd, helping old people and children, and so on. Integrating these three types of agents which are correlated with each other, evacuation procedures can be simulated and dynamic allocation assessment of shelters will be achieved. A case study in Jing'an District, Shanghai, China, was conducted to demonstrate the feasibility of the method. A scenario of earthquake disaster which occurs in nighttime

  16. A provably-secure ECC-based authentication scheme for wireless sensor networks.

    PubMed

    Nam, Junghyun; Kim, Moonseong; Paik, Juryon; Lee, Youngsook; Won, Dongho

    2014-11-06

    A smart-card-based user authentication scheme for wireless sensor networks (in short, a SUA-WSN scheme) is designed to restrict access to the sensor data only to users who are in possession of both a smart card and the corresponding password. While a significant number of SUA-WSN schemes have been suggested in recent years, their intended security properties lack formal definitions and proofs in a widely-accepted model. One consequence is that SUA-WSN schemes insecure against various attacks have proliferated. In this paper, we devise a security model for the analysis of SUA-WSN schemes by extending the widely-accepted model of Bellare, Pointcheval and Rogaway (2000). Our model provides formal definitions of authenticated key exchange and user anonymity while capturing side-channel attacks, as well as other common attacks. We also propose a new SUA-WSN scheme based on elliptic curve cryptography (ECC), and prove its security properties in our extended model. To the best of our knowledge, our proposed scheme is the first SUA-WSN scheme that provably achieves both authenticated key exchange and user anonymity. Our scheme is also computationally competitive with other ECC-based (non-provably secure) schemes.

  17. A Provably-Secure ECC-Based Authentication Scheme for Wireless Sensor Networks

    PubMed Central

    Nam, Junghyun; Kim, Moonseong; Paik, Juryon; Lee, Youngsook; Won, Dongho

    2014-01-01

    A smart-card-based user authentication scheme for wireless sensor networks (in short, a SUA-WSN scheme) is designed to restrict access to the sensor data only to users who are in possession of both a smart card and the corresponding password. While a significant number of SUA-WSN schemes have been suggested in recent years, their intended security properties lack formal definitions and proofs in a widely-accepted model. One consequence is that SUA-WSN schemes insecure against various attacks have proliferated. In this paper, we devise a security model for the analysis of SUA-WSN schemes by extending the widely-accepted model of Bellare, Pointcheval and Rogaway (2000). Our model provides formal definitions of authenticated key exchange and user anonymity while capturing side-channel attacks, as well as other common attacks. We also propose a new SUA-WSN scheme based on elliptic curve cryptography (ECC), and prove its security properties in our extended model. To the best of our knowledge, our proposed scheme is the first SUA-WSN scheme that provably achieves both authenticated key exchange and user anonymity. Our scheme is also computationally competitive with other ECC-based (non-provably secure) schemes. PMID:25384009

  18. A Hierarchical Auction-Based Mechanism for Real-Time Resource Allocation in Cloud Robotic Systems.

    PubMed

    Wang, Lujia; Liu, Ming; Meng, Max Q-H

    2017-02-01

    Cloud computing enables users to share computing resources on-demand. The cloud computing framework cannot be directly mapped to cloud robotic systems with ad hoc networks since cloud robotic systems have additional constraints such as limited bandwidth and dynamic structure. However, most multirobotic applications with cooperative control adopt this decentralized approach to avoid a single point of failure. Robots need to continuously update intensive data to execute tasks in a coordinated manner, which implies real-time requirements. Thus, a resource allocation strategy is required, especially in such resource-constrained environments. This paper proposes a hierarchical auction-based mechanism, namely link quality matrix (LQM) auction, which is suitable for ad hoc networks by introducing a link quality indicator. The proposed algorithm produces a fast and robust method that is accurate and scalable. It reduces both global communication and unnecessary repeated computation. The proposed method is designed for firm real-time resource retrieval for physical multirobot systems. A joint surveillance scenario empirically validates the proposed mechanism by assessing several practical metrics. The results show that the proposed LQM auction outperforms state-of-the-art algorithms for resource allocation.

  19. New Identity-Based Blind Signature and Blind Decryption Scheme in the Standard Model

    NASA Astrophysics Data System (ADS)

    Phong, Le Trieu; Ogata, Wakaha

    We explicitly describe and analyse blind hierachical identity-based encryption (blind HIBE) schemes, which are natural generalizations of blind IBE schemes [20]. We then uses the blind HIBE schemes to construct: (1) An identity-based blind signature scheme secure in the standard model, under the computational Diffie-Hellman (CDH) assumption, and with much shorter signature size and lesser communication cost, compared to existing proposals. (2) A new mechanism supporting a user to buy digital information over the Internet without revealing what he/she has bought, while protecting the providers from cheating users.

  20. A global optimization algorithm for simulation-based problems via the extended DIRECT scheme

    NASA Astrophysics Data System (ADS)

    Liu, Haitao; Xu, Shengli; Wang, Xiaofang; Wu, Junnan; Song, Yang

    2015-11-01

    This article presents a global optimization algorithm via the extension of the DIviding RECTangles (DIRECT) scheme to handle problems with computationally expensive simulations efficiently. The new optimization strategy improves the regular partition scheme of DIRECT to a flexible irregular partition scheme in order to utilize information from irregular points. The metamodelling technique is introduced to work with the flexible partition scheme to speed up the convergence, which is meaningful for simulation-based problems. Comparative results on eight representative benchmark problems and an engineering application with some existing global optimization algorithms indicate that the proposed global optimization strategy is promising for simulation-based problems in terms of efficiency and accuracy.

  1. MultiScheme: A Parallel Processing System Based on MIT (Massachusetts Institute of Technology) Scheme.

    DTIC Science & Technology

    1987-09-01

    a sufficiently wide range of parallel-processing applications, that it has become the base for a commercial product, the Butterfly Lisp System...robust, and supports a sufficiently wide range of parallel-processing applications, that it has become the base for a commercial product, the Butterfly ...and inspiration have kept me going when my own interest or ability lapsed. The members of the BBN Butterfly Lisp group (especially Don Allen and Seth

  2. A swarm intelligence based memetic algorithm for task allocation in distributed systems

    NASA Astrophysics Data System (ADS)

    Sarvizadeh, Raheleh; Haghi Kashani, Mostafa

    2012-01-01

    This paper proposes a Swarm Intelligence based Memetic algorithm for Task Allocation and scheduling in distributed systems. The tasks scheduling in distributed systems is known as an NP-complete problem. Hence, many genetic algorithms have been proposed for searching optimal solutions from entire solution space. However, these existing approaches are going to scan the entire solution space without considering the techniques that can reduce the complexity of the optimization. Spending too much time for doing scheduling is considered the main shortcoming of these approaches. Therefore, in this paper memetic algorithm has been used to cope with this shortcoming. With regard to load balancing efficiently, Bee Colony Optimization (BCO) has been applied as local search in the proposed memetic algorithm. Extended experimental results demonstrated that the proposed method outperformed the existing GA-based method in terms of CPU utilization.

  3. A swarm intelligence based memetic algorithm for task allocation in distributed systems

    NASA Astrophysics Data System (ADS)

    Sarvizadeh, Raheleh; Haghi Kashani, Mostafa

    2011-12-01

    This paper proposes a Swarm Intelligence based Memetic algorithm for Task Allocation and scheduling in distributed systems. The tasks scheduling in distributed systems is known as an NP-complete problem. Hence, many genetic algorithms have been proposed for searching optimal solutions from entire solution space. However, these existing approaches are going to scan the entire solution space without considering the techniques that can reduce the complexity of the optimization. Spending too much time for doing scheduling is considered the main shortcoming of these approaches. Therefore, in this paper memetic algorithm has been used to cope with this shortcoming. With regard to load balancing efficiently, Bee Colony Optimization (BCO) has been applied as local search in the proposed memetic algorithm. Extended experimental results demonstrated that the proposed method outperformed the existing GA-based method in terms of CPU utilization.

  4. Service-Oriented Architecture Afloat: A Capabilities-Based Prioritization Scheme

    DTIC Science & Technology

    2013-04-01

    QoS) using the Automated Digital Network System ( ADNS ). The current network prioritization scheme implemented on ADNS is designed to optimize...network resources to accomplish required tasks within a compressed time frame. By linking the identified systems to the application types ADNS ...oÉëÉ~êÅÜ=mêçÖê~ãW= `êÉ~íáåÖ=póåÉêÖó=Ñçê=fåÑçêãÉÇ=ÅÜ~åÖÉ= - 327 - = The Navy currently uses the Automated Digital Network System ( ADNS ) to allocate

  5. A Web-based graphical user interface for evidence-based decision making for health care allocations in rural areas

    PubMed Central

    Schuurman, Nadine; Leight, Margo; Berube, Myriam

    2008-01-01

    Background The creation of successful health policy and location of resources increasingly relies on evidence-based decision-making. The development of intuitive, accessible tools to analyse, display and disseminate spatial data potentially provides the basis for sound policy and resource allocation decisions. As health services are rationalized, the development of tools such graphical user interfaces (GUIs) is especially valuable at they assist decision makers in allocating resources such that the maximum number of people are served. GIS can used to develop GUIs that enable spatial decision making. Results We have created a Web-based GUI (wGUI) to assist health policy makers and administrators in the Canadian province of British Columbia make well-informed decisions about the location and allocation of time-sensitive service capacities in rural regions of the province. This tool integrates datasets for existing hospitals and services, regional populations and road networks to allow users to ascertain the percentage of population in any given service catchment who are served by a specific health service, or baskets of linked services. The wGUI allows policy makers to map trauma and obstetric services against rural populations within pre-specified travel distances, illustrating service capacity by region. Conclusion The wGUI can be used by health policy makers and administrators with little or no formal GIS training to visualize multiple health resource allocation scenarios. The GUI is poised to become a critical decision-making tool especially as evidence is increasingly required for distribution of health services. PMID:18793428

  6. Challenges in defining an optimal approach to formula-based allocations of public health funds in the United States

    PubMed Central

    Buehler, James W; Holtgrave, David R

    2007-01-01

    Background Controversy and debate can arise whenever public health agencies determine how program funds should be allocated among constituent jurisdictions. Two common strategies for making such allocations are expert review of competitive applications and the use of funding formulas. Despite widespread use of funding formulas by public health agencies in the United States, formula allocation strategies in public health have been subject to relatively little formal scrutiny, with the notable exception of the attention focused on formula funding of HIV care programs. To inform debates and deliberations in the selection of a formula-based approach, we summarize key challenges to formula-based funding, based on prior reviews of federal programs in the United States. Discussion The primary challenge lies in identifying data sources and formula calculation methods that both reflect and serve program objectives, with or without adjustments for variations in the cost of delivering services, the availability of local resources, capacity, or performance. Simplicity and transparency are major advantages of formula-based allocations, but these advantages can be offset if formula-based allocations are perceived to under- or over-fund some jurisdictions, which may result from how guaranteed minimum funding levels are set or from "hold-harmless" provisions intended to blunt the effects of changes in formula design or random variations in source data. While fairness is considered an advantage of formula-based allocations, the design of a formula may implicitly reflect unquestioned values concerning equity versus equivalence in setting funding policies. Whether or how past or projected trends are taken into account can also have substantial impacts on allocations. Summary Insufficient attention has been focused on how the approach to designing funding formulas in public health should differ for treatment or service versus prevention programs. Further evaluations of formula-based

  7. Optimality versus stability in water resource allocation.

    PubMed

    Read, Laura; Madani, Kaveh; Inanloo, Bahareh

    2014-01-15

    Water allocation is a growing concern in a developing world where limited resources like fresh water are in greater demand by more parties. Negotiations over allocations often involve multiple groups with disparate social, economic, and political status and needs, who are seeking a management solution for a wide range of demands. Optimization techniques for identifying the Pareto-optimal (social planner solution) to multi-criteria multi-participant problems are commonly implemented, although often reaching agreement for this solution is difficult. In negotiations with multiple-decision makers, parties who base decisions on individual rationality may find the social planner solution to be unfair, thus creating a need to evaluate the willingness to cooperate and practicality of a cooperative allocation solution, i.e., the solution's stability. This paper suggests seeking solutions for multi-participant resource allocation problems through an economics-based power index allocation method. This method can inform on allocation schemes that quantify a party's willingness to participate in a negotiation rather than opt for no agreement. Through comparison of the suggested method with a range of distance-based multi-criteria decision making rules, namely, least squares, MAXIMIN, MINIMAX, and compromise programming, this paper shows that optimality and stability can produce different allocation solutions. The mismatch between the socially-optimal alternative and the most stable alternative can potentially result in parties leaving the negotiation as they may be too dissatisfied with their resource share. This finding has important policy implications as it justifies why stakeholders may not accept the socially optimal solution in practice, and underlies the necessity of considering stability where it may be more appropriate to give up an unstable Pareto-optimal solution for an inferior stable one. Authors suggest assessing the stability of an allocation solution as an

  8. Chaos-based partial image encryption scheme based on linear fractional and lifting wavelet transforms

    NASA Astrophysics Data System (ADS)

    Belazi, Akram; Abd El-Latif, Ahmed A.; Diaconu, Adrian-Viorel; Rhouma, Rhouma; Belghith, Safya

    2017-01-01

    In this paper, a new chaos-based partial image encryption scheme based on Substitution-boxes (S-box) constructed by chaotic system and Linear Fractional Transform (LFT) is proposed. It encrypts only the requisite parts of the sensitive information in Lifting-Wavelet Transform (LWT) frequency domain based on hybrid of chaotic maps and a new S-box. In the proposed encryption scheme, the characteristics of confusion and diffusion are accomplished in three phases: block permutation, substitution, and diffusion. Then, we used dynamic keys instead of fixed keys used in other approaches, to control the encryption process and make any attack impossible. The new S-box was constructed by mixing of chaotic map and LFT to insure the high confidentiality in the inner encryption of the proposed approach. In addition, the hybrid compound of S-box and chaotic systems strengthened the whole encryption performance and enlarged the key space required to resist the brute force attacks. Extensive experiments were conducted to evaluate the security and efficiency of the proposed approach. In comparison with previous schemes, the proposed cryptosystem scheme showed high performances and great potential for prominent prevalence in cryptographic applications.

  9. Research on comprehensive power quality compensation schemes based on series and shunt converters

    NASA Astrophysics Data System (ADS)

    Jia, Dongqiang; He, Rongkai; Qian, Yeniu

    2017-01-01

    To solve power quality problems such as voltage sag and low power factor which may occur simultaneously. This paper has taken research on two comprehensive power quality compensation schemes based on series and shunt converters, including corresponding topology structure and operation principle, meanwhile, the equivalent circuit and power flow analysis are also given. Then the paper has discussed relative characteristics of schemes, such as flexibility, reliability and applications. Finally, simulation results have verified effectiveness of related analysis of schemes.

  10. Remote sensing image compression method based on lift scheme wavelet transform

    NASA Astrophysics Data System (ADS)

    Tao, Hongjiu; Tang, Xinjian; Liu, Jian; Tian, Jinwen

    2003-06-01

    Based on lifting scheme and the construction theorem of the integer Haar wavelet and biorthogonal wavelet, we propose a new integer wavelet transform construct method on the basis of lift scheme after introduciton of constructing specific-demand biorthogonal wavelet transform using Harr wavelet and Lazy wavelet. In this paper, we represent the method and algorithm of the lifting scheme, and we also give mathematical formulation on this method and experimental results as well.

  11. A Quantum Proxy Weak Blind Signature Scheme Based on Controlled Quantum Teleportation

    NASA Astrophysics Data System (ADS)

    Cao, Hai-Jing; Yu, Yao-Feng; Song, Qin; Gao, Lan-Xiang

    2015-04-01

    Proxy blind signature is applied to the electronic paying system, electronic voting system, mobile agent system, security of internet, etc. A quantum proxy weak blind signature scheme is proposed in this paper. It is based on controlled quantum teleportation. Five-qubit entangled state functions as quantum channel. The scheme uses the physical characteristics of quantum mechanics to implement message blinding, so it could guarantee not only the unconditional security of the scheme but also the anonymity of the messages owner.

  12. A Quantum Proxy Weak Blind Signature Scheme Based on Controlled Quantum Teleportation

    NASA Astrophysics Data System (ADS)

    Cao, Hai-Jing; Yu, Yao-Feng; Song, Qin; Gao, Lan-Xiang

    2014-09-01

    Proxy blind signature is applied to the electronic paying system, electronic voting system, mobile agent system, security of internet, etc. A quantum proxy weak blind signature scheme is proposed in this paper. It is based on controlled quantum teleportation. Five-qubit entangled state functions as quantum channel. The scheme uses the physical characteristics of quantum mechanics to implement message blinding, so it could guarantee not only the unconditional security of the scheme but also the anonymity of the messages owner.

  13. Graph State-Based Quantum Group Authentication Scheme

    NASA Astrophysics Data System (ADS)

    Liao, Longxia; Peng, Xiaoqi; Shi, Jinjing; Guo, Ying

    2017-02-01

    Motivated by the elegant structure of the graph state, we design an ingenious quantum group authentication scheme, which is implemented by operating appropriate operations on the graph state and can solve the problem of multi-user authentication. Three entities, the group authentication server (GAS) as a verifier, multiple users as provers and the trusted third party Trent are included. GAS and Trent assist the multiple users in completing the authentication process, i.e., GAS is responsible for registering all the users while Trent prepares graph states. All the users, who request for authentication, encode their authentication keys on to the graph state by performing Pauli operators. It demonstrates that a novel authentication scheme can be achieved with the flexible use of graph state, which can synchronously authenticate a large number of users, meanwhile the provable security can be guaranteed definitely.

  14. A continuous and prognostic convection scheme based on buoyancy, PCMT

    NASA Astrophysics Data System (ADS)

    Guérémy, Jean-François; Piriou, Jean-Marcel

    2016-04-01

    A new and consistent convection scheme (PCMT: Prognostic Condensates Microphysics and Transport), providing a continuous and prognostic treatment of this atmospheric process, is described. The main concept ensuring the consistency of the whole system is the buoyancy, key element of any vertical motion. The buoyancy constitutes the forcing term of the convective vertical velocity, which is then used to define the triggering condition, the mass flux, and the rates of entrainment-detrainment. The buoyancy is also used in its vertically integrated form (CAPE) to determine the closure condition. The continuous treatment of convection, from dry thermals to deep precipitating convection, is achieved with the help of a continuous formulation of the entrainment-detrainment rates (depending on the convective vertical velocity) and of the CAPE relaxation time (depending on the convective over-turning time). The convective tendencies are directly expressed in terms of condensation and transport. Finally, the convective vertical velocity and condensates are fully prognostic, the latter being treated using the same microphysics scheme as for the resolved condensates but considering the convective environment. A Single Column Model (SCM) validation of this scheme is shown, allowing detailed comparisons with observed and explicitly simulated data. Four cases covering the convective spectrum are considered: over ocean, sensitivity to environmental moisture (S. Derbyshire) non precipitating shallow convection to deep precipitating convection, trade wind shallow convection (BOMEX) and strato-cumulus (FIRE), together with an entire continental diurnal cycle of convection (ARM). The emphasis is put on the characteristics of the scheme which enable a continuous treatment of convection. Then, a 3D LAM validation is presented considering an AMMA case with both observations and a CRM simulation using the same initial and lateral conditions as for the parameterized one. Finally, global

  15. Using bi-directional communications in a market-based resource allocation system

    DOEpatents

    Chassin, David P; Pratt, Robert G

    2015-05-05

    Disclosed herein are representative embodiments of methods, apparatus, and systems for distributing a resource (such as electricity) using a resource allocation system. In one exemplary embodiment, a plurality of requests for electricity are received from a plurality of end-use consumers. The requests indicate a requested quantity of electricity and a consumer-requested index value indicative of a maximum price a respective end-use consumer will pay for the requested quantity of electricity. A plurality of offers for supplying electricity are received from a plurality of resource suppliers. The offers indicate an offered quantity of electricity and a supplier-requested index value indicative of a minimum price for which a respective supplier will produce the offered quantity of electricity. A dispatched index value is computed at which electricity is to be supplied based at least in part on the consumer-requested index values and the supplier-requested index values.

  16. Using bi-directional communications in a market-based resource allocation system

    DOEpatents

    Chassin, David P.; Pratt, Robert G.

    2015-09-08

    Disclosed herein are representative embodiments of methods, apparatus, and systems for distributing a resource (such as electricity) using a resource allocation system. In one exemplary embodiment, a plurality of requests for electricity are received from a plurality of end-use consumers. The requests indicate a requested quantity of electricity and a consumer-requested index value indicative of a maximum price a respective end-use consumer will pay for the requested quantity of electricity. A plurality of offers for supplying electricity are received from a plurality of resource suppliers. The offers indicate an offered quantity of electricity and a supplier-requested index value indicative of a minimum price for which a respective supplier will produce the offered quantity of electricity. A dispatched index value is computed at which electricity is to be supplied based at least in part on the consumer-requested index values and the supplier-requested index values.

  17. Using bi-directional communications in a market-based resource allocation system

    DOEpatents

    Chassin, David P; Pratt, Robert G

    2014-04-01

    Disclosed herein are representative embodiments of methods, apparatus, and systems for distributing a resource (such as electricity) using a resource allocation system. In one exemplary embodiment, a plurality of requests for electricity are received from a plurality of end-use consumers. The requests indicate a requested quantity of electricity and a consumer-requested index value indicative of a maximum price a respective end-use consumer will pay for the requested quantity of electricity. A plurality of offers for supplying electricity are received from a plurality of resource suppliers. The offers indicate an offered quantity of electricity and a supplier-requested index value indicative of a minimum price for which a respective supplier will produce the offered quantity of electricity. A dispatched index value is computed at which electricity is to be supplied based at least in part on the consumer-requested index values and the supplier-requested index values.

  18. Electric power grid control using a market-based resource allocation system

    DOEpatents

    Chassin, David P

    2014-01-28

    Disclosed herein are representative embodiments of methods, apparatus, and systems for distributing a resource (such as electricity) using a resource allocation system. In one exemplary embodiment, a plurality of requests for electricity are received from a plurality of end-use consumers. The requests indicate a requested quantity of electricity and a consumer-requested index value indicative of a maximum price a respective end-use consumer will pay for the requested quantity of electricity. A plurality of offers for supplying electricity are received from a plurality of resource suppliers. The offers indicate an offered quantity of electricity and a supplier-requested index value indicative of a minimum price for which a respective supplier will produce the offered quantity of electricity. A dispatched index value is computed at which electricity is to be supplied based at least in part on the consumer-requested index values and the supplier-requested index values.

  19. Electric power grid control using a market-based resource allocation system

    DOEpatents

    Chassin, David P.

    2015-07-21

    Disclosed herein are representative embodiments of methods, apparatus, and systems for distributing a resource (such as electricity) using a resource allocation system. In one exemplary embodiment, a plurality of requests for electricity are received from a plurality of end-use consumers. The requests indicate a requested quantity of electricity and a consumer-requested index value indicative of a maximum price a respective end-use consumer will pay for the requested quantity of electricity. A plurality of offers for supplying electricity are received from a plurality of resource suppliers. The offers indicate an offered quantity of electricity and a supplier-requested index value indicative of a minimum price for which a respective supplier will produce the offered quantity of electricity. A dispatched index value is computed at which electricity is to be supplied based at least in part on the consumer-requested index values and the supplier-requested index values.

  20. Using one-way communications in a market-based resource allocation system

    DOEpatents

    Chassin, David P.; Pratt, Robert G.

    2014-07-22

    Disclosed herein are representative embodiments of methods, apparatus, and systems for distributing a resource (such as electricity) using a resource allocation system. In one exemplary embodiment, a plurality of requests for electricity are received from a plurality of end-use consumers. The requests indicate a requested quantity of electricity and a consumer-requested index value indicative of a maximum price a respective end-use consumer will pay for the requested quantity of electricity. A plurality of offers for supplying electricity are received from a plurality of resource suppliers. The offers indicate an offered quantity of electricity and a supplier-requested index value indicative of a minimum price for which a respective supplier will produce the offered quantity of electricity. A dispatched index value is computed at which electricity is to be supplied based at least in part on the consumer-requested index values and the supplier-requested index values.

  1. Geographic Resource Allocation Based on Cost Effectiveness: An Application to Malaria Policy.

    PubMed

    Drake, Tom L; Lubell, Yoel; Kyaw, Shwe Sin; Devine, Angela; Kyaw, Myat Phone; Day, Nicholas P J; Smithuis, Frank M; White, Lisa J

    2017-02-10

    Healthcare services are often provided to a country as a whole, though in many cases the available resources can be more effectively targeted to specific geographically defined populations. In the case of malaria, risk is highly geographically heterogeneous, and many interventions, such as insecticide-treated bed nets and malaria community health workers, can be targeted to populations in a way that maximises impact for the resources available. This paper describes a framework for geographically targeted budget allocation based on the principles of cost-effectiveness analysis and applied to priority setting in malaria control and elimination. The approach can be used with any underlying model able to estimate intervention costs and effects given relevant local data. Efficient geographic targeting of core malaria interventions could significantly increase the impact of the resources available, accelerating progress towards elimination. These methods may also be applicable to priority setting in other disease areas.

  2. A Data Gathering Scheme in Wireless Sensor Networks Based on Synchronization of Chaotic Spiking Oscillator Networks

    SciTech Connect

    Nakano, Hidehiro; Utani, Akihide; Miyauchi, Arata; Yamamoto, Hisao

    2011-04-19

    This paper studies chaos-based data gathering scheme in multiple sink wireless sensor networks. In the proposed scheme, each wireless sensor node has a simple chaotic oscillator. The oscillators generate spike signals with chaotic interspike intervals, and are impulsively coupled by the signals via wireless communication. Each wireless sensor node transmits and receives sensor information only in the timing of the couplings. The proposed scheme can exhibit various chaos synchronous phenomena and their breakdown phenomena, and can effectively gather sensor information with the significantly small number of transmissions and receptions compared with the conventional scheme. Also, the proposed scheme can flexibly adapt various wireless sensor networks not only with a single sink node but also with multiple sink nodes. This paper introduces our previous works. Through simulation experiments, we show effectiveness of the proposed scheme and discuss its development potential.

  3. A User Authentication Scheme Based on Elliptic Curves Cryptography for Wireless Ad Hoc Networks.

    PubMed

    Chen, Huifang; Ge, Linlin; Xie, Lei

    2015-07-14

    The feature of non-infrastructure support in a wireless ad hoc network (WANET) makes it suffer from various attacks. Moreover, user authentication is the first safety barrier in a network. A mutual trust is achieved by a protocol which enables communicating parties to authenticate each other at the same time and to exchange session keys. For the resource-constrained WANET, an efficient and lightweight user authentication scheme is necessary. In this paper, we propose a user authentication scheme based on the self-certified public key system and elliptic curves cryptography for a WANET. Using the proposed scheme, an efficient two-way user authentication and secure session key agreement can be achieved. Security analysis shows that our proposed scheme is resilient to common known attacks. In addition, the performance analysis shows that our proposed scheme performs similar or better compared with some existing user authentication schemes.

  4. Multiple-image encryption scheme based on cascaded fractional Fourier transform.

    PubMed

    Kong, Dezhao; Shen, Xueju; Xu, Qinzu; Xin, Wang; Guo, Haiqiong

    2013-04-20

    A multiple-image encryption scheme based on cascaded fractional Fourier transform is proposed. In the scheme, images are successively coded into the amplitude and phase of the input by cascading stages, which ends up with an encrypted image and a series of keys. The scheme takes full advantage of multikeys and the cascaded relationships of all stages, and it not only realizes image encryption but also achieves higher safety and more diverse applications. So multiuser authentication and hierarchical encryption are achieved. Numerical simulation verifies the feasibility of the method and demonstrates the security of the scheme and decryption characteristics. Finally, flexibility and variability of the scheme in application are discussed, and the simple photoelectric mixed devices to realize the scheme are proposed.

  5. A User Authentication Scheme Based on Elliptic Curves Cryptography for Wireless Ad Hoc Networks

    PubMed Central

    Chen, Huifang; Ge, Linlin; Xie, Lei

    2015-01-01

    The feature of non-infrastructure support in a wireless ad hoc network (WANET) makes it suffer from various attacks. Moreover, user authentication is the first safety barrier in a network. A mutual trust is achieved by a protocol which enables communicating parties to authenticate each other at the same time and to exchange session keys. For the resource-constrained WANET, an efficient and lightweight user authentication scheme is necessary. In this paper, we propose a user authentication scheme based on the self-certified public key system and elliptic curves cryptography for a WANET. Using the proposed scheme, an efficient two-way user authentication and secure session key agreement can be achieved. Security analysis shows that our proposed scheme is resilient to common known attacks. In addition, the performance analysis shows that our proposed scheme performs similar or better compared with some existing user authentication schemes. PMID:26184224

  6. Force feedback microscopy based on an optical beam deflection scheme

    SciTech Connect

    Vitorino, Miguel V.; Rodrigues, Mario S.; Carpentier, Simon; Costa, Luca

    2014-07-07

    Force feedback microscopy circumvents the jump to contact in atomic force microscopy when using soft cantilevers and quantitatively measures the interaction properties at the nanoscale by simultaneously providing force, force gradient, and dissipation. The force feedback microscope developed so far used an optical cavity to measure the tip displacement. In this Letter, we show that the more conventional optical beam deflection scheme can be used to the same purpose. With this instrument, we have followed the evolution of the Brownian motion of the tip under the influence of a water bridge.

  7. Efficient spin injector scheme based on Heusler materials.

    PubMed

    Chadov, Stanislav; Graf, Tanja; Chadova, Kristina; Dai, Xuefang; Casper, Frederick; Fecher, Gerhard H; Felser, Claudia

    2011-07-22

    We present a rational design scheme intended to provide stable high spin polarization at the interfaces of the magnetoresistive junctions by fulfilling the criteria of structural and chemical compatibilities at the interface. This can be realized by joining the semiconducting and half-metallic Heusler materials with similar structures. The present first-principles calculations verify that the interface remains half-metallic if the nearest interface layers effectively form a stable Heusler material with the properties intermediately between the surrounding bulk parts. This leads to a simple rule for selecting the proper combinations.

  8. A proactive quantum secret sharing scheme based on GHZ state

    NASA Astrophysics Data System (ADS)

    Qin, Huawang; Zhu, Xiaohua; Dai, Yuewei

    2015-09-01

    A proactive quantum secret sharing scheme is proposed, in which the participants can update their shadows periodically. In an updating period, one participant randomly generates the GHZ states and sends the particles to the other participants, and the participants update their shadows according to the measurement performed on the particles. After an updating period, each participant can change his shadow but the secret is changeless. The old shadows will be useless even if they have been stolen by the attacker. The proactive property is very useful to resist the mobile attacker.

  9. Scenario-Based Multi-Objective Optimum Allocation Model for Earthquake Emergency Shelters Using a Modified Particle Swarm Optimization Algorithm: A Case Study in Chaoyang District, Beijing, China

    PubMed Central

    Zhao, Xiujuan; Xu, Wei; Ma, Yunjia; Hu, Fuyu

    2015-01-01

    The correct location of earthquake emergency shelters and their allocation to residents can effectively reduce the number of casualties by providing safe havens and efficient evacuation routes during the chaotic period of the unfolding disaster. However, diverse and strict constraints and the discrete feasible domain of the required models make the problem of shelter location and allocation more difficult. A number of models have been developed to solve this problem, but there are still large differences between the models and the actual situation because the characteristics of the evacuees and the construction costs of the shelters have been excessively simplified. We report here the development of a multi-objective model for the allocation of residents to earthquake shelters by considering these factors using the Chaoyang district, Beijing, China as a case study. The two objectives of this model were to minimize the total weighted evacuation time from residential areas to a specified shelter and to minimize the total area of all the shelters. The two constraints were the shelter capacity and the service radius. Three scenarios were considered to estimate the number of people who would need to be evacuated. The particle swarm optimization algorithm was first modified by applying the von Neumann structure in former loops and global structure in later loops, and then used to solve this problem. The results show that increasing the shelter area can result in a large decrease in the total weighted evacuation time from scheme 1 to scheme 9 in scenario A, from scheme 1 to scheme 9 in scenario B, from scheme 1 to scheme 19 in scenario C. If the funding were not a limitation, then the final schemes of each scenario are the best solutions, otherwise the earlier schemes are more reasonable. The modified model proved to be useful for the optimization of shelter allocation, and the result can be used as a scientific reference for planning shelters in the Chaoyang district

  10. Scenario-Based Multi-Objective Optimum Allocation Model for Earthquake Emergency Shelters Using a Modified Particle Swarm Optimization Algorithm: A Case Study in Chaoyang District, Beijing, China.

    PubMed

    Zhao, Xiujuan; Xu, Wei; Ma, Yunjia; Hu, Fuyu

    2015-01-01

    The correct location of earthquake emergency shelters and their allocation to residents can effectively reduce the number of casualties by providing safe havens and efficient evacuation routes during the chaotic period of the unfolding disaster. However, diverse and strict constraints and the discrete feasible domain of the required models make the problem of shelter location and allocation more difficult. A number of models have been developed to solve this problem, but there are still large differences between the models and the actual situation because the characteristics of the evacuees and the construction costs of the shelters have been excessively simplified. We report here the development of a multi-objective model for the allocation of residents to earthquake shelters by considering these factors using the Chaoyang district, Beijing, China as a case study. The two objectives of this model were to minimize the total weighted evacuation time from residential areas to a specified shelter and to minimize the total area of all the shelters. The two constraints were the shelter capacity and the service radius. Three scenarios were considered to estimate the number of people who would need to be evacuated. The particle swarm optimization algorithm was first modified by applying the von Neumann structure in former loops and global structure in later loops, and then used to solve this problem. The results show that increasing the shelter area can result in a large decrease in the total weighted evacuation time from scheme 1 to scheme 9 in scenario A, from scheme 1 to scheme 9 in scenario B, from scheme 1 to scheme 19 in scenario C. If the funding were not a limitation, then the final schemes of each scenario are the best solutions, otherwise the earlier schemes are more reasonable. The modified model proved to be useful for the optimization of shelter allocation, and the result can be used as a scientific reference for planning shelters in the Chaoyang district

  11. A Multihop Key Agreement Scheme for Wireless Ad Hoc Networks Based on Channel Characteristics

    PubMed Central

    Yu, Nenghai

    2013-01-01

    A number of key agreement schemes based on wireless channel characteristics have been proposed recently. However, previous key agreement schemes require that two nodes which need to agree on a key are within the communication range of each other. Hence, they are not suitable for multihop wireless networks, in which nodes do not always have direct connections with each other. In this paper, we first propose a basic multihop key agreement scheme for wireless ad hoc networks. The proposed basic scheme is resistant to external eavesdroppers. Nevertheless, this basic scheme is not secure when there exist internal eavesdroppers or Man-in-the-Middle (MITM) adversaries. In order to cope with these adversaries, we propose an improved multihop key agreement scheme. We show that the improved scheme is secure against internal eavesdroppers and MITM adversaries in a single path. Both performance analysis and simulation results demonstrate that the improved scheme is efficient. Consequently, the improved key agreement scheme is suitable for multihop wireless ad hoc networks. PMID:23766725

  12. Security enhancement of a biometric based authentication scheme for telecare medicine information systems with nonce.

    PubMed

    Mishra, Dheerendra; Mukhopadhyay, Sourav; Kumari, Saru; Khan, Muhammad Khurram; Chaturvedi, Ankita

    2014-05-01

    Telecare medicine information systems (TMIS) present the platform to deliver clinical service door to door. The technological advances in mobile computing are enhancing the quality of healthcare and a user can access these services using its mobile device. However, user and Telecare system communicate via public channels in these online services which increase the security risk. Therefore, it is required to ensure that only authorized user is accessing the system and user is interacting with the correct system. The mutual authentication provides the way to achieve this. Although existing schemes are either vulnerable to attacks or they have higher computational cost while an scalable authentication scheme for mobile devices should be secure and efficient. Recently, Awasthi and Srivastava presented a biometric based authentication scheme for TMIS with nonce. Their scheme only requires the computation of the hash and XOR functions.pagebreak Thus, this scheme fits for TMIS. However, we observe that Awasthi and Srivastava's scheme does not achieve efficient password change phase. Moreover, their scheme does not resist off-line password guessing attack. Further, we propose an improvement of Awasthi and Srivastava's scheme with the aim to remove the drawbacks of their scheme.

  13. A multihop key agreement scheme for wireless ad hoc networks based on channel characteristics.

    PubMed

    Hao, Zhuo; Zhong, Sheng; Yu, Nenghai

    2013-01-01

    A number of key agreement schemes based on wireless channel characteristics have been proposed recently. However, previous key agreement schemes require that two nodes which need to agree on a key are within the communication range of each other. Hence, they are not suitable for multihop wireless networks, in which nodes do not always have direct connections with each other. In this paper, we first propose a basic multihop key agreement scheme for wireless ad hoc networks. The proposed basic scheme is resistant to external eavesdroppers. Nevertheless, this basic scheme is not secure when there exist internal eavesdroppers or Man-in-the-Middle (MITM) adversaries. In order to cope with these adversaries, we propose an improved multihop key agreement scheme. We show that the improved scheme is secure against internal eavesdroppers and MITM adversaries in a single path. Both performance analysis and simulation results demonstrate that the improved scheme is efficient. Consequently, the improved key agreement scheme is suitable for multihop wireless ad hoc networks.

  14. Motion-based wake-up scheme for ambulatory monitoring in wireless body sensor networks.

    PubMed

    Pek, Isaac; Waluyo, Agustinus Borgy; Yeoh, Wee-Soon; Chen, Xiang

    2009-01-01

    Given that wearable sensors that are attached on patients for the purpose of continuous real-time medical monitoring typically need to remain operational for periods of up to 24 hours before a battery change or recharge, power preservation schemes play a critical role in minimizing any possible disruption to a patient's daily activities. In this paper, we propose a motion-based wake-up scheme, a feature which combines motion detection with existing power preservation schemes in order to achieve a balance between energy saving and data timeliness, particularly in critical situations. As a showcase, we have integrated this feature with a healthcare application and demonstrate the capability of the scheme to deal with critical events, e.g., when a patient falls down from the bed. This showcase affirms the effective uses of our proposed motion-based wake-up scheme.

  15. The choice between allocation principles: amplifying when equality dominates.

    PubMed

    Eek, Daniel; Selart, Marcus

    2009-04-01

    One hundred and ninety participants (95 undergraduates and 95 employees) responded to a factorial survey in which a number of case-based organizational allocation tasks were described. Participants were asked to imagine themselves as employees in fictitious organizations and chose among three allocations of employee-development schemes invested by the manager in different work groups. The allocations regarded how such investments should be allocated between two parties. Participants chose twice, once picking the fairest and once the best allocation. One between-subjects factor varied whether the parties represented social (i.e., choosing among allocations between two different work groups) or temporal comparisons (i.e., choosing among allocations between the present and the following year). Another between-subjects factor varied whether participants' in-group was represented by the parties or not. One allocation maximized the outcome to one party, another maximized the joint outcome received by both parties, and a third provided both parties with equal but lower outcomes. It was predicted that equality, although always deficient to both parties, would be the preferred allocation when parties represented social comparisons and when choices were based on fairness. When parties represented temporal comparisons, and when choices were based on preference, maximizing the joint outcome was hypothesized to be the preferred allocation. Results supported these hypotheses. Against what was predicted, whether the in-group was represented by the parties or not did not moderate the results, indicating that participants' allocation preferences were not affected by self-interest. The main message is that people make sensible distinctions between what they prefer and what they regard as fair. The results were the same for participating students who imagined themselves as being employees and participants who were true employees, suggesting that no serious threats to external

  16. Environmental control of carbon allocation matters for modelling forest growth.

    PubMed

    Guillemot, Joannès; Francois, Christophe; Hmimina, Gabriel; Dufrêne, Eric; Martin-StPaul, Nicolas K; Soudani, Kamel; Marie, Guillaume; Ourcival, Jean-Marc; Delpierre, Nicolas

    2017-04-01

    We aimed to evaluate the importance of modulations of within-tree carbon (C) allocation by water and low-temperature stress for the prediction of annual forest growth with a process-based model. A new C allocation scheme was implemented in the CASTANEA model that accounts for lagged and direct environmental controls of C allocation. Different approaches (static vs dynamic) to modelling C allocation were then compared in a model-data fusion procedure, using satellite-derived leaf production estimates and biometric measurements at c. 10(4) sites. The modelling of the environmental control of C allocation significantly improved the ability of CASTANEA to predict the spatial and year-to-year variability of aboveground forest growth along regional gradients. A significant effect of the previous year's water stress on the C allocation to leaves and wood was reported. Our results also are consistent with a prominent role of the environmental modulation of sink demand in the wood growth of the studied species. Data available at large scales can inform forest models about the processes driving annual and seasonal C allocation. Our results call for a greater consideration of C allocation drivers, especially sink-demand fluctuations, for the simulations of current and future forest productivity with process-based models.

  17. Channel Allocation Options.

    ERIC Educational Resources Information Center

    Powers, Robert S.

    The Frequency Allocation Subcommittee of the Coordinating Committee for Cable Communication Systems, Institute of Electrical and Electronic Engineers, was formed to produce a background report on the general problems of frequency allocation and assignments in cable television. The present paper, based on the subcommittee's interim report,…

  18. Security Encryption Scheme for Communication of Web Based Control Systems

    NASA Astrophysics Data System (ADS)

    Robles, Rosslin John; Kim, Tai-Hoon

    A control system is a device or set of devices to manage, command, direct or regulate the behavior of other devices or systems. The trend in most systems is that they are connected through the Internet. Traditional Supervisory Control and Data Acquisition Systems (SCADA) is connected only in a limited private network Since the internet Supervisory Control and Data Acquisition Systems (SCADA) facility has brought a lot of advantages in terms of control, data viewing and generation. Along with these advantages, are security issues regarding web SCADA, operators are pushed to connect Control Systems through the internet. Because of this, many issues regarding security surfaced. In this paper, we discuss web SCADA and the issues regarding security. As a countermeasure, a web SCADA security solution using crossed-crypto-scheme is proposed to be used in the communication of SCADA components.

  19. A novel dynamical community detection algorithm based on weighting scheme

    NASA Astrophysics Data System (ADS)

    Li, Ju; Yu, Kai; Hu, Ke

    2015-12-01

    Network dynamics plays an important role in analyzing the correlation between the function properties and the topological structure. In this paper, we propose a novel dynamical iteration (DI) algorithm, which incorporates the iterative process of membership vector with weighting scheme, i.e. weighting W and tightness T. These new elements can be used to adjust the link strength and the node compactness for improving the speed and accuracy of community structure detection. To estimate the optimal stop time of iteration, we utilize a new stability measure which is defined as the Markov random walk auto-covariance. We do not need to specify the number of communities in advance. It naturally supports the overlapping communities by associating each node with a membership vector describing the node's involvement in each community. Theoretical analysis and experiments show that the algorithm can uncover communities effectively and efficiently.

  20. Sparse Parallel MRI Based on Accelerated Operator Splitting Schemes

    PubMed Central

    Xie, Weisi; Su, Zhenghang

    2016-01-01

    Recently, the sparsity which is implicit in MR images has been successfully exploited for fast MR imaging with incomplete acquisitions. In this paper, two novel algorithms are proposed to solve the sparse parallel MR imaging problem, which consists of l1 regularization and fidelity terms. The two algorithms combine forward-backward operator splitting and Barzilai-Borwein schemes. Theoretically, the presented algorithms overcome the nondifferentiable property in l1 regularization term. Meanwhile, they are able to treat a general matrix operator that may not be diagonalized by fast Fourier transform and to ensure that a well-conditioned optimization system of equations is simply solved. In addition, we build connections between the proposed algorithms and the state-of-the-art existing methods and prove their convergence with a constant stepsize in Appendix. Numerical results and comparisons with the advanced methods demonstrate the efficiency of proposed algorithms. PMID:27746824

  1. An enhanced biometric-based authentication scheme for telecare medicine information systems using elliptic curve cryptosystem.

    PubMed

    Lu, Yanrong; Li, Lixiang; Peng, Haipeng; Yang, Yixian

    2015-03-01

    The telecare medical information systems (TMISs) enable patients to conveniently enjoy telecare services at home. The protection of patient's privacy is a key issue due to the openness of communication environment. Authentication as a typical approach is adopted to guarantee confidential and authorized interaction between the patient and remote server. In order to achieve the goals, numerous remote authentication schemes based on cryptography have been presented. Recently, Arshad et al. (J Med Syst 38(12): 2014) presented a secure and efficient three-factor authenticated key exchange scheme to remedy the weaknesses of Tan et al.'s scheme (J Med Syst 38(3): 2014). In this paper, we found that once a successful off-line password attack that results in an adversary could impersonate any user of the system in Arshad et al.'s scheme. In order to thwart these security attacks, an enhanced biometric and smart card based remote authentication scheme for TMISs is proposed. In addition, the BAN logic is applied to demonstrate the completeness of the enhanced scheme. Security and performance analyses show that our enhanced scheme satisfies more security properties and less computational cost compared with previously proposed schemes.

  2. Evaluation of Superimposed Sequence Components of Currents based Islanding Detection Scheme during DG Interconnections

    NASA Astrophysics Data System (ADS)

    Sareen, Karan; Bhalja, Bhavesh R.; Maheshwari, Rudra Prakash

    2016-02-01

    A new islanding detection scheme for distribution network containing different types of distributed generations (DGs) is presented in this paper. The proposed scheme is based on acquiring three phase current samples for full cycle duration of each simulation case of islanding/non-islanding conditions at the point of common coupling (PCC) of the targeted DG. Afterwards, superimposed positive & negative sequence components of current are calculated and continuously compared with pre-determined threshold values. Performance of the proposed scheme has been evaluated on diversified islanding and non-islanding events which were generated by modeling standard IEEE 34-bus system using PSCAD/EMTDC software package. The proposed scheme is capable to detect islanding condition rapidly even for perfect power balance situation for both synchronous and inverter based DGs. Furthermore, it remains stable during non-islanding events such as tripping of multiple DGs and different DG interconnection operating conditions. Therefore, the proposed scheme avoids nuisance tripping during diversified non-islanding events. At the end, comparison of the proposed scheme with the existing scheme clearly indicates its advantage over the existing scheme.

  3. Optimal Power Allocation for CC-HARQ-based Cognitive Radio with Statistical CSI in Nakagami Slow Fading Channels

    NASA Astrophysics Data System (ADS)

    Xu, Ding; Li, Qun

    2017-01-01

    This paper addresses the power allocation problem for cognitive radio (CR) based on hybrid-automatic-repeat-request (HARQ) with chase combining (CC) in Nakagamimslow fading channels. We assume that, instead of the perfect instantaneous channel state information (CSI), only the statistical CSI is available at the secondary user (SU) transmitter. The aim is to minimize the SU outage probability under the primary user (PU) interference outage constraint. Using the Lagrange multiplier method, an iterative and recursive algorithm is derived to obtain the optimal power allocation for each transmission round. Extensive numerical results are presented to illustrate the performance of the proposed algorithm.

  4. FIELD TESTS OF GEOGRAPHICALLY-DEPENDENT VS. THRESHOLD-BASED WATERSHED CLASSIFICATION SCHEMES IN THE GREAT LAKES BASIN

    EPA Science Inventory

    We compared classification schemes based on watershed storage (wetland + lake area/watershed area) and forest fragmentation with a geographically-based classification scheme for two case studies involving 1) Lake Superior tributaries and 2) watersheds of riverine coastal wetlands...

  5. FIELD TESTS OF GEOGRAPHICALLY-DEPENDENT VS. THRESHOLD-BASED WATERSHED CLASSIFICATION SCHEMED IN THE GREAT LAKES BASIN

    EPA Science Inventory

    We compared classification schemes based on watershed storage (wetland + lake area/watershed area) and forest fragmentation with a geographically-based classification scheme for two case studies involving 1)Lake Superior tributaries and 2) watersheds of riverine coastal wetlands ...

  6. A target coverage scheduling scheme based on genetic algorithms in directional sensor networks.

    PubMed

    Gil, Joon-Min; Han, Youn-Hee

    2011-01-01

    As a promising tool for monitoring the physical world, directional sensor networks (DSNs) consisting of a large number of directional sensors are attracting increasing attention. As directional sensors in DSNs have limited battery power and restricted angles of sensing range, maximizing the network lifetime while monitoring all the targets in a given area remains a challenge. A major technique to conserve the energy of directional sensors is to use a node wake-up scheduling protocol by which some sensors remain active to provide sensing services, while the others are inactive to conserve their energy. In this paper, we first address a Maximum Set Covers for DSNs (MSCD) problem, which is known to be NP-complete, and present a greedy algorithm-based target coverage scheduling scheme that can solve this problem by heuristics. This scheme is used as a baseline for comparison. We then propose a target coverage scheduling scheme based on a genetic algorithm that can find the optimal cover sets to extend the network lifetime while monitoring all targets by the evolutionary global search technique. To verify and evaluate these schemes, we conducted simulations and showed that the schemes can contribute to extending the network lifetime. Simulation results indicated that the genetic algorithm-based scheduling scheme had better performance than the greedy algorithm-based scheme in terms of maximizing network lifetime.

  7. Perception-based Co-evolutionary Reinforcement Learning for UAV Sensor Allocation

    DTIC Science & Technology

    2003-02-01

    reinforcement learning was developed for jointly addressing sensor allocation on each individual UAV and allocation of a team of UAVs in the geographical search space. An elaborate problem setup was simulated and experimented with, for testing and analysis of this framework using the Player-Stage multi-agent simulator. This simulator was developed jointly at the USC Robotics Research Lab and HRL Labs.The experimental results demonstrated a very strong performance of our methodology for UAV sensor allocation problem domains. Our results indicate that not only it is feasible

  8. The method of registration of screw dislocations in polychromatic light based on the Young's interference scheme

    NASA Astrophysics Data System (ADS)

    Shostka, N. V.

    2011-06-01

    A new experimental method of registration of phase dislocations in polychromatic light is proposed and described, which is based on the Young's interference scheme using the screen with lots of pairs of holes.

  9. Joint Mode Selection and Resource Allocation for Cellular Controlled Short-Range Communication in OFDMA Networks

    NASA Astrophysics Data System (ADS)

    Deng, Hui; Tao, Xiaoming; Ge, Ning; Lu, Jianhua

    This letter studies cellular controlled short-range communication in OFDMA networks. The network needs to decide when to allow direct communication between a closely located device-to-device (D2D) pair instead of conveying data from one device to the other via the base station and when not to, in addition to subchannel and power allocation. Our goal is to maximize the total network throughput while guaranteeing the rate requirements of all users. For that purpose, we formulate an optimization problem subject to subchannel and power constraints. A scheme which combines a joint mode selection and subchannel allocation algorithm based on equal power allocation with a power reallocation scheme is proposed. Simulation results show that our proposed scheme can improve the network throughput and outage probability compared with other schemes.

  10. Asynchronous error-correcting secure communication scheme based on fractional-order shifting chaotic system

    NASA Astrophysics Data System (ADS)

    Chao, Luo

    2015-11-01

    In this paper, a novel digital secure communication scheme is firstly proposed. Different from the usual secure communication schemes based on chaotic synchronization, the proposed scheme employs asynchronous communication which avoids the weakness of synchronous systems and is susceptible to environmental interference. Moreover, as to the transmission errors and data loss in the process of communication, the proposed scheme has the ability to be error-checking and error-correcting in real time. In order to guarantee security, the fractional-order complex chaotic system with the shifting of order is utilized to modulate the transmitted signal, which has high nonlinearity and complexity in both frequency and time domains. The corresponding numerical simulations demonstrate the effectiveness and feasibility of the scheme.

  11. Security analysis of the unrestricted identity-based aggregate signature scheme.

    PubMed

    Lee, Kwangsu; Lee, Dong Hoon

    2015-01-01

    Aggregate signatures allow anyone to combine different signatures signed by different signers on different messages into a short signature. An ideal aggregate signature scheme is an identity-based aggregate signature (IBAS) scheme that supports full aggregation since it can reduce the total transmitted data by using an identity string as a public key and anyone can freely aggregate different signatures. Constructing a secure IBAS scheme that supports full aggregation in bilinear maps is an important open problem. Recently, Yuan et al. proposed such a scheme and claimed its security in the random oracle model under the computational Diffie-Hellman assumption. In this paper, we show that there is an efficient forgery on their IBAS scheme and that their security proof has a serious flaw.

  12. Breaking and Fixing of an Identity Based Multi-Signcryption Scheme

    NASA Astrophysics Data System (ADS)

    Selvi, S. Sharmila Deva; Vivek, S. Sree; Rangan, C. Pandu

    Signcryption is a cryptographic primitive that provides authentication and confidentiality simultaneously in a single logical step. It is often required that multiple senders have to signcrypt a single message to a certain receiver. Obviously, it is inefficient to signcrypt the messages separately. An efficient alternative is to go for multi-signcryption. The concept of multi-signcryption is similar to that of multi-signatures with the added property - confidentiality. Recently, Jianhong et al. proposed an identity based multi-signcryption scheme. They claimed that their scheme is secure against adaptive chosen ciphertext attack and it is existentially unforgeable. In this paper, we show that their scheme is not secure against chosen plaintext attack and is existentially forgeable, we also provide a fix for the scheme and prove formally that the improved scheme is secure against both adaptive chosen ciphertext attack and existential forgery.

  13. A multi-label image annotation scheme based on improved SVM multiple kernel learning

    NASA Astrophysics Data System (ADS)

    Jin, Cong; Jin, Shu-Wei

    2017-02-01

    Multi-label image annotation (MIA) has been widely studied during recent years and many MIA schemes have been proposed. However, the most existing schemes are not satisfactory. In this paper, an improved multiple kernel learning (IMKL) method of support vector machine (SVM) is proposed to improve the classification accuracy of SVM, then a novel MIA scheme based on IMKL is presented, which uses the discriminant loss to control the number of top semantic labels, and the feature selection approach is also used for improving the performance of MIA. The experiment results show that proposed MIA scheme achieves higher the performance than the existing other MIA schemes, its performance is satisfactory for large image dataset.

  14. Security Analysis of the Unrestricted Identity-Based Aggregate Signature Scheme

    PubMed Central

    Lee, Kwangsu; Lee, Dong Hoon

    2015-01-01

    Aggregate signatures allow anyone to combine different signatures signed by different signers on different messages into a short signature. An ideal aggregate signature scheme is an identity-based aggregate signature (IBAS) scheme that supports full aggregation since it can reduce the total transmitted data by using an identity string as a public key and anyone can freely aggregate different signatures. Constructing a secure IBAS scheme that supports full aggregation in bilinear maps is an important open problem. Recently, Yuan et al. proposed such a scheme and claimed its security in the random oracle model under the computational Diffie-Hellman assumption. In this paper, we show that there is an efficient forgery on their IBAS scheme and that their security proof has a serious flaw. PMID:25993247

  15. MDP-based resource allocation for triple-play transmission on xDSL systems

    NASA Astrophysics Data System (ADS)

    de Souza, Lamartine V.; de Carvalho, Glaucio H. S.; Cardoso, Diego L.; de Carvalho, Solon V.; Frances, Carlos R. L.; Costa, João C. W. A.; Riu, Jaume Rius i.

    2007-09-01

    Many broadband services are based on multimedia applications, such as voice over internet protocol (VoIP), video conferencing, video on demand (VoD), and internet protocol television (IPTV). The combination "triple-play" is often used with IPTV. It simply means offering voice, video and data. IPTV and others services uses digital broadband networks such as ADSL2+ (Asymmetric Digital Subscriber Line) and VDSL (Very High Rate DSL) to transmit the data. We have formulated a MDP (Markov Decision Process) for a triple-play transmission on DSL environment. In this paper, we establish the relationship between DSL transmission characteristics and its finite-state Markov model for a triple-play transmission system. This relationship can be used for a resource management for multimedia applications delivered through a broadband infrastructure. The solution to our optimization problem can be found using dynamic programming (DP) techniques, such as value iteration and its variants. Our study results in a transmission strategy that chooses the optimal resource allocation according the triple-play traffic requirements, defined in technical report TR-126 (Triple-Play Services Quality of Experience Requirements) from DSL Forum, minimizing quality of service (QoS) violations with respect to bandwidth. Three traffic classes (video, audio, and best effort internet data) are defined and analyzed. Our simulation results show parameters like as blocking probability for each class, link utilization and optimal control policies. The MDP-based approach provides a satisfactory way of resource management for a DSL system.

  16. Application-oriented region of interest based image compression using bit-allocation optimization

    NASA Astrophysics Data System (ADS)

    Zhu, Yuanping

    2015-01-01

    Region of interest (ROI) based image compression can offer a high image-compression ratio along with high quality in the important regions of the image. For many applications, stable compression quality is required for both the ROIs and the images. However, image compression does not consider information specific to the application and cannot meet this requirement well. This paper proposes an application-oriented ROI-based image-compression method using bit-allocation optimization. Unlike typical methods that define bit-rate parameters empirically, the proposed method adjusts the bit-rate parameters adaptively to both images and ROIs. First, an application-dependent optimization model is constructed. The relationship between the compression parameters and the image content is learned from a training image set. Image redundancy is used to measure the compression capability of image content. Then, during compression, the global bit rate and the ROI bit rate are adjusted in the images and ROIs, respectively-supported by the application-dependent information in the optimization model. As a result, stable compression quality is assured in the applications. Experiments with two different applications showed that quality deviation in the reconstructed images decreased, verifying the effectiveness of the proposed method.

  17. Comparison of horizontal dust fluxes simulated with two dust emission schemes based on field experiments in Xinjiang, China

    NASA Astrophysics Data System (ADS)

    Yang, Xinghua; Yang, Fan; Liu, Xinchun; Huo, Wen; He, Qing; Mamtimin, Ali; Zhang, Qingyu

    2016-10-01

    Horizontal dust fluxes were simulated with two different dust emission schemes developed by Marticorena and Shao (hereinafter referred to as the M scheme, S scheme, and S scheme corrections), based on field experiments over a bare desert surface and a vegetated desert surface from May 19 to June 18, 2010 in Xinjiang, China. The M scheme produced a much higher dust emission than the S schemes over different surface conditions, with the emission being about 4 times larger than that produced by the S schemes over the bare desert, and 3 to 200 times larger over the vegetated surface. Compared to observations, the missing report rate of wind erosion events was about 30 % for the S schemes and about 10 % for the M scheme over the bare desert surface, while all schemes had a false alarm rate of wind erosion events over the vegetated desert surface. The total dust emission from the bare desert surface during the study period was 674.4, 551.5, 595.2, and 2995.8 kg/m for observation, the S scheme, S scheme correction 2, and M scheme, respectively. Total dust emission from the vegetated desert surface was 1.6, 0, 55.5, 0.9, and 227.7 kg/m for observation, the S scheme, S scheme correction 1, S scheme correction 2, and M scheme, respectively.

  18. A Contourlet-Based Embedded Image Coding Scheme on Low Bit-Rate

    NASA Astrophysics Data System (ADS)

    Song, Haohao; Yu, Songyu

    Contourlet transform (CT) is a new image representation method, which can efficiently represent contours and textures in images. However, CT is a kind of overcomplete transform with a redundancy factor of 4/3. If it is applied to image compression straightforwardly, the encoding bit-rate may increase to meet a given distortion. This fact baffles the coding community to develop CT-based image compression techniques with satisfactory performance. In this paper, we analyze the distribution of significant contourlet coefficients in different subbands and propose a new contourlet-based embedded image coding (CEIC) scheme on low bit-rate. The well-known wavelet-based embedded image coding (WEIC) algorithms such as EZW, SPIHT and SPECK can be easily integrated into the proposed scheme by constructing a virtual low frequency subband, modifying the coding framework of WEIC algorithms according to the structure of contourlet coefficients, and adopting a high-efficiency significant coefficient scanning scheme for CEIC scheme. The proposed CEIC scheme can provide an embedded bit-stream, which is desirable in heterogeneous networks. Our experiments demonstrate that the proposed scheme can achieve the better compression performance on low bit-rate. Furthermore, thanks to the contourlet adopted in the proposed scheme, more contours and textures in the coded images are preserved to ensure the superior subjective quality.

  19. Robust ECC-based authenticated key agreement scheme with privacy protection for Telecare medicine information systems.

    PubMed

    Zhang, Liping; Zhu, Shaohui

    2015-05-01

    To protect the transmission of the sensitive medical data, a secure and efficient authenticated key agreement scheme should be deployed when the healthcare delivery session is established via Telecare Medicine Information Systems (TMIS) over the unsecure public network. Recently, Islam and Khan proposed an authenticated key agreement scheme using elliptic curve cryptography for TMIS. They claimed that their proposed scheme is provably secure against various attacks in random oracle model and enjoys some good properties such as user anonymity. In this paper, however, we point out that any legal but malicious patient can reveal other user's identity. Consequently, their scheme suffers from server spoofing attack and off-line password guessing attack. Moreover, if the malicious patient performs the same time of the registration as other users, she can further launch the impersonation attack, man-in-the-middle attack, modification attack, replay attack, and strong replay attack successfully. To eliminate these weaknesses, we propose an improved ECC-based authenticated key agreement scheme. Security analysis demonstrates that the proposed scheme can resist various attacks and enables the patient to enjoy the remote healthcare services with privacy protection. Through the performance evaluation, we show that the proposed scheme achieves a desired balance between security and performance in comparisons with other related schemes.

  20. A Temporal Credential-Based Mutual Authentication with Multiple-Password Scheme for Wireless Sensor Networks

    PubMed Central

    Zhang, Ruisheng; Liu, Qidong

    2017-01-01

    Wireless sensor networks (WSNs), which consist of a large number of sensor nodes, have become among the most important technologies in numerous fields, such as environmental monitoring, military surveillance, control systems in nuclear reactors, vehicle safety systems, and medical monitoring. The most serious drawback for the widespread application of WSNs is the lack of security. Given the resource limitation of WSNs, traditional security schemes are unsuitable. Approaches toward withstanding related attacks with small overhead have thus recently been studied by many researchers. Numerous studies have focused on the authentication scheme for WSNs, but most of these works cannot achieve the security performance and overhead perfectly. Nam et al. proposed a two-factor authentication scheme with lightweight sensor computation for WSNs. In this paper, we review this scheme, emphasize its drawbacks, and propose a temporal credential-based mutual authentication with a multiple-password scheme for WSNs. Our scheme uses multiple passwords to achieve three-factor security performance and generate a session key between user and sensor nodes. The security analysis phase shows that our scheme can withstand related attacks, including a lost password threat, and the comparison phase shows that our scheme involves a relatively small overhead. In the comparison of the overhead phase, the result indicates that more than 95% of the overhead is composed of communication and not computation overhead. Therefore, the result motivates us to pay further attention to communication overhead than computation overhead in future research. PMID:28135288

  1. A Temporal Credential-Based Mutual Authentication with Multiple-Password Scheme for Wireless Sensor Networks.

    PubMed

    Liu, Xin; Zhang, Ruisheng; Liu, Qidong

    2017-01-01

    Wireless sensor networks (WSNs), which consist of a large number of sensor nodes, have become among the most important technologies in numerous fields, such as environmental monitoring, military surveillance, control systems in nuclear reactors, vehicle safety systems, and medical monitoring. The most serious drawback for the widespread application of WSNs is the lack of security. Given the resource limitation of WSNs, traditional security schemes are unsuitable. Approaches toward withstanding related attacks with small overhead have thus recently been studied by many researchers. Numerous studies have focused on the authentication scheme for WSNs, but most of these works cannot achieve the security performance and overhead perfectly. Nam et al. proposed a two-factor authentication scheme with lightweight sensor computation for WSNs. In this paper, we review this scheme, emphasize its drawbacks, and propose a temporal credential-based mutual authentication with a multiple-password scheme for WSNs. Our scheme uses multiple passwords to achieve three-factor security performance and generate a session key between user and sensor nodes. The security analysis phase shows that our scheme can withstand related attacks, including a lost password threat, and the comparison phase shows that our scheme involves a relatively small overhead. In the comparison of the overhead phase, the result indicates that more than 95% of the overhead is composed of communication and not computation overhead. Therefore, the result motivates us to pay further attention to communication overhead than computation overhead in future research.

  2. Enhancing of a Password-Based Authentication Scheme Using Smart Cards

    NASA Astrophysics Data System (ADS)

    Lee, Youngsook; Won, Dongho

    A password based remote user authentication scheme is a two-party protocol whereby an authentication server in a distributed system confirms the identity of a remote individual logging on to the server over an untrusted, open network. This paper discusses the security of Chen et al.'s remote user authentication scheme making use of smart cards. They have recently presented an improved version of Lin, Shen, and Hwang's scheme. But, unlike their claims, in Chen et al.'s scheme, if an attacker gains access to some user's smart card and extracts the information stored in the smart card, he/she can easily find out the user's password. We show this by mounting a dictionary attack on the scheme. In addition, Chen et al.'s scheme does not support its main security goal of authenticating between a remote individual and the server. This is shown via a sever impersonation attack on the scheme. Motivated by these security flaws, we propose a more secure remote user authentication scheme that achieves both two-factor security and mutual authentication.

  3. IP Packet Size Entropy-Based Scheme for Detection of DoS/DDoS Attacks

    NASA Astrophysics Data System (ADS)

    Du, Ping; Abe, Shunji

    Denial of service (DoS) attacks have become one of the most serious threats to the Internet. Enabling detection of attacks in network traffic is an important and challenging task. However, most existing volume-based schemes can not detect short-term attacks that have a minor effect on traffic volume. On the other hand, feature-based schemes are not suitable for real-time detection because of their complicated calculations. In this paper, we develop an IP packet size entropy (IPSE)-based DoS/DDoS detection scheme in which the entropy is markedly changed when traffic is affected by an attack. Through our analysis, we find that the IPSE-based scheme is capable of detecting not only long-term attacks but also short-term attacks that are beyond the volume-based schemes' ability to detect. Moreover, we test our proposal using two typical Internet traffic data sets from DARPA and SINET, and the test results show that the IPSE-based detection scheme can provide detection of DoS/DDoS attacks not only in a local area network (DARPA) and but also in academic backbone network (SINET).

  4. Testing conceptual and physically based soil hydrology schemes against observations for the Amazon Basin

    NASA Astrophysics Data System (ADS)

    Guimberteau, M.; Ducharne, A.; Ciais, P.; Boisier, J. P.; Peng, S.; De Weirdt, M.; Verbeeck, H.

    2014-06-01

    This study analyzes the performance of the two soil hydrology schemes of the land surface model ORCHIDEE in estimating Amazonian hydrology and phenology for five major sub-basins (Xingu, Tapajós, Madeira, Solimões and Negro), during the 29-year period 1980-2008. A simple 2-layer scheme with a bucket topped by an evaporative layer is compared to an 11-layer diffusion scheme. The soil schemes are coupled with a river routing module and a process model of plant physiology, phenology and carbon dynamics. The simulated water budget and vegetation functioning components are compared with several data sets at sub-basin scale. The use of the 11-layer soil diffusion scheme does not significantly change the Amazonian water budget simulation when compared to the 2-layer soil scheme (+3.1 and -3.0% in evapotranspiration and river discharge, respectively). However, the higher water-holding capacity of the soil and the physically based representation of runoff and drainage in the 11-layer soil diffusion scheme result in more dynamic soil water storage variation and improved simulation of the total terrestrial water storage when compared to GRACE satellite estimates. The greater soil water storage within the 11-layer scheme also results in increased dry-season evapotranspiration (+0.5 mm d-1, +17%) and improves river discharge simulation in the southeastern sub-basins such as the Xingu. Evapotranspiration over this sub-basin is sustained during the whole dry season with the 11-layer soil diffusion scheme, whereas the 2-layer scheme limits it after only 2 dry months. Lower plant drought stress simulated by the 11-layer soil diffusion scheme leads to better simulation of the seasonal cycle of photosynthesis (GPP) when compared to a GPP data-driven model based on eddy covariance and satellite greenness measurements. A dry-season length between 4 and 7 months over the entire Amazon Basin is found to be critical in distinguishing differences in hydrological feedbacks between the

  5. Allocating physicians' overhead costs to services: an econometric/accounting-activity based-approach.

    PubMed

    Peden, Al; Baker, Judith J

    2002-01-01

    Using the optimizing properties of econometric analysis, this study analyzes how physician overhead costs (OC) can be allocated to multiple activities to maximize precision in reimbursing the costs of services. Drawing on work by Leibenstein and Friedman, the analysis also shows that allocating OC to multiple activities unbiased by revenue requires controlling for revenue when making the estimates. Further econometric analysis shows that it is possible to save about 10 percent of OC by paying only for those that are necessary.

  6. Novel neural networks-based fault tolerant control scheme with fault alarm.

    PubMed

    Shen, Qikun; Jiang, Bin; Shi, Peng; Lim, Cheng-Chew

    2014-11-01

    In this paper, the problem of adaptive active fault-tolerant control for a class of nonlinear systems with unknown actuator fault is investigated. The actuator fault is assumed to have no traditional affine appearance of the system state variables and control input. The useful property of the basis function of the radial basis function neural network (NN), which will be used in the design of the fault tolerant controller, is explored. Based on the analysis of the design of normal and passive fault tolerant controllers, by using the implicit function theorem, a novel NN-based active fault-tolerant control scheme with fault alarm is proposed. Comparing with results in the literature, the fault-tolerant control scheme can minimize the time delay between fault occurrence and accommodation that is called the time delay due to fault diagnosis, and reduce the adverse effect on system performance. In addition, the FTC scheme has the advantages of a passive fault-tolerant control scheme as well as the traditional active fault-tolerant control scheme's properties. Furthermore, the fault-tolerant control scheme requires no additional fault detection and isolation model which is necessary in the traditional active fault-tolerant control scheme. Finally, simulation results are presented to demonstrate the efficiency of the developed techniques.

  7. Twin-Schnorr: a security upgrade for the Schnorr identity-based identification scheme.

    PubMed

    Chin, Ji-Jian; Tan, Syh-Yuan; Heng, Swee-Huay; Phan, Raphael Chung-Wei

    2015-01-01

    Most identity-based identification (IBI) schemes proposed in recent literature are built using pairing operations. This decreases efficiency due to the high operation costs of pairings. Furthermore, most of these IBI schemes are proven to be secure against impersonation under active and concurrent attacks using interactive assumptions such as the one-more RSA inversion assumption or the one-more discrete logarithm assumption, translating to weaker security guarantees due to the interactive nature of these assumptions. The Schnorr-IBI scheme was first proposed through the Kurosawa-Heng transformation from the Schnorr signature. It remains one of the fastest yet most secure IBI schemes under impersonation against passive attacks due to its pairing-free design. However, when required to be secure against impersonators under active and concurrent attacks, it deteriorates greatly in terms of efficiency due to the protocol having to be repeated multiple times. In this paper, we upgrade the Schnorr-IBI scheme to be secure against impersonation under active and concurrent attacks using only the classical discrete logarithm assumption. This translates to a higher degree of security guarantee with only some minor increments in operational costs. Furthermore, because the scheme operates without pairings, it still retains its efficiency and superiority when compared to other pairing-based IBI schemes.

  8. On the security flaws in ID-based password authentication schemes for telecare medical information systems.

    PubMed

    Mishra, Dheerendra

    2015-01-01

    Telecare medical information systems (TMIS) enable healthcare delivery services. However, access of these services via public channel raises security and privacy issues. In recent years, several smart card based authentication schemes have been introduced to ensure secure and authorized communication between remote entities over the public channel for the (TMIS). We analyze the security of some of the recently proposed authentication schemes of Lin, Xie et al., Cao and Zhai, and Wu and Xu's for TMIS. Unfortunately, we identify that these schemes failed to satisfy desirable security attributes. In this article we briefly discuss four dynamic ID-based authentication schemes and demonstrate their failure to satisfy desirable security attributes. The study is aimed to demonstrate how inefficient password change phase can lead to denial of server scenario for an authorized user, and how an inefficient login phase causes the communication and computational overhead and decrease the performance of the system. Moreover, we show the vulnerability of Cao and Zhai's scheme to known session specific temporary information attack, vulnerability of Wu and Xu's scheme to off-line password guessing attack, and vulnerability of Xie et al.'s scheme to untraceable on-line password guessing attack.

  9. Twin-Schnorr: A Security Upgrade for the Schnorr Identity-Based Identification Scheme

    PubMed Central

    Heng, Swee-Huay; Phan, Raphael Chung-Wei

    2015-01-01

    Most identity-based identification (IBI) schemes proposed in recent literature are built using pairing operations. This decreases efficiency due to the high operation costs of pairings. Furthermore, most of these IBI schemes are proven to be secure against impersonation under active and concurrent attacks using interactive assumptions such as the one-more RSA inversion assumption or the one-more discrete logarithm assumption, translating to weaker security guarantees due to the interactive nature of these assumptions. The Schnorr-IBI scheme was first proposed through the Kurosawa-Heng transformation from the Schnorr signature. It remains one of the fastest yet most secure IBI schemes under impersonation against passive attacks due to its pairing-free design. However, when required to be secure against impersonators under active and concurrent attacks, it deteriorates greatly in terms of efficiency due to the protocol having to be repeated multiple times. In this paper, we upgrade the Schnorr-IBI scheme to be secure against impersonation under active and concurrent attacks using only the classical discrete logarithm assumption. This translates to a higher degree of security guarantee with only some minor increments in operational costs. Furthermore, because the scheme operates without pairings, it still retains its efficiency and superiority when compared to other pairing-based IBI schemes. PMID:25692179

  10. [Study on water quality monitoring scheme based on non-point source pollution].

    PubMed

    Wu, Xi-Jun; Li, Huai-En; Li, Jia-Ke; Li, Qiang-Kun; Dong, Wen

    2013-06-01

    In order to improve standardization and normalization of non-point source pollution monitoring, this paper summarized the non-point source pollution monitoring scheme that based on conventional technology condition. The scheme firstly emphasized the preparation work before monitoring, including situation investigation and index selection of the monitoring area and so on; In the process of establishing monitoring scheme, the monitoring area was divided into three types: city, agriculture and watershed. Take urban area monitoring scheme for Xi'an as an example, through dividing function zone setting sampling point, summarized sampling time interval, frequency and sampling methods during a rainfall process. An irrigation district was an example for agricultural monitoring scheme, through unit division, setting sampling point at the approach channel and drain channel, introduced sampling times, interval time and so on in the process of irrigation. Watershed monitoring scheme's example was the Weihe GuanZhong section, raised the setting principle of each sample section, and analyzed each section's sampling law in the process of rainfall. Finally the principal character of different non-point source pollution monitoring areas was discussed, and concluded that non-point source pollution monitoring scheme is the base of non-point source pollution study and control.

  11. Integrated visual vocabulary in latent Dirichlet allocation-based scene classification for IKONOS image

    NASA Astrophysics Data System (ADS)

    Kusumaningrum, Retno; Wei, Hong; Manurung, Ruli; Murni, Aniati

    2014-01-01

    Scene classification based on latent Dirichlet allocation (LDA) is a more general modeling method known as a bag of visual words, in which the construction of a visual vocabulary is a crucial quantization process to ensure success of the classification. A framework is developed using the following new aspects: Gaussian mixture clustering for the quantization process, the use of an integrated visual vocabulary (IVV), which is built as the union of all centroids obtained from the separate quantization process of each class, and the usage of some features, including edge orientation histogram, CIELab color moments, and gray-level co-occurrence matrix (GLCM). The experiments are conducted on IKONOS images with six semantic classes (tree, grassland, residential, commercial/industrial, road, and water). The results show that the use of an IVV increases the overall accuracy (OA) by 11 to 12% and 6% when it is implemented on the selected and all features, respectively. The selected features of CIELab color moments and GLCM provide a better OA than the implementation over CIELab color moment or GLCM as individuals. The latter increases the OA by only ˜2 to 3%. Moreover, the results show that the OA of LDA outperforms the OA of C4.5 and naive Bayes tree by ˜20%.

  12. Task Allocation of Wasps Governed by Common Stomach: A Model Based on Electric Circuits

    PubMed Central

    2016-01-01

    Simple regulatory mechanisms based on the idea of the saturable ‘common stomach’ can control the regulation of construction behavior and colony-level responses to environmental perturbations in Metapolybia wasp societies. We mapped the different task groups to mutual inductance electrical circuits and used Kirchoff’s basic voltage laws to build a model that uses master equations from physics, yet is able to provide strong predictions for this complex biological phenomenon. Similar to real colonies, independently of the initial conditions, the system shortly sets into an equilibrium, which provides optimal task allocation for a steady construction, depending on the influx of accessible water. The system is very flexible and in the case of perturbations, it reallocates its workforce and adapts to the new situation with different equilibrium levels. Similar to the finding of field studies, decreasing any task groups caused decrease of construction; increasing or decreasing water inflow stimulated or reduced the work of other task groups while triggering compensatory behavior in water foragers. We also showed that only well connected circuits are able to produce adequate construction and this agrees with the finding that this type of task partitioning only exists in larger colonies. Studying the buffer properties of the common stomach and its effect on the foragers revealed that it provides stronger negative feedback to the water foragers, while the connection between the pulp foragers and the common stomach has a strong fixed-point attractor, as evidenced by the dissipative trajectory. PMID:27861633

  13. Performance-based workload assessment: Allocation strategy and added task sensitivity

    NASA Technical Reports Server (NTRS)

    Vidulich, Michael A.

    1990-01-01

    The preliminary results of a research program investigating the use of added tasks to evaluate mental workload are reviewed. The focus of the first studies was a reappraisal of the traditional secondary task logic that encouraged the use of low-priority instructions for the added task. It was believed that such low-priority tasks would encourage subjects to split their available resources among the two tasks. The primary task would be assigned all the resources it needed, and any remaining reserve capacity would be assigned to the secondary task. If the model were correct, this approach was expected to combine sensitivity to primary task difficulty with unintrusiveness to primary task performance. The first studies of the current project demonstrated that a high-priority added task, although intrusive, could be more sensitive than the traditional low-priority secondary task. These results suggested that a more appropriate model of the attentional effects associated with added task performance might be based on capacity switching, rather than the traditional optimal allocation model.

  14. Task Allocation of Wasps Governed by Common Stomach: A Model Based on Electric Circuits.

    PubMed

    Hilbun, Allison; Karsai, Istvan

    2016-01-01

    Simple regulatory mechanisms based on the idea of the saturable 'common stomach' can control the regulation of construction behavior and colony-level responses to environmental perturbations in Metapolybia wasp societies. We mapped the different task groups to mutual inductance electrical circuits and used Kirchoff's basic voltage laws to build a model that uses master equations from physics, yet is able to provide strong predictions for this complex biological phenomenon. Similar to real colonies, independently of the initial conditions, the system shortly sets into an equilibrium, which provides optimal task allocation for a steady construction, depending on the influx of accessible water. The system is very flexible and in the case of perturbations, it reallocates its workforce and adapts to the new situation with different equilibrium levels. Similar to the finding of field studies, decreasing any task groups caused decrease of construction; increasing or decreasing water inflow stimulated or reduced the work of other task groups while triggering compensatory behavior in water foragers. We also showed that only well connected circuits are able to produce adequate construction and this agrees with the finding that this type of task partitioning only exists in larger colonies. Studying the buffer properties of the common stomach and its effect on the foragers revealed that it provides stronger negative feedback to the water foragers, while the connection between the pulp foragers and the common stomach has a strong fixed-point attractor, as evidenced by the dissipative trajectory.

  15. Cryptanalysis and improvement of Yan et al.'s biometric-based authentication scheme for telecare medicine information systems.

    PubMed

    Mishra, Dheerendra; Mukhopadhyay, Sourav; Chaturvedi, Ankita; Kumari, Saru; Khan, Muhammad Khurram

    2014-06-01

    Remote user authentication is desirable for a Telecare Medicine Information System (TMIS) for the safety, security and integrity of transmitted data over the public channel. In 2013, Tan presented a biometric based remote user authentication scheme and claimed that his scheme is secure. Recently, Yan et al. demonstrated some drawbacks in Tan's scheme and proposed an improved scheme to erase the drawbacks of Tan's scheme. We analyze Yan et al.'s scheme and identify that their scheme is vulnerable to off-line password guessing attack, and does not protect anonymity. Moreover, in their scheme, login and password change phases are inefficient to identify the correctness of input where inefficiency in password change phase can cause denial of service attack. Further, we design an improved scheme for TMIS with the aim to eliminate the drawbacks of Yan et al.'s scheme.

  16. A fingerprint encryption scheme based on irreversible function and secure authentication.

    PubMed

    Yang, Yijun; Yu, Jianping; Zhang, Peng; Wang, Shulan

    2015-01-01

    A fingerprint encryption scheme based on irreversible function has been designed in this paper. Since the fingerprint template includes almost the entire information of users' fingerprints, the personal authentication can be determined only by the fingerprint features. This paper proposes an irreversible transforming function (using the improved SHA1 algorithm) to transform the original minutiae which are extracted from the thinned fingerprint image. Then, Chinese remainder theorem is used to obtain the biokey from the integration of the transformed minutiae and the private key. The result shows that the scheme has better performance on security and efficiency comparing with other irreversible function schemes.

  17. Vector-lifting schemes based on sorting techniques for lossless compression of multispectral images

    NASA Astrophysics Data System (ADS)

    Benazza-Benyahia, Amel; Pesquet, Jean-Christophe

    2003-01-01

    In this paper, we introduce vector-lifting schemes which allow to generate very compact multiresolution representations, suitable for lossless and progressive coding of multispectral images. These new decomposition schemes exploit simultaneously the spatial and the spectral redundancies contained in multispectral images. When the spectral bands have different dynamic ranges, we improve dramatically the performances of the proposed schemes by a reversible histogram modification based on sorting permutations. Simulation tests carried out on real images allow to evaluate the performances of this new compression method. They indicate that the achieved compression ratios are higher than those obtained with currently used lossless coders.

  18. A Fingerprint Encryption Scheme Based on Irreversible Function and Secure Authentication

    PubMed Central

    Yu, Jianping; Zhang, Peng; Wang, Shulan

    2015-01-01

    A fingerprint encryption scheme based on irreversible function has been designed in this paper. Since the fingerprint template includes almost the entire information of users' fingerprints, the personal authentication can be determined only by the fingerprint features. This paper proposes an irreversible transforming function (using the improved SHA1 algorithm) to transform the original minutiae which are extracted from the thinned fingerprint image. Then, Chinese remainder theorem is used to obtain the biokey from the integration of the transformed minutiae and the private key. The result shows that the scheme has better performance on security and efficiency comparing with other irreversible function schemes. PMID:25873989

  19. An image encryption scheme based on the MLNCML system using DNA sequences

    NASA Astrophysics Data System (ADS)

    Zhang, Ying-Qian; Wang, Xing-Yuan; Liu, Jia; Chi, Ze-Lin

    2016-07-01

    We propose a new image scheme based on the spatiotemporal chaos of the Mixed Linear-Nonlinear Coupled Map Lattices (MLNCML). This spatiotemporal chaotic system has more cryptographic features in dynamics than the system of Coupled Map Lattices (CML). In the proposed scheme, we employ the strategy of DNA computing and one time pad encryption policy, which can enhance the sensitivity to the plaintext and resist differential attack, brute-force attack, statistical attack and plaintext attack. Simulation results and theoretical analysis indicate that the proposed scheme has superior high security.

  20. Efficient Nash Equilibrium Resource Allocation Based on Game Theory Mechanism in Cloud Computing by Using Auction.

    PubMed

    Nezarat, Amin; Dastghaibifard, G H

    2015-01-01

    One of the most complex issues in the cloud computing environment is the problem of resource allocation so that, on one hand, the cloud provider expects the most profitability and, on the other hand, users also expect to have the best resources at their disposal considering the budget constraints and time. In most previous work conducted, heuristic and evolutionary approaches have been used to solve this problem. Nevertheless, since the nature of this environment is based on economic methods, using such methods can decrease response time and reducing the complexity of the problem. In this paper, an auction-based method is proposed which determines the auction winner by applying game theory mechanism and holding a repetitive game with incomplete information in a non-cooperative environment. In this method, users calculate suitable price bid with their objective function during several round and repetitions and send it to the auctioneer; and the auctioneer chooses the winning player based the suggested utility function. In the proposed method, the end point of the game is the Nash equilibrium point where players are no longer inclined to alter their bid for that resource and the final bid also satisfies the auctioneer's utility function. To prove the response space convexity, the Lagrange method is used and the proposed model is simulated in the cloudsim and the results are compared with previous work. At the end, it is concluded that this method converges to a response in a shorter time, provides the lowest service level agreement violations and the most utility to the provider.

  1. Efficient Nash Equilibrium Resource Allocation Based on Game Theory Mechanism in Cloud Computing by Using Auction

    PubMed Central

    Nezarat, Amin; Dastghaibifard, GH

    2015-01-01

    One of the most complex issues in the cloud computing environment is the problem of resource allocation so that, on one hand, the cloud provider expects the most profitability and, on the other hand, users also expect to have the best resources at their disposal considering the budget constraints and time. In most previous work conducted, heuristic and evolutionary approaches have been used to solve this problem. Nevertheless, since the nature of this environment is based on economic methods, using such methods can decrease response time and reducing the complexity of the problem. In this paper, an auction-based method is proposed which determines the auction winner by applying game theory mechanism and holding a repetitive game with incomplete information in a non-cooperative environment. In this method, users calculate suitable price bid with their objective function during several round and repetitions and send it to the auctioneer; and the auctioneer chooses the winning player based the suggested utility function. In the proposed method, the end point of the game is the Nash equilibrium point where players are no longer inclined to alter their bid for that resource and the final bid also satisfies the auctioneer’s utility function. To prove the response space convexity, the Lagrange method is used and the proposed model is simulated in the cloudsim and the results are compared with previous work. At the end, it is concluded that this method converges to a response in a shorter time, provides the lowest service level agreement violations and the most utility to the provider. PMID:26431035

  2. A homotopy method based on WENO schemes for solving steady state problems of hyperbolic conservation laws

    DTIC Science & Technology

    2012-09-03

    use of so-called probability-one methods [22]. The significant advantage of homotopy method to compute steady state solutions is free of Courant ...A homotopy method based on WENO schemes for solving steady state problems of hyperbolic conservation laws Wenrui Hao∗ Jonathan D. Hauenstein† Chi...robustness of the new method . Keywords homotopy continuation, hyperbolic conservation laws, WENO scheme, steady state problems. ∗Department of Applied and

  3. Digital image communication scheme based on the breakup of spiral waves

    NASA Astrophysics Data System (ADS)

    Vaidelys, Martynas; Lu, Chen; Cheng, Yujie; Ragulskis, Minvydas

    2017-02-01

    A digital image communication scheme based on the breakup of spiral waves is presented in this paper. This communication system does not require spatially homogeneous random initial conditions. Moreover, the secret image is not embedded into the initial conditions of the evolving self-organizing patterns. Such features increase the security of the communication, but still enable an effective transmission of the secret image. Computational experiments are used to demonstrate the properties and efficiency of the proposed scheme.

  4. Security analysis of a chaotic map-based authentication scheme for telecare medicine information systems.

    PubMed

    Yau, Wei-Chuen; Phan, Raphael C-W

    2013-12-01

    Many authentication schemes have been proposed for telecare medicine information systems (TMIS) to ensure the privacy, integrity, and availability of patient records. These schemes are crucial for TMIS systems because otherwise patients' medical records become susceptible to tampering thus hampering diagnosis or private medical conditions of patients could be disclosed to parties who do not have a right to access such information. Very recently, Hao et al. proposed a chaotic map-based authentication scheme for telecare medicine information systems in a recent issue of Journal of Medical Systems. They claimed that the authentication scheme can withstand various attacks and it is secure to be used in TMIS. In this paper, we show that this authentication scheme is vulnerable to key-compromise impersonation attacks, off-line password guessing attacks upon compromising of a smart card, and parallel session attacks. We also exploit weaknesses in the password change phase of the scheme to mount a denial-of-service attack. Our results show that this scheme cannot be used to provide security in a telecare medicine information system.

  5. Renewing membership in three community-based health insurance schemes in rural India.

    PubMed

    Panda, Pradeep; Chakraborty, Arpita; Raza, Wameq; Bedi, Arjun S

    2016-12-01

    Low renewal rate is a key challenge facing the sustainability of community-based health insurance (CBHI) schemes. While there is a large literature on initial enrolment into such schemes, there is limited evidence on the factors that impede renewal. This article uses longitudinal data to analyse what determines renewal, both 1 year and 2 years after the introduction of three CBHI schemes, which have been operating in rural Bihar and Uttar Pradesh since 2011. We find that initial scheme uptake is ∼23-24% and that 2 years after scheme operation, only ∼20% of the initial enrolees maintain their membership. A household's socio-economic status does not seem to play a large role in impeding renewal. In some instances, a greater understanding of the scheme boosts renewal. The link between health status and use of health care in maintaining renewal is mixed. The clearest effect is that individuals living in households that have received benefits from the scheme are substantially more likely to renew their contracts. We conclude that the low retention rates may be attributed to limited benefit packages, slow claims processing times and the gap between the amounts claimed and amounts paid out by insurance.

  6. Cascaded Fresnel holographic image encryption scheme based on a constrained optimization algorithm and Henon map

    NASA Astrophysics Data System (ADS)

    Su, Yonggang; Tang, Chen; Chen, Xia; Li, Biyuan; Xu, Wenjun; Lei, Zhenkun

    2017-01-01

    We propose an image encryption scheme using chaotic phase masks and cascaded Fresnel transform holography based on a constrained optimization algorithm. In the proposed encryption scheme, the chaotic phase masks are generated by Henon map, and the initial conditions and parameters of Henon map serve as the main secret keys during the encryption and decryption process. With the help of multiple chaotic phase masks, the original image can be encrypted into the form of a hologram. The constrained optimization algorithm makes it possible to retrieve the original image from only single frame hologram. The use of chaotic phase masks makes the key management and transmission become very convenient. In addition, the geometric parameters of optical system serve as the additional keys, which can improve the security level of the proposed scheme. Comprehensive security analysis performed on the proposed encryption scheme demonstrates that the scheme has high resistance against various potential attacks. Moreover, the proposed encryption scheme can be used to encrypt video information. And simulations performed on a video in AVI format have also verified the feasibility of the scheme for video encryption.

  7. Stackelberg Game Based Power Allocation for Physical Layer Security of Device-to-device Communication Underlaying Cellular Networks

    NASA Astrophysics Data System (ADS)

    Qu, Junyue; Cai, Yueming; Wu, Dan; Chen, Hualiang

    2014-05-01

    The problem of power allocation for device-to-device (D2D) underlay communication to improve physical layer security is addressed. Specifically, to improve the secure communication of the cellular users, we introduce a Stackelberg game for allocating the power of the D2D link under a total power constraint and a rate constraint at the D2D pair. In the introduced Stackelberg game the D2D pair works as a seller and the cellular UEs work as buyers. Firstly, because the interference signals from D2D pair are unknown to both the legitimate receiver and the illegitimate eavesdropper, it is possible that a cellular UE decline to participate in the introduced Stackelberg game. So the condition under which a legitimate user will participate in the introduced Stackelberg game is discussed. Then, based on the Stackelberg game, we propose a semi-distributed power allocation algorithm, which is proved to conclude after finite-time iterations. In the end, some simulations are presented to verify the performance improvement in the physical layer security of cellular UEs using the proposed power allocation algorithm. We can determine that with the proposed algorithm, while the D2D pair's communication demand is met, the physical layer security of cellular UEs can be improved.

  8. Road-network-Based spatial allocation of on-road mobile source emissions in the Pearl River Delta region, China, and comparisons with population-based approach.

    PubMed

    Zheng, Junyu; Che, Wenwei; Wang, Xuemei; Louie, Peter; Zhong, Liuju

    2009-12-01

    Gridded air pollutant emission inventories are prerequisites for using air quality models to assess air pollution control strategies and predict air quality. A precise gridded emission inventory will help improve the accuracy of air quality simulation. Mobile source emissions are one of the major contributors to volatile organic compound (VOC) and nitrogen oxide (NOx) pollutants, the precursors of ozone formation. However, because of the complexity of road networks and variations in traffic flows at different road types and locations, spatial allocation of emissions from mobile sources into grid cells is challenging. This paper proposes a new methodological framework, named as "the road-network-based approach," for spatially allocating regional mobile source emission inventories. The new approach utilizes the Geographic Information System (GIS)-based road network information and road-types-based traffic flow data to provide spatial surrogates for allocating Pearl River Delta (PRD) regional mobile source emission inventories. The results show that the new approach provides reasonable spatial distributions of mobile source emissions, and the distributions are in good agreement with PRD regional on-road emission line sources. Comparisons between using the population-based and the new road-network-based approaches are made. The air quality modeling results indicate that the new approach can obviously improve model predictions with increasing accuracy in mobile source emission allocations. Means of choosing appropriate approaches for spatially allocating regional mobile source emissions are discussed.

  9. Proxy-Based IPv6 Neighbor Discovery Scheme for Wireless LAN Based Mesh Networks

    NASA Astrophysics Data System (ADS)

    Lee, Jihoon; Jeon, Seungwoo; Kim, Jaehoon

    Multi-hop Wireless LAN-based mesh network (WMN) provides high capacity and self-configuring capabilities. Due to data forwarding and path selection based on MAC address, WMN requires additional operations to achieve global connectivity using IPv6 address. The neighbor discovery operation over WLAN mesh networks requires repeated all-node broadcasting and this gives rise to a big burden in the entire mesh networks. In this letter, we propose the proxy neighbor discovery scheme for optimized IPv6 communication over WMN to reduce network overhead and communication latency. Using simulation experiments, we show that the control overhead and communication setup latency can be significantly reduced using the proxy-based neighbor discovery mechanism.

  10. Fire. Youth Training Scheme. Core Exemplar Work Based Project.

    ERIC Educational Resources Information Center

    Further Education Staff Coll., Blagdon (England).

    This trainer's guide is intended to assist supervisors of work-based career training projects in teaching students the basics of fire prevention in the kitchen. The guide is one in a series of core curriculum modules that is intended for use in combination on- and off-the-job programs to familiarize youth with the skills, knowledge, and attitudes…

  11. Cutting Tools. Youth Training Scheme. Core Exemplar Work Based Project.

    ERIC Educational Resources Information Center

    Further Education Staff Coll., Blagdon (England).

    This trainer's guide is intended to assist supervisors of work-based career training projects in teaching students to compare the performance of two different types of engineering cutting tools and to determine their cost-effectiveness and efficiency. The guide is one in a series of core curriculum modules that is intended for use in combination…

  12. Dairy Health. Youth Training Scheme. Core Exemplar Work Based Project.

    ERIC Educational Resources Information Center

    Further Education Staff Coll., Blagdon (England).

    This trainer's guide is intended to assist supervisors of work-based career training projects in helping students learn about dairy herd health, as well as how to gather, record, and interpret information. The guide is one in a series of core curriculum modules that is intended for use in combination on- and off-the-job programs to familiarize…

  13. Cache Scheme Based on Pre-Fetch Operation in ICN.

    PubMed

    Duan, Jie; Wang, Xiong; Xu, Shizhong; Liu, Yuanni; Xu, Chuan; Zhao, Guofeng

    2016-01-01

    Many recent researches focus on ICN (Information-Centric Network), in which named content becomes the first citizen instead of end-host. In ICN, Named content can be further divided into many small sized chunks, and chunk-based communication has merits over content-based communication. The universal in-network cache is one of the fundamental infrastructures for ICN. In this work, a chunk-level cache mechanism based on pre-fetch operation is proposed. The main idea is that, routers with cache store should pre-fetch and cache the next chunks which may be accessed in the near future according to received requests and cache policy for reducing the users' perceived latency. Two pre-fetch driven modes are present to answer when and how to pre-fetch. The LRU (Least Recently Used) is employed for the cache replacement. Simulation results show that the average user perceived latency and hops can be decreased by employed this cache mechanism based on pre-fetch operation. Furthermore, we also demonstrate that the results are influenced by many factors, such as the cache capacity, Zipf parameters and pre-fetch window size.

  14. Cache Scheme Based on Pre-Fetch Operation in ICN

    PubMed Central

    Duan, Jie; Wang, Xiong; Xu, Shizhong; Liu, Yuanni; Xu, Chuan; Zhao, Guofeng

    2016-01-01

    Many recent researches focus on ICN (Information-Centric Network), in which named content becomes the first citizen instead of end-host. In ICN, Named content can be further divided into many small sized chunks, and chunk-based communication has merits over content-based communication. The universal in-network cache is one of the fundamental infrastructures for ICN. In this work, a chunk-level cache mechanism based on pre-fetch operation is proposed. The main idea is that, routers with cache store should pre-fetch and cache the next chunks which may be accessed in the near future according to received requests and cache policy for reducing the users’ perceived latency. Two pre-fetch driven modes are present to answer when and how to pre-fetch. The LRU (Least Recently Used) is employed for the cache replacement. Simulation results show that the average user perceived latency and hops can be decreased by employed this cache mechanism based on pre-fetch operation. Furthermore, we also demonstrate that the results are influenced by many factors, such as the cache capacity, Zipf parameters and pre-fetch window size. PMID:27362478

  15. Secure Proactive Recovery a Hardware Based Mission Assurance Scheme

    DTIC Science & Technology

    2011-08-01

    components of this evaluation include a JAVA implementation based on Chameleon ARMORs (Kalbarczyk et al. 1999), ARENA simulation (http...Room, January. Kalbarczyk, Z., Iyer, R.K., Bagchi, S. and Whisnant, K. (1999) " Chameleon : a software infrastructure for adaptive fault tolerance

  16. Data Recognition and Filtering Based on Efficient RFID Data Processing Control Schemes

    NASA Astrophysics Data System (ADS)

    Kung, Hsu-Yang; Kuo, Chiung-Wen; Tsai, Ching-Ping

    Radio Frequency Identification (RFID) applications have changed gradually from a single vendor and single application to being integrated into applications for supply chains. The primary function of RFID middleware is to process large amounts of data within a short period. High performance and efficiency are difficult to achieve in a RFID data processing control scheme when the volume of RFID data is large. This work is designed the core functions of RFID middleware and developed data processing control scheme that includes data recognition, data filtering and data searching processes. The control scheme for RFID data recognition is used to identify data with false positives and then to obtain corrected data objects. The data filtering control scheme is used to solve problems associated with RFID expansion under a large amount of work and data. The proposed data searching method is based on the EPC (Electronic Product Code) and uses the Hash to accelerate information filtering efficiency.

  17. Improvement of a quantum broadcasting multiple blind signature scheme based on quantum teleportation

    NASA Astrophysics Data System (ADS)

    Zhang, Wei; Qiu, Daowen; Zou, Xiangfu

    2016-06-01

    Recently, a broadcasting multiple blind signature scheme based on quantum teleportation has been proposed for the first time. It is claimed to have unconditional security and properties of quantum multiple signature and quantum blind signature. In this paper, we analyze the security of the protocol and show that each signatory can learn the signed message by a single-particle measurement and the signed message can be modified at random by any attacker according to the scheme. Furthermore, there are some participant attacks and external attacks existing in the scheme. Finally, we present an improved scheme and show that it can resist all of the mentioned attacks. Additionally, the secret keys can be used again and again, making it more efficient and practical.

  18. A Quantum Multi-Proxy Weak Blind Signature Scheme Based on Entanglement Swapping

    NASA Astrophysics Data System (ADS)

    Yan, LiLi; Chang, Yan; Zhang, ShiBin; Han, GuiHua; Sheng, ZhiWei

    2017-02-01

    In this paper, we present a multi-proxy weak blind signature scheme based on quantum entanglement swapping of Bell states. In the scheme, proxy signers can finish the signature instead of original singer with his/her authority. It can be applied to the electronic voting system, electronic paying system, etc. The scheme uses the physical characteristics of quantum mechanics to implement delegation, signature and verification. It could guarantee not only the unconditionally security but also the anonymity of the message owner. The security analysis shows the scheme satisfies the security features of multi-proxy weak signature, singers cannot disavowal his/her signature while the signature cannot be forged by others, and the message owner can be traced.

  19. On the security of a dynamic ID-based authentication scheme for telecare medical information systems.

    PubMed

    Lin, Han-Yu

    2013-04-01

    Telecare medical information systems (TMISs) are increasingly popular technologies for healthcare applications. Using TMISs, physicians and caregivers can monitor the vital signs of patients remotely. Since the database of TMISs stores patients' electronic medical records (EMRs), only authorized users should be granted the access to this information for the privacy concern. To keep the user anonymity, recently, Chen et al. proposed a dynamic ID-based authentication scheme for telecare medical information system. They claimed that their scheme is more secure and robust for use in a TMIS. However, we will demonstrate that their scheme fails to satisfy the user anonymity due to the dictionary attacks. It is also possible to derive a user password in case of smart card loss attacks. Additionally, an improved scheme eliminating these weaknesses is also presented.

  20. A bilinear pairing based anonymous authentication scheme in wireless body area networks for mHealth.

    PubMed

    Jiang, Qi; Lian, Xinxin; Yang, Chao; Ma, Jianfeng; Tian, Youliang; Yang, Yuanyuan

    2016-11-01

    Wireless body area networks (WBANs) have become one of the key components of mobile health (mHealth) which provides 24/7 health monitoring service and greatly improves the quality and efficiency of healthcare. However, users' concern about the security and privacy of their health information has become one of the major obstacles that impede the wide adoption of WBANs. Anonymous and unlinkable authentication is critical to protect the security and privacy of sensitive physiological information in transit from the client to the application provider. We first show that the anonymous authentication scheme of Wang and Zhang based on bilinear pairing is prone to client impersonation attack. Then, we propose an enhanced anonymous authentication scheme to remedy the flaw in Wang and Zhang's scheme. We give the security analysis to demonstrate that the enhanced scheme achieves the desired security features and withstands various known attacks.

  1. Protection of Health Imagery by Region Based Lossless Reversible Watermarking Scheme

    PubMed Central

    Priya, R. Lakshmi; Sadasivam, V.

    2015-01-01

    Providing authentication and integrity in medical images is a problem and this work proposes a new blind fragile region based lossless reversible watermarking technique to improve trustworthiness of medical images. The proposed technique embeds the watermark using a reversible least significant bit embedding scheme. The scheme combines hashing, compression, and digital signature techniques to create a content dependent watermark making use of compressed region of interest (ROI) for recovery of ROI as reported in literature. The experiments were carried out to prove the performance of the scheme and its assessment reveals that ROI is extracted in an intact manner and PSNR values obtained lead to realization that the presented scheme offers greater protection for health imageries. PMID:26649328

  2. A Quantum Multi-Proxy Weak Blind Signature Scheme Based on Entanglement Swapping

    NASA Astrophysics Data System (ADS)

    Yan, LiLi; Chang, Yan; Zhang, ShiBin; Han, GuiHua; Sheng, ZhiWei

    2016-11-01

    In this paper, we present a multi-proxy weak blind signature scheme based on quantum entanglement swapping of Bell states. In the scheme, proxy signers can finish the signature instead of original singer with his/her authority. It can be applied to the electronic voting system, electronic paying system, etc. The scheme uses the physical characteristics of quantum mechanics to implement delegation, signature and verification. It could guarantee not only the unconditionally security but also the anonymity of the message owner. The security analysis shows the scheme satisfies the security features of multi-proxy weak signature, singers cannot disavowal his/her signature while the signature cannot be forged by others, and the message owner can be traced.

  3. TripSense: A Trust-Based Vehicular Platoon Crowdsensing Scheme with Privacy Preservation in VANETs

    PubMed Central

    Hu, Hao; Lu, Rongxing; Huang, Cheng; Zhang, Zonghua

    2016-01-01

    In this paper, we propose a trust-based vehicular platoon crowdsensing scheme, named TripSense, in VANET. The proposed TripSense scheme introduces a trust-based system to evaluate vehicles’ sensing abilities and then selects the more capable vehicles in order to improve sensing results accuracy. In addition, the sensing tasks are accomplished by platoon member vehicles and preprocessed by platoon head vehicles before the data are uploaded to server. Hence, it is less time-consuming and more efficient compared with the way where the data are submitted by individual platoon member vehicles. Hence it is more suitable in ephemeral networks like VANET. Moreover, our proposed TripSense scheme integrates unlinkable pseudo-ID techniques to achieve PM vehicle identity privacy, and employs a privacy-preserving sensing vehicle selection scheme without involving the PM vehicle’s trust score to keep its location privacy. Detailed security analysis shows that our proposed TripSense scheme not only achieves desirable privacy requirements but also resists against attacks launched by adversaries. In addition, extensive simulations are conducted to show the correctness and effectiveness of our proposed scheme. PMID:27258287

  4. TripSense: A Trust-Based Vehicular Platoon Crowdsensing Scheme with Privacy Preservation in VANETs.

    PubMed

    Hu, Hao; Lu, Rongxing; Huang, Cheng; Zhang, Zonghua

    2016-06-01

    In this paper, we propose a trust-based vehicular platoon crowdsensing scheme, named TripSense, in VANET. The proposed TripSense scheme introduces a trust-based system to evaluate vehicles' sensing abilities and then selects the more capable vehicles in order to improve sensing results accuracy. In addition, the sensing tasks are accomplished by platoon member vehicles and preprocessed by platoon head vehicles before the data are uploaded to server. Hence, it is less time-consuming and more efficient compared with the way where the data are submitted by individual platoon member vehicles. Hence it is more suitable in ephemeral networks like VANET. Moreover, our proposed TripSense scheme integrates unlinkable pseudo-ID techniques to achieve PM vehicle identity privacy, and employs a privacy-preserving sensing vehicle selection scheme without involving the PM vehicle's trust score to keep its location privacy. Detailed security analysis shows that our proposed TripSense scheme not only achieves desirable privacy requirements but also resists against attacks launched by adversaries. In addition, extensive simulations are conducted to show the correctness and effectiveness of our proposed scheme.

  5. Evaluation of Effectiveness of Wavelet Based Denoising Schemes Using ANN and SVM for Bearing Condition Classification

    PubMed Central

    G. S., Vijay; H. S., Kumar; Pai P., Srinivasa; N. S., Sriram; Rao, Raj B. K. N.

    2012-01-01

    The wavelet based denoising has proven its ability to denoise the bearing vibration signals by improving the signal-to-noise ratio (SNR) and reducing the root-mean-square error (RMSE). In this paper seven wavelet based denoising schemes have been evaluated based on the performance of the Artificial Neural Network (ANN) and the Support Vector Machine (SVM), for the bearing condition classification. The work consists of two parts, the first part in which a synthetic signal simulating the defective bearing vibration signal with Gaussian noise was subjected to these denoising schemes. The best scheme based on the SNR and the RMSE was identified. In the second part, the vibration signals collected from a customized Rolling Element Bearing (REB) test rig for four bearing conditions were subjected to these denoising schemes. Several time and frequency domain features were extracted from the denoised signals, out of which a few sensitive features were selected using the Fisher's Criterion (FC). Extracted features were used to train and test the ANN and the SVM. The best denoising scheme identified, based on the classification performances of the ANN and the SVM, was found to be the same as the one obtained using the synthetic signal. PMID:23213323

  6. A Secure and Privacy-Preserving Navigation Scheme Using Spatial Crowdsourcing in Fog-Based VANETs.

    PubMed

    Wang, Lingling; Liu, Guozhu; Sun, Lijun

    2017-03-24

    Fog-based VANETs (Vehicular ad hoc networks) is a new paradigm of vehicular ad hoc networks with the advantages of both vehicular cloud and fog computing. Real-time navigation schemes based on fog-based VANETs can promote the scheme performance efficiently. In this paper, we propose a secure and privacy-preserving navigation scheme by using vehicular spatial crowdsourcing based on fog-based VANETs. Fog nodes are used to generate and release the crowdsourcing tasks, and cooperatively find the optimal route according to the real-time traffic information collected by vehicles in their coverage areas. Meanwhile, the vehicle performing the crowdsourcing task can get a reasonable reward. The querying vehicle can retrieve the navigation results from each fog node successively when entering its coverage area, and follow the optimal route to the next fog node until it reaches the desired destination. Our scheme fulfills the security and privacy requirements of authentication, confidentiality and conditional privacy preservation. Some cryptographic primitives, including the Elgamal encryption algorithm, AES, randomized anonymous credentials and group signatures, are adopted to achieve this goal. Finally, we analyze the security and the efficiency of the proposed scheme.

  7. Password-based authenticated key exchange scheme using smart card

    NASA Astrophysics Data System (ADS)

    Liu, Hui; Zhong, Shaojun

    2013-03-01

    A protocol that allows any two entities to negotiate a shared session key is commonly called a key exchange protocol. If the protocol provides a function to authenticate each other, we call the protocol authenticated key exchange protocol (AKE). Password authentication key exchange (PAKE) is the AKE protocol in which the two entities share a humanmemorable password. Most of current PAKE relies on the existence of a public key infrastructure, which sometime is impossible for a certain environments such as low computational device due to the computation overhead. In this paper, we propose password-based authenticated key exchange using smart card. Compared to previous PAKE, our protocol is more efficient because our protocol is based on ECC. Thereby, the proposed protocol can be well applied to low computation device.

  8. A quartic B-spline based explicit time integration scheme for structural dynamics with controllable numerical dissipation

    NASA Astrophysics Data System (ADS)

    Wen, W. B.; Duan, S. Y.; Yan, J.; Ma, Y. B.; Wei, K.; Fang, D. N.

    2017-03-01

    An explicit time integration scheme based on quartic B-splines is presented for solving linear structural dynamics problems. The scheme is of a one-parameter family of schemes where free algorithmic parameter controls stability, accuracy and numerical dispersion. The proposed scheme possesses at least second-order accuracy and at most third-order accuracy. A 2D wave problem is analyzed to demonstrate the effectiveness of the proposed scheme in reducing high-frequency modes and retaining low-frequency modes. Except for general structural dynamics, the proposed scheme can be used effectively for wave propagation problems in which numerical dissipation is needed to reduce spurious oscillations.

  9. Modeling and performance analysis of an improved movement-based location management scheme for packet-switched mobile communication systems.

    PubMed

    Chung, Yun Won; Kwon, Jae Kyun; Park, Suwon

    2014-01-01

    One of the key technologies to support mobility of mobile station (MS) in mobile communication systems is location management which consists of location update and paging. In this paper, an improved movement-based location management scheme with two movement thresholds is proposed, considering bursty data traffic characteristics of packet-switched (PS) services. The analytical modeling for location update and paging signaling loads of the proposed scheme is developed thoroughly and the performance of the proposed scheme is compared with that of the conventional scheme. We show that the proposed scheme outperforms the conventional scheme in terms of total signaling load with an appropriate selection of movement thresholds.

  10. Protection Relaying Scheme Based on Fault Reactance Operation Type

    NASA Astrophysics Data System (ADS)

    Tsuji, Kouichi

    The theories of operation of existing relays are roughly divided into two types: one is the current differential types based on Kirchhoff's first law and the other is impedance types based on second law. We can apply the Kirchhoff's laws to strictly formulate fault phenomena, so the circuit equations are represented non linear simultaneous equations with variables fault point k and fault resistance Rf. This method has next two defect. 1) heavy computational burden for the iterative calculation on N-R method, 2) relay operator can not easily understand principle of numerical matrix operation. The new protection relay principles we proposed this paper focuses on the fact that the reactance component on fault point is almost zero. Two reactance Xf(S), Xf(R) on branch both ends are calculated by operation of solving linear equations. If signs of Xf(S) and Xf(R) are not same, it can be judged that the fault point exist in the branch. This reactance Xf corresponds to difference of branch reactance between actual fault point and imaginaly fault point. And so relay engineer can to understand fault location by concept of “distance". The simulation results using this new method indicates the highly precise estimation of fault locations compared with the inspected fault locations on operating transmission lines.

  11. Predicting Preference for Items during Periods of Extended Access Based on Early Response Allocation

    ERIC Educational Resources Information Center

    Rapp, John T.; Rojas, Nairim C.; Colby-Dirksen, Amanda M.; Swanson, Greg J.; Marvin, Kendra L.

    2010-01-01

    Top-ranked items were identified during 30-min free-operant preference assessments for 9 individuals. Data from each session were analyzed to identify the item (a) that was engaged with first in each session and (b) to which the most responding was allocated after 5 min, 10 min, 15 min, 20 min, and 25 min had elapsed in each session. The results…

  12. Performance Analysis of Positive-feedback-based Active Anti-islanding Schemes for Inverter-Based Distributed Generators

    SciTech Connect

    Du, Pengwei; Aponte, Erick E.; Nelson, J. Keith

    2010-06-14

    Recently proposed positive-feedback-based anti-islanding schemes (AI) are highly effective in preventing islanding without causing any degradation in power quality. This paper aims to analyze the performance of these schemes quantitatively in the context of the dynamic models of inverter-based distributed generators (DG). In this study, the characteristics of these active anti-islanding methods are discussed and design guidelines are derived.

  13. Generalized color interpolation scheme based on intermediate quincuncial pattern

    NASA Astrophysics Data System (ADS)

    Park, Sang Wook; Kang, Moon Gi

    2014-05-01

    Recently, color filter array patterns based on optimal design by reducing interchannel aliasing have been developed. Although these optimally subsampled patterns produce less degradation of resolution for the images in daylight about 6500 K, aliasing and grid effect become more prominent under the different lighting conditions. Moreover, the color interpolation (CI) for Bayer pattern cannot be utilized for these patterns. Since it is impossible to change coated patterns according to various conditions, CI algorithms have to compensate for light variations. In this letter, a method for generating intermediate quincuncial pattern is proposed for two patterns. Also, edge adaptive interpolation for the quincuncial pattern is carried out. Experimental results show that the proposed method reduces aliasing and grid effect.

  14. A digital filtering scheme for SQUID based magnetocardiography

    NASA Astrophysics Data System (ADS)

    Zhu, Xue-Min; Ren, Yu-Feng; Yu, Hong-Wei; Zhao, Shi-Ping; Chen, Geng-Hua; Zhang, Li-Hua; Yang, Qian-Sheng

    2006-01-01

    Considering the properties of slow change and quasi-periodicity of magnetocardiography (MCG) signal, we use an integrated technique of adaptive and low-pass filtering in dealing with two-channel MCG data measured by high Tc SQUIDs. The adaptive filter in the time domain is based on a noise feedback normalized least-mean-square (NLMS) algorithm and the low-pass filter with a cutoff at 100Hz in the frequency domain characterized by Gaussian functions is combined with a notch at the power line frequency. In this way, both relevant and irrelevant noises in original MCG data are largely eliminated. The method may also be useful for other slowly varying quasi-periodical signals.

  15. Efficient image compression scheme based on differential coding

    NASA Astrophysics Data System (ADS)

    Zhu, Li; Wang, Guoyou; Liu, Ying

    2007-11-01

    Embedded zerotree (EZW) and Set Partitioning in Hierarchical Trees (SPIHT) coding, introduced by J.M. Shapiro and Amir Said, are very effective and being used in many fields widely. In this study, brief explanation of the principles of SPIHT was first provided, and then, some improvement of SPIHT algorithm according to experiments was introduced. 1) For redundancy among the coefficients in the wavelet region, we propose differential method to reduce it during coding. 2) Meanwhile, based on characteristic of the coefficients' distribution in subband, we adjust sorting pass and optimize differential coding, in order to reduce the redundancy coding in each subband. 3) The image coding result, calculated by certain threshold, shows that through differential coding, the rate of compression get higher, and the quality of reconstructed image have been get raised greatly, when bpp (bit per pixel)=0.5, PSNR (Peak Signal to Noise Ratio) of reconstructed image exceeds that of standard SPIHT by 0.2~0.4db.

  16. Coupled-cluster method: A lattice-path-based subsystem approximation scheme for quantum lattice models

    SciTech Connect

    Bishop, R. F.; Li, P. H. Y.

    2011-04-15

    An approximation hierarchy, called the lattice-path-based subsystem (LPSUBm) approximation scheme, is described for the coupled-cluster method (CCM). It is applicable to systems defined on a regular spatial lattice. We then apply it to two well-studied prototypical (spin-(1/2) Heisenberg antiferromagnetic) spin-lattice models, namely, the XXZ and the XY models on the square lattice in two dimensions. Results are obtained in each case for the ground-state energy, the ground-state sublattice magnetization, and the quantum critical point. They are all in good agreement with those from such alternative methods as spin-wave theory, series expansions, quantum Monte Carlo methods, and the CCM using the alternative lattice-animal-based subsystem (LSUBm) and the distance-based subsystem (DSUBm) schemes. Each of the three CCM schemes (LSUBm, DSUBm, and LPSUBm) for use with systems defined on a regular spatial lattice is shown to have its own advantages in particular applications.

  17. A two-stage spectrum sensing scheme based on energy detection and a novel multitaper method

    NASA Astrophysics Data System (ADS)

    Qi, Pei-Han; Li, Zan; Si, Jiang-Bo; Xiong, Tian-Yi

    2015-04-01

    Wideband spectrum sensing has drawn much attention in recent years since it provides more opportunities to the secondary users. However, wideband spectrum sensing requires a long time and a complex mechanism at the sensing terminal. A two-stage wideband spectrum sensing scheme is considered to proceed spectrum sensing with low time consumption and high performance to tackle this predicament. In this scheme, a novel multitaper spectrum sensing (MSS) method is proposed to mitigate the poor performance of energy detection (ED) in the low signal-to-noise ratio (SNR) region. The closed-form expression of the decision threshold is derived based on the Neyman-Pearson criterion and the probability of detection in the Rayleigh fading channel is analyzed. An optimization problem is formulated to maximize the probability of detection of the proposed two-stage scheme and the average sensing time of the two-stage scheme is analyzed. Numerical results validate the efficiency of MSS and show that the two-stage spectrum sensing scheme enjoys higher performance in the low SNR region and lower time cost in the high SNR region than the single-stage scheme. Project supported by the National Natural Science Foundation of China (Grant No. 61301179), the China Postdoctoral Science Foundation (Grant No. 2014M550479), and the Doctorial Programs Foundation of the Ministry of Education, China (Grant No. 20110203110011).

  18. A Hybrid Key Management Scheme for WSNs Based on PPBR and a Tree-Based Path Key Establishment Method.

    PubMed

    Zhang, Ying; Liang, Jixing; Zheng, Bingxin; Chen, Wei

    2016-04-09

    With the development of wireless sensor networks (WSNs), in most application scenarios traditional WSNs with static sink nodes will be gradually replaced by Mobile Sinks (MSs), and the corresponding application requires a secure communication environment. Current key management researches pay less attention to the security of sensor networks with MS. This paper proposes a hybrid key management schemes based on a Polynomial Pool-based key pre-distribution and Basic Random key pre-distribution (PPBR) to be used in WSNs with MS. The scheme takes full advantages of these two kinds of methods to improve the cracking difficulty of the key system. The storage effectiveness and the network resilience can be significantly enhanced as well. The tree-based path key establishment method is introduced to effectively solve the problem of communication link connectivity. Simulation clearly shows that the proposed scheme performs better in terms of network resilience, connectivity and storage effectiveness compared to other widely used schemes.

  19. A Hybrid Key Management Scheme for WSNs Based on PPBR and a Tree-Based Path Key Establishment Method

    PubMed Central

    Zhang, Ying; Liang, Jixing; Zheng, Bingxin; Chen, Wei

    2016-01-01

    With the development of wireless sensor networks (WSNs), in most application scenarios traditional WSNs with static sink nodes will be gradually replaced by Mobile Sinks (MSs), and the corresponding application requires a secure communication environment. Current key management researches pay less attention to the security of sensor networks with MS. This paper proposes a hybrid key management schemes based on a Polynomial Pool-based key pre-distribution and Basic Random key pre-distribution (PPBR) to be used in WSNs with MS. The scheme takes full advantages of these two kinds of methods to improve the cracking difficulty of the key system. The storage effectiveness and the network resilience can be significantly enhanced as well. The tree-based path key establishment method is introduced to effectively solve the problem of communication link connectivity. Simulation clearly shows that the proposed scheme performs better in terms of network resilience, connectivity and storage effectiveness compared to other widely used schemes. PMID:27070624

  20. Safety assurance of assistive devices based on a two-level checking scheme.

    PubMed

    Lin, Hua-Sheng; Chang, Yi-Chu; Chen, Chiun-Fan; Luh, Jer-Junn; Chiou, Ying-Han; Lai, Jin-Shin; Kuog, T-S

    2005-01-01

    The increasing number of physically challenged individuals has boosted the demand of powered wheelchairs. This paper is on the subject of a DSP (Digital Signal Processors) based assistive system, which is associated with a two-level checking scheme. The assistive system takes on the M3S (Multiple Master Multiple Slave) regulation for the assurance of safety. The CAN (Control Area Networks) embedded module in the DSP provides robust transmission of information within the system. The hardware interfaces based on the two-level checking scheme is implemented in input devices (e.g. joystick, head control apparatus) and in output devices (e.g. manipulator, prime mover motors).

  1. Very low bit streaming image compression coder based on lift scheme

    NASA Astrophysics Data System (ADS)

    Tao, Hongjiu; Tian, Jinwen; Liu, Jianguo; Yu, Qiuzhe; Xu, Hongbo

    2001-09-01

    This paper presents a novel compression encoding/decoding method based on lift scheme for I-VOP. In traditional coding I-VOP algorithm, the textures and shapes are separately coded, and the macro-block DCT coding method is adopted in the coding texture and 16x16 BAB(Binary Alpha Block) coding method is employed in shape coding. The texture and shape coding method is not of embed feature. The algorithm based on lift scheme for I-VOP, the texture and shape at same time is coded and the bit streaming is of embed feature.

  2. A new Fourier transform based CBIR scheme for mammographic mass classification: a preliminary invariance assessment

    NASA Astrophysics Data System (ADS)

    Gundreddy, Rohith Reddy; Tan, Maxine; Qui, Yuchen; Zheng, Bin

    2015-03-01

    The purpose of this study is to develop and test a new content-based image retrieval (CBIR) scheme that enables to achieve higher reproducibility when it is implemented in an interactive computer-aided diagnosis (CAD) system without significantly reducing lesion classification performance. This is a new Fourier transform based CBIR algorithm that determines image similarity of two regions of interest (ROI) based on the difference of average regional image pixel value distribution in two Fourier transform mapped images under comparison. A reference image database involving 227 ROIs depicting the verified soft-tissue breast lesions was used. For each testing ROI, the queried lesion center was systematically shifted from 10 to 50 pixels to simulate inter-user variation of querying suspicious lesion center when using an interactive CAD system. The lesion classification performance and reproducibility as the queried lesion center shift were assessed and compared among the three CBIR schemes based on Fourier transform, mutual information and Pearson correlation. Each CBIR scheme retrieved 10 most similar reference ROIs and computed a likelihood score of the queried ROI depicting a malignant lesion. The experimental results shown that three CBIR schemes yielded very comparable lesion classification performance as measured by the areas under ROC curves with the p-value greater than 0.498. However, the CBIR scheme using Fourier transform yielded the highest invariance to both queried lesion center shift and lesion size change. This study demonstrated the feasibility of improving robustness of the interactive CAD systems by adding a new Fourier transform based image feature to CBIR schemes.

  3. Variance reduction for Fokker–Planck based particle Monte Carlo schemes

    SciTech Connect

    Gorji, M. Hossein Andric, Nemanja; Jenny, Patrick

    2015-08-15

    Recently, Fokker–Planck based particle Monte Carlo schemes have been proposed and evaluated for simulations of rarefied gas flows [1–3]. In this paper, the variance reduction for particle Monte Carlo simulations based on the Fokker–Planck model is considered. First, deviational based schemes were derived and reviewed, and it is shown that these deviational methods are not appropriate for practical Fokker–Planck based rarefied gas flow simulations. This is due to the fact that the deviational schemes considered in this study lead either to instabilities in the case of two-weight methods or to large statistical errors if the direct sampling method is applied. Motivated by this conclusion, we developed a novel scheme based on correlated stochastic processes. The main idea here is to synthesize an additional stochastic process with a known solution, which is simultaneously solved together with the main one. By correlating the two processes, the statistical errors can dramatically be reduced; especially for low Mach numbers. To assess the methods, homogeneous relaxation, planar Couette and lid-driven cavity flows were considered. For these test cases, it could be demonstrated that variance reduction based on parallel processes is very robust and effective.

  4. Robust chaotic map-based authentication and key agreement scheme with strong anonymity for telecare medicine information systems.

    PubMed

    Jiang, Qi; Ma, Jianfeng; Lu, Xiang; Tian, Youliang

    2014-02-01

    To ensure only authorized access to medical services, several authentication schemes for telecare medicine information systems (TMIS) have been proposed in the literature. Due to its better performance than traditional cryptography, Hao et al. proposed an authentication scheme for TMIS using chaotic map based cryptography. They claimed that their scheme could resist various attacks, including the smart card stolen attack. However, we identify that their scheme is vulnerable to the stolen smart card attack. The reason causing the stolen smart card attack is that the scheme is designed based on the assumption that the scheme itself achieves user untraceability. Then, we propose a robust authentication and key agreement scheme. Compared with the previous schemes, our scheme not only enjoys more security features, but also has better efficiency. Our analysis indicates that designing a two-factor authentication scheme based on the assumption that privacy protection is achieved in the scheme itself may pose potential security risks. The lesson learned is that, we should avoid this situation in the future design of two-factor authentication schemes.

  5. An Energy-Efficient Game-Theory-Based Spectrum Decision Scheme for Cognitive Radio Sensor Networks.

    PubMed

    Salim, Shelly; Moh, Sangman

    2016-06-30

    A cognitive radio sensor network (CRSN) is a wireless sensor network in which sensor nodes are equipped with cognitive radio. In this paper, we propose an energy-efficient game-theory-based spectrum decision (EGSD) scheme for CRSNs to prolong the network lifetime. Note that energy efficiency is the most important design consideration in CRSNs because it determines the network lifetime. The central part of the EGSD scheme consists of two spectrum selection algorithms: random selection and game-theory-based selection. The EGSD scheme also includes a clustering algorithm, spectrum characterization with a Markov chain, and cluster member coordination. Our performance study shows that EGSD outperforms the existing popular framework in terms of network lifetime and coordination overhead.

  6. Aeromonas hydrophila typing scheme based on patterns of agglutination with erythrocytes and yeast cells.

    PubMed Central

    Adams, D; Atkinson, H M; Woods, W H

    1983-01-01

    An agglutination typing scheme has been developed for strains of Aeromonas hydrophila. Primary agglutination typing is based on testing agar-grown A. hydrophila cells with human, horse, rat, and guinea pig erythrocytes and Saccharomyces cerevisiae cells. Further subdivision of primary groups is based firstly on whether yeast cell agglutination is inhibited by a D-mannose polymer, yeast mannan, and secondly on patterns of inhibition of hemagglutination by yeast mannan and the monomeric sugars L-fucose, D-galactose, and D-mannose. A total of 320 isolates were tested, and these were divisible into 39 distinct types on the basis of this scheme. Application of this typing scheme in the future to isolates of A. hydrophila known to be associated with human infection may enable correlations to be made between particular agglutination types and human pathogenicity. PMID:6841579

  7. A joint JPEG2000 compression and watermarking system using a TCQ-based quantization scheme

    NASA Astrophysics Data System (ADS)

    Goudia, D.; Chaumont, M.; Puech, W.; Hadj Said, N.

    2011-01-01

    In this paper, we describe a Trellis Coded Quantization (TCQ)-based quantization and watermarking technique in the framework of JPEG2000 still image compression. Furthermore, we investigate the design of a novel joint compression and watermarking scheme based on a hybrid TCQ module which can perform at the same time quantization and watermark embedding. The watermark extraction process can be achieved both during and after image decompression. Another advantage is the lower complexity of the system because the quantization stage is used for both compression and watermarking purposes. Experimental results have demonstrated that the proposed joint scheme successfully survives JPEG2000 compression with minimal degradation of the image quality. We also studied the robustness of the scheme against gaussian filtering attack, gaussian noise attack, valumetric attack and jpeg attack.

  8. An Energy-Efficient Game-Theory-Based Spectrum Decision Scheme for Cognitive Radio Sensor Networks

    PubMed Central

    Salim, Shelly; Moh, Sangman

    2016-01-01

    A cognitive radio sensor network (CRSN) is a wireless sensor network in which sensor nodes are equipped with cognitive radio. In this paper, we propose an energy-efficient game-theory-based spectrum decision (EGSD) scheme for CRSNs to prolong the network lifetime. Note that energy efficiency is the most important design consideration in CRSNs because it determines the network lifetime. The central part of the EGSD scheme consists of two spectrum selection algorithms: random selection and game-theory-based selection. The EGSD scheme also includes a clustering algorithm, spectrum characterization with a Markov chain, and cluster member coordination. Our performance study shows that EGSD outperforms the existing popular framework in terms of network lifetime and coordination overhead. PMID:27376290

  9. BossPro: a biometrics-based obfuscation scheme for software protection

    NASA Astrophysics Data System (ADS)

    Kuseler, Torben; Lami, Ihsan A.; Al-Assam, Hisham

    2013-05-01

    This paper proposes to integrate biometric-based key generation into an obfuscated interpretation algorithm to protect authentication application software from illegitimate use or reverse-engineering. This is especially necessary for mCommerce because application programmes on mobile devices, such as Smartphones and Tablet-PCs are typically open for misuse by hackers. Therefore, the scheme proposed in this paper ensures that a correct interpretation / execution of the obfuscated program code of the authentication application requires a valid biometric generated key of the actual person to be authenticated, in real-time. Without this key, the real semantics of the program cannot be understood by an attacker even if he/she gains access to this application code. Furthermore, the security provided by this scheme can be a vital aspect in protecting any application running on mobile devices that are increasingly used to perform business/financial or other security related applications, but are easily lost or stolen. The scheme starts by creating a personalised copy of any application based on the biometric key generated during an enrolment process with the authenticator as well as a nuance created at the time of communication between the client and the authenticator. The obfuscated code is then shipped to the client's mobile devise and integrated with real-time biometric extracted data of the client to form the unlocking key during execution. The novelty of this scheme is achieved by the close binding of this application program to the biometric key of the client, thus making this application unusable for others. Trials and experimental results on biometric key generation, based on client's faces, and an implemented scheme prototype, based on the Android emulator, prove the concept and novelty of this proposed scheme.

  10. Optimal power allocation based on sum-throughput maximization for energy harvesting cognitive radio networks

    NASA Astrophysics Data System (ADS)

    Xie, Zhenwei; Zhu, Qi

    2017-01-01

    In this study, an optimal power allocation algorithm by maximizing the sum-throughput in energy harvesting cognitive radio networks is proposed. Under the causality constraints of the harvested energy by solar radiation, electromagnetic waves and so on in the two secondary users (SUs), and the interference constraint in the primary user (PU), the sum-throughput maximization problem is formulated. The algorithm decomposes the interference threshold constraint to the power upper bounds of the two SUs. Then, the power allocation problems of the two SUs can be solved by a directional water-filling algorithm (DWA) with the power upper bounds, respectively. The paper gives the algorithm steps and simulation results, and the simulation results verify that the proposed algorithm has obvious advantages over the other two algorithms.

  11. A New Subcarrier Allocation Strategy for MIMO-OFDMA Multicellular Networks Based on Cooperative Interference Mitigation

    PubMed Central

    Gkonis, Panagiotis K.; Seimeni, Maria A.; Asimakis, Nikolaos P.; Kaklamani, Dimitra I.; Venieris, Iakovos S.

    2014-01-01

    The goal of the study presented in this paper is to investigate the performance of a new subcarrier allocation strategy for Orthogonal Frequency Division Multiple Access (OFDMA) multicellular networks which employ Multiple Input Multiple Output (MIMO) architecture. For this reason, a hybrid system-link level simulator has been developed executing independent Monte Carlo (MC) simulations in parallel. Up to two tiers of cells around the central cell are taken into consideration and increased loading per cell. The derived results indicate that this strategy can provide up to 12% capacity gain for 16-QAM modulation and two tiers of cells around the central cell in a symmetric 2 × 2 MIMO configuration. This gain is derived when comparing the proposed strategy to the traditional approach of allocating subcarriers that maximize only the desired user's signal. PMID:24683351

  12. Optimal allocation of bulk water supplies to competing use sectors based on economic criterion - An application to the Chao Phraya River Basin, Thailand

    NASA Astrophysics Data System (ADS)

    Divakar, L.; Babel, M. S.; Perret, S. R.; Gupta, A. Das

    2011-04-01

    SummaryThe study develops a model for optimal bulk allocations of limited available water based on an economic criterion to competing use sectors such as agriculture, domestic, industry and hydropower. The model comprises a reservoir operation module (ROM) and a water allocation module (WAM). ROM determines the amount of water available for allocation, which is used as an input to WAM with an objective function to maximize the net economic benefits of bulk allocations to different use sectors. The total net benefit functions for agriculture and hydropower sectors and the marginal net benefit from domestic and industrial sectors are established and are categorically taken as fixed in the present study. The developed model is applied to the Chao Phraya basin in Thailand. The case study results indicate that the WAM can improve net economic returns compared to the current water allocation practices.

  13. Resource allocation of in vitro fertilization: a nationwide register-based cohort study

    PubMed Central

    Klemetti, Reija; Gissler, Mika; Sevón, Tiina; Hemminki, Elina

    2007-01-01

    Background Infertility is common and in vitro fertilization (IVF) is a widely used treatment. In IVF the need increases and the effectiveness and appropriateness decrease by age. The purpose of this study was to describe allocation of resources for IVF by women's age, socioeconomic position, area of residence and treatment sector (public vs. private) and to discuss how fairly the IVF resources are allocated in Finland. Methods Women who received IVF between 1996 and 1998 (N = 9175) were identified from the reimbursement records of the Social Insurance Institution (SII). Information on IVF women's background characteristics came from the Central Population Register and the SII, on treatment costs from IVF clinics and the SII, and on births from the Medical Birth Register. The main outcome measures were success of IVF by number of cycles and treated women, expenditures per IVF cycles, per women, per live-birth, and per treatment sector, and private and public expenditures. Expenditures were estimated from health care visits and costs. Results During a mean period of 1.5 years, older women (women aged 40 or older) received 1.4 times more IVF treatment cycles than younger women (women aged below 30). The success rate decreased by age: from 22 live births per 100 cycles among younger women to 6 per 100 among older women. The mean cost of a live birth increased by age: compared to younger women, costs per born live birth of older women were 3-fold. Calculated by population, public expenditure was allocated most to young women and women from the highest socioeconomic position. Regional differences were not remarkable. Conclusion Children of older infertile women involve more expense due to the lower success rates of IVF. Socioeconomic differences suggest unfair resource allocation in Finland. PMID:18154645

  14. A secure and robust password-based remote user authentication scheme using smart cards for the integrated EPR information system.

    PubMed

    Das, Ashok Kumar

    2015-03-01

    An integrated EPR (Electronic Patient Record) information system of all the patients provides the medical institutions and the academia with most of the patients' information in details for them to make corrective decisions and clinical decisions in order to maintain and analyze patients' health. In such system, the illegal access must be restricted and the information from theft during transmission over the insecure Internet must be prevented. Lee et al. proposed an efficient password-based remote user authentication scheme using smart card for the integrated EPR information system. Their scheme is very efficient due to usage of one-way hash function and bitwise exclusive-or (XOR) operations. However, in this paper, we show that though their scheme is very efficient, their scheme has three security weaknesses such as (1) it has design flaws in password change phase, (2) it fails to protect privileged insider attack and (3) it lacks the formal security verification. We also find that another recently proposed Wen's scheme has the same security drawbacks as in Lee at al.'s scheme. In order to remedy these security weaknesses found in Lee et al.'s scheme and Wen's scheme, we propose a secure and efficient password-based remote user authentication scheme using smart cards for the integrated EPR information system. We show that our scheme is also efficient as compared to Lee et al.'s scheme and Wen's scheme as our scheme only uses one-way hash function and bitwise exclusive-or (XOR) operations. Through the security analysis, we show that our scheme is secure against possible known attacks. Furthermore, we simulate our scheme for the formal security verification using the widely-accepted AVISPA (Automated Validation of Internet Security Protocols and Applications) tool and show that our scheme is secure against passive and active attacks.

  15. Optimization model for the allocation of water resources based on the maximization of employment in the agriculture and industry sectors

    NASA Astrophysics Data System (ADS)

    Habibi Davijani, M.; Banihabib, M. E.; Nadjafzadeh Anvar, A.; Hashemi, S. R.

    2016-02-01

    In many discussions, work force is mentioned as the most important factor of production. Principally, work force is a factor which can compensate for the physical and material limitations and shortcomings of other factors to a large extent which can help increase the production level. On the other hand, employment is considered as an effective factor in social issues. The goal of the present research is the allocation of water resources so as to maximize the number of jobs created in the industry and agriculture sectors. An objective that has attracted the attention of policy makers involved in water supply and distribution is the maximization of the interests of beneficiaries and consumers in case of certain policies adopted. The present model applies the particle swarm optimization (PSO) algorithm in order to determine the optimum amount of water allocated to each water-demanding sector, area under cultivation, agricultural production, employment in the agriculture sector, industrial production and employment in the industry sector. Based on the results obtained from this research, by optimally allocating water resources in the central desert region of Iran, 1096 jobs can be created in the industry and agriculture sectors, which constitutes an improvement of about 13% relative to the previous situation (non-optimal water utilization). It is also worth mentioning that by optimizing the employment factor as a social parameter, the other areas such as the economic sector are influenced as well. For example, in this investigation, the resulting economic benefits (incomes) have improved from 73 billion Rials at baseline employment figures to 112 billion Rials in the case of optimized employment condition. Therefore, it is necessary to change the inter-sector and intra-sector water allocation models in this region, because this change not only leads to more jobs in this area, but also causes an improvement in the region's economic conditions.

  16. Complete M-Level Quantum Teleportation Based on Kossakowski-Ohya Scheme

    NASA Astrophysics Data System (ADS)

    Asano, M.; Ohya, M.; Tanaka, Y.

    2009-02-01

    In many models of perfect teleportation, maximum entangled states are usually used as resources. Kossakowski and Ohya showed that a linear teleportation map is defined mathematically even if a non-maximum entangled state is postulated. Based on K-O scheme, we design a perfect teleportation model by means of non-maximal entangled state.

  17. Fast polarization-state tracking scheme based on radius-directed linear Kalman filter.

    PubMed

    Yang, Yanfu; Cao, Guoliang; Zhong, Kangping; Zhou, Xian; Yao, Yong; Lau, Alan Pak Tao; Lu, Chao

    2015-07-27

    We propose and experimentally demonstrate a fast polarization tracking scheme based on radius-directed linear Kalman filter. It has the advantages of fast convergence and is inherently insensitive to phase noise and frequency offset effects. The scheme is experimentally compared to conventional polarization tracking methods on the polarization rotation angular frequency. The results show that better tracking capability with more than one order of magnitude improvement is obtained in the cases of polarization multiplexed QPSK and 16QAM signals. The influences of the filter tuning parameters on tracking performance are also investigated in detail.

  18. A Signcryption-based Secure Localization Scheme in Wireless Sensor Networks

    NASA Astrophysics Data System (ADS)

    Zhang, Ting; He, Jingsha; Li, Xiaohui; Wei, Qian

    Localization technology in wireless sensor networks has great significance for theoretical study and practical applications. However, most current localization schemes have failed to pay enough attention to security issues. In this paper, we propose a novel secure localization algorithm named signcryption-based secure localization scheme (SSLS) that allows sensors to ensure the confidentiality and integrity of their location information. Analysis shows that SSLS can enhance the security and robustness of localization through the signcryption mechanism while simulation results help to verify the performance of SSLS in that distance measurement errors can be limited within a small range.

  19. Spectral phase-based automatic calibration scheme for swept source-based optical coherence tomography systems

    NASA Astrophysics Data System (ADS)

    Ratheesh, K. M.; Seah, L. K.; Murukeshan, V. M.

    2016-11-01

    The automatic calibration in Fourier-domain optical coherence tomography (FD-OCT) systems allows for high resolution imaging with precise depth ranging functionality in many complex imaging scenarios, such as microsurgery. However, the accuracy and speed of the existing automatic schemes are limited due to the functional approximations and iterative operations used in their procedures. In this paper, we present a new real-time automatic calibration scheme for swept source-based optical coherence tomography (SS-OCT) systems. The proposed automatic calibration can be performed during scanning operation and does not require an auxiliary interferometer for calibration signal generation and an additional channel for its acquisition. The proposed method makes use of the spectral component corresponding to the sample surface reflection as the calibration signal. The spectral phase function representing the non-linear sweeping characteristic of the frequency-swept laser source is determined from the calibration signal. The phase linearization with improved accuracy is achieved by normalization and rescaling of the obtained phase function. The fractional-time indices corresponding to the equidistantly spaced phase intervals are estimated directly from the resampling function and are used to resample the OCT signals. The proposed approach allows for precise calibration irrespective of the path length variation induced by the non-planar topography of the sample or galvo scanning. The conceived idea was illustrated using an in-house-developed SS-OCT system by considering the specular reflection from a mirror and other test samples. It was shown that the proposed method provides high-performance calibration in terms of axial resolution and sensitivity without increasing computational and hardware complexity.

  20. Improvement of a Privacy Authentication Scheme Based on Cloud for Medical Environment.

    PubMed

    Chiou, Shin-Yan; Ying, Zhaoqin; Liu, Junqiang

    2016-04-01

    Medical systems allow patients to receive care at different hospitals. However, this entails considerable inconvenience through the need to transport patients and their medical records between hospitals. The development of Telecare Medicine Information Systems (TMIS) makes it easier for patients to seek medical treatment and to store and access medical records. However, medical data stored in TMIS is not encrypted, leaving patients' private data vulnerable to external leaks. In 2014, scholars proposed a new cloud-based medical information model and authentication scheme which would not only allow patients to remotely access medical services but also protects patient privacy. However, this scheme still fails to provide patient anonymity and message authentication. Furthermore, this scheme only stores patient medical data, without allowing patients to directly access medical advice. Therefore, we propose a new authentication scheme, which provides anonymity, unlinkability, and message authentication, and allows patients to directly and remotely consult with doctors. In addition, our proposed scheme is more efficient in terms of computation cost. The proposed system was implemented in Android system to demonstrate its workability.

  1. Quantum-secret-sharing scheme based on local distinguishability of orthogonal multiqudit entangled states

    NASA Astrophysics Data System (ADS)

    Wang, Jingtao; Li, Lixiang; Peng, Haipeng; Yang, Yixian

    2017-02-01

    In this study, we propose the concept of judgment space to investigate the quantum-secret-sharing scheme based on local distinguishability (called LOCC-QSS). Because of the proposing of this conception, the property of orthogonal mutiqudit entangled states under restricted local operation and classical communication (LOCC) can be described more clearly. According to these properties, we reveal that, in the previous (k ,n )-threshold LOCC-QSS scheme, there are two required conditions for the selected quantum states to resist the unambiguous attack: (i) their k -level judgment spaces are orthogonal, and (ii) their (k -1 )-level judgment spaces are equal. Practically, if k scheme), it is very difficult to satisfy the two conditions simultaneously. In the current study, we further establish a simple encoding method, which can concurrently ease the selection of quantum states and ensure the scheme's security, i.e., even if the (k -1 )-level judgment spaces of the selected quantum states are not equal, these states can still be used for defeating the unambiguous attack. With this encoding method, we propose a more secure (k ,n )-threshold LOCC-QSS scheme, and give two specific examples for illustration.

  2. A New Optical Scheme for a Polarimetric-Based Glucose Sensor

    NASA Technical Reports Server (NTRS)

    Ansari, Rafat R.; Boeckle, Stefan; Rovati, Luigi; Salzman, Jack A. (Technical Monitor)

    2002-01-01

    We describe a new optical scheme to perform polarimetric measurements to detect glucose concentration in the aqueous humor of a model eye. The ultimate aim is to apply this technique in designing a new instrument for measuring glucose levels in diabetic patients routinely, frequently, and non-invasively. The scheme exploits the Brewsterreflection of circularly polarized light off of the lens of the eye. Theoretically, this backreflected linearly polarized light on its way to the detector is expected to rotate its state of polarization due to the presence of glucose molecules in the aqueous humor of patients. An experimental laboratory setup based on this scheme was designed and tested by measuring a range of known concentration of glucose solutions dissolved in water.

  3. An adaptive scaling and biasing scheme for OFDM-based visible light communication systems.

    PubMed

    Wang, Zhaocheng; Wang, Qi; Chen, Sheng; Hanzo, Lajos

    2014-05-19

    Orthogonal frequency-division multiplexing (OFDM) has been widely used in visible light communication systems to achieve high-rate data transmission. Due to the nonlinear transfer characteristics of light emitting diodes (LEDs) and owing the high peak-to-average-power ratio of OFDM signals, the transmitted signal has to be scaled and biased before modulating the LEDs. In this contribution, an adaptive scaling and biasing scheme is proposed for OFDM-based visible light communication systems, which fully exploits the dynamic range of the LEDs and improves the achievable system performance. Specifically, the proposed scheme calculates near-optimal scaling and biasing factors for each specific OFDM symbol according to the distribution of the signals, which strikes an attractive trade-off between the effective signal power and the clipping-distortion power. Our simulation results demonstrate that the proposed scheme significantly improves the performance without changing the LED's emitted power, while maintaining the same receiver structure.

  4. Two-out-of-two color matching based visual cryptography schemes.

    PubMed

    Machizaud, Jacques; Fournel, Thierry

    2012-09-24

    Visual cryptography which consists in sharing a secret message between transparencies has been extended to color prints. In this paper, we propose a new visual cryptography scheme based on color matching. The stacked printed media reveal a uniformly colored message decoded by the human visual system. In contrast with the previous color visual cryptography schemes, the proposed one enables to share images without pixel expansion and to detect a forgery as the color of the message is kept secret. In order to correctly print the colors on the media and to increase the security of the scheme, we use spectral models developed for color reproduction describing printed colors from an optical point of view.

  5. Federal Environmental Remediation Contractual and Insurance-Based Risk Allocation Schemes: Are They Getting the Job Done?

    DTIC Science & Technology

    2005-08-31

    No. 102-386, 106 Stat. 1505 (1992); Hazardous and Solid Waste Amendments of 1984, Pub. L. No. 98-616, 98 Stat. 3221 (1984); Solid Waste Disposal Act...11, 12 Hazardous and Solid Waste Amendments of 1984, Pub. L. No. 98-616, 98 Stat. 3221 (19 84

  6. Security analysis and enhancements of an effective biometric-based remote user authentication scheme using smart cards.

    PubMed

    An, Younghwa

    2012-01-01

    Recently, many biometrics-based user authentication schemes using smart cards have been proposed to improve the security weaknesses in user authentication system. In 2011, Das proposed an efficient biometric-based remote user authentication scheme using smart cards that can provide strong authentication and mutual authentication. In this paper, we analyze the security of Das's authentication scheme, and we have shown that Das's authentication scheme is still insecure against the various attacks. Also, we proposed the enhanced scheme to remove these security problems of Das's authentication scheme, even if the secret information stored in the smart card is revealed to an attacker. As a result of security analysis, we can see that the enhanced scheme is secure against the user impersonation attack, the server masquerading attack, the password guessing attack, and the insider attack and provides mutual authentication between the user and the server.

  7. A study of the spreading scheme for viral marketing based on a complex network model

    NASA Astrophysics Data System (ADS)

    Yang, Jianmei; Yao, Canzhong; Ma, Weicheng; Chen, Guanrong

    2010-02-01

    Buzzword-based viral marketing, known also as digital word-of-mouth marketing, is a marketing mode attached to some carriers on the Internet, which can rapidly copy marketing information at a low cost. Viral marketing actually uses a pre-existing social network where, however, the scale of the pre-existing network is believed to be so large and so random, so that its theoretical analysis is intractable and unmanageable. There are very few reports in the literature on how to design a spreading scheme for viral marketing on real social networks according to the traditional marketing theory or the relatively new network marketing theory. Complex network theory provides a new model for the study of large-scale complex systems, using the latest developments of graph theory and computing techniques. From this perspective, the present paper extends the complex network theory and modeling into the research of general viral marketing and develops a specific spreading scheme for viral marking and an approach to design the scheme based on a real complex network on the QQ instant messaging system. This approach is shown to be rather universal and can be further extended to the design of various spreading schemes for viral marketing based on different instant messaging systems.

  8. Video compression based on enhanced EZW scheme and Karhunen-Loeve transform

    NASA Astrophysics Data System (ADS)

    Soloveyko, Olexandr M.; Musatenko, Yurij S.; Kurashov, Vitalij N.; Dubikovskiy, Vladislav A.

    2000-06-01

    The paper presents a new method for video compression based on the enhanced embedded zerotree wavelet (EZW) scheme. Recently, video codecs from the EZW family which use a 3D version of EZW or SPIHT algorithms showed better performance than the MPEG-2 compression algorithm. These algorithms have many advantages inherent for wavelet based schemes and EZW- like coders. Their most important advantages are good compression performance and scalability. However, they still allow improvement in several ways. First, as we recently showed, using Karhunen-Loeve (KL) transform instead of wavelet transform along the time axis improves compression ratio. Second, instead of the 3D EZW quantization scheme, we offer to use a convenient 2D quantization for every decorrelated frame adding one symbol `Strong Zero Tree', which means that every frame from a chosen set has a zero tree in the same location. The suggested compression algorithm based on KL transform, wavelet transform, and a new quantization scheme with strong zerotrees is free from some drawbacks of the plain 3D EZW codec. The presented codec shows 1 - 6 dB better results compared to the MPEG-2 compression algorithm on video sequences with small and medium motion.

  9. Multiscale deep drawing analysis of dual-phase steels using grain cluster-based RGC scheme

    NASA Astrophysics Data System (ADS)

    Tjahjanto, D. D.; Eisenlohr, P.; Roters, F.

    2015-06-01

    Multiscale modelling and simulation play an important role in sheet metal forming analysis, since the overall material responses at macroscopic engineering scales, e.g. formability and anisotropy, are strongly influenced by microstructural properties, such as grain size and crystal orientations (texture). In the present report, multiscale analysis on deep drawing of dual-phase steels is performed using an efficient grain cluster-based homogenization scheme. The homogenization scheme, called relaxed grain cluster (RGC), is based on a generalization of the grain cluster concept, where a (representative) volume element consists of p  ×  q  ×  r (hexahedral) grains. In this scheme, variation of the strain or deformation of individual grains is taken into account through the, so-called, interface relaxation, which is formulated within an energy minimization framework. An interfacial penalty term is introduced into the energy minimization framework in order to account for the effects of grain boundaries. The grain cluster-based homogenization scheme has been implemented and incorporated into the advanced material simulation platform DAMASK, which purposes to bridge the macroscale boundary value problems associated with deep drawing analysis to the micromechanical constitutive law, e.g. crystal plasticity model. Standard Lankford anisotropy tests are performed to validate the model parameters prior to the deep drawing analysis. Model predictions for the deep drawing simulations are analyzed and compared to the corresponding experimental data. The result shows that the predictions of the model are in a very good agreement with the experimental measurement.

  10. Where does the carbon go? A model-data intercomparison of vegetation carbon allocation and turnover processes at two temperate forest free-air CO2 enrichment sites.

    PubMed

    De Kauwe, Martin G; Medlyn, Belinda E; Zaehle, Sönke; Walker, Anthony P; Dietze, Michael C; Wang, Ying-Ping; Luo, Yiqi; Jain, Atul K; El-Masri, Bassil; Hickler, Thomas; Wårlind, David; Weng, Ensheng; Parton, William J; Thornton, Peter E; Wang, Shusen; Prentice, I Colin; Asao, Shinichi; Smith, Benjamin; McCarthy, Heather R; Iversen, Colleen M; Hanson, Paul J; Warren, Jeffrey M; Oren, Ram; Norby, Richard J

    2014-08-01

    Elevated atmospheric CO2 concentration (eCO2) has the potential to increase vegetation carbon storage if increased net primary production causes increased long-lived biomass. Model predictions of eCO2 effects on vegetation carbon storage depend on how allocation and turnover processes are represented. We used data from two temperate forest free-air CO2 enrichment (FACE) experiments to evaluate representations of allocation and turnover in 11 ecosystem models. Observed eCO2 effects on allocation were dynamic. Allocation schemes based on functional relationships among biomass fractions that vary with resource availability were best able to capture the general features of the observations. Allocation schemes based on constant fractions or resource limitations performed less well, with some models having unintended outcomes. Few models represent turnover processes mechanistically and there was wide variation in predictions of tissue lifespan. Consequently, models did not perform well at predicting eCO2 effects on vegetation carbon storage. Our recommendations to reduce uncertainty include: use of allocation schemes constrained by biomass fractions; careful testing of allocation schemes; and synthesis of allocation and turnover data in terms of model parameters. Data from intensively studied ecosystem manipulation experiments are invaluable for constraining models and we recommend that such experiments should attempt to fully quantify carbon, water and nutrient budgets.

  11. An algorithm for calculating exam quality as a basis for performance-based allocation of funds at medical schools

    PubMed Central

    Kirschstein, Timo; Wolters, Alexander; Lenz, Jan-Hendrik; Fröhlich, Susanne; Hakenberg, Oliver; Kundt, Günther; Darmüntzel, Martin; Hecker, Michael; Altiner, Attila; Müller-Hilke, Brigitte

    2016-01-01

    Objective: The amendment of the Medical Licensing Act (ÄAppO) in Germany in 2002 led to the introduction of graded assessments in the clinical part of medical studies. This, in turn, lent new weight to the importance of written tests, even though the minimum requirements for exam quality are sometimes difficult to reach. Introducing exam quality as a criterion for the award of performance-based allocation of funds is expected to steer the attention of faculty members towards more quality and perpetuate higher standards. However, at present there is a lack of suitable algorithms for calculating exam quality. Methods: In the spring of 2014, the students‘ dean commissioned the „core group“ for curricular improvement at the University Medical Center in Rostock to revise the criteria for the allocation of performance-based funds for teaching. In a first approach, we developed an algorithm that was based on the results of the most common type of exam in medical education, multiple choice tests. It included item difficulty and discrimination, reliability as well as the distribution of grades achieved. Results: This algorithm quantitatively describes exam quality of multiple choice exams. However, it can also be applied to exams involving short assay questions and the OSCE. It thus allows for the quantitation of exam quality in the various subjects and – in analogy to impact factors and third party grants – a ranking among faculty. Conclusion: Our algorithm can be applied to all test formats in which item difficulty, the discriminatory power of the individual items, reliability of the exam and the distribution of grades are measured. Even though the content validity of an exam is not considered here, we believe that our algorithm is suitable as a general basis for performance-based allocation of funds. PMID:27275509

  12. Joint Resource Allocation of Spectrum Sensing and Energy Harvesting in an Energy-Harvesting-Based Cognitive Sensor Network.

    PubMed

    Liu, Xin; Lu, Weidang; Ye, Liang; Li, Feng; Zou, Deyue

    2017-03-16

    The cognitive sensor (CS) can transmit data to the control center in the same spectrum that is licensed to the primary user (PU) when the absence of the PU is detected by spectrum sensing. However, the battery energy of the CS is limited due to its small size, deployment in atrocious environments and long-term working. In this paper, an energy-harvesting-based CS is described, which senses the PU together with collecting the radio frequency energy to supply data transmission. In order to improve the transmission performance of the CS, we have proposed the joint resource allocation of spectrum sensing and energy harvesting in the cases of a single energy-harvesting-based CS and an energy-harvesting-based cognitive sensor network (CSN), respectively. Based on the proposed frame structure, we have formulated the resource allocation as a class of joint optimization problems, which seek to maximize the transmission rate of the CS by jointly optimizing sensing time, harvesting time and the numbers of sensing nodes and harvesting nodes. Using the half searching method and the alternating direction optimization, we have achieved the sub-optimal solution by converting the joint optimization problem into several convex sub-optimization problems. The simulation results have indicated the predominance of the proposed energy-harvesting-based CS and CSN models.

  13. Joint Resource Allocation of Spectrum Sensing and Energy Harvesting in an Energy-Harvesting-Based Cognitive Sensor Network

    PubMed Central

    Liu, Xin; Lu, Weidang; Ye, Liang; Li, Feng; Zou, Deyue

    2017-01-01

    The cognitive sensor (CS) can transmit data to the control center in the same spectrum that is licensed to the primary user (PU) when the absence of the PU is detected by spectrum sensing. However, the battery energy of the CS is limited due to its small size, deployment in atrocious environments and long-term working. In this paper, an energy-harvesting-based CS is described, which senses the PU together with collecting the radio frequency energy to supply data transmission. In order to improve the transmission performance of the CS, we have proposed the joint resource allocation of spectrum sensing and energy harvesting in the cases of a single energy-harvesting-based CS and an energy-harvesting-based cognitive sensor network (CSN), respectively. Based on the proposed frame structure, we have formulated the resource allocation as a class of joint optimization problems, which seek to maximize the transmission rate of the CS by jointly optimizing sensing time, harvesting time and the numbers of sensing nodes and harvesting nodes. Using the half searching method and the alternating direction optimization, we have achieved the sub-optimal solution by converting the joint optimization problem into several convex sub-optimization problems. The simulation results have indicated the predominance of the proposed energy-harvesting-based CS and CSN models. PMID:28300763

  14. Iterative resource allocation based on propagation feature of node for identifying the influential nodes

    NASA Astrophysics Data System (ADS)

    Zhong, Lin-Feng; Liu, Jian-Guo; Shang, Ming-Sheng

    2015-10-01

    The identification of the influential nodes in networks is one of the most promising domains. In this paper, we present an improved iterative resource allocation (IIRA) method by considering the centrality information of neighbors and the influence of spreading rate for a target node. Comparing with the results of the Susceptible Infected Recovered (SIR) model for four real networks, the IIRA method could identify influential nodes more accurately than the tradition IRA method. Specially, in the Erdös network, Kendall's tau could be enhanced 23% when the spreading rate is 0.12. In the Protein network, Kendall's tau could be enhanced 24% when the spreading rate is 0.08.

  15. Multiview-based computer-aided detection scheme for breast masses

    SciTech Connect

    Zheng Bin; Leader, Joseph K.; Abrams, Gordon S.; Lu, Amy H.; Wallace, Luisa P.; Maitz, Glenn S.; Gur, David

    2006-09-15

    In this study, we developed and tested a new multiview-based computer-aided detection (CAD) scheme that aims to maintain the same case-based sensitivity level as a single-image-based scheme while substantially increasing the number of masses being detected on both ipsilateral views. An image database of 450 four-view examinations (1800 images) was assembled. In this database, 250 cases depicted malignant masses, of which 236 masses were visible on both views and 14 masses were visible only on one view. First, we detected suspected mass regions depicted on each image in the database using a single-image-based CAD. For each identified region (with detection score{>=}0.55), we then identified a matching strip of interest on the ipsilateral view based on the projected distance to the nipple along the centerline. By lowering CAD operating threshold inside the matching strip, we searched for a region located inside the strip and paired it with the original region. A multifeature-based artificial neural network scored the likelihood of the paired ''matched'' regions representing true-positive masses. All single (unmatched) regions except for those either with very high detection scores ({>=}0.85) or those located near the chest wall that cannot be matched on the other view were discarded. The original single-image-based CAD scheme detected 186 masses (74.4% case-based sensitivity) and 593 false-positive regions. Of the 186 identified masses, 91 were detected on two views (48.9%) and 95 were detected only on one view (51.1%). Of the false-positive detections, 54 were paired on the ipsilateral view inside the corresponding matching strips and the remaining 485 were not, which represented 539 case-based false-positive detections (0.3 per image). Applying the multiview-based CAD scheme, the same case-based sensitivity was maintained while cueing 169 of 186 masses (90.9%) on both views and at the same time reducing the case-based false-positive detection rate by 23.7% (from

  16. Privacy Protection for Telecare Medicine Information Systems Using a Chaotic Map-Based Three-Factor Authenticated Key Agreement Scheme.

    PubMed

    Zhang, Liping; Zhu, Shaohui; Tang, Shanyu

    2017-03-01

    Telecare medicine information systems (TMIS) provide flexible and convenient e-health care. However, the medical records transmitted in TMIS are exposed to unsecured public networks, so TMIS are more vulnerable to various types of security threats and attacks. To provide privacy protection for TMIS, a secure and efficient authenticated key agreement scheme is urgently needed to protect the sensitive medical data. Recently, Mishra et al. proposed a biometrics-based authenticated key agreement scheme for TMIS by using hash function and nonce, they claimed that their scheme could eliminate the security weaknesses of Yan et al.'s scheme and provide dynamic identity protection and user anonymity. In this paper, however, we demonstrate that Mishra et al.'s scheme suffers from replay attacks, man-in-the-middle attacks and fails to provide perfect forward secrecy. To overcome the weaknesses of Mishra et al.'s scheme, we then propose a three-factor authenticated key agreement scheme to enable the patient to enjoy the remote healthcare services via TMIS with privacy protection. The chaotic map-based cryptography is employed in the proposed scheme to achieve a delicate balance of security and performance. Security analysis demonstrates that the proposed scheme resists various attacks and provides several attractive security properties. Performance evaluation shows that the proposed scheme increases efficiency in comparison with other related schemes.

  17. A novel chaos-based bit-level permutation scheme for digital image encryption

    NASA Astrophysics Data System (ADS)

    Fu, Chong; Lin, Bin-bin; Miao, Yu-sheng; Liu, Xiao; Chen, Jun-jie

    2011-11-01

    Confidentiality is an important issue when digital images are transmitted over public networks, and encryption is the most useful technique employed for this purpose. Image encryption is somehow different from text encryption due to some inherent features of image such as bulk data capacity and high correlation among pixels, which are generally difficult to handle by conventional algorithms. Recently, chaos-based encryption has suggested a new and efficient way to deal with the intractable problems of fast and highly secure image encryption. This paper proposes a novel chaos-based bit-level permutation scheme for secure and efficient image cipher. To overcome the drawbacks of conventional permutation-only type image cipher, the proposed scheme introduced a significant diffusion effect in permutation procedure through a two-stage bit-level shuffling algorithm. The two-stage permutation operations are realized by chaotic sequence sorting algorithm and Arnold Cat map, respectively. Results of various types of analysis are interesting and indicate that the security level of the new scheme is competitive with that of permutation-diffusion type image cipher, while the computational complexity is much lower. Therefore the new scheme is a good candidate for real-time secure image communication applications.

  18. Exact density functional and wave function embedding schemes based on orbital localization

    NASA Astrophysics Data System (ADS)

    Hégely, Bence; Nagy, Péter R.; Ferenczy, György G.; Kállay, Mihály

    2016-08-01

    Exact schemes for the embedding of density functional theory (DFT) and wave function theory (WFT) methods into lower-level DFT or WFT approaches are introduced utilizing orbital localization. First, a simple modification of the projector-based embedding scheme of Manby and co-workers [J. Chem. Phys. 140, 18A507 (2014)] is proposed. We also use localized orbitals to partition the system, but instead of augmenting the Fock operator with a somewhat arbitrary level-shift projector we solve the Huzinaga-equation, which strictly enforces the Pauli exclusion principle. Second, the embedding of WFT methods in local correlation approaches is studied. Since the latter methods split up the system into local domains, very simple embedding theories can be defined if the domains of the active subsystem and the environment are treated at a different level. The considered embedding schemes are benchmarked for reaction energies and compared to quantum mechanics (QM)/molecular mechanics (MM) and vacuum embedding. We conclude that for DFT-in-DFT embedding, the Huzinaga-equation-based scheme is more efficient than the other approaches, but QM/MM or even simple vacuum embedding is still competitive in particular cases. Concerning the embedding of wave function methods, the clear winner is the embedding of WFT into low-level local correlation approaches, and WFT-in-DFT embedding can only be more advantageous if a non-hybrid density functional is employed.

  19. Authentication and data hiding using a hybrid ROI-based watermarking scheme for DICOM images.

    PubMed

    Al-Qershi, Osamah M; Khoo, Bee Ee

    2011-02-01

    Authenticating medical images using watermarking techniques has become a very popular area of research, and some works in this area have been reported worldwide recently. Besides authentication, many data-hiding techniques have been proposed to conceal patient's data into medical images aiming to reduce the cost needed to store data and the time needed to transmit data when required. In this paper, we present a new hybrid watermarking scheme for DICOM images. In our scheme, two well-known techniques are combined to gain the advantages of both and fulfill the requirements of authentication and data hiding. The scheme divides the images into two parts, the region of interest (ROI) and the region of non-interest (RONI). Patient's data are embedded into ROI using a reversible technique based on difference expansion, while tamper detection and recovery data are embedded into RONI using a robust technique based on discrete wavelet transform. The experimental results show the ability of hiding patient's data with a very good visual quality, while ROI, the most important area for diagnosis, is retrieved exactly at the receiver side. The scheme also shows some robustness against certain levels of salt and pepper and cropping noise.

  20. Secure biometric image sensor and authentication scheme based on compressed sensing.

    PubMed

    Suzuki, Hiroyuki; Suzuki, Masamichi; Urabe, Takuya; Obi, Takashi; Yamaguchi, Masahiro; Ohyama, Nagaaki

    2013-11-20

    It is important to ensure the security of biometric authentication information, because its leakage causes serious risks, such as replay attacks using the stolen biometric data, and also because it is almost impossible to replace raw biometric information. In this paper, we propose a secure biometric authentication scheme that protects such information by employing an optical data ciphering technique based on compressed sensing. The proposed scheme is based on two-factor authentication, the biometric information being supplemented by secret information that is used as a random seed for a cipher key. In this scheme, a biometric image is optically encrypted at the time of image capture, and a pair of restored biometric images for enrollment and verification are verified in the authentication server. If any of the biometric information is exposed to risk, it can be reenrolled by changing the secret information. Through numerical experiments, we confirm that finger vein images can be restored from the compressed sensing measurement data. We also present results that verify the accuracy of the scheme.

  1. A secure and efficient password-based user authentication scheme using smart cards for the integrated EPR information system.

    PubMed

    Lee, Tian-Fu; Chang, I-Pin; Lin, Tsung-Hung; Wang, Ching-Cheng

    2013-06-01

    The integrated EPR information system supports convenient and rapid e-medicine services. A secure and efficient authentication scheme for the integrated EPR information system provides safeguarding patients' electronic patient records (EPRs) and helps health care workers and medical personnel to rapidly making correct clinical decisions. Recently, Wu et al. proposed an efficient password-based user authentication scheme using smart cards for the integrated EPR information system, and claimed that the proposed scheme could resist various malicious attacks. However, their scheme is still vulnerable to lost smart card and stolen verifier attacks. This investigation discusses these weaknesses and proposes a secure and efficient authentication scheme for the integrated EPR information system as alternative. Compared with related approaches, the proposed scheme not only retains a lower computational cost and does not require verifier tables for storing users' secrets, but also solves the security problems in previous schemes and withstands possible attacks.

  2. An Analysis of Naval Personnel Resource Allocations to Logistics. Volume I. Navy Sea-Based Personnel Resource Allocations to Logistics Functions.

    DTIC Science & Technology

    1982-08-01

    Personnel Resource Allocations to May 1982 Logistics Functions 6. PERFORMING ORG . REPORT NUMBER 7AUTHOR(s) ____________________ 8. CONTRACT OR GRANT NUMBER...6 I 114,8 1 54,7 1 I (.Cc J0 1 45.4 1 514,3 1 M059 I 956,0 1 57.4 z I IArA 1 1 218.0 1 963.9 1 620.7 1 2022.0 1 57.6 1 I ISA 11 1 36.9 1 299,6

  3. Patient preferences, knowledge and beliefs about kidney allocation: qualitative findings from the UK-wide ATTOM programme

    PubMed Central

    Cinnirella, Marco; Bayfield, Janet; Wu, Diana; Draper, Heather; Johnson, Rachel J; Tomson, Charles R V; Forsythe, John L R; Metcalfe, Wendy; Fogarty, Damian; Roderick, Paul; Ravanan, Rommel; Oniscu, Gabriel C; Watson, Christopher J E; Bradley, J Andrew; Bradley, Clare

    2017-01-01

    Objective To explore how patients who are wait-listed for or who have received a kidney transplant understand the current UK kidney allocation system, and their views on ways to allocate kidneys in the future. Design Qualitative study using semistructured interviews and thematic analysis based on a pragmatic approach. Participants 10 deceased-donor kidney transplant recipients, 10 live-donor kidney transplant recipients, 12 participants currently wait-listed for a kidney transplant and 4 participants whose kidney transplant failed. Setting Semistructured telephone interviews conducted with participants in their own homes across the UK. Results Three main themes were identified: uncertainty of knowledge of the allocation scheme; evaluation of the system and participant suggestions for future allocation schemes. Most participants identified human leucocyte anitgen matching as a factor in determining kidney allocation, but were often uncertain of the accuracy of their knowledge. In the absence of information that would allow a full assessment, the majority of participants consider that the current system is effective. A minority of participants were concerned about the perceived lack of transparency of the general decision-making processes within the scheme. Most participants felt that people who are younger and those better matched to the donor kidney should be prioritised for kidney allocation, but in contrast to the current scheme, less priority was considered appropriate for longer waiting patients. Some non-medical themes were also discussed, such as whether parents of dependent children should be prioritised for allocation, and whether patients with substance abuse problems be deprioritised. Conclusions Our participants held differing views about the most important factors for kidney allocation, some of which were in contrast to the current scheme. Patient participation in reviewing future allocation policies will provide insight as to what is considered

  4. Validation of the reporting bases of the orthopaedic and paediatric surveillance schemes.

    PubMed Central

    Godward, S; Dezateux, C

    1996-01-01

    BACKGROUND: Nationally representative estimates of treatment rates for congenital dislocation of the hip were required to inform a review of the current United Kingdom screening policy. Cases were ascertained through an active reporting scheme involving orthopaedic surgeons and the existing British Paediatric Association Surveillance Unit (BPASU) scheme. OBJECTIVE: To report the methods used to establish, maintain, and validate the orthopaedic and BPASU schemes. METHODS: Multiple sources were used to develop the orthopaedic reporting base. Surgeons treating children were identified by postal questionnaire. The orthopaedic and paediatric reporting bases were compared to the 1992 manpower census surveys of surgeons and paediatricians. RESULTS: A single source of respondent ascertainment would have missed 12% of the 517 surgeons who treated children. Comparison with the manpower census data suggests the orthopaedic and paediatric reporting bases were 97% and 92% complete. CONCLUSIONS: Multiple sources should be used to establish and maintain a reporting base. Targeting respondents avoids unnecessary contact, saves resources, and may improve compliance. Manpower census data can be used for regular validation of the reporting base. PMID:8976664

  5. A Cycle-Based Data Aggregation Scheme for Grid-Based Wireless Sensor Networks

    PubMed Central

    Chiang, Yung-Kuei; Wang, Neng-Chung; Hsieh, Chih-Hung

    2014-01-01

    In a wireless sensor network (WSN), a great number of sensor nodes are deployed to gather sensed data. These sensor nodes are typically powered by batteries so their energy is restricted. Sensor nodes mainly consume energy in data transmission, especially over a long distance. Since the location of the base station (BS) is remote, the energy consumed by each node to directly transmit its data to the BS is considerable and the node will die very soon. A well-designed routing protocol is thus essential to reduce the energy consumption. In this paper, we propose a Cycle-Based Data Aggregation Scheme (CBDAS) for grid-based WSNs. In CBDAS, the whole sensor field is divided into a grid of cells, each with a head. We prolong the network lifetime by linking all cell heads together to form a cyclic chain so that the gathered data can move in two directions. For data gathering in each round, the gathered data moves from node to node along the chain, getting aggregated. Finally, a designated cell head, the cycle leader, directly transmits to the BS. CBDAS performs data aggregation at every cell head so as to substantially reduce the amount of data that must be transmitted to the BS. Only cell heads need disseminate data so that the number of data transmissions is greatly diminished. Sensor nodes of each cell take turns as the cell head, and all cell heads on the cyclic chain also take turns being cycle leader. The energy depletion is evenly distributed so that the nodes' lifetime is extended. As a result, the lifetime of the whole sensor network is extended. Simulation results show that CBDAS outperforms protocols like Direct, PEGASIS, and PBDAS. PMID:24828579

  6. Enrolment in community-based health insurance schemes in rural Bihar and Uttar Pradesh, India.

    PubMed

    Panda, Pradeep; Chakraborty, Arpita; Dror, David M; Bedi, Arjun S

    2014-12-01

    This article assesses insurance uptake in three community-based health insurance (CBHI) schemes located in rural parts of two of India's poorest states and offered through women's self-help groups (SHGs). We examine what drives uptake, the degree of inclusive practices of the schemes and the influence of health status on enrolment. The most important finding is that a household's socio-economic status does not appear to substantially inhibit uptake. In some cases scheduled caste/scheduled tribe households are more likely to enrol. Second, households with greater financial liabilities find insurance more attractive. Third, access to the national hospital insurance scheme Rashtriya Swasthya Bima Yojana does not dampen CBHI uptake, suggesting that the potential for greater development of insurance markets and products beyond existing ones would respond to a need. Fourth, recent episodes of illness and self-assessed health status do not influence uptake. Fifth, insurance coverage is prioritized within households, with the household head, the spouse of the household head and both male and female children of the household head, more likely to be insured as compared with other relatives. Sixth, offering insurance through women's SHGs appears to mitigate concerns about the inclusiveness and sustainability of CBHI schemes. Given the pan-Indian spread of SHGs, offering insurance through such groups offers the potential to scale-up CBHI.

  7. Hierarchical Control Scheme for Improving Transient Voltage Recovery of a DFIG-Based WPP

    SciTech Connect

    Kim, Jinho; Muljadi, Eduard; Kang, Yong Cheol

    2015-06-05

    Modern grid codes require that wind power plants (WPPs) inject reactive power according to the voltage dip at a point of interconnection (POI). This requirement helps to support a POI voltage during a fault. However, if a fault is cleared, the POI and wind turbine generator (WTG) voltages are likely to exceed acceptable levels unless the WPP reduces the injected reactive power quickly. This might deteriorate the stability of a grid by allowing the disconnection of WTGs to avoid any damage. This paper proposes a hierarchical control scheme of a doubly-fed induction generator (DFIG)-based WPP. The proposed scheme aims to improve the reactive power injecting capability during the fault and suppress the overvoltage after the fault clearance. To achieve the former, an adaptive reactive power-to-voltage scheme is implemented in each DFIG controller so that a DFIG with a larger reactive power capability will inject more reactive power. To achieve the latter, a washout filter is used to capture a high frequency component contained in the WPP voltage, which is used to remove the accumulated values in the proportional-integral controllers. Test results indicate that the scheme successfully supports the grid voltage during the fault, and recovers WPP voltages without exceeding the limit after the fault clearance.

  8. Key Management Scheme Based on Route Planning of Mobile Sink in Wireless Sensor Networks

    PubMed Central

    Zhang, Ying; Liang, Jixing; Zheng, Bingxin; Jiang, Shengming; Chen, Wei

    2016-01-01

    In many wireless sensor network application scenarios the key management scheme with a Mobile Sink (MS) should be fully investigated. This paper proposes a key management scheme based on dynamic clustering and optimal-routing choice of MS. The concept of Traveling Salesman Problem with Neighbor areas (TSPN) in dynamic clustering for data exchange is proposed, and the selection probability is used in MS route planning. The proposed scheme extends static key management to dynamic key management by considering the dynamic clustering and mobility of MSs, which can effectively balance the total energy consumption during the activities. Considering the different resources available to the member nodes and sink node, the session key between cluster head and MS is established by modified an ECC encryption with Diffie-Hellman key exchange (ECDH) algorithm and the session key between member node and cluster head is built with a binary symmetric polynomial. By analyzing the security of data storage, data transfer and the mechanism of dynamic key management, the proposed scheme has more advantages to help improve the resilience of the key management system of the network on the premise of satisfying higher connectivity and storage efficiency. PMID:26840311

  9. Key Management Scheme Based on Route Planning of Mobile Sink in Wireless Sensor Networks.

    PubMed

    Zhang, Ying; Liang, Jixing; Zheng, Bingxin; Jiang, Shengming; Chen, Wei

    2016-01-29

    In many wireless sensor network application scenarios the key management scheme with a Mobile Sink (MS) should be fully investigated. This paper proposes a key management scheme based on dynamic clustering and optimal-routing choice of MS. The concept of Traveling Salesman Problem with Neighbor areas (TSPN) in dynamic clustering for data exchange is proposed, and the selection probability is used in MS route planning. The proposed scheme extends static key management to dynamic key management by considering the dynamic clustering and mobility of MSs, which can effectively balance the total energy consumption during the activities. Considering the different resources available to the member nodes and sink node, the session key between cluster head and MS is established by modified an ECC encryption with Diffie-Hellman key exchange (ECDH) algorithm and the session key between member node and cluster head is built with a binary symmetric polynomial. By analyzing the security of data storage, data transfer and the mechanism of dynamic key management, the proposed scheme has more advantages to help improve the resilience of the key management system of the network on the premise of satisfying higher connectivity and storage efficiency.

  10. A novel scheme of signaling protocol based on mobile agent and OBS

    NASA Astrophysics Data System (ADS)

    Mao, Minjing; Liu, Deming; Li, Wei

    2005-11-01

    A novel scheme of signaling protocol based on mobile agent and OBS which runs over a core DWDM network is promoted. Design of optical wavelength channels in the scheme is to choose 1310nm band to be control optical wavelength channel to transmit BHPs and 1550nm band to be burst packets optical wavelength channels to transmit BPs. Referring to RSVP-TE in DCM ASON, significations and formats of signaling messages in the protocol are defined. The key design of scheme is to utilize the structure of active packets in the application of mobile agent MANet to encapsulate signaling messages and traffic together into one BHP to shorten the set-up time of an optical path. Such structure is also used to process distributed disposals to alleviate the workload of one node in the network to promote cooperating calculation ability of each node in the network. The communication between a source node and a destination node through one or multiple intermediate nodes is presented as an example to describe the processing procedures of the protocol. The scheme is implemented in a wavelength router, which is briefly introduced.

  11. Energy-Aware Multipath Routing Scheme Based on Particle Swarm Optimization in Mobile Ad Hoc Networks

    PubMed Central

    Robinson, Y. Harold; Rajaram, M.

    2015-01-01

    Mobile ad hoc network (MANET) is a collection of autonomous mobile nodes forming an ad hoc network without fixed infrastructure. Dynamic topology property of MANET may degrade the performance of the network. However, multipath selection is a great challenging task to improve the network lifetime. We proposed an energy-aware multipath routing scheme based on particle swarm optimization (EMPSO) that uses continuous time recurrent neural network (CTRNN) to solve optimization problems. CTRNN finds the optimal loop-free paths to solve link disjoint paths in a MANET. The CTRNN is used as an optimum path selection technique that produces a set of optimal paths between source and destination. In CTRNN, particle swarm optimization (PSO) method is primly used for training the RNN. The proposed scheme uses the reliability measures such as transmission cost, energy factor, and the optimal traffic ratio between source and destination to increase routing performance. In this scheme, optimal loop-free paths can be found using PSO to seek better link quality nodes in route discovery phase. PSO optimizes a problem by iteratively trying to get a better solution with regard to a measure of quality. The proposed scheme discovers multiple loop-free paths by using PSO technique. PMID:26819966

  12. Distributed Multi-Agent-Based Protection Scheme for Transient Stability Enhancement in Power Systems

    NASA Astrophysics Data System (ADS)

    Rahman, M. S.; Mahmud, M. A.; Pota, H. R.; Hossain, M. J.; Orchi, T. F.

    2015-04-01

    This paper presents a new distributed agent-based scheme to enhance the transient stability of power systems by maintaining phase angle cohesiveness of interconnected generators through proper relay coordination with critical clearing time (CCT) information. In this distributed multi-agent infrastructure, intelligent agents represent various physical device models to provide dynamic information and energy flow among different physical processes of power systems. The agents can communicate with each other in a distributed manner with a final aim to control circuit breakers (CBs) with CCT information as this is the key issue for maintaining and enhancing the transient stability of power systems. The performance of the proposed scheme is evaluated on a standard IEEE 39-bus New England benchmark system under different large disturbances such as three-phase short-circuit faults and changes in loads within the systems. From the simulation results, it is found that the proposed scheme significantly enhances the transient stability of power systems as compared to a conventional scheme of static CB operation.

  13. A Secret 3D Model Sharing Scheme with Reversible Data Hiding Based on Space Subdivision

    NASA Astrophysics Data System (ADS)

    Tsai, Yuan-Yu

    2016-03-01

    Secret sharing is a highly relevant research field, and its application to 2D images has been thoroughly studied. However, secret sharing schemes have not kept pace with the advances of 3D models. With the rapid development of 3D multimedia techniques, extending the application of secret sharing schemes to 3D models has become necessary. In this study, an innovative secret 3D model sharing scheme for point geometries based on space subdivision is proposed. Each point in the secret point geometry is first encoded into a series of integer values that fall within [0, p - 1], where p is a predefined prime number. The share values are derived by substituting the specified integer values for all coefficients of the sharing polynomial. The surface reconstruction and the sampling concepts are then integrated to derive a cover model with sufficient model complexity for each participant. Finally, each participant has a separate 3D stego model with embedded share values. Experimental results show that the proposed technique supports reversible data hiding and the share values have higher levels of privacy and improved robustness. This technique is simple and has proven to be a feasible secret 3D model sharing scheme.

  14. Statistical mechanics of competitive resource allocation using agent-based models

    NASA Astrophysics Data System (ADS)

    Chakraborti, Anirban; Challet, Damien; Chatterjee, Arnab; Marsili, Matteo; Zhang, Yi-Cheng; Chakrabarti, Bikas K.

    2015-01-01

    Demand outstrips available resources in most situations, which gives rise to competition, interaction and learning. In this article, we review a broad spectrum of multi-agent models of competition (El Farol Bar problem, Minority Game, Kolkata Paise Restaurant problem, Stable marriage problem, Parking space problem and others) and the methods used to understand them analytically. We emphasize the power of concepts and tools from statistical mechanics to understand and explain fully collective phenomena such as phase transitions and long memory, and the mapping between agent heterogeneity and physical disorder. As these methods can be applied to any large-scale model of competitive resource allocation made up of heterogeneous adaptive agent with non-linear interaction, they provide a prospective unifying paradigm for many scientific disciplines.

  15. A Hash Based Remote User Authentication and Authenticated Key Agreement Scheme for the Integrated EPR Information System.

    PubMed

    Li, Chun-Ta; Weng, Chi-Yao; Lee, Cheng-Chi; Wang, Chun-Cheng

    2015-11-01

    To protect patient privacy and ensure authorized access to remote medical services, many remote user authentication schemes for the integrated electronic patient record (EPR) information system have been proposed in the literature. In a recent paper, Das proposed a hash based remote user authentication scheme using passwords and smart cards for the integrated EPR information system, and claimed that the proposed scheme could resist various passive and active attacks. However, in this paper, we found that Das's authentication scheme is still vulnerable to modification and user duplication attacks. Thereafter we propose a secure and efficient authentication scheme for the integrated EPR information system based on lightweight hash function and bitwise exclusive-or (XOR) operations. The security proof and performance analysis show our new scheme is well-suited to adoption in remote medical healthcare services.

  16. Exponential Arithmetic Based Self-Healing Group Key Distribution Scheme with Backward Secrecy under the Resource-Constrained Wireless Networks.

    PubMed

    Guo, Hua; Zheng, Yandong; Zhang, Xiyong; Li, Zhoujun

    2016-04-28

    In resource-constrained wireless networks, resources such as storage space and communication bandwidth are limited. To guarantee secure communication in resource-constrained wireless networks, group keys should be distributed to users. The self-healing group key distribution (SGKD) scheme is a promising cryptographic tool, which can be used to distribute and update the group key for the secure group communication over unreliable wireless networks. Among all known SGKD schemes, exponential arithmetic based SGKD (E-SGKD) schemes reduce the storage overhead to constant, thus is suitable for the the resource-constrained wireless networks. In this paper, we provide a new mechanism to achieve E-SGKD schemes with backward secrecy. We first propose a basic E-SGKD scheme based on a known polynomial-based SGKD, where it has optimal storage overhead while having no backward secrecy. To obtain the backward secrecy and reduce the communication overhead, we introduce a novel approach for message broadcasting and self-healing. Compared with other E-SGKD schemes, our new E-SGKD scheme has the optimal storage overhead, high communication efficiency and satisfactory security. The simulation results in Zigbee-based networks show that the proposed scheme is suitable for the resource-restrained wireless networks. Finally, we show the application of our proposed scheme.

  17. Robust and efficient biometrics based password authentication scheme for telecare medicine information systems using extended chaotic maps.

    PubMed

    Lu, Yanrong; Li, Lixiang; Peng, Haipeng; Xie, Dong; Yang, Yixian

    2015-06-01

    The Telecare Medicine Information Systems (TMISs) provide an efficient communicating platform supporting the patients access health-care delivery services via internet or mobile networks. Authentication becomes an essential need when a remote patient logins into the telecare server. Recently, many extended chaotic maps based authentication schemes using smart cards for TMISs have been proposed. Li et al. proposed a secure smart cards based authentication scheme for TMISs using extended chaotic maps based on Lee's and Jiang et al.'s scheme. In this study, we show that Li et al.'s scheme has still some weaknesses such as violation the session key security, vulnerability to user impersonation attack and lack of local verification. To conquer these flaws, we propose a chaotic maps and smart cards based password authentication scheme by applying biometrics technique and hash function operations. Through the informal and formal security analyses, we demonstrate that our scheme is resilient possible known attacks including the attacks found in Li et al.'s scheme. As compared with the previous authentication schemes, the proposed scheme is more secure and efficient and hence more practical for telemedical environments.

  18. Exponential Arithmetic Based Self-Healing Group Key Distribution Scheme with Backward Secrecy under the Resource-Constrained Wireless Networks

    PubMed Central

    Guo, Hua; Zheng, Yandong; Zhang, Xiyong; Li, Zhoujun

    2016-01-01

    In resource-constrained wireless networks, resources such as storage space and communication bandwidth are limited. To guarantee secure communication in resource-constrained wireless networks, group keys should be distributed to users. The self-healing group key distribution (SGKD) scheme is a promising cryptographic tool, which can be used to distribute and update the group key for the secure group communication over unreliable wireless networks. Among all known SGKD schemes, exponential arithmetic based SGKD (E-SGKD) schemes reduce the storage overhead to constant, thus is suitable for the the resource-constrained wireless networks. In this paper, we provide a new mechanism to achieve E-SGKD schemes with backward secrecy. We first propose a basic E-SGKD scheme based on a known polynomial-based SGKD, where it has optimal storage overhead while having no backward secrecy. To obtain the backward secrecy and reduce the communication overhead, we introduce a novel approach for message broadcasting and self-healing. Compared with other E-SGKD schemes, our new E-SGKD scheme has the optimal storage overhead, high communication efficiency and satisfactory security. The simulation results in Zigbee-based networks show that the proposed scheme is suitable for the resource-restrained wireless networks. Finally, we show the application of our proposed scheme. PMID:27136550

  19. Actuator fault tolerant multi-controller scheme using set separation based diagnosis

    NASA Astrophysics Data System (ADS)

    Seron, María M.; De Doná, José A.

    2010-11-01

    We present a fault tolerant control strategy based on a new principle for actuator fault diagnosis. The scheme employs a standard bank of observers which match the different fault situations that can occur in the plant. Each of these observers has an associated estimation error with distinctive dynamics when an estimator matches the current fault situation of the plant. Based on the information from each observer, a fault detection and isolation (FDI) module is able to reconfigure the control loop by selecting the appropriate control law from a bank of controllers, each of them designed to stabilise and achieve reference tracking for one of the given fault models. The main contribution of this article is to propose a new FDI principle which exploits the separation of sets that characterise healthy system operation from sets that characterise transitions from healthy to faulty behaviour. The new principle allows to provide pre-checkable conditions for guaranteed fault tolerance of the overall multi-controller scheme.

  20. Threshold multi-secret sharing scheme based on phase-shifting interferometry

    NASA Astrophysics Data System (ADS)

    Deng, Xiaopeng; Wen, Wei; Shi, Zhengang

    2017-03-01

    A threshold multi-secret sharing scheme is proposed based on phase-shifting interferometry. The K secret images to be shared are firstly encoded by using Fourier transformation, respectively. Then, these encoded images are shared into many shadow images based on recording principle of the phase-shifting interferometry. In the recovering stage, the secret images can be restored by combining any 2 K + 1 or more shadow images, while any 2 K or fewer shadow images cannot obtain any information about the secret images. As a result, a (2 K + 1 , N) threshold multi-secret sharing scheme can be implemented. Simulation results are presented to demonstrate the feasibility of the proposed method.

  1. Optimizing insecticide allocation strategies based on houses and livestock shelters for visceral leishmaniasis control in Bihar, India.

    PubMed

    Gorahava, Kaushik K; Rosenberger, Jay M; Mubayi, Anuj

    2015-07-01

    Visceral leishmaniasis (VL) is the most deadly form of the leishmaniasis family of diseases, which affects numerous developing countries. The Indian state of Bihar has the highest prevalence and mortality rate of VL in the world. Insecticide spraying is believed to be an effective vector control program for controlling the spread of VL in Bihar; however, it is expensive and less effective if not implemented systematically. This study develops and analyzes a novel optimization model for VL control in Bihar that identifies an optimal (best possible) allocation of chosen insecticide (dichlorodiphenyltrichloroethane [DDT] or deltamethrin) based on the sizes of human and cattle populations in the region. The model maximizes the insecticide-induced sandfly death rate in human and cattle dwellings while staying within the current state budget for VL vector control efforts. The model results suggest that deltamethrin might not be a good replacement for DDT because the insecticide-induced sandfly deaths are 3.72 times more in case of DDT even after 90 days post spray. Different insecticide allocation strategies between the two types of sites (houses and cattle sheds) are suggested based on the state VL-control budget and have a direct implication on VL elimination efforts in a resource-limited region.

  2. A generalized well management scheme for reservoir simulation

    SciTech Connect

    Fang, W.Y.; Lo, K.K.

    1995-12-31

    A new generalized well management scheme has been formulated to maximize oil production under multiple facility constraints. The scheme integrates reserve performance, wellbore hydraulics, surface facility constraints and lift-gas allocation o maximize oil production. It predicts well performance based on up-to-date hydraulics and reservoir conditions. The scheme has been implemented in a black oil simulator by using Separable programming and Simplex algorithm. This production optimization scheme has been applied to two full-field models. The oil production of these two full-field models is limited by water, gas and liquid haling limits at both field- and flow station-levels. The gas production is limited by injectivity as well as gas handling limits. For a 12-year production forecast on Field A, the new scheme increased oil production by 3 to 9%. For a 12-year production forecast on field B, the new scheme increased oil production by 7 to 9%.

  3. Smartphone-Based Patients' Activity Recognition by Using a Self-Learning Scheme for Medical Monitoring.

    PubMed

    Guo, Junqi; Zhou, Xi; Sun, Yunchuan; Ping, Gong; Zhao, Guoxing; Li, Zhuorong

    2016-06-01

    Smartphone based activity recognition has recently received remarkable attention in various applications of mobile health such as safety monitoring, fitness tracking, and disease prediction. To achieve more accurate and simplified medical monitoring, this paper proposes a self-learning scheme for patients' activity recognition, in which a patient only needs to carry an ordinary smartphone that contains common motion sensors. After the real-time data collection though this smartphone, we preprocess the data using coordinate system transformation to eliminate phone orientation influence. A set of robust and effective features are then extracted from the preprocessed data. Because a patient may inevitably perform various unpredictable activities that have no apriori knowledge in the training dataset, we propose a self-learning activity recognition scheme. The scheme determines whether there are apriori training samples and labeled categories in training pools that well match with unpredictable activity data. If not, it automatically assembles these unpredictable samples into different clusters and gives them new category labels. These clustered samples combined with the acquired new category labels are then merged into the training dataset to reinforce recognition ability of the self-learning model. In experiments, we evaluate our scheme using the data collected from two postoperative patient volunteers, including six labeled daily activities as the initial apriori categories in the training pool. Experimental results demonstrate that the proposed self-learning scheme for activity recognition works very well for most cases. When there exist several types of unseen activities without any apriori information, the accuracy reaches above 80 % after the self-learning process converges.

  4. Privacy-Preserving Location-Based Service Scheme for Mobile Sensing Data †

    PubMed Central

    Xie, Qingqing; Wang, Liangmin

    2016-01-01

    With the wide use of mobile sensing application, more and more location-embedded data are collected and stored in mobile clouds, such as iCloud, Samsung cloud, etc. Using these data, the cloud service provider (CSP) can provide location-based service (LBS) for users. However, the mobile cloud is untrustworthy. The privacy concerns force the sensitive locations to be stored on the mobile cloud in an encrypted form. However, this brings a great challenge to utilize these data to provide efficient LBS. To solve this problem, we propose a privacy-preserving LBS scheme for mobile sensing data, based on the RSA (for Rivest, Shamir and Adleman) algorithm and ciphertext policy attribute-based encryption (CP-ABE) scheme. The mobile cloud can perform location distance computing and comparison efficiently for authorized users, without location privacy leakage. In the end, theoretical security analysis and experimental evaluation demonstrate that our scheme is secure against the chosen plaintext attack (CPA) and efficient enough for practical applications in terms of user side computation overhead. PMID:27897984

  5. Universal health coverage in Latin American countries: how to improve solidarity-based schemes.

    PubMed

    Titelman, Daniel; Cetrángolo, Oscar; Acosta, Olga Lucía

    2015-04-04

    In this Health Policy we examine the association between the financing structure of health systems and universal health coverage. Latin American health systems encompass a wide range of financial sources, which translate into different solidarity-based schemes that combine contributory (payroll taxes) and non-contributory (general taxes) sources of financing. To move towards universal health coverage, solidarity-based schemes must heavily rely on countries' capacity to increase public expenditure in health. Improvement of solidarity-based schemes will need the expansion of mandatory universal insurance systems and strengthening of the public sector including increased fiscal expenditure. These actions demand a new model to integrate different sources of health-sector financing, including general tax revenue, social security contributions, and private expenditure. The extent of integration achieved among these sources will be the main determinant of solidarity and universal health coverage. The basic challenges for improvement of universal health coverage are not only to spend more on health, but also to reduce the proportion of out-of-pocket spending, which will need increased fiscal resources.

  6. A novel fractal image compression scheme with block classification and sorting based on Pearson's correlation coefficient.

    PubMed

    Wang, Jianji; Zheng, Nanning

    2013-09-01

    Fractal image compression (FIC) is an image coding technology based on the local similarity of image structure. It is widely used in many fields such as image retrieval, image denoising, image authentication, and encryption. FIC, however, suffers from the high computational complexity in encoding. Although many schemes are published to speed up encoding, they do not easily satisfy the encoding time or the reconstructed image quality requirements. In this paper, a new FIC scheme is proposed based on the fact that the affine similarity between two blocks in FIC is equivalent to the absolute value of Pearson's correlation coefficient (APCC) between them. First, all blocks in the range and domain pools are chosen and classified using an APCC-based block classification method to increase the matching probability. Second, by sorting the domain blocks with respect to APCCs between these domain blocks and a preset block in each class, the matching domain block for a range block can be searched in the selected domain set in which these APCCs are closer to APCC between the range block and the preset block. Experimental results show that the proposed scheme can significantly speed up the encoding process in FIC while preserving the reconstructed image quality well.

  7. An Adaptive Handover Prediction Scheme for Seamless Mobility Based Wireless Networks

    PubMed Central

    Safa Sadiq, Ali; Fisal, Norsheila Binti; Ghafoor, Kayhan Zrar; Lloret, Jaime

    2014-01-01

    We propose an adaptive handover prediction (AHP) scheme for seamless mobility based wireless networks. That is, the AHP scheme incorporates fuzzy logic with AP prediction process in order to lend cognitive capability to handover decision making. Selection metrics, including received signal strength, mobile node relative direction towards the access points in the vicinity, and access point load, are collected and considered inputs of the fuzzy decision making system in order to select the best preferable AP around WLANs. The obtained handover decision which is based on the calculated quality cost using fuzzy inference system is also based on adaptable coefficients instead of fixed coefficients. In other words, the mean and the standard deviation of the normalized network prediction metrics of fuzzy inference system, which are collected from available WLANs are obtained adaptively. Accordingly, they are applied as statistical information to adjust or adapt the coefficients of membership functions. In addition, we propose an adjustable weight vector concept for input metrics in order to cope with the continuous, unpredictable variation in their membership degrees. Furthermore, handover decisions are performed in each MN independently after knowing RSS, direction toward APs, and AP load. Finally, performance evaluation of the proposed scheme shows its superiority compared with representatives of the prediction approaches. PMID:25574490

  8. A Selective Group Authentication Scheme for IoT-Based Medical Information System.

    PubMed

    Park, YoHan; Park, YoungHo

    2017-04-01

    The technology of IoT combined with medical systems is expected to support advanced medical services. However, unsolved security problems, such as misuse of medical devices, illegal access to the medical server and so on, make IoT-based medical systems not be applied widely. In addition, users have a high burden of computation to access Things for the explosive growth of IoT devices. Because medical information is critical and important, but users have a restricted computing power, IoT-based medical systems are required to provide secure and efficient authentication for users. In this paper, we propose a selective group authentication scheme using Shamir's threshold technique. The property of selectivity gives the right of choice to users to form a group which consists of things users select and access. And users can get an access authority for those Things at a time. Thus, our scheme provides an efficient user authentication for multiple Things and conditional access authority for safe IoT-based medical information system. To the best of our knowledge, our proposed scheme is the first in which selectivity is combined with group authentication in IoT environments.

  9. Accurate B-spline-based 3-D interpolation scheme for digital volume correlation.

    PubMed

    Ren, Maodong; Liang, Jin; Wei, Bin

    2016-12-01

    An accurate and efficient 3-D interpolation scheme, based on sampling theorem and Fourier transform technique, is proposed to reduce the sub-voxel matching error caused by intensity interpolation bias in digital volume correlation. First, the influence factors of the interpolation bias are investigated theoretically using the transfer function of an interpolation filter (henceforth filter) in the Fourier domain. A law that the positional error of a filter can be expressed as a function of fractional position and wave number is found. Then, considering the above factors, an optimized B-spline-based recursive filter, combining B-spline transforms and least squares optimization method, is designed to virtually eliminate the interpolation bias in the process of sub-voxel matching. Besides, given each volumetric image containing different wave number ranges, a Gaussian weighting function is constructed to emphasize or suppress certain of wave number ranges based on the Fourier spectrum analysis. Finally, a novel software is developed and series of validation experiments were carried out to verify the proposed scheme. Experimental results show that the proposed scheme can reduce the interpolation bias to an acceptable level.

  10. An adaptive handover prediction scheme for seamless mobility based wireless networks.

    PubMed

    Sadiq, Ali Safa; Fisal, Norsheila Binti; Ghafoor, Kayhan Zrar; Lloret, Jaime

    2014-01-01

    We propose an adaptive handover prediction (AHP) scheme for seamless mobility based wireless networks. That is, the AHP scheme incorporates fuzzy logic with AP prediction process in order to lend cognitive capability to handover decision making. Selection metrics, including received signal strength, mobile node relative direction towards the access points in the vicinity, and access point load, are collected and considered inputs of the fuzzy decision making system in order to select the best preferable AP around WLANs. The obtained handover decision which is based on the calculated quality cost using fuzzy inference system is also based on adaptable coefficients instead of fixed coefficients. In other words, the mean and the standard deviation of the normalized network prediction metrics of fuzzy inference system, which are collected from available WLANs are obtained adaptively. Accordingly, they are applied as statistical information to adjust or adapt the coefficients of membership functions. In addition, we propose an adjustable weight vector concept for input metrics in order to cope with the continuous, unpredictable variation in their membership degrees. Furthermore, handover decisions are performed in each MN independently after knowing RSS, direction toward APs, and AP load. Finally, performance evaluation of the proposed scheme shows its superiority compared with representatives of the prediction approaches.

  11. Privacy-Preserving Location-Based Service Scheme for Mobile Sensing Data.

    PubMed

    Xie, Qingqing; Wang, Liangmin

    2016-11-25

    With the wide use of mobile sensing application, more and more location-embedded data are collected and stored in mobile clouds, such as iCloud, Samsung cloud, etc. Using these data, the cloud service provider (CSP) can provide location-based service (LBS) for users. However, the mobile cloud is untrustworthy. The privacy concerns force the sensitive locations to be stored on the mobile cloud in an encrypted form. However, this brings a great challenge to utilize these data to provide efficient LBS. To solve this problem, we propose a privacy-preserving LBS scheme for mobile sensing data, based on the RSA (for Rivest, Shamir and Adleman) algorithm and ciphertext policy attribute-based encryption (CP-ABE) scheme. The mobile cloud can perform location distance computing and comparison efficiently for authorized users, without location privacy leakage. In the end, theoretical security analysis and experimental evaluation demonstrate that our scheme is secure against the chosen plaintext attack (CPA) and efficient enough for practical applications in terms of user side computation overhead.

  12. Novel Image Encryption Scheme Based on Chebyshev Polynomial and Duffing Map

    PubMed Central

    2014-01-01

    We present a novel image encryption algorithm using Chebyshev polynomial based on permutation and substitution and Duffing map based on substitution. Comprehensive security analysis has been performed on the designed scheme using key space analysis, visual testing, histogram analysis, information entropy calculation, correlation coefficient analysis, differential analysis, key sensitivity test, and speed test. The study demonstrates that the proposed image encryption algorithm shows advantages of more than 10113 key space and desirable level of security based on the good statistical results and theoretical arguments. PMID:25143970

  13. Constant time worker thread allocation via configuration caching

    DOEpatents

    Eichenberger, Alexandre E; O'Brien, John K. P.

    2014-11-04

    Mechanisms are provided for allocating threads for execution of a parallel region of code. A request for allocation of worker threads to execute the parallel region of code is received from a master thread. Cached thread allocation information identifying prior thread allocations that have been performed for the master thread are accessed. Worker threads are allocated to the master thread based on the cached thread allocation information. The parallel region of code is executed using the allocated worker threads.

  14. Integration of current identity-based district-varied health insurance schemes in China: implications and challenges.

    PubMed

    Wang, Hai-Qiang; Liu, Zhi-Heng; Zhang, Yong-Zhao; Luo, Zhuo-Jing

    2012-03-01

    With China's great efforts to improve public health insurance, clear progress has been achieved toward the ambitious full health insurance coverage strategy for all. The current health insurance schemes in China fall into three categories: urban employee basic health insurance scheme, urban resident scheme, and new rural cooperative medical system. Despite their phasic success, these substantially identity-based, district-varied health insurance schemes have separate operation mechanisms, various administrative institutions, and consequently poor connections. On the other hand, the establishment and implementation of various health insurance schemes provide the preconditioning of more sophisticated social health insurance schemes, the increase in the income of urban and rural people, and the great importance attached by the government. Moreover, the reform of the "Hukou" (household register) system provides economical, official, and institutional bases. Therefore, the establishment of an urban-rural integrated, citizen-based, and nationwide-universal health insurance scheme by the government is critically important to attain equality and national connection. Accordingly, the differences between urban and rural areas should be minimized. In addition, the current schemes, administrative institutions, and networks should be integrated and interconnected. Moreover, more expenditure on health insurance might be essential for the integration despite the settings of global financial crisis. Regardless of the possible challenges in implementation, the proposed new scheme is promising and may be applied in the near future for the benefit of the Chinese people and global health.

  15. Are outcome-adaptive allocation trials ethical?

    PubMed

    Hey, Spencer Phillips; Kimmelman, Jonathan

    2015-04-01

    Randomization is firmly established as a cornerstone of clinical trial methodology. Yet, the ethics of randomization continues to generate controversy. The default, and most efficient, allocation scheme randomizes patients equally (1:1) across all arms of study. However, many randomized trials are using outcome-adaptive allocation schemes, which dynamically adjust the allocation ratio in favor of the better performing treatment arm. Advocates of outcome-adaptive allocation contend that it better accommodates clinical equipoise and promotes informed consent, since such trials limit patient-subject exposure to sub-optimal care. In this essay, we argue that this purported ethical advantage of outcome-adaptive allocation does not stand up to careful scrutiny in the setting of two-armed studies and/or early-phase research.

  16. Preventing conflicts among bid curves used with transactive controllers in a market-based resource allocation system

    DOEpatents

    Fuller, Jason C.; Chassin, David P.; Pratt, Robert G.; Hauer, Matthew; Tuffner, Francis K.

    2017-03-07

    Disclosed herein are representative embodiments of methods, apparatus, and systems for distributing a resource (such as electricity) using a resource allocation system. One of the disclosed embodiments is a method for operating a transactive thermostatic controller configured to submit bids to a market-based resource allocation system. According to the exemplary method, a first bid curve is determined, the first bid curve indicating a first set of bid prices for corresponding temperatures and being associated with a cooling mode of operation for a heating and cooling system. A second bid curve is also determined, the second bid curve indicating a second set of bid prices for corresponding temperatures and being associated with a heating mode of operation for a heating and cooling system. In this embodiment, the first bid curve, the second bid curve, or both the first bid curve and the second bid curve are modified to prevent overlap of any portion of the first bid curve and the second bid curve.

  17. Performance impact of mutation operators of a subpopulation-based genetic algorithm for multi-robot task allocation problems.

    PubMed

    Liu, Chun; Kroll, Andreas

    2016-01-01

    Multi-robot task allocation determines the task sequence and distribution for a group of robots in multi-robot systems, which is one of constrained combinatorial optimization problems and more complex in case of cooperative tasks because they introduce additional spatial and temporal constraints. To solve multi-robot task allocation problems with cooperative tasks efficiently, a subpopulation-based genetic algorithm, a crossover-free genetic algorithm employing mutation operators and elitism selection in each subpopulation, is developed in this paper. Moreover, the impact of mutation operators (swap, insertion, inversion, displacement, and their various combinations) is analyzed when solving several industrial plant inspection problems. The experimental results show that: (1) the proposed genetic algorithm can obtain better solutions than the tested binary tournament genetic algorithm with partially mapped crossover; (2) inversion mutation performs better than other tested mutation operators when solving problems without cooperative tasks, and the swap-inversion combination performs better than other tested mutation operators/combinations when solving problems with cooperative tasks. As it is difficult to produce all desired effects with a single mutation operator, using multiple mutation operators (including both inversion and swap) is suggested when solving similar combinatorial optimization problems.

  18. Read-out optical schemes for holographic memory system based on multiplexed computer generated 1D Fourier holograms

    NASA Astrophysics Data System (ADS)

    Donchenko, Sergey S.; Odinokov, Sergey B.; Bobrinev, Vladimir I.; Betin, Alexandr Y.; Zlokazov, Evgenie Y.

    2015-05-01

    Computer holographic synthesis allows to significantly simplify the recording scheme of microholograms in holographic memory system as the classic high precision holographic setup based on two-beam interference is removed by simple scale reduction projection scheme. Application of computer generated 1D-Fourier holograms provides the possibility of selective reconstruction of the multiplexed holograms with different orientation of data lines by corresponding rotation of anamorphic objective (cylindrical lens), used in the read-out systems. Two configurations of read-out optical scheme were investigated by our team: full-page scheme and line-by-line scheme. In the present article we report the specificities of these schemes and consider their advantages and disadvantages. The results of experimental modeling of both read-out configurations are also presented.

  19. AVQS: attack route-based vulnerability quantification scheme for smart grid.

    PubMed

    Ko, Jongbin; Lim, Hyunwoo; Lee, Seokjun; Shon, Taeshik

    2014-01-01

    A smart grid is a large, consolidated electrical grid system that includes heterogeneous networks and systems. Based on the data, a smart grid system has a potential security threat in its network connectivity. To solve this problem, we develop and apply a novel scheme to measure the vulnerability in a smart grid domain. Vulnerability quantification can be the first step in security analysis because it can help prioritize the security problems. However, existing vulnerability quantification schemes are not suitable for smart grid because they do not consider network vulnerabilities. We propose a novel attack route-based vulnerability quantification scheme using a network vulnerability score and an end-to-end security score, depending on the specific smart grid network environment to calculate the vulnerability score for a particular attack route. To evaluate the proposed approach, we derive several attack scenarios from the advanced metering infrastructure domain. The experimental results of the proposed approach and the existing common vulnerability scoring system clearly show that we need to consider network connectivity for more optimized vulnerability quantification.

  20. AVQS: Attack Route-Based Vulnerability Quantification Scheme for Smart Grid

    PubMed Central

    Lim, Hyunwoo; Lee, Seokjun; Shon, Taeshik

    2014-01-01

    A smart grid is a large, consolidated electrical grid system that includes heterogeneous networks and systems. Based on the data, a smart grid system has a potential security threat in its network connectivity. To solve this problem, we develop and apply a novel scheme to measure the vulnerability in a smart grid domain. Vulnerability quantification can be the first step in security analysis because it can help prioritize the security problems. However, existing vulnerability quantification schemes are not suitable for smart grid because they do not consider network vulnerabilities. We propose a novel attack route-based vulnerability quantification scheme using a network vulnerability score and an end-to-end security score, depending on the specific smart grid network environment to calculate the vulnerability score for a particular attack route. To evaluate the proposed approach, we derive several attack scenarios from the advanced metering infrastructure domain. The experimental results of the proposed approach and the existing common vulnerability scoring system clearly show that we need to consider network connectivity for more optimized vulnerability quantification. PMID:25152923

  1. A QR code based zero-watermarking scheme for authentication of medical images in teleradiology cloud.

    PubMed

    Seenivasagam, V; Velumani, R

    2013-01-01

    Healthcare institutions adapt cloud based archiving of medical images and patient records to share them efficiently. Controlled access to these records and authentication of images must be enforced to mitigate fraudulent activities and medical errors. This paper presents a zero-watermarking scheme implemented in the composite Contourlet Transform (CT)-Singular Value Decomposition (SVD) domain for unambiguous authentication of medical images. Further, a framework is proposed for accessing patient records based on the watermarking scheme. The patient identification details and a link to patient data encoded into a Quick Response (QR) code serves as the watermark. In the proposed scheme, the medical image is not subjected to degradations due to watermarking. Patient authentication and authorized access to patient data are realized on combining a Secret Share with the Master Share constructed from invariant features of the medical image. The Hu's invariant image moments are exploited in creating the Master Share. The proposed system is evaluated with Checkmark software and is found to be robust to both geometric and non geometric attacks.

  2. High efficient key-insulated attribute based encryption scheme without bilinear pairing operations.

    PubMed

    Hong, Hanshu; Sun, Zhixin

    2016-01-01

    Attribute based encryption (ABE) has been widely applied for secure data protection in various data sharing systems. However, the efficiency of existing ABE schemes is not high enough since running encrypt and decrypt algorithms need frequent bilinear pairing operations, which may occupy too much computing resources on terminal devices. What's more, since different users may share the same attributes in the system, a single user's private key exposure will threaten the security and confidentiality of the whole system. Therefore, to further decrease the computation cost in attribute based cryptosystem as well as provide secure protection when key exposure happens, in this paper, we firstly propose a high efficient key-insulated ABE algorithm without pairings. The key-insulated mechanism guarantees both forward security and backward security when key exposure or user revocation happens. Besides, during the running of algorithms in our scheme, users and attribute authority needn't run any bilinear pairing operations, which will increase the efficiency to a large extent. The high efficiency and security analysis indicate that our scheme is more appropriate for secure protection in data sharing systems.

  3. A security-awareness virtual machine management scheme based on Chinese wall policy in cloud computing.

    PubMed

    Yu, Si; Gui, Xiaolin; Lin, Jiancai; Tian, Feng; Zhao, Jianqiang; Dai, Min

    2014-01-01

    Cloud computing gets increasing attention for its capacity to leverage developers from infrastructure management tasks. However, recent works reveal that side channel attacks can lead to privacy leakage in the cloud. Enhancing isolation between users is an effective solution to eliminate the attack. In this paper, to eliminate side channel attacks, we investigate the isolation enhancement scheme from the aspect of virtual machine (VM) management. The security-awareness VMs management scheme (SVMS), a VMs isolation enhancement scheme to defend against side channel attacks, is proposed. First, we use the aggressive conflict of interest relation (ACIR) and aggressive in ally with relation (AIAR) to describe user constraint relations. Second, based on the Chinese wall policy, we put forward four isolation rules. Third, the VMs placement and migration algorithms are designed to enforce VMs isolation between the conflict users. Finally, based on the normal distribution, we conduct a series of experiments to evaluate SVMS. The experimental results show that SVMS is efficient in guaranteeing isolation between VMs owned by conflict users, while the resource utilization rate decreases but not by much.

  4. A Security-Awareness Virtual Machine Management Scheme Based on Chinese Wall Policy in Cloud Computing

    PubMed Central

    Gui, Xiaolin; Lin, Jiancai; Tian, Feng; Zhao, Jianqiang; Dai, Min

    2014-01-01

    Cloud computing gets increasing attention for its capacity to leverage developers from infrastructure management tasks. However, recent works reveal that side channel attacks can lead to privacy leakage in the cloud. Enhancing isolation between users is an effective solution to eliminate the attack. In this paper, to eliminate side channel attacks, we investigate the isolation enhancement scheme from the aspect of virtual machine (VM) management. The security-awareness VMs management scheme (SVMS), a VMs isolation enhancement scheme to defend against side channel attacks, is proposed. First, we use the aggressive conflict of interest relation (ACIR) and aggressive in ally with relation (AIAR) to describe user constraint relations. Second, based on the Chinese wall policy, we put forward four isolation rules. Third, the VMs placement and migration algorithms are designed to enforce VMs isolation between the conflict users. Finally, based on the normal distribution, we conduct a series of experiments to evaluate SVMS. The experimental results show that SVMS is efficient in guaranteeing isolation between VMs owned by conflict users, while the resource utilization rate decreases but not by much. PMID:24688434

  5. Sequence-Based Classification Scheme for the Genus Legionella Targeting the mip Gene

    PubMed Central

    Ratcliff, Rodney M.; Lanser, Janice A.; Manning, Paul A.; Heuzenroeder, Michael W.

    1998-01-01

    The identification and speciation of strains of Legionella is often difficult, and even the more successful chromatographic classification techniques have struggled to discriminate newly described species. A sequence-based genotypic classification scheme is reported, targeting approximately 700 nucleotide bases of the mip gene and utilizing gene amplification and direct amplicon sequencing. With the exception of Legionella geestiana, for which an amplicon was not produced, the scheme clearly and unambiguously discriminated among the remaining 39 Legionella species and correctly grouped 26 additional serogroup and reference strains within those species. Additionally, the genotypic classification of approximately 150 wild strains from several continents was consistent with their phenotypic classification, with the exception of a few strains where serological cross-reactivity was complex, potentially confusing the latter classification. Strains thought to represent currently uncharacterized species were also found to be genotypically unique. The scheme is technically simple for a laboratory with even basic molecular capabilities and equipment, if access to a sequencing laboratory is available. PMID:9620377

  6. Compute unified device architecture (CUDA)-based parallelization of WRF Kessler cloud microphysics scheme

    NASA Astrophysics Data System (ADS)

    Mielikainen, Jarno; Huang, Bormin; Wang, Jun; Allen Huang, H.-L.; Goldberg, Mitchell D.

    2013-03-01

    In recent years, graphics processing units (GPUs) have emerged as a low-cost, low-power and a very high performance alternative to conventional central processing units (CPUs). The latest GPUs offer a speedup of two-to-three orders of magnitude over CPU for various science and engineering applications. The Weather Research and Forecasting (WRF) model is the latest-generation numerical weather prediction model. It has been designed to serve both operational forecasting and atmospheric research needs. It proves useful for a broad spectrum of applications for domain scales ranging from meters to hundreds of kilometers. WRF computes an approximate solution to the differential equations which govern the air motion of the whole atmosphere. Kessler microphysics module in WRF is a simple warm cloud scheme that includes water vapor, cloud water and rain. Microphysics processes which are modeled are rain production, fall and evaporation. The accretion and auto-conversion of cloud water processes are also included along with the production of cloud water from condensation. In this paper, we develop an efficient WRF Kessler microphysics scheme which runs on Graphics Processing Units (GPUs) using the NVIDIA Compute Unified Device Architecture (CUDA). The GPU-based implementation of Kessler microphysics scheme achieves a significant speedup of 70× over its CPU based single-threaded counterpart. When a 4 GPU system is used, we achieve an overall speedup of 132× as compared to the single thread CPU version.

  7. An authenticated image encryption scheme based on chaotic maps and memory cellular automata

    NASA Astrophysics Data System (ADS)

    Bakhshandeh, Atieh; Eslami, Ziba

    2013-06-01

    This paper introduces a new image encryption scheme based on chaotic maps, cellular automata and permutation-diffusion architecture. In the permutation phase, a piecewise linear chaotic map is utilized to confuse the plain-image and in the diffusion phase, we employ the Logistic map as well as a reversible memory cellular automata to obtain an efficient and secure cryptosystem. The proposed method admits advantages such as highly secure diffusion mechanism, computational efficiency and ease of implementation. A novel property of the proposed scheme is its authentication ability which can detect whether the image is tampered during the transmission or not. This is particularly important in applications where image data or part of it contains highly sensitive information. Results of various analyses manifest high security of this new method and its capability for practical image encryption.

  8. An efficient and secure medical image protection scheme based on chaotic maps.

    PubMed

    Fu, Chong; Meng, Wei-hong; Zhan, Yong-feng; Zhu, Zhi-liang; Lau, Francis C M; Tse, Chi K; Ma, Hong-feng

    2013-09-01

    Recently, the increasing demand for telemedicine services has raised interest in the use of medical image protection technology. Conventional block ciphers are poorly suited to image protection due to the size of image data and increasing demand for real-time teleradiology and other online telehealth applications. To meet this challenge, this paper presents a novel chaos-based medical image encryption scheme. To address the efficiency problem encountered by many existing permutation-substitution type image ciphers, the proposed scheme introduces a substitution mechanism in the permutation process through a bit-level shuffling algorithm. As the pixel value mixing effect is contributed by both the improved permutation process and the original substitution process, the same level of security can be achieved in a fewer number of overall rounds. The results indicate that the proposed approach provides an efficient method for real-time secure medical image transmission over public networks.

  9. A Vector Measurement-based Angular Velocity Estimation Scheme for Maneuvering Spacecraft

    NASA Astrophysics Data System (ADS)

    Jo, Sujang; Bang, Hyochoong; Leeghim, Henzeh

    2017-01-01

    A new practical approach to estimate the body angular velocity of maneuvering spacecraft using only vector measurements is presented. Several algorithms have been introduced in previous studies to estimate the angular velocity directly from vector measurements at two time instants. However, these direct methods are based on the constant angular velocity assumption, and estimation results may be invalid for attitude maneuvers. In this paper, an estimation scheme to consider attitude disturbances and control torques is proposed. The effects of angular velocity variation on estimation results are quantitatively evaluated, and an algorithm to minimize estimation errors is designed by selecting the optimal time interval between vector measurements. Without losing the simplicity of direct methods, the design parameters of the algorithm are restricted to the expected covariance of disturbances and the maximum angular acceleration. By applying the proposed estimation scheme, gyroscopes can be directly replaced by attitude sensors such as star trackers.

  10. A secure data outsourcing scheme based on Asmuth-Bloom secret sharing

    NASA Astrophysics Data System (ADS)

    Idris Muhammad, Yusuf; Kaiiali, Mustafa; Habbal, Adib; Wazan, A. S.; Sani Ilyasu, Auwal

    2016-11-01

    Data outsourcing is an emerging paradigm for data management in which a database is provided as a service by third-party service providers. One of the major benefits of offering database as a service is to provide organisations, which are unable to purchase expensive hardware and software to host their databases, with efficient data storage accessible online at a cheap rate. Despite that, several issues of data confidentiality, integrity, availability and efficient indexing of users' queries at the server side have to be addressed in the data outsourcing paradigm. Service providers have to guarantee that their clients' data are secured against internal (insider) and external attacks. This paper briefly analyses the existing indexing schemes in data outsourcing and highlights their advantages and disadvantages. Then, this paper proposes a secure data outsourcing scheme based on Asmuth-Bloom secret sharing which tries to address the issues in data outsourcing such as data confidentiality, availability and order preservation for efficient indexing.

  11. Power consumption analysis of priority-based service differentiation scheme for LR-WPANs

    NASA Astrophysics Data System (ADS)

    Kim, Meejoung; Hwang, Eenjun

    2016-06-01

    In this paper, we investigate the effect of service differentiation on the power consumption in contention period of IEEE 802.15.4 sensor networks. Power consumption is analysed for two different service differentiation schemes under non-saturation condition. The two service differentiation schemes are the differentiation by the backoff exponent (BED) and differentiation by the contention window (CWD), which provide multilevel differentiated services in beacon-enabled mode with slotted carrier sense multiple access/collision avoidance (CSMA/CA) algorithm. The analysis is based on the stationary probabilities of a discrete-time Markov chain, which is a model of CSMA/CA describing the state of a head packet of a device. Numerical results show that CWD uses the power more efficiently and performs better in terms of throughput, while BED more differentiates the service.

  12. A controlled variation scheme for convection treatment in pressure-based algorithm

    NASA Technical Reports Server (NTRS)

    Shyy, Wei; Thakur, Siddharth; Tucker, Kevin

    1993-01-01

    Convection effect and source terms are two primary sources of difficulties in computing turbulent reacting flows typically encountered in propulsion devices. The present work intends to elucidate the individual as well as the collective roles of convection and source terms in the fluid flow equations, and to devise appropriate treatments and implementations to improve our current capability of predicting such flows. A controlled variation scheme (CVS) has been under development in the context of a pressure-based algorithm, which has the characteristics of adaptively regulating the amount of numerical diffusivity, relative to central difference scheme, according to the variation in local flow field. Both the basic concepts and a pragmatic assessment will be presented to highlight the status of this work.

  13. Skin formation in drying a film of soft matter solutions: Application of solute based Lagrangian scheme

    NASA Astrophysics Data System (ADS)

    Ling, Luo; Fanlong, Meng; Junying, Zhang; Masao, Doi

    2016-07-01

    When a film of soft matter solutions is being dried, a skin layer often forms at its surface, which is a gel-like elastic phase made of concentrated soft matter solutions. We study the dynamics of this process by using the solute based Lagrangian scheme which was proposed by us recently. In this scheme, the process of the gelation (i.e., the change from sol to gel) can be naturally incorporated in the diffusion equation. Effects of the elasticity of the skin phase, the evaporation rate of the solvents, and the initial concentration of the solutions are discussed. Moreover, the condition for the skin formation is provided. Project supported by the National Natural Science of China (Grant Nos. 21434001, 51561145002, and 11421110001).

  14. An adaptive critic-based scheme for consensus control of nonlinear multi-agent systems

    NASA Astrophysics Data System (ADS)

    Heydari, Ali; Balakrishnan, S. N.

    2014-12-01

    The problem of decentralised consensus control of a network of heterogeneous nonlinear systems is formulated as an optimal tracking problem and a solution is proposed using an approximate dynamic programming based neurocontroller. The neurocontroller training comprises an initial offline training phase and an online re-optimisation phase to account for the fact that the reference signal subject to tracking is not fully known and available ahead of time, i.e., during the offline training phase. As long as the dynamics of the agents are controllable, and the communication graph has a directed spanning tree, this scheme guarantees the synchronisation/consensus even under switching communication topology and directed communication graph. Finally, an aerospace application is selected for the evaluation of the performance of the method. Simulation results demonstrate the potential of the scheme.

  15. ‘Baseline-offset’ scheme for a methane remote sensor based on wavelength modulation spectroscopy

    NASA Astrophysics Data System (ADS)

    Ding, Wuwen; Sun, Liqun; Yi, Luying; Zhang, Enyao

    2016-08-01

    A new scheme for methane remote sensing is presented. Unlike a standard published remote sensor based on wavelength modulation spectroscopy (WMS), a reference cell is inserted into the measuring optical path. This scheme inherits the merits of WMS and can achieve high signal-to-noise ratio especially in a low concentration environment. Experimental results show that the presented remote sensor can detect ambient methane with a detection limit of 5 ppm m (parts per million · meter) at a distance of 10 m and 16 ppm m for 20 m. A methane leak test shows the sensor can detect a methane leak of 15 ml min-1 within a range up to 37 m.

  16. Fresnel domain nonlinear optical image encryption scheme based on Gerchberg-Saxton phase-retrieval algorithm.

    PubMed

    Rajput, Sudheesh K; Nishchal, Naveen K

    2014-01-20

    We propose a novel nonlinear image-encryption scheme based on a Gerchberg-Saxton (G-S) phase-retrieval algorithm in the Fresnel transform domain. The decryption process can be performed using conventional double random phase encoding (DRPE) architecture. The encryption is realized by applying G-S phase-retrieval algorithm twice, which generates two asymmetric keys from intermediate phases. The asymmetric keys are generated in such a way that decryption is possible optically with a conventional DRPE method. Due to the asymmetric nature of the keys, the proposed encryption process is nonlinear and offers enhanced security. The cryptanalysis has been carried out, which proves the robustness of proposed scheme against known-plaintext, chosen-plaintext, and special attacks. A simple optical setup for decryption has also been suggested. Results of computer simulation support the idea of the proposed cryptosystem.

  17. A micro resonant charge sensor with enhanced sensitivity based on differential sensing scheme and leverage mechanisms

    NASA Astrophysics Data System (ADS)

    Chen, Dongyang; Zhao, Jiuxuan; Xu, Zhonggui; Xie, Jin

    2016-10-01

    This letter reports a micro-electro-mechanical systems (MEMS) resonant charge sensor with enhanced sensitivity based on differential sensing scheme and leverage mechanisms. The sensor comprises two symmetrically-distributed double-ended tuning fork (DETF) resonators, each of which connects with dual micro-leverage mechanisms. The micro-leverages amplify electrostatic force in opposite directions and cause differential frequency shift of the two resonators. Both the resonators show a similar trend in behaviors of electrical and mechanical nonlinearity. Effect of environment disturbance is suppressed by the differential sensing scheme. The measured sensitivity of the two resonators are 3.31×10-4 Hz/fC2 and 1.85×10-4 Hz/fC2 respectively, and an overall sensitivity for the resonant charge sensor is 5.16×10-4 Hz/fC2.

  18. Application of portfolio theory to risk-based allocation of surveillance resources in animal populations.

    PubMed

    Prattley, D J; Morris, R S; Stevenson, M A; Thornton, R

    2007-09-14

    Distribution of finite levels of resources between multiple competing tasks can be a challenging problem. Resources need to be distributed across time periods and geographic locations to increase the probability of detection of a disease incursion or significant change in disease pattern. Efforts should focus primarily on areas and populations where risk factors for a given disease reach relatively high levels. In order to target resources into these areas, the overall risk level can be evaluated periodically across locations to create a dynamic national risk landscape. Methods are described to integrate the levels of various risk factors into an overall risk score for each area, to account for the certainty or variability around those measures and then to allocate surveillance resources across this risk landscape. In addition to targeting resources into high risk areas, surveillance continues in lower risk areas where there is a small yet positive chance of disease occurrence. In this paper we describe the application of portfolio theory concepts, routinely used in finance, to design surveillance portfolios for a series of examples. The appropriate level of resource investment is chosen for each disease or geographical area and time period given the degree of disease risk and uncertainty present.

  19. Monitoring of posture allocations and activities by a shoe-based wearable sensor.

    PubMed

    Sazonov, Edward S; Fulk, George; Hill, James; Schutz, Yves; Browning, Raymond

    2011-04-01

    Monitoring of posture allocations and activities enables accurate estimation of energy expenditure and may aid in obesity prevention and treatment. At present, accurate devices rely on multiple sensors distributed on the body and thus may be too obtrusive for everyday use. This paper presents a novel wearable sensor, which is capable of very accurate recognition of common postures and activities. The patterns of heel acceleration and plantar pressure uniquely characterize postures and typical activities while requiring minimal preprocessing and no feature extraction. The shoe sensor was tested in nine adults performing sitting and standing postures and while walking, running, stair ascent/descent and cycling. Support vector machines (SVMs) were used for classification. A fourfold validation of a six-class subject-independent group model showed 95.2% average accuracy of posture/activity classification on full sensor set and over 98% on optimized sensor set. Using a combination of acceleration/pressure also enabled a pronounced reduction of the sampling frequency (25 to 1 Hz) without significant loss of accuracy (98% versus 93%). Subjects had shoe sizes (US) M9.5-11 and W7-9 and body mass index from 18.1 to 39.4 kg/m2 and thus suggesting that the device can be used by individuals with varying anthropometric characteristics.

  20. DESPOT, a process-based tree growth model that allocates carbon to maximize carbon gain.

    PubMed

    Buckley, Thomas N; Roberts, David W

    2006-02-01

    We present a new model of tree growth, DESPOT (Deducing Emergent Structure and Physiology Of Trees), in which carbon (C) allocation is adjusted in each time step to maximize whole-tree net C gain in the next time step. Carbon gain, respiration and the acquisition and transport of substitutable photosynthetic resources (nitrogen, water and light) are modeled on a process basis. The current form of DESPOT simulates a uniform, monospecific, self-thinning stand. This paper describes DESPOT and its general behavior in comparison to published data, and presents an evaluation of the sensitivity of its qualitative predictions by Monte Carlo parameter sensitivity analysis. DESPOT predicts determinate height growth and steady stand-level net primary productivity (NPP), but slow declines in aboveground NPP and leaf area index. Monte Carlo analysis, wherein the model was run repeatedly with randomly different parameter sets, revealed that many parameter sets do not lead to sustainable NPP. Of those that do lead to sustainable growth, the ratios at maturity of net to gross primary productivity and of leaf area to sapwood area are highly conserved.

  1. Modeling and analysis of an energy-efficient mobility management scheme in IP-based wireless networks.

    PubMed

    Hwang, Ho Young; Kwon, Sun-Jong; Chung, Yun Won; Sung, Dan Keun; Park, Suwon

    2011-01-01

    An energy-efficient mobility management scheme in IP-based wireless networks is proposed to reduce the battery power consumption of mobile hosts (MHs). The proposed scheme manages seven MH states, including transmitting, receiving, attention/cell-connected, attention/paging area(PA)-connected, idle, off/attached, and detached states, to efficiently manage battery power, radio resources, and network load. We derive the stationary probabilities and steady state probabilities of the seven MH states for the proposed scheme in IP-based wireless networks in compact form. The effects of various input parameters on MH steady state probabilities and power consumption are investigated in the proposed scheme compared to the conventional scheme. Network costs such as cell updates, PA updates, binding-lifetime-based registrations, and paging messages are analyzed in the proposed and conventional schemes. The optimal values of PA size and registration interval are derived to minimize the network cost of the proposed scheme. The combined network and power costs are investigated for the proposed and conventional schemes. The results provide guidelines to select the proper system parameters in IP-based wireless networks.

  2. A Quantum Multi-proxy Multi-blind-signature Scheme Based on Genuine Six-Qubit Entangled State

    NASA Astrophysics Data System (ADS)

    Shao, Ai-Xia; Zhang, Jian-Zhong; Xie, Shu-Cui

    2016-12-01

    In this paper, a very efficient and secure multi-proxy multi-blind-signature scheme is proposed which is based on controlled quantum teleportation. Genuine six-qubit entangled state functions as quantum channel. The scheme uses the physical characteristics of quantum mechanics to guarantee its unforgeability, undeniability, blindness and unconditional security.

  3. Complex absorbing potential based Lorentzian fitting scheme and time dependent quantum transport.

    PubMed

    Xie, Hang; Kwok, Yanho; Jiang, Feng; Zheng, Xiao; Chen, GuanHua

    2014-10-28

    Based on the complex absorbing potential (CAP) method, a Lorentzian expansion scheme is developed to express the self-energy. The CAP-based Lorentzian expansion of self-energy is employed to solve efficiently the Liouville-von Neumann equation of one-electron density matrix. The resulting method is applicable for both tight-binding and first-principles models and is used to simulate the transient currents through graphene nanoribbons and a benzene molecule sandwiched between two carbon-atom chains.

  4. Complex absorbing potential based Lorentzian fitting scheme and time dependent quantum transport

    SciTech Connect

    Xie, Hang Kwok, Yanho; Chen, GuanHua; Jiang, Feng; Zheng, Xiao

    2014-10-28

    Based on the complex absorbing potential (CAP) method, a Lorentzian expansion scheme is developed to express the self-energy. The CAP-based Lorentzian expansion of self-energy is employed to solve efficiently the Liouville-von Neumann equation of one-electron density matrix. The resulting method is applicable for both tight-binding and first-principles models and is used to simulate the transient currents through graphene nanoribbons and a benzene molecule sandwiched between two carbon-atom chains.

  5. Simplified optical image encryption approach using single diffraction pattern in diffractive-imaging-based scheme.

    PubMed

    Qin, Yi; Gong, Qiong; Wang, Zhipeng

    2014-09-08

    In previous diffractive-imaging-based optical encryption schemes, it is impossible to totally retrieve the plaintext from a single diffraction pattern. In this paper, we proposed a new method to achieve this goal. The encryption procedure can be completed by proceeding only one exposure, and the single diffraction pattern is recorded as ciphertext. For recovering the plaintext, a novel median-filtering-based phase retrieval algorithm, including two iterative cycles, has been developed. This proposal not only extremely simplifies the encryption and decryption processes, but also facilitates the storage and transmission of the ciphertext, and its effectiveness and feasibility have been demonstrated by numerical simulations.

  6. Joint image encryption and compression scheme based on IWT and SPIHT

    NASA Astrophysics Data System (ADS)

    Zhang, Miao; Tong, Xiaojun

    2017-03-01

    A joint lossless image encryption and compression scheme based on integer wavelet transform (IWT) and set partitioning in hierarchical trees (SPIHT) is proposed to achieve lossless image encryption and compression simultaneously. Making use of the properties of IWT and SPIHT, encryption and compression are combined. Moreover, the proposed secure set partitioning in hierarchical trees (SSPIHT) via the addition of encryption in the SPIHT coding process has no effect on compression performance. A hyper-chaotic system, nonlinear inverse operation, Secure Hash Algorithm-256(SHA-256), and plaintext-based keystream are all used to enhance the security. The test results indicate that the proposed methods have high security and good lossless compression performance.

  7. Popularity-aware rate allocation in multiview video

    NASA Astrophysics Data System (ADS)

    Fiandrotti, Attilio; Chakareski, Jacob; Frossard, Pascal

    2010-07-01

    We propose a framework for popularity-driven rate allocation in H.264/MVC-based multi-view video communications when the overall rate and the rate necessary for decoding each view are constrained in the delivery architecture. We formulate a rate allocation optimization problem that takes into account the popularity of each view among the client population and the rate-distortion characteristics of the multi-view sequence so that the performance of the system is maximized in terms of popularity-weighted average quality. We consider the cases where the global bit budget or the decoding rate of each view is constrained. We devise a simple ratevideo- quality model that accounts for the characteristics of interview prediction schemes typical of multi-view video. The video quality model is used for solving the rate allocation problem with the help of an interior point optimization method. We then show through experiments that the proposed rate allocation scheme clearly outperforms baseline solutions in terms of popularity-weighted video quality. In particular, we demonstrate that the joint knowledge of the rate-distortion characteristics of the video content, its coding dependencies, and the popularity factor of each view is key in achieving good coding performance in multi-view video systems.

  8. An Improvement of Robust and Efficient Biometrics Based Password Authentication Scheme for Telecare Medicine Information Systems Using Extended Chaotic Maps.

    PubMed

    Moon, Jongho; Choi, Younsung; Kim, Jiye; Won, Dongho

    2016-03-01

    Recently, numerous extended chaotic map-based password authentication schemes that employ smart card technology were proposed for Telecare Medical Information Systems (TMISs). In 2015, Lu et al. used Li et al.'s scheme as a basis to propose a password authentication scheme for TMISs that is based on biometrics and smart card technology and employs extended chaotic maps. Lu et al. demonstrated that Li et al.'s scheme comprises some weaknesses such as those regarding a violation of the session-key security, a vulnerability to the user impersonation attack, and a lack of local verification. In this paper, however, we show that Lu et al.'s scheme is still insecure with respect to issues such as a violation of the session-key security, and that it is vulnerable to both the outsider attack and the impersonation attack. To overcome these drawbacks, we retain the useful properties of Lu et al.'s scheme to propose a new password authentication scheme that is based on smart card technology and requires the use of chaotic maps. Then, we show that our proposed scheme is more secure and efficient and supports security properties.

  9. A Secure Dynamic Identity and Chaotic Maps Based User Authentication and Key Agreement Scheme for e-Healthcare Systems.

    PubMed

    Li, Chun-Ta; Lee, Cheng-Chi; Weng, Chi-Yao; Chen, Song-Jhih

    2016-11-01

    Secure user authentication schemes in many e-Healthcare applications try to prevent unauthorized users from intruding the e-Healthcare systems and a remote user and a medical server can establish session keys for securing the subsequent communications. However, many schemes does not mask the users' identity information while constructing a login session between two or more parties, even though personal privacy of users is a significant topic for e-Healthcare systems. In order to preserve personal privacy of users, dynamic identity based authentication schemes are hiding user's real identity during the process of network communications and only the medical server knows login user's identity. In addition, most of the existing dynamic identity based authentication schemes ignore the inputs verification during login condition and this flaw may subject to inefficiency in the case of incorrect inputs in the login phase. Regarding the use of secure authentication mechanisms for e-Healthcare systems, this paper presents a new dynamic identity and chaotic maps based authentication scheme and a secure data protection approach is employed in every session to prevent illegal intrusions. The proposed scheme can not only quickly detect incorrect inputs during the phases of login and password change but also can invalidate the future use of a lost/stolen smart card. Compared the functionality and efficiency with other authentication schemes recently, the proposed scheme satisfies desirable security attributes and maintains acceptable efficiency in terms of the computational overheads for e-Healthcare systems.

  10. GC-based dynamic QoS priority handoff scheme in multimedia cellular systems

    NASA Astrophysics Data System (ADS)

    Chen, Huan; Kumar, Sunil; Kuo, C.-C. Jay

    2001-03-01

    A dynamic call admission control (CAC) and its associated resource reservation (RR) schemes are proposed in this research based on the guard channel (GC) concept for a wireless cellular system supporting multiple QoS classes. A comprehensive service model is developed, which includes not only mobile terminals' bandwidth requirements but also their different levels of priorities, rate adaptivity and mobility. The proposed CAC policy selects the resource access thresold according to the estimated number of incoming call requests of different QoS classes. The amount of resources to be reserved is dynamically adjusted by considering neighboring-cell higher-priority calls which are likely to handoff. The handoff interaction between adjacent cells is estimated by using radio propagation in terms of the signal-to-noise ratio (SNR) and the distance of each active call in neighboring cells. Experiments are conducted by using the OPNET simulator to study the performance of the proposed scheme under various traffic conditions. It is shown that better QoS guarantees can be provided by the proposed CAC and RR schemes.

  11. A risk-based classification scheme for genetically modified foods. I: Conceptual development.

    PubMed

    Chao, Eunice; Krewski, Daniel

    2008-12-01

    The predominant paradigm for the premarket assessment of genetically modified (GM) foods reflects heightened public concern by focusing on foods modified by recombinant deoxyribonucleic acid (rDNA) techniques, while foods modified by other methods of genetic modification are generally not assessed for safety. To determine whether a GM product requires less or more regulatory oversight and testing, we developed and evaluated a risk-based classification scheme (RBCS) for crop-derived GM foods. The results of this research are presented in three papers. This paper describes the conceptual development of the proposed RBCS that focuses on two categories of adverse health effects: (1) toxic and antinutritional effects, and (2) allergenic effects. The factors that may affect the level of potential health risks of GM foods are identified. For each factor identified, criteria for differentiating health risk potential are developed. The extent to which a GM food satisfies applicable criteria for each factor is rated separately. A concern level for each category of health effects is then determined by aggregating the ratings for the factors using predetermined aggregation rules. An overview of the proposed scheme is presented, as well as the application of the scheme to a hypothetical GM food.

  12. A Trust-Based Adaptive Probability Marking and Storage Traceback Scheme for WSNs.

    PubMed

    Liu, Anfeng; Liu, Xiao; Long, Jun

    2016-03-30

    Security is a pivotal issue for wireless sensor networks (WSNs), which are emerging as a promising platform that enables a wide range of military, scientific, industrial and commercial applications. Traceback, a key cyber-forensics technology, can play an important role in tracing and locating a malicious source to guarantee cybersecurity. In this work a trust-based adaptive probability marking and storage (TAPMS) traceback scheme is proposed to enhance security for WSNs. In a TAPMS scheme, the marking probability is adaptively adjusted according to the security requirements of the network and can substantially reduce the number of marking tuples and improve network lifetime. More importantly, a high trust node is selected to store marking tuples, which can avoid the problem of marking information being lost. Experimental results show that the total number of marking tuples can be reduced in a TAPMS scheme, thus improving network lifetime. At the same time, since the marking tuples are stored in high trust nodes, storage reliability can be guaranteed, and the traceback time can be reduced by more than 80%.

  13. A Trust-Based Adaptive Probability Marking and Storage Traceback Scheme for WSNs

    PubMed Central

    Liu, Anfeng; Liu, Xiao; Long, Jun

    2016-01-01

    Security is a pivotal issue for wireless sensor networks (WSNs), which are emerging as a promising platform that enables a wide range of military, scientific, industrial and commercial applications. Traceback, a key cyber-forensics technology, can play an important role in tracing and locating a malicious source to guarantee cybersecurity. In this work a trust-based adaptive probability marking and storage (TAPMS) traceback scheme is proposed to enhance security for WSNs. In a TAPMS scheme, the marking probability is adaptively adjusted according to the security requirements of the network and can substantially reduce the number of marking tuples and improve network lifetime. More importantly, a high trust node is selected to store marking tuples, which can avoid the problem of marking information being lost. Experimental results show that the total number of marking tuples can be reduced in a TAPMS scheme, thus improving network lifetime. At the same time, since the marking tuples are stored in high trust nodes, storage reliability can be guaranteed, and the traceback time can be reduced by more than 80%. PMID:27043566

  14. A CMAC-based scheme for determining membership with classification of text strings.

    PubMed

    Ma, Heng; Tseng, Ying-Chih; Chen, Lu-I

    Membership determination of text strings has been an important procedure for analyzing textual data of a tremendous amount, especially when time is a crucial factor. Bloom filter has been a well-known approach for dealing with such a problem because of its succinct structure and simple determination procedure. As determination of membership with classification is becoming increasingly desirable, parallel Bloom filters are often implemented for facilitating the additional classification requirement. The parallel Bloom filters, however, tend to produce additional false-positive errors since membership determination must be performed on each of the parallel layers. We propose a scheme based on CMAC, a neural network mapping, which only requires a single-layer calculation to simultaneously obtain information of both the membership and classification. A hash function specifically designed for text strings is also proposed. The proposed scheme could effectively reduce false-positive errors by converging the range of membership acceptance to the minimum for each class during the neural network mapping. Simulation results show that the proposed scheme committed significantly less errors than the benchmark, parallel Bloom filters, with limited and identical memory usage at different classification levels.

  15. An Efficient Radial Basis Function Mesh Deformation Scheme within an Adjoint-Based Aerodynamic Optimization Framework

    NASA Astrophysics Data System (ADS)

    Poirier, Vincent

    Mesh deformation schemes play an important role in numerical aerodynamic optimization. As the aerodynamic shape changes, the computational mesh must adapt to conform to the deformed geometry. In this work, an extension to an existing fast and robust Radial Basis Function (RBF) mesh movement scheme is presented. Using a reduced set of surface points to define the mesh deformation increases the efficiency of the RBF method; however, at the cost of introducing errors into the parameterization by not recovering the exact displacement of all surface points. A secondary mesh movement is implemented, within an adjoint-based optimization framework, to eliminate these errors. The proposed scheme is tested within a 3D Euler flow by reducing the pressure drag while maintaining lift of a wing-body configured Boeing-747 and an Onera-M6 wing. As well, an inverse pressure design is executed on the Onera-M6 wing and an inverse span loading case is presented for a wing-body configured DLR-F6 aircraft.

  16. A maintenance scheme of communication link in mobile robot ad hoc networks based on potential field

    NASA Astrophysics Data System (ADS)

    Jiang, Hong; Jin, WenPing; Yang, GyoYing; Li, LeiMin

    2007-12-01

    Maintaining communication link in mobile robot networks between task robots and a control center is very important in some urgent application occasions such as remote danger detections. To offer a reliable multi-hop communication link, a link maintaining scheme based on artificial potential field is presented. The scheme is achieved by a task robot and communication relay ones. The task robot performs predefined tasks, and relay ones are simple robots which form a communication relay chain. When robots move towards destination in formation, a kind of attractive force created by communication quality is added to traditional potential field, and relay robots follow the task robot and automatically stop at adequate locations to form a relay chain from the control station to the task robot. In order to increase relay usage efficiency, when some relays are replaced by other short cut relays, the redundant relays can be reused by initiating another moving toward specified location. Simulation results show that the scheme can provide a reliable multi-hop communication link, and that the communication connection can be obtained through minimal number of relays.

  17. An Anonymous User Authentication and Key Agreement Scheme Based on a Symmetric Cryptosystem in Wireless Sensor Networks

    PubMed Central

    Jung, Jaewook; Kim, Jiye; Choi, Younsung; Won, Dongho

    2016-01-01

    In wireless sensor networks (WSNs), a registered user can login to the network and use a user authentication protocol to access data collected from the sensor nodes. Since WSNs are typically deployed in unattended environments and sensor nodes have limited resources, many researchers have made considerable efforts to design a secure and efficient user authentication process. Recently, Chen et al. proposed a secure user authentication scheme using symmetric key techniques for WSNs. They claim that their scheme assures high efficiency and security against different types of attacks. After careful analysis, however, we find that Chen et al.’s scheme is still vulnerable to smart card loss attack and is susceptible to denial of service attack, since it is invalid for verification to simply compare an entered ID and a stored ID in smart card. In addition, we also observe that their scheme cannot preserve user anonymity. Furthermore, their scheme cannot quickly detect an incorrect password during login phase, and this flaw wastes both communication and computational overheads. In this paper, we describe how these attacks work, and propose an enhanced anonymous user authentication and key agreement scheme based on a symmetric cryptosystem in WSNs to address all of the aforementioned vulnerabilities in Chen et al.’s scheme. Our analysis shows that the proposed scheme improves the level of security, and is also more efficient relative to other related schemes. PMID:27537890

  18. An Anonymous User Authentication and Key Agreement Scheme Based on a Symmetric Cryptosystem in Wireless Sensor Networks.

    PubMed

    Jung, Jaewook; Kim, Jiye; Choi, Younsung; Won, Dongho

    2016-08-16

    In wireless sensor networks (WSNs), a registered user can login to the network and use a user authentication protocol to access data collected from the sensor nodes. Since WSNs are typically deployed in unattended environments and sensor nodes have limited resources, many researchers have made considerable efforts to design a secure and efficient user authentication process. Recently, Chen et al. proposed a secure user authentication scheme using symmetric key techniques for WSNs. They claim that their scheme assures high efficiency and security against different types of attacks. After careful analysis, however, we find that Chen et al.'s scheme is still vulnerable to smart card loss attack and is susceptible to denial of service attack, since it is invalid for verification to simply compare an entered ID and a stored ID in smart card. In addition, we also observe that their scheme cannot preserve user anonymity. Furthermore, their scheme cannot quickly detect an incorrect password during login phase, and this flaw wastes both communication and computational overheads. In this paper, we describe how these attacks work, and propose an enhanced anonymous user authentication and key agreement scheme based on a symmetric cryptosystem in WSNs to address all of the aforementioned vulnerabilities in Chen et al.'s scheme. Our analysis shows that the proposed scheme improves the level of security, and is also more efficient relative to other related schemes.

  19. Performance evaluation of the general characteristics based off-lattice Boltzmann scheme and DUGKS for low speed continuum flows

    NASA Astrophysics Data System (ADS)

    Zhu, Lianhua; Wang, Peng; Guo, Zhaoli

    2017-03-01

    The general characteristics based off-lattice Boltzmann scheme proposed by Bardow et al. [1] (hereafter Bardow's scheme) and the discrete unified gas kinetic scheme (DUGKS) [2] are two methods that successfully overcome the time step restriction by the collision time, which is commonly seen in many other kinetic schemes. In this work, we first perform a theoretical analysis of the two schemes in the finite volume framework by comparing their numerical flux evaluations. It is found that the effect of collision term is considered in the evaluation of the cell interface distribution function in both schemes, which explains why they can overcome the time step restriction and can give accurate results even as the time step is much larger than the collision time. The difference between the two schemes lies in the treatment of the integral of the collision term when evaluating the cell interface distribution function, in which Bardow's scheme uses the rectangular rule while DUGKS uses the trapezoidal rule. The performance of the two schemes, i.e., accuracy, stability, and efficiency are then compared by simulating several two dimensional flows, including the unsteady Taylor-Green vortex flow, the steady lid-driven cavity flow, and the laminar boundary layer problem. It is observed that, DUGKS can give more accurate results than Bardow's scheme with a same mesh size. Furthermore, the numerical stability of Bardow's scheme decreases as the Courant-Friedrichs-Lewy (CFL) number approaches to 1, while the stability of DUGKS is not affected by the CFL number apparently as long as CFL < 1. It is also observed that DUGKS is twice as expensive as the Bardow's scheme with the same mesh size.

  20. Water consumption and allocation strategies along the river oases of Tarim River based on large-scale hydrological modelling

    NASA Astrophysics Data System (ADS)

    Yu, Yang; Disse, Markus; Yu, Ruide

    2016-04-01

    With the mainstream of 1,321km and located in an arid area in northwest China, the Tarim River is China's longest inland river. The Tarim basin on the northern edge of the Taklamakan desert is an extremely arid region. In this region, agricultural water consumption and allocation management are crucial to address the conflicts among irrigation water users from upstream to downstream. Since 2011, the German Ministry of Science and Education BMBF established the Sino-German SuMaRiO project, for the sustainable management of river oases along the Tarim River. The project aims to contribute to a sustainable land management which explicitly takes into account ecosystem functions and ecosystem services. SuMaRiO will identify realizable management strategies, considering social, economic and ecological criteria. This will have positive effects for nearly 10 million inhabitants of different ethnic groups. The modelling of water consumption and allocation strategies is a core block in the SuMaRiO cluster. A large-scale hydrological model (MIKE HYDRO Basin) was established for the purpose of sustainable agricultural water management in the main stem Tarim River. MIKE HYDRO Basin is an integrated, multipurpose, map-based decision support tool for river basin analysis, planning and management. It provides detailed simulation results concerning water resources and land use in the catchment areas of the river. Calibration data and future predictions based on large amount of data was acquired. The results of model calibration indicated a close correlation between simulated and observed values. Scenarios with the change on irrigation strategies and land use distributions were investigated. Irrigation scenarios revealed that the available irrigation water has significant and varying effects on the yields of different crops. Irrigation water saving could reach up to 40% in the water-saving irrigation scenario. Land use scenarios illustrated that an increase of farmland area in the

  1. Lessons from community-based payment for ecosystem service schemes: from forests to rangelands

    PubMed Central

    Dougill, Andrew J.; Stringer, Lindsay C.; Leventon, Julia; Riddell, Mike; Rueff, Henri; Spracklen, Dominick V.; Butt, Edward

    2012-01-01

    Climate finance investments and international policy are driving new community-based projects incorporating payments for ecosystem services (PES) to simultaneously store carbon and generate livelihood benefits. Most community-based PES (CB-PES) research focuses on forest areas. Rangelands, which store globally significant quantities of carbon and support many of the world's poor, have seen little CB-PES research attention, despite benefitting from several decades of community-based natural resource management (CBNRM) projects. Lessons from CBNRM suggest institutional considerations are vital in underpinning the design and implementation of successful community projects. This study uses documentary analysis to explore the institutional characteristics of three African community-based forest projects that seek to deliver carbon-storage and poverty-reduction benefits. Strong existing local institutions, clear land tenure, community control over land management decision-making and up-front, flexible payment schemes are found to be vital. Additionally, we undertake a global review of rangeland CBNRM literature and identify that alongside the lessons learned from forest projects, rangeland CB-PES project design requires specific consideration of project boundaries, benefit distribution, capacity building for community monitoring of carbon storage together with awareness-raising using decision-support tools to display the benefits of carbon-friendly land management. We highlight that institutional analyses must be undertaken alongside improved scientific studies of the carbon cycle to enable links to payment schemes, and for them to contribute to poverty alleviation in rangelands. PMID:23045714

  2. Lessons from community-based payment for ecosystem service schemes: from forests to rangelands.

    PubMed

    Dougill, Andrew J; Stringer, Lindsay C; Leventon, Julia; Riddell, Mike; Rueff, Henri; Spracklen, Dominick V; Butt, Edward

    2012-11-19

    Climate finance investments and international policy are driving new community-based projects incorporating payments for ecosystem services (PES) to simultaneously store carbon and generate livelihood benefits. Most community-based PES (CB-PES) research focuses on forest areas. Rangelands, which store globally significant quantities of carbon and support many of the world's poor, have seen little CB-PES research attention, despite benefitting from several decades of community-based natural resource management (CBNRM) projects. Lessons from CBNRM suggest institutional considerations are vital in underpinning the design and implementation of successful community projects. This study uses documentary analysis to explore the institutional characteristics of three African community-based forest projects that seek to deliver carbon-storage and poverty-reduction benefits. Strong existing local institutions, clear land tenure, community control over land management decision-making and up-front, flexible payment schemes are found to be vital. Additionally, we undertake a global review of rangeland CBNRM literature and identify that alongside the lessons learned from forest projects, rangeland CB-PES project design requires specific consideration of project boundaries, benefit distribution, capacity building for community monitoring of carbon storage together with awareness-raising using decision-support tools to display the benefits of carbon-friendly land management. We highlight that institutional analyses must be undertaken alongside improved scientific studies of the carbon cycle to enable links to payment schemes, and for them to contribute to poverty alleviation in rangelands.

  3. Content-based medical image classification using a new hierarchical merging scheme.

    PubMed

    Pourghassem, Hossein; Ghassemian, Hassan

    2008-12-01

    Automatic medical image classification is a technique for assigning a medical image to a class among a number of image categories. Due to computational complexity, it is an important task in the content-based image retrieval (CBIR). In this paper, we propose a hierarchical medical image classification method including two levels using a perfect set of various shape and texture features. Furthermore, a tessellation-based spectral feature as well as a directional histogram has been proposed. In each level of the hierarchical classifier, using a new merging scheme and multilayer perceptron (MLP) classifiers (merging-based classification), homogenous (semantic) classes are created from overlapping classes in the database. The proposed merging scheme employs three measures to detect the overlapping classes: accuracy, miss-classified ratio, and dissimilarity. The first two measures realize a supervised classification method and the last one realizes an unsupervised clustering technique. In each level, the merging-based classification is applied to a merged class of the previous level and splits it to several classes. This procedure is progressive to achieve more classes. The proposed algorithm is evaluated on a database consisting of 9100 medical X-ray images of 40 classes. It provides accuracy rate of 90.83% on 25 merged classes in the first level. If the correct class is considered within the best three matches, this value will increase to 97.9%.

  4. A genetic algorithm based multi-objective shape optimization scheme for cementless femoral implant.

    PubMed

    Chanda, Souptick; Gupta, Sanjay; Kumar Pratihar, Dilip

    2015-03-01

    The shape and geometry of femoral implant influence implant-induced periprosthetic bone resorption and implant-bone interface stresses, which are potential causes of aseptic loosening in cementless total hip arthroplasty (THA). Development of a shape optimization scheme is necessary to achieve a trade-off between these two conflicting objectives. The objective of this study was to develop a novel multi-objective custom-based shape optimization scheme for cementless femoral implant by integrating finite element (FE) analysis and a multi-objective genetic algorithm (GA). The FE model of a proximal femur was based on a subject-specific CT-scan dataset. Eighteen parameters describing the nature of four key sections of the implant were identified as design variables. Two objective functions, one based on implant-bone interface failure criterion, and the other based on resorbed proximal bone mass fraction (BMF), were formulated. The results predicted by the two objective functions were found to be contradictory; a reduction in the proximal bone resorption was accompanied by a greater chance of interface failure. The resorbed proximal BMF was found to be between 23% and 27% for the trade-off geometries as compared to ∼39% for a generic implant. Moreover, the overall chances of interface failure have been minimized for the optimal designs, compared to the generic implant. The adaptive bone remodeling was also found to be minimal for the optimally designed implants and, further with remodeling, the chances of interface debonding increased only marginally.

  5. An efficient chaotic maps-based authentication and key agreement scheme using smartcards for telecare medicine information systems.

    PubMed

    Lee, Tian-Fu

    2013-12-01

    A smartcard-based authentication and key agreement scheme for telecare medicine information systems enables patients, doctors, nurses and health visitors to use smartcards for secure login to medical information systems. Authorized users can then efficiently access remote services provided by the medicine information systems through public networks. Guo and Chang recently improved the efficiency of a smartcard authentication and key agreement scheme by using chaotic maps. Later, Hao et al. reported that the scheme developed by Guo and Chang had two weaknesses: inability to provide anonymity and inefficient double secrets. Therefore, Hao et al. proposed an authentication scheme for telecare medicine information systems that solved these weaknesses and improved performance. However, a limitation in both schemes is their violation of the contributory property of key agreements. This investigation discusses these weaknesses and proposes a new smartcard-based authentication and key agreement scheme that uses chaotic maps for telecare medicine information systems. Compared to conventional schemes, the proposed scheme provides fewer weaknesses, better security, and more efficiency.

  6. Visual privacy by context: proposal and evaluation of a level-based visualisation scheme.

    PubMed

    Padilla-López, José Ramón; Chaaraoui, Alexandros Andre; Gu, Feng; Flórez-Revuelta, Francisco

    2015-06-04

    Privacy in image and video data has become an important subject since cameras are being installed in an increasing number of public and private spaces. Specifically, in assisted living, intelligent monitoring based on computer vision can allow one to provide risk detection and support services that increase people's autonomy at home. In the present work, a level-based visualisation scheme is proposed to provide visual privacy when human intervention is necessary, such as at telerehabilitation and safety assessment applications. Visualisation levels are dynamically selected based on the previously modelled context. In this way, different levels of protection can be provided, maintaining the necessary intelligibility required for the applications. Furthermore, a case study of a living room, where a top-view camera is installed, is presented. Finally, the performed survey-based evaluation indicates the degree of protection provided by the different visualisation models, as well as the personal privacy preferences and valuations of the users.

  7. Visual Privacy by Context: Proposal and Evaluation of a Level-Based Visualisation Scheme

    PubMed Central

    Padilla-López, José Ramón; Chaaraoui, Alexandros Andre; Gu, Feng; Flórez-Revuelta, Francisco

    2015-01-01

    Privacy in image and video data has become an important subject since cameras are being installed in an increasing number of public and private spaces. Specifically, in assisted living, intelligent monitoring based on computer vision can allow one to provide risk detection and support services that increase people's autonomy at home. In the present work, a level-based visualisation scheme is proposed to provide visual privacy when human intervention is necessary, such as at telerehabilitation and safety assessment applications. Visualisation levels are dynamically selected based on the previously modelled context. In this way, different levels of protection can be provided, maintaining the necessary intelligibility required for the applications. Furthermore, a case study of a living room, where a top-view camera is installed, is presented. Finally, the performed survey-based evaluation indicates the degree of protection provided by the different visualisation models, as well as the personal privacy preferences and valuations of the users. PMID:26053746

  8. Use of a JPEG-2000 Wavelet Compression Scheme for Content-Based Ophtalmologic Retinal Images Retrieval.

    PubMed

    Lamard, Mathieu; Daccache, Wissam; Cazuguel, Guy; Roux, Christian; Cochener, Beatrice

    2005-01-01

    In this paper we propose a content based image retrieval method for diagnosis aid in diabetic retinopathy. We characterize images without extracting significant features, and use histograms obtained from the compressed images in JPEG-2000 wavelet scheme to build signatures. The research is carried out by calculating signature distances between the query and database images. A weighted distance between histograms is used. Retrieval efficiency is given for different standard types of JPEG-2000 wavelets, and for different values of histogram weights. A classified diabetic retinopathy image database is built allowing algorithms tests. On this image database, results are promising: the retrieval efficiency is higher than 70% for some lesion types.

  9. An Efficient Identity-Based Key Management Scheme for Wireless Sensor Networks Using the Bloom Filter

    PubMed Central

    Qin, Zhongyuan; Zhang, Xinshuai; Feng, Kerong; Zhang, Qunfang; Huang, Jie

    2014-01-01

    With the rapid development and widespread adoption of wireless sensor networks (WSNs), security has become an increasingly prominent problem. How to establish a session key in node communication is a challenging task for WSNs. Considering the limitations in WSNs, such as low computing capacity, small memory, power supply limitations and price, we propose an efficient identity-based key management (IBKM) scheme, which exploits the Bloom filter to authenticate the communication sensor node with storage efficiency. The security analysis shows that IBKM can prevent several attacks effectively with acceptable computation and communication overhead. PMID:25264955

  10. Robust biometrics based authentication and key agreement scheme for multi-server environments using smart cards.

    PubMed

    Lu, Yanrong; Li, Lixiang; Yang, Xing; Yang, Yixian

    2015-01-01

    Biometrics authenticated schemes using smart cards have attracted much attention in multi-server environments. Several schemes of this type where proposed in the past. However, many of them were found to have some design flaws. This paper concentrates on the security weaknesses of the three-factor authentication scheme by Mishra et al. After careful analysis, we find their scheme does not really resist replay attack while failing to provide an efficient password change phase. We further propose an improvement of Mishra et al.'s scheme with the purpose of preventing the security threats of their scheme. We demonstrate the proposed scheme is given to strong authentication against several attacks including attacks shown in the original scheme. In addition, we compare the performance and functionality with other multi-server authenticated key schemes.

  11. Robust Biometrics Based Authentication and Key Agreement Scheme for Multi-Server Environments Using Smart Cards

    PubMed Central

    Lu, Yanrong; Li, Lixiang; Yang, Xing; Yang, Yixian

    2015-01-01

    Biometrics authenticated schemes using smart cards have attracted much attention in multi-server environments. Several schemes of this type where proposed in the past. However, many of them were found to have some design flaws. This paper concentrates on the security weaknesses of the three-factor authentication scheme by Mishra et al. After careful analysis, we find their scheme does not really resist replay attack while failing to provide an efficient password change phase. We further propose an improvement of Mishra et al.’s scheme with the purpose of preventing the security threats of their scheme. We demonstrate the proposed scheme is given to strong authentication against several attacks including attacks shown in the original scheme. In addition, we compare the performance and functionality with other multi-server authenticated key schemes. PMID:25978373

  12. In-person and video-based post-traumatic stress disorder treatment for veterans: a location-allocation model.

    PubMed

    Musdal, Hande; Shiner, Brian; Chen, Techieh; Ceyhan, Mehmet E; Watts, Bradley V; Benneyan, James

    2014-02-01

    Post-traumatic stress disorder (PTSD) is associated with poor health but there is a gap between need and receipt of care. It is useful to understand where to optimally locate in-person care and where video-based PTSD care would be most useful to minimize access to care barriers, care outside the Veterans Affairs system, and total costs. We developed a service location systems engineering model based on 2010 to 2020 projected care needs for veterans across New England to help determine where to best locate and use in-person and video-based care. This analysis determined specific locations and capacities of each type of PTSD care relative to patient home locations to help inform allocation of mental health resources. Not surprisingly Massachusetts, Connecticut, and Rhode Island are well suited for in-person care, whereas some rural areas of Maine, Vermont, and New Hampshire where in-patient services are infeasible could be better served by video-based care than external care, if the latter is even available. Results in New England alone suggest a potential $3,655,387 reduction in average annual total costs by shifting 9.73% of care to video-based treatment, with an average 12.6 miles travel distance for the remaining in-person care.

  13. Three-dimensional acoustic wave equation modeling based on the optimal finite-difference scheme

    NASA Astrophysics Data System (ADS)

    Cai, Xiao-Hui; Liu, Yang; Ren, Zhi-Ming; Wang, Jian-Min; Chen, Zhi-De; Chen, Ke-Yang; Wang, Cheng

    2015-09-01

    Generally, FD coefficients can be obtained by using Taylor series expansion (TE) or optimization methods to minimize the dispersion error. However, the TE-based FD method only achieves high modeling precision over a limited range of wavenumbers, and produces large numerical dispersion beyond this range. The optimal FD scheme based on least squares (LS) can guarantee high precision over a larger range of wavenumbers and obtain the best optimization solution at small computational cost. We extend the LS-based optimal FD scheme from two-dimensional (2D) forward modeling to three-dimensional (3D) and develop a 3D acoustic optimal FD method with high efficiency, wide range of high accuracy and adaptability to parallel computing. Dispersion analysis and forward modeling demonstrate that the developed FD method suppresses numerical dispersion. Finally, we use the developed FD method to source wavefield extrapolation and receiver wavefield extrapolation in 3D RTM. To decrease the computation time and storage requirements, the 3D RTM is implemented by combining the efficient boundary storage with checkpointing strategies on GPU. 3D RTM imaging results suggest that the 3D optimal FD method has higher precision than conventional methods.

  14. A Nanotechnology-Ready Computing Scheme based on a Weakly Coupled Oscillator Network

    PubMed Central

    Vodenicarevic, Damir; Locatelli, Nicolas; Abreu Araujo, Flavio; Grollier, Julie; Querlioz, Damien

    2017-01-01

    With conventional transistor technologies reaching their limits, alternative computing schemes based on novel technologies are currently gaining considerable interest. Notably, promising computing approaches have proposed to leverage the complex dynamics emerging in networks of coupled oscillators based on nanotechnologies. The physical implementation of such architectures remains a true challenge, however, as most proposed ideas are not robust to nanotechnology devices’ non-idealities. In this work, we propose and investigate the implementation of an oscillator-based architecture, which can be used to carry out pattern recognition tasks, and which is tailored to the specificities of nanotechnologies. This scheme relies on a weak coupling between oscillators, and does not require a fine tuning of the coupling values. After evaluating its reliability under the severe constraints associated to nanotechnologies, we explore the scalability of such an architecture, suggesting its potential to realize pattern recognition tasks using limited resources. We show that it is robust to issues like noise, variability and oscillator non-linearity. Defining network optimization design rules, we show that nano-oscillator networks could be used for efficient cognitive processing. PMID:28322262

  15. A Nanotechnology-Ready Computing Scheme based on a Weakly Coupled Oscillator Network.

    PubMed

    Vodenicarevic, Damir; Locatelli, Nicolas; Abreu Araujo, Flavio; Grollier, Julie; Querlioz, Damien

    2017-03-21

    With conventional transistor technologies reaching their limits, alternative computing schemes based on novel technologies are currently gaining considerable interest. Notably, promising computing approaches have proposed to leverage the complex dynamics emerging in networks of coupled oscillators based on nanotechnologies. The physical implementation of such architectures remains a true challenge, however, as most proposed ideas are not robust to nanotechnology devices' non-idealities. In this work, we propose and investigate the implementation of an oscillator-based architecture, which can be used to carry out pattern recognition tasks, and which is tailored to the specificities of nanotechnologies. This scheme relies on a weak coupling between oscillators, and does not require a fine tuning of the coupling values. After evaluating its reliability under the severe constraints associated to nanotechnologies, we explore the scalability of such an architecture, suggesting its potential to realize pattern recognition tasks using limited resources. We show that it is robust to issues like noise, variability and oscillator non-linearity. Defining network optimization design rules, we show that nano-oscillator networks could be used for efficient cognitive processing.

  16. A Nanotechnology-Ready Computing Scheme based on a Weakly Coupled Oscillator Network

    NASA Astrophysics Data System (ADS)

    Vodenicarevic, Damir; Locatelli, Nicolas; Abreu Araujo, Flavio; Grollier, Julie; Querlioz, Damien

    2017-03-01

    With conventional transistor technologies reaching their limits, alternative computing schemes based on novel technologies are currently gaining considerable interest. Notably, promising computing approaches have proposed to leverage the complex dynamics emerging in networks of coupled oscillators based on nanotechnologies. The physical implementation of such architectures remains a true challenge, however, as most proposed ideas are not robust to nanotechnology devices’ non-idealities. In this work, we propose and investigate the implementation of an oscillator-based architecture, which can be used to carry out pattern recognition tasks, and which is tailored to the specificities of nanotechnologies. This scheme relies on a weak coupling between oscillators, and does not require a fine tuning of the coupling values. After evaluating its reliability under the severe constraints associated to nanotechnologies, we explore the scalability of such an architecture, suggesting its potential to realize pattern recognition tasks using limited resources. We show that it is robust to issues like noise, variability and oscillator non-linearity. Defining network optimization design rules, we show that nano-oscillator networks could be used for efficient cognitive processing.

  17. Agent-based power sharing scheme for active hybrid power sources

    NASA Astrophysics Data System (ADS)

    Jiang, Zhenhua

    The active hybridization technique provides an effective approach to combining the best properties of a heterogeneous set of power sources to achieve higher energy density, power density and fuel efficiency. Active hybrid power sources can be used to power hybrid electric vehicles with selected combinations of internal combustion engines, fuel cells, batteries, and/or supercapacitors. They can be deployed in all-electric ships to build a distributed electric power system. They can also be used in a bulk power system to construct an autonomous distributed energy system. An important aspect in designing an active hybrid power source is to find a suitable control strategy that can manage the active power sharing and take advantage of the inherent scalability and robustness benefits of the hybrid system. This paper presents an agent-based power sharing scheme for active hybrid power sources. To demonstrate the effectiveness of the proposed agent-based power sharing scheme, simulation studies are performed for a hybrid power source that can be used in a solar car as the main propulsion power module. Simulation results clearly indicate that the agent-based control framework is effective to coordinate the various energy sources and manage the power/voltage profiles.

  18. Gradient-based iterative image reconstruction scheme for time-resolved optical tomography

    SciTech Connect

    Hielscher, A.H.; Klose, A.D.; Hanson, K.M.

    1999-03-01

    Currently available tomographic image reconstruction schemes for optical tomography (OT) are mostly based on the limiting assumptions of small perturbations and a priori knowledge of the optical properties of a reference medium. Furthermore, these algorithms usually require the inversion of large, full, ill-conditioned Jacobian matrices. In this work a gradient-based iterative image reconstruction (GIIR) method is presented that promises to overcome current limitations. The code consists of three major parts: (1) A finite-difference, time-resolved, diffusion forward model is used to predict detector readings based on the spatial distribution of optical properties; (2) An objective function that describes the difference between predicted and measured data; (3) An updating method that uses the gradient of the objective function in a line minimization scheme to provide subsequent guesses of the spatial distribution of the optical properties for the forward model. The reconstruction of these properties is completed, once a minimum of this objective function is found. After a presentation of the mathematical background, two- and three-dimensional reconstruction of simple heterogeneous media as well as the clinically relevant example of ventricular bleeding in the brain are discussed. Numerical studies suggest that intraventricular hemorrhages can be detected using the GIIR technique, even in the presence of a heterogeneous background.

  19. A robust and novel dynamic-ID-based authentication scheme for care team collaboration with smart cards.

    PubMed

    Chang, Ya-Fen; Chen, Chia-Chen; Chang, Pei-Yu

    2013-04-01

    Nowadays, users/patients may gain desired medical services on-line because of the rapid development of computer network technologies. Conventional healthcare services are provided by a single server. However, care team collaboration by integrating services is the key to improve financial and clinical performance. How a user/patient accesses desired medical services provided by multiple servers becomes a challenge to realize care team collaboration. User authentication plays an important role to protect resources or services from being accessed by unauthorized users. In this paper, we first discuss the perceived security drawbacks of pervasive smart-card-based remote user authentication schemes. Then, we propose a novel dynamic-ID-based user authentication scheme based on elliptic curve cryptosystem (ECC) for multi-server environment with smart cards. The proposed scheme ensures user anonymity and computational efficiency and complies with essential requirements of a secure smart-card-based authentication scheme for multi-server environment to enable care team collaboration.

  20. Secure and Efficient Two-Factor User Authentication Scheme with User Anonymity for Network Based E-Health Care Applications.

    PubMed

    Li, Xiong; Niu, Jianwei; Karuppiah, Marimuthu; Kumari, Saru; Wu, Fan

    2016-12-01

    Benefited from the development of network and communication technologies, E-health care systems and telemedicine have got the fast development. By using the E-health care systems, patient can enjoy the remote medical service provided by the medical server. Medical data are important privacy information for patient, so it is an important issue to ensure the secure of transmitted medical data through public network. Authentication scheme can thwart unauthorized users from accessing services via insecure network environments, so user authentication with privacy protection is an important mechanism for the security of E-health care systems. Recently, based on three factors (password, biometric and smart card), an user authentication scheme for E-health care systems was been proposed by Amin et al., and they claimed that their scheme can withstand most of common attacks. Unfortunate, we find that their scheme cannot achieve the untraceability feature of the patient. Besides, their scheme lacks a password check mechanism such that it is inefficient to find the unauthorized login by the mistake of input a wrong password. Due to the same reason, their scheme is vulnerable to Denial of Service (DoS) attack if the patient updates the password mistakenly by using a wrong password. In order improve the security level of authentication scheme for E-health care application, a robust user authentication scheme with privacy protection is proposed for E-health care systems. Then, security prove of our scheme are analysed. Security and performance analyses show that our scheme is more powerful and secure for E-health care systems when compared with other related schemes.

  1. Challenges and mitigation strategies for resist trim etch in resist-mandrel based SAQP integration scheme

    NASA Astrophysics Data System (ADS)

    Mohanty, Nihar; Franke, Elliott; Liu, Eric; Raley, Angelique; Smith, Jeffrey; Farrell, Richard; Wang, Mingmei; Ito, Kiyohito; Das, Sanjana; Ko, Akiteru; Kumar, Kaushik; Ranjan, Alok; O'Meara, David; Nawa, Kenjiro; Scheer, Steven; DeVillers, Anton; Biolsi, Peter

    2015-03-01

    Patterning the desired narrow pitch at 10nm technology node and beyond, necessitates employment of either extreme ultra violet (EUV) lithography or multi-patterning solutions based on 193nm-immersion lithography. With enormous challenges being faced in getting EUV lithography ready for production, multi-patterning solutions that leverage the already installed base of 193nm-immersion-lithography are poised to become the industry norm for 10 and 7nm technology nodes. For patterning sub-40nm pitch line/space features, self-aligned quadruple patterning (SAQP) with resist pattern as the first mandrel shows significant cost as well as design benefit, as compared to EUV lithography or other multi-patterning techniques. One of the most critical steps in this patterning scheme is the resist mandrel definition step which involves trimming / reformation of resist profile via plasma etch for achieving appropriate pitch after the final pattern. Being the first mandrel, the requirements for the Line Edge Roughness (LER) / Line Width Roughness (LWR); critical dimension uniformity (CDU); and profile in 3-dimensions for the resist trim / reformation etch is extremely aggressive. In this paper we highlight the unique challenges associated in developing resist trim / reformation plasma etch process for SAQP integration scheme and summarize our efforts in optimizing the trim etch chemistries, process steps and plasma etch parameters for meeting the mandrel definition targets. Finally, we have shown successful patterning of 30nm pitch patterns via the resist-mandrel SAQP scheme and its implementation for Si-fin formation at 7nm node.

  2. Statistical analysis of blocking probability and fragmentation based on Markov modeling of elastic spectrum allocation on fiber link

    NASA Astrophysics Data System (ADS)

    Rosa, A. N. F.; Wiatr, P.; Cavdar, C.; Carvalho, S. V.; Costa, J. C. W. A.; Wosinska, L.

    2015-11-01

    In Elastic Optical Network (EON), spectrum fragmentation refers to the existence of non-aligned, small-sized blocks of free subcarrier slots in the optical spectrum. Several metrics have been proposed in order to quantify a level of spectrum fragmentation. Approximation methods might be used for estimating average blocking probability and some fragmentation measures, but are so far unable to accurately evaluate the influence of different sizes of connection requests and do not allow in-depth investigation of blocking events and their relation to fragmentation. The analytical study of the effect of fragmentation on requests' blocking probability is still under-explored. In this work, we introduce new definitions for blocking that differentiate between the reasons for the blocking events. We developed a framework based on Markov modeling to calculate steady-state probabilities for the different blocking events and to analyze fragmentation related problems in elastic optical links under dynamic traffic conditions. This framework can also be used for evaluation of different definitions of fragmentation in terms of their relation to the blocking probability. We investigate how different allocation request sizes contribute to fragmentation and blocking probability. Moreover, we show to which extend blocking events, due to insufficient amount of available resources, become inevitable and, compared to the amount of blocking events due to fragmented spectrum, we draw conclusions on the possible gains one can achieve by system defragmentation. We also show how efficient spectrum allocation policies really are in reducing the part of fragmentation that in particular leads to actual blocking events. Simulation experiments are carried out showing good match with our analytical results for blocking probability in a small scale scenario. Simulated blocking probabilities for the different blocking events are provided for a larger scale elastic optical link.

  3. Layered HEVC/H.265 video transmission scheme based on hierarchical QAM optimization

    NASA Astrophysics Data System (ADS)

    Feng, Weidong; Zhou, Cheng; Xiong, Chengyi; Chen, Shaobo; Wang, Junxi

    2015-12-01

    High Efficiency Video Coding (HEVC) is the state-of-art video compression standard which fully support scalability features and is able to generate layered video streams with unequal importance. Unfortunately, when the base layer (BL) which is more importance to the stream is lost during the transmission, the enhancement layer (EL) based on the base layer must be discarded by receiver. Obviously, using the same transmittal strategies for BL and EL is unreasonable. This paper proposed an unequal error protection (UEP) system using different hierarchical amplitude modulation (HQAM). The BL data with high priority are mapped into the most reliable HQAM mode and the EL data with low priority are mapped into HQAM mode with fast transmission efficiency. Simulations on scalable HEVC codec show that the proposed optimized video transmission system is more attractive than the traditional equal error protection (EEP) scheme because it effectively balances the transmission efficiency and reconstruction video quality.

  4. Adaptive 2-D wavelet transform based on the lifting scheme with preserved vanishing moments.

    PubMed

    Vrankic, Miroslav; Sersic, Damir; Sucic, Victor

    2010-08-01

    In this paper, we propose novel adaptive wavelet filter bank structures based on the lifting scheme. The filter banks are nonseparable, based on quincunx sampling, with their properties being pixel-wise adapted according to the local image features. Despite being adaptive, the filter banks retain a desirable number of primal and dual vanishing moments. The adaptation is introduced in the predict stage of the filter bank with an adaptation region chosen independently for each pixel, based on the intersection of confidence intervals (ICI) rule. The image denoising results are presented for both synthetic and real-world images. It is shown that the obtained wavelet decompositions perform well, especially for synthetic images that contain periodic patterns, for which the proposed method outperforms the state of the art in image denoising.

  5. A full potential inverse method based on a density linearization scheme for wing design

    NASA Technical Reports Server (NTRS)

    Shankar, V.

    1982-01-01

    A mixed analysis inverse procedure based on the full potential equation in conservation form was developed to recontour a given base wing to produce density linearization scheme in applying the pressure boundary condition in terms of the velocity potential. The FL030 finite volume analysis code was modified to include the inverse option. The new surface shape information, associated with the modified pressure boundary condition, is calculated at a constant span station based on a mass flux integration. The inverse method is shown to recover the original shape when the analysis pressure is not altered. Inverse calculations for weakening of a strong shock system and for a laminar flow control (LFC) pressure distribution are presented. Two methods for a trailing edge closure model are proposed for further study.

  6. An image encryption scheme using nonlinear inter-pixel computing and swapping based permutation approach

    NASA Astrophysics Data System (ADS)

    Chen, Jun-xin; Zhu, Zhi-liang; Fu, Chong; Zhang, Li-bo; Zhang, Yushu

    2015-06-01

    Recently, intrinsic image features in bit-level (e.g., higher bit-planes carry more information than lower bit-planes) have been widely accepted for building bit-level image cryptosystems. Higher bit-planes are generally handled with enhanced encryption, whereas light attention is paid to lower ones. However, the existing achievements on bit-level image features are solely based on the analyses of standard test images, and they do not hold for some special images, such as medical images. When ciphering these images, such cryptosystems may leak the important information of lower bit-planes, and other inadaptability also exists. In this paper, we firstly give out the inapplicability of the existing bit-level achievements, and then a novel chaos-based image encryption scheme using nonlinear inter-pixel computing and swapping based permutation approach is presented. Simulations and extensive security analyses demonstrate the high level of security for practical secret applications.

  7. An Improvement of Robust Biometrics-Based Authentication and Key Agreement Scheme for Multi-Server Environments Using Smart Cards.

    PubMed

    Moon, Jongho; Choi, Younsung; Jung, Jaewook; Won, Dongho

    2015-01-01

    In multi-server environments, user authentication is a very important issue because it provides the authorization that enables users to access their data and services; furthermore, remote user authentication schemes for multi-server environments have solved the problem that has arisen from user's management of different identities and passwords. For this reason, numerous user authentication schemes that are designed for multi-server environments have been proposed over recent years. In 2015, Lu et al. improved upon Mishra et al.'s scheme, claiming that their remote user authentication scheme is more secure and practical; however, we found that Lu et al.'s scheme is still insecure and incorrect. In this paper, we demonstrate that Lu et al.'s scheme is vulnerable to outsider attack and user impersonation attack, and we propose a new biometrics-based scheme for authentication and key agreement that can be used in multi-server environments; then, we show that our proposed scheme is more secure and supports the required security properties.

  8. An Improvement of Robust Biometrics-Based Authentication and Key Agreement Scheme for Multi-Server Environments Using Smart Cards

    PubMed Central

    Moon, Jongho; Choi, Younsung; Jung, Jaewook; Won, Dongho

    2015-01-01

    In multi-server environments, user authentication is a very important issue because it provides the authorization that enables users to access their data and services; furthermore, remote user authentication schemes for multi-server environments have solved the problem that has arisen from user’s management of different identities and passwords. For this reason, numerous user authentication schemes that are designed for multi-server environments have been proposed over recent years. In 2015, Lu et al. improved upon Mishra et al.’s scheme, claiming that their remote user authentication scheme is more secure and practical; however, we found that Lu et al.’s scheme is still insecure and incorrect. In this paper, we demonstrate that Lu et al.’s scheme is vulnerable to outsider attack and user impersonation attack, and we propose a new biometrics-based scheme for authentication and key agreement that can be used in multi-server environments; then, we show that our proposed scheme is more secure and supports the required security properties. PMID:26709702

  9. Studying the effect on system preference by varying coproduct allocation in creating life-cycle inventory.

    PubMed

    Curran, Mary Ann

    2007-10-15

    How one models the input and output data for a life-cycle assessment (LCA) can greatly affect the results. Although much attention has been paid to allocation methodology by researchers in the field, specific guidance is still lacking: Earlier research focused on the effects of applying various allocation schemes to industrial processes when creating life-cycle inventories. To determine the impact of different allocation approaches upon product choice, this study evaluated the gas- and water-phase emissions during the production, distribution, and use of three hypothetical fuel systems (data that represent conventional gasoline and gasoline with 8.7 and 85% ethanol were used as the basis for modeling). This paper presents an explanation of the allocation issue and the results from testing various allocation schemes (weight, volume, market value, energy, and demand-based) when viewed across the entire system. Impact indicators for global warming, ozone depletion, and human health noncancer (water impact) were lower for the ethanol-containing fuels, while impact indicators for acidification, ecotoxicity, eutrophication, human health criteria, and photochemical smog were lower for conventional gasoline (impacts for the water-related human health cancer category showed mixed results). The relative ranking of conventional gasoline in relation to the ethanol-containing fuels was consistent in all instances, suggesting that, in this case study, the choice of allocation methodology had no impact on indicating which fuel has lower environmental impacts.

  10. EEG Classification for Hybrid Brain-Computer Interface Using a Tensor Based Multiclass Multimodal Analysis Scheme

    PubMed Central

    Ji, Hongfei; Li, Jie; Lu, Rongrong; Gu, Rong; Cao, Lei; Gong, Xiaoliang

    2016-01-01

    Electroencephalogram- (EEG-) based brain-computer interface (BCI) systems usually utilize one type of changes in the dynamics of brain oscillations for control, such as event-related desynchronization/synchronization (ERD/ERS), steady state visual evoked potential (SSVEP), and P300 evoked potentials. There is a recent trend to detect more than one of these signals in one system to create a hybrid BCI. However, in this case, EEG data were always divided into groups and analyzed by the separate processing procedures. As a result, the interactive effects were ignored when different types of BCI tasks were executed simultaneously. In this work, we propose an improved tensor based multiclass multimodal scheme especially for hybrid BCI, in which EEG signals are denoted as multiway tensors, a nonredundant rank-one tensor decomposition model is proposed to obtain nonredundant tensor components, a weighted fisher criterion is designed to select multimodal discriminative patterns without ignoring the interactive effects, and support vector machine (SVM) is extended to multiclass classification. Experiment results suggest that the proposed scheme can not only identify the different changes in the dynamics of brain oscillations induced by different types of tasks but also capture the interactive effects of simultaneous tasks properly. Therefore, it has great potential use for hybrid BCI. PMID:26880873

  11. Efficient postprocessing scheme for block-coded images based on multiscale edge detection

    NASA Astrophysics Data System (ADS)

    Wu, Shuanhu; Yan, Hong; Tan, Zheng

    2001-09-01

    The block discrete cosine transform (BDCT) is the most widely used technique for the compression of both still and moving images, a major problem related with the BDCT techniques is that the decoded images, especially at low bit rate, exhibit visually annoying blocking effects. In this paper, based on Mallets multiscale edge detection, we proposed an efficient deblocking algorithm to further improved the coding performance. The advantage of our algorithm is that it can efficiently preserve texture structure in the original decompressed images. Our method is similar to that of Z. Xiong's, where the Z.Xiong's method is not suitable for images with a large portion of texture; for instance, the Barbara Image. The difference of our method and the Z.Xiong's is that our method adopted a new thresholding scheme for multi-scale edge detection instead of exploiting cross-scale correlation for edge detection. Numerical experiment results show that our scheme not only outperforms Z.Xiong's for various images in the case of the same computational complexity, but also preserve texture structure in the decompressed images at the same time. Compared with the best iterative-based method (POCS) reported in the literature, our algorithm can achieve the same peak signal-to-noise ratio (PSNR) improvement and give visually very pleasing images as well.

  12. Feasibility of mini-sequencing schemes based on nucleotide polymorphisms for microbial identification and population analyses.

    PubMed

    Araujo, Ricardo; Eusebio, Nadia; Caramalho, Rita

    2015-03-01

    Practical schemes based on single nucleotide polymorphisms (SNP) have been proposed as alternatives to simplify and replace the molecular methodologies based on the extensive sequencing analysis of genes. SNaPshot mini-sequencing has been progressively experienced during the last decade and represents a fast and robust strategy to analyze critical polymorphisms. Such assays have been proposed to characterize some bacteria and microbial eukaryotes, and its feasibility was now reviewed in the present manuscript. The mini-sequencing schemes showed high discriminatory power and competence for identification of microorganisms, but some specificity errors were still found, particularly for species of the Burkholderia cepacia complex and mycobacteria. SNP assays designed for other goals, e.g., comparison of strains, detection of serotypes, virulence, epidemic, and phylogenetic-related subgroups of isolates, can be very useful by facilitating the investigation of large collections of isolates. The next-generation of SNP assays might consider the inclusion of large number of markers to fully characterize microbial taxonomy and strains; nevertheless, these new technologies are still prone to errors and can largely benefit from integration with well-established mini-sequencing assays. Newly proposed molecular tools should be systematically tested in collections of isolates with high indexes of diversity and guarantee interlaboratorial validation.

  13. A complete passive blind image copy-move forensics scheme based on compound statistics features.

    PubMed

    Peng, Fei; Nie, Yun-ying; Long, Min

    2011-10-10

    Since most sensor pattern noise based image copy-move forensics methods require a known reference sensor pattern noise, it generally results in non-blinded passive forensics, which significantly confines the application circumstances. In view of this, a novel passive-blind image copy-move forensics scheme is proposed in this paper. Firstly, a color image is transformed into a grayscale one, and wavelet transform based de-noising filter is used to extract the sensor pattern noise, then the variance of the pattern noise, the signal noise ratio between the de-noised image and the pattern noise, the information entropy and the average energy gradient of the original grayscale image are chosen as features, non-overlapping sliding window operations are done to the images to divide them into different sub-blocks. Finally, the tampered areas are detected by analyzing the correlation of the features between the sub-blocks and the whole image. Experimental results and analysis show that the proposed scheme is completely passive-blind, has a good detection rate, and is robust against JPEG compression, noise, rotation, scaling and blurring.

  14. PAPR reduction scheme for ACO-OFDM based visible light communication systems

    NASA Astrophysics Data System (ADS)

    zhang, Tian; Ghassemlooy, Zabih; Ma, Chunyang; Guo, Shuxu

    2017-01-01

    In this paper, we proposed a novel peak to average power ratio (PAPR) reduction scheme for the asymmetrically clipped optical orthogonal frequency division multiplexing (ACO-OFDM) visible light communications system. We implement the Toeplitz matrix based Gaussian blur method to reduce the high PAPR of ACO-OFDM at the transmitter and use the orthogonal matching pursuit algorithm to recover the original ACO-OFDM frame at the receiver. Simulation results show that for the 256-subcarrier ACO-OFDM system a 6 dB improvement in PAPR is achieved compared with the original ACO-OFDM in term of the complementary cumulative distribution function, while maintaining a competitive bit-error rate performance compared with the ideal ACO-OFDM lower bound. We also demonstrated the optimal parameter C of 2 for the recovery algorithm based on the tradeoff between the data rate and recovery accuracy. The recovery results show that using the proposed scheme the ACO-OFDM can faithfully be reconstructed judging by the very low value for the reconstruct error of 0.06.

  15. PSO-tuned PID controller for coupled tank system via priority-based fitness scheme

    NASA Astrophysics Data System (ADS)

    Jaafar, Hazriq Izzuan; Hussien, Sharifah Yuslinda Syed; Selamat, Nur Asmiza; Abidin, Amar Faiz Zainal; Aras, Mohd Shahrieel Mohd; Nasir, Mohamad Na'im Mohd; Bohari, Zul Hasrizal

    2015-05-01

    The industrial applications of Coupled Tank System (CTS) are widely used especially in chemical process industries. The overall process is require liquids to be pumped, stored in the tank and pumped again to another tank. Nevertheless, the level of liquid in tank need to be controlled and flow between two tanks must be regulated. This paper presents development of an optimal PID controller for controlling the desired liquid level of the CTS. Two method of Particle Swarm Optimization (PSO) algorithm will be tested in optimizing the PID controller parameters. These two methods of PSO are standard Particle Swarm Optimization (PSO) and Priority-based Fitness Scheme in Particle Swarm Optimization (PFPSO). Simulation is conducted within Matlab environment to verify the performance of the system in terms of settling time (Ts), steady state error (SSE) and overshoot (OS). It has been demonstrated that implementation of PSO via Priority-based Fitness Scheme (PFPSO) for this system is potential technique to control the desired liquid level and improve the system performances compared with standard PSO.

  16. Multimode interference coupler based photonic analog-to-digital conversion scheme.

    PubMed

    Shile, Wei; Jian, Wu; Lingjuan, Zhao; Chen, Yao; Chen, Ji; Dan, Lu; Xilin, Zhang; Zuoshan, Yin

    2012-09-01

    A novel phase-shifted optical quantization scheme for an all-optical analog-to-digital converter, which uses 4×4 multimode interference couplers, is demonstrated and theoretically analyzed. The whole scheme can be integrated on a chip.

  17. Prioritizing hazardous pollutants in two Nigerian water supply schemes: a risk-based approach

    PubMed Central

    Etchie, Ayotunde T; Etchie, Tunde O; Krishnamurthi, Kannan; SaravanaDevi, S; Wate, Satish R

    2013-01-01

    Abstract Objective To rank pollutants in two Nigerian water supply schemes according to their effect on human health using a risk-based approach. Methods Hazardous pollutants in drinking-water in the study area were identified from a literature search and selected pollutants were monitored from April 2010 to December 2011 in catchments, treatment works and consumer taps. The disease burden due to each pollutant was estimated in disability-adjusted life years (DALYs) using data on the pollutant’s concentration, exposure to the pollutant, the severity of its health effects and the consumer population. Findings The pollutants identified were microbial organisms, cadmium, cobalt, chromium, copper, iron, manganese, nickel, lead and zinc. All were detected in the catchments but only cadmium, cobalt, chromium, manganese and lead exceeded World Health Organization (WHO) guideline values after water treatment. Post-treatment contamination was observed. The estimated disease burden was greatest for chromium in both schemes, followed in decreasing order by cadmium, lead, manganese and cobalt. The total disease burden of all pollutants in the two schemes was 46 000 and 9500 DALYs per year or 0.14 and 0.088 DALYs per person per year, respectively, much higher than the WHO reference level of 1 × 10−6 DALYs per person per year. For each metal, the disease burden exceeded the reference level and was comparable with that due to microbial contamination reported elsewhere in Africa. Conclusion The estimated disease burden of metal contamination of two Nigerian water supply systems was high. It could best be reduced by protection of water catchment and pretreatment by electrocoagulation. PMID:23940402

  18. Algorithm composition scheme for problems in composite domains based on the difference potential method

    NASA Astrophysics Data System (ADS)

    Ryaben'kii, V. S.; Turchaninov, V. I.; Epshteyn, Ye. Yu.

    2006-10-01

    An algorithm composition scheme for the numerical solution of boundary value problems in composite domains is proposed and illustrated using an example. The scheme requires neither difference approximations of the boundary conditions nor matching conditions on the boundary between the subdomains. The scheme is suited for multiprocessor computers.

  19. A new cooperative MIMO scheme based on SM for energy-efficiency improvement in wireless sensor network.

    PubMed

    Peng, Yuyang; Choi, Jaeho

    2014-01-01

    Improving the energy efficiency in wireless sensor networks (WSN) has attracted considerable attention nowadays. The multiple-input multiple-output (MIMO) technique has been proved as a good candidate for improving the energy efficiency, but it may not be feasible in WSN which is due to the size limitation of the sensor node. As a solution, the cooperative multiple-input multiple-output (CMIMO) technique overcomes this constraint and shows a dramatically good performance. In this paper, a new CMIMO scheme based on the spatial modulation (SM) technique named CMIMO-SM is proposed for energy-efficiency improvement. We first establish the system model of CMIMO-SM. Based on this model, the transmission approach is introduced graphically. In order to evaluate the performance of the proposed scheme, a detailed analysis in terms of energy consumption per bit of the proposed scheme compared with the conventional CMIMO is presented. Later, under the guide of this new scheme we extend our proposed CMIMO-SM to a multihop clustered WSN for further achieving energy efficiency by finding an optimal hop-length. Equidistant hop as the traditional scheme will be compared in this paper. Results from the simulations and numerical experiments indicate that by the use of the proposed scheme, significant savings in terms of total energy consumption can be achieved. Combining the proposed scheme with monitoring sensor node will provide a good performance in arbitrary deployed WSN such as forest fire detection system.

  20. An improved high-order scheme for DNS of low Mach number turbulent reacting flows based on stiff chemistry solver

    NASA Astrophysics Data System (ADS)

    Yu, Rixin; Yu, Jiangfei; Bai, Xue-Song

    2012-06-01

    We present an improved numerical scheme for numerical simulations of low Mach number turbulent reacting flows with detailed chemistry and transport. The method is based on a semi-implicit operator-splitting scheme with a stiff solver for integration of the chemical kinetic rates, developed by Knio et al. [O.M. Knio, H.N. Najm, P.S. Wyckoff, A semi-implicit numerical scheme for reacting flow II. Stiff, operator-split formulation, Journal of Computational Physics 154 (2) (1999) 428-467]. Using the material derivative form of continuity equation, we enhance the scheme to allow for large density ratio in the flow field. The scheme is developed for direct numerical simulation of turbulent reacting flow by employing high-order discretization for the spatial terms. The accuracy of the scheme in space and time is verified by examining the grid/time-step dependency on one-dimensional benchmark cases: a freely propagating premixed flame in an open environment and in an enclosure related to spark-ignition engines. The scheme is then examined in simulations of a two-dimensional laminar flame/vortex-pair interaction. Furthermore, we apply the scheme to direct numerical simulation of a homogeneous charge compression ignition (HCCI) process in an enclosure studied previously in the literature. Satisfactory agreement is found in terms of the overall ignition behavior, local reaction zone structures and statistical quantities. Finally, the scheme is used to study the development of intrinsic flame instabilities in a lean H2/air premixed flame, where it is shown that the spatial and temporary accuracies of numerical schemes can have great impact on the prediction of the sensitive nonlinear evolution process of flame instability.

  1. Image compression-encryption scheme based on hyper-chaotic system and 2D compressive sensing

    NASA Astrophysics Data System (ADS)

    Zhou, Nanrun; Pan, Shumin; Cheng, Shan; Zhou, Zhihong

    2016-08-01

    Most image encryption algorithms based on low-dimensional chaos systems bear security risks and suffer encryption data expansion when adopting nonlinear transformation directly. To overcome these weaknesses and reduce the possible transmission burden, an efficient image compression-encryption scheme based on hyper-chaotic system and 2D compressive sensing is proposed. The original image is measured by the measurement matrices in two directions to achieve compression and encryption simultaneously, and then the resulting image is re-encrypted by the cycle shift operation controlled by a hyper-chaotic system. Cycle shift operation can change the values of the pixels efficiently. The proposed cryptosystem decreases the volume of data to be transmitted and simplifies the keys distribution simultaneously as a nonlinear encryption system. Simulation results verify the validity and the reliability of the proposed algorithm with acceptable compression and security performance.

  2. Segmentation techniques evaluation based on a single compact breast mass classification scheme

    NASA Astrophysics Data System (ADS)

    Matheus, Bruno R. N.; Marcomini, Karem D.; Schiabel, Homero

    2016-03-01

    In this work some segmentation techniques are evaluated by using a simple centroid-based classification system regarding breast mass delineation in digital mammography images. The aim is to determine the best one for future CADx developments. Six techniques were tested: Otsu, SOM, EICAMM, Fuzzy C-Means, K-Means and Level-Set. All of them were applied to segment 317 mammography images from DDSM database. A single compact set of attributes was extracted and two centroids were defined, one for malignant and another for benign cases. The final classification was based on proximity with a given centroid and the best results were presented by the Level-Set technique with a 68.1% of Accuracy, which indicates this method as the most promising for breast masses segmentation aiming a more precise interpretation in schemes CADx.

  3. Digital image correlation involves an inverse problem: A regularization scheme based on subset size constraint

    NASA Astrophysics Data System (ADS)

    Zhan, Qin; Yuan, Yuan; Fan, Xiangtao; Huang, Jianyong; Xiong, Chunyang; Yuan, Fan

    2016-06-01

    Digital image correlation (DIC) is essentially implicated in a class of inverse problem. Here, a regularization scheme is developed for the subset-based DIC technique to effectively inhibit potential ill-posedness that likely arises in actual deformation calculations and hence enhance numerical stability, accuracy and precision of correlation measurement. With the aid of a parameterized two-dimensional Butterworth window, a regularized subpixel registration strategy is established, in which the amount of speckle information introduced to correlation calculations may be weighted through equivalent subset size constraint. The optimal regularization parameter associated with each individual sampling point is determined in a self-adaptive way by numerically investigating the curve of 2-norm condition number of coefficient matrix versus the corresponding equivalent subset size, based on which the regularized solution can eventually be obtained. Numerical results deriving from both synthetic speckle images and actual experimental images demonstrate the feasibility and effectiveness of the set of newly-proposed regularized DIC algorithms.

  4. Missing texture reconstruction method based on error reduction algorithm using Fourier transform magnitude estimation scheme.

    PubMed

    Ogawa, Takahiro; Haseyama, Miki

    2013-03-01

    A missing texture reconstruction method based on an error reduction (ER) algorithm, including a novel estimation scheme of Fourier transform magnitudes is presented in this brief. In our method, Fourier transform magnitude is estimated for a target patch including missing areas, and the missing intensities are estimated by retrieving its phase based on the ER algorithm. Specifically, by monitoring errors converged in the ER algorithm, known patches whose Fourier transform magnitudes are similar to that of the target patch are selected from the target image. In the second approach, the Fourier transform magnitude of the target patch is estimated from those of the selected known patches and their corresponding errors. Consequently, by using the ER algorithm, we can estimate both the Fourier transform magnitudes and phases to reconstruct the missing areas.

  5. A novel lung nodules detection scheme based on vessel segmentation on CT images.

    PubMed

    Jia, Tong; Zhang, Hao; Meng, Haixiu

    2014-01-01

    Lung vessels often interfere with the detection of lung nodules. In this paper, a novel computer-aided lung nodule detection scheme on vessel segmentation is proposed. This paper describes an active contour model which can combine image region mean gray value and image edge energy. It is used to segment and remove lung vessels. A selective shape filter based on Hessian Matrix is used to detect suspicious nodules and remove omitted lung vessels. This paper extracts density, shape and position features of suspicious nodules, and uses a Rule-Based Classification (RBC) method to identify true positive nodules. In the experiment results, the detection sensitivity is about 90% and FP is 1/scan.

  6. A novel chaotic map and an improved chaos-based image encryption scheme.

    PubMed

    Zhang, Xianhan; Cao, Yang

    2014-01-01

    In this paper, we present a novel approach to create the new chaotic map and propose an improved image encryption scheme based on it. Compared with traditional classic one-dimensional chaotic maps like Logistic Map and Tent Map, this newly created chaotic map demonstrates many better chaotic properties for encryption, implied by a much larger maximal Lyapunov exponent. Furthermore, the new chaotic map and Arnold's Cat Map based image encryption method is designed and proved to be of solid robustness. The simulation results and security analysis indicate that such method not only can meet the requirement of imagine encryption, but also can result in a preferable effectiveness and security, which is usable for general applications.

  7. A Novel Chaotic Map and an Improved Chaos-Based Image Encryption Scheme

    PubMed Central

    2014-01-01

    In this paper, we present a novel approach to create the new chaotic map and propose an improved image encryption scheme based on it. Compared with traditional classic one-dimensional chaotic maps like Logistic Map and Tent Map, this newly created chaotic map demonstrates many better chaotic properties for encryption, implied by a much larger maximal Lyapunov exponent. Furthermore, the new chaotic map and Arnold's Cat Map based image encryption method is designed and proved to be of solid robustness. The simulation results and security analysis indicate that such method not only can meet the requirement of imagine encryption, but also can result in a preferable effectiveness and security, which is usable for general applications. PMID:25143990

  8. A high carrier injection terahertz quantum cascade laser based on indirectly pumped scheme

    SciTech Connect

    Razavipour, S. G. Xu, C.; Wasilewski, Z. R.; Ban, D.; Dupont, E.; Laframboise, S. R.; Chan, C. W. I.; Hu, Q.

    2014-01-27

    A Terahertz quantum cascade laser with a rather high injection coupling strength based on an indirectly pumped scheme is designed and experimentally implemented. To effectively suppress leakage current, the chosen quantum cascade module of the device is based on a five-well GaAs/Al{sub 0.25}Ga{sub 0.75}As structure. The device lases up to 151 K with a lasing frequency of 2.67 THz. This study shows that the effect of higher energy states in carrier transport and the long-range tunnel coupling between states that belong to non-neighbouring modules have to be considered in quantum design of structures with a narrow injector barrier. Moreover, the effect of interface roughness scattering between the lasing states on threshold current is crucial.

  9. Optimal integral sliding mode control scheme based on pseudospectral method for robotic manipulators

    NASA Astrophysics Data System (ADS)

    Liu, Rongjie; Li, Shihua

    2014-06-01

    For a multi-input multi-output nonlinear system, an optimal integral sliding mode control scheme based on pseudospectral method is proposed in this paper. And the controller is applied on rigid robotic manipulators with constraints. First, a general form of integral sliding mode is designed with the aim of restraining disturbance. Then, pseudospectral method is adopted to deal with constrained optimal control problem. In consideration of the benefits of both methods, an optimal integral sliding mode controller is given, which is based on the combination of integral sliding mode and pseudospectral method. The stability analysis shows that the controller can guarantee stability of robotic manipulator system. Simulations show the effectiveness of proposed method.

  10. Property study of integer wavelet transform lossless compression coding based on lifting scheme

    NASA Astrophysics Data System (ADS)

    Xie, Cheng Jun; Yan, Su; Xiang, Yang

    2006-01-01

    In this paper the algorithms and its improvement of integer wavelet transform combining SPIHT and arithmetic coding in image lossless compression is mainly studied. The experimental result shows that if the order of low-pass filter vanish matrix is fixed, the improvement of compression effect is not evident when invertible integer wavelet transform is satisfied and focusing of energy property monotonic increase with transform scale. For the same wavelet bases, the order of low-pass filter vanish matrix is more important than the order of high-pass filter vanish matrix in improving the property of image compression. Integer wavelet transform lossless compression coding based on lifting scheme has no relation to the entropy of image. The effect of compression is depended on the the focuing of energy property of image transform.

  11. Triple-wavelength erbium fiber ring laser based on compound-ring scheme.

    PubMed

    Yeh, Chien Hung; Shih, Fu Yuan; Chen, Chang Tai; Chi, Sien

    2007-12-24

    .A triple-wavelength erbium-doped compound ring fiber laser using the fiber-based triple-ring filter (TRF) is proposed and experimentally investigated. Using the fiber-based TRF laser scheme, the proposed laser can lase three wavelengths simultaneously. The fiber laser retrieve the optical side-mode suppression ratios (SMSRs) of 40.2, 40.4 and 41.6 dB and the output powers of -9, -8.8 and -7.6 dBm at the wavelengths 1555.89, 1556.77 and 1557.66 nm, respectively. The mode spacing of the triple-wavelength fiber laser is nearly 0.9 nm. Moreover, the output power stability of the ring laser has also been measured and analyzed.

  12. Monolithic CEO-stabilization scheme-based frequency comb from an octave-spanning laser

    NASA Astrophysics Data System (ADS)

    Zi-Jiao, Yu; Hai-Nian, Han; Yang, Xie; Hao, Teng; Zhao-Hua, Wang; Zhi-Yi, Wei

    2016-04-01

    We demonstrate a carrier-envelope phase-stabilized octave-spanning oscillator based on the monolithic scheme. A wide output spectrum extending from 480 nm to 1050 nm was generated directly from an all-chirped mirror Ti:sapphire laser. After several improvements, the carrier-envelope offset (CEO) beat frequency accessed nearly 60 dB under a resolution of 100 kHz. Using a feedback system with 50-kHz bandwidth, we compressed the residual phase noise to 55 mrad (integrated from 1 Hz to 1 MHz) for the stabilized CEO, corresponding to 23-as timing jitter at the central wavelength of 790 nm. This is, to the best of our knowledge, the smallest timing jitter achieved among the existing octave-spanning laser based frequency combs. Project supported by the National Basic Research Program of China (Grant No. 2012CB821304) and the National Natural Science Foundation of China (Grant Nos. 11078022 and 61378040).

  13. NUMERICAL COMPUTATIONS OF CO-EXISTING SUPER-CRITICAL AND SUB-CRITICAL FLOWS BASED UPON CRD SCHEMES

    NASA Astrophysics Data System (ADS)

    Horie, Katsuya; Okamura, Seiji; Kobayashi, Yusuke; Hyodo, Makoto; Hida, Yoshihisa; Nishimoto, Naoshi; Mori, Akio

    Stream flows in steep gradient bed form complicating flow configurations, where co-exist super-critical and sub-critical flows. Computing numerically such flows are the key to successful river management. This study applied CRD schemes to 1D and 2D stream flow computations and proposed genuine ways to eliminate expansion shock waves. Through various cases of computing stream flows conducted, CRD schemes showed that i) conservativeness of discharge and accuracy of four significant figures are ensured, ii) artificial viscosity is not explicitly used for computational stabilization, and thus iii) 1D and 2D computations based upon CRD schemes are applicable to evaluating complicating stream flows for river management.

  14. District Allocation of Human Resources Utilizing the Evidence Based Model: A Study of One High Achieving School District in Southern California

    ERIC Educational Resources Information Center

    Lane, Amber Marie

    2013-01-01

    This study applies the Gap Analysis Framework to understand the gaps that exist in human resource allocation of one Southern California school district. Once identified, gaps are closed with the reallocation of human resources, according to the Evidenced Based Model, requiring the re-purposing of core classroom teachers, specialists, special…

  15. A wireless sensor network based personnel positioning scheme in coal mines with blind areas.

    PubMed

    Liu, Zhigao; Li, Chunwen; Wu, Danchen; Dai, Wenhan; Geng, Shaobo; Ding, Qingqing

    2010-01-01

    This paper proposes a novel personnel positioning scheme for a tunnel network with blind areas, which compared with most existing schemes offers both low-cost and high-precision. Based on the data models of tunnel networks, measurement networks and mobile miners, the global positioning method is divided into four steps: (1) calculate the real time personnel location in local areas using a location engine, and send it to the upper computer through the gateway; (2) correct any localization errors resulting from the underground tunnel environmental interference; (3) determine the global three-dimensional position by coordinate transformation; (4) estimate the personnel locations in the blind areas. A prototype system constructed to verify the positioning performance shows that the proposed positioning system has good reliability, scalability, and positioning performance. In particular, the static localization error of the positioning system is less than 2.4 m in the underground tunnel environment and the moving estimation error is below 4.5 m in the corridor environment. The system was operated continuously over three months without any failures.

  16. A chaos-based digital image encryption scheme with an improved diffusion strategy.

    PubMed

    Fu, Chong; Chen, Jun-jie; Zou, Hao; Meng, Wei-hong; Zhan, Yong-feng; Yu, Ya-wen

    2012-01-30

    Chaos-based image cipher has been widely investigated over the last decade or so to meet the increasing demand for real-time secure image transmission over public networks. In this paper, an improved diffusion strategy is proposed to promote the efficiency of the most widely investigated permutation-diffusion type image cipher. By using the novel bidirectional diffusion strategy, the spreading process is significantly accelerated and hence the same level of security can be achieved with fewer overall encryption rounds. Moreover, to further enhance the security of the cryptosystem, a plain-text related chaotic orbit turbulence mechanism is introduced in diffusion procedure by perturbing the control parameter of the employed chaotic system according to the cipher-pixel. Extensive cryptanalysis has been performed on the proposed scheme using differential analysis, key space analysis, various statistical analyses and key sensitivity analysis. Results of our analyses indicate that the new scheme has a satisfactory security level with a low computational complexity, which renders it a good candidate for real-time secure image transmission applications.

  17. A sparse Bayesian learning based scheme for multi-movement recognition using sEMG.

    PubMed

    Ding, Shuai; Wang, Liang

    2016-03-01

    This paper proposed a feature extraction scheme based on sparse representation considering the non-stationary property of surface electromyography (sEMG). Sparse Bayesian learning was introduced to extract the feature with optimal class separability to improve recognition accuracy of multi-movement patterns. The extracted feature, sparse representation coefficients (SRC), represented time-varying characteristics of sEMG effectively because of the compressibility (or weak sparsity) of the signal in some transformed domains. We investigated the effect of the proposed feature by comparing with other fourteen individual features in offline recognition. The results demonstrated the proposed feature revealed important dynamic information in the sEMG signals. The multi-feature sets formed by the SRC and other single feature yielded more superior performance on recognition accuracy, compared with the single features. The best average recognition accuracy of 94.33% was gained by using SVM classifier with the multi-feature set combining the feature SRC, Williston amplitude (WAMP), wavelength (WL) and the coefficients of the fourth order autoregressive model (ARC4) via multiple kernel learning framework. The proposed feature extraction scheme (known as SRC + WAMP + WL + ARC4) is a promising method for multi-movement recognition with high accuracy.

  18. A study of design approach of spreading schemes for viral marketing based on human dynamics

    NASA Astrophysics Data System (ADS)

    Yang, Jianmei; Zhuang, Dong; Xie, Weicong; Chen, Guangrong

    2013-12-01

    Before launching a real viral marketing campaign, it is needed to design a spreading scheme by simulations. Based on a categorization of spreading patterns in real world and models, we point out that the existing research (especially Yang et al. (2010) Ref. [16]) implicitly assume that if a user decides to post a received message (is activated), he/she will take the reposting action promptly (Prompt Action After Activation, or PAAA). After a careful analysis on a real dataset however, it is found that the observed time differences between action and activation exhibit a heavy-tailed distribution. A simulation model for heavy-tailed pattern is then proposed and performed. Similarities and differences of spreading processes between the heavy-tailed and PAAA patterns are analyzed. Consequently, a more practical design approach of spreading scheme for viral marketing on QQ platform is proposed. The design approach can be extended and applied to the contexts of non-heavy-tailed pattern, and viral marketing on other instant messaging platforms.

  19. Evaluation of two conceptual wastewater treatment schemes for a Lurgi-based indirect coal liquefaction plant

    SciTech Connect

    Villiers-Fisher, J.F.; Singh, S.P.N.

    1984-09-01

    The objective of this study was to evaluate two conceptual treatment schemes for decontaminating the wastewaters likely to be generated in a conceptual dry-ash Lurgi-based indirect coal liquefaction plant. The conceptual indirect coal liquefaction plant is an integrated (i.e., all utilities generated onsite) facility designed to convert 15,000 tons of moisture- and ash-free coal per stream day to motor gasoline using dry-ash Lurgi coal gasification, Imperial Chemical Industries' methanol synthesis, and Mobil's methanol-to-gasoline processes. The conceptual plant is premised to be located at a generic site in the eastern United States and processes a generic Interior Basin high-sulfur bituminous coal. The following conclusions can be drawn from this assessment: (1) On paper, wastewater treatment facilities can be designed that are projected to treat the indirect coal liquefaction plant wastewaters to a level where the effluent will likely meet the current regulations for aqueous effluents for allied industries such as coke ovens and petroleum refineries. (2) The estimated capital investments, in 1983 US dollars, for the Case I (surface-discharge) and Case II (zero-aqueous-discharge) schemes are approximately $440 million and $550 million, respectively. These costs represent about 15 and 20% of the estimated capital investment for the integrated indirect coal liquefaction plant. (3) Case II (zero-aqueous-discharge) wastewater treatment is likely to result in the accumulation of approximately 1 million tons of toxic solid wastes during the 30 years of plant operation.

  20. Dynamo-based scheme for forecasting the magnitude of solar activity cycles

    NASA Technical Reports Server (NTRS)

    Layden, A. C.; Fox, P. A.; Howard, J. M.; Sarajedini, A.; Schatten, K. H.

    1991-01-01

    This paper presents a general framework for forecasting the smoothed maximum level of solar activity in a given cycle, based on a simple understanding of the solar dynamo. This type of forecasting requires knowledge of the sun's polar magnetic field strength at the preceding activity minimum. Because direct measurements of this quantity are difficult to obtain, the quality of a number of proxy indicators already used by other authors is evaluated, which are physically related to the sun's polar field. These indicators are subjected to a rigorous statistical analysis, and the analysis technique for each indicator is specified in detail in order to simplify and systematize reanalysis for future use. It is found that several of these proxies are in fact poorly correlated or uncorrelated with solar activity, and thus are of little value for predicting activity maxima. Also presented is a scheme in which the predictions of the individual proxies are combined via an appropriately weighted mean to produce a compound prediction. The scheme is then applied to the current cycle 22, and a maximum smoothed international sunspot number of 171 + or - 26 is estimated.

  1. A dual-mode phase-shift modulation control scheme for voltage multiplier based X-ray power supply

    NASA Astrophysics Data System (ADS)

    Iqbal, S.; Besar, R.; Venkataseshaiah, C.

    2010-05-01

    This paper proposes a dual-mode phase-shift modulation control scheme for series resonant inverter fed voltage multiplier (VM) based X-ray power supply. In this control scheme the outputs voltage of two parallel connected series resonant inverters are mixed before supplying to VM circuit. The output voltage of the power supply is controlled by varying the phase-shift between the output voltages of two inverters. In order to achieve quick rise of output voltage, the power supply is started with zero phase-shift and as the output voltage reaches 90% of the target voltage, the phase-shift is increased to a value which corresponds to target output voltage to prevent overshoot. The proposed control scheme has been shown to have good performance. Experimental results based on the scaled-down laboratory prototype are presented to validate the effectiveness of proposed dual-mode phase shift modulation control scheme.

  2. Novel synchronous DPSK optical regenerator based on a feed-forward based carrier extraction scheme.

    PubMed

    Ibrahim, Selwan K; Sygletos, Stylianos; Rafique, Danish; O'Dowd, John A; Weerasuriya, Ruwan; Ellis, Andrew D

    2011-05-09

    We experimentally demonstrate a novel synchronous 10.66 Gbit/s DPSK OEO regenerator which uses a feed-forward carrier extraction scheme with an injection-locked laser to synchronize the regenerated signal wavelength to the incoming signal wavelength. After injection-locking, a low-cost DFB laser used at the regenerator exhibited the same linewidth characteristics as the narrow line-width transmitter laser. The phase regeneration properties of the regenerator were evaluated by emulating random Gaussian phase noise applied to the DPSK signal before the regenerator using a phase modulator driven by an arbitrary waveform generator. The overall performance was evaluated in terms of electrical eye-diagrams, BER measurements, and constellation diagrams.

  3. A glioma classification scheme based on coexpression modules of EGFR and PDGFRA.

    PubMed

    Sun, Yingyu; Zhang, Wei; Chen, Dongfeng; Lv, Yuhong; Zheng, Junxiong; Lilljebjörn, Henrik; Ran, Liang; Bao, Zhaoshi; Soneson, Charlotte; Sjögren, Hans Olov; Salford, Leif G; Ji, Jianguang; French, Pim J; Fioretos, Thoas; Jiang, Tao; Fan, Xiaolong

    2014-03-04

    We hypothesized that key signaling pathways of glioma genesis might enable the molecular classification of gliomas. Gene coexpression modules around epidermal growth factor receptor (EGFR) (EM, 29 genes) or platelet derived growth factor receptor A (PDGFRA) (PM, 40 genes) in gliomas were identified. Based on EM and PM expression signatures, nonnegative matrix factorization reproducibly clustered 1,369 adult diffuse gliomas WHO grades II-IV from four independent databases generated in three continents, into the subtypes (EM, PM and EM(low)PM(low) gliomas) in a morphology-independent manner. Besides their distinct patterns of genomic alterations, EM gliomas were associated with higher age at diagnosis, poorer prognosis, and stronger expression of neural stem cell and astrogenesis genes. Both PM and EM(low)PM(low) gliomas were associated with younger age at diagnosis and better prognosis. PM gliomas were enriched in the expression of oligodendrogenesis genes, whereas EM(low)PM(low) gliomas were enriched in the signatures of mature neurons and oligodendrocytes. The EM/PM-based molecular classification scheme is applicable to adult low-grade and high-grade diffuse gliomas, and outperforms existing classification schemes in assigning diffuse gliomas to subtypes with distinct transcriptomic and genomic profiles. The majority of the EM/PM classifiers, including regulators of glial fate decisions, have not been extensively studied in glioma biology. Subsets of these classifiers were coexpressed in mouse glial precursor cells, and frequently amplified or lost in an EM/PM glioma subtype-specific manner, resulting in somatic copy number alteration-dependent gene expression that contributes to EM/PM signatures in glioma samples. EM/PM-based molecular classification provides a molecular diagnostic framework to expedite the search for new glioma therapeutic targets.

  4. Funding Based on Needs? A Study on the Use of Needs Assessment Data by a Major Humanitarian Health Assistance Donor in its Decisions to Allocate Funds

    PubMed Central

    Olin, Emma; von Schreeb, Johan

    2014-01-01

    Background: International humanitarian assistance is essential for disaster-affected populations, particularly in resource scarce settings. To target such assistance, needs assessments are required. According to internationally endorsed principles, donor governments should provide funding for humanitarian assistance based on need. Aim: The aim of this study is to explore a major donor’s use of needs assessment data in decision-making for allocations of funds for health-related humanitarian assistance contributions. Setting: This is a case study of the Swedish International Development Cooperation Agency (Sida), a major and respected international donor of humanitarian assistance. Methods: To explore Sida’s use of needs assessment data in practice for needs-based allocations, we reviewed all decision documents and assessment memoranda for humanitarian assistance contributions for 2012 using content analysis; this was followed by interviews with key personnel at Sida. Results: Our document analysis found that needs assessment data was not systematically included in Sida’s assessment memoranda and decision documents. In the interviews, we observed various descriptions of the concept of needs assessments, the importance of contextual influences as well as previous collaborations with implementing humanitarian assistance organizations. Our findings indicate that policies guiding funding decisions on humanitarian assistance need to be matched with available needs assessment data and that terminologies and concepts have to be clearly defined. Conclusion: Based on the document analysis and the interviews, it is unclear how well Sida used needs assessment data for decisions to allocate funds. However, although our observations show that needs assessments are seldom used in decision making, Sida’s use of needs assessments has improved compared to a previous study. To improve project funds allocations based on needs assessment data, it will be critical to develop

  5. Motion-Based Piloted Simulation Evaluation of a Control Allocation Technique to Recover from Pilot Induced Oscillations

    NASA Technical Reports Server (NTRS)

    Craun, Robert W.; Acosta, Diana M.; Beard, Steven D.; Leonard, Michael W.; Hardy, Gordon H.; Weinstein, Michael; Yildiz, Yildiray

    2013-01-01

    This paper describes the maturation of a control allocation technique designed to assist pilots in the recovery from pilot induced oscillations (PIOs). The Control Allocation technique to recover from Pilot Induced Oscillations (CAPIO) is designed to enable next generation high efficiency aircraft designs. Energy efficient next generation aircraft require feedback control strategies that will enable lowering the actuator rate limit requirements for optimal airframe design. One of the common issues flying with actuator rate limits is PIOs caused by the phase lag between the pilot inputs and control surface response. CAPIO utilizes real-time optimization for control allocation to eliminate phase lag in the system caused by control surface rate limiting. System impacts of the control allocator were assessed through a piloted simulation evaluation of a non-linear aircraft simulation in the NASA Ames Vertical Motion Simulator. Results indicate that CAPIO helps reduce oscillatory behavior, including the severity and duration of PIOs, introduced by control surface rate limiting.

  6. 77 FR 43184 - Allocation of Capacity on New Merchant Transmission Projects and New Cost-Based, Participant...

    Federal Register 2010, 2011, 2012, 2013, 2014

    2012-07-24

    ... customers, and (2) file a report with the Commission describing the solicitation, selection and negotiation... report to the Commission describing the solicitation, selection and negotiation process. The Commission... allocate 100 percent of their projects' capacity through bilateral negotiations with identified...

  7. Developing an Agent-based Model for the Depot-based Water Allocation System in the Bakken Field in Western North Dakota

    NASA Astrophysics Data System (ADS)

    Lin, T.; Lin, Z.; Lim, S.; Borders, M.

    2015-12-01

    The oil production at the Bakken Shale increased more than ten times from 2008 to 2013 due to technological advancement in hydraulic fracturing and North Dakota has become the second largest oil producing state in the U.S. behind only Texas since 2012. On average it requires about 2-4 million gallons of freshwater to complete one oil well in the Bakken field and the number of oil well completions (i.e., hydraulic fracturing) in the Bakken field increased from 500 in 2008 to 2085 in 2013. A large quantity of freshwater used for hydraulic fracturing renders a significant impact on water resource management in the semi-arid region. A novel water allocation system - water depots - was spontaneously created to distribute surface and ground water for industrial uses. A GIS-based multi-agent model is developed to simulate the emergent patterns and dynamics of the water depot-based water allocation system and to explore its economic and environmental consequences. Four different types of water depot are defined as agents and water price, climate condition, water source, geology, and other physical and economic constraints are considered in the model. Decentralized optimization algorithm will be used to determine the agents' behaviors. The agent-based model for water depots will be coupled with hydrological models to improve the region's water resources management.

  8. Risk-based decision making for staggered bioterrorist attacks : resource allocation and risk reduction in "reload" scenarios.

    SciTech Connect

    Lemaster, Michelle Nicole; Gay, David M.; Ehlen, Mark Andrew; Boggs, Paul T.; Ray, Jaideep

    2009-10-01

    Staggered bioterrorist attacks with aerosolized pathogens on population centers present a formidable challenge to resource allocation and response planning. The response and planning will commence immediately after the detection of the first attack and with no or little information of the second attack. In this report, we outline a method by which resource allocation may be performed. It involves probabilistic reconstruction of the bioterrorist attack from partial observations of the outbreak, followed by an optimization-under-uncertainty approach to perform resource allocations. We consider both single-site and time-staggered multi-site attacks (i.e., a reload scenario) under conditions when resources (personnel and equipment which are difficult to gather and transport) are insufficient. Both communicable (plague) and non-communicable diseases (anthrax) are addressed, and we also consider cases when the data, the time-series of people reporting with symptoms, are confounded with a reporting delay. We demonstrate how our approach develops allocations profiles that have the potential to reduce the probability of an extremely adverse outcome in exchange for a more certain, but less adverse outcome. We explore the effect of placing limits on daily allocations. Further, since our method is data-driven, the resource allocation progressively improves as more data becomes available.

  9. Security analysis of an encryption scheme based on nonpositional polynomial notations

    NASA Astrophysics Data System (ADS)

    Kapalova, Nursulu; Dyusenbayev, Dilmukhanbet

    2016-01-01

    The aim of the research was to conduct a cryptographic analysis of an encryption scheme developed on the basis of nonpositional polynomial notations to estimate the algorithm strength. Nonpositional polynomial notations (NPNs) are residue number systems (RNSs) based on irreducible polynomials over GF(2). To evaluate if the algorithms developed on the basis of NPNs are secure, mathematical models of cryptanalysis involving algebraic, linear and differential methods have been designed. The cryptanalysis is as follows. A system of nonlinear equations is obtained from a function transforming plaintext into ciphertext with a key. Next, a possibility of transition of the nonlinear system to a linear one is considered. The cryptanalysis was conducted for the cases with known: 1) ciphertext; 2) plaintext and the related ciphertext; 3) plaintext file format; and 4) ASCII-encoded plaintext.

  10. A multichannel EEG acquisition scheme based on single ended amplifiers and digital DRL.

    PubMed

    Haberman, Marcelo Alejandro; Spinelli, Enrique Mario

    2012-12-01

    Single ended (SE) amplifiers allow implementing biopotential front-ends with a reduced number of parts, being well suited for preamplified electrodes or compact EEG headboxes. On the other hand, given that each channel has independent gain; mismatching between these gains results in poor common-mode rejection ratios (CMRRs) (about 30 dB considering 1% tolerance components). This work proposes a scheme for multichannel EEG acquisition systems based on SE amplifiers and a novel digital driven right leg (DDRL) circuit, which overcome the poor CMRR of the front-end stage providing a high common mode reduction at power line frequency (up to 80 dB). A functional prototype was built and tested showing the feasibility of the proposed technique. It provided EEG records with negligible power line interference, even in very aggressive EMI environments.

  11. Calculation of Cancellous Bone Elastic Properties with the Polarization-based FFT Iterative Scheme.

    PubMed

    Colabella, Lucas; Ibarra Pino, Ariel Alejandro; Ballarre, Josefina; Kowalczyk, Piotr; Cisilino, Adrián Pablo

    2017-03-07

    The FFT based method, originally introduced by Moulinec and Suquet in 1994 has gained popularity for computing homogenized properties of composites. In this work, the method is used for the computational homogenization of the elastic properties of cancellous bone. To the authors' knowledge, this is the first study where the FFT scheme is applied to bone mechanics. The performance of the method is analyzed for artificial and natural bone samples of two species: bovine femoral heads and implanted femurs of Hokkaido rats. Model geometries are constructed using data from X-ray tomographies and the bone tissue elastic properties are measured using micro and nanoindentation tests. Computed results are in excellent agreement with those available in the literature. The study shows the suitability of the method to accurately estimate the fully anisotropic elastic response of cancellous bone. Guidelines are provided for the construction of the models and the setting of the algorithm.

  12. Homography-based control scheme for mobile robots with nonholonomic and field-of-view constraints.

    PubMed

    López-Nicolás, Gonzalo; Gans, Nicholas R; Bhattacharya, Sourabh; Sagüés, Carlos; Guerrero, Josechu J; Hutchinson, Seth

    2010-08-01

    In this paper, we present a visual servo controller that effects optimal paths for a nonholonomic differential drive robot with field-of-view constraints imposed by the vision system. The control scheme relies on the computation of homographies between current and goal images, but unlike previous homography-based methods, it does not use the homography to compute estimates of pose parameters. Instead, the control laws are directly expressed in terms of individual entries in the homography matrix. In particular, we develop individual control laws for the three path classes that define the language of optimal paths: rotations, straight-line segments, and logarithmic spirals. These control laws, as well as the switching conditions that define how to sequence path segments, are defined in terms of the entries of homography matrices. The selection of the corresponding control law requires the homography decomposition before starting the navigation. We provide a controllability and stability analysis for our system and give experimental results.

  13. On the security of a new image encryption scheme based on chaotic map lattices.

    PubMed

    Arroyo, David; Rhouma, Rhouma; Alvarez, Gonzalo; Li, Shujun; Fernandez, Veronica

    2008-09-01

    This paper reports a detailed cryptanalysis of a recently proposed encryption scheme based on the logistic map [A. Pisarchik et al., Chaos 16, 033118 (2006)]. Some problems are emphasized concerning the key space definition and the implementation of the cryptosystem using floating-point operations. It is also shown how it is possible to reduce considerably the key space through a ciphertext-only attack. Moreover, a timing attack allows for the estimation of part of the key due to the existent relationship between this part of the key and the encryption/decryption time. As a result, the main features of the cryptosystem do not satisfy the demands of secure communications. Some hints are offered to improve the cryptosystem under study according to those requirements.

  14. A hybrid lightwave transport system based on a BLS with an OSNR enhancement scheme

    NASA Astrophysics Data System (ADS)

    Ying, Cheng-Ling; Lu, Hai-Han; Li, Chung-Yi; Lin, Chun-Yu; Wu, Chang-Jen; Lin, Hung-Hsien

    2016-04-01

    A hybrid lightwave transport system based on a broadband light source (BLS) with an optical signal-to-noise ratio (OSNR) enhancement scheme for millimeter-wave (MMW)/radio-over-fiber (RoF)/cable television (CATV) signal transmission is proposed and experimentally demonstrated. Unlike traditional hybrid lightwave transport systems for signal transmission, in which a transmitting site needs multiple wavelength-selected distributed feedback laser diodes (DFB LDs) to support various services, such proposed systems employ a phase modulator to provide multiple optical carriers for various applications. Over an 80 km single-mode fiber (SMF) transmission, the bit error rate (BER)/carrier-to-noise ratio (CNR)/composite second-order (CSO)/composite triple-beat (CTB) perform brilliantly for hybrid 100 GHz MMW/50 GHz MMW/10 GHz RoF/550 MHz CATV signal transmission. Such a hybrid lightwave transport system would be attractive for fiber trunk applications to provide broadband integrated services.

  15. Path Searching Based Fault Automated Recovery Scheme for Distribution Grid with DG

    NASA Astrophysics Data System (ADS)

    Xia, Lin; Qun, Wang; Hui, Xue; Simeng, Zhu

    2016-12-01

    Applying the method of path searching based on distribution network topology in setting software has a good effect, and the path searching method containing DG power source is also applicable to the automatic generation and division of planned islands after the fault. This paper applies path searching algorithm in the automatic division of planned islands after faults: starting from the switch of fault isolation, ending in each power source, and according to the line load that the searching path traverses and the load integrated by important optimized searching path, forming optimized division scheme of planned islands that uses each DG as power source and is balanced to local important load. Finally, COBASE software and distribution network automation software applied are used to illustrate the effectiveness of the realization of such automatic restoration program.

  16. A Privacy-Preserving ID-Based Group Key Agreement Scheme Applied in VPAN

    NASA Astrophysics Data System (ADS)

    de Mulder, Yoni; Wouters, Karel; Preneel, Bart

    In 2008, Wan et al. presented an anonymous ID-based group key agreement scheme for wireless networks, for which they claim that it ensures anonymity and unlinkability of the group members, as well as forward and backward secrecy of the group session key. In this paper, we show that forward and backward secrecy do not hold for the protocol. We propose a correction that introduces a shielding factor that protects each member's input to the group key. we also introduce a new feature that assures the correctness of the key as computed by all group members. This results in an increased computation cost, due to extra public key operations, and a similar communication cost. We also show in which practical setting the protocol can be deployed.

  17. Virtual Reality-based Telesurgery via Teleprogramming Scheme Combined with Semi-autonomous Control.

    PubMed

    Zhijiang, Du; Zhiheng, Jia; Minxiu, Kong

    2005-01-01

    Telesurgery systems have long been suffering variable and unpredictable Internet commutation time delay, operation fatigue, and other drawbacks. Based on virtual reality technology, a teleprogramming scheme combined with semi-autonomous control is introduced to guarantee the robustness and efficiency of teleoperation of HIT-RAOS, a robot-assisted orthopedic surgery system. In this system, without considering time delay, the operator can just interact with virtual environment which provides real-time 3D vision, stereophonic sound, and tactile and force feedback imitated by a parallel master manipulator. And several tasks can be managed simultaneously via semi-autonomous control. Finally, the method is experimentally demonstrated on an experiment of locking of intramedullary nails, and is shown to effectively provide stability and performances.

  18. ROCIT : a visual object recognition algorithm based on a rank-order coding scheme.

    SciTech Connect

    Gonzales, Antonio Ignacio; Reeves, Paul C.; Jones, John J.; Farkas, Benjamin D.

    2004-06-01

    This document describes ROCIT, a neural-inspired object recognition algorithm based on a rank-order coding scheme that uses a light-weight neuron model. ROCIT coarsely simulates a subset of the human ventral visual stream from the retina through the inferior temporal cortex. It was designed to provide an extensible baseline from which to improve the fidelity of the ventral stream model and explore the engineering potential of rank order coding with respect to object recognition. This report describes the baseline algorithm, the model's neural network architecture, the theoretical basis for the approach, and reviews the history of similar implementations. Illustrative results are used to clarify algorithm details. A formal benchmark to the 1998 FERET fafc test shows above average performance, which is encouraging. The report concludes with a brief review of potential algorithmic extensions for obtaining scale and rotational invariance.

  19. A password-based user authentication scheme for the integrated EPR information system.

    PubMed

    Wu, Zhen-Yu; Chung, Yufang; Lai, Feipei; Chen, Tzer-Shyong

    2012-04-01

    With the rapid development of the Internet, digitization and electronic orientation are required in various applications of our daily life. For e-medicine, establishing Electronic patient records (EPRs) for all the patients has become the top issue during the last decade. Simultaneously, constructing an integrated EPR information system of all the patients is beneficial because it can provide medical institutions and the academia with most of the patients' information in details for them to make correct decisions and clinical decisions, to maintain and analyze patients' health. Also beneficial to doctors and scholars, the EPR system can give them record linkage for researches, payment audits, or other services bound to be developed and integrated into medicine. To tackle the illegal access and to prevent the information from theft during transmission over the insecure Internet, we propose a password-based user authentication scheme suitable for information integration.

  20. Optical threshold secret sharing scheme based on basic vector operations and coherence superposition

    NASA Astrophysics Data System (ADS)

    Deng, Xiaopeng; Wen, Wei; Mi, Xianwu; Long, Xuewen

    2015-04-01

    We propose, to our knowledge for the first time, a simple optical algorithm for secret image sharing with the (2,n) threshold scheme based on basic vector operations and coherence superposition. The secret image to be shared is firstly divided into n shadow images by use of basic vector operations. In the reconstruction stage, the secret image can be retrieved by recording the intensity of the coherence superposition of any two shadow images. Compared with the published encryption techniques which focus narrowly on information encryption, the proposed method can realize information encryption as well as secret sharing, which further ensures the safety and integrality of the secret information and prevents power from being kept centralized and abused. The feasibility and effectiveness of the proposed method are demonstrated by numerical results.