Mie‐Resonant Membrane Huygens' Metasurfaces

All‐dielectric metasurfaces have become a new paradigm for flat optics as they allow flexible engineering of the electromagnetic space of propagating waves. Such metasurfaces are usually composed of individual subwavelength elements embedded into a host medium or placed on a substrate, which often diminishes the quality of the resonances. The substrate imposes limitations on the metasurface functionalities, especially for infrared and terahertz frequencies. Here a novel concept of membrane Huygens' metasurfaces is introduced. The metasurfaces feature an inverted design, and they consist of arrays of holes made in a thin membrane of high‐index dielectric material, with the response governed by the electric and magnetic Mie resonances excited within dielectric domains of the membrane. Highly efficient transmission combined with the 2π phase coverage in the freestanding membranes is demonstrated. Several functional metadevices for wavefront control are designed, including beam deflector, a lens, and an axicon. Such membrane metasurfaces provide novel opportunities for efficient large‐area metadevices, whose advanced functionality is defined by structuring rather than by chemical composition.     

A coding scheme using global motion estimation for AVS P-frame

Block matching has been used for motion estimation and motion compensation in the Audio and Video Standard （AVS） for years. While having an acceptable performance in describing motion between frames, it requires quite a few bits to represent the motion vectors. In certain circumstances, the use of global motion estimation and compensation would perform equally well or even better than the block matching in terms of motion accuracy, while it results in the coding of global motion model parameters. In this letter, we modify an AVS coder by adding （1） six global motion model parameters to the frame header, and （2） mode selection among INTRA, SKIP, INTER-16×16, INTER-16×8, INTER-8×16, INTER-8×8, and Global Motion Compensation （GMC） modes by Lagrange optimal rate-distortion criteria. Simulation results demonstrate that over 0.1dB improvement in PSNR is obtained compared to the AVS coder for an average coded P-frame with the same bitrate.     

Oscillator-Based Reconfigurable Sinusoidal Signal Generator for ADC BIST

In order to perform an on-chip test for characterizing both static and transmission parameters of embedded analog-to-digital converters (ADCs), this paper presents an oscillator-based reconfigurable sinusoidal signal generator which can produce both high and low frequency sinusoidal signals by switching the oscillator into different modes. Analog and digital signals can additionally be produced concurrently in both modes to provide not only test stimuli, but also reference responses for the ADC built-in self-test. The generated oscillation signal amplitude and frequency can be easily and precisely controlled by simply setting the oscillator clock frequency and initial condition coefficients. Except for a 1-bit digital-to-analog converter and smoothing filter, this proposed generator is constructed entirely by digital circuits, and hence easily integrates this silicon function and verifies itself before testing the ADCs.

A comparative study on the electronic and optical properties of Sb<Subscript>2</Subscript>Se<Subscript>3</Subscript> thin film

The thin film of Sb₂Se₃ was deposited by thermal evaporation method and the film was annealed in N₂ flow in a three zone furnace at a temperature of 290°С for 30 min. The structural properties were characterized by scanning electron microscopy (SEM), transmission electron microscopy (ТЕМ), X-ray diffraction (XRD) and Raman spectroscopy, respectively. It is seen that the as-deposited film is amorphous and the annealed film is polycrystalline in nature. The surface of Sb₂Se₃ film is oxidized with a thickness of 1.15 nm investigated by X-ray photolecetron spectroscopy (XPS) measurement. Spectroscopic ellipsometry (SE) and UV–vis spectroscopy measurements were carried out to study the optical properties of Sb₂Se₃ film. In addition, the first principles calculations were applied to study the electronic and optical properties of Sb₂Se₃. From the theoretical calculation it is seen that Sb₂Se₃ is intrinsically an indirect band gap semiconductor. Importantly, the experimental band gap is in good agreement with the theoretical band gap. Furthermore, the experimental values of n, k, ε₁, and ε₂ are much closer to the theoretical results. However, the obtained large dielectric constants and refractive index values suggest that exciton binding energy in Sb₂Se₃ should be relatively small and an antireflective coating is recommended to enhance the light absorption of Sb₂Se₃ for thin film solar cells application.     

Weak Locking Capacity of Quantum Channels Can be Much Larger Than Private Capacity

We show that it is possible for the so-called weak locking capacity of a quantum channel (Guha et al. in Phys Rev X 4:011016, 2014) to be much larger than its private capacity. Both reflect different ways of capturing the notion of reliable communication via a quantum system while leaking almost no information to an eavesdropper; the difference is that the latter imposes an intrinsically quantum security criterion whereas the former requires only a weaker, classical condition. The channels for which this separation is most straightforward to establish are the complementary channels of classical-quantum (cq-)channels and, hence, a subclass of Hadamard channels. We also prove that certain symmetric channels (related to photon number splitting) have positive weak locking capacity in the presence of a vanishingly small pre-shared secret, whereas their private capacity is zero. These findings are powerful illustrations of the difference between two apparently natural notions of privacy in quantum systems, relevant also to quantum key distribution: the older, naïve one based on accessible information, contrasting with the new, composable one embracing the quantum nature of the eavesdropper’s information. Assuming an additivity conjecture for constrained minimum output Rényi entropies, the techniques of the first part demonstrate a single-letter formula for the weak locking capacity of complements to cq-channels, coinciding with a general upper bound of Guha et al. for these channels. Furthermore, still assuming this additivity conjecture, this upper bound is given an operational interpretation for general channels as the maximum weak locking capacity of the channel activated by a suitable noiseless channel.     

