Assimilation of New Information by a Natural Language Understanding System

This work describes a program, called TOPLE, which uses a procedural model of the world to understand simple declarative sentences. It accepts sentences in a modified predicate calculus symbolism, and uses plausible reasoning to visualize scenes, resolve ambiguous pronoun and noun phrase references, explain events, and make conditional predications. Because it does plausible deduction, with tentative conclusions, it must contain a formalism for describing its reasons for its conclusions and what the alternatives are. When an inconsistency is detected in its world model, it uses its recorded information to resolve it, one way or another. It uses simulation techniques to make deductions about creatures motivation and behavior, assuming they are goal-directed beings like itself.

The Definition and Implementation of a Computer Programming Language Based on Constraints

The constraint paradigm is a model of computation in which values are deduced whenever possible, under the limitation that deductions be local in a certain sense. One may visualize a constraint 'program' as a network of devices connected by wires. Data values may flow along the wires, and computation is performed by the devices. A device computes using only locally available information (with a few exceptions), and places newly derived values on other, locally attached wires. In this way computed values are propagated. An advantage of the constraint paradigm (not unique to it) is that a single relationship can be used in more than one direction. The connections to a device are not labelled as inputs and outputs; a device will compute with whatever values are available, and produce as many new values as it can. General theorem provers are capable of such behavior, but tend to suffer from combinatorial explosion; it is not usually useful to derive all the possible consequences of a set of hypotheses. The constraint paradigm places a certain kind of limitation on the deduction process. The limitations imposed by the constraint paradigm are not the only one possible. It is argued, however, that they are restrictive enough to forestall combinatorial explosion in many interesting computational situations, yet permissive enough to allow useful computations in practical situations. Moreover, the paradigm is intuitive: It is easy to visualize the computational effects of these particular limitations, and the paradigm is a natural way of expressing programs for certain applications, in particular relationships arising in computer-aided design. A number of implementations of constraint-based programming languages are presented. A progression of ever more powerful languages is described, complete implementations are presented and design difficulties and alternatives are discussed. The goal approached, though not quite reached, is a complete programming system which will implicitly support the constraint paradigm to the same extent that LISP, say, supports automatic storage management.

How smokers may react to cigarette taxes and price increases in Brazil: data from a national survey

Background: Despite being the third largest tobacco producer in the world, Brazil has developed a comprehensive tobacco control policy that includes a broad restriction on both advertising and smoking in indoor public places, compulsory pictorial warning labels, and a menthol cigarette ban. However, tax and pricing policies have been developed slowly and only very recently were stronger measures implemented. This study investigated the expected responses of smokers to hypothetical price increases in Brazil.Methods: We analyzed smokers' responses to hypothetical future price increases according to sociodemographic characteristics and smoking conditions in a multistage sample of Brazilian current cigarette smokers aged >= 14 years (n = 500). Logistic regression analysis was used to examine the relationship between possible responses and different predictors.Results: in most subgroups investigated, smokers most frequently said they would react to a hypothetical price increase by taking up alternatives that might have a positive impact on health, i.e., they would try to stop smoking (52.3%) or smoke fewer cigarettes (46.8%). However, a considerable percentage responded that they would use alternatives that would reduce the effect of price increases, such as the same brand with lower cost (48.1%). After controlling for sex age group (14-19, 20-39, 40-59, and >= 60 years), schooling level (>= 9 versus <= 9 years), number of cigarettes per day (>20 versus <= 20), and stage of change for smoking cessation (precontemplation, contemplation, and preparation), lower levels of dependence were positively associated with the response I would try to stop smoking (odds ratio [OR], 2.19). Young age was associated with I would decrease the number of cigarettes (OR, 3.44). A low schooling level was strongly associated with all responses.Conclusions: Taxes and prices increases have great potential to stimulate cessation or reduction of cigarette consumption further among two important vulnerable populations of smokers in Brazil: young smokers and those of low educational level. the results from the present study also suggest that seeking illegal products may reduce the impact of increased taxes, but does not eliminate it.

Time-dependent Hyperstar algorithm for robust vehicle navigation in time-dependent stochastic road networks.

