Loading

Error: Cannot Load Popup Box

Hit List

Title:

Optimal Algorithms for the Interval Location Problem with Range Constraints on Length and Average

Author:

Description:

資訊工程學系 ; Let A be a sequence of n real numbers, L1 and L2 be two integers such that L1 ? L2 , and R1 and R2 be two real numbers such that R1 ? R2. An interval of A is feasible if its length is between L1 and L2 and its average is between R1 and R2. In this paper, we study the following problems: finding all feasible intervals of A, counting all ...

資訊工程學系 ; Let A be a sequence of n real numbers, L1 and L2 be two integers such that L1 ? L2 , and R1 and R2 be two real numbers such that R1 ? R2. An interval of A is feasible if its length is between L1 and L2 and its average is between R1 and R2. In this paper, we study the following problems: finding all feasible intervals of A, counting all feasible intervals of A, finding a maximum cardinality set of non-overlapping feasible intervals of A, locating a longest feasible interval of A, and locating a shortest feasible interval of A. The problems are motivated from the problem of locating CpG islands in biomolecular sequences. In this paper, we firstly show that all the problems have an Ω(n log n)-time lower bound in the comparison model. Then, we use geometric approaches to design optimal algorithms for the problems. All the presented algorithms run in an on-line manner and use O(n) space. Minimize

Publisher:

Institute of Electrical and Electronics Engineers Inc.

Contributors:

Wang,Biing-Feng ; Hsieh,Yong-Hsiang ; Yu,Chih-Chiang ; 王炳豐

Year of Publication:

2008

Document Type:

article

Language:

en

Subjects:

algorithms ; data structures ; analysis of algorithms ; geometrical problems and computations

algorithms ; data structures ; analysis of algorithms ; geometrical problems and computations Minimize

DDC:

005 Computer programming, programs & data *(computed)*

Relations:

IEEE/ACM Transactions on Computational Biology and Bioinformatics, vol. 5, no. 2, pp. 281-290, Apr.-June 2008

URL:

Content Provider:

My Lists:

My Tags:

Notes:

Title:

Improved Algorithms for Some Pattern Matching and Vertex-Disjoint Paths Problems

Author:

Description:

資訊工程學系 ; 博士 ; 國立清華大學 ; This dissertation is composed of the following two fundamental research topics in computer science: string matching and finding disjoint paths. In the first part, we study the following three indexing problems: the positional text indexing problem, the position-restricted text indexing problem, and the variable- length don...

資訊工程學系 ; 博士 ; 國立清華大學 ; This dissertation is composed of the following two fundamental research topics in computer science: string matching and finding disjoint paths. In the first part, we study the following three indexing problems: the positional text indexing problem, the position-restricted text indexing problem, and the variable- length don't care text indexing problem. Previous solutions for these indexing problems heavily rely on efficient indexes to the range successor problem. Thus, any improvement on the range successor problem immediately leads to improved results for these indexing problems. In this dissertation, we present three new indexes for the range successor problem. More specifically, we give (1) a succinct n + o(n)-word index with O(log n / loglog n) query time, whose query time improves previous O(n)-word index by an O(loglog n) factor; (2) an O(n loglog n)-word index with O((loglog n)^2) query time, whose space-time product is better than all previous solutions; and (3) an O(n^{1+\epsilon})-word index with O(1) query time, which is simpler than the previous O(1)-time index. In addition, our index in (2) can be extended to solve the well-known orthogonal range successor problem in R^3. The extended index needs O(n log^{1+\epsilon} n) words and supports O(log n loglog n) query time, improving a long-standing result which uses O(n log^2 n) words with the same query time. Our results on the range successor problem immediately lead to improved results for the above three indexing problems over general alphabets. For real world applications, the alphabet size is usually small. In this dissertation, we also consider these three indexing problems over alphabets of size O(polylog(n)). For the first and third problems, we present optimal O(n)-word indexes with O(p) query time. For the second problem, we show that a query can be answered in O(n log^\epsilon n) space and O(p + occ) time, or in O(n) space and O(p + occ log^\epsilon n) time. When |Σ| = O(polylog(n)), our indexes are better than all the previous results. In the second part of this dissertation, we consider the following two problems: the problem of finding length-bounded two vertex-disjoint paths in an undirected planar graph, and the problem of finding minmax k vertex-disjoint paths in a directed acyclic graph. For the first problem, an improved algorithm is presented, which requires O(n^3 b_min) time and O(n^2 b_min) space, where b_min is the smaller of the two given length bounds. For the second problem, an improved algorithm and a faster fully polynomial-time approximation scheme are proposed. The proposed algorithm requires O(n^{k+1} M^{k-1}) time and O(n^k M^{k-1}) space, and the proposed approximation scheme requires O((1/\epsilon)^{k-1} n^{2k} log^{k-1} M) time and O((1/\epsilon)^{k-1} n^{2k-1} log^{k-1} M) space, where \epsilon is the given approximation parameter and M is the length of the longest path in an optimal solution. Minimize

