Fast calculation of the CAC convolution algorithm using the multinomial distribution function

The authors focus on one of the methods for connection acceptance control (CAC) in an ATM network: the convolution approach. With the aim of reducing the cost in terms of calculation and storage requirements, they propose the use of the multinomial distribution function. This permits direct computation of the associated probabilities of the instantaneous bandwidth requirements. This in turn makes possible a simple deconvolution process. Moreover, under certain conditions additional improvements may be achieved

A simulation-based algorithm for solving the resource-assignment problem in satellite telecommunication networks

This paper proposes an heuristic for the scheduling of capacity requests and the periodic assignment of radio resources in geostationary (GEO) satellite networks with star topology, using the Demand Assigned Multiple Access (DAMA) protocol in the link layer, and Multi-Frequency Time Division Multiple Access (MF-TDMA) and Adaptive Coding and Modulation (ACM) in the physical layer.

Complement Factor B Polymorphism and the Phenotype of Early Age-related Macular Degeneration.

Abstract Purpose: Age-related macular degeneration (AMD) has been associated with a number of polymorphisms in genes in the complement pathway. We examined the potential genotype-phenotype correlation of complement factor B (CFB) (R32Q) polymorphisms in Caucasian patients with AMD. Methods: Data from a Central European cohort of 349 patients with early AMD in at least one eye were analyzed for potential associations of the CFB (R32Q/rs641153) polymorphism with phenotypic features of early AMD. Early AMD was classified according to the International Classification and Grading System into predominant drusen size, largest drusen, drusen covered surface, central or ring-like location, peripheral drusen, and pigmentary changes. The potential association with single nucleotide polymorphisms on CFB (R32Q/rs641153) was evaluated for all patients, corrected for age, sex, and the polymorphisms of CFH (Y402H) and ARMS2 (A69S). Results: CFB (R32Q) polymorphisms showed a significant association with smaller drusen size (largest drusen ≤250 µm, p = 0.021, predominant drusen ≤125 µm, p = 0.016), with smaller surface covered by drusen (≤10%; p = 0.02), and with more frequent occurrence of peripheral drusen (p = 0.007). No association was found for pigmentary changes. Conclusions: The CFB (R32Q) polymorphism was associated with AMD characterized by small drusen only, and appeared to be protective of large drusen (OR 0.48/0.45) and of larger drusen covered area (OR 0.34). Furthermore, peripheral drusen were more frequently found (OR 2.27). This result supports the role of complement components and their polymorphisms in drusen formation and may enable a better understanding of AMD pathogenesis.

Algorithm creation and optimization for the crew pairing problem

Algoritmo que optimiza y crea pairings para tripulaciones de líneas aéreas mediante la posterior programación en Java.

A genetic algorithm to ensemble feature selection

We are going to implement the "GA-SEFS" by Tsymbal and analyse experimentally its performance depending on the classifier algorithms used in the fitness function (NB, MNge, SMO). We are also going to study the effect of adding to the fitness function a measure to control complexity of the base classifiers.

Risk assessment of recurrence in sporadic retinoblastoma using a molecular-based algorithm.

PURPOSE: Most RB1 mutations are unique and distributed throughout the RB1 gene. Their detection can be time-consuming and the yield especially low in cases of conservatively-treated sporadic unilateral retinoblastoma (Rb) patients. In order to identify patients with true risk of developing Rb, and to reduce the number of unnecessary examinations under anesthesia in all other cases, we developed a universal sensitive, efficient and cost-effective strategy based on intragenic haplotype analysis. METHODS: This algorithm allows the calculation of the a posteriori risk of developing Rb and takes into account (a) RB1 loss of heterozygosity in tumors, (b) preferential paternal origin of new germline mutations, (c) a priori risk derived from empirical data by Vogel, and (d) disease penetrance of 90% in most cases. We report the occurrence of Rb in first degree relatives of patients with sporadic Rb who visited the Jules Gonin Eye Hospital, Lausanne, Switzerland, from January 1994 to December 2006 compared to expected new cases of Rb using our algorithm. RESULTS: A total of 134 families with sporadic Rb were enrolled; testing was performed in 570 individuals and 99 patients younger than 4 years old were identified. We observed one new case of Rb. Using our algorithm, the cumulated total a posteriori risk of recurrence was 1.77. CONCLUSIONS: This is the first time that linkage analysis has been validated to monitor the risk of recurrence in sporadic Rb. This should be a useful tool in genetic counseling, especially when direct RB1 screening for mutations leaves a negative result or is unavailable.