The vehicle navigation problem studied in Bell (2009) is revisited and a time-dependent reverse Hyperstar algorithm is presented. This minimises the expected time of arrival at the destination, and all intermediate nodes, where expectation is based on a pessimistic (or risk-averse) view of unknown link delays. This may also be regarded as a hyperpath version of the Chabini and Lan (2002) algorithm, which itself is a time-dependent A* algorithm. Links are assigned undelayed travel times and maximum delays, both of which are potentially functions of the time of arrival at the respective link. The driver seeks probabilities for link use that minimise his/her maximum exposure to delay on the approach to each node, leading to the determination of the pessimistic expected time of arrival. Since the context considered is vehicle navigation where the driver is not making repeated trips, the probability of link use may be interpreted as a measure of link attractiveness, so a link with a zero probability of use is unattractive while a link with a probability of use equal to one will have no attractive alternatives. A solution algorithm is presented and proven to solve the problem provided the node potentials are feasible and a FIFO condition applies for undelayed link travel times. The paper concludes with a numerical example.

Ruolo e limiti del contratto negli assetti familiari in funzione successoria

The Article 457 c.c. expressly excludes the contract by the sources of the succession. Moreover, the article 458 c.c., apart from the initial brief aside dedicated to the institute of the family pact, agrees nullity of the agreements with whom someone decides its own succession as well as those with which the future successor could decide about his rights or renounce to them about a succession not yet open. However, for a long time, the Italian doctrine wonders about the role of the contract within the succession law. It feels, in fact, the need to expand the private autonomy within the inheritance that is excessively sacrificed by the prohibition of succession agreements and by the norms for the protection of legitimate heirs. The reasons which led the legal science to these conclusions are based on different events, both social and economic, that push the interpreter to a modernization of dogmatic categories with which he can represent the succession mortis causa. In addiction, it is necessary to underline the crisis of the agreements mortis causa due to this economical and social events: as a matter of fact, the will, as the only way to give the assets post mortem, revealed itself incomplete and extremely severe compared to the new social needs. In fact, increasingly the way to give the assets happens out of the inheritance and despite to the institutions designed by the law. For these reasons, in order to adapt the system of succession to modern economic and social needs, the doctrine has identified, within the system, institutions of a contractual nature in order to better achieve the interests of private, obviating the limits assigned to the shop last will. And recently, in this context, our legislator has introduced the institution of the family pact (art. 768 bis et seq. c.c.), that is the agreement through “the entrepreneur transfers, in whole or in part , the company, and the holder of equity investments transfers, in whole or in part, its shares, to one or more descendants". While, however, part of the doctrine encourages the provision of tools that enable a person to have in advance of his succession, on the other hand there are those who promote the centrality of the will within our legal system and calls for the revitalization in respect of its vast potential is not always adequately exploited. This research aims to verify whether the contract can find importance within the phenomenon of succession for the inter vivos transfer of family assets and if the same has the characteristics to be considered a working alternative to the will. In the present work will be analyzed, in addition, some of the institutions that the doctrine has considered alternatives to the will and particularly the institution of the family pact. The survey will also be directed to the limits that the private autonomy and the legislator met in the use of the contractual instrument, limits that are mostly originated by the rules and principles of the law of succession.

Blair's Africa: The Politics of Securitization and Fear

Abrahamsen, R. (2005). Blair's Africa: The Politics of Securitization and Fear. Alternatives: Global, Local, Political. 30(1), pp.55-80 RAE2008

Analyzing the competitive advantages of Saudi Arabia with Porter's model

Jasimuddin, Sajjad, 'Analyzing the competitive advantages of Saudi Arabia with Porter's model', Journal of Business and Industrial Marketing (2001) 16(1) pp.59-68 RAE2008

Determinismo o libertad. Consumo y NTICs en la escuela del siglo XXI

Entre las peculiaridades en nuestra sociedad occidental actual figura la presencia invasiva de la nueva cultura mediática del consumo y los cambios que esta ha provocado en el entorno de cada sujeto. En la medida en que niños y adolescentes pasan menos tiempo con su familia y se exponen más a los medios, éstos adquieren mayor protagonismo en la construcción de su universo cultural convirtiéndose en una fuente de heteronomía y perjudicando a las instituciones educativas. Afortunada o desafortunadamente, este fenómeno evoluciona de forma inmediata y cualquier estudio queda obsoleto en un periodo de tiempo muy reducido. Sin embargo, es necesario realizar trabajos que permitan conocer la sociedad del momento, sus transformaciones y sus nuevas formas de vida. Para ello y con el objetivo de encontrar alternativas que impidan la disociación del proceso de socialización, se ha realizado una pequeña investigación teórica sobre los diferentes agentes socializadores y su cambio de rol así como un estudio de caso en busca de evidencias empíricas que han permitido extraer conclusiones al respecto.

