Search

The aim of this paper is to explore new metaphors for interaction design on tabletop system. Tabletop systems are shared horizontal surface for co-located collaboration, which leads to original problems when designing interactions. We propose two metaphors based on the paper: the peeling metaphor, and the slot metaphor, and then suggest a way of using them to design new interactions for solving some of the problems of tabletop systems: documents organization, documents transmission and documents duplication.

Typically, personalized information recommendation services automatically infer the user profile, a structured model of the user interests, from documents that were already deemed relevant by the user. We present an approach based on Word Sense Disambiguation (WSD) for the extraction of user profiles from documents. This approach relies on a knowledge-based WSD algorithm, called JIGSAW, for the semantic indexing of documents: JIGSAW exploits the WordNet lexical database to select, among all the possible meanings (senses) of a polysemous word, the correct one. Semantically indexed documents are used to train a naive Bayes learner that infers "semantic", sense-baseduser profiles as binary text classifiers (user-likes and user-dislikes). Two empirical evaluations are described in the paper. In the first experimental session, JIGSAW has been evaluated according to the parameters of the Senseval-3 initiative, that provides a forum where the WSD systems are assessed against disambiguated datasets. The goal of the second empirical evaluation has been to measure the accuracy of the user profiles in selecting relevant documents to be recommended. Performance of classical keyword-based profiles has been compared to that of sense-based profiles in the task of recommending scientific papers. The results show that sense-based profiles outperform keyword-based ones.

In this paper, we develop methods for constructing vote-buying/coercion attacks on end-to-end voting systems, and describe vote-buying/coercion attacks on three proposed end-to-end voting systems: Punchscan, Pret-a-voter, and ThreeBallot. We also demonstrate a different attack on Punchscan, which could permit corrupt election officials to change votes without detection in some cases. Additionally, we consider some generic attacks on end-to-end voting systems.

As the World Wide Web continues to evolve, the number of web-based attacks that target web applications is on the rise. Attacks such as Cross-site Scripting (XSS), SQL Injection and Cross-site Request Forgery (XSRF) are among the topmost threats on the Web, and defending against these attacks is a growing concern. In this paper, we describe WebAppArmor, a framework that is aimed at preventing these attacks on existing (legacy) web applications. The main feature of this framework is that it offers a unified perspective to address these problems in the context of existing web applications. The framework incorporates techniques based on static and dynamic analysis, symbolic evaluation and execution monitoring to retrofit existing web applications to be resilient to these attacks.

This article aims at presenting a methodological approach for classifying educational conference papers by employing a Bayesian Network (BN). A total of 400 conference papers were collected and categorized into 4 major topics (Intelligent Tutoring System, Cognition, e-Learning, and Teacher Education). In this study, we have implemented a 80-20 split of collected papers. 80% of the papers were meant for keywords extraction and BN parameter learning whereas the other 20% were aimed for predictive accuracy performance. A feature selection algorithm was applied to automatically extract keywords for each topic. The extracted keywords were then used for constructing BN. The prior probabilities were subsequently learned using the Expectation Maximization (EM) algorithm. The network has gone through a series of validation by human experts and experimental evaluation to analyze its predictive accuracy. The result has demonstrated that the proposed BN has outperformed Naive Bayesian Classifier, and BN learned from the training data.

This paper describes an approach to the use of citation links to improve the scientific paper classification performance. In this approach, we develop two refinement functions, a linear label refinement (LLR) and a probabilistic label refinement (PLR), to model the citation link structures of the scientific papers for refining the class labels of the documents obtained by the content-based Naive Bayes classification method. The approach with the two new refinement models is examined and compared with the content-based Naive Bayes method on a standard paper classification data set with increasing training set sizes. The results suggest that both refinement models can significantly improve the system performance over the content-based method for all the training set sizes and that PLR is better than LLR when the training examples are sufficient.

Paper keeps as a key information medium and this has motivated the development of new technologies for digitally augmented paper (DAP) that enable printed content to be linked with multimedia information. Among those technologies, one simplest approach is to print some visible patterns on paper (e.g., barcodes in the margin) as cross-media links. Due to the latest progress in printing industry, some more sophisticated methods have been developed, that is, some kinds of patterns printed on the background of a page in a high resolution are almost invisible and then we are affected little when reading. For all these pattern-embedding based approaches to integrate printed and multimedia information, we aim to present a unified publishing framework independent of particular patterns and readers(e.g., cameras to capture patterns) used to realize DAP. The presented framework manages semantic information about printed documents, multimedia resources, and patterns as links between them and users are provided with a platform for publishing DAP documents.

