6866472
Multi-signers Strong Designated Verifier Signature Scheme
Designated verifier signature (DVS) does not provide non-repudiation property of traditional digital signatures. Multi-signers strong designated verifier signature (MS-SDVS) scheme is required in some cases for the privacy consideration. In this paper the definition and security model of MS-SDVS scheme are presented, and a concrete MS-SDVS scheme is proposed from bilinear pairing. The proposed scheme has the property of non-transferability and unforgeability in the random oracle model under the assumption of the bilinear computational Diffie-Hellman problem (BCDH). This is the first MS-SDVS scheme. The signature length of the proposed scheme is independent of the number of signers, and the proposed scheme can be modified to a multi-signature scheme.
1034257
A Web Service Adapter with Contract-Oriented Methodology
Loose coupling is a cornerstone for Service-Oriented Architecture (SOA). Service contracts enable loose coupling, because they conceal internal details of services from the outside world behind the facade. However, current works on service oriented analysis and design (SOAD) largely focus on defining processes for developing business processes and services without considering variability in details. In this paper, a Web Service adapter of service-contract oriented is presented in order to enhance the applicability and reusability of such services. We also introduce some critical issues about service contract analysis engine, skeleton code generate engine and web-based WSDL editor in the Web Service adapter. Additionally, the Web Service adapter designed in this paper is compared with related tools, and the results indicate that our methods demonstrate a more desirable interactivity and stability.
775586
Efficient Video Authentication for H.264/AVC
This paper proposed a novel and efficient scheme to authenticate the H.264/AVC video. The scheme makes an accurate usage of the tree-structured motion compensation, motion estimation and Lagrangian optimization of the standard. Authentication information is embedded strictly based on the best mode decision strategy in the sense that if undergone any spatial and temporal attacks, the scheme can detect the tampering by the sensitive mode change. And the experimental results prove the effectiveness the algorithm against many transcoding and signal processing attacks
6285095
Building XML Data Warehouse Based on Frequent Patterns in User Queries
With the proliferation of XML-based data sources available across the Internet, it is increasingly important to provide users with a data warehouse of XML data sources to facilitate decision-making processes. Due to the extremely large amount of XML data available on web, unguided warehousing of XML data turns out to be highly costly and usually cannot well accommodate the users needs in XML data acquirement. In this paper, we propose an approach to materialize XML data warehouses based on frequent query patterns discovered from historical queries issued by users. The schemas of integrated XML documents in the warehouse are built using these frequent query patterns represented as Frequent Query Pattern Trees (FreqQPTs). Using hierarchical clustering technique, the integration approach in the data warehouse is flexible with respect to obtaining and maintaining XML documents. Experiments show that the overall processing of the same queries issued against the global schema become much efficient by using the XML data warehouse built than by directly searching the multiple data sources.
13486467
Computing Exact p-Value for Structured Motif
Extracting motifs from a set of DNA sequences is important in computational biology. Occurrence probability is a common used statistics to evaluate the statistical significance of a motif. A main problem is how to calculate the occurrence probability of the motif on the random model of DNA sequence efficiently and accurately. In this paper, we are interested in a particular motif model which is useful in transcription process. This motif, which is called structured motif, is composed two motif words on single nucleotide alphabet and with fixed spacers between them. We present an efficient algorithm to calculate the exact occurrence probability of a structured motif on a given sequence. It is the first nontrivial algorithm to calculate the exact p-value for such kind of motifs.
18578234
Texture-Based Image Retrieval by Edge Detection Matching GLCM
Content-Based Image Retrieval (CBIR) system is emerging as an important research area, users can search and retrieve images based on their properties such as shape, color and texture from the image database. Usually texture-based image retrieval just consider an original image of coarseness, contrast and roughness, actually there is much texture information in the edge image. This paper proposed a novel approach to retrieve images by texture characterization using a composition of edge information and co-occurrence matrix properties. The proposed method gives encouraging results when comparing its retrieval performance to that of the traditional co-occurrence matrices and Yaopsilas approach.
14510404
Model replication: transformations to address model scalability
2 SUMMARY In Model-Driven Engineering, it is often desirable to evaluate different design alternatives as they relate to scalability issues of the modeled system. A typical approach to address scalability is model replication, which starts by creating base models that capture the key entities as model elements and their relationships as model connections. A collection of base models can be adorned with necessary information to characterize a specific scalability concern as it relates to how the base modeling elements are replicated and connected together. In current modeling practice, such model replication is usually accomplished by scaling the base model manually. This is a time-consuming process that represents a source of error, especially when there are deep interactions between model components. As an alternative to the manual process, this paper presents the idea of automated model replication through a model transformation process that expands the number of elements from the base model and makes the correct connections among the generated modeling elements. The paper motivates the need for model replication through case studies taken from models supporting different domains.