All capacities modular cost survivable network design problem using genetic algorithm with completely connection encoding We study the survivable network design problem (SNDP) for simultaneous unicast and anycast flows in networks where the link cost follows All Capacities Modular Cost (ACMC) model. Given a network modeled by a connected, undirected graph and a set of flow demands, this problem aims at finding a set of connections with a minimized network cost in order to protect the network against any single failure. This paper proposes a new Genetic Algorithm with an efficient encoding to solve the SNDP in networks with ACMC model (A-SNDP). Our encoding scheme is simple and allows large search space. Extensive simulation results on real large topology instances show that the proposed algorithm is much more efficient than the Tabu Search and other conventional Genetic Algorithm in terms of minimizing the network cost. There are many types of connection for data transmission over the Internet. The most popular type of connection is from one node to another, which is called unicast. An anycast connection is also from one node to another, the difference is that the destination node has a one or many replicated servers which back up for it. Anycast has in recent years become increasingly popular for adding redundancy to many Internet services [1] [2] [3] . Anycast connection is currently used in many applications such as Domain Name Service (DNS), Web Service, Overlay Network, peer-to-peer (P2P) systems, Content Delivery Network (CDN), software distribution. The popularity of anycast technology will increase in the near future, since many new services that use both unicast and anycast paradigms are being developed.. In the Internet, any network failure can cause serious consequences, e.g., a single link failure affected more than 30,000 users and it takes 12 hours to fix [3] . Therefore, the design of survivable networks is a crucial problem. For the commnunication networks, the research in [4] presented detailed information on protecting as well as restoring them with specifies techniques such that organization time and money can be saved. Also, in the survivable network design problem (SNDP) with simultaneous unicast and anycast flows, the common objective is to minimize the network cost to protect network against failures. To guarantee the survivability, we adopt the protection approach [5] [6] [7] [8] [9] [10] in that each connection must include a working path and a link-disjoint backup path. The working path is used for data transmission in failure-free state of the network. If there is a single link failure on the working path, the failed connection is then switched to the backup path.. In [5] Gładysz et al. have considered the SNDP for networks using ACMC (All Capacities Modular Cost) link cost model (here after called by A-SNDP). In the ACMC model, a link has many bandwidth levels, each level has a corresponding cost. Many flow demands can go through the same link thus the link cost is defined as the total of required bandwidth from all demands on that link. The network cost is defined as the total of all link cost. The A-SNDP problem is defined as follows. Given a network modeled by an undirected graph where the link cost follows ACMC model and a set of survivable flow demands between node pairs with correspon-ding bandwidth and type of connection (anycast or unicast), this problem aims at finding a set of connection for all flow demands such that the network cost is minimized. The authors in [5] have also proposed a heuristic for A-SNDP using Tabu Search. However, their result is still far from optimal approach.. Genetic algorithm (GA) has been proved effective on NP-hard problem [11] . There have been a lot of research works on using GA approach to solve NP-hard problem, particularly in net-work design problem [9, 12] . In our previous work [12] , we have developed a genetic algorithm for A-SNDP called CDE-GA that uses Connection Database Encoding for individual representation. However, this encoding method is complex and search space is not diverse enough, thus it limits the performance of GA approach in solving A-SNDP problem.. In this paper, we propose new individual encoding scheme called Complete Connection Encoding (CCE) with genetic algorithm for solving A-SNDP. CCE encoding is simple, and it helps to create more new individuals and enlarge the search space to find better solution in large network instances. We then design the evolution operators using CCE and simulate our proposed algorithm with three typical network instances (Polska, Germany, Atlanta) and two large instances (Germany50, America). We compare the results with Tabu Search [5] and CDE-GA. Results obtained in experimentation show that our proposed algorithm are much better than the compared algorithms in terms of minimizing network cost.. The rest of this paper is organized as follows. Section "Problem description and related works" describes problem and the related works. Our new approach to encode individual and the proposed GA algorithm to solve A-SNDP is shown in Section "Genetic algorithm for solving A-SNDP". Experimental results are given in Section "Experimental results". The paper concludes with Section "Conclusion" by discussion and future works. In this paper, we proposed a new algorithm called CCE-GA for solving A-SNDP. This algorithm uses a new simple encoding scheme called Completely Connection Encoding (CCE) to enlarge the search space to find better solution in large network instances. Experiments are conducted on real network topologies on show that our proposed approach is very efficient in solving A-SNDP. On the big instances, such as Atlanta, Germany50 and TA2 networks, the best and average result found by CCE-GA are much better than CDE-GA and Tabu Search. However, CCE-GA takes much more running times in compare with Tabu Search and CDE-GA to find best result. But if the running time for Tabu Search, CDE-GA is increased, the best result is not improved. Figure 9 The convergence rate of CDE-GA and CCE-GA to find the min cost on TA2 network.. In the future, we are planning to improve this algorithm for solving bigger instances in a reasonable time. Moreover, we hope that we can find the other approach with better results for A-SNDP.

B I I I B I I O O B I O O O O O O O B I I O O O O B O B O O O O O O O O B I I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O B O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O B O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I I O O O O B O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O


