计算机环境下的呈现方式对学生样例学习的影响

This study designed tow experiments to explore the effect of two presentation forms(liner presentation and concept-map navigation presentation)on the student's learning process. Using the method of protocal analysis and the learning path records of these students, the author of this paper further analysed the information-processing process of these students. The main results showed as follows: (1) In the initial study phase, the main effects of both the presentation form and the learner type were obvious, and the interaction effect of these two variables was also obvious. Contrasting with the liner presentation form, the concept map navigation form interfered with the learning process of the student, especially the learning-disabled students. (2) There was a significant difference between excellent students and learning-disabled learning-disabled on self explanations amount. Excellent students produced more self- explanations than learning-disabled students, especially on two phases of learning from the the example and the conclusion. (3) Under the same learning path, the main effect of the learner type variable was obvious, the main effect of the presentation form and interaction effect of these two variables weren't obvious. But the liner presentation grouped still acquired a better result than the concept-map navigation presentation groupe.

A decentralized batch-based group key management potocol for mobile Internet of Thngs (DBGK).

It is anticipated that constrained devices in the Internet of Things (IoT) will often operate in groups to achieve collective monitoring or management tasks. For sensitive and mission-critical sensing tasks, securing multicast applications is therefore highly desirable. To secure group communications, several group key management protocols have been introduced. However, the majority of the proposed solutions are not adapted to the IoT and its strong processing, storage, and energy constraints. In this context, we introduce a novel decentralized and batch-based group key management protocol to secure multicast communications. Our protocol is simple and it reduces the rekeying overhead triggered by membership changes in dynamic and mobile groups and guarantees both backward and forward secrecy. To assess our protocol, we conduct a detailed analysis with respect to its communcation and storage costs. This analysis is validated through simulation to highlight energy gains. The obtained results show that our protocol outperforms its peers with respect to keying overhead and the mobility of members.

Sole plate fixing details for modern methods of timber construction.

In order to resist lateral loads, modern methods of timber construction are reliant on the in-plane shear strength of the walls orientated parallel to the applied action. In closed panel systems, the shear stresses are transferred to the foundations by the sole plate through the sheathing board, which is usually mechanically jointed to the timber frame. Since closed panels are delivered to site as single units, access to the internal bottom rail is rather restricted and novel, efficient solutions to secure the panel to the substrate are required. Sole plate fixing components for open and closed panel systems were tested in isolation and combination in order to validate a simplistic version of the weakest link theory. As a result, findings were embedded into a software database with a direct link to a previously developed sole plate and racking design application. This integrated process facilitates the structural optimization of the sole plate detail.

John Austin, H. L. A. Hart... Oh, And W. Jethro Brown!

Ireland, R. W., Cambrian Law Review, 34 pp.57-69 RAE2008

The French Second Empire: an anatomy of political power

Price, Roger, The French Second Empire: an anatomy of political power (Cambridge: Cambridge University Press, 2001), pp.x+507 RAE2008

Estudo do processo de difusão de gases em carvões com base em isotérmicas de Langmuir

Tese de Doutoramento apresentada à Universidade Fernando Pessoa como parte dos requisitos para obtenção do grau de Doutror em Ciências da Terra.

Uso de equipamento auxiliar no preparo dentário para próteses

Trabalho apresentado à Universidade Fernando Pessoa como parte dos requisitos para obtenção do grau de Mestre em Medicina Dentária.

Estudo da prevalência da utilização de protetores bucais em praticantes da arte marcial Muay Thai

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

Qualidade de Vida, Vinculação e Resiliência em adolescentes institucionalizados

Dissertação apresentada à Universidade Fernando Pessoa como parte dos requisitos para a obtenção do grau de Mestre em Psicologia, ramo de Psicologia Clínica e da Saúde

Cadeia de frio da distribuição farmacêutica

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

AIDA-Based Real-Time Fault-Tolerant Broadcast Disks

The proliferation of mobile computers and wireless networks requires the design of future distributed real-time applications to recognize and deal with the significant asymmetry between downstream and upstream communication capacities, and the significant disparity between server and client storage capacities. Recent research work proposed the use of Broadcast Disks as a scalable mechanism to deal with this problem. In this paper, we propose a new broadcast disks protocol, based on our Adaptive Information Dispersal Algorithm (AIDA). Our protocol is different from previous broadcast disks protocols in that it improves communication timeliness, fault-tolerance, and security, while allowing for a finer control of multiplexing of prioritized data (broadcast frequencies). We start with a general introduction of broadcast disks. Next, we propose broadcast disk organizations that are suitable for real-time applications. Next, we present AIDA and show its fault-tolerance and security properties. We conclude the paper with the description and analysis of AIDA-based broadcast disks organizations that achieve both timeliness and fault-tolerance, while preserving downstream communication capacity.

Entropy Loss is Maximal for Uniform Inputs

A secure sketch (defined by Dodis et al.) is an algorithm that on an input w produces an output s such that w can be reconstructed given its noisy version w' and s. Security is defined in terms of two parameters m and m˜ : if w comes from a distribution of entropy m, then a secure sketch guarantees that the distribution of w conditioned on s has entropy m˜ , where λ = m−m˜ is called the entropy loss. In this note we show that the entropy loss of any secure sketch (or, more generally, any randomized algorithm) on any distribution is no more than it is on the uniform distribution.

An Improved Robust Fuzzy Extractor

We consider the problem of building robust fuzzy extractors, which allow two parties holding similar random variables W, W' to agree on a secret key R in the presence of an active adversary. Robust fuzzy extractors were defined by Dodis et al. in Crypto 2006 [6] to be noninteractive, i.e., only one message P, which can be modified by an unbounded adversary, can pass from one party to the other. This allows them to be used by a single party at different points in time (e.g., for key recovery or biometric authentication), but also presents an additional challenge: what if R is used, and thus possibly observed by the adversary, before the adversary has a chance to modify P. Fuzzy extractors secure against such a strong attack are called post-application robust. We construct a fuzzy extractor with post-application robustness that extracts a shared secret key of up to (2m−n)/2 bits (depending on error-tolerance and security parameters), where n is the bit-length and m is the entropy of W . The previously best known result, also of Dodis et al., [6] extracted up to (2m − n)/3 bits (depending on the same parameters).

Lightweight Modeling of Java Virtual Machine Security Constraints using Alloy

The Java programming language has been widely described as secure by design. Nevertheless, a number of serious security vulnerabilities have been discovered in Java, particularly in the component known as the Bytecode Verifier. This paper describes a method for representing Java security constraints using the Alloy modeling language. It further describes a system for performing a security analysis on any block of Java bytecodes by converting the bytes into relation initializers in Alloy. Any counterexamples found by the Alloy analyzer correspond directly to insecure code. Analysis of a real-world malicious applet is given to demonstrate the efficacy of the approach.

Modeling the Java Bytecode Verifier

The Java programming language has been widely described as secure by design. Nevertheless, a number of serious security vulnerabilities have been discovered in Java, particularly in the Bytecode Verifier, a critical component used to verify class semantics before loading is complete. This paper describes a method for representing Java security constraints using the Alloy modeling language. It further describes a system for performing a security analysis on any block of Java bytecodes by converting the bytes into relation initializers in Alloy. Any counterexamples found by the Alloy analyzer correspond directly to insecure code. Analysis of the approach in the context of known security exploits is provided. This type of analysis represents a significant departure from standard malware analysis methods based on signatures or anomaly detection.