MP2-F12 Basis Set Convergence for the S66 Noncovalent Interactions Benchmark: Transferability of the Complementary Auxiliary Basis Set (CABS)

Complementary auxiliary basis sets for F12 explicitly correlated calculations appear to be more transferable between orbital basis sets than has been generally assumed. We also find that aVnZ-F12 basis sets, originally developed with anionic systems in mind, appear to be superior for noncovalent interactions as well, and propose a suitable CABS sequence for them.Comment: AIP Conference Proceedings, in press (ICCMSE-2017 proceedings), 4 page

The aug-cc-pVnZ-F12 Basis Set Family: Correlation Consistent Basis Sets for Explicitly Correlated Benchmark Calculations on Anions and Noncovalent Complexes

We have developed a new basis set family, denoted aug-cc-pVnZ-F12 (or aVnZ-F12 for short), for explicitly correlated calculations. The sets included in this family were constructed by supplementing the corresponding cc-pVnZ-F12 sets with additional diffuse functions on the higher angular momenta (i.e., additional d-h functions on non-hydrogen atoms, and p-g on hydrogen), optimized for the MP2-F12 energy of the relevant atomic anions. The new basis sets have been benchmarked against electron affinities of the first- and second-row atoms, the W4-17 dataset of total atomization energies, the S66 dataset of noncovalent interactions, the BEGDB water clusters subset, and the WATER23 subset of the GMTKN24 and GMTKN30 benchmark suites. The aVnZ-F12 basis sets displayed excellent performance, not just for electron affinities but also for noncovalent interaction energies of neutral and anionic species. Appropriate CABS (complementary auxiliary basis sets) were explored for the S66 noncovalent interactions benchmark: between similar-sized basis sets, CABS were found to be more transferable than generally assumed.Comment: J. Chem. Phys., in pres

On the Oblivious Transfer Capacity of the Degraded Wiretapped Binary Erasure Channel

We study oblivious transfer (OT) between Alice and Bob in the presence of an eavesdropper Eve over a degraded wiretapped binary erasure channel from Alice to Bob and Eve. In addition to the privacy goals of oblivious transfer between Alice and Bob, we require privacy of Alice and Bob's private data from Eve. In previous work we derived the OT capacity (in the honest-but-curious model) of the wiretapped binary independent erasure channel where the erasure processes of Bob and Eve are independent. Here we derive a lower bound on the OT capacity in the same secrecy model when the wiretapped binary erasure channel is degraded in favour of Bob.Comment: To be presented at the IEEE International Symposium on Information Theory (ISIT 2015), Hong Kon

Pricing Models for Perishable Goods with Customer Perception

In this paper, the pricing problem for perishable goods with customer perception is studied. Firstly, the customer value theory is introduced. Secondly, the problem is described. Then, the pricing model of perishable goods is established, in consideration of customer perception. At last, some data analysis and discussion are made via a concrete case study, the optimal pricing policy and maximum expected profit of the retailers are gained and some useful management conclusions are drawn

How to Securely Compute the Modulo-Two Sum of Binary Sources

In secure multiparty computation, mutually distrusting users in a network want to collaborate to compute functions of data which is distributed among the users. The users should not learn any additional information about the data of others than what they may infer from their own data and the functions they are computing. Previous works have mostly considered the worst case context (i.e., without assuming any distribution for the data); Lee and Abbe (2014) is a notable exception. Here, we study the average case (i.e., we work with a distribution on the data) where correctness and privacy is only desired asymptotically. For concreteness and simplicity, we consider a secure version of the function computation problem of K\"orner and Marton (1979) where two users observe a doubly symmetric binary source with parameter p and the third user wants to compute the XOR. We show that the amount of communication and randomness resources required depends on the level of correctness desired. When zero-error and perfect privacy are required, the results of Data et al. (2014) show that it can be achieved if and only if a total rate of 1 bit is communicated between every pair of users and private randomness at the rate of 1 is used up. In contrast, we show here that, if we only want the probability of error to vanish asymptotically in block length, it can be achieved by a lower rate (binary entropy of p) for all the links and for private randomness; this also guarantees perfect privacy. We also show that no smaller rates are possible even if privacy is only required asymptotically.Comment: 6 pages, 1 figure, extended version of submission to IEEE Information Theory Workshop, 201

The Oblivious Transfer Capacity of the Wiretapped Binary Erasure Channel

We consider oblivious transfer between Alice and Bob in the presence of an eavesdropper Eve when there is a broadcast channel from Alice to Bob and Eve. In addition to the secrecy constraints of Alice and Bob, Eve should not learn the private data of Alice and Bob. When the broadcast channel consists of two independent binary erasure channels, we derive the oblivious transfer capacity for both 2-privacy (where the eavesdropper may collude with either party) and 1-privacy (where there are no collusions).Comment: This is an extended version of the paper "The Oblivious Transfer Capacity of the Wiretapped Binary Erasure Channel" to be presented at ISIT 201

A Modified Weight Balanced Algorithm for Influential Users Community Detection in Online social Network (OSNs)

In the modern era online users are increasing day by day. Different users are using various social networks in different forms. The behavior and attitude of the users of social networking sites varies U2U (User to User). In online social networking users join many groups and communities as per interests and according to the groups'/Communities' influential user. This paper consist of 7 sections , first section emphasis on introduction to the community evelotion and community. Second section signify movement between communities ,third section involve related work about the research.. Fourth section includes Problem Definition and fifth section involve Methodology (Proposed Algorithm Process ,Get Community Matrix, Community detetcion).Sixth section involve Implementation. Furthermore implementation include Datasets ,Quantitative performance, Graphical Results, Enhancement in the existing work..Last section include Conclusion and then references. In this paper,we are implementing and proposing the community detection in social media .In the proposed we have deployed a Longest Chain Subsequence metric for finding the number of connections to the kernel community

Focussing on Defence R&D: an Insight Into DRDO

Introduction The Defence Research and Defence Organisation (DRDO) is the premier R&D organisation under the Ministry of Defence (MoD). R&D organisations are normally esoteric and their management processes are considered challenging and complex.2 DRDO's research is primarily for the benefit of the three defence services who also fall under the umbrella of MoD. This creates a unique and unusual situation in which the customers (viz. the three services) are fundamentally, similarly placed departments, like the R&D organisation, under the same ministry. Many literary excerpts on the subject point towards a feeling amongst the services that DRDO does not give the users (‘user' is DRDO's term for customers) requirements, a competitively equal importance on a similar level as a private player would have given, in such a competitive environment3 . It has been felt that there is a lack of mutual understanding and appreciation of the constraints faced by the services and DRDO. This feeling is only heightened by the fact that many important DRDO projects overshoot the budget and project timelines. DOI: 10.5281/zenodo.340594