نتایج جستجو برای: modified thompson
تعداد نتایج: 257891 فیلتر نتایج به سال:
According to Li & Thompson (1981), Chinese serial verb constructions consisting of two verb phrases denoting two separate events can be classified into those having alternating, consecutive, purpose or circumstance relations. These classifications may overlap and a serial verb construction may be ambiguous between different interpretations. It has been argued in a recent study (Chan 1996) that ...
This paper considers listing all possible samples of size n with unequal probabilities without replacement in order to find the sample distribution. The main application of that is to estimate the Horvitz-Thompson (HT) estimator and possibly to know the shape of its sample distribution to construct confidence intervals. The algorithm computes all possible samples of the population, in contrast ...
BACKGROUND Knee extension contracture is a disabling complication after fractures around the knee. In this study we aimed to study factors influencing the outcomes of quadricepsplasty for the treatment of traumatic knee extension contracture. We hypothesized that there is no factor influencing the final range of knee motion. METHODS In this retrospective study, we included 64 patients who und...
A nite-state machine is called a Thompson machine if it can be constructed from a regular expression using Thompson's construction. We call the underlying digraph of a Thompson machine a Thompson di-graph. We establish and prove a characterization of Thompson digraphs. As one application of the characterization, we give an algorithm that generates an equivalent regular expression from a Thompso...
In the past decade or so the term postmodernism has captured the attention of a generation of artists, intellectuals, authors, and professionals to such a degree that the term has even crept into the comparatively sober psychoanalytic literature, the last place one would have expected to find it. Yet any marriage between the psychoanalytic treatment perspective with its painstaking, laborious p...
To follow the dynamicity of the user’s content, researchers have recently started to model interactions between users and the ContextAware Recommender Systems (CARS) as a bandit problem where the system needs to deal with exploration and exploitation dilemma. In this sense, we propose to study the freshness of the user’s content in CARS through the bandit problem. We introduce in this paper an ...
nature which gave to Thompson's work a value of its own. But not less necessary for this work, upon which Thompson and the Society were alike engaged, was his ability to consider his subject from every view-point; to state in exact proportion the evidence which told in favour of, or against, a hypothesis that had to be examined. There has passed into the hands of the Societ}' an unfinished piec...
The problem of converting a regular expression to NFA is a fundamental problem that has been well studied. However, the two basic construction algorithms: (1) Thompson, (2) McNaughton-Yamada and Glushkov, both have disadvantages. In this paper: First, a “smart” parsing algorithm is developed which constructs a parse tree with at most (3l − 1) nodes form a regular expression with l literals; Sec...
A Examples of TS distributions Example 1: Uniform distribution ⌘ ⇠ UBd(0,d). The uniform distribution satisfies the concentration property with constants c = 1 and c0 = e d by definition. Since the set {⌘|uT⌘ 1}\Bd(0, p d) is an hyper-spherical cap for any direction u of Rd, the the anti-concentration property is satisfied provided that the ratio between the volume of an hyper-spherical cap of ...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید