Tradução, adaptação transcultural e validação do "Body Image Avoidance Questionnaire (BIAQ)" e do "Body Checking Questionnaire (BCQ)" para lingua portuguesa no Brasil

Universidade Estadual de Campinas . Faculdade de Educação Física

Is your vision consistent? A method for checking, based on scenario concepts

Common sense tells us that the future is an essential element in any strategy. In addition, there is a good deal of literature on scenario planning, which is an important tool in considering the future in terms of strategy. However, in many organizations there is serious resistance to the development of scenarios, and they are not broadly implemented by companies. But even organizations that do not rely heavily on the development of scenarios do, in fact, construct visions to guide their strategies. But it might be asked, what happens when this vision is not consistent with the future? To address this problem, the present article proposes a method for checking the content and consistency of an organization`s vision of the future, no matter how it was conceived. The proposed method is grounded on theoretical concepts from the field of future studies, which are described in this article. This study was motivated by the search for developing new ways of improving and using scenario techniques as a method for making strategic decisions. The method was then tested on a company in the field of information technology in order to check its operational feasibility. The test showed that the proposed method is, in fact, operationally feasible and was capable of analyzing the vision of the company being studied, indicating both its shortcomings and points of inconsistency. (C) 2007 Elsevier Ltd. All rights reserved.

Type checking cryptography implementations

Cryptographic software development is a challenging eld: high performance must be achieved, while ensuring correctness and com- pliance with low-level security policies. CAO is a domain speci c language designed to assist development of cryptographic software. An important feature of this language is the design of a novel type system introducing native types such as prede ned sized vectors, matrices and bit strings, residue classes modulo an integer, nite elds and nite eld extensions, allowing for extensive static validation of source code. We present the formalisation, validation and implementation of this type system

A framework for semantic checking of information systems

Dissertação para obtenção do Grau de Mestre em Engenharia Electrotécnica e de Computadores

Derivation and consistency checking of models in early software product line engineering

Dissertação para obtenção do Grau de Doutor em Engenharia Informática

Sistema de votació electrònica sobre corbes el·líptques amb mescla de vots mitjançant Random Group Full Checking

L'objectiu del treball és dissenyar i implementar un sistema de simulació de votació electrònica, emprant una adaptació sobre corbes el·líptiques del criptosistema ElGamal, per tal d'estudiar-ne la viabilitat, centrant l'atenció en temes de seguretat, especialment en el procés de mescla de vots per tal de desvincular un vot de la persona que l'ha emès.

Evaluation of Muscardinus avellanarius population density by nest box and by trap checking

Population densities of marked common dormice Muscardinus avellanarius are generally based on nest box checks. As dormice also use natural cavities and leaf nests, we tried to answer the question "what proportion of the population cannot be monitored by nest boy checks", using parallel trapping sessions. We selected a forest of 1.7ha where a 5-year nest box survey revealed an annual mean of 3.4 ± 1.4 dormice per check. The trap design (permanent grid of 77 hanging platforms) was developed in June. During July and August the traps were set every second week (4 sessions of two nights = 8 nights) resulting in a total of 75 captures with mean of 9.4 dormice per night and the presence of 16 different individuals. The grid of 60 nest boxes was checked weekly (8 times) which allowed the recapture of 19 dormice with a mean of 2.4 dormice, per control day and the presence of 6 different individuals. Population density estimated by calendar of capture and the minimal number of dormice alive methods gave for nest-box checks a value of 2.4 animals/ha and the trap checks 6.6 animals/ha with the conclusion that 63% of the population were not being monitored by nest box checks.

Transferring control demands across incidental learning tasks - Stronger sequence usage in serial reaction task after shortcut option in letter string checking

After incidentally learning about a hidden regularity, participants can either continue to solve the task as instructed or, alternatively, apply a shortcut. Past research suggests that the amount of conflict implied by adopting a shortcut seems to bias the decision for vs. against continuing instruction-coherent task processing. We explored whether this decision might transfer from one incidental learning task to the next. Theories that conceptualize strategy change in incidental learning as a learning-plus-decision phenomenon suggest that high demands to adhere to instruction-coherent task processing in Task 1 will impede shortcut usage in Task 2, whereas low control demands will foster it. We sequentially applied two established incidental learning tasks differing in stimuli, responses and hidden regularity (the alphabet verification task followed by the serial reaction task, SRT). While some participants experienced a complete redundancy in the task material of the alphabet verification task (low demands to adhere to instructions), for others the redundancy was only partial. Thus, shortcut application would have led to errors (high demands to follow instructions). The low control demand condition showed the strongest usage of the fixed and repeating sequence of responses in the SRT. The transfer results are in line with the learning-plus-decision view of strategy change in incidental learning, rather than with resource theories of self-control.

Scheduling dynamic dataflow graphs with model checking

With the shift towards many-core computer architectures, dataflow programming has been proposed as one potential solution for producing software that scales to a varying number of processor cores. Programming for parallel architectures is considered difficult as the current popular programming languages are inherently sequential and introducing parallelism is typically up to the programmer. Dataflow, however, is inherently parallel, describing an application as a directed graph, where nodes represent calculations and edges represent a data dependency in form of a queue. These queues are the only allowed communication between the nodes, making the dependencies between the nodes explicit and thereby also the parallelism. Once a node have the su cient inputs available, the node can, independently of any other node, perform calculations, consume inputs, and produce outputs. Data ow models have existed for several decades and have become popular for describing signal processing applications as the graph representation is a very natural representation within this eld. Digital lters are typically described with boxes and arrows also in textbooks. Data ow is also becoming more interesting in other domains, and in principle, any application working on an information stream ts the dataflow paradigm. Such applications are, among others, network protocols, cryptography, and multimedia applications. As an example, the MPEG group standardized a dataflow language called RVC-CAL to be use within reconfigurable video coding. Describing a video coder as a data ow network instead of with conventional programming languages, makes the coder more readable as it describes how the video dataflows through the different coding tools. While dataflow provides an intuitive representation for many applications, it also introduces some new problems that need to be solved in order for data ow to be more widely used. The explicit parallelism of a dataflow program is descriptive and enables an improved utilization of available processing units, however, the independent nodes also implies that some kind of scheduling is required. The need for efficient scheduling becomes even more evident when the number of nodes is larger than the number of processing units and several nodes are running concurrently on one processor core. There exist several data ow models of computation, with different trade-offs between expressiveness and analyzability. These vary from rather restricted but statically schedulable, with minimal scheduling overhead, to dynamic where each ring requires a ring rule to evaluated. The model used in this work, namely RVC-CAL, is a very expressive language, and in the general case it requires dynamic scheduling, however, the strong encapsulation of dataflow nodes enables analysis and the scheduling overhead can be reduced by using quasi-static, or piecewise static, scheduling techniques. The scheduling problem is concerned with nding the few scheduling decisions that must be run-time, while most decisions are pre-calculated. The result is then an, as small as possible, set of static schedules that are dynamically scheduled. To identify these dynamic decisions and to find the concrete schedules, this thesis shows how quasi-static scheduling can be represented as a model checking problem. This involves identifying the relevant information to generate a minimal but complete model to be used for model checking. The model must describe everything that may affect scheduling of the application while omitting everything else in order to avoid state space explosion. This kind of simplification is necessary to make the state space analysis feasible. For the model checker to nd the actual schedules, a set of scheduling strategies are de ned which are able to produce quasi-static schedulers for a wide range of applications. The results of this work show that actor composition with quasi-static scheduling can be used to transform data ow programs to t many different computer architecture with different type and number of cores. This in turn, enables dataflow to provide a more platform independent representation as one application can be fitted to a specific processor architecture without changing the actual program representation. Instead, the program representation is in the context of design space exploration optimized by the development tools to fit the target platform. This work focuses on representing the dataflow scheduling problem as a model checking problem and is implemented as part of a compiler infrastructure. The thesis also presents experimental results as evidence of the usefulness of the approach.

Checking the Boat

Before a race the crew and the coach must check the boat to make sure all the nuts are fastened and all the seats and foots stops are in the right place. Here is Tony Biernacki watching over as Brock's first female crew doing just that in 1967.

Promoting while checking self-interest : a conflict-based governance approach to rebalance corporate power disequilibria in Canada and the United States

La délégation du pouvoir de gestion aux administrateurs et aux gestionnaires, une caractéristique intrinsèque à la gestion efficace de grandes entreprises dans un contexte de capitalisme, confère une grande discrétion à l’équipe de direction. Cette discrétion, si elle n’est pas surveillée, peut mener à des comportements opportunistes envers la corporation, les actionnaires et les autres fournisseurs de capital qui n’ont pas de pouvoir de gestion. Les conflits entre ces deux classes d’agents peuvent émerger à la fois de décisions de gouvernance générale ou de transactions particulières (ie. offre publique d’achat). Dans les cas extrêmes, ces conflits peuvent mener à la faillite de la firme. Dans les cas plus typiques, ils mènent l’extraction de bénéfices privés pour les administrateurs et gestionnaires, l’expropriation des actionnaires, et des réductions de valeur pour la firme. Nous prenons le point de vue d’un petit actionnaire minoritaire pour explorer les méchanismes de gouvernance disponibles au Canada et aux États‐Unis. Après une synthèse dans la Partie 1 des théories sous‐jacentes à l’étude du pouvoir dans la corporation (séparation de la propriété et du contrôle et les conflits d’agence), nous concentrons notre analyse dans la Partie 2 sur les différents types de méchanismes (1) de gouvernance interne, (2) juridiques et (3) marchands, qui confèrent du pouvoir aux deux classes d’agents. Nous examinons comment les intérêts de ces deux classes peuvent être réalignés afin de prévenir et résoudre les conflits au sein de la firme. La Partie 3 explore un équilibre dynamique de pouvoir corporatif qui cherche à minimiser le potentiel d’opportunisme toute en préservant une quantité de discrétion suffisante pour la gestion efficace de la firme. Nous analysons des moyens pour renforcer les protections des actionnaires minoritaires et proposons un survol des pistes de réforme possibles.

Checking for invalid data in Excel

A video of how to check for invalid data where the data has already been entered into Excel