The document outlines various IEEE 2015 Java projects, including topics like differential phase-shift quantum key distribution, safeguarding quantum key distribution against hacking attacks, and medical data compression for wireless ad hoc networks. Additionally, it discusses methods for improving bug triage in software development and introduces optimization techniques for efficient data handling. Each project presents its unique approach and solution to address complex challenges in quantum communication, data security, and software maintenance.

1. IEEE 2015 Java Projects
Web : www.kasanpro.com Email : sales@kasanpro.com
List Link : http://kasanpro.com/projects-list/ieee-2015-java-projects
Title :Differential Phase-Shift Quantum Key Distribution Systems
Language : Java
Project Link : http://kasanpro.com/p/java/differential-phase-shift-quantum-key-distribution-systems
Abstract : Differential phase-shift (DPS) quantum key distribution (QKD) is a unique QKD protocol that is different
from traditional ones, featuring simplicity and practicality. This paper overviews DPS-QKD systems.
Title :Safeguarding Quantum Key Distribution Through Detection Randomization
Language : Java
Project Link : http://kasanpro.com/p/java/safeguarding-quantum-key-distribution-through-detection-randomization
Abstract : We propose and experimentally demonstrate a scheme to render the detection apparatus of a quantum
key distribution system immune to the main classes of hacking attacks in which the eavesdropper explores the
back-door opened by the single-photon detectors. The countermeasure is based on the creation of modes that are not
deterministically accessible to the eavesdropper. We experimentally show that the use of beamsplitters and extra
single-photon detectors at the receiver station passively creates randomized spatial modes that erase any knowledge
the eavesdropper might have gained when using bright-light faked states. Additionally, we experimentally show a
detectorscrambling approach where the random selection of the detector used for each measurement--equivalent to
an active spatial mode randomization--hashes out the side-channel open by the detection efficiency mismatch-based
attacks. The proposed combined countermeasure represents a practical and readily implementable solution against
the main classes of quantum hacking attacks aimed on the single-photon detector so far, without intervening on the
inner working of the devices.
Title :Postprocessing of the Oblivious Key in Quantum Private Query
Language : Java
Project Link : http://kasanpro.com/p/java/oblivious-key-postprocessing-quantum-private-query
Abstract : Private query is a kind of cryptographic protocols to protect both users' privacies in their communication.
For instance, Alice wants to buy one item from Bob's database. The aim of private query is to ensure that Alice can
get only one item from Bob, and simultaneously, Bob cannot know which one was taken by Alice. In pursuing high
security and efficiency, some quantum private query protocols were proposed. As a practical model, Quantum-
Oblivious-Key-Transfer (QOKT)-based private query, which utilizes a QOKT protocol to distribute oblivious key
between Alice and Bob and then applies the key to achieve the aim of private query, has drawn much attention. Here,
we focus on postprocessing of the oblivious key, and the following two contributions are achieved. 1) We analyze
three recently proposed dilution methods and find two of them have serious security loophole. That is, Alice can
illegally obtain much additional information about Bob's database by multiple queries. For example, Alice can obtain
the whole database, which contains 104 items, by only 53.4 queries averagely. 2) We present an effective
error-correction method for the oblivious key, which can address the realistic scenario with channel noises and make
QOKT-based private query more practical.
Title :Rank-Based Similarity Search: Reducing the Dimensional Dependence
Language : Java
Project Link : http://kasanpro.com/p/java/rank-based-similarity-search-reducing-dimensional-dependence
Abstract : This paper introduces a data structure for k-NN search, the Rank Cover Tree (RCT), whose pruning tests
rely solely on the comparison of similarity values; other properties of the underlying space, such as the triangle

2. inequality, are not employed. Objects are selected according to their ranks with respect to the query object, allowing
much tighter control on the overall execution costs. A formal theoretical analysis shows that with very high probability,
the RCT returns a correct query result in time that depends very competitively on a measure of the intrinsic
dimensionality of the data set. The experimental results for the RCT show that non-metric pruning strategies for
similarity search can be practical even when the representational dimension of the data is extremely high. They also
show that the RCT is capable of meeting or exceeding the level of performance of state-of-the-art methods that make
use of metric pruning or other selection tests involving numerical constraints on distance values.
Title :Medical Data Compression and Transmission in Wireless Ad Hoc Networks
Language : Java
Project Link : http://kasanpro.com/p/java/medical-data-compression-transmission-wireless-ad-hoc-networks
Abstract : A wireless ad hoc network (WANET) is a type of wireless network aimed to be deployed in a disaster area
in order to collect data of patients and improve medical facilities. The WANETs are composed of several small nodes
scattered in the disaster area. The nodes are capable of sending (wirelessly) the collected medical data to the base
stations. The limited battery power of nodes and the transmission of huge medical data require an energy efficient
approach to preserve the quality of service of WANETs. To address this issue, we propose an optimizationbased
medical data compression technique, which is robust to transmission errors. We propose a fuzzy-logic-based route
selection technique to deliver the compressed data that maximizes the lifetime of WANETs. The technique is fully
distributed and does not use any geographical/location information. We demonstrate the utility of the proposed work
with simulation results. The results show that the proposed work effectively maintains connectivity of WANETs and
prolongs network lifetime.
IEEE 2015 Java Projects
Title :Towards Effective Bug Triage with Software Data Reduction Techniques
Language : Java
Project Link : http://kasanpro.com/p/java/bug-triage-software-data-reduction-techniques
Abstract : Software companies spend over 45 percent of cost in dealing with software bugs. An inevitable step of
fixing bugs is bug triage, which aims to correctly assign a developer to a new bug. To decrease the time cost in
manual work, text classification techniques are applied to conduct automatic bug triage. In this paper, we address the
problemof data reduction for bug triage, i.e., how to reduce the scale and improve the quality of bug data.We combine
instance selection with feature selection to simultaneously reduce data scale on the bug dimension and the word
dimension. To determine the order of applying instance selection and feature selection, we extract attributes from
historical bug data sets and build a predictive model for a new bug data set. We empirically investigate the
performance of data reduction on totally 600,000 bug reports of two large open source projects, namely Eclipse and
Mozilla. The results show that our data reduction can effectively reduce the data scale and improve the accuracy of
bug triage. Our work provides an approach to leveraging techniques on data processing to form reduced and
high-quality bug data in software development and maintenance.