981 resultados para Researchers’ network
Resumo:
Purpose/Objective(s): Primary bone lymphoma (PBL) represents less than 1% of all malignant lymphomas, and 4-5% of all extranodal lymphomas. In this study, we assessed the disease profile, outcome, and prognostic factors in patients with stage I and II PBL.Materials/Methods: Between 1987 and 2008, 116 consecutive patients with PBL treated in 13 RCNinstitutions were included in this study. Inclusion criteriawere: age.17 yrs, PBLin stage I and II, andminimum6months follow-up. The median agewas 51 yrs (range: 17-93).Diagnosticwork-up included plain boneXray (74%of patients), scintigraphy (62%), CT-scan (65%),MRI (58%), PET (18%), and bone-marrow biopsy (84%).All patients had biopsy-proven confirmation of non-Hodgkin's lymphoma (NHL). The histopathological type was predominantly diffuse large B-cell lymphoma (78%) and follicular lymphoma (6%), according to theWHOclassification. One hundred patients had a high-grade, 7 intermediate and 9 low-gradeNHL. Ninety-three patients had anAnn-Arbor stage I, and 23 had a stage II. Seventy-seven patients underwent chemoradiotherapy (CXRT), 12 radiotherapy (RT) alone, 10 chemotherapy alone (CXT), 9 surgery followed by CXRT, 5 surgery followed by CXT, and 2 surgery followed by RT. One patient died before treatment.Median RT dosewas 40Gy (range: 4-60).Themedian number ofCXTcycleswas 6 (range, : 2-8).Median follow-upwas 41months (range: 6-242).Results: Following treatment, the overall response rate was 91% (CR 74%, PR 17%). Local recurrence was observed in 12 (10%) patients, and systemic recurrence in 17 (15%) patients. Causes of death included disease progression in 16, unrelated disease in 6, CXT-related toxicity in 1, and secondary cancer in 2 patients. The 5-yr overall survival (OS), disease-free survival (DFS), lymphoma- specific survival (LSS), and local control (LC) were 76%, 69%, 78%, and 92%, respectively. In univariate analyses (log-rank test), favorable prognostic factors for survival were: age\50 years (p = 0.008), IPI score #1 (p = 0.009), complete response (p\0.001), CXT (p = 0.008), number of CXT cycles $6 (p = 0.007), and RT dose . 40 Gy (p = 0.005). In multivariate analysis age, RT dose, complete response, and absence of B symptoms were independent factors influencing the outcome. There were 3 patients developing grade 3 or more (CTCAE.V3.0) toxicities.Conclusions: This large multicenter study, confirms the relatively good prognosis of early stage PBL, treated with combined CXRT. Local control was excellent, and systemic failure occurred infrequently. A sufficient dose of RT (. 40 Gy) and completeCXT regime (. 6 cycles) were associated with a better outcome. Combined modality appears to be the treatment of choice.Author Disclosure: L. Cai, None; M.C. Stauder, None; Y.J. Zhang, None; P. Poortmans, None; Y.X. Li, None; N. Constantinou, None; J. Thariat, None; S. Kadish, None; M. Ozsahin, None; R.O. Mirimanoff, None.
Resumo:
In spite of its relative importance in the economy of many countriesand its growing interrelationships with other sectors, agriculture has traditionally been excluded from accounting standards. Nevertheless, to support its Common Agricultural Policy, for years the European Commission has been making an effort to obtain standardized information on the financial performance and condition of farms. Through the Farm Accountancy Data Network (FADN), every year data are gathered from a rotating sample of 60.000 professional farms across all member states. FADN data collection is not structured as an accounting cycle but as an extensive questionnaire. This questionnaire refers to assets, liabilities, revenues and expenses, and seems to try to obtain a "true and fair view" of the financial performance and condition of the farms it surveys. However, the definitions used in the questionnaire and the way data is aggregated often appear flawed from an accounting perspective. The objective of this paper is to contrast the accounting principles implicit in the FADN questionnaire with generally accepted accounting principles, particularly those found in the IVth Directive of the European Union, on the one hand, and those recently proposed by the International Accounting Standards Committees Steering Committeeon Agriculture in its Draft Statement of Principles, on the other hand. There are two reasons why this is useful. First, it allows to make suggestions how the information provided by FADN could be more in accordance with the accepted accounting framework, and become a more valuable tool for policy makers, farmers, and other stakeholders. Second, it helps assessing the suitability of FADN to become the starting point for a European accounting standard on agriculture.
Resumo:
Iowa Department of Transportation Fiscal Year 2007 Report of Savings by Using Video Conferencing Through Iowa Communications Network to the Iowa General Assembly Pursuant to Chapter II 84 Acts and Joint Resolutions Enacted at the 1994 Regular Session of the 75th General Assembly of the State of Iowa Code section 8D.10 Report of Savings by State Agencies Iowa Code section 8D.10 requires certain state agencies prepare an annual report to the General Assembly certifying the identified savings associated with that state agency’s use of the Iowa Communications Network (ICN). This report covers estimated cost savings related to video conferencing via ICN for the Iowa Department of Transportation (DOT). In FY 2007, the DOT conducted two sessions utilizing ICN’s video conferencing system. These two sessions included DOT employees in Ames with non-DOT participants at remote ICN sites. Since the cost savings is calculated based on DOT staff savings, no cost savings from these conferences were gained because the public participants were attending from the ICN sites.
Resumo:
Les décisions de gestion des eaux souterraines doivent souvent être justiffées par des modèles quantitatifs d'aquifères qui tiennent compte de l'hétérogénéité des propriétés hydrauliques. Les aquifères fracturés sont parmi les plus hétérogènes et très difficiles à étudier. Dans ceux-ci, les fractures connectées, d'ouverture millimètrique, peuvent agir comme conducteurs hydrauliques et donc créer des écoulements très localisés. Le manque général d'informations sur la distribution spatiale des fractures limite la possibilité de construire des modèles quantitatifs de flux et de transport. Les données qui conditionnent les modèles sont généralement spatialement limitées, bruitées et elles ne représentent que des mesures indirectes de propriétés physiques. Ces limitations aux données peuvent être en partie surmontées en combinant différents types de données, telles que les données hydrologiques et de radar à pénétration de sol plus commun ément appelé géoradar. L'utilisation du géoradar en forage est un outil prometteur pour identiffer les fractures individuelles jusqu'à quelques dizaines de mètres dans la formation. Dans cette thèse, je développe des approches pour combiner le géoradar avec les données hydrologiques affn d'améliorer la caractérisation des aquifères fracturés. Des investigations hydrologiques intensives ont déjà été réalisées à partir de trois forage adjacents dans un aquifère cristallin en Bretagne (France). Néanmoins, la dimension des fractures et la géométrie 3-D des fractures conductives restaient mal connue. Affn d'améliorer la caractérisation du réseau de fractures je propose dans un premier temps un traitement géoradar avancé qui permet l'imagerie des fractures individuellement. Les résultats montrent que les fractures perméables précédemment identiffées dans les forages peuvent être caractérisées géométriquement loin du forage et que les fractures qui ne croisent pas les forages peuvent aussi être identiffées. Les résultats d'une deuxième étude montrent que les données géoradar peuvent suivre le transport d'un traceur salin. Ainsi, les fractures qui font partie du réseau conductif et connecté qui dominent l'écoulement et le transport local sont identiffées. C'est la première fois que le transport d'un traceur salin a pu être imagé sur une dizaines de mètres dans des fractures individuelles. Une troisième étude conffrme ces résultats par des expériences répétées et des essais de traçage supplémentaires dans différentes parties du réseau local. En outre, la combinaison des données de surveillance hydrologique et géoradar fournit la preuve que les variations temporelles d'amplitude des signaux géoradar peuvent nous informer sur les changements relatifs de concentrations de traceurs dans la formation. Par conséquent, les données géoradar et hydrologiques sont complémentaires. Je propose ensuite une approche d'inversion stochastique pour générer des modèles 3-D de fractures discrètes qui sont conditionnés à toutes les données disponibles en respectant leurs incertitudes. La génération stochastique des modèles conditionnés par géoradar est capable de reproduire les connexions hydrauliques observées et leur contribution aux écoulements. L'ensemble des modèles conditionnés fournit des estimations quantitatives des dimensions et de l'organisation spatiale des fractures hydrauliquement importantes. Cette thèse montre clairement que l'imagerie géoradar est un outil utile pour caractériser les fractures. La combinaison de mesures géoradar avec des données hydrologiques permet de conditionner avec succès le réseau de fractures et de fournir des modèles quantitatifs. Les approches présentées peuvent être appliquées dans d'autres types de formations rocheuses fracturées où la roche est électriquement résistive.
Resumo:
In this paper a p--median--like model is formulated to address theissue of locating new facilities when there is uncertainty. Severalpossible future scenarios with respect to demand and/or the travel times/distanceparameters are presented. The planner will want a strategy of positioning thatwill do as ``well as possible'' over the future scenarios. This paper presents a discrete location model formulation to address this P--Medianproblem under uncertainty. The model is applied to the location of firestations in Barcelona.
Resumo:
We argue the importance both of developing simple sufficientconditions for the stability of general multiclass queueing networks and also of assessing such conditions under a range of assumptions on the weight of the traffic flowing between service stations. To achieve the former, we review a peak-rate stability condition and extend its range of application and for the latter, we introduce a generalisation of the Lu-Kumar network on which the stability condition may be tested for a range of traffic configurations. The peak-rate condition is close to exact when the between-station traffic is light, but degrades as this traffic increases.
Resumo:
Audit report on the Iowa Communications Network (ICN) for the year ended June 30, 2007
Resumo:
Agency Performance Plan, Iowa Communications Network
Resumo:
The Network Revenue Management problem can be formulated as a stochastic dynamic programming problem (DP or the\optimal" solution V *) whose exact solution is computationally intractable. Consequently, a number of heuristics have been proposed in the literature, the most popular of which are the deterministic linear programming (DLP) model, and a simulation based method, the randomized linear programming (RLP) model. Both methods give upper bounds on the optimal solution value (DLP and PHLP respectively). These bounds are used to provide control values that can be used in practice to make accept/deny decisions for booking requests. Recently Adelman [1] and Topaloglu [18] have proposed alternate upper bounds, the affine relaxation (AR) bound and the Lagrangian relaxation (LR) bound respectively, and showed that their bounds are tighter than the DLP bound. Tight bounds are of great interest as it appears from empirical studies and practical experience that models that give tighter bounds also lead to better controls (better in the sense that they lead to more revenue). In this paper we give tightened versions of three bounds, calling themsAR (strong Affine Relaxation), sLR (strong Lagrangian Relaxation) and sPHLP (strong Perfect Hindsight LP), and show relations between them. Speciffically, we show that the sPHLP bound is tighter than sLR bound and sAR bound is tighter than the LR bound. The techniques for deriving the sLR and sPHLP bounds can potentially be applied to other instances of weakly-coupled dynamic programming.
Resumo:
We use network and correspondence analysis to describe the compositionof the research networks in the European BRITE--EURAM program. Our mainfinding is that 27\% of the participants in this program fall into one oftwo sets of highly ``interconnected'' institutions --one centered aroundlarge firms (with smaller firms and research centers providing specializedservices), and the other around universities--. Moreover, these ``hubs''are composed largely of institutions coming from the technologically mostadvanced regions of Europe. This is suggestive of the difficulties of attainingEuropean ``cohesion'', as technically advanced institutions naturally linkwith partners of similar technological capabilities.
Resumo:
The network choice revenue management problem models customers as choosing from an offer-set, andthe firm decides the best subset to offer at any given moment to maximize expected revenue. The resultingdynamic program for the firm is intractable and approximated by a deterministic linear programcalled the CDLP which has an exponential number of columns. However, under the choice-set paradigmwhen the segment consideration sets overlap, the CDLP is difficult to solve. Column generation has beenproposed but finding an entering column has been shown to be NP-hard. In this paper, starting with aconcave program formulation based on segment-level consideration sets called SDCP, we add a class ofconstraints called product constraints, that project onto subsets of intersections. In addition we proposea natural direct tightening of the SDCP called ?SDCP, and compare the performance of both methodson the benchmark data sets in the literature. Both the product constraints and the ?SDCP method arevery simple and easy to implement and are applicable to the case of overlapping segment considerationsets. In our computational testing on the benchmark data sets in the literature, SDCP with productconstraints achieves the CDLP value at a fraction of the CPU time taken by column generation and webelieve is a very promising approach for quickly approximating CDLP when segment consideration setsoverlap and the consideration sets themselves are relatively small.
Resumo:
This report outlines the strategic plan for Iowa Communications Network, goals and mission.
Resumo:
This is the Annual Report for Fiscal Year 2007 (July 1, 2007-June 30, 2008) for the Iowa Communications Network.
Resumo:
Iowa Code § 8D.10 requires certain state agencies prepare an annual report to the General Assembly certifying the identified savings associated with that state agency’s use of the Iowa Communications Network (ICN). This report covers estimated cost savings related to video conferencing via ICN for the Iowa Department of Transportation (DOT). In FY 2008, the DOT did not conduct any sessions utilizing ICN’s video conferencing system. Therefore, no cost savings were calculated for this report.
Resumo:
The objective of this paper is to compare the performance of twopredictive radiological models, logistic regression (LR) and neural network (NN), with five different resampling methods. One hundred and sixty-seven patients with proven calvarial lesions as the only known disease were enrolled. Clinical and CT data were used for LR and NN models. Both models were developed with cross validation, leave-one-out and three different bootstrap algorithms. The final results of each model were compared with error rate and the area under receiver operating characteristic curves (Az). The neural network obtained statistically higher Az than LR with cross validation. The remaining resampling validation methods did not reveal statistically significant differences between LR and NN rules. The neural network classifier performs better than the one based on logistic regression. This advantage is well detected by three-fold cross-validation, but remains unnoticed when leave-one-out or bootstrap algorithms are used.