Low complexity quantum private queries protocol

Private information retrieval(PIR) is an important privacy protection issue of secure multi-party computation, but the PIR protocols based on classical cryptography are vulnerable because of new technologies,such as quantum computing and cloud computing. The quantum private queries(QPQ) protocols available, however, has a high complexity and is inefficient in the face of large database. This paper, based on the QKD technology which is mature now, proposes a novel QPQ protocol utilizing the key dilution and auxiliary parameter. Only N quits are required to be sent in the quantum channel to generate the raw key, then the straight k bits in the raw key are added bitwise to dilute the raw key, and a final key is consequently obtained to encrypt the database. By flexible adjusting of auxiliary parameters θ and k, privacy is secured and the query success ratio is improved. Feasibility and performance analyses indicate that the protocol has a high success ratio in first-trial query and is easy to implement, and that the communication complexity of O(N) is achieved.     

Optimal shift partitioning of pharmacies

The pharmacy service requires that some pharmacies are always available and shifts have to be organized: a shift corresponds to a subset of pharmacies that must be open 24 hours a day on a particular week. Under the requirement that each pharmacy belongs to exactly one shift and the assumption that users minimize the distance to the closest open pharmacy during each shift, we want to determine a partition of the pharmacies into a given number of shifts, such that the total distance covered by users is minimized. It may be also required that shift cardinalities are balanced. We discuss different versions and the related computational complexity, showing that the problem is NP-hard in general. A set packing formulation is presented and solved by branch-and-price, together with a fast solution technique based on a tabu search. They have been applied to real and random instances showing that (i) the set packing formulation is very tight and often exhibits no integrality gap; (ii) the branch-and-price solves problems of practical relevance to optimality in a reasonable amount of time (order of minutes); (iii) the tabu search finds optimal or near-optimal solutions in order of seconds.     

一种实用的多数据库量子信息检索协议

针对目前量子私有信息检索不能适用与云存储的多数据库问题,基于现在成熟的量子密钥分发方法,提出了一种适合在多数据库环境下,实用的量子私有信息检索协议。对于不同大小的数据库,协议可通过调节参数θ和k,在保证数据库安全及用户隐私的情况下,完成信息的检索。性能分析结果表明,协议的通信复杂度低,检索成功率高、易于实施。     

The day of the week when you were born in 700 ms: Calendar computation in an autistic savant.

Some individuals are able to determine the weekday of a given date in a few seconds (finding for instance that June 12, 1900, was a Tuesday). This ability has fascinated scientists for many years because it is predominantly observed in people with limited intelligence and may appear very early in life. Exceptional visual memory, exceptional concentration abilities, or privileged access to lower levels of information not normally available through introspection have been advanced to explain such phenomena. In the present article, the authors show that a simple cognitive model can explain all aspects of the performance of Donny, a young autistic savant who is possibly the fastest and most accurate calendar prodigy ever described. (PsycINFO Database Record (c) 2010 APA, all rights reserved)     

On keys' meanings and modes: the impact of different key solutions on children's efficiency using a mobile phone

The present study investigates the impact of different key solutions of mobile phones on users' effectiveness and efficiency using the devices. In the first experiment, 36 children (9 - 14 years) and in the second experiment 45 young adults (19 - 33 years) completed four common phone tasks twice consecutively on three simulated phones that had identical menus, but different key solutions. An approach was undertaken to quantify the complexity of keys in three models, incorporating different factors contributing to the keys' complexity (number of key options, number of modes and number of modes with a semantically dissimilar meaning), in order to predict users' performance decrements. As a further main factor, the degree of the users' locus of control (LOC) was measured and interactions with performance outcomes were studied. As dependent measures, the number of inefficient keystrokes, the number of tasks solved and the processing time were determined. Results showed a significant effect of control key solutions on users' efficiency and effectiveness for both children and young adults. Moreover, children's LOC values significantly interacted with performance: children with low LOC values showed the lowest performance and no learnability, especially when using keys with a high complexity. From the three factors contributing to the complexity of keys, keys exerting different functions with semantically inconsistent meanings had the worst effect on performance. It is concluded that in mobile user interface design keys with semantically inconsistent meanings should be generally avoided.     

基于可靠性评价的含缺陷核压力管道疲劳寿命预测方法

含缺陷压力管道经缺陷评定合乎使用后,其疲劳寿命的估计具有重要的工程意义。将整个含缺陷压力管道作为一个整体,分析了含缺陷压力管道的疲劳裂纹扩展特点,提出了相应的含缺陷压力管道疲劳寿命的计算过程,并在基于可靠性评价的基础上,给出了核压力管道的可接受失效概率,最终得到了含缺陷核压力管道疲劳寿命预测方法。     

Implementing Qubits with Superconducting Integrated Circuits

Superconducting qubits are solid state electrical circuits fabricated using techniques borrowed from conventional integrated circuits. They are based on the Josephson tunnel junction, the only non-dissipative, strongly non-linear circuit element available at low temperature. In contrast to microscopic entities such as spins or atoms, they tend to be well coupled to other circuits, which make them appealling from the point of view of readout and gate implementation. Very recently, new designs of superconducting qubits based on multi-junction circuits have solved the problem of isolation from unwanted extrinsic electromagnetic perturbations. We discuss in this review how qubit decoherence is affected by the intrinsic noise of the junction and what can be done to improve it. PACS: 03.67.-a, 03.65.Yz, 85.25.-j, 85.35.Gv     

Study on the Complexity of the Bullwhip Effect

Recent years have witnessed a rapid growth of interest in the study of the dynamic behavior of replenishment rules of bullwhip effect. We prove that bullwhip effect and butterfly effect share a same the self-oscillation amplifying mechanism that is the ordering decisions the supplier self-oscillation amplify the perturbations brought by the errors in the processing of retailers' demand information. This results as an explicit self-similar structure of the sensitivity of the system to the initial values duty to the nonlinear mechanism. In this paper, the causes process of the bullwhip effect is described as the internal nonlinear mechanism and study on the complexity of bullwhip effect for order-up-to policy under demand signal processing. The methodology is based on fractal and chaotic theory and allows important insights to be gained about the complexity behavior of bullwhip effect.