In a previous work, we introduced a fuzzy-based color image segmentation method for detecting the "relevant colors" of an image, founded on color histogram analysis. the present paper outlines the whole proc...
详细信息
In a previous work, we introduced a fuzzy-based color image segmentation method for detecting the "relevant colors" of an image, founded on color histogram analysis. the present paper outlines the whole process and introduces the construction of a new fuzzy paradigm-based color histogram, which uses color components' stability degrees to modify a set of histogram positions according to the uncertainty of the pixel color components. the processing of such histogram provides a group of fuzzy sets that fit the number and domain of image's relevant colors better than the processing of the traditional color histogram. Moreover, the image segmentation results are more similar to the human visual perception of the scene.
the formal verification of security properties of a cryptographic protocol is a difficult, albeit very important task as more and more sensible resources are added to public networks. this paper is focused on model ch...
详细信息
In classic scheduling theory, real-time tasks are usually assumed to be periodic, i.e. tasks arrive and compute with fixed rates periodically. To relax the stringent constraints on task arrival times, we propose to us...
详细信息
XML data integration tools are facing a variety of challenges for their efficient and effective operation. Among these is the requirement to handle a variety of inconsistencies or mistakes present in the data sets. We...
详细信息
XML data integration tools are facing a variety of challenges for their efficient and effective operation. Among these is the requirement to handle a variety of inconsistencies or mistakes present in the data sets. We study the problem of integrating XML data sources through index assisted join operations, using notions of approximate match in the structure and content of XML documents as the join predicate. We show how a well known and widely deployed index structure, namely the R-tree, can be adopted to improve the performance of such operations. We propose novel search and join algorithms for R-trees adopted to index XML document collections. We also propose novel optimization objectives for R-tree construction, making R-trees better suited for this application.
the proceedings contain 41 papers. the special focus in this conference is on tools and algorithms for the construction and analysis of systems. the topics include: Language containment checking with nondeterministic ...
ISBN:
(纸本)3540418652
the proceedings contain 41 papers. the special focus in this conference is on tools and algorithms for the construction and analysis of systems. the topics include: Language containment checking with nondeterministic BDDS;satisfiability checking using Boolean expression diagrams;automatic deductive verification with invisible invariants;a technique for invariant generation;model checking syllabi and student careers;parameterized verification of multithreaded software libraries;efficient guiding towards cost-optimality in UPPAAL;linear parametric model checking of timed automata;first passage time analysis of stochastic process algebra using partial orders;Boolean and Cartesian abstraction for model checking c programs;the loop compiler for java and JML;searching powerset automata by combining explicit-state and symbolic model checking;automated test generation from timed automata;testing an intentional naming scheme using genetic algorithms;building a tool for the analysis and testing of web applications;implementing a multi-valued symbolic model checker;a sweep-line method for state space exploration;compositional message sequence charts;an automata based interpretation of live sequence charts;coverage metrics for temporal logic model checking and the Erlang verification tool.
the PEP tool provides an integrated development and verification environment for parallel systems. Beginning with version 2.0 it also offers use of timed systems. this paper describes a sample session for the design a...
详细信息
ISBN:
(纸本)3540434194
the PEP tool provides an integrated development and verification environment for parallel systems. Beginning with version 2.0 it also offers use of timed systems. this paper describes a sample session for the design and the verification by partial order based techniques of a simple real-time model for a mutual exclusion algorithm.
the parallel composition with observers is a well-known approach to check or test properties over formal models of concurrent and real-time systems. We present a new technique to reduce the size of the resulting model...
详细信息
ISBN:
(纸本)3540434194
the parallel composition with observers is a well-known approach to check or test properties over formal models of concurrent and real-time systems. We present a new technique to reduce the size of the resulting model. Our approach has been developed for a formalism based on Timed Automata. Firstly, it discovers relevant components and clocks at each location of the observer using influence information. Secondly, it outcomes an abstraction which is equivalent to the original model up to branching-time structure and can be treated by verification tools such as KRONOS [12] or OPENKRONOS [23]. Our experiments suggest that the approach may lead to significant time and space savings during verification phase due to state space reduction and the existence of shorter counterexamples in the optimized model.
In multiprocessor and distributed real-time systems, scheduling jobs dynamically on processors can be used to achieve better performance. However, analytical and efficient validation methods for determining whether al...
详细信息
ISBN:
(纸本)3540434194
In multiprocessor and distributed real-time systems, scheduling jobs dynamically on processors can be used to achieve better performance. However, analytical and efficient validation methods for determining whether all the timing constraints are met do not yet exist for systems using modern dynamic scheduling strategies, and exhaustive methods are often infeasible or unreliable since the execution time and release time of each job may vary. In this paper, we present several upper bounds and efficient algorithms for computing the worst-case completion times of dependent jobs in dynamic systems where jobs are dispatched and scheduled on available processors in a priority-driven manner. the bounds and algorithms consider arbitrary release times and variable execution times. We present conditions under which dependent jobs execute in a predictable manner.
暂无评论