High-level synthesis of recoverable VLSI microarchitectures Abstract-Two algorithms that combine the operations of scheduling and recovery-point insertion for high-level synthesis of recoverable microarchitectures are presented. The first uses a prioritized cost function in which functional unit (FU) cost is minimized first and register cost second. The second algorithm minimizes a weighted sum of FU and register costs. Both algorithms are optimal according to their respective cost functions and require less than 10 min of central processing unit (CPU) time on widely used high-level synthesis benchmarks. The best previous result reported several hours of CPU time for some of the same benchmarks on a computer of similar computational power. In this paper, we presented techniques for combined scheduling and recovery-point insertion in high-level synthesis of digital systems. Our algorithms are optimal and ran efficiently on standard benchmarks. Currently, CDFG's with loops and conditional branches can be decomposed into basic blocks, which can be scheduled using our techniques. Loops can be unrolled either partially or fully. Other extensions have already been accomplished, such as chaining and multicycling. Future work will consider the scheduling of these more general CDFG's to achieve more efficient resource utilization.

B I O O O O O O O O O O O B O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O


Enabling adaptive time-based web applications with SMIL state In this paper we examine adaptive time-based web applications (or presentations). These are interactive presentations where time dictates the major structure, and that require interactivity and other dynamic adaptation. We investigate the current technologies available to create such presentations and their shortcomings, and suggest a mechanism for addressing these shortcomings. This mechanism, SMIL State, can be used to add user-defined state to declarative time-based languages such as SMIL or SVG animation, thereby enabling the author to create control flows that are difficult to realize within the temporal containment model of the host languages. In addition, SMIL State can be used as a bridging mechanism between languages, enabling easy integration of external components into the web application. Categories and Subject DescriptorsDesign, Experimentation, Standardization, Languages.Declarative languages, SMIL, Multimedia web applications, Delayed ad viewing.This paper examines technology to create adaptive time-based web applications. These are applications that use time as a major structuring paradigm, and need to adapt to changes at runtime. Such adaptation can be in the form of user interaction, but also other environmental changes such as location information or a change in available bandwidth. We want these applications to be good web citizens: searchable, accessible, structured, reusable, etc.Traditionally, the web has preferred structured declarative solutions over imperative ones: HTML, CSS, SMIL, SVG and many other web standards are all mainly declarative languages. The advantage of declarative languages in a web setting is that they facilitates reuse, accessibility and device independence [11] . However, at a lower level, imperative languages (mainly JavaScript) are often required to enable time-dependent rendering, interactivity or glueing components together. This is a problem if we want to create adaptive time-based web applications, as these applications indeed require timing and interactivity and often the help of external components. The introduction of scripting into a webpage is a powerful tool, but therefore also a dangerous one: maintaining the advantages of the structured declarative model is not automatic, and may sometimes be impossible.The alternative to structured declarative solutions is to use a technology like Flash. This is a proprietary binary format, however, and in its distribution form it has no easily parseable structure. This forestalls search and (third-party) reuse. Moreover, adaptivity and accessibility have to be explicitly catered for by the document author.If we examine again the structured declarative languages that have an execution model (SMIL, SVG Animation) one piece of missing functionality is a user defined data model. Adding such a data model would allow a larger problem domain to be addressed without the need for a scripting language.This paper introduces SMIL State, a technology that combines temporal web languages like SMIL or SVG with an external data model. This enables the use of free variables, thereby allowing the author to escape the temporal containment model in a controlled fashion. The data model is externalized, allowing it to be shared with other components and effectively enabling its use as an API between components of a web application.The paper is structured as follows. In section 2 we sketch the type of applications we want to enable, and describe an example of such an application. We then outline the requirements of these applications. In section 3 we look at existing technology, and investigate how well it matches our requirements. In section 4 we describe our solution and the motivation behind it. In section 5 we report on our initial implementation. In section 6 we describe two example presentations and their architecture. We conclude with determining how well our solution matches our requirements, and some ideas about future work.In this paper we will concentrate on presentations which have time as their major structuring mechanism and user interaction/selection This paper examines technology to create adaptive time-based web applications. These are applications that use time as a major structuring paradigm, and need to adapt to changes at runtime. Such adaptation can be in the form of user interaction, but also other environmental changes such as location information or a change in available bandwidth. We want these applications to be good web citizens: searchable, accessible, structured, reusable, etc.. Traditionally, the web has preferred structured declarative solutions over imperative ones: HTML, CSS, SMIL, SVG and many other web standards are all mainly declarative languages. The advantage of declarative languages in a web setting is that they facilitates reuse, accessibility and device independence [11] . However, at a lower level, imperative languages (mainly JavaScript) are often required to enable time-dependent rendering, interactivity or glueing components together. This is a problem if we want to create adaptive time-based web applications, as these applications indeed require timing and interactivity and often the help of external components. The introduction of scripting into a webpage is a powerful tool, but therefore also a dangerous one: maintaining the advantages of the structured declarative model is not automatic, and may sometimes be impossible.. The alternative to structured declarative solutions is to use a technology like Flash. This is a proprietary binary format, however, and in its distribution form it has no easily parseable structure. This forestalls search and (third-party) reuse. Moreover, adaptivity and accessibility have to be explicitly catered for by the document author.. If we examine again the structured declarative languages that have an execution model (SMIL, SVG Animation) one piece of missing functionality is a user defined data model. Adding such a data model would allow a larger problem domain to be addressed without the need for a scripting language. This paper introduces SMIL State, a technology that combines temporal web languages like SMIL or SVG with an external data model. This enables the use of free variables, thereby allowing the author to escape the temporal containment model in a controlled fashion. The data model is externalized, allowing it to be shared with other components and effectively enabling its use as an API between components of a web application.. The paper is structured as follows. In section 2 we sketch the type of applications we want to enable, and describe an example of such an application. We then outline the requirements of these applications. In section 3 we look at existing technology, and investigate how well it matches our requirements. In section 4 we describe our solution and the motivation behind it. In section 5 we report on our initial implementation. In section 6 we describe two example presentations and their architecture. We conclude with determining how well our solution matches our requirements, and some ideas about future work. Based on the example applications we have created we can match our solution to the requirements (see table 1 ). SMIL State does not interfere with any of the advantages of SMIL 2.1, so we only need to look at the three requirements where SMIL 2.1 is lacking.. Variable support works nicely in SMIL State, and simple use cases have simple solutions. XPath as the expression language could have used a little boost, though, as XForms did by introducing a number of convenience functions into the XPath function namespace.. Language bridging works fine. Here the problem is on the other side of the bridge: as only SMIL State and XForms currently share this data model, the integration into other languages requires some glue code.. Reusability works fine. Whether you want to replace components or refer to fragments inside the presentation, we have not encountered any problems.. SMIL State has been proposed to the SYMM working group, and has been accepted as a part of the standard for SMIL 3.0, which is in Candidate Recommendation status as of this writing.. We intend to pursue and extend this model in the context of the W3C Rich Web Application Backplane Incubator Group. There we will also try and address the shortcomings sketched in this section. We have implemented SMIL State in our open source Ambulant SMIL player, both in standalone mode and as a plugin for web browsers. This implementation was used to experiment with our sample applications. It turned out that the implementation of SMIL State in an existing standalone SMIL player was fairly straightforward and posed few problems.. Integration with the browser and its JavaScript implementation was more interesting, and proved more challenging. We did the initial implementation in the WebKit-based Safari browser. There was a practical reason for this: Safari exports a full API in Objective-C, Ambulant exports a full API to Python, and Python and Objective-C can be transparently bridged. All in all, 300 lines of Python code did the job of implementing SMIL State (in addition to 200 lines of Objective-C to implement the Ambulant WekKit plugin). The SMIL State design matched the platform nicely, and clean separation of components was almost automatic. The only link between the WebKit world and the Ambulant world is DOM access and XML Events, between the WebKit DOM and the Ambulant SMIL State plugin. The relevant components in this implementation are shown in figure 3 .. We have also started implementing browser integration through the standard NSAPI plugin API, to facilitate using SMIL State in Firefox or IE.

