A Three-Layer Privacy Preserving Cloud Storage Scheme Based On Computational Intelligence in Fog Computing

A THREE-LAYER PRIVACY PRESERVING CLOUD STORAGE
SCHEME BASED ON COMPUTATIONAL INTELLIGENCE IN FOG

COMPUTING
Abstract
The development of cloud computing technology. With the explosive growth of

unstructured data, cloud storage technology gets more attention and better development.
However, in current storage schema, user’s data is totally stored in cloud servers. In other words,
users lose their right of control on data and face privacy leakage risk. Traditional privacy
protection schemes are usually based on encryption technology, but these kinds of methods
cannot effectively resist attack from the inside of cloud server. In order to solve this problem, we
propose a three-layer storage framework based on fog computing. The proposed framework can
both take full advantage of cloud storage and protect the privacy of data. Besides, Hash-Solomon
code algorithm is designed to divide data into different parts. Then, we can put a small part of
data in local machine and fog server in order to protect the privacy. Moreover, based on
computational intelligence, this algorithm can compute the distribution proportion stored in
cloud, fog, and local machine, respectively. Through the theoretical safety analysis and
experimental evaluation, the feasibility of our scheme has been validated, which is really a
powerful supplement to existing cloud storage scheme.
SYSTEM REQUIREMENTS
HARDWARE REQUIREMENTS
• System : Pentium IV 2.4 GHz.
• Hard Disk : 250 GB.
• RAM : 2 GB
• Monitor : 15 VGA Colour.
• Mouse : Logitech.
SOFTWARE REQUIREMENTS
• Operating system : Windows7
• Coding Language : JAVA
• Data Base : MYSQL

AN EFFICIENT AND PRIVACY-PRESERVING BIOMETRIC IDENTIFICATION
SCHEME IN CLOUD COMPUTING
ABSTRACT
Biometric identification has become increasingly popular in recent years. With the
development of cloud computing, database owners are motivated to outsource the large size of
biometric data and identification tasks to the cloud to get rid of the expensive storage and
computation costs, which however brings potential threats to users’ privacy. In this paper, we
propose an efficient and privacy-preserving biometric identification outsourcing scheme.
Specifically, the biometric data is encrypted and outsourced to the cloud server. To execute a
biometric identification, the database owner encrypts the query data and submits it to the cloud.
The cloud performs identification operations over the encrypted database and returns the result to
the database owner. A thorough security analysis indicates the proposed scheme is secure even if
attackers can forge identification requests and collude with the cloud. Compared with previous
protocols, experimental results show the proposed scheme achieves a better performance in both
preparation and identification procedures.
SYSTEM REQUIREMENTS
• RAM : 2 GB

CHARACTERIZING AND PREDICTING EARLY REVIEWERS FOR EFFECTIVE
PRODUCT MARKETING ON E-COMMERCE WEBSITES
Abstract
Online reviews have become an important source of information for users before making
an informed purchase decision. Early reviews of a product tend to have a high impact on the
subsequent product sales. In this paper, we take the initiative to study the behavior characteristics
of early reviewers through their posted reviews on two real-world large e-commerce platforms,
i.e., Amazon and Yelp. In specific, we divide product lifetime into three consecutive stages,
namely early, majority and laggards. A user who has posted a review in the early stage is
considered as an early reviewer. We quantitatively characterize early reviewers based on their
rating behaviors, the helpfulness scores received from others and the correlation of their reviews
with product popularity. We have found that (1) an early reviewer tends to assign a higher
average rating score; and (2) an early reviewer tends to post more helpful reviews. Our analysis
of product reviews also indicates that early reviewers’ ratings and their received helpfulness
scores are likely to influence product popularity. By viewing review posting process as a
multiplayer competition game, we propose a novel margin-based embedding model for early
reviewer prediction. Extensive experiments on two different e-commerce datasets have shown
that our proposed approach outperforms a number of competitive baselines.
SYSTEM REQUIREMENTS
• RAM : 2 GB

