Results 1  10
of
105
Language Proficiency and Labour Market Performance of Immigrants in
 the UK’, The Economic Journal
, 2003
"... This paper uses two recent UK surveys to investigate the determinants of language proficiency and the effect of language on earnings and employment probabilities of nonwhite immigrants. We address the problem of endogenous choice of language acquisition and measurement error in language variables. ..."
Abstract

Cited by 85 (8 self)
 Add to MetaCart
This paper uses two recent UK surveys to investigate the determinants of language proficiency and the effect of language on earnings and employment probabilities of nonwhite immigrants. We address the problem of endogenous choice of language acquisition and measurement error in language variables. Our results show that language acquisition, employment probabilities, as well as earnings differ widely across nonwhite immigrants, according to their ethnic origin. Language proficiency has a positive effect on employment probabilities, and lack of English fluency leads to earning losses. According to the 2000 Labour Force Survey, immigrants (defined as individuals who are born outside UK) account for around 9 % of the working age population of Britain. Immigrants are heavily concentrated in Metropolitan areas. In 2000, London contained around 9 % of the total population of the UK, but more than 40 % of all immigrants. The ethnic origin of immigrants in the UK is diverse, with the largest group being born elsewhere in the European Union, followed by immigrants from India, the Old Commonwealth, Pakistan, and Africa; see Dustmann et al. (2002) for more details.
The IndoAryan Languages
, 1991
"... This series offers general accounts of all the major language families of the world. Some volumes are organized on a purely genetic basis, others on a geographical basis, whichever yields the most convenient and intelligible grouping in each case. Sometimes, as with the Australian volume, the two in ..."
Abstract

Cited by 83 (0 self)
 Add to MetaCart
This series offers general accounts of all the major language families of the world. Some volumes are organized on a purely genetic basis, others on a geographical basis, whichever yields the most convenient and intelligible grouping in each case. Sometimes, as with the Australian volume, the two in any case coincide. Each volume compares and contrasts the typological features of the languages it deals with. It also treats the relevant genetic relationships, historical development, and sociolinguistic issues arising from their role and use in the world today. The intended readership is the student of linguistics or general linguist, but no special knowledge of the languages under consideration is assumed. Some volumes also have a wider appeal, like that on Australia, where the future of the languages and their speakers raises important social and political issues.
By
, 2007
"... The following study is a close scrutiny of Lin Biao. This study will focus on Lin Biao’s private life during the Cultural Revolution (19661969). This study argues that Lin suffered from two distinct personality disorders: schizoid personality disorder and social anxiety disorder. After assessing th ..."
Abstract
 Add to MetaCart
the private behavior of Lin Biao and how the two disorders disabled Lin, this study will then move to illustrate the consequential enabling affect the two disorders had on Lin Biao’s wife, Ye Qun. Thereafter, this study will reexamine several key cases that occurred immediately prior to and during
Frequency Allocation Problem for Linear Cellular Networks
 In the Proceedings of the 17th Annual International Symposium on Algorithms and Computation (ISAAC), Dec 2006, Lecture Notes in Computer Science (LNCS) Vol.4288
, 2006
"... Abstract. We study the online frequency allocation problem for wireless linear (highway) cellular networks, where the geographical coverage area is divided into cells aligned in a line. Calls arrive over time and are served by assigning frequencies to them, and no two calls emanating from the same c ..."
Abstract

Cited by 8 (5 self)
 Add to MetaCart
