A Hybrid Prediction Model for Moving Objects Hoyoung Jeung; Qing Liu; Heng Tao Shen ...
2008 IEEE 24th International Conference on Data Engineering,
2008-April
Conference Proceeding
Existing prediction methods in moving objects databases cannot forecast locations accurately if the query time is far away from the current time. Even for near future prediction, most techniques ...assume the trajectory of an object's movements can be represented by some mathematical formulas of motion functions based on its recent movements. However, an object's movements are more complicated than what the mathematical formulas can represent. Prediction based on an object's trajectory patterns is a powerful way and has been investigated by several work. But their main interest is how to discover the patterns. In this paper, we present a novel prediction approach, namely The Hybrid Prediction Model, which estimates an object's future locations based on its pattern information as well as existing motion functions using the object's recent movements. Specifically, an object's trajectory patterns which have ad-hoc forms for prediction are discovered and then indexed by a novel access method for efficient query processing. In addition, two query processing techniques that can provide accurate results for both near and distant time predictive queries are presented. Our extensive experiments demonstrate that proposed techniques are more accurate and efficient than existing forecasting schemes.
Chronic stress has been proven to accelerate the development and progression of ovarian cancer, but the underlying molecular mechanisms have not been fully elucidated. In a combination survey of ...ovarian cancer with chronic stress (OCCS) mouse models and high-throughput sequencing, a key lncRNA named LOC102724169 on chromosome 6q27 has been identified, which functions as a dominant tumor suppressor in OCCS. Transcriptionally regulated by CCAAT enhancer binding protein (CEBP) beta (CEBPB), LOC102724169 shows low expression and correlates with poor progression-free survival (PFS) in OCCS patients. LOC102724169 is an instructive molecular inhibitor of malignancy of ovarian cancer cells, which is necessary to improve the curative effect of cisplatin therapy on ovarian cancer. This function stems from the inactivation of molecules in phosphatidylinositol 3-kinase (PI3K)/AKT signaling, repressing MYB expression and retaining the responsiveness of cancer cells to cisplatin. These findings provide a mechanistic understanding of the synergistic anti-tumor purpose of LOC102724169 as a bona fide tumor suppressor, enhancing the therapeutic effect of cisplatin. The new regulatory model of “lncRNA-MYB” provides new perspectives for LOC102724169 as a chronic stress-related molecule and also provides mechanistic insight into exploring the cancer-promoting mechanism of MYB in OCCS, which may be a promising therapeutic strategy for ovarian cancer.
Display omitted
Tang and colleagues identify a key lncRNA, LOC102724169, as a bona fide tumor suppressor, enhancing the therapeutic effect of cisplatin on ovarian cancer patients with chronic stress. This provides new perspectives for LOC102724169 as a chronic stress-related molecule and mechanistic insight into exploring the cancer-promoting mechanism for ovarian cancer.
The optical, color, electrical, and thermal properties of an LED devices are highly dependent on one another. The luminous flux variation and correlated color temperature (CCT) shifting of white LED ...sources is attributed to luminous efficacy and emission spectrum shifting with the electrical power and heat-dissipation power. An analysis model that includes the luminous flux, CCT, electrical power, and junction temperature of the white LED sources with bilevel driver is proposed in this paper. The proposed model can descript that the stablized luminous flux and CCT of the white LED system with bilevel driver is a result of the complex interactions among the given electrical power of bilevel, duty cycle, thermal resistances, junction temperature, and the physical parameters of the LED sources. Reduction variation of CCT and luminous flux of the white LED device with bilevel driver over a dimming range has been practically achieved. The proposed method can be easily adopted for improving the CCT and luminous flux stabilization of the white LED device with a bilevel driver.
The common, co-segregating Toll-like receptor 4 (TLR4) non-synonymous single nucleotide polymorphisms (SNPs), Asp299Gly and Thr399Ile, are associated with hyporesponsiveness to inhaled ...lipopolysaccharide (LPS) and increased susceptibility to Gram negative pathogens in humans. The purpose of this study was to identify the relative contributions of the Asp299Gly and the Thr399Ile variants in inhibiting the function of TLR4. 293/hMD2-CD14 cell line was transfected with lentiviral constructs containing human wild type (WT) TLR4-EGFP or TLR4-EGFP with Asp299Gly, Thr399Ile or Asp299Gly/Thr399Ile complementary DNA (cDNA). Multiple stable cell lines were established for each construct: three for WT TLR4, Asp299Gly, and Thr399Ile, and only two for Asp299Gly/Thr399Ile mutants and EGFP control. We did not observe a significant effect of polymorphisms on cell surface and intracellular TLR4 expression nor were there any significant differences in TLR4 and EGFP protein levels assessed by Western blotting and confocal microscopy among the multiple cell lines of each of the constructs. All cell lines had a dose-dependent responsiveness to LPS stimulation. However, compared to the WT TLR4, cells expressing TLR4 with Asp299Gly but not Thr399Ile polymorphism produced significantly less (P<0.05) IL-8 following LPS stimulation. Similarly, cells expressing TLR4 Asp299Gly but not Thr399Ile allele had significantly lower percentage of phosphorylated and total NF-κB P65 following LPS stimulation. While we could not do statistics on the Asp299Gly/Thr399Ile group, we observed a reduced responsiveness to LPS compared to WT TLR4. Taken together, we observed that the TLR4 Asp299Gly variant, but not the Thr399Ile variant, is responsible for impaired responsiveness of TLR4 to LPS and corresponding activation of NF-κB.
The need for richer descriptions of images arises in a wide spectrum of applications ranging from image understanding to image retrieval. While the Automatic Image Annotation (AIA) has been ...extensively studied, image descriptions with the output labels lack sufficient information. This paper proposes to augment image descriptions using structured prediction output. We define a hierarchical tree-structured semantic unit to describe images, from which we can obtain not only the class and subclass one image belongs to, but also the attributes one image has. After defining a new feature map function of structured SVM, we decompose the loss function into every node of the hierarchical tree-structured semantic unit and then predict the tree-structured semantic unit for testing images. In the experiments, we evaluate the performance of the proposed method on two open benchmark datasets and compare with the state-of-the-art methods. Experimental results show the better prediction performance of the proposed method and demonstrate the strength of augmenting image descriptions.
With the huge amount of video data and its exponential growth in recent years, many new challenges, like storage, search and navigation, have arisen. Among these challenges, near-duplicate video ...retrieval aims to find clips that are identical or nearly identical in content to a query clip. This has attracted much attention due to its wide applications including copyright detection, commercial monitoring and news video tracking. In this paper, we propose a practical solution based on 3-D structure tensor model for this problem. We first propose a novel video representation, adaptive structure video tensor series, together with a robust similarity measure, to improve the retrieval effectiveness. Then, we design a dimensionality reduction technique for tensor series to improve the search efficiency. Finally, we prove the effectiveness and efficiency of the proposed method by extensive experiments on hundreds of hours of real video data.
Network-on-Chip for Turbo Decoders Qingqing Yang; Xiaofang Zhou; Sobelman, Gerald Edward ...
IEEE transactions on very large scale integration (VLSI) systems,
2016-Jan., 2016-1-00, 20160101, Letnik:
24, Številka:
1
Journal Article
Recenzirano
The multi-application specific instruction processor (ASIP) architecture is a promising candidate for flexible high-throughput turbo decoders. This brief proposes a network-on-chip (NoC) structure ...for multi-ASIP turbo decoders. The process of turbo decoding is studied, and the addressing patterns for turbo codes in long term evolution (LTE) and High Speed Downlink Packet Access (HSDPA) are analyzed. Based on this analysis, two techniques, subnetworking and calculation sequence, are proposed for reducing the complexity of the NoC. The implementation results show that the proposed structure gives an improvement of 53% for HSDPA and 133% for LTE in throughput/area efficiency compared with state-of-the-art NoC solutions.
It is nowadays quite common for road networks to have textual contents on the vertices, which describe auxiliary information (e.g., business, traffic, etc.) associated with the vertex. In such road ...networks, which are modelled as weighted undirected graphs, each vertex is associated with one or more keywords, and each edge is assigned with a weight, which can be its physical length or travelling time. In this paper, we study the problem of keyword-aware continuous k nearest neighbour (KCkNN) search on road networks, which computes the k nearest vertices that contain the query keywords issued by a moving object and maintains the results continuously as the object is moving on the road network. Reducing the query processing costs in terms of computation and communication has attracted considerable attention in the database community with interesting techniques proposed. This paper proposes a framework, called a Labelling AppRoach for Continuous kNN query (LARC), on road networks to cope with KCkNN query efficiently. First we build a pivot-based reverse label index and a keyword-based pivot tree index to improve the efficiency of keyword-aware k nearest neighbour (KkNN) search by avoiding massive network traversals and sequential probe of keywords. To reduce the frequency of unnecessary result updates, we develop the concepts of dominance interval and region on road network, which share the similar intuition with safe region for processing continuous queries in Euclidean space but are more complicated and thus require more dedicated design. For high frequency keywords, we resolve the dominance interval when the query results changed. In addition, a path-based dominance updating approach is proposed to compute the dominance region efficiently when the query keywords are of low frequency. We conduct extensive experiments by comparing our algorithms with the state-of-the-art methods on real data sets. The empirical observations have verified the superiority of our proposed solution in all aspects of index size, communication cost and computation time.
This paper investigates the problem of efficiently computing responsibility for lineages of conjunctive queries with inequalities on databases. We classify the lineages of a class of queries with ...inequalities, called IQ queries, into path and composite lineages. We first compile path lineages into lineage graphs and transform lineage graphs into matrices. Then we reduce the problem of computing responsibility for path lineages to the shortest path problem, which can be solved by the dynamic programming algorithm in PTIME. We further prove composite lineages can be decomposed into path lineages for computing responsibility. Thus, our first main result shows it is in PTIME to compute responsibility for lineages of IQ queries. We generalize the previous results on dichotomy of responsibility analysis for lineages of conjunctive queries with equalities, now in the presence of inequalities. After decomposing composite lineages into path lineages, the data population needed for computing responsibility decreases more than one order of magnitude. Thus, our algorithm can efficiently compute responsibility for composite lineages. In order to compute responsibility for lineages in general, we introduce a greedy algorithm, consisting of a reduction to the set cover problem. Finally, we demonstrate the benefits of the proposed algorithms with extensive experimental results.
PDF
