DMT Optimal Cooperative Protocols with Destination-Based Selection of the Best Relay

We design a cooperative protocol in the context of wireless mesh networks in order to increase the reliability of wireless links. Destination terminals ask for cooperation when they fail in decoding data frames transmitted by source terminals. In that case, each destination terminal D calls a specific relay terminal B with a signaling frame to help its transmission with source terminal S. To select appropriate relays, destination terminals maintain tables of relay terminals, one for each possible source address. These tables are constituted by passively overhearing ongoing transmissions. Hence, when cooperation is needed between S and D, and when a relay B is found by terminal D in the relay table associated with terminal S, the destination terminal sends a negative acknowledgment frame that contains the address of B. When the best relay B has successfully decoded the source message, it sends a copy of the data frame to D using a selective decode-andforward transmission scheme. The on-demand approach allows maximization of the spatial multiplexing gain and the cooperation of the best relay allows maximization of the spatial diversity order. Hence, the proposed protocol achieves optimal diversitymultiplexing trade-off performance. Moreover, this performance is achieved through a collision-free selection process

Novel electrocardiographic criteria for the diagnosis of arrhythmogenic right ventricular cardiomyopathy

Aims: In order to improve the electrocardiographic (ECG) diagnosis of arrhythmogenic right ventricular cardiomyopathy (ARVC), we evaluated novel quantitative parameters of the QRS complex and the value of bipolar chest leads (CF leads) computed from the standard 12 leads. Methods and results: We analysed digital 12-lead ECGs in 44 patients with ARVC, 276 healthy subjects including 44 age and sex-matched with the patients and 36 genotyped members of ARVC families. The length and area of the terminal S wave in V1 to V3 were measured automatically using a common for all 12 leads QRS end. T wave negativity was assessed in V1 to V6 and in the bipolar CF leads computed from the standard 12 leads. The length and area of the terminal S wave were significantly shorter, whereas the S wave duration was significantly longer in ARVC patients compared with matched controls. Among members of ARVC families, those with mutations (n = 15) had shorter QRS length in V2 and V3 and smaller QRS area in lead V2 compared with those without mutations (n = 20). In ARVC patients, the CF leads were diagnostically superior to the standard unipolar precordial leads. Terminal S wave duration in V1 >48 ms or major T wave negativity in CF leads separated ARVC patients from matched controls with 90% sensitivity and 86% specificity. Conclusion: The terminal S wave length and area in the right precordial leads are diagnostically useful and suitable for automatic analysis in ARVC. The CF leads are diagnostically superior to the unipolar precordial leads

Metric Dimension of Amalgamation of Graphs

A set of vertices $S$ resolves a graph $G$ if every vertex is uniquely determined by its vector of distances to the vertices in $S$. The metric dimension of $G$ is the minimum cardinality of a resolving set of $G$. Let $\{G_1, G_2, \ldots, G_n\}$ be a finite collection of graphs and each $G_i$ has a fixed vertex $v_{0_i}$ or a fixed edge $e_{0_i}$ called a terminal vertex or edge, respectively. The \emph{vertex-amalgamation} of $G_1, G_2, \ldots, G_n$, denoted by $Vertex-Amal\{G_i;v_{0_i}\}$, is formed by taking all the $G_i$'s and identifying their terminal vertices. Similarly, the \emph{edge-amalgamation} of $G_1, G_2, \ldots, G_n$, denoted by $Edge-Amal\{G_i;e_{0_i}\}$, is formed by taking all the $G_i$'s and identifying their terminal edges. Here we study the metric dimensions of vertex-amalgamation and edge-amalgamation for finite collection of arbitrary graphs. We give lower and upper bounds for the dimensions, show that the bounds are tight, and construct infinitely many graphs for each possible value between the bounds.Comment: 9 pages, 2 figures, Seventh Czech-Slovak International Symposium on Graph Theory, Combinatorics, Algorithms and Applications (CSGT2013), revised version 21 December 201

Cube-Cut: Vertebral Body Segmentation in MRI-Data through Cubic-Shaped Divergences

In this article, we present a graph-based method using a cubic template for volumetric segmentation of vertebrae in magnetic resonance imaging (MRI) acquisitions. The user can define the degree of deviation from a regular cube via a smoothness value Delta. The Cube-Cut algorithm generates a directed graph with two terminal nodes (s-t-network), where the nodes of the graph correspond to a cubic-shaped subset of the image's voxels. The weightings of the graph's terminal edges, which connect every node with a virtual source s or a virtual sink t, represent the affinity of a voxel to the vertebra (source) and to the background (sink). Furthermore, a set of infinite weighted and non-terminal edges implements the smoothness term. After graph construction, a minimal s-t-cut is calculated within polynomial computation time, which splits the nodes into two disjoint units. Subsequently, the segmentation result is determined out of the source-set. A quantitative evaluation of a C++ implementation of the algorithm resulted in an average Dice Similarity Coefficient (DSC) of 81.33% and a running time of less than a minute.Comment: 23 figures, 2 tables, 43 references, PLoS ONE 9(4): e9338

Simulasi multi teller bank dengan penjokian

Jaringan persediaan permintaan disajikan dalam bentuk jaringan G(V,E,I,c1) yang terdiri dari himpunan titik V, himpunan garis berarah E, fungsi kapasitas c, fungsi aliranf dan fungsi batas bawah 1, dengan pusat sumber s dan pusat terminal 1, dimana 1 adalah fungsi dan i E ke bilangan nil tidak negatif yang memenuhi Dengan menggunakan teorema sirkulasi menjamin kondisi sirkulasi aliran yang diperoleh -dari jaringan persediaan. perrnintaan G(Y,E,1,c,j) bebas sumber bebas terminal menjadi fisibe

Stochastic Continuous Time Neurite Branching Models with Tree and Segment Dependent Rates

In this paper we introduce a continuous time stochastic neurite branching model closely related to the discrete time stochastic BES-model. The discrete time BES-model is underlying current attempts to simulate cortical development, but is difficult to analyze. The new continuous time formulation facilitates analytical treatment thus allowing us to examine the structure of the model more closely. We derive explicit expressions for the time dependent probabilities p(\gamma, t) for finding a tree \gamma at time t, valid for arbitrary continuous time branching models with tree and segment dependent branching rates. We show, for the specific case of the continuous time BES-model, that as expected from our model formulation, the sums needed to evaluate expectation values of functions of the terminal segment number \mu(f(n),t) do not depend on the distribution of the total branching probability over the terminal segments. In addition, we derive a system of differential equations for the probabilities p(n,t) of finding n terminal segments at time t. For the continuous BES-model, this system of differential equations gives direct numerical access to functions only depending on the number of terminal segments, and we use this to evaluate the development of the mean and standard deviation of the number of terminal segments at a time t. For comparison we discuss two cases where mean and variance of the number of terminal segments are exactly solvable. Then we discuss the numerical evaluation of the S-dependence of the solutions for the continuous time BES-model. The numerical results show clearly that higher S values, i.e. values such that more proximal terminal segments have higher branching rates than more distal terminal segments, lead to more symmetrical trees as measured by three tree symmetry indicators.Comment: 41 pages, 2 figures, revised structure and text improvement