Contributors:

王炳豐 ; Wang, Biing-Feng

Year of Publication:

2010

Document Type:

thesis

Language:

en

Subjects:

演算法 ; 資料結構 ; 字串索引 ; 點互斥路徑 ; 完全多項式時間近似方案

演算法 ; 資料結構 ; 字串索引 ; 點互斥路徑 ; 完全多項式時間近似方案 Minimize

DDC:

005 Computer programming, programs & data *(computed)*

Relations:

[1] P. K. Agarwal and J. Erickson, "Geometric range searching and its relatives," Advances in Discrete and Computational Geometry, pp. 1-56, 1999. [2] T. Akutsu, "Approximate string matching with variable-length don't care characters," IEICE Transactions on Information and Systems, vol. E79-D, no. 9, pp. 1353-1354, 1996. [3] S. Alstrup, G. S....

URL:

Content Provider:

My Lists:

My Tags:

Notes:

Title:

Improved algorithms for finding length-bounded two vertex-disjoint paths in a planar graph and minmax k vertex-disjoint paths in a directed acyclic graph

Author:

Description:

2030215010044 ; 資訊工程學系 ; This paper is composed of two parts. In the first part, an improved algorithm is presented for the problem of finding length-bounded two vertex-disjoint paths in an undirected planar graph. The presented algorithm requires O(n(3)b(min)) time and O(n(2)b(min)) space, where b(min) is the smaller of the two given length bou...

2030215010044 ; 資訊工程學系 ; This paper is composed of two parts. In the first part, an improved algorithm is presented for the problem of finding length-bounded two vertex-disjoint paths in an undirected planar graph. The presented algorithm requires O(n(3)b(min)) time and O(n(2)b(min)) space, where b(min) is the smaller of the two given length bounds. In the second part of this paper, we consider the minmax k vertex-disjoint paths problem on a directed acyclic graph, where k 2 is a constant. An improved algorithm and a faster approximation scheme are presented. The presented algorithm requires O(n(k+1)M(k-1)) time and O(n(k)M(k-1)) space, and the presented approximation scheme requires O((1/is an element of)(k-1)n(2k) log(k-1) M) time and O((1/is an element of)(k-1)n(2k-1) log(k-1) M) space, where e is the given approximation parameter and M is the length of the longest path in an optimal solution. Minimize

Publisher:

Elsevier

Contributors:

王炳豐

Year of Publication:

2010

Document Type:

article

Language:

En

Subjects:

EFFICIENT ALGORITHM;COMPLEXITY

EFFICIENT ALGORITHM;COMPLEXITY Minimize

DDC:

511 General principles of mathematics *(computed)*

Relations:

JOURNAL OF COMPUTER AND SYSTEM SCIENCES,Volume: 76,Issue: 8,Pages: 697-708,Published: DEC 2010

URL:

Content Provider:

My Lists:

My Tags:

Notes:

Title:

Improved data structures for the orthogonal range successor problem

Author:

Description:

2030215010046 ; 資訊工程學系 ; Let P be a set of n points that lie on an n x n grid. The well-known orthogonal range reporting problem is to preprocess P so that for any query rectangle R. we can report all points in P boolean AND R efficiently. In many applications driven by the information retrieval or the bioinformatics communities, we do not need ...