CODETECT: FINANCIAL FRAUD DETECTION WITH ANOMALY FEATURE
DETECTION
Abstract
Financial fraud, such as money laundering, is known to be a serious process of crime that
makes illegitimately obtained funds go to terrorism or other criminal activity. This kind of illegal
activities involve complex networks of trade and financial transactions, which make it difficult to
detect the fraud entities and discover the features of fraud. Fortunately, trading/transaction
network and features of entities in the network can be constructed from the complex networks of
trade and financial transactions. Trading/transaction network reveals the interaction between
entities and thus anomaly detection on trading networks can reveal the entities involved in the
fraud activity; while features of entities are the description of entities and anomaly detection on
features can reflect details of the fraud activities. Thus, network and features provide
complementary information for fraud detection, which has potential to improve fraud detection
performance. However, the majority of existing methods focus on networks or features
information separately, which doesn't utilize both information. In this paper, we propose a novel
fraud detection framework, CoDetect, which can leverage both network information and feature
information for financial fraud detection. In addition, CoDetect can simultaneously detecting
financial fraud activities and the feature patterns associated with the fraud activities. Extensive
experiments on both synthetic data and real world data demonstrate the efficiency and the
effectiveness of the proposed framework in combating financial fraud, especially for money
laundering.
SYSTEM REQUIREMENTS
• RAM : 2 GB

CREDIT CARD FRAUD DETECTION USING ADABOOST AND MAJORITY VOTING
ABSTRACT
Credit card fraud is a serious problem in financial services. Billions of dollars are lost due
to credit card fraud every year. There is a lack of research studies on analyzing real-world credit
card data owing to confidentiality issues. In this paper, machine learning algorithms are used to
detect credit card fraud. Standard models are firstly used. Then, hybrid methods which use
AdaBoost and majority voting methods are applied. To evaluate the model efficacy, a publicly
available credit card data set is used. Then, a real-world credit card data set from a financial
institution is analyzed. In addition, noise is added to the data samples to further assess the
robustness of the algorithms. The experimental results positively indicate that the majority voting
method achieves good accuracy rates in detecting fraud cases in credit cards.
SYSTEM REQUIREMENTS
• RAM : 2 GB

PROVEST: Provenance-based Trust Model for Delay Tolerant Networks
ABSTRACT
Delay tolerant networks (DTNs) are often encountered in military network environments
where end-to-end connectivity is not guaranteed due to frequent disconnection or delay. This
work proposes a provenance-based trust framework, namely PROVEST
(PROVEnance-baSed Trust model) that aims to achieve accurate peer-to-peer trust assessment
and maximize the delivery of correct messages received by destination nodes while minimizing
message delay and communication cost under resource-constrained network environments.
Provenance refers to the history of ownership of a valued object or information. We leverage the
interdependency between trustworthiness of information source and information itself in
PROVEST. PROVEST takes a data-driven approach to reduce resource consumption in the
presence of selfish or malicious nodes while estimating a node’s trust dynamically in response to
changes in the environmental and node conditions. This work adopts a model-based method to
evaluate the performance of PROVEST (i.e., trust accuracy and routing performance) using
Stochastic Petri Nets. We conduct a comparative performance analysis of PROVEST against
existing trust-based and non-trust-based DTN routing protocols to analyze the benefits of
PROVEST. We validate PROVEST using a real dataset of DTN mobility traces.
SYSTEM REQUIREMENTS
• RAM : 2 GB

