نتایج جستجو برای: line access

تعداد نتایج: 725051  

Journal: :IEICE Transactions 2008
Blaz Peternel Andrej Kos

Manuscript received November 2007. Manuscript revised March 1, 2007. The authors are with the University of Ljubljana, Faculty of electrical Engineering, Tržaška c. 25, SI-1000 Ljubljana, Slovenia, The author is with Mobitel, Telecommunications services, PLC, Vilharjeva c. 23, SI-1000 Ljubljana, Slovenia. a) E-mail: [email protected] Broadband Access Network Planning Optimization Consideri...

2016
Petr Stanislav Jan Svec Pavel Ircing

In this paper we present an online system for cross-lingual lexical (full-text) searching in the large archive of the Holocaust testimonies. Video interviews recorded in two languages (English and Czech) were automatically transcribed and indexed in order to provide efficient access to the lexical content of the recordings. The engine takes advantage of the state-of-the-art speech recognition s...

2007
Jinhun Bae Kitae Kim Keonwook Kim

Sensor nodes in large-scale sensor networks autonomously and proactively report diverse information obtained from extensive target area to a base station, which is energy unconstrained node. To efficiently handle the variable traffic, we present Co-MAC, an energy efficient medium access control protocol for large-scale sensor networks. In Co-MAC, an overall network is divided into independent s...

Journal: :Math. Log. Q. 2015
Kyriakos Keremedis

(i) CAC iff every countable product of sequential metric spaces (sequentially closed subsets are closed) is a sequential metric space iff every complete metric space is Cantor complete. (ii) Every infinite subset X of R has a countably infinite subset iff every infinite sequentially closed subset of R includes an infinite closed subset. (iii) The statement “R is sequential” is equivalent to eac...

2011
Timothy M. Chan Bryan T. Wilkinson

We give an algorithm for bichromatic line segment intersection counting that runs in O(n √ log n) time under the word RAM model via a reduction to dynamic predecessor search, offline point location, and offline dynamic ranking. This algorithm is the first to solve bichromatic line segment intersection counting in o(n log n) time.

Journal: :CoRR 2016
Francesco Vatalaro Franco Mazzenga Romeo Giuliano

The most effective way to promote Next Generation Access coverage and ultra-broadband penetration is through infrastructure competition. In Countries having well-developed cable networks this market condition preexists. Where CaTV is limited or null, one way to surrogate its powerful procompetitive effect is through the VDSL2/FttC architecture stimulating competition among operators. This has b...

Journal: :Chest 1995
L L Low G R Harrington D P Stoltzfus

STUDY OBJECTIVE To determine whether the presence of an indwelling arterial access line leads to differences in blood-drawing practices and costs, in patients with similar APACHE II scores, in the ICU. DESIGN Prospective, observational. SETTING Adult surgical and medical ICUs at a large military tertiary care hospital. PATIENTS Twenty-five adult (ie, above 18 years old) patients with arte...

2006
David E. Konerding Keith R. Jackson

The international science community has invested large amounts of money in developing numerical and computational codes for everything from basic math to application specific codes. These codes are now a vital part of the scientific process. However, running these codes can be challenging. Many require a highly specialized environment, and may only run in a few locations. To maximize the usage ...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید