Distribution function for seasonal and annual rainfall over India

Distribution functions for seasonal (southwest monsoon) and annual rainfall at 53 long-record stations in India have been obtained. It was found that the frequency distributions are right skewed. Tests for normality show that while normal distribution gives a good fit to seasonal and annual rainfall at stations in some parts of India it does not give a good fit to seasonal and annual rainfall at stations over the major portion of the country. Tests of goodness of fit of the Gamma distribution, however, clearly indicate that this distribution provides a good fit to seasonal and annual rainfall at stations in different parts of the country

Quality of Service Centric Web Service Composition: Assessing Composition Impact Scale towards Fault Proneness

Service composition in service oriented architecture is an important activity. In regard to achieve the quality of service and secured activities from the web service compositions, they need to be verified about their impact towards fault proneness before deploying that service composition. Henceforth, here in this paper, we devised a novel statistical approach to assess the service composition impact scale towards fault proneness. The devised model explores the higher and lower ranges of the service composition impact scale, which is from the knowledge of earlier compositions that are notified as fault prone

Exploring Predicate Based Access Control for Cloud Workflow Systems

Authentication and authorization are the two crucial functions of any modern security and access control mechanisms. Authorization for controlling access to resources is a dynamic characteristic of a workflow system which is based on true business dynamics and access policies. Allowing or denying a user to gain access to a resource is the cornerstone for successful implementation of security and controlling paradigms. Role based and attribute based access control are the existing mechanisms widely used. As per these schemes, any user with given role or attribute respectively is granted applicable privileges to access a resource. There is third approach known as predicate based access control which is less explored. We intend to throw light on this as it provides more fine-grained control over resources besides being able to complement with existing approaches. In this paper we proposed a predicate-based access control mechanism that caters to the needs of cloud-based workflow systems

Hot Isostatic Pressing Technology for Defence and Space Applications

Hot isostatic pressing (HIP) technology has been established for the development of AISI-304 stainless steel and nickel base superalloy Inconel 718 integral turbine rotors, for liquid propulsion engine of Prithvi missile, and cryoengine of geostationary satellite launch vehicle (GSLV), respectively. Before making the full size rotors, the structure – property relationships in hot isostatic pressed (HIPed) 304 stainless steel and superalloy 718 were established. The HIPed steel and superalloy have shown near 100 per cent theoretical density, homogeneous, and fine grained microstructure. Their mechanical properties were found to be in agreement with those specified for the integral turbine rotors and hence, development of full size near net shaped integral turbine rotors was undertaken. The HIPed steel rotors subjected to the static engine tests have shown a satisfactory performance, and therefore a large number of rotors could be produced to fulfill the requirement of target labs. The HIP technology for the integral turbine rotors was found to be cost effective (about 50 per cent) over the conventional fabrication method which involves forging, machining, and welding of blades to the disk. The processing, structure, and properties of the HIPed 304 stainless steel and superalloy 718 in relation to the performance of integral turbine rotors for missile and space vehicle applications are discussed in this paper.Defence Science Journal, 2012, 62(1), pp.73-80, DOI:http://dx.doi.org/10.14429/dsj.62.37

Privacy and Classification Of Analyzed Data Using EMD

In recent years many researchers issued on data publishing with recommended settings .But privacy is a key issue here. Existing techniques such as K-anonymity and L-diversity should not provide effective and sufficient results for privacy preserving in data publishing. So in this paper we propose tree base algorithm for providing security, In this technique we arrange the data in tree based format for closeness of a data publishing and for retrieving data in sequential order. Our techniques also improved more security to micro data publishing and retrieving relevant information from micro data using attribute disclosure

Conjunctions of Among Constraints

Many existing global constraints can be encoded as a conjunction of among constraints. An among constraint holds if the number of the variables in its scope whose value belongs to a prespecified set, which we call its range, is within some given bounds. It is known that domain filtering algorithms can benefit from reasoning about the interaction of among constraints so that values can be filtered out taking into consideration several among constraints simultaneously. The present pa- per embarks into a systematic investigation on the circumstances under which it is possible to obtain efficient and complete domain filtering algorithms for conjunctions of among constraints. We start by observing that restrictions on both the scope and the range of the among constraints are necessary to obtain meaningful results. Then, we derive a domain flow-based filtering algorithm and present several applications. In particular, it is shown that the algorithm unifies and generalizes several previous existing results.Comment: 15 pages plus appendi

SECURING OUTSOURCED DATA REMOTELY ON OPEN NETS

An open cloud is standard model which providers make several sources, for example applications and storage, open to the general public. Public cloud services might be free or otherwise. Hybrid cloud is definitely an atmosphere that the company provides and controls some sources internally and it has many others for public use. You will find three major kinds of service within the cloud atmosphere: SaaS, PaaS, and laaS. Ideally, cloud-computing provider won't ever go bankrupt or get acquired with a bigger company with maybe new policies. But clients should be sure their data will stay available despite this kind of event. A malicious user, whether internal or exterior, just like a legal user will find this IP addresses too. Within this situation, malicious user will discover which physical servers the victim is applying then by implanting a malicious virtual machine at this place to launch a panic attack. Furthermore, simply because the program can run inside a Virtual machine does not necessarily mean it performs well in cloud atmosphere always. A hacker may use a cloud for hosting a malicious application for achieve his object which can be a Web sites attacks against cloud itself or organizing another user within the cloud. In cloud-computing where infrastructure is shared by many clients, Web sites attacks make have the possibility of getting much greater impact than against single tenanted architectures. In migration, available method should be predict adaptation time and then try to avoid cloud nodes overload by a few procedure for example partitioning and fragment and moving data in smaller sized bits of data and looking after the opportunity to run transactions while movement occurs. Indeed, because of the collaborative property of some applications, an information owner enables specific parties to decrypt the encrypted data stored around the cloud storage

Robust seed selection algorithm for k-means type algorithms

Selection of initial seeds greatly affects the quality of the clusters and in k-means type algorithms. Most of the seed selection methods result different results in different independent runs. We propose a single, optimal, outlier insensitive seed selection algorithm for k-means type algorithms as extension to k-means++. The experimental results on synthetic, real and on microarray data sets demonstrated that effectiveness of the new algorithm in producing the clustering resultsComment: 17 pages, 5 tables, 9figure