DISTRIBUTED FAULTY NODE DETECTION IN DELAY TOLERANT NETWORKS:
DESIGN AND ANALYSIS
ABSTRACT:
Propagation of faulty data is a critical issue. In case of Delay Tolerant Networks (DTN)
in particular, the rare meeting events require that nodes are efficient in propagating only correct
information. For that purpose, mechanisms to rapidly identify possible faulty nodes should be
developed. Distributed faulty node detection has been addressed in the literature in the context of
sensor and vehicular networks, but already proposed solutions suffer from long delays in
identifying and isolating nodes producing faulty data. This is unsuitable to DTNs where nodes
meet only rarely. This paper proposes a fully distributed and easily implementable approach to
allow each DTN node to rapidly identify whether its sensors are producing faulty data. The
dynamical behavior of the proposed algorithm is approximated by some continuous-time state
equations, whose equilibrium is characterized. The presence of misbehaving nodes, trying to
perturb the faulty node detection process, is also taken into account. Detection and false alarm
rates are estimated by comparing both theoretical and simulation results. Numerical results
assess the effectiveness of the proposed solution and can be used to give guidelines for the
algorithm design.
SYSTEM REQUIREMENTS
• RAM : 2 GB

AN EFFICIENT SECURITY AND DATA PROVENANCE FOR MULTI-HOP
INTERNET OF THINGS
ABSTRACT
Due to limited resources and scalability, security protocols for Internet of Things (IoT)
need to be light-weighted. The cryptographic solutions are not feasible to apply on small and
low-energy devices of IoT because of their energy and space limitations. In this paper, a light-
weight protocol to secure the data and achieving data provenance is presented for multi-hop IoT
network. The Received Signal Strength Indicator (RSSI) of communicating IoT nodes are used
to generate the link fingerprints. The link fingerprints are matched at the server to compute the
correlation coefficient. Higher the value of correlation coefficient, higher the percentage of
secured data transfer. Lower value gives the detection of adversarial node in between a specific
link. Data provenance has also been achieved by comparison of packet header with all the
available link fingerprints at the server. The time complexity is computed at the node and server
level, which is O(1). The energy dissipation is calculated for IoT nodes and overall network. The
results show that the energy consumption of the system presented in this paper is 52 mJ to 53 mJ
for each IoT node and 313.626 mJ for the entire network. RSSI values are taken in real time from
MICAz motes and simulations are performed on MATLAB for adversarial node detection, data
provenance and timecomplexity. Experimental results show that up to 97% correlation is
achieved when no adversarial node is present in the IoT network.
SYSTEM REQUIREMENTS
• RAM : 2 GB

MDSCLONE: MULTIDIMENSIONAL SCALING AIDED CLONE DETECTION IN
INTERNET OF THINGS
Abstract
Cloning is a very serious threat in the Internet of Things (IoT), owing to the simplicity for
an attacker to gather configuration and authentication credentials from a non-tamper-proof node,
and replicate it in the network. In this paper, we propose MDSClone, a novel clone detection
method based on multidimensional scaling (MDS). MDSClone appears to be very well suited to
IoT scenarios, as it (i) detects clones without the need to know the geographical positions of
nodes, and (ii) unlike prior methods, it can be applied to hybrid networks that comprise both
static and mobile nodes, for which no mobility pattern may be assumed a priori. Moreover, a
further advantage of MDSClone is that (iii) the core part of the detection algorithm can be
parallelized, resulting in an acceleration of the whole detection mechanism. Our thorough
analytical and experimental evaluations demonstrate that MDSClone can achieve a 100% clone
detection probability. Moreover, we propose several modifications to the original MDS
calculation, which lead to over a 75% speed up in large scale scenarios. The demonstrated
efficiency of MDSClone proves that it is a promising method towards a practical clone detection
design in IoT.
SYSTEM REQUIREMENTS
• RAM : 2 GB