O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O B B I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O B I O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O B I O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O B O O O O O O O O O O O O B O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O


Asymmetric Fragile Watermarking Using a Number Theoretic Transform We propose an asymmetric fragile watermarking technique that uses a number theoretic transform (NTT). Signature data is extracted from a watermarked image by determining correlation functions that are computed using the NTT. The effectiveness of the proposed method is evaluated by simulated detection of altering. key words: number theoretic transform, asymmetric watermarking, fragile watermarking, image authentication Since digital data, such as images, can be easily modified, it is necessary to guarantee its originality when using it as an official document or evidence. Therefore, fragile watermarking techniques are researched for meeting this need. Digital images are divided into small blocks, and fragile watermarks are embedded into each block. Altered blocks are detected by searching for destroyed watermarks.. Conventional techniques for fragile watermarking were mainly categorized as spatial-domain methods based on a hashing function. We have proposed a different technique based on the fact that NTTs have no round-off error [1] . This is categorized as a transform-domain method. Compared to spatial-domain methods, transform-domain ones offer greater security [1] . However, [1] is a secret key scheme, so an attacker can update the signature data after altering images if the secret key is known. Therefore, this method is more cumbersome because the secret key must be sent through a secure channel. Also, only the user who possesses the secret key can carry out the extraction procedure [2] . In this paper, we propose an asymmetric fragile watermarking technique using the NTT. This technique can release a public key, which cannot be used to update the watermarking [3] . A simulation experiment was conducted to examine the effectiveness of the proposed method. In this paper, we have presented an asymmetric fragile watermarking technique based on a NTT. In the future, we will apply this method to JPEG images and consider the security issues of this method. Furthermore, it is possible that the safety of the proposed technique decreases when the public key is altered. Therefore, it is necessary to consider the operational infrastructure of the public key.

O B I O O B I I O O O O B I O O O O B I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I I B I B I B I O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O


