45 research outputs found
Reduction of the Long-Term Inaccuracy from the AVHRRβBased NDVI Data
This paper investigated the normalized difference vegetation index (NDVI) stability in the NOAA/NESDIS Global Vegetation Index (GVI) data during 1982-2003, which was collected from five NOAA series satellites. An empirical distribution function (EDF) was developed to eliminate the long-term inaccuracy of the NDVI data derived from the AVHRR sensor on NOAA polar orbiting satellite. The instability of data results from orbit degradation as well as from the circuit drifts over the life of a satellite. Degradation of NDVI over time and shifts of NDVI between the satellites were estimated using the China data set, because it includes a wide variety of different ecosystems represented globally. It was found that the data for the years of 1988, 1992, 1993, 1994, 1995 and 2000 are not stable compared to other years because of satellite orbit drift, AVHRR sensor degradation, and satellite technical problems, including satellite electronic and mechanical satellite systems deterioration. The data for NOAA-7 (1982, 1983), NOAA-9 (1985, 1986), NOAA-11 (1989, 1990), NOAA-14 (1996, 1997), and NOAA-16 (2001, 2002) were assumed to be standard because the crossing time of satellite over the equator (between 1330 and 1500 hours) maximized the value of the coefficients. These years were considered as the standard years, while in other years the quality of satellite observations significantly deviated from the standard. The deficiency of data for the affected years were normalized or corrected by using the method of EDF and comparing with the standard years. These normalized values were then utilized to estimate new NDVI time series which show significant improvement of NDVI data for the affected years
ΠΡΡΠ»Π΅Π΄ΠΎΠ²Π°Π½ΠΈΠ΅ Π²Π»ΠΈΡΠ½ΠΈΡ ΠΏΠΎΠ»ΡΡΠΈΠ·Π°ΡΠΈΠΈ Π½Π° ΠΌΠ΅ΡΡΠΎΠ»ΠΎΠ³ΠΈΡΠ΅ΡΠΊΠΈΠ΅ Ρ Π°ΡΠ°ΠΊΡΠ΅ΡΠΈΡΡΠΈΠΊΠΈ ΡΠ΅Π½ΡΠΎΡΠ° ΠΊΠΈΡΠ»ΠΎΡΠΎΠ΄Π°
Π ΡΠΎΠ±ΠΎΡΡ ΠΏΡΠΎΠ²ΠΎΠ΄ΠΈΠ»ΠΎΡΡ Π΄ΠΎΡΠ»ΡΠ΄ΠΆΠ΅Π½Π½Ρ ΡΡΠ·Π½ΠΈΡ
ΡΠΈΠ½Π½ΠΈΠΊΡΠ², ΡΠΊΡ Π²ΠΏΠ»ΠΈΠ²Π°ΡΡΡ Π½Π° ΠΌΠ΅ΡΡΠΎΠ»ΠΎΠ³ΡΡΠ½Ρ Ρ
Π°ΡΠ°ΠΊΡΠ΅ΡΠΈΡΡΠΈΠΊΠΈ ΡΠ΅Π½ΡΠΎΡΡ. ΠΡΠ΄Π²ΠΈΡΠ΅Π½Π½Ρ ΠΌΠ΅ΡΡΠΎΠ»ΠΎΠ³ΡΡΠ½ΠΈΡ
Ρ
Π°ΡΠ°ΠΊΡΠ΅ΡΠΈΡΡΠΈΠΊ ΠΏΡΠΈΠ»Π°Π΄ΡΠ² ΠΌΠΎΠΆΠ΅ Π±ΡΡΠΈ Π΄ΠΎΡΡΠ³Π½ΡΡΠΎ ΠΏΡΠΈ Π²ΠΈΠΊΠΎΡΠΈΡΡΠ°Π½Π½Ρ ΡΠΌΠΏΡΠ»ΡΡΠ½ΠΈΡ
ΠΌΠ΅ΡΠΎΠ΄ΡΠ² ΠΏΠΎΠ»ΡΡΠΈΠ·Π°ΡΡΡ Π΅Π»Π΅ΠΊΡΡΠΎΠ΄ΡΠ² ΡΠ΅Π½ΡΠΎΡΡΠ². ΠΠΎΠ²ΠΈΠ·Π½Π° ΡΠΎΠ±ΠΎΡΠΈ ΠΏΠΎΠ»ΡΠ³Π°Ρ Π² Π·Π°ΡΡΠΎΡΡΠ²Π°Π½Π½Ρ ΡΠΌΠΏΡΠ»ΡΡΠ½ΠΎΡ ΠΏΠΎΠ»ΡΡΠΈΠ·Π°ΡΡΡ ΡΠ΅Π½ΡΠΎΡΡΠ² ΠΊΠΈΡΠ½Ρ ΡΠ° ΡΠΎΠ·ΡΠΎΠ±ΡΡ Π½ΠΎΠ²ΠΈΡ
ΠΌΠ΅ΡΠΎΠ΄ΡΠ² ΠΎΠ±ΡΠΎΠ±ΠΊΠΈ Π²ΠΈΡ
ΡΠ΄Π½ΠΈΡ
ΡΠΈΠ³Π½Π°Π»ΡΠ² Π· ΠΌΠ΅ΡΠΎΡ ΠΏΡΠ΄Π²ΠΈΡΠ΅Π½Π½Ρ ΠΌΠ΅ΡΡΠΎΠ»ΠΎΠ³ΡΡΠ½ΠΈΡ
Ρ
Π°ΡΠ°ΠΊΡΠ΅ΡΠΈΡΡΠΈΠΊ ΠΏΡΠΈΠ»Π°Π΄ΡΠ². ΠΠΎΡΠ»ΡΠ΄ΠΆΠ΅Π½ΠΎ ΠΊΡΠ½Π΅ΡΠΈΠΊΡ ΠΏΡΠΎΡΠ΅ΡΡΠ² Π²ΡΠ΄Π½ΠΎΠ²Π»Π΅Π½Π½Ρ ΠΊΠΈΡΠ½Ρ Π½Π° ΠΊΠ°ΡΠΎΠ΄Π°Ρ
ΡΠ΅Π½ΡΠΎΡΡΠ² ΠΏΡΠΈ ΠΏΠΎΠ»ΡΡΠΈΠ·Π°ΡΡΡ ΡΠΌΠΏΡΠ»ΡΡΠ½ΠΎΡ Π½Π°ΠΏΡΡΠ³ΠΎΡ. ΠΠ°ΡΡΠΎΡΡΠ²Π°Π½Π½Ρ Π½ΠΎΠ²ΠΈΡ
ΠΌΠ΅ΡΠΎΠ΄ΡΠ² ΠΏΠΎΠ»ΡΡΠΈΠ·Π°ΡΡΡ ΠΏΡΠΈΠ²ΠΎΠ΄ΠΈΡΡ Π΄ΠΎ ΠΌΡΠ½ΡΠΌΠ°Π»ΡΠ½ΠΎΠ³ΠΎ Π²ΠΏΠ»ΠΈΠ²Ρ ΡΠΎΠ±ΠΎΡΠΈ ΡΠ΅Π½ΡΠΎΡΠ° Π½Π° ΡΡΠ²Π½ΠΎΠ²Π°ΠΆΠ½Ρ ΠΏΡΠΎΡΠ΅ΡΠΈ Π² Π±ΡΠΎΠ»ΠΎΠ³ΡΡΠ½ΠΈΡ
ΠΎΠ±βΡΠΊΡΠ°Ρ
, ΡΠΎ ΠΏΡΠ΄Π²ΠΈΡΡΡ ΡΠΎΡΠ½ΡΡΡΡ Π²ΠΈΠΌΡΡΡΠ²Π°Π½Π½Ρ ΡΠ° Π·Π°Π±Π΅Π·ΠΏΠ΅ΡΡΡ ΡΠ²ΠΈΠ΄ΠΊΡ ΡΠ΅Π°ΠΊΡΡΡ ΠΏΡΠΈΠ»Π°Π΄Ρ Π½Π° Π·ΠΌΡΠ½Ρ Π²ΠΏΠ»ΠΈΠ²Ρ Π·ΠΎΠ²Π½ΡΡΠ½ΡΡ
ΡΠΈΠ½Π½ΠΈΠΊΡΠ².The research of different factors influencing on the metrological characteristics of the sensor was conducted in the paper. The elevation of the devicesβ metrological characteristics can be achieved by using pulsed methods of polarization of sensorsβ electrodes. Novelty of work consists in application of pulse polarization of sensors of oxygen and development of new methods of processing of target signals for the purpose of increase of metrological characteristics of devices. Kinetics of the processes of oxygen reduction on sensorsβ cathode under polarization of the pulse voltage is researched. Application of the new methods of polarization leads to minimal influence on the work of sensor on equilibrium processes in biological objects which increases accuracy of measurement and provides quick reaction of the device on the alteration of the effect of external factors.Π ΡΠ°Π±ΠΎΡΠ΅ ΠΏΡΠΎΠ²ΠΎΠ΄ΠΈΠ»ΠΈΡΡ ΠΈΡΡΠ»Π΅Π΄ΠΎΠ²Π°Π½ΠΈΡ ΡΠ°Π·Π»ΠΈΡΠ½ΡΡ
ΡΠ°ΠΊΡΠΎΡΠΎΠ², Π²Π»ΠΈΡΡΡΠΈΡ
Π½Π° ΠΌΠ΅ΡΡΠΎΠ»ΠΎΠ³ΠΈΡΠ΅ΡΠΊΠΈΠ΅ Ρ
Π°ΡΠ°ΠΊΡΠ΅ΡΠΈΡΡΠΈΠΊΠΈ ΡΠ΅Π½ΡΠΎΡΠ°. ΠΠΎΠ²ΡΡΠ΅Π½ΠΈΠ΅ ΠΌΠ΅ΡΡΠΎΠ»ΠΎΠ³ΠΈΡΠ΅ΡΠΊΠΈΡ
Ρ
Π°ΡΠ°ΠΊΡΠ΅ΡΠΈΡΡΠΈΠΊ ΠΏΡΠΈΠ±ΠΎΡΠΎΠ² ΠΌΠΎΠΆΠ΅Ρ Π±ΡΡΡ Π΄ΠΎΡΡΠΈΠ³Π½ΡΡΠΎ ΠΏΡΠΈ ΠΈΡΠΏΠΎΠ»ΡΠ·ΠΎΠ²Π°Π½ΠΈΠΈ ΠΈΠΌΠΏΡΠ»ΡΡΠ½ΡΡ
ΠΌΠ΅ΡΠΎΠ΄ΠΎΠ² ΠΏΠΎΠ»ΡΡΠΈΠ·Π°ΡΠΈΠΈ ΡΠ»Π΅ΠΊΡΡΠΎΠ΄ΠΎΠ² ΡΠ΅Π½ΡΠΎΡΠΎΠ². ΠΠΎΠ²ΠΈΠ·Π½Π° ΡΠ°Π±ΠΎΡΡ Π·Π°ΠΊΠ»ΡΡΠ°Π΅ΡΡΡ Π² ΠΏΡΠΈΠΌΠ΅Π½Π΅Π½ΠΈΠΈ ΠΈΠΌΠΏΡΠ»ΡΡΠ½ΠΎΠΉ ΠΏΠΎΠ»ΡΡΠΈΠ·Π°ΡΠΈΠΈ ΡΠ΅Π½ΡΠΎΡΠΎΠ² ΠΊΠΈΡΠ»ΠΎΡΠΎΠ΄Π° ΠΈ ΡΠ°Π·ΡΠ°Π±ΠΎΡΠΊΠ΅ Π½ΠΎΠ²ΡΡ
ΠΌΠ΅ΡΠΎΠ΄ΠΎΠ² ΠΎΠ±ΡΠ°Π±ΠΎΡΠΊΠΈ Π²ΡΡ
ΠΎΠ΄Π½ΡΡ
ΡΠΈΠ³Π½Π°Π»ΠΎΠ² Ρ ΡΠ΅Π»ΡΡ ΠΏΠΎΠ²ΡΡΠ΅Π½ΠΈΡ ΠΌΠ΅ΡΡΠΎΠ»ΠΎΠ³ΠΈΡΠ΅ΡΠΊΠΈΡ
Ρ
Π°ΡΠ°ΠΊΡΠ΅ΡΠΈΡΡΠΈΠΊ ΠΏΡΠΈΠ±ΠΎΡΠΎΠ². ΠΡΡΠ»Π΅Π΄ΠΎΠ²Π°Π½Π° ΠΊΠΈΠ½Π΅ΡΠΈΠΊΠ° ΠΏΡΠΎΡΠ΅ΡΡΠΎΠ² Π²ΠΎΡΡΡΠ°Π½ΠΎΠ²Π»Π΅Π½ΠΈΡ ΠΊΠΈΡΠ»ΠΎΡΠΎΠ΄Π° Π½Π° ΠΊΠ°ΡΠΎΠ΄Π°Ρ
ΡΠ΅Π½ΡΠΎΡΠΎΠ² ΠΏΡΠΈ ΠΏΠΎΠ»ΡΡΠΈΠ·Π°ΡΠΈΠΈ ΠΈΠΌΠΏΡΠ»ΡΡΠ½ΡΠΌ Π½Π°ΠΏΡΡΠΆΠ΅Π½ΠΈΠ΅ΠΌ. ΠΡΠΈΠΌΠ΅Π½Π΅Π½ΠΈΠ΅ Π½ΠΎΠ²ΡΡ
ΠΌΠ΅ΡΠΎΠ΄ΠΎΠ² ΠΏΠΎΠ»ΡΡΠΈΠ·Π°ΡΠΈΠΈ ΠΏΡΠΈΠ²ΠΎΠ΄ΠΈΡ ΠΊ ΠΌΠΈΠ½ΠΈΠΌΠ°Π»ΡΠ½ΠΎΠΌΡ Π²Π»ΠΈΡΠ½ΠΈΡ ΡΠ°Π±ΠΎΡΡ ΡΠ΅Π½ΡΠΎΡΠ° Π½Π° ΡΠ°Π²Π½ΠΎΠ²Π΅ΡΠ½ΡΠ΅ ΠΏΡΠΎΡΠ΅ΡΡΡ Π² Π±ΠΈΠΎΠ»ΠΎΠ³ΠΈΡΠ΅ΡΠΊΠΈΡ
ΠΎΠ±ΡΠ΅ΠΊΡΠ°Ρ
, ΡΡΠΎ ΠΏΠΎΠ²ΡΡΠ°Π΅Ρ ΡΠΎΡΠ½ΠΎΡΡΡ ΠΈΠ·ΠΌΠ΅ΡΠ΅Π½ΠΈΡ ΠΈ ΠΎΠ±Π΅ΡΠΏΠ΅ΡΠΈΠ²Π°Π΅Ρ Π±ΡΡΡΡΡΡ ΡΠ΅Π°ΠΊΡΠΈΡ ΠΏΡΠΈΠ±ΠΎΡΠ° Π½Π° ΠΈΠ·ΠΌΠ΅Π½Π΅Π½ΠΈΠ΅ Π²ΠΎΠ·Π΄Π΅ΠΉΡΡΠ²ΠΈΡ Π²Π½Π΅ΡΠ½ΠΈΡ
ΡΠ°ΠΊΡΠΎΡΠΎΠ²
Fast Fencing
We consider very natural "fence enclosure" problems studied by Capoyleas, Rote, and Woeginger and Arkin, Khuller, and Mitchell in the early 90s. Given a set of points in the plane, we aim at finding a set of closed curves such that (1) each point is enclosed by a curve and (2) the total length of the curves is minimized. We consider two main variants. In the first variant, we pay a unit cost per curve in addition to the total length of the curves. An equivalent formulation of this version is that we have to enclose unit disks, paying only the total length of the enclosing curves. In the other variant, we are allowed to use at most closed curves and pay no cost per curve. For the variant with at most closed curves, we present an algorithm that is polynomial in both and . For the variant with unit cost per curve, or unit disks, we present a near-linear time algorithm. Capoyleas, Rote, and Woeginger solved the problem with at most curves in time. Arkin, Khuller, and Mitchell used this to solve the unit cost per curve version in exponential time. At the time, they conjectured that the problem with curves is NP-hard for general . Our polynomial time algorithm refutes this unless P equals NP
Fast Fencing
International audienceWe consider very natural βfence enclosureβ problems studied by Capoyleas, Rote, and Woeginger and Arkin, Khuller, and Mitchell in the early 90s. Given a set S of n points in the plane, we aim at finding a set of closed curves such that (1) each point is enclosed by a curve and (2) the total length of the curves is minimized. We consider two main variants. In the first variant, we pay a unit cost per curve in addition to the total length of the curves. An equivalent formulation of this version is that we have to enclose n unit disks, paying only the total length of the enclosing curves. In the other variant, we are allowed to use at most k closed curves and pay no cost per curve.For the variant with at most k closed curves,we present an algorithm that is polynomialin bothn andk. For the variant with unit cost per curve, or unit disks, we presenta near-linear time algorithm.Capoyleas, Rote, and Woeginger solved the problem with at most k curves in nO(k) time. Arkin, Khuller, and Mitchell used this to solve the unit cost per curve version in exponential time. At the time, they conjectured that the problem with k curves is NP-hard for general k. Our polynomial time algorithm refutes this unless P equals NP
Robot-assisted pyeloplasty: outcomes for primary and secondary repairs, a single institution experience
INTRODUCTION: Robotic Pyeloplasty (RAP) is a technique for management of uretero-pelvic junction obstruction (UPJO). PURPOSE: To report outcomes of RAP for primary and secondary (after failed primary treatment) UPJO. MATERIALS AND METHODS: Single institution data of adult RAP performed from 2007 to 2009 was collected retrospectively following approval by our IRB. Database analysis including patient age, race, pre and post-operative imaging studies and perioperative variables including operative time, blood loss, pain and complications. RESULTS: Fifty-five adult patients underwent RAP (26 left/29 right) for UPJO including 9 secondary procedures from 2007 to 2009. Average follow-up was 16 months (1-36). Mean age was 41 years (18-71) with an average BMI of 27 (17-42), 32 were female. Majority were diagnosed with preoperative diuretic renal scintigraphy with obstructed side demonstrating mean function of 41% and t1/2 of 70 minutes. Mean operative time was 194 minutes with average blood loss less than 100 mL. Mean hospital stay was 1.7 days with an average narcotic equivalent dose of 15 mg. RAP for secondary UPJO took longer with more blood loss and had a lower success rate. Failure was defined as necessitating another procedure due to persistent pain and/or obstruction on diuretic renal imaging. One patient (2%) with primary UPJO failed and 2 patients (22%) with secondary UPJO failed. One major complication occurred. CONCLUSION: RAP is a good option for the treatment of patients with UPJO. Reported series have established that endopyelotomy has inferior success as a treatment for primary UPJO which compromises the success of subsequent treatment as demonstrated in our higher failure rate with secondary UPJO repair
Defending Financial Infrastructures Through Early Warning Systems: The intelligence cloud approach
Recent evidence of successful Internet-based attacks and frauds involvingnancial institutions highlights the inadequacy of the existing protection mechanisms, in which each instutition implements its own isolated monitoring and reaction strategy. Analyzing on-line activity and detecting attacks on a large scale is an open issue due to the huge amounts of events that should be collected and processed. In this paper, we propose a large-scale distributed event processing system, called intelligence cloud, allowing the nancial entities to participate in a widely distributed monitoring and detection effort through the exchange and processing of information locally available at each participating site. We expect this approach to be able to handle large amounts of events arriving at high rates from multiple domains of the financial scenario. We describe a framework based on the intelligence cloud where each participant can receive early alerts enabling them to deploy proactive countermeasures and mitigation strategies. Copyright Β© 2009 ACM
Fast fencing
We consider very natural fence enclosure problems studied by Capoyleas, Rote, and Woeginger and Arkin, Khuller, and Mitchell in the early 90s. Given a set of points in the plane, we aim at finding a set of closed curves such that (1) each point is enclosed by a curve and (2) the total length of the curves is minimized. We consider two main variants. In the first variant, we pay a unit cost per curve in addition to the total length of the curves. An equivalent formulation of this version is that we have to enclose unit disks, paying only the total length of the enclosing curves. In the other variant, we are allowed to use at most closed curves and pay no cost per curve. For the variant with at most closed curves, we present an algorithm that is polynomial in both and . For the variant with unit cost per curve, or unit disks, we present a near-linear time algorithm. Capoyleas, Rote, and Woeginger solved the problem with at most curves in time. Arkin, Khuller, and Mitchell used this to solve the unit cost per curve version in exponential time. At the time, they conjectured that the problem with curves is NP-hard for general . Our polynomial time algorithm refutes this unless P equals NP