STRUCTURAL BALANCE THEORY-BASED E-COMMERCE RECOMMENDATION
OVER BIG RATING DATA
Abstract
Recommending appropriate product items to the target user is becoming the key to ensure
continuous success of Ecommerce. Today, many E-commerce systems adopt various
recommendation techniques, e.g., Collaborative Filtering (abbreviated as CF)-based technique, to
realize product item recommendation. Overall, the present CF recommendation can perform very
well, if the target user owns similar friends (user-based CF), or the product items purchased and
preferred by target user own one or more similar product items (item-based CF). While due to
the sparsity of big rating data in E-commerce, similar friends and similar product items may be
both absent from the user-product purchase network, which lead to a big challenge to
recommend appropriate product items to the target user. Considering the challenge, we put
forward a Structural Balance Theory-based Recommendation (i.e., SBT-Rec) approach. In the
concrete, user-based recommendation: we look for target user’s “enemy” (i.e., the users having
opposite preference with target user); afterwards, we determine target user’s “possible friends”,
according to “enemy’s enemy is a friend” rule of Structural Balance Theory, and recommend the
product items preferred by “possible friends” of target user to the target user. likewise, for the
product items purchased and preferred by target user, we determine their “possibly similar
product items” based on Structural Balance Theory and recommend them to the target user. At
last, the feasibility of SBT-Rec is validated, through a set of experiments deployed on
MovieLens-1M dataset.
SYSTEM REQUIREMENTS
• RAM : 2 GB

A COMPREHENSIVE TRUSTWORTHY DATA COLLECTION APPROACH IN
SENSOR-CLOUD SYSTEMS
ABSTRACT
Nowadays, sensor-cloud systems have received wide attention from both academia and
industry. Sensor-cloud system not only improves performances of wireless sensor networks
(WSNs), but also combines different functional WSNs together to provide comprehensive
services. However, a variety of malicious attacks threaten the sensor-cloud security, such as
integrity, authenticity, availability and so on. Traditional available security mechanisms (e.g.
cryptography and authentication) are still vulnerable. Although there are schemes to provide
security by trust evaluation, the evaluation considers whether or not a sensor is credible only by
checking the communication behaviors. Furthermore, when mobile sensor sinks are employed to
collect sensing data, there appears a type of attacks called replicated sink attacks that are often
ignored in the previous work. These attacks may bring serious vulnerability to trustworthy data
collection in sensor-cloud systems. A comprehensive trustworthy data collection (CTDC)
approach is proposed for sensor-cloud systems. Three kinds of trust, i.e., direct trust, indirect
trust, and functional trust are defined to evaluate the trustworthiness of both sensors and mobile
sinks. Except for resisting malicious attacks, the performances of sensor-cloud, such as energy,
transmission distance and network throughput are also considered. It is shown that CTDC
correctly identifies malicious nodes and offers an improved performance in the data collection.
SYSTEM REQUIREMENTS
• RAM : 2 GB

PRIVACY-PRESERVING DATA ENCRYPTION STRATEGY FOR BIG DATA IN
MOBILE CLOUD COMPUTING
ABSTRACT
Privacy has become a considerable issue when the applications of big data are
dramatically growing in cloud computing. The benefits of the implementation for these emerging
technologies have improved or changed service models and improve application performances in
various perspectives. However, the remarkably growing volume of data sizes has also resulted in
many challenges in practice. The execution time of the data encryption is one of the serious
issues during the data processing and transmissions. Many current applications abandon data
encryptions in order to reach an adoptive performance level companioning with privacy
concerns. A novel data encryption approach is proposed, which is called Dynamic Data
Encryption Strategy (D2ES). Proposed approach aims to selectively encrypt data and use privacy
classification methods under timing constraints. This approach is designed to maximize the
privacy protection scope by using a selective encryption strategy within the required execution
time requirements. The performance of D2ES has been evaluated in experiments, which provides
the proof of the privacy enhancement.
SYSTEM REQUIREMENTS
• RAM : 2 GB

