Science.gov

Sample records for allocation scheme based

  1. Blocking Probability of a Preemption-Based Bandwidth-Allocation Scheme for Service Differentiation in OBS Networks

    NASA Astrophysics Data System (ADS)

    Phuritatkul, Jumpot; Ji, Yusheng; Zhang, Yongbing

    2006-08-01

    For the next generation optical Internet, optical burst switching (OBS) is considered as a promising solution to exploit the capacity provided by wavelength-division-multiplexing technology. In this paper, the authors analyze preemption-based bandwidth-allocation (PBA) scheme for supporting service differentiation in OBS networks. They first propose the mathematical analysis of burst blocking probability (BBP) for a general case of probabilistic wavelength-preemption algorithm. The BBP of a new arrival burst for a K-channel N-class system is presented. They then apply this model to PBA. The results of analytical loss model are investigated and compared with simulations. The simulation results validate their analytical model and show that a BBP can be controlled for different service classes with the PBA scheme.

  2. 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.

  3. A subcarrier-pair based resource allocation scheme using proportional fairness for cooperative OFDM-based cognitive radio networks.

    PubMed

    Ma, Yongtao; Zhou, Liuji; Liu, Kaihua

    2013-08-09

    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.

  4. 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.

  5. 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.

  6. 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.

  7. Dynamic and balanced capacity allocation scheme with uniform bandwidth for OFDM-PON systems

    NASA Astrophysics Data System (ADS)

    Lei, Cheng; Chen, Hongwei; Chen, Minghua; Yu, Ying; Guo, Qiang; Yang, Sigang; Xie, Shizhong

    2015-03-01

    As the bitrate of orthogonal frequency division multiplexing passive optical network (OFDM-PON) system is continuously increasing, how to effectively allocate the system bandwidth among the huge number of optical network units (ONUs) is one of the key problems before OFDM-PON can be practical deployed. Unlike traditional bandwidth allocation scheme, in this paper, the transmission performance of single ONU is for the first time taken into consideration and optimized. To reduce the manufacturing complexity and fully utilize the processing ability of the receivers, the system bandwidth is equally distributed to the ONUs. Bit loading is used to allocate the total transmission capacity, and power loading is used to guarantee the ONUs have balanced transmission performance even if they operate at different bitrate. In this way, a dynamic and balanced capacity allocation scheme with uniform bandwidth for OFDM-PON systems can be realized. At last, an experimental system is established to verify the feasibility of the proposed scheme, and the influence that the scheme brings to the whole system is also analyzed.

  8. 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…

  9. Resource Allocation and Power Management Schemes in an LTE-Advanced Femtocell Network

    NASA Astrophysics Data System (ADS)

    Lee, Byung-Bog; Yu, Jae-Hak; Lee, In-Hwan; Pyo, Cheol-Sig; Kim, Se-Jin

    In this letter, we introduce two different resource allocation and Tx power management schemes, called resource control and fixed power (RCFP) and fixed resource and power control (FRPC), in an LTE-Advanced femtocell network. We analyze and compare the two schemes in terms of the system throughput for downlink and energy consumption of home evolved NodeB (HeNB) Tx power according to the number of HeNBs and home user equipment (HUE)'s user traffic density (C). The simulation results show that the FRPC scheme has better performance in terms of system throughput for macro user equipments (MUEs) and energy consumption in low C.

  10. Routing and spectrum allocation in multi-ring based data center networks

    NASA Astrophysics Data System (ADS)

    Zhang, Zitian; Hu, Weisheng; Ye, Tong; Sun, Weiqiang; Zhao, Li; Zhang, Kuo

    2016-02-01

    Recently, we proposed a multi-ring based optical circuit switching (OCS) network following the principle of a Clos network. The network can provide connectivity to a large number of racks which may be distributed across a relatively large geographical space in a data center. However, property of the ring based switch in the central stage of the multi-ring based OCS network introduces a unique routing and spectrum allocation (RSA) problem which is more complex than the routing problem in a classical Clos switching network. In this paper, we extend our work to investigate the RSA problem. For a given set of inter-rack traffic requests, we consider two spectrum allocation schemes, namely fixed spectrum allocation and flexible spectrum allocation. For the fixed case, we show that the RSA problem degenerates into the traditional routing problem of the Clos network. As for the flexible case, property of spectrum division multiplexing technology and bandwidth limitation of the ring based switches should be taken into consideration during allocation of the central module, such that the system throughput can be maximized. This paper presents an integer linear program (ILP) formulation as well as a heuristic algorithm we developed to solve the flexible RSA problem. We evaluate the performance of both the two spectrum allocation schemes under different traffic patterns. Our results demonstrate that, to handle uneven inter-rack traffic pattern in general data center networks, flexible spectrum allocation can lead to an increase of about 120% in system throughput, although its computational complexity is slightly higher than that of the fixed spectrum allocation scheme.

  11. Cognitive radio resource allocation based on coupled chaotic genetic algorithm

    NASA Astrophysics Data System (ADS)

    Zu, Yun-Xiao; Zhou, Jie; Zeng, Chang-Chang

    2010-11-01

    A coupled chaotic genetic algorithm for cognitive radio resource allocation which is based on genetic algorithm and coupled Logistic map is proposed. A fitness function for cognitive radio resource allocation is provided. Simulations are conducted for cognitive radio resource allocation by using the coupled chaotic genetic algorithm, simple genetic algorithm and dynamic allocation algorithm respectively. The simulation results show that, compared with simple genetic and dynamic allocation algorithm, coupled chaotic genetic algorithm reduces the total transmission power and bit error rate in cognitive radio system, and has faster convergence speed.

  12. 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...

  13. 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...

  14. 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...

  15. 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...

  16. 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...

  17. Quantum Authentication Scheme Based on Entanglement Swapping

    NASA Astrophysics Data System (ADS)

    Penghao, Niu; Yuan, Chen; Chong, Li

    2016-01-01

    Based on the entanglement swapping, a quantum authentication scheme with a trusted- party is proposed in this paper. With this scheme, two users can perform mutual identity authentication to confirm each other's validity. In addition, the scheme is proved to be secure under circumstances where a malicious attacker is capable of monitoring the classical and quantum channels and has the power to forge all information on the public channel.

  18. Staged optimization algorithms based MAC dynamic bandwidth allocation for OFDMA-PON

    NASA Astrophysics Data System (ADS)

    Liu, Yafan; Qian, Chen; Cao, Bingyao; Dun, Han; Shi, Yan; Zou, Junni; Lin, Rujian; Wang, Min

    2016-06-01

    Orthogonal frequency division multiple access passive optical network (OFDMA-PON) has being considered as a promising solution for next generation PONs due to its high spectral efficiency and flexible bandwidth allocation scheme. In order to take full advantage of these merits of OFDMA-PON, a high-efficiency medium access control (MAC) dynamic bandwidth allocation (DBA) scheme is needed. In this paper, we propose two DBA algorithms which can act on two different stages of a resource allocation process. To achieve higher bandwidth utilization and ensure the equity of ONUs, we propose a DBA algorithm based on frame structure for the stage of physical layer mapping. Targeting the global quality of service (QoS) of OFDMA-PON, we propose a full-range DBA algorithm with service level agreement (SLA) and class of service (CoS) for the stage of bandwidth allocation arbitration. The performance of the proposed MAC DBA scheme containing these two algorithms is evaluated using numerical simulations. Simulations of a 15 Gbps network with 1024 sub-carriers and 32 ONUs demonstrate the maximum network throughput of 14.87 Gbps and the maximum packet delay of 1.45 ms for the highest priority CoS under high load condition.

  19. Palmprint based multidimensional fuzzy vault scheme.

    PubMed

    Liu, Hailun; Sun, Dongmei; Xiong, Ke; Qiu, Zhengding

    2014-01-01

    Fuzzy vault scheme (FVS) is one of the most popular biometric cryptosystems for biometric template protection. However, error correcting code (ECC) proposed in FVS is not appropriate to deal with real-valued biometric intraclass variances. In this paper, we propose a multidimensional fuzzy vault scheme (MDFVS) in which a general subspace error-tolerant mechanism is designed and embedded into FVS to handle intraclass variances. Palmprint is one of the most important biometrics; to protect palmprint templates; a palmprint based MDFVS implementation is also presented. Experimental results show that the proposed scheme not only can deal with intraclass variances effectively but also could maintain the accuracy and meanwhile enhance security. PMID:24892094

  20. Signature scheme based on bilinear pairs

    NASA Astrophysics Data System (ADS)

    Tong, Rui Y.; Geng, Yong J.

    2013-03-01

    An identity-based signature scheme is proposed by using bilinear pairs technology. The scheme uses user's identity information as public key such as email address, IP address, telephone number so that it erases the cost of forming and managing public key infrastructure and avoids the problem of user private generating center generating forgery signature by using CL-PKC framework to generate user's private key.

  1. Ethical considerations surrounding survival benefit-based liver allocation.

    PubMed

    Keller, Eric J; Kwo, Paul Y; Helft, Paul R

    2014-02-01

    The disparity between the demand for and supply of donor livers has continued to grow over the last 2 decades, and this has placed greater weight on the need for efficient and effective liver allocation. Although the use of extended criteria donors has shown great potential, it remains unregulated. A survival benefit-based model was recently proposed to answer calls to increase efficiency and reduce futile transplants. However, it was previously determined that the current allocation system was not in need of modification and that instead geographic disparities should be addressed. In contrast, we believe that there is a significant need to replace the current allocation system and complement efforts to improve donor liver distribution. We illustrate this need first by identifying major ethical concerns shaping liver allocation and then by using these concerns to identify strengths and shortcomings of the Model for End-Stage Liver Disease/Pediatric End-Stage Liver Disease system and a survival benefit-based model. The latter model is a promising means of improving liver allocation: it incorporates a greater number of ethical principles, uses a sophisticated statistical model to increase efficiency and reduce waste, minimizes bias, and parallels developments in the allocation of other organs. However, it remains limited in its posttransplant predictive accuracy and may raise potential issues regarding informed consent. In addition, the proposed model fails to include quality-of-life concerns and prioritize younger patients. We feel that it is time to take the next steps toward better liver allocation not only through reductions in geographic disparities but also through the adoption of a model better equipped to balance the many ethical concerns shaping organ allocation. Thus, we support the development of a similar model with suggested amendments. PMID:24166860

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

    PubMed Central

    Srie Vidhya Janani, E.; Ganesh Kumar, P.

    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. PMID:26495417

  3. 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.

  4. 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

  5. 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.

  6. Analysis and Simulation of the Dynamic Spectrum Allocation Based on Parallel Immune Optimization in Cognitive Wireless Networks

    PubMed Central

    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. PMID:25254255

  7. 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.

  8. 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.

  9. New communication schemes based on adaptive synchronization

    NASA Astrophysics Data System (ADS)

    Yu, Wenwu; Cao, Jinde; Wong, Kwok-Wo; Lü, Jinhu

    2007-09-01

    In this paper, adaptive synchronization with unknown parameters is discussed for a unified chaotic system by using the Lyapunov method and the adaptive control approach. Some communication schemes, including chaotic masking, chaotic modulation, and chaotic shift key strategies, are then proposed based on the modified adaptive method. The transmitted signal is masked by chaotic signal or modulated into the system, which effectively blurs the constructed return map and can resist this return map attack. The driving system with unknown parameters and functions is almost completely unknown to the attackers, so it is more secure to apply this method into the communication. Finally, some simulation examples based on the proposed communication schemes and some cryptanalysis works are also given to verify the theoretical analysis in this paper.

  10. Earning points for moral behavior: organ allocation based on reciprocity.

    PubMed

    Ravelingien, An; Krom, Andre

    2005-01-01

    Anticipating the reevaluation of the Dutch organ procurement system, in late 2003 the Rathenau Institute published a study entitled 'Gift or Contribution?' In this study, the author, Govert den Hartogh, carries out a thorough moral analysis of the problem of organ shortage and fair allocation of organs. He suggests there should be a change in mentality whereby organ donation is no longer viewed in terms of charity and the volunteer spirit, but rather in terms of duty and reciprocity. The procurement and allocation of donor organs should be seen as a system of mutually assured help. Fair allocation would imply to give priority to those who recognize and comply with their duty: the registered donors. The idea of viewing organ donation as an undertaking involving mutual benefit rather than as a matter of charity, however, is not new. Notwithstanding the fact that reference to charity and altruism is not required in order for the organ donation to be of moral significance, we will argue against the reciprocity-based scenario. Steering organ allocation towards those who are themselves willing to donate organs is both an ineffective and morally questionable means of attempting to counter organ shortage.

  11. FLDA: Latent Dirichlet Allocation Based Unsteady Flow Analysis.

    PubMed

    Hong, Fan; Lai, Chufan; Guo, Hanqi; Shen, Enya; Yuan, Xiaoru; Li, Sikun

    2014-12-01

    In this paper, we present a novel feature extraction approach called FLDA for unsteady flow fields based on Latent Dirichlet allocation (LDA) model. Analogous to topic modeling in text analysis, in our approach, pathlines and features in a given flow field are defined as documents and words respectively. Flow topics are then extracted based on Latent Dirichlet allocation. Different from other feature extraction methods, our approach clusters pathlines with probabilistic assignment, and aggregates features to meaningful topics at the same time. We build a prototype system to support exploration of unsteady flow field with our proposed LDA-based method. Interactive techniques are also developed to explore the extracted topics and to gain insight from the data. We conduct case studies to demonstrate the effectiveness of our proposed approach. PMID:26356968

  12. Hierarchical dynamic allocation procedures based on modified Zelen's approach in multiregional studies with unequal allocation.

    PubMed

    Kuznetsova, Olga M; Tymofyeyev, Yevgen

    2014-01-01

    Morrissey, McEntegart, and Lang (2010) showed that in multicenter studies with equal allocation to several treatment arms, the modified Zelen's approach provides excellent within-center and across-study balance in treatment assignments. In this article, hierarchical balancing procedures for equal allocation to more than two arms (with some elements different from earlier versions) and their unequal allocation expansions that incorporate modified Zelen's approach at the center level are described. The balancing properties of the described procedures for a case study of a multiregional clinical trial with 1:2 allocation where balance within regions as well as in other covariates is required are examined through simulations.

  13. 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.

  14. 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

  15. 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. PMID:22315541

  16. Rational allocation of water resources based on ecological groundwater levels:a case study in Jinghui Irrigation District in China

    NASA Astrophysics Data System (ADS)

    Li, H.; Zhou, W. B.; Dong, Q. G.; Liu, B. Y.; Ma, C.

    2016-08-01

    Aimed at the hydrogeological environmental problems caused by over-exploitation and unreasonable utilization of water resources in Jinghui Irrigation District, this paper discusses the ecological groundwater level of the study area and establishes a three-layer optimal allocation model of water resources based on the theory of large scale systems. Then, the genetic algorithm method was employed to optimize the model and obtain the optimal allocation of crop irrigation schedule and water resources under the condition of a 75% assurance rate. Finally, the numerical simulation model of the groundwater was applied to analyze the balance of the groundwater on the basis of the optimal allocation scheme. The results show that the upper limitation of the ecological groundwater in Jinghui Irrigation District ranged from 1.8m to 4.2m, while the lower limitation level ranged from 8m to 28m. By 2020, the condition of the groundwater imbalance that results from adopting the optimal allocation scheme will be much better than that caused by current water utilization scheme. With the exception of only a few areas, the groundwater level in most parts of Jinghui Irrigation District will not exceed the lower limitation of ecological groundwater level.

  17. [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. PMID:25985685

  18. 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

  19. A weak blind signature scheme based on quantum cryptography

    NASA Astrophysics Data System (ADS)

    Wen, Xiaojun; Niu, Xiamu; Ji, Liping; Tian, Yuan

    2009-02-01

    In this paper, we present a weak blind signature scheme based on the correlation of EPR (Einstein-Padolsky-Rosen) pairs. Different from classical blind signature schemes and current quantum signature schemes, our quantum blind signature scheme could guarantee not only the unconditionally security but also the anonymity of the message owner. To achieve that, quantum key distribution and one-time pad are adopted in our scheme. Experimental analysis proved that our scheme have the characteristics of non-counterfeit, non-disavowal, blindness and traceability. It has a wide application to E-payment system, E-government, E-business, and etc.

  20. 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.

  1. 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.

  2. 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.

  3. Quantum election scheme based on anonymous quantum key distribution

    NASA Astrophysics Data System (ADS)

    Zhou, Rui-Rui; Yang, Li

    2012-08-01

    An unconditionally secure authority-certified anonymous quantum key distribution scheme using conjugate coding is presented, based on which we construct a quantum election scheme without the help of an entanglement state. We show that this election scheme ensures the completeness, soundness, privacy, eligibility, unreusability, fairness, and verifiability of a large-scale election in which the administrator and counter are semi-honest. This election scheme can work even if there exist loss and errors in quantum channels. In addition, any irregularity in this scheme is sensible.

  4. Auction-based bandwidth allocation in the Internet

    NASA Astrophysics Data System (ADS)

    Wei, Jiaolong; Zhang, Chi

    2002-07-01

    It has been widely accepted that auctioning which is the pricing approach with minimal information requirement is a proper tool to manage scare network resources. Previous works focus on Vickrey auction which is incentive compatible in classic auction theory. In the beginning of this paper, the faults of the most representative auction-based mechanisms are discussed. And then a new method called uniform-price auction (UPA), which has the simplest auction rule is proposed and it's incentive compatibility in the network environment is also proved. Finally, the basic mode is extended to support applications which require minimum bandwidth guarantees for a given time period by introducing derivative market, and a market mechanism for network resource allocation which is predictable, riskless, and simple for end-users is completed.

  5. Error function attack of chaos synchronization based encryption schemes.

    PubMed

    Wang, Xingang; Zhan, Meng; Lai, C-H; Gang, Hu

    2004-03-01

    Different chaos synchronization based encryption schemes are reviewed and compared from the practical point of view. As an efficient cryptanalysis tool for chaos encryption, a proposal based on the error function attack is presented systematically and used to evaluate system security. We define a quantitative measure (quality factor) of the effective applicability of a chaos encryption scheme, which takes into account the security, the encryption speed, and the robustness against channel noise. A comparison is made of several encryption schemes and it is found that a scheme based on one-way coupled chaotic map lattices performs outstandingly well, as judged from quality factor.

  6. A mirror based scheme of a laser projection microscope

    NASA Astrophysics Data System (ADS)

    Gubarev, F. A.; Li, Lin; Klenovskii, M. S.

    2016-04-01

    The paper discusses the design of a laser projection microscope with a mirror-based scheme of image formation. It is shown that the laser projection microscope with the mirror-based scheme of image formation is well suited for distant objects monitoring. This scheme allowed obtaining a field of view of more than 3 cm at the distance of 4 m from the brightness amplifier

  7. 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...

  8. 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.

  9. Bit-rate allocation for multiple video streams using a pricing-based mechanism.

    PubMed

    Tiwari, Mayank; Groves, Theodore; Cosman, Pamela

    2011-11-01

    We consider the problem of bit-rate allocation for multiple video users sharing a common transmission channel. Previously, overall quality of multiple users was improved by exploiting relative video complexity. Users with high-complexity video benefit at the expense of video quality reduction for other users with simpler videos. The quality of all users can be improved by collectively allocating the bit rate in a centralized fashion which requires sharing video information with a central controller. In this paper, we present an informationally decentralized bit-rate allocation for multiple users where a user only needs to inform his demand to an allocator. Each user separately calculates his bit-rate demand based on his video complexity and bit-rate price, where the bit-rate price is announced by the allocator. The allocator adjusts the bit-rate price for the next period based on the bit rate demanded by the users and the total available bit-rate supply. Simulation results show that all users improve their quality by the pricing-based decentralized bit-rate allocation method compared with their allocation when acting individually. The results of our proposed method are comparable to the centralized bit-rate allocation.

  10. 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.

  11. Recursive pump-adding scheme for optical superchannel multicasting based on FWM

    NASA Astrophysics Data System (ADS)

    Zhu, Paikun; Li, Juhao; Wu, Zhongying; Chen, Xin; Xu, Yingying; Lin, Bangjiang; Chen, Zhangyuan; He, Yongqi

    2015-07-01

    Optical superchannel multicasting, whereby a superchannel is replicated simultaneously to multiple spectral locations in a single device, is potentially a promising functionality for future optical networks. Multiple-pump four-wave mixing (FWM) in highly nonlinear fiber (HNLF) is an effective approach to implement superchannel multicasting. However, if the frequencies of the pumps are not carefully configured, the generated replicas would be spectrally scattered, which would increase the difficulty of controlling replicas' performance and managing spectral resource. In this paper, we propose a recursive pump-adding (RPA) scheme, which makes the replicas more spectrally aggregated than our previous exponentially-growing-spaced (EGS) pump scheme. Such replica aggregation technique can reduce phase mismatching of replicas remote from the original channel, which is beneficial to replicas' performance. RPA scheme also provides an additional option of replica allocation for multicasting. Based on the RPA scheme, we have experimentally demonstrated 1-to-21 superchannel multicasting with 5 pumps. More than 2.3 dB Q-factor margin is achieved across all the replicas compared with the typical 7% forward error correction (FEC) threshold. The performance comparison between RPA and EGS pump scheme is also investigated.

  12. 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.

  13. 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.

  14. 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.

  15. 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.

  16. Fully three-dimensional OSEM-based image reconstruction for Compton imaging using optimized ordering schemes

    NASA Astrophysics Data System (ADS)

    Kim, Soo Mee; Lee, Jae Sung; Lee, Chun Sik; Kim, Chan Hyeong; Lee, Myung Chul; Lee, Dong Soo; Lee, Soo-Jin

    2010-09-01

    Although the ordered subset expectation maximization (OSEM) algorithm does not converge to a true maximum likelihood solution, it is known to provide a good solution if the projections that constitute each subset are reasonably balanced. The Compton scattered data can be allocated to subsets using scattering angles (SA) or detected positions (DP) or a combination of the two (AP (angles and positions)). To construct balanced subsets, the data were first arranged using three ordering schemes: the random ordering scheme (ROS), the multilevel ordering scheme (MLS) and the weighted-distance ordering scheme (WDS). The arranged data were then split into J subsets. To compare the three ordering schemes, we calculated the coefficients of variation (CVs) of angular and positional differences between the arranged data and the percentage errors between mathematical phantoms and reconstructed images. All ordering schemes showed an order-of-magnitude acceleration over the standard EM, and their computation times were similar. The SA-based MLS and the DP-based WDS led to the best-balanced subsets (they provided the largest angular and positional differences for SA- and DP-based arrangements, respectively). The WDS exhibited minimum CVs for both the SA- and DP-based arrangements (the deviation in mean angular and positional differences between the ordered subsets was smallest). The combination of AP and WDS yielded the best results with the lowest percentage errors by providing larger and more uniform angular and positional differences for the SA and DP arrangements, and thus, is probably optimal Compton camera reconstruction using OSEM.

  17. Fully three-dimensional OSEM-based image reconstruction for Compton imaging using optimized ordering schemes.

    PubMed

    Kim, Soo Mee; Lee, Jae Sung; Lee, Chun Sik; Kim, Chan Hyeong; Lee, Myung Chul; Lee, Dong Soo; Lee, Soo-Jin

    2010-09-01

    Although the ordered subset expectation maximization (OSEM) algorithm does not converge to a true maximum likelihood solution, it is known to provide a good solution if the projections that constitute each subset are reasonably balanced. The Compton scattered data can be allocated to subsets using scattering angles (SA) or detected positions (DP) or a combination of the two (AP (angles and positions)). To construct balanced subsets, the data were first arranged using three ordering schemes: the random ordering scheme (ROS), the multilevel ordering scheme (MLS) and the weighted-distance ordering scheme (WDS). The arranged data were then split into J subsets. To compare the three ordering schemes, we calculated the coefficients of variation (CVs) of angular and positional differences between the arranged data and the percentage errors between mathematical phantoms and reconstructed images. All ordering schemes showed an order-of-magnitude acceleration over the standard EM, and their computation times were similar. The SA-based MLS and the DP-based WDS led to the best-balanced subsets (they provided the largest angular and positional differences for SA- and DP-based arrangements, respectively). The WDS exhibited minimum CVs for both the SA- and DP-based arrangements (the deviation in mean angular and positional differences between the ordered subsets was smallest). The combination of AP and WDS yielded the best results with the lowest percentage errors by providing larger and more uniform angular and positional differences for the SA and DP arrangements, and thus, is probably optimal Compton camera reconstruction using OSEM.

  18. 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…

  19. 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.

  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. Vector-quantization-based scheme for data embedding for images

    NASA Astrophysics Data System (ADS)

    Liu, Ning; Subbalakshmi, Koduvayur P.

    2004-06-01

    Today, data hiding has become more and more important in a variety of applications including security. Since Costa's work in the context of communication, the set of quantization based schemes have been proposed as one class of data hiding schemes. Most of these schemes are based on uniform scalar quantizer, which is optimal only if the host signal is uniformly distributed. In this paper, we propose pdf -matched embedding schemes, which not only consider pdf -matched quantizers, but also extend them to multiple dimensions. Specifically, our contributions to this paper are: We propose a pdf-matched embedding (PME) scheme by generalizing the probability distribution of host image and then constructing a pdf-matched quantizer as the starting point. We show experimentally that the proposed pdf-matched quantizer provides better trade-offs between distortion caused by embedding, the robustness to attacks and the embedding capacity. We extend our algorithm to embed a vector of bits in a host signal vector. We show by experiments that our scheme can be closer to the data hiding capacity by embedding larger dimension bit vectors in larger dimension VQs. Two enhancements have been proposed to our method: by vector flipping and by using distortion compensation (DC-PME), that serve to further decrease the embedding distortion. For the 1-D case, the PME scheme shows a 1 dB improvement over the QIM method in a robustness-distortion sense, while DC-PME is 1 dB better than DC-QIM and the 4-D vector quantizer based PME scheme performs about 3 dB better than the 1-D PME.

  2. Resource Allocation.

    ERIC Educational Resources Information Center

    Stennett, R. G.

    A research allocation formula employed in London, Ontario elementary schools, as well as supporting data on the method, are provided in this report. Attempts to improve on the traditional methods of resource allocation in London's schools were based on two principles: (1) that need for a particular service could and should be determined…

  3. 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.

  4. Robust Audio Watermarking Scheme Based on Deterministic Plus Stochastic Model

    NASA Astrophysics Data System (ADS)

    Dhar, Pranab Kumar; Kim, Cheol Hong; Kim, Jong-Myon

    Digital watermarking has been widely used for protecting digital contents from unauthorized duplication. This paper proposes a new watermarking scheme based on spectral modeling synthesis (SMS) for copyright protection of digital contents. SMS defines a sound as a combination of deterministic events plus a stochastic component that makes it possible for a synthesized sound to attain all of the perceptual characteristics of the original sound. In our proposed scheme, watermarks are embedded into the highest prominent peak of the magnitude spectrum of each non-overlapping frame in peak trajectories. Simulation results indicate that the proposed watermarking scheme is highly robust against various kinds of attacks such as noise addition, cropping, re-sampling, re-quantization, and MP3 compression and achieves similarity values ranging from 17 to 22. In addition, our proposed scheme achieves signal-to-noise ratio (SNR) values ranging from 29 dB to 30 dB.

  5. 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.

  6. Mesh-based enhancement schemes in diffuse optical tomography.

    PubMed

    Gu, Xuejun; Xu, Yong; Jiang, Huabei

    2003-05-01

    Two mesh-based methods including dual meshing and adaptive meshing are developed to improve the finite element-based reconstruction of both absorption and scattering images of heterogeneous turbid media. The idea of dual meshing scheme is to use a fine mesh for the solution of photon propagation and a coarse mesh for the inversion of optical property distributions. The adaptive meshing method is accomplished by the automatic mesh refinement in the region of heterogeneity during reconstruction. These schemes are validated using tissue-like phantom measurements. Our results demonstrate the capabilities of the dual meshing and adaptive meshing in both qualitative and quantitative improvement of optical image reconstruction.

  7. Antenna Allocation in MIMO Radar with Widely Separated Antennas for Multi-Target Detection

    PubMed Central

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

    2014-01-01

    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. PMID:25350505

  8. 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.

  9. MultiScheme: a parallel-processing system based on MIT (Massachusetts Institute of Technology) scheme. Doctoral thesis

    SciTech Connect

    Miller, J.S.

    1987-09-01

    MultiScheme is a fully operational parallel-programming system based upon the Scheme dialect of Lisp. Like its Lisp ancestors, MultiScheme provides a conducive environment for prototyping and testing new linguistic structures and programming methodologies. MultiScheme supports a diverse community of users who have a wide range of interests in parallel programming. MultiScheme's flexible support for system-based experiments in parallel processing has enabled it to serve as a development vehicle for university and industrial research. At the same time, MultiScheme is sufficiently robust, and supports a sufficiently wide range of parallel-processing applications, that it has become the base for a commercial product, the Butterfly Lisp System produced by BBN Advanced Computers, Inc.

  10. 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.

  11. Model-based metrics of human-automation function allocation in complex work environments

    NASA Astrophysics Data System (ADS)

    Kim, So Young

    issues with function allocation. Then, based on the eight issues, eight types of metrics are established. The purpose of these metrics is to assess the extent to which each issue exists with a given function allocation. Specifically, the eight types of metrics assess workload, coherency of a function allocation, mismatches between responsibility and authority, interruptive automation, automation boundary conditions, human adaptation to context, stability of the human's work environment, and mission performance. Finally, to validate the modeling framework and the metrics, a case study was conducted modeling four different function allocations between a pilot and flight deck automation during the arrival and approach phases of flight. A range of pilot cognitive control modes and maximum human taskload limits were also included in the model. The metrics were assessed for these four function allocations and analyzed to validate capability of the metrics to identify important issues in given function allocations. In addition, the design insights provided by the metrics are highlighted. This thesis concludes with a discussion of mechanisms for further validating the modeling framework and function allocation metrics developed here, and highlights where these developments can be applied in research and in the design of function allocations in complex work environments such as aviation operations.

  12. A novel on-board switch scheme based on OFDM

    NASA Astrophysics Data System (ADS)

    Dang, Jun-Hong; Zhou, Po; Cao, Zhi-Gang

    2009-12-01

    OFDM is a new focused technology in satellite communication. This paper proposed a novel OFDM based on-board switching technology which has high spectrum efficiency and adaptability and supports the integration of terrestrial wireless communication systems and satellite communication systems. Then it introduced a realization scheme of this technology, and proposed the main problems to be solved and the relevant solutions of them.

  13. 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.

  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.

    2016-06-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. Multifocus image fusion scheme based on nonsubsampled contourlet transform

    NASA Astrophysics Data System (ADS)

    Zhou, Xinxing; Wang, Dianhong; Duan, Zhijuan; Li, Dongming

    2011-06-01

    This paper proposes a novel multifocus image fusion scheme based on nonsubsampled contourlet transform (NSCT). The selection principles for different subband coefficients in NSCT domain are discussed in detail. In order to be consistent with the characteristics of the human visual system and improve the robustness of the fusion algorithm to the noise, the NSCT-DCT energy is first developed. Based on it, the clarity measure and bandpass energy contrast are defined and employed to motivate the pulse coupled neural networks (PCNN) for the fusion of lowpass and bandpass subbands, respectively. The performance of the proposed fusion scheme is assessed by experiments and the results demonstrate that the algorithm proposed in the paper compares favorably to wavelet-based, contourlet-based and NSCTbased fusion algorithms in terms of visual appearances and objective criterion.

  16. Rational selective exploitation and distress: employee reactions to performance-based and mobility-based reward allocations.

    PubMed

    Rusbult, C E; Campbell, M A; Price, M E

    1990-09-01

    Prior research has demonstrated that allocators frequently distribute greater rewards to persons with high professional and geographic mobility than to persons with constrained mobility, especially among the very competent. This phenomenon has been termed rational selective exploitation. Do the recipients of such allocations actually experience this distribution rule as unjust and distressing, or is it a misnomer to refer to this phenomenon as exploitation? Two studies were conducted to explore this question. Study 1 was a laboratory experiment in which we manipulated relative performance level, relative mobility level, and allocation standard: performance based versus mobility based. Study 2 was a cross-sectional survey of actual employees in which subjects reported the degree to which performance and mobility were the basis for pay decisions at their places of employment, as well as the degree to which they perceived each standard to be fair. Both studies demonstrated that people regard mobility-based allocations as less fair and more distressing than performance-based allocations. Furthermore, the degree of distress resulting from mobility-based allocations is greater among persons who are disadvantaged by that standard: among people with constrained mobility, especially those who perform at high levels. These findings provide good support for the assertion that so-called rational selective exploitation is indeed distressing to employees. Reactions to this form of distress are also explored, and the implications of these findings for the allocation process are discussed.

  17. 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.

  18. Comparing administered and market-based water allocation systems using an agent-based modeling approach

    NASA Astrophysics Data System (ADS)

    Zhao, J.; Cai, X.; Wang, Z.

    2009-12-01

    It also has been well recognized that market-based systems can have significant advantages over administered systems for water allocation. However there are not many successful water markets around the world yet and administered systems exist commonly in water allocation management practice. This paradox has been under discussion for decades and still calls for attention for both research and practice. This paper explores some insights for the paradox and tries to address why market systems have not been widely implemented for water allocation. Adopting the theory of agent-based system we develop a consistent analytical model to interpret both systems. First we derive some theorems based on the analytical model, with respect to the necessary conditions for economic efficiency of water allocation. Following that the agent-based model is used to illustrate the coherence and difference between administered and market-based systems. The two systems are compared from three aspects: 1) the driving forces acting on the system state, 2) system efficiency, and 3) equity. Regarding economic efficiency, penalty on the violation of water use permits (or rights) under an administered system can lead to system-wide economic efficiency, as well as being acceptable by some agents, which follows the theory of the so-call rational violation. Ideal equity will be realized if penalty equals incentive with an administered system and if transaction costs are zero with a market system. The performances of both agents and the over system are explained with an administered system and market system, respectively. The performances of agents are subject to different mechanisms of interactions between agents under the two systems. The system emergency (i.e., system benefit, equilibrium market price, etc), resulting from the performance at the agent level, reflects the different mechanism of the two systems, the “invisible hand” with the market system and administrative measures (penalty

  19. 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

  20. 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

  1. 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

  2. Resource management scheme based on ubiquitous data analysis.

    PubMed

    Lee, Heung Ki; Jung, Jaehee; Yi, Gangman

    2014-01-01

    Resource management of the main memory and process handler is critical to enhancing the system performance of a web server. Owing to the transaction delay time that affects incoming requests from web clients, web server systems utilize several web processes to anticipate future requests. This procedure is able to decrease the web generation time because there are enough processes to handle the incoming requests from web browsers. However, inefficient process management results in low service quality for the web server system. Proper pregenerated process mechanisms are required for dealing with the clients' requests. Unfortunately, it is difficult to predict how many requests a web server system is going to receive. If a web server system builds too many web processes, it wastes a considerable amount of memory space, and thus performance is reduced. We propose an adaptive web process manager scheme based on the analysis of web log mining. In the proposed scheme, the number of web processes is controlled through prediction of incoming requests, and accordingly, the web process management scheme consumes the least possible web transaction resources. In experiments, real web trace data were used to prove the improved performance of the proposed scheme. PMID:25197692

  3. 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.

  4. 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…

  5. 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…

  6. 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.

  7. 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.

  8. 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.

  9. 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.

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

    PubMed

    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-10-01

    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.

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

    PubMed

    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-10-01

    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

  12. 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

  13. 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.

  14. 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. PMID:25683347

  15. Image integrity authentication scheme based on fixed point theory.

    PubMed

    Li, Xu; Sun, Xingming; Liu, Quansheng

    2015-02-01

    Based on the fixed point theory, this paper proposes a new scheme for image integrity authentication, which is very different from digital signature and fragile watermarking. By the new scheme, the sender transforms an original image into a fixed point image (very close to the original one) of a well-chosen transform and sends the fixed point image (instead of the original one) to the receiver; using the same transform, the receiver checks the integrity of the received image by testing whether it is a fixed point image and locates the tampered areas if the image has been modified during the transmission. A realization of the new scheme is based on Gaussian convolution and deconvolution (GCD) transform, for which an existence theorem of fixed points is proved. The semifragility is analyzed via commutativity of transforms, and three commutativity theorems are found for the GCD transform. Three iterative algorithms are presented for finding a fixed point image with a few numbers of iterations, and for the whole procedure of image integrity authentication; a fragile authentication system and a semifragile one are separately built. Experiments show that both the systems have good performance in transparence, fragility, security, and tampering localization. In particular, the semifragile system can perfectly resist the rotation by a multiple of 90° flipping and brightness attacks.

  16. An image encryption scheme based on quantum logistic map

    NASA Astrophysics Data System (ADS)

    Akhshani, A.; Akhavan, A.; Lim, S.-C.; Hassan, Z.

    2012-12-01

    The topic of quantum chaos has begun to draw increasing attention in recent years. While a satisfactory definition for it is not settled yet in order to differentiate between its classical counterparts. Dissipative quantum maps can be characterized by sensitive dependence on initial conditions, like classical maps. Considering this property, an implementation of image encryption scheme based on the quantum logistic map is proposed. The security and performance analysis of the proposed image encryption is performed using well-known methods. The results of the reliability analysis are encouraging and it can be concluded that, the proposed scheme is efficient and secure. The results of this study also suggest application of other quantum maps such as quantum standard map and quantum baker map in cryptography and other aspects of security and privacy.

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

    PubMed

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

    1989-07-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

  18. 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.

  19. 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. PMID:27462493

  20. 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. PMID:24350272

  1. An Improved Biometrics-Based Remote User Authentication Scheme with User Anonymity

    PubMed Central

    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. PMID:24350272

  2. 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.

  3. Multi-user cognitive radio network resource allocation based on the adaptive niche immune genetic algorithm

    NASA Astrophysics Data System (ADS)

    Zu, Yun-Xiao; Zhou, Jie

    2012-01-01

    Multi-user cognitive radio network resource allocation based on the adaptive niche immune genetic algorithm is proposed, and a fitness function is provided. Simulations are conducted using the adaptive niche immune genetic algorithm, the simulated annealing algorithm, the quantum genetic algorithm and the simple genetic algorithm, respectively. The results show that the adaptive niche immune genetic algorithm performs better than the other three algorithms in terms of the multi-user cognitive radio network resource allocation, and has quick convergence speed and strong global searching capability, which effectively reduces the system power consumption and bit error rate.

  4. 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,…

  5. A generalized procedure for constructing an upwind based TVD scheme

    NASA Technical Reports Server (NTRS)

    Liou, Meng-Sing

    1987-01-01

    A generalized formulation for constructing second- and higher-order accurate TVD (total variation diminishing) schemes is presented. A given scheme is made TVD by limiting antidiffusive flux differences with some linear functions, so-called limiters. The general idea of the formulation and its mathematical proof of Harten's TVD conditions is shown by applying the Lax-Wendroff method to scalar nonlinear equations and a constant-coefficient system of conservation laws. For the system of equations, several definitions are derived for the argument used in the limiter function and present their performance in numerical experiments. The formulation is extended to the nonlinear system. It is demonstrated that the present procedure can easily convert existing central or upwind, and second- or higher-order differencing schemes to preserve monotonicity and yield physically admissible solutions. The formulation is simple mathematically as well as numerically; both matrix-vector multiplication and Riemann solver are avoided. Although the notion of TVD is based on the initial value problem, application to the steady Euler equations of the formulation is also made.

  6. 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.

  7. Outcome Based Budgeting: Connecting Budget Development, Allocation and Outcomes.

    ERIC Educational Resources Information Center

    Anderes, Thomas

    This plan for outcome-based budgeting (OBB) is the result of growing demands for increased fiscal accountability, measurable outcomes, strengthened assessment processes, and more meaningful performance indicators as mandated by many State and Federal legislators. OBB focuses on linking funding with outputs and outcomes. Higher education…

  8. Arbitrated quantum signature scheme based on reusable key

    NASA Astrophysics Data System (ADS)

    Yu, ChaoHua; Guo, GongDe; Lin, Song

    2014-11-01

    An arbitrated quantum signature scheme without using entangled states is proposed. In the scheme, by employing a classical hash function and random numbers, the secret keys of signer and receiver can be reused. It is shown that the proposed scheme is secure against several well-known attacks. Specifically, it can stand against the receiver's disavowal attack. Moreover, compared with previous relevant arbitrated quantum signature schemes, the scheme proposed has the advantage of less transmission complexity.

  9. The Kettering Diabetic Monitoring Programme: twelve months experience of an optometric practice-based scheme.

    PubMed

    Pointer, J S; Baranyovits, P; O'Malley, B P

    1998-09-01

    Over recent years the British Government has pursued a policy encouraging the integration of primary and secondary health care. This drive to promote the efficient delivery of primary care at local centres has seen the forging of co-operative alliances between various healthcare practitioners. A notable development has been the growth of optometric practice-based schemes for monitoring the eyecare of diabetic patients. This paper reports on the first twelve months operation (April 1995-March 1996, inclusive) of such a 'collaborative care' scheme operating in the Kettering Health Area of Northamptonshire. With the co-operation of their general medical practitioner (GMP) and under the case-review of the hospital-based specialist, diabetic patients attended participating optometric practices for an annual sight test and eye examination including mandatory fundus assessment under mydriasis. A brief 'ticked menu' report was subsequently forwarded to the patient's GMP for filing or action as necessary. A copy was also sent to the hospital clinic to enable updating of the diabetic patient database and for the authorisation of the supplementary fee payable to the examining optometrist. An audit of the first year of operation has indicated that those 92% of optometrists in the locality who participated in the programme logged 34% of the projected diabetic population of the Kettering Health Area. Of these individuals, 10.8% were identified as requiring referral for ophthalmological assessment, including 0.7% who needed urgent intervention. Approximately 80% of the referrals were assessed in the Ophthalmology Clinic within the twelve month timeframe of this first year audit; one-third of these patients received treatment and/or a second review over this period, the net outcome being that one-half of the original referrals were returned to the programme for continued routine annual screening. The scheme has received a funding allocation for a further financial year, with the

  10. 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.

  11. 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.

  12. Motion feature extraction scheme for content-based video retrieval

    NASA Astrophysics Data System (ADS)

    Wu, Chuan; He, Yuwen; Zhao, Li; Zhong, Yuzhuo

    2001-12-01

    This paper proposes the extraction scheme of global motion and object trajectory in a video shot for content-based video retrieval. Motion is the key feature representing temporal information of videos. And it is more objective and consistent compared to other features such as color, texture, etc. Efficient motion feature extraction is an important step for content-based video retrieval. Some approaches have been taken to extract camera motion and motion activity in video sequences. When dealing with the problem of object tracking, algorithms are always proposed on the basis of known object region in the frames. In this paper, a whole picture of the motion information in the video shot has been achieved through analyzing motion of background and foreground respectively and automatically. 6-parameter affine model is utilized as the motion model of background motion, and a fast and robust global motion estimation algorithm is developed to estimate the parameters of the motion model. The object region is obtained by means of global motion compensation between two consecutive frames. Then the center of object region is calculated and tracked to get the object motion trajectory in the video sequence. Global motion and object trajectory are described with MPEG-7 parametric motion and motion trajectory descriptors and valid similar measures are defined for the two descriptors. Experimental results indicate that our proposed scheme is reliable and efficient.

  13. Malicious attacks on media authentication schemes based on invertible watermarks

    NASA Astrophysics Data System (ADS)

    Katzenbeisser, Stefan; Dittmann, Jana

    2004-06-01

    The increasing availability and distribution of multimedia technology has made the manipulation of digital images, videos or audio files easy. While this enables numerous new applications, a certain loss of trust in digital media can be observed. In general, there is no guarantee that a digital image "does not lie", i.e., that the image content was not altered. To counteract this risk, fragile watermarks were proposed to protect the integrity of digital multimedia objects. In high security applications, it is necessary to be able to reconstruct the original object out of the watermarked version. This can be achieved by the use of invertible watermarks. While traditional watermarking schemes introduce some small non-invertible distortion in the digital content, invertible watermarks can be completely removed from a watermarked work. In the past, the security of proposed image authentication schemes based on invertible watermarks was only analyzed using ad-hoc methods and neglected the possibility of malicious attacks, which aim at engineering a fake mark so that the attacked object appears to be genuine. In this paper, we characterize and analyze possible malicious attacks against watermark-based image authentication systems and explore the theoretical limits of previous constructions with respect to their security.

  14. 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.

  15. A group signature scheme based on quantum teleportation

    NASA Astrophysics Data System (ADS)

    Wen, Xiaojun; Tian, Yuan; Ji, Liping; Niu, Xiamu

    2010-05-01

    In this paper, we present a group signature scheme using quantum teleportation. Different from classical group signature and current quantum signature schemes, which could only deliver either group signature or unconditional security, our scheme guarantees both by adopting quantum key preparation, quantum encryption algorithm and quantum teleportation. Security analysis proved that our scheme has the characteristics of group signature, non-counterfeit, non-disavowal, blindness and traceability. Our quantum group signature scheme has a foreseeable application in the e-payment system, e-government, e-business, etc.

  16. 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.

  17. 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

  18. 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.

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

    PubMed

    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.

  20. 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.

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

    PubMed

    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

  2. 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. PMID:23345091

  3. 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. PMID:23494392

  4. MIMO transmit scheme based on morphological perceptron with competitive learning.

    PubMed

    Valente, Raul Ambrozio; Abrão, Taufik

    2016-08-01

    This paper proposes a new multi-input multi-output (MIMO) transmit scheme aided by artificial neural network (ANN). The morphological perceptron with competitive learning (MP/CL) concept is deployed as a decision rule in the MIMO detection stage. The proposed MIMO transmission scheme is able to achieve double spectral efficiency; hence, in each time-slot the receiver decodes two symbols at a time instead one as Alamouti scheme. Other advantage of the proposed transmit scheme with MP/CL-aided detector is its polynomial complexity according to modulation order, while it becomes linear when the data stream length is greater than modulation order. The performance of the proposed scheme is compared to the traditional MIMO schemes, namely Alamouti scheme and maximum-likelihood MIMO (ML-MIMO) detector. Also, the proposed scheme is evaluated in a scenario with variable channel information along the frame. Numerical results have shown that the diversity gain under space-time coding Alamouti scheme is partially lost, which slightly reduces the bit-error rate (BER) performance of the proposed MP/CL-NN MIMO scheme. PMID:27135805

  5. Optimization algorithm based characterization scheme for tunable semiconductor lasers.

    PubMed

    Chen, Quanan; Liu, Gonghai; Lu, Qiaoyin; Guo, Weihua

    2016-09-01

    In this paper, an optimization algorithm based characterization scheme for tunable semiconductor lasers is proposed and demonstrated. In the process of optimization, the ratio between the power of the desired frequency and the power except of the desired frequency is used as the figure of merit, which approximately represents the side-mode suppression ratio. In practice, we use tunable optical band-pass and band-stop filters to obtain the power of the desired frequency and the power except of the desired frequency separately. With the assistance of optimization algorithms, such as the particle swarm optimization (PSO) algorithm, we can get stable operation conditions for tunable lasers at designated frequencies directly and efficiently. PMID:27607701

  6. A LAGUERRE VORONOI BASED SCHEME FOR MESHING PARTICLE SYSTEMS.

    PubMed

    Bajaj, Chandrajit

    2005-06-01

    We present Laguerre Voronoi based subdivision algorithms for the quadrilateral and hexahedral meshing of particle systems within a bounded region in two and three dimensions, respectively. Particles are smooth functions over circular or spherical domains. The algorithm first breaks the bounded region containing the particles into Voronoi cells that are then subsequently decomposed into an initial quadrilateral or an initial hexahedral scaffold conforming to individual particles. The scaffolds are subsequently refined via applications of recursive subdivision (splitting and averaging rules). Our choice of averaging rules yield a particle conforming quadrilateral/hexahedral mesh, of good quality, along with being smooth and differentiable in the limit. Extensions of the basic scheme to dynamic re-meshing in the case of addition, deletion, and moving particles are also discussed. Motivating applications of the use of these static and dynamic meshes for particle systems include the mechanics of epoxy/glass composite materials, bio-molecular force field calculations, and gas hydrodynamics simulations in cosmology.

  7. 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. PMID:15290999

  8. On the fly all-optical packet switching based on hybrid WDM/OCDMA labeling scheme

    NASA Astrophysics Data System (ADS)

    Brahmi, Houssem; Giannoulis, Giannis; Menif, Mourad; Katopodis, Vasilis; Kalavrouziotis, Dimitrios; Kouloumentas, Christos; Groumas, Panos; Kanakis, Giannis; Stamatiadis, Christos; Avramopoulos, Hercules; Erasme, Didier

    2014-02-01

    We introduce a novel design of an all-optical packet routing node that allows for the selection and forwarding of optical packets based on the routing information contained in hybrid wavelength division multiplexing/optical code division multiple access (WDM/OCDMA) labels. A stripping paradigm of optical code-label is adopted. The router is built around an optical-code gate that consists in an optical flip-flop controlled by two fiber Bragg grating correlators and is combined with a Mach-Zehnder interferometer (MZI)-based forwarding gate. We experimentally verify the proof-of-principle operation of the proposed self-routing node under NRZ and OCDMA packet traffic conditions. The successful switching of elastic NRZ payload at 40 Gb/s controlled by DS-OCDMA coded labels and the forwarding operation of encoded data using EQC codes are presented. Proper auto-correlation functions are obtained with higher than 8.1 dB contrast ratio, suitable to efficiently trigger the latching device with a contrast ratio of 11.6 dB and switching times below 3.8 ns. Error-free operation is achieved with 1.5 dB penalty for 40 Gb/s NRZ data and with 2.1 dB penalty for DS-OCDMA packets. The scheme can further be applied to large-scale optical packet switching networks by exploiting efficient optical coders allocated at different WDM channels.

  9. Allocation Variable-Based Probabilistic Algorithm to Deal with Label Switching Problem in Bayesian Mixture Models

    PubMed Central

    Pan, Jia-Chiun; Liu, Chih-Min; Hwu, Hai-Gwo; Huang, Guan-Hua

    2015-01-01

    The label switching problem occurs as a result of the nonidentifiability of posterior distribution over various permutations of component labels when using Bayesian approach to estimate parameters in mixture models. In the cases where the number of components is fixed and known, we propose a relabelling algorithm, an allocation variable-based (denoted by AVP) probabilistic relabelling approach, to deal with label switching problem. We establish a model for the posterior distribution of allocation variables with label switching phenomenon. The AVP algorithm stochastically relabel the posterior samples according to the posterior probabilities of the established model. Some existing deterministic and other probabilistic algorithms are compared with AVP algorithm in simulation studies, and the success of the proposed approach is demonstrated in simulation studies and a real dataset. PMID:26458185

  10. 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.

  11. Classification scheme of pure multipartite states based on topological phases

    NASA Astrophysics Data System (ADS)

    Johansson, Markus; Ericsson, Marie; Sjöqvist, Erik; Osterloh, Andreas

    2014-01-01

    We investigate the connection between the concept of affine balancedness (a-balancedness) introduced by M. Johansson et al. [Phys. Rev. A 85, 032112 (2012), 10.1103/PhysRevA.85.032112] and polynomial local SU invariants and the appearance of topological phases, respectively. It is found that different types of a-balancedness correspond to different types of local SU invariants analogously to how different types of balancedness, as defined by A. Osterloh and J. Siewert, [New J. Phys. 12, 075025 (2010), 10.1088/1367-2630/12/7/075025], correspond to different types of local special linear (SL) invariants. These different types of SU invariants distinguish between states exhibiting different topological phases. In the case of three qubits, the different kinds of topological phases are fully distinguished by the three-tangle together with one more invariant. Using this, we present a qualitative classification scheme based on balancedness of a state. While balancedness and local SL invariants of bidegree (2n,0) classify the SL-semistable states [A. Osterloh and J. Siewert, New J. Phys. 12, 075025 (2010), 10.1088/1367-2630/12/7/075025; O. Viehmann et al., Phys. Rev. A 83, 052330 (2011), 10.1103/PhysRevA.83.052330], a-balancedness and local SU invariants of bidegree (2n-m,m) give a more fine-grained classification. In this scheme, the a-balanced states form a bridge from the genuine entanglement of balanced states, invariant under the SL group, towards the entanglement of unbalanced states characterized by U invariants of bidegree (n,n). As a byproduct, we obtain generalizations to the W state, i.e., states that are entangled, but contain only globally distributed entanglement of parts of the system.

  12. A Quantum Multi-proxy Blind Signature Scheme Based on Genuine Four-Qubit Entangled State

    NASA Astrophysics Data System (ADS)

    Tian, Juan-Hong; Zhang, Jian-Zhong; Li, Yan-Ping

    2016-02-01

    In this paper, we propose a multi-proxy blind signature scheme based on controlled teleportation. Genuine four-qubit entangled state functions as quantum channel. The scheme uses the physical characteristics of quantum mechanics to implement delegation, signature and verification. The security analysis shows the scheme satisfies the security features of multi-proxy signature, unforgeability, undeniability, blindness and unconditional security.

  13. 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.

  14. 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. PMID:23597927

  15. 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.

  16. 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

  17. 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

  18. A malware detection scheme based on mining format information.

    PubMed

    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

  19. 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

  20. A malware detection scheme based on mining format information.

    PubMed

    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.

  1. 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

  2. Experimental quantum-cryptography scheme based on orthogonal states

    NASA Astrophysics Data System (ADS)

    Avella, Alessio; Brida, Giorgio; Degiovanni, Ivo Pietro; Genovese, Marco; Gramegna, Marco; Traina, Paolo

    2010-12-01

    Since, in general, nonorthogonal states cannot be cloned, any eavesdropping attempt in a quantum-communication scheme using nonorthogonal states as carriers of information introduces some errors in the transmission, leading to the possibility of detecting the spy. Usually, orthogonal states are not used in quantum-cryptography schemes since they can be faithfully cloned without altering the transmitted data. Nevertheless, L. Goldberg and L. Vaidman [Phys. Rev. Lett.PRLTAO0031-900710.1103/PhysRevLett.75.1239 75, 1239 (1995)] proposed a protocol in which, even if the data exchange is realized using two orthogonal states, any attempt to eavesdrop is detectable by the legal users. In this scheme the orthogonal states are superpositions of two localized wave packets traveling along separate channels. Here we present an experiment realizing this scheme.

  3. Experimental quantum-cryptography scheme based on orthogonal states

    SciTech Connect

    Avella, Alessio; Brida, Giorgio; Degiovanni, Ivo Pietro; Genovese, Marco; Gramegna, Marco; Traina, Paolo

    2010-12-15

    Since, in general, nonorthogonal states cannot be cloned, any eavesdropping attempt in a quantum-communication scheme using nonorthogonal states as carriers of information introduces some errors in the transmission, leading to the possibility of detecting the spy. Usually, orthogonal states are not used in quantum-cryptography schemes since they can be faithfully cloned without altering the transmitted data. Nevertheless, L. Goldberg and L. Vaidman [Phys. Rev. Lett. 75, 1239 (1995)] proposed a protocol in which, even if the data exchange is realized using two orthogonal states, any attempt to eavesdrop is detectable by the legal users. In this scheme the orthogonal states are superpositions of two localized wave packets traveling along separate channels. Here we present an experiment realizing this scheme.

  4. Experimental quantum cryptography scheme based on orthogonal states: preliminary results

    NASA Astrophysics Data System (ADS)

    Avella, Alessio; Brida, Giorgio; Degiovanni, Ivo P.; Genovese, Marco; Gramegna, Marco; Traina, Paolo

    2010-04-01

    Since, in general, non-orthogonal states cannot be cloned, any eavesdropping attempt in a Quantum Communication scheme using non-orthogonal states as carriers of information introduces some errors in the transmission, leading to the possibility of detecting the spy. Usually, orthogonal states are not used in Quantum Cryptography schemes since they can be faithfully cloned without altering the transmitted data. Nevertheless, L. Goldberg and L. Vaidman [Phys. Rev. Lett. 75 (7), pp. 12391243, 1995] proposed a protocol in which, even if the data exchange is realized using two orthogonal states, any attempt to eavesdrop is detectable by the legal users. In this scheme the orthogonal states are superpositions of two localized wave packets which travel along separate channels, i.e. two different paths inside a balanced Mach-Zehnder interferometer. Here we present an experiment realizing this scheme.

  5. 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.

  6. 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

  7. XFEM schemes for level set based structural optimization

    NASA Astrophysics Data System (ADS)

    Li, Li; Wang, Michael Yu; Wei, Peng

    2012-12-01

    In this paper, some elegant extended finite element method (XFEM) schemes for level set method structural optimization are proposed. Firstly, two-dimension (2D) and three-dimension (3D) XFEM schemes with partition integral method are developed and numerical examples are employed to evaluate their accuracy, which indicate that an accurate analysis result can be obtained on the structural boundary. Furthermore, the methods for improving the computational accuracy and efficiency of XFEM are studied, which include the XFEM integral scheme without quadrature sub-cells and higher order element XFEM scheme. Numerical examples show that the XFEM scheme without quadrature sub-cells can yield similar accuracy of structural analysis while prominently reducing the time cost and that higher order XFEM elements can improve the computational accuracy of structural analysis in the boundary elements, but the time cost is increasing. Therefore, the balance of time cost between FE system scale and the order of element needs to be discussed. Finally, the reliability and advantages of the proposed XFEM schemes are illustrated with several 2D and 3D mean compliance minimization examples that are widely used in the recent literature of structural topology optimization. All numerical results demonstrate that the proposed XFEM is a promising structural analysis approach for structural optimization with the level set method.

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

    PubMed

    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.

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

    PubMed

    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

  10. 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

  11. Co-allocation model for complex equipment project risk based on gray information

    NASA Astrophysics Data System (ADS)

    Zhi-geng, Fang; Jin-yu, Sun

    2013-10-01

    As the fact that complex equipment project is a multi-level co-development network system and milestones connect with each other in accordance with the logical relationship between different levels, we can decompose the complex equipment project into several multi-level milestones. This paper has designed several connecting nodes of collaborative milestone and established a new co-allocation model for complex equipment project risk based on gray information. Take comprehensive trial phase of a large aircraft developed project as an example to prove the effectiveness and feasibility of the above models and algorithms, which provides a new analysis methods and research ideas.

  12. 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. PMID:23996083

  13. 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. PMID:25663481

  14. 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.

  15. An arbitrated quantum signature scheme based on entanglement swapping with signer anonymity

    NASA Astrophysics Data System (ADS)

    Li, Wei; Fan, Ming-Yu; Wang, Guang-Wei

    2012-12-01

    In this paper an arbitrated quantum signature scheme based on entanglement swapping is proposed. In this scheme a message to be signed is coded with unitary operators. Combining quantum measurement with quantum encryption, the signer can generate the signature for a given message. Combining the entangled states generated by the TTP's Bell measurement with the signature information, the verifier can verify the authentication of a signature through a single quantum state measurement. Compared with previous schemes, our scheme is more efficient and less complex, furthermore, our scheme can ensure the anonymity of the signer.

  16. Outcome based state budget allocation for diabetes prevention programs using multi-criteria optimization with robust weights.

    PubMed

    Mehrotra, Sanjay; Kim, Kibaek

    2011-12-01

    We consider the problem of outcomes based budget allocations to chronic disease prevention programs across the United States (US) to achieve greater geographical healthcare equity. We use Diabetes Prevention and Control Programs (DPCP) by the Center for Disease Control and Prevention (CDC) as an example. We present a multi-criteria robust weighted sum model for such multi-criteria decision making in a group decision setting. The principal component analysis and an inverse linear programming techniques are presented and used to study the actual 2009 budget allocation by CDC. Our results show that the CDC budget allocation process for the DPCPs is not likely model based. In our empirical study, the relative weights for different prevalence and comorbidity factors and the corresponding budgets obtained under different weight regions are discussed. Parametric analysis suggests that money should be allocated to states to promote diabetes education and to increase patient-healthcare provider interactions to reduce disparity across the US.

  17. 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. PMID:27330910

  18. 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.

  19. 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.

  20. 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

  1. 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.

  2. 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. PMID:26226109

  3. Copyright protection scheme for still images based on an image pinned field

    NASA Astrophysics Data System (ADS)

    Lee, Mn-Ta; Chang, Hsuan T.

    2010-09-01

    Watermark embedding processes usually result in some degradation of the digital multimedia contents. Hence, they are not suitable for valuable and sensitive digital multimedia contents. Therefore, schemes combining signature with digital watermarking-like techniques have been proposed. Based on the general model for these combined schemes, a new scheme for image copyright protection by utilizing the pinned field of the protected image is proposed in this paper. The pinned field explores the texture information of the images and can be used to enhance the watermark robustness. Experimental results show that the proposed scheme works well under different signal-processing and geometric transformation attacks. On the other hand, in comparison with related schemes in the literature, our proposed scheme also has better performance. Furthermore, the proposed scheme is robust to both JPEG lossy compression and additive Gaussian noise.

  4. 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.

  5. A soft-hard combination-based cooperative spectrum sensing scheme for cognitive radio networks.

    PubMed

    Do, Nhu Tri; An, Beongku

    2015-01-01

    In this paper we propose a soft-hard combination scheme, called SHC scheme, for cooperative spectrum sensing in cognitive radio networks. The SHC scheme deploys a cluster based network in which Likelihood Ratio Test (LRT)-based soft combination is applied at each cluster, and weighted decision fusion rule-based hard combination is utilized at the fusion center. The novelties of the SHC scheme are as follows: the structure of the SHC scheme reduces the complexity of cooperative detection which is an inherent limitation of soft combination schemes. By using the LRT, we can detect primary signals in a low signal-to-noise ratio regime (around an average of -15 dB). In addition, the computational complexity of the LRT is reduced since we derive the closed-form expression of the probability density function of LRT value. The SHC scheme also takes into account the different effects of large scale fading on different users in the wide area network. The simulation results show that the SHC scheme not only provides the better sensing performance compared to the conventional hard combination schemes, but also reduces sensing overhead in terms of reporting time compared to the conventional soft combination scheme using the LRT. PMID:25688589

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

    PubMed

    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

  7. A soft-hard combination-based cooperative spectrum sensing scheme for cognitive radio networks.

    PubMed

    Do, Nhu Tri; An, Beongku

    2015-02-13

    In this paper we propose a soft-hard combination scheme, called SHC scheme, for cooperative spectrum sensing in cognitive radio networks. The SHC scheme deploys a cluster based network in which Likelihood Ratio Test (LRT)-based soft combination is applied at each cluster, and weighted decision fusion rule-based hard combination is utilized at the fusion center. The novelties of the SHC scheme are as follows: the structure of the SHC scheme reduces the complexity of cooperative detection which is an inherent limitation of soft combination schemes. By using the LRT, we can detect primary signals in a low signal-to-noise ratio regime (around an average of -15 dB). In addition, the computational complexity of the LRT is reduced since we derive the closed-form expression of the probability density function of LRT value. The SHC scheme also takes into account the different effects of large scale fading on different users in the wide area network. The simulation results show that the SHC scheme not only provides the better sensing performance compared to the conventional hard combination schemes, but also reduces sensing overhead in terms of reporting time compared to the conventional soft combination scheme using the LRT.

  8. Probability-based tampering detection scheme for digital images

    NASA Astrophysics Data System (ADS)

    Hsu, Ching-Sheng; Tu, Shu-Fen

    2010-05-01

    In recent years, digital watermarking technology has been widely used for property rights protection and integrity authentication of digital images. Image integrity authentication is usually done by a fragile watermarking scheme. When authenticating image integrity, one must extract the embedded authentication message from the image for comparison with the image feature to identify whether the image has been tampered with, and if so, locate the affected area. However, such authentication schemes may result in detection error problems. Namely, the tampered area may be misjudged as not having been tampered with, or vice versa. Hence, methods that effectively reduce errors in tampering detection have become an important research topic. This study aims to integrate a probability theory to improve image tampering detection accuracy and precision. The scheme includes two processes: the embedding of an image authentication message and tampering detection. In the image tampering detection process, in addition to identifying whether the image has been tampered with and locating the tampered area, through the authentication message embedded in the image, a probability theory is employed to improve previously obtained detection results to enhance authentication accuracy. The experimental results reveal that the proposed scheme performs well in terms of detection precision and authentication accuracy rate.

  9. 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

  10. Dynamic Allocation of SPM Based on Time-Slotted Cache Conflict Graph for System Optimization

    NASA Astrophysics Data System (ADS)

    Wu, Jianping; Ling, Ming; Zhang, Yang; Mei, Chen; Wang, Huan

    This paper proposes a novel dynamic Scratch-pad Memory allocation strategy to optimize the energy consumption of the memory sub-system. Firstly, the whole program execution process is sliced into several time slots according to the temporal dimension; thereafter, a Time-Slotted Cache Conflict Graph (TSCCG) is introduced to model the behavior of Data Cache (D-Cache) conflicts within each time slot. Then, Integer Nonlinear Programming (INP) is implemented, which can avoid time-consuming linearization process, to select the most profitable data pages. Virtual Memory System (VMS) is adopted to remap those data pages, which will cause severe Cache conflicts within a time slot, to SPM. In order to minimize the swapping overhead of dynamic SPM allocation, a novel SPM controller with a tightly coupled DMA is introduced to issue the swapping operations without CPU's intervention. Last but not the least, this paper discusses the fluctuation of system energy profit based on different MMU page size as well as the Time Slot duration quantitatively. According to our design space exploration, the proposed method can optimize all of the data segments, including global data, heap and stack data in general, and reduce the total energy consumption by 27.28% on average, up to 55.22% with a marginal performance promotion. And comparing to the conventional static CCG (Cache Conflicts Graph), our approach can obtain 24.7% energy profit on average, up to 30.5% with a sight boost in performance.

  11. Risk-based objectives for the allocation of chemical, biological, and radiological air emissions sensors.

    PubMed

    Lambert, James H; Farrington, Mark W

    2006-12-01

    This article addresses the problem of allocating devices for localized hazard protection across a region. Each identical device provides only local protection, and the devices serve localities that are exposed to nonidentical intensities of hazard. A method for seeking the optimal allocation Policy Decisions is described, highlighting the potentially competing objectives of maximizing local risk reductions and coverage risk reductions. The metric for local risk reductions is the sum of the local economic risks avoided. The metric for coverage risk reductions is adapted from the p-median problem and equal to the sum of squares of the distances from all unserved localities to their closest associated served locality. Three graphical techniques for interpreting the Policy Decisions are presented. The three linked graphical techniques are applied serially. The first technique identifies Policy Decisions that are nearly Pareto optimal. The second identifies locations where sensor placements are most justified, based on a risk-cost-benefit analysis under uncertainty. The third displays the decision space for any particular policy decision. The method is illustrated in an application to chemical, biological, and/or radiological weapon sensor placement, but has implications for disaster preparedness, transportation safety, and other arenas of public safety.

  12. 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

  13. 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.

  14. 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.

  15. 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

  16. 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.

  17. 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.

  18. High-performance CAM-based Prolog execution scheme

    NASA Astrophysics Data System (ADS)

    Ali-Yahia, Tahar; Dana, Michel

    1991-03-01

    In this paper, we present an execution scheme allowing a direct and a pipeline evaluation of a Prolog Program. The execution scheme enhances Prolog performances in interpreted mode, by means of associative processing tools embodied in Content Addressable Memories and potential parallelism existing between clauses selection, unification, and access to clause arguments. The interpretation algorithm is distributed on several processing units, which are Content Addressable Memories (CAMs). These latter are generic and reconfigurable dealing with much more Artificial Intelligence applications, through improved target languages like Prolog, Lisp, and Object oriented languages. The model has been evaluated with a functional simulator written in Le-lisp. The results show the CAMs feasibility in improving Prolog execution at performances greater than 160 KLIPS, in interpreted mode.

  19. Sparse representation-based classification scheme for motor imagery-based brain-computer interface systems

    NASA Astrophysics Data System (ADS)

    Shin, Younghak; Lee, Seungchan; Lee, Junho; Lee, Heung-No

    2012-10-01

    Motor imagery (MI)-based brain-computer interface systems (BCIs) normally use a powerful spatial filtering and classification method to maximize their performance. The common spatial pattern (CSP) algorithm is a widely used spatial filtering method for MI-based BCIs. In this work, we propose a new sparse representation-based classification (SRC) scheme for MI-based BCI applications. Sensorimotor rhythms are extracted from electroencephalograms and used for classification. The proposed SRC method utilizes the frequency band power and CSP algorithm to extract features for classification. We analyzed the performance of the new method using experimental datasets. The results showed that the SRC scheme provides highly accurate classification results, which were better than those obtained using the well-known linear discriminant analysis classification method. The enhancement of the proposed method in terms of the classification accuracy was verified using cross-validation and a statistical paired t-test (p < 0.001).

  20. 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

  1. Adaptive allocation for binary outcomes using decreasingly informative priors.

    PubMed

    Sabo, Roy T

    2014-01-01

    A method of outcome-adaptive allocation is presented using Bayes methods, where a natural lead-in is incorporated through the use of informative yet skeptical prior distributions for each treatment group. These prior distributions are modeled on unobserved data in such a way that their influence on the allocation scheme decreases as the trial progresses. Simulation studies show this method to behave comparably to the Bayesian adaptive allocation method described by Thall and Wathen (2007), who incorporate a natural lead-in through sample-size-based exponents.

  2. PDE-based Morphology for Matrix Fields: Numerical Solution Schemes

    NASA Astrophysics Data System (ADS)

    Burgeth, Bernhard; Breuß, Michael; Didas, Stephan; Weickert, Joachim

    Tensor fields are important in digital imaging and computer vision. Hence there is a demand for morphological operations to perform e.g. shape analysis, segmentation or enhancement procedures. Recently, fundamental morphological concepts have been transferred to the setting of fields of symmetric positive definite matrices, which are symmetric rank two tensors. This has been achieved by a matrix-valued extension of the nonlinear morphological partial differential equations (PDEs) for dilation and erosion known for grey scale images. Having these two basic operations at our disposal, more advanced morphological operators such as top hats or morphological derivatives for matrix fields with symmetric, positive semidefinite matrices can be constructed. The approach realises a proper coupling of the matrix channels rather than treating them independently. However, from the algorithmic side the usual scalar morphological PDEs are transport equations that require special upwind-schemes or novel high-accuracy predictor-corrector approaches for their adequate numerical treatment. In this chapter we propose the non-trivial extension of these schemes to the matrix-valued setting by exploiting the special algebraic structure available for symmetric matrices. Furthermore we compare the performance and juxtapose the results of these novel matrix-valued high-resolution-type (HRT) numerical schemes by considering top hats and morphological derivatives applied to artificial and real world data sets.

  3. 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

  4. 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.

  5. 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.

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

    NASA Astrophysics Data System (ADS)

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

    2011-04-01

    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.

  7. 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

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

    PubMed

    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

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

    SciTech Connect

    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.

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

    SciTech Connect

    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.

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

    SciTech Connect

    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.

  12. 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.

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

    SciTech Connect

    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.

  14. 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.

  15. An Experimental Communication Scheme Based on Chaotic Time-Delay System with Switched Delay

    NASA Astrophysics Data System (ADS)

    Karavaev, A. S.; Kulminskiy, D. D.; Ponomarenko, V. I.; Prokhorov, M. D.

    We develop an experimental secure communication system with chaotic switching. The proposed scheme is based on time-delayed feedback oscillator with switching of chaotic regimes. The scheme shows high tolerance to external noise and amplitude distortions of the signal in a communication channel.

  16. 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.

  17. 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.

  18. Remodulation scheme based on a two-section reflective SOA

    NASA Astrophysics Data System (ADS)

    Guiying, Jiang; Lirong, Huang

    2014-05-01

    A simple and cost-effective remodulation scheme using a two-section reflective semiconductor optical amplifier (RSOA) is proposed for a colorless optical network unit (ONU). Under proper injection currents, the front section functions as a modulator to upload the upstream signal while the rear section serves as a data eraser for efficient suppression of the downstream data. The dependences of the upstream transmission performance on the lengths and driven currents of the RSOA, the injection optical power and extinction ratio of the downstream are investigated. By optimizing these parameters, the downstream data can be more completely suppressed and the upstream transmission performance can be greatly improved.

  19. 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

  20. 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. PMID:24771484

  1. 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. PMID:23766725

  2. 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

  3. 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.

  4. 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.

  5. Simple adaptive sparse representation based classification schemes for EEG based brain-computer interface applications.

    PubMed

    Shin, Younghak; Lee, Seungchan; Ahn, Minkyu; Cho, Hohyun; Jun, Sung Chan; Lee, Heung-No

    2015-11-01

    One of the main problems related to electroencephalogram (EEG) based brain-computer interface (BCI) systems is the non-stationarity of the underlying EEG signals. This results in the deterioration of the classification performance during experimental sessions. Therefore, adaptive classification techniques are required for EEG based BCI applications. In this paper, we propose simple adaptive sparse representation based classification (SRC) schemes. Supervised and unsupervised dictionary update techniques for new test data and a dictionary modification method by using the incoherence measure of the training data are investigated. The proposed methods are very simple and additional computation for the re-training of the classifier is not needed. The proposed adaptive SRC schemes are evaluated using two BCI experimental datasets. The proposed methods are assessed by comparing classification results with the conventional SRC and other adaptive classification methods. On the basis of the results, we find that the proposed adaptive schemes show relatively improved classification accuracy as compared to conventional methods without requiring additional computation.

  6. 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.

  7. 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

  8. 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.

  9. 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.

  10. 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. PMID:25681101

  11. A Target Coverage Scheduling Scheme Based on Genetic Algorithms in Directional Sensor Networks

    PubMed Central

    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. PMID:22319387

  12. 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 ...

  13. 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...

  14. 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

  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. An ECDLP-Based Threshold Proxy Signature Scheme Using Self-Certified Public Key System

    NASA Astrophysics Data System (ADS)

    Xue, Qingshui; Li, Fengying; Zhou, Yuan; Zhang, Jiping; Cao, Zhenfu; Qian, Haifeng

    In a (t, n) threshold proxy signature scheme, one original signer delegates a group of n proxy signers to sign messages on behalf of the original signer. When the proxy signature is created, at leastt proxy signers cooperate to generate valid proxy signatures and any less than t proxy signers can’t cooperatively generate valid proxy signatures. So far, all of proposed threshold proxy signature schemes are based on public key systems with certificates, which have some disadvantages such as checking the certificate list when needing certificates. Most threshold proxy signature schemes use Shamir’s threshold secret share scheme. Identity-based public key system is not pretty mature. Self-certified public key systems have attracted more and more attention because of its advantages. Based on Hsu et al’s self-certified public key system and Li et al’s proxy signature scheme, one threshold proxy signature scheme based on ECDLP and self-certified public key system is proposed. As far as we know, it is the first scheme based on ECDLP and self-certified public key system. The proposed scheme can provide the security properties of proxy protection, verifiability, strong identifiability, strong unforgeability, strong repudiability, distinguishability, known signers and prevention of misuse of proxy signing power. That is, internal attacks, external attacks, collusion attacks, equation attacks and public key substitution attacks can be resisted. In the proxy signature verification phase, the authentication of the original and the proxy signers’ public keys and the verification of the threshold proxy signature are executed together. In addition, the computation overhead and communication cost of the proposed scheme are analyzed as well.

  17. 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

  18. A solution scheme for the Euler equations based on a multi-dimensional wave model

    NASA Technical Reports Server (NTRS)

    Powell, Kenneth G.; Barth, Timothy J.; Parpia, Ijaz H.

    1993-01-01

    A scheme for the solution of scalar advection on an unstructured mesh has been developed, tested, and extended to the Euler equations. The scheme preserves a linear function exactly, and yields nearly monotone results. The flux function associated with the Euler scheme is based on a discrete 'wave model' for the system of equations. The wave model decomposes the solution gradient at a location into shear waves, entropy waves and acoustic waves and calculates the speeds, strengths and directions associated with the waves. The approach differs from typical flux-difference splitting schemes in that the waves are not assumed to propagate normal to the faces of the control volumes; directions of propagation of the waves are instead computed from solution-gradient information. Results are shown for three test cases, and two different wave models. The results are compared to those from other approaches, including MUSCL and Galerkin least squares schemes.

  19. A numerical method for solving the Vlasov-Poisson equation based on the conservative IDO scheme

    NASA Astrophysics Data System (ADS)

    Imadera, Kenji; Kishimoto, Yasuaki; Saito, Daisuke; Li, Jiquan; Utsumi, Takayuki

    2009-12-01

    We have applied the conservative form of the Interpolated Differential Operator (IDO-CF) scheme in order to solve the Vlasov-Poisson equation, which is one of the multi-moment schemes. Through numerical tests of the nonlinear Landau damping and two-stream instability, we compared the present scheme with other schemes such as the Spline and CIP ones. We mainly investigated the conservation property of the L1-norm, energy, entropy and phase space area for each scheme, and demonstrated that the IDO-CF scheme is capable of performing stable long time scale simulation while maintaining high accuracy. The scheme is based on an Eulerian approach, and it can thus be directly used for Fokker-Planck, high dimensional Vlasov-Poisson and also guiding-center drift simulations, aiming at particular problems of plasma physics. The benchmark tests for such simulations have shown that the IDO-CF scheme is superior in keeping the conservation properties without causing serious phase error.

  20. 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. PMID:25732081

  1. 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.

  2. 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.

  3. 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

  4. 23 CFR 1240.15 - Allocations.

    Code of Federal Regulations, 2010 CFR

    2010-04-01

    ... 23 Highways 1 2010-04-01 2010-04-01 false Allocations. 1240.15 Section 1240.15 Highways NATIONAL... GUIDELINES SAFETY INCENTIVE GRANTS FOR USE OF SEAT BELTS-ALLOCATIONS BASED ON SEAT BELT USE RATES Determination of Allocations § 1240.15 Allocations. (a) Funds allocated under this part shall be available...

  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. 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.

  7. 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. PMID:25486891

  8. 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

  9. 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.

  10. 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.

  11. 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.

  12. Restoration scheme for multi-failures based on protection ring with dynamic weight in WDM networks

    NASA Astrophysics Data System (ADS)

    Huang, Hai; Zhao, Yongli; Zhang, Jie; Wang, Dajiang; Gu, Wanyi

    2011-12-01

    A novel restoration scheme for multi-failures based on protection ring with dynamic weight (PRDW) is proposed in this paper. This scheme effectively resolves the multi-failures which is in one service and the conflicts by restoration between services. PRDW use Dijkstra's algorithm to compute path and protection ring. These rings rely on protection weight which is dynamic, so that they can as much as possible to divide multi-failures to single ones. Meanwhile PRDW introduce independent protection weight to balance load, which effectively gets combat for resources less vicious. Simulation results show that PRDW works better than traditional schemes.

  13. Watermarking scheme for microlens-array-based four-dimensional light field imaging.

    PubMed

    Lu, Yucheng; You, Suping; Zhang, Wei; Yang, Bo; Peng, Runling; Zhuang, Songlin

    2016-05-01

    This paper proposes a watermark scheme for lenslet-based light field imaging operating on its 4D Fourier domain. In this scheme, the computational light field of the 2D watermark is first obtained. A slice of its frequency spectrum is then generated. After that, the watermark is embedded into the host light field by slice displacement. The experimental simulations show that the proposed scheme is simple in complexity while the robustness is strong. In addition, it does not bring significant artifacts or distortion into the refocused image or the depth map.

  14. 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

  15. 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. PMID:25873989

  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. 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. PMID:24880932

  18. A contention-based bus-control scheme for multiprocessor systems

    NASA Technical Reports Server (NTRS)

    Juang, Jie-Yong; Wah, Benjamin W.

    1991-01-01

    The authors study contention-based bus-control schemes for scheduling processors in using a bit-parallel shared bus. The protocol is designed under the requirements that each processor exhibit a random access behavior, that there be no centralized bus control in the system, and that access be granted in real time. The proposed scheme is based on splitting algorithms used in conventional contention-resolution schemes, and utilizes two-state information obtained from collision detection. Two versions of the bus-control scheme are studied. The static one resolves contentions of N requesting processors in an average of O(logW/2N) iterations, where W is the number of bits in the bit-parallel bus. An adaptive version resolves contentions in an average time that is independent of N.

  19. Cryptanalysis of Chatterjee-Sarkar Hierarchical Identity-Based Encryption Scheme at PKC 06

    NASA Astrophysics Data System (ADS)

    Park, Jong Hwan; Lee, Dong Hoon

    In 2006, Chatterjee and Sarkar proposed a hierarchical identity-based encryption (HIBE) scheme which can support an unbounded number of identity levels. This property is particularly useful in providing forward secrecy by embedding time components within hierarchical identities. In this paper we show that their scheme does not provide the claimed property. Our analysis shows that if the number of identity levels becomes larger than the value of a fixed public parameter, an unintended receiver can reconstruct a new valid ciphertext and decrypt the ciphertext using his or her own private key. The analysis is similarly applied to a multi-receiver identity-based encryption scheme presented as an application of Chatterjee and Sarkar's HIBE scheme.

  20. A GeneralizedWeight-Based Particle-In-Cell Simulation Scheme

    SciTech Connect

    W.W. Lee, T.G. Jenkins and S. Ethier

    2010-02-02

    A generalized weight-based particle simulation scheme suitable for simulating magnetized plasmas, where the zeroth-order inhomogeneity is important, is presented. The scheme is an extension of the perturbative simulation schemes developed earlier for particle-in-cell (PIC) simulations. The new scheme is designed to simulate both the perturbed distribution (δf) and the full distribution (full-F) within the same code. The development is based on the concept of multiscale expansion, which separates the scale lengths of the background inhomogeneity from those associated with the perturbed distributions. The potential advantage for such an arrangement is to minimize the particle noise by using δf in the linear stage stage of the simulation, while retaining the flexibility of a full-F capability in the fully nonlinear stage of the development when signals associated with plasma turbulence are at a much higher level than those from the intrinsic particle noise.

  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. 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.

  3. 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.

  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. PMID:24194093

  5. Efficient priority encoding transmission scheme based Wyner-Ziv coding and spatial scalability

    NASA Astrophysics Data System (ADS)

    Ramon, Marie; Coudoux, Francois-Xavier; Gazalet, Marc-Georges

    2005-07-01

    We present an original digital video transmission scheme based on Wyner-Ziv coding. The proposed scheme is derived from the previous work described in Reference4. In this case, the Forward Error Protection (FEP) scheme applies the general framework of systematic lossy source-channel coding to constitute the Wyner-Ziv description based on a coarse description of the transmitted sequence. In the present work, we propose to generate the supplementary bit stream from a low spatial resolution version of the transmitted video signal. The corresponding Wyner-Ziv description is used at the decoder in order to insure error free reconstruction of the base layer. First, we give an overview of error resilience techniques previously developed for robust video transmission. In particular, the systematic lossy error protection scheme in 4 is presented. Then the proposed transmission scheme is described. Preliminary results are finally presented in order to illustrate the interest of the proposed scheme. Further work and perspectives are also discussed.

  6. Allocation of environmental loads in recycling: a model based in the qualitative value of recycled material

    NASA Astrophysics Data System (ADS)

    Ferreira, Jose V. R.; Domingos, Idalina; Antunes, Paula

    2001-02-01

    When the life cycle of a product, material or service, studied in a Life Cycle Assessment (LCA) affect other life cycles not included in the system in analysis, it is necessary to apply allocation rules. Allocation can be defined, in LCA context, as the act of assigning the environmental loads of a system to the functions of that system in proportionate shares. Most of the available allocation methods are of generic application, they do not take into account the quality of the materials to be recycled and the few that do take it into account attribute to it a quantitative value. Methods that are both generic and scientifically correct are generally difficult to apply. Rules that are too simple for a case by case application could lead to studies of life cycle assessment that cannot be compared. This way, the best will be to dispose of simple methods but just and mathematically correct with a fundamentally driven application to a sector of economic activity. In this study a method of allocation is proposed which takes into account primarily the "qualitative" value of the material to be recycled, irrespective of being a pos-consumption product/material or a secondary material of a production process. Through a case study, the potential of application of the proposed method is demonstrated, in the recycling of products coming from wood industries and its derivatives, when compared with other allocation methods.

  7. 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.

  8. 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.

  9. 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

  10. 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…

  11. 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. PMID:27362478

  12. 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.

  13. 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.

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

    PubMed

    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.

  15. 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.

  16. 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

  17. 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. PMID:23345092

  18. Hybrid optimization schemes for simulation-based problems.

    SciTech Connect

    Fowler, Katie; Gray, Genetha Anne; Griffin, Joshua D.

    2010-05-01

    The inclusion of computer simulations in the study and design of complex engineering systems has created a need for efficient approaches to simulation-based optimization. For example, in water resources management problems, optimization problems regularly consist of objective functions and constraints that rely on output from a PDE-based simulator. Various assumptions can be made to simplify either the objective function or the physical system so that gradient-based methods apply, however the incorporation of realistic objection functions can be accomplished given the availability of derivative-free optimization methods. A wide variety of derivative-free methods exist and each method has both advantages and disadvantages. Therefore, to address such problems, we propose a hybrid approach, which allows the combining of beneficial elements of multiple methods in order to more efficiently search the design space. Specifically, in this paper, we illustrate the capabilities of two novel algorithms; one which hybridizes pattern search optimization with Gaussian Process emulation and the other which hybridizes pattern search and a genetic algorithm. We describe the hybrid methods and give some numerical results for a hydrological application which illustrate that the hybrids find an optimal solution under conditions for which traditional optimal search methods fail.

  19. A novel interacting multiple model based network intrusion detection scheme

    NASA Astrophysics Data System (ADS)

    Xin, Ruichi; Venkatasubramanian, Vijay; Leung, Henry

    2006-04-01

    In today's information age, information and network security are of primary importance to any organization. Network intrusion is a serious threat to security of computers and data networks. In internet protocol (IP) based network, intrusions originate in different kinds of packets/messages contained in the open system interconnection (OSI) layer 3 or higher layers. Network intrusion detection and prevention systems observe the layer 3 packets (or layer 4 to 7 messages) to screen for intrusions and security threats. Signature based methods use a pre-existing database that document intrusion patterns as perceived in the layer 3 to 7 protocol traffics and match the incoming traffic for potential intrusion attacks. Alternately, network traffic data can be modeled and any huge anomaly from the established traffic pattern can be detected as network intrusion. The latter method, also known as anomaly based detection is gaining popularity for its versatility in learning new patterns and discovering new attacks. It is apparent that for a reliable performance, an accurate model of the network data needs to be established. In this paper, we illustrate using collected data that network traffic is seldom stationary. We propose the use of multiple models to accurately represent the traffic data. The improvement in reliability of the proposed model is verified by measuring the detection and false alarm rates on several datasets.

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

    PubMed

    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

  1. 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

  2. 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.

  3. 45 CFR 402.31 - Determination of allocations.

    Code of Federal Regulations, 2014 CFR

    2014-10-01

    ... State Allocations § 402.31 Determination of allocations. (a) Allocation formula. Allocations will be computed according to a formula using the following factors and weights: (1) 50 percent based on the...

  4. 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.

  5. Modeling and Performance Analysis of an Improved Movement-Based Location Management Scheme for Packet-Switched Mobile Communication Systems

    PubMed Central

    Chung, Yun Won; 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. PMID:24741363

  6. Efficient and provable secure pairing-free security-mediated identity-based identification schemes.

    PubMed

    Chin, Ji-Jian; Tan, Syh-Yuan; Heng, Swee-Huay; Phan, Raphael C-W

    2014-01-01

    Security-mediated cryptography was first introduced by Boneh et al. in 2001. The main motivation behind security-mediated cryptography was the capability to allow instant revocation of a user's secret key by necessitating the cooperation of a security mediator in any given transaction. Subsequently in 2003, Boneh et al. showed how to convert a RSA-based security-mediated encryption scheme from a traditional public key setting to an identity-based one, where certificates would no longer be required. Following these two pioneering papers, other cryptographic primitives that utilize a security-mediated approach began to surface. However, the security-mediated identity-based identification scheme (SM-IBI) was not introduced until Chin et al. in 2013 with a scheme built on bilinear pairings. In this paper, we improve on the efficiency results for SM-IBI schemes by proposing two schemes that are pairing-free and are based on well-studied complexity assumptions: the RSA and discrete logarithm assumptions.

  7. Efficient and Provable Secure Pairing-Free Security-Mediated Identity-Based Identification Schemes

    PubMed Central

    Chin, Ji-Jian; Tan, Syh-Yuan; Heng, Swee-Huay; Phan, Raphael C.-W.

    2014-01-01

    Security-mediated cryptography was first introduced by Boneh et al. in 2001. The main motivation behind security-mediated cryptography was the capability to allow instant revocation of a user's secret key by necessitating the cooperation of a security mediator in any given transaction. Subsequently in 2003, Boneh et al. showed how to convert a RSA-based security-mediated encryption scheme from a traditional public key setting to an identity-based one, where certificates would no longer be required. Following these two pioneering papers, other cryptographic primitives that utilize a security-mediated approach began to surface. However, the security-mediated identity-based identification scheme (SM-IBI) was not introduced until Chin et al. in 2013 with a scheme built on bilinear pairings. In this paper, we improve on the efficiency results for SM-IBI schemes by proposing two schemes that are pairing-free and are based on well-studied complexity assumptions: the RSA and discrete logarithm assumptions. PMID:25207333

  8. Efficient and provable secure pairing-free security-mediated identity-based identification schemes.

    PubMed

    Chin, Ji-Jian; Tan, Syh-Yuan; Heng, Swee-Huay; Phan, Raphael C-W

    2014-01-01

    Security-mediated cryptography was first introduced by Boneh et al. in 2001. The main motivation behind security-mediated cryptography was the capability to allow instant revocation of a user's secret key by necessitating the cooperation of a security mediator in any given transaction. Subsequently in 2003, Boneh et al. showed how to convert a RSA-based security-mediated encryption scheme from a traditional public key setting to an identity-based one, where certificates would no longer be required. Following these two pioneering papers, other cryptographic primitives that utilize a security-mediated approach began to surface. However, the security-mediated identity-based identification scheme (SM-IBI) was not introduced until Chin et al. in 2013 with a scheme built on bilinear pairings. In this paper, we improve on the efficiency results for SM-IBI schemes by proposing two schemes that are pairing-free and are based on well-studied complexity assumptions: the RSA and discrete logarithm assumptions. PMID:25207333

  9. 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.

  10. Task discrimination from myoelectric activity: a learning scheme for EMG-based interfaces.

    PubMed

    Liarokapis, Minas V; Artemiadis, Panagiotis K; Kyriakopoulos, Kostas J

    2013-06-01

    A learning scheme based on Random Forests is used to discriminate the task to be executed using only myoelectric activity from the upper limb. Three different task features can be discriminated: subspace to move towards, object to be grasped and task to be executed (with the object). The discrimination between the different reach to grasp movements is accomplished with a random forests classifier, which is able to perform efficient features selection, helping us to reduce the number of EMG channels required for task discrimination. The proposed scheme can take advantage of both a classifier and a regressor that cooperate advantageously to split the task space, providing better estimation accuracy with task-specific EMG-based motion decoding models, as reported in [1] and [2]. The whole learning scheme can be used by a series of EMG-based interfaces, that can be found in rehabilitation cases and neural prostheses.

  11. Geometrical Positioning Schemes Based on Hybrid Lines of Position

    NASA Astrophysics Data System (ADS)

    Chen, Chien-Sheng; Lin, Jium-Ming; Liu, Wen-Hsiung; Chi, Ching-Lung

    To achieve more accurate measurements of the mobile station (MS) location, it is possible to integrate many kinds of measurements. In this paper we proposed several simpler methods that utilized time of arrival (TOA) at three base stations (BSs) and the angle of arrival (AOA) information at the serving BS to give location estimation of the MS in non-line-of-sight (NLOS) environments. From the viewpoint of geometric approach, for each a TOA value measured at any BS, one can generate a circle. Rather than applying the nonlinear circular lines of position (LOP), the proposed methods are much easier by using linear LOP to determine the MS. Numerical results demonstrate that the calculation time of using linear LOP is much less than employing circular LOP. Although the location precision of using linear LOP is only reduced slightly. However, the proposed efficient methods by using linear LOP can still provide precise solution of MS location and reduce the computational effort greatly. In addition, the proposed methods with less effort can mitigate the NLOS effect, simply by applying the weighted sum of the intersections between different linear LOP and the AOA line, without requiring priori knowledge of NLOS error statistics. Simulation results show that the proposed methods can always yield superior performance in comparison with Taylor series algorithm (TSA) and the hybrid lines of position algorithm (HLOP).

  12. Budgeting based on need: a model to determine sub-national allocation of resources for health services in Indonesia

    PubMed Central

    2012-01-01

    Background Allocating national resources to regions based on need is a key policy issue in most health systems. Many systems utilise proxy measures of need as the basis for allocation formulae. Increasingly these are underpinned by complex statistical methods to separate need from supplier induced utilisation. Assessment of need is then used to allocate existing global budgets to geographic areas. Many low and middle income countries are beginning to use formula methods for funding however these attempts are often hampered by a lack of information on utilisation, relative needs and whether the budgets allocated bear any relationship to cost. An alternative is to develop bottom-up estimates of the cost of providing for local need. This method is viable where public funding is focused on a relatively small number of targeted services. We describe a bottom-up approach to developing a formula for the allocation of resources. The method is illustrated in the context of the state minimum service package mandated to be provided by the Indonesian public health system. Methods A standardised costing methodology was developed that is sensitive to the main expected drivers of local cost variation including demographic structure, epidemiology and location. Essential package costing is often undertaken at a country level. It is less usual to utilise the methods across different parts of a country in a way that takes account of variation in population needs and location. Costing was based on best clinical practice in Indonesia and province specific data on distribution and costs of facilities. The resulting model was used to estimate essential package costs in a representative district in each province of the country. Findings Substantial differences in the costs of providing basic services ranging from USD 15 in urban Yogyakarta to USD 48 in sparsely populated North Maluku. These costs are driven largely by the structure of the population, particularly numbers of births

  13. 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-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

  14. 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.

  15. 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

  16. Planning for emission reduction credit allocation in Naval base closure and realignment actions in the San Francisco Bay region

    SciTech Connect

    Peoples, C.; Kannapel, P.; Heroy-Rogalski, K.

    1997-12-31

    Several Naval bases in the California San Francisco Bay Area are closing due to the Defense Base Closure and Realignment Acts recently passed by the US Congress. These were home to significant manufacturing and repair facilities that, when fully operating, generated over 100 tons per year of nitrogen oxide and ozone precursor compound emissions. As the bases close, these emissions are dropping, and there is an opportunity to gain credit for them through emissions banking. In order to distribute these emission reductions to meet both the needs of the government and the local redevelopment objectives, an allocation plan was developed. The allocation plan included generating emission reduction credits from the shutdown of permitted air emission sources. This paper highlights the benefits of early planning for emission reductions and subsequent allocation of those emission reductions in the case of the closure of Naval facilities in the San Francisco Bay Area. It illustrates that early planning can ensure that the needs of the military and local community are satisfied and that the highest quantity of bankable emission reductions are identified, and properly quantified and documented, and that emission reduction credits (ERCs) are generated. This paper also presents lessons learned from the experience of banking emissions from closing Navy facilities.

  17. 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). PMID:17281868

  18. 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.

  19. 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.

  20. Variance reduction for Fokker-Planck based particle Monte Carlo schemes

    NASA Astrophysics Data System (ADS)

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

    2015-08-01

    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.

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

    PubMed

    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

  2. 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

  3. 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.

  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. PMID:24493073

  5. Metro-access integrated network based on optical OFDMA with dynamic sub-carrier allocation and power distribution.

    PubMed

    Zhang, Chongfu; Zhang, Qiongli; Chen, Chen; Jiang, Ning; Liu, Deming; Qiu, Kun; Liu, Shuang; Wu, Baojian

    2013-01-28

    We propose and demonstrate a novel optical orthogonal frequency-division multiple access (OFDMA)-based metro-access integrated network with dynamic resource allocation. It consists of a single fiber OFDMA ring and many single fiber OFDMA trees, which transparently integrates metropolitan area networks with optical access networks. The single fiber OFDMA ring connects the core network and the central nodes (CNs), the CNs are on demand reconfigurable and use multiple orthogonal sub-carriers to realize parallel data transmission and dynamic resource allocation, meanwhile, they can also implement flexible power distribution. The remote nodes (RNs) distributed in the user side are connected by the single fiber OFDMA trees with the corresponding CN. The obtained results indicate that our proposed metro-access integrated network is feasible and the power distribution is agile.

  6. 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.

  7. 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

  8. Comparison of Two Multilocus Sequence Based Genotyping Schemes for Leptospira Species

    PubMed Central

    Boonsilp, Siriphan; Wuthiekanun, Vanaporn; Nalam, Kishore; Spratt, Brian G.; Aanensen, David M.; Smythe, Lee D.; Ahmed, Niyaz; Feil, Edward J.; Hartskeerl, Rudy A.; Peacock, Sharon J.

    2011-01-01

    Background Several sequence based genotyping schemes have been developed for Leptospira spp. The objective of this study was to genotype a collection of clinical and reference isolates using the two most commonly used schemes and compare and contrast the results. Methods and Findings A total of 48 isolates consisting of L. interrogans (n = 40) and L. kirschneri (n = 8) were typed by the 7 locus MLST scheme described by Thaipadungpanit et al., and the 6 locus genotyping scheme described by Ahmed et al., (termed 7L and 6L, respectively). Two L. interrogans isolates were not typed using 6L because of a deletion of three nucleotides in lipL32. The remaining 46 isolates were resolved into 21 sequence types (STs) by 7L, and 30 genotypes by 6L. Overall nucleotide diversity (based on concatenated sequence) was 3.6% and 2.3% for 7L and 6L, respectively. The D value (discriminatory ability) of 7L and 6L were comparable, i.e. 92.0 (95% CI 87.5–96.5) vs. 93.5 (95% CI 88.6–98.4). The dN/dS ratios calculated for each locus indicated that none were under positive selection. Neighbor joining trees were reconstructed based on the concatenated sequences for each scheme. Both trees showed two distinct groups corresponding to L. interrogans and L. kirschneri, and both identified two clones containing 10 and 7 clinical isolates, respectively. There were six instances in which 6L split single STs as defined by 7L into closely related clusters. We noted two discrepancies between the trees in which the genetic relatedness between two pairs of strains were more closely related by 7L than by 6L. Conclusions This genetic analysis indicates that the two schemes are comparable. We discuss their practical advantages and disadvantages. PMID:22087342

  9. 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.

  10. 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. PMID:25666924

  11. Initial Taxonomy and Classification Scheme for Artificial Space Objects Based on Ancestral Relation and Clustering

    NASA Astrophysics Data System (ADS)

    Fruh, C.; Jah, M.

    2013-09-01

    As space gets more and more populated a classification scheme based upon scientific taxonomy is needed to properly identify and discriminate space objects. An artificial space object taxonomy also allows for scientific understanding of the nature of the space object population and the processes, natural or not, that drive changes of an artificial space object class from one to another. In general, parametric and non-parametric classification schemes based upon the developed taxonomy have to be distinguished. In both cases a priori information is needed either as training data or to outline error distributions as direct input values. In this paper a classification scheme based on the ancestral-dynamic state of space objects is proposed and linked to a cluster analysis of orbital element space without a priori clustering information is provided. The cluster analysis is based on a two step approach, a first using a cluster-feature tree and secondly, a minimal euclidian tree approach. Test cases are used to show the efficiency and potential of the proposed classification scheme.

  12. A Consistency-Based Secure Localization Scheme against Wormhole Attacks in WSNs

    NASA Astrophysics Data System (ADS)

    Chen, Honglong; Lou, Wei; Wang, Zhi

    Wormhole attacks can negatively affect the localization in wireless sensor networks. A typical wormhole attack can be launched by two colluding external attackers, one of which sniffs packets at one point in the network, tunnels them through a wired or wireless link to another point, and the other of which relays them within its vicinity. In this paper, we investigate the impact of the wormhole attack on the localization process and propose a novel consistency-based secure localization scheme against wormhole attacks, which includes wormhole attack detection, valid locators identification and self-localization. We also conduct the simulations to demonstrate the effectiveness of our proposed scheme.

  13. Wavelength initialization employing wavelength recognition scheme in WDM-PON based on tunable lasers

    NASA Astrophysics Data System (ADS)

    Mun, Sil-Gu; Lee, Eun-Gu; Lee, Jong Hyun; Lee, Sang Soo; Lee, Jyung Chan

    2015-01-01

    We proposed a simple method to initialize the wavelength of tunable lasers in WDM-PON employing wavelength recognition scheme with an optical filter as a function of wavelength and accomplished plug and play operation. We also implemented a transceiver based on our proposed wavelength initialization scheme and then experimentally demonstrated the feasibility in WDM-PON configuration guaranteeing 16 channels with 100 GHz channel spacing. Our proposal is a cost-effective and easy-to-install method to realize the wavelength initialization of ONU. In addition, this method will support compatibility with all kind of tunable laser regardless of their structures and operating principles.

  14. 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.

  15. [Spatial optimum allocation of shelter-forest types in Three Gorges Reservoir Area based on multiple objective grey situation decision].

    PubMed

    Ma, Hao; Zhou, Zhi-xiang; Wang, Peng-cheng; Wu, Chang-guang; Xiao, Wen-fa

    2010-12-01

    Based on the 2007 Landsat TM images and the dominant environmental factors of shelter forest, the forest sites in the Three Gorges Reservoir Area were classified, and by using multiple objective grey situation decision model, three indices including water conservation amount, biomass, and stand productivity were selected to make the spatial optimum allocation of the present four kinds of shelter forest (coniferous forest, broadleaf forest, mixed coniferous-broadleaf forest, and shrub) in the Area. The forest sites in the Area in 2007 could be classified into 40 types, and after the optimization of spatial allocation, the proportion of coniferous forest, broadleaf forest, mixed coniferous-broadleaf forest, and shrub would be 32.55%, 29.43%, 34.95%, and 3.07%, respectively. Comparing with that before optimization, the proportion of coniferous forest and shrub after optimization was reduced by 8.79% and 28.55%, while that of broadleaf forest and mixed coniferous-broadleaf forest was increased by 10.23% and 27.11%, respectively. After the optimization of spatial allocation, the amount of water conservation, biomass, and stand productivity of the shelter forests in the area would be increased by 14.09 x 10(8) m3, 0.35 x 10(8) t, and 1.08 x 10(6) t, respectively.

  16. 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. PMID:26875078

  17. 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.

  18. 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.

  19. 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.

  20. Message Embedded Chaotic Masking Synchronization Scheme Based on the Generalized Lorenz System and Its Security Analysis

    NASA Astrophysics Data System (ADS)

    Čelikovský, Sergej; Lynnyk, Volodymyr

    This paper focuses on the design of the novel chaotic masking scheme via message embedded synchronization. A general class of the systems allowing the message embedded synchronization is presented here, moreover, it is shown that the generalized Lorenz system belongs to this class. Furthermore, the secure encryption scheme based on the message embedded synchronization is proposed. This scheme injects the embedded message into the dynamics of the transmitter as well, ensuring thereby synchronization with theoretically zero synchronization error. To ensure the security, the embedded message is a sum of the message and arbitrary bounded function of the internal transmitter states that is independent of the scalar synchronization signal. The hexadecimal alphabet will be used to form a ciphertext making chaotic dynamics of the transmitter even more complicated in comparison with the transmitter influenced just by the binary step-like function. All mentioned results and their security are tested and demonstrated by numerical experiments.

  1. 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. PMID:24921387

  2. Spherical harmonic-based finite element meshing scheme for modelling current flow within the heart.

    PubMed

    Hopenfeld, B

    2004-11-01

    The paper describes a spherical harmonic-based finite element scheme for solving Poisson-type equations throughout volumes characterised by irregularly shaped inner and outer surfaces. The inner and outer surfaces are defined by spherical harmonics, and the volume in between these surfaces is divided into nested shells that are weighted averages of the inner and outer surfaces. The resulting mesh comprises hexahedral elements, wherein each hexahedral element is defined by inner and outer shells in the radial direction and divisions in the polar and azimuthal directions. The spacing between shells can be set to any desired value. Similarly, the size of the polar and azimuthal divisions can be specified. A test of the scheme on an anisotropic sphere, meshed with 720 nodes, yielded a relative error of 0.78% on the sphere's surface. As a comparison, a previously published combined finite element/boundary element scheme with a 946-node mesh produced a corresponding error of 3.57%.

  3. 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.

  4. 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. PMID:22899887

  5. Provider payment in community-based health insurance schemes in developing countries: a systematic review

    PubMed Central

    Robyn, Paul Jacob; Sauerborn, Rainer; Bärnighausen, Till

    2013-01-01

    Objectives Community-based health insurance (CBI) is a common mechanism to generate financial resources for health care in developing countries. We review for the first time provider payment methods used in CBI in developing countries and their impact on CBI performance. Methods We conducted a systematic review of the literature on provider payment methods used by CBI in developing countries published up to January 2010. Results Information on provider payment was available for a total of 32 CBI schemes in 34 reviewed publications: 17 schemes in South Asia, 10 in sub-Saharan Africa, 4 in East Asia and 1 in Latin America. Various types of provider payment were applied by the CBI schemes: 17 used fee-for-service, 12 used salaries, 9 applied a coverage ceiling, 7 used capitation and 6 applied a co-insurance. The evidence suggests that provider payment impacts CBI performance through provider participation and support for CBI, population enrolment and patient satisfaction with CBI, quantity and quality of services provided and provider and patient retention. Lack of provider participation in designing and choosing a CBI payment method can lead to reduced provider support for the scheme. Conclusion CBI schemes in developing countries have used a wide range of provider payment methods. The existing evidence suggests that payment methods are a key determinant of CBI performance and sustainability, but the strength of this evidence is limited since it is largely based on observational studies rather than on trials or on quasi-experimental research. According to the evidence, provider payment can affect provider participation, satisfaction and retention in CBI; the quantity and quality of services provided to CBI patients; patient demand of CBI services; and population enrollment, risk pooling and financial sustainability of CBI. CBI schemes should carefully consider how their current payment methods influence their performance, how changes in the methods could improve

  6. 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.

  7. Integrated optimal allocation model for complex adaptive system of water resources management (I): Methodologies

    NASA Astrophysics Data System (ADS)

    Zhou, Yanlai; Guo, Shenglian; Xu, Chong-Yu; Liu, Dedi; Chen, Lu; Ye, Yushi

    2015-12-01

    Due to the adaption, dynamic and multi-objective characteristics of complex water resources system, it is a considerable challenge to manage water resources in an efficient, equitable and sustainable way. An integrated optimal allocation model is proposed for complex adaptive system of water resources management. The model consists of three modules: (1) an agent-based module for revealing evolution mechanism of complex adaptive system using agent-based, system dynamic and non-dominated sorting genetic algorithm II methods, (2) an optimal module for deriving decision set of water resources allocation using multi-objective genetic algorithm, and (3) a multi-objective evaluation module for evaluating the efficiency of the optimal module and selecting the optimal water resources allocation scheme using project pursuit method. This study has provided a theoretical framework for adaptive allocation, dynamic allocation and multi-objective optimization for a complex adaptive system of water resources management.

  8. 15 CFR 335.4 - Allocation.

    Code of Federal Regulations, 2010 CFR

    2010-01-01

    ... 15 Commerce and Foreign Trade 2 2010-01-01 2010-01-01 false Allocation. 335.4 Section 335.4... § 335.4 Allocation. (a) For HTS 9902.51.11 and HTS 9902.51.15 each Tariff Rate Quota will be allocated separately. Allocation will be based on an applicant's Worsted Wool Suit production, on a weighted...

  9. Mental workload prediction based on attentional resource allocation and information processing.

    PubMed

    Xiao, Xu; Wanyan, Xiaoru; Zhuang, Damin

    2015-01-01

    Mental workload is an important component in complex human-machine systems. The limited applicability of empirical workload measures produces the need for workload modeling and prediction methods. In the present study, a mental workload prediction model is built on the basis of attentional resource allocation and information processing to ensure pilots' accuracy and speed in understanding large amounts of flight information on the cockpit display interface. Validation with an empirical study of an abnormal attitude recovery task showed that this model's prediction of mental workload highly correlated with experimental results. This mental workload prediction model provides a new tool for optimizing human factors interface design and reducing human errors. PMID:26406085

  10. 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.

  11. Best tree wavelet packet transform based copyright protection scheme for digital images

    NASA Astrophysics Data System (ADS)

    Rawat, Sanjay; Raman, Balasubramanian

    2012-05-01

    In this paper, a dual watermarking scheme based on discrete wavelet transform (DWT), wavelet packet transform (WPT) with best tree, and singular value decomposition (SVD) is proposed. In our algorithm, the cover image is sub-sampled into four sub-images and then two sub-images, having the highest sum of singular values are selected. Two different gray scale images are embedded in the selected sub-images. For embedding first watermark, one of the selected sub-image is decomposed via WPT. The entropy based algorithm is adopted to find the best tree of WPT. Watermark is embedded in all frequency sub-bands of the best tree. For embedding second watermark, l-level discrete wavelet transform (DWT) is performed on the second selected sub-image. The watermark is embedded by modifying the singular values of the transformed image. To enhance the security of the scheme, Zig-Zag scan in applied on the second watermark before embedding. The robustness of the proposed scheme is demonstrated through a series of attack simulations. Experimental results demonstrate that the proposed scheme has good perceptual invisibility and is also robust against various image processing operations, geometric attacks and JPEG Compression.

  12. 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.

  13. 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. PMID:24513773

  14. 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.

  15. 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.

  16. 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.

  17. 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.

  18. 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. PMID:23553734

  19. Minimum cost maximum flow algorithm for upstream bandwidth allocation in OFDMA passive optical networks

    NASA Astrophysics Data System (ADS)

    Wu, Yating; Kuang, Bin; Wang, Tao; Zhang, Qianwu; Wang, Min

    2015-12-01

    This paper presents a minimum cost maximum flow (MCMF) based upstream bandwidth allocation algorithm, which supports differentiated QoS for orthogonal frequency division multiple access passive optical networks (OFDMA-PONs). We define a utility function as the metric to characterize the satisfaction degree of an ONU on the obtained bandwidth. The bandwidth allocation problem is then formulated as maximizing the sum of the weighted total utility functions of all ONUs. By constructing a flow network graph, we obtain the optimized bandwidth allocation using the MCMF algorithm. Simulation results show that the proposed scheme improves the performance in terms of mean packet delay, packet loss ratio and throughput.

  20. An Improved and Secure Biometric Authentication Scheme for Telecare Medicine Information Systems Based on Elliptic Curve Cryptography.

    PubMed

    Chaudhry, Shehzad Ashraf; Mahmood, Khalid; Naqvi, Husnain; Khan, Muhammad Khurram

    2015-11-01

    Telecare medicine information system (TMIS) offers the patients convenient and expedite healthcare services remotely anywhere. Patient security and privacy has emerged as key issues during remote access because of underlying open architecture. An authentication scheme can verify patient's as well as TMIS server's legitimacy during remote healthcare services. To achieve security and privacy a number of authentication schemes have been proposed. Very recently Lu et al. (J. Med. Syst. 39(3):1-8, 2015) proposed a biometric based three factor authentication scheme for TMIS to confiscate the vulnerabilities of Arshad et al.'s (J. Med. Syst. 38(12):136, 2014) scheme. Further, they emphasized the robustness of their scheme against several attacks. However, in this paper we establish that Lu et al.'s scheme is vulnerable to numerous attacks including (1) Patient anonymity violation attack, (2) Patient impersonation attack, and (3) TMIS server impersonation attack. Furthermore, their scheme does not provide patient untraceability. We then, propose an improvement of Lu et al.'s scheme. We have analyzed the security of improved scheme using popular automated tool ProVerif. The proposed scheme while retaining the plusses of Lu et al.'s scheme is also robust against known attacks.

  1. An Improved and Secure Biometric Authentication Scheme for Telecare Medicine Information Systems Based on Elliptic Curve Cryptography.

    PubMed

    Chaudhry, Shehzad Ashraf; Mahmood, Khalid; Naqvi, Husnain; Khan, Muhammad Khurram

    2015-11-01

    Telecare medicine information system (TMIS) offers the patients convenient and expedite healthcare services remotely anywhere. Patient security and privacy has emerged as key issues during remote access because of underlying open architecture. An authentication scheme can verify patient's as well as TMIS server's legitimacy during remote healthcare services. To achieve security and privacy a number of authentication schemes have been proposed. Very recently Lu et al. (J. Med. Syst. 39(3):1-8, 2015) proposed a biometric based three factor authentication scheme for TMIS to confiscate the vulnerabilities of Arshad et al.'s (J. Med. Syst. 38(12):136, 2014) scheme. Further, they emphasized the robustness of their scheme against several attacks. However, in this paper we establish that Lu et al.'s scheme is vulnerable to numerous attacks including (1) Patient anonymity violation attack, (2) Patient impersonation attack, and (3) TMIS server impersonation attack. Furthermore, their scheme does not provide patient untraceability. We then, propose an improvement of Lu et al.'s scheme. We have analyzed the security of improved scheme using popular automated tool ProVerif. The proposed scheme while retaining the plusses of Lu et al.'s scheme is also robust against known attacks. PMID:26399937

  2. A broadcast-based key agreement scheme using set reconciliation for wireless body area networks.

    PubMed

    Ali, Aftab; Khan, Farrukh Aslam

    2014-05-01

    Information and communication technologies have thrived over the last few years. Healthcare systems have also benefited from this progression. A wireless body area network (WBAN) consists of small, low-power sensors used to monitor human physiological values remotely, which enables physicians to remotely monitor the health of patients. Communication security in WBANs is essential because it involves human physiological data. Key agreement and authentication are the primary issues in the security of WBANs. To agree upon a common key, the nodes exchange information with each other using wireless communication. This information exchange process must be secure enough or the information exchange should be minimized to a certain level so that if information leak occurs, it does not affect the overall system. Most of the existing solutions for this problem exchange too much information for the sake of key agreement; getting this information is sufficient for an attacker to reproduce the key. Set reconciliation is a technique used to reconcile two similar sets held by two different hosts with minimal communication complexity. This paper presents a broadcast-based key agreement scheme using set reconciliation for secure communication in WBANs. The proposed scheme allows the neighboring nodes to agree upon a common key with the personal server (PS), generated from the electrocardiogram (EKG) feature set of the host body. Minimal information is exchanged in a broadcast manner, and even if every node is missing a different subset, by reconciling these feature sets, the whole network will still agree upon a single common key. Because of the limited information exchange, if an attacker gets the information in any way, he/she will not be able to reproduce the key. The proposed scheme mitigates replay, selective forwarding, and denial of service attacks using a challenge-response authentication mechanism. The simulation results show that the proposed scheme has a great deal of

  3. A generalized procedure for constructing an upwind-based TVD scheme

    NASA Technical Reports Server (NTRS)

    Liou, Meng-Sing

    1987-01-01

    A generalized formulation for constructing second- and higher-order accurate TVD (total variation diminishing) schemes is presented. A given scheme is made TVD by limiting antidiffusive flux differences with some nonlinear functions, so-called limiters. The general idea of the formulation and its mathematical proof of Harten's TVD conditions is shown by applying the Lax-Wendroff method to a scalar nonlinear equation and constant-coefficient system of conservation laws. For the system of equations, several definitions are derived for the argument used in the limiter function and present their performance to numerical experiments. Then the formulation is formally extended to the nonlinear system of equations. It is demonstrated that use of the present procedure allows easy conversion of existing central or upwind, and second- or higher-order differencing schemes so as to preserve monotonicity and to yield physically admissible solutions. The formulation is simple mathematically as well as numerically; neither matrix-vector multiplication nor Riemann solver is required. Roughly twice as much computational effort is needed as compared to conventional scheme. Although the notion of TVD is based on the initial value problem, application to the steady Euler equations of the formulation is also made. Numerical examples including various ranges of problems show both time- and spatial-accuracy in comparison with exact solutions.

  4. Energy-Aware Multipath Routing Scheme Based on Particle Swarm Optimization in Mobile Ad Hoc Networks.

    PubMed

    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

  5. 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

  6. 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.

  7. 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.

  8. Multifocus image fusion scheme based on the multiscale curvature in nonsubsampled contourlet transform domain

    NASA Astrophysics Data System (ADS)

    Li, Xiaosong; Li, Huafeng; Yu, Zhengtao; Kong, Yingchun

    2015-07-01

    An efficient multifocus image fusion scheme in nonsubsampled contourlet transform (NSCT) domain is proposed. Based on the property of optical imaging and the theory of defocused image, we present a selection principle for lowpass frequency coefficients and also investigate the connection between a low-frequency image and the defocused image. Generally, the NSCT algorithm decomposes detail image information indwells in different scales and different directions in the bandpass subband coefficient. In order to correctly pick out the prefused bandpass directional coefficients, we introduce multiscale curvature, which not only inherits the advantages of windows with different sizes, but also correctly recognizes the focused pixels from source images, and then develop a new fusion scheme of the bandpass subband coefficients. The fused image can be obtained by inverse NSCT with the different fused coefficients. Several multifocus image fusion methods are compared with the proposed scheme. The experimental results clearly indicate the validity and superiority of the proposed scheme in terms of both the visual qualities and the quantitative evaluation.

  9. 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

  10. Energy-Aware Multipath Routing Scheme Based on Particle Swarm Optimization in Mobile Ad Hoc Networks.

    PubMed

    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.

  11. 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-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

  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. 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.

  14. Wave-atoms-based multipurpose scheme via perceptual image hashing and watermarking.

    PubMed

    Liu, Fang; Fu, Qi-Kai; Cheng, Lee-Ming

    2012-09-20

    This paper presents a novel multipurpose scheme for content-based image authentication and copyright protection using a perceptual image hashing and watermarking strategy based on a wave atom transform. The wave atom transform is expected to outperform other transforms because it gains sparser expansion and better representation for texture than other traditional transforms, such as wavelet and curvelet transforms. Images are decomposed into multiscale bands with a number of tilings using the wave atom transform. Perceptual hashes are then extracted from the features of tiling in the third scale band for the purpose of content-based authentication; simultaneously, part of the selected hashes are designed as watermarks, which are embedded into the original images for the purpose of copyright protection. The experimental results demonstrate that the proposed scheme shows great performance in content-based authentication by distinguishing the maliciously attacked images from the nonmaliciously attacked images. Moreover, watermarks extracted from the proposed scheme also achieve high robustness against common malicious and nonmalicious image-processing attacks, which provides excellent copyright protection for images.

  15. A Parallel Reconstruction Scheme in Fluorescence Tomography Based on Contrast of Independent Inversed Absorption Properties

    PubMed Central

    Yi, Ji; Bai, Jing

    2006-01-01

    Based on an independent forward model in fluorescent tomography, a parallel reconstructed scheme for inhomogeneous mediums with unknown absorption property is proposed in this paper. The method considers the two diffusion equations as separately describing the propagation of excited light in tissues with and without fluorescent probes inside. Then the concentration of fluorophores is obtained directly through the difference between two estimations of absorption coefficient which can be parallel inversed. In this way, the multiparameter estimation problem in fluorescent tomography is transformed into two independent single-coefficient determined schemes of diffusion optical tomography (DOT). Any algorithms proved to be efficient and effective in DOT can be directly applied here. In this study the absorption property is estimated from the independent diffusion equations by a gradient-based optimization method with finite element method (FEM) solving the forward model. Simulation results of three representative occasions show that the reconstructed method can well estimate fluorescent property and tissue absorption distribution. PMID:23165045

  16. Image communication scheme based on dynamic visual cryptography and computer generated holography

    NASA Astrophysics Data System (ADS)

    Palevicius, Paulius; Ragulskis, Minvydas

    2015-01-01

    Computer generated holograms are often exploited to implement optical encryption schemes. This paper proposes the integration of dynamic visual cryptography (an optical technique based on the interplay of visual cryptography and time-averaging geometric moiré) with Gerchberg-Saxton algorithm. A stochastic moiré grating is used to embed the secret into a single cover image. The secret can be visually decoded by a naked eye if only the amplitude of harmonic oscillations corresponds to an accurately preselected value. The proposed visual image encryption scheme is based on computer generated holography, optical time-averaging moiré and principles of dynamic visual cryptography. Dynamic visual cryptography is used both for the initial encryption of the secret image and for the final decryption. Phase data of the encrypted image are computed by using Gerchberg-Saxton algorithm. The optical image is decrypted using the computationally reconstructed field of amplitudes.

  17. 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.

  18. 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.

  19. 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. PMID:25900328

  20. 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

  1. 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.

  2. 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.

  3. 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-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

  4. 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.

  5. A novel codification scheme based on the "VITAL" and "DICOM" Standards for telemedicine applications.

    PubMed

    Anagnostaki, Anthoula P; Pavlopoulos, Sotiris; Kyriakou, Efthivoulos; Koutsouris, Dimitris

    2002-12-01

    The field of interest discussed in this study is a novel codification scheme for (vital signs) medical device communication and patient monitoring data interchange, into the context of effective home care service provisioning. With medical technology having developed in isolation and major manufacturers developing their own proprietary communication protocols, which preclude connection to devices from different manufacturers, and with healthcare trends having evolved, pointing to primary care, telecare and home care monitoring, there is an increasing need for technical standardization in healthcare environments and the development of protocols that enable communication in a structured and open way. In this study, a novel codification scheme has been developed, based on two healthcare informatics standards, the VITAL and DICOM Sup. 30, in addressing the robust interchange of waveform and medical data for a home care application. Based on this scheme, we created a real-time facility, consisting of a base unit and a telemedicine (mobile) unit, that enables home telemonitoring, by installing the telemedicine unit at the patient's home while the base unit remains at the physician's office or hospital. The system allows the transmission of vital biosignals (3-lead ECG, pulse rate, blood pressure and SpO2) of the patient. This paper presents an object-oriented design with unified modeling language (UML) of a class hierarchy for exchanging the acquired medical data and performing alert management, and investigates the applicability of the proposed scheme into a commercial patient-connected medical device, thus addressing service and functionality requirements with focus on home-care applications. The system has been validated for technical performance over several telecommunication means and for clinical validity via real patient-involved pilot trials. PMID:12542235

  6. 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.

  7. 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. PMID:27106584

  8. 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.

  9. 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-01

    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. PMID:25458734

  10. 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

  11. Efficient conservative ADER schemes based on WENO reconstruction and space-time predictor in primitive variables

    NASA Astrophysics Data System (ADS)

    Zanotti, Olindo; Dumbser, Michael

    2016-01-01

    schemes provide less oscillatory solutions when compared to ADER finite volume schemes based on the reconstruction in conserved variables, especially for the RMHD and the Baer-Nunziato equations. For the RHD and RMHD equations, the overall accuracy is improved and the CPU time is reduced by about 25 %. Because of its increased accuracy and due to the reduced computational cost, we recommend to use this version of ADER as the standard one in the relativistic framework. At the end of the paper, the new approach has also been extended to ADER-DG schemes on space-time adaptive grids (AMR).

  12. 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.

  13. 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. PMID:25940194

  14. Novel image encryption scheme based on Chebyshev polynomial and Duffing map.

    PubMed

    Stoyanov, Borislav; Kordov, Krasimir

    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 10(113) key space and desirable level of security based on the good statistical results and theoretical arguments. PMID:25143970

  15. 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

  16. 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.

  17. 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

  18. A QR Code Based Zero-Watermarking Scheme for Authentication of Medical Images in Teleradiology Cloud

    PubMed Central

    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. PMID:23970943

  19. 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.

  20. 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

  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. 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.

  3. 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. PMID:25152923

  4. 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. PMID:23970943

  5. 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.

  6. 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.

  7. Efficient alignment scheme for zone-plates-based transmission soft X-ray microscope

    NASA Astrophysics Data System (ADS)

    Lim, Jun; Shin, Hyun-Joon; Hong, Chung Ki

    2010-12-01

    Alignment and operation of a zone-plate (ZP)-based transmission soft X-ray microscope (TXM) is difficult and time consuming, especially when the TXM has no dedicated X-ray source. We introduce here an efficient TXM alignment scheme. The TXM employed is a simple in-situ-experiment-capable setup. It includes ultrahigh-vacuum (UHV)-compatible conflat flanges and is mountable in tandem with any soft X-ray synchrotron radiation beamlines. Obtaining zeroth- and first-order diffracted (condenser-zone-plate [CZP]-focused) beams simultaneously by means of the objective zone plate (OZP) is the most essential step in the alignment scheme. We were able to acquire, in one hour at a radiation wavelength of 2.49 nm, an image of 50 nm spatial resolution.

  8. 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.

  9. Secure bidirectional transmission in a WDM-PON architecture employing RSOA-based remodulation scheme

    NASA Astrophysics Data System (ADS)

    Das, Anindya S.; Patra, Ardhendu S.

    2015-01-01

    A novel architecture of bidirectional wavelength division multiplexed passive optical network (WDM-PON), based on forward error correcting (FEC) scheme, has been proposed and analyzed theoretically. This configuration is made economical by employing injection locked Fabry-Perot laser diode (FPLD) for direct modulation at transmitter end and reflective semiconductor optical amplifier (RSOA) as remodulator at receiver end. Reed-Solomon (RS) codec is preferred in the design to comprehend the FEC scheme. The RS (255, 251) codec is realized by field-programmablegate- array (FPGA) with the help of VERILOG programming. Excellent transmission performances of 10 Gbps datasignal over maximum of 20 km SMF in downlink and uplink are obtained by the low bit error rate (BER) values and significant eye diagrams at BER analyzer.

  10. 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.

  11. ‘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.

  12. A Review on Successive Interference Cancellation Scheme Based on Optical CDMA Network

    NASA Astrophysics Data System (ADS)

    Alsowaidi, N.; Eltaif, T.; Mokhtar, M. R.

    2014-12-01

    Due to various desirable features of optical code division multiple access (OCDMA), it is believed this technique once developed and commercially available will be an integral part of optical access networks. Optical CDMA system suffers from a problem called multiple access interference (MAI) which limits the number of active users, it occurs when number of active users share the same carriers. The aim of this paper is to review successive interference cancellation (SIC) scheme based on optical CDMA system. The paper also reviews the system performance in presence of shot noise, thermal noise, and phase-induced intensity noise (PIIN). A comprehensive review on the mathematical model of SIC scheme using direct detection (DS) and spectral amplitude coding (SAC) were presented in this article.

  13. 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.

  14. A Rate Feedback Predictive Control Scheme Based on Neural Network and Control Theory for Autonomic Communication

    NASA Astrophysics Data System (ADS)

    Xiong, Naixue; Vasilakos, Athanasios V.; Yang, Laurence T.; Long, Fei; Shu, Lei; Li, Yingshu

    The main difficulty arising in designing an efficient congestion control scheme lies in the large propagation delay in data transfer which usually leads to a mismatch between the network resources and the amount of admitted traffic. To attack this problem, this chapter describes a novel congestion control scheme that is based on a Back Propagation (BP) neural network technique.We consider a general computer communication model with multiple sources and one destination node. The dynamic buffer occupancy of the bottleneck node is predicted and controlled by using a BP neural network. The controlled best-effort traffic of the sources uses the bandwidth, which is left over by the guaranteed traffic. This control mechanism is shown to be able to avoid network congestion efficiently and to optimize the transfer performance both by the theoretic analyzing procedures and by the simulation studies.

  15. 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).

  16. High capacity data hiding scheme based on (7, 4) Hamming code.

    PubMed

    Cao, Zekun; Yin, Zhaoxia; Hu, Honghe; Gao, Xiangping; Wang, Liangmin

    2016-01-01

    Aiming to embed large amount of data while minimize the sum of costs of all changed pixels, a novel high capacity data hiding scheme based on (7, 4) Hamming code is realized by a family of algorithms. Firstly, n (n = 1, 2, 3) cover pixels are assigned to one set according to the payload. Then, 128 binary strings of length seven are divided into eight sets according to the syndrome of every binary string. Binary strings that share the same syndrome are classified into one set. Finally, a binary string in a certain set determined by the data to be embedded is chosen to modify some of the least significant bits of the n cover pixels. The experimental results demonstrate that the image quality of the proposed method with high embedding payload is superior to those of the related schemes. PMID:27026872

  17. 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.

  18. ‘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.

  19. Informatics-Based Energy Fitting Scheme for Correlation Energy at Complete Basis Set Limit.

    PubMed

    Seino, Junji; Nakai, Hiromi

    2016-09-30

    Energy fitting schemes based on informatics techniques using hierarchical basis sets with small cardinal numbers were numerically investigated to estimate correlation energies at the complete basis set limits. Numerical validations confirmed that the conventional two-point extrapolation models can be unified into a simple formula with optimal parameters obtained by the same test sets. The extrapolation model was extended to two-point fitting models by a relaxation of the relationship between the extrapolation coefficients or a change of the fitting formula. Furthermore, n-scheme fitting models were developed by the combinations of results calculated at several theory levels and basis sets to compensate for the deficiencies in the fitting model at one level of theory. Systematic assessments on the Gaussian-3X and Gaussian-2 sets revealed that the fitting models drastically reduced errors with equal or smaller computational effort. © 2016 Wiley Periodicals, Inc. PMID:27454327

  20. 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.

  1. 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.

  2. A novel fully automatic scheme for fiducial marker-based alignment in electron tomography.

    PubMed

    Han, Renmin; Wang, Liansan; Liu, Zhiyong; Sun, Fei; Zhang, Fa

    2015-12-01

    Although the topic of fiducial marker-based alignment in electron tomography (ET) has been widely discussed for decades, alignment without human intervention remains a difficult problem. Specifically, the emergence of subtomogram averaging has increased the demand for batch processing during tomographic reconstruction; fully automatic fiducial marker-based alignment is the main technique in this process. However, the lack of an accurate method for detecting and tracking fiducial markers precludes fully automatic alignment. In this paper, we present a novel, fully automatic alignment scheme for ET. Our scheme has two main contributions: First, we present a series of algorithms to ensure a high recognition rate and precise localization during the detection of fiducial markers. Our proposed solution reduces fiducial marker detection to a sampling and classification problem and further introduces an algorithm to solve the parameter dependence of marker diameter and marker number. Second, we propose a novel algorithm to solve the tracking of fiducial markers by reducing the tracking problem to an incomplete point set registration problem. Because a global optimization of a point set registration occurs, the result of our tracking is independent of the initial image position in the tilt series, allowing for the robust tracking of fiducial markers without pre-alignment. The experimental results indicate that our method can achieve an accurate tracking, almost identical to the current best one in IMOD with half automatic scheme. Furthermore, our scheme is fully automatic, depends on fewer parameters (only requires a gross value of the marker diameter) and does not require any manual interaction, providing the possibility of automatic batch processing of electron tomographic reconstruction.

  3. 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.

  4. 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. PMID:27588254

  5. 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.

  6. 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-08-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.

  7. 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. PMID:17509705

  8. 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.

  9. A theory-based evaluation of a community-based funding scheme in a disadvantaged suburban city area.

    PubMed

    Hickey, Gráinne; McGilloway, Sinead; O'Brien, Morgan; Leckey, Yvonne; Devlin, Maurice

    2015-10-01

    Community-driven development (CDD) initiatives frequently involve funding schemes which are aimed at channelling financial investment into local need and fostering community participation and engagement. This exploratory study examined, through a program theory approach, the design and implementation of a small-scale, community-based fund in Ireland. Observations, documentary analysis, interviews and group discussions with 19 participants were utilized to develop a detailed understanding of the program mechanisms, activities and processes, as well as the experiences of key stakeholders engaged with the funding scheme and its implementation. The findings showed that there were positive perceptions of the scheme and its function within the community. Overall, the availability of funding was perceived by key stakeholders as being beneficial. However, there were concerns over the accessibility of the scheme for more marginalized members of the community, as well as dissatisfaction with the openness and transparency surrounding funding eligibility. Lessons for the implementation of small-scale CDD funds are elaborated and the utility of program theory approaches for evaluators and planners working with programs that fund community-based initiatives is outlined.

  10. A theory-based evaluation of a community-based funding scheme in a disadvantaged suburban city area.

    PubMed

    Hickey, Gráinne; McGilloway, Sinead; O'Brien, Morgan; Leckey, Yvonne; Devlin, Maurice

    2015-10-01

    Community-driven development (CDD) initiatives frequently involve funding schemes which are aimed at channelling financial investment into local need and fostering community participation and engagement. This exploratory study examined, through a program theory approach, the design and implementation of a small-scale, community-based fund in Ireland. Observations, documentary analysis, interviews and group discussions with 19 participants were utilized to develop a detailed understanding of the program mechanisms, activities and processes, as well as the experiences of key stakeholders engaged with the funding scheme and its implementation. The findings showed that there were positive perceptions of the scheme and its function within the community. Overall, the availability of funding was perceived by key stakeholders as being beneficial. However, there were concerns over the accessibility of the scheme for more marginalized members of the community, as well as dissatisfaction with the openness and transparency surrounding funding eligibility. Lessons for the implementation of small-scale CDD funds are elaborated and the utility of program theory approaches for evaluators and planners working with programs that fund community-based initiatives is outlined. PMID:25933408

  11. A New Image Encryption Scheme Based on Dynamic S-Boxes and Chaotic Maps

    NASA Astrophysics Data System (ADS)

    Rehman, Atique Ur; Khan, Jan Sher; Ahmad, Jawad; Hwang, Soeng Oun

    2016-03-01

    Substitution box is a unique and nonlinear core component of block ciphers. A better designing technique of substitution box can boost up the quality of ciphertexts. In this paper, a new encryption method based on dynamic substitution boxes is proposed via using two chaotic maps. To break the correlation in an original image, pixels values of the original plaintext image are permuted row- and column-wise through random sequences. The aforementioned random sequences are generated by 2-D Burgers chaotic map. For the generation of dynamic substitution boxes, Logistic chaotic map is employed. In the process of diffusion, the permuted image is divided into blocks and each block is substituted via different dynamic substitution boxes. In contrast to conventional encryption schemes, the proposed scheme does not undergo the fixed block cipher and hence the security level can be enhanced. Extensive security analysis including histogram test is applied on the proposed image encryption technique. All experimental results reveal that the proposed scheme has a high level of security and robustness for transmission of digital images on insecure communication channels.

  12. 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

  13. 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.

  14. A Trust-Based Adaptive Probability Marking and Storage Traceback Scheme for WSNs.

    PubMed

    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

  15. 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.

  16. 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%.

  17. 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.

  18. 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.

  19. 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. PMID:26743628

  20. 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-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

  1. 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.

  2. 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

  3. 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. PMID:23045714

  4. 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.

  5. 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

  6. 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

  7. 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.

  8. 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

  9. 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-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

  10. Edge-guided filtering scheme for decomposition-based tone mapping

    NASA Astrophysics Data System (ADS)

    Wu, Xuebiao; Su, Zhuo; Luo, Xiaonan

    2014-01-01

    This paper presents a novel edge-guided filtering scheme for decomposition-based tone mapping, whose superiority is to prevent two major defects in filter-driven multi-scale decomposition: halo artifact and over-smoothing distortion. First, we calculate an edge-preserving smoothing by gradient domain reconstruction with given edges. Then we apply this output in high dynamic range tone mapping to address aforementioned problems. At last, some experimental results are presented to demonstrate the effectiveness of our method in producing high-quality low dynamic range outputs.

  11. Fountain code-based error control scheme for dimmable visible light communication systems

    NASA Astrophysics Data System (ADS)

    Feng, Lifang; Hu, Rose Qingyang; Wang, Jianping; Xu, Peng

    2015-07-01

    In this paper, a novel error control scheme using Fountain codes is proposed in on-off keying (OOK) based visible light communications (VLC) systems. By using Fountain codes, feedback information is needed to be sent back to the transmitter only when transmitted messages are successfully recovered. Therefore improved transmission efficiency, reduced protocol complexity and relative little wireless link-layer delay are gained. By employing scrambling techniques and complementing symbols, the least complemented symbols are needed to support arbitrary dimming target values, and the value of entropy of encoded message are increased.

  12. Cryptanalysis of a novel image encryption scheme based on improved hyperchaotic sequences

    NASA Astrophysics Data System (ADS)

    Özkaynak, Fatih; Özer, Ahmet Bedri; Yavuz, Sırma

    2012-11-01

    Chaotic cryptography is a new field that has seen a significant amount of research activity during the last 20 years. Despite the many proposals that use various methods in the design of encryption algorithms, there is a definite need for a mathematically rigorous cryptanalysis of these designs. In this study, we analyze the security weaknesses of the "C. Zhu, A novel image encryption scheme based on improved hyperchaotic sequences, Optics Communications 285 (2012) 29-37". By applying chosen plaintext attacks, we show that all the secret parameters can be revealed.

  13. 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

  14. Integrating cavity based gas cells: a multibeam compensation scheme for pathlength variation.

    PubMed

    Bergin, S; Hodgkinson, J; Francis, D; Tatam, R P

    2016-06-13

    We present a four beam ratiometric setup for an integrating sphere based gas cell, which can correct for changes in pathlength due to sphere wall contamination. This allows for the gas absorption coefficient to be determined continuously without needing to recalibrate the setup. We demonstrate the technique experimentally, measuring methane gas at 1651nm. For example, contamination covering 1.2% of the sphere wall resulted in an uncompensated error in gas absorption coefficient of ≈41%. With the ratiometric scheme, this error was reduced to ≈2%. Potential limitations of the technique, due to subsequent deviations from mathematical assumptions are discussed, including severe sphere window contamination. PMID:27410380

  15. 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. PMID:25978373

  16. 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.

  17. 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

  18. Robust wavelet-based video watermarking scheme for copyright protection using the human visual system

    NASA Astrophysics Data System (ADS)

    Preda, Radu O.; Vizireanu, Dragos Nicolae

    2011-01-01

    The development of the information technology and computer networks facilitates easy duplication, manipulation, and distribution of digital data. Digital watermarking is one of the proposed solutions for effectively safeguarding the rightful ownership of digital images and video. We propose a public digital watermarking technique for video copyright protection in the discrete wavelet transform domain. The scheme uses binary images as watermarks. These are embedded in the detail wavelet coefficients of the middle wavelet subbands. The method is a combination of spread spectrum and quantization-based watermarking. Every bit of the watermark is spread over a number of wavelet coefficients with the use of a secret key by means of quantization. The selected wavelet detail coefficients from different subbands are quantized using an optimal quantization model, based on the characteristics of the human visual system (HVS). Our HVS-based scheme is compared to a non-HVS approach. The resilience of the watermarking algorithm is tested against a series of different spatial, temporal, and compression attacks. To improve the robustness of the algorithm, we use error correction codes and embed the watermark with spatial and temporal redundancy. The proposed method achieves a good perceptual quality and high resistance to a large spectrum of attacks.

  19. Wavelet-based ECG data compression system with linear quality control scheme.

    PubMed

    Ku, Cheng-Tung; Hung, King-Chu; Wu, Tsung-Ching; Wang, Huan-Sheng

    2010-06-01

    Maintaining reconstructed signals at a desired level of quality is crucial for lossy ECG data compression. Wavelet-based approaches using a recursive decomposition process are unsuitable for real-time ECG signal recoding and commonly obtain a nonlinear compression performance with distortion sensitive to quantization error. The sensitive response is caused without compromising the influences of word-length-growth (WLG) effect and unfavorable for the reconstruction quality control of ECG data compression. In this paper, the 1-D reversible round-off nonrecursive discrete periodic wavelet transform is applied to overcome the WLG magnification effect in terms of the mechanisms of error propagation resistance and significant normalization of octave coefficients. The two mechanisms enable the design of a multivariable quantization scheme that can obtain a compression performance with the approximate characteristics of linear distortion. The quantization scheme can be controlled with a single control variable. Based on the linear compression performance, a linear quantization scale prediction model is presented for guaranteeing reconstruction quality. Following the use of the MIT-BIH arrhythmia database, the experimental results show that the proposed system, with lower computational complexity, can obtain much better reconstruction quality control than other wavelet-based methods.

  20. 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.

  1. Design of an image encryption scheme based on a multiple chaotic map

    NASA Astrophysics Data System (ADS)

    Tong, Xiao-Jun

    2013-07-01

    In order to solve the problem that chaos is degenerated in limited computer precision and Cat map is the small key space, this paper presents a chaotic map based on topological conjugacy and the chaotic characteristics are proved by Devaney definition. In order to produce a large key space, a Cat map named block Cat map is also designed for permutation process based on multiple-dimensional chaotic maps. The image encryption algorithm is based on permutation-substitution, and each key is controlled by different chaotic maps. The entropy analysis, differential analysis, weak-keys analysis, statistical analysis, cipher random analysis, and cipher sensibility analysis depending on key and plaintext are introduced to test the security of the new image encryption scheme. Through the comparison to the proposed scheme with AES, DES and Logistic encryption methods, we come to the conclusion that the image encryption method solves the problem of low precision of one dimensional chaotic function and has higher speed and higher security.

  2. 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.

  3. Critical issues for high-power FEL based on microtron recuperator/electron out-coupling scheme

    NASA Astrophysics Data System (ADS)

    Vinokurov, Nikolai A.; Zholents, Alexander A.; Fawley, William M.; Kim, Kwang J.

    1997-05-01

    The FELs based on the rf accelerator-recuperator and the electron outcoupling is promising for obtaining average output power of hundreds of kilowatts. We present basic considerations for the system stability and performance optimization for this scheme.

  4. Optimization of reference library used in content-based medical image retrieval scheme.

    PubMed

    Park, Sang Cheol; Sukthankar, Rahul; Mummert, Lily; Satyanarayanan, Mahadev; Zheng, Bin

    2007-11-01

    Building an optimal image reference library is a critical step in developing the interactive computer-aided detection and diagnosis (I-CAD) systems of medical images using content-based image retrieval (CBIR) schemes. In this study, the authors conducted two experiments to investigate (1) the relationship between I-CAD performance and size of reference library and (2) a new reference selection strategy to optimize the library and improve I-CAD performance. The authors assembled a reference library that includes 3153 regions of interest (ROI) depicting either malignant masses (1592) or CAD-cued false-positive regions (1561) and an independent testing data set including 200 masses and 200 false-positive regions. A CBIR scheme using a distance-weighted K-nearest neighbor algorithm is applied to retrieve references that are considered similar to the testing sample from the library. The area under receiver operating characteristic curve (Az) is used as an index to evaluate the I-CAD performance. In the first experiment, the authors systematically increased reference library size and tested I-CAD performance. The result indicates that scheme performance improves initially from Az= 0.715 to 0.874 and then plateaus when the library size reaches approximately half of its maximum capacity. In the second experiment, based on the hypothesis that a ROI should be removed if it performs poorly compared to a group of similar ROIs in a large and diverse reference library, the authors applied a new strategy to identify "poorly effective" references. By removing 174 identified ROIs from the reference library, I-CAD performance significantly increases to Az = 0.914 (p < 0.01). The study demonstrates that increasing reference library size and removing poorly effective references can significantly improve I-CAD performance.

  5. Evaluating statistical cloud schemes: What can we gain from ground-based remote sensing?

    NASA Astrophysics Data System (ADS)

    Grützun, V.; Quaas, J.; Morcrette, C. J.; Ament, F.

    2013-09-01

    Statistical cloud schemes with prognostic probability distribution functions have become more important in atmospheric modeling, especially since they are in principle scale adaptive and capture cloud physics in more detail. While in theory the schemes have a great potential, their accuracy is still questionable. High-resolution three-dimensional observational data of water vapor and cloud water, which could be used for testing them, are missing. We explore the potential of ground-based remote sensing such as lidar, microwave, and radar to evaluate prognostic distribution moments using the "perfect model approach." This means that we employ a high-resolution weather model as virtual reality and retrieve full three-dimensional atmospheric quantities and virtual ground-based observations. We then use statistics from the virtual observation to validate the modeled 3-D statistics. Since the data are entirely consistent, any discrepancy occurring is due to the method. Focusing on total water mixing ratio, we find that the mean ratio can be evaluated decently but that it strongly depends on the meteorological conditions as to whether the variance and skewness are reliable. Using some simple schematic description of different synoptic conditions, we show how statistics obtained from point or line measurements can be poor at representing the full three-dimensional distribution of water in the atmosphere. We argue that a careful analysis of measurement data and detailed knowledge of the meteorological situation is necessary to judge whether we can use the data for an evaluation of higher moments of the humidity distribution used by a statistical cloud scheme.

  6. 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.

  7. Assessing DRG cost accounting with respect to resource allocation and tariff calculation: the case of Germany.

    PubMed

    Vogl, Matthias

    2012-01-01

    The purpose of this paper is to analyze the German diagnosis related groups (G-DRG) cost accounting scheme by assessing its resource allocation at hospital level and its tariff calculation at national level. First, the paper reviews and assesses the three steps in the G-DRG resource allocation scheme at hospital level: (1) the groundwork; (2) cost-center accounting; and (3) patient-level costing. Second, the paper reviews and assesses the three steps in G-DRG national tariff calculation: (1) plausibility checks; (2) inlier calculation; and (3) the "one hospital" approach. The assessment is based on the two main goals of G-DRG introduction: improving transparency and efficiency. A further empirical assessment attests high costing quality. The G-DRG cost accounting scheme shows high system quality in resource allocation at hospital level, with limitations concerning a managerially relevant full cost approach and limitations in terms of advanced activity-based costing at patient-level. However, the scheme has serious flaws in national tariff calculation: inlier calculation is normative, and the "one hospital" model causes cost bias, adjustment and representativeness issues. The G-DRG system was designed for reimbursement calculation, but developed to a standard with strategic management implications, generalized by the idea of adapting a hospital's cost structures to DRG revenues. This combination causes problems in actual hospital financing, although resource allocation is advanced at hospital level. PMID:22935314

  8. Assessing DRG cost accounting with respect to resource allocation and tariff calculation: the case of Germany.

    PubMed

    Vogl, Matthias

    2012-08-30

    The purpose of this paper is to analyze the German diagnosis related groups (G-DRG) cost accounting scheme by assessing its resource allocation at hospital level and its tariff calculation at national level. First, the paper reviews and assesses the three steps in the G-DRG resource allocation scheme at hospital level: (1) the groundwork; (2) cost-center accounting; and (3) patient-level costing. Second, the paper reviews and assesses the three steps in G-DRG national tariff calculation: (1) plausibility checks; (2) inlier calculation; and (3) the "one hospital" approach. The assessment is based on the two main goals of G-DRG introduction: improving transparency and efficiency. A further empirical assessment attests high costing quality. The G-DRG cost accounting scheme shows high system quality in resource allocation at hospital level, with limitations concerning a managerially relevant full cost approach and limitations in terms of advanced activity-based costing at patient-level. However, the scheme has serious flaws in national tariff calculation: inlier calculation is normative, and the "one hospital" model causes cost bias, adjustment and representativeness issues. The G-DRG system was designed for reimbursement calculation, but developed to a standard with strategic management implications, generalized by the idea of adapting a hospital's cost structures to DRG revenues. This combination causes problems in actual hospital financing, although resource allocation is advanced at hospital level.

  9. Assessing DRG cost accounting with respect to resource allocation and tariff calculation: the case of Germany

    PubMed Central

    2012-01-01

    The purpose of this paper is to analyze the German diagnosis related groups (G-DRG) cost accounting scheme by assessing its resource allocation at hospital level and its tariff calculation at national level. First, the paper reviews and assesses the three steps in the G-DRG resource allocation scheme at hospital level: (1) the groundwork; (2) cost-center accounting; and (3) patient-level costing. Second, the paper reviews and assesses the three steps in G-DRG national tariff calculation: (1) plausibility checks; (2) inlier calculation; and (3) the “one hospital” approach. The assessment is based on the two main goals of G-DRG introduction: improving transparency and efficiency. A further empirical assessment attests high costing quality. The G-DRG cost accounting scheme shows high system quality in resource allocation at hospital level, with limitations concerning a managerially relevant full cost approach and limitations in terms of advanced activity-based costing at patient-level. However, the scheme has serious flaws in national tariff calculation: inlier calculation is normative, and the “one hospital” model causes cost bias, adjustment and representativeness issues. The G-DRG system was designed for reimbursement calculation, but developed to a standard with strategic management implications, generalized by the idea of adapting a hospital’s cost structures to DRG revenues. This combination causes problems in actual hospital financing, although resource allocation is advanced at hospital level. PMID:22935314

  10. 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.

  11. 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.

  12. 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. PMID:26709702

  13. 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.

  14. 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

  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. 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

  17. EEG Classification for Hybrid Brain-Computer Interface Using a Tensor Based Multiclass Multimodal Analysis Scheme.

    PubMed

    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

  18. Suboptimal schemes for atmospheric data assimilation based on the Kalman filter

    NASA Technical Reports Server (NTRS)

    Todling, Ricardo; Cohn, Stephen E.

    1994-01-01

    This work is directed toward approximating the evolution of forecast error covariances for data assimilation. The performance of different algorithms based on simplification of the standard Kalman filter (KF) is studied. These are suboptimal schemes (SOSs) when compared to the KF, which is optimal for linear problems with known statistics. The SOSs considered here are several versions of optimal interpolation (OI), a scheme for height error variance advection, and a simplified KF in which the full height error covariance is advected. To employ a methodology for exact comparison among these schemes, a linear environment is maintained, in which a beta-plane shallow-water model linearized about a constant zonal flow is chosen for the test-bed dynamics. The results show that constructing dynamically balanced forecast error covariances rather than using conventional geostrophically balanced ones is essential for successful performance of any SOS. A posteriori initialization of SOSs to compensate for model - data imbalance sometimes results in poor performance. Instead, properly constructed dynamically balanced forecast error covariances eliminate the need for initialization. When the SOSs studied here make use of dynamically balanced forecast error covariances, the difference among their performances progresses naturally from conventional OI to the KF. In fact, the results suggest that even modest enhancements of OI, such as including an approximate dynamical equation for height error variances while leaving height error correlation structure homogeneous, go a long way toward achieving the performance of the KF, provided that dynamically balanced cross-covariances are constructed and that model errors are accounted for properly. The results indicate that such enhancements are necessary if unconventional data are to have a positive impact.

  19. 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

  20. A community-based feasibility study of National Health Insurance Scheme in Ghana.

    PubMed

    Edoh, Dominic; Brenya, Ampofo

    2002-01-01

    In a community based study at Legon in 1997, a valuation method was used to assess the willingness of students on study leave to pay a percentage premium of their income towards a National Health Insurance Scheme (NHIS). Thirty-five percent of the respondents were aged 30-40 years, 97% were males, 45% were resident in Accra, 17% in Kumasi and 12% in Cape Coast. Respondents were 84% in formal public employment with 44% majority as teachers. Their monthly income was distributed as 33% earned below currency 200,000, 50% between currency 200,000-currency 400,000 and 7% above currency 400,000. More than 74% were willing to contribute to the scheme with 38% and 37% willing to pay 1% and 2 of their income as monthly premium respectively. Those willing to pay 2% premium, 14 (n=33) earned below currency 200,000, 18 (n=50) between currency 200,000-currency 400,000, and 5 (n=17) above currency 400,000. Malaria was the commonest disease with 86% incidence, however 30%of respondents revealed they did not spend money on hospital services except 39% who spent currency 20,000-currency 100,000 on hospital laboratory services. Over 65% of respondents indicated they self financed their health expenditure. The premium level was found to be influenced positively by financier, sex, age, income, and negatively by health expenditure, but not occupation. In an elite community with inadequate infrastructure and water supply problems but probably with better personal hygiene and sanitation, although respondents hardly spend on health services they were willing to contribute 2% of their incomes as premium towards an insurance scheme.

  1. Experimental demonstration and devices optimization of NRZ-DPSK amplitude regeneration scheme based on SOAs.

    PubMed

    Cao, Tong; Chen, Liao; Yu, Yu; Zhang, Xinliang

    2014-12-29

    We propose and experimentally demonstrate a novel scheme which can simultaneously realize wavelength-preserving and phase-preserving amplitude noise compression of a 40 Gb/s distorted non-return-to-zero differential-phase-shift keying (NRZ-DPSK) signal. In the scheme, two semiconductor optical amplifiers (SOAs) are exploited. The first one (SOA1) is used to generate the inverted signal based on SOA's transient cross-phase modulation (T-XPM) effect and the second one (SOA2) to regenerate the distorted NRZ-DPSK signal using SOA's cross-gain compression (XGC) effect. In the experiment, the bit error ratio (BER) measurements show that power penalties of constructive and destructive demodulation at BER of 10-9 are -1.75 and -1.01 dB, respectively. As the nonlinear effects and the requirements of the two SOAs are completely different, quantum-well (QW) structures has been separately optimized. A complicated theoretical model by combining QW band structure calculation with SOA's dynamic model is exploited to optimize the SOAs, in which both interband effect (carrier density variation) and intraband effect (carrier temperature variation) are taken into account. Regarding SOA1, we choose the tensile strained QW structure and large optical confinement factor to enhance the T-XPM effect. Regarding SOA2, the compressively strained QW structure is selected to reduce the impact of excess phase noise induced by amplitude fluctuations. Exploiting the optimized QW SOAs, better amplitude regeneration performance is demonstrated successfully through numerical simulation. The proposed scheme is intrinsically stable comparing with the interferometer structure and can be integrated on a chip, making it a practical candidate for all-optical amplitude regeneration of high-speed NRZ-DPSK signal. PMID:25607178

  2. Exploring a Model of Study Time Allocation in a Problem-Based Medical Curriculum.

    ERIC Educational Resources Information Center

    Gijselaers, Wim H.; Schmidt, Henk G.

    A study was done of the relation of time for individual study versus instruction time in a non-traditional, problem-based medical curriculum at the University of Limburg (Netherlands). The study collected data on 86 courses conducted in 5 consecutive academic years. In this problem-based approach, each curriculum year in the first 4 years…

  3. A multilevel region-of-interest based rate control scheme for video communication

    NASA Astrophysics Data System (ADS)

    Zhou, QiLui; Liu, Jiaying; Guo, Zongming

    2009-10-01

    The ROI based video coding is widely applied in video communication. In this paper, we propose a multilevel ROI model, which includes the eye-mouth core region (CR), the face profile region (PR), the edge region (ER) and the background region (BR), to classify the subjective importance level of regions for the scene. Taking account of the proposed model, we first segment the current frame into four regions through skin color detection and feature location. Then, we improve the rate control algorithm in JVT-G012 proposal. We consider two factors, including subjective factor by our multi-level ROI model and objective factor by direct difference from reference frame, to model the complexity weight of each macroblock (MB).We allocate resources both at the frame layer and the basic unit layer, and adjust QP at MB layer. Finally, we restrict the QP of MB with three strategies to maintain the spatial and temporal smoothness. The experimental results illustrate that PSNR of ROI (CR plus PR) area using proposed method is in average over 0.5dB higher than JM8.6, while there are only slight changes in the PSNR of whole frame between two methods. Subjective quality based on our method also achieves much better performance.

  4. A New Cooperative MIMO Scheme Based on SM for Energy-Efficiency Improvement in Wireless Sensor Network

    PubMed Central

    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. PMID:24707224

  5. 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.

  6. 40 CFR 74.26 - Allocation formula.

    Code of Federal Regulations, 2010 CFR

    2010-07-01

    ...) SULFUR DIOXIDE OPT-INS Allowance Calculations for Combustion Sources § 74.26 Allocation formula. (a) The Administrator will calculate the annual allowance allocation for a combustion source based on the data... 40 Protection of Environment 16 2010-07-01 2010-07-01 false Allocation formula. 74.26 Section...

  7. 39 CFR 3060.12 - Asset allocation.

    Code of Federal Regulations, 2010 CFR

    2010-07-01

    ... 39 Postal Service 1 2010-07-01 2010-07-01 false Asset allocation. 3060.12 Section 3060.12 Postal... COMPETITIVE PRODUCTS ENTERPRISE § 3060.12 Asset allocation. Within 6 months of January 23, 2009, and for each... competitive products enterprise using a method of allocation based on appropriate revenue or cost...

  8. SVM-based spectrum mobility prediction scheme in mobile cognitive radio networks.

    PubMed

    Wang, Yao; Zhang, Zhongzhao; Ma, Lin; Chen, Jiamei

    2014-01-01

    Spectrum mobility as an essential issue has not been fully investigated in mobile cognitive radio networks (CRNs). In this paper, a novel support vector machine based spectrum mobility prediction (SVM-SMP) scheme is presented considering time-varying and space-varying characteristics simultaneously in mobile CRNs. The mobility of cognitive users (CUs) and the working activities of primary users (PUs) are analyzed in theory. And a joint feature vector extraction (JFVE) method is proposed based on the theoretical analysis. Then spectrum mobility prediction is executed through the classification of SVM with a fast convergence speed. Numerical results validate that SVM-SMP gains better short-time prediction accuracy rate and miss prediction rate performance than the two algorithms just depending on the location and speed information. Additionally, a rational parameter design can remedy the prediction performance degradation caused by high speed SUs with strong randomness movements. PMID:25143975

  9. 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).

  10. SVM-Based Spectrum Mobility Prediction Scheme in Mobile Cognitive Radio Networks

    PubMed Central

    Zhang, Zhongzhao; Ma, Lin; Chen, Jiamei

    2014-01-01

    Spectrum mobility as an essential issue has not been fully investigated in mobile cognitive radio networks (CRNs). In this paper, a novel support vector machine based spectrum mobility prediction (SVM-SMP) scheme is presented considering time-varying and space-varying characteristics simultaneously in mobile CRNs. The mobility of cognitive users (CUs) and the working activities of primary users (PUs) are analyzed in theory. And a joint feature vector extraction (JFVE) method is proposed based on the theoretical analysis. Then spectrum mobility prediction is executed through the classification of SVM with a fast convergence speed. Numerical results validate that SVM-SMP gains better short-time prediction accuracy rate and miss prediction rate performance than the two algorithms just depending on the location and speed information. Additionally, a rational parameter design can remedy the prediction performance degradation caused by high speed SUs with strong randomness movements. PMID:25143975

  11. P-bRS: a physarum-based routing scheme for wireless sensor networks.

    PubMed

    Zhang, Mingchuan; Wei, Wangyang; Zheng, Ruijuan; Wu, Qingtao

    2014-01-01

    Routing in wireless sensor networks (WSNs) is an extremely challenging issue due to the features of WSNs. Inspired by the large and single-celled amoeboid organism, slime mold Physarum polycephalum, we establish a novel selecting next hop model (SNH). Based on this model, we present a novel Physarum-based routing scheme (P-bRS) for WSNs to balance routing efficiency and energy equilibrium. In P-bRS, a sensor node can choose the proper next hop by using SNH which comprehensively considers the distance, energy residue, and location of the next hop. The simulation results show how P-bRS can achieve the effective trade-off between routing efficiency and energy equilibrium compared to two famous algorithms. PMID:24672326

  12. P-bRS: A Physarum-Based Routing Scheme for Wireless Sensor Networks

    PubMed Central

    Wei, Wangyang; Zheng, Ruijuan; Wu, Qingtao

    2014-01-01

    Routing in wireless sensor networks (WSNs) is an extremely challenging issue due to the features of WSNs. Inspired by the large and single-celled amoeboid organism, slime mold Physarum polycephalum, we establish a novel selecting next hop model (SNH). Based on this model, we present a novel Physarum-based routing scheme (P-bRS) for WSNs to balance routing efficiency and energy equilibrium. In P-bRS, a sensor node can choose the proper next hop by using SNH which comprehensively considers the distance, energy residue, and location of the next hop. The simulation results show how P-bRS can achieve the effective trade-off between routing efficiency and energy equilibrium compared to two famous algorithms. PMID:24672326

  13. 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.

  14. 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.

  15. 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.

  16. 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.

  17. Artificial neural network based fault identification scheme implementation for a three-phase induction motor.

    PubMed

    Kolla, Sri R; Altman, Shawn D

    2007-04-01

    This paper presents results from the implementation and testing of a PC based monitoring and fault identification scheme for a three-phase induction motor using artificial neural networks (ANNs). To accomplish the task, a hardware system is designed and built to acquire three-phase voltages and currents from a 1/3 HP squirrel-cage, three-phase induction motor. A software program is written to read the voltages and currents, which are first used to train a feed-forward neural network structure using the JavaNNS program. The trained network is placed in a LabVIEW based program formula node that monitors the voltages and currents online and displays the fault conditions and turns the motor off. The complete system is successfully tested in real time by creating different faults on the motor.

  18. 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.

  19. 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.

  20. 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.

  1. 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. PMID:17993161

  2. A Wireless Sensor Network Based Personnel Positioning Scheme in Coal Mines with Blind Areas

    PubMed Central

    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. PMID:22163446

  3. A fully automated scheme for mammographic segmentation and classification based on breast density and asymmetry.

    PubMed

    Tzikopoulos, Stylianos D; Mavroforakis, Michael E; Georgiou, Harris V; Dimitropoulos, Nikos; Theodoridis, Sergios

    2011-04-01

    This paper presents a fully automated segmentation and classification scheme for mammograms, based on breast density estimation and detection of asymmetry. First, image preprocessing and segmentation techniques are applied, including a breast boundary extraction algorithm and an improved version of a pectoral muscle segmentation scheme. Features for breast density categorization are extracted, including a new fractal dimension-related feature, and support vector machines (SVMs) are employed for classification, achieving accuracy of up to 85.7%. Most of these properties are used to extract a new set of statistical features for each breast; the differences among these feature values from the two images of each pair of mammograms are used to detect breast asymmetry, using an one-class SVM classifier, which resulted in a success rate of 84.47%. This composite methodology has been applied to the miniMIAS database, consisting of 322 (MLO) mammograms -including 15 asymmetric pairs of images-, obtained via a (noisy) digitization procedure. The results were evaluated by expert radiologists and are very promising, showing equal or higher success rates compared to other related works, despite the fact that some of them used only selected portions of this specific mammographic database. In contrast, our methodology is applied to the complete miniMIAS database and it exhibits the reliability that is normally required for clinical use in CAD systems. PMID:21306782

  4. 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.

  5. 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.

  6. 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.

  7. 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…

  8. New classification scheme for ozone monitoring stations based on frequency distribution of hourly data.

    PubMed

    Tapia, O; Escudero, M; Lozano, Á; Anzano, J; Mantilla, E

    2016-02-15

    According to European Union (EU) legislation, ozone (O3) monitoring sites can be classified regarding their location (rural background, rural, suburban, urban) or based on the presence of emission sources (background, traffic, industrial). There have been attempts to improve these classifications aiming to reduce their ambiguity and subjectivity, but although scientifically sound, they lack the simplicity needed for operational purposes. We present a simple methodology for classifying O3 stations based on the characteristics of frequency distribution curves which are indicative of the actual impact of combustion sources emitting NO that consumes O3 via titration. Four classes are identified using 1998-2012 hourly data from 72 stations widely distributed in mainland Spain and the Balearic Islands. Types 1 and 2 present unimodal bell-shaped distribution with very low amount of data near zero reflecting a limited influence of combustion sources while Type 4 has a primary mode close to zero, showing the impact of combustion sources, and a minor mode for higher concentrations. Type 3 stations present bimodal distributions with the main mode in the higher levels. We propose a quantitative metric based on the Gini index with the objective of reproducing this classification and finding empirical ranges potentially useful for future classifications. The analysis of the correspondence with the EUROAIRNET classes for the 72 stations reveals that the proposed scheme is only dependent on the impact of combustion sources and not on climatic or orographic aspects. It is demonstrated that this classification is robust since in 87% of the occasions the classification obtained for individual years coincide with the global classification obtained for the 1998-2012 period. Finally, case studies showing the applicability of the new classification scheme for assessing the impact on O3 of a station relocation and performing a critical evaluation of an air quality monitoring network are

  9. New classification scheme for ozone monitoring stations based on frequency distribution of hourly data.

    PubMed

    Tapia, O; Escudero, M; Lozano, Á; Anzano, J; Mantilla, E

    2016-02-15

    According to European Union (EU) legislation, ozone (O3) monitoring sites can be classified regarding their location (rural background, rural, suburban, urban) or based on the presence of emission sources (background, traffic, industrial). There have been attempts to improve these classifications aiming to reduce their ambiguity and subjectivity, but although scientifically sound, they lack the simplicity needed for operational purposes. We present a simple methodology for classifying O3 stations based on the characteristics of frequency distribution curves which are indicative of the actual impact of combustion sources emitting NO that consumes O3 via titration. Four classes are identified using 1998-2012 hourly data from 72 stations widely distributed in mainland Spain and the Balearic Islands. Types 1 and 2 present unimodal bell-shaped distribution with very low amount of data near zero reflecting a limited influence of combustion sources while Type 4 has a primary mode close to zero, showing the impact of combustion sources, and a minor mode for higher concentrations. Type 3 stations present bimodal distributions with the main mode in the higher levels. We propose a quantitative metric based on the Gini index with the objective of reproducing this classification and finding empirical ranges potentially useful for future classifications. The analysis of the correspondence with the EUROAIRNET classes for the 72 stations reveals that the proposed scheme is only dependent on the impact of combustion sources and not on climatic or orographic aspects. It is demonstrated that this classification is robust since in 87% of the occasions the classification obtained for individual years coincide with the global classification obtained for the 1998-2012 period. Finally, case studies showing the applicability of the new classification scheme for assessing the impact on O3 of a station relocation and performing a critical evaluation of an air quality monitoring network are

  10. Activity-based resource allocation: a system for predicting nursing costs.

    PubMed

    Crockett, M J; DiBlasi, M; Flaherty, P; Sampson, K

    1997-01-01

    As hospital-based managers are being confronted with changing patterns of reimbursement, ranging from revenue generating to cost management, it is imperative that hospitals know the exact nursing costs associated with the actual care delivered to specific patients. Nursing care has traditionally been bundled into the room rate for patients. This approach is extremely limiting when facilities are negotiating per diem rates and capitated rate contracts. At Braintree Hospital Rehabilitation Network, the nursing department has developed and implemented an activity-based management system to determine the actual cost of nursing care provided to each patient. This approach, which differentiates nursing costs accurately by diagnostic group and by intensity of nursing care, has contributed to the hospital's success in negotiating individual patient contracts with insurers in the managed care environment that increasingly focuses on costs and outcomes. Another result has been to enhance the accuracy of the network's cost accounting system. PMID:9416189

  11. Web-based Electronic Sharing and RE-allocation of Assets

    SciTech Connect

    Leverett, Dave; Miller, Robert A.; Berlin, Gary J.

    2002-09-09

    The Electronic Asses Sharing Program is a web-based application that provides the capability for complex-wide sharing and reallocation of assets that are excess, under utilized, or un-utilized. through a web-based fron-end and supporting has database with a search engine, users can search for assets that they need, search for assets needed by others, enter assets they need, and enter assets they have available for reallocation. In addition, entire listings of available assets and needed assets can be viewed. The application is written in Java, the hash database and search engine are in Object-oriented Java Database Management (OJDBM). The application will be hosted on an SRS-managed server outside the Firewall and access will be controlled via a protected realm. An example of the application can be viewed at the followinig (temporary) URL: http://idgdev.srs.gov/servlet/srs.weshare.WeShare

  12. Web-based Electronic Sharing and RE-allocation of Assets

    2002-09-09

    The Electronic Asses Sharing Program is a web-based application that provides the capability for complex-wide sharing and reallocation of assets that are excess, under utilized, or un-utilized. through a web-based fron-end and supporting has database with a search engine, users can search for assets that they need, search for assets needed by others, enter assets they need, and enter assets they have available for reallocation. In addition, entire listings of available assets and needed assetsmore » can be viewed. The application is written in Java, the hash database and search engine are in Object-oriented Java Database Management (OJDBM). The application will be hosted on an SRS-managed server outside the Firewall and access will be controlled via a protected realm. An example of the application can be viewed at the followinig (temporary) URL: http://idgdev.srs.gov/servlet/srs.weshare.WeShare« less

  13. 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.

  14. 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.

  15. 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.

  16. 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.

  17. 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.

  18. An Arnoldi-Based Iterative Scheme for Nonsymmetric Matrix Pencils Arising in Finite Element Stability Problems

    NASA Astrophysics Data System (ADS)

    Natarajan, Ramesh

    1992-05-01

    A method for computing the desired eigenvalues and corresponding eigenvectors of a large-scale, nonsymmetric, complex generalized eigenvalue problem is described. This scheme is primarily intended for the normal mode analysis and the stability characterization of the stationary states of parameterized time-dependent partial differential equations, in particular, when a finite element method is used for the numerical discretization. The algorithm, which is based on the previous work of Saad, may be succintly described as a multiple shift-and-invert, restarted Arnoldi procedure which uses reorthogonalization and automatic shift selection to provide stability and convergence, while minimizing the overall computational effort. The application and efficiency of the method is illustrated using two representative test problems.

  19. 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.

  20. 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.

  1. 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. PMID:17282656

  2. 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.

  3. 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.

  4. A high-speed readout scheme for fast optical correlation-based pattern recognition

    NASA Astrophysics Data System (ADS)

    McDonald, Gregor J.; Lewis, Meirion F.; Wilson, Rebecca

    2004-12-01

    We describe recent developments to a novel form of hybrid electronic/photonic correlator, which exploits component innovations in both electronics and photonics to provide fast, compact and rugged target recognition, applicable to a wide range of security applications. The system benefits from a low power, low volume, optical processing core which has the potential to realise man portable pattern recognition for a wide range of security based imagery and target databases. In the seminal Vander Lugt correlator the input image is Fourier transformed optically and multiplied optically with the conjugate Fourier transform of a reference pattern; the required correlation function is completed by taking the inverse Fourier transform of the product optically. The correlator described here is similar in principle, but performs the initial Fourier transforms and multiplication electronically, with only the final most computationally demanding output Fourier transform being performed optically. In this scheme the Fourier transforms of both the input scene and reference pattern are reduced to a binary phase-only format, where the multiplication process simplifies to a simple Boolean logic XOR function. The output of this XOR gate is displayed on a state-of-the-art Fast Bit Plane Spatial Light Modulator (FBPSLM). A novel readout scheme has been developed which overcomes the previous system output bottleneck and for the first time allows correlation frame readout rates capable of matching the inherently fast nature of the SLM. Readout rates of up to ~1 MHz are now possible, exceeding current SLM capabilities and meeting potential medium term SLM developments promised by SLMs based on novel materials and architectures.

  5. 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.

  6. Artificial intelligent techniques for optimizing water allocation in a reservoir watershed

    NASA Astrophysics Data System (ADS)

    Chang, Fi-John; Chang, Li-Chiu; Wang, Yu-Chung

    2014-05-01

    This study proposes a systematical water allocation scheme that integrates system analysis with artificial intelligence techniques for reservoir operation in consideration of the great uncertainty upon hydrometeorology for mitigating droughts impacts on public and irrigation sectors. The AI techniques mainly include a genetic algorithm and adaptive-network based fuzzy inference system (ANFIS). We first derive evaluation diagrams through systematic interactive evaluations on long-term hydrological data to provide a clear simulation perspective of all possible drought conditions tagged with their corresponding water shortages; then search the optimal reservoir operating histogram using genetic algorithm (GA) based on given demands and hydrological conditions that can be recognized as the optimal base of input-output training patterns for modelling; and finally build a suitable water allocation scheme through constructing an adaptive neuro-fuzzy inference system (ANFIS) model with a learning of the mechanism between designed inputs (water discount rates and hydrological conditions) and outputs (two scenarios: simulated and optimized water deficiency levels). The effectiveness of the proposed approach is tested on the operation of the Shihmen Reservoir in northern Taiwan for the first paddy crop in the study area to assess the water allocation mechanism during drought periods. We demonstrate that the proposed water allocation scheme significantly and substantially avails water managers of reliably determining a suitable discount rate on water supply for both irrigation and public sectors, and thus can reduce the drought risk and the compensation amount induced by making restrictions on agricultural use water.

  7. Wireless Networks with Energy Harvesting and Power Transfer: Joint Power and Time Allocation

    NASA Astrophysics Data System (ADS)

    Hadzi-Velkov, Zoran; Nikoloska, Ivana; Karagiannidis, George K.; Duong, Trung Q.

    2016-01-01

    In this paper, we consider wireless powered communication networks which could operate perpetually, as the base station (BS) broadcasts energy to the multiple energy harvesting (EH) information transmitters. These employ "harvest then transmit" mechanism, as they spend all of their energy harvested during the previous BS energy broadcast to transmit the information towards the BS. Assuming time division multiple access (TDMA), we propose a novel transmission scheme for jointly optimal allocation of the BS broadcasting power and time sharing among the wireless nodes, which maximizes the overall network throughput, under the constraint of average transmit power and maximum transmit power at the BS. The proposed scheme significantly outperforms "state of the art" schemes that employ only the optimal time allocation. If a single EH transmitter is considered, we generalize the optimal solutions for the case of fixed circuit power consumption, which refers to a much more practical scenario.

  8. A study on agent-based secure scheme for electronic medical record system.

    PubMed

    Chen, Tzer-Long; Chung, Yu-Fang; Lin, Frank Y S

    2012-06-01

    Patient records, including doctors' diagnoses of diseases, trace of treatments and patients' conditions, nursing actions, and examination results from allied health profession departments, are the most important medical records of patients in medical systems. With patient records, medical staff can instantly understand the entire medical information of a patient so that, according to the patient's conditions, more accurate diagnoses and more appropriate in-depth treatments can be provided. Nevertheless, in such a modern society with booming information technologies, traditional paper-based patient records have faced a lot of problems, such as lack of uniform formats, low data mobility, slow data transfer, illegible handwritings, enormous and insufficient storage space, difficulty of conservation, being easily damaged, and low transferability. To improve such drawbacks, reduce medical costs, and advance medical quality, paper-based patient records are modified into electronic medical records and reformed into electronic patient records. However, since electronic patient records used in various hospitals are diverse and different, in consideration of cost, it is rather difficult to establish a compatible and complete integrated electronic patient records system to unify patient records from heterogeneous systems in hospitals. Moreover, as the booming of the Internet, it is no longer necessary to build an integrated system. Instead, doctors can instantly look up patients' complete information through the Internet access to electronic patient records as well as avoid the above difficulties. Nonetheless, the major problem of accessing to electronic patient records cross-hospital systems exists in the security of transmitting and accessing to the records in case of unauthorized medical personnels intercepting or stealing the information. This study applies the Mobile Agent scheme to cope with the problem. Since a Mobile Agent is a program, which can move among hosts and

  9. An advanced temporal credential-based security scheme with mutual authentication and key agreement for wireless sensor networks.

    PubMed

    Li, Chun-Ta; Weng, Chi-Yao; Lee, Cheng-Chi

    2013-01-01

    Wireless sensor networks (WSNs) can be quickly and randomly deployed in any harsh and unattended environment and only authorized users are allowed to access reliable sensor nodes in WSNs with the aid of gateways (GWNs). Secure authentication models among the users, the sensor nodes and GWN are important research issues for ensuring communication security and data privacy in WSNs. In 2013, Xue et al. proposed a temporal-credential-based mutual authentication and key agreement scheme for WSNs. However, in this paper, we point out that Xue et al.'s scheme cannot resist stolen-verifier, insider, off-line password guessing, smart card lost problem and many logged-in users' attacks and these security weaknesses make the scheme inapplicable to practical WSN applications. To tackle these problems, we suggest a simple countermeasure to prevent proposed attacks while the other merits of Xue et al.'s authentication scheme are left unchanged. PMID:23887085

  10. An Advanced Temporal Credential-Based Security Scheme with Mutual Authentication and Key Agreement for Wireless Sensor Networks

    PubMed Central

    Li, Chun-Ta; Weng, Chi-Yao; Lee, Cheng-Chi

    2013-01-01

    Wireless sensor networks (WSNs) can be quickly and randomly deployed in any harsh and unattended environment and only authorized users are allowed to access reliable sensor nodes in WSNs with the aid of gateways (GWNs). Secure authentication models among the users, the sensor nodes and GWN are important research issues for ensuring communication security and data privacy in WSNs. In 2013, Xue et al. proposed a temporal-credential-based mutual authentication and key agreement scheme for WSNs. However, in this paper, we point out that Xue et al.'s scheme cannot resist stolen-verifier, insider, off-line password guessing, smart card lost problem and many logged-in users' attacks and these security weaknesses make the scheme inapplicable to practical WSN applications. To tackle these problems, we suggest a simple countermeasure to prevent proposed attacks while the other merits of Xue et al.'s authentication scheme are left unchanged. PMID:23887085

  11. An advanced temporal credential-based security scheme with mutual authentication and key agreement for wireless sensor networks.

    PubMed

    Li, Chun-Ta; Weng, Chi-Yao; Lee, Cheng-Chi

    2013-07-24

    Wireless sensor networks (WSNs) can be quickly and randomly deployed in any harsh and unattended environment and only authorized users are allowed to access reliable sensor nodes in WSNs with the aid of gateways (GWNs). Secure authentication models among the users, the sensor nodes and GWN are important research issues for ensuring communication security and data privacy in WSNs. In 2013, Xue et al. proposed a temporal-credential-based mutual authentication and key agreement scheme for WSNs. However, in this paper, we point out that Xue et al.'s scheme cannot resist stolen-verifier, insider, off-line password guessing, smart card lost problem and many logged-in users' attacks and these security weaknesses make the scheme inapplicable to practical WSN applications. To tackle these problems, we suggest a simple countermeasure to prevent proposed attacks while the other merits of Xue et al.'s authentication scheme are left unchanged.

  12. Agent based model of effects of task allocation strategies in flat organizations

    NASA Astrophysics Data System (ADS)

    Sobkowicz, Pawel

    2016-09-01

    A common practice in many organizations is to pile the work on the best performers. It is easy to implement by the management and, despite the apparent injustice, appears to be working in many situations. In our work we present a simple agent based model, constructed to simulate this practice and to analyze conditions under which the overall efficiency of the organization (for example measured by the backlog of unresolved issues) breaks down, due to the cumulative effect of the individual overloads. The model confirms that the strategy mentioned above is, indeed, rational: it leads to better global results than an alternative one, using equal workload distribution among all workers. The presented analyses focus on the behavior of the organizations close to the limit of the maximum total throughput and provide results for the growth of the unprocessed backlog in several situations, as well as suggestions related to avoiding such buildup.

  13. A Microphysics-Based Black Carbon Aging Scheme in a Global Chemical Transport Model: Constraints from HIPPO Observations

    NASA Astrophysics Data System (ADS)

    He, C.; Li, Q.; Liou, K. N.; Qi, L.; Tao, S.; Schwarz, J. P.

    2015-12-01

    Black carbon (BC) aging significantly affects its distributions and radiative properties, which is an important uncertainty source in estimating BC climatic effects. Global models often use a fixed aging timescale for the hydrophobic-to-hydrophilic BC conversion or a simple parameterization. We have developed and implemented a microphysics-based BC aging scheme that accounts for condensation and coagulation processes into a global 3-D chemical transport model (GEOS-Chem). Model results are systematically evaluated by comparing with the HIPPO observations across the Pacific (67°S-85°N) during 2009-2011. We find that the microphysics-based scheme substantially increases the BC aging rate over source regions as compared with the fixed aging timescale (1.2 days), due to the condensation of sulfate and secondary organic aerosols (SOA) and coagulation with pre-existing hydrophilic aerosols. However, the microphysics-based scheme slows down BC aging over Polar regions where condensation and coagulation are rather weak. We find that BC aging is primarily dominated by condensation process that accounts for ~75% of global BC aging, while the coagulation process is important over source regions where a large amount of pre-existing aerosols are available. Model results show that the fixed aging scheme tends to overestimate BC concentrations over the Pacific throughout the troposphere by a factor of 2-5 at different latitudes, while the microphysics-based scheme reduces the discrepancies by up to a factor of 2, particularly in the middle troposphere. The microphysics-based scheme developed in this work decreases BC column total concentrations at all latitudes and seasons, especially over tropical regions, leading to large improvement in model simulations. We are presently analyzing the impact of this scheme on global BC budget and lifetime, quantifying its uncertainty associated with key parameters, and investigating the effects of heterogeneous chemical oxidation on BC aging.

  14. Health worker preferences for performance-based payment schemes in a rural health district in Burkina Faso

    PubMed Central

    Yé, Maurice; Diboulo, Eric; Kagoné, Moubassira; Sié, Ali; Sauerborn, Rainer; Loukanova, Svetla

    2016-01-01

    Background One promising way to improve the motivation of healthcare providers and the quality of healthcare services is performance-based incentives (PBIs) also referred as performance-based financing. Our study aims to explore healthcare providers’ preferences for an incentive scheme based on local resources, which aimed at improving the quality of maternal and child health care in the Nouna Health District. Design A qualitative and quantitative survey was carried out in 2010 involving 94 healthcare providers within 34 health facilities. In addition, in-depth interviews involving a total of 33 key informants were conducted at health facility levels. Results Overall, 85% of health workers were in favour of an incentive scheme based on the health district's own financial resources (95% CI: [71.91; 88.08]). Most health workers (95 and 96%) expressed a preference for financial incentives (95% CI: [66.64; 85.36]) and team-based incentives (95% CI: [67.78; 86.22]), respectively. The suggested performance indicators were those linked to antenatal care services, prevention of mother-to-child human immunodeficiency virus transmission, neonatal care, and immunization. Conclusions The early involvement of health workers and other stakeholders in designing an incentive scheme proved to be valuable. It ensured their effective participation in the process and overall acceptance of the scheme at the end. This study is an important contribution towards the designing of effective PBI schemes. PMID:26739784

  15. Arbitrated quantum signature scheme based on χ-type entangled states

    NASA Astrophysics Data System (ADS)

    Zuo, Huijuan; Huang, Wei; Qin, Sujuan

    2013-10-01

    An arbitrated quantum signature scheme, which is mainly applied in electronic-payment systems, is proposed and investigated. The χ-type entangled states are used for quantum key distribution and quantum signature in this protocol. Compared with previous quantum signature schemes which also utilize χ-type entangled states, the proposed scheme provides higher efficiency. Finally, we also analyze its security under various kinds of attacks.

  16. Dynamic resource allocation engine for cloud-based real-time video transcoding in mobile cloud computing environments

    NASA Astrophysics Data System (ADS)

    Adedayo, Bada; Wang, Qi; Alcaraz Calero, Jose M.; Grecos, Christos

    2015-02-01

    The recent explosion in video-related Internet traffic has been driven by the widespread use of smart mobile devices, particularly smartphones with advanced cameras that are able to record high-quality videos. Although many of these devices offer the facility to record videos at different spatial and temporal resolutions, primarily with local storage considerations in mind, most users only ever use the highest quality settings. The vast majority of these devices are optimised for compressing the acquired video using a single built-in codec and have neither the computational resources nor battery reserves to transcode the video to alternative formats. This paper proposes a new low-complexity dynamic resource allocation engine for cloud-based video transcoding services that are both scalable and capable of being delivered in real-time. Firstly, through extensive experimentation, we establish resource requirement benchmarks for a wide range of transcoding tasks. The set of tasks investigated covers the most widely used input formats (encoder type, resolution, amount of motion and frame rate) associated with mobile devices and the most popular output formats derived from a comprehensive set of use cases, e.g. a mobile news reporter directly transmitting videos to the TV audience of various video format requirements, with minimal usage of resources both at the reporter's end and at the cloud infrastructure end for transcoding services.

  17. Optimality-based modeling of nitrogen allocation and photoacclimation in photosynthesis

    NASA Astrophysics Data System (ADS)

    Armstrong, Robert A.

    2006-03-01

    The ability to predict phytoplankton growth rates under light and nutrient limitation is fundamental to modeling the ocean carbon cycle. Equally fundamental is the ability to predict chlorophyll:carbon ratios, since satellite-based chlorophyll estimates are one of the few data sets to which model output can be compared globally. Because the Geider et al. [Geider, R.J., MacIntyre, H.L., Kana, T.M., 1998. A dynamic regulatory model of phytoplanktonic acclimation to light, nutrients, and temperature. Limnology and Oceanography 43, 679-694] model addresses both desiderata, it has become the model of choice for representing photosynthesis in a wide range of ecosystem models. The Geider et al. [Geider, R.J., MacIntyre, H.L., Kana, T.M., 1998. A dynamic regulatory model of phytoplanktonic acclimation to light, nutrients, and temperature. Limnology and Oceanography 43, 679-694] model follows previous models in positing that maximum photosynthetic rate can be reached only when nitrogen cell quota (nitrogen:carbon ratio) reaches a fixed maximum value qN,maxC. Empirically, this assumption is contradicted by the extremely thorough data set of Laws and Bannister [Laws, E.A., Bannister, T.T., 1980. Nutrient- and light-limited growth of Thalassiosira fluviatilis in continuous culture, with implications for phytoplankton growth in the ocean. Limnology and Oceanography 25, 457-473] and by other studies: maximum growth rate does not seem to require maximum nitrogen cell quota. To the extent that existing models do not reflect this key characteristic, they may fail to yield reliable predictions of chlorophyll:carbon ratios as functions of nitrogen:carbon ratios. They also may fail to reflect differences in growth rates of competing phytoplankton species, an essential feature of state-of-the-art ecosystem models used in biogeochemistry simulations. In the present paper I replace the nitrogen limitation function of previous models by one that does not require maximum nitrogen cell

  18. Microeconomics-based resource allocation in overlay networks by using non-strategic behavior modeling

    NASA Astrophysics Data System (ADS)

    Analoui, Morteza; Rezvani, Mohammad Hossein

    2011-01-01

    Behavior modeling has recently been investigated for designing self-organizing mechanisms in the context of communication networks in order to exploit the natural selfishness of the users with the goal of maximizing the overall utility. In strategic behavior modeling, the users of the network are assumed to be game players who seek to maximize their utility with taking into account the decisions that the other players might make. The essential difference between the aforementioned researches and this work is that it incorporates the non-strategic decisions in order to design the mechanism for the overlay network. In this solution concept, the decisions that a peer might make does not affect the actions of the other peers at all. The theory of consumer-firm developed in microeconomics is a model of the non-strategic behavior that we have adopted in our research. Based on it, we have presented distributed algorithms for peers' "joining" and "leaving" operations. We have modeled the overlay network as a competitive economy in which the content provided by an origin server can be viewed as commodity and the origin server and the peers who multicast the content to their downside are considered as the firms. On the other hand, due to the dual role of the peers in the overlay network, they can be considered as the consumers as well. On joining to the overlay economy, each peer is provided with an income and tries to get hold of the service regardless to the behavior of the other peers. We have designed the scalable algorithms in such a way that the existence of equilibrium price (known as Walrasian equilibrium price) is guaranteed.

  19. Noise Robust Feature Scheme for Automatic Speech Recognition Based on Auditory Perceptual Mechanisms

    NASA Astrophysics Data System (ADS)

    Cai, Shang; Xiao, Yeming; Pan, Jielin; Zhao, Qingwei; Yan, Yonghong

    Mel Frequency Cepstral Coefficients (MFCC) are the most popular acoustic features used in automatic speech recognition (ASR), mainly because the coefficients capture the most useful information of the speech and fit well with the assumptions used in hidden Markov models. As is well known, MFCCs already employ several principles which have known counterparts in the peripheral properties of human hearing: decoupling across frequency, mel-warping of the frequency axis, log-compression of energy, etc. It is natural to introduce more mechanisms in the auditory periphery to improve the noise robustness of MFCC. In this paper, a k-nearest neighbors based frequency masking filter is proposed to reduce the audibility of spectra valleys which are sensitive to noise. Besides, Moore and Glasberg's critical band equivalent rectangular bandwidth (ERB) expression is utilized to determine the filter bandwidth. Furthermore, a new bandpass infinite impulse response (IIR) filter is proposed to imitate the temporal masking phenomenon of the human auditory system. These three auditory perceptual mechanisms are combined with the standard MFCC algorithm in order to investigate their effects on ASR performance, and a revised MFCC extraction scheme is presented. Recognition performances with the standard MFCC, RASTA perceptual linear prediction (RASTA-PLP) and the proposed feature extraction scheme are evaluated on a medium-vocabulary isolated-word recognition task and a more complex large vocabulary continuous speech recognition (LVCSR) task. Experimental results show that consistent robustness against background noise is achieved on these two tasks, and the proposed method outperforms both the standard MFCC and RASTA-PLP.

  20. A novel addressing scheme for PMIPv6 based global IP-WSNs.

    PubMed

    Islam, Md Motaharul; Huh, Eui-Nam

    2011-01-01

    IP based Wireless Sensor Networks (IP-WSNs) are being used in healthcare, home automation, industrial control and agricultural monitoring. In most of these applications global addressing of individual IP-WSN nodes and layer-three routing for mobility enabled IP-WSN with special attention to reliability, energy efficiency and end to end delay minimization are a few of the major issues to be addressed. Most of the routing protocols in WSN are based on layer-two approaches. For reliability and end to end communication enhancement the necessity of layer-three routing for IP-WSNs is generating significant attention among the research community, but due to the hurdle of maintaining routing state and other communication overhead, it was not possible to introduce a layer-three routing protocol for IP-WSNs. To address this issue we propose in this paper a global addressing scheme and layer-three based hierarchical routing protocol. The proposed addressing and routing approach focuses on all the above mentioned issues. Simulation results show that the proposed addressing and routing approach significantly enhances the reliability, energy efficiency and end to end delay minimization. We also present architecture, message formats and different routing scenarios in this paper.