2030215010046 ; 資訊工程學系 ; Let P be a set of n points that lie on an n x n grid. The well-known orthogonal range reporting problem is to preprocess P so that for any query rectangle R. we can report all points in P boolean AND R efficiently. In many applications driven by the information retrieval or the bioinformatics communities, we do not need all the points in P boolean AND R. but need only just the point that has the smallest y-coordinate; this motivates the study of a variation called the orthogonal range successor problem. If space is the major concern, the best-known result is by Makinen and Navarro, which requires an optimal index space of n + o(n) words and supports each query in O (log n) time. In contrast, if query time is the major concern, the best-known result is by Crochemore et al., which supports each query in O (1) time with O (n(1+epsilon)) index space. In this paper, we first propose another optimal-space index with a faster O (log n/loglog n) query time. The improvement stems from the design of an index with O (1) query time when the points are restricted to lie on a narrow grid, and the subsequent application of the wavelet tree technique to support the desired query. Based on the proposed index, we directly obtain improved results for the successive indexing problem and the position-restricted pattern matching problem in the literature. We next propose an O (n(1+epsilon))-word index that supports each query in O (1) time. When compared with the result by Crochemore et al., our scheme is conceptually simpler and easier for construction. In addition, our scheme can be easily extended to work for high-dimensional cases. Minimize

Publisher:

Elsevier

Contributors:

王炳豐

Year of Publication:

2011

Document Type:

article

Language:

En

Subjects:

Data structures;Algorithms;Orthogonal range

Data structures;Algorithms;Orthogonal range Minimize

DDC:

005 Computer programming, programs & data *(computed)*

Relations:

COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS,Volume: 44,Issue: 3,Pages: 148-159,Published: APR 2011

URL:

Content Provider:

My Lists:

My Tags:

Notes:

Title:

Placental Growth Factor down-Regulates Type 1 T Helper Immune Response by Modulating the Function of Dendritic Cells. ; 胎盤生長因子藉由調節數突狀細胞的功能來抑制th1免疫反應

Author:

Description:

Placental growth factor (PlGF) belongs to the vascular endothelial growth factor (VEGF) family and represents a key regulator of angiogenic events in development and pathologic conditions. In this study, PlGF-modulated differentiation and maturation of human dendritic cells (DCs ) from CD14 from CD14 of PlGF during 5 days, was referred to as“PlG...

Placental growth factor (PlGF) belongs to the vascular endothelial growth factor (VEGF) family and represents a key regulator of angiogenic events in development and pathologic conditions. In this study, PlGF-modulated differentiation and maturation of human dendritic cells (DCs ) from CD14 from CD14 of PlGF during 5 days, was referred to as“PlGF-DC”,in contrast to the “classical-DC”, obtained in the absence of PlGF. Treatment of PlGF-DC or classical- DC with PlGF resulted in the down-regulation of CD80 , CD86, CD83, CD40, and HLA-DR expression, and CD1a was increased, as well as the inhibition of IL-12 p70, p40, IL-8, and TNF- This PlGF-induced DC dysfunction was recovered by anti-human VEGF receptor 1 mAb. In addition, treatment of PlGF-DC or classical-DC with PlGF resulted in the suppression of na¨ve CD4 up-regulated the IL-5 and IL-13 secretion of the CD4 I B Taken together, our data demonstrate that the immunosuppressive properties of PlGF are through the NF- B signaling pathway. PlGF might play a major role in the pathogenesis of tumors and act as an effector molecule to skew T cell response to the Th2 phenotype, which might be more beneficial for pregnancy. ; 附設醫院醫學研究部 ; 醫學院附設醫院 ; 期刊論文 Minimize

Contributors:

醫學研究部

Year of Publication:

2007

Language:

en-us ; en_US

Subjects:

113

113 Minimize

DDC:

570 Life sciences; biology *(computed)*

Relations:

JOURNAL OF LEUKOCYTE BIOLOGY v.82 n.6 pp.1473-1480

URL:

Content Provider:

My Lists:

My Tags:

Notes:

Title:

Tension-compression viscoelastic behaviors of the periodontal ligament

Author:

Contributors:

醫學院牙醫學系;中國附醫牙醫部贗復牙科;

Year of Publication:

2011-06

Language:

en_US

Subjects:

creep source; finite element analysis; periodontal ligament; viscoelastic behavior ; 5

creep source; finite element analysis; periodontal ligament; viscoelastic behavior ; 5 Minimize

Relations:

JOURNAL OF THE FORMOSAN MEDICAL ASSOCIATION XX(XX):1-11

URL:

Content Provider:

My Lists:

My Tags:

Notes:

Title:

Polymerization Shrinkage with Light-Initiated Dental Composites

Description:

The present work addressed the determination and visualization of the direction and extent of polymerization shrinkage in the light-initiated composite. Hypotheses about the light-cured composite contraction patterns are controversial. With high resolution µCT images, the displacement vector fields are examined and calculated two-dimensionally v...

