International Journal of Science Engineering and Advance Technology (IJSEAT)
Not a member yet
1075 research outputs found
Sort by
A LDSS-CP-ABE Algorithm to Migrate Major Computation Overhead from Mobile Devices on to Proxy Server
Cloud has hugequantity of resources. In such a situation, to attain the acceptable presentation, it is indispensable to usage the possessionsdelivered by the cloud service provider (CSP) to stock and segment the data. At the moment, many cloud mobile claims have been extensivelycastoff. In these claims, data owners can upload their photos, videos, documents and other files to the cloud and segment these data with other data users they like to stake. Explanations with stumpy computational overhead are in prodigious need for mobile cloud applications. In this paper, we recommend a lightweight data sharing scheme (LDSS) for mobile cloud computing. The investigational results show that LDSS can confirm data concealment in mobile cloud and decrease the overhead on users’ side in mobile cloud
A Reliable Traffic and Energy Aware Routing Protocol for Diverse Wireless Sensor Networks
Wireless Sensor Network (WSN) knowledge is a significant building block of IoT scope. Thought of heterogeneity e.g., energy, link and computational heterogeneities can recover the presentation of WSN routing algorithms in rapports of system generation, steadiness, dependability, network delay, etc. A fresh routing algorithm named Traffic and Energy Aware Routing (TEAR) is presented, which contemplates node’s traffic requirements laterally with its liveliness levels while production CH selection. TEAR displays advances in terms of solidity period, consistent lifetime of the WSN before the expiry of its first node ended existing algorithms EACH, SEP and DEEC under the situation
A survey on detecting financial fraud with anomaly feature detection
Trading/transaction arrange uncovers the cooperation among substances and therefore abnormality identification on exchanging systems can uncover the elements associated with the fraud movement; while highlights of elements are the portrayal of elements and irregularity location on highlights can reflect subtleties of the fraud exercises. In this way, system and highlights give integral data to fraud discovery, which can possibly improve fraud identification execution. Be that as it may, most of existing strategies center on systems or highlights data independently, which doesn't use both data. In this, we propose a novel fraud recognition structure, CoDetect, which can use both system data and highlight data for money related fraud location. What's more, CoDetect can all the while distinguishing money related fraud exercises and the element designs related with the fraud exercises
A Scalable Framework To Allow Users For Keyword Search With Access Control Over Encrypted Data
In certain conditions, the keywords that the client searches on are just semantically identified with the data instead of through a definite or fluffy match. Subsequently, semantic-based keywordsearch over encoded cloud data is the fate of central significance. Be that as it may, existing plans as a rule rely on a worldwide word reference, which influences the precision of indexed lists as well as purposes wastefulness in data refreshing. Also, albeit compound keywordsearch is basic by and by, the current methodologies just procedure them as single words, which split the first semantics and accomplish low exactness. To address these impediments, we at first propose a Compound Concept Semantic Similarity (CCSS) estimation strategy to gauge the semantic closeness between compound ideas. Next, by incorporating CCSS with Locality-Sensitive Hashing (LSH) capacity and the safe k-Nearest Neighbor conspire, a Semantic-based Compound Keyword Search (SCKS) plot is proposed. SCKS accomplishes semantic-based search as well as multi-keywordsearch and positioned keywordsearch. Furthermore, SCKS likewise disposes off the predefined worldwide library and can effectively bolster data update.
Efficient searchble technique to retrive ranked documents in cloud
A secure searchable encryption system is presented to allow searching of encrypted user data in the cloud. The system concurrently supports fuzzy keyword searching and matched results ranking, which are two important factors in facilitating practical searchable encryption. A chaotic fuzzy conversion technique is proposed to support secure fuzzy keyword indexing, storage and query. A secure posting list is also created to rank the matched results while maintaining the privacy and confidentiality of the user data, and saving the resources of the user mobile device
Distributional Facts of Microfilaria from the 24 Wards of Narasannapetal, Srikakulam
The disease filarial has a major socio-economic problem in India. THE present study in filariasis patients was carried out from 2014 to 15. The total population of Narasannapeta town is 36100 with constituted 24 wards. During the study contacted with local P.H.C and government hospitals. To confirm the filariasis infected populated area. night survey were conducted for Conventional Night blood smears because of the nocturnally periodic type, where, their mosquito vectors was most likely to bite, also decreased peripheral temperature may attract more mf, which was the main strain in India shows a marked peak of mf density in the peripheral blood circulation, during the night hours. Followed by collection of blood samples, identification of samples, Fixation, Storage, Staining and mounting of mf and finally examined for number of parasites
High Data Utility by Employing the Large Scale Data Sampling and Length Constraint Strategy
We intend an original differential private frequent item sets mining algorithm for big data by integration the ideas which has improved presentation due to the new example and improved truncation performance. We construct our algorithm on FP-Tree for recurrent item sets mining. In arrange to resolve the trouble of structure FP-Tree with large-scale data; we initial utilize the sampling idea to get hold of delegate data to colliery probable congested recurrent item sets, which are presently used to come across the last everyday items in the large-scale data. In count, we occupy the length constriction policy to get to the bottom of the predicament of elevated global compassion. In particular, we use sequence corresponding thoughts to realize the most an alogous string in the source dataset, and put into operation transaction truncation for attain the lowest information defeat. We lastly add the Laplace noise for frequent item sets to make certain privacy guarantees
Efficient Search On Encrypted Files In Cloud
A progressive characteristic based encryption conspires is first intended for an document collection. A lot of archives can be scrambled together on the off chance that they share an incorporated access structure. Contrasted and the Ciphertext-Policy Attribute-Based Encryption (CP-ABE) plans, both the Ciphertext extra room and time expenses of encryption/unscrambling are spared. At that point, a document structure named Attribute-Based Retrieval features (ARF) tree is developed for the archive accumulation dependent on the Term Frequency-Inverse Document Frequency(TF-IDF) show and the reports' qualities. A profundity first search calculation for the ARF tree is intended to improve the hunt effectiveness which can be additionally improved by parallel computing. With the exception of the archive accumulations, our plan can be additionally connected to different datasets by altering the ARF tree slightly
A new mechanism to search ciphertext data in cloud in fog computing
We first present a Lightweight Fine-Grained Ciphertext Search (LFGS) system in mist processing by expanding Ciphertext-Policy Attribute-Based Encryption (CP-ABE) and Searchable Encryption (SE) innovations, which can accomplish fine-grained access control and keyword search all the while. The LFGS can move fractional computational and capacity overhead from end clients to picked mist nodes. Besides, the fundamental LFGS system is improved to help conjunctive keyword search and attribute update to abstain from returning immaterial query items and illicit gets. The formal security examination demonstrates that the LFGS system can oppose Chosen-Keyword Attack (CKA) and Chosen-Plaintext Attack (CPA), and the recreation. Utilizing a genuine world dataset shows that the LFGS system is effective and possible, practically speaking
Model user behaviour of posting messages for topic trend detection
However, now and again, people might need to know when to re-hot a topic, i.e., make the point mainstream once more. In this paper, we address this issue by presenting a fleeting User Topic Participation (UTP) demonstrates which models users' practices of posting messages. The UTP display takes into account users' interests, friend-circles, and unforeseen events in online interpersonal organizations. Additionally, it thinks about the persistent transient displaying of points, since themes are changing constantly after some time. Moreover, a weighting plan is proposed to smooth the changes in topic re-hotting forecast.