Changing Tides and Changing Focus: Mapping the Challenges and Successes of One State's Implementation Of the Adoption and Safe Families Act of 1997

In 1997, the Adoption and Safe Families Act shifted from the preservation of families to an emphasis on safety, permanency, and well-being through expediting the termination of parental rights, establishing exceptions to the reasonable efforts clause of preserving the family, and fiscal incentives for finalizing adoptions. The current project assessed the role of a full service array in achieving the outcomes set forth in ASF A. Concept mapping was utilized to elicit information from participants (both urban and rural) regarding the identified research question. Participants recognized family preservation versus safety, community connections, mandates versus reality, and worker recruitment and retention as critical components for meeting ASFA goals. Perceived importance and level of success in implementing these services was also highlighted. Recommendations supported through the data are also provided.

La estela de la Ley de Obispados de 1813 en la administración diocesana

Este trabajo aborda una de las resoluciones de la Asamblea del año XIII: la Ley de Obispados. Esta medida, y otras que estuvieron ligadas a ella, pretendieron dar solución a los problemas del ámbito eclesial. En este sentido y especialmente, nos referimos a la cláusula relativa a la retroversión de las facultades primitivas a los diocesanos o Provisores existentes en las Provincias Unidas. Esta medida obligaba a remitir todos los asuntos eclesiásticos a las cabeceras diocesanas, dando origen a una forma transicional de organización eclesiástica que colaborará en un nueva estructuración del mundo regular y en la reorganización de las Iglesias rioplatenses según una impronta marcada, en parte por los gobiernos políticos, como nos proponemos mostrar en el presente artículo

La estela de la Ley de Obispados de 1813 en la administración diocesana

Este trabajo aborda una de las resoluciones de la Asamblea del año XIII: la Ley de Obispados. Esta medida, y otras que estuvieron ligadas a ella, pretendieron dar solución a los problemas del ámbito eclesial. En este sentido y especialmente, nos referimos a la cláusula relativa a la retroversión de las facultades primitivas a los diocesanos o Provisores existentes en las Provincias Unidas. Esta medida obligaba a remitir todos los asuntos eclesiásticos a las cabeceras diocesanas, dando origen a una forma transicional de organización eclesiástica que colaborará en un nueva estructuración del mundo regular y en la reorganización de las Iglesias rioplatenses según una impronta marcada, en parte por los gobiernos políticos, como nos proponemos mostrar en el presente artículo

La estela de la Ley de Obispados de 1813 en la administración diocesana

Este trabajo aborda una de las resoluciones de la Asamblea del año XIII: la Ley de Obispados. Esta medida, y otras que estuvieron ligadas a ella, pretendieron dar solución a los problemas del ámbito eclesial. En este sentido y especialmente, nos referimos a la cláusula relativa a la retroversión de las facultades primitivas a los diocesanos o Provisores existentes en las Provincias Unidas. Esta medida obligaba a remitir todos los asuntos eclesiásticos a las cabeceras diocesanas, dando origen a una forma transicional de organización eclesiástica que colaborará en un nueva estructuración del mundo regular y en la reorganización de las Iglesias rioplatenses según una impronta marcada, en parte por los gobiernos políticos, como nos proponemos mostrar en el presente artículo

Normative Influences of "Special and Differential Treatment" on North-South RTAs

Recently, there has been a surge in bilateral and regional trade arrangements between developed and developing countries, which are known as North-South RTAs. Under the current legal system of the WTO, North-South RTAs are governed by Article XXIV of the GATT or Article V of the GATS, which means such RTAs must be reciprocal and must cover substantially all the trade. On the other hand, there is another category of rules on RTAs based on the so-called Enabling Clause, which, in exceptional circumstances, provides special and differential treatment (SDT) for RTAs among developing countries. This paper considers the applicability of the SDT concept to North-South RTAs by examining why rules on RTAs and the concept of SDT were incorporated into the GATT/WTO legal framework so as to permit the derogation of most-favored-nation (MFN) obligations.

How do free trade agreements reduce tariff rates and non-tariff barriers?

This paper empirically investigates how far free trade agreements (FTAs) successfully lower tariff rates and non-tariff barriers (NTBs) for manufacturing industries by employing the bilateral tariff and NTB data in a time series for countries around the world. We find that FTAs under GATT Article XXIV and the Enabling Clause contribute to reducing tariff rates by 2.1% points and 1.5% points, respectively. In the case of NTBs, their respective impacts are 6.6% points and 5.7% points. Membership in the World Trade Organization (WTO) does not contribute greatly to reducing tariff rates but does play a significant role in reducing NTBs. These results provide important implications for the literature on numerical assessments of FTAs.

Automatic Inference of Determinacy and Mutual Exclusion for Logic Programs Using Mode and Type Analyses