The present work addressed the determination and visualization of the direction and extent of polymerization shrinkage in the light-initiated composite. Hypotheses about the light-cured composite contraction patterns are controversial. With high resolution µCT images, the displacement vector fields are examined and calculated two-dimensionally via an elastic registration algorithm using vector-spline regularization and three-dimensionally with a local rigid registration (block matching) following images segmentation (corresponding traceable fillers in composite). It appears that the light-initiated resin composites do not always shrink toward the light source. Two major contraction patterns were observed: either shrink toward the top-surface (free surface), or toward one side of the cavity wall, in which the bonding was stronger or remained intact. With the proposed methods, it is possible to describe the contraction patterns in great detail. We could demonstrate that the bonding quality to the tooth affects the material movement more than described so far. In addition, the geometry of the cavity also acts as a factor. The continuation of the studies into the interaction of tooth-adhesive-composite indicated the shortcomings and limitations of the current FEA simulation studies. This meant that the assumption of FEA, especially in adhesive systems (i.e., bonding situations and hybridizations), is too perfect and simplificative to interpret the real condition in clinical. The qualitative and quantitative analysis of the shrinkage vector field along with the µCT datasets supply more insight into the shrinkage behavior in real teeth with all their variations of the boundary conditions than with any currently available method. This new approach has the potential to reevaluate and hopefully unify all the currently available hypotheses concerning the extent and orientation of polymerization shrinkage. Minimize

Publisher:

Ludwig-Maximilians-Universität München

Year of Publication:

2009-10-20

Document Type:

Dissertation ; NonPeerReviewed

Subjects:

Medizinische Fakultät

Medizinische Fakultät Minimize

Relations:

http://edoc.ub.uni-muenchen.de/10708/

URL:

Content Provider:

My Lists:

My Tags:

Notes:

Title:

The effects of sleep on performance of undergraduate students working in the hospitality industry as compared to those who are not working in the industry

Description:

The purpose of this study was to explore the effects of sleep on academic performance and job performance. A total of 172 undergraduate students completed an on-line questionnaire and their GPAs were obtained from the registrar's office. Participants were divided into three groups based on their employment status as follows: students who worked ...

The purpose of this study was to explore the effects of sleep on academic performance and job performance. A total of 172 undergraduate students completed an on-line questionnaire and their GPAs were obtained from the registrar's office. Participants were divided into three groups based on their employment status as follows: students who worked in the hospitality industry, students who worked in other industries, and students not working. Data were analyzed using t-tests, principal component analysis, and stepwise regression. In general, the results indicated that sleep habits were consistent with delayed sleep phrase syndrome, a common sleep problem in college students. Also, sleep latency and sleep medicine were negatively correlated with GPAs; and sleep quality was significantly related to job performance. Troubled sleep and work schedules may be two of the reasons for low academic performance and job performance among students working in the hospitality industry but no significant differences were found between the three groups. Educators and employers need to be cognizant of the importance of sleep for success in academic performance and job performance. Recommendations for future research are discussed. Minimize

Publisher:

Digital Repository @ Iowa State University

Year of Publication:

2013-01-01T08:00:00Z

Source:

Graduate Theses and Dissertations

Graduate Theses and Dissertations Minimize

Document Type:

text

Subjects:

Academic performance ; College student ; DSPS ; Job performance ; Sleep ; Business Administration ; Management ; and Operations ; Higher Education Administration ; Higher Education and Teaching ; Management Sciences and Quantitative Methods

Academic performance ; College student ; DSPS ; Job performance ; Sleep ; Business Administration ; Management ; and Operations ; Higher Education Administration ; Higher Education and Teaching ; Management Sciences and Quantitative Methods Minimize

URL:

Content Provider:

My Lists:

My Tags:

Notes:

Title:

Disease Animal Models of TDP-43 Proteinopathy and Their Pre-Clinical Applications

Author:

Description:

Frontotemperal lobar degeneration (FTLD) and amyotrophic lateral sclerosis (ALS) are two common neurodegenerative diseases. TDP-43 is considered to be a major disease protein in FTLD/ALS, but it’s exact role in the pathogenesis and the effective treatments remains unknown. To address this question and to determine a potential treatment for FTLD/...

