The Role of microRNAs in Development of Colitis-Associated Colorectal Cancer

Colorectal cancer (CRC) is the third most deadly cancer worldwide, and inflammatory bowel disease (IBD) is one of the critical factors in CRC carcinogenesis. IBD is responsible for an unphysiological and sustained chronic inflammation environment favoring the transformation. MicroRNAs (miRNAs) belong to a class of highly conserved short single-stranded segments (18–25 nucleotides) non-coding RNA and have been extensively discussed in both CRC and IBD. However, the role of miRNAs in the development of colitis-associated CRC (CAC) is less clear. The aim of this review is to summarize the major upregulated (miR-18a, miR-19a, miR-21, miR-31, miR-155 and miR-214) and downregulated (miR-124, miR-193a-3p and miR-139-5p) miRNAs in CAC, and their roles in genes’ expression modulation in chronic colonic-inflammation-induced carcinogenesis, including programmed cell-death pathways. These miRNAs dysregulation could be applied for early CAC diagnosis, to predict therapy efficacy and for precision treatment.     

Cerebral microbleeds and cognitive decline in a hemodialysis patient: Case report and review of literature

Cerebral microbleeds (CMBs) are small hemosiderin deposits indicative of prior cerebral microscopic hemorrhage and previously thought to be clinically silent. Recent population‐based cross‐sectional studies and prospective longitudinal cohort studies have revealed association between CMB and cognitive dysfunction. In the general population, CMBs are associated with age, hypertension, and cerebral amyloid angiopathy. In the chronic kidney disease (CKD) population, diminished estimated glomerular filtration rate has been found to be an independent risk factor for CMB, raising the possibility that a uremic milieu may predispose to microbleeds. In the end‐stage renal disease (ESRD) population on hemodialysis, the incidence of microbleeds is significantly higher compared with a control group without history of CKD or stroke. We present an ESRD patient on chronic hemodialysis with a history of gradual cognitive decline and progressive CMBs. Through this case and literature review, we illustrate the need to develop detection and prediction models to treat this frequent development in ESRD patients.     

An architecture to support scalable distributed virtual environment systems on grid

A Distributed Virtual Environment (DVE) system offers a computer-generated virtual world in which individuals located at different places in the physical world can interact with one another. In order to achieve real-time response for a large user base, DVE systems need to have a scalable architecture. In this paper, we present the design of a grid-enabled service oriented framework for facilitating the construction of scalable DVE systems on computing grids. A service component called “gamelet” is proposed, whose distinctive mark is its high mobility for supporting dynamic load sharing. We propose a gamelet migration protocol which can ensure the transparency and efficiency of gamelet migration, and an adaptive gamelet load-balancing (AGLB) algorithm for making gamelet redistribution decisions at runtime. The algorithm considers both the synchronization costs of the DVE system and network latencies inherent in the grid nodes. The activities of the users and the heterogeneity of grid resources are also considered in order to carry out load sharing more effectively. We evaluate the performance of the proposed mechanisms through a multiplayer online game prototype implemented using the Globus toolkit. The results show that our approach can achieve faster response times and higher throughputs than some existing approaches. This research is supported in part by the China National Grid project (863 program) and the HKU Foundation Seed Grant 28506002.     

On-demand learning for a wireless campus

The current Internet and wireless networks are harsh environments for transporting high-bandwidth multimedia data. We examine the technical issues involved, and describe an end-to-end solution to support a Web-based learn-on-demand system that operates in a wireless campus environment.     

Limited-trial Chase decoding

Chase decoders permit flexible use of reliability information in algebraic decoding algorithms for error-correcting block codes of Hamming distance d. The least complex version of the original Chase algorithms uses roughly d/2 trials of a conventional binary decoder, after which the best decoding result is selected as the final output. On certain channels, this approach achieves asymptotically the same performance as maximum-likelihood (ML) decoding. In this correspondence, the performance of Chase-like decoders with even less trials is studied. Most strikingly, it turns out that asymptotically optimal performance can be achieved by a version which uses only about d/4 trials.     

Large-scale simulation studies in image pattern recognition

Many obstacles to progress in image pattern recognition result from the fact that per-class distributions are often too irregular to be well-approximated by simple analytical functions. Simulation studies offer one way to circumvent these obstacles. We present three closely related studies of machine-printed character recognition that rely on synthetic data generated pseudo-randomly in accordance with an explicit stochastic model of document image degradations. The unusually large scale of experiments - involving several million samples that makes this methodology possible have allowed us to compute sharp estimates of the intrinsic difficulty (Bayes risk) of concrete image recognition problems, as well as the asymptotic accuracy and domain of competency of classifiers     

Retained fetal lung liquid in congenital lobar emphysema: a possible predictor of polyalveolar lobe

The purpose of this study was to determine whether retention of fetal lung liquid is more prevalent in polyalveolar congenital lobar emphysema than in conventional congenital lobar emphysema. Two patients with congenital lobar emphysema were prospectively identified in a 3-year period. Twenty-five such patients were identified in a retrospective study covering 39 years. Medical records were available for 22 patients who had 23 emphysematous lobes. Both babies from the prospective study and six subjects from the retrospective group had respiratory symptoms and underwent chest X-ray in the first day of life. Six of the eight babies with respiratory symptoms and chest imaging in the first day of life had retention of fetal lung liquid in an emphysematous lobe. All six of these lobes were polyalveolar. The lobe in one child was a polyalveolar lobe but without retained fetal lung liquid, and one child exhibited conventional lobar emphysema also without retained fetal lung liquid. One polyalveolar lobe caused no neonatal symptoms and was not imaged until the child was 3 months old. No baby with conventional lobar emphysema was shown to have retained fetal lung liquid. There seems to be a correlation between polyalveolar lobe and onset of respiratory symptoms in the first day of life. Retention of fetal lung liquid within the affected lobe was documented only in cases of polyalveolar lobe.     

On the macroscopic optimization of multicell wireless systems with multiuser detection and multiple antennas - uplink analysis

In this paper, we consider a system with K single-antenna client users, n/sub B/ base stations (each base station has n/sub R/ antennas), as well as a centralized controller. A client user could be associated with a single base station at any time. All the base stations operate at the same frequency and have optimal multiuser detection per base station which cancels intracell interference only. We consider a general problem of uplink macroscopic resource management where the centralized controller dynamically determines an appropriate association mapping of the K users with respect to the n/sub B/ base stations over a macroscopic time scale. We propose a novel analytical framework for the above macroscopic scheduling problems. A simple rule is to associate a user with the strongest base station (camp-on-the-strongest-cell), and this has been widely employed in conventional cellular systems. However, based on the optimization framework, we found that this conventional approach is in fact not optimal when multiuser detection is employed at the base station. We show that the optimal macroscopic scheduling algorithm is of exponential complexity, and we propose a simple greedy algorithm as a feasible solution.     

Dynamic Complexity Theory Revisited

Dynamic complexity investigates the required effort to maintain knowledge about a property of a structure under changing operations. This article introduces a refined notion of dynamic problems which takes the initial structure into account. It develops the basic structural complexity notions accordingly. It also shows that the dynamic version of the LOGCFL-complete problem D₂LREACH(acyclic) can be maintained with first-order updates.