Privacy of PII(Personally Identifiable Information) on the Internet is a major concern of a netizen. On the Internet different service providers are supposed to publish their own privacy policies but understanding of these policies is a major problem. Standards like Platform for Privacy Preferences(P3P), provide a computer readable format and a protocol for allowing web browsers to retrieve and process privacy policies. In this paper we studied the various privacy mechanisms in place and compared them on the basis of their architecture and third party intervention. We also proposed an alternative privacy mechanism that introduces the concept of a third party whose role is to verify the privacy policy and keep a proactive check on the use of specified PII's. In case of a violation the third party, informs the users of the breach. The implementation of the proactive check on the PII has been done through software agents. The requirement of granting legal status to transactions of the PII by the use of Digital Signatures and PKI has also been proposed,thereby legally binding the web entity to use the PII as per the agreed terms.

Currently there are many service providers on the Web. Industry recognizes that from Web services many different business applications can be quickly created. A Web services composition tool can automate this process. The challenge lies in the creation of an automatic service composition facility which will tap into the potential of Web services, interact with the consumer in getting their business policies, and ensure that the behavior of Web services do not violate business policies while achieving the stated goals of the consumer. In this paper we discuss the architecture specific to this issue, as an add-on to a trustworthy service-oriented architecture. We provide an abstract view of the service creation facility and its environment, and propose suitable formal notations and formal analysis in the construction of this automated facility.

In this paper we present a system which recognizes handwritten annotations on printed text documents and interprets their semantic meaning. This system processes in three steps. In the first step, document analysis methods are applied to identify possible gestures and text regions. In the second step, the text and gestures are recognized using several state-of-the-art recognition methods. In the fourth step, the actual marked text is identified. Finally, the recognized information is sent to the Semantic Desktop, the personal Semantic Web on the Desktop computer, which supports users in their information management. In order to assess the performance of the system, we have performed an experimental study. We evaluated the different stages of the system and measured the overall performance.

The multi-modal rock-paper-scissors game is an interactive computer game where the opponent of the human player is a virtual agent appearing on the computer screen. The game is similar to the game between humans, the communication takes place by the tools of image and sound processing.

Mobile devices with small screens and minimal facilities for interaction are increasingly being used in complex human activities for accessing and processing information, while the user is moving. This paper presents a case study of the design and evaluation of a mobile system, which involved transformation of complex text and tables to digital format on a PDA. The application domain was an emergency medical ward, and the user group was junior registrars. We designed a PDA-based system for accessing information, focusing on the ward instruction, implemented a prototype and evaluated it for usability and utility. The evaluation results indicate significant problems in the interaction with the system as well as the extent to which the system is useful for junior registrars in their daily work.

We report on results of a paper-based lab study that used information on task performance, self appraisal and personal learning need assessment to validate the adaptation mechanisms for a work-integrated learning system. We discuss the results in the wider context of the evaluation of adaptive systems where the validation methods we used can be transferred to a work-based setting to iteratively refine adaptation mechanisms and improve model validity.

In this paper we describe the design of a hybrid search that combines simple metadata search with a traditional keyword search over unstructured context data. This paradigm provides the inquirer additional options to narrow the search with some semantic aspects through the XML metadata query. We demonstrate a paper search for a case study of the hybrid search, and describe a data integration hub to integrate those data dispersed on the Net.

The Lost Cosmonaut is an interactive narrative based on digitally enhanced paper. This technology uses an electronic pen to mediate between paper and computer. Thus any actions of the pen on the paper can be captured and manipulated by a computer as well as we can map digitally controlled events onto paper. The story in this narrative environment reveals itself partially through written text and images on the paper surface just as any other printed story. However, additional information in form of digitally controlled outputs such as sound, light and projections can be accessed through interaction with pen and paper. Furthermore the audience is not only supposed to read and otherwise perceive information, we also want them to actively produce content for this environment by writing onto the paper. By doing so they also add content to the database containing the digital output at the same time. Hence we produce a complex multimedia environment that works on three levels: On paper, in a digitally controlled visual and acoustic environment and in the combination of both worlds. Last but not least this environment is an open system, which grows as a collaborative effort over time as each user adds his own entries to paper and database. We argue that using paper as an integrated part of a digital environment is a best-of-both-world approach that opens up new possibilities for producing and perceiving narrative.

