Search

For good security and large payload in steganography, it is desired to embed as many messages as possible per change of the cover-object, i.e., to have high embedding efficiency. Steganographic codes derived from covering codes can improve embedding efficiency. In this paper, we propose a new method to construct stego-codes, showing that not just one but a family of stego-codes can be generated from one covering code by combining Hamming codes and wet paper codes. This method can enormously expand the set of embedding schemes as applied in steganography. Performances of stego-code families of structured codes and random codes are analyzed. By using the stego-code families of LDGM codes, we obtain a family of near optimal embedding schemes for binary steganography and ±1 steganography, respectively, which can approach the upper bound of embedding efficiency for various chosen embedding rate. [ABSTRACT FROM AUTHOR]

The contents and topologies of inter-document linkages, such as citations and references among scientific literature, have received increasing research interests in recent years. Some technologies have been fully studied and utilized upon this meaningful information to improve the organization, analysis and evaluation of scientific digital libraries. In this paper, we present a CiteSeer-like system to access scientific papers in computer science discipline by reference linking technique. Moreover, implicit semantics behind reference indices are mined and organized to improve accessibility of scientific papers. In order to model scientific literature and their interlinked relationships, we develop a domain-specific ontology to analyze contents and citation anchor context of scientific papers. Compared with abstract of a specific paper written by authors themselves, we introduce an automatic summary generation algorithm to create objective descriptions from other scholars' perspectives based on the ontology. Semantic queries can also be asked to discover interesting patterns in scientific libraries in order to provide a comprehensive and meaningful guidance for users. [ABSTRACT FROM AUTHOR]

Recently, two advances in agent-oriented software engineering have had a significant impact: the identification of interaction and coordination as the central focus of multi-agent systems design and the realization that the multi-agent organization is distinct from the agents that populate the system. This paper presents detailed guidance on how to integrate organizational rules into existing multi-agent methodologies. Specifically, we look at the Multi-agent Systems Engineering models to investigate how to integrate the existing abstractions of goals, roles, tasks, agents, and conversations with organizational rules and tasks. We then discuss how designs can be implemented using advanced as well as traditional coordination models. [ABSTRACT FROM AUTHOR]

Since its discovery in 1981, human immunodeficiency virus type 1 (HIV-1) has rapidly emerged as one of the most devastating infectious pathogens of this century (1-3). The World Health Organization estimates that, as of 1995, there were at least 15 million HIV-1-infected men, women, and children worldwide, with the vast majority of infections occurring in developing countries and isolated rural regions where specimen collection, preparation, and shipment are difficult (4). Simple and improved sampling methods that can be widely applied under difficult field conditions are needed to effectively monitor the changing dynamics of the HIV-1 /AIDS pandemic, track the spread of HIV-1 variants among different population groups and ensure that research and interventive activities are directed against biologically important variants of the virus. To date, at least eight major HIV-1 subtypes, designated A through H, have been identified (5,6). More recently, a ninth subtype, I, has been detected (7), as well as several highly divergent, or "outlying" variants of HIV-1 that have been tentatively classified as group O (8,9). This sub-typing is based on a relatively small number of specimens collected from a few geographic areas and the full range and distribution of HIV-1 variants remains to be established. [ABSTRACT FROM AUTHOR]

Protein phosphorylation by protein kinases is the most important regulatory mechanism of cell function and signal transduction. In general, protein kinases exhibit specificities that are often primarily determined by the amino acrds around the phosphorylation sites (1). Identification of amino acids that contribute to substrate motifs are essential for the understanding of signal transduction pathways and for the development of specific peptide substrates and inhibitors. Many investigations with large numbers of individual peptides have been conducted in order to find high-affinity substrates as well as mhrbrtors (2). Peptide libraries offer the possibility to investigate the sequence dependence of the phosphorylation more thoroughly and systematically and may even allow the a priori delineation of peptide substrates of uncharacterized protein kinases. [ABSTRACT FROM AUTHOR]

You΄ve completed a series of experiments and have collected enough data to write up your findings in a scientific article which you will submit to a peer-reviewed journal in your field. At this point in your career you have already read dozens of scientific papers and are familiar with the format. Following this format and tailoring it to your own work is easy if you keep the following points in mind as you write. [ABSTRACT FROM AUTHOR]

It is an interesting story to look at the development of new concepts in fuzzy set theory. One looks at the motivation, the first formulation and the subsequent development. In our case study we look at one of the early papers that interrelates the concept of fuzzy set inclusion, power set and many-valued implication operators, namely the paper of Bandler and Kohout [4]. This is followed by discussion of the subsequent related work by the fuzzy community. [ABSTRACT FROM AUTHOR]

After fifteen years of CBR conferences, this paper sets out to examine the themes that have evolved in CBR research as revealed by the implicit and explicit relationships between the conference papers. We have examined a number of metrics for demonstrating connections between papers and between authors and have found that a clustering based on co-citation of papers appears to produce the most meaningful organisation. We have employed an Ensemble Non-negative Matrix Factorisation (NMF) approach that produces a ˵soft″ hierarchical clustering, where papers can belong to more than one cluster. This is useful as papers can naturally relate to more than one research area. We have produced timelines for each of these clusters that highlight influential papers and illustrate the life-cycle of research themes over the last fifteen years. The insights afforded by this analysis are presented in detail. In addition to the analysis of the sub-structure of CBR research, this paper also presents some global statistics on the CBR conference literature. [ABSTRACT FROM AUTHOR]

The Prêt à Voter election scheme provides high assurance of accuracy and secrecy, due to the high degree of transparency and auditability. However, the assurance arguments are subtle and involve some understanding of the role of cryptography. As a result, establishing public understanding and trust in such systems remains a challenge. It is essential that a voting system be not only trustworthy but also widely trusted. In response to this concern, we propose to add a mechanism to Prêt à Voter to generate a conventional (i.e. human readable) paper audit trail that can be invoked should the outcome of the cryptographic count be called into question. It is hoped that having such a familiar mechanism as a safety net will encourage public confidence. Care has to be taken to ensure that the mechanism does not undermine the carefully crafted integrity and privacy assurances of the original scheme. We show that, besides providing a confidence building measure, this mechanism brings with it a number of interesting technical features: it allows extra audits of mechanisms that capture and process the votes to be performed. In particular, the mechanism presented here allows direct auditing of ballots that are actually used to cast votes. This is in contrast to previous versions of Prêt à Voter, and indeed other verifiable schemes, that employ a cut-and-choose mechanism. The mechanism proposed also has the benefit of providing a robust counter to the danger of voters undermining the receipt-freeness property by trying to retain the candidate list. [ABSTRACT FROM AUTHOR]