Crime and gambling: a brief overview of gambling fraud on the Internet.

Although there is an association between crime and gambling there is relatively little information and research on the topic. One area that appears to have become more prevalent over the last five years is that of fraudulent gambling activities on the Internet. This paper briefly outlines how many frauds and scams have moved into technological media such as the Internet and overviews a number of these including: (i) lottery scams, (ii) fake gambling site scams, (iii) betting software scams, (iv) gambling ‘bonus’ scams, (v) ‘twofer’ scams, and (vi) prize scams. It is concluded that gambling fraud on the Internet is a growth area because many gamblers themselves want to get a huge reward from a small outlay (just as the fraudsters do). As long as there are people who are prepared to risk money on chance events, there will be those out there who will want to fraudulently take their money from them. Given the complete lack of empirical data on these fraudulent practices, there is a need for research to be initiated in this newly emerging area of criminological concern

Sentencing scammers: law and practice

The Australian Bureau of Statistics (ABS) (2008: 5) has defined consumer scams as a fraudulent invitation, request, notification or offer, designed to obtain someone’s personal information or money or otherwise obtain a financial benefit by deceptive means

VADA: A transformation-based system for variable dependence analysis

Variable dependence is an analysis problem in which the aim is to determine the set of input variables that can affect the values stored in a chosen set of intermediate program variables. This paper shows the relationship between the variable dependence analysis problem and slicing and describes VADA, a system that implements variable dependence analysis. In order to cover the full range of C constructs and features, a transformation to a core language is employed Thus, the full analysis is required only for the core language, which is relatively simple. This reduces the overall effort required for dependency analysis. The transformations used need preserve only the variable dependence relation, and therefore need not be meaning preserving in the traditional sense. The paper describes how this relaxed meaning further simplifies the transformation phase of the approach. Finally, the results of an empirical study into the performance of the system are presented

Amorphous procedure extraction

The procedure extraction problem is concerned with the meaning preserving formation of a procedure from a (not necessarily contiguous) selected set of statements. Previous approaches to the problem have used dependence analysis to identify the non-selected statements which must be 'promoted' (also selected) in order to preserve semantics. All previous approaches to the problem have been syntax preserving. This work shows that by allowing transformation of the program's syntax it is possible to extract both procedures and functions in an amorphous manner. That is, although the amorphous extraction process is meaning preserving it is not necessarily syntax preserving. The amorphous approach is advantageous in a variety of situations. These include when it is desirable to avoid promotion, when a value-returning function is to be extracted from a scattered set of assignments to a variable, and when side effects are present in the program from which the procedure is to be extracted