Office workers tend to produce paper piles of documents to read or to process sometime later. The information contained in these piles is often lost if it is not transferred to electronic format and connected to knowledge structures. Information that is not part of the knowledge worker’s electronic information space is frequently overlooked because it is not proactively provided during actual processes or tasks he is involved in. This paper presents a novel prototype for an intelligent office appliance, which results from an integration of three state-of-the-art office applications/appliances: a workflow system, a document classification system, and a multi-functional peripheral. The resulting system allows for leveraging an office worker’s papers to her personal knowledge space in order to realize a pro-active and context-sensitive information support within knowledge-intensive tasks and processes.

Researchers from the same lab often spend a considerable amount of time searching for published articles relevant to their current project. Despite having similar interests, they conduct independent, time consuming searches. While they may share the results afterwards, they are unable to leverage previous search results during the search process. We propose a research paper recommender system that avoids such time consuming searches by augmenting existing search engines with recommendations based on previous searches performed by others in the lab. Most existing recommender systems were developed for commercial domains with millions of users. The research paper domain has relatively few users compared to the large number of online research papers. The two major challenges with this type of data are the large number of dimensions and the sparseness of the data. The novel contribution of the paper is a scalable subspace clustering algorithm (SCuBA) that tackles these problems. Both synthetic and benchmark datasets are used to evaluate the clustering algorithm and to demonstrate that it performs better than the traditional collaborative filtering approaches when recommending research papers.

Many people currently use proxies to circumvent government censorship that blocks access to content on the Internet. Unfortunately, the dissemination channels used to distribute proxy server locations are increasingly being monitored to discover and quickly block these proxies. This has given rise to a large number of ad hoc dissemination channels that leverage trust networks to reach legitimate users and at the same time prevent proxy server addresses from falling into the hands of censors. To address this problem in a more principled manner, we present Proximax, a robust system that continuously distributes pools of proxies to a large number of channels. The key research challenge in Proximax is to distribute the proxies among the different channels in a way that maximizes the usage of these proxies while minimizing the risk of having them blocked. This is challenging because of two conflicting goals: widely disseminating the location of the proxies to fully utilize their capacity and preventing (or at least delaying) their discovery by censors.

Anonymous blacklisting schemes allow online service providers to prevent future anonymous access by abusive users while preserving the privacy of all anonymous users (both abusive and non-abusive). The first scheme proposed for this purpose was Nymble, an extremely efficient scheme based only on symmetric primitives; however, Nymble relies on trusted third parties who can collude to de-anonymize users of the scheme. Two recently proposed schemes, Nymbler and Jack, reduce the trust placed in these third parties at the expense of using less-efficient asymmetric crypto primitives. We present BNymble, a scheme which matches the anonymity guarantees of Nymbler and Jack while (nearly) maintaining the efficiency of the original Nymble. The key insight of BNymble is that we can achieve the anonymity goals of these more recent schemes by replacing only the infrequent "User Registration" protocol from Nymble with asymmetric primitives. We prove the security of BNymble, and report on its efficiency.

We present a self-adaptation mechanism for Network Intrusion Detection System which uses a game-theoretical mechanism to increase system robustness against targeted attacks on IDS adaptation. This system has been used to ensure the robustness of commercially provided software used by clients throughout the world. It is particularly important to prevent the long-term persistence of advanced attackers operating in the compromised networks by relying on the game-theoretical mechanism to ensure the long-term diversity of the detection boundary.

Many IT departments use remote administration products to configure, monitor, and maintain the systems they manage. These tools can be beneficial in the right hands, but they can also be devastating if attackers exploit them to seize control of machines. As a case study, we analyze the security of a remote administration product called Absolute Manage. We find that the system's communication protocol suffers from serious design flaws and fails to provide adequate integrity, confidentiality, or authentication. Attackers can exploit these vulnerabilities to issue unauthorized commands on client systems and execute arbitrary code with administrator privileges. These blatant vulnerabilities suggest that remote administration tools require increased scrutiny from the security community. We recommend that developers adopt defensive designs that limit the damage attackers can cause if they gain control.

