Investigation project: Representations about the professional role of recently graduated from the psychology career, state University of La Plata : Its relation with job insertion and performance

In this paper we present a research that took place between 2010 and 2012 included in an investigation scholarship awarded by the State University of la Plata. It is about the problem with the transition between college and professional work. It is a part of the produced studies on the importance of social representations as factors that impact on the performance of specific activities. In this case it's about finding out the relations given among the representations about graduated professional role of the Psychology career and its job insertion and performance. The theoretical framework corresponds to Social Psychology and Guidance theories. Methodologically this is an exploratory and descriptive study, based on the 'triangulation' conception, of multiple type, that allows combining in the same investigation, different strategies, theoretical perspectives and sources; however qualitative techniques were prioritized to analyze data. Finally there are some considerations about the social representations concerning to the professional performance, mainly in the clinical field associated to education, and also to the problems of both situations over other fields

The development of professor's professional knowledge in Psychology

This work belongs to the Project "Teaching and learning Psychology: a study of the educational practice in professors and beginners". It is part of an investigation program developed in the context of the subject "Didactic and Practical Planning of Psychology teaching" in which we have been working since 1998. This subject is also considered as the final stage of the formative itinerary for Psychology s professors. The reached results show the incidence that the beliefs and professors' representations have in the teaching processes. By getting into the studies centered in the educational knowledge we guide the inquiry around the development of the professor's professional knowledge and particularly the development of their formation. Our proposal contemplates a formation device which incorporates the observation, reflection, evaluation and self-evaluation of the practice in order to facilitate the reconstruction, significance and re-significance of the teaching and learning processes by giving relevance to the development of the teacher professional knowledge. The analysis of teaching practices process reveals that the mediations that cross the knowledge in the being taught instances are constituted in reflections axes. This involves the future professor's relationship with the knowledge and their projection in the construction of the professional identity.

Investigation project: Representations about the professional role of recently graduated from the psychology career, state University of La Plata : Its relation with job insertion and performance

In this paper we present a research that took place between 2010 and 2012 included in an investigation scholarship awarded by the State University of la Plata. It is about the problem with the transition between college and professional work. It is a part of the produced studies on the importance of social representations as factors that impact on the performance of specific activities. In this case it's about finding out the relations given among the representations about graduated professional role of the Psychology career and its job insertion and performance. The theoretical framework corresponds to Social Psychology and Guidance theories. Methodologically this is an exploratory and descriptive study, based on the 'triangulation' conception, of multiple type, that allows combining in the same investigation, different strategies, theoretical perspectives and sources; however qualitative techniques were prioritized to analyze data. Finally there are some considerations about the social representations concerning to the professional performance, mainly in the clinical field associated to education, and also to the problems of both situations over other fields

Tratamiento de resultados en diseños cualitativos : La aplicación del Análisis Descriptivo

Este artículo presenta el Análisis Descriptivo como una estrategia del tratamiento de la información durante el proceso de investigación y su posible uso en estudios de diseño cualitativo. Muchas investigaciones en Ciencias Sociales y Humanas no contemplan la importancia de explicitar los soportes teórico-metodológicos de las inferencias explicativas o interpretación/es a la/s que se arriba, es decir, cómo es que se ha pasado del referente seleccionado (unidad de referencia), al argumento (modelo explicativo o interpretativo) con el que se lo pretende representar. De este modo, se suele ignorar el problema de la representación del referente en un dato tratable y la necesaria transformación del lenguaje natural (LN) en lenguaje descriptivo (LD). Se desarrollan dos ejemplos del campo de la Etología y de la Psicología, aplicando la estrategia metodológica del Análisis Descriptivo. En ellos se demuestra que la codificación que permite realizar este método toma en cuenta por un lado, la base de conocimientos e informaciones relativas a un dominio disciplinar particular y, por otro, permite evidenciar las inferencias seguidas en el razonamiento y las reglas de interpretación utilizadas para arribar a nuevos conocimientos

ISIS and the climate of fear -- a political-psychology perspective

