In this work we model the ACME (a fictitious company name) "printer case
incident" and make its specification in Forensic Lucid, a Lucid- and
intensional-logic-based programming language for cyberforensic analysis and
event reconstruction specification. The printer case involves a dispute between
two parties that was previously solved using the finite-state automata (FSA)
approach, and is now re-done in a more usable way in Forensic Lucid.
This document supplements an experimental Jitter / Max/MSP collection of
implementation patches that set its goal to simulate an alchemical process for
a person standing in front of a mirror-like screen while interacting with it.
The work involved takes some patience and has three stages to go through. At
the final stage the "alchemist" in the mirror wearing sharp-colored gloves (for
motion tracking) is to extract the final ultimate shining sparkle (FFT-based
visualization) in the nexus of the hands. The more the hands are apart, the
large the sparkle should be.
We present a machine learning approach to static code analysis for weaknesses
related to security and others with the open-source MARF framework and its
application to for the NIST's SATE 2010 static analysis tool exhibition
workshop.
Lucid programs are data-flow programs and can be visually represented as data
flow graphs (DFGs) and composed visually. Forensic Lucid, a Lucid dialect, is a
language to specify and reason about cyberforensics cases. It includes the
encoding of the evidence (representing the context of evaluation) and the crime
scene modeling in order to validate claims against the model and perform event
reconstruction, potentially within large swaths of digital evidence.
Lecture notes for the Comparative Studies of Programming Languages course,
COMP6411, taught at the Department of Computer Science and Software
Engineering, Faculty of Engineering and Computer Science, Concordia University,
Montreal, QC, Canada. These notes include a compiled book of primarily related
articles from the Wikipedia, the Free Encyclopedia, as well as Comparative
Programming Languages book and other resources, including our own. The original
notes were compiled by Dr. Paquet.
This paper complements the main DEFT'10 article describing the MARF approach
to the DEFT'10 NLP competition. This paper is aimed to present the complete
result sets of all the conducted experiments and their settings in the
resulting tables highlighting the approach and the best results, but also
showing the worse and the worst and their analysis. This is the first iteration
of the initial release of the results.
This index covers the final course project reports for COMP5541 Winter 2010
at Concordia University, Montreal, Canada, Tools and Techniques for Software
Engineering by 4 teams trying to capture the requirements, provide the design
specification, configuration management, testing and quality assurance of their
partial implementation of the Unified University Inventory System (UUIS) of an
Imaginary University of Arctica (IUfA). Their results are posted here for
comparative studies and analysis.
We review a case study of a UI design project for a complete travel search
engine system prototype for regular and corporate users. We discuss various
usage scenarios, guidelines, and so for, and put them into a web-based
prototype with screenshots and the like. We combined into our prototype the
best features found at the time (2002) on most travel-like sites and added more
to them as a part of our research.
This paper presents the integration into the GIPSY of Lucx's context calculus
defined in Wan's PhD thesis. We start by defining different types of tag sets,
then we explain the concept of context, the types of context and the context
calculus operators. Finally, we present how context entities have been
abstracted into Java classes and embedded into the GIPSY system.
This document discusses an approach and its rudimentary realization towards
automatic classification of PPs; the topic, that has not received as much
attention in NLP as NPs and VPs. The approach is a rule-based heuristics
outlined in several levels of our research. There are 7 semantic categories of
PPs considered in this document that we are able to classify from an annotated
corpus.
Using Pustejovsky's "The Syntax of Event Structure" and Fong's "On Mending a
Torn Dress" we give a glimpse of a Pustejovsky-like analysis to some example
sentences in Fong. We attempt to give a framework for semantics to the noun
phrases and adverbs as appropriate as well as the lexical entries for all words
in the examples and critique both papers in light of our findings and
difficulties.
We describe a type system for a platform called the General Intensional
Programming System (GIPSY), designed to support intensional programming
languages built upon intensional logic and their imperative counter-parts for
the intensional execution model. In GIPSY, the type system glues the static and
dynamic typing between intensional and imperative languages in its compiler and
run-time environments to support the intensional evaluation of expressions
written in various dialects of the intensional programming language Lucid.
Pure Lucid programs are concurrent with very fine granularity. Sequential
Threads (STs) are functions introduced to enlarge the grain size; they are
passed from server to workers by Communication Procedures (CPs) in the General
Intensional Programming System (GIPSY). A JLucid program combines Java code for
the STs with Lucid code for parallel control. Thus first, in this thesis, we
describe the way in which the new JLucid compiler generates STs and CPs. JLucid
also introduces array support.
This article introduces Object-Oriented Intensional Programming (OO-IP), a
new hybrid language between Object-Oriented and Intensional Programming
Languages in the sense of the latest evolutions of Lucid.