Frontotemperal lobar degeneration (FTLD) and amyotrophic lateral sclerosis (ALS) are two common neurodegenerative diseases. TDP-43 is considered to be a major disease protein in FTLD/ALS, but it’s exact role in the pathogenesis and the effective treatments remains unknown. To address this question and to determine a potential treatment for FTLD/ALS, the disease animal models of TDP-43 proteinopathy have been established. TDP-43 proteinopathy is the histologic feature of FTLD/ALS and is associated with disease progression. Studies on the disease animal models with TDP-43 proteinopathy and their pre-clinical applications are reviewed and summarized. Through these disease animal models, parts of TDP-43 functions in physiological and pathological conditions will be better understood and possible treatments for FTLD/ALS with TDP-43 proteinopathy may be identified for possible clinical applications in the future. Minimize

Publisher:

Multidisciplinary Digital Publishing Institute

Year of Publication:

2013-10-01T00:00:00Z

Document Type:

article

Language:

English

Subjects:

amyotrophic lateral sclerosis ; disease models ; frontotemperal lobar degeneration ; proteinopathy ; TDP-43 ; therapy ; LCC:Chemistry ; LCC:QD1-999 ; LCC:Science ; LCC:Q ; DOAJ:Chemistry (General) ; DOAJ:Chemistry ; LCC:Chemistry ; LCC:QD1-999 ; LCC:Science ; LCC:Q ; DOAJ:Chemistry (General) ; DOAJ:Chemistry ; LCC:Chemistry ; LCC:QD1-999 ; LCC:S...

amyotrophic lateral sclerosis ; disease models ; frontotemperal lobar degeneration ; proteinopathy ; TDP-43 ; therapy ; LCC:Chemistry ; LCC:QD1-999 ; LCC:Science ; LCC:Q ; DOAJ:Chemistry (General) ; DOAJ:Chemistry ; LCC:Chemistry ; LCC:QD1-999 ; LCC:Science ; LCC:Q ; DOAJ:Chemistry (General) ; DOAJ:Chemistry ; LCC:Chemistry ; LCC:QD1-999 ; LCC:Science ; LCC:Q ; LCC:Chemistry ; LCC:QD1-999 ; LCC:Science ; LCC:Q Minimize

DDC:

610 Medicine & health *(computed)*

Rights:

CC by

CC by Minimize

Relations:

http://www.mdpi.com/1422-0067/14/10/20079

URL:

Content Provider:

My Lists:

My Tags:

Notes:

Title:

Disease Animal Models of TDP-43 Proteinopathy and Their Pre-Clinical Applications

Author:

Description:

Frontotemperal lobar degeneration (FTLD) and amyotrophic lateral sclerosis (ALS) are two common neurodegenerative diseases. TDP-43 is considered to be a major disease protein in FTLD/ALS, but it’s exact role in the pathogenesis and the effective treatments remains unknown. To address this question and to determine a potential treatment for FTLD/...

Frontotemperal lobar degeneration (FTLD) and amyotrophic lateral sclerosis (ALS) are two common neurodegenerative diseases. TDP-43 is considered to be a major disease protein in FTLD/ALS, but it’s exact role in the pathogenesis and the effective treatments remains unknown. To address this question and to determine a potential treatment for FTLD/ALS, the disease animal models of TDP-43 proteinopathy have been established. TDP-43 proteinopathy is the histologic feature of FTLD/ALS and is associated with disease progression. Studies on the disease animal models with TDP-43 proteinopathy and their pre-clinical applications are reviewed and summarized. Through these disease animal models, parts of TDP-43 functions in physiological and pathological conditions will be better understood and possible treatments for FTLD/ALS with TDP-43 proteinopathy may be identified for possible clinical applications in the future. Minimize

Publisher:

Molecular Diversity Preservation International (MDPI)

Year of Publication:

2013-10-09

Document Type:

Text

Language:

en

Subjects:

Review

Review Minimize

DDC:

610 Medicine & health *(computed)*

Rights:

© 2013 by the authors; licensee MDPI, Basel, Switzerland ; http://creativecommons.org/licenses/by/3.0/ ; This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution license (http://creativecommons.org/licenses/by/3.0/).

© 2013 by the authors; licensee MDPI, Basel, Switzerland ; http://creativecommons.org/licenses/by/3.0/ ; This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution license (http://creativecommons.org/licenses/by/3.0/). Minimize

URL:

Content Provider:

My Lists:

My Tags:

Notes:

Currently in BASE: 68,042,637 Documents of 3,301 Content Sources

http://www.base-search.net