2014年6月のイスラーム国（以下ISIS）のメディアへの華々しい登場以降、米国政治を規定する主要な要因の1つとして「恐怖心」がかつてない程の重要性を帯びてきている。本稿では政治心理学的な分析手法を援用しつつ、ISISが何よりも「テロ攻撃集団」としていかに「恐怖心」を醸成するための洗練された戦略を実践しているか、またそれが統計的には圧倒的に中東現地のムスリム一般住民を標的にしており、本来的にS.ハンティントン的な「西欧文明に敵対するイスラーム」という問題を内包していないにもかかわらず、米国エスタブリッシュメントによる他者への「恐怖心」によって如何に本質が曲解されて「ムスリム排斥」のような情緒的な政治主張に向かわせているかの契機を分析する。筆者は論稿中でマキャベリから以降最近に至るまでの政治学関係の議論を渉猟しつつ、「恐怖心」をめぐる問題が「テロル」との関係においていかに扱われてきたかを再検討し、西欧のメディアにおける「テロ集団」としてのISISの登場が政治学的な観点から提起している問題の新しさと古さを跡付けようとする。同時に現在の米国社会を覆っているイスラモフォビアの情緒的反応についてもその淵源が古くかつ政治的に根深い問題から発していることを指摘している。本論稿の分析は直接的にはISISによって政治的な雰囲気が大きく変容するなかで大統領選挙の年を迎えている米国の国内政治を扱うものであるが、ここでの議論は「アラブの春」以降のシリア危機に発する難民問題に直面している欧州（EU）や、2015年11月のパリのテロ多発事件以降緊迫した雰囲気に覆われているフランスの政治状況にも通底しており、その意味では偶々2014年にISIS によって惹起されたとはいえそれ自体が自律的な展開の契機を内包する現代社会の政治的な抑圧的システムのグローバルな拡大と拡散に警鐘を鳴らそうとするものである。

Desing and Validation of a Light Inference System to Support Embedded Context Reasoning

Embedded context management in resource-constrained devices (e.g. mobile phones, autonomous sensors or smart objects) imposes special requirements in terms of lightness for data modelling and reasoning. In this paper, we explore the state-of-the-art on data representation and reasoning tools for embedded mobile reasoning and propose a light inference system (LIS) aiming at simplifying embedded inference processes offering a set of functionalities to avoid redundancy in context management operations. The system is part of a service-oriented mobile software framework, conceived to facilitate the creation of context-aware applications—it decouples sensor data acquisition and context processing from the application logic. LIS, composed of several modules, encapsulates existing lightweight tools for ontology data management and rule-based reasoning, and it is ready to run on Java-enabled handheld devices. Data management and reasoning processes are designed to handle a general ontology that enables communication among framework components. Both the applications running on top of the framework and the framework components themselves can configure the rule and query sets in order to retrieve the information they need from LIS. In order to test LIS features in a real application scenario, an ‘Activity Monitor’ has been designed and implemented: a personal health-persuasive application that provides feedback on the user’s lifestyle, combining data from physical and virtual sensors. In this case of use, LIS is used to timely evaluate the user’s activity level, to decide on the convenience of triggering notifications and to determine the best interface or channel to deliver these context-aware alerts.d

Multi-agent Architecture for Heterogeneous Reasoning under Uncertainty Combining MSBN and Ontologies in Distributed Network Diagnosis

This article proposes a MAS architecture for network diagnosis under uncertainty. Network diagnosis is divided into two inference processes: hypothesis generation and hypothesis confirmation. The first process is distributed among several agents based on a MSBN, while the second one is carried out by agents using semantic reasoning. A diagnosis ontology has been defined in order to combine both inference processes. To drive the deliberation process, dynamic data about the influence of observations are taken during diagnosis process. In order to achieve quick and reliable diagnoses, this influence is used to choose the best action to perform. This approach has been evaluated in a P2P video streaming scenario. Computational and time improvements are highlight as conclusions.

Distributed Fault Diagnosis Using Bayesian Reasoning in MAGNETO

Many of the emerging telecom services make use of Outer Edge Networks, in particular Home Area Networks. The configuration and maintenance of such services may not be under full control of the telecom operator which still needs to guarantee the service quality experienced by the consumer. Diagnosing service faults in these scenarios becomes especially difficult since there may be not full visibility between different domains. This paper describes the fault diagnosis solution developed in the MAGNETO project, based on the application of Bayesian Inference to deal with the uncertainty. It also takes advantage of a distributed framework to deploy diagnosis components in the different domains and network elements involved, spanning both the telecom operator and the Outer Edge networks. In addition, MAGNETO features self-learning capabilities to automatically improve diagnosis knowledge over time and a partition mechanism that allows breaking down the overall diagnosis knowledge into smaller subsets. The MAGNETO solution has been prototyped and adapted to a particular outer edge scenario, and has been further validated on a real testbed. Evaluation of the results shows the potential of our approach to deal with fault management of outer edge networks.

