3,587 research outputs found

    Domain-SpeciïŹc Languages for Digital Forensics

    Get PDF
    Due to strict deadlines, custom requirements for nearly every case and the scale of digital forensic investigations, forensic software needs to be extremely ïŹ‚exible. There is a clear separation between different types of knowledge in the domain, making domain-speciïŹc languages (DSLs) a possible solution for these applications. To determine their effectiveness, DSL-based systems must be implemented and compared to the original systems. Furthermore, existing systems must be migrated to these DSL-based systems to preserve the knowledge that has been encoded in them over the years. Finally, a cost analysis must be made to determine whether these DSL-based systems are a good investment

    High resolution MFM: Simulation of tip sharpening

    Get PDF
    The transfer functions of tips with various sharpened tip ends were calculated and the resolution of these tips was estimated by considering the resolution limit due to thermal noise at room temperature. The tip having an ellipsoidal tip end (ellipsoidal tip) is found to be a suitable candidate for high-resolution magnetic force microscopy. Sharpening of the flat tip end makes zero signal frequencies disappear for tips with ellipticities larger than tan45/spl deg/. The sensitivity shows a maximum around an ellipticity of tan80/spl deg/. The ellipsoidal tip shows a much smaller tip thickness dependence compared to the tip having a flat tip end because only the tip end mainly contributes to signals in case of the ellipsoidal tip

    Survival of the selfish: contrasting self-referential and survival-based encoding

    Get PDF
    Processing information in the context of personal survival scenarios elicits a memory advantage, relative to other rich encoding conditions such as self-referencing. However, previous research is unable to distinguish between the influence of survival and self-reference because personal survival is a self-referent encoding context. To resolve this issue, participants in the current study processed items in the context of their own survival and a familiar other person’s survival, as well as in a semantic context. Recognition memory for the items revealed that personal survival elicited a memory advantage relative to semantic encoding, whereas other-survival did not. These findings reinforce suggestions that the survival effect is closely tied with self-referential encoding, ensuring that fitness information of potential importance to self is successfully retained in memory

    Procol - A concurrent object-oriented language with protocols delegation and constraints

    Get PDF
    PROCOL is an object-oriented language with distributed delegation. It strongly supports concurrency: many objects may be active simultaneously, they execute in parallel unless engaged in communication. An object has exported operations, called Actions. Only one Action can be active at a time, however special interrupt Actions may interrupt regular Actions. Communication is performed via remote procedure call, or via a one-way synchronous message with short-time binding. In communications both client and server can be specified, either by object instance identifiers, or by type. Therefore client-server mappings may be 1-1, n-1, or 1-n, though only 1 message is transferred. PROCOL controls object access by an explicit per-object protocol. This protocol is a specification of the legality and serialization of the interaction between the object and its clients. It also provides for client type checking. The use of protocols in object communication fosters structured, safer and potentially verifiable information exchange between objects. The protocol also plays an important role as a partial interface specification. In addition it acts as a composition rule over client objects, representing relations with the client objects. PROCOL's communication binding is dynamic (run-time); it functions therefore naturally in a distributed, incremental and dynamic object environment. PROCOL also supports constraints, without compromising information hiding. An implementation is available in the form of a C extension
    • 

    corecore