We propose an analysis for detecting procedures and goals that are deterministic (i.e., that produce at most one solution at most once),or predicates whose clause tests are mutually exclusive (which implies that at most one of their clauses will succeed) even if they are not deterministic. The analysis takes advantage of the pruning operator in order to improve the detection of mutual exclusion and determinacy. It also supports arithmetic equations and disequations, as well as equations and disequations on terms,for which we give a complete satisfiability testing algorithm, w.r.t. available type information. Information about determinacy can be used for program debugging and optimization, resource consumption and granularity control, abstraction carrying code, etc. We have implemented the analysis and integrated it in the CiaoPP system, which also infers automatically the mode and type information that our analysis takes as input. Experiments performed on this implementation show that the analysis is fairly accurate and efficient.

Automated attribute inference in complex service workflows based on sharing analysis

The properties of data and activities in business processes can be used to greatly facilítate several relevant tasks performed at design- and run-time, such as fragmentation, compliance checking, or top-down design. Business processes are often described using workflows. We present an approach for mechanically inferring business domain-specific attributes of workflow components (including data Ítems, activities, and elements of sub-workflows), taking as starting point known attributes of workflow inputs and the structure of the workflow. We achieve this by modeling these components as concepts and applying sharing analysis to a Horn clause-based representation of the workflow. The analysis is applicable to workflows featuring complex control and data dependencies, embedded control constructs, such as loops and branches, and embedded component services.

Annotation algorithms for unrestricted independent and-parallelism in logic programs

We present two new algorithms which perform automatic parallelization via source-to-source transformations. The objective is to exploit goal-level, unrestricted independent and-parallelism. The proposed algorithms use as targets new parallel execution primitives which are simpler and more flexible than the well-known &/2 parallel operator. This makes it possible to genérate better parallel expressions by exposing more potential parallelism among the literals of a clause than is possible with &/2. The difference between the two algorithms stems from whether the order of the solutions obtained is preserved or not. We also report on a preliminary evaluation of an implementation of our approach. We compare the performance obtained to that of previous annotation algorithms and show that relevant improvements can be obtained.

Determinacy analysis for logic programs using mode and type information

We propose an analysis for detecting procedures and goals that are deterministic (i.e. that produce at most one solution), or predicates whose clause tests are mutually exclusive (which implies that at most one of their clauses will succeed) even if they are not deterministic (because they cali other predicates that can produce more than one solution). Applications of such determinacy information include detecting programming errors, performing certain high-level program transformations for improving search efñciency, optimizing low level code generation and parallel execution, and estimating tighter upper bounds on the computational costs of goals and data sizes, which can be used for program debugging, resource consumption and granularity control, etc. We have implemented the analysis and integrated it in the CiaoPP system, which also infers automatically the mode and type information that our analysis takes as input. Experiments performed on this implementation show that the analysis is fairly accurate and efncient.

The CDG, UDG, and MEL methods for automatic compile-time parallelization of logic programs for independent and-parallelism

There has been significant interest in parallel execution models for logic programs which exploit Independent And-Parallelism (IAP). In these models, it is necessary to determine which goals are independent and therefore eligible for parallel execution and which goals have to wait for which others during execution. Although this can be done at run-time, it can imply a very heavy overhead. In this paper, we present three algorithms for automatic compiletime parallelization of logic programs using IAP. This is done by converting a clause into a graph-based computational form and then transforming this graph into linear expressions based on &-Prolog, a language for IAP. We also present an algorithm which, given a clause, determines if there is any loss of parallelism due to linearization, for the case in which only unconditional parallelism is desired. Finally, the performance of these annotation algorithms is discussed for some benchmark programs.

Towards structured state threading in prolog

It is very often the case that programs require passing, maintaining, and updating some notion of state. Prolog programs often implement such stateful computations by carrying this state in predicate arguments (or, alternatively, in the internal datábase). This often causes code obfuscation, complicates code reuse, introduces dependencies on the data model, and is prone to incorrect propagation of the state information among predicate calis. To partly solve these problems, we introduce contexts as a consistent mechanism for specifying implicit arguments and its threading in clause goals. We propose a notation and an interpretation for contexts, ranging from single goals to complete programs, give an intuitive semantics, and describe a translation into standard Prolog. We also discuss a particular light-weight implementation in Ciao Prolog, and we show the usefulness of our proposals on a series of examples and applications, including code directiy using contexts, DCGs, extended DCGs, logical loops and other custom control structures.

Automatic unrestricted independent and-parallelism in logic programs

We present new algorithms which perform automatic parallelization via source-to-source transformations. The objective is to exploit goal-level, unrestricted independent andparallelism. The proposed algorithms use as targets new parallel execution primitives which are simpler and more flexible than the well-known &/2 parallel operator, which makes it possible to generate better parallel expressions by exposing more potential parallelism among the literals of a clause than is possible with &/2. The main differences between the algorithms stem from whether the order of the solutions obtained is preserved or not, and on the use of determinacy information. We briefly describe the environment where the algorithms have been implemented and the runtime platform in which the parallelized programs are executed. We also report on an evaluation of an implementation of our approach. We compare the performance obtained to that of previous annotation algorithms and show that relevant improvements can be obtained.

Inferring determinacy and mutual exclusion in logic programs using mode and type analysis.