This paper examines the idea of artistic license of the interpreter as a positive aspect of composition. The possibilities of participating in the creative act beyond the role of the traditional interpreter are illustrated by tracing the development of malleability in score writing in selected works of the author. Starting with the standard score, examples are given for the various forms of malleable scores that lead up to the application of real-time electronic scores in which a concept of self-conduction is feasibly implemented for use in distributed ensembles.

Service-oriented computing requires un-trusted and trusted software to simultaneously execute on the same hardware platform. Trusted software protects a service provider's business model and must execute in a high assurance environment. Increasingly, hardware mechanisms are required to create high-assurance closed environments to host trusted software on open platforms. In current approaches, independent hardware vendors (IHVs) design and implement closed environments with proprietary interfaces specific to mobile phones, PCs and servers, forcing independent software vendors (ISVs) and service providers to develop non-portable software. In this paper, we present an abstract closed environment architecture that exposes its facilities via implementation-independent canonical interfaces. IHVs can use this architecture to implement platform-specific closed environments, while ISVs and service providers develop applications to the canonical interface and build portable trusted software. We discuss example implementations of our framework to demonstrate the feasibility of building scalable solutions to support trustworthy service-oriented computing.

Bluetooth technology is gaining increasing interest in the research community because of the convenience of exchanging information between wireless devices. As the communication medium is wireless, security is an important concern in this emerging technology. This paper discusses the basic security of Bluetooth technology, some of its shortcomings and presents two new proposals for securing Bluetooth technology. One of the proposals is based on passkey-authenticated key exchange, where security relies on keyed hash function, and the other one is on amplified passkey-authenticated key exchange, where security relies on elliptic curve discrete logarithms problem. The latter provides some additional security services, but with added cost compared to the former one. Both protocols provide mutual authentication, resist known and possible threats, and achieve efficiency compared to other protocols.

We propose a method to search for illustrative sentences for English multiword expressions (MWEs) from a research paper database. We focus on syntactically flexible expressions such as "regard --- as." Traditionally, illustrative sentences that contain such expressions have been searched for by limiting the maximum number of words between the component words of the MWE. However, this method could not collect enough illustrative sentences in which clauses are inserted between component words of MWEs. We therefore devised a measure that calculates the distance between component words of an MWE in a parse tree, and use it for flexible expression search. We conducted experiments, and obtained a precision of 0.832 and a recall of 0.911.