CoNVEX: copy number variation estimation in exome sequencing data using HMM Background: One of the main types of genetic variations in cancer is Copy Number Variations (CNV). Whole exome sequenicng (WES) is a popular alternative to whole genome sequencing (WGS) to study disease specific genomic variations. However, finding CNV in Cancer samples using WES data has not been fully explored.We present a new method, called CoNVEX, to estimate copy number variation in whole exome sequencing data. It uses ratio of tumour and matched normal average read depths at each exonic region, to predict the copy gain or loss. The useful signal produced by WES data will be hindered by the intrinsic noise present in the data itself. This limits its capacity to be used as a highly reliable CNV detection source. Here, we propose a method that consists of discrete wavelet transform (DWT) to reduce noise. The identification of copy number gains/losses of each targeted region is performed by a Hidden Markov Model (HMM).Conclusion: HMM is frequently used to identify CNV in data produced by various technologies including Array Comparative Genomic Hybridization (aCGH) and WGS. Here, we propose an HMM to detect CNV in cancer exome data. We used modified data from 1000 Genomes project to evaluate the performance of the proposed method. Using these data we have shown that CoNVEX outperforms the existing methods significantly in terms of precision. Overall, CoNVEX achieved a sensitivity of more than 92% and a precision of more than 50%. Exome sequencing data can be used to detect copy number variations as an initial screening procedure. It is a cheap and time efficient method. We have successfully applied the proposed method on exome data to identify CNVs spanning one to thousands of exons. However, actual breakpoint of the CNV would not necessarily lie in the coding region. This limits the use of WES in identifying actual breakpoints of the CNV. As discussed in the Results and Discussion section, we have achieved a higher precision than existing methods in detecting variations due to the data smoothing step. However, detection of some of the small variations may be missed by this smoothing step, as these can be recognised as noise. Further analysis is needed in order to better detect these variations among higher level of noise.. Although, we have used a matched normal sample to detect CNVs, the CNV identification can be done based on a pooled normal sample as described in [19] . This might give an advantage in finding CNVs in familial studies assuming all members have a median copy number of two.. Authors' contributions KCA designed the method, evaluated the performance and drafted the manuscript. JL and SKH contributed to improve the method. All authors read and approved the final manuscript. Commercial products of Next Generation Sequencing (NGS) Technologies such as Roche/454 FLX, Illumina Genome Analyzer/HiSeq, Applied Biosystems SOLiD™-System and Helicos Heliscope™have enabled the sequencing of DNA much faster and cheaper than before [1] . These have shifted the paradigm of biological sequence analysis to a new level. Currently these are not only being used for the sequencing of whole genome, but also for sequencing of known exons and transcriptomes as well. The main motivations behind the technology of targeted resequencing (TR) include the following among others. The actual coding regions or the exons of the human genome account only for~1% of the total sequences, which consequently gives about 30 Mb data compared to 3 Gb data in WGS [2] . Currently, getting higher coverage of targeted regions using NGS technologies is about six times [3] cheaper and faster compared to achieving the same coverage of whole genome. On the other hand approximately 85% of disease causing mutations lie in the coding regions [4] . Targeted resequencing has been mainly used in medical sequencing to find disease causing genetic variations (a review can be found in [5] ). Recent studies on TR and WES data have successfully detected cancer specific mutations (somatic mutations) in breast cancer [6] [7] [8] , ovarian cancer [8] and prostate cancer [9] . Although, exome sequencing has been successfully used to find small variations in cancer genomes, its potential to find large structural variations such as CNV has not yet been fully explored.. Cancer arises due to the acquisition of many somatic variations by the DNA of cancer cells [10] . Copy Number Alterations (CNA) play a major part in the progression of this deadly disease [11] . Until recently, the most common method to detect CNV in cancer DNA was to use micro array based technologies. However, during last 2 -3 years many algorithms have been developed to identify CNV in cancerous data generated by whole genome sequencing [11] [12] [13] [14] [15] , making use of the vast amount of data produced by NGS technology. The higher resolution that can be achieved through NGS data has helped to detect new variations that were undetectable previously and include CNVs which are as small as 50 bp [16] . These methods use the number of reads mapped to a particular region in the genome, to find copy number varying regions in one genome compared to one or more other genomes. Some of these methods have been adapted from the methods used in aCGH. For example Circular Binary Segmentation (CBS) [17] and Hidden Markov Model (HMM) [18] . However, methods in whole genome sequencing cannot be directly applied to whole exome sequencing data due to the small size and sparseness of these data [19] . On the other hand, the useful signal will be hindered by the intrinsic noise present in the exome sequencing data itself due to various biases introduced in target capturing and sequencing phases. To address these issues and to utilize the advantages provided by targeted resequencing, new algorithms have to be developed. Since the end of 2011, very few bioinformatics methods for detecting copy number variations in targeted resequencing data have been published. The method in [20] describes the use of TR data to detect CNV in cancer samples. However, the targeted regions in this method are larger in size (~40 kb), where as exons are much shorter (200 bp -300 bp). Methods such as [21, 22] are developed to find CNV in non cancerous exome data, such as in population studies. CONTRA [19] is a recent method proposed to evaluate cancer TR data using a pooled or a matched normal sample. ExomeCNV [23] and Var Scan 2 [24] are specifically designed for whole exome sequencing of cancer samples. A limitation in these approaches is that they have a higher number of false positives which result in a very low precision (further discussed in Results and discussion section for ExomeCNV).. In this work, we present CoNVEX, a method that evaluates exon level depth of coverage ratios to assess variation in copy number of whole exome capture data produced from cancer samples. We propose to use Discrete Wavelet Transformation denoising to reduce the variability of coverage ratios and then use HMM to detect copy number variations. Our method reduces the number of false positives by efficient pre-processing of the data, which results in a mean precision of more than 50%. Data pre-processing Depth of coverage ratios at each targeted region Number of reads covering each base at a targeted region is calculated using BEDTools [25] . Then the exon level depth of coverage (DOC) is calculated as mean of the per base coverage of that particular exon. To control the quality, only the regions having more than 10 bp DOC in the control sample are retained for further analysis. To correct for the differences in total number of reads in tumour and control samples, the exon level DOC is divided by the mean of DOC of all the exons in that sample. Then the exon level DOC ratio at region i is calculated as,. Where N T i and N C i are the mean normalized DOC of tumour and control respectively.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O B I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O