Secret-Sharing for NP

A computational secret-sharing scheme is a method that enables a dealer, that has a secret, to distribute this secret among a set of parties such that a “qualified” subset of parties can efficiently reconstruct the secret while any “unqualified” subset of parties cannot efficiently learn anything about the secret. The collection of “qualified” subsets is defined by a monotone Boolean function. It has been a major open problem to understand which (monotone) functions can be realized by a computational secret-sharing scheme. Yao suggested a method for secret-sharing for any function that has a polynomial-size monotone circuit (a class which is strictly smaller than the class of monotone functions in \({\mathsf {P}}\)). Around 1990 Rudich raised the possibility of obtaining secret-sharing for all monotone functions in \({\mathsf {NP}}\): in order to reconstruct the secret a set of parties must be “qualified” and provide a witness attesting to this fact. Recently, Garg et al. (Symposium on theory of computing conference, STOC, pp 467–476, 2013) put forward the concept of witness encryption, where the goal is to encrypt a message relative to a statement \(x\in L\) for a language \(L\in {\mathsf {NP}}\) such that anyone holding a witness to the statement can decrypt the message; however, if \(x\notin L\), then it is computationally hard to decrypt. Garg et al. showed how to construct several cryptographic primitives from witness encryption and gave a candidate construction. One can show that computational secret-sharing implies witness encryption for the same language. Our main result is the converse: we give a construction of a computational secret-sharing scheme for any monotone function in \({\mathsf {NP}}\) assuming witness encryption for \({\mathsf {NP}}\) and one-way functions. As a consequence we get a completeness theorem for secret-sharing: computational secret-sharing scheme for any single monotone \({\mathsf {NP}}\)-complete function implies a computational secret-sharing scheme for every monotone function in \({\mathsf {NP}}\).     

Optimization of Spectrum Usage and Coexistence Analysis of DVB-T and LTE-800 systems

This paper investigates the possible coexistence issues between the digital video broadcasting-terrestrial (DVB-T) system and the long term evolution (LTE) that operate in adjacent frequency bands. The proposed methodology for interference assessment evaluates the DVB-T performance degradation in presence of aggregate LTE-800 interference targeting the territory of Macedonia as evaluation area. The simulation analysis quantifies the percentage of interference degraded pixels and obtains the probability of pixel DVB-T service degradation. Furthermore, a measurement trial complements the simulation analysis through the evaluation of the influence of active antenna usage by the DVB-T receivers. The simulation and measurement results in this particular case confirm that the alignment of the active DVB-T receiving antenna towards the LTE-800 base station can substantially increase the degradation whereas aligning of the active DVB-T receiving antenna towards the DVB-T transmitter maintains the efficient TV reception. Finally, this paper proposes a simple algorithm for optimal LTE frequency arrangement, resulting in significant reduction of the LTE interference towards the DVB-T system.     

A Proposed H-STCDD Scheme in Cooperative Communication System

In this paper, the hierarchical space time cyclic delay diversity (H-STCDD) scheme is proposed. Proposed scheme uses hierarchical modulation and achieves approximately full rate. It also uses a cyclic delay diversity scheme, which improves the benefit of channel coding particularly in high SNR environment between source to relay and source to destination. According to simulation result, proposed scheme has up to 2.2 dB better BER performance than conventional cooperative scheme at BER of 10^?3 and has similar BER performance with the STCDD scheme particularly in high SNR environment between source to relay and source to destination. Throughput of the proposed scheme is better than those of other cooperative schemes. Therefore proposed scheme is more efficient than other cooperative scheme and can be efficiently used in high SNR environment between source to relay and source to destination.     

Learning-Based Data Envelopment Analysis for External Cloud Resource Allocation

A mature cloud system needs a complete resource allocation policy which includes internal and external allocation. They not only enable users to have better experiences, but also allows the cloud provider to cut costs. In the other words, internal and external allocation are indispensable since a combination of them is only a total solution for whole cloud system. In this paper, we clearly explain the difference between internal allocation (IA) and external allocation (EA) as well as defining the explicit IA and EA problem for the follow up research. Although many researchers have proposed resource allocation methods, they are just based on subjective observations which lead to an imbalance of the overall cloud architecture, and cloud computing resources to operate se-quentially. In order to avoid an imbalanced situation, in previous work, we proposed Data Envelopment Analysis (DEA) to solve this problem; it considers all of a user’s demands to evaluate the overall cloud parameters. However, although DEA can provide a higher quality solution, it requires more time. So we use the Q-learning and Data Envelopment Analysis (DEA) to solve the imbalance problem and reduce computing time. As our simulation results show, the proposed DEA+Qlearning will provide almost best quality but too much calculating time.