PROTECTING LOCATION PRIVACY FOR TASK ALLOCATION IN AD HOC
MOBILE CLOUD COMPUTING
ABSTRACT
Mobile cloud computing is an emerging cloud computing paradigm that integrates cloud
computing and mobile computing to enable many useful mobile applications. However, the
large-scale deployment of mobile cloud computing is hindered by the concerns on possible
privacy leakage. The privacy issues is studied in the ad hoc mobile cloud computing, and
propose a framework that can protect the location privacy when allocating tasks to mobile
devices. Proposed system is based on differential privacy and geocast, and allows mobile devices
to contribute their resources to the ad hoc mobile cloud without leaking their location
information. Develop analytical models and task allocation strategies that balance privacy,
utility, and system overhead in an ad hoc mobile cloud.
SYSTEM REQUIREMENTS
• RAM : 2 GB

SECURE AND PRIVACY PRESERVE DATA AGGREGATION AND RESOURCE
ALLOCATION IN CLOUD COMPUTING
ABSTRACT
Cloud computing is the growing demand in recent years. However, the privacy and
security threat on the stored data is major issue. The proposed work studies the security and
privacy threat on data, for the applications were data aggregation is necessary. The collected data
may reveal sensitive information if no security and privacy technique are applied. Thus the
proposed work proved to secure by implementing techniques such as homomorphic encryption.
Apart from the data aggregation and providing security and privacy to the collected data, it is
important to handle the data collection effectively, for this the proposed system is enhance to
provide the resource allocation. The cloud providers may have more than one cloud servers, in
which the data is allocated. The problem of resource allocation will further enhance the proposed
work to fulfill the needs of Cloud computing.
SYSTEM REQUIREMENTS
• RAM : 2 GB

DUAL-SERVER PUBLIC-KEY ENCRYPTION WITH KEYWORD SEARCH FOR
SECURE CLOUD STORAGE
ABSTRACT
Searchable encryption is of increasing interest for protecting the data privacy in secure
searchable cloud storage. In this paper, we investigate the security of a well-known
cryptographic primitive, namely, public key encryption with keyword search (PEKS) which is
very useful in many applications of cloud storage. Unfortunately, it has been shown that the
traditional PEKS framework suffers from an inherent insecurity called inside keyword guessing
attack (KGA) launched by the malicious server. To address this security vulnerability, we
propose a new PEKS framework named dual-server PEKS (DS-PEKS). As another main
contribution, we define a new variant of the smooth projective hash functions (SPHFs) referred
to as linear and homomorphic SPHF (LH-SPHF). We then show a generic construction of secure
DS-PEKS from LH-SPHF. To illustrate the feasibility of our new framework, we provide an
efficient instantiation of the general framework from a Decision Diffie–Hellman-based LH-
SPHF and show that it can achieve the strong security against inside the KGA.
SYSTEM REQUIREMENTS
• RAM : 2 GB

CONTRIBUTORY BROADCAST ENCRYPTION WITH EFFICIENT ENCRYPTION
AND SHORT CIPHERTEXTS
ABSTRACT
Broadcast encryption (BE) schemes allow a sender to securely broadcast to any subset of
members but require a trusted party to distribute decryption keys. Group key agreement (GKA)
protocols enable a group of members to negotiate a common encryption key via open networks
so that only the group members can decrypt the ciphertexts encrypted under the shared
encryption key, but a sender cannot exclude any particular member from decrypting the
ciphertexts. In this paper, we bridge these two notions with a hybrid primitive referred to as
contributory broadcast encryption (ConBE). In this new primitive, a group of members negotiate
a common public encryption key while each member holds a decryption key. A sender seeing the
public group encryption key can limit the decryption to a subset of members of his choice.
Following this model, we propose a ConBE scheme with short ciphertexts. The scheme is proven
to be fully collusion-resistant under the decision n-Bilinear Diffie-Hellman Exponentiation
(BDHE) assumption in the standard model. Of independent interest, we present a new BE
scheme that is aggregatable. The aggregatability property is shown to be useful to construct
advanced protocols.
SYSTEM REQUIREMENTS
• RAM : 2 GB