High-precision linguistic and semantic analysis of scientific texts is an emerging research area. We describe methods and an application for extracting interesting factual relations from scientific texts in computational linguistics and language technology. We use a hybrid NLP architecture with shallow preprocessing for increased robustness and domain-specific, ontology-based named entity recognition, followed by a deep HPSG parser running the English Resource Grammar (ERG). The extracted relations in the MRS (minimal recursion semantics) format are simplified and generalized using WordNet. The resulting `quriples' are stored in a database from where they can be retrieved by relation-based search. The query interface is embedded in a web browser-based application we call the Scientist's Workbench. It supports researchers in editing and online-searching scientific papers.

The Pret a 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 Pret a 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 Pret a 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.

The aim of timestamping systems is to provide a proof-of-existence of a digital document at a given time. Such systems are important to ensure integrity and non-repudiation of digital data over time. Most of the existing timestamping schemes use the notions of round (a period of time) and round token (a single value aggregating the timestamping requests received during one round). Such schemes have the following drawbacks: (i) Clients who have submitted a timestamping request must wait for the end of the round before receiving their timestamping certificate (ii) TimeStamping Authorities (TSA) based on such schemes are discrete-time systems and provide relative temporal authentication only, i.e. all the documents submitted during the same round are timestamped with the same date and time. (iii) the TSA can tamper timestamps before the round token is published in a widely distributed media. In this paper, we define a new timestamping scheme which overcomes these drawbacks.

In this paper we discuss the cold-start problem in an evolvable paper recommendation e-learning system. We carried out an experiment using artificial and human learners at the same time. Artificial learners are used to solve the cold-start recommendation problem when no paper has been rated by the learners. Experimental results are encouraging, showing that using artificial learners achieves better performance in terms of learner subjective ratings; and more importantly, human learners are satisfied with the recommendations received.

In this paper, we developed an intelligent grading system, which scores descriptive examination papers automatically, based on Probabilistic Latent Semantic Analysis (PLSA) For grading, we estimated semantic similarity between a student paper and a model paper PLSA is able to represent complex semantic structures of given contexts, like text passages, and are used for building linguistic semantic knowledge which could be used in estimating contextual semantic similarity In this paper, we marked the real examination papers and we can acquire about 74% accuracy of a manual grading, 7% higher than that from the Simple Vector Space Model.

We propose a new approach for the reconstruction of 3D CAD models from paper drawings. Our method uses a combination of the well-known fleshing-out-projections method and accumulation techniques from image processing to reconstruct part models. It should provide a comfortable method to handle inaccuracies and missing elements unavoidable in scanned paper drawings while giving the user the chance to observe and interactively control the reconstruction process.

A secret and secure ballot is the core of every democracy. We all feel proud of being able to decide the future of our countries by making appropriate use of our right to vote in an election. However, how can we improve the efficiency of the voting process? Democratic governments should have mechanisms which ensure the integrity, security and privacy of its citizens at the polls during an election process. This paper describes a new electronic secure voting system, based on automatic paper ballot reading, which can be utilized to offer efficient help to officials and party representatives during elections. It presents how the system is organized, it also describes our OCR system and how it is implemented to read paper ballots, and it ends showing some experimental results.

Delivering personalized recommendations for e-learning is different from that in many other domains (i.e. e-commerce, news, etc.) in that we should not only consider users' interest, but also their pedagogical features such as their learning goals, and background knowledge etc. To attack this problem, in this paper in the context of recommending research papers for learners, we introduce the notion of pedagogy-oriented similarity measurement and propose two pedagogy-oriented recommendation techniques: model-based and hybrid recommendations. To compare these two techniques, we carried out an experiment using artificial learners. Experiment results are encouraging, showing that hybrid collaborative filtering, which can lower the computational costs will not compromise the overall performance of the recommender system. In addition, as more and more learners participate in the learning process, both learner and paper models can better be enhanced and updated, which is especially desirable for web-based learning systems.

The aim of our work is to provide support for reading (or skimming) scientific papers. In this paper we report on the task to identify concepts or terms with positive attributions in scientific papers. This task is challenging as it requires the analysis of the relationship between a concept or term and its sentiment expression. Furthermore, the context of the expression needs to be inspected. We propose an incremental knowledge acquisition framework to tackle these challenges. With our framework we could rapidly (within 2 days of an expert’s time) develop a prototype system to identify positive attributions in scientific papers. The resulting system achieves high precision (above 74%) and high recall rates (above 88%) in our initial experiments on corpora of scientific papers. It also drastically outperforms baseline machine learning algorithms trained on the same data.

The Boogie Verification Debugger (BVD) is a tool that lets users explore the potential program errors reported by a deductive program verifier. The user interface is like that of a dynamic debugger, but the debugging happens statically without executing the program. BVD integrates with the program-verification engine Boogie. Just as Boogie supports multiple language front-ends, BVD can work with those front-ends through a plug-in architecture. BVD plugins have been implemented for two state-of-the-art verifiers, VCC and Dafny.

Fast-flux botnets are a growing security concern on the Internet. At their core, these botnets are a large collection of geographically-dispersed, compromised machines that act as proxies to hide the location of the host, commonly referred to as the “mothership,” to/from which they are proxying traffic. Fast-flux botnets pose a serious problem to botnet take-down efforts. The reason is that, while it is typically easy to identify and consequently shut down single bots, locating the mothership behind a cloud of dynamically changing proxies is a difficult task.

This article proposes a Memetic Differential Evolution (MDE) for designing digital filters which aim at detecting defects of the paper produced during an industrial process. The MDE is an adaptive evolutionary algorithm which combines the powerful explorative features of Differential Evolution (DE) with the exploitative features of two local searchers. The local searchers are adaptively activated by means of a novel control parameter which measures fitness diversity within the population. Numerical results show that the DE framework is efficient for the class of problems under study and employment of exploitative local searchers is helpful in supporting the DE explorative mechanism in avoiding stagnation and thus detecting solutions having a high performance.

With the increased use of Internet and information technol- ogy all over the world, there is an increased amount of criminal activities that involve computing and digital data. These digital crimes (e-crimes) impose new challenges on prevention, detection, investigation, and pros- ecution of the corresponding offences. Computer forensics (also known as cyberforensics) is an emerging research area that applies computer in- vestigation and analysis techniques to help detection of these crimes and gathering of digital evidence suitable for presentation in courts. This new area combines the knowledge of information technology, forensics science, and law and gives rise to a number of interesting and challeng- ing problems related to computer security and cryptography that are yet to be solved. In this paper, we present and discuss some of these prob- lems together with two successful cases of computer forensics technology developed in Hong Kong that enable the law enforcement departments to detect and investigate digital crimes more efficiently and effectively. We believe that computer forensics research is an important area in ap- plying security and computer knowledge to build a better society.

This study was conducted to investigate the gender-related effects of two instructional programs on the spatial visualization skills of ninth grade students. Two instructional programs were developed for this study: a web-based virtual reality (VR) graphics program and a paper-based program. 119 ninth graders from two middle schools in Seoul participated in this study. The data analysis indicated that both the web-based and paper-based programs were effective in improving the spatial visualization skills of experimental groups. When deleting the effect of covariance of the pretest, there were no statistically significant differences in the post-test results. This paper demonstrates the promise of virtual reality on the Internet in the context of spatial visualization.

Effective daily processing of large amounts of paper documents in office environments requires the application of semantic-based indexing techniques during the transformation of paper documents to electronic format. For this purpose a combination of both XML and knowledge technologies can be used. XML distinguishes between data, its structure and semantics, allowing the exchange of data elements that carry descriptions of their meaning, usage and relationship. Moreover, the combination with XSLT enables any browser to render the original layout structure of the paper documents accurately. However, an effective transformation of paper documents into XML format is a complex process involving several steps. In this paper we propose the application of knowledge technologies to many document processing steps, namely rule-based systems for semantic indexing of documents and the extraction of the necessary knowledge by means of machine learning techniques. This approach has been implemented in the system Wisdom++, which is currently used in the European project COLLATE (Collaboratory for Annotation, Indexing and Retrieval of Digitized Historical Archive Material) to provide film archivists with a tool for the automated annotation of historical documents in film archives.

We describe a foundation for refinement calculus where pro- grams and systems are described as contracts, carried out by a collection of interacting agents. The contract states explicitly what the agents are allowed to do, and who is to blame if things go wrong. A contract can be analyzed from the point of view of any participating agent or coalition of agents, to see what kind of goals the agents can achieve by following the contract. We give an intuitive overview of contracts in this setting, and then continue to describe the mathematical and logical foundations of the calculus. We show how contracts provide a unified framework for a number of seemingly different paradigms in computer science, such as concurrency, interactivity, games, temporal behavior vs input-output computation and high level system design.

Implementing IP security in broadband router without sacrificing the performance is main work we focused on. To meet the need of protecting wire speed forwarding data passing through fast path of the router, security module implemented with encryption chip was adopted; to protect non real time data passing through slow path of the router, the scheme of implementing IP security inside kernel of Master control module with software was introduced. Security architecture and several testing architectures were finely designed and depicted in the paper. Testing of security architecture was undergone in SR1880s router, which was developed by National Digital Switching System Engineering & Technological R&D Center of China (NDSC). Testing results show that the two schemes work well together.

Cache based side-channel attacks have recently been attracted significant attention due to the new developments in the field. In this paper, we present an efficient trace-driven cache attack on a widely used implementation of the AES cryptosystem. We also evaluate the cost of the proposed attack in detail under the assumption of a noiseless environment. We develop an accurate mathematical model that we use in the cost analysis of our attack. We use two different metrics, specifically, the expected number of necessary traces and the cost of the analysis phase, for the cost evaluation purposes. Each of these metrics represents the cost of a different phase of the attack.

One of the most commonly used two-factor authentication mechanisms is based on smart card and user's password. Throughout the years, there have been many schemes proposed, but most of them have already been found flawed due to the lack of formal security analysis. On the cryptanalysis of this type of schemes, in this paper, we further review two recently proposed schemes and show that their security claims are invalid. To address the current issue, we propose a new and simplified property set and a formal adversarial model for analyzing the security of this type of schemes. We believe that the property set and the adversarial model themselves are of independent interest. We then propose a new scheme and a generic construction framework. In particular, we show that a secure password based key exchange protocol can be transformed efficiently to a smartcard and password based two-factor authentication scheme provided that there exist pseudorandom functions and collision-resistant hash functions.

Tracing nefarious HTTP activity to its source is sometimes extremely difficult when HTTP (and/or SOCKS) proxies are used for origin obfuscation. This paper describes a technique for tracing HTTP traffic through one or more non-cooperating HTTP (and/or SOCKS) proxies. The technique uses only passive observations of TCP/IP headers. Furthermore, the technique need only observe a single direction of the underlying TCP flows, i.e. the technique is asymmetric-route-robust. The technique represents a set of HTTP transactions as an activity profile. These profiles may be either distilled from passive network observations, or logged by a cooperating web server. Using statistical correlation techniques, we can trace both end-to-end SSL-encrypted HTTP, and unencrypted HTTP despite the source obfuscation methods employed by many contemporary proxies. The technique may be used to narrow the search space before applying other more resource intensive traceback techniques.

The paper documents recognition is fundamental for office automation becoming every day a more powerful tool in those fields where information is still on paper. Document recognition follows from data acquisition, from both journals, and entire books in order to transform them in digital objects. We present a new system DAN (Document Analysis on Network) for Document recognition that follows the Open Source methodologies, XML description for documents segmentation and classification, which turns to be beneficial in terms of classification precision, and general-purpose availability.

Automatic summaries are often subject to several criticisms (e.g., lack of cohesion and coherence). In this paper, we propose an approach that uses coherent Summary-Schemas (templates) conceived from the rhetorical structure of scientific papers including their abstracts. The Summary-Schemas embed rhetorical roles specified by signatures (sets of positional, structural, linguistic and thematic features) that guide the search for appropriate sentences in the source text.

Engineering solutions are generally documented in assembly and part drawings and bill of materials. A great benefit, qualitatively and commercially, can be achieved if these paper based storages can be transformed into digital information archives. The process of this transformation is called reconstruction. The reconstruction process of paper based assembly drawings consists of four steps: digitization; vectorization/ interpretation; 3D reconstruction of the parts and the 3D reconstruction of the assembly.This paper evaluates existing commercial systems worldwide for interpretation of paper based mechanical engineering drawings. For a complete reconstruction process a 3D reconstruction is needed. This functionality is already supported by some CAD systems to a certain extent, but it still remains a major topic of research work. One CAD system which converts 2D CAD models into 3D CAD models is presented. Finally, after the reconstruction of the parts the whole assembly can be reconstructed. Until now, no system for the automatic reconstruction of assemblies is available. In our paper we present a general approach for automatic reconstruction of 3D assembly model data by interpretation of mechanical engineering 2D assembly drawings, their part drawings, and the bill of materials.

Recently there is an emergence of many Internet applications such as distributed interactive simulations (DIS), and high-performance scientific computations such Grid computing. These applications require huge amount of bandwidth and a viable communication paradigm to coordinate with multiple sources and destinations. In this work we propose variation of multicasting called quorumcasting or manycasting. In manycasting destinations are to be determined rather than given unlike in the case of multicasting. We first present a need to support manycasting over OBS networks. Quality of Service (QoS) policies implemented in IP does apply does not apply for optical burst switched (OBS) networks, as the optical counterpart for store-and forward model does not exist. Hence there is a need to support QoS for manycasting over OBS networks. In this work we focus on QoS parameters such as contention, optical signal quality, reliability, and propagation delay. Burst loss in OBS network can occur due to contention or bit-error rate (BER). We propose algorithms to decrease the overall burst loss. We show that IP based manycasting has poor performance compared to our proposed algorithms. Our simulation results are verified with the help of analytical model. This work is further extended as to multi-constrained manycast problem (MCMP). In this problem, we address the burst scheduling for multiple QoS constraints. We propose algorithms to minimize burst loss based on given service requirements. The goal of this work is to develop service-oriented optical networks (SOON) for many emerging Internet applications.

ECampus is a project spanning all departments at the University of Fulda. It has been started to create a uniform learning environment at the university. The objective is to research and develop a user-friendly easy-to-use editor to generate SCORM 2004 conform E-Learning modules. This editor is based on Open Source software and new technologies such as XSL transformations and the Google web toolkit. The whole system is provided as a web application and embedded within the E-Learning environment of the university. Some E-Learning modules can be developed with the system immediately. These modules are now being used during the lessons with great success.