Towards Understanding Reasoning Complexity in Practice

Although the computational complexity of the logic underlying the standard OWL 2 for the Web Ontology Language (OWL) appears discouraging for real applications, several contributions have shown that reasoning with OWL ontologies is feasible in practice. It turns out that reasoning in practice is often far less complex than is suggested by the established theoretical complexity bound, which reflects the worstcase scenario. State-of-the reasoners like FACT++, HERMIT, PELLET and RACER have demonstrated that, even with fairly expressive fragments of OWL 2, acceptable performances can be achieved. However, it is still not well understood why reasoning is feasible in practice and it is rather unclear how to study this problem. In this paper, we suggest first steps that in our opinion could lead to a better understanding of practical complexity. We also provide and discuss some initial empirical results with HERMIT on prominent ontologies

Design and Validation of a Light Inference System to Support Embedded Context Reasoning

Embedded context management in resource-constrained devices (e.g. mobile phones, autonomous sensors or smart objects) imposes special requirements in terms of lightness for data modelling and reasoning. In this paper, we explore the state-of-the-art on data representation and reasoning tools for embedded mobile reasoning and propose a light inference system (LIS) aiming at simplifying embedded inference processes offering a set of functionalities to avoid redundancy in context management operations. The system is part of a service-oriented mobile software framework, conceived to facilitate the creation of context-aware applications?it decouples sensor data acquisition and context processing from the application logic. LIS, composed of several modules, encapsulates existing lightweight tools for ontology data management and rule-based reasoning, and it is ready to run on Java-enabled handheld devices. Data management and reasoning processes are designed to handle a general ontology that enables communication among framework components. Both the applications running on top of the framework and the framework components themselves can configure the rule and query sets in order to retrieve the information they need from LIS. In order to test LIS features in a real application scenario, an ?Activity Monitor? has been designed and implemented: a personal health-persuasive application that provides feedback on the user?s lifestyle, combining data from physical and virtual sensors. In this case of use, LIS is used to timely evaluate the user?s activity level, to decide on the convenience of triggering notifications and to determine the best interface or channel to deliver these context-aware alerts.

Probabilistic reasoning with a bayesian DNA device based on strand displacement

We present a computing model based on the DNA strand displacement technique which performs Bayesian inference. The model will take single stranded DNA as input data, representing the presence or absence of a specific molecular signal (evidence). The program logic encodes the prior probability of a disease and the conditional probability of a signal given the disease playing with a set of different DNA complexes and their ratios. When the input and program molecules interact, they release a different pair of single stranded DNA species whose relative proportion represents the application of Bayes? Law: the conditional probability of the disease given the signal. The models presented in this paper can empower the application of probabilistic reasoning in genetic diagnosis in vitro.

An attitude-based reasoning strategy to enhance interaction with augmented objects

This paper describes a mobile-based system to interact with objects in smart spaces, where the offer of resources may be extensive. The underlying idea is to use the augmentation capabilities of the mobile device to enable it as user-object mediator. In particular, the paper details how to build an attitude-based reasoning strategy that facilitates user-object interaction and resource filtering. The strategy prioritizes the available resources depending on the spatial history of the user, his real-time location and orientation and, finally, his active touch and focus interactions with the virtual overlay. The proposed reasoning method has been partially validated through a prototype that handles 2D and 3D visualization interfaces. This framework makes possible to develop in practice the IoT paradigm, augmenting the objects without physically modifying them.

A multi-agent system with distributed bayesian reasoning for network fault diagnosis

In this paper, an innovative approach to perform distributed Bayesian inference using a multi-agent architecture is presented. The final goal is dealing with uncertainty in network diagnosis, but the solution can be of applied in other fields. The validation testbed has been a P2P streaming video service. An assessment of the work is presented, in order to show its advantages when it is compared with traditional manual processes and other previous systems.

Approximate Relational Reasoning for Probabilistic Programs

