pinecone/core-2020-05-10-deduplication huggingface dataset:
Examining Indistinguishability-Based Proof Models for Key Establishment Protocols

We examine various indistinguishability-based proof models for key establishment protocols, namely the Bellare & Rogaway (1993,1995), the Bellare, Pointcheval, & Rogaway (2000), and the Canetti & Krawczyk (2001) proof models. We then consider several variants of these proof models, identify several subtle differences between these variants and models, and compare the relative strengths of the notions of security between the models. For each of the pair of relations between the models (either an implication or a non-implication), we provide proofs or counter-examples to support the observed relations. We also reveal a drawback with the original formulation of the Bellare, Pointcheval, & Rogaway (2000) model, whereby the Corrupt query is not allowed. As a case study, we use the Abdalla & Pointcheval (2005) three-party password-based key exchange protocol (3PAKE), which carries a proof of security in the Bellare, Pointcheval, & Rogaway (2000) model. We reveal a previously unpublished flaw in the protocol, and demonstrate that this attack would not be captured in the model due to the omission of the Corrupt query
Errors in Computational Complexity Proofs for Protocols

Proofs are invaluable tools in assuring protocol implementers about the security properties of protocols. However, several instances of undetected flaws in the proofs of protocols (resulting in flawed protocols) undermine the credibility of provably-secure protocols. In this work, we examine several protocols with claimed proofs of security by Boyd & Gonzalez-Nieto (2003), Jakobsson & Pointcheval (2001), and Wong & Chan (2001), and an authenticator by Bellare, Canetti, & Krawczyk (1998). Using these protocols as case studies, we reveal previously unpublished flaws in these protocols and their proofs. We hope our analysis will enable similar mistakes to be avoided in the future
Fuzzy multiple heuristic orderings for examination timetabling

In this paper, we address the issue of ordering exams by simultaneously considering two separate heuristics using fuzzy methods. Combinations of two of the following three heuristic orderings are employed: largest degree, saturation degree and largest enrolment. The fuzzy weight of an exam is used to represent how difficult it is to schedule. The decreasingly ordered exams are sequentially chosen to be assigned to the last slot with least penalty cost value while the feasibility of the timetable is maintained throughout the process. Unscheduling and rescheduling exams is performed until all exams are scheduled. The proposed algorithm has been tested on 12 benchmark examination timetabling data sets and the results show that this approach can produce good quality solutions. Moreover, there is significant potential to extend the approach by including a larger range of heuristics
Hierarchical multi-classification with predictive clustering trees in functional genomics

This paper investigates how predictive clustering trees can be used to predict gene function in the genome of the yeast Saccharomyces cerevisiae. We consider the MIPS FunCat classification scheme, in which each gene is annotated with one or more classes selected from a given functional class hierarchy. This setting presents two important challenges to machine learning: (1) each instance is labeled with a set of classes instead of just one class, and (2) the classes are structured in a hierarchy; ideally the learning algorithm should also take this hierarchical information into account. Predictive clustering trees generalize decision trees and can be applied to a wide range of prediction tasks by plugging in a suitable distance metric. We define an appropriate distance metric for hierarchical multi-classification and present experiments evaluating this approach on a number of data sets that are available for yeast.status: publishe
An Approach to Temporal-Aware Procurement of Web Services

Es también una ponencia de: International Conference on Service-Oriented Computing: ICSOC 2005: Service-Oriented Computing - ICSOC 2005 pp 170-184. book ISBN: 978-3-540-30817-1 e-ISBN: 978-3-540-32294-8In the context of web service procurement (WSP), temporal–awareness
refers to managing service demands and offers which are subject to validity periods,
i.e. their evaluation depends not only on quality of service (QoS) values but
also on time. For example, the QoS of some web services can be considered critical
in working hours (9:00 to 17:00 from Monday to Friday) and irrelevant at any
other moment. Until now, the expressiveness of such temporal–aware specifications
has been quite limited. As far as we know, most proposals have considered
validity periods to be composed of a single temporal interval. Other proposals,
which could allow more expressive time–dependent specifications, have not performed
a detailed study about all the underlying complexities of such approach,
in spite of the fact that dealing with complex expressions on temporality is not a
trivial task at all. As a matter of fact, it requires a special design of the so–called
procurement tasks (consistency and conformance checking, and optimal selection).
In this paper, we present a constraint–based approach to temporal–aware
WSP. Using constraints allows a great deal of expressiveness, so that not only demands
and offers can be assigned validity periods but also their conditions can be
assigned (possibly multiple) validity temporal subintervals. Apart from revising
the semantics of procurement tasks, which we previously presented in the first
edition of the ICSOC conferences, we also introduce the notion of the covering
set of a demand, a topic which is closely related to temporality.Ministerio de Ciencia y Tecnología TIC2003-02737-C02-0
WofBPEL: A Tool for Automated Analysis of BPEL Processes