PRIVACY PROTECTION AND INTRUSION AVOIDANCE FORCLOUDLET-BASED
MEDICAL DATA SHARING
ABSTRACT
The popularity of wearable devices, along with the development of clouds and cloudlet
technology, there has been increasing need to provide better medical care. The processing chain
of medical data mainly includes data collection, data storage and data sharing, etc. Traditional
healthcare system often requires the delivery of medical data to the cloud, which involves users’
sensitive information and causes communication energy consumption. Practically, medical data
sharing is a critical and challenging issue. Thus in this paper, we build up a novel healthcare
system by utilizing the flexibility of cloudlet. The functions of cloudlet include privacy
protection, data sharing and intrusion detection. In the stage of data collection, we first utilize
Number Theory Research Unit (NTRU) method to encrypt user’s body data collected by
wearable devices. Those data will be transmitted to nearby cloudlet in an energy efficient
fashion. Secondly, we present a new trust model to help users to select trustable partners who
want to share stored data in the cloudlet. The trust model also helps similar patients to
communicate with each other about their diseases. Thirdly, we divide users’ medical data stored
in remote cloud of hospital into three parts, and give them proper protection. Finally, in order to
protect the healthcare system from malicious attacks, we develop a novel collaborative intrusion
detection system (IDS) method based on cloudlet mesh, which can effectively prevent the remote
healthcare big data cloud from attacks. Our experiments demonstrate the effectiveness of the
proposed scheme.
SYSTEM REQUIREMENTS
• RAM : 2 GB

COLLABORATIVE FILTERING-BASED RECOMMENDATION OF ONLINE SOCIAL
VOTING
ABSTRACT
Social voting is an emerging new feature in online social networks. It poses unique
challenges and opportunities for recommendation. In this paper, we develop a set of matrix
factorization (MF) and nearest-neighbor (NN)-based recommender systems (RSs) that explore
user social network and group affiliation information for social voting recommendation. Through
experiments with real social voting traces, we demonstrate that social network and group
affiliation information can significantly improve the accuracy of popularity-based voting
recommendation, and social network information dominates group affiliation information in NN-
based approaches. We also observe that social and group information is much more valuable to
cold users than to heavy users. In our experiments, simple meta path based NN models
outperform computation-intensive MF models in hot-voting recommendation, while users’
interests for non hot voting’s can be better mined by MF models. We further propose a hybrid
RS, bagging different single approaches to achieve the best top-k hit rate.
SYSTEM REQUIREMENTS
• RAM : 2 GB

MY PRIVACY MY DECISION: CONTROL OF PHOTO SHARING ON ONLINE
SOCIAL NETWORKS
ABSTRACT
Photo sharing is an attractive feature which popularizes Online Social Networks (OSNs).
Unfortunately, it may leak users’ privacy if they are allowed to post, comment, and tag a photo
freely. In this paper, we attempt to address this issue and study the scenario when a user shares a
photo containing individuals other than himself/herself (termed co-photo for short). To prevent
possible privacy leakage of a photo, we design a mechanism to enable each individual in a photo
be aware of the posting activity and participate in the decision making on the photo posting. For
this purpose, we need an efficient facial recognition (FR) system that can recognize everyone in
the photo. However, more demanding privacy setting may limit the number of the photos
publicly available to train the FR system. To deal with this dilemma, our mechanism attempts to
utilize users’ private photos to design a personalized FR system specifically trained to
differentiate possible photo co-owners without leaking their privacy. We also develop a
distributed consensus based method to reduce the computational complexity and protect the
private training set. We show that our system is superior to other possible approaches in terms of
recognition ratio and efficiency. Our mechanism is implemented as a proof of concept Android
application on Face book’s platform.
SYSTEM REQUIREMENTS
• RAM : 2 GB