Treatment algorithm for moderate to severe ulcerative colitis.

The care for a patient with ulcerative colitis (UC) remains challenging despite the fact that morbidity and mortality rates have been considerably reduced during the last 30 years. The traditional management with intravenous corticosteroids was modified by the introduction of ciclosporin and infliximab. In this review, we focus on the treatment of patients with moderate to severe UC. Four typical clinical scenarios are defined and discussed in detail. The treatment recommendations are based on current literature, published guidelines and reviews, and were discussed at a consensus meeting of Swiss experts in the field. Comprehensive treatment algorithms were developed, aimed for daily clinical practice.

Spiral MR myocardial tagging.

In the present study, complementary spatial modulation of magnetization (CSPAMM) myocardial tagging was extended with an interleaved spiral imaging sequence. The use of a spiral sequence enables the acquisition of grid-tagged images with a tagline distance as low as 4 mm in a single breath-hold. Alternatively, a high temporal resolution of 77 frames per second was obtained with 8-mm grid spacing. Ten healthy adult subjects were studied. With this new approach, high-quality images can be obtained and the tags persist throughout the entire cardiac cycle.

Algorithm optimization for solving crew scheduling problems

In this paper, we are proposing a methodology to determine the most efficient and least costly way of crew pairing optimization. We are developing a methodology based on algorithm optimization on Eclipse opensource IDE using the Java programming language to solve the crew scheduling problems.

Development and validation of AMANDA, a new algorithm for selecting highly relevant regions in Molecular Interaction Fields

Descriptors based on Molecular Interaction Fields (MIF) are highly suitable for drug discovery, but their size (thousands of variables) often limits their application in practice. Here we describe a simple and fast computational method that extracts from a MIF a handful of highly informative points (hot spots) which summarize the most relevant information. The method was specifically developed for drug discovery, is fast, and does not require human supervision, being suitable for its application on very large series of compounds. The quality of the results has been tested by running the method on the ligand structure of a large number of ligand-receptor complexes and then comparing the position of the selected hot spots with actual atoms of the receptor. As an additional test, the hot spots obtained with the novel method were used to obtain GRIND-like molecular descriptors which were compared with the original GRIND. In both cases the results show that the novel method is highly suitable for describing ligand-receptor interactions and compares favorably with other state-of-the-art methods.

Right coronary artery flow velocity and volume assessment with spiral K-space sampled breathhold velocity-encoded MRI at 3 tesla: accuracy and reproducibility.

PURPOSE: To evaluate accuracy and reproducibility of flow velocity and volume measurements in a phantom and in human coronary arteries using breathhold velocity-encoded (VE) MRI with spiral k-space sampling at 3 Tesla. MATERIALS AND METHODS: Flow velocity assessment was performed using VE MRI with spiral k-space sampling. Accuracy of VE MRI was tested in vitro at five constant flow rates. Reproducibility was investigated in 19 healthy subjects (mean age 25.4 +/- 1.2 years, 11 men) by repeated acquisition in the right coronary artery (RCA). RESULTS: MRI-measured flow rates correlated strongly with volumetric collection (Pearson correlation r = 0.99; P < 0.01). Due to limited sample resolution, VE MRI overestimated the flow rate by 47% on average when nonconstricted region-of-interest segmentation was used. Using constricted region-of-interest segmentation with lumen size equal to ground-truth luminal size, less than 13% error in flow rate was found. In vivo RCA flow velocity assessment was successful in 82% of the applied studies. High interscan, intra- and inter-observer agreement was found for almost all indices describing coronary flow velocity. Reproducibility for repeated acquisitions varied by less than 16% for peak velocity values and by less than 24% for flow volumes. CONCLUSION: 3T breathhold VE MRI with spiral k-space sampling enables accurate and reproducible assessment of RCA flow velocity.

