Effect of ceramic surface treatments on the bond strength of different composite resins

This study was aimed to observe the relationship between the different surface treatments and the bond strength of both composite based adhesive cement and zirconia ceramic. Thirty-two zirconia ceramic discs were fabricated by following the instructions of manufacturer (5 × 5 × 1.5 mm). Four subgroups were obtained from the specimens according to the specified surface treatments respectively: (a) C: control groups: no treatment; (b) SB: sandblasting with 125 μm aluminum oxide particles for 10 s; (c) SC: silica coating for 10 s; (d) Nd :YAG laser . The composite resin specimens Panavia F and Clearfil SA were introduced and polymerized to the treated bonding areas. Afterwards the specimens were stored in distilled water at 37 °C during 24 h, and the shear test was applied. The data were statistically analyzed by ANOVA and Duncan tests. The bond strength was stated significantly higher in silica coating/Panavia F group (23.35 MPa). The lowest bond strength was stated in control groups cemented with Clearfil SA (12.25 MPa). As a result it was determined that the bond strength has affected the both surface treatments and cement types (p < 0.001). The silica coating –treated zirconia ceramic recorded a significant increase in mean bond strength values.     

Surface-modified alumina nanoparticles-filled aramid fiber-reinforced epoxy nanocomposites: preparation and mechanical properties

Iranian Polymer Journal - Surface of Al2O3 nanoparticles was modified with a silane coupling agent, and aramid fiber-reinforced epoxy nanocomposites were produced using these particles. Three...     

Verifying anonymity in voting systems using CSP

We present formal definitions of anonymity properties for voting protocols using the process algebra CSP. We analyse a number of anonymity definitions, and give formal definitions for strong and weak anonymity, highlighting the difference between these definitions. We show that the strong anonymity definition is too strong for practical purposes; the weak anonymity definition, however, turns out to be ideal for analysing voting systems. Two case studies are presented to demonstrate the usefulness of the formal definitions: a conventional voting system, and Prêt à Voter, a paper-based, voter-verifiable scheme. In each case, we give a CSP model of the system, and analyse it against our anonymity definitions by specification checks using the Failures-Divergences Refinement (FDR2) model checker. We give a detailed discussion on the results from the analysis, emphasizing the assumptions that we made in our model as well as the challenges in modelling electronic voting systems using CSP.     

Certifying spatially uniform behavior in reaction–diffusion PDE and compartmental ODE systems

We present a condition that guarantees spatial uniformity for the asymptotic behavior of the solutions of a reaction–diffusion PDE with Neumann boundary conditions. This condition makes use of the Jacobian matrix of the reaction terms and the second Neumann eigenvalue of the Laplacian operator on the given spatial domain, and eliminates the global Lipschitz assumptions commonly used in mathematical biology literature. We then derive numerical procedures that employ linear matrix inequalities to certify this condition, and illustrate these procedures on models of several biochemical reaction networks. Finally, we present an analog of this PDE result for the synchronization of a network of identical ODE models coupled by diffusion terms. From a systems biology perspective, the main contribution of the paper is to blend analytical and numerical tools from nonlinear systems and control theory to derive a relaxed and verifiable condition for spatial uniformity of biological processes.     

Spatiotemporal distribution of facilitation and inhibition of return arising from the reflexive orienting of covert attention.

Currently, there is debate regarding both the spatial and temporal relationship between facilitation and inhibition of return (IOR) components of attention, as observed on the covert orienting of visual attention task (COVAT). These issues were addressed in a series of experiments where the spatial and temporal relationships between cue and target were manipulated. Facilitation occurred only when the stimulus onset asynchrony (SOA) was short and there was temporal overlap between cue and target. IOR occurred only when SOA was long and there was no temporal overlap between cue and target. Facilitation encompassed the cued location and all locations between the cue and fixation, whereas IOR arose for the entire cued hemifield. These findings suggest that the facilitation and IOR found on COVATs that use noninformative peripheral cues are separable and stimulus-driven processes. (PsycINFO Database Record (c) 2010 APA, all rights reserved)     

Approximate and exact hybrid algorithms for private nearest-neighbor queries with database protection

Mobile devices with global positioning capabilities allow users to retrieve points of interest (POI) in their proximity. To protect user privacy, it is important not to disclose exact user coordinates to un-trusted entities that provide location-based services. Currently, there are two main approaches to protect the location privacy of users: (i) hiding locations inside cloaking regions (CRs) and (ii) encrypting location data using private information retrieval (PIR) protocols. Previous work focused on finding good trade-offs between privacy and performance of user protection techniques, but disregarded the important issue of protecting the POI dataset D. For instance, location cloaking requires large-sized CRs, leading to excessive disclosure of POIs (O(|D|) in the worst case). PIR, on the other hand, reduces this bound to \(O(\sqrt{|D|})\), but at the expense of high processing and communication overhead. We propose hybrid, two-step approaches for private location-based queries which provide protection for both the users and the database. In the first step, user locations are generalized to coarse-grained CRs which provide strong privacy. Next, a PIR protocol is applied with respect to the obtained query CR. To protect against excessive disclosure of POI locations, we devise two cryptographic protocols that privately evaluate whether a point is enclosed inside a rectangular region or a convex polygon. We also introduce algorithms to efficiently support PIR on dynamic POI sub-sets. We provide solutions for both approximate and exact NN queries. In the approximate case, our method discloses O(1) POI, orders of magnitude fewer than CR- or PIR-based techniques. For the exact case, we obtain optimal disclosure of a single POI, although with slightly higher computational overhead. Experimental results show that the hybrid approaches are scalable in practice, and outperform the pure-PIR approach in terms of computational and communication overhead.     

jContractor: Introducing Design-by-Contract to Java Using Reflective Bytecode Instrumentation

Design by Contract is a software engineering practice that allows semantic information to be added to a class or interface to precisely specify the conditions that are required for its correct operation. The basic constructs of Design by Contract are method preconditions and postconditions, and class invariants. This paper presents a detailed design and implementation overview of jContractor, a freely available tool that allows programmers to write “contracts' as standard Java methods following an intuitive naming convention. Preconditions, postconditions, and invariants can be associated with, or inherited by, any class or interface. jContractor performs on-the-fly bytecode instrumentation to detect violation of the contract specification during a program's execution. jContractor's bytecode engineering technique allows it to specify and check contracts even when source code is not available. jContractor is a pure Java library providing a rich set of syntactic constructs for expressing contracts without extending the Java language or runtime environment. These constructs include support for predicate logic expressions, and referencing entry values of attributes and return values of methods. Fine grain control over the level of monitoring is possible at runtime. Since contract methods are allowed to use unconstrained Java expressions, in addition to runtime verification they can perform additional runtime monitoring, logging, and analysis.     

Exploring the Belief Systems of Software Development Professionals

It is commonly accepted that an individual's beliefs and actions are based on his or her assessment and perceptions of the world. In order to determine what practices an individual is likely to follow at any given time, it is necessary to understand the individual's behavioral intention in a given circumstance. From an Information Technology perspective, a software development professional's belief systems are potentially the basis for the adoption and implementation of new and innovative work practices and processes. In this article, we explore the belief systems of software development professionals in order to understand the beliefs underlying intention and practice, and we seek answers about how they adopt or reject new and innovative software development processes and practices. The results point out a strong influence of past experiences, personality types, and repeated behavior on current software development processes and practices in industrial settings.