La seguridad verificada es una metodología para demostrar propiedades de seguridad de los sistemas informáticos que se destaca por las altas garantías de corrección que provee. Los sistemas informáticos se modelan como programas probabilísticos y para probar que verifican una determinada propiedad de seguridad se utilizan técnicas rigurosas basadas en modelos matemáticos de los programas. En particular, la seguridad verificada promueve el uso de demostradores de teoremas interactivos o automáticos para construir demostraciones completamente formales cuya corrección es certificada mecánicamente (por ordenador). La seguridad verificada demostró ser una técnica muy efectiva para razonar sobre diversas nociones de seguridad en el área de criptografía. Sin embargo, no ha podido cubrir un importante conjunto de nociones de seguridad “aproximada”. La característica distintiva de estas nociones de seguridad es que se expresan como una condición de “similitud” entre las distribuciones de salida de dos programas probabilísticos y esta similitud se cuantifica usando alguna noción de distancia entre distribuciones de probabilidad. Este conjunto incluye destacadas nociones de seguridad de diversas áreas como la minería de datos privados, el análisis de flujo de información y la criptografía. Ejemplos representativos de estas nociones de seguridad son la indiferenciabilidad, que permite reemplazar un componente idealizado de un sistema por una implementación concreta (sin alterar significativamente sus propiedades de seguridad), o la privacidad diferencial, una noción de privacidad que ha recibido mucha atención en los últimos años y tiene como objetivo evitar la publicación datos confidenciales en la minería de datos. La falta de técnicas rigurosas que permitan verificar formalmente este tipo de propiedades constituye un notable problema abierto que tiene que ser abordado. En esta tesis introducimos varias lógicas de programa quantitativas para razonar sobre esta clase de propiedades de seguridad. Nuestra principal contribución teórica es una versión quantitativa de una lógica de Hoare relacional para programas probabilísticos. Las pruebas de correción de estas lógicas son completamente formalizadas en el asistente de pruebas Coq. Desarrollamos, además, una herramienta para razonar sobre propiedades de programas a través de estas lógicas extendiendo CertiCrypt, un framework para verificar pruebas de criptografía en Coq. Confirmamos la efectividad y aplicabilidad de nuestra metodología construyendo pruebas certificadas por ordendor de varios sistemas cuyo análisis estaba fuera del alcance de la seguridad verificada. Esto incluye, entre otros, una meta-construcción para diseñar funciones de hash “seguras” sobre curvas elípticas y algoritmos diferencialmente privados para varios problemas de optimización combinatoria de la literatura reciente. ABSTRACT The verified security methodology is an emerging approach to build high assurance proofs about security properties of computer systems. Computer systems are modeled as probabilistic programs and one relies on rigorous program semantics techniques to prove that they comply with a given security goal. In particular, it advocates the use of interactive theorem provers or automated provers to build fully formal machine-checked versions of these security proofs. The verified security methodology has proved successful in modeling and reasoning about several standard security notions in the area of cryptography. However, it has fallen short of covering an important class of approximate, quantitative security notions. The distinguishing characteristic of this class of security notions is that they are stated as a “similarity” condition between the output distributions of two probabilistic programs, and this similarity is quantified using some notion of distance between probability distributions. This class comprises prominent security notions from multiple areas such as private data analysis, information flow analysis and cryptography. These include, for instance, indifferentiability, which enables securely replacing an idealized component of system with a concrete implementation, and differential privacy, a notion of privacy-preserving data mining that has received a great deal of attention in the last few years. The lack of rigorous techniques for verifying these properties is thus an important problem that needs to be addressed. In this dissertation we introduce several quantitative program logics to reason about this class of security notions. Our main theoretical contribution is, in particular, a quantitative variant of a full-fledged relational Hoare logic for probabilistic programs. The soundness of these logics is fully formalized in the Coq proof-assistant and tool support is also available through an extension of CertiCrypt, a framework to verify cryptographic proofs in Coq. We validate the applicability of our approach by building fully machine-checked proofs for several systems that were out of the reach of the verified security methodology. These comprise, among others, a construction to build “safe” hash functions into elliptic curves and differentially private algorithms for several combinatorial optimization problems from the recent literature.

A formalism and method for representing and reasoning with process models authored by subject matter experts

Enabling Subject Matter Experts (SMEs) to formulate knowledge without the intervention of Knowledge Engineers (KEs) requires providing SMEs with methods and tools that abstract the underlying knowledge representation and allow them to focus on modeling activities. Bridging the gap between SME-authored models and their representation is challenging, especially in the case of complex knowledge types like processes, where aspects like frame management, data, and control flow need to be addressed. In this paper, we describe how SME-authored process models can be provided with an operational semantics and grounded in a knowledge representation language like F-logic in order to support process-related reasoning. The main results of this work include a formalism for process representation and a mechanism for automatically translating process diagrams into executable code following such formalism. From all the process models authored by SMEs during evaluation 82% were well-formed, all of which executed correctly. Additionally, the two optimizations applied to the code generation mechanism produced a performance improvement at reasoning time of 25% and 30% with respect to the base case, respectively.