International Journal of Science Engineering and Advance Technology (IJSEAT)
Not a member yet
1075 research outputs found
Sort by
A Novel Subset Selection Clustering-Based Algorithm for High Dimensional Data
Feature selection, also known as variable selection, attribute selection or variable subset selection, is the process of selecting a subset of relevant features (variables, predictors) for use in model construction. Feature selection techniques are to be distinguished from feature extraction. Feature extraction creates new features from functions of the original features, whereas feature selection returns a subset of the features. Feature selection techniques are often used in domains where there are many features and comparatively few samples (or data points). It involves identifying a subset of the most useful features that produces compatible results as the original entire set of features. A feature selection algorithm may be evaluated from both the efficiency and effectiveness points of view. While the efficiency concerns the time required to find a subset of features, the effectiveness is related to the quality of the subset of features. Based on these criteria, a fast clustering-based feature selection algorithm, FAST, is proposed and experimentally evaluated in this paper. The FAST algorithm works in two steps. In the first step, features are divided into clusters by using graph-theoretic clustering methods. In the second step, the most representative feature that is strongly related to target classes is selected from each cluster to form a subset of features. Features in different clusters are relatively independent; the clustering-based strategy of FAST has a high probability of producing a subset of useful and independent features. To ensure the efficiency of FAST, we adopt the efficient minimum-spanning tree clustering method. The efficiency and effectiveness of the FAST algorithm are evaluated through an empirical study. Extensive experiments are carried out to compare FAST and several representative feature selection algorithms, namely, FCBF, ReliefF, CFS, Consist, and FOCUS-SF, with respect to four types of well-known classifiers, namely, the probability-based Naive Bayes, the tree-based C4.5, the instance-based IB1, and the rule-based RIPPER before and after feature selection. The results, on 35 publicly available real-world high dimensional image, microarray, and text data, demonstrate that FAST not only produces smaller subsets of features but also improves the performances of the four types of classifier
Verification Of Scalable Distributed Service Integrity For Software-As-A-Service Clouds
Cloud is providing 3 types of services IaaS, PaaS and SaaS. Software as a Service (SaaS) is a software distribution model in which applications are hosted by a vendor or service provider and made available to customers over a network, typically the Interne. However, due to their sharing nature, SaaS clouds are vulnerable to malicious attacks SaaS cloud systems enable application service providers to deliver their applications via massive cloud computing infrastructures.. In this paper, we present IntTest, a scalable and effective service integrity attestation framework for SaaS clouds. IntTest provides a novel integrated attestation graph analysis scheme that can provide stronger attacker pinpointing power than previous schemes. Moreover, IntTest can automatically enhance result quality by replacing bad results produced by malicious attackers with good results produced by benign service providers. We have implemented a prototype of the IntTest system and tested it on a production cloud computing infrastructure using IBM System S stream processing applications. Our experimental results show that IntTest can achieve higher attacker pinpointing accuracy than existing approaches. IntTest does not require any special hardware or secure kernel support and imposes little performance impact to the application, which makes it practical for large-scale cloud systems
Secure Broker-Less Publish/Subscribe Systems Using Identity-Based Encryption
publish–subscribe is a messaging pattern where senders of messages, called publishers, do not program the messages to be sent directly to specific receivers, called subscribers. provisioning of basic security mechanisms such as authentication and confidentiality is highly challenging in a content based publish/subscribe system. Authentication of publishers and subscribers is difficult to achieve due to the loose coupling of publishers and subscribers. Likewise, confidentiality of events and subscriptions conflicts with content-based routing. This paper presents a novel approach to provide confidentiality and authentication in a broker-less content-based publish/subscribe system. The authentication of publishers and subscribers as well as confidentiality of events is ensured, by adapting the pairing-based cryptography mechanisms, to the needs of a publish/subscribe system. Furthermore, an algorithm to cluster subscribers according to their subscriptions preserves a weak notion of subscription confidentiality. In addition to our previous work [20], this paper contributes 1) use of searchable encryption to enable efficient routing of encrypted events, 2) multicredential routing a new event dissemination strategy to strengthen the weak subscription confidentiality, and 3) thorough analysis of different attacks on subscription confidentiality. The overall approach provides fine-grained key management and the cost for encryption, decryption, and routing is in the order of subscribed attributes. Moreover, the evaluations show that providing security is affordable w.r.t. 1) throughput of the proposed cryptographic primitives, and 2) delays incurred during the construction of the publish/subscribe overlay and the event dissemination
Results Search from Web Databases using automatic Annotation Wrapper
Web database technologies define the way that these forms canconnect to and retrieve data from database servers.Now a day’s countlessdatabases have become web accessible through HTML form-based search interfaces. A typical result page returned from a WDB has multiple search result records (SRRs).Web search engines are designed to search information in the web database and to return dynamic web pages. Internet presents a huge amount of useful information which is usually formatted for its users, which makes it difficult to extract relevant data from various sources. Web pages are retrieved when a query is submitted to the search interface. Each web page contains several search result records related to user query. Every SRR contains multiple data units each of which describes one aspect of a real-world entity. Then SRR get extracted and assigned meaningful labels. The Web has become the preferred medium for many database applications, such as e-commerce and digital libraries. After the successful extraction align the data units into different groups where, data inside the same group have the same semantic(meaning).Then automatically annotation wrapper can generated and used to annotate new result records from the same web database
Latest Trends in Financial Management and Financial services
The financing and financial services are fast moving from year to year due to the current issues in the economy which have a direct relation with the latest technology, political and regulatory authority. Financial institutions are competing to provide fast services at low interest rates in relation to the quality of assets. Non-banking institutions are aggressive in providing financial services with innovative strategies, while trying to minimize the risk rate. Full digital banking and mobile banking are providing flexibility, adaptability, integration and efficiency. Market niches have to be addressed with different strategies. Technology is being used in the financial markets, the availability of skilled manpower to address the issues related therein is a challenge for the financial institutions. Daily finance and micro finance are playing a vital role in the Indian economy which does not have a regulating authority. These fulfill the immediate financial requirement of petty businesses which are not in the purview of the government or the regulatory body.. Large banks do not have the ease of providing finance because of the complex procedures, rules and regulations within which banks have to function. There exists a wide gap between sect oral financial requirements that needs to be addressed by the Government with public private partnership. The transparency in maintaining and sharing the relevant data with the help of emerging technologies will lead to healthy financial markets. While some banks are trying to deal with historic loses reflected in their balance sheets. The aim of the study is to explore the business activities of banks with a special focus on their lending behavior and responsiveness to unconventional monetary policy. Deleveraging has been mainly via market to market assets falling in value and policy is now serving to reflate these assets without a strong impact on lending. . A study shows that GSIFI banks are least responsive to policy. Non GSIFI banks respond to the lending rates spread to cash rates, the spread between lending rates and the alternative investment in Government bonds, and the distance to default ( the bank’s solvency). The study would show that better lending in the US is a result of safer banks and a better spread to govt. bongs – yields on the later are too attractive relative to lending rates in Europe. Finally, the paper comments on the problem of using cyclical tools to address structural problems in banks and suggests Which alternative policies would better facilitate A FINANCIAL SYSTEM MORE aligned with lending
Water Pumping Arrangement for Solar PV ImpartialUtilizing PMSM Drive
This paper assesses courses in which they can be made productive. The part of productivity principles in accomplishing this objective and the propriety of existing measures is assessed. With the constant diminishing of the expense of sun oriented cells, there is an expanding intrigue and needs in photovoltaic (PV) framework applications taking after way of life changes. Water pumping framework fueled by sun powered cell generators are a standout amongst the most imperative applications. The variance of sun oriented vitality on one hand and the need to improve accessible sun based vitality on the other, it is valuable to grow new effective and adaptable modes to control engines that entrain the pump. A vectorial control of a no concurrent engine sustained by a photovoltaic framework is proposed. This paper examines a photovoltaic-electro technician chain, made out of a PV generator, DC-AC converter, a vector controlled affectation engine and outward pump. The PV generator is compelled to work at its greatest force point by utilizing a fitting hunt calculation incorporated in the vector control. The enhancement is acknowledged without need to adding a DC-DC converter to the chain. The engine supply is likewise guaranteed in all separation conditions. Reproduction results demonstrate the viability and achievability of such a methodology. Results are displayed in view of MATLAB/SIMULINK. This report proposes another converter for photovoltaic water pumping without the utilization of substance stockpiling components, for example, batteries. The converter is intended to drive a PMSM Motor specifically from PV vitality. The utilization of PMSM Motor gives a superior answer for the business dc engine water pumping framewor
Distributed access control with unknown validation of information stored in clouds
We propose another decentralized access control plan for secure information storage in clouds that backings anonymous validation. In the proposed plan, the cloud checks the arrangement's legitimacy without knowing the client's identity before storing information. Our plan likewise has the included element of access control in which just legitimate clients have the capacity to decrypt the stored data. The plan counteracts replay attacks and backings creation, change, and perusing information stored in the cloud. We likewise address client repudiation. Also, our verification and access control plan is decentralized and strong, not at all like different access control plans intended for clouds which are concentrated. The correspondence, calculation, and capacity overheads are similar to brought together methodologies
A Novel Approach For Large-Scale D ata Processing Platform On Peer- To- Peer Based Bestpeer++
We introduce BestPeer++, a framework which conveys versatile information sharing administrations for corporate system applications in the cloud taking into account BestPeer—a distributed (P2P) based information administration stage. By incorporating distributed computing, database, and P2P innovations into one framework, BestPeer++provides a sparing, adaptable and versatile stage for corporate system applications and conveys information sharing administrations to members taking into account the broadly acknowledged pay-as-you-go plan of action. We assess BestPeer++ on Amazon EC2 Cloud stage. The benchmarking results demonstrate that BestPeer++ beats HadoopDB, an as of late proposed substantial scale information preparing framework, in execution when both frameworks are utilized to handle normal corporate system workloads
Implementation And Evaluation Of Privacy Preserving Protocol
Now a day’s web search portals provide information to different kinds of people. But it is providing irrelevant information that is not related to user requirements. To improve results accuracy we introducing new framework named as personalized web search along with user customizable personal search which provides relevant results and privacy for user given query.In this framework including two algorithms those are greedyDP and greedyIL for online generalization
Explicit Uncertainty word directing through Data Mining
Searching a keyword on an enormous a colossal is somewhat easier, however the search over a enlarge range of structured and connected information creates a problem. Routing keywords solely to applicable sources will scale back the high value of looking of queries over all sources. It’s tough for net user to use this net information by means that of SQL or SPARQL. we tend to rent a keyword component relationship outline that succinctly represents relationships between keywords and also the information parts referred to as the set-level keyword-element relationship graph (KERG).A structure rating mechanism is recommended for computing the relevant of routing plans supported the extent of keyword, information parts , component sets and sub graphs that connect these parts. The web may be a not operation it's solely provides a link for looking the online document supported the keyword. The question may be shaped from keywords that square measure wont to retrieve the document. It’s tough for the standard net users to take advantage of this net information by means that of structured queries exploitation languages like SQL or SPARQL. In info analysis, most of the approaches use solely the only supply solutions. The most issue here is computing the foremost relevant mixtures of sources. To route keywords solely to relevant sources, a completely unique methodology is projected for computing top-k routing plans supported their keyword question. The keyword-element relationship outline is employed to represents the relationships between keywords and also the information parts. Structure rating mechanism is projected for computing the connection of routing plans supported scores at the extent of keywords and information parts. It’s no data regarding the command language and it as hostile structured queries. That the schema or the underlying information is required