Modular Battery Charge Controller
Button, Robert; Gonzalez, Marcelo
2009-01-01
A new approach to masterless, distributed, digital-charge control for batteries requiring charge control has been developed and implemented. This approach is required in battery chemistries that need cell-level charge control for safety and is characterized by the use of one controller per cell, resulting in redundant sensors for critical components, such as voltage, temperature, and current. The charge controllers in a given battery interact in a masterless fashion for the purpose of cell balancing, charge control, and state-of-charge estimation. This makes the battery system invariably fault-tolerant. The solution to the single-fault failure, due to the use of a single charge controller (CC), was solved by implementing one CC per cell and linking them via an isolated communication bus [e.g., controller area network (CAN)] in a masterless fashion so that the failure of one or more CCs will not impact the remaining functional CCs. Each micro-controller-based CC digitizes the cell voltage (V(sub cell)), two cell temperatures, and the voltage across the switch (V); the latter variable is used in conjunction with V(sub cell) to estimate the bypass current for a given bypass resistor. Furthermore, CC1 digitizes the battery current (I1) and battery voltage (V(sub batt) and CC5 digitizes a second battery current (I2). As a result, redundant readings are taken for temperature, battery current, and battery voltage through the summation of the individual cell voltages given that each CC knows the voltage of the other cells. For the purpose of cell balancing, each CC periodically and independently transmits its cell voltage and stores the received cell voltage of the other cells in an array. The position in the array depends on the identifier (ID) of the transmitting CC. After eight cell voltage receptions, the array is checked to see if one or more cells did not transmit. If one or more transmissions are missing, the missing cell(s) is (are) eliminated from cell
Lithium-Ion Cell Charge-Control Unit Developed
Reid, Concha M.; Manzo, Michelle A.; Buton, Robert M.; Gemeiner, Russel
2005-01-01
A lithium-ion (Li-ion) cell charge-control unit was developed as part of a Li-ion cell verification program. This unit manages the complex charging scheme that is required when Li-ion cells are charged in series. It enables researchers to test cells together as a pack, while allowing each cell to charge individually. This allows the inherent cell-to-cell variations to be addressed on a series string of cells and reduces test costs substantially in comparison to individual cell testing.
Long Duration Balloon Charge Controller Stack Integration
Clifford, Kyle
NASA and the Columbia Scientific Balloon Facility are interested in updating the design of the charge controller on their long duration balloon (LDB) in order to enable the charge controllers to be directly interfaced via RS232 serial communication by a ground testing computers and the balloon's flight computer without the need to have an external electronics stack. The design involves creating a board that will interface with the existing boards in the charge controller in order to receive telemetry from and send commands to those boards, and interface with a computer through serial communication. The inputs to the board are digital status inputs indicating things like whether the photovoltaic panels are connected or disconnected; and analog inputs with information such as the battery voltage and temperature. The outputs of the board are 100ms duration command pulses that will switch relays that do things like connect the photovoltaic panels. The main component of this design is a PIC microcontroller which translates the outputs of the existing charge controller into serial data when interrogated by a ground testing or flight computer. Other components involved in the design are an AD7888 12-bit analog to digital converter, a MAX3232 serial transceiver, various other ICs, capacitors, resistors, and connectors.
A Charge Controller Design For Solar Power System
Nandar Oo
2015-08-01
Full Text Available This paper presents the solar charge controller circuit for controlling the overcharging and discharging from solar panel. This circuit regulates the charging of the battery in a solar system by monitoring battery voltage and switching the solar or other power source off when the battery reaches a preset voltage. This circuit is low voltages disconnect circuit. A charge controller circuit can increase battery life by preventing over-charging which can cause loss of electrolyte. The flow chart is also provided.
Optimal charging control of electric vehicles in smart grids
Tang, Wanrong
2017-01-01
This book introduces the optimal online charging control of electric vehicles (EVs) and battery energy storage systems (BESSs) in smart grids. The ultimate goal is to minimize the total energy cost as well as reduce the fluctuation of the total power flow caused by the integration of the EVs and renewable energy generators. Using both theoretic analysis and data-driven numerical results, the authors reveal the effectiveness and efficiency of the proposed control techniques. A major benefit of these control techniques is their practicality, since they do not rely on any non-causal knowledge of future information. Researchers, operators of power grids, and EV users will find this to be an exceptional resource. It is also suitable for advanced-level students of computer science interested in networks, electric vehicles, and energy systems.
Masterless Distributed Computing Over Mobile Devices
2012-09-01
8 C. MAPREDUCE ...which are 3 commonly used to analyze large amounts of information?” We answer this question by modifying Google’s well-known MapReduce system to have... MAPREDUCE 1. Overview MapReduce is a programming framework that distributes computations across a heterogeneous mixture of machines in a manner that hides
Ankur Bhattacharjee
2012-09-01
Full Text Available This paper contains the design of a three stage solar battery charge controller and a comparative study of this charge control technique with three conventional solar battery charge control techniques such as 1. Constant Current (CC charging, 2. Two stage constant current constant voltage (CC-CV charging technique. The analysis and the comparative study of the aforesaid charging techniques are done in MATLAB/SIMULINK environment. Here the practical data used to simulate the charge control algorithms are based on a 12Volts 7Ah Sealed lead acid battery.
Adarsh Kumar
2016-01-01
Full Text Available :Charge controller is the most important part of a Solar Photovoltaic Home LightingSystem (SPVHLS which controls the charging ofbattery from photovoltaic (PV module and discharging of battery through load. This paper analyzes testresults of fourteen charge controllers (CC available in Indiaaccording to the Ministry of New and RenewableEnergy (MNRE specification. The different parameters of charge controllers to be tested arebattery high voltage disconnect (HVD, low voltage disconnect(LVD, load reconnect voltage (LRV, short circuit protection etc. It is found thatseven charge controllers meet the technical specifications ofMNRE. There is also a study of different features and properties of the chargecontrollers. Finally a brief discussion on selection appropriate charge controller for Solar Photovoltaic Home LightingSystem (SPVHLS and further improvement ofcharge controller is presented.
The Application Research about Modified Genetic Algorithm in the Flywheel Charging-Control System
Jiaqi Zhong
2013-05-01
Full Text Available In the flywheel charging-control system, there exists the flywheel motor’s nonlinearity, variable elements etc, which leads to the problem of parameter tuning of PID controller of its charging-control system’s revolving speed loop. In this study, I will introduce an optimizing way based on modified genetic algorithm for the flywheel charging-control system PID controller, which by means of simulation and performance index quantization to observe its optimizing performance and convergence characteristic, so that we can check the feasibility and effectiveness in the flywheel charging-control system. It turns out that tuning PID controller parameters based on modified genetic algorithm has a better rapidity and stability, which proves the feasibility of the modified genetic algorithm.
Development of a Microcontroller-based Battery Charge Controller for an Off-grid Photovoltaic System
Rina, Z. S.; Amin, N. A. M.; Hashim, M. S. M.; Majid, M. S. A.; Rojan, M. A.; Zaman, I.
2017-08-01
A development of a microcontroller-based charge controller for a 12V battery has been explained in this paper. The system is designed based on a novel algorithm to couple existing solar photovoltaic (PV) charging and main grid supply charging power source. One of the main purposes of the hybrid charge controller is to supply a continuous charging power source to the battery. Furthermore, the hybrid charge controller was developed to shorten the battery charging time taken. The algorithm is programmed in an Arduino Uno R3 microcontroller that monitors the battery voltage and generates appropriate commands for the charging power source selection. The solar energy is utilized whenever the solar irradiation is high. The main grid supply will be only consumed whenever the solar irradiation is low. This system ensures continuous charging power supply and faster charging of the battery.
Tuffner, Francis K [Richland, WA; Kintner-Meyer, Michael C. W. [Richland, WA; Hammerstrom, Donald J [West Richland, WA; Pratt, Richard M [Richland, WA
2012-05-22
Battery charging control methods, electric vehicle charging methods, battery charging apparatuses and rechargeable battery systems. According to one aspect, a battery charging control method includes accessing information regarding a presence of at least one of a surplus and a deficiency of electrical energy upon an electrical power distribution system at a plurality of different moments in time, and using the information, controlling an adjustment of an amount of the electrical energy provided from the electrical power distribution system to a rechargeable battery to charge the rechargeable battery.
I Gusti Ngurah Agung Mahardika
2016-03-01
Full Text Available Sistem pengangkat air dengan menggunakan sumber pembangkit listrik tenaga surya sudah banyak dilakukan oleh beberapa orang atau kelompok, namun pada malam hari panel surya tidak dapat mensuplai mesin pengangkat air karena tidak mendapatkan sinar matahari. Permasalahan yang terjadi adalah tidak dilengkapi dengan penyimpanan energi untuk sistem pengangkat air tersebut. Solusi untuk masalah ini adalah dengan membuat rancang bangun baterai charge control untuk sistem tersebut. Metode dalam pembuatan sistem ini dibagi menjadi dua bagian yaitu perancangan hardware dan software. Hasil dari sistem charge control ini mampu melakukan pengisian untuk aki GS 12V10Ah dengan arus pengisian mengikuti arus dari PLTS dengan rata-rata arus pengisian sebesar 2,065 ampere dan tegangan pengisian yang diberikan 13V selama 2 jam dan lama pemakaian aki GS 12V10Ah untuk membackup beban pompa 60 Watt selama 1 jam 45 menit.
van Leeuwen, Theo
2013-01-01
This chapter presents a framework for analysing colour schemes based on a parametric approach that includes not only hue, value and saturation, but also purity, transparency, luminosity, luminescence, lustre, modulation and differentiation....
Hammond, R.L.; Turpin, J.F.; Corey, G.P. [and others
1996-12-01
Under the sponsorship of the Department of Energy, Office of Utility Technologies, the Battery Analysis and Evaluation Department and the Photovoltaic System Assistance Center of Sandia National Laboratories (SNL) initiated a U.S. industry-wide PV Energy Storage System Survey. Arizona State University (ASU) was contracted by SNL in June 1995 to conduct the survey. The survey included three separate segments tailored to: (a) PV system integrators, (b) battery manufacturers, and (c) PV charge controller manufacturers. The overall purpose of the survey was to: (a) quantify the market for batteries shipped with (or for) PV systems in 1995, (b) quantify the PV market segments by battery type and application for PV batteries, (c) characterize and quantify the charge controllers used in PV systems, (d) characterize the operating environment for energy storage components in PV systems, and (e) estimate the PV battery market for the year 2000. All three segments of the survey were mailed in January 1996. This report discusses the purpose, methodology, results, and conclusions of the survey.
Evaluation of Electric Vehicle Charging Controllability for Provision of Time Critical Grid Services
Martinenas, Sergejus; Marinelli, Mattia; Andersen, Peter Bach;
2016-01-01
Replacement of conventional generation by more stochastic renewable generation sources leads to reduction of inertia and controllability in the power system. This introduces the need for more dynamic regulation services. These faster services could potentially be provided by the growing number...... of electric vehicles. EVs are a fast responding energy resource with high availability. This work evaluates and experimentally shows the limits of EV charging controllability with the focus on its suitability for providing ancillary grid services. Three different series produced EVs are tested....... The experimental testing is done by using charging current controllability of built-in AC charger to provide a primary frequency regulation service with very dynamic input frequency. The results show that most the controllability of most EVs is more than suitable for providing time critical grid services...
A pulse-width modulated, high reliability charge controller for small photovoltaic systems
Gerken, K. [Morningstar Corp., Olney, MD (United States); Welsh, D. [Morningstar Corp., Encinitas, CA (United States)
1997-02-01
This report presents the results of a development effort to design, test and begin production of a new class of small photovoltaic (PV) charge controllers. Sandia National Laboratories provided technical support, test data and financial support through a Balance-of-System Development contract. One of the objectives of the development was to increase user confidence in small PV systems by improving the reliability and operating life of the system controllers. Another equally important objective was to improve the economics of small PV systems by extending the battery lifetimes. Using new technology and advanced manufacturing techniques, these objectives were accomplished. Because small stand-alone PV systems account for over one third of all PV modules shipped, the positive impact of improving the reliability and economics of PV systems in this market segment will be felt throughout the industry. The results of verification testing of the new product are also included in this report. The initial design goals and specifications were very aggressive, but the extensive testing demonstrates that all the goals were achieved. Production of the product started in May at a rate of 2,000 units per month. Over 40 Morningstar distributors (5 US and 35 overseas) have taken delivery in the first 2 months of shipments. Initial customer reactions to the new controller have been very favorable.
Filicori, Fabio; Traverso, Pier Andrea; Florian, Corrado; Borgarino, Mattia
2004-05-01
The basic features of the recently proposed Charge-Controlled Non-linear Noise (CCNN) model for the prediction of low-to-high-frequency noise up-conversion in electron devices under large-signal RF operation are synthetically presented. It is shown that the different noise generation phenomena within the device can be described by four equivalent noise sources, which are connected at the ports of a "noiseless" device model and are non-linearly controlled by the time-varying instantaneous values of the intrinsic device voltages. For the empirical identification of the voltage-controlled equivalent noise sources, different possible characterization procedures, based not only on conventional low-frequency noise data, but also on different types of noise measurements carried out under large-signal RF operating conditions are discussed. As an example of application, the measurement-based identification of the CCNN model for a GaInP heterojunction bipolar microwave transistor is presented. Preliminary validation results show that the proposed model can describe with adequate accuracy not only the low-frequency noise of the HBT, but also its phase-noise performance in a prototype VCO implemented by using the same monolithic GaAs technology.
Economic Value of LFC Substitution by Charge Control for Plug-in Hybrid Electric Vehicles
Takagi, Masaaki; Iwafune, Yumiko; Yamamoto, Hiromi; Yamaji, Kenji; Okano, Kunihiko; Hiwatari, Ryouji; Ikeya, Tomohiko
There are lots of global warming countermeasures. In the power sector, nuclear power plants play an important role because they do not produce CO2 emissions during production of electricity. However, if the generation share of nuclear is too high at nighttime, it becomes difficult to keep enough capacity of Load Frequency Control (LFC) because nuclear power plants do not change the output (i.e., without load following operation) in Japan. On the other hand, in the transport sector, Plug-in Hybrid Electric Vehicle (PHEV) is being developed as an environmentally friendly vehicle. The electric energy of PHEV is charged mainly during nighttime when the electricity price is low. Therefore, we have proposed a charging power control of PHEVs to compensate LFC capacity in nighttime. In this study, we evaluated the economic value of charging power control by using an optimal generation planning model, and obtained the following results. Charging power control is effective in reduction of CO2 emissions and enhancement of economic efficiency of power system. Particularly, even in the low market share of PHEVs, the charge control has a high economic value because it substitutes nuclear power plant, base-load provider with low fuel cost, for LNG-CC, LEC provider with high fuel cost.
System dynamic model and charging control of lead-acid battery for stand-alone solar PV system
Huang, B.J.
2010-05-01
The lead-acid battery which is widely used in stand-alone solar system is easily damaged by a poor charging control which causes overcharging. The battery charging control is thus usually designed to stop charging after the overcharge point. This will reduce the storage energy capacity and reduce the service time in electricity supply. The design of charging control system however requires a good understanding of the system dynamic behaviour of the battery first. In the present study, a first-order system dynamics model of lead-acid battery at different operating points near the overcharge voltage was derived experimentally, from which a charging control system based on PI algorithm was developed using PWM charging technique. The feedback control system for battery charging after the overcharge point (14 V) was designed to compromise between the set-point response and the disturbance rejection. The experimental results show that the control system can suppress the battery voltage overshoot within 0.1 V when the solar irradiation is suddenly changed from 337 to 843 W/m2. A long-term outdoor test for a solar LED lighting system shows that the battery voltage never exceeded 14.1 V for the set point 14 V and the control system can prevent the battery from overcharging. The test result also indicates that the control system is able to increase the charged energy by 78%, as compared to the case that the charging stops after the overcharge point (14 V). © 2010 Elsevier Ltd. All rights reserved.
Space-charge-controlled field emission model of current conduction through Al2O3 films
Hiraiwa, Atsushi; Matsumura, Daisuke; Kawarada, Hiroshi
2016-02-01
This study proposes a model for current conduction in metal-insulator-semiconductor (MIS) capacitors, assuming the presence of two sheets of charge in the insulator, and derives analytical formulae of field emission (FE) currents under both negative and positive bias. Since it is affected by the space charge in the insulator, this particular FE differs from the conventional FE and is accordingly named the space-charge-controlled (SCC) FE. The gate insulator of this study was a stack of atomic-layer-deposition Al2O3 and underlying chemical SiO2 formed on Si substrates. The current-voltage (I-V) characteristics simulated using the SCC-FE formulae quantitatively reproduced the experimental results obtained by measuring Au- and Al-gated Al2O3/SiO2 MIS capacitors under both biases. The two sheets of charge in the Al2O3 films were estimated to be positive and located at a depth of greater than 4 nm from the Al2O3/SiO2 interface and less than 2 nm from the gate. The density of the former is approximately 1 × 1013 cm-2 in units of electronic charge, regardless of the type of capacitor. The latter forms a sheet of dipoles together with image charges in the gate and hence causes potential jumps of 0.4 V and 1.1 V in the Au- and Al-gated capacitors, respectively. Within a margin of error, this sheet of dipoles is ideally located at the gate/Al2O3 interface and effectively reduces the work function of the gate by the magnitude of the potential jumps mentioned above. These facts indicate that the currents in the Al2O3/SiO2 MIS capacitors are enhanced as compared to those in ideal capacitors and that the currents in the Al-gated capacitors under negative bias (electron emission from the gate) are more markedly enhanced than those in the Au-gated capacitors. The larger number of gate-side dipoles in the Al-gated capacitors is possibly caused by the reaction between the Al and Al2O3, and therefore gate materials that do not react with underlying gate insulators should be chosen
A Physics-Based Charge-Control Model for InP DHBT Including Current-Blocking Effect
GE Ji; JIN Zhi; SU Yong-Bo; CHENG Wei; WANG Xian-Wai; CHEN Gao-Peng; LIU Xin-Yu
2009-01-01
We develop a physics-based charge-control InP double heterojunction bipolar transistor model including three important effects: current blocking, mobile-charge modulation of the base-collector capacitance and velocity-field modulation in the transit time. The bias-dependent base-collector depletion charge is obtained analytically, which takes into account the mobile-charge modulation. Then, a measurement based voltage-dependent transit time formulation is implemented. As a result, over a wide range of biases, the developed model shows good agreement between the modeled and measured S-parameters and cutoff frequency. Also, the model considering current blocking effect demonstrates more accurate prediction of the output characteristics than conventional vertical bipolar inter company results.
Generalized Group Signature Scheme
无
2001-01-01
The concept of generalized group signature scheme will bepresent. Based on the generalized secret sharing scheme proposed by Lin and Ha rn, a non-interactive approach is designed for realizing such generalized group signature scheme. Using the new scheme, the authorized subsets of the group in w hich the group member can cooperate to produce the valid signature for any messa ge can be randomly specified
Sman, van der R.G.M.
2006-01-01
In the special case of relaxation parameter = 1 lattice Boltzmann schemes for (convection) diffusion and fluid flow are equivalent to finite difference/volume (FD) schemes, and are thus coined finite Boltzmann (FB) schemes. We show that the equivalence is inherent to the homology of the
Nørmark, Kurt
2010-01-01
A Scheme representation of Standard MIDI Files is proposed. The Scheme expressions are defined and constrained by an XML-language, which in the starting point is inspired by a MIDI XML event language made by the MIDI Manufactures Association. The representation of Standard MIDI Files in Scheme ma...
Nørmark, Kurt
2010-01-01
A Scheme representation of Standard MIDI Files is proposed. The Scheme expressions are defined and constrained by an XML-language, which in the starting point is inspired by a MIDI XML event language made by the MIDI Manufactures Association. The representation of Standard MIDI Files in Scheme ma...
Scheme Program Documentation Tools
Nørmark, Kurt
2004-01-01
This paper describes and discusses two different Scheme documentation tools. The first is SchemeDoc, which is intended for documentation of the interfaces of Scheme libraries (APIs). The second is the Scheme Elucidator, which is for internal documentation of Scheme programs. Although the tools...... are separate and intended for different documentation purposes they are related to each other in several ways. Both tools are based on XML languages for tool setup and for documentation authoring. In addition, both tools rely on the LAML framework which---in a systematic way---makes an XML language available...
Convertible Proxy Signcryption Scheme
李继国; 李建中; 曹珍富; 张亦辰
2004-01-01
In 1996, Mambo et al introduced the concept of proxy signature. However, proxy signature can only provide the delegated authenticity and cannot provide confidentiality. Recently, Gamage et al and Chan and Wei proposed different proxy signcryption schemes respectively, which extended the concept of proxy signature.However, only the specified receiver can decrypt and verify the validity of proxy signcryption in their schemes.To protect the receiver' s benefit in case of a later dispute, Wu and Hsu proposed a convertible authenticated encryption scheme, which carn enable the receiver to convert signature into an ordinary one that can be verified by anyone. Based on Wu and Hsu' s scheme and improved Kim' s scheme, we propose a convertible proxy signcryption scheme. The security of the proposed scheme is based on the intractability of reversing the one-way hash function and solving the discrete logarithm problem. The proposed scheme can satisfy all properties of strong proxy signature and withstand the public key substitution attack and does not use secure channel. In addition, the proposed scheme can be extended to convertible threshold proxy signcryption scheme.
Vela, N. [CIEMAT-DER, Madrid (Spain). Laboratorio de Energia Solar Fotovoltaica; Aguilera, J. [Universidad de Jaen (Spain). Escuela Politecnica Superior
2006-12-15
In stand-alone photovoltaic (PV) systems, charge controllers prevent excessive battery overcharge by interrupting or limiting the current flow from the PV array to the battery when the battery becomes fully charged. Charge regulation is most often accomplished by limiting the battery voltage to a predetermined value or cut-off voltage, higher than the gassing voltage. These regulation voltages are dependent on the temperature and battery charge current. An adequate selection of overcharge cut-off voltage for each battery type and operating conditions would maintain the highest battery state of charge without causing significant overcharge thus improving battery performance and reliability. To perform this work, a sample of nine different lead-acid batteries, typically used in stand-alone PV systems including vented and sealed batteries with 2 V cells and monoblock configurations have been selected. This paper presents simple mathematical expressions fitting two charge characteristic voltages: the gassing voltage (V{sub g}) and the end-of charge voltage (V{sub fc}) as function of charge current and temperature for the tested batteries. With these expressions, we have calculated V{sub g} and V{sub fc} at different current rates. An analysis of the different values obtained is presented here focusing in the implication in control strategies of batteries in stand-alone PV systems. (author)
Monteiro, Luis Guilherme; Zilles, Roberto [Universidade de Sao Paulo (USP), SP (Brazil). Inst. de Eletrotecnica e Energia. Lab. de Sistemas Fotovoltaicos], e-mail: monteiro@iee.usp.br, e-mail: zilles@iee.usp.br
2004-07-01
Considering the necessity to optimize and to draw out the useful life of the rechargeable batteries in photovoltaic systems it is of custom to endow the systems with an equipment that plays this function. Its application, of adjusted form, can represent a significant reduction in the operational costs of these systems. In this paper the different strategies, and its particularities, used for the management of the state of charge are presented in small photovoltaic systems. In general, this management is made through the scan of voltage in the terminals of the accumulator with an electronic device called charge controller. The market offers a diversity of options for the designer of systems, that essentially vary in that refer to the strategy of commutation of the consumption and load circuits (for example, ON/OFF or PWM). The majority of the controllers for small systems does not allow to adjustment of the points of performance of the circuits of load and consumption. In many cases it is observed that the pre-adjusted points allow extreme discharges that make it harmless to one of functions that would have to play, or either, to protect the battery of extreme discharges. In this direction, this article makes an analysis of the different strategies of control and presents one criticizes to the products offered in the market for application in solar home systems. (author)
Difference Schemes and Applications
2015-02-06
of the shallow water equations that is well suited for complex geometries and moving boundaries. Another (similar) regularization of...the solid wall extrapolation followed by the interpolation in the phase space (by solving the Riemann problem between the internal cell averages and...scheme. This Godunov-type scheme enjoys all major advantages of Riemann -problem-solver-free, non-oscillatory central schemes and, at the same time, have
Efficient Threshold Signature Scheme
Sattar J Aboud
2012-01-01
Full Text Available In this paper, we introduce a new threshold signature RSA-typed scheme. The proposed scheme has the characteristics of un-forgeable and robustness in random oracle model. Also, signature generation and verification is entirely non-interactive. In addition, the length of the entity signature participate is restricted by a steady times of the length of the RSA signature modulus. Also, the signing process of the proposed scheme is more efficient in terms of time complexity and interaction.
Stateless Transitive Signature Schemes
MA Chun-guang; CAI Man-chun; YANG Yi-xian
2004-01-01
A new practical method is introduced to transform the stateful transitive signature scheme to stateless one without the loss of security. According to the approach, two concrete stateless transitive signature schemes based on Factoring and RSA are presented respectively. Under the assumption of the hardness of factoring and one-more- RSA-inversion problem, both two schemes are secure under the adaptive chosen-message attacks in random oracle model.
Multiresolution signal decomposition schemes
J. Goutsias (John); H.J.A.M. Heijmans (Henk)
1998-01-01
textabstract[PNA-R9810] Interest in multiresolution techniques for signal processing and analysis is increasing steadily. An important instance of such a technique is the so-called pyramid decomposition scheme. This report proposes a general axiomatic pyramid decomposition scheme for signal analysis
Multiresolution signal decomposition schemes
Goutsias, J.; Heijmans, H.J.A.M.
1998-01-01
[PNA-R9810] Interest in multiresolution techniques for signal processing and analysis is increasing steadily. An important instance of such a technique is the so-called pyramid decomposition scheme. This report proposes a general axiomatic pyramid decomposition scheme for signal analysis and synthes
Balakrishnan, Karthik; Sun, Ke-Xun
2012-07-01
Precise control over the potential of an electrically isolated proof mass is necessary for the operation of devices such as a Gravitational Reference Sensor (GRS) and satellite missions such as LISA. We show that AlGaN UV LEDs operating at 255 nm are an effective substitute for Mercury vapor lamps used in previous missions because of their ability to withstand space qualification levels of vibration and thermal cycling. After 27 thermal and thermal vacuum cycles and 9 minutes of 14.07 g RMS vibration, there is less than 3% change in current draw, less than 15% change in optical power, and no change in spectral peak or FWHM (full width at half maximum). We also demonstrate UV LED stimulated photoemission from a wide variety of thin film carbide proof mass coating candidates (SiC, Mo2C, TaC, TiC, ZrC) that were applied using electron beam evaporation on an Aluminum 6061-T6 substrate. All tested carbide films have measured quantum efficiencies of 3.8-6.8*10^-7 and reflectivities of 0.11-0.15, which compare favorably with the properties of previously used gold films. We demonstrate the ability to control proof mass potential on an 89 mm diameter spherical proof mass over a 20 mm gap in a GRS-like configuration. Proof mass potential was measured via a non-contact DC probe, which would allow control without introducing dynamic forcing of the spacecraft. Finally we provide a look ahead to an upcoming technology demonstration mission of UV LEDs and future applications toward charge control of electrically isolated proof masses.
Al-saggaf, Alawi A
2008-01-01
This paper attempt has been made to explain a fuzzy commitment scheme. In the conventional Commitment schemes, both committed string m and valid opening key are required to enable the sender to prove the commitment. However there could be many instances where the transmission involves noise or minor errors arising purely because of the factors over which neither the sender nor the receiver have any control. The fuzzy commitment scheme presented in this paper is to accept the opening key that is close to the original one in suitable distance metric, but not necessarily identical. The concept itself is illustrated with the help of simple situation.
Pötz, Katharina Anna; Haas, Rainer; Balzarova, Michaela
2013-01-01
Purpose – The rise of CSR followed a demand for CSR standards and guidelines. In a sector already characterized by a large number of standards, the authors seek to ask what CSR schemes apply to agribusiness, and how they can be systematically compared and analysed. Design....../methodology/approach – Following a deductive-inductive approach the authors develop a model to compare and analyse CSR schemes based on existing studies and on coding qualitative data on 216 CSR schemes. Findings – The authors confirm that CSR standards and guidelines have entered agribusiness and identify a complex landscape...... of schemes that can be categorized on focus areas, scales, mechanisms, origins, types and commitment levels. Research limitations/implications – The findings contribute to conceptual and empirical research on existing models to compare and analyse CSR standards. Sampling technique and depth of analysis limit...
Willcock, J J; Lumsdaine, A; Quinlan, D J
2008-08-19
Tabled execution is a generalization of memorization developed by the logic programming community. It not only saves results from tabled predicates, but also stores the set of currently active calls to them; tabled execution can thus provide meaningful semantics for programs that seemingly contain infinite recursions with the same arguments. In logic programming, tabled execution is used for many purposes, both for improving the efficiency of programs, and making tasks simpler and more direct to express than with normal logic programs. However, tabled execution is only infrequently applied in mainstream functional languages such as Scheme. We demonstrate an elegant implementation of tabled execution in Scheme, using a mix of continuation-passing style and mutable data. We also show the use of tabled execution in Scheme for a problem in formal language and automata theory, demonstrating that tabled execution can be a valuable tool for Scheme users.
DING XIU-HUAN; FU ZHI-GUO; ZHANG SHU-GONG
2009-01-01
This paper proposes an XTR version of the Kurosawa-Desmedt scheme. Our scheme is secure against adaptive choeen-ciphertext attack under the XTR version of the Decisional Diffie-Hellman assumption in the standard model. Comparing efficiency between the Kurosawa-Desmedt scheme and the proposed XTR-Kurosawa-Desmedt scheme, we find that the proposed scheme is more efficient than the Kurosawa-Desmedt scheme both in communication and computation without compromising security.
Juhl, Hans Jørn; Stacey, Julia
2001-01-01
It is usual practice to evaluate the success of a labelling scheme by looking at the awareness percentage, but in many cases this is not sufficient. The awareness percentage gives no indication of which of the consumer segments that are aware of and use labelling schemes and which do not. In the ......It is usual practice to evaluate the success of a labelling scheme by looking at the awareness percentage, but in many cases this is not sufficient. The awareness percentage gives no indication of which of the consumer segments that are aware of and use labelling schemes and which do not....... In the spring of 2001 MAPP carried out an extensive consumer study with special emphasis on the Nordic environmentally friendly label 'the swan'. The purpose was to find out how much consumers actually know and use various labelling schemes. 869 households were contacted and asked to fill in a questionnaire...... it into consideration when I go shopping. The respondent was asked to pick the most suitable answer, which described her use of each label. 29% - also called 'the labelling blind' - responded that they basically only knew the recycling label and the Government controlled organic label 'Ø-mærket'. Another segment of 6...
Placidi, M.; Jung, J. -Y.; Ratti, A.; Sun, C.
2014-07-25
This paper describes beam distribution schemes adopting a novel implementation based on low amplitude vertical deflections combined with horizontal ones generated by Lambertson-type septum magnets. This scheme offers substantial compactness in the longitudinal layouts of the beam lines and increased flexibility for beam delivery of multiple beam lines on a shot-to-shot basis. Fast kickers (FK) or transverse electric field RF Deflectors (RFD) provide the low amplitude deflections. Initially proposed at the Stanford Linear Accelerator Center (SLAC) as tools for beam diagnostics and more recently adopted for multiline beam pattern schemes, RFDs offer repetition capabilities and a likely better amplitude reproducibility when compared to FKs, which, in turn, offer more modest financial involvements both in construction and operation. Both solutions represent an ideal approach for the design of compact beam distribution systems resulting in space and cost savings while preserving flexibility and beam quality.
Towards Symbolic Encryption Schemes
Ahmed, Naveed; Jensen, Christian D.; Zenner, Erik
2012-01-01
Symbolic encryption, in the style of Dolev-Yao models, is ubiquitous in formal security models. In its common use, encryption on a whole message is specified as a single monolithic block. From a cryptographic perspective, however, this may require a resource-intensive cryptographic algorithm......, namely an authenticated encryption scheme that is secure under chosen ciphertext attack. Therefore, many reasonable encryption schemes, such as AES in the CBC or CFB mode, are not among the implementation options. In this paper, we report new attacks on CBC and CFB based implementations of the well......-known Needham-Schroeder and Denning-Sacco protocols. To avoid such problems, we advocate the use of refined notions of symbolic encryption that have natural correspondence to standard cryptographic encryption schemes....
2006-01-01
We study the question of ``how robust are the known lower bounds of labeling schemes when one increases the number of consulted labels''. Let $f$ be a function on pairs of vertices. An $f$-labeling scheme for a family of graphs $\\cF$ labels the vertices of all graphs in $\\cF$ such that for every graph $G\\in\\cF$ and every two vertices $u,v\\in G$, the value $f(u,v)$ can be inferred by merely inspecting the labels of $u$ and $v$. This paper introduces a natural generalization: the notion of $f$-...
Alternative health insurance schemes
Keiding, Hans; Hansen, Bodil O.
2002-01-01
In this paper, we present a simple model of health insurance with asymmetric information, where we compare two alternative ways of organizing the insurance market. Either as a competitive insurance market, where some risks remain uninsured, or as a compulsory scheme, where however, the level...... competitive insurance; this situation turns out to be at least as good as either of the alternatives...
周静; 何为; 龙兴明
2011-01-01
针对光伏阵列对蓄电池进行直接串联充电时能量收集效率过低的缺陷,提出基于系统参数实时跟踪的最大充电控制方法,研制以微处理器为核心、可切换并联Buck/Boost拓扑结构为框架的智能充电控制器,实现太阳能的最大收集.实际运行结果表明:基于微处理器的智能控制策略能动态描述系统的参数信息,提高电量收集效率,系统动态跟踪时间约4 ms,电能收集效率提高20％以上;基于廉价单片机的最大充电控制器避免了太阳能电池的过大功率配置,有利于降低系统成本.%As the direct battery-charging by photovoltaic array has low efficiency,a control scheme of maximum charging based on real-time system parameter tracking is proposed. A microprocessor-based intelligent CC(Charging Controller) with switching parallel Buck/Boost topology is developed,which carries out the maximum gathering of solar energy. Practical operation shows that.it describes dynamically the system parameter information and enhances the electric charge collection efficiency. The system dynamic tracking time is about 4 ms and the electric charge collection efficiency increases more than 20 %. The CC with microcontroller reduces the cost of photovoltaic system by avoiding over power configuration of photovoltaic array.
On Converting Secret Sharing Scheme to Visual Secret Sharing Scheme
Wang Daoshun
2010-01-01
Full Text Available Abstract Traditional Secret Sharing (SS schemes reconstruct secret exactly the same as the original one but involve complex computation. Visual Secret Sharing (VSS schemes decode the secret without computation, but each share is m times as big as the original and the quality of the reconstructed secret image is reduced. Probabilistic visual secret sharing (Prob.VSS schemes for a binary image use only one subpixel to share the secret image; however the probability of white pixels in a white area is higher than that in a black area in the reconstructed secret image. SS schemes, VSS schemes, and Prob. VSS schemes have various construction methods and advantages. This paper first presents an approach to convert (transform a -SS scheme to a -VSS scheme for greyscale images. The generation of the shadow images (shares is based on Boolean XOR operation. The secret image can be reconstructed directly by performing Boolean OR operation, as in most conventional VSS schemes. Its pixel expansion is significantly smaller than that of VSS schemes. The quality of the reconstructed images, measured by average contrast, is the same as VSS schemes. Then a novel matrix-concatenation approach is used to extend the greyscale -SS scheme to a more general case of greyscale -VSS scheme.
Shenghui, Lu; Jiangfeng, Du; Qian, Luo; Qi, Yu; Wei, Zhou; Jianxin, Xia; Mohua, Yang
2010-09-01
An analytical charge control model considering the insulator/AlGaN interface charge and undepleted Al-GaN barrier layer is presented for AlGaN/GaN metal-insulator-semiconductor heterostructure field effect transistors (MIS-HFETs) over the entire operation range of gate voltage. The whole process of charge control is analyzed in detail and partitioned into four regions: I—full depletion, II—partial depletion, III—neutral region and IV—electron accumulation at the insulator/AlGaN interface. The results show that two-dimensional electron gas (2DEG) saturates at the boundary of region II/III and the gate voltage should not exceed the 2DEG saturation voltage in order to keep the channel in control. In addition, the span of region II accounts for about 50% of the range of gate voltage before 2DEG saturates. The good agreement of the calculated transfer characteristic with the measured data confirms the validity of the proposed model.
A New Deferred Sentencing Scheme
N. K. Chakravarti
1968-10-01
Full Text Available A new deferred sentencing scheme resembling double sampling scheme has been suggested from viewpoint of operational and administrative. It is recommended particularly when the inspection is destructive. The O.C. curves of the scheme for two sample sizes of 5 and 10 have been given.
Bonus schemes and trading activity
Pikulina, E.S.; Renneboog, L.D.R.; ter Horst, J.R.; Tobler, P.N.
2014-01-01
Little is known about how different bonus schemes affect traders' propensity to trade and which bonus schemes improve traders' performance. We study the effects of linear versus threshold bonus schemes on traders' behavior. Traders buy and sell shares in an experimental stock market on the basis of
Bonus Schemes and Trading Activity
Pikulina, E.S.; Renneboog, L.D.R.; Ter Horst, J.R.; Tobler, P.N.
2013-01-01
Abstract: Little is known about how different bonus schemes affect traders’ propensity to trade and which bonus schemes improve traders’ performance. We study the effects of linear versus threshold (convex) bonus schemes on traders’ behavior. Traders purchase and sell shares in an experimental stock
Bonus schemes and trading activity
Pikulina, E.S.; Renneboog, L.D.R.; ter Horst, J.R.; Tobler, P.N.
2014-01-01
Little is known about how different bonus schemes affect traders' propensity to trade and which bonus schemes improve traders' performance. We study the effects of linear versus threshold bonus schemes on traders' behavior. Traders buy and sell shares in an experimental stock market on the basis of
Two Improved Digital Signature Schemes
无
2001-01-01
In this paper, two improved digital signature schemes are presented based on the design of directed signaturescheme [3]. The peculiarity of the system is that only if the scheme is specific recipient, the signature is authenticated.Since the scheme adds the screen of some information parameters, the difficulty of deciphered keys and the security ofdigital signature system are increased.
CONSIDERATIONS CONCERNING GUARANTEE SCHEMES
EMILIA CLIPICI
2013-05-01
Full Text Available When a large withdrawal from banks occurs, customers withdraw their deposits, so banks are likely to go bankrupt because of liquidity problems. There are several mechanisms that allow the banking system to avoid the phenomenon of massive withdrawals from banks. The most effective one is the deposit insurance. The deposit insurance is seen primarily as a means of protecting depositors of credit institutions, and secondly as a means of ensuring the stability of the banking system. This article described deposit guarantee scheme in Romania and other country.
Secure mediated certificateless signature scheme
YANG Chen; MA Wen-ping; WANG Xin-mei
2007-01-01
Ju et al proposed a certificateless signature scheme with instantaneous revocation by introducing security mediator (SEM) mechanism. This article presents a detailed cryptoanalysis of this scheme and shows that, in their proposed scheme, once a valid signature has been produced, the signer can recover his private key information and the instantaneous revocation property will be damaged. Furthermore, an improved mediated signature scheme, which can eliminate these disadvantages, is proposed, and security proof of the improved scheme under elliptic curve factorization problem (ECFP) assumption and bilinear computational diffie-hellman problem (BCDH) assumption is also proposed.
Geng, Huiping
2016-11-01
CEPC was proposed as an electron and positron collider ring with a circumference of 50-100 km to study the Higgs boson. Since the proposal was made, the lattice design for CEPC has been carried out and a preliminary conceptual design report has been written at the end of 2014. In this paper, we will describe the principles of pretzel scheme design, which is one of most important issues in CEPC lattice design. Then, we will show the modification of the lattice based on the lattice design shown in the Pre-CDR. The latest pretzel orbit design result will also be shown. The issues remained to be solved in the present design will be discussed and a brief summary will be given at the end.
Improved Ternary Subdivision Interpolation Scheme
WANG Huawei; QIN Kaihuai
2005-01-01
An improved ternary subdivision interpolation scheme was developed for computer graphics applications that can manipulate open control polygons unlike the previous ternary scheme, with the resulting curve proved to be still C2-continuous. Parameterizations of the limit curve near the two endpoints are given with expressions for the boundary derivatives. The split joint problem is handled with the interpolating ternary subdivision scheme. The improved scheme can be used for modeling interpolation curves in computer aided geometric design systems, and provides a method for joining two limit curves of interpolating ternary subdivisions.
Formal Verification of NTRUEncrypt Scheme
Gholam Reza Moghissi
2016-04-01
Full Text Available In this paper we explore a mechanized verification of the NTRUEncrypt scheme, with the formal proof system Isabelle/HOL. More precisely, the functional correctness of this algorithm, in its reduced form, is formally verified with computer support. We show that this scheme is correct what is a necessary condition for the usefulness of any cryptographic encryption scheme. Besides, we present a convenient and application specific formalization of the NTRUEncrypt scheme in the Isabelle/HOL system that can be used in further study around the functional and security analysis of NTRUEncrypt family.
AUTISTIC CHILDREN PROTECTION SCHEME
Dragan LUKIC
1998-09-01
Full Text Available The present article sets forth the theoretical grounds which make the basis for the organizational scheme of the autistic persons social protection. This protection consists of the below listed forms of work:· Health service with the role of an early detection and participation in the creation of rehabilitation programs;· Social protection with its programs of work from the diagnostics where the defectologist makes a team together with the physician and the psychologists to the systems of rehabilitation institutions where the defectologist’s is the main responsibility.The present article underlines two facts, namely:· that an autistic person requires to be followed and every spare moment used to promote and advance the activities the doer commenced himself instead of having him carry out the programs which are beyond his internal motivations and which he finds emotionally inaccessible;· that and form of work organization with autistic persons must subordinate its administrative part to the basic professional requirements this kind of disorder (handicap sets in front of each professional.
Chaotic communication scheme with multiplication
Bobreshov, A. M.; Karavaev, A. A.
2007-05-01
A new scheme of data transmission with nonlinear admixing is described, in which the two mutually inverse operations (multiplication and division) ensure multiplicative mixing of the informative and chaotic signals that provides a potentially higher degree of security. A special feature of the proposed scheme is the absence of limitations (related to the division by zero) imposed on the types of informative signals.
Homographic scheme for Riccati equation
Dubois, François
2011-01-01
In this paper we present a numerical scheme for the resolution of matrix Riccati equation, usualy used in control problems. The scheme is unconditionnaly stable and the solution is definite positive at each time step of the resolution. We prove the convergence in the scalar case and present several numerical experiments for classical test cases.
Differential operators and automorphism schemes
无
2010-01-01
The ring of global differential operators of a variety is in closed and deep relation with its automorphism scheme.This relation can be applied to the study of homogeneous schemes,giving some criteria of homogeneity,a generalization of Serre-Lang theorem,and some consequences about abelian varieties.
Satellite Spacecraft Charging Control Materials.
1980-04-01
reviewed by the Office of Public Affairs (ASD/Pk) and is releasable to the National Technical Information Service (NTIS). At NTIS, it will * be available...8217 electrique. TOME 2 - Dovument CERT/DERTS - Rapport final sur Phase 2 du Contrat ESA/ESTEC 3184/N477/HP(SC) 4 conductive materials must be joined
Electric vehicle battery charging controller
2016-01-01
to a battery management system in the electric vehicle to charge a battery therein, a first communication unit for receiving a charging message via a communication network, and a control unit for controlling a charging current provided from the charge source to the electric vehicle, the controlling at least...
The Occupational Pension Schemes Survey 2006
Sarah Levy; David Miller
2008-01-01
Presents findings on the number of schemes, their membership and contributions to schemes by employers and employeesThis article presents findings on the number of occupational pension schemes in 2006, their membership and contributions to schemes by employers and employees. It is based on the Occupational Pension Schemes Annual Report (2006 edition). The findings distinguish between public and private sector schemes and include breakdowns by scheme status (open, closed, frozen or winding up)...
Zhu, Wenbin; Chao, Ju-Hung; Chen, Chang-Jiang; Yin, Shizhuo; Hoffman, Robert C.
2016-01-01
In this paper, we report a three orders-of-magnitude increase in the speed of a space-charge-controlled KTN beam deflector achieved by eliminating the electric field-induced phase transition (EFIPT) in a nanodisordered KTN crystal. Previously, to maximize the electro-optic effect, a KTN beam deflector was operated at a temperature slightly above the Curie temperature. The electric field could cause the KTN to undergo a phase transition from the paraelectric phase to the ferroelectric phase at this temperature, which causes the deflector to operate in the linear electro-optic regime. Since the deflection angle of the deflector is proportional to the space charge distribution but not the magnitude of the applied electric field, the scanning speed of the beam deflector is limited by the electron mobility within the KTN crystal. To overcome this speed limitation caused by the EFIPT, we propose to operate the deflector at a temperature above the critical end point. This results in a significant increase in the scanning speed from the microsecond to nanosecond regime, which represents a major technological advance in the field of fast speed beam scanners. This can be highly beneficial for many applications including high-speed imaging, broadband optical communications, and ultrafast laser display and printing. PMID:27610923
Zhu, Wenbin; Chao, Ju-Hung; Chen, Chang-Jiang; Yin, Shizhuo; Hoffman, Robert C.
2016-09-01
In this paper, we report a three orders-of-magnitude increase in the speed of a space-charge-controlled KTN beam deflector achieved by eliminating the electric field-induced phase transition (EFIPT) in a nanodisordered KTN crystal. Previously, to maximize the electro-optic effect, a KTN beam deflector was operated at a temperature slightly above the Curie temperature. The electric field could cause the KTN to undergo a phase transition from the paraelectric phase to the ferroelectric phase at this temperature, which causes the deflector to operate in the linear electro-optic regime. Since the deflection angle of the deflector is proportional to the space charge distribution but not the magnitude of the applied electric field, the scanning speed of the beam deflector is limited by the electron mobility within the KTN crystal. To overcome this speed limitation caused by the EFIPT, we propose to operate the deflector at a temperature above the critical end point. This results in a significant increase in the scanning speed from the microsecond to nanosecond regime, which represents a major technological advance in the field of fast speed beam scanners. This can be highly beneficial for many applications including high-speed imaging, broadband optical communications, and ultrafast laser display and printing.
Schemes for Deterministic Polynomial Factoring
Ivanyos, Gábor; Saxena, Nitin
2008-01-01
In this work we relate the deterministic complexity of factoring polynomials (over finite fields) to certain combinatorial objects we call m-schemes. We extend the known conditional deterministic subexponential time polynomial factoring algorithm for finite fields to get an underlying m-scheme. We demonstrate how the properties of m-schemes relate to improvements in the deterministic complexity of factoring polynomials over finite fields assuming the generalized Riemann Hypothesis (GRH). In particular, we give the first deterministic polynomial time algorithm (assuming GRH) to find a nontrivial factor of a polynomial of prime degree n where (n-1) is a smooth number.
Coordinated renewable energy support schemes
Morthorst, P.E.; Jensen, S.G.
2006-01-01
This paper illustrates the effect that can be observed when support schemes for renewable energy are regionalised. Two theoretical examples are used to explain interactive effects on, e.g., the price of power, conditions for conventional power producers, and changes in import and export of power...... RES-E support schemes already has a common liberalised power market. In this case the introduction of a common support scheme for renewable technologies will lead to more efficient sitings of renewable plants, improving economic and environmental performance of the total power system...
Provable Secure Identity Based Generalized Signcryption Scheme
Yu, Gang; Shen, Yong; Han, Wenbao
2010-01-01
According to actual needs, generalized signcryption scheme can flexibly work as an encryption scheme, a signature scheme or a signcryption scheme. In this paper, firstly, we give a security model for identity based generalized signcryption which is more complete than existing model. Secondly, we propose an identity based generalized signcryption scheme. Thirdly, we give the security proof of the new scheme in this complete model. Comparing with existing identity based generalized signcryption, the new scheme has less implementation complexity. Moreover, the new scheme has comparable computation complexity with the existing normal signcryption schemes.
Underground hydro scheme for Ullapool
无
2002-01-01
Scoltish and Southern Energy has awarded a contract for a new hydropower plant Scotland, the company's first hydro project since the 1960s. The S6 million scheme will be built by Miller Civil Engineering Services Ltd.
Rotbart, Noy Galil
evaluation of fully dynamic labeling schemes. Due to a connection between adjacency labeling schemes and the graph theoretical study of induced universal graphs, we study these in depth and show novel results for bounded degree graphs and power-law graphs. We also survey and make progress on the related......With ever increasing size of graphs, many distributed graph systems emerged to store, preprocess and analyze them. While such systems ease up congestion on servers, they incur certain penalties compared to centralized data structure. First, the total storage required to store a graph...... in a distributed fashion increases. Second, attempting to answer queries on vertices of a graph stored in a distributed fashion can be significantly more complicated. In order to lay theoretical foundations to the first penalty mentioned a large body of work concentrated on labeling schemes. A labeling scheme...
Capacity-achieving CPM schemes
Perotti, Alberto; Benedetto, Sergio; Montorsi, Guido
2008-01-01
The pragmatic approach to coded continuous-phase modulation (CPM) is proposed as a capacity-achieving low-complexity alternative to the serially-concatenated CPM (SC-CPM) coding scheme. In this paper, we first perform a selection of the best spectrally-efficient CPM modulations to be embedded into SC-CPM schemes. Then, we consider the pragmatic capacity (a.k.a. BICM capacity) of CPM modulations and optimize it through a careful design of the mapping between input bits and CPM waveforms. The so obtained schemes are cascaded with an outer serially-concatenated convolutional code to form a pragmatic coded-modulation system. The resulting schemes exhibit performance very close to the CPM capacity without requiring iterations between the outer decoder and the CPM demodulator. As a result, the receiver exhibits reduced complexity and increased flexibility due to the separation of the demodulation and decoding functions.
Good governance for pension schemes
Thornton, Paul
2011-01-01
Regulatory and market developments have transformed the way in which UK private sector pension schemes operate. This has increased demands on trustees and advisors and the trusteeship governance model must evolve in order to remain fit for purpose. This volume brings together leading practitioners to provide an overview of what today constitutes good governance for pension schemes, from both a legal and a practical perspective. It provides the reader with an appreciation of the distinctive characteristics of UK occupational pension schemes, how they sit within the capital markets and their social and fiduciary responsibilities. Providing a holistic analysis of pension risk, both from the trustee and the corporate perspective, the essays cover the crucial role of the employer covenant, financing and investment risk, developments in longevity risk hedging and insurance de-risking, and best practice scheme administration.
A Novel Iris Segmentation Scheme
Chen-Chung Liu
2014-01-01
Full Text Available One of the key steps in the iris recognition system is the accurate iris segmentation from its surrounding noises including pupil, sclera, eyelashes, and eyebrows of a captured eye-image. This paper presents a novel iris segmentation scheme which utilizes the orientation matching transform to outline the outer and inner iris boundaries initially. It then employs Delogne-Kåsa circle fitting (instead of the traditional Hough transform to further eliminate the outlier points to extract a more precise iris area from an eye-image. In the extracted iris region, the proposed scheme further utilizes the differences in the intensity and positional characteristics of the iris, eyelid, and eyelashes to detect and delete these noises. The scheme is then applied on iris image database, UBIRIS.v1. The experimental results show that the presented scheme provides a more effective and efficient iris segmentation than other conventional methods.
An arbitrated quantum signature scheme
Zeng, G; Zeng, Guihua; Keitel, Christoph H.
2002-01-01
The general principle for a quantum signature scheme is proposed and investigated based on ideas from classical signature schemes and quantum cryptography. The suggested algorithm is implemented by a symmetrical quantum key cryptosystem and Greenberger-Horne-Zeilinger (GHZ) triplet states and relies on the availability of an arbitrator. We can guarantee the unconditional security of the algorithm, mostly due to the correlation of the GHZ triplet states and the use of quantum one-time pads.
Breeding schemes in reindeer husbandry
Lars Rönnegård
2003-04-01
Full Text Available The objective of the paper was to investigate annual genetic gain from selection (G, and the influence of selection on the inbreeding effective population size (Ne, for different possible breeding schemes within a reindeer herding district. The breeding schemes were analysed for different proportions of the population within a herding district included in the selection programme. Two different breeding schemes were analysed: an open nucleus scheme where males mix and mate between owner flocks, and a closed nucleus scheme where the males in non-selected owner flocks are culled to maximise G in the whole population. The theory of expected long-term genetic contributions was used and maternal effects were included in the analyses. Realistic parameter values were used for the population, modelled with 5000 reindeer in the population and a sex ratio of 14 adult females per male. The standard deviation of calf weights was 4.1 kg. Four different situations were explored and the results showed: 1. When the population was randomly culled, Ne equalled 2400. 2. When the whole population was selected on calf weights, Ne equalled 1700 and the total annual genetic gain (direct + maternal in calf weight was 0.42 kg. 3. For the open nucleus scheme, G increased monotonically from 0 to 0.42 kg as the proportion of the population included in the selection programme increased from 0 to 1.0, and Ne decreased correspondingly from 2400 to 1700. 4. In the closed nucleus scheme the lowest value of Ne was 1300. For a given proportion of the population included in the selection programme, the difference in G between a closed nucleus scheme and an open one was up to 0.13 kg. We conclude that for mass selection based on calf weights in herding districts with 2000 animals or more, there are no risks of inbreeding effects caused by selection.
On Photovoltaic Intelligent Charging Control System Based on MPPT%基于MPPT的太阳能智能充电控制系统
宫子媛; 郭晓瑞
2016-01-01
Aiming at the problem of energy conversion efficiency in the photovoltaic intelligent char-ging control system,this paper analyzes the output characteristics of solar cell and battery charging and discharging characteristics.A maximum power point tracking (MPPT)algorithm is researched by in-tegrating the conventional incremental conductance method with perturb and observe method for seeking the maximum power point.The designed control system can not only improve the photoelectric transfor-mation efficiency and the conversion efficiency of DC/DC circuit but also ensure the reliability of system.%针对太阳能智能充电控制系统中的能量转换效率问题，分析了光伏电池的输出特性以及蓄电池的充放电特点，结合增量电导法和扰动观察法两种常用的最大功率点跟踪(MPPT)控制方法，研究设计了一种最大功率点跟踪分区算法，实现了最大功率点跟踪控制及降压变换器电路控制，在提升光电转化效率及 DC/DC 模块充电效率的同时，保证了智能充电模块工作的可靠性。
Provable Secure Identity Based Generalized Signcryption Scheme
Yu, Gang; Ma, Xiaoxiao; Shen, Yong; Han, Wenbao
2010-01-01
According to actual needs, generalized signcryption scheme can flexibly work as an encryption scheme, a signature scheme or a signcryption scheme. In this paper, firstly, we give a security model for identity based generalized signcryption which is more complete than existing model. Secondly, we propose an identity based generalized signcryption scheme. Thirdly, we give the security proof of the new scheme in this complete model. Comparing with existing identity based generalized signcryption...
Multiuser switched diversity scheduling schemes
Shaqfeh, Mohammad
2012-09-01
Multiuser switched-diversity scheduling schemes were recently proposed in order to overcome the heavy feedback requirements of conventional opportunistic scheduling schemes by applying a threshold-based, distributed, and ordered scheduling mechanism. The main idea behind these schemes is that slight reduction in the prospected multiuser diversity gains is an acceptable trade-off for great savings in terms of required channel-state-information feedback messages. In this work, we characterize the achievable rate region of multiuser switched diversity systems and compare it with the rate region of full feedback multiuser diversity systems. We propose also a novel proportional fair multiuser switched-based scheduling scheme and we demonstrate that it can be optimized using a practical and distributed method to obtain the feedback thresholds. We finally demonstrate by numerical examples that switched-diversity scheduling schemes operate within 0.3 bits/sec/Hz from the ultimate network capacity of full feedback systems in Rayleigh fading conditions. © 2012 IEEE.
Optimal probabilistic dense coding schemes
Kögler, Roger A.; Neves, Leonardo
2017-04-01
Dense coding with non-maximally entangled states has been investigated in many different scenarios. We revisit this problem for protocols adopting the standard encoding scheme. In this case, the set of possible classical messages cannot be perfectly distinguished due to the non-orthogonality of the quantum states carrying them. So far, the decoding process has been approached in two ways: (i) The message is always inferred, but with an associated (minimum) error; (ii) the message is inferred without error, but only sometimes; in case of failure, nothing else is done. Here, we generalize on these approaches and propose novel optimal probabilistic decoding schemes. The first uses quantum-state separation to increase the distinguishability of the messages with an optimal success probability. This scheme is shown to include (i) and (ii) as special cases and continuously interpolate between them, which enables the decoder to trade-off between the level of confidence desired to identify the received messages and the success probability for doing so. The second scheme, called multistage decoding, applies only for qudits ( d-level quantum systems with d>2) and consists of further attempts in the state identification process in case of failure in the first one. We show that this scheme is advantageous over (ii) as it increases the mutual information between the sender and receiver.
Energy partitioning schemes: a dilemma.
Mayer, I
2007-01-01
Two closely related energy partitioning schemes, in which the total energy is presented as a sum of atomic and diatomic contributions by using the "atomic decomposition of identity", are compared on the example of N,N-dimethylformamide, a simple but chemically rich molecule. Both schemes account for different intramolecular interactions, for instance they identify the weak C-H...O intramolecular interactions, but give completely different numbers. (The energy decomposition scheme based on the virial theorem is also considered.) The comparison of the two schemes resulted in a dilemma which is especially striking when these schemes are applied for molecules distorted from their equilibrium structures: one either gets numbers which are "on the chemical scale" and have quite appealing values at the equilibrium molecular geometries, but exhibiting a counter-intuitive distance dependence (the two-center energy components increase in absolute value with the increase of the interatomic distances)--or numbers with too large absolute values but "correct" distance behaviour. The problem is connected with the quick decay of the diatomic kinetic energy components.
Distance labeling schemes for trees
Alstrup, Stephen; Gørtz, Inge Li; Bistrup Halvorsen, Esben
2016-01-01
We consider distance labeling schemes for trees: given a tree with n nodes, label the nodes with binary strings such that, given the labels of any two nodes, one can determine, by looking only at the labels, the distance in the tree between the two nodes. A lower bound by Gavoille et al. [Gavoille...... variants such as, for example, small distances in trees [Alstrup et al., SODA, 2003]. We improve the known upper and lower bounds of exact distance labeling by showing that 1/4 log2(n) bits are needed and that 1/2 log2(n) bits are sufficient. We also give (1 + ε)-stretch labeling schemes using Theta......(log(n)) bits for constant ε> 0. (1 + ε)-stretch labeling schemes with polylogarithmic label size have previously been established for doubling dimension graphs by Talwar [Talwar, STOC, 2004]. In addition, we present matching upper and lower bounds for distance labeling for caterpillars, showing that labels...
Electrical Injection Schemes for Nanolasers
Lupi, Alexandra; Chung, Il-Sug; Yvind, Kresten
2014-01-01
Three electrical injection schemes based on recently demonstrated electrically pumped photonic crystal nanolasers have been numerically investigated: 1) a vertical p-i-n junction through a post structure; 2) a lateral p-i-n junction with a homostructure; and 3) a lateral p-i-n junction....... For this analysis, the properties of different schemes, i.e., electrical resistance, threshold voltage, threshold current, and internal efficiency as energy requirements for optical interconnects are compared and the physics behind the differences is discussed....
Small-scale classification schemes
Hertzum, Morten
2004-01-01
. While coordination mechanisms focus on how classification schemes enable cooperation among people pursuing a common goal, boundary objects embrace the implicit consequences of classification schemes in situations involving conflicting goals. Moreover, the requirements specification focused on functional...... requirements and provided little information about why these requirements were considered relevant. This stands in contrast to the discussions at the project meetings where the software engineers made frequent use of both abstract goal descriptions and concrete examples to make sense of the requirements....... This difference between the written requirements specification and the oral discussions at the meetings may help explain software engineers general preference for people, rather than documents, as their information sources....
Efficient adaptive fuzzy control scheme
Papp, Z.; Driessen, B.J.F.
1995-01-01
The paper presents an adaptive nonlinear (state-) feedback control structure, where the nonlinearities are implemented as smooth fuzzy mappings defined as rule sets. The fine tuning and adaption of the controller is realized by an indirect adaptive scheme, which modifies the parameters of the fuzzy
Homogenization scheme for acoustic metamaterials
Yang, Min
2014-02-26
We present a homogenization scheme for acoustic metamaterials that is based on reproducing the lowest orders of scattering amplitudes from a finite volume of metamaterials. This approach is noted to differ significantly from that of coherent potential approximation, which is based on adjusting the effective-medium parameters to minimize scatterings in the long-wavelength limit. With the aid of metamaterials’ eigenstates, the effective parameters, such as mass density and elastic modulus can be obtained by matching the surface responses of a metamaterial\\'s structural unit cell with a piece of homogenized material. From the Green\\'s theorem applied to the exterior domain problem, matching the surface responses is noted to be the same as reproducing the scattering amplitudes. We verify our scheme by applying it to three different examples: a layered lattice, a two-dimensional hexagonal lattice, and a decorated-membrane system. It is shown that the predicted characteristics and wave fields agree almost exactly with numerical simulations and experiments and the scheme\\'s validity is constrained by the number of dominant surface multipoles instead of the usual long-wavelength assumption. In particular, the validity extends to the full band in one dimension and to regimes near the boundaries of the Brillouin zone in two dimensions.
Distance labeling schemes for trees
Alstrup, Stephen; Gørtz, Inge Li; Bistrup Halvorsen, Esben;
2016-01-01
We consider distance labeling schemes for trees: given a tree with n nodes, label the nodes with binary strings such that, given the labels of any two nodes, one can determine, by looking only at the labels, the distance in the tree between the two nodes. A lower bound by Gavoille et al. [Gavoill...
Distance labeling schemes for trees
Alstrup, Stephen; Gørtz, Inge Li; Bistrup Halvorsen, Esben
2016-01-01
variants such as, for example, small distances in trees [Alstrup et al., SODA, 2003]. We improve the known upper and lower bounds of exact distance labeling by showing that 1/4 log2(n) bits are needed and that 1/2 log2(n) bits are sufficient. We also give (1 + ε)-stretch labeling schemes using Theta...
Quantum group blind signature scheme without entanglement
Xu, Rui; Huang, Liusheng; Yang, Wei; He, Libao
2011-07-01
In this paper we propose a quantum group blind signature scheme designed for distributed e-voting system. Our scheme combines the properties of group signature and blind signature to provide anonymity of voters in an e-voting system. The unconditional security of our scheme is ensured by quantum mechanics. Without employing entanglement, the proposed scheme is easier to be realized comparing with other quantum signature schemes.
Fair Electronic Payment Scheme Based on DSA
WANG Shao-bin; HONG Fan; ZHU Xian
2005-01-01
We present a multi-signature scheme based on DSA and describes a fair electronic payment scheme based on improved DSA signatures. The scheme makes both sides in equal positions during the course of electronic transaction. A Trusted Third Party (TTP) is involved in the scheme to guarantee the fairness of the scheme for both sides. However, only during the course of registration and dispute resolution will TTP be needed. TTP is not needed during the normal payment stage.
WEIGHTED COMPACT SCHEME FOR SHOCK CAPTURING
无
2001-01-01
A new class of finite difference schemes--the weighted compact schemes are proposed. According to the idea of the WENO schemes, the weighted compact scheme is constructed by a combination of the approximations of derivatives on candidate stencils with properly assigned weights so that the non-oscillatory property is achieved when discontinuities appear. The primitive function reconstruction method of ENO schemes is applied to obtain the conservative form of the weighted compact scheme. This new scheme not only preserves the characteristic of standard compact schemes and achieves high order accuracy and high resolution using a compact stencil,but also can accurately capture shock waves and discontinuities without oscillation, Numerical examples show that the new scheme is very promising and successful.``
Dual Watermarking Scheme with Encryption
Dhanalakshmi, R
2010-01-01
Digital Watermarking is used for copyright protection and authentication. In the proposed system, a Dual Watermarking Scheme based on DWT SVD with chaos encryption algorithm, will be developed to improve the robustness and protection along with security. DWT and SVD have been used as a mathematical tool to embed watermark in the image. Two watermarks are embedded in the host image. The secondary is embedded into primary watermark and the resultant watermarked image is encrypted using chaos based logistic map. This provides an efficient and secure way for image encryption and transmission. The watermarked image is decrypted and a reliable watermark extraction scheme is developed for the extraction of the primary as well as secondary watermark from the distorted image.
Ion Polarization Scheme for MEIC
Kondratenko, A M; Filatov, Yu N; Derbenev, Ya S; Lin, F; Morozov, V S; Zhang, Y
2016-01-01
The choice of a figure 8 shape for the booster and collider rings of MEIC opens wide possibilities for preservation of the ion polarization during beam acceleration as well as for control of the polarization at the collider's interaction points. As in the case of accelerators with Siberian snakes, the spin tune is energy independent but is equal to zero instead of one half. The figure-8 topology eliminates the effect of arcs on the spin motion. There appears a unique opportunity to control the polarization of any particle species including deuterons, using longitudinal fields of small integrated strength (weak solenoids). Contrary to existing schemes, using weak solenoids in figure-8 colliders, one can control the polarization at the interaction points without essentially any effect on the beam's orbital characteristics. A universal scheme for control of the polarization using weak solenoids provides an elegant solution to the problem of ion acceleration completely eliminating resonant beam depolarization. It...
Wrong way recollement for schemes
Jorgensen, Peter
2005-01-01
A recollement of triangulated categories makes it possible to view one such category as being glued together from two others. The prototypical example is that D(X), a suitable derived category of sheaves on the topological space X, has a recollement in terms of D(Z) and D(U) when Z is a closed subset of X and U is the open complement. This note gives a different, "wrong way" recollement in the scheme case.
Parabolic sheaves on logarithmic schemes
Borne, Niels; Vistoli, Angelo
2010-01-01
We show how the natural context for the definition of parabolic sheaves on a scheme is that of logarithmic geometry. The key point is a reformulation of the concept of logarithmic structure in the language of symmetric monoidal categories, which might be of independent interest. Our main result states that parabolic sheaves can be interpreted as quasi-coherent sheaves on certain stacks of roots.
Mohammad Al-Fayoumi
2010-05-01
Full Text Available E-payment is now one of the most central research areas in e-commerce, mainly regarding online and offline payment scenarios. Customers are generally passive in e-commerce transaction. Relied on a blind signature, this paper introduces an e-payment protocol, in which customers have more initiative, and can terminate the transaction before possible cheats, its security is enhanced. Moreover, the cost of workers and communications falls down considerably while the cost of trusted authority and protecting information is increased. As there is no trusted authority in the proposed scheme, network overcrowding and conspiracy problems can be avoided. Furthermore, the protocol satisfies fairness and non-repudiation. This helps merchant and bank to speed up the financial transaction process and to give user instant services at any time. Also, in this paper, we will discuss an important e-payment protocol namely pay-word scheme and examine its advantages and limitations, which encourages the authors to improve the scheme that keeps all characteristics intact without compromise of the security robustness. The suggested protocol employs the idea of blind signature with the thought of hash chain. We will compare the proposed protocol with pay-word protocol and demonstrate that the proposed protocol offers more security and efficiency, which makes the protocol workable for real world services.
Cambridge community Optometry Glaucoma Scheme.
Keenan, Jonathan; Shahid, Humma; Bourne, Rupert R; White, Andrew J; Martin, Keith R
2015-04-01
With a higher life expectancy, there is an increased demand for hospital glaucoma services in the United Kingdom. The Cambridge community Optometry Glaucoma Scheme (COGS) was initiated in 2010, where new referrals for suspected glaucoma are evaluated by community optometrists with a special interest in glaucoma, with virtual electronic review and validation by a consultant ophthalmologist with special interest in glaucoma. 1733 patients were evaluated by this scheme between 2010 and 2013. Clinical assessment is performed by the optometrist at a remote site. Goldmann applanation tonometry, pachymetry, monoscopic colour optic disc photographs and automated Humphrey visual field testing are performed. A clinical decision is made as to whether a patient has glaucoma or is a suspect, and referred on or discharged as a false positive referral. The clinical findings, optic disc photographs and visual field test results are transmitted electronically for virtual review by a consultant ophthalmologist. The number of false positive referrals from initial referral into the scheme. Of the patients, 46.6% were discharged at assessment and a further 5.7% were discharged following virtual review. Of the patients initially discharged, 2.8% were recalled following virtual review. Following assessment at the hospital, a further 10.5% were discharged after a single visit. The COGS community-based glaucoma screening programme is a safe and effective way of evaluating glaucoma referrals in the community and reducing false-positive referrals for glaucoma into the hospital system. © 2014 Royal Australian and New Zealand College of Ophthalmologists.
A biometric signcryption scheme without bilinear pairing
Wang, Mingwen; Ren, Zhiyuan; Cai, Jun; Zheng, Wentao
2013-03-01
How to apply the entropy in biometrics into the encryption and remote authentication schemes to simplify the management of keys is a hot research area. Utilizing Dodis's fuzzy extractor method and Liu's original signcryption scheme, a biometric identity based signcryption scheme is proposed in this paper. The proposed scheme is more efficient than most of the previous proposed biometric signcryption schemes for that it does not need bilinear pairing computation and modular exponentiation computation which is time consuming largely. The analysis results show that under the CDH and DL hard problem assumption, the proposed scheme has the features of confidentiality and unforgeability simultaneously.
Algebraic K-theory of generalized schemes
Anevski, Stella Victoria Desiree
Nikolai Durov has developed a generalization of conventional scheme theory in which commutative algebraic monads replace commutative unital rings as the basic algebraic objects. The resulting geometry is expressive enough to encompass conventional scheme theory, tropical algebraic geometry...
Wireless Broadband Access and Accounting Schemes
无
2003-01-01
In this paper, we propose two wireless broadband access and accounting schemes. In both schemes, the accounting system adopts RADIUS protocol, but the access system adopts SSH and SSL protocols respectively.
Elliptic Curve Blind Digital Signature Schemes
YOULin; YANGYixian; WENQiaoyan
2003-01-01
Blind signature schemes are important cryptographic protocols in guaranteeing the privacy or anonymity of the users.Three new blind signature schemes and their corresponding generalizations are pro-posed. Moreover, their securities are simply analyzed.
Algebraic K-theory of generalized schemes
Anevski, Stella Victoria Desiree
Nikolai Durov has developed a generalization of conventional scheme theory in which commutative algebraic monads replace commutative unital rings as the basic algebraic objects. The resulting geometry is expressive enough to encompass conventional scheme theory, tropical algebraic geometry...
Secret sharing scheme with inherited characteristic
Ye Zhenjun; Meng Fanzhen
2006-01-01
To assure the shareholders can look for their "legal" attorneys to renew the secret, once the secret sharing scheme is initialized, a secret sharing scheme with inherited characteristic is constructed. In this scheme, each shareholder can produce a new share by his algorithm, which is equivalent to the primary one. Together with other shares, the primary secret can be renewed. Since this scheme is constructed not by replacing the primary share with a new share produced by the dealer in his primitive secret sharing scheme, so no matter how much shares the shareholder produces, these shares can not be gathered together to renew the secret in this scheme. Compared with the existing secret sharing schemes, this scheme provides more agility for the shareholders by investing each of them a function but not affect its security.
Linear multi-secret sharing schemes
XIAO Liangliang; LIU Mulan
2005-01-01
In this paper the linear multi-secret sharing schemes are studied by using monotone span programs. A relation between computing monotone Boolean functions by using monotone span programs and realizing multi-access structures by using linear multisecret sharing schemes is shown. Furthermore, the concept of optimal linear multi-secret sharing scheme is presented and the several schemes are proved to be optimal.
Improvement of publicly verifiable authenticated encryption scheme
LEI Fei-yu; CHEN Wen; MA Chang-she; CHEN Ke-fei
2007-01-01
A weakness of unforgeability is found in Ma and Chen scheme, and the root cause is the susceptive linear design in the scheme. In order to avoid the weakness and susceptive linear design, an improvement by means of two mechanisms including quadratic residue and composite discrete logarithm is proposed, which can defeat the forgery attacks in Ma and Chen scheme. The new scheme remains good confidentiality, public verifiability and efficiency.
A massive momentum-subtraction scheme
Boyle, Peter; Khamseh, Ava
2016-01-01
A new renormalization scheme is defined for fermion bilinears in QCD at non vanishing quark masses. This new scheme, denoted RI/mSMOM, preserves the benefits of the nonexceptional momenta introduced in the RI/SMOM scheme, and allows a definition of renormalized composite fields away from the chiral limit. Some properties of the scheme are investigated by performing explicit one-loop computation in dimensional regularization.
MIRD radionuclide data and decay schemes
Eckerman, Keith F
2007-01-01
For all physicians, scientists, and physicists working in the nuclear medicine field, the MIRD: Radionuclide Data and Decay Schemes updated edition is an essential sourcebook for radiation dosimetry and understanding the properties of radionuclides. Includes CD Table of Contents Decay schemes listed by atomic number Radioactive decay processes Serial decay schemes Decay schemes and decay tables This essential reference for nuclear medicine physicians, scientists and physicists also includes a CD with tabulations of the radionuclide data necessary for dosimetry calculations.
Comparative study of numerical schemes of TVD3, UNO3-ACM and optimized compact scheme
Lee, Duck-Joo; Hwang, Chang-Jeon; Ko, Duck-Kon; Kim, Jae-Wook
1995-01-01
Three different schemes are employed to solve the benchmark problem. The first one is a conventional TVD-MUSCL (Monotone Upwind Schemes for Conservation Laws) scheme. The second scheme is a UNO3-ACM (Uniformly Non-Oscillatory Artificial Compression Method) scheme. The third scheme is an optimized compact finite difference scheme modified by us: the 4th order Runge Kutta time stepping, the 4th order pentadiagonal compact spatial discretization with the maximum resolution characteristics. The problems of category 1 are solved by using the second (UNO3-ACM) and third (Optimized Compact) schemes. The problems of category 2 are solved by using the first (TVD3) and second (UNO3-ACM) schemes. The problem of category 5 is solved by using the first (TVD3) scheme. It can be concluded from the present calculations that the Optimized Compact scheme and the UN03-ACM show good resolutions for category 1 and category 2 respectively.
Population Monotonic Path Schemes for Simple Games
Ciftci, B.B.; Borm, P.E.M.; Hamers, H.J.M.
2006-01-01
A path scheme for a simple game is composed of a path, i.e., a sequence of coalitions that is formed during the coalition formation process and a scheme, i.e., a payoff vector for each coalition in the path.A path scheme is called population monotonic if a player's payoff does not decrease as the pa
A new semi-Lagrangian difference scheme
季仲贞; 陈嘉滨
2001-01-01
A new completely energy-conserving semi-Lagrangian scheme is constructed. The numerical solution of shallow water equation shows that this conservative scheme preserves the total energy in twelve significant digits, while the traditional scheme does only in five significant digits.
Arbitrated quantum signature scheme with message recovery
Lee, Hwayean; Hong, Changho; Kim, Hyunsang; Lim, Jongin; Yang, Hyung Jin
2004-02-16
Two quantum signature schemes with message recovery relying on the availability of an arbitrator are proposed. One scheme uses a public board and the other does not. However both schemes provide confidentiality of the message and a higher efficiency in transmission.
Quantum Signature Scheme with Weak Arbitrator
Luo, Ming-Xing; Chen, Xiu-Bo; Yun, Deng; Yang, Yi-Xian
2012-07-01
In this paper, we propose one quantum signature scheme with a weak arbitrator to sign classical messages. This scheme can preserve the merits in the original arbitrated scheme with some entanglement resources, and provide a higher efficiency in transmission and reduction the complexity of implementation. The arbitrator is costless and only involved in the disagreement case.
Current terminology and diagnostic classification schemes.
Okeson, J P
1997-01-01
This article reviews the current terminology and classification schemes available for temporomandibular disorders. The origin of each term is presented, and the classification schemes that have been offered for temporomandibular disorders are briefly reviewed. Several important classifications are presented in more detail, with mention of advantages and disadvantages. Final recommendations are provided for future direction in the area of classification schemes.
A Model of Hierarchical Key Assignment Scheme
ZHANG Zhigang; ZHAO Jing; XU Maozhi
2006-01-01
A model of the hierarchical key assignment scheme is approached in this paper, which can be used with any cryptography algorithm. Besides, the optimal dynamic control property of a hierarchical key assignment scheme will be defined in this paper. Also, our scheme model will meet this property.
Support Schemes and Ownership Structures
Ropenus, Stephanie; Schröder, Sascha Thorsten; Costa, Ana
In recent years, fuel cell based micro‐combined heat and power has received increasing attention due to its potential contribution to energy savings, efficiency gains, customer proximity and flexibility in operation and capacity size. The FC4Home project assesses technical and economic aspects...... for promoting combined heat and power and energy from renewable sources. These Directives are to be implemented at the national level by the Member States. Section 3 conceptually presents the spectrum of national support schemes, ranging from investment support to market‐based operational support. The choice...
Banks, Tom; Torres, T. J.
2012-10-01
We summarize recent work in which we attempt to make consistent models of LHC physics, from the Pyramid Scheme. The models share much with the NMSSM, in particular, enhanced tree level contributions to the Higgs mass and a preference for small tan β. There are three different singlet fields, and a new strongly coupled gauge theory, so the constraints of perturbative unification are quite different. We outline our general approach to the model, which contains a Kähler potential for three of the low energy fields, which is hard to calculate. Detailed calculations, based on approximations to the Kähler potential, will be presented in a future publication.
High Power Fast-charged Control Circuit KM-94-2 and Its Application%大功率快充控制电路KM-94-2的应用
胡大友; 李新
2000-01-01
This paper proposes a high power & fast-charged control circuit KM-94-2 and describes its function, constitution and theory. The fast-charged application circuit based on KM94-2 is also offered.%描述了一种大功率快速充电控制电路KM-94-2的电路功能、构成及原理，并给出了以KM-94-2为核心的快速充电应用电路。
REMINDER: Saved Leave Scheme (SLS)
2003-01-01
Transfer of leave to saved leave accounts Under the provisions of the voluntary saved leave scheme (SLS), a maximum total of 10 days'* annual and compensatory leave (excluding saved leave accumulated in accordance with the provisions of Administrative Circular No 22B) can be transferred to the saved leave account at the end of the leave year (30 September). We remind you that unused leave of all those taking part in the saved leave scheme at the closure of the leave year accounts is transferred automatically to the saved leave account on that date. Therefore, staff members have no administrative steps to take. In addition, the transfer, which eliminates the risk of omitting to request leave transfers and rules out calculation errors in transfer requests, will be clearly shown in the list of leave transactions that can be consulted in EDH from October 2003 onwards. Furthermore, this automatic leave transfer optimizes staff members' chances of benefiting from a saved leave bonus provided that they ar...
Pseudorandomness of Camellia-Like Scheme
Wen-Ling Wu
2006-01-01
Luby and Rackoff idealized DES by replacing each round function with one large random function. In this paper, the author idealizes Camellia by replacing each S-box with one small random function, which is named Camellialike scheme. It is then proved that five-round Camellia-like scheme is pseudorandom and eight-round Camellia-like scheme is super-pseudorandom for adaptive adversaries. Further the paper considers more efficient construction of Camellia-like scheme, and discusses how to construct pseudorandom Camellia-like scheme from less random functions.
Modification of QUICK scheme by skew points
Mirzaei, M.; Mohammadi, R.; Malekzadeh, M. [K.N. Toosi Univ. of Technology, Aerospace Engineering Dept., Tehran (Iran, Islamic Republic of)]. E-mail: Mirzaei@kntu.ac.ir
2005-07-01
This paper presents a new method for convective flux approximation based on inclusions of skew points. The scheme uses the truncated terms of QUICK scheme and with the aid of an equation extracted from momentum equations, the skew points will appear in the convective flux formula. The results show that the presented scheme has better accuracy than the other schemes. Diffusion fluxes are approximated using power law scheme and for evaluation of the performance of the presented method several test cases were carried out and the results are compared with the results of other numerical works and experimental data. (author)
A Provably Secure Asynchronous Proactive RSA Scheme
ZHANG Rui-shan; LI Qiang; CHEN Ke-fei
2005-01-01
The drawback of the first asynchronous proactive RSA scheme presented by Zhou in 2001, is that the se curity definition and security proof do not follow the approach of provable security. This paper presented a provably secure asynchronous proactive RSA scheme, which includes three protocols: initial key distribution protocol,signature generation protocol and share refreshing protocol. Taken these protocols together, a complete provably secure proactive RSA scheme was obtained. And the efficiency of the scheme is approximate to that of the scheme of Zhou.
Hash function based secret sharing scheme designs
Chum, Chi Sing
2011-01-01
Secret sharing schemes create an effective method to safeguard a secret by dividing it among several participants. By using hash functions and the herding hashes technique, we first set up a (t+1, n) threshold scheme which is perfect and ideal, and then extend it to schemes for any general access structure. The schemes can be further set up as proactive or verifiable if necessary. The setup and recovery of the secret is efficient due to the fast calculation of the hash function. The proposed scheme is flexible because of the use of existing hash functions.
A New Signature Scheme with Shared Verification
JIA Xiao-yun; LUO Shou-shan; YUAN Chao-wei
2006-01-01
With expanding user demands, digital signature techniques are also being expanded greatly, from single signature and single verification techniques to techniques supporting multi-users. This paper presents a new digital signature scheme vith shared verification based on the fiat-shamir signature scheme. This scheme is suitable not only for digital signatures of one public key, but also for situations where multiple public keys are required. In addition, the scheme can resist all kinds of collusion, making it more practicable and safer. Additionally it is more efficient than other schemes.
Colluding attacks on a group signature scheme
无
2005-01-01
Xie and Yu (2005) proposed a group signature scheme and claimed that it is the most efficient group signature scheme so far and secure. In this paper, we show that two dishonest group members can collude to launch two attacks on the scheme. In the first attack they can derive the group secret key and then generate untraceable group signatures. In the second attack, they can impersonate other group members once they see their signatures. Therefore we conclude that the signature scheme is not secure.We show that some parameters should be carefully selected in the scheme to resist our attacks.
Nonrepudiable Proxy Multi-Signature Scheme
LI JiGuo(李继国); CAO ZhenFu(曹珍富); ZHANG YiChen(张亦辰)
2003-01-01
The concept of proxy signature introduced by Mambo, Usuda, and Okamotoallows a designated person, called a proxy signer, to sign on behalf of an original signer. However,most existing proxy signature schemes do not support nonrepudiation. In this paper, two securenonrepudiable proxy multi-signature schemes are proposed that overcome disadvantages of theexisting schemes. The proposed schemes can withstand public key substitution attack. In addition,the new schemes have some other advantages such as proxy signature key generation and updatingusing insecure channels. This approach can also be applied to other ElGamal-like proxy signatureschemes.
Hybrid Transmission Scheme for MIMO Relay Channels
Guangming Xu
2009-11-01
Full Text Available To improve the achievable rate for the MIMO channels, we propose a hybrid transmission (HT scheme that mixes half-duplex decode-and-forward cooperative relaying transmission （DFRH）with direct transmission (DT. In the HT scheme, the source message is divided into two parts: one is transmitted by DFRH scheme and another is transmitted by DT scheme. Precoding and decoding are considered to convert the original MIMO relay channel into several parallel subchannels so that resource allocation can be easily performed. We focus on the spatial subchannel and power allocation problem. The objective of this problem is to maximize the total achievable rate under the constraints of joint total transmission power. Simulation results show that significant capacity gain can be achieved by the HT scheme compared to the DT scheme and the pure DFRH scheme.
High-Order Energy Stable WENO Schemes
Yamaleev, Nail K.; Carpenter, Mark H.
2008-01-01
A new third-order Energy Stable Weighted Essentially NonOscillatory (ESWENO) finite difference scheme for scalar and vector linear hyperbolic equations with piecewise continuous initial conditions is developed. The new scheme is proven to be stable in the energy norm for both continuous and discontinuous solutions. In contrast to the existing high-resolution shock-capturing schemes, no assumption that the reconstruction should be total variation bounded (TVB) is explicitly required to prove stability of the new scheme. A rigorous truncation error analysis is presented showing that the accuracy of the 3rd-order ESWENO scheme is drastically improved if the tuning parameters of the weight functions satisfy certain criteria. Numerical results show that the new ESWENO scheme is stable and significantly outperforms the conventional third-order WENO finite difference scheme of Jiang and Shu in terms of accuracy, while providing essentially nonoscillatory solutions near strong discontinuities.
Scheme of thinking quantum systems
Yukalov, V I
2009-01-01
A general approach describing quantum decision procedures is developed. The approach can be applied to quantum information processing, quantum computing, creation of artificial quantum intelligence, as well as to analyzing decision processes of human decision makers. Our basic point is to consider an active quantum system possessing its own strategic state. Processing information by such a system is analogous to the cognitive processes associated to decision making by humans. The algebra of probability operators, associated with the possible options available to the decision maker, plays the role of the algebra of observables in quantum theory of measurements. A scheme is advanced for a practical realization of decision procedures by thinking quantum systems. Such thinking quantum systems can be realized by using spin lattices, systems of magnetic molecules, cold atoms trapped in optical lattices, ensembles of quantum dots, or multilevel atomic systems interacting with electromagnetic field.
Electrical injection schemes for nanolasers
Lupi, Alexandra; Chung, Il-Sug; Yvind, Kresten
2013-01-01
The performance of injection schemes among recently demonstrated electrically pumped photonic crystal nanolasers has been investigated numerically. The computation has been carried out at room temperature using a commercial semiconductor simulation software. For the simulations two electrical...... of 3 InGaAsP QWs on an InP substrate has been chosen for the modeling. In the simulations the main focus is on the electrical and optical properties of the nanolasers i.e. electrical resistance, threshold voltage, threshold current and wallplug efficiency. In the current flow evaluation the lowest...... threshold current has been achieved with the lateral electrical injection through the BH; while the lowest resistance has been obtained from the current post structure even though this model shows a higher current threshold because of the lack of carrier confinement. Final scope of the simulations...
Fragment separator momentum compression schemes
Bandura, Laura, E-mail: bandura@anl.gov [Facility for Rare Isotope Beams (FRIB), 1 Cyclotron, East Lansing, MI 48824-1321 (United States); National Superconducting Cyclotron Lab, Michigan State University, 1 Cyclotron, East Lansing, MI 48824-1321 (United States); Erdelyi, Bela [Argonne National Laboratory, Argonne, IL 60439 (United States); Northern Illinois University, DeKalb, IL 60115 (United States); Hausmann, Marc [Facility for Rare Isotope Beams (FRIB), 1 Cyclotron, East Lansing, MI 48824-1321 (United States); Kubo, Toshiyuki [RIKEN Nishina Center, RIKEN, Wako (Japan); Nolen, Jerry [Argonne National Laboratory, Argonne, IL 60439 (United States); Portillo, Mauricio [Facility for Rare Isotope Beams (FRIB), 1 Cyclotron, East Lansing, MI 48824-1321 (United States); Sherrill, Bradley M. [National Superconducting Cyclotron Lab, Michigan State University, 1 Cyclotron, East Lansing, MI 48824-1321 (United States)
2011-07-21
We present a scheme to use a fragment separator and profiled energy degraders to transfer longitudinal phase space into transverse phase space while maintaining achromatic beam transport. The first order beam optics theory of the method is presented and the consequent enlargement of the transverse phase space is discussed. An interesting consequence of the technique is that the first order mass resolving power of the system is determined by the first dispersive section up to the energy degrader, independent of whether or not momentum compression is used. The fragment separator at the Facility for Rare Isotope Beams is a specific application of this technique and is described along with simulations by the code COSY INFINITY.
Fragment separator momentum compression schemes.
Bandura, L.; Erdelyi, B.; Hausmann, M.; Kubo, T.; Nolen, J.; Portillo, M.; Sherrill, B.M. (Physics); (MSU); (Northern Illinois Univ.); (RIKEN)
2011-07-21
We present a scheme to use a fragment separator and profiled energy degraders to transfer longitudinal phase space into transverse phase space while maintaining achromatic beam transport. The first order beam optics theory of the method is presented and the consequent enlargement of the transverse phase space is discussed. An interesting consequence of the technique is that the first order mass resolving power of the system is determined by the first dispersive section up to the energy degrader, independent of whether or not momentum compression is used. The fragment separator at the Facility for Rare Isotope Beams is a specific application of this technique and is described along with simulations by the code COSY INFINITY.
Network Regulation and Support Schemes
Ropenus, Stephanie; Schröder, Sascha Thorsten; Jacobsen, Henrik
2009-01-01
-in tariffs to market-based quota systems, and network regulation approaches, comprising rate-of-return and incentive regulation. National regulation and the vertical structure of the electricity sector shape the incentives of market agents, notably of distributed generators and network operators....... This article seeks to investigate the interactions between the policy dimensions of support schemes and network regulation and how they affect the deployment of distributed generation. Firstly, a conceptual analysis examines how the incentives of the different market agents are affected. In particular......, it will be shown that there frequently exists a trade-off between the creation of incentives for distributed generators and for distribution system operators to facilitate the integration of distributed generation. Secondly, the interaction of these policy dimensions is analyzed, including case studies based...
Scheme of thinking quantum systems
Yukalov, V. I.; Sornette, D.
2009-11-01
A general approach describing quantum decision procedures is developed. The approach can be applied to quantum information processing, quantum computing, creation of artificial quantum intelligence, as well as to analyzing decision processes of human decision makers. Our basic point is to consider an active quantum system possessing its own strategic state. Processing information by such a system is analogous to the cognitive processes associated to decision making by humans. The algebra of probability operators, associated with the possible options available to the decision maker, plays the role of the algebra of observables in quantum theory of measurements. A scheme is advanced for a practical realization of decision procedures by thinking quantum systems. Such thinking quantum systems can be realized by using spin lattices, systems of magnetic molecules, cold atoms trapped in optical lattices, ensembles of quantum dots, or multilevel atomic systems interacting with electromagnetic field.
Network Regulation and Support Schemes
Ropenus, Stephanie; Schröder, Sascha Thorsten; Jacobsen, Henrik
2009-01-01
-in tariffs to market-based quota systems, and network regulation approaches, comprising rate-of-return and incentive regulation. National regulation and the vertical structure of the electricity sector shape the incentives of market agents, notably of distributed generators and network operators....... This article seeks to investigate the interactions between the policy dimensions of support schemes and network regulation and how they affect the deployment of distributed generation. Firstly, a conceptual analysis examines how the incentives of the different market agents are affected. In particular......, it will be shown that there frequently exists a trade-off between the creation of incentives for distributed generators and for distribution system operators to facilitate the integration of distributed generation. Secondly, the interaction of these policy dimensions is analyzed, including case studies based...
Improvement of Some Proxy Signature Schemes
LIJiguo; LIANGZhenghe; ZHUYuelong; HANGYichen
2005-01-01
In 1996, Mambo et al. introduced the concept of proxy signature. Proxy signature can be applied to mobile agent, e-vote etc. Recently, Sun and Hsieh showed that Lee et al's strong proxy signature scheme and its application to multi-proxy signature scheme, Shum and Wei's privacy-protected strong proxy signature scheme, and Park and Lee's nominative proxy signature scheme were all insecure against the original signer's forgery attack. In this paper, we show those proxy signature schemes don't withstand public key substitution attack and give some slight but important modifications for those proxy signature schemes such that the resulting schemes are secure against the original signer's forgery attack and public key substitution attack. In addition, we show that Park and Lee's nominative proxy signature scheme don't satisfy strong nonrepudiation and strong identifiability. Improved schemes satisfy all properties of strong proxy signature scheme, and doesn't use secure channel between the original signer and the proxy signer.
Rapid Parameterization Schemes for Aircraft Shape Optimization
Li, Wu
2012-01-01
A rapid shape parameterization tool called PROTEUS is developed for aircraft shape optimization. This tool can be applied directly to any aircraft geometry that has been defined in PLOT3D format, with the restriction that each aircraft component must be defined by only one data block. PROTEUS has eight types of parameterization schemes: planform, wing surface, twist, body surface, body scaling, body camber line, shifting/scaling, and linear morphing. These parametric schemes can be applied to two types of components: wing-type surfaces (e.g., wing, canard, horizontal tail, vertical tail, and pylon) and body-type surfaces (e.g., fuselage, pod, and nacelle). These schemes permit the easy setup of commonly used shape modification methods, and each customized parametric scheme can be applied to the same type of component for any configuration. This paper explains the mathematics for these parametric schemes and uses two supersonic configurations to demonstrate the application of these schemes.
On Optimal Designs of Some Censoring Schemes
Dr. Adnan Mohammad Awad
2016-03-01
Full Text Available The main objective of this paper is to explore suitability of some entropy-information measures for introducing a new optimality censoring criterion and to apply it to some censoring schemes from some underlying life-time models. In addition, the paper investigates four related issues namely; the effect of the parameter of parent distribution on optimal scheme, equivalence of schemes based on Shannon and Awad sup-entropy measures, the conjecture that the optimal scheme is one stage scheme, and a conjecture by Cramer and Bagh (2011 about Shannon minimum and maximum schemes when parent distribution is reflected power. Guidelines for designing an optimal censoring plane are reported together with theoretical and numerical results and illustrations.
A Signature Scheme with Non-Repudiation
XIN Xiangjun; GUO Xiaoli; XIAO Guozhen
2006-01-01
Based on the Schnorr signature scheme, a new signature scheme with non-repudiation is proposed. In this scheme, only the signer and the designated receiver can verify the signature signed by the signer, and if necessary, both the signer and the designated receiver can prove and show the validity of the signature signed by the signer. The proof of the validity of the signature is noninteractive and transferable. To verify and prove the validity of the signature, the signer and the nominated receiver needn't store extra information besides the signature. At the same time, neither the signer nor the designated receiver can deny a valid signature signed. Then, there is no repudiation in this new signature scheme. According to the security analysis of this scheme, it is found the proposed scheme is secure against existential forgery on adaptive chosen message attack.
Multi-object quantum traveling ballot scheme
Yuan Li; Guihua Zeng
2009-01-01
Based on quantum mechanics, a traveling ballot scheme with anonymity and secrecy is introduced to realize voting. By searching the objects in large amount of data bases, every voter may cast votes to his desired candidates. Therefore, the proposed scheme may be applied to voting with a great deal of candidates, such as network voting and so on. The security analysis of the present scheme is also performed.
SYNCHRONIZATION RECOVERY SCHEME IN WATERMARKING DETECTION
Xiao Weiwei; Zhang Li; Ji Zhen; Zhang Jihong
2003-01-01
Most proposed digital watermarking algorithms are sensitive to geometric attacksbecause the synchronization information of watermark embedding and detection is destroyed. Inthis letter a novel synchronization recovery scheme based on image normalization is proposed. Thepresented scheme does not require the original image and can be applied to various watermarksystems. A wavelet-based watermarking scheme is proposed as an example and experimentalresults show that it is robust to geometric attacks.
Blind Signature Scheme Based on Chebyshev Polynomials
Maheswara Rao Valluri
2011-12-01
Full Text Available A blind signature scheme is a cryptographic protocol to obtain a valid signature for a message from a signer such that signer’s view of the protocol can’t be linked to the resulting message signature pair. This paper presents blind signature scheme using Chebyshev polynomials. The security of the given scheme depends upon the intractability of the integer factorization problem and discrete logarithms ofChebyshev polynomials.
Blind Signature Scheme Based on Chebyshev Polynomials
Maheswara Rao Valluri
2011-01-01
A blind signature scheme is a cryptographic protocol to obtain a valid signature for a message from a signer such that signer’s view of the protocol can’t be linked to the resulting message signature pair. This paper presents blind signature scheme using Chebyshev polynomials. The security of the given scheme depends upon the intractability of the integer factorization problem and discrete logarithms ofChebyshev polynomials.
Pyramid Schemes on the Tibetan Plateau
Devin Gonier; Rgyal yum sgrol ma
2012-01-01
The unique features of pyramid schemes and certain underlying causes for their development on the Tibetan Plateau are analyzed. Research was conducted by analyzing 521 surveys, allowing estimation of pyramid scheme activity on the Plateau and an identification of related cultural and social specificities. Firsthand accounts were collected revealing details of personal involvement. Survey data and similarities in the accounts were studied to suggest how involvement in pyramid schemes might be ...
Resonance ionization scheme development for europium
Chrysalidis, K; Fedosseev, V N; Marsh, B A; Naubereit, P; Rothe, S; Seiffert, C; Kron, T; Wendt, K
2017-01-01
Odd-parity autoionizing states of europium have been investigated by resonance ionization spectroscopy via two-step, two-resonance excitations. The aim of this work was to establish ionization schemes specifically suited for europium ion beam production using the ISOLDE Resonance Ionization Laser Ion Source (RILIS). 13 new RILIS-compatible ionization schemes are proposed. The scheme development was the first application of the Photo Ionization Spectroscopy Apparatus (PISA) which has recently been integrated into the RILIS setup.
Signcryption scheme based on schnorr digital signature
Savu, Laura
2012-01-01
This article presents a new signcryption scheme which is based on the Schnorr digital signature algorithm. The new scheme represents my personal contribution to signcryption area. I have been implemented the algorithm in a program and here are provided the steps of the algorithm, the results and some examples. The paper also contains the presentation of the original Signcryption scheme, based on ElGamal digital signature and discusses the practical applications of Signcryption in real life.
SIGNCRYPTION BASED ON DIFFERENT DIGITAL SIGNATURE SCHEMES
Adrian Atanasiu; Laura Savu
2012-01-01
This article presents two new signcryption schemes. The first one is based on Schnorr digital signature algorithm and the second one is using Proxy Signature scheme introduced by Mambo. Schnorr Signcryption has been implemented in a program and here are provided the steps of the algorithm, the results and some examples. The Mambo’s Proxy Signature is adapted for Shortened Digital Signature Standard, being part of a new Proxy Signcryption scheme.
Resonance ionization scheme development for europium
Chrysalidis, K., E-mail: katerina.chrysalidis@cern.ch; Goodacre, T. Day; Fedosseev, V. N.; Marsh, B. A. [CERN (Switzerland); Naubereit, P. [Johannes Gutenberg-Universität, Institiut für Physik (Germany); Rothe, S.; Seiffert, C. [CERN (Switzerland); Kron, T.; Wendt, K. [Johannes Gutenberg-Universität, Institiut für Physik (Germany)
2017-11-15
Odd-parity autoionizing states of europium have been investigated by resonance ionization spectroscopy via two-step, two-resonance excitations. The aim of this work was to establish ionization schemes specifically suited for europium ion beam production using the ISOLDE Resonance Ionization Laser Ion Source (RILIS). 13 new RILIS-compatible ionization schemes are proposed. The scheme development was the first application of the Photo Ionization Spectroscopy Apparatus (PISA) which has recently been integrated into the RILIS setup.
General Compact Labeling Schemes for Dynamic Trees
2006-01-01
Let $F$ be a function on pairs of vertices. An {\\em $F$- labeling scheme} is composed of a {\\em marker} algorithm for labeling the vertices of a graph with short labels, coupled with a {\\em decoder} algorithm allowing one to compute $F(u,v)$ of any two vertices $u$ and $v$ directly from their labels. As applications for labeling schemes concern mainly large and dynamically changing networks, it is of interest to study {\\em distributed dynamic} labeling schemes. This paper investigates labelin...
Optimizing Decision Tree Attack on CAS Scheme
PERKOVIC, T.
2016-05-01
Full Text Available In this paper we show a successful side-channel timing attack on a well-known high-complexity cognitive authentication (CAS scheme. We exploit the weakness of CAS scheme that comes from the asymmetry of the virtual interface and graphical layout which results in nonuniform human behavior during the login procedure, leading to detectable variations in user's response times. We optimized a well-known probabilistic decision tree attack on CAS scheme by introducing this timing information into the attack. We show that the developed classifier could be used to significantly reduce the number of login sessions required to break the CAS scheme.
Key Predistribution Schemes for Distributed Sensor Networks
Bose, Mausumi; Mukerjee, Rahul
2011-01-01
Key predistribution schemes for distributed sensor networks have received significant attention in the recent literature. In this paper we propose a new construction method for these schemes based on combinations of duals of standard block designs. Our method is a broad spectrum one which works for any intersection threshold. By varying the initial designs, we can generate various schemes and this makes the method quite flexible. We also obtain explicit algebraic expressions for the metrics for local connectivity and resiliency. These schemes are quite efficient with regard to connectivity and resiliency and at the same time they allow a straightforward shared-key discovery.
A new access scheme in OFDMA systems
GU Xue-lin; YAN Wei; TIAN Hui; ZHANG Ping
2006-01-01
This article presents a dynamic random access scheme for orthogonal frequency division multiple access (OFDMA) systems. The key features of the proposed scheme are:it is a combination of both the distributed and the centralized schemes, it can accommodate several delay sensitivity classes,and it can adjust the number of random access channels in a media access control (MAC) frame and the access probability according to the outcome of Mobile Terminals access attempts in previous MAC frames. For floating populated packet-based networks, the proposed scheme possibly leads to high average user satisfaction.
Efficient Certificateless Signcryption Scheme from Weil Pairing
Gang Yu
2011-08-01
Full Text Available Certificateless signcryption has both the advantage of certificateless public key cryptography, which overcome the escrow problem inherited from identity based cryptography without the use of certificates as in traditional public key cryptography, and signcryption which can fulfill both the functions of signature and encryption in a logical signal step. In this paper, we explicit the security model for certificateless signcryption and propose an efficient certificateless signcryption scheme from Weil pairings. The new scheme not only can be proved to be secure in our model but also can simultaneously provide public verifiability and forward security. Furthermore, compared with existing schemes, the new scheme is more efficient.
Hybrid scheme for Brownian semistationary processes
Bennedsen, Mikkel; Lunde, Asger; Pakkanen, Mikko S.
the asymptotics of the mean square error of the hybrid scheme and we observe that the scheme leads to a substantial improvement of accuracy compared to the ordinary forward Riemann-sum scheme, while having the same computational complexity. We exemplify the use of the hybrid scheme by two numerical experiments......, where we examine the finite-sample properties of an estimator of the roughness parameter of a Brownian semistationary process and study Monte Carlo option pricing in the rough Bergomi model of Bayer et al. (2015), respectively....
An Improved Proxy Multi-Signature Scheme
GU Li-ze; ZHANG Sheng; YANG Yi-xian
2005-01-01
Based on the Kim-like's proxy multi-signature scheme[1],an improved proxy multi-signature scheme is proposed.The new scheme overcomes the two problems in the Kim-like's proxy multi-signature scheme:(1)Security issue(every original signer can forge a valid proxy multi-signature for any message);(2)Efficiency issue(both the size of the proxy multi-signature and the efficiency of signature checking are dependent on the number of the original signers).
Sampling scheme optimization from hyperspectral data
Debba, P.
2006-01-01
This thesis presents statistical sampling scheme optimization for geo-environ-menta] purposes on the basis of hyperspectral data. It integrates derived products of the hyperspectral remote sensing data into individual sampling schemes. Five different issues are being dealt with.First, the optimized
Anonymous Credential Schemes with Encrypted Attributes
Guajardo Merchan, J.; Mennink, B.; Schoenmakers, B.
2011-01-01
In anonymous credential schemes, users obtain credentials on certain attributes from an issuer, and later show these credentials to a relying party anonymously and without fully disclosing the attributes. In this paper, we introduce the notion of (anonymous) credential schemes with encrypted attribu
Mixed ultrasoft/norm-conserved pseudopotential scheme
Stokbro, Kurt
1996-01-01
A variant of the Vanderbilt ultrasoft pseudopotential scheme, where the norm conservation is released for only one or a few angular channels, is presented. Within this scheme some difficulties of the truly ultrasoft pseudopotentials are overcome without sacrificing the pseudopotential softness. (...
Finite volume renormalization scheme for fermionic operators
Monahan, Christopher; Orginos, Kostas [JLAB
2013-11-01
We propose a new finite volume renormalization scheme. Our scheme is based on the Gradient Flow applied to both fermion and gauge fields and, much like the Schr\\"odinger functional method, allows for a nonperturbative determination of the scale dependence of operators using a step-scaling approach. We give some preliminary results for the pseudo-scalar density in the quenched approximation.
Nonstandard finite difference schemes for differential equations
Mohammad Mehdizadeh Khalsaraei
2014-12-01
Full Text Available In this paper, the reorganization of the denominator of the discrete derivative and nonlocal approximation of nonlinear terms are used in the design of nonstandard finite difference schemes (NSFDs. Numerical examples confirming then efficiency of schemes, for some differential equations are provided. In order to illustrate the accuracy of the new NSFDs, the numerical results are compared with standard methods.
Consolidation of the health insurance scheme
Association du personnel
2009-01-01
In the last issue of Echo, we highlighted CERN’s obligation to guarantee a social security scheme for all employees, pensioners and their families. In that issue we talked about the first component: pensions. This time we shall discuss the other component: the CERN Health Insurance Scheme (CHIS).
Unconditionnally stable scheme for Riccati equation
Dubois, François; 10.1051/proc:2000003
2011-01-01
We present a numerical scheme for the resolution of matrix Riccati equation used in control problems. The scheme is unconditionnally stable and the solution is definite positive at each time step of the resolution. We prove the convergence in the scalar case and present several numerical experiments for classical test cases.
Modified Mean-Pyramid Coding Scheme
Cheung, Kar-Ming; Romer, Richard
1996-01-01
Modified mean-pyramid coding scheme requires transmission of slightly fewer data. Data-expansion factor reduced from 1/3 to 1/12. Schemes for progressive transmission of image data transmitted in sequence of frames in such way coarse version of image reconstructed after receipt of first frame and increasingly refined version of image reconstructed after receipt of each subsequent frame.
A New Public-Key Encryption Scheme
Hai-Bo Tian; Xi Sun; Yu-Min Wang
2007-01-01
This paper proposes a new public-key encryption scheme which removes one element from the public-key tuple of the original Cramer-Shoup scheme.As a result, a ciphertext is not a quadruple but a triple at the cost of a strong assumption,the third version of knowledge of exponent assumption (KEA3).Under assumptions of KEA3, a decision Diffie-Hellman (DDH) and a variant of target collision resistance (TCRv), the new scheme is proved secure against indistinguishable adaptive chosen ciphertext attack (IND-CCA2).This scheme is as efficient as Damgard ElGamal (DEG) scheme when it makes use of a well-known algorithm for product of exponentiations.The DEG scheme is recently proved IND-CCA1 secure by Bellare and Palacio in ASIACRYPT 2004 under another strong assumption.In addition to our IND-CCA2 secured scheme, we also believe that the security proof procedure itself provides a well insight for ElGamal-based encryption schemes which are secure in real world.
Novel Link Adaptation Schemes for OFDM System
LEI Ming; CAI Peng; XU Yue-shan; ZHANG Ping
2003-01-01
Orthogonal Frequency Division Multiplexing (OFDM) is the most promising technique supporting the high data rate transmission. The combination of the link adaptation and OFDM can further increase the spectral efficiency. In this paper, we put forward two link adaptation schemes for OFDM system which have the advantages of both flexibility and practicability. Both of the two novel link adaptation schemes are based on the iterative mechanism to allocate the bit and power to subcarriers according to their channel gains and noisy levels which are assumed to be already known at the transmitter. The candidate modulation modes are determined freely before the link adaptation schemes are performed. The distinction between the two novel link adaptation schemes is that in the novel scheme A, the modulation mode is upgraded to the neighboring higher-order mode, while in the novel scheme B the modulation is upgraded to the genuine optimal mode. Therefore, the novel scheme A has the advantage of lower complexity and the novel scheme B has the advantage of higher spectral efficiency.
Sampling scheme optimization from hyperspectral data
Debba, P.
2006-01-01
This thesis presents statistical sampling scheme optimization for geo-environ-menta] purposes on the basis of hyperspectral data. It integrates derived products of the hyperspectral remote sensing data into individual sampling schemes. Five different issues are being dealt with.First, the optimized
Modified Mean-Pyramid Coding Scheme
Cheung, Kar-Ming; Romer, Richard
1996-01-01
Modified mean-pyramid coding scheme requires transmission of slightly fewer data. Data-expansion factor reduced from 1/3 to 1/12. Schemes for progressive transmission of image data transmitted in sequence of frames in such way coarse version of image reconstructed after receipt of first frame and increasingly refined version of image reconstructed after receipt of each subsequent frame.
Phase calibration scheme for a ``T'' array
Ramesh, R.; Subramanian, K. R.; Sastry, Ch. V.
1999-10-01
A calibration scheme based on closure and redundancy techniques is described for correcting the phase errors in the complex visibilities observed with a T-shaped radio interferometer array. Practical details of the scheme are illustrated with reference to the Gauribidanur radioheliograph (GRH).
Privacy Preserving Mapping Schemes Supporting Comparison
Tang, Qiang
2010-01-01
To cater to the privacy requirements in cloud computing, we introduce a new primitive, namely Privacy Preserving Mapping (PPM) schemes supporting comparison. An PPM scheme enables a user to map data items into images in such a way that, with a set of images, any entity can determine the $<, =, >$ re
Privacy Preserving Mapping Schemes Supporting Comparison
Tang, Qiang
2010-01-01
To cater to the privacy requirements in cloud computing, we introduce a new primitive, namely Privacy Preserving Mapping (PPM) schemes supporting comparison. An PPM scheme enables a user to map data items into images in such a way that, with a set of images, any entity can determine the <, =, >
Modeling Students' Mathematics Using Steffe's Fraction Schemes
Norton, Anderson H.; McCloskey, Andrea V.
2008-01-01
Each year, more teachers learn about the successful intervention program known as Math Recovery (USMRC 2008; Wright 2003). The program uses Steffe's whole-number schemes to model, understand, and support children's development of whole-number reasoning. Readers are probably less familiar with Steffe's fraction schemes, which have proven similarly…
A Secure Threshold Group Signature Scheme
Wang Xiaoming; Fu Fangwei
2003-01-01
The threshold group signature is an important kind of signature. So far, many threshold group signature schemes have been proposed, but most of them suffer from conspiracy attack and are insecure. In this paper, a secure threshold group signature scheme is proposed. It can not only satisfy the properties of the threshold group signature, but also withstand the conspiracy attack
Cornering (3+1) sterile neutrino schemes
Maltoni, M; Valle, José W F
2001-01-01
Using the most recent atmospheric neutrino data, as well as short-baseline and tritium $\\beta$-decay data we show that (3+1) sterile neutrino schemes are severely disfavored, in contrast to the theoretically favored (2+2) schemes.
Autonomous droop scheme with reduced generation cost
Nutkani, Inam Ullah; Loh, Poh Chiang; Blaabjerg, Frede
2013-01-01
Droop scheme has been widely applied to the control of Distributed Generators (DGs) in microgrids for proportional power sharing based on their ratings. For standalone microgrid, where centralized management system is not viable, the proportional power sharing based droop might not suit well since...... DGs are usually of different types unlike synchronous generators. This paper presents an autonomous droop scheme that takes into consideration the operating cost, efficiency and emission penalty of each DG since all these factors directly or indirectly contributes to the Total Generation Cost (TGC......) of the overall microgrid. Comparing it with the traditional scheme, the proposed scheme has retained its simplicity, which certainly is a feature preferred by the industry. The overall performance of the proposed scheme has been verified through simulation and experiment....
Two level scheme solvers for nuclear spectroscopy
Jansson, Kaj; DiJulio, Douglas; Cederkäll, Joakim
2011-10-01
A program for building level schemes from γ-spectroscopy coincidence data has been developed. The scheme builder was equipped with two different algorithms: a statistical one based on the Metropolis method and a more logical one, called REMP (REcurse, Merge and Permute), developed from scratch. These two methods are compared both on ideal cases and on experimental γ-ray data sets. The REMP algorithm is based on coincidences and transition energies. Using correct and complete coincidence data, it has solved approximately half a million schemes without failures. Also, for incomplete data and data with minor errors, the algorithm produces consistent sub-schemes when it is not possible to obtain a complete scheme from the provided data.
An Efficient Forward Secure Signature Scheme
YU Jia; KONG Fan-yu; LI Da-xing
2006-01-01
A new efficient forward secure signature scheme based on bilinear pairings is presented in this paper.Each complexity of key generation, key update, signing and verifying algorithms in this scheme is O(1) in terms of the total number of time periods T. Because a new structure in node secret key storage and a unique strategy in key update are employed, the signing and verifying costs don't grow when T increases. At the same time, the key generation and key update algorithms are efficiently constructed thanks to using the pre-order traversal technique of binary trees. Compared with other schemes based on bilinear pairings, the signature size in this scheme is very short, which doesn't change with T increasing. The scheme is forward secure in random oracle model assuming CDH problem is hard.
A DRM Scheme Using File Physical Information
Cheng Qu
2015-05-01
Full Text Available A digital file has both the content and physical information, however the latter was not fully made use of in previous digital rights management (DRM systems. This paper introduces the idea of making use of file physical information to improve the system security and provides a scheme based on this idea to resist the replay attack in DRM systems. In our scheme, compared to commonly used schemes, we remove the dependency on continuous online connection from the client-side to the server-side or the usage of tamper-proof hardware, such as Trusted Platform Module (TPM. The scheme is appropriate for offline digital content usage. Primary experiments demonstrate that our scheme is secure enough to be put into practice use.
Comparison among sea surface roughness schemes
无
2005-01-01
Based on the measurements from the US National Data Buoy Center 3-m discus buoy site No.44004 (38.5°N, 70.47°W) from January 1 to March 31 of 2003, with the COARE algorithm (Version 3.0), the results from four parameterization schemes developed recently for sea surface aerodynamic roughness length were compared with each other. Calculations of frictional speed u*, drag coefficient Cd and wind stress τ indicate that the calculated frictional velocities from the four schemes (8.50%-16.20%, the normalized standard error estimate, or NSEE), the computed drag coefficients and wind stress (respectively 15.08%-28.67% and 17.26%-50.59% NSEE) are reasonable. Schemes YT96 and GW03 are consistent. The O02 scheme gives overestimated values for u* and Cd. Schemes TY01 and GW03 display discontinuous characteristics in handling young wave data.
A novel key management scheme using biometrics
Sui, Yan; Yang, Kai; Du, Yingzi; Orr, Scott; Zou, Xukai
2010-04-01
Key management is one of the most important issues in cryptographic systems. Several important challenges in such a context are represented by secure and efficient key generation, key distribution, as well as key revocation. Addressing such challenges requires a comprehensive solution which is robust, secure and efficient. Compared to traditional key management schemes, key management using biometrics requires the presence of the user, which can reduce fraud and protect the key better. In this paper, we propose a novel key management scheme using iris based biometrics. Our newly proposed scheme outperforms traditional key management schemes as well as some existing key-binding biometric schemes in terms of security, diversity and/or efficiency.
Secure Electronic Cash Scheme with Anonymity Revocation
Baoyuan Kang
2016-01-01
Full Text Available In a popular electronic cash scheme, there are three participants: the bank, the customer, and the merchant. First, a customer opens an account in a bank. Then, he withdraws an e-cash from his account and pays it to a merchant. After checking the electronic cash’s validity, the merchant accepts it and deposits it to the bank. There are a number of requirements for an electronic cash scheme, such as, anonymity, unforgeability, unreusability, divisibility, transferability, and portability. Anonymity property of electronic cash schemes can ensure the privacy of payers. However, this anonymity property is easily abused by criminals. In 2011, Chen et al. proposed a novel electronic cash system with trustee-based anonymity revocation from pairing. On demand, the trustee can disclose the identity for e-cash. But, in this paper we point out that Chen et al.’s scheme is subjected to some drawbacks. To contribute secure electronic cash schemes, we propose a new offline electronic cash scheme with anonymity revocation. We also provide the formally security proofs of the unlinkability and unforgeability. Furthermore, the proposed scheme ensures the property of avoiding merchant frauds.
Ponzi scheme diffusion in complex networks
Zhu, Anding; Fu, Peihua; Zhang, Qinghe; Chen, Zhenyue
2017-08-01
Ponzi schemes taking the form of Internet-based financial schemes have been negatively affecting China's economy for the last two years. Because there is currently a lack of modeling research on Ponzi scheme diffusion within social networks yet, we develop a potential-investor-divestor (PID) model to investigate the diffusion dynamics of Ponzi scheme in both homogeneous and inhomogeneous networks. Our simulation study of artificial and real Facebook social networks shows that the structure of investor networks does indeed affect the characteristics of dynamics. Both the average degree of distribution and the power-law degree of distribution will reduce the spreading critical threshold and will speed up the rate of diffusion. A high speed of diffusion is the key to alleviating the interest burden and improving the financial outcomes for the Ponzi scheme operator. The zero-crossing point of fund flux function we introduce proves to be a feasible index for reflecting the fast-worsening situation of fiscal instability and predicting the forthcoming collapse. The faster the scheme diffuses, the higher a peak it will reach and the sooner it will collapse. We should keep a vigilant eye on the harm of Ponzi scheme diffusion through modern social networks.
A Spatial Domain Quantum Watermarking Scheme
Wei, Zhan-Hong; Chen, Xiu-Bo; Xu, Shu-Jiang; Niu, Xin-Xin; Yang, Yi-Xian
2016-07-01
This paper presents a spatial domain quantum watermarking scheme. For a quantum watermarking scheme, a feasible quantum circuit is a key to achieve it. This paper gives a feasible quantum circuit for the presented scheme. In order to give the quantum circuit, a new quantum multi-control rotation gate, which can be achieved with quantum basic gates, is designed. With this quantum circuit, our scheme can arbitrarily control the embedding position of watermark images on carrier images with the aid of auxiliary qubits. Besides reversely acting the given quantum circuit, the paper gives another watermark extracting algorithm based on quantum measurements. Moreover, this paper also gives a new quantum image scrambling method and its quantum circuit. Differ from other quantum watermarking schemes, all given quantum circuits can be implemented with basic quantum gates. Moreover, the scheme is a spatial domain watermarking scheme, and is not based on any transform algorithm on quantum images. Meanwhile, it can make sure the watermark be secure even though the watermark has been found. With the given quantum circuit, this paper implements simulation experiments for the presented scheme. The experimental result shows that the scheme does well in the visual quality and the embedding capacity. Supported by the National Natural Science Foundation of China under Grant Nos. 61272514, 61170272, 61373131, 61121061, 61411146001, the program for New Century Excellent Talents under Grant No. NCET-13-0681, the National Development Foundation for Cryptological Research (Grant No. MMJJ201401012) and the Fok Ying Tung Education Foundation under Grant No. 131067, and the Shandong Provincial Natural Science Foundation of China under Grant No. ZR2013FM025
Exploiting Same Scale Similarity in Fisher's Scheme
ZHAO Yao
2001-01-01
The method proposed by Y. Fisher is the most popular fractal image coding scheme. In his scheme, domain blocks are constrained to be twice as large as range blocks in order to ensure the convergence of the iterative decoding stage. However,this constraint has limited the fractal encoder to exploit the self-similarity of the original image. In order to overcome the shortcoming, a novel scheme using same-sized range and domain blocks is proposed in the paper. Experimental results show the improvements in compression performance.
Mission Mangalam scheme: Ex ploring the opportunities.
Dr. Pallavi A. Upadhyay*,
2015-01-01
Full Text Available Background Mission Mangalam has been launched by the Gujarat Government in 2010.It is an integrated poverty alleviation approach and an initiative to empower women. Mission Mangalam is helping women to earn their livelihood and to become independent. These Sakhimandals are linked to banks to fulfill the requirement of fund. Sakhimandals get financial assistance from banks. Some of the core benefits of the scheme can be linked with the health sector as well; Objectives (1 To review the scheme of Mission Mangalam (2 To explore the possibility of health linkage with the scheme (3 To study the perception of beneficiaries and their socio- demographic profile; Methodology: A cross sectional study. Samplesize-152 women members of Sakhimandals in Saraspur ward. Health of all the members of Mandals of Saraspur was checked by the Ahmedabad Municipal Corporation. Women of Sakhimandals were interviewed to understand their perception about the scheme as well as about any other health benefit they have experienced for themselves or their family members. 3 Additionally, Community based survey of 50 BPL families was carried out to assess the proportion of families covered under the scheme of Mission Mangalam. Results: Mean age of these women (n=152 was 31.81 years with SD=6.74. Education of maximum number 71(47% of women was up to secondary. Mean income was 5460 Rs/month with SD=1840 .Mean of number of family members is 5.4. 109 (72% women are residing in chali area. 98(64% women were told about this scheme by social worker, others were told about the scheme by her friend or UCD official. Paired t test was carried out to find increase in Hb levels of the beneficiary women. It was found to be significant (p=0.007, t=15.64. Age of women is associated with habit to save money. (p=0.003. There are only 22 (44% out of 50 families visited, who have at least one member enrolled under the scheme. More stringent efforts for universal coverage have to be made by
A SUBDIVISION SCHEME FOR VOLUMETRIC MODELS
GhulamMustafa; LiuXuefeng
2005-01-01
In this paper, a subdivision scheme which generalizes a surface scheme in previous papers to volume meshes is designed. The scheme exhibits significant control over shrink-age/size of volumetric models. It also has the ability to conveniently incorporate boundaries and creases into a smooth limit shape of models. The method presented here is much simpler and easier as compared to MacCracken and Joy's. This method makes no restrictions on the local topology of meshes. Particularly, it can be applied without any change to meshes of nonmanifold topology.
Consistency of non-minimal renormalisation schemes
Jack, I
2016-01-01
Non-minimal renormalisation schemes such as the momentum subtraction scheme (MOM) have frequently been used for physical computations. The consistency of such a scheme relies on the existence of a coupling redefinition linking it to MSbar. We discuss the implementation of this procedure in detail for a general theory and show how to construct the relevant redefinition up to three-loop order, for the case of a general theory of fermions and scalars in four dimensions and a general scalar theory in six dimensions.
Optimal Sales Schemes for Network Goods
Parakhonyak, Alexei; Vikander, Nick
This paper examines the optimal sequencing of sales in the presence of network externalities. A firm sells a good to a group of consumers whose payoff from buying is increasing in total quantity sold. The firm selects the order to serve consumers so as to maximize expected sales. It can serve all...... consumers simultaneously, serve them all sequentially, or employ any intermediate scheme. We show that the optimal sales scheme is purely sequential, where each consumer observes all previous sales before choosing whether to buy himself. A sequential scheme maximizes the amount of information available...
Chaotic cryptographic scheme and its randomness evaluation
Stoyanov, B. P.
2012-10-01
We propose a new cryptographic scheme based on the Lorenz chaos attractor and 32 bit bent Boolean function. We evaluated the keystream generated by the scheme with batteries of the NIST statistical tests. We also applied a number of statistical analysis techniques, such as calculating histograms, correlations between two adjacent pixels, information entropy, and differential resistance, all refer to images encrypted by the proposed system. The results of the analysis show that the new cryptographic scheme ensures a secure way for sending digital data with potential applications in real-time image encryption.
EFFICIENT IMAGE TRANSMISSION SCHEME IN FMT SYSTEM
Qi Zhongrui; Gao Zhenming
2005-01-01
An efficient image transmission scheme is proposed based on byte partition and adaptive sub-channel distribution technique in Filtered MultiTone (FMT) system over frequency selective slow fading channel. According to the simulation results and analysis of a typical image with matlab, improvement in Peak Signal to Noise Ratio (PSNR) of the received image and low complexity for equalization is demonstrated remarkably. Comparing with no adaptive and no actual channel equalization scheme, the proposed scheme saves over 6 dB when PSNR=40 dB.
Improved Quantum Signature Scheme with Weak Arbitrator
Su, Qi; Li, Wen-Min
2013-09-01
In this paper, we find a man-in-the-middle attack on the quantum signature scheme with a weak arbitrator (Luo et al., Int. J. Theor. Phys., 51:2135, 2012). In that scheme, the authors proposed a quantum signature based on quantum one way function which contains both verifying the signer phase and verifying the signed message phase. However, after our analysis we will show that Eve can adopt different strategies in respective phases to forge the signature without being detected. Then we present an improved scheme to increase the security.
Practical Coding Schemes for Cognitive Overlay Radios
Kurniawan, Ernest; Rini, Stefano
2012-01-01
We develop practical coding schemes for the cognitive overlay radios as modeled by the cognitive interference channel, a variation of the classical two user interference channel where one of the transmitters has knowledge of both messages. Inspired by information theoretical results, we develop a coding strategy for each of the three parameter regimes where capacity is known. A key feature of the capacity achieving schemes in these regimes is the joint decoding of both users' codewords, which we accomplish by performing a posteriori probability calculation over a combined trellis. The schemes are shown to perform close to the capacity limit with low error rate.
Cognitive radio networks dynamic resource allocation schemes
Wang, Shaowei
2014-01-01
This SpringerBrief presents a survey of dynamic resource allocation schemes in Cognitive Radio (CR) Systems, focusing on the spectral-efficiency and energy-efficiency in wireless networks. It also introduces a variety of dynamic resource allocation schemes for CR networks and provides a concise introduction of the landscape of CR technology. The author covers in detail the dynamic resource allocation problem for the motivations and challenges in CR systems. The Spectral- and Energy-Efficient resource allocation schemes are comprehensively investigated, including new insights into the trade-off
Finite-volume scheme for anisotropic diffusion
Es, Bram van, E-mail: bramiozo@gmail.com [Centrum Wiskunde & Informatica, P.O. Box 94079, 1090GB Amsterdam (Netherlands); FOM Institute DIFFER, Dutch Institute for Fundamental Energy Research, The Netherlands" 1 (Netherlands); Koren, Barry [Eindhoven University of Technology (Netherlands); Blank, Hugo J. de [FOM Institute DIFFER, Dutch Institute for Fundamental Energy Research, The Netherlands" 1 (Netherlands)
2016-02-01
In this paper, we apply a special finite-volume scheme, limited to smooth temperature distributions and Cartesian grids, to test the importance of connectivity of the finite volumes. The area of application is nuclear fusion plasma with field line aligned temperature gradients and extreme anisotropy. We apply the scheme to the anisotropic heat-conduction equation, and compare its results with those of existing finite-volume schemes for anisotropic diffusion. Also, we introduce a general model adaptation of the steady diffusion equation for extremely anisotropic diffusion problems with closed field lines.
An Optimal Labeling Scheme for Ancestry Queries
2009-01-01
An ancestry labeling scheme assigns labels (bit strings) to the nodes of rooted trees such that ancestry queries between any two nodes in a tree can be answered merely by looking at their corresponding labels. The quality of an ancestry labeling scheme is measured by its label size, that is the maximal number of bits in a label of a tree node. In addition to its theoretical appeal, the design of efficient ancestry labeling schemes is motivated by applications in web search engines. For this p...
DEVELOPMENT AND APPLICATIONS OF WENO SCHEMES IN CONTINUUM PHYSICS
无
2001-01-01
This paper briefly presents the general ideas of high order accurate weighted essentially non-oscillatory (WENO) schemes, and describes the similarities and differences of the two classes of WENO schemes: finite volume schemes and finite difference schemes. We also briefly mention a recent development of WENO schemes,namely an adaptive approach within the finite difference framework using smooth time dependent curvilinear coordinates.``
SUPPLEMENT AND IMPROVEMENT OF HOLLY-PREISSMANN SCHEME
XIE Zuo-tao; ZHANG Xiao-feng; TAN Guang-ming
2004-01-01
Using the undetermined coefficient method, Holly-Preissmann scheme is improved effectively. The scheme with the minus velocity is added, and a new conservative scheme is also presented on the basis of original scheme. The simulations of the new scheme accord with the exact result, which enhances its applicability in the engineering.
Torsion-free Sheaves and ACM Schemes
Greco, S; Spreafico, M L
2012-01-01
In this paper we study short exact sequences $ 0 \\to \\mathcal P \\to \\mathcal N \\to \\ii_D(k) \\to 0 $ with $ \\mathcal P, \\mathcal N $ torsion--free sheaves and $ D $ closed projective scheme. This is a classical way to construct and study projective schemes (e.g. see \\cite{hart-1974}, \\cite{hart-2}, \\cite{mdp}, \\cite{serre-1960}). In particular, we give homological conditions on $ \\mathcal P $ and $ \\mathcal N $ that force $ D $ to be ACM, without constrains on its codimension. As last result, we prove that if $ \\mathcal N $ is a higher syzygy sheaf of an ACM scheme $ X,$ the scheme $ D $ we get contains $ X.$
High order compact schemes for gradient approximation
无
2010-01-01
In this paper, we propose three gradient recovery schemes of higher order for the linear interpolation. The first one is a weighted averaging method based on the gradients of the linear interpolation on the uniform mesh, the second is a geometric averaging method constructed from the gradients of two cubic interpolation on macro element, and the last one is a local least square method on the nodal patch with cubic polynomials. We prove that these schemes can approximate the gradient of the exact solution on the symmetry points with fourth order. In particular, for the uniform mesh, we show that these three schemes are the same on the considered points. The last scheme is more robust in general meshes. Consequently, we obtain the superconvergence results of the recovered gradient by using the aforementioned results and the supercloseness between the finite element solution and the linear interpolation of the exact solution. Finally, we provide several numerical experiments to illustrate the theoretical results.
The Effective Key Length of Watermarking Schemes
Bas, Patrick
2012-01-01
Whereas the embedding distortion, the payload and the robustness of digital watermarking schemes are well understood, the notion of security is still not completely well defined. The approach proposed in the last five years is too theoretical and solely considers the embedding process, which is half of the watermarking scheme. This paper proposes a new measurement of watermarking security, called the effective key length, which captures the difficulty for the adversary to get access to the watermarking channel. This new methodology is applied to additive spread spectrum schemes where theoretical and practical computations of the effective key length are proposed. It shows that these schemes are not secure as soon as the adversary gets observations in the Known Message Attack context.
Designing optimal sampling schemes for field visits
Debba, Pravesh
2008-10-01
Full Text Available This is a presentation of a statistical method for deriving optimal spatial sampling schemes. The research focuses on ground verification of minerals derived from hyperspectral data. Spectral angle mapper (SAM) and spectral feature fitting (SFF...
Efficient Identity Based Public Verifiable Signcryption Scheme
Kushwah, Prashant
2011-01-01
Signcryption is a cryptographic primitive which performs encryption and signature in a single logical step. In conventional signcryption only receiver of the signcrypted text can verify the authenticity of the origin i.e. signature of the sender on the message after decrypting the cipher text. In public verifiable signcryption scheme anyone can verify the authenticity of the origin who can access the signcrypted text i.e. signature of the sender on the cipher text. Public verifiable signcryption scheme in which the receiver can convince a third party, by providing additional information other than his private key along with the signcryption is called third party verifiable signcryption schemes. In this paper we proposed an efficient identity based public verifiable signcryption scheme with third party verification and proved its security in the random oracle model.
Lifting scheme of symmetric tight wavelets frames
ZHUANG BoJin; YUAN WeiTao; PENG LiZhong
2008-01-01
This paper proposes a method to realize the lifting scheme of tight frame wavelet filters. As for 4-channel tight frame wavelet filter, the tight frame transforms' ma-trix is 2×4, but the lifting scheme transforms' matrix must be 4×4. And in the case of 3-channel tight frame wavelet filter, the transforms' matrix is 2×3, but the lifting scheme transforms' matrix must be 3×3. In order to solve this problem, we intro-duce two concepts: transferred polyphase matrix for 4-channel filters and trans-ferred unitary matrix for 3-channel filters. The transferred polyphase matrix is sym-metric/antisymmetric. Thus, we use this advantage to realize the lifting scheme.
Asymmetric Watermarking Scheme Based on Correlation Testing
Rinaldi Munir
2007-06-01
Full Text Available Abstract Asymmetric watermarking is the second generation of watermarking scheme which uses different keys for embedding and detecting watermark. Key for embedding is private or secret, but key for detecting can be available publicly and everyone who has the key can detect watermark Watermark detection does not need to be original multimedia data. Detection of watermark is realized using correlation test between public key and multimedia data received. In most of schemes, private key is the watermark itself; public key is public watermark which correlates to the private watermark This paper presents concept of asymmetric watermarking scheme that based on correlation test and reviews some schemes of asymmetric watermarking that have been proposed by researchers. Keywords: asymmetric watermarking, private key, public key, watermark., multimeelia,:correlation.
A lightweight authentication scheme with user untraceability
Kuo-Hui YEH
2015-01-01
With the rapid growth of electronic commerce and associated demands on variants of Internet based applications, application systems providing network resources and business services are in high demand around the world. To guarantee ro-bust security and computational efficiency for service retrieval, a variety of authentication schemes have been proposed. How-ever, most of these schemes have been found to be lacking when subject to a formal security analysis. Recently, Changet al. (2014) introduced a formally provable secure authentication protocol with the property of user-untraceability. Unfortunately, based on our analysis, the proposed scheme fails to provide the property of user-untraceability as claimed, and is insecure against user impersonation attack, server counterfeit attack, and man-in-the-middle attack. In this paper, we demonstrate the details of these malicious attacks. A security enhanced authentication scheme is proposed to eliminate all identified weaknesses.
An efficient medical image compression scheme.
Li, Xiaofeng; Shen, Yi; Ma, Jiachen
2005-01-01
In this paper, a fast lossless compression scheme is presented for the medical image. This scheme consists of two stages. In the first stage, a Differential Pulse Code Modulation (DPCM) is used to decorrelate the raw image data, therefore increasing the compressibility of the medical image. In the second stage, an effective scheme based on the Huffman coding method is developed to encode the residual image. This newly proposed scheme could reduce the cost for the Huffman coding table while achieving high compression ratio. With this algorithm, a compression ratio higher than that of the lossless JPEG method for image can be obtained. At the same time, this method is quicker than the lossless JPEG2000. In other words, the newly proposed algorithm provides a good means for lossless medical image compression.
The Dewey Decimal Scheme and Mathematics
Donovan, Peter W.; And Others
1973-01-01
This essay criticizes the mathematical schedules of the 18th edition of the Dewey Decimal Classification Scheme and offers two alternatives suitable for college libraries that use this system. (Authors)
ONU Power Saving Scheme for EPON System
Mukai, Hiroaki; Tano, Fumihiko; Tanaka, Masaki; Kozaki, Seiji; Yamanaka, Hideaki
PON (Passive Optical Network) achieves FTTH (Fiber To The Home) economically, by sharing an optical fiber among plural subscribers. Recently, global climate change has been recognized as a serious near term problem. Power saving techniques for electronic devices are important. In PON system, the ONU (Optical Network Unit) power saving scheme has been studied and defined in XG-PON. In this paper, we propose an ONU power saving scheme for EPON. Then, we present an analysis of the power reduction effect and the data transmission delay caused by the ONU power saving scheme. According to the analysis, we propose an efficient provisioning method for the ONU power saving scheme which is applicable to both of XG-PON and EPON.
Certificateless universal designated verifier signature schemes
无
2007-01-01
Universal designated verifier signature schemes allows a signature holder to designate the signature to a desire designated verifier, in such a way that only designated verifier can verify this signature, but is unable to convince anyone else of this fact.The previous constructions of universal designated verifier signature rely on the underlying public key infrastructure, that needs both signers and verifiers to verify the authenticity of the public keys, and hence, the certificates are required.This article presents the first model and construction of the certificateless universal designated verifier signature scheme, in which the certificates are not needed.The proposed scheme satisfies all the requirements of the universal designated verifier signature in the certificateless system.Security proofs are provided for the scheme based on the random oracle model, assuming that the Bilinear diffie-hellman (BDH) problem is hard to solve.
Broadcast encryption schemes based on RSA
MU Ning-bo; HU Yu-pu; OU Hai-wen
2009-01-01
Three broadcast schemes for small receiver set using the property of RSA modulus are presented. They can solve the problem of data redundancy when the size of receiver set is small. In the proposed schemes, the center uses one key to encrypt the message and can revoke authorization conveniently. Every authorized user only needs to store one decryption key of a constant size. Among these three schemes, the first one has indistinguishability against adaptive chosen ciphertext attack (IND-CCA2) secure, and any collusion of authorized users cannot produce a new decryption key but the sizes of encryption modulus and ciphertext are linear in the number of receivers. In the second scheme, the size of ciphertext is half of the first one and any two authorized users can produce a new decryption key, but the center can identify them using the traitor tracing algorithm. The third one is the most efficient but the center cannot identify the traitors exactly.
A New Efficient Mobile Micropayment Scheme
FU Xiong; YANG Zong-kai; LANG Wei-min; TAN Yun-meng
2004-01-01
This paper proposes a micropayment scheme designed for GSM mobile scenario, where the overload of computation, storage and communication for mobile phone is reduced by directing operations normally performed by the mobile user to the static portion of the network in view of its limited capability. Messages which received and sent during the payment are very simple and public key infrastructure is not needed, which reduces delay and removes the possibility of incomplete payment due to communications failures. Furthermore, all the information related to payment is encrypted by a shared symmetric key in our scheme, so the privacy of the mobile user is protected and the security of information is guaranteed. Compared with other mobile micropayment schemes in existence, no public-key operation is required, which minimizes the computation and storage overhead dramatically. In addition, restricted anonymous is also provided in our scheme.
Readout scheme of the upgraded ALICE TPC
Appelshaeuser, Harald; Ivanov, Marian; Lippmann, Christian; Wiechula, Jens
2016-01-01
In this document, we present the updated readout scheme for the ALICE TPC Upgrade. Two major design changes are implemented with respect to the concept that was presented in the TPC Upgrade Technical Design Report: – The SAMPA front-end ASIC will be used in direct readout mode. – The ADC sampling frequency will be reduced from 10 to 5 MHz. The main results from simulations and a description of the new readout scheme is outlined.
Problems of robustness for universal coding schemes
V'yugin, V. V.
2008-01-01
The Lempel-Ziv universal coding scheme is asymptotically optimal for the class of all stationary ergodic sources. A problem of robustness of this property under small violations of ergodicity is studied. A notion of deficiency of algorithmic randomness is used as a measure of disagreement between data sequence and probability measure. We prove that universal compressing schemes from a large class are non-robust in the following sense: if the randomness deficiency grows arbitrarily slowly on i...
Binary Schemes of Vapor Bubble Growth
Zudin, Yu. B.
2015-05-01
A problem on spherically symmetric growth of a vapor bubble in an infi nite volume of a uniformly superheated liquid is considered. A description of the limiting schemes of bubble growth is presented. A binary inertial-thermal bubble growth scheme characterized by such specifi c features as the "three quarters" growth law and the effect of "pressure blocking" in a vapor phase is considered.
Advanced switching schemes in a Stark decelerator
Zhang, Dongdong; Meijer, Gerard
2015-01-01
We revisit the operation of the Stark decelerator and present a new, optimized operation scheme, which substantially improves the efficiency of the decelerator at both low and high final velocities, relevant for trapping experiments and collision experiments, respectively. Both experimental and simulation results show that this new mode of operation outperforms the schemes which have hitherto been in use. This new mode of operation could potentially be extended to other deceleration techniques.
Field sampling scheme optimization using simulated annealing
Debba, Pravesh
2010-10-01
Full Text Available to derive optimal sampling schemes. 2. Hyperspectral remote sensing In the study of electro-magnetic physics, when energy in the form of light interacts with a material, part of the energy at certain wavelength is absorbed, transmitted, emitted... in order to derive optimal sampling schemes. 2. Hyperspectral remote sensing In the study of electro-magnetic physics, when energy in the form of light interacts with a material, part of the energy at certain wavelength is absorbed, transmitted, emitted...
Composite centered schemes for multidimensional conservation laws
Liska, R. [Czech Technical Univ., Prague (Czech Republic). Faculty of Nuclear Sciences and Physical Engineering; Wendroff, B. [Los Alamos National Lab., NM (United States)
1998-05-08
The oscillations of a centered second order finite difference scheme and the excessive diffusion of a first order centered scheme can be overcome by global composition of the two, that is by performing cycles consisting of several time steps of the second order method followed by one step of the diffusive method. The authors show the effectiveness of this approach on some test problems in two and three dimensions.
Renormalization Scheme Dependence and Renormalization Group Summation
McKeon, D G C
2016-01-01
We consider logarithmic contributions to the free energy, instanton effective action and Laplace sum rules in QCD that are a consequence of radiative corrections. Upon summing these contributions by using the renormalization group, all dependence on the renormalization scale parameter mu cancels. The renormalization scheme dependence in these processes is examined, and a renormalization scheme is found in which the effect of higher order radiative corrections is absorbed by the behaviour of the running coupling.
Accuracy property of certain hyperbolic difference schemes
Hicks, D.L.; Madsen, M.M.
1976-12-01
An accuracy property called the CFL1 property is shared by several successful difference schemes. It appears to be a property at least as important as the property of higher-order accuracy for hyperbolic difference schemes when weak solutions (e.g., shocks) are sought. Investigation of this property leads to suggestions of ways to improve the accuracy in such wavecodes as WONDY, CHARTD, and THREEDY. 10 figures.
Toric varieties, monoid schemes and $cdh$ descent
Cortiñas, Guillermo; Walker, Mark E; Weibel, Charles A
2011-01-01
We give conditions for the Mayer-Vietoris property to hold for the algebraic K-theory of blow-up squares of toric varieties in any characteristic, using the theory of monoid schemes. These conditions are used to relate algebraic K-theory to topological cyclic homology in characteristic p. To achieve our goals, we develop for monoid schemes many notions from classical algebraic geometry, such as separated and proper maps.
GROUP VELOCITY CONTROL SCHEME WITH LOW DISSIPATION
无
2000-01-01
In order to prevent smearing the discontinuity, a modified term is added to the third order Upwind Compact Difference scheme to lower the dissipation error. Moreover, the dispersion error is controled to hold back the non-physical oscillation by means of the group velocity control. The scheme is used to simulate the interactions of shock-density stratified interface and the disturbed interface developing to vortex rollers. Numerical results are satisfactory.
Electronic Payment Scheme to Prevent the Treachery
FAN Kai; ZHANG Jun; KOU Weidong; XIAO Guozhen
2006-01-01
Treachery is one of the restrictions to the development of electronic commerce. To prevent the treachery from the participants in electronic commerce, in this paper a secure electronic payment scheme is proposed and its security is analyzed. This scheme can prevent the treachery only with the aid of an un-trusted third party. It is very simple and it also improves the security and provides the non-repudiation, accountability, fairness and privacy.
Simplification of the unified gas kinetic scheme
Chen, Songze; Guo, Zhaoli; Xu, Kun
2016-08-01
The unified gas kinetic scheme (UGKS) is an asymptotic preserving (AP) scheme for kinetic equations. It is superior for transition flow simulation and has been validated in the past years. However, compared to the well-known discrete ordinate method (DOM), which is a classical numerical method solving the kinetic equations, the UGKS needs more computational resources. In this study, we propose a simplification of the unified gas kinetic scheme. It allows almost identical numerical cost as the DOM, but predicts numerical results as accurate as the UGKS. In the simplified scheme, the numerical flux for the velocity distribution function and the numerical flux for the macroscopic conservative quantities are evaluated separately. The equilibrium part of the UGKS flux is calculated by analytical solution instead of the numerical quadrature in velocity space. The simplification is equivalent to a flux hybridization of the gas kinetic scheme for the Navier-Stokes (NS) equations and the conventional discrete ordinate method. Several simplification strategies are tested, through which we can identify the key ingredient of the Navier-Stokes asymptotic preserving property. Numerical tests show that, as long as the collision effect is built into the macroscopic numerical flux, the numerical scheme is Navier-Stokes asymptotic preserving, regardless the accuracy of the microscopic numerical flux for the velocity distribution function.
杨凌; 胡丙萌; 苏婧; 石莹
2016-01-01
A mathematical model of a charge-controlled memcapacitor directly from the definition was proposed, and a new floating memcapacitor emulator was implemented using common off-the-shelf components. Then the system-level circuit simulation experiments under different alternating signal and different parameters were presented based on Multisim and Matlab simulation platform. The implementation of the hardware circuit and the performance tests were presented. The results show that the charge-voltage characteristic of the designed charge-controlled memcapacitor is a frequency-dependent pinched loop, which indicats that it is a kind of nonlinear capacitor with memory and in accord with the concept of memcapacitor. The research provides the simulation entities of memory circuit devices to produce new application circuits in the field of electronics.%直接从荷控忆容器的数学模型出发，首先采用通用有源电路芯片设计了忆容器“浮地”电路模拟器，之后结合Matlab和Multisim混合仿真的方法，研究了其二端口的基本电特性，给出了在不同交变信号激励以及不同参数下忆容器电路模拟器的系统级仿真实验，最后完成了其硬件电路的实现及性能测试。结果表明：所设计的荷控忆容器具有电荷－电压之间的自收缩磁滞回线特性，是一种具有记忆特性的非线性电容，这与理论概念上的忆容器特性相吻合，可为忆容器在电子学领域产生新的应用电路提供器件模拟实体。
A NEW SCHEME BASED ON THE MI SCHEME AND ITS ANALYSIS
Jiao Luyao; Li Yifa; Qiao Shuaiting
2013-01-01
This article aims at designing a new Multivariate Quadratic (MQ) public-key scheme to avoid the linearization attack and differential attack against the Matsumoto-Imai (MI) scheme.Based on the original scheme,our new scheme,named the Multi-layer MI (MMI) scheme,has a structure of multi-layer central map.Firstly,this article introduces the MI scheme and describes linearization attack and differential attack; then prescribes the designation of MMI in detail,and proves that MMI can resist both linearization attack and differential attack.Besides,this article also proves that MMI can resist recent eXtended Linearization (XL)-like methods.In the end,this article concludes that MMI also maintains the efficiency of MI.
Cryptanalysis and Improvement of Piveteau Signature Scheme with Message Recovery
李子臣; 成军祥; 戴一奇
2003-01-01
Piveteau signature scheme allows message recovery but the methodology differs from that of the Nyberg-Rueppel schemes. This paper analyzes the security of the Piveteau scheme by designing some attacks. Two improved methods to Piveteau signature scheme and Nyberg-Rueppel schemes were developed to avoid these weaknesses. Analyses of the security of the improved schemes prove that the improved methods can effectively handle the attacks proposed in this paper.
Analysis and Improvement of Authenticatable Ring Signcryption Scheme
LI Fa-gen; Shirase Masaaki; Takagi Tsuyoshi
2008-01-01
We show that the Zhang-Yang-Zhu-Zhang identity-based authenticatable ring signcryption scheme is not secure against chosen plaintext attacks.Furthermore,we propose an improved scheme that remedies the weakness of the Zhang-Yang-Zhu-Zhang scheme.The improved scheme has shorter ciphertext size than the Zhang-Yang-Zhu-Zhang scheme.We then prove that the improved scheme satisfies confidentiality,unforgeability,anonymity and authenticatability.
PIC BASED SOLAR CHARGING CONTROLLER FOR BATTERY
Mrs Jaya N. Ingole
2012-02-01
Full Text Available Solar resource is unlimited the government is trying to implement the use of Solar panels as an energy source in rural and sub urban areas for lighting the street lights, but the battery used to store the power gets affected due to overcharge & discharges. This paper presents the use of PIC16F72 based solar charger controller for controlling the overcharging and discharging of a solar cell. It works by continuously optimizing the interface between the solar array and battery. First, the variable supply is fixed at 12.8V dc—the voltage of a fully charged battery— and linked to the battery point of the circuit. Cut Off of battery from load voltage is 10.8 volt. A PIC16F72 for small size and inbuilt analog inputs is used to determine voltage level of battery and solar panel..It also describes how the disadvantages of analog circuit are overcome by this controller. The flow chart is also provided.
Automatic charge control system for satellites
Shuman, B. M.; Cohen, H. A.
1985-01-01
The SCATHA and the ATS-5 and 6 spacecraft provided insights to the problem of spacecraft charging at geosychronous altitudes. Reduction of the levels of both absolute and differential charging was indicated, by the emission of low energy neutral plasma. It is appropriate to complete the transition from experimental results to the development of a system that will sense the state-of-charge of a spacecraft, and, when a predetermined threshold is reached, will respond automatically to reduce it. A development program was initiated utilizing sensors comparable to the proton electrostatic analyzer, the surface potential monitor, and the transient pulse monitor that flew in SCATHA, and combine these outputs through a microprocessor controller to operate a rapid-start, low energy plasma source.
Combining image-processing and image compression schemes
Greenspan, H.; Lee, M.-C.
1995-01-01
An investigation into the combining of image-processing schemes, specifically an image enhancement scheme, with existing compression schemes is discussed. Results are presented on the pyramid coding scheme, the subband coding scheme, and progressive transmission. Encouraging results are demonstrated for the combination of image enhancement and pyramid image coding schemes, especially at low bit rates. Adding the enhancement scheme to progressive image transmission allows enhanced visual perception at low resolutions. In addition, further progressing of the transmitted images, such as edge detection schemes, can gain from the added image resolution via the enhancement.
Feasibility analysis of two identity- based proxy ring signature schemes
Wang Huaqun; Zhang Lijun; Zhao Junxi
2007-01-01
Recently , proxy ring signature schemes have been shown to be useful in various applications , such as electronic polling, electronic payment, etc. Although many proxy ring signature schemes have been proposed, there are only two identity- based proxy ring signature schemes have been proposed until now, I.e., Cheng's scheme and Lang's scheme. It's unlucky that the two identity- based proxy ring signature schemes are unfeasible . This paper points out the reasons why the two identity- based proxy ring signature schemes are unfeasible. In order to design feasible and efficient identity-based proxy ring signature schemes from bilinear pairings , we have to search for other methods .
Design of PV Charge Controller Based on STM32F103 Chip%基于STM32F103芯片的光伏充电控制器设计
王海龙; 王维俊; 张国平; 刘华
2013-01-01
为了改善独立光伏发电系统中蓄电池的荷电水平,延长蓄电池的使用寿命.提出利用最大功率跟踪(MPPT)与蓄电池三段式充电相结合的充电控制策略,并基于数字控制方式,设计完成了光伏充电控制器的硬件电路和控制软件,完成了相关实验,验证了设计的有效性和正确性.%To improve the quality of storage battery in the isolated photovoltaic generation system and prolong the longevity of battery.This article proposed a new control strategy combined MPPT with three phase charging.Then,a digital PV charging controller was designed,and the circuit design and software program were depicted in detail.The experiment results prove the effectiveness and correctness.
Application of ADER Scheme in MHD Simulation
ZHANG Yanyan; FENG Xueshang; JIANG Chaowei; ZHOU Yufen
2012-01-01
The Arbitrary accuracy Derivatives Riemann problem method（ADER） scheme is a new high order numerical scheme based on the concept of finite volume integration,and it is very easy to be extended up to any order of space and time accuracy by using a Taylor time expansion at the cell interface position.So far the approach has been applied successfully to flow mechanics problems.Our objective here is to carry out the extension of multidimensional ADER schemes to multidimensional MHD systems of conservation laws by calculating several MHD problems in one and two dimensions： （ⅰ） Brio-Wu shock tube problem,（ⅱ） Dai-Woodward shock tube problem,（ⅲ） Orszag-Tang MHD vortex problem.The numerical results prove that the ADER scheme possesses the ability to solve MHD problem,remains high order accuracy both in space and time,keeps precise in capturing the shock.Meanwhile,the compared tests show that the ADER scheme can restrain the oscillation and obtain the high order non-oscillatory result.
Financial incentive schemes in primary care
Gillam S
2015-09-01
Full Text Available Stephen Gillam Department of Public Health and Primary Care, Institute of Public Health, University of Cambridge, Cambridge, UK Abstract: Pay-for-performance (P4P schemes have become increasingly common in primary care, and this article reviews their impact. It is based primarily on existing systematic reviews. The evidence suggests that P4P schemes can change health professionals' behavior and improve recorded disease management of those clinical processes that are incentivized. P4P may narrow inequalities in performance comparing deprived with nondeprived areas. However, such schemes have unintended consequences. Whether P4P improves the patient experience, the outcomes of care or population health is less clear. These practical uncertainties mirror the ethical concerns of many clinicians that a reductionist approach to managing markers of chronic disease runs counter to the humanitarian values of family practice. The variation in P4P schemes between countries reflects different historical and organizational contexts. With so much uncertainty regarding the effects of P4P, policy makers are well advised to proceed carefully with the implementation of such schemes until and unless clearer evidence for their cost–benefit emerges. Keywords: financial incentives, pay for performance, quality improvement, primary care
HR Department
2007-01-01
As announced at the meeting of the Standing Concertation Committee (SCC) on 26 June 2007 and in http://Bulletin No. 28/2007, the existing Saved Leave Scheme will be discontinued as of 31 December 2007. Staff participating in the Scheme will shortly receive a contract amendment stipulating the end of financial contributions compensated by save leave. Leave already accumulated on saved leave accounts can continue to be taken in accordance with the rules applicable to the current scheme. A new system of saved leave will enter into force on 1 January 2008 and will be the subject of a new im-plementation procedure entitled "Short-term saved leave scheme" dated 1 January 2008. At its meeting on 4 December 2007, the SCC agreed to recommend the Director-General to approve this procedure, which can be consulted on the HR Department’s website at the following address: https://cern.ch/hr-services/services-Ben/sls_shortterm.asp All staff wishing to participate in the new scheme ...
2007-01-01
As announced at the meeting of the Standing Concertation Committee (SCC) on 26 June 2007 and in http://Bulletin No. 28/2007, the existing Saved Leave Scheme will be discontinued as of 31 December 2007. Staff participating in the Scheme will shortly receive a contract amendment stipulating the end of financial contributions compensated by save leave. Leave already accumulated on saved leave accounts can continue to be taken in accordance with the rules applicable to the current scheme. A new system of saved leave will enter into force on 1 January 2008 and will be the subject of a new implementation procedure entitled "Short-term saved leave scheme" dated 1 January 2008. At its meeting on 4 December 2007, the SCC agreed to recommend the Director-General to approve this procedure, which can be consulted on the HR Department’s website at the following address: https://cern.ch/hr-services/services-Ben/sls_shortterm.asp All staff wishing to participate in the new scheme a...
Dynamic Localization Schemes in Malicious Sensor Networks
Kaiqi Xiong
2009-10-01
Full Text Available Wireless sensor networks (WSN have recently shown many potential military and civilian applications, especially those used in hostile environments where malicious adversaries can be present. The accuracy of location information is critical for such applications. It is impractical to have a GPS device on each sensor in WSN due to costs. Most of the existing location discovery schemes can only be used in the trusted environment. Recent research has addressed security issues in sensor network localization, but to the best of our knowledge, none have completely solved the secure localization problem. In this paper, we propose novel schemes for secure dynamic localization in sensor networks. These proposed schemes can tolerate up to 50% of beacon nodes being malicious, and they have linear computation time with respect to the number of reference nodes. Our security analysis has showed that our schemes are applicable and resilient to attacks from adversaries. We have further conducted simulations to analyze and compare the performance of these schemes, and to indicate when each should be used. The efficiencies of each method shows why we needed to propose multiple methods.
Arbitrated quantum signature schemes without using entangled states
Zou, Xiangfu
2010-01-01
A digital signature is a mathematical scheme for demonstrating the authenticity of a digital message or document. For signing quantum messages, some arbitrated quantum signature schemes have being proposed. However, in the existing literature, arbitrated quantum signature schemes depend on entanglement. In this paper, we present two arbitrated quantum signature schemes without utilizing entangled states in the signing phase and the verifying phase. The first proposed scheme can preserve the merits in the existing schemes. Then, we point out, in this scheme and the prior schemes, there exists a problem that Bob can repudiate the integrality of the signatures. To conquer this problem, we construct another arbitrated quantum signature scheme without using quantum entangled states but using a public board. The new scheme has three advantages: it does not utilize entangled states while it can preserve all merits in the existing schemes; the integrality of the signature can avoid being disavowed by the receiver; an...
Explicit and implicit finite difference schemes for fractional Cattaneo equation
Ghazizadeh, H. R.; Maerefat, M.; Azimi, A.
2010-09-01
In this paper, the numerical solution of fractional (non-integer)-order Cattaneo equation for describing anomalous diffusion has been investigated. Two finite difference schemes namely an explicit predictor-corrector and totally implicit schemes have been developed. In developing each scheme, a separate formulation approach for the governing equations has been considered. The explicit predictor-corrector scheme is the fractional generalization of well-known MacCormack scheme and has been called Generalized MacCormack scheme. This scheme solves two coupled low-order equations and simultaneously computes the flux term with the main variable. Fully implicit scheme however solves a single high-order undecomposed equation. For Generalized MacCormack scheme, stability analysis has been studied through Fourier method. Through a numerical test, the experimental order of convergency of both schemes has been found. Then, the domain of applicability and some numerical properties of each scheme have been discussed.
COPROX fixed bed reactor - temperature control schemes
Giunta, P.; Moreno, M.; Marino, F.; Amadeo, N.; Lobarde, M. [Laboratorio de Procesos Cataliticos, Facultad de Ingenieria, Universidad de Buenos Aires, Buenos Aires (Argentina)
2012-06-15
Different temperature control schemes for the COPROX stage of a 5-kW fuel cell system were analyzed. It was found that, among the schemes proposed, i.e., co- and countercurrent heat exchange, single adiabatic reactor and series of adiabatic reactors with interstage heat exchange, the best choice for temperature control was the series of adiabatic reactors with interstage heat exchange. This scheme represented the best way to keep the average temperature around 443 K, which was found to be the most suitable temperature for selectivity towards CO oxidation. If hydrogen is produced from ethanol steam reforming, the heat withdrawal can be carried out by the water/ethanol reformer feed mixture, thus contributing to the energy integration of the overall system. (Copyright copyright 2012 WILEY-VCH Verlag GmbH and Co. KGaA, Weinheim)
Energy-saving PPM schemes for WSNs
TANG QiuLing; YANG LiuQing; QIN TuanFa; ZHANG ShuYi
2008-01-01
Energy conservation is a critical problem in recenlly-emerging wireless sensor networks (WSNs). Pulse position modulation (PPM), as an exploring-worthy modulation format for energy efficiency, is tailored for WSNs into two schemes, mono-mode PPM and multi-mode PPM, in this paper. Resorting to an idealized system model and a practical system model, which combine the power consump-tions in transmission and reception modules of nodes with the idealized and real-istic battery characteristics, the battery energy efficiencies of mono-mode PPM and multi-mode PPM are evaluated and compared. To minimize the battery energy consumption (BEC), these schemes are further optimized in terms of constellation size M for a link in path-loss channels. Our analytical and numerical results show that considerable energy can be saved by multi-mode PPM; and the optimization performances of these schemes are noticeable at various communication dis-tances though their optimization properties are different.
Charge preserving high order PIC schemes
Londrillo, P., E-mail: pasquale.londrillo@oabo.inaf.i [INAF Bologna Osservatorio Astronomico (Italy); INFN Sezione Bologna (Italy); Benedetti, C.; Sgattoni, A.; Turchetti, G. [INFN Sezione Bologna (Italy); Dipartimento di Fisica dell' Universita di Bologna (Italy)
2010-08-01
In this paper we present some new results on our investigation aimed at extending to higher order (HOPIC) the classical PIC framework. After reviewing the basic resolution properties of the Runge-Kutta time integrator, coupled to fourth (sixth) order compact schemes for space derivatives in the Maxwell equations, we focus on the problem of extending charge conservation schemes to a general HOPIC framework. This issue represents the main contribution of the present work. We consider then a few numerical examples of 1D laser-plasma interaction in the under-dense and over-dense regimes relevant for ions acceleration, to test grid convergence and to compare HOPIC results with standard PIC schemes (LOPIC).
IPCT: A scheme for mobile authentication
Vishnu Shankar
2016-09-01
Full Text Available Mobile is becoming a part of everyone's life and as their power of computation and storage is rising and cost is coming down. Most of mobile phone users have a lot of private data which they want to protect from others (La Polla et al., 2013. It means user must be authenticated properly for accessing the mobile resources. Normally user is authenticated using text passwords, PIN, face recognition or patterns etc. All these methods are used but they have some shortcomings. In this paper we have seen various existing methods of mobile authentications and proposed our improved mobile authentication IPCT scheme. We have compared our Image Pass Code with tapping scheme with existing techniques and shown that our scheme is better than existing techniques.
Integrated Protection Scheme for Power Line
BO Zhiqian; SHI Shenxing; DONG Xinzhou
2008-01-01
This paper presents an integrated relay and its associated protection scheme for power transmission lines. The concept of integrated protection is firstly introduced, in which a centralized protection system or relay provides the protection for multiple power plants or a substation. A novel integrated protection relay based on the combination of a number of protection principles is de- scribed. In the proposed scheme, the specially designed protection relays are installed at each substation of a network and are responsible for the protection of every line section connected to the substation busbar.The combined algorithms with multiple settings are implemented into the relay to cover all the protected line sections.Simulation studies show that the proposed protection scheme is able to produce desirable performance and may offer many advantages over the exist- ing one and great potential for future applications.
Loading Schemes for Downlink OFDMA Systems
KONG Jian; LIU Fang; WANG Wen-bo; LIU Yuan-an
2004-01-01
In this paper we study the subcarrier and bit allocation strategies for downlink OFDMA system. Our optimization objective is to find optimum subcarrier and bit assignment minimizing the total transmitted power with the constraints on BER and data rate for all users. We divide this problem into three steps: resource allocation, subcarrier assignment and single-user power and bit allocation. For the first two steps we propose new algorithms. Various loading schemes constitute by combining these algorithms as well as algorithms proposed in Ref . [ 6 ]. Simulation results demonstrate that our proposed suboptimal loading scheme can achieve performance closer to the near optimal algorithm in Ref . [ 8 ] with much lower complexity than schemes in Ref .[6].
Optimal Sales Schemes for Network Goods
Parakhonyak, Alexei; Vikander, Nick
This paper examines the optimal sequencing of sales in the presence of network externalities. A firm sells a good to a group of consumers whose payoff from buying is increasing in total quantity sold. The firm selects the order to serve consumers so as to maximize expected sales. It can serve all...... consumers simultaneously, serve them all sequentially, or employ any intermediate scheme. We show that the optimal sales scheme is purely sequential, where each consumer observes all previous sales before choosing whether to buy himself. A sequential scheme maximizes the amount of information available...... to consumers, allowing success to breed success. Failure can also breed failure, but this is made less likely by consumers’ desire to influence one another’s behavior. We show that when consumers differ in the weight they place on the network externality, the firm would like to serve consumers with lower...
Asynchronous discrete event schemes for PDEs
Stone, D.; Geiger, S.; Lord, G. J.
2017-08-01
A new class of asynchronous discrete-event simulation schemes for advection-diffusion-reaction equations is introduced, based on the principle of allowing quanta of mass to pass through faces of a (regular, structured) Cartesian finite volume grid. The timescales of these events are linked to the flux on the face. The resulting schemes are self-adaptive, and local in both time and space. Experiments are performed on realistic physical systems related to porous media flow applications, including a large 3D advection diffusion equation and advection diffusion reaction systems. The results are compared to highly accurate reference solutions where the temporal evolution is computed with exponential integrator schemes using the same finite volume discretisation. This allows a reliable estimation of the solution error. Our results indicate a first order convergence of the error as a control parameter is decreased, and we outline a framework for analysis.
An ECC-Based Blind Signature Scheme
Fuh-Gwo Jeng
2010-08-01
Full Text Available Cryptography is increasingly applied to the E-commerce world, especially to the untraceable payment system and the electronic voting system. Protocols for these systems strongly require the anonymous digital signature property, and thus a blind signature strategy is the answer to it. Chaum stated that every blind signature protocol should hold two fundamental properties, blindness and intractableness. All blind signature schemes proposed previously almost are based on the integer factorization problems, discrete logarithm problems, or the quadratic residues, which are shown by Lee et al. that none of the schemes is able to meet the two fundamental properties above. Therefore, an ECC-based blind signature scheme that possesses both the above properties is proposed in this paper.
Dropout--Mertonian or reproduction scheme?
Horowitz, T R
1992-01-01
This article reports on dropouts in four schools in Israel. Two main research questions were addressed: (1) Is it possible to identify a potential dropout through examination of his/her attitudes and competence before the actual act of leaving school? (2) Is there a difference between dropouts and persistent students in different educational settings (academic, vocational, agricultural, and comprehensive high schools)? Significant differences were found in the attitudes of persistent students and dropouts even before the act of dropping out occurred. In the vocational, comprehensive, and agricultural schools, the dropouts scored more positively on the self-estrangement, meaninglessness, and misfeasance scales. In the academic school, the dropouts scored positively on the anxiety scale. Results were interpreted in light of the Mertonian scheme of ends and means as well as the reproduction scheme. The Mertonian scheme was deemed more applicable.
A Traffic Restriction Scheme for Enhancing Carpooling
Dong Ding
2017-01-01
Full Text Available For the purpose of alleviating traffic congestion, this paper proposes a scheme to encourage travelers to carpool by traffic restriction. By a variational inequity we describe travelers’ mode (solo driving and carpooling and route choice under user equilibrium principle in the context of fixed demand and detect the performance of a simple network with various restriction links, restriction proportions, and carpooling costs. Then the optimal traffic restriction scheme aiming at minimal total travel cost is designed through a bilevel program and applied to a Sioux Fall network example with genetic algorithm. According to various requirements, optimal restriction regions and proportions for restricted automobiles are captured. From the results it is found that traffic restriction scheme is possible to enhance carpooling and alleviate congestion. However, higher carpooling demand is not always helpful to the whole network. The topology of network, OD demand, and carpooling cost are included in the factors influencing the performance of the traffic system.
System Protection Schemes in Eastern Denmark
Rasmussen, Joana
The Ph.D. project investigates different aspects of voltage stability in the power system of Eastern Denmark taking into account the large amount of wind power. In the project, a simple System Protection Scheme (SPS) against voltage instability in Eastern Denmark is developed. The SPS design...... outages in the southern part of the 132-kV system introduce further stress in the power system, eventually leading to a voltage collapse. The local System Protection Scheme against voltage collapse is designed as a response-based scheme, which is dependent on local indication of reactive and active power...... for the Eastern Danish power system, such as wind farm rejection, cascading line outages and power oscillations. E.g. Nordic inter-area oscillation modes and damping were easily detected from phasor data during the outage of the 400 kV tie-line between Eastern Denmark and Sweden. It is concluded that recording...
Vector lifting schemes for stereo image coding.
Kaaniche, Mounir; Benazza-Benyahia, Amel; Pesquet-Popescu, Béatrice; Pesquet, Jean-Christophe
2009-11-01
Many research efforts have been devoted to the improvement of stereo image coding techniques for storage or transmission. In this paper, we are mainly interested in lossy-to-lossless coding schemes for stereo images allowing progressive reconstruction. The most commonly used approaches for stereo compression are based on disparity compensation techniques. The basic principle involved in this technique first consists of estimating the disparity map. Then, one image is considered as a reference and the other is predicted in order to generate a residual image. In this paper, we propose a novel approach, based on vector lifting schemes (VLS), which offers the advantage of generating two compact multiresolution representations of the left and the right views. We present two versions of this new scheme. A theoretical analysis of the performance of the considered VLS is also conducted. Experimental results indicate a significant improvement using the proposed structures compared with conventional methods.
Ciphertext verification security of symmetric encryption schemes
HU ZhenYu; SUN FuChun; JIANG JianChun
2009-01-01
This paper formally discusses the security problem caused by the ciphertext verification,presenting a new security notion named IND-CVA (indistinguishability under ciphertext verification attacks) to chap acterize the privacy of encryption schemes in this situation.Allowing the adversary to access to both encryption oracle and ciphertext verification oracle,the new notion IND-CVA is slightly stronger than IND-CPA (indistinguishability under chosen-plaintext attacks) but much weaker than IND-CCA (indistinguishability under chosen-ciphertext attacks),and can be satisfied by most of the popular symmetric encryption schemes such as OTP (one-time-pad),CBC (cipher block chaining) and CTR (counter).An MAC (message authentication scheme) is usually combined with an encryption to guarantee secure communication (e.g.SSH,SSL and IPSec).However,with the notion of IND-CVA,this paper shows that a secure MAC can spoil the privacy in some cases.
Multi-Seed Key Distribution Scheme Test
XIE Yumin; SHI Feng; MING Yang; Muhammad Kamran; YANG Xiaoxu
2006-01-01
The key problem of securing multicast is to generate, distribute and update Session Encryption Key(SEK). Polynomial expansion with multi-seed(MPE) scheme is an approach which is based on Polynomial expansion(PE) scheme and overcomes PE's shortage. Its operation is demonstrated by using multi-seed, the group member is partitioned to many subgroups. While updating the SEK, computation is needed only in one of subgroups, the other of them will use the computation history to update their SEK. The key problems to design a MPE scheme application includes to find a feasible one way function as well as to generate a Strict Prime Number(SPN). Those technologies with multi-seed and computation history concepts make MPE as a good choice in practical applications. A prototype test system is designed and solutions of all above mentioned problems are included in this proposed paper.
A simple angular transmit diversity scheme using a single RF frontend for PSK modulation schemes
Alrabadi, Osama Nafeth Saleem; Papadias, Constantinos B.; Kalis, Antonis
2009-01-01
array (SPA) with a single transceiver, and an array area of 0.0625 square wavelengths. The scheme which requires no channel state information (CSI) at the transmitter, provides mainly a diversity gain to combat against multipath fading. The performance/capacity of the proposed diversity scheme...
Tradable white certificate schemes : what can we learn from tradable green certificate schemes?
Oikonomou, Vlasis; Mundaca, Luis
2008-01-01
In this paper, we analyze the experiences gained from tradable green certificate (TGC) schemes and extract some policy lessons that can lead to a successful design of a market-based approach for energy efficiency improvement, alias tradable white certificate schemes. We use tradable green certificat
Tradable white certificate schemes : what can we learn from tradable green certificate schemes?
Oikonomou, Vlasis; Mundaca, Luis
2008-01-01
In this paper, we analyze the experiences gained from tradable green certificate (TGC) schemes and extract some policy lessons that can lead to a successful design of a market-based approach for energy efficiency improvement, alias tradable white certificate schemes. We use tradable green certificat
Third-order modified coefficient scheme based on essentially non-oscillatory scheme
LI Ming-jun; YANG Yu-yue; SHU Shi
2008-01-01
A third-order numerical scheme is presented to give approximate solutions to multi-dimensional hyperbolic conservation laws only using modified coefficients of an essentially non-oscillatory (MCENO) scheme without increasing the base points during construction of the scheme.The construction process shows that the modified coefficient approach preserves favourable properties inherent in the original essentially non oscillatory (ENO) scheme for its essential non-oscillation,total variation bounded (TVB),etc.The new scheme improves accuracy by one order compared to the original one.The proposed MCENO scheme is applied to simulate two-dimensional Rayleigh-Taylor (RT) instability with densities 1:3 and 1:100,and solve the Lax shock-wave tube numerically.The ratio of CPU time used to implement MCENO,the third-order ENO and fifth-order weighed ENO (WENO) schemes is 0.62:1:2.19.This indicates that MCENO improves accuracy in smooth regions and has higher accuracy and better efficiency compared to the original ENO scheme.
A Complete Scheme for a Muon Collider
Palmer, Robert B; Fernow, Richard C; Gallardo, Juan Carlos; Kirk, Harold G; Alexahin, Yuri; Neuffer, David; Kahn, Stephen Alan; Summers, Don J
2007-01-01
A complete scheme for production, cooling, acceleration, and ring for a 1.5 TeV center of mass muon collider is presented, together with parameters for two higher energy machines. The schemes starts with the front end of a proposed neutrino factory that yields bunch trains of both muon signs. Six dimensional cooling in long-period helical lattices reduces the longitudinal emittance until it becomes possible to merge the trains into single bunches, one of each sign. Further cooling in all dimensions is applied to the single bunches in further helical lattices. Final transverse cooling to the required parameters is achieved in 50 T solenoids.
Clocking Scheme for Switched-Capacitor Circuits
Steensgaard-Madsen, Jesper
1998-01-01
A novel clocking scheme for switched-capacitor (SC) circuits is presented. It can enhance the understanding of SC circuits and the errors caused by MOSFET (MOS) switches. Charge errors, and techniques to make SC circuits less sensitive to them are discussed.......A novel clocking scheme for switched-capacitor (SC) circuits is presented. It can enhance the understanding of SC circuits and the errors caused by MOSFET (MOS) switches. Charge errors, and techniques to make SC circuits less sensitive to them are discussed....
A Modified Model Predictive Control Scheme
Xiao-Bing Hu; Wen-Hua Chen
2005-01-01
In implementations of MPC (Model Predictive Control) schemes, two issues need to be addressed. One is how to enlarge the stability region as much as possible. The other is how to guarantee stability when a computational time limitation exists. In this paper, a modified MPC scheme for constrained linear systems is described. An offline LMI-based iteration process is introduced to expand the stability region. At the same time, a database of feasible control sequences is generated offline so that stability can still be guaranteed in the case of computational time limitations. Simulation results illustrate the effectiveness of this new approach.
A hierarchical classification scheme of psoriasis images
Maletti, Gabriela Mariel; Ersbøll, Bjarne Kjær
2003-01-01
the normal skin in the second stage. These tools are the Expectation-Maximization Algorithm, the quadratic discrimination function and a classification window of optimal size. Extrapolation of classification parameters of a given image to other images of the set is evaluated by means of Cohen's Kappa......A two-stage hierarchical classification scheme of psoriasis lesion images is proposed. These images are basically composed of three classes: normal skin, lesion and background. The scheme combines conventional tools to separate the skin from the background in the first stage, and the lesion from...
ARQ scheme reinforced with past acknowledgement signals
Nakamura, Makoto; Takada, Yasushi
An ARQ (automatic-repeat-request) scheme that can reduce the influence of backward channel errors for bidirectional data transmission systems is proposed. The main feature of the scheme is that both present and past acknowledgement signals are utilized to decide whether the data signals should be retransmitted or not. Throughput performance is analyzed in both go-back-N and selective-repeat ARQ. A small number of returned past acknowledgement signals are required to improve the throughput efficiency. For an ideal selective-repeat ARQ with an infinite buffer, increasing the number of returned past acknowledgement signals makes the throughput efficiency asymptotically close to the upper bound.
Security problem on arbitrated quantum signature schemes
Choi, Jeong Woon; Hong, Dowon
2011-01-01
Until now, there have been developed many arbitrated quantum signature schemes implemented with a help of a trusted third party. In order to guarantee the unconditional security, most of them take advantage of the optimal quantum one-time encryption method based on Pauli operators. However, we in this paper point out that the previous schemes only provides a security against total break and actually show that there exists a simple existential forgery attack to validly modify the transmitted pair of message and signature. In addition, we also provide a simple method to recover the security against the proposed attack.
An Elaborate Secure Quantum Voting Scheme
Zhang, Jia-Lei; Xie, Shu-Cui; Zhang, Jian-Zhong
2017-07-01
An elaborate secure quantum voting scheme is presented in this paper. It is based on quantum proxy blind signature. The eligible voter's voting information can be transmitted to the tallyman Bob with the help of the scrutineer Charlie. Charlie's supervision in the whole voting process can make the protocol satisfy fairness and un-repeatability so as to avoid Bob's dishonest behaviour. Our scheme uses the physical characteristics of quantum mechanics to achieve voting, counting and immediate supervision. In addition, the program also uses quantum key distribution protocol and quantum one-time pad to guarantee its unconditional security.
How the Pharmaceutical Benefits Scheme began.
Goddard, Martyn S
2014-07-07
Seventy years ago, the Curtin wartime government introduced legislation for a Pharmaceutical Benefits Scheme (PBS). It was a response to the need to provide access to a wave of antibiotic drugs - sulfonamides, streptomycin, penicillin - to the whole population, not only to the minority able to afford them. The scheme was immediately and successfully opposed by doctors and the conservative opposition, which saw in universal health care an underhand plan to nationalise medicine. There were two High Court challenges, two referendums and a constitutional amendment; but it was not until 1960 that Australians had the comprehensive PBS envisaged by Curtin in 1944.
A numerical relativity scheme for cosmological simulations
Daverio, David; Mitsou, Ermis
2016-01-01
Fully non-linear cosmological simulations may prove relevant in understanding relativistic/non-linear features and, therefore, in taking full advantage of the upcoming survey data. We propose a new 3+1 integration scheme which is based on the presence of a perfect fluid (hydro) field, evolves only physical states by construction and passes the robustness test on an FLRW space-time. Although we use General Relativity as an example, the idea behind that scheme is applicable to any generally-covariant modified gravity theory and/or matter content, including a N-body sector.
A compression tolerant scheme for image authentication
刘宝锋; 张文军; 余松煜
2004-01-01
Image authentication techniques used to protect the recipients against malicious forgery. In this paper, we propose a new image authentication technique based on digital signature. The authentication is verified by comparing the features of the each block in tested image with the corresponding features of the block recorded in the digital signature. The proposed authentication scheme is capable of distinguishing visible but non-malicious changes due to common processing operations from malicious changes. At last our experimental results show that the proposed scheme is not only efficient to protect integrity of image, but also with low computation,which are feasible for practical applications.
An Elaborate Secure Quantum Voting Scheme
Zhang, Jia-Lei; Xie, Shu-Cui; Zhang, Jian-Zhong
2017-10-01
An elaborate secure quantum voting scheme is presented in this paper. It is based on quantum proxy blind signature. The eligible voter's voting information can be transmitted to the tallyman Bob with the help of the scrutineer Charlie. Charlie's supervision in the whole voting process can make the protocol satisfy fairness and un-repeatability so as to avoid Bob's dishonest behaviour. Our scheme uses the physical characteristics of quantum mechanics to achieve voting, counting and immediate supervision. In addition, the program also uses quantum key distribution protocol and quantum one-time pad to guarantee its unconditional security.
Fixed Wordsize Implementation of Lifting Schemes
Karp, Tanja
2006-12-01
We present a reversible nonlinear discrete wavelet transform with predefined fixed wordsize based on lifting schemes. Restricting the dynamic range of the wavelet domain coefficients due to a fixed wordsize may result in overflow. We show how this overflow has to be handled in order to maintain reversibility of the transform. We also perform an analysis on how large a wordsize of the wavelet coefficients is needed to perform optimal lossless and lossy compressions of images. The scheme is advantageous to well-known integer-to-integer transforms since the wordsize of adders and multipliers can be predefined and does not increase steadily. This also results in significant gains in hardware implementations.
Group Buying Schemes : A Sustainable Business Model?
Köpp, Sebastian; Mukhachou, Aliaksei; Schwaninger, Markus
2013-01-01
Die Autoren gehen der Frage nach, ob "Group Buying Schemes" wie beispielsweise von den Unternehmen Groupon und Dein Deal angeboten, ein nachhaltiges Geschäftsmodell sind. Anhand der Fallstudie Groupon wird mit einem System Dynamics Modell festgestellt, dass das Geschäftsmodell geändert werden muss, wenn die Unternehmung auf Dauer lebensfähig sein soll. The authors examine if group buying schemes are a sustainable business model. By means of the Groupon case study and using a System Dynami...
Security problem on arbitrated quantum signature schemes
Choi, Jeong Woon; Chang, Ku-Young; Hong, Dowon
2011-12-01
Many arbitrated quantum signature schemes implemented with the help of a trusted third party have been developed up to now. In order to guarantee unconditional security, most of them take advantage of the optimal quantum one-time encryption based on Pauli operators. However, in this paper we point out that the previous schemes provide security only against a total break attack and show in fact that there exists an existential forgery attack that can validly modify the transmitted pair of message and signature. In addition, we also provide a simple method to recover security against the proposed attack.
Description of the TRT Readout Scheme
Luehring, F C
2002-01-01
This paper documents the TRT detector readout scheme. A description is provided of the data buffers used in the TRT readout chain: the single TRT channel output data format, the DTMROC output data buffer format, the TRT-ROD input FIFO data format, the TRT-ROD output buffer format, and the ROB output buffer data format. Also documented are the current designs for the TRT-ROD zero suppression and data compression schemes. A proposal is presented for ordering the data generated by individual TRT channels suitably for Level-2 triggering, Level-3 triggering and offline data processing.
Royon, Yvan
2007-01-01
In most modern operating systems, init (as in "initialization") is the program launched by the kernel at boot time. It runs as a daemon and typically has PID 1. Init is responsible for spawning all other processes and scavenging zombies. It is also responsible for reboot and shutdown operations. This document describes existing solutions that implement the init process and/or init scripts in Unix-like systems. These solutions range from the legacy and still-in-use BSD and SystemV schemes, to recent and promising schemes from Ubuntu, Apple, Sun and independent developers. Our goal is to highlight their focus and compare their sets of features.
EPU correction scheme study at the CLS
Bertwistle, Drew, E-mail: drew.bertwistle@lightsource.ca; Baribeau, C.; Dallin, L.; Chen, S.; Vogt, J.; Wurtz, W. [Canadian Light Source Inc. 44 Innovation Boulevard, Saskatoon, SK S7N 2V3 (Canada)
2016-07-27
The Canadian Light Source (CLS) Quantum Materials Spectroscopy Center (QMSC) beamline will employ a novel double period (55 mm, 180 mm) elliptically polarizing undulator (EPU) to produce photons of arbitrary polarization in the soft X-ray regime. The long period and high field of the 180 mm period EPU will have a strong dynamic focusing effect on the storage ring electron beam. We have considered two partial correction schemes, a 4 m long planar array of BESSY-II style current strips, and soft iron L-shims. In this paper we briefly consider the implementation of these correction schemes.
Cheater identifiable visual secret sharing scheme
Gan Zhi; Chen Kefei
2005-01-01
The visual secret sharing scheme proposed by Naor and Shamir provides a way to encrypt a secret black-white image into shares. A qualified group of participants can recover the secret message without using any cryptographic computation. But the original scheme can easily be corrupted by malicious participant. We propose an extension of VSS(visual secret sharing) to identify cheaters before the secret is recovered. Without the need for any additional information and cryptographic computation, every participant can verify the validity of shares of other participants, thus the security of VSS is enhanced.
The Construction of Association Schemes by Parameter Amendment
Yong-lin Zhang
2005-01-01
Association scheme is a structure on a finite set that has some special relations among elements in the set. These relations are usually hidden in other relations, so how to derive them out is a problem. The paper gives a constructing method of mending parameters of the association schemes, and a new family of association schemes is obtained: quasi-metric association scheme.
Proofs of Security for Improved Rabin Signature Scheme
DONG Xiao-lei; LU Rong-xing; CAO Zhen-fu
2006-01-01
The improved RSA signature scheme can be strictly proved to be equivalent to the factoring problem. In the improved RSA signature scheme, when the public exponent e= 1, the scheme becomes the improved Rabin signature. Such an improved Rabin signature scheme is reviewed and the techniques from the provable security is applied to analyze its security.
Secure Batch Verification Protocol for RSA Signature Scheme
JIAZongpu; LIQingchao; LIZichen
2005-01-01
Harn, in 1998, proposed an efficient batch verification scheme for multiple RSA digital signatures.However, the scheme has a weakness, that is a signer can generate multiple signatures which can pass the batch verification scheme, but every one of these multiple signatures is not a valid signature. To avoid this disadvantage, we propose an improved batch verification scheme.
AN EFFICIENT BIT COMMITMENT SCHEME BASED ON FACTORING ASSUMPTION
Zhong Ming; Yang Yixian
2001-01-01
Recently, many bit commitment schemes have been presented. This paper presents a new practical bit commitment scheme based on Schnorr's one-time knowledge proof scheme,where the use of cut-and-choose method and many random exam candidates in the protocols are replaced by a single challenge number. Therefore the proposed bit commitment scheme is more efficient and practical than the previous schemes In addition, the security of the proposed scheme under factoring assumption is proved, thus the cryptographic basis of the proposed scheme is clarified.
A conservative numerical scheme for solving an autonomous Hamiltonian system
Petrov, A. G.; Uvarov, A. V.
2016-09-01
A new numerical scheme is proposed for solving Hamilton's equations that possesses the properties of symplecticity. Just as in all symplectic schemes known to date, in this scheme the conservation laws of momentum and angular momentum are satisfied exactly. A property that distinguishes this scheme from known schemes is proved: in the new scheme, the energy conservation law is satisfied for a system of linear oscillators. The new numerical scheme is implicit and has the third order of accuracy with respect to the integration step. An algorithm is presented by which the accuracy of the scheme can be increased up to the fifth and higher orders. Exact and numerical solutions to the two-body problem, calculated by known schemes and by the scheme proposed here, are compared.
Storage System Design Scheme in Virtualization Construction
Si Zhen-yu
2012-01-01
In order to improve resource utilization, it is necessary to integrate storage and data, and the emergence of cloud computing makes it possible. This paper analyzed the study of virtualization and cloud computing, proposed a new scheme based on virtualization, and established a shared storage platform, which made a good complement and perfected the centralized storage platform.
Benefit Reentitlement Conditions in Unemployment Insurance Schemes
Andersen, Torben M.; Christoffersen, Mark Strøm; Svarer, Michael
Unemployment insurance schemes include conditions on past employment history as part of the eligibility conditions. This aspect is often neglected in the literature which primarily focuses on benefit levels and benefit duration. In a search-matching framework we show that benefit duration and emp...
Traffic calming schemes : opportunities and implementation strategies.
Schagen, I.N.L.G. van (ed.)
2003-01-01
Commissioned by the Swedish National Road Authority, this report aims to provide a concise overview of knowledge of and experiences with traffic calming schemes in urban areas, both on a technical level and on a policy level. Traffic calming refers to a combination of network planning and
Determinantal schemes and Buchsbaum-Rim sheaves
Kreuzer, M; Nagel, U; Peterson, C
1997-01-01
Let $\\phi$ be a generically surjective morphism between direct sums of line bundles on $\\proj{n}$ and assume that the degeneracy locus, $X$, of $\\phi$ has the expected codimension. We call $B_{\\phi} = \\ker \\phi$ a (first) Buchsbaum-Rim sheaf and we call $X$ a standard determinantal scheme. Viewing delete a generalized row from $\\phi$ and have the maximal minors of the resulting submatrix define a scheme of the expected codimension. In this paper we give several characterizations of good determinantal schemes. In particular, it is shown that being a good determinantal scheme of codimension $r+1$ is equivalent to being the zero-locus of a regular section of the dual of a first Buchsbaum-Rim sheaf of rank $r+1$. It is also equivalent to being standard determinantal and locally a complete intersection outside a subscheme $Y subscheme $X$ of codimension $r+1$ there is a good determinantal subscheme $S$ codimension $r$ such that $X$ sits in $S$ in a nice way. This leads to several generalizations of a theorem of Kr...
Harmonic generation with multiple wiggler schemes
Bonifacio, R.; De Salvo, L.; Pierini, P. [Universita degli Studi, Milano (Italy)
1995-02-01
In this paper the authors give a simple theoretical description of the basic physics of the single pass high gain free electron laser (FEL), describing in some detail the FEL bunching properties and the harmonic generation technique with a multiple-wiggler scheme or a high gain optical klystron configuration.
The EU Greenhouse Gas Emissions Trading Scheme
Woerdman, Edwin; Woerdman, Edwin; Roggenkamp, Martha; Holwerda, Marijn
2015-01-01
This chapter explains how greenhouse gas emissions trading works, provides the essentials of the Directive on the European Union Emissions Trading Scheme (EU ETS) and summarizes the main implementation problems of the EU ETS. In addition, a law and economics approach is used to discuss the dilemmas
On the Equivalence of Regularization Schemes
YANG Ji-Feng
2002-01-01
We illustrate via the sunset diagram that dimensional regularization ‘deforms' the nonlocal contentsof multi-loop diagrams with its equivalence to cutoff regularization scheme recovered only after sub-divergence wassubtracted. Then we employed a differential equation approach for calculating loop diagrams to verify that dimensionalare argued especially in nonperturbativc perspective.
The European Emissions Trading Scheme case law
van Zeben, J.A.W.
2009-01-01
Within European climate change and energy policy, the European Emissions Trading Scheme (EU ETS) occupies a prominent role. This article considers the developing case law of the European courts on the EU ETS. Specific attention is paid to the role of the different actors within the EU ETS and the im
High Order Semi-Lagrangian Advection Scheme
Malaga, Carlos; Mandujano, Francisco; Becerra, Julian
2014-11-01
In most fluid phenomena, advection plays an important roll. A numerical scheme capable of making quantitative predictions and simulations must compute correctly the advection terms appearing in the equations governing fluid flow. Here we present a high order forward semi-Lagrangian numerical scheme specifically tailored to compute material derivatives. The scheme relies on the geometrical interpretation of material derivatives to compute the time evolution of fields on grids that deform with the material fluid domain, an interpolating procedure of arbitrary order that preserves the moments of the interpolated distributions, and a nonlinear mapping strategy to perform interpolations between undeformed and deformed grids. Additionally, a discontinuity criterion was implemented to deal with discontinuous fields and shocks. Tests of pure advection, shock formation and nonlinear phenomena are presented to show performance and convergence of the scheme. The high computational cost is considerably reduced when implemented on massively parallel architectures found in graphic cards. The authors acknowledge funding from Fondo Sectorial CONACYT-SENER Grant Number 42536 (DGAJ-SPI-34-170412-217).
Jian-Wen Chen; Guo-Ping Li; Yun He
2006-01-01
Adaptive frame/field coding techniques have been adopted in many international video standards for interlaced sequence coding. When the frame/field adaptation is applied on the picture level, the coding efficiency is improved greatly,compared with the pure frame coding or the pure field coding. The picture-level adaptive frame/field coding (PAFF) selects frame coding or field coding once for one picture. If this frame/field adaptation is extended to Macro Block (MB) level, the coding efficiency will be further increased. In this paper, a novel MB-level adaptive frame/field (MBAFF) coding scheme is proposed. In the proposed MBAFF scheme, the top field of the current picture is used as a reference. The experiments are implemented on the platforms of Audio Video coding Standard (AVS) base profile and H.264/AVC, respectively. On the AVS platform, 0.35dB gain can be achieved averagely, compared with AVS1.0 anchor. On the H.264/AVC platform, 0.16dB gain can be achieved averagely, compared with MBAFF scheme of H.264/AVC. Additionally, an extensive subjective quality enhancement can be achieved by the proposed scheme.
Optimal design of funded pension schemes
Bovenberg, A.L.; Mehlkopf, R.J.
2014-01-01
This article reviews the literature on the optimal design and regulation of funded pension schemes. We first characterize optimal saving and investment over an individual’s life cycle. Within a stylized modeling framework, we explore optimal individual saving and investing behavior. Subsequently, va
Performance Evaluation of Modified Signcryption Scheme
Bharat Gupta
2012-12-01
Full Text Available Before a message is sent out, the sender of the message would sign it using a digital signature scheme and then encrypt the message (and the signature use a private key encryption algorithm under a randomly chosen message encryption key. The random message encryption key would then be encrypted using the recipient's public key. We call this process two-step approach: “signature-then-encryption”. Concept signcryption, first proposed by Zheng, is a cryptography primitive which combines both the functions of digital signature and public key encryption in a logical single step, and with a computational cost and communication overhead are significantly lower than that needed by traditional signature then encryption. In Zheng’s scheme, the signature verification can be done recipient’s private key at receiverend and its security are based on mainly Discrete Logarithm Problem (DLP, reversing one way hash function. In proposed modified signcryption scheme, security is based on the intractability of three hard problems: Discrete Logarithm Problem, reversing one way hash function and to determine prime factors of a composit number. Proposed signcryption scheme has all the benefits of signcryption and is also able to resolve the dispute / problem of non repudiation by independent third party, without compromising with sender and recipient’s private keys.
Two modified discrete chirp Fourier transform schemes
樊平毅; 夏香根
2001-01-01
This paper presents two modified discrete chirp Fourier transform (MDCFT) schemes.Some matched filter properties such as the optimal selection of the transform length, and its relationship to analog chirp-Fourier transform are studied. Compared to the DCFT proposed previously, theoretical and simulation results have shown that the two MDCFTs can further improve the chirp rate resolution of the detected signals.
GVD compensation schemes with considering PMD
Aiying Yang(杨爱英); Anshi Xu(徐安士); Deming Wu(吴德明)
2003-01-01
Three group velocity dispersion (GVD) compensation schemes, i.e., the post-compensation, pre-compensation and hybrid-compensation schemes, are discussed with considering polarization mode disper-sion (PMD). In the 10- and 40-Gbit/s non-return-zero (NRZ) on-off-key (OOK) systems, three physicalfactors, Kerr effect, GVD and PMD are considered. The numerical results show that, when the impactof PMD is taken into account, the GVD pre-compensation scheme performs best with more than 1 dBbetter of average eye-opening penalty (EOP) when input power is up to 10 dBm in the 10-Gbit/s system.However the GVD post-compensation scheme perforns best for the case of 40 Gbit/s with input power lessthan 13 dBm, and GVD pre-compensation will be better if the input power increased beyond this range.The results are different from those already reported under the assumption that the impact of PMD isneglected. Therefore, the research in this paper provide a different insight into the system optimizationwhen PMD, Kerr effect and GVD are considered.
Labeling schemes for bounded degree graphs
Adjiashvili, David; Rotbart, Noy Galil
2014-01-01
graphs. Our results complement a similar bound recently obtained for bounded depth trees [Fraigniaud and Korman, SODA 2010], and may provide new insights for closing the long standing gap for adjacency in trees [Alstrup and Rauhe, FOCS 2002]. We also provide improved labeling schemes for bounded degree...
A New Dynamic Group Signature Scheme
HE Yefeng
2006-01-01
In this paper, a new dynamic group signature scheme is proposed. It allows the group manager to increase or delete group members flexibly. Furthermore, the length of group signatures, as well as the computational effort for signing, verifying and opening are very small and independent of the number of group members and deleted group members. So it is efficient.
The EU Greenhouse Gas Emissions Trading Scheme
Woerdman, Edwin; Woerdman, Edwin; Roggenkamp, Martha; Holwerda, Marijn
2015-01-01
This chapter explains how greenhouse gas emissions trading works, provides the essentials of the Directive on the European Union Emissions Trading Scheme (EU ETS) and summarizes the main implementation problems of the EU ETS. In addition, a law and economics approach is used to discuss the dilemmas
An Optimal Labeling Scheme for Ancestry Queries
Fraigniaud, Pierre
2009-01-01
An ancestry labeling scheme assigns labels (bit strings) to the nodes of rooted trees such that ancestry queries between any two nodes in a tree can be answered merely by looking at their corresponding labels. The quality of an ancestry labeling scheme is measured by its label size, that is the maximal number of bits in a label of a tree node. In addition to its theoretical appeal, the design of efficient ancestry labeling schemes is motivated by applications in web search engines. For this purpose, even small improvements in the label size are important. In fact, the literature about this topic is interested in the exact label size rather than just its order of magnitude. As a result, following the proposal of a simple interval-based ancestry scheme with label size $2\\log_2 n$ bits (Kannan et al., STOC '88), a considerable amount of work was devoted to improve the bound on the size of a label. The current state of the art upper bound is $\\log_2 n + O(\\sqrt{\\log n})$ bits (Abiteboul et al., SODA '02) which is...
姚斗春
2015-01-01
In order to prevent the losses caused by production equipment downtime,uninterruptible power supply is used in industrial production. During charging,the main issue is super capacitor charging control technology. In order to solve the problem that the equivalent resistance of super capacity of uninterruptible power supply affects the charging efficiency ,buck charging circuit is designed in this paper. The relationship between input and output voltages under different circumstances is derived. The circuit and charging model is established. Finally the quantitative comparison control mode was verified. The simulation based on the model is established in Proteus and the charging current curve is observed through analogue chart , which verified the advantages of quantitative comparison control mode in the charging speed and efficiency .%为解决不间断电源超级电容等效内阻随SOC变化而影响充电效率的问题，文中采用BUCK型充电电路，针对该电路推导出不同情况下输入输出电压关系，在此基础上建立充电电路模型和充电数学模型。提出定值比较控制模式，根据建立的模型，在Proteus中建立仿真模型，通过ANALOGUE图表观察充电电流曲线，验证了定量比较控制模式的在充电速度以及效率上的明显优势。
Interlaboratory comparison schemes for fibre counting: AFRICA and the WHO/EURO reference scheme
Brown, P.W.; Jones, A.D. [Institute of Occupational Medicine, Edinburgh (United Kingdom)
2001-03-01
Airborne fibres, particularly asbestos, can present serious risks to human health, therefore laboratories need to produce reliable measurements of their concentrations. To help achieve this, they participate in interlaboratory comparisons, in the form of national or international proficiency testing schemes for fibre counting. Two of the international schemes are the Asbestos Fibre Regular Informal Counting Arrangement (AFRICA), for asbestos fibres, and the WHO/EURO Reference Scheme, for man-made mineral fibres. Both schemes have operated since the 1980s, offering several benefits to participants. The schemes employ a method similar in principle to that of other proficiency testing programmes. Participants are rated 1 to 3 depending on how close their results are to pre-defined reference values. The majority of laboratories perform well; and in each round an average of only 3% of WHO/EURO scheme participants and 8% of AFRICA participants were rated 3 (unsatisfactory). There is also evidence that new members improve after they join the schemes. (orig.)
A Certificate Revocable Anonymous Authentication Scheme with Designated Verifier
Emura, Keita; Miyaji, Atsuko; Omote, Kazumasa
2009-01-01
In IEEE ISI 2008, an anonymous attribute authentication scheme has been proposed using a self-blindable certificate scheme. This scheme enables the anonymity and certificate revocation. A Certificate Revocation List (CRL) is used in the revocation check. Even if an attacker can obtain a CRL, the attacker cannot execute the revocation check. This means that this scheme enables the designated revocation. However, this scheme is not secure, namely, a user can make a forged proof using a public v...
Arbitrated quantum signature scheme based on reusable key
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.
Arbitrated quantum signature scheme based on reusable key
YU ChaoHua; GUO GongDe; LIN Song
2014-01-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.
Simple Numerical Schemes for the Korteweg-deVries Equation
C. J. McKinstrie; M. V. Kozlov
2000-12-01
Two numerical schemes, which simulate the propagation of dispersive non-linear waves, are described. The first is a split-step Fourier scheme for the Korteweg-de Vries (KdV) equation. The second is a finite-difference scheme for the modified KdV equation. The stability and accuracy of both schemes are discussed. These simple schemes can be used to study a wide variety of physical processes that involve dispersive nonlinear waves.
Uplink Access Schemes for LTE-Advanced
Liu, Le; Inoue, Takamichi; Koyanagi, Kenji; Kakura, Yoshikazu
The 3GPP LTE-Advanced has been attracting much attention recently, where the channel bandwidth would be beyond the maximum bandwidth of LTE, 20MHz. In LTE, single carrier-frequency division multiple access (SC-FDMA) was accepted as the uplink access scheme due to its advantage of very low cubic metric (CM). For LTE-A wideband transmission, multicarrier access would be more effective than single carrier access to make use of multi-user diversity and can maintain the physical channel structure of LTE, where the control information is transmitted on the edges of each 20MHz. In this paper, we discuss the access schemes in bandwidth under 20MHz as well as over 20MHz. In the case of bandwidth under 20MHz, we propose the access schemes allowing discontinuous resource allocation to enhance average throughput while maintaining cell-edge user throughput, that is, DFT-spread-OFDM with spectrum division control (SDC) and adaptive selection of SC-FDMA and OFDM (SC+OFDM). The number of discontinuous spectrums is denoted as spectrum division (SD). For DFT-S-OFDM, we define a parameter max SD as the upper limit of SD. We evaluate our proposed schemes in bandwidth under 20MHz and find that SC+OFDM as well as SDC with common max SD or UE-specific max SD can improve average throughput while their cell-edge user throughput can approach that of SC-FDMA. In the case of bandwidth over 20MHz, we consider key factors to decide a feasible access scheme for aggregating several 20MHz-wide bands.
A classification scheme for risk assessment methods.
Stamp, Jason Edwin; Campbell, Philip LaRoche
2004-08-01
This report presents a classification scheme for risk assessment methods. This scheme, like all classification schemes, provides meaning by imposing a structure that identifies relationships. Our scheme is based on two orthogonal aspects--level of detail, and approach. The resulting structure is shown in Table 1 and is explained in the body of the report. Each cell in the Table represent a different arrangement of strengths and weaknesses. Those arrangements shift gradually as one moves through the table, each cell optimal for a particular situation. The intention of this report is to enable informed use of the methods so that a method chosen is optimal for a situation given. This report imposes structure on the set of risk assessment methods in order to reveal their relationships and thus optimize their usage.We present a two-dimensional structure in the form of a matrix, using three abstraction levels for the rows and three approaches for the columns. For each of the nine cells in the matrix we identify the method type by name and example. The matrix helps the user understand: (1) what to expect from a given method, (2) how it relates to other methods, and (3) how best to use it. Each cell in the matrix represent a different arrangement of strengths and weaknesses. Those arrangements shift gradually as one moves through the table, each cell optimal for a particular situation. The intention of this report is to enable informed use of the methods so that a method chosen is optimal for a situation given. The matrix, with type names in the cells, is introduced in Table 2 on page 13 below. Unless otherwise stated we use the word 'method' in this report to refer to a 'risk assessment method', though often times we use the full phrase. The use of the terms 'risk assessment' and 'risk management' are close enough that we do not attempt to distinguish them in this report. The remainder of this report is organized as follows. In
Scheme for Quantum Computing Immune to Decoherence
Williams, Colin; Vatan, Farrokh
2008-01-01
A constructive scheme has been devised to enable mapping of any quantum computation into a spintronic circuit in which the computation is encoded in a basis that is, in principle, immune to quantum decoherence. The scheme is implemented by an algorithm that utilizes multiple physical spins to encode each logical bit in such a way that collective errors affecting all the physical spins do not disturb the logical bit. The scheme is expected to be of use to experimenters working on spintronic implementations of quantum logic. Spintronic computing devices use quantum-mechanical spins (typically, electron spins) to encode logical bits. Bits thus encoded (denoted qubits) are potentially susceptible to errors caused by noise and decoherence. The traditional model of quantum computation is based partly on the assumption that each qubit is implemented by use of a single two-state quantum system, such as an electron or other spin-1.2 particle. It can be surprisingly difficult to achieve certain gate operations . most notably, those of arbitrary 1-qubit gates . in spintronic hardware according to this model. However, ironically, certain 2-qubit interactions (in particular, spin-spin exchange interactions) can be achieved relatively easily in spintronic hardware. Therefore, it would be fortunate if it were possible to implement any 1-qubit gate by use of a spin-spin exchange interaction. While such a direct representation is not possible, it is possible to achieve an arbitrary 1-qubit gate indirectly by means of a sequence of four spin-spin exchange interactions, which could be implemented by use of four exchange gates. Accordingly, the present scheme provides for mapping any 1-qubit gate in the logical basis into an equivalent sequence of at most four spin-spin exchange interactions in the physical (encoded) basis. The complexity of the mathematical derivation of the scheme from basic quantum principles precludes a description within this article; it must suffice to report
Secure Order-Specified Multisignature Scheme Based on DSA
YANG Muxiang; SU Li; LI Jun; HONG Fan
2006-01-01
In multisignature schemes signers can sign either in a linear order or not in any specified order, but neither of them is adequate in some scenarios where require mixture using of orderless and ordered multisignature. Most order-specified multisignatures specified the orders as linear ones. In this paper, we proposed an order-specified multisignature scheme based on DSA secure against active insider attack. To our knowledge, it is the first order-specified multisignature scheme based on DSA signature scheme, in which signers can sign in flexible order represented by series-parallel graphs. In the multisignature scheme verification to both signers and signing order are available. The security of the scheme is proved by reduce to an identification scheme that is proved have some concrete security. The running time of verifying a signature is comparable to previous schemes while the running time of multisignature generation and the space needed is less than those schemes.
Improvement of Mixing Function for Modified Upwinding Compact Scheme
Fu, Huankun; Liu, Chaoqun
2014-01-01
The compact scheme has high order accuracy and high resolution, but cannot be used to capture the shock. WENO is a great scheme for shock capturing, but is too dissipative for turbulence and small length scales. We developed a modified upwinding compact scheme which uses an effective shock detector to block compact scheme to cross the shock and a control function to mix the flux with WENO scheme near the shock. The new scheme makes the original compact scheme able to capture the shock sharply and, more important, keep high order accuracy and high resolution in the smooth area, which is particularly important for shock boundary layer and shock acoustic interactions. This work is a continuation to modify the control function for the modified up-winding compact scheme (MUCS). Numerical results show the scheme is successful for 2-D Euler.
PERTURBATIONAL FINITE DIFFERENCE SCHEME OF CONVECTION-DIFFUSION EQUATION
无
2002-01-01
The Perturbational Finite Difference (PFD) method is a kind of high-order-accurate compact difference method, But its idea is different from the normal compact method and the multi-nodes method. This method can get a Perturbational Exact Numerical Solution (PENS) scheme for locally linearlized Convection-Diffusion (CD) equation. The PENS scheme is similar to the Finite Analytical (FA) scheme and Exact Difference Solution (EDS) scheme, which are all exponential schemes, but PENS scheme is simpler and uses only 3, 5 and 7 nodes for 1-, 2- and 3-dimensional problems, respectively. The various approximate schemes of PENS scheme are also called Perturbational-High-order-accurate Difference (PHD) scheme. The PHD schemes can be got by expanding the exponential terms in the PENS scheme into power series of grid Renold number, and they are all upwind schemes and remain the concise structure form of first-order upwind scheme. For 1-dimensional (1-D) CD equation and 2-D incompressible Navier-Stokes equation, their PENS and PHD schemes were constituted in this paper, they all gave highly accurate results for the numerical examples of three 1-D CD equations and an incompressible 2-D flow in a square cavity.
Navaro Pierre
2011-11-01
Full Text Available A new scheme for discretizing the P1 model on unstructured polygonal meshes is proposed. This scheme is designed such that its limit in the diffusion regime is the MPFA-O scheme which is proved to be a consistent variant of the Breil-Maire diffusion scheme. Numerical tests compare this scheme with a derived GLACE scheme for the P1 system. Un nouveau schéma de discrétisation du modèle P1 sur maillage non structuré composé de polygones est proposé. Ce schéma est construit pour que sa limite en régime diffusion soit le schéma MPFA-O qu’on démontre être une variante consistante du schéma de diffusion de Breil-Maire. Ce schéma est comparé sur des cas tests avec un schéma dérivé du schéma GLACE pour le modèle P1.
OPERATIONAL MODAL ANALYSIS SCHEMES USING CORRELATION TECHNIQUE
Zheng Min; Shen Fan; Chen Huaihai
2005-01-01
For some large-scale engineering structures in operating conditions, modal parameters estimation must base itself on response-only data. This problem has received a considerable amount of attention in the past few years. It is well known that the cross-correlation function between the measured responses is a sum of complex exponential functions of the same form as the impulse response function of the original system. So this paper presents a time-domain operating modal identification global scheme and a frequency-domain scheme from output-only by coupling the cross-correlation function with conventional modal parameter estimation. The outlined techniques are applied to an airplane model to estimate modal parameters from response-only data.
Fixed Wordsize Implementation of Lifting Schemes
Tanja Karp
2007-01-01
Full Text Available We present a reversible nonlinear discrete wavelet transform with predefined fixed wordsize based on lifting schemes. Restricting the dynamic range of the wavelet domain coefficients due to a fixed wordsize may result in overflow. We show how this overflow has to be handled in order to maintain reversibility of the transform. We also perform an analysis on how large a wordsize of the wavelet coefficients is needed to perform optimal lossless and lossy compressions of images. The scheme is advantageous to well-known integer-to-integer transforms since the wordsize of adders and multipliers can be predefined and does not increase steadily. This also results in significant gains in hardware implementations.
CUP-syndrome diagnostic procedure scheme.
Pujanek, Zuzanna; Burduk, Paweł K
2013-01-01
Patients with CUP-Syndrome represent a small percentage of patients treated by ENT doctor. Often, in spite of the implementation detailed diagnostics, detection of the primary tumor fails. Very important element is to follow the correct sequence of tests and taking into account conditions outside ENT. I our article, we would like to propose a diagnostic scheme including interview with patient, laryngological and imaging tests and multi-disciplinary consulting. We hope that this scheme will facilitate the treatment of patients with CUP-Syndrome and increase the efficiency of detection of primary tumor. Copyright © 2013 Polish Otorhinolaryngology - Head and Neck Surgery Society. Published by Elsevier Urban & Partner Sp. z.o.o. All rights reserved.
Evaluating Parsing Schemes with Entropy Indicators
Lyon, C; Lyon, Caroline; Brown, Stephen
1997-01-01
This paper introduces an objective metric for evaluating a parsing scheme. It is based on Shannon's original work with letter sequences, which can be extended to part-of-speech tag sequences. It is shown that this regular language is an inadequate model for natural language, but a representation is used that models language slightly higher in the Chomsky hierarchy. We show how the entropy of parsed and unparsed sentences can be measured. If the entropy of the parsed sentence is lower, this indicates that some of the structure of the language has been captured. We apply this entropy indicator to support one particular parsing scheme that effects a top down segmentation. This approach could be used to decompose the parsing task into computationally more tractable subtasks. It also lends itself to the extraction of predicate/argument structure.
Approximate particle spectra in the pyramid scheme
Banks, Tom; Torres, T. J.
2012-12-01
We construct a minimal model inspired by the general class of pyramid schemes [T. Banks and J.-F. Fortin, J. High Energy Phys. 07 (2009) 046JHEPFG1029-8479], which is consistent with both supersymmetry breaking and electroweak symmetry breaking. In order to do computations, we make unjustified approximations to the low energy Kähler potential. The phenomenological viability of the resultant mass spectrum is then examined and compared with current collider limits. We show that for certain regimes of parameters, the model, and thus generically the pyramid scheme, can accommodate the current collider mass constraints on physics beyond the standard model with a tree-level light Higgs mass near 125 GeV. However, in this regime the model exhibits a little hierarchy problem, and one must permit fine-tunings that are of order 5%.
INTERLEAVING SCHEME FOR MULTICARRIER CDMA SYSTEM
Shi Feng; Cheng Shixin
2004-01-01
In MultiCarrier Code-Division Multiple-Access (MC-CDMA) system, the received signals scattered in the frequency domain are combined to get frequency diversity gain. However, the frequency diversity gain is limited because of correlation between subcarriers. A novel interleaving scheme for MC-CDMA system is proposed in this paper. A circular shifting register is introduced into each subcarrier branch to decrease the correlation between subcarriers. By using interleaving, frequency diversity gain of system is increased. System structure and model with interleaver are discussed. In the case of multiple users, Parallel Interference Cancellation (PIC) technique is also introduced. Computer simulations demonstrate the performance of proposed scheme, and the performance comparison of MC-CDMA with interleaver and conventional MC-CDMA system is shown as well.
Integrating Standard Dependency Schemes in QCSP Solvers
Ji-Wei Jin; Fei-Fei Ma; Jian Zhang
2012-01-01
Quantified constraint satisfaction problems (QCSPs) are an extension to constraint satisfaction problems (CSPs) with both universal quantifiers and existential quantifiers.In this paper we apply variable ordering heuristics and integrate standard dependency schemes in QCSP solvers.The technique can help to decide the next variable to be assigned in QCSP solving.We also introduce a new factor into the variable ordering heuristics:a variable's dep is the number of variables depending on it.This factor represents the probability of getting more candidates for the next variable to be assigned.Experimental results show that variable ordering heuristics with standard dependency schemes and the new factor dep can improve the performance of QCSP solvers.
Cartesian Grid Method for Gas Kinetic Scheme
Chen, Songze; Li, Zhihui
2015-01-01
A Cartesian grid method combined with a simplified gas kinetic scheme is presented for subsonic and supersonic viscous flow simulation on complex geometries. Under the Cartesian mesh, the computational grid points are classified into four different categories, the fluid point, the solid point, the drop point, and the interpolation point. The boundaries are represented by a set of direction-oriented boundary points. A constrained weighted least square method is employed to evaluate the physical quantities at the interpolation points. Different boundary conditions, including isothermal boundary, adiabatic boundary, and Euler slip boundary, are presented by different interpolation strategies. We also propose a simplified gas kinetic scheme as the flux solver for both subsonic and supersonic flow computations. The methodology of constructing a simplified kinetic flux function can be extended to other flow systems. A few numerical examples are used to validate the Cartesian grid method and the simplified flux func...
Iterated upwind schemes for gas dynamics
Smolarkiewicz, Piotr K.; Szmelter, Joanna
2009-01-01
A class of high-resolution schemes established in integration of anelastic equations is extended to fully compressible flows, and documented for unsteady (and steady) problems through a span of Mach numbers from zero to supersonic. The schemes stem from iterated upwind technology of the multidimensional positive definite advection transport algorithm (MPDATA). The derived algorithms employ standard and modified forms of the equations of gas dynamics for conservation of mass, momentum and either total or internal energy as well as potential temperature. Numerical examples from elementary wave propagation, through computational aerodynamics benchmarks, to atmospheric small- and large-amplitude acoustics with intricate wave-flow interactions verify the approach for both structured and unstructured meshes, and demonstrate its flexibility and robustness.
Employee Share Option Scheme And Employees’ Motivation
Rebecca Yew Ming Yian
2011-06-01
Full Text Available Employee stock options scheme (ESOS is a call option on the ordinary share of a company, issued as a form of non-cash compensation or as an incentive tool. ESOS gives an employee the right to buy shares at a fixed price for a defined number of years into the future. The trend toward broad-based share options may come to an end as companies are scaling back due to the changes in accounting standards. Similarly, companies in Malaysia, especially in the banking industry which originally offered share options to their employees are now pulling back this scheme. Does the movement to scale back share options affect employees’ motivation? This is an empirical question which this paper intends to explore. It is hope that the commercial banks will reconsider offering ESOS in rewarding their employees if the research finding indicates that it plays a significant role in motivating employees.
Exclusion from the Health Insurance Scheme
2003-01-01
A CERN pensioner, member of the Organization's Health Insurance Scheme (CHIS), recently provided fake documents in support of claims for medical expenses, in order to receive unjustified reimbursement from the CHIS. The Administrator of the CHIS, UNIQA, suspected a case of fraud: Accordingly, an investigation and interview of the person concerned was carried out and brought the Organization to the conclusion that fraud had actually taken place. Consequently and in accordance with Article VIII 3.12 of the CHIS Rules, it was decided to exclude this member permanently from the CHIS. The Organization takes the opportunity to remind Scheme members that any fraud or attempt to fraud established within the framework of the CHIS exposes them to: - disciplinary action, according to the Staff Rules and Regulations, for CERN members of the personnel; - definitive exclusion from the CHIS for members affiliated on a voluntary basis. Human Resources Division Tel. 73635
Optimization of Train Trip Package Operation Scheme
Lu Tong
2015-01-01
Full Text Available Train trip package transportation is an advanced form of railway freight transportation, realized by a specialized train which has fixed stations, fixed time, and fixed path. Train trip package transportation has lots of advantages, such as large volume, long distance, high speed, simple forms of organization, and high margin, so it has become the main way of railway freight transportation. This paper firstly analyzes the related factors of train trip package transportation from its organizational forms and characteristics. Then an optimization model for train trip package transportation is established to provide optimum operation schemes. The proposed model is solved by the genetic algorithm. At last, the paper tests the model on the basis of the data of 8 regions. The results show that the proposed method is feasible for solving operation scheme issues of train trip package.
Verifiable threshold signature schemes against conspiracy attack
甘元驹
2004-01-01
In this study, the author has designed new verifiable (t, n) threshold untraceable signature schemes. The proposed schemes have the following properties: ( 1 ) Verification: The shadows of the secret distributed by the trusted center can be verified by all of the participants; (2) Security: Even if the number of the dishonest member is over the value of the threshold, they cannot get the system secret parameters , such as the group secret key, and forge other member's individual signature; (3) Efficient verification: The verifier can verify the group signature easily and the verification time of the group signature is equivalent to that of an individual signature; (4) Untraceability: The signers of the group signature cannot be traced.
Verifiable threshold signature schemes against conspiracy attack
GAN Yuan-ju(甘元驹)
2004-01-01
In this study, the author has designed new verifiable (t,n) threshold untraceable signature schemes. The proposed schemes have the following properties:(1) Verification: The shadows of the secret distributed by the trusted center can be verified by all of the participants;(2) Security: Even if the number of the dishonest member is over the value of the threshold, they cannot get the system secret parameters ,such as the group secret key, and forge other member's individual signature;(3) Efficient verification: The verifier can verify the group signature easily and the verification time of the group signature is equivalent to that of an individual signature; (4) Untraceability: The signers of the group signature cannot be traced.
Efficient Scheme for Chemical Flooding Simulation
Braconnier Benjamin
2014-07-01
Full Text Available In this paper, we investigate an efficient implicit scheme for the numerical simulation of chemical enhanced oil recovery technique for oil fields. For the sake of brevity, we only focus on flows with polymer to describe the physical and numerical models. In this framework, we consider a black oil model upgraded with the polymer modeling. We assume the polymer only transported in the water phase or adsorbed on the rock following a Langmuir isotherm. The polymer reduces the water phase mobility which can change drastically the behavior of water oil interfaces. Then, we propose a fractional step technique to resolve implicitly the system. The first step is devoted to the resolution of the black oil subsystem and the second to the polymer mass conservation. In such a way, jacobian matrices coming from the implicit formulation have a moderate size and preserve solvers efficiency. Nevertheless, the coupling between the black-oil subsystem and the polymer is not fully resolved. For efficiency and accuracy comparison, we propose an explicit scheme for the polymer for which large time step is prohibited due to its CFL (Courant-Friedrichs-Levy criterion and consequently approximates accurately the coupling. Numerical experiments with polymer are simulated : a core flood, a 5-spot reservoir with surfactant and ions and a 3D real case. Comparisons are performed between the polymer explicit and implicit scheme. They prove that our polymer implicit scheme is efficient, robust and resolves accurately the coupling physics. The development and the simulations have been performed with the software PumaFlow [PumaFlow (2013 Reference manual, release V600, Beicip Franlab].
Finite volume schemes for Boussinesq type equations
2011-01-01
6 pages, 2 figures, 18 references. Published in proceedings of Colloque EDP-Normandie held at Caen (France), on 28 & 29 October 2010. Other author papers can be dowloaded at http://www.lama.univ-savoie.fr/~dutykh/; Finite volume schemes are commonly used to construct approximate solutions to conservation laws. In this study we extend the framework of the finite volume methods to dispersive water wave models, in particular to Boussinesq type systems. We focus mainly on the application of the m...
Mapped tent pitching schemes for hyperbolic systems
Gopalakrishnan, J; Schöberl, J.; Wintersteiger, C.
2016-01-01
A spacetime domain can be progressively meshed by tent shaped objects. Numerical methods for solving hyperbolic systems using such tent meshes to advance in time have been proposed previously. Such schemes have the ability to advance in time by different amounts at different spatial locations. This paper explores a technique by which standard discretizations, including explicit time stepping, can be used within tent-shaped spacetime domains. The technique transforms the equations within a spa...
Communication Scheme via Cascade Chaotic Systems
HUA Chang-Chun; GUAN Xin-Ping
2004-01-01
@@ A new chaotic communication scheme is constructed. Different from the existing literature, cascade chaotic systems are employed. Two cascade modes are considered. First, we investigate the input to state cascade mode;cascade systems between different kinds of chaotic systems are considered. Then the parameter cascade case of chaotic system is studied. Under the different cases, the corresponding receivers are designed, which can succeed in recovering the former emitted signal. Simulations are performed to verify the validity of the proposed main results.
Finite volume schemes for Boussinesq type equations
Dutykh, Denys; Mitsotakis, Dimitrios
2011-01-01
Finite volume schemes are commonly used to construct approximate solutions to conservation laws. In this study we extend the framework of the finite volume methods to dispersive water wave models, in particular to Boussinesq type systems. We focus mainly on the application of the method to bidirectional nonlinear, dispersive wave propagation in one space dimension. Special emphasis is given to important nonlinear phenomena such as solitary waves interactions.
Traditional and Truncation schemes for Different Multiplier
Yogesh M. Motey
2013-03-01
Full Text Available A rapid and proficient in power requirement multiplier is always vital in electronics industry like DSP, image processing and ALU in microprocessors. Multiplier is such an imperative block w ith respect to power consumption and area occupied in the system. In order to meet the demand for high speed, various parallel array multiplication algorithms have been proposed by a number of authors. The array multipliers use a large amount of hardware, consequently consuming a large amount of power. One of the methods for multiplication is based on Indian Vedic mathematics. The total Vedic mathematics is based on sixteen sutras (word formulae and manifests a merged structure of mathematics. The parallel multipliers for example radix 2 and radix 4 booth multiplier does the computations using less number of adders and less number of iterative steps that results in, they occupy less space to that of serial multiplier. Truncated multipliers offer noteworthy enhancements in area, delay, and power. Truncated multiplication provides different method for reducing the power dissipation and area of rounded parallel multipliers in DSP systems. Since in a truncated multiplier the x less significant bits of the full-width product are discarded thus partial products are removed and replaced by a suit- able compensation equations, match the accuracy with hardware cost. A pseudo-carry compensation truncation (PCT scheme, it is for the multiplexer based array multiplier, which yields less average error among existing truncation methods.After studying many research papers it’s found that some of the schemes for multiplier are suitable because their own uniqueness of multiplication. Such schemes are listed in this paper for example the different truncation schemes like constant-correction truncation (CCT, variable -correction truncation (VCT, pseudo-carry compensation truncation (PCT are most suitable for truncated multiplier.
A Note on Threshold Schemes with Disenrollment
2003-01-01
Lecture Notes in Computer Science 2384, pp. 71- 88, 2002. [2] G. R. Blakley, “Safeguarding cryptographic keys,” Proc. AFIPS 1979 National Computer...CRYPTO’92, E. F. Brickell, ed., Lecture Notes in Computer Science vol. 740, pp. 540-548, 1993. [4] C. Blundo, A. Cresti, A. De Santis, U. Vaccaro...Fully dynamic secret sharing schemes,” Advances in Cryptology – CRYPTO ’93, D. R. Stinson, ed., Lecture Notes in Computer Science
Efficient Identity Based Public Verifiable Signcryption Scheme
Kushwah, Prashant; Lal, Sunder
2011-01-01
Signcryption is a cryptographic primitive which performs encryption and signature in a single logical step. In conventional signcryption only receiver of the signcrypted text can verify the authenticity of the origin i.e. signature of the sender on the message after decrypting the cipher text. In public verifiable signcryption scheme anyone can verify the authenticity of the origin who can access the signcrypted text i.e. signature of the sender on the cipher text. Public verifiable signcrypt...
New Financing Schemes of Public Infrastructure
Ignacio de la Riva
2017-01-01
Public works procurements and concessions are traditional legal techniques used to shape the financing of public infrastructure. Fiscal constraints faced by public administrations at the end of the 20th century, and the subsequent increase of private participation in the provision of public goods and services, encouraged the development of new legal schemes allowing a higher degree of private investment in public infrastructure; such as Public Private Partnerships, project finance, securitiza...
A Scheme of Controlled Quantum State Swapping
查新未; 邹志纯; 祁建霞; 朱海洋
2012-01-01
A scheme for controlled quantum state swapping is presented using maximally entangled five-qubit state, i.e., Alice wants to transmit an entangled state of particle a to Bob and at the same time Bob wants to transmit an entangled state of particle b to Alice via the control of the supervisor Charlie. The operations used in this swapping process including C-not operation and a series of single-qubit measurements performed by Alice. Bob. and Charlie.
Droop Scheme With Consideration of Operating Costs
Nutkani, I. U.; Loh, Poh Chiang; Blaabjerg, Frede
2014-01-01
considered even though they are different for different types of DGs. This letter thus proposes an alternative droop scheme, which can better distinguish the different operating characteristics and objectives of the DGs grouped together in a weighted droop expression. The power sharing arrived in the steady...... state will meet the intended objectives, as demonstrated in the experiment with a defined objective of minimizing the total microgrid operating cost....
Log-scaling magnitude modulated watermarking scheme
LING HeFei; YUAN WuGang; ZOU FuHao; LU ZhengDing
2007-01-01
A real-time watermarking scheme with high robustness and security has been proposed based on modulating the log-scaling magnitudes of DCT coefficients,which is most suitable for JPEG images and MPEG streams. The watermark bit is encoded as the sign of the difference between the individual log-scaling magnitude of a group-region and the average one of all group-regions. The log-scaling magnitude can be modulated by modifying the low and middle frequency DCT coefficients imperceptibly. The robustness of scheme is not only dependent on those largest coefficients, but also on the other coefficients with the same proportion. It can embed 512 bits into an image with a size of 512×512, which can satisfy the payload requirement of most video watermarking applications. Moreover, the watermark embedding process only requires one-sixth of the time consumed during normal playing of video, and the watermark detection only requires one-twelfth of that, which can meet the real-time requirements of most video watermarking applications. Furthermore, the experimental results show that the presented scheme is transparent and robust to significant valumetric distortions (including additive noise, low-pass filtering, lossy compression and valumetric scaling) and a part of geometric distortions. It performs much better than the EMW algorithm in resisting all kinds of distortions except Gaussian noise with a larger deviation.
A hybrid scheme for encryption and watermarking
Xu, Xiaowei; Dexter, Scott D.; Eskicioglu, Ahmet M.
2004-06-01
Encryption and watermarking are complementary lines of defense in protecting multimedia content. Recent watermarking techniques have therefore been developed independent from encryption techniques. In this paper, we present a hybrid image protection scheme to establish a relation between the data encryption key and the watermark. Prepositioned secret sharing allows the reconstruction of different encryption keys by communicating different activating shares for the same prepositioned information. Each activating share is used by the receivers to generate a fresh content decryption key. In the proposed scheme, the activating share is used to carry copyright or usage rights data. The bit stream that represents this data is also embedded in the content as a visual watermark. When the encryption key needs to change, the data source generates a new activating share, and embeds the corresponding watermark into the multimedia stream. Before transmission, the composite stream is encrypted with the key constructed from the new activating share. Each receiver can decrypt the stream after reconstructing the same key, and extract the watermark from the image. Our presentation will include the application of the scheme to a test image, and a discussion on the data hiding capacity, watermark transparency, and robustness to common attacks.
Generalized support varieties for finite group schemes
Friedlander, Eric M
2011-01-01
We construct two families of refinements of the (projectivized) support variety of a finite dimensional module $M$ for a finite group scheme $G$. For an arbitrary finite group scheme, we associate a family of {\\it non maximal rank varieties} $\\Gamma^j(G)_M$, $1\\leq j \\leq p-1$, to a $kG$-module $M$. For $G$ infinitesimal, we construct a finer family of locally closed subvarieties $V^{\\ul a}(G)_M$ of the variety of one parameter subgroups of $G$ for any partition $\\ul a$ of $\\dim M$. For an arbitrary finite group scheme $G$, a $kG$-module $M$ of constant rank, and a cohomology class $\\zeta$ in $\\HHH^1(G,M)$ we introduce the {\\it zero locus} $Z(\\zeta) \\subset \\Pi(G)$. We show that $Z(\\zeta)$ is a closed subvariety, and relate it to the non-maximal rank varieties. We also extend the construction of $Z(\\zeta)$ to an arbitrary extension class $\\zeta \\in \\Ext^n_G(M,N)$ whenever $M$ and $N$ are $kG$-modules of constant Jordan type.
Doppler Shift Compensation Schemes in VANETs
F. Nyongesa
2015-01-01
Full Text Available Over the last decade vehicle-to-vehicle (V2V communication has received a lot of attention as it is a crucial issue in intravehicle communication as well as in Intelligent Transportation System (ITS. In ITS the focus is placed on integration of communication between mobile and fixed infrastructure to execute road safety as well as nonsafety information dissemination. The safety application such as emergence alerts lays emphasis on low-latency packet delivery rate (PDR, whereas multimedia and infotainment call for high data rates at low bit error rate (BER. The nonsafety information includes multimedia streaming for traffic information and infotainment applications such as playing audio content, utilizing navigation for driving, and accessing Internet. A lot of vehicular ad hoc network (VANET research has focused on specific areas including channel multiplexing, antenna diversity, and Doppler shift compensation schemes in an attempt to optimize BER performance. Despite this effort few surveys have been conducted to highlight the state-of-the-art collection on Doppler shift compensation schemes. Driven by this cause we survey some of the recent research activities in Doppler shift compensation schemes and highlight challenges and solutions as a stock-taking exercise. Moreover, we present open issues to be further investigated in order to address the challenges of Doppler shift in VANETs.
Lower Bound for Visual Cryptography Schemes
Cheraghi, Abbas
2007-01-01
For a given visual cryptography scheme, it is possible to present a basis matrices for it and most of constructions are based on basis matrices. In this paper we introduce a lower bound for the pixel expansion of visual cryptography schemes with basis matrices. To make the main theorem more flexible, we will introduce a lower bound based on induced matchings of hypergraph of qualified sets. As an application, we present an algebraic proof for the fact that the pixel expansion of basis matrices of any $k$ out of $k$ scheme is at least $2^{k-1}$. In the sequel, we present a lower bound for the pixel expansion of a given graph access structure in term of maximum number of edges in an induced matching. Finally, we show that the minimum pixel expansion of basis matrices of graph access structure $P_n$ is exactly $\\lceil \\frac{n+1}{2}\\rceil$ and this shows the lower bound mentioned in the main theorem is sharp.
INFORMATION FROM THE CERN HEALTH INSURANCE SCHEME
Tel : 7-3635
2002-01-01
Please note that, from 1 July 2002, the tariff agreement between CERN and the Hôpital de la Tour will no longer be in force. As a result the members of the CERN Health Insurance Scheme will no longer obtain a 5% discount for quick payment of bills. More information on the termination of the agreement and the implications for our Health Insurance Scheme will be provided in the next issue of the CHIS Bull', due for publication in the first half of July. It will be sent to your home address, so, if you have moved recently, please check that your divisional secretariat has your current address. Tel.: 73635 The Organization's Health Insurance Scheme (CHIS) has launched its own Web pages, located on the Website of the Social & Statutory Conditions Group of HR Division (HR-SOC). The address is short and easy-to-remember www.cern.ch/chis The pages currently available concentrate on providing basic information. Over the coming months it is planned to fill out the details and introduce new topics. Please give us ...
SINGLE TONE JAMMING ELIMINATION SCHEME OF MULTICARRIER SPREAD SPECTRUM SYSTEM
Ying Xiaofan; Chu Zhenyong; Tian Hongxin; Yi Kechu
2004-01-01
The proposed scheme is based on Discrete Fourier Transform (DFT) domain processing. The key technology of this scheme is jamming parameters' accurate estimation and jamming reconstruction. Compared with the "threshold exciser" schemeithe proposed scheme can eliminate more jamming energy on the whole frequency band with the minimum loss of useful signal energy. As shown in the research and simulation, the proposed scheme is much better than the "threshold exciser" scheme, especially in the case of high power jamming whereas the "threshold exciser" scheme might be invalid.
A weak blind signature scheme based on quantum cryptography
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.
Cryptanalytic Performance Appraisal of Improved CCH2 Proxy Multisignature Scheme
Raman Kumar
2014-01-01
Full Text Available Many of the signature schemes are proposed in which the t out of n threshold schemes are deployed, but they still lack the property of security. In this paper, we have discussed implementation of improved CCH1 and improved CCH2 proxy multisignature scheme based on elliptic curve cryptosystem. We have represented time complexity, space complexity, and computational overhead of improved CCH1 and CCH2 proxy multisignature schemes. We have presented cryptanalysis of improved CCH2 proxy multisignature scheme and showed that improved CCH2 scheme suffered from various attacks, that is, forgery attack and framing attack.
Constructing of constraint preserving scheme for Einstein equations
Tsuchiya, Takuya
2016-01-01
We propose a new numerical scheme of evolution for the Einstein equations using the discrete variational derivative method (DVDM). We derive the discrete evolution equation of the constraint using this scheme and show the constraint preserves in the discrete level. In addition, to confirm the numerical stability using this scheme, we perform some numerical simulations by discretized equations with the Crank-Nicolson scheme and with the new scheme, and we find that the new discretized equations have better stability than that of the Crank-Nicolson scheme.
吕仁周; 白晓清; 李佩杰; 代景龙; 林颂晨
2016-01-01
The random charging of electric vehicles ( EVs) will cause many adverse effects on the security and economical operation of a power system . A multi‐objective optimization model is proposed for real‐time charging control aimed at maximization of the EV owners benefit and minimization of the active power loss . By using the alternate direction method of multiplier ( ADMM ) , the centralized optimization model of charging can be converted into individual sub ‐problems in the decentralized optimization model with the device as the unit . For each iteration of ADMM , only a bit of information is exchanged between the device and the adjacent interactive information points , which is conducive to protecting user information security . Meanwhile , some disadvantages due to centralized optimization can be overcome , such as high communication requirements and high computational overhead . Simulations for IEEE 33‐bus and actual 119‐bus network systems show that the results of the decentralized optimization model and the centralized model are conformable . Moreover , the proposed algorithm shows high computing efficiency , low communication cost and good applicability to the rolling scheduling schema in real ‐time .%大规模电动汽车的无序接入会对电力系统的安全、经济运行产生诸多不利影响。针对这些问题，建立了用户收益最大化及系统有功网损最小化的实时充电控制多目标凸优化模型。引入交替方向乘子算法，将集中式充电优化问题转换为分散式以设备为单位的子优化问题求解。每次迭代设备与相邻的交互信息点之间仅需交互少量信息，利于保护用户的信息安全，并能有效解决集中式控制策略引起通信要求高、计算开销大的问题。 IEEE 33节点、实际的119节点配电网系统的仿真结果表明：所提模型与集中式优化模型的计算结果一致，所提算法计算效率高、通信开销小，适用于滚动式实时调度。
Uncertainty of Microphysics Schemes in CRMs
Tao, W. K.; van den Heever, S. C.; Wu, D.; Saleeby, S. M.; Lang, S. E.
2015-12-01
Microphysics is the framework through which to understand the links between interactive aerosol, cloud and precipitation processes. These processes play a critical role in the water and energy cycle. CRMs with advanced microphysics schemes have been used to study the interaction between aerosol, cloud and precipitation processes at high resolution. But, there are still many uncertainties associated with these microphysics schemes. This has arisen, in part, from the fact microphysical processes cannot be measured directly; instead, cloud properties, which can be measured, are and have been used to validate model results. The utilization of current and future global high-resolution models is rapidly increasing and are at what has been traditional CRM resolutions and are using microphysics schemes that were developed in traditional CRMs. A potential NASA satellite mission called the Cloud and Precipitation Processes Mission (CaPPM) is currently being planned for submission to the NASA Earth Science Decadal Survey. This mission could provide the necessary global estimates of cloud and precipitation properties with which to evaluate and improve dynamical and microphysical parameterizations and the feedbacks. In order to facilitate the development of this mission, CRM simulations have been conducted to identify microphysical processes responsible for the greatest uncertainties in CRMs. In this talk, we will present results from numerical simulations conducted using two CRMs (NU-WRF and RAMS) with different dynamics, radiation, land surface and microphysics schemes. Specifically, we will conduct sensitivity tests to examine the uncertainty of the some of the key ice processes (i.e. riming, melting, freezing and shedding) in these two-microphysics schemes. The idea is to quantify how these two different models' respond (surface rainfall and its intensity, strength of cloud drafts, LWP/IWP, convective-stratiform-anvil area distribution) to changes of these key ice
An Analysis Of Loko Flood Disaster Resettlement Scheme, In Song ...
Open Access DOWNLOAD FULL TEXT ... Data on the occupation of the respondents, their perception of the scheme, and involvement in decision ... and hopes; inadequate funding and poor management of the scheme by the government.
A NEW EFFICIENT ID-BASED PROXY BLIND SIGNATURE SCHEME
Ming Yang; Wang Yumin
2008-01-01
In a proxy blind signature scheme, the proxy signer is allowed to generate a blind signature on behalf of the original signer. The proxy blind signature scheme is useful in several applications such as e-voting, e-payment, etc. Recently, Zheng, et al. presented an IDentity (ID)-based proxy blind signature. In this paper, a new efficient ID-based proxy blind signature scheme from bilinear pairings is proposed, which can satisfy the security properties of both the proxy signatures and the blind signature schemes. Analysis of the scheme efficiency shows that the new scheme is more efficient than Zheng, et al.'s scheme. The proposed scheme is more practical in the real world.
Statistical Hiding Fuzzy Commitment Scheme for Securing Biometric Templates
Alawi A. Al-Saggaf
2013-04-01
Full Text Available By considering the security flaws in cryptographic hash functions, any commitment scheme designed straight through hash function usage in general terms is insecure. In this paper, we develop a general fuzzy commitment scheme called an ordinary fuzzy commitment scheme (OFCS, in which many fuzzy commitment schemes with variety complexity assumptions is constructed. The scheme is provably statistical hiding (the advisory gets almost no statistically advantages about the secret message. The efficiency of our scheme offers different security assurance, and the trusted third party is not involved in the exchange of commitment.The characteristic of our scheme makes it useful for biometrics systems. If the biometrics template is compromised, then there is no way to use it directly again even in secure biometrics systems. This paper combines biometrics and OFCS to achieve biometric protection scheme using smart cards with renewability of protected biometrics template property.
A SINGLE STEP SCHEME WITH HIGH ACCURACY FOR PARABOLIC PROBLEM
陈传淼; 胡志刚
2001-01-01
A single step scheme with high accuracy for solving parabolic problem is proposed. It is shown that this scheme possesses good stability and fourth order accuracy with respect to both time and space variables, which are superconvergent.
Systematic Luby Transform codes as incremental redundancy scheme
Grobler, TL
2011-09-01
Full Text Available Systematic Luby Transform (fountain) codes are investigated as a possible incremental redundancy scheme for EDGE. The convolutional incremental redundancy scheme currently used by EDGE is replaced by the fountain approach. The results...
A New Achievability Scheme for the Relay Channel
Kang, Wei
2007-01-01
In this paper, we propose a new coding scheme for the general relay channel. This coding scheme is in the form of a block Markov code. The transmitter uses a superposition Markov code. The relay compresses the received signal and maps the compressed version of the received signal into a codeword conditioned on the codeword of the previous block. The receiver performs joint decoding after it has received all of the B blocks. We show that this coding scheme can be viewed as a generalization of the well-known Compress-And-Forward (CAF) scheme proposed by Cover and El Gamal. Our coding scheme provides options for preserving the correlation between the channel inputs of the transmitter and the relay, which is not possible in the CAF scheme. Thus, our proposed scheme may potentially yield a larger achievable rate than the CAF scheme.
Certificateless Key-Insulated Generalized Signcryption Scheme without Bilinear Pairings
Caixue Zhou
2017-01-01
Full Text Available Generalized signcryption (GSC can be applied as an encryption scheme, a signature scheme, or a signcryption scheme with only one algorithm and one key pair. A key-insulated mechanism can resolve the private key exposure problem. To ensure the security of cloud storage, we introduce the key-insulated mechanism into GSC and propose a concrete scheme without bilinear pairings in the certificateless cryptosystem setting. We provide a formal definition and a security model of certificateless key-insulated GSC. Then, we prove that our scheme is confidential under the computational Diffie-Hellman (CDH assumption and unforgeable under the elliptic curve discrete logarithm (EC-DL assumption. Our scheme also supports both random-access key update and secure key update. Finally, we evaluate the efficiency of our scheme and demonstrate that it is highly efficient. Thus, our scheme is more suitable for users who communicate with the cloud using mobile devices.
Threshold Signature Scheme Based on Discrete Logarithm and Quadratic Residue
FEI Ru-chun; WANG Li-na
2004-01-01
Digital signature scheme is a very important research field in computer security and modern cryptography.A(k,n) threshold digital signature scheme is proposed by integrating digital signature scheme with Shamir secret sharing scheme.It can realize group-oriented digital signature, and its security is based on the difficulty in computing discrete logarithm and quadratic residue on some special conditions.In this scheme, effective digital signature can not be generated by any k-1 or fewer legal users, or only by signature executive.In addition, this scheme can identify any legal user who presents incorrect partial digital signature to disrupt correct signature, or any illegal user who forges digital signature.A method of extending this scheme to an Abelian group such as elliptical curve group is also discussed.The extended scheme can provide rapider computing speed and stronger security in the case of using shorter key.
An improved identity-based proxy ring signature scheme
Lang Weimin; Yang Zongkai; Cheng Wenqing; Tan Yunmeng
2005-01-01
Proxy ring signature schemes have been shown to be useful in various applications, such as electronic polling, electronic payment, etc. In this paper, we point out that Lang's scheme is unreasonable and propose an improved Identity-based proxy ring scheme from bilinear pairings which is reasonable and overcomes the deficiencies of Lang's scheme. Our scheme can prevent the original signer from generating the proxy ring signature, thus the profits of the proxy signer are guaranteed. In addition, our scheme satisfies all the security requirements of proxy ring signature, I.e. Signer-ambiguity, non-forgeability, verification, non-deniability and distinguishability. As compared with Zhang's scheme, our scheme is a computational efficiency improvement for signature verification because the computational cost of bilinear pairings required is reduced from O(n) to O(1).
Direct scheme for measuring the geometric quantum discord
Jin, Jia-sen; Yu, Chang-shui; Song, He-shan
2011-01-01
We propose a scheme to directly measure the exact value of geometric quantum discord of an arbitrary two-qubit state. We only need to perform the projective measurement in the all anti-symmetric subspace and our scheme is parametrically efficient in contrast to the widely adopted quantum state tomography scheme in the sense of less parameter estimations and projectors. Moreover, the present scheme can be easily realized with the current experimental techniques.
A comparative study of the efficiency of jet schemes
Chidyagwai, Prince; Rosales, Rodolfo Ruben; Seibold, Benjamin
2011-01-01
We present two versions of third order accurate jet schemes, which achieve high order accuracy by tracking derivative information of the solution along characteristic curves. For a benchmark linear advection problem, the efficiency of jet schemes is compared with WENO and Discontinuous Galerkin methods of the same order. It is demonstrated that jet schemes possess the simplicity and speed of WENO schemes, while showing several of the advantages as well as the accuracy of DG methods.
An Efficient Proactive RSA Scheme for Ad Hoc Networks
ZHANG Rui-shan; CHEN Ke-fei
2007-01-01
A proactive threshold signature scheme is very important to tolerate mobile attack in mobile ad hoc networks. In this paper, we propose an efficient proactive threshold RSA signature scheme for ad hoc networks. The scheme consists of three protocols: the initial secret share distribution protocol, the signature generation protocol and the secret share refreshing protocol. Our scheme has three advantages. First, the signature generation protocol is efficient. Second, the signature generation protocol is resilient. Third, the share refreshing protocol is efficient.
An Advanced Threshold Secret Sharing Scheme for Identifying Cheaters
XIE Shu-cui; ZHANG Jian-zhong
2003-01-01
In this paper an advanced threshold secret sharing scheme for identifying cheaters is proposed by using authentication codes. The performance of the scheme is discussed. The results show that in the scheme the valid shareholders can not only identify the impersonation of an adversary, but also detect cheating of some valid shareholders. In particular one honest shareholder is able to detect cheating of other participants forming a collection, and the information rate of the scheme is higher than that of others.
A Fuzzy Commitment Scheme with McEliece's Cipher
Deo Brat Ojha
2010-04-01
Full Text Available In this paper an attempt has been made to explain a fuzzy commitment scheme with McEliece scheme. The efficiency and security of this cryptosystem is comparatively better than any other cryptosystem. This scheme is one of the interesting candidates for post quantum cryptography. Hence our interest to deal with this system with fuzzy commitment scheme. The concept itself is illustrated with the help of a simple situation and the validation of mathematical experimental verification is provided.
Cryptanalysis and Improvement of Signcryption Schemes on Elliptic Curves
LI Xiang-xue; CHEN Ke-fei; LI Shi-qun
2005-01-01
In this paper, we analyze two signcryption schemes on elliptic curves proposed by Zheng Yu-liang and Hideki Imai. We point out a serious problem with the schemes that the elliptic curve based signcryption schemes lose confidentiality to gain non-repudiation. We also propose two improvement versions that not only overcome the security leak inherent in the schemes but also provide public verifiability or forward security. Our improvement versions require smaller computing cost than that required by signature-thenencryption methods.
Quantum Communication Scheme Using Non-symmetric Quantum Channel
CAO Hai-Jing; CHEN Zhong-Hua; SONG He-Shan
2008-01-01
A theoretical quantum communication scheme based on entanglement swapping and superdense coding is proposed with a 3-dimensional Bell state and 2-dimensional Bell state function as quantum channel quantum key distribution and quantum secure direct communication can be simultaneously accomplished in the scheme. The scheme is secure and has high source capacity. At last, we generalize the quantum communication scheme to d-dimensional quantum channel.
An Identity-Based Strong Designated Verifier Proxy Signature Scheme
WANG Qin; CAO Zhenfu
2006-01-01
In a strong designated verifier proxy signature scheme, a proxy signer can generate proxy signature on behalf of an original signer, but only the designated verifier can verify the validity of the proxy signature. In this paper, we first define the security requirements for strong designated verifier proxy signature schemes. And then we construct an identity-based strong designated verifier proxy signature scheme. We argue that the proposed scheme satisfies all of the security requirements.
Verifiable (t, n) Threshold Signature Scheme Based on Elliptic Curve
WANG Hua-qun; ZHAO Jun-xi; ZHANG Li-jun
2005-01-01
Based on the difficulty of solving the ECDLP (elliptic curve discrete logarithm problem) on the finite field,we present a (t, n) threshold signature scheme and a verifiable key agreement scheme without trusted party. Applying a modified elliptic curve signature equation, we get a more efficient signature scheme than the existing ECDSA (elliptic curve digital signature algorithm) from the computability and security view. Our scheme has a shorter key, faster computation, and better security.
7 CFR 786.110 - Misrepresentation, scheme, or device.
2010-01-01
... 7 Agriculture 7 2010-01-01 2010-01-01 false Misrepresentation, scheme, or device. 786.110 Section... Misrepresentation, scheme, or device. (a) In addition to other penalties, sanctions, or remedies that may apply, a... misrepresentation, scheme, or device, must be refunded with interest together with such other sums as may become due...
7 CFR 1424.13 - Misrepresentation and scheme or device.
2010-01-01
... 7 Agriculture 10 2010-01-01 2010-01-01 false Misrepresentation and scheme or device. 1424.13... Misrepresentation and scheme or device. (a) A producer shall be ineligible to receive payments under this program if... misrepresentation, scheme, or device, or to any other person as a result of the bioenergy producer's actions, shall...
7 CFR 784.9 - Misrepresentation and scheme or device.
2010-01-01
... 7 Agriculture 7 2010-01-01 2010-01-01 false Misrepresentation and scheme or device. 784.9 Section... Misrepresentation and scheme or device. (a) A sheep and lamb operation shall be ineligible to receive assistance... pursuant to this part to any person or operation engaged in a misrepresentation, scheme, or device, shall...
7 CFR 1430.220 - Misrepresentation and scheme or device.
2010-01-01
... 7 Agriculture 10 2010-01-01 2010-01-01 false Misrepresentation and scheme or device. 1430.220... Contract Program § 1430.220 Misrepresentation and scheme or device. (a) A dairy operation shall be... misrepresentation, scheme, or device, shall be refunded to CCC. The remedies provided in this subpart shall be in...
7 CFR 1430.310 - Misrepresentation and scheme or device.
2010-01-01
... 7 Agriculture 10 2010-01-01 2010-01-01 false Misrepresentation and scheme or device. 1430.310... Disaster Assistance Payment Program § 1430.310 Misrepresentation and scheme or device. (a) In addition to... person or operation engaged in a misrepresentation, scheme, or device, shall be refunded with interest...
7 CFR 1430.610 - Misrepresentation and scheme or device.
2010-01-01
... 7 Agriculture 10 2010-01-01 2010-01-01 false Misrepresentation and scheme or device. 1430.610... Disaster Assistance Payment Program II (DDAP-II) § 1430.610 Misrepresentation and scheme or device. (a) In... this part to any person or operation engaged in a misrepresentation, scheme, or device, must be...
7 CFR 760.1310 - Misrepresentation and scheme or device.
2010-01-01
... 7 Agriculture 7 2010-01-01 2010-01-01 false Misrepresentation and scheme or device. 760.1310... Program § 760.1310 Misrepresentation and scheme or device. (a) In addition to other penalties, sanctions... a misrepresentation, scheme, or device, must be refunded with interest together with such other sums...
Conditional linear-optical measurement schemes generate effective photon nonlinearities
Lapaire, G G; Dowling, J P; Sipe, J E; Dowling, Jonathan P.
2003-01-01
We provide a general approach for the analysis of optical state evolution under conditional measurement schemes, and identify the necessary and sufficient conditions for such schemes to simulate unitary evolution on the freely propagating modes. If such unitary evolution holds, an effective photon nonlinearity can be identified. Our analysis extends to conditional measurement schemes more general than those based solely on linear optics.
General Scheme for the Construction of a Protected Qubit Subspace
Aharon, N.; Drewsen, M.; Retzker, A.
2013-01-01
We present a new robust decoupling scheme suitable for half integer angular momentum states. The scheme is based on continuous dynamical decoupling techniques by which we create a protected qubit subspace. Our scheme predicts a coherence time of ~1 second, as compared to typically a few...
The hybrid Eulerian Lagrangian numerical scheme tested with Chemistry
A. B. Hansen
2012-11-01
Full Text Available A newly developed advection scheme, the Hybrid Eulerian Lagrangian (HEL scheme, has been tested, including a module for atmospheric chemistry, including 58 chemical species, and compared to two other traditional advection schemes; a classical pseudospectral Eulerian method the Accurate Space Derivative (ASD scheme and the bi-cubic semi-Lagrangian (SL scheme using classical rotation tests. The rotation tests have been designed to test and compare the advection schemes for different spatial and temporal resolutions in different chemical conditions (rural and urban and for different shapes (cone and slotted cylinder giving the advection schemes different challenges with respect to relatively slow or fast chemistry and smooth or sharp gradients, respectively. In every test, error measures have been calculated and used for ranking of the advection schemes with respect to performance, i.e. lowest overall errors for all chemical species. Furthermore, the HEL and SL schemes have been compared in a shallow water model, demonstrating the performance in a more realistic non-linear deformation flow.
The results in this paper show that the new advection scheme, HEL, by far outperforms both the Eulerian and semi-Lagrangian schemes with very low error estimates compared to the two other schemes. Although no analytic solution can be obtained for the performance in the non-linear shallow water model flow, the tracer distribution appears realistic as compared to LMCSL when a mixing between local parcel concentrations is introduced in HEL.
An Annotation Scheme for Social Interaction in Digital Playgrounds
Moreno, Alejandro M.; Delden, van Robby; Reidsma, Dennis; Poppe, Ronald; Heylen, Dirk; Herrlich, Marc; Malaka, Rainer; Masuch, Maic
2012-01-01
This paper introduces a new annotation scheme, designed specifically to study children's social interactions during play in digital playgrounds. The scheme is motivated by analyzing relevant literature, combined with observations from recordings of play sessions. The scheme allows us to analyze how
33 CFR 83.10 - Traffic separation schemes (Rule 10).
2010-07-01
... 33 Navigation and Navigable Waters 1 2010-07-01 2010-07-01 false Traffic separation schemes (Rule... Visibility § 83.10 Traffic separation schemes (Rule 10). (a) Obligations under other Rules unaffected. This Rule applies to traffic separation schemes and does not relieve any vessel of her obligation under any...
Taxonomic scheme for the identification of marine bacteria
Oliver, James D.
1982-06-01
A recently developed taxonomic scheme for the identification of marine bacteria is presented. The scheme is based on numerous reviews and monographs on marine bacteria, as well as Bergey's Manual of Determinative Bacteriology. While fairly extensive, the scheme is designed to identify marine bacteria using relatively few tests.
A quantum identification scheme based on polarization modulation
He Guang-Qiang; Zeng Gui-Hua
2005-01-01
Aquantum idetification scheme including registration and identification phases is proposed.The user' passwords are transmitted by qubit string and recorded as set of quantum operators.The security of the proposed scheme is guarateed by the no-coloning theorem.Based on photon polarization modulation,an experimental approach is also designed to implement our proposed scheme.
Scheme for Implementation of Quantum Game in Cavity QED
ZHANG Li-Chun; CAO Shu-Ai; WU Yue-Qin; FANG Mao-Fa; LI Huai-Fan; ZHENG Xiao-Juan; ZHAO Ren; WANG Xin-Wen; LI Ze-Hua
2008-01-01
We propose an experimentally feasible scheme to implement two-player quantum game in cavity quantum electrodynamics (QED). During the process, the cavity is only virtually excited, thus our scheme is insensitive to the cavity field states and cavity decay. The scheme can be realized in the range of current cavity QED techniques.
A dynamic digital signature scheme without third parties
Van Elsas, M.; Van der Lubbe, J.C.A.; Weber, J.H.
2015-01-01
We propose a digital signature scheme for dynamic coalitions. Particularly, we enable members to join and leave. Our scheme does not need trusted or oblivious third parties (TTPs or OTPs). In this distributed scheme there is a changing secret group key dependent on the members in the group. Each
On the strong monotonicity of the CABARET scheme
Ostapenko, V. V.
2012-03-01
The strong monotonicity of the CABARET scheme with single flux correction is analyzed as applied to the linear advection equation. It is shown that the scheme is strongly monotone (has the NED property) at Courant numbers r ∈ (0,0,5), for which it is monotone. Test computations illustrating this property of the CABARET scheme are presented.
A Formal Model for the Security of Proxy Signature Schemes
GU Chun-xiang; ZHU Yue-fei; ZHANG Ya-juan
2005-01-01
This paper provides theoretical foundations for the secure proxy signature primitive. We present a formal model for the security of proxy signature schemes, which defines the capabilities of the adversary and the security goals to capture which mean for a proxy signature scheme to be secure. Then, we present an example of proxy signature scheme that can be proven secure in the standard model.
Efficient Scheme for Optimizing Quantum Fourier Circuits
JIANG Min; ZHANG Zengke; Tzyh-Jong Tarn
2008-01-01
In quantum circuits, importing of additional qubits can reduce the operation time and prevent de-coherence induced by the environment. However, excessive qubits may make the quantum system vulner-able. This paper describes how to relax existing qubits without additional qubits to significantly reduce the operation time of the quantum Fourier circuit compared to a circuit without optimization. The results indicate that this scheme makes full use of the qubits relaxation. The concepts can be applied to improve similar quantum circuits and guide the physical implementations of quantum algorithms or devices.
New Financing Schemes of Public Infrastructure
Ignacio de la Riva
2017-01-01
Full Text Available Public works procurements and concessions are traditional legal techniques used to shape the financing of public infrastructure. Fiscal constraints faced by public administrations at the end of the 20th century, and the subsequent increase of private participation in the provision of public goods and services, encouraged the development of new legal schemes allowing a higher degree of private investment in public infrastructure; such as Public Private Partnerships, project finance, securitizations, the shadow toll, turn-key agreements, public leasing and public trusts.
Autonomous Droop Scheme With Reduced Generation Cost
Nutkani, Inam Ullah; Loh, Poh Chiang; Wang, Peng
2014-01-01
Droop schemes have traditionally been applied to the control of parallel synchronous generators in power systems. It has subsequently been brought over to the control of distributed generators (DGs) in microgrids with the same retained objective of proportional power sharing based on ratings....... This objective might, however, not suit microgrids well since DGs are usually of different types, unlike synchronous generators. Other factors like cost, efficiency, and emission penalty of each DG at different loading must be considered since they contribute directly to the total generation cost (TGC...... likely to be accepted by the industry. The reduction in TGC has been verified by experiment....
Cryptanalysis of Two Fault Countermeasure Schemes
Banik, Subhadeep; Bogdanov, Andrey
2015-01-01
is meant for the protection of block ciphers like AES. The second countermeasure was proposed in IEEE-HOST 2015 and protects the Grain-128 stream cipher. The design divides the output function used in Grain-128 into two components. The first called the masking function, masks the input bits to the output......In this paper, we look at two fault countermeasure schemes proposed very recently in literature. The first proposed in ACISP 2015 constructs a transformation function using a cellular automata based linear diffusion, and a non-linear layer using a series of bent functions. This countermeasure...
DIFFERENCE SCHEMES BASING ON COEFFICIENT APPROXIMATION
MOU Zong-ze; LONG Yong-xing; QU Wen-xiao
2005-01-01
In respect of variable coefficient differential equations, the equations of coefficient function approximation were more accurate than the coefficient to be frozen as a constant in every discrete subinterval. Usually, the difference schemes constructed based on Taylor expansion approximation of the solution do not suit the solution with sharp function.Introducing into local bases to be combined with coefficient function approximation, the difference can well depict more complex physical phenomena, for example, boundary layer as well as high oscillatory, with sharp behavior. The numerical test shows the method is more effective than the traditional one.
Cosmological SUSY Breaking and the Pyramid Schemes
Banks, T
2014-01-01
I review the ideas of holographic space-time (HST), Cosmological SUSY breaking (CSB), and the Pyramid Schemes, which are the only known models of Tera-scale physics consistent with CSB, current particle data, and gauge coupling unification. There is considerable uncertainty in the estimate of the masses of supersymmetric partners of the standard model particles, but the model predicts that the gluino is probably out of reach of the LHC, squarks may be in reach, and the NLSP is a right handed slepton, which should be discovered soon.
Labelling schemes: From a consumer perspective
Juhl, Hans Jørn; Stacey, Julia
2000-01-01
. A recent MAPP study has investigated the value consumers attach the Government-controlled labels 'Ø-mærket' and 'Den Blå Lup' and the private supermarket label 'Mesterhakket' when they purchase minced meat. The results reveal four consumer segments that use labelling schemes for food products very....... The remaining consumers, about 55%, trust the institutions guaranteeing the labels and they use the labels as a signal without actually knowing the content of each label. Segment composition will probably change depending on the food group studied. It is therefore recommended that the different consumer types...
Feature extraction for an image retrieving scheme
Fuertes García, José Manuel; Lucena López, Manuel José; Pérez de la Blanca Capilla, Nicolás; Fernández Valdivia, Joaquín
1999-01-01
In this paper we present two basic modules whithin the designed scheme for retrieving images of a database from the object colour and shape in the scenes. On the one hand, we desing a new method to detect edges in colour images. We offer a new approach to the perceptual space (H,S,I) (an Uniform Chromatic Scale space) About wich we describe its properties as well as the metric to work in it. On the other hand, we develop an information simplifying process to form a graphic structure en wich t...
Cosmological SUSY breaking and the pyramid scheme
Banks, Tom
2015-04-01
I review the ideas of holographic spacetime (HST), cosmological SUSY breaking (CSB), and the Pyramid Schemes, which are the only known models of Tera-scale physics consistent with CSB, current particle data, and gauge coupling unification. There is considerable uncertainty in the estimate of the masses of supersymmetric partners of the Standard Model particles, but the model predicts that the gluino is probably out of reach of the LHC, squarks may be in reach, and the NLSP is a right-handed slepton, which should be discovered soon.
Secure Biometric E-Voting Scheme
Ahmed, Taha Kh.; Aborizka, Mohamed
The implementation of the e-voting becomes more substantial with the rapid increase of e-government development. The recent growth in communications and cryptographic techniques facilitate the implementation of e-voting. Many countries introduced e-voting systems; unfortunately most of these systems are not fully functional. In this paper we will present an e-voting scheme that covers most of the e-voting requirements, smart card and biometric recognition technology were implemented to guarantee voter's privacy and authentication.
A Classification Scheme for Glaciological AVA Responses
Booth, A.; Emir, E.
2014-12-01
A classification scheme is proposed for amplitude vs. angle (AVA) responses as an aid to the interpretation of seismic reflectivity in glaciological research campaigns. AVA responses are a powerful tool in characterising the material properties of glacier ice and its substrate. However, before interpreting AVA data, careful true amplitude processing is required to constrain basal reflectivity and compensate amplitude decay mechanisms, including anelastic attenuation and spherical divergence. These fundamental processing steps can be difficult to design in cases of noisy data, e.g. where a target reflection is contaminated by surface wave energy (in the case of shallow glaciers) or by energy reflected from out of the survey plane. AVA methods have equally powerful usage in estimating the fluid fill of potential hydrocarbon reservoirs. However, such applications seldom use true amplitude data and instead consider qualitative AVA responses using a well-defined classification scheme. Such schemes are often defined in terms of the characteristics of best-fit responses to the observed reflectivity, e.g. the intercept (I) and gradient (G) of a linear approximation to the AVA data. The position of the response on a cross-plot of I and G then offers a diagnostic attribute for certain fluid types. We investigate the advantages in glaciology of emulating this practice, and develop a cross-plot based on the 3-term Shuey AVA approximation (using I, G, and a curvature term C). Model AVA curves define a clear lithification trend: AVA responses to stiff (lithified) substrates fall discretely into one quadrant of the cross-plot, with positive I and negative G, whereas those to fluid-rich substrates plot diagonally opposite (in the negative I and positive G quadrant). The remaining quadrants are unoccupied by plausible single-layer responses and may therefore be diagnostic of complex thin-layer reflectivity, and the magnitude and polarity of the C term serves as a further indicator
An algebraic approach to association schemes
Zieschang, Paul-Hermann
1996-01-01
The primary object of the lecture notes is to develop a treatment of association schemes analogous to that which has been so successful in the theory of finite groups. The main chapters are decomposition theory, representation theory, and the theory of generators. Tits buildings come into play when the theory of generators is developed. Here, the buildings play the role which, in group theory, is played by the Coxeter groups. - The text is intended for students as well as for researchers in algebra, in particular in algebraic combinatorics.
Constraint-Preserving Scheme for Maxwell's Equations
Tsuchiya, Takuya
2016-01-01
We derive the discretized Maxwell's equations using the discrete variational derivative method (DVDM), calculate the evolution equation of the constraint, and confirm that the equation is satisfied at the discrete level. Numerical simulations showed that the results obtained by the DVDM are superior to those obtained by the Crank-Nicolson scheme. In addition, we study the two types of the discretized Maxwell's equations by the DVDM and conclude that if the evolution equation of the constraint is not conserved at the discrete level, then the numerical results are also unstable.
2016-01-01
In this #CERNandSociety video, the 3 PhD students, awarded the ATLAS PhD Grant in 2015, talk about their research work within the ATLAS Collaboration and how this experience has shaped their future. Find out more about the ATLAS PhD Grant Scheme: cern.ch/ATLASPhDGrant This programme is just one of the many #CERNandSociety projects at CERN. Find out more and how you can be involved: http://cern.ch/go/pBt7
Advanced Coarsening Schemes for Graph Partitioning
Safro, Ilya; Schulz, Christian
2012-01-01
The graph partitioning problem is widely used and studied in many practical and theoretical applications. The multilevel strategies represent today one of the most effective and efficient generic frameworks for solving this problem on large-scale graphs. Most of the attention in designing the multilevel partitioning frameworks has been on the refinement phase. In this work we focus on the coarsening phase, which is responsible for creating structurally similar to the original but smaller graphs. We compare different matching- and AMG-based coarsening schemes, experiment with the algebraic distance between nodes, and demonstrate computational results on several classes of graphs that emphasize the running time and quality advantages of different coarsenings.
Rural poverty reduction through centrally sponsored schemes.
Saxena, N C
2007-10-01
This paper discusses the evolving profile of poverty in India and reviews the national performance of selected anti-poverty programmes between 1997-1998 and 2005. For each programme, it outlines the budgetary allocation principle used for the States and districts and analyzes budgetary performance over the period. The main objective is to explore the extent to which the anti-poverty programmes are reaching their target groups effectively. Finally, it identifies the specific factors responsible for under-performance and provides a set of recommendations for policy makers and programme implementers which could help improve the outcomes of the schemes.
Pay-what-you-want pricing schemes
Kahsay, Goytom Abraha; Samahita, Margaret
2015-01-01
Pay-What-You-Want (PWYW) pricing schemes are becoming increasingly popular. We develop a model incorporating self-image into the buyer’s utility function and introduce heterogeneity in consumption utility and image-sensitivity, generating different purchase decisions and optimal prices across...... individuals. When a good’s fixed price is lower than a threshold fair value, PWYW can lead to a lower utility. This may result in a lower purchase rate and higher average price, accounting for previously unexplained field experimental evidence. An increase in the threshold value decreases the buyer’s utility...
Research on Lorry Road User Charging Scheme
Chao Sui
2012-01-01
Full Text Available In the 2011-2015 Business Plan, a lorry road user charging scheme has been planned to implement by the Coalition Government by 2014. This study will describe the possible impacts of such a system on the road haulage sector and the ways in which logistics providers might utilize different operating practices and technology to improve their operational performance under such circumstances in the UK. And this essay will cover the possible uses for Intelligent Transport Systems and new working practices using specific case study examples. Finally, the impacts of LRUC and several feasible countermeasures will be discussed in the following text.
2014-11-01
for Time Accurate Compressible Large Eddy Simulations : Comparison of Artificial Dissipation and Filtering Schemes 5b. GRANT NUMBER 5c. PROGRAM...Optimal Numerical Schemes for Time Accurate Compressible Large Eddy Simulations : Comparison of Artificial Dissipation and Filtering Schemes 67th
Wilkinson, M.H.F.
1994-01-01
A run length code compression scheme of extreme simplicity, used for image storage in an automated bacterial morphometry system, is compared with more common compression schemes, such as are used in the tag image file format. These schemes are Lempel-Ziv and Welch (LZW), Macintosh Packbits, and CCIT
Pricing Schemes in Cloud Computing: An Overview
Artan Mazrekaj
2016-02-01
Full Text Available Cloud Computing is one of the technologies with rapid development in recent years where there is increasing interest in industry and academia. This technology enables many services and resources for end users. With the rise of cloud services number of companies that offer various services in cloud infrastructure is increased, thus creating a competition on prices in the global market. Cloud Computing providers offer more services to their clients ranging from infrastructure as a service (IaaS, platform as a service (PaaS, software as a service (SaaS, storage as a service (STaaS, security as a service (SECaaS, test environment as a service (TEaaS. The purpose of providers is to maximize revenue by their price schemes, while the main goal of customers is to have quality of services (QoS for a reasonable price. The purpose of this paper is to compare and discuss several models and pricing schemes from different Cloud Computing providers.
Special Protection Scheme at BTPS Power Station
Ballal, Makarand Sudhakar; Suryawanshi, Hiralal Murlidhar; Ballal, Deepali Makarand; Mishra, Mahesh Kumar
2016-03-01
After 2003 free licensees' act in power sector, it is observed that many power plants from public sector as well as from private sectors are going to be commissioned. The load growth in India is about more than 10% pa. As these plants are going to connect to the power grid, therefore the grid is going to become more complicated. Also the problems related to grid stability are enhanced. There shall be possibilities regarding failure of grid system and under such circumstance it is always desirable to island minimum single generating unit in power plant of specified geographical area. After islanding the generating unit, this unit has to survive not only for the restoration of grid but also for power supply to important consumers. For the grid stability and effective survival of islanded generating unit, it is mandatory to maintain the power balance equation. This paper focuses on the lacunae's observed in implementation of special protection scheme to carry out islanding operation at Bhusawal Thermal Power Station (BTPS) by considering the case studies. The concepts of islanding, load shedding, generator tripping and along with importance of power balance equation is discussed. Efforts are made to provide the solution for the survival of islanding scheme.
Extended lattice Boltzmann scheme for droplet combustion
Ashna, Mostafa; Rahimian, Mohammad Hassan; Fakhari, Abbas
2017-05-01
The available lattice Boltzmann (LB) models for combustion or phase change are focused on either single-phase flow combustion or two-phase flow with evaporation assuming a constant density for both liquid and gas phases. To pave the way towards simulation of spray combustion, we propose a two-phase LB method for modeling combustion of liquid fuel droplets. We develop an LB scheme to model phase change and combustion by taking into account the density variation in the gas phase and accounting for the chemical reaction based on the Cahn-Hilliard free-energy approach. Evaporation of liquid fuel is modeled by adding a source term, which is due to the divergence of the velocity field being nontrivial, in the continuity equation. The low-Mach-number approximation in the governing Navier-Stokes and energy equations is used to incorporate source terms due to heat release from chemical reactions, density variation, and nonluminous radiative heat loss. Additionally, the conservation equation for chemical species is formulated by including a source term due to chemical reaction. To validate the model, we consider the combustion of n-heptane and n -butanol droplets in stagnant air using overall single-step reactions. The diameter history and flame standoff ratio obtained from the proposed LB method are found to be in good agreement with available numerical and experimental data. The present LB scheme is believed to be a promising approach for modeling spray combustion.
Novel copyright protection scheme for digital content
Fan Kefeng; Wang Meihua; Mo Wei; Zhao Xinhua
2006-01-01
A novel copyright protection scheme for digital content is presented, which is a private watermarking scheme based on the watermark embedding in the DCT domain and watermark extraction using independent component analysis (ICA). The system includes the key for watermark extraction and the host image. The algorithm splits the original image into blocks and classifies these blocks based on visual masking, that is, noise visibility function (NVF). Watermark components with different strength are inserted into chosen direct current components of DCT coefficients according to the classifier. The watermark extraction is based on the characteristic of the statistic independence of the host image, watermark and key. Principle component analysis (PCA) whitening process and FastICA techniques are introduced to ensure a blind watermark extraction without requiring the original image. Experimental results show the proposed technique is robust under attacks such as image filtering and adding noise, cropping and resizing. In addition, the proposed private watermarking system can be improved to the application of the DTV content protection system.
Privacy protection schemes for fingerprint recognition systems
Marasco, Emanuela; Cukic, Bojan
2015-05-01
The deployment of fingerprint recognition systems has always raised concerns related to personal privacy. A fingerprint is permanently associated with an individual and, generally, it cannot be reset if compromised in one application. Given that fingerprints are not a secret, potential misuses besides personal recognition represent privacy threats and may lead to public distrust. Privacy mechanisms control access to personal information and limit the likelihood of intrusions. In this paper, image- and feature-level schemes for privacy protection in fingerprint recognition systems are reviewed. Storing only key features of a biometric signature can reduce the likelihood of biometric data being used for unintended purposes. In biometric cryptosystems and biometric-based key release, the biometric component verifies the identity of the user, while the cryptographic key protects the communication channel. Transformation-based approaches only a transformed version of the original biometric signature is stored. Different applications can use different transforms. Matching is performed in the transformed domain which enable the preservation of low error rates. Since such templates do not reveal information about individuals, they are referred to as cancelable templates. A compromised template can be re-issued using a different transform. At image-level, de-identification schemes can remove identifiers disclosed for objectives unrelated to the original purpose, while permitting other authorized uses of personal information. Fingerprint images can be de-identified by, for example, mixing fingerprints or removing gender signature. In both cases, degradation of matching performance is minimized.
Password Authentication Based on Fractal Coding Scheme
Nadia M. G. Al-Saidi
2012-01-01
Full Text Available Password authentication is a mechanism used to authenticate user identity over insecure communication channel. In this paper, a new method to improve the security of password authentication is proposed. It is based on the compression capability of the fractal image coding to provide an authorized user a secure access to registration and login process. In the proposed scheme, a hashed password string is generated and encrypted to be captured together with the user identity using text to image mechanisms. The advantage of fractal image coding is to be used to securely send the compressed image data through a nonsecured communication channel to the server. The verification of client information with the database system is achieved in the server to authenticate the legal user. The encrypted hashed password in the decoded fractal image is recognized using optical character recognition. The authentication process is performed after a successful verification of the client identity by comparing the decrypted hashed password with those which was stored in the database system. The system is analyzed and discussed from the attacker’s viewpoint. A security comparison is performed to show that the proposed scheme provides an essential security requirement, while their efficiency makes it easier to be applied alone or in hybrid with other security methods. Computer simulation and statistical analysis are presented.
IMPLEMENTATION OF THE NEW CAREER STRUCTURE SCHEME
Human Resources Division
2001-01-01
CERN's new Merit Advancement and Promotion Scheme, MAPS, comes into force on 1 September, and all members of staff will soon be receiving the official letter of notification of their assimilation into the new scheme. In this announcement, we take a look at where you can learn about the new system. There will also be an article in the Weekly Bulletin at the end of the month, which will summarise the main changes. During the early summer, HR Division presented the new structure to the staff in the Laboratory via Divisional Information Meetings. The transparencies used in these meetings, along with a list of the most relevant questions and answers, a Career Path Guide as well as a general overview document are available on the HR Division web site http://cern.ch/CERN/Divisions/PE/. Hard copies of the latter document are also available from the Divisional secretariats. The first question most staff members will ask is how they will fit into the new career path structure. Via the same web page, they can type in th...
Design of Infusion Schemes for Neuroreceptor Imaging
Feng, Ling; Svarer, Claus; Madsen, Karine;
2016-01-01
for bolus infusion (BI) or programmed infusion (PI) experiments. Steady-state quantitative measurements can be made with one short scan and venous blood samples. The GABAA receptor ligand [(11)C]Flumazenil (FMZ) was chosen for this purpose, as it lacks a suitable reference region. Methods. Five bolus [(11)C......]FMZ-PET scans were conducted, based on which population-based PI and BI schemes were designed and tested in five additional healthy subjects. The design of a PI was assisted by an offline feedback controller. Results. The system could reproduce the measurements in blood and brain. With PI, [(11)C]FMZ steady...... state was attained within 40 min, which was 8 min earlier than the optimal BI (B/I ratio = 55 min). Conclusions. The system can design both BI and PI schemes to attain steady state rapidly. For example, subjects can be [(11)C]FMZ-PET scanned after 40 min of tracer infusion for 40 min with venous...
Improved mixing representation in Emanuel's convection scheme
Grandpeix, J. Y.; Phillips, V.; Tailleux, R.
2004-10-01
Recent empirical and modelling studies suggest that mid-tropospheric relative humidity (RH) is an important controlling factor of deep atmospheric convection, which appears to be underestimated in present cumulus parametrizations. This indicates the possible presence of shortcomings in the way that entrainment is represented in such parametrizations. This matter was explored in the European Cloud Systems project (EUROCS) by means of an idealized humidity experiment in which the main controlling parameter is RH. In the latter study, cloud-resolving model (CRM) experiments suggested that a shallow/deep convection transition occurs when RH crosses a threshold value that ranges from about RH = 50% to RH = 60%. In this paper, we seek to increase the responsiveness of Emanuel's convection scheme to RH, and to reproduce the threshold behaviour of the idealized humidity case, by replacing the original uniform probability density function (PDF) for mixing fractions by a more flexible two-parameter bell-shaped function that allows a wider range of behaviour. The main result is that the parameters of this PDF can be tuned to allow a regime transition to occur near a threshold value of RH 55%. In contrast to CRM results, however, this transition is between two different regimes of deep convection rather than between a shallow and deep regime. Possible ways to obtain a shallow-to-deep transition with Emanuel's scheme are discussed.
Security analysis of public key watermarking schemes
Craver, Scott A.; Katzenbeisser, Stefan
2001-12-01
Traditional watermarking systems require the complete disclosure of the watermarking key in the watermark verification process. In most systems an attacker is able to remove the watermark completely once the key is known, thus subverting the intention of copyright protection. To cope with this problem, public-key watermarking schemes were proposed that allow asymmetric watermark detection. Whereas a public key is used to insert watermarks in digital objects, the marks can be verified with a private key. Knowledge of this private key does not allow piracy. We describe two public-key watermarking schemes which are similar in spirit to zero-knowledge proofs. The key idea of one system is to verify a watermark in a blinded version of the document, where the scrambling is determined by the private key. A probabilistic protocol is constructed that allows public watermark detection with probability of 1/2; by iteration, the verifier can get any degree of certainty that the watermark is present. The second system is based on watermark attacks, using controlled counterfeiting to conceal real watermark data safely amid data useless to an attacker.
Soft Schemes for Earthquake-Geotechnical Dilemmas
Silvia García
2013-01-01
Full Text Available Models of real systems are of fundamental importance in virtually all disciplines because they can be useful for gaining a better understanding of the organism. Models make it possible to predict or simulate a system’s behavior; in earthquake geotechnical engineering, they are required for the design of new constructions and for the analysis of those that exist. Since the quality of the model typically determines an upper bound on the quality of the final problem solution, modeling is often the bottleneck in the development of the whole system. As a consequence, a strong demand for advanced modeling and identification schemes arises. During the past years, soft computing techniques have been used for developing unconventional procedures to study earthquake geotechnical problems. Considering the strengths and weaknesses of the algorithms, in this work a criterion to leverage the best features to develop efficient hybrid models is presented. Via the development of schemes for integrating data-driven and theoretical procedures, the soft computing tools are presented as reliable earthquake geotechnical models. This assertion is buttressed using a broad history of seismic events and monitored responses in complicated soils systems. Combining the versatility of fuzzy logic to represent qualitative knowledge, the data-driven efficiency of neural networks to provide fine-tuned adjustments via local search, and the ability of genetic algorithms to perform efficient coarse-granule global search, the earthquake geotechnical problems are observed, analyzed, and solved under a holistic approach.
Deterministic Polynomial Factoring and Association Schemes
Arora, Manuel; Karpinski, Marek; Saxena, Nitin
2012-01-01
The problem of finding a nontrivial factor of a polynomial f(x) over a finite field F_q has many known efficient, but randomized, algorithms. The deterministic complexity of this problem is a famous open question even assuming the generalized Riemann hypothesis (GRH). In this work we improve the state of the art by focusing on prime degree polynomials; let n be the degree. If (n-1) has a `large' r-smooth divisor s, then we find a nontrivial factor of f(x) in deterministic poly(n^r,log q) time; assuming GRH and that s > sqrt{n/(2^r)}. Thus, for r = O(1) our algorithm is polynomial time. Further, for r > loglog n there are infinitely many prime degrees n for which our algorithm is applicable and better than the best known; assuming GRH. Our methods build on the algebraic-combinatorial framework of m-schemes initiated by Ivanyos, Karpinski and Saxena (ISSAC 2009). We show that the m-scheme on n points, implicitly appearing in our factoring algorithm, has an exceptional structure; leading us to the improved time ...
A subgrid parameterization scheme for precipitation
S. Turner
2011-07-01
Full Text Available With increasing computing power, the horizontal resolution of numerical weather prediction (NWP models is improving and today reaches 1 to 5 km. Nevertheless, clouds and precipitation are still subgrid scale processes for most cloud types, such as cumulus and stratocumulus. Subgrid scale parameterizations for water vapor condensation have been in use for many years and are based on a prescribed PDF of relative humidity spatial variability within the grid, thus providing a diagnosis of the cloud fraction. A similar scheme is developed and tested here. It is based on a prescribed PDF of cloud water variability and a threshold value of liquid water content for droplet collection to derive a rain fraction within the model grid. Precipitation of rainwater raises additional concerns relative to the overlap of cloud and rain fractions, however. The scheme is developed following an analysis of data collected during field campaigns in stratocumulus (DYCOMS-II and fair weather cumulus (RICO and tested in a 1-D framework against large eddy simulations of these observed cases. The new parameterization is then implemented in a 3-D NWP model with a horizontal resolution of 2.5 km to simulate real cases of precipitating cloud systems over France.
Extended lattice Boltzmann scheme for droplet combustion.
Ashna, Mostafa; Rahimian, Mohammad Hassan; Fakhari, Abbas
2017-05-01
The available lattice Boltzmann (LB) models for combustion or phase change are focused on either single-phase flow combustion or two-phase flow with evaporation assuming a constant density for both liquid and gas phases. To pave the way towards simulation of spray combustion, we propose a two-phase LB method for modeling combustion of liquid fuel droplets. We develop an LB scheme to model phase change and combustion by taking into account the density variation in the gas phase and accounting for the chemical reaction based on the Cahn-Hilliard free-energy approach. Evaporation of liquid fuel is modeled by adding a source term, which is due to the divergence of the velocity field being nontrivial, in the continuity equation. The low-Mach-number approximation in the governing Navier-Stokes and energy equations is used to incorporate source terms due to heat release from chemical reactions, density variation, and nonluminous radiative heat loss. Additionally, the conservation equation for chemical species is formulated by including a source term due to chemical reaction. To validate the model, we consider the combustion of n-heptane and n-butanol droplets in stagnant air using overall single-step reactions. The diameter history and flame standoff ratio obtained from the proposed LB method are found to be in good agreement with available numerical and experimental data. The present LB scheme is believed to be a promising approach for modeling spray combustion.
European energy labelling scheme for windows
Belling Skou, Mette (VELUX A/S (Denmark)); Kragh, Jesper (DTU Byg, Denmarks Tekniske Univ., Lyngby (Denmark))
2009-07-01
In their proposals for revision of the energy labelling directive the European Commission has suggested to include windows. The paper introduces a proposal for an European energy labelling scheme of windows for replacement of windows in the existing building stock taking into consideration the energy performance of windows in both the heating and cooling seasons. The labelling scheme evaluates a methodology where the energy performance in the heating period is established with focus on heat loss and utilization of passive solar energy, whereas the energy performance in the summer (cooling) season will focus on reduction of solar radiation into the building. The methodology is developed with focus on CEN and ISO standardization. With inspiration from the American Energy Star programme for windows, Europe is divided into climate zones where the methodology for each zone is developed on basis of a reference building and climate data. A proposal for labelling will be presented for both heating and cooling seasons in order to enable the user to choose the right product for a specific performance. Based on data from the building stock in the individual climate zones, an energy saving potential for replacement of old windows with new low energy windows will be presented. The possibility for using energy labelling of windows as reference and requirement in the building legislation as an alternative to U-values, will be presented with among others examples from legislation in UK and Denmark.
Finite-difference schemes for anisotropic diffusion
Es, Bram van, E-mail: es@cwi.nl [Centrum Wiskunde and Informatica, P.O. Box 94079, 1090GB Amsterdam (Netherlands); FOM Institute DIFFER, Dutch Institute for Fundamental Energy Research, Association EURATOM-FOM (Netherlands); Koren, Barry [Eindhoven University of Technology (Netherlands); Blank, Hugo J. de [FOM Institute DIFFER, Dutch Institute for Fundamental Energy Research, Association EURATOM-FOM (Netherlands)
2014-09-01
In fusion plasmas diffusion tensors are extremely anisotropic due to the high temperature and large magnetic field strength. This causes diffusion, heat conduction, and viscous momentum loss, to effectively be aligned with the magnetic field lines. This alignment leads to different values for the respective diffusive coefficients in the magnetic field direction and in the perpendicular direction, to the extent that heat diffusion coefficients can be up to 10{sup 12} times larger in the parallel direction than in the perpendicular direction. This anisotropy puts stringent requirements on the numerical methods used to approximate the MHD-equations since any misalignment of the grid may cause the perpendicular diffusion to be polluted by the numerical error in approximating the parallel diffusion. Currently the common approach is to apply magnetic field-aligned coordinates, an approach that automatically takes care of the directionality of the diffusive coefficients. This approach runs into problems at x-points and at points where there is magnetic re-connection, since this causes local non-alignment. It is therefore useful to consider numerical schemes that are tolerant to the misalignment of the grid with the magnetic field lines, both to improve existing methods and to help open the possibility of applying regular non-aligned grids. To investigate this, in this paper several discretization schemes are developed and applied to the anisotropic heat diffusion equation on a non-aligned grid.
Measurability Aspects of the Compactness Theorem for Sample Compression Schemes
2012-01-01
It was proved in 1998 by Ben-David and Litman that a concept space has a sample compression scheme of size d if and only if every finite subspace has a sample compression scheme of size d. In the compactness theorem, measurability of the hypotheses of the created sample compression scheme is not guaranteed; at the same time measurability of the hypotheses is a necessary condition for learnability. In this thesis we discuss when a sample compression scheme, created from com- pression schemes o...
Fourth order accurate compact scheme with group velocity control (GVC)
无
2001-01-01
For solving complex flow field with multi-scale structure higher order accurate schemes are preferred. Among high order schemes the compact schemes have higher resolving efficiency. When the compact and upwind compact schemes are used to solve aerodynamic problems there are numerical oscillations near the shocks. The reason of oscillation production is because of non-uniform group velocity of wave packets in numerical solutions. For improvement of resolution of the shock a parameter function is introduced in compact scheme to control the group velocity. The newly developed method is simple. It has higher accuracy and less stencil of grid points.
An Improved Scalar Costa Scheme Based on Watson Perceptual Model
QI Kai-yue; CHEN Jian-bo; ZHOU Yi
2008-01-01
An improved scalar Costa scheme (SCS) was proposed by using improved Watson perceptual model to adaptively decide quantization step size and scaling factor. The improved scheme equals to embed hiding data based on an actual image. In order to withstand amplitude scaling attack, the Watson perceptual model was redefined, and the improved scheme using the new definition can insure quantization step size in decoder that is proportional to amplitude scaling attack factor. The performance of the improved scheme outperforms that of SCS with fixed quantization step size. The improved scheme combines information theory and visual model.
Improved EPRCA Congestion Control Scheme for ATM Networks
Dr. M.Sreenivasulu
2015-01-01
Full Text Available Traffic management and congestion control are major issues in Asynchronous Transfer Mode(ATM networks. Congestion arises when traffic in the network is more than offered load. The primary function of congestion control is to ensure good throughput and low delay performance while maintaining a fair allocation of network resources to users. In this paper, Enhanced Proportional Rate based Congestion Avoidance (EPRCA scheme proposed by ATM forum has been considered. But this scheme has limitation of higher cell drop problem for the bursty traffic. Improvements to EPRCA scheme have been proposed to reduce cell drop problem and results of improved EPRCA schemes were analyzed with basic EPRCA scheme.
On the security of arbitrated quantum signature schemes
Li, Qin; Wen, Zhonghua; Zhao, Weizhong; Chan, W H
2012-01-01
Due to potential capability of providing unconditional security, arbitrated quantum signature (AQS) schemes, whose implementation depends on the participation of a trusted third party, received intense attention in the past decade. Recently, some typical AQS schemes were cryptanalyzed and improved. In this paper, we analyze security property of some AQS schemes and show that all the previous AQS schemes, no matter original or improved, are still insecure in the sense that the messages and the corresponding signatures can be exchanged among different receivers, allowing the receivers to deny accepting the signature of an appointed message. Some further improvement methods on the AQS schemes are also discussed.
A Proxy Blind Signature Scheme Based on ECDLP
WANGHaiyan; WANGRuchuan
2005-01-01
While proxy signature scheme enables an original signer to fully authorize a proxy to sign a message on his or her behalf legally and undeniably, blind signature scheme keeps the message blind from the signer so that the signer cannot make a linkage between the signature and the identity of requester (receiver). Both schemes have been widely applied in the electronic business. A new ECDLP (Elliptic curve discrete problem)-based proxy blind signature scheme is to be proposed in this paper by integrating the security properties of both schemes.
A Hybrid MacCormack-type Scheme for Computational Aeroacoustics
Yazdani, Soroush
A new type of MacCormack scheme, using a modified Low Dissipation and Dispersion Runge-Kutta time marching method, is presented. This scheme is using two stages in every step which implements biased spatial differencing stencils and for the remaining stages uses non-dissipative central differencing stencils. Because of using the MacCormack-type scheme in this method, the new scheme carries an inherent artificial dissipation which uses the ease of implementing boundary condition specifications of a two-stage MacCormack scheme.
A group signature scheme based on quantum teleportation
Wen Xiaojun; Tian Yuan; Ji Liping; Niu Xiamu, E-mail: wxjun36@gmail.co [Information Countermeasure Technique Research Institute, Harbin Institute of Technology, Harbin 150001 (China)
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.
Quantum election scheme based on anonymous quantum key distribution
Zhou Rui-Rui; Yang Li
2012-01-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.
A new threshold signature scheme based on fuzzy biometric identity
Yongquan Cai; Ke Zhang
2009-01-01
The focus of this paper is to present the first threshold signature scheme based on biometric identity, which is acquired from a recently proposed fuzzy identities-based encryption scheme. An important feature of this scheme, which is different from other previous ID-based threshold signature schemes, is that it can be applied to situations using not only average personal attributes in social contact but also people's noisy biometric inputs as identities. The security of our scheme in the selective-lD model reduces the limit in the hardness of the Decisional BDH Assumption.
Sound classification of dwellings - Comparison of schemes in Europe
Rasmussen, Birgit
2009-01-01
National sound classification schemes for dwellings exist in nine countries in Europe, and proposals are under preparation in more countries. The schemes specify class criteria concerning several acoustic aspects, the main criteria being about airborne and impact sound insulation between dwellings......, facade sound insulation and installation noise. The quality classes reflect dierent levels of acoustical comfort. The paper presents and compares the sound classification schemes in Europe. The schemes have been implemented and revised gradually since the 1990es. However, due to lack of coordination....... The current variety of descriptors and classes also causes trade barriers. Thus, there is a need to harmonize concepts and other characteristics of the schemes....
A new modified remote user authentication scheme using smart cards
SHEN Zhong-hua
2008-01-01
In 2000, a remote user authentication scheme using smart cards was proposed and the masquerade attacks were proved successful on this scheme. Recently, Kumar has suggested the idea of check digits to overcome the above attacks with a new scheme that removes these threats well. In this paper it is pointed out that the weakness still exists in Kumar's scheme, and the intruder can login to the remote system through having some information. A new scheme which can overcome these attacks and appears more secure and efficient than Kumar's is presented.
On the security of arbitrated quantum signature schemes
Li, Qin; Li, Chengqing; Wen, Zhonghua; Zhao, Weizhong; Chan, Wai Hong
2013-01-01
Due to the potential capability of providing unconditional security, arbitrated quantum signature (AQS) schemes, whose implementation depends on the participation of a trusted third party, received intense attention in the past decade. Recently, some typical AQS schemes were cryptanalyzed and improved. In this paper, we analyze the security property of some AQS schemes and show that all the previous AQS schemes, no matter whether original or improved, are still insecure in the sense that the messages and the corresponding signatures can be exchanged among different receivers, allowing the receivers to deny having accepted the signature of an appointed message. Some further improved methods on the AQS schemes are also discussed.
Enhanced arbitrated quantum signature scheme using Bell states
Wang, Chao; Liu, Jian-Wei; Shang, Tao
2014-06-01
We investigate the existing arbitrated quantum signature schemes as well as their cryptanalysis, including intercept-resend attack and denial-of-service attack. By exploring the loopholes of these schemes, a malicious signatory may successfully disavow signed messages, or the receiver may actively negate the signature from the signatory without being detected. By modifying the existing schemes, we develop counter-measures to these attacks using Bell states. The newly proposed scheme puts forward the security of arbitrated quantum signature. Furthermore, several valuable topics are also presented for further research of the quantum signature scheme.
AN IMPROVED REMOTE PASSWORD AUTHENTICATION SCHEME WITH SMART CARD
Jing Chao
2012-01-01
This paper analyzes the security performance of a latest proposed remote two-factor user authentication scheme and proposes an improved scheme based on the dynamic ID to avoid the attacks it suffers.Besides this,in our proposed scheme the password is no longer involved in the calculation of verification phase which makes our scheme more secure and costs less than the old one.At last we analyze the performance of our proposed scheme to prove it provides mutual authentication between the user and the server.Moreover,it also resists password guessing attack,server and user masquerade attack and replay attack effectively.
ON THE CENTRAL RELAXING SCHEMES I:SINGLE CONSERVATION LAWS
Hua-zhong Tang
2000-01-01
In this first paper we present a central relaxing scheme for scalar conservation laws, based on using the local relaxation approximation. Our scheme is obtained without using linear or nonlinear Riemann solvers. A cell entropy inequality is studied for the semidiscrete central relaxing scheme, and a second order MUSCL scheme is shown to be TVD in the zero relaxation limit. The next paper will extend the central relaxing scheme to multi-dimensional systems of conservation laws in curvilinear coordinates, including numerical experiments for 1D and 2D problems.
On the monotonicity of multidimensional finite difference schemes
Kovyrkina, O.; Ostapenko, V.
2016-10-01
The classical concept of monotonicity, introduced by Godunov for linear one-dimensional difference schemes, is extended to multidimensional case. Necessary and sufficient conditions of monotonicity are obtained for linear multidimensional difference schemes of first order. The constraints on the numerical viscosity are given that ensure the monotonicity of a difference scheme in the multidimensional case. It is proposed a modification of the second order multidimensional CABARET scheme that preserves the monotonicity of one-dimensional discrete solutions and, as a result, ensures higher smoothness in the computation of multidimensional discontinuous solutions. The results of two-dimensional test computations illustrating the advantages of the modified CABARET scheme are presented.
Scheme Transformations in the Vicinity of an Infrared Fixed Point
Ryttov, Thomas; Shrock, Robert
2012-01-01
We analyze the effect of scheme transformations in the vicinity of an exact or approximate infrared fixed point in an asymptotically free gauge theory with fermions. We show that there is far less freedom in carrying out such scheme transformations in this case than at an ultraviolet fixed point....... We construct a transformation from the $\\bar{MS}$ scheme to a scheme with a vanishing three-loop term in the $\\beta$ function and use this to assess the scheme dependence of an infrared fixed point in SU($N$) theories with fermions. Implications for the anomalous dimension of the fermion bilinear...
Assessment of shock capturing schemes for discontinuous Galerkin method
于剑; 阎超; 赵瑞
2014-01-01
This paper carries out systematical investigations on the performance of several typical shock-capturing schemes for the discontinuous Galerkin (DG) method, including the total variation bounded (TVB) limiter and three artificial diffusivity schemes (the basis function-based (BF) scheme, the face residual-based (FR) scheme, and the element residual-based (ER) scheme). Shock-dominated flows (the Sod problem, the Shu-Osher problem, the double Mach reflection problem, and the transonic NACA0012 flow) are considered, addressing the issues of accuracy, non-oscillatory property, dependence on user-specified constants, resolution of discontinuities, and capability for steady solutions. Numerical results indicate that the TVB limiter is more eﬃcient and robust, while the artificial diffusivity schemes are able to preserve small-scale flow structures better. In high order cases, the artificial diffusivity schemes have demonstrated superior performance over the TVB limiter.
Improved Butterfly Subdivision Scheme for Meshes with Arbitrary Topology
ZHANG Hui; MA Yong-you; ZHANG Cheng; JIANG Shou-wei
2005-01-01
Based on the butterfly subdivision scheme and the modified butterfly subdivision scheme, an improved butterfly subdivision scheme is proposed. The scheme uses a small stencil of six points to calculate new inserting vertex, 2n new vertices are inserted in the 2n triangle faces in each recursion, and the n old vertices are kept, special treatment is given to the boundary, achieving higher smoothness while using small stencils is realized. With the proposed scheme, the number of triangle faces increases only by a factor of 3 in each refinement step. Compared with the butterfly subdivision scheme and the modified butterfly subdivision scheme, the size of triangle faces changes more gradually, which allows one to have greater control over the resolution of a refined mesh.
Multisymplectic five-point scheme for the nonlinear wave equation
WANG Yushun; WANG Bin; YANG Hongwei; WANG Yunfeng
2003-01-01
In this paper, we introduce the multisymplectic structure of the nonlinear wave equation, and prove that the classical five-point scheme for the equation is multisymplectic. Numerical simulations of this multisymplectic scheme on highly oscillatory waves of the nonlinear Klein-Gordon equation and the collisions between kink and anti-kink solitons of the sine-Gordon equation are also provided. The multisymplectic schemes do not need to discrete PDEs in the space first as the symplectic schemes do and preserve not only the geometric structure of the PDEs accurately, but also their first integrals approximately such as the energy, the momentum and so on. Thus the multisymplectic schemes have better numerical stability and long-time numerical behavior than the energy-conserving scheme and the symplectic scheme.
Forward-Secure Multisignature, Threshold Signature and Blind Signature Schemes
Jia Yu
2010-06-01
Full Text Available Forward-secure signatures are proposed to tackle the key exposure problem, in which the security of all signatures prior to key leakage is still kept even if the secret key leaks. In this paper, we construct two forward-secure multisignature schemes, one forward-secure threshold signature scheme, and one forward-secure blind signature scheme. Our constructions are based on the recently proposed forward-secure signature scheme from bilinear maps in [11]. Our constructions are very efficient and useful thanks to the elegant structure of the base scheme. Such schemes play an important role in many electronic applications such as cryptographic election systems, digital cash schemes, and e-cheques.
A simple language to script and simulate breeding schemes: the breeding scheme language
It is difficult for plant breeders to determine an optimal breeding strategy given that the problem involves many factors, such as target trait genetic architecture and breeding resource availability. There are many possible breeding schemes for each breeding program. Although simulation study may b...
Buckley's Scheme of Schemes as a Foundation for Teaching Family Systems Theory.
Duncan, Barry L.; Fraser, J. Scott
1987-01-01
Urges emphasis on the development of a strong system theory base upon which future practitioners and researchers can build. Advocates the use of Buckley's hierarchical scheme as a teaching tool to provide an understandable, yet broadly applicable, theory base for graduate students in an introductory family therapy course. Outlines an effective…
Dijk, van W.F.A.; Lokhorst, A.M.; Berendse, F.; Snoo, de G.R.
2015-01-01
The effectiveness of agri-environment schemes (AES) in enhancing biodiversity on farmland and creating a long-lasting change in farmers’ motivation towards a more environmental-friendly practice is still strongly debated. Applying a regional approach has been advocated widely to make AES more ecolog
The Performance-based Funding Scheme of Universities
Juha KETTUNEN
2016-05-01
Full Text Available The purpose of this study is to analyse the effectiveness of the performance-based funding scheme of the Finnish universities that was adopted at the beginning of 2013. The political decision-makers expect that the funding scheme will create incentives for the universities to improve performance, but these funding schemes have largely failed in many other countries, primarily because public funding is only a small share of the total funding of universities. This study is interesting because Finnish universities have no tuition fees, unlike in many other countries, and the state allocates funding based on the objectives achieved. The empirical evidence of the graduation rates indicates that graduation rates increased when a new scheme was adopted, especially among male students, who have more room for improvement than female students. The new performance-based funding scheme allocates the funding according to the output-based indicators and limits the scope of strategic planning and the autonomy of the university. The performance-based funding scheme is transformed to the strategy map of the balanced scorecard. The new funding scheme steers universities in many respects but leaves the research and teaching skills to the discretion of the universities. The new scheme has also diminished the importance of the performance agreements between the university and the Ministry. The scheme increases the incentives for universities to improve the processes and structures in order to attain as much public funding as possible. It is optimal for the central administration of the university to allocate resources to faculties and other organisational units following the criteria of the performance-based funding scheme. The new funding scheme has made the universities compete with each other, because the total funding to the universities is allocated to each university according to the funding scheme. There is a tendency that the funding schemes are occasionally
An efficient compression scheme for bitmap indices
Wu, Kesheng; Otoo, Ekow J.; Shoshani, Arie
2004-04-13
When using an out-of-core indexing method to answer a query, it is generally assumed that the I/O cost dominates the overall query response time. Because of this, most research on indexing methods concentrate on reducing the sizes of indices. For bitmap indices, compression has been used for this purpose. However, in most cases, operations on these compressed bitmaps, mostly bitwise logical operations such as AND, OR, and NOT, spend more time in CPU than in I/O. To speedup these operations, a number of specialized bitmap compression schemes have been developed; the best known of which is the byte-aligned bitmap code (BBC). They are usually faster in performing logical operations than the general purpose compression schemes, but, the time spent in CPU still dominates the total query response time. To reduce the query response time, we designed a CPU-friendly scheme named the word-aligned hybrid (WAH) code. In this paper, we prove that the sizes of WAH compressed bitmap indices are about two words per row for large range of attributes. This size is smaller than typical sizes of commonly used indices, such as a B-tree. Therefore, WAH compressed indices are not only appropriate for low cardinality attributes but also for high cardinality attributes.In the worst case, the time to operate on compressed bitmaps is proportional to the total size of the bitmaps involved. The total size of the bitmaps required to answer a query on one attribute is proportional to the number of hits. These indicate that WAH compressed bitmap indices are optimal. To verify their effectiveness, we generated bitmap indices for four different datasets and measured the response time of many range queries. Tests confirm that sizes of compressed bitmap indices are indeed smaller than B-tree indices, and query processing with WAH compressed indices is much faster than with BBC compressed indices, projection indices and B-tree indices. In addition, we also verified that the average query response time
An improved SPH scheme for cosmological simulations
Beck, A M; Arth, A; Remus, R -S; Teklu, A F; Donnert, J M F; Planelles, S; Beck, M C; Foerster, P; Imgrund, M; Dolag, K; Borgani, S
2015-01-01
We present an implementation of smoothed particle hydrodynamics (SPH) with improved accuracy for simulations of galaxies and the large-scale structure. In particular, we combine, implement, modify and test a vast majority of SPH improvement techniques in the latest instalment of the GADGET code. We use the Wendland kernel functions, a particle wake-up time-step limiting mechanism and a time-dependent scheme for artificial viscosity, which includes a high-order gradient computation and shear flow limiter. Additionally, we include a novel prescription for time-dependent artificial conduction, which corrects for gravitationally induced pressure gradients and largely improves the SPH performance in capturing the development of gas-dynamical instabilities. We extensively test our new implementation in a wide range of hydrodynamical standard tests including weak and strong shocks as well as shear flows, turbulent spectra, gas mixing, hydrostatic equilibria and self-gravitating gas clouds. We jointly employ all modi...
Study on Training Scheme for New Farmers
2012-01-01
Farmers play an important role in agricultural modernization,and farmers’quality directly influence the agricultural modernization drive. We analyzed basic situations and existing problems of farmers,including lack of consciousness as a master,cultural awareness,market awareness,skill awareness,and democracy and legal awareness.To build new farmers,we put forward multi-channel and comprehensive training schemes,including enhancing leadership,making clear objective,and giving top priority to subjects;increasing fund input and perfecting new farmer training system;focusing on economic development and combining with new socialist countryside construction;training by classification to improve overall qualities of different level farmers;combining many cultivation ways to improve the overall training effect.
Secured Data Transmission Using Video Steganographic Scheme
B.suneetha
2014-07-01
Full Text Available Steganography is the art of hiding information in ways that avert the revealing of hiding messages. Video Steganography is focused on spatial and transform domain. Spatial domain algorithm directly embedded information in the cover image with no visual changes. This kind of algorithms has the advantage in Steganography capacity, but the disadvantage is weak robustness. Transform domain algorithm is embedding the secret information in the transform space. This kind of algorithms has the advantage of good stability, but the disadvantage of small capacity. These kinds of algorithms are vulnerable to steganalysis. This paper proposes a new Compressed Video Steganographic scheme. The data is hidden in the horizontal and the vertical components of the motion vectors. The PSNR value is calculated so that the quality of the video after the data hiding is evaluated.
Task analysis of laparoscopic camera control schemes.
Ellis, R Darin; Munaco, Anthony J; Reisner, Luke A; Klein, Michael D; Composto, Anthony M; Pandya, Abhilash K; King, Brady W
2016-12-01
Minimally invasive surgeries rely on laparoscopic camera views to guide the procedure. Traditionally, an expert surgical assistant operates the camera. In some cases, a robotic system is used to help position the camera, but the surgeon is required to direct all movements of the system. Some prior research has focused on developing automated robotic camera control systems, but that work has been limited to rudimentary control schemes due to a lack of understanding of how the camera should be moved for different surgical tasks. This research used task analysis with a sample of eight expert surgeons to discover and document several salient methods of camera control and their related task contexts. Desired camera placements and behaviours were established for two common surgical subtasks (suturing and knot tying). The results can be used to develop better robotic control algorithms that will be more responsive to surgeons' needs. Copyright © 2015 John Wiley & Sons, Ltd. Copyright © 2015 John Wiley & Sons, Ltd.
VAT Cash Accounting Scheme in Romania
BUNEA-BONTAS Cristina Aurora
2013-05-01
Full Text Available VAT cash accounting enables the small enterprises to account for VAT on the basis of payments received and made, instead of on tax invoices issued and received. Accordingly, the VAT payable or repayable for each accounting period is the difference between the total amount of VAT included in payments received from the customers and the total amount of VAT included in payments made to the suppliers. The VAT cash accounting scheme, recently introduced for the Romanian companies by Government Ordinance no. 15/2012, entered into force on January 1st, 2013. This article reviews the basic principles of VAT cash accounting and highlights its benefits and disadvantages. It also discusses the impact and the challenges for the Romanian companies, due to the particularities of the system.
Interference Phenomenon for Different Chiral Bosonization Schemes
Abreu, Everton M C; Abreu, Everton M C; Wotzasek, Clovis
1998-01-01
We study the relationship between different chiral bosonization schemes (CBS) in the context of the soldering formalism\\cite{MS}, that considers the phenomenon of interference in the quantum field theory\\cite{ABW}. This analysis is done in the framework put forward by Siegel\\cite{WS} and by Floreanini and Jackiw\\cite{FJ} (FJ). We propose a field redefinition that discloses the presence of a noton, a non dynamical field, in Siegel's formulation for chiral bosons. The presence of a noton in the Siegel CBS is a new and surprising result, that separates dynamics from symmetry by diagonalising the Siegel action into the FJ and the noton action. While the first describes the chiral dynamics, the noton carries the symmetry contents, acquiring dynamics upon quantization and is fully responsible for the Siegel anomaly. The diagonal representation proposed here is used to study the effect of quantum interference between gauged rightons and leftons.
Nonlinear Interpolation and Total Variation Diminishing Schemes
Dubois, François
2010-01-01
The Van Leer approach for the approximation of nonlinear scalar conservation laws is studied in one space dimension. The problem can be reduced to a nonlinear interpolation and we propose a convexity property for the interpolated values. We prove that under general hypotheses the method of lines in well posed in $\\ ell^{\\infty} \\cap {\\rm BV} $ and we give precise sufficient conditions to establish that the total variation is diminishing. We observe that the second order accuracy can be maintained even at non sonic extrema. We establish also that both the TVD property and second order accuracy can be maintained after discretization in time with the second order accurate Heun scheme. Numerical illustration for the advection equation is presented.
Efficient Conservative Reformulation Schemes for Lithium Intercalation
Urisanga, PC; Rife, D; De, S; Subramanian, VR
2015-02-18
Porous electrode theory coupled with transport and reaction mechanisms is a widely used technique to model Li-ion batteries employing an appropriate discretization or approximation for solid phase diffusion with electrode particles. One of the major difficulties in simulating Li-ion battery models is the need to account for solid phase diffusion in a second radial dimension r, which increases the computation time/cost to a great extent. Various methods that reduce the computational cost have been introduced to treat this phenomenon, but most of them do not guarantee mass conservation. The aim of this paper is to introduce an inherently mass conserving yet computationally efficient method for solid phase diffusion based on Lobatto III A quadrature. This paper also presents coupling of the new solid phase reformulation scheme with a macro-homogeneous porous electrode theory based pseudo 20 model for Li-ion battery. (C) The Author(s) 2015. Published by ECS. All rights reserved.
Pay-what-you-want pricing schemes
Kahsay, Goytom Abraha; Samahita, Margaret
Pay-What-You-Want (PWYW) pricing schemes are becoming increasingly popular in a wide range of industries. We develop a model incorporating self-image into the buyer's utility function and introduce heterogeneity in consumption utility and image-sensitivity, which generates different purchase...... decisions and optimal prices across individuals. When a good is sold at a fixed price higher than a threshold value, a price that the individual thinks is fair, the adoption of PWYW increases his utility and hence results in a weakly higher purchase rate. When a good is sold at a fixed price lower than...... this threshold, however, PWYW can lead to a lower utility. This may result in a lower purchase rate and higher average price, in line with previously unexplained evidence from field experiments. Moreover, an increase in the threshold value decreases the buyer's utility and may further lower the purchase rate...
Doping Scheme of Semiconducting Atomic Chains
Toshishige, Yamada; Saini, Subhash (Technical Monitor)
1998-01-01
Atomic chains, precise structures of atomic scale created on an atomically regulated substrate surface, are candidates for future electronics. A doping scheme for intrinsic semiconducting Mg chains is considered. In order to suppress the unwanted Anderson localization and minimize the deformation of the original band shape, atomic modulation doping is considered, which is to place dopant atoms beside the chain periodically. Group I atoms are donors, and group VI or VII atoms are acceptors. As long as the lattice constant is long so that the s-p band crossing has not occurred, whether dopant atoms behave as donors or acceptors is closely related to the energy level alignment of isolated atomic levels. Band structures are calculated for Br-doped (p-type) and Cs-doped (n-type) Mg chains using the tight-binding theory with universal parameters, and it is shown that the band deformation is minimized and only the Fermi energy position is modified.
Combined Control Scheme for Monitoring Quality Characteristics
Adekeye K.S.
2014-07-01
Full Text Available In the literature, the Exponentially Weighted Moving Average (EWMA and Exponentially Weighted Moving Variance (EMWV control schemes have been used separately to monitor the process average and process variability respectively. Here the two are combined and applied on simulated process with different level of variation. The control limit interval (CLI and the average run length (ARL were evaluated for the combined chart. The combined chart performed better than the two independently. Furthermore, an algorithm was developed for the two control charts and implemented on visual basic VB6.0. The obtained results show that the combined EWMA and EWMV control chart is very sensitive in detecting shift in production process and every shift in the process mean is always preceded by shift in the process variability.
New CERN Health Insurance Scheme (CHIS) forms
HR Department
2015-01-01
New versions of the following forms for claims and requests to the CERN Health Insurance Scheme (CHIS) have been released: form for claiming reimbursement of medical expenses, form for requesting advance reimbursement, and dental estimate form (for treatments foreseen to exceed 800 CHF). The new forms are available in French and English. They can either be completed electronically before being printed and signed, or completed in paper form. New detailed instructions can be found at the back of the claim form; CHIS members are invited to read them carefully. The electronic versions (PDF) of all the forms are available on the CHIS website and on the UNIQA Member Portal. CHIS Members are requested to use these new forms forthwith and to discard any previous version. Questions regarding the above should be addressed directly to UNIQA (72730 or 022.718 63 00 or uniqa.assurances@cern.ch).
A Reduced-Complexity Mixer Linearization Scheme
Paul A. Warr
2009-01-01
Full Text Available Measurement results of the signals emanating from both IF and LO ports of a double balanced mixer are presented, and, thus, it is shown that the linearization of the output in a down-converting mixer by the summation of the IF signal and the signal emanating from the LO or RF port is feasible. Feedforward-based architectures for the linearization of down-conversion mixers are introduced that exploit this phenomenon, and linearity performance results of the frequency translation of both two-tone and TETRA-modulated signals are presented. This technique employs only a single mixer and hence overcomes the complexity of other mixer linearization schemes. The overall processing gain of the system is limited by the level of wanted signal present in the error signal.
Quantum attack-resistent certificateless multi-receiver signcryption scheme.
Huixian Li
Full Text Available The existing certificateless signcryption schemes were designed mainly based on the traditional public key cryptography, in which the security relies on the hard problems, such as factor decomposition and discrete logarithm. However, these problems will be easily solved by the quantum computing. So the existing certificateless signcryption schemes are vulnerable to the quantum attack. Multivariate public key cryptography (MPKC, which can resist the quantum attack, is one of the alternative solutions to guarantee the security of communications in the post-quantum age. Motivated by these concerns, we proposed a new construction of the certificateless multi-receiver signcryption scheme (CLMSC based on MPKC. The new scheme inherits the security of MPKC, which can withstand the quantum attack. Multivariate quadratic polynomial operations, which have lower computation complexity than bilinear pairing operations, are employed in signcrypting a message for a certain number of receivers in our scheme. Security analysis shows that our scheme is a secure MPKC-based scheme. We proved its security under the hardness of the Multivariate Quadratic (MQ problem and its unforgeability under the Isomorphism of Polynomials (IP assumption in the random oracle model. The analysis results show that our scheme also has the security properties of non-repudiation, perfect forward secrecy, perfect backward secrecy and public verifiability. Compared with the existing schemes in terms of computation complexity and ciphertext length, our scheme is more efficient, which makes it suitable for terminals with low computation capacity like smart cards.
Efficient and Anonymous Authentication Scheme for Wireless Body Area Networks.
Wu, Libing; Zhang, Yubo; Li, Li; Shen, Jian
2016-06-01
As a significant part of the Internet of Things (IoT), Wireless Body Area Network (WBAN) has attract much attention in this years. In WBANs, sensors placed in or around the human body collect the sensitive data of the body and transmit it through an open wireless channel in which the messages may be intercepted, modified, etc. Recently, Wang et al. presented a new anonymous authentication scheme for WBANs and claimed that their scheme can solve the security problems in the previous schemes. Unfortunately, we demonstrate that their scheme cannot withstand impersonation attack. Either an adversary or a malicious legal client could impersonate another legal client to the application provider. In this paper, we give the detailed weakness analysis of Wang et al.'s scheme at first. Then we present a novel anonymous authentication scheme for WBANs and prove that it's secure under a random oracle model. At last, we demonstrate that our presented anonymous authentication scheme for WBANs is more suitable for practical application than Wang et al.'s scheme due to better security and performance. Compared with Wang et al.'s scheme, the computation cost of our scheme in WBANs has reduced by about 31.58%.
Quantum attack-resistent certificateless multi-receiver signcryption scheme.
Li, Huixian; Chen, Xubao; Pang, Liaojun; Shi, Weisong
2013-01-01
The existing certificateless signcryption schemes were designed mainly based on the traditional public key cryptography, in which the security relies on the hard problems, such as factor decomposition and discrete logarithm. However, these problems will be easily solved by the quantum computing. So the existing certificateless signcryption schemes are vulnerable to the quantum attack. Multivariate public key cryptography (MPKC), which can resist the quantum attack, is one of the alternative solutions to guarantee the security of communications in the post-quantum age. Motivated by these concerns, we proposed a new construction of the certificateless multi-receiver signcryption scheme (CLMSC) based on MPKC. The new scheme inherits the security of MPKC, which can withstand the quantum attack. Multivariate quadratic polynomial operations, which have lower computation complexity than bilinear pairing operations, are employed in signcrypting a message for a certain number of receivers in our scheme. Security analysis shows that our scheme is a secure MPKC-based scheme. We proved its security under the hardness of the Multivariate Quadratic (MQ) problem and its unforgeability under the Isomorphism of Polynomials (IP) assumption in the random oracle model. The analysis results show that our scheme also has the security properties of non-repudiation, perfect forward secrecy, perfect backward secrecy and public verifiability. Compared with the existing schemes in terms of computation complexity and ciphertext length, our scheme is more efficient, which makes it suitable for terminals with low computation capacity like smart cards.
On the Security of Some Aggregate Signature Schemes
Baoyuan Kang
2012-01-01
Full Text Available Aggregate signature scheme proposed by Boneh, Gentry, Lynn, and Shacham allows n signatures on n distinct messages from n distinct users to aggregate a single signature that convince any verifier that n users did indeed sign the n messages, respectively. The main benefit of such schemes is that they allow bandwidth and computational savings. In this paper, we question about whether the existing aggregate signature schemes satisfy the basic property that they can convince any verifier that every user indeed signed the message which should be signed by him. We show that Rückert et al.’s scheme, and Shim’s scheme do not satisfy the property. As a comparison, we investigate Boneh et al.’s scheme and show that under the assumption that each signer correctly signs one message, Boneh et al.’s scheme satisfies this property under two users' setting. Furthermore, we propose the concept of inside attack on aggregate signatures and give an improved aggregate signature scheme based on Shim’s scheme. We also prove that the improved scheme is secure against inside attack.
Security analysis and improvements of arbitrated quantum signature schemes
Zou, Xiangfu; Qiu, Daowen
2010-10-01
A digital signature is a mathematical scheme for demonstrating the authenticity of a digital message or document. For signing quantum messages, some arbitrated quantum signature (AQS) schemes have been proposed. It was claimed that these AQS schemes could guarantee unconditional security. However, we show that they can be repudiated by the receiver Bob. To conquer this shortcoming, we construct an AQS scheme using a public board. The AQS scheme not only avoids being disavowed by the receiver but also preserves all merits in the existing schemes. Furthermore, we discover that entanglement is not necessary while all these existing AQS schemes depend on entanglement. Therefore, we present another AQS scheme without utilizing entangled states in the signing phase and the verifying phase. This scheme has three advantages: it does not utilize entangled states and it preserves all merits in the existing schemes; the signature can avoid being disavowed by the receiver; and it provides a higher efficiency in transmission and reduces the complexity of implementation.
A High Resolution Low Dissipation Hybrid Scheme for Compressible Flows
YU Jian; YAN Chao; JIANG Zhenhua
2011-01-01
In this paper,an efficient hybrid shock capturing scheme is proposed to obtain accurate results both in the smooth region and around discontinuities for compressible flows.The hybrid algorithm is based on a fifth-order weighted essentially non-oscillatory (WENO) scheme in the finite volume form to solve the smooth part of the flow field,which is coupled with a characteristic-based monotone upstream-centered scheme for conservation laws(MUSCL) to capture discontinuities.The hybrid scheme is intended to combine high resolution of MUSCL scheme and low dissipation of WENO scheme.The two ingredients in this hybrid scheme are switched with an indicator.Three typical indicators are chosen and compared.MUSCL and WENO are both shock capturing schemes making the choice of the indicator parameter less crucial.Several test cases are carried out to investigate hybrid scheme with different indicators in terms of accuracy and efficiency.Numerical results demonstrate that the hybrid scheme in the present work performs well in a broad range of problems.
Market performance and environmental policy. Four tradeable permits schemes
Boom, J.T.; Duizendstraal, A.; De Jong, R.; Koster, J.M.M.; Nentjes, A.; Zhang, Z.X. [Department of Economics and Public Finance of the University of Groningen ECOF, Groningen (Netherlands); Van Buiren, K.; Van Es, G.A.; De Groot, A.W.M.; Velthuijsen, J.W. [Foundation for Economic Research of the University of Amsterdam SEO, Amsterdam (Netherlands); Van Duyse, P.; Heijnes, H. [Applied Environmental Economics TME, The Hague (Netherlands); Dijkgraaf, E.; Varkevisser, M. [Research Centre for Economic Policy OCfEB, Erasmus Universiteit, Rotterdam (Netherlands); Wiersma, D.
1998-08-01
Six feasible schemes of tradeable permits are presented and the cost savings arising from the application of such schemes instead of conventional policies have been calculated. In this background study four other schemes are discussed. The major reason for their separate presentation is twofold: there was insufficient statistical information available to calculate potential cost savings that are sufficiently reliable and further study is needed to determine the most appropriate design of the schemes. Only after the questions about cost savings and design have been answered it can be established whether indeed introduction of the schemes will improve environmental effectiveness and cost effectiveness of environmental policy. The schemes to be presented in the next sections are tradeable permits for winning sand, for mortar and cement, for noise control on industrial sites, for packaging materials and for heavy metals in waste water and sludge. 13 refs.
A novel quantum group signature scheme without using entangled states
Xu, Guang-Bao; Zhang, Ke-Jia
2015-07-01
In this paper, we propose a novel quantum group signature scheme. It can make the signer sign a message on behalf of the group without the help of group manager (the arbitrator), which is different from the previous schemes. In addition, a signature can be verified again when its signer disavows she has ever generated it. We analyze the validity and the security of the proposed signature scheme. Moreover, we discuss the advantages and the disadvantages of the new scheme and the existing ones. The results show that our scheme satisfies all the characteristics of a group signature and has more advantages than the previous ones. Like its classic counterpart, our scheme can be used in many application scenarios, such as e-government and e-business.
A Dynamic ID-based Remote User Authentication Scheme
Das, Manik Lal; Gulati, Ved P
2004-01-01
Password-based authentication schemes are the most widely used techniques for remote user authentication. Many static ID-based remote user authentication schemes both with and without smart cards have been proposed. Most of the schemes do not allow the users to choose and change their passwords, and maintain a verifier table to verify the validity of the user login. In this paper we present a dynamic ID-based remote user authentication scheme using smart cards. Our scheme allows the users to choose and change their passwords freely, and do not maintain any verifier table. The scheme is secure against ID-theft, and can resist the reply attacks, forgery attacks, guessing attacks, insider attacks and stolen verifier attacks.
A novel chaotic encryption scheme based on pseudorandom bit padding
Sadra, Yaser; Fard, Zahra Arasteh
2012-01-01
Cryptography is always very important in data origin authentications, entity authentication, data integrity and confidentiality. In recent years, a variety of chaotic cryptographic schemes have been proposed. These schemes has typical structure which performed the permutation and the diffusion stages, alternatively. The random number generators are intransitive in cryptographic schemes and be used in the diffusion functions of the image encryption for diffused pixels of plain image. In this paper, we propose a chaotic encryption scheme based on pseudorandom bit padding that the bits be generated by a novel logistic pseudorandom image algorithm. To evaluate the security of the cipher image of this scheme, the key space analysis, the correlation of two adjacent pixels and differential attack were performed. This scheme tries to improve the problem of failure of encryption such as small key space and level of security.
An Efficient Receiver Deniable Encryption Scheme and Its Applications
Bo Meng
2010-06-01
Full Text Available Deniable encryption is an important cryptographic primitive, essential in all cryptographic protocols where a coercive adversary comes to play with high potential. Deniable encryption plays a key role in the internet/electronic voting, electronic bidding, electronic auctions and secure multiparty computation. In this study a practical efficient receiver deniable encryption scheme based on BCP commitment scheme and idea of Klonowski et al. is proposed. The proposed scheme is a one-move scheme without any pre-encryption information required to be sent between the sender and the receiver prior to encryption. Moreover, the overhead is low in term of the size of the ciphertext. At the same time we compare the typical deniable encryption schemes with our proposed scheme. Finally, applying the proposed deniable encryption, we originally give a coercion-resistant internet voting model without physical assumptions. We also compare the typical internet voting protocols with our proposed model.
An arbitrated quantum signature scheme with fast signing and verifying
Liu, Feng; Qin, Su-Juan; Su, Qi
2013-11-01
Existing arbitrated quantum signature (AQS) schemes are almost all based on the Leung quantum one-time pad (L-QOTP) algorithm. In these schemes, the receiver can achieve an existential forgery of the sender's signatures under the known message attack, and the sender can successfully disavow any of her/his signatures by a simple attack. In this paper, a solution of solving the problems is given, through designing a new QOTP algorithm relying largely on inserting decoy states into fixed insertion positions. Furthermore, we present an AQS scheme with fast signing and verifying, which is based on the new QOTP algorithm. It is just using single particle states and is unconditional secure. To fulfill the functions of AQS schemes, our scheme needs a significantly lower computational costs than that required by other AQS schemes based on the L-QOTP algorithm.
A New Efficient Certificate-Based Signature Scheme
ZHANG Yichen; LI Jiguo; WANG Zhiwei; YAO Wei
2015-01-01
Certificate-based cryptography is a new kind of public key algorithm, which combines the merits of traditional Public key infrastructure (PKI) and identity-based cryptography. It removes the inherent key escrow problem in the identity-based cryptography and eliminates the certificate revocation problem and third-party queries in the traditional PKI. In this paper, we propose an effi-cient certificate-based signature scheme based on bilinear pairings. Under the strong security model of certificate-based signature scheme, we prove that our scheme is exis-tentially unforgeable against adaptive chosen message and identity attacks in the random oracle. In our scheme, only two pairing operations are needed in the signing and ver-ification processes. Compared with some certificate-based signature schemes from bilinear pairings, our scheme en-joys more advantage in computational cost and communi-cational cost.
Developing High-Order Weighted Compact Nonlinear Schemes
Deng, Xiaogang; Zhang, Hanxin
2000-11-01
The weighted technique is introduced in the compact high-order nonlinear schemes (CNS) and three fourth- and fifth-order weighted compact nonlinear schemes (WCNS) are developed in this paper. By Fourier analysis, the dissipative and dispersive features of WCNS are discussed. In view of the modified wave number, the WCNS are equivalent to fifth-order upwind biased explicit schemes in smooth regions and the interpolations at cell-edges dominate the properties of WCNS. Both flux difference splitting and flux vector splitting methods can be applied in WCNS, though they are finite difference schemes. Boundary and near boundary schemes are developed and the asymptotic stability of WCNS is analyzed. Several numerical results are given which show the good performances of WCNS for discontinuity capture high accuracy for boundary layer calculation, and good convergent rate. We also compare WCNS with MUSCL scheme and spectral solutions. WCNS are more accurate than MUSCL, as expected, especially for heat transfer calculations.
Adaptive Image Transmission Scheme over Wavelet-Based OFDM System
GAOXinying; YUANDongfeng; ZHANGHaixia
2005-01-01
In this paper an adaptive image transmission scheme is proposed over Wavelet-based OFDM (WOFDM) system with Unequal error protection (UEP) by the design of non-uniform signal constellation in MLC. Two different data division schemes: byte-based and bitbased, are analyzed and compared. Different bits are protected unequally according to their different contribution to the image quality in bit-based data division scheme, which causes UEP combined with this scheme more powerful than that with byte-based scheme. Simulation results demonstrate that image transmission by UEP with bit-based data division scheme presents much higher PSNR values and surprisingly better image quality. Furthermore, by considering the tradeoff of complexity and BER performance, Haar wavelet with the shortest compactly supported filter length is the most suitable one among orthogonal Daubechies wavelet series in our proposed system.
Using Sloane Rulers for Optimal Recovery Schemes in Distributed Computing
R. Delhi Babu
2009-12-01
Full Text Available Clusters and distributed systems offer fault tolerance and high performance through load sharing, and are thus attractive in real-time applications. When all computers are up and running, we would like the load to be evenly distributed among the computers. When one or more computers fail, the load must be redistributed. The redistribution is determined by the recovery scheme. The recovery scheme should keep the load as evenly distributed as possible even when the most unfavorable combinations of computers break down, i.e., we want to optimize the worst-case behavior. In this paper we compare the worst-case behavior of schemes such as Modulo ruler, Golomb ruler, Greedy sequence and Log sequence with worst-case behavior of Sloane sequence. Finally we observe that Sloane scheme performs better than all the other schemes. Keywords: Fault tolerance; High performance computing; Cluster technique; Recovery schemes; Sloane sequence;
International proposal for an acoustic classification scheme for dwellings
Rasmussen, Birgit
2014-01-01
Acoustic classification schemes specify different quality levels for acoustic conditions. Regulations and classification schemes for dwellings typically include criteria for airborne and impact sound insulation, façade sound insulation and service equipment noise. However, although important...... European countries have introduced classification schemes. The schemes typically include four classes. Comparative studies have shown significant discrepancies between countries due to national development of schemes. The diversity is an obstacle for exchange of construction experience for different...... classes, implying also trade barriers. Thus, a harmonized classification scheme would be useful, and the European COST Action TU0901 "Integrating and Harmonizing Sound Insulation Aspects in Sustainable Urban Housing Constructions", running 2009-2013 with members from 32 countries, including three overseas...
Cost-based droop scheme for DC microgrid
Nutkani, Inam Ullah; Wang, Peng; Loh, Poh Chiang
2014-01-01
voltage level, less on optimized operation and control of generation sources. The latter theme is perused in this paper, where cost-based droop scheme is proposed for distributed generators (DGs) in DC microgrids. Unlike traditional proportional power sharing based droop scheme, the proposed scheme...... considers the generation costs of DGs and dynamically tunes their droop gradients to produce more power from less costly DGs and vice versa. The proposed scheme is fully autonomous, simple to implement in dispatchable and non-dispatchable sources coupled with storage, support islanded and grid......-connected operation. Most importantly, the proposed scheme can reduce overall total generation cost in DC microgrids without centralized controller and communication links. The performance of the proposed scheme has been verified under different load conditions....
Identity-based signature scheme based on quadratic residues
CHAI ZhenChuan; CAO ZhenFu; DONG XiaoLei
2007-01-01
Identity-based (ID-based) cryptography has drawn great concerns in recent years, and most of ID-based schemes are constructed from bilinear parings. Therefore, ID-based scheme without pairing is of great interest in the field of cryptography. Up to now,there still remains a challenge to construct ID-based signature scheme from quadratic residues. Thus, we aim to meet this challenge by proposing a concrete scheme. In this paper, we first introduce the technique of how to calculate a 2lth root of a quadratic residue, and then give a concrete ID-based signature scheme using such technique.We also prove that our scheme is chosen message and ID secure in the random oracle model, assuming the hardness of factoring.
Two Conservative Difference Schemes for Rosenau-Kawahara Equation
Jinsong Hu
2014-01-01
Full Text Available Two conservative finite difference schemes for the numerical solution of the initialboundary value problem of Rosenau-Kawahara equation are proposed. The difference schemes simulate two conservative quantities of the problem well. The existence and uniqueness of the difference solution are proved. It is shown that the finite difference schemes are of second-order convergence and unconditionally stable. Numerical experiments verify the theoretical results.
An Encoder/Decoder Scheme of OCDMA Based on Waveguide
无
2001-01-01
A new encoder/decoder scheme of OCDMA based on waveguide isproposed in this paper. The principle as well as the structure of waveguide encoder/decoder is given. It can be seen that all-optical OCDMA encoder/decoder can be realized by the proposed scheme of the waveguide encoder/decoder. It can also make the OCDMA encoder/decoder integrated easily and the access controlled easily. The system based on this scheme can work under the entirely asynchronous condition.
General and Optimal Scheme for Local Conversion of Pure States
JIN Rui-Bo; CHEN Li-Bing; WANG Fa-Qiang; LU Yi-Qun
2008-01-01
We present general and optimal schemes for local conversion of pure states, via one specific example. First, we give the general solution of the doubly stochastic matrix. Then, we find the general and optimal positive-operator-valued measure (POVM) to realize the local conversion of pure states. Lastly, the physical realization of the POVM is discussed. We show that our scheme has a more general and better effect than other schemes.
Scheme for adding electron-nucleus cusps to Gaussian orbitals
Ma, A.; Towler, M. D.; Drummond, N. D.; Needs, R. J.
2008-01-01
A simple scheme is described for introducing the correct cusps at nuclei into orbitals obtained from Gaussian basis set electronic structure calculations. The scheme is tested with all-electron variational quantum Monte Carlo (VMC) and diffusion quantum Monte Carlo (DMC) methods for the Ne atom, the H2 molecule, and 55 molecules from a standard benchmark set. It greatly reduces the variance of the local energy in all cases and slightly improves the variational energy. This scheme yields a gen...
Towards a Singularity-Proof Scheme in Numerical Relativity
Seidel, E; Seidel, Edward; Suen, Wai-Mo
1992-01-01
Progress in numerical relativity has been hindered for 30 years because of the difficulties of avoiding spacetime singularities in numerical evolution. We propose a scheme which excises a region inside an apparent horizon containing the singularity. Two major ingredients of the scheme are the use of a horizon-locking coordinate and a finite differencing which respects the causal structure of the spacetime. Encouraging results of the scheme in the spherical collapse case are given.
A comparison of SPH schemes for the compressible Euler equations
Puri, Kunal; Ramachandran, Prabhu
2014-01-01
We review the current state-of-the-art Smoothed Particle Hydrodynamics (SPH) schemes for the compressible Euler equations. We identify three prototypical schemes and apply them to a suite of test problems in one and two dimensions. The schemes are in order, standard SPH with an adaptive density kernel estimation (ADKE) technique introduced Sigalotti et al. (2008) [44], the variational SPH formulation of Price (2012) [33] (referred herein as the MPM scheme) and the Godunov type SPH (GSPH) scheme of Inutsuka (2002) [12]. The tests investigate the accuracy of the inviscid discretizations, shock capturing ability and the particle settling behavior. The schemes are found to produce nearly identical results for the 1D shock tube problems with the MPM and GSPH schemes being the most robust. The ADKE scheme requires parameter values which must be tuned to the problem at hand. We propose an addition of an artificial heating term to the GSPH scheme to eliminate unphysical spikes in the thermal energy at the contact discontinuity. The resulting modification is simple and can be readily incorporated in existing codes. In two dimensions, the differences between the schemes is more evident with the quality of results determined by the particle distribution. In particular, the ADKE scheme shows signs of particle clumping and irregular motion for the 2D strong shock and Sedov point explosion tests. The noise in particle data is linked with the particle distribution which remains regular for the Hamiltonian formulations (MPM and GSPH) and becomes irregular for the ADKE scheme. In the interest of reproducibility, we make available our implementation of the algorithms and test problems discussed in this work.
Number-Phase Quantization Scheme for L-C Circuit
无
2007-01-01
For a mesoscopic L-C circuit, besides the Louisell's quantization scheme in which electric charge q and electric current Ⅰ are respectively quantized as the coordinate operator Q and momentum operator P, in this paper we propose a new quantization scheme in the context of number-phase quantization through the standard Lagrangian formalism. The comparison between this number-phase quantization with the Josephson junction's Cooper pair numberphase-difference quantization scheme is made.
Bandwidth-Efficient Cooperative Relaying Schemes with Multiantenna Relay
Tho Le-Ngoc
2008-05-01
Full Text Available We propose coded cooperative relaying schemes in which all successfully decoded signals from multiple sources are forwarded simultaneously by a multiantenna relay to a common multiantenna destination to increase bandwidth efficiency. These schemes facilitate various retransmission strategies at relay and single-user and multiuser iterative decoding techniques at destination, suitable for trade-offs between performance, latency, and complexity. Simulation results show that the proposed schemes significantly outperform direct transmission under the same transmit power and bandwidth efficiency.
An Annotation Scheme for Free Word Order Languages
Skut, W; Brants, T; Uszkoreit, H; Skut, Wojciech; Krenn, Brigitte; Brants, Thorsten; Uszkoreit, Hans
1997-01-01
We describe an annotation scheme and a tool developed for creating linguistically annotated corpora for non-configurational languages. Since the requirements for such a formalism differ from those posited for configurational languages, several features have been added, influencing the architecture of the scheme. The resulting scheme reflects a stratificational notion of language, and makes only minimal assumptions about the interrelation of the particular representational strata.
NUMERICAL SIMULATIONS OF SEA ICE WITH DIFFERENT ADVECTION SCHEMES
LIU Xi-ying
2011-01-01
Numerical simulations are carried out for sea ice with four different advection schemes to study their effects on the simulation results.The sea ice model employed here is the Sea Ice Simulator (SIS) of the Geophysical Fluid Dynamics Laboratory (GFDL) Modular Ocean Model version 4b (MOM4b) and the four advection schemes are, the upwind scheme originally used in the SIS, the Multi-Dimensional Positive Advection (MDPA) scheme, the Incremental Remapping Scheme (IRS) and the Two Step Shape Preserving (TSSP) scheme.The latter three schemes are newly introduced.To consider the interactions between sea ice and ocean, a mixed layer ocean model is introduced and coupled to the SIS.The coupled model uses a tri-polar coordinate with 120×65 grids,covering the whole earth globe, in the horizontal plane.Simulation results in the northern high latitudes are analyzed.In all simulations, the model reproduces the seasonal variation of sea ice in the northern high latitudes well.Compared with the results from the observation, the sea ice model produces some extra sea ice coverage in the Greenland Sea and Barents Sea in winter due to the exclusion of ocean current effects and the smaller simulated sea ice thickness in the Arctic basin.There are similar features among the results obtained with the introduced three advection schemes.The simulated sea ice thickness with the three newly introduced schemes are all smaller than that of the upwind scheme and the simulated sea ice velocities of movement are all smaller than that of the upwind scheme.There are more similarities shared in the results obtained with the MPDA and TSSP schemes.
Conservative Linear Difference Scheme for Rosenau-KdV Equation
Jinsong Hu
2013-01-01
Full Text Available A conservative three-level linear finite difference scheme for the numerical solution of the initial-boundary value problem of Rosenau-KdV equation is proposed. The difference scheme simulates two conservative quantities of the problem well. The existence and uniqueness of the difference solution are proved. It is shown that the finite difference scheme is of second-order convergence and unconditionally stable. Numerical experiments verify the theoretical results.
CONTROL SCHEMES FOR CMAC NEURAL NETWORK-BASED VISUAL SERVOING
Wang Huaming; Xi Wenming; Zhu Jianying
2003-01-01
In IBVS (image based visual servoing), the error signal in image space should be transformed into the control signal in the input space quickly. To avoid the iterative adjustment and complicated inverse solution of image Jacobian, CMAC (cerebellar model articulation controller) neural network is inserted into visual servo control loop to implement the nonlinear mapping. Two control schemes are used. Simulation results on two schemes are provided, which show a better tracking precision and stability can be achieved using scheme 2.
A repeat-until-success quantum computing scheme
Beige, A [School of Physics and Astronomy, University of Leeds, Leeds LS2 9JT (United Kingdom); Lim, Y L [DSO National Laboratories, 20 Science Park Drive, Singapore 118230, Singapore (Singapore); Kwek, L C [Department of Physics, National University of Singapore, 2 Science Drive 3, Singapore 117542, Singapore (Singapore)
2007-06-15
Recently we proposed a hybrid architecture for quantum computing based on stationary and flying qubits: the repeat-until-success (RUS) quantum computing scheme. The scheme is largely implementation independent. Despite the incompleteness theorem for optical Bell-state measurements in any linear optics set-up, it allows for the implementation of a deterministic entangling gate between distant qubits. Here we review this distributed quantum computation scheme, which is ideally suited for integrated quantum computation and communication purposes.
A PROVABLY SECURE PROXY SIGNATURE SCHEME FROM BILINEAR PAIRINGS
Wang Aiqin; Li Jiguo; Wang Zhijian
2010-01-01
A proxy signature allows an entity,called original signer,to delegate its signing power to another entity,called proxy signer,to sign messages on its behalf. Proxy signatures have many practical applications and are very important cryptographic protocol. In this paper,we propose an efficient proxy signature scheme from bilinear pairings. We prove it secure in the random oracle model and analyze computation cost of our scheme. Our scheme satisfies all the properties required for proxy signatures.
Comparison of two SVD-based color image compression schemes.
Li, Ying; Wei, Musheng; Zhang, Fengxia; Zhao, Jianli
2017-01-01
Color image compression is a commonly used process to represent image data as few bits as possible, which removes redundancy in the data while maintaining an appropriate level of quality for the user. Color image compression algorithms based on quaternion are very common in recent years. In this paper, we propose a color image compression scheme, based on the real SVD, named real compression scheme. First, we form a new real rectangular matrix C according to the red, green and blue components of the original color image and perform the real SVD for C. Then we select several largest singular values and the corresponding vectors in the left and right unitary matrices to compress the color image. We compare the real compression scheme with quaternion compression scheme by performing quaternion SVD using the real structure-preserving algorithm. We compare the two schemes in terms of operation amount, assignment number, operation speed, PSNR and CR. The experimental results show that with the same numbers of selected singular values, the real compression scheme offers higher CR, much less operation time, but a little bit smaller PSNR than the quaternion compression scheme. When these two schemes have the same CR, the real compression scheme shows more prominent advantages both on the operation time and PSNR.
Optimal coding schemes for conflict-free channel access
Browning, Douglas W.; Thomas, John B.
1989-10-01
A method is proposed for conflict-free access of a broadcast channel. The method uses a variable-length coding scheme to determine which user gains access to the channel. For an idle channel, an equation for optimal expected overhead is derived and a coding scheme that produces optimal codes is presented. Algorithms for generating optimal codes for access on a busy channel are discussed. Suboptimal schemes are found that perform in a nearly optimal fashion. The method is shown to be superior in performance to previously developed conflict-free channel access schemes.
Adaptive transmission schemes for MISO spectrum sharing systems
Bouida, Zied
2013-06-01
We propose three adaptive transmission techniques aiming to maximize the capacity of a multiple-input-single-output (MISO) secondary system under the scenario of an underlay cognitive radio network. In the first scheme, namely the best antenna selection (BAS) scheme, the antenna maximizing the capacity of the secondary link is used for transmission. We then propose an orthogonal space time bloc code (OSTBC) transmission scheme using the Alamouti scheme with transmit antenna selection (TAS), namely the TAS/STBC scheme. The performance improvement offered by this scheme comes at the expense of an increased complexity and delay when compared to the BAS scheme. As a compromise between these schemes, we propose a hybrid scheme using BAS when only one antenna verifies the interference condition and TAS/STBC when two or more antennas are illegible for communication. We first derive closed-form expressions of the statistics of the received signal-to-interference-and-noise ratio (SINR) at the secondary receiver (SR). These results are then used to analyze the performance of the proposed techniques in terms of the average spectral efficiency, the average number of transmit antennas, and the average bit error rate (BER). This performance is then illustrated via selected numerical examples. © 2013 IEEE.
Studies of Inviscid Flux Schemes for Acoustics and Turbulence Problems
Morris, Chris
2013-01-01
Five different central difference schemes, based on a conservative differencing form of the Kennedy and Gruber skew-symmetric scheme, were compared with six different upwind schemes based on primitive variable reconstruction and the Roe flux. These eleven schemes were tested on a one-dimensional acoustic standing wave problem, the Taylor-Green vortex problem and a turbulent channel flow problem. The central schemes were generally very accurate and stable, provided the grid stretching rate was kept below 10%. As near-DNS grid resolutions, the results were comparable to reference DNS calculations. At coarser grid resolutions, the need for an LES SGS model became apparent. There was a noticeable improvement moving from CD-2 to CD-4, and higher-order schemes appear to yield clear benefits on coarser grids. The UB-7 and CU-5 upwind schemes also performed very well at near-DNS grid resolutions. The UB-5 upwind scheme does not do as well, but does appear to be suitable for well-resolved DNS. The UF-2 and UB-3 upwind schemes, which have significant dissipation over a wide spectral range, appear to be poorly suited for DNS or LES.
Mixed Anti-diffusion Method for High Resolution Schemes
李荣华; 张威威
2004-01-01
In this paper we study a kied of mixed anti-diffusion method for partial differntial equations. Firstly, we use the method to construct some difference schemes for the conservation laws. The schemes are of second order accuracy and are total variation decreasing (TVD). In particular, there are only three knots involved in the schemes. Secondly, we extend the method to construct a few high accuracy difference schemes for elliptic and parabolic equations. Numerical experiments are carried out to illustrate the efficiency of the method.
A Electronic Voting Scheme Achieved by Using Quantum Proxy Signature
Cao, Hai-Jing; Ding, Li-Yuan; Yu, Yao-Feng; Li, Peng-Fei
2016-09-01
In this paper, we propose a new electronic voting scheme using Bell entangled states as quantum channels. This scheme is based on quantum proxy signature. The voter Alice, vote management center Bob, teller Charlie and scrutineer Diana only perform single particle measurement to realize the electronic voting process. So the scheme reduces the technical difficulty and increases operation efficiency. It can be easily realized. We use quantum key distribution and one-time pad to guarantee its unconditional security. The scheme uses the physical characteristics of quantum mechanics to guarantee its anonymity, verifiability, unforgetability and undeniability.
A MULTI-CRC SELECTIVE HARQ SCHEME FOR MIMO SYSTEMS
无
2008-01-01
A multi-Cyclic Redundancy Check (CRC) selective Hybrid Automatic-Repeat-reQuest (HARQ) scheme for improving the throughput efficiency of Multiple Input Multiple Output (MIMO) systems is proposed in this paper. According to different feedback information from the receiver, the proposed HARQ scheme employs two strategies, referred to as retransmission frame selection and space diversity. These two strategies decrease the successive frame errors upon retransmission. Theoretic analysis and computer simulation results show that this HARQ scheme achieves higher throughput than the existing HARQ schemes even in poor conditions of low Signal-to-Noise Ratio (SNR).
Proxy Signature Scheme with Effective Revocation Using Bilinear Pairings
Das, Manik Lal; Phatak, Deepak B
2007-01-01
We present a proxy signature scheme using bilinear pairings that provides effective proxy revocation. The scheme uses a binding-blinding technique to avoid secure channel requirements in the key issuance stage. With this technique, the signer receives a partial private key from a trusted authority and unblinds it to get his private key, in turn, overcomes the key escrow problem which is a constraint in most of the pairing-based proxy signature schemes. The scheme fulfills the necessary security requirements of proxy signature and resists other possible threats.