1,720,964 research outputs found
Application of SWSAL in Semantic Annotation of RESTful Web Services
No full textNowadays web services have become one of the main technologies in the development of web applications. According to that providers now offer an increasing number of capabilities as web services. Furthermore, in the recent years, such deployment trend has seen the success of REST architecture and, consequently, the proliferation of RESTful web services. This work focuses on the semantic description of RESTful web services. It shows how the SWSAL language, already used profitably to semantically annotate SOAP web services, can be used to semantically describe a web service compliant with the REST principles. The work establishes the bases for the application of SWSAL and its related researches to the RESTful web service area
An IPS for Web Applications
No full textAbstract
This work presents an IPS for web applications that combines anomaly detection, misuse detection, and a prevention module. This approach provides us a solution that produce a number of false positives and false negatives less than traditional solutions. The proposed system is also able to update the misuse and anomaly model according to feedback received by the security manager. Finally, in our system the anomaly model has been specifically designed for web applications. We implemented and experimented our system in a real service company. From the results arises an improvement with respect to other state-of-the-art WEBIDSs
Model Checking Grid Security
No full textGrid computing is one of the leading forms of high performance computing. Security in the grid
environment is a challenging issue that can be characterized as a complex system involving many
subtleties that may lead designers into error. This is similar to what happens with security protocols where
automatic verification techniques (specially model checking) have been proved to be very useful at design
time. This paper proposes a formal verification methodology based on model checking that can be applied
to host security verification for grid systems. The proposed methodology must take into account that a
grid system can be described as a parameterized model, and security requirements can be described as
hyperproperties. Unfortunately, both parameterized model checking and hyperproperty verification are,
in general, undecidable. However, it has been proved that this problem becomes decidable when jobs
have some regularities in their organization. Therefore, this paper presents a verification methodology
that reduces a given grid system model to a model to which it is possible to apply a ‘‘cutoff’’ theorem
(i.e., a requirement is satisfied by a system with an arbitrary number of jobs if and only if it is satisfied
by a system with a finite number of jobs up to a cutoff size). This methodology is supported by a set of
theorems, whose proofs are presented in this paper. The methodology is explained by means of a case
study: the Condor system
Going Beyond Counting First Authors in Author Co-citation Analysis
Full text linkThe present study examines one of the fundamental aspects of author co-citation analysis (ACA) - the way co-citation
counts are defined. Co-citation counting provides the data on which all subsequent statistical analyses and mappings
are based, and we compare ACA results based on two different types of co-citation counting - the traditional type that
only counts the first one among a cited work's authors on the one hand and a non-traditional type that takes into
account the first 5 authors of a cited work on the other hand. Results indicate that the picture produced through this non-traditional author co-citation counting contains more coherent author groups and is therefore considerably clearer. However, this picture represents fewer specialties in the research field being studied than that produced through the traditional first-author co-citation counting when the same number of top-ranked authors is selected and analyzed. Reasons for these effects are discussed
- …