Web service composition refers to the creation of new (Web) services by combination of functionality provided by existing ones. This paradigm has gained significant attention in the Web services community and is seen as a pillar for building service-oriented applications. A number of domain-specific languages for service composition have been proposed with consensus being formed around a process-oriented language known as BPEL. The kernel of BPEL consists of simple communication primitives that may be combined using control-flow constructs expressing sequence, branching, parallelism, synchronisation, etc. As a result, BPEL process definitions lend themselves to static flow-based analysis techniques. In this paper, we describe a tool that performs two types of static checks and extracts meta-data to optimise dynamic resource management. The tool operates by translating BPEL processes into Petri nets and exploiting existing Petri net analysis techniques. It relies on a comprehensive and rigorously defined mapping of BPEL constructs into Petri net structures
Grid-ODF: detecting outliers effectively and efficiently in large multi-dimensional databases

[Abstract]: In this paper, we will propose a novel outlier mining algorithm, called Grid-ODF, that takes into account both the local and global perspectives of outliers for effective detection. The notion of Outlying Degree Factor (ODF), that reflects the factors of both the density and distance, is introduced to rank outliers. A grid structure partitioning the data space is employed to enable Grid-\ud
ODF to be implemented efficiently. Experimental results show that Grid-ODF outperforms existing outlier detection algorithms such as LOF and KNN-distance in terms of effectiveness and efficiency
Algal bloom prediction with particle swarm optimization algorithm

Precise prediction of algal booms is beneficial to fisheries and environmental management since it enables the fish farmers to gain more ample time to take appropriate precautionary measures. Since a variety of existing water quality models involve exogenous input and different assumptions, artificial neural networks have the potential to be a cost-effective solution. However, in order to accomplish this goal successfully, usual problems and drawbacks in the training with gradient algorithms, i.e., slow convergence and easy entrapment in a local minimum, should be overcome first. This paper presents the application of a particle swarm optimization model for training perceptrons to forecast real-time algal bloom dynamics in Tolo Harbour of Hong Kong, with different lead times on the basis of several input hydrodynamic and/or water quality variables. It is shown that, when compared with the benchmark backward propagation algorithm, its results can be attained both more accurately and speedily.Department of Civil and Environmental EngineeringAuthor name used in this publication: K. W. ChauSeries: Lecture notes in computer science2005-2006 > Academic research: refereed > Publication in refereed journalpreprint_postprin
Developing communities and collections with \ud
new media and information literacy

As part of its many functions, the reference library is charged with developing both its collection and its user community. These two functions are sometimes pursued as separate initiatives (with separate funding) by library managers. In Australia, the State Library of Queensland (SLQ) is committed to an exciting policy of simultaneous collection development and community engagement by integrating public programs with new media technologies. SLQ’s Mobile Multimedia Laboratory is a purpose-designed portable digital creativity workshop which is made available to communities as a powerful platform to capture and disseminate local digital culture, and also to promote and train community members in information literacy. The Mobile Multimedia Laboratory facility operates in conjunction with SLQ’s Queensland Stories project, an exciting portal for the display and promotion of community co-created multimedia. Together, the Mobile Multimedia Laboratory and the Queensland Stories initiatives allow the SLQ to directly engage with existing and new communities, and also to increase its digital collection with community created content. Not only are both initiatives relatively cost-effective, they have a positive impact upon information literacy within the state
Comparison of the Expressiveness of Timed Automata and Time Petri Nets