We propose an analysis for detecting procedures and goals that are deterministic (i.e., that produce at most one solution at most once), or predicates whose clause tests are mutually exclusive (which implies that at most one of their clauses will succeed) even if they are not deterministic. The analysis takes advantage of the pruning operator in order to improve the detection of mutual exclusion and determinacy. It also supports arithmetic equations and disequations, as well as equations and disequations on terms, for which we give a complete satisfiability testing algorithm, w.r.t. available type information. We have implemented the analysis and integrated it in the CiaoPP system, which also infers automatically the mode and type information that our analysis takes as input. Experiments performed on this implementation show that the analysis is fairly accurate and efficient.

Analysis of service-oriented computing systems

La computación basada en servicios (Service-Oriented Computing, SOC) se estableció como un paradigma ampliamente aceptado para el desarollo de sistemas de software flexibles, distribuidos y adaptables, donde las composiciones de los servicios realizan las tareas más complejas o de nivel más alto, frecuentemente tareas inter-organizativas usando los servicios atómicos u otras composiciones de servicios. En tales sistemas, las propriedades de la calidad de servicio (Quality of Service, QoS), como la rapídez de procesamiento, coste, disponibilidad o seguridad, son críticas para la usabilidad de los servicios o sus composiciones en cualquier aplicación concreta. El análisis de estas propriedades se puede realizarse de una forma más precisa y rica en información si se utilizan las técnicas de análisis de programas, como el análisis de complejidad o de compartición de datos, que son capables de analizar simultáneamente tanto las estructuras de control como las de datos, dependencias y operaciones en una composición. El análisis de coste computacional para la composicion de servicios puede ayudar a una monitorización predictiva así como a una adaptación proactiva a través de una inferencia automática de coste computacional, usando los limites altos y bajos como funciones del valor o del tamaño de los mensajes de entrada. Tales funciones de coste se pueden usar para adaptación en la forma de selección de los candidatos entre los servicios que minimizan el coste total de la composición, basado en los datos reales que se pasan al servicio. Las funciones de coste también pueden ser combinadas con los parámetros extraídos empíricamente desde la infraestructura, para producir las funciones de los límites de QoS sobre los datos de entrada, cuales se pueden usar para previsar, en el momento de invocación, las violaciones de los compromisos al nivel de servicios (Service Level Agreements, SLA) potenciales or inminentes. En las composiciones críticas, una previsión continua de QoS bastante eficaz y precisa se puede basar en el modelado con restricciones de QoS desde la estructura de la composition, datos empiricos en tiempo de ejecución y (cuando estén disponibles) los resultados del análisis de complejidad. Este enfoque se puede aplicar a las orquestaciones de servicios con un control centralizado del flujo, así como a las coreografías con participantes multiples, siguiendo unas interacciones complejas que modifican su estado. El análisis del compartición de datos puede servir de apoyo para acciones de adaptación, como la paralelización, fragmentación y selección de los componentes, las cuales son basadas en dependencias funcionales y en el contenido de información en los mensajes, datos internos y las actividades de la composición, cuando se usan construcciones de control complejas, como bucles, bifurcaciones y flujos anidados. Tanto las dependencias funcionales como el contenido de información (descrito a través de algunos atributos definidos por el usuario) se pueden expresar usando una representación basada en la lógica de primer orden (claúsulas de Horn), y los resultados del análisis se pueden interpretar como modelos conceptuales basados en retículos. ABSTRACT Service-Oriented Computing (SOC) is a widely accepted paradigm for development of flexible, distributed and adaptable software systems, in which service compositions perform more complex, higher-level, often cross-organizational tasks using atomic services or other service compositions. In such systems, Quality of Service (QoS) properties, such as the performance, cost, availability or security, are critical for the usability of services and their compositions in concrete applications. Analysis of these properties can become more precise and richer in information, if it employs program analysis techniques, such as the complexity and sharing analyses, which are able to simultaneously take into account both the control and the data structures, dependencies, and operations in a composition. Computation cost analysis for service composition can support predictive monitoring and proactive adaptation by automatically inferring computation cost using the upper and lower bound functions of value or size of input messages. These cost functions can be used for adaptation by selecting service candidates that minimize total cost of the composition, based on the actual data that is passed to them. The cost functions can also be combined with the empirically collected infrastructural parameters to produce QoS bounds functions of input data that can be used to predict potential or imminent Service Level Agreement (SLA) violations at the moment of invocation. In mission-critical applications, an effective and accurate continuous QoS prediction, based on continuations, can be achieved by constraint modeling of composition QoS based on its structure, known data at runtime, and (when available) the results of complexity analysis. This approach can be applied to service orchestrations with centralized flow control, and choreographies with multiple participants with complex stateful interactions. Sharing analysis can support adaptation actions, such as parallelization, fragmentation, and component selection, which are based on functional dependencies and information content of the composition messages, internal data, and activities, in presence of complex control constructs, such as loops, branches, and sub-workflows. Both the functional dependencies and the information content (described using user-defined attributes) can be expressed using a first-order logic (Horn clause) representation, and the analysis results can be interpreted as a lattice-based conceptual models.