Exploration into Single Image Super-Resolution via Self Similarity by Sparse Representation A novel method for single image super resolution without any training samples is presented in the paper. By sparse representation, the method attempts to recover at each pixel its best possible resolution increase based on the self similarity of the image patches across different scale and rotation transforms. The experiments indicate that the proposed method can produce robust and competitive results. Image super resolution (SR) is a technique that recovers a high resolution image from one or more low resolution input. The interpolation based SR [1] provides a first simple solution to the problem. The method requires only one image via sub-pixel alignment followed by non-uniform interpolation, but tends to produce an overly smooth result with artifacts. Besides the decade old interpolation methods, modern approaches to SR can be broadly classified into two major categories: the classical multi-image based SR and the example based SR.. The Classical Multi-Image based SR is the process of combining multiple low resolution images to form a higher resolution output. Typically, these methods are based on the registration of multiple images, followed by a fusion step with each low resolution image as a linear constraint, and finally a certain regularization term to further stabilize the inversion of the ill-posed problem [2] . However, these approaches are numerically limited only to small increases in resolution in practice.. The Example based Super-Resolution, also called "image hallucination", has recently received much attention. In general, example based SR incorporates application depended prior knowledge from a dataset of low and high resolution image pairs to infer the unknown high resolution image from low resolution input [3] . Example based SR has shown to outperform the classical SR. However, unlike the classical SR, the high resolution details hallucinated by example based SR are dependent on the suitability of the training set and not guaranteed to accord with the ground truth.. Recently, [4] has proposed a framework to combine [4] needs to seek for (nearly) all the patches below a certain distance threshold, which is inefficient. Moreover, the recurrence of patches only deals with patches with similar appearance, neglecting possible rotations and flips.. As an extension of [3] , [4] , we consider the single image SR via self similarity. Using the self similarity of the natural image, i.e. parts of the image often resemble the other parts of the same image, we propose a novel single image SR method (Fig. 1) . Unlike [3] , our method uses the input image itself as the example, thus does not require any external training set. Unlike [4] , our method deals with patch-level similarity across different scales and rotations by sparse representation, yielding an efficient and high quality solution. As a result, the proposed method requires only one image [4] as the interpolation based SR and can produce competitive results to the example based SR [3] .. The rest of the paper is organized as follows: Section 2 presents our main algorithm of single image super- By exploring the self similarity across scales and rotations, we propose a novel SR method for a single image via sparse representation. The experiments demonstrate the ability to achieve competitive results by the proposed method.

O O O O O O B I O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O