AN EFFICIENT AND FINE-GRAINED BIG DATA ACCESS CONTROL SCHEME
WITH PRIVACY-PRESERVING POLICY
ABSTRACT
The access of the huge amount of big data becomes a very challenging issue, especially
when big data are stored in the cloud. Ciphertext-Policy Attributebased Encryption (CP-ABE) is
a promising encryption technique that enables end-users to encrypt their data under the access
policies defined over some attributes of data consumers and only allows data consumers whose
attributes satisfy the access policies to decrypt the data. In CP-ABE, the access policy is attached
to the ciphertext in plaintext form, which may also leak some private information about end-
users. Existing methods only partially hide the attribute values in the access policies, while the
attribute names are still unprotected. In this paper, we propose an efficient and fine-grained big
data access control scheme with privacy-preserving policy. Specifically, we hide the whole
attribute (rather than only its values) in the access policies. To assist data decryption, we also
design a novel Attribute Bloom Filter to evaluate whether an attribute is in the access policy and
locate the exact position in the access policy if it is in the access policy. Security analysis and
performance evaluation show that our scheme can preserve the privacy from any LSSS access
policy without employing much overhead.
SYSTEM REQUIREMENTS
• RAM : 2 GB

A Three-Layer Privacy Preserving Cloud Storage Scheme Based On Computational Intelligence in Fog Computing

Загружено:

Сведения о документе

Оригинальное название

Авторское право

Доступные форматы

Поделиться этим документом

Поделиться или встроить документ

Параметры публикации

Этот документ был вам полезен?

Это неприемлемый материал?

Авторское право:

Доступные форматы

A Three-Layer Privacy Preserving Cloud Storage Scheme Based On Computational Intelligence in Fog Computing

Загружено:

Авторское право:

Доступные форматы

A THREE-LAYER PRIVACY PRESERVING CLOUD STORAGE

SCHEME BASED ON COMPUTATIONAL INTELLIGENCE IN FOG

The development of cloud computing technology. With the explosive growth of

• System : Pentium IV 2.4 GHz.

• Hard Disk : 250 GB.

• Monitor : 15 VGA Colour.

• Operating system : Windows7

• Coding Language : JAVA

• Data Base : MYSQL

• System : Pentium IV 2.4 GHz.

• Hard Disk : 250 GB.

• Monitor : 15 VGA Colour.

• Operating system : Windows7

• Coding Language : JAVA

• Data Base : MYSQL

• System : Pentium IV 2.4 GHz.

• Hard Disk : 250 GB.

• Monitor : 15 VGA Colour.

• Operating system : Windows7

• Coding Language : JAVA

• Data Base : MYSQL

• System : Pentium IV 2.4 GHz.

• Hard Disk : 250 GB.

• Monitor : 15 VGA Colour.

• Operating system : Windows7

• Coding Language : JAVA

• Data Base : MYSQL

• System : Pentium IV 2.4 GHz.

• Hard Disk : 250 GB.

• Monitor : 15 VGA Colour.

• Operating system : Windows7

• Coding Language : JAVA

• Data Base : MYSQL

• System : Pentium IV 2.4 GHz.

• Hard Disk : 250 GB.

• Monitor : 15 VGA Colour.

• Operating system : Windows7

• Coding Language : JAVA

• Data Base : MYSQL

• System : Pentium IV 2.4 GHz.

• Hard Disk : 250 GB.

• Monitor : 15 VGA Colour.

• Operating system : Windows7

• Coding Language : JAVA

• Data Base : MYSQL

• System : Pentium IV 2.4 GHz.

• Hard Disk : 250 GB.

• Monitor : 15 VGA Colour.

• Operating system : Windows7

• Coding Language : JAVA

• Data Base : MYSQL

• System : Pentium IV 2.4 GHz.

• Hard Disk : 250 GB.

• Monitor : 15 VGA Colour.

• Operating system : Windows7

• Coding Language : JAVA

• Data Base : MYSQL

• System : Pentium IV 2.4 GHz.

• Hard Disk : 250 GB.

• Monitor : 15 VGA Colour.

• Operating system : Windows7

• Coding Language : JAVA

• Data Base : MYSQL