A systolic array for linear MIMO detection based on an all-swap lattice reduction algorithm

A systolic array to implement lattice-reduction-aided lineardetection is proposed for a MIMO receiver. The lattice reductionalgorithm and the ensuing linear detections are operated in the same array, which can be hardware-efficient. All-swap lattice reduction algorithm (ASLR) is considered for the systolic design.ASLR is a variant of the LLL algorithm, which processes all lattice basis vectors within one iteration. Lattice-reduction-aided linear detection based on ASLR and LLL algorithms have very similarbit-error-rate performance, while ASLR is more time efficient inthe systolic array, especially for systems with a large number ofantennas.

ILS-ESP An efficient, simple, and parameter-free algorithm for solving the permutation flow-shop problem

From a managerial point of view, the more effcient, simple, and parameter-free (ESP) an algorithm is, the more likely it will be used in practice for solving real-life problems. Following this principle, an ESP algorithm for solving the Permutation Flowshop Sequencing Problem (PFSP) is proposed in this article. Using an Iterated Local Search (ILS) framework, the so-called ILS-ESP algorithm is able to compete in performance with other well-known ILS-based approaches, which are considered among the most effcient algorithms for the PFSP. However, while other similar approaches still employ several parameters that can affect their performance if not properly chosen, our algorithm does not require any particular fine-tuning process since it uses basic "common sense" rules for the local search, perturbation, and acceptance criterion stages of the ILS metaheuristic. Our approach defines a new operator for the ILS perturbation process, a new acceptance criterion based on extremely simple and transparent rules, and a biased randomization process of the initial solution to randomly generate different alternative initial solutions of similar quality -which is attained by applying a biased randomization to a classical PFSP heuristic. This diversification of the initial solution aims at avoiding poorly designed starting points and, thus, allows the methodology to take advantage of current trends in parallel and distributed computing. A set of extensive tests, based on literature benchmarks, has been carried out in order to validate our algorithm and compare it against other approaches. These tests show that our parameter-free algorithm is able to compete with state-of-the-art metaheuristics for the PFSP. Also, the experiments show that, when using parallel computing, it is possible to improve the top ILS-based metaheuristic by just incorporating to it our biased randomization process with a high-quality pseudo-random number generator.

Comparison between standard radiography and spiral CT with 3D reconstruction in the evaluation, classification and management of tibial plateau fractures.

The aim of this study was to compare the diagnostic efficiency of plain film and spiral CT examinations with 3D reconstructions of 42 tibial plateau fractures and to assess the accuracy of these two techniques in the pre-operative surgical plan in 22 cases. Forty-two tibial plateau fractures were examined with plain film (anteroposterior, lateral, two obliques) and spiral CT with surface-shaded-display 3D reconstructions. The Swiss AO-ASIF classification system of bone fracture from Muller was used. In 22 cases the surgical plans and the sequence of reconstruction of the fragments were prospectively determined with both techniques, successively, and then correlated with the surgical reports and post-operative plain film. The fractures were underestimated with plain film in 18 of 42 cases (43%). Due to the spiral CT 3D reconstructions, and precise pre-operative information, the surgical plans based on plain film were modified and adjusted in 13 cases among 22 (59%). Spiral CT 3D reconstructions give a better and more accurate demonstration of the tibial plateau fracture and allows a more precise pre-operative surgical plan.