Safety evaluation and management of complex systems: A system engineering approach This article addresses the problem of safety evaluation of complex systems. It proposes an original and rigorous approach that integrates safety analysis in system engineering processes. The approach is based on system engineering principles and uses the famous industrial system engineering standard American National Standards Institute/Electronic Industries Alliance 632:1999. The objective is to help designers and safety engineers in safety management of complex systems. For an efficient design, the model-driven design is adopted through the definition of an information model. The system language ''System Modeling Language'' is used to address requirements definition and their traceability toward the solution and the verification and validation elements. This common language allows sharing information between the different persons involved in the design project like the system engineer and safety engineer. Complex systems are systems with numerous components, interconnections, interactions, or interdependencies that are difficult to describe, understand, predict, manage, design, and/or change (Magee and de Weck, 2004) . In these systems, a change in one part may have effects on other parts of the system. Most of modern systems are inherently complex (Bar-Yam, 2005) .This complexity makes the systems engineering processes (including acquisition and supply, technical management, system design, and technical evaluation processes) more critical and difficult. So, performing of important system-level proprieties such as reliability, safety, and security (Avizienis et al., 2004) become difficult. Indeed, safety of complex systems relies heavily on the emergent properties (Leveson, 2004) that result from the complex interdependencies that exist among the involved systems and their environments. It is necessary to address safety properties in an overall study, early in the design phase. For an effective analysis, safety processes have to consider some constraints. The most important ones, listed in (Guillerm et al., 2010) , are as follows:. 1. The emergent aspect of safety properties imposes to consider safety not only in the small but also in the large (at system level). 2. Different persons involved in the project need to work with different views of the system (e.g. systems engineer's view, safety engineer's view). It is necessary to guaranty the consistence of these different views. 3. Requirement engineering is a critical process in system engineering (SE). So, safety requirements and their traceability need particular attention.. Taking into account these constraints allows to improve complex system development and to overcome the limitation and weakness (Rasmussen, 1997) of the actual safety evaluation processes.. Requirements engineering (RE) is a critical SE process (Juristo et al., 2002) . It is a key problem area in the development of complex systems (Brooks, 1987) . A common classification defines two types of requirements: functional requirements, which describe the services that the system should provide, and nonfunctional requirements, which are related to emergent system properties (such as safety) and cannot be attributed to a single system component. This shows the necessity of a global approach for safety management, from the requirements definition to the system verification and validation (V&V), which is fundamental for the success of the system design project.. To deal with these different aspects, we propose a global approach for safety analysis. Indeed, safety must be addressed as a global property and safety requirements (Gotel and Finkelstein, 1994 ) must be formulated not only in the small (subsystem level) but also in the large (system level). Two aspects of RE are considered: the requirements development (including elicitation (Goguen and Linde, 1993) , documentation, analysis, and validation processes) and the requirements management (including maintainability management, changes management, and requirements traceability processes; Parviainen et al., 2004) .. A literature review shows some works that attempt to address the safety evaluation of complex system. For example, safety standards (as the ARP-4754) are useful to understand activities related to safety evaluation, but they do not define a unified approach with the nominal conception activities. This means that safety activities are not integrated in the SE processes. Recent projects like Enhanced safety assessment for complex systems (ESACS) (Bozzano et al., 2003) , Improvement of Safety Activities on Aeronautical Complex Systems (ISAAC) (Akerlund, 2006) , and Automated proofbased System and Software Engineering for Real-Time systems (ASSERT) (Conquet, 2008) , which deal with safety of complex systems do not provide a real global approach. They are focused on methods and tools that can be used in safety evaluation. In other works like those presented in (Leveson et al., 2007) , in addition to the fact that safety aspects are separated from the design activities, the proposed methodology is clearly oriented to the software domain.. This article presents two aspects of our work on safety evaluation of complex system. The first part concerns the integration of safety management in SE process. The objective is to help engineers by proposing a new approach based on SE best practices. It uses the recommendation of the SE standard Electronic Industries Alliance (EIA) 632:1999 (Guillerm et al., 2010) . The second part presents an information model based on SysML language (Friedenthal et al., 2009 ) to address requirements definition and their traceability (Gotel and Finkelstein, 1994) toward the solution elements and the V&V elements. Safety requirements are integrated on RE activities, including management activities related to maintenance and traceability.. This article is structured into five sections. The second section introduces the design framework. The integration approach is then presented in the third section. In the fourth section, the information model is proposed for efficient management of safety requirements. The last section gives some conclusions and future works.. The systems engineering framework for complex system development SE is a methodical and disciplined approach for the design, realization, technical management, operations, and retirement of a system. It is a collaborative and interdisciplinary process of resolution of problems, supporting knowledge, methods, and techniques resulting from the sciences and experimentation for defining a system. SE concepts are adequate specifically for complex problems; research issues undergone can bring a solution (Sahraoui et al., 2004) . This part introduces some concepts of SE and the standard EIA632:1999, which are the basis of our safety global approach. In this article, we presented a new approach for safety evaluation of complex systems. The contribution consists of two main points. The first one concerns the integration of safety in SE processes. The proposed methodology is based on EIA632:1999 SE standard and aims to help engineers involved in a design project to manage the safety aspect of the system in parallel to other design activities. It allows an explicit consideration of safety in systems engineering process by defining the specific activities related to safety. All SE processes, from requirements definition process to V&V process are concerned by the integration approach. As the approach is based on the EIA632:1999 standard and follows the different processes and subprocesses of this one, it can be incorporated easily into systems engineering concepts. This gives a framework for safety management showing that the SE concepts are adequate, specifically for complex problems.. RE is a crucial activity in the design of complex system. The second contribution of this article is the proposition and the definition of an information model based on the SysML language. It is done by an extension of this language by adding new stereotypes and new attributes to requirements. We also defined new links (specify and treat) between specified requirements and the elements of the model. The proposed information model allows the expression of the handled concepts (requirements, design solution, and V&V), and the creation of traceability links between these concepts in order to facilitate the comprehension and/or the impacts analysis. The proposed approach formalizes the practice of systems engineering through the use of models. The objective is to improve quality/productivity and to reduce risk by introducing rigor, precision, and communications among system/ project stakeholders and managing complexity.. The approach is demonstrated through an example from aeronautic domain and presented in (Guillerm, 2011) . However, the approach needs an additional work for its validation and application.. Future work will consist on considering other EIA632:1999 processes. Indeed, in the present article, we considered only the processes of system design and evaluation. The consideration of processes like technical management or acquisition and supply will complete the integration approach.. With regard to information model, we are studying the interest of using object constraint language (OCL) in order to formalize the requirements. The objective is to integrate this possibility in the information model. Another point concerns the definition of some analysis from the information model, such as the generation of traceability matrix.

