Unified Description for Network Information Hiding Methods

Until now hiding methods in network steganography have been described in arbitrary ways, making them difficult to compare. For instance, some publications describe classical channel characteristics, such as robustness and bandwidth, while others describe the embedding of hidden information. We introduce the first unified description of hiding methods in network steganography. Our description method is based on a comprehensive analysis of the existing publications in the domain. When our description method is applied by the research community, future publications will be easier to categorize, compare and extend. Our method can also serve as a basis to evaluate the novelty of hiding methods proposed in the future.Comment: 24 pages, 7 figures, 1 table; currently under revie

Creating Links into the Future

We are approaching an era where research materials will be stored more and more as digital resources on the World Wide Web. This of course will enable easier access to online publications. As the number of electronic publications expands, it will, however, become a challenge for individuals to find related or relevant papers. Related papers could be papers written by the same team of authors or by one of the authors, or even papers that deal with the same topic but were written by other authors. This, of course, raises the issue of linking to papers forward in time, or as we call it “links into the future”. To be concrete, while reading a paper written in the year 1980, it would be nice to know if the same author has written another related paper in 1990’s or if the same author has written a paper earlier, all this without making an explicit search. Based on the ascertained interest of a person reading a particular paper from a digital repository, an auto-suggestion facility could be useful to indicate papers in the same area, category and subject that might potentially be of interest to the reader. One is typically interested in finding related papers by the same author or by one of the authors of a paper. This feature can be implemented in two ways. The first is by creating links from this paper to all the relevant papers and updating it periodically for new papers appearing on the World Wide Web. Another way is by going through the references of all papers appearing on the WWW. Based on the references, one can create mutual links to the papers that are referred to

Applications of Mash-ups for a Digital Journal

The WWW is currently experiencing a revolutionary growth due to numerous emerging tools, techniques and concepts. Digital journals thus need to transform themselves to cope with this evolution of the web. With their growing information size and access, conventional techniques for managing a journal and supporting authors and readers are becoming insufficient. Journals of the future need to provide innovative administrative tools in helping its managers to ensure quality. They also need to provide better facilities for assisting authors and readers in making decisions regarding their submission of papers and in providing novel navigational features for finding relevant publications and collaborators in particular areas of interest. In this paper, we explore an innovative solution to address these problems by using an emerging Web 2.0 technology. We explore the application of mash-ups for J.UCS - the Journal of Universal Computer Science and encourage readers and authors to try out the applications (see section 11 Conclusions). J.UCS can then serve as a model for contemporary electronic journals

Quo Vadis Abstract State Machines? J.UCS Special Issue

In introducing this special ASM issue of J.UCS we point out the particular role this Journal played in the short history of the ASM method and add some reflections on its current status

Rule based autonomous citation mining with TIERL

Citations management is an important task in managing digital libraries. Citations provide valuable information e.g., used in evaluating an author’s influences or scholarly quality (the impact factor of research journals). But although a reliable and effective autonomous citation management is essential, manual citation management can be extremely costly. Automatic citation mining on the other hand is a non-trivial task mainly due to non-conforming citation styles, spelling errors and the difficulty of reliably extracting text from PDF documents. In this paper we propose a novel rule-based autonomous citation mining technique, to address this important task. We define a set of common heuristics that together allow to improve the state of the art in automatic citation mining. Moreover, by first disambiguating citations based on venues, our technique significantly enhances the correct discovery of citations. Our experiments show that the proposed approach is indeed able to overcome limitations of current leading citation indexes such as ISI Web of Knowledge, Citeseer and Google Scholar

Investigations on a Pedagogical Calculus of Constructions

In the last few years appeared pedagogical propositional natural deduction systems. In these systems, one must satisfy the pedagogical constraint: the user must give an example of any introduced notion. First we expose the reasons of such a constraint and properties of these "pedagogical" calculi: the absence of negation at logical side, and the "usefulness" feature of terms at computational side (through the Curry-Howard correspondence). Then we construct a simple pedagogical restriction of the calculus of constructions (CC) called CCr. We establish logical limitations of this system, and compare its computational expressiveness to Godel system T. Finally, guided by the logical limitations of CCr, we propose a formal and general definition of what a pedagogical calculus of constructions should be.Comment: 18 page

Program transformation for functional circuit descriptions

We model sequential synchronous circuits on the logical level by signal-processing programs in an extended lambda calculus Lpor with letrec, constructors, case and parallel or (por) employing contextual equivalence. The model describes gates as (parallel) boolean operators, memory using a delay, which in turn is modeled as a shift of the list of signals, and permits also constructive cycles due to the parallel or. It opens the possibility of a large set of program transformations that correctly transform the expressions and thus the represented circuits and provides basic tools for equivalence testing and optimizing circuits. A further application is the correct manipulation by transformations of software components combined with circuits. The main part of our work are proof methods for correct transformations of expressions in the lambda calculus Lpor, and to propose the appropriate program transformations