International audienceIn this paper we consider the model of Time Petri Nets (TPN) where time is associated with transitions. We also consider Timed Automata (TA) as defined by Alur \& Dill, and compare the expressive- ness of the two models w.r.t. timed language acceptance and (weak) timed bisimilarity. We first prove that there exists a TA A s.t. there is no TPN (even unbounded) that is (weakly) timed bisimilar to A. We then propose a structural translation from TA to (1-safe) TPNs preserv- ing timed language acceptance. Further on, we prove that the previous (slightly extended) translation also preserves weak timed bisimilarity for a syntactical subclass $T_{Asyn}(\leq,\geq)$ of TA. For the theory of TPNs, the consequences are: 1) TA, bounded TPNs and 1-safe TPNs are equally expressive w.r.t. timed language acceptance; 2) TA are strictly more expressive than bounded TPNs w.r.t. timed bisimilarity; 3) The subclass $T_{Asyn}(\leq,\geq)$, bounded and 1-safe TPNs ''`a la Merlin'' are equally ex- pressive w.r.t. timed bisimilarity
Merging clustering algorithms in mobile Ad Hoc networks

2nd International Conference on Distributed Computing and Internet Technology, ICDCIT 2005; Bhubaneswar; India; 22 December 2005 through 24 December 2005Clustering is a widely used approach to ease implementation of various problems such as routing and resource management in mobile ad hoc networks (MANET)s. We first look at minimum spanning tree(MST) based algorithms and then propose a new algorithm for clustering in MANETs. The algorithm we propose merges clusters to form higher level clusters by increasing their levels. We show the operation of the algorithm and analyze its time and message complexities
Computing branchwidth via efficient triangulations and blocks

International audienceMinimal triangulations and potential maximal cliques are the main ingredients for a number of polynomial time algorithms on different graph classes computing the treewidth of a graph. Potential maximal cliques are also the main engine of the fastest so far O(1.9601^n)-time exact treewidth algorithm. Based on the recent results of Mazoit, we define the structures that can be regarded as minimal triangulations and potential maximal cliques for branchwidth: efficient triangulations and blocks. We show how blocks can be used to construct an algorithm computing the branchwidth of a graph on n vertices in time (2+√3)^n · n^O(1)
Incorporating image quality in multi-algorithm fingerprint verification

The final publication is available at Springer via http://dx.doi.org/10.1007/11608288_29Proceedings of International Conference, ICB 2006, Hong Kong (China)The effect of image quality on the performance of fingerprint verification is studied. In particular, we investigate the performance of two fingerprint matchers based on minutiae and ridge information as well as their score-level combination under varying fingerprint image quality. The ridge-based system is found to be more robust to image quality degradation than the minutiae-based system. We exploit this fact by introducing an adaptive score fusion scheme based on automatic quality estimation in the spatial frequency domain. The proposed scheme leads to enhanced performance over a wide range of fingerprint image quality.This work has been supported by Spanish MCYT TIC2003-08382-C05-01 and by European Commission IST-2002-507634 Biosecure NoE projects
Extracting surface representations from rim curves

LNCS v. 3852 is the conference proceedings of ACCV 2006In this paper, we design and implement a novel method for constructing a mixed triangle/quadrangle mesh from the 3D space curves (rims) estimated from the profiles of an object in an image sequence without knowing the original 3D topology of the object. To this aim, a contour data structure for representing visual hull, which is different from that for CT/MRI, is introduced. In this paper, we (1) solve the "branching structure" problem by introducing some additional "directed edge", and (2) extract a triangle/ quadrangle closed mesh from the contour structure with an algorithm based on dynamic programming. Both theoretical demonstration and real world results show that our proposed method has sufficient robustness with respect to the complex topology of the object, and the extracted mesh is of high quality. © Springer-Verlag Berlin Heidelberg 2006.postprintThe 7th Asian Conference on Computer Vision (ACCV 2006), Hyderabad, India, 13-16 January 2006. In Lecture Notes in Computer Science, 2006, v. 3852, p. 732-74
A Speech Recognizer based on Multiclass SVMs with HMM-Guided Segmentation

Automatic Speech Recognition (ASR) is essentially a problem of pattern
classification, however, the time dimension of the speech signal has
prevented to pose ASR as a simple static classification problem. Support
Vector Machine (SVM) classifiers could provide an appropriate solution,
since they are very well adapted to high-dimensional classification problems.
Nevertheless, the use of SVMs for ASR is by no means straightforward,
mainly because SVM classifiers require an input of fixed-dimension.
In this paper we study the use of a HMM-based segmentation as a mean to
get the fixed-dimension input vectors required by SVMs, in a problem of
isolated-digit recognition. Different configurations for all the parameters
involved have been tested. Also, we deal with the problem of multi-class
classification (as SVMs are initially binary classifers), studying two of the
most popular approaches: 1-vs-all and 1-vs-1
Inductive querying for discovering subgroups and clusters

We introduce the problem of cluster-grouping and show that it integrates several important data mining tasks, i.e. subgroup discovery, mining correlated patterns and aspects from clustering. The problem of cluster-grouping can be regarded as a new type of inductive optimization query that asks for the k best patterns according to a convex criterion. The algorithm CG for solving cluster-grouping problems is presented and the underlying mechanisms are discussed. The approach is experimentally evaluated on a number of real-life data sets. The results indicate that the algorithm improves upon the subgroup discovery algorithm CN2-WRAcc and is competitive with the clustering algorithm Cob Web.status: publishe
Using Process Algebra to Validate Behavioral Aspects of Object-Oriented Models

International audienceWe present in this paper a rigorous and automated based approach for the behavioral validation of control software systems. This approach relies on metamodeling, model-transformations and process algebra and combines semi-formal object-oriented models with formal validation. We perform the validation of behavioral aspects of objectoriented models by using a projection into a well-defined formal technical space (Finite State Process algebra) where model-checkers are available (we use LTSA; a model checker for Labeled Transition Systems). We then target an implementation platform, which conforms to the semantics of the formal technical space; in turn, this ensure conformance of the final application to the validated specification
Towards a generalisation of formal concept analysis for data mining purposes

In this paper we justify the need for a generalisation of Formal
Concept Analysis for the purpose of data mining and begin the
synthesis of such theory. For that purpose, we first review semirings and
semimodules over semirings as the appropriate objects to use in abstracting
the Boolean algebra and the notion of extents and intents, respectively.
We later bring to bear powerful theorems developed in the field
of linear algebra over idempotent semimodules to try to build a Fundamental
Theorem for K-Formal Concept Analysis, where K is a type of
idempotent semiring. Finally, we try to put Formal Concept Analysis in
new perspective by considering it as a concrete instance of the theory
developed
Entanglement in Interactive Proof Systems with Binary Answers

If two classical provers share an entangled state, the resulting interactive
proof system is significantly weakened [quant-ph/0404076]. We show that for the
case where the verifier computes the XOR of two binary answers, the resulting
proof system is in fact no more powerful than a system based on a single
quantum prover: +MIP*[2] is contained in QIP(2). This also implies that
+MIP*[2] is contained in EXP which was previously shown using a different
method [Presentation of Cleve et al. at CCC'04]. This contrasts with an
interactive proof system where the two provers do not share entanglement. In
that case, +MIP[2] = NEXP for certain soundness and completeness parameters
[quant-ph/0404076].Comment: 10 pages, LaTeX, To appear at STACS 200
Searching for compound goals using relevancy zones in the game of Go

In complex games with a high branching factor, global alphabeta search is computationally infeasible. One way to overcome this problem is by using selective goal-directed search algorithms. These goal-directed searches can use relevancy zones to determine which part of the board influences the goal. In this paper, we propose a general method that uses these relevancy zones for searching for compound goals. A compound goal is constructed from less complex atomic goals, using the standard connectives. In contrast to other approaches that treat goals separately in the search phase, compound goal search obtains exact results.status: publishe
Metamorphosis – a topic maps based environment to handle heterogeneous information resources

"Lecture notes in computer science (LNCS). ISSN 0302-9743, vol. 3873"Nowadays, data handled by an institution or company is spread out by more than one database and lots of documents of different types. To extract the information implicit in that data, it is necessary to pick parts from those various archives. To obtain a general overview, those information slices should be integrated. Different approaches can be followed to achieve that integration, ranging from the merge of resources till the fusion of the extracted parts. In this paper, we introduce Metamorphosis – a Topic Maps oriented environment that enables a conceptual navigation among heterogenous information systems – and we argue that Metamorphosis can be used to achieve, via Topic Maps, the referred semantic integration.info:eu-repo/semantics/publishedVersio
On the syntax of reference model configuration: Transforming the C-EPC into lawful EPC models

Enterprise Systems need to be configured to fit organizational requirements and to provide support for their business operations. Reference models aim at supporting this task but fail in providing adequate conceptual support due to missing configurability of the models themselves. Our research extends the work on a configurable reference modeling approach. In previous research we developed a conceptual notation for configurable reference models. This paper considers a syntactic perspective of reference model configuration. We discuss the lawful environments of configurable nodes and report about syntactic implications of model configuration in these environments. We then apply these findings in the design of an interchange format for configurable reference models and discuss its applicability for the XML-based design of tool support, which ultimately will facilitate the automatic verification and transformation of reference process models to executable workflow specifications
Configurable Process Models as a Basis for Reference Modeling

Off-the-shelf packages such as SAP need to be configured to suit the requirements of an organization. Reference models support the configuration of these systems. Existing reference models use rather traditional languages. For example, the SAP reference model uses Eventdriven Process Chains (EPCs). Unfortunately, traditional languages like EPCs do not capture the configuration-aspects well. Consider for example the concept of "choice" in the control-flow perspective. Although any process modeling language, including EPCs, offers a choice construct (e.g., the XOR connector in EPCs), a single construct will not be able to capture the time dimension, scope, and impact of a decision. Some decisions are taken at run-time for a single case while other decisions are taken at build-time impacting a whole organization and all current and future cases. This position paper discusses the need for configurable process models as a basic building block for reference modeling. The focus is on the control-flow perspective. © Springer-Verlag Berlin Heidelberg 2006
Standards for Web Service Choreography and Orchestration: Status and Perspectives

Web service composition has been the subject of a number of standardisation initiatives. These initiatives have met various difficulties and had mixed degrees of success, and none of them has yet attained both de facto and de jure status. This paper reviews two of these initiatives with respect to a framework wherein service composition is approached from multiple interrelated perspectives. One conclusion is that standardisation initiatives in this area have not been built on top of an explicitly defined overarching conceptual foundation. The paper outlines a research agenda aimed at identifying requirements and concepts that should be addressed by and incorporated into these standards