B O O O O O O O B I O O O O O O O B O O O O O O O O O O O O O B O O B I O O O O O O B I O O O O O O B I O O O O O O O O O O O O O O O B O O B O O O O O O O O O O O O O O O O O O O O O O O B I I O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O B I O O B B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O B O O O O O O O O O O O B O O O O O O O O O B O O O O O O O O O O O O O O O O O O B O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O B O O O O O O O O B B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O B O O O O O O O B O O O O O O O O O O O O O O O O O O B O O O O O O B O O O O O O O O O O O B O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O B O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O B B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O B O O O O O O O O O O O B O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O B O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O


Sliding windows over uncertain data streams Abstract Uncertain data streams can have tuples with both value and existential uncertainty. A tuple has value uncertainty when it can assume multiple possible values. A tuple is existentially uncertain when the sum of the probabilities of its possible values is <1. A situation where existential uncertainty can arise is when applying relational operators to streams with value uncertainty. Several prior works have focused on querying and mining data streams with both value and existential uncertainty. However, none of them have studied, in depth, the implications of existential uncertainty on sliding window processing, even though it naturally arises when processing uncertain data. In this work, we study the challenges arising from existential uncertainty, more specifically the management of count-based sliding windows, which are a basic building block of stream processing applications. We extend the semantics of sliding window to define the novel concept of uncertain sliding windows and provide both exact and approximate algorithms for managing windows under existential uncertainty. We also show how current state-of-the-art techniques for answering similarity join queries can be easily adapted to be used with uncertain sliding windows. We evaluate our proposed techniques under a variety of configurations using real data. The results show that the algorithms used to maintain uncertain sliding windows can efficiently operate while providing a highquality approximation in query answering. In addition, we show that sort-based similarity join algorithms can perform better than index-based techniques (on 17 real datasets) when the number of possible values per tuple is low, as in many real-world applications. The problem of processing uncertain data streams has attracted lots of attention in the past years and has found many interesting applications across diverse domains.. In many of these applications, the uncertainty arises from the value uncertainty present in the data sources. However, as we have shown in this paper, there is a tight relationship between value uncertainty and existential uncertainty when composing stream operators, one inducing the other based on the topology at hand.. In this study, we investigated the implications of existential uncertainty on managing sliding windows. In past studies, the window size was taken fixed, and it did not depend on data uncertainty. We extended the semantics of sliding window processing by modeling the window size as the number of truly existing tuples with probabilistic guarantees. To the best of our knowledge, this problem has not been addressed before.. Interestingly, previous works on stream operators that can handle value uncertainty are mostly orthogonal to our contributions and can easily be adapted to use our extensions. To illustrate this, we discussed the adaptation of a state-of-the-art similarity join algorithm to use uncertain sliding windows. We also presented a novel pruning strategy that can be used to efficiently maintain uncertain sliding windows. In the last decade, several database and stream processing systems with support for uncertainty have been proposed [6, 13, 15, 17, 27, 28, 42, 45, 46] , eventually leading to two emerging tuple models.. The x-tuple model [6] represents uncertain tuples by multiple alternatives and their respective occurring probabilities. If the sample probabilities do not sum up to one, there exist possible instantiations of the uncertain stream where the tuple does not exist. Uncertain tuples are processed according to the possible world semantics [23] .. In the attribute model [17, 42] , uncertainty is more fine-grained, and it refers to single tuple attributes. An uncertain attribute is represented by a random variable whose distribution is assumed to be known. The distribution may be continuous or discrete, and it is fully described by its Probability Density Function (PDF). The baseline formalization of this model fails to capture correlations among attributes. Extensions have been proposed to address this limitation [42] .. In this study, we adopt the x-tuple model. This choice is motivated by the following observations. First, it can capture correlations among attributes without considering more complex extensions (i.e., making explicit the tuple distribution by means of a set of drawn samples). Second, it supports both value uncertainty and existential uncertainty of tuples. Third, real-world uncertain data are often provided by means of discrete samples drawn from unknown distributions. Fourth, possible world semantics provide an intuitive bridge between semantics of stream operators in certain data streams and their respective adaptations for uncertain data streams. Last but not the least, we observe that applying stream operators to uncertain streams can lead to complex distributions that do not have a closed form. This requires capturing data stream dynamics by reasoning on complex distributions, relying on methods like Monte Carlo estimation, which usually cannot be performed efficiently.. In what follows, we give an overview of relevant work in the literature on processing data streams with uncertainty, adopting the uncertainty models described above.. Lian and Chen [33] propose novel techniques for answering similarity matching queries between uncertain data streams. Methods for spatial and probabilistic pruning are used to filter the search space efficiently. The two data streams are processed through a pair of sliding windows, and candidate matches are identified by the sliding window contents. This study is orthogonal to our proposal, and it is used to evaluate the effectiveness of our techniques.. Diao et al. [17] propose a data stream processing system that supports uncertainty modeled by continuous random variables. It also contributes two real-world use cases, namely object tracking on RFID networks and monitoring of hazardous weather conditions. Ré et al. [40] propose an event processing system for probabilistic event streams by using Markovian models to infer hidden (possibly correlated) variables, e.g., a person's location from RFID readings. It is worth noting that this system can produce output events that are existentially uncertain.. Dallachiesa et al. [13] perform an extensive experimental and analytical comparison of methods for answering similarity matching queries on uncertain time series.. In [11] , an augmented R-tree indexes a dataset of spatial points with existential uncertainty. The authors represent existential uncertainty by independent probability values associated with the indexed points. Intermediate nodes maintain aggregate statistics, summarizing the existential probabilities of the indexed points in their subtrees. Augmented R-trees support probabilistic range queries, reporting only matching points with existential probabilities higher than a user-defined threshold.. In [27] , the authors propose a general framework to answer top-k queries on uncertain data streams. Each item in the data stream exists with some independent probability. Given a user-defined sliding window size, possible worlds are enumerated and the top-k items are identified accordingly to different possible semantics supported by the model. The window size is fixed, and it is used to enumerate all possible worlds.. In [32] , the authors consider the problem of identifying frequent itemsets in uncertain data streams. Uncertain data streams are processed through a sliding window containing a fixed number of batches (each batch contains a fixed number of transactions). The existential probability of each transaction is represented by an independent probability value. Also in this study, the window size is fixed, and it does not change over time.. Zhang et al. [52] propose an efficient method to maintain skylines over uncertain data streams. A skyline is a set of items that are not dominated by any other item. An item i dominates item j if it is "better" than j in at least one tuple attribute and not "worse" than j in all the other tuple attributes. The definitions of "better" and "worse" are domain-specific. The skyline is maintained over a sliding window. The window size is fixed. The probability for each item to belong to the skyline is then estimated by enumerating all the possible worlds. Only skyline items with probability higher than a user-defined thresholds are reported.. CLARO and PODS [26, 45] are a probabilistic data stream processing systems that represent continuous-valued attributes using Gaussian mixture models. Formal semantics for relational processing are presented for operators including joins and aggregates. Exact result distributions for aggregates based on characteristic functions and exact closed forms are presented. The authors acknowledge that these algorithms may be impractical because the time complexity grows exponentially in the number of input tuples, and propose approximated schemes. Joins are evaluated by using cross-product semantics or the novel concept of probabilistic views, that is used to derive closed form join result distributions in the form of Gaussian mixture models. Existential uncertainty of tuples is recognized as an important issue that requires extensions to the current proposal, using expensive computational methods such as Monte Carlo simulations.. In the aforementioned papers, the occurrence probabilities of items in a data stream do not affect the sliding window size. The window size is fixed and does not depend on data uncertainty. In our study, we extend the semantics of sliding window query processing by referring to the window size as the number of truly existing tuples in the uncertain data stream. Our contribution is a basic building block for processing sliding windows on uncertain data streams, and it is orthogonal to past studies. As shown in Sect. 6, previous works on streaming operations with sliding windows can be easily adapted to accommodate our extensions.. Although in this work, we focus on existential uncertainty in data streams, similar forms of structural uncertainty have been investigated also on linked data, where the connections between different entities are uncertain [12, 22] . These models can be used for link prediction and collective classification. However, they haven't been designed to estimate the number of existing links, and they cannot be easily applied to our problem definition.. In this work, we take advantage of previously developed methods for efficiently evaluating the CDF of Poisson-binomial distributions, e.g., the sum of n independent Bernoulli trials. Some methods include Bernecker et al. [7] , which propose an algorithm with time cost O(n 2 ) based on dynamic programming, and Sun et al. [44] , which propose an algorithm based on divide-and-conquer with time cost O(nlog 2 n). Other approximation algorithms also exist [9, 47] .. We use one exact method (RF1) and three approximations (Poisson, Normal, and Refined Normal Approximations), as reviewed in [25] . Independence is a simplifying assumption widely used in prior studies on uncertain data management [2] .. We observe that in our data model, the parameters of the Poisson-binomial distribution can be easily derived from the existential probabilities. In particular situations where this information is not available, a simplified data model can be adopted and the distribution parameters must be estimated. In [16] , the authors propose an algorithm which learns Poissonbinomial distributions with -accuracy from input samples.. Hierarchical Markov models and conditional random fields have been used to learn and infer a user's daily movements [35] from noisy sensor measurements. Our proposal can be used in these applications to model more accurately the imprecise location of users by filtering out noise using sliding windows and aggregate operators.

B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O