Nanomedicinas para o Cancro

Projeto de Pós-Graduação/Dissertação apresentado à Universidade Fernando Pessoa como parte dos requisitos para obtenção do grau de Mestre em Ciências Farmacêuticas

Infeções em Cateteres de Hemodialisados

Projeto de Pós-Graduação/Dissertação apresentado à Universidade Fernando Pessoa como parte dos requisitos para obtenção do grau de Mestre em Ciências Farmacêuticas

Matriz de colagénio suíno no recobrimento radicular

Projeto de Pós-Graduação/Dissertação apresentado à Universidade Fernando Pessoa como parte dos requisitos para obtenção do grau de Mestre em Medicina Dentária

Timeliness via Speculation for Real-Time Databases

Various concurrency control algorithms differ in the time when conflicts are detected, and in the way they are resolved. In that respect, the Pessimistic and Optimistic Concurrency Control (PCC and OCC) alternatives represent two extremes. PCC locking protocols detect conflicts as soon as they occur and resolve them using blocking. OCC protocols detect conflicts at transaction commit time and resolve them using rollbacks (restarts). For real-time databases, blockages and rollbacks are hazards that increase the likelihood of transactions missing their deadlines. We propose a Speculative Concurrency Control (SCC) technique that minimizes the impact of blockages and rollbacks. SCC relies on the use of added system resources to speculate on potential serialization orders and to ensure that if such serialization orders materialize, the hazards of blockages and roll-backs are minimized. We present a number of SCC-based algorithms that differ in the level of speculation they introduce, and the amount of system resources (mainly memory) they require. We show the performance gains (in terms of number of satisfied timing constraints) to be expected when a representative SCC algorithm (SCC-2S) is adopted.

Learning Euclidean Embeddings for Indexing and Classification

BoostMap is a recently proposed method for efficient approximate nearest neighbor retrieval in arbitrary non-Euclidean spaces with computationally expensive and possibly non-metric distance measures. Database and query objects are embedded into a Euclidean space, in which similarities can be rapidly measured using a weighted Manhattan distance. The key idea is formulating embedding construction as a machine learning task, where AdaBoost is used to combine simple, 1D embeddings into a multidimensional embedding that preserves a large amount of the proximity structure of the original space. This paper demonstrates that, using the machine learning formulation of BoostMap, we can optimize embeddings for indexing and classification, in ways that are not possible with existing alternatives for constructive embeddings, and without additional costs in retrieval time. First, we show how to construct embeddings that are query-sensitive, in the sense that they yield a different distance measure for different queries, so as to improve nearest neighbor retrieval accuracy for each query. Second, we show how to optimize embeddings for nearest neighbor classification tasks, by tuning them to approximate a parameter space distance measure, instead of the original feature-based distance measure.

Accelerating Internet Streaming Media Delivery Using Network-Aware Partial Caching

Internet streaming applications are adversely affected by network conditions such as high packet loss rates and long delays. This paper aims at mitigating such effects by leveraging the availability of client-side caching proxies. We present a novel caching architecture (and associated cache management algorithms) that turn edge caches into accelerators of streaming media delivery. A salient feature of our caching algorithms is that they allow partial caching of streaming media objects and joint delivery of content from caches and origin servers. The caching algorithms we propose are both network-aware and stream-aware; they take into account the popularity of streaming media objects, their bit-rate requirements, and the available bandwidth between clients and servers. Using realistic models of Internet bandwidth (derived from proxy cache logs and measured over real Internet paths), we have conducted extensive simulations to evaluate the performance of various cache management alternatives. Our experiments demonstrate that network-aware caching algorithms can significantly reduce service delay and improve overall stream quality. Also, our experiments show that partial caching is particularly effective when bandwidth variability is not very high.

Simple Load Balancing for Distributed Hash Tables

Distributed hash tables have recently become a useful building block for a variety of distributed applications. However, current schemes based upon consistent hashing require both considerable implementation complexity and substantial storage overhead to achieve desired load balancing goals. We argue in this paper that these goals can b e achieved more simply and more cost-effectively. First, we suggest the direct application of the "power of two choices" paradigm, whereby an item is stored at the less loaded of two (or more) random alternatives. We then consider how associating a small constant number of hash values with a key can naturally b e extended to support other load balancing methods, including load-stealing or load-shedding schemes, as well as providing natural fault-tolerance mechanisms.