Tokens of the Divine displeasure : in the late conflagrations in New-York, & other judgments, illustrated /

Sabin

Elements of medical jurisprudence; or a succinct and compendious description of such tokens in the human body as are requisite to determine the judgment of a coroner, and courts of law, in cases of divorce, rape, murder, etc. To which are added directions for preserving the public health.

Mode of access: Internet.

Coins, medals, and seals, ancient and modern. Illustrated and described. With a sketch of the history of coins and coinage, instructions for young collectors, tables of comparative rarity, price lists of English and American coins, medals and tokens, &c., &c.

Letterpress on verso of each plate.

A descriptive catalogue of the London traders, tavern, and coffee-house tokens current in the seventeenth century;

Mode of access: Internet.

Tokens of the eighteenth century connected with booksellers & bookmakers (authors, printers, publishers, engravers and paper makers)

Mode of access: Internet.

Norfolk lists from the reformation to the present time; comprising lists of lord lieutenants, baronets, high sheriffs, and members of Parliament, of the county of Norfolk; bishops, deans, chancellors, archdeacons, prebendaries, members of Parliament, mayors, sheriffs, recorders, & stewards, of the city of Norwich; members of Parliament and mayors of the boroughs of Yarmouth, Lynn, Thetford, and Castle Rising; also a list of persons connected with the county, of whom engraved portraits have been published, and a descriptive list of tradesmens' tokens & provincial halfpennies issued in the county of Norfolk.

Mode of access: Internet.

When 'listeners can't talk' : comparing active listening in opening sequences of telephone and online counselling

While there is growing use of online counselling, little is known about its interactional organisation and how it compares to telephone counselling. This is despite past research suggesting that both counsellors and clients report the impact of the different modalities on the presentation and management of the counselling interaction. This paper compares the interactional affordances of telephone and online web counselling in opening sequences on Kids Help Line, a 24-hour Australian counselling service for children and young people up to the age of 25. We examine two ways that counsellors show active listening through response tokens and formulations. The analysis describes how counsellors’ use of minimal response tokens facilitate the clients’ problem presentation and are used in the management of turn taking and sequence organisation. For example, counsellors use the response token Mm hm to show that they understand that the client’s unit of talk to is not yet complete, and to affirm or invite the client to continue speaking. Formulations in phone and web counselling are another way that counsellors display active listening to re-present stretches of the clients’ preceding talk. In phone and web counselling, however, the respective modalities can complicate matters of turn transition and sequence organisation. By examining actual phone and online counselling sessions, this paper offers empirical demonstrations of the interactional affordances of phone and online counselling, and shows how the institutional practice of active listening is accomplished across different counselling modalities

Reduction rules for reset/inhibitor nets

Reset/inhibitor nets are Petri nets extended with reset arcs and inhibitor arcs. These extensions can be used to model cancellation and blocking. A reset arc allows a transition to remove all tokens from a certain place when the transition fires. An inhibitor arc can stop a transition from being enabled if the place contains one or more tokens. While reset/inhibitor nets increase the expressive power of Petri nets, they also result in increased complexity of analysis techniques. One way of speeding up Petri net analysis is to apply reduction rules. Unfortunately, many of the rules defined for classical Petri nets do not hold in the presence of reset and/or inhibitor arcs. Moreover, new rules can be added. This is the first paper systematically presenting a comprehensive set of reduction rules for reset/inhibitor nets. These rules are liveness and boundedness preserving and are able to dramatically reduce models and their state spaces. It can be observed that most of the modeling languages used in practice have features related to cancellation and blocking. Therefore, this work is highly relevant for all kinds of application areas where analysis is currently intractable.

Information extraction from web services : a comparison of Tokenisation algorithms

Most web service discovery systems use keyword-based search algorithms and, although partially successful, sometimes fail to satisfy some users information needs. This has given rise to several semantics-based approaches that look to go beyond simple attribute matching and try to capture the semantics of services. However, the results reported in the literature vary and in many cases are worse than the results obtained by keyword-based systems. We believe the accuracy of the mechanisms used to extract tokens from the non-natural language sections of WSDL files directly affects the performance of these techniques, because some of them can be more sensitive to noise. In this paper three existing tokenization algorithms are evaluated and a new algorithm that outperforms all the algorithms found in the literature is introduced.

Hidden credential retrieval from a reusable password

We revisit the venerable question of access credentials management, which concerns the techniques that we, humans with limited memory, must employ to safeguard our various access keys and tokens in a connected world. Although many existing solutions can be employed to protect a long secret using a short password, those solutions typically require certain assumptions on the distribution of the secret and/or the password, and are helpful against only a subset of the possible attackers. After briefly reviewing a variety of approaches, we propose a user-centric comprehensive model to capture the possible threats posed by online and offline attackers, from the outside and the inside, against the security of both the plaintext and the password. We then propose a few very simple protocols, adapted from the Ford-Kaliski server-assisted password generator and the Boldyreva unique blind signature in particular, that provide the best protection against all kinds of threats, for all distributions of secrets. We also quantify the concrete security of our approach in terms of online and offline password guesses made by outsiders and insiders, in the random-oracle model. The main contribution of this paper lies not in the technical novelty of the proposed solution, but in the identification of the problem and its model. Our results have an immediate and practical application for the real world: they show how to implement single-sign-on stateless roaming authentication for the internet, in a ad-hoc user-driven fashion that requires no change to protocols or infrastructure.

Classification of cancer-related death certificates using machine learning

Background Cancer monitoring and prevention relies on the critical aspect of timely notification of cancer cases. However, the abstraction and classification of cancer from the free-text of pathology reports and other relevant documents, such as death certificates, exist as complex and time-consuming activities. Aims In this paper, approaches for the automatic detection of notifiable cancer cases as the cause of death from free-text death certificates supplied to Cancer Registries are investigated. Method A number of machine learning classifiers were studied. Features were extracted using natural language techniques and the Medtex toolkit. The numerous features encompassed stemmed words, bi-grams, and concepts from the SNOMED CT medical terminology. The baseline consisted of a keyword spotter using keywords extracted from the long description of ICD-10 cancer related codes. Results Death certificates with notifiable cancer listed as the cause of death can be effectively identified with the methods studied in this paper. A Support Vector Machine (SVM) classifier achieved best performance with an overall F-measure of 0.9866 when evaluated on a set of 5,000 free-text death certificates using the token stem feature set. The SNOMED CT concept plus token stem feature set reached the lowest variance (0.0032) and false negative rate (0.0297) while achieving an F-measure of 0.9864. The SVM classifier accounts for the first 18 of the top 40 evaluated runs, and entails the most robust classifier with a variance of 0.001141, half the variance of the other classifiers. Conclusion The selection of features significantly produced the most influences on the performance of the classifiers, although the type of classifier employed also affects performance. In contrast, the feature weighting schema created a negligible effect on performance. Specifically, it is found that stemmed tokens with or without SNOMED CT concepts create the most effective feature when combined with an SVM classifier.