Abstract. We study the online frequency allocation problem for wireless linear (highway) cellular networks, where the geographical coverage area is divided into cells aligned in a line. Calls arrive over time and are served by assigning frequencies to them, and no two calls emanating from the same cell or neighboring cells are assigned the same frequency. The objective is to minimize the span of frequencies used. In this paper we consider the problem with or without the assumption that calls have infinite duration. If there is the assumption, we propose an algorithm with absolute competitive ratio of 3/2 and asymptotic competitive ratio of 1.382. The lower bounds are also given: the absolute one is 3/2 and the asymptotic one is 4/3. Thus, our algorithm with absolute ratio of 3/2 is best possible. We also prove that the Greedy algorithm is 3/2competitive in both the absolute and asymptotic cases. For the problem without the assumption, i.e. calls may terminate at arbitrary time, we give the lower bounds for the competitive ratios: the absolute one is 5/3 and the asymptotic one is 14/9. We propose an optimal online algorithm with both competitive ratio of 5/3, which is better than the Greedy algorithm, with both competitive ratios 2. 1
Efficient Algorithms for Finding A Longest Common Increasing Subsequence
 In 16th Annual International Symposium on Algorithms and Computation (ISAAC
, 2005
"... We study the problem of finding a longest common increasing subsequence (LCIS) of multiple sequences of numbers. The LCIS problem is a fundamental issue in various application areas, including the whole genome alignment. In this paper we give an efficient algorithm to find the LCIS of two sequences ..."
Abstract

Cited by 9 (0 self)
 Add to MetaCart
We study the problem of finding a longest common increasing subsequence (LCIS) of multiple sequences of numbers. The LCIS problem is a fundamental issue in various application areas, including the whole genome alignment. In this paper we give an efficient algorithm to find the LCIS of two sequences in O(min(r log ℓ, nℓ+r) log log n+Sort(n)) time where n is the length of each sequence and r is the number of ordered pairs of positions at which the two sequences match, ℓ is the length of the LCIS, and Sort(n) is the time to sort n numbers. For m sequences where m ≥ 3, we find the LCIS in O(min(mr 2, r log ℓ log m r)+m·Sort(n)) time where r is the total number of mtuples of positions at which the m sequences match. The previous results find the LCIS of two sequences in O(n 2) and O(nℓ log log n+Sort(n)) time. Our algorithm is faster when r is relatively small, e.g., for r < min(n 2 /(log ℓ log log n), nℓ / log ℓ). 1
OnLine Scheduling of Parallel Jobs on Two Machines ⋆
"... We study the problem of online scheduling of parallel jobs on two machines. The jobs are parallel in the sense that each of them specifies the number of processors, in this case 1 or 2, required for simultaneous processing. The jobs are presented one by one. Upon receiving a job, we must assign the ..."
Abstract
 Add to MetaCart
We study the problem of online scheduling of parallel jobs on two machines. The jobs are parallel in the sense that each of them specifies the number of processors, in this case 1 or 2, required for simultaneous processing. The jobs are presented one by one. Upon receiving a job, we must assign the job to a time slot in the schedule before the next job is presented. No reassignment is allowed. The goal is to minimize the makespan of the final schedule. There is a straightforward algorithm which achieves a competitive ratio of 2. In this paper we show that no online algorithm can have a competitive ratio less than 1 + � 2/3 ( ≈ 1.816). We also study two special cases of the problem: (i) Jobs arrive in a nondecreasing order of processing times where we give an optimal algorithm with competitive ratio 3/2; (ii) Jobs arrive in a nonincreasing order of processing times where we show that no online algorithm has a competitive ratio less than 9/7 and give a greedy algorithm with a competitive ratio 4/3.
Online scheduling of parallel jobs in a list
, 2007
"... We study an online parallel job scheduling problem, where jobs arrive one by one. A parallel job may require a number of machines for its processing at the same time. Upon arrival of a job, its processing time and the number of requested machines become known, and it must be scheduled immediately ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
We study an online parallel job scheduling problem, where jobs arrive one by one. A parallel job may require a number of machines for its processing at the same time. Upon arrival of a job, its processing time and the number of requested machines become known, and it must be scheduled immediately without any knowledge of future jobs. We present a 7competitive online algorithm, which improves the previous upper bound of 12 by Johannes (J. Sched. 9:433–452, 2006). Furthermore, we investigate a special case in which the largest processing time is known beforehand.
OnLine Scheduling of Parallel Jobs With Dependencies on 2Dimensional Meshes
 IN PROCEEDINGS OF THE 14TH ANNUAL INTERNATIONAL SYMPOSIUM ON ALGORITHMS AND COMPUTATION (ISAAC
, 2003
"... We study an online problem of scheduling parallel jobs on 2dimensional meshes. Parallel jobs arrive dynamically according to the dependencies between them, which are unknown before the jobs appear. Each job may need more than one processor simultaneously and is required to be scheduled on a sub ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
We study an online problem of scheduling parallel jobs on 2dimensional meshes. Parallel jobs arrive dynamically according to the dependencies between them, which are unknown before the jobs appear. Each job may need more than one processor simultaneously and is required to be scheduled on a submesh of the processors which are located on a 2dimensional mesh, i.e., a job must be scheduled on a rectangle of given dimensions. The objective is to minimize the maximum completion time (makespan). We deal with an UET job system, in which all job processing times are equal. We show a lower bound of 3.859 and present a 5:25competitive algorithm. It signi cantly improves a previous lower bound of 3.25 and a previous upper bound of 46/7. We consider also the rotated 2dimensional mesh, in which the parallel jobs can be rotated. A lower bound of 3.535 is proven and an online algorithm with competitive ratio of at most 4.25 is derived.
Online Frequency Allocation in Cellular Networks
 Proc. of the 19th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA ’07
"... Given a mobile telephone network, whose geographical coverage area is divided into cells, phone calls are serviced by assigning frequencies to them, so that no two calls emanating from the same or neighboring cells are assigned the same frequency. Assuming an online arrival of calls and the calls wi ..."
Abstract

Cited by 6 (4 self)
 Add to MetaCart
Given a mobile telephone network, whose geographical coverage area is divided into cells, phone calls are serviced by assigning frequencies to them, so that no two calls emanating from the same or neighboring cells are assigned the same frequency. Assuming an online arrival of calls and the calls will not terminate, the problem is to minimize the span of frequencies used. By first considering χcolorable networks, which is a generalization of (the 3colorable) cellular networks, we present a (χ + 1)/2competitive online algorithm. This algorithm, when applied to cellular networks, is effectively a positive solution to the open problem posed in [8]: Does a 2competitive online algorithm exist for frequency allocation in cellular networks? We further prove a lower bound which shows that our 2competitive algorithm is optimal. We discover that an interesting phenomenon occurs for the online frequency allocation problem when the number of calls considered becomes large: previouslyderived optimal (lower and upper) bounds on competitive ratios no longer hold true. For cellular networks, we show new asymptotic lower and upper bounds of 1.5 and 1.9126, respectively, which breaks through the optimal bound of 2 shown previously.
ISSN 17443091
, 2010
"... (FmdE) implicated in microbial methanogenesis reveal a conserved a+b core domain and an auxiliary Cterminal trebleclef zinc finger Examination of the genomic context for members of the FmdE Pfam family (PF02663), such as the protein encoded by the fmdE gene from the methanogenic archaeon Methanoba ..."
Abstract
 Add to MetaCart
(FmdE) implicated in microbial methanogenesis reveal a conserved a+b core domain and an auxiliary Cterminal trebleclef zinc finger Examination of the genomic context for members of the FmdE Pfam family (PF02663), such as the protein encoded by the fmdE gene from the methanogenic archaeon Methanobacterium thermoautotrophicum, indicates that 13 of them are cotranscribed with genes encoding subunits of molybdenum
Results 1  10
of
105