241 research outputs found
Progress Interrupted: Virginia\u27s Hesitant Movement to Landlord-Tenant Reform
In 2018, Virginia’s eviction crisis received national attention. Over the next three legislative sessions in 2019, 2020, and 2021, more than two dozen laws were enacted—a few on a temporary basis but most on a permanent basis—to be more fair, favorable, and friendly to tenants. The COVID-19 pandemic resulted in the Virginia Governor declaring a State of Emergency on March 12, 2020—the final day of the Regular Session of the Virginia General Assembly. The pandemic added urgency to an already accelerating movement toward landlord-tenant reform which had mustered bipartisan support. That progress dramatically halted in the 2022 Regular Session of the Virginia General Assembly with the defeat of at least five landlord-tenant bills intended to rectify the imbalance between the rights of tenants and landlords. Although some see that as a desired return to normalcy, others see that as a “normal” that Virginia should not want to go back to
A Transformational Approach to Resource Analysis with Typed-Norms
In order to automatically infer the resource consumption of programs, analyzers track how data sizes change along a program s execution. Typically, analyzers measure the sizes of data by applying norms which are mappings from data to natural numbers that represent the sizes of the corresponding data. When norms are defined by taking type information into account, they are named typed-norms. The main contribution of this paper is a transformational approach to resource analysis with typed-norms. The analysis is based on a transformation of the program into an intermediate abstract program in which each variable is abstracted with respect to all considered norms which are valid for its type. We also sketch a simple analysis that can be used to automatically infer the required, useful, typed-norms from programs.This work was funded partially by the EU project FP7-ICT-610582 ENVISAGE: Engineering Virtualized Services (http://www.envisage-project.eu) and by the Spanish projects TIN2008-05624 and TIN2012-38137. Raúl Gutiérrez is also partially supported by a Juan de la Cierva Fellowship from the Spanish MINECO, ref. JCI-2012-13528.Albert Albiol, EM.; Genaim, S.; Gutiérrez Gil, R. (2014). A Transformational Approach to Resource Analysis with Typed-Norms. Lecture Notes in Computer Science. 8901:38-53. https://doi.org/10.1007/978-3-319-14125-1_3S38538901Albert, E., Arenas, P., Genaim, S., Gómez-Zamalloa, M., Puebla, G.: Cost Analysis of Concurrent OO Programs. In: Yang, H. (ed.) APLAS 2011. LNCS, vol. 7078, pp. 238–254. Springer, Heidelberg (2011)Albert, E., Arenas, P., Genaim, S., Puebla, G., Zanardini, D.: Cost Analysis of Java Bytecode. In: De Nicola, R. (ed.) ESOP 2007. LNCS, vol. 4421, pp. 157–172. Springer, Heidelberg (2007)Albert, E., Arenas, P., Genaim, S., Puebla, G., Zanardini, D.: Removing Useless Variables in Cost Analysis of Java Bytecode. In: Proc. of SAC 2008, pp. 368–375. ACM (2008)Alonso, D., Arenas, P., Genaim, S.: Handling Non-linear Operations in the Value Analysis of COSTA. In: Proc. of BYTECODE 2011. ENTCS, vol. 279, pp. 3–17. Elsevier (2011)Bossi, A., Cocco, N., Fabris, M.: Proving Termination of Logic Programs by Exploiting Term Properties. In: Proc. of TAPSOFT 1991. LNCS, vol. 494, pp. 153–180. Springer (1991)Bruynooghe, M., Codish, M., Gallagher, J., Genaim, S., Vanhoof, W.: Termination Analysis of Logic Programs through Combination of Type-Based norms. TOPLAS 29(2), Art. 10 (2007)Claessen, K., Hughes, J.: QuickCheck: A Lightweight Tool for Random Testing of Haskell Programs. In: Proc. of ICFP 2000, pp. 268–279. ACM (2000)Fähndrich, M.: Static Verification for Code Contracts. In: Cousot, R., Martel, M. (eds.) SAS 2010. LNCS, vol. 6337, pp. 2–5. Springer, Heidelberg (2010)Genaim, S., Codish, M., Gallagher, J.P., Lagoon, V.: Combining Norms to Prove Termination. In: Cortesi, A. (ed.) VMCAI 2002. LNCS, vol. 2294, pp. 123–138. Springer, Heidelberg (2002)Johnsen, E.B., Hähnle, R., Schäfer, J., Schlatte, R., Steffen, M.: ABS: A Core Language for Abstract Behavioral Specification. In: Aichernig, B.K., de Boer, F.S., Bonsangue, M.M. (eds.) Formal Methods for Components and Objects. LNCS, vol. 6957, pp. 142–164. Springer, Heidelberg (2011)King, A., Shen, K., Benoy, F.: Lower-bound Time-complexity Analysis of Logic Programs. In: Proc. of ILPS 1997, pp. 261–275. MIT Press (1997)Serrano, A., Lopez-Garcia, P., Bueno, F., Hermenegildo, M.: Sized Type Analysis for Logic Programs. In: Tech. Comms. of ICLP 2013. Cambridge U. Press (2013) (to appear)Spoto, F., Mesnard, F., Payet, É.: A Termination Analyser for Java Bytecode based on Path-Length. TOPLAS 32(3), Art. 8 (2010)Vallée-Rai, R., Hendren, L., Sundaresan, V., Lam, P., Gagnon, E., Co, P.: Soot - a Java Optimization Framework. In: Proc. of CASCON 1999. pp. 125–135. IBM (1999)Vasconcelos, P.: Space Cost Analysis using Sized Types. Ph.D. thesis, School of CS, University of St. Andrews (2008)Vasconcelos, P.B., Hammond, K.: Inferring Cost Equations for Recursive, Polymorphic and Higher-Order Functional Programs. In: Trinder, P., Michaelson, G.J., Peña, R. (eds.) IFL 2003. LNCS, vol. 3145, pp. 86–101. Springer, Heidelberg (2004)Wegbreit, B.: Mechanical Program Analysis. Commun. ACM 18(9), 528–539 (1975
Growth and characterization of GaAs nanowires on carbon nanotubes composite films: toward flexible nanodevices
Poly(ethylene imine) functionalized carbon nanotube thin films, prepared
using the vacuum filtration method, were decorated with Au nanoparticles by in
situ reduction of HAuCl4 under mild conditions. These Au nanoparticles were
subsequently employed for the growth of GaAs nanowires (NWs) by the
vapor-liquid-solid process in a gas source molecular beam epitaxy system. The
process resulted in the dense growth of GaAs NWs across the entire surface of
the single-walled nanotube (SWNT) films. The NWs, which were orientated in a
variety of angles with respect to the SWNT films, ranged in diameter between 20
to 200 nm, with heights up to 2.5 um. Transmission electron microscopy analysis
of the NW-SWNT interface indicated that NW growth was initiated upon the
surface of the nanotube composite films. Photoluminescence characterization of
a single NW specimen showed high optical quality. Rectifying asymmetric
current-voltage behavior was observed from contacted NW ensembles and
attributed to the core-shell pn-junction within the NWs. Potential applications
of such novel hybrid architectures include flexible solar cells, displays, and
sensors
Review of mass drug administration for malaria and its operational challenges.
Mass drug administration (MDA) was a component of many malaria programs during the eradication era, but later was seldomly deployed due to concerns regarding efficacy and feasibility and fear of accelerating drug resistance. Recently, however, there has been renewed interest in the role of MDA as an elimination tool. Following a 2013 Cochrane Review that focused on the quantitative effects of malaria MDA, we have conducted a systematic, qualitative review of published, unpublished, and gray literature documenting past MDA experiences. We have also consulted with field experts, using their historical experience to provide an informed, contextual perspective on the role of MDA in malaria elimination. Substantial knowledge gaps remain and more research is necessary, particularly on optimal target population size, methods to improve coverage, and primaquine safety. Despite these gaps, MDA has been used successfully to control and eliminate Plasmodium falciparum and P. vivax malaria in the past, and should be considered as part of a comprehensive malaria elimination strategy in specific settings
Worst-case analysis of heap allocations
Abstract. In object oriented languages, dynamic memory allocation is a fundamental concept. When using such a language in hard real-time systems, it becomes important to bound both the worst-case execution time and the worst-case memory consumption. In this paper, we present an analysis to determine the worst-case heap allocations of tasks. The analysis builds upon techniques that are well established for worst-case execution time analysis. The difference is that the cost function is not the execution time of instructions in clock cycles, but the allocation in bytes. In contrast to worst-case execution time analysis, worst-case heap allocation analysis is not processor dependent. However, the cost function depends on the object layout of the runtime system. The analysis is evaluated with several real-time benchmarks to establish the usefulness of the analysis, and to compare the memory consumption of different object layouts.
Health Diplomacy the Adaptation of Global Health Interventions to Local Needs in sub-Saharan Africa and Thailand: Evaluating Findings from Project Accept (HPTN 043).
Study-based global health interventions, especially those that are conducted on an international or multi-site basis, frequently require site-specific adaptations in order to (1) respond to socio-cultural differences in risk determinants, (2) to make interventions more relevant to target population needs, and (3) in recognition of 'global health diplomacy' issues. We report on the adaptations development, approval and implementation process from the Project Accept voluntary counseling and testing, community mobilization and post-test support services intervention. We reviewed all relevant documentation collected during the study intervention period (e.g. monthly progress reports; bi-annual steering committee presentations) and conducted a series of semi-structured interviews with project directors and between 12 and 23 field staff at each study site in South Africa, Zimbabwe, Thailand and Tanzania during 2009. Respondents were asked to describe (1) the adaptations development and approval process and (2) the most successful site-specific adaptations from the perspective of facilitating intervention implementation. Across sites, proposed adaptations were identified by field staff and submitted to project directors for review on a formally planned basis. The cross-site intervention sub-committee then ensured fidelity to the study protocol before approval. Successfully-implemented adaptations included: intervention delivery adaptations (e.g. development of tailored counseling messages for immigrant labour groups in South Africa) political, environmental and infrastructural adaptations (e.g. use of local community centers as VCT venues in Zimbabwe); religious adaptations (e.g. dividing clients by gender in Muslim areas of Tanzania); economic adaptations (e.g. co-provision of income generating skills classes in Zimbabwe); epidemiological adaptations (e.g. provision of 'youth-friendly' services in South Africa, Zimbabwe and Tanzania), and social adaptations (e.g. modification of terminology to local dialects in Thailand: and adjustment of service delivery schedules to suit seasonal and daily work schedules across sites). Adaptation selection, development and approval during multi-site global health research studies should be a planned process that maintains fidelity to the study protocol. The successful implementation of appropriate site-specific adaptations may have important implications for intervention implementation, from both a service uptake and a global health diplomacy perspective
Achieving Operational Hydrologic Monitoring of Mosquitoborne Disease
West Nile virus transmission in Florida can be monitored by using modeled hydrology
Need for Improved Methods to Collect and Present Spatial Epidemiologic Data for Vectorborne Diseases
These methods will improve capability for development of spatial risk models for vectorborne diseases in the United States
A theory of type polymorphism in programming
AbstractThe aim of this work is largely a practical one. A widely employed style of programming, particularly in structure-processing languages which impose no discipline of types, entails defining procedures which work well on objects of a wide variety. We present a formal type discipline for such polymorphic procedures in the context of a simple programming language, and a compile time type-checking algorithm W which enforces the discipline. A Semantic Soundness Theorem (based on a formal semantics for the language) states that well-type programs cannot “go wrong” and a Syntactic Soundness Theorem states that if W accepts a program then it is well typed. We also discuss extending these results to richer languages; a type-checking algorithm based on W is in fact already implemented and working, for the metalanguage ML in the Edinburgh LCF system
- …