ppxscal/embedding_network huggingface dataset:
The personal is political? Blogging and citizen stories, the case of Mum's Army
Authors: Tracy Simmons
Venue: Information Polity (2008)

Much attention has been paid to the personal and intimate nature of blogging. This paper will develop such notions in relation to theories of intimate citizenship; that is, the way in which blogs provide a form of self authorship, not just as a form of expression or creative outlet, but how blogging is connected to the mobilisation of political subjectivity (or subjectivities). Some bloggers use personal experiences, narratives and stories to underpin or motivate campaigns and activists. For example, on the "Mums' Army" blog, women organise campaigns against 'anti-social behaviour' with personal accounts and experiences of perceived social problems in various local settings. This case study illuminates how intimate stories can potentially mobilize previously disengaged citizens to become more politically aware and engaged in their local communities. This is, therefore, an exploratory paper that considers how the cry of the 'personal is political', so redolent of new social movements, is particularly apt in terms of the growing phenomenon of blogging.
Partial evaluation for code generation from domain-specific languages
Authors: Stephen Edwards
Venue:  (2008)

Partial evaluation has been applied to compiler optimization and generation for decades. Most of the successful partial evaluators have been designed for general-purpose languages. Our observation is that domain-specific languages are also suitable targets for partial evaluation. The unusual computational models in many DSLs bring challenges as well as optimization opportunities to the compiler. To enable aggressive optimization, partial evaluation has to be specialized to fit the specific paradigm of a DSL. In this dissertation, we present three such specialized partial evaluation techniques designed for specific languages that address a variety of compilation concerns. The first algorithm provides a low-cost solution for simulating concurrency on a single-threaded processor. The second enables a compiler to compile modest-sized synchronous programs in pieces that involve communication cycles. The third statically elaborates recursive function calls that enable programmers to dynamically create a system's concurrent components in a convenient and algorithmic way. Our goal is to demonstrate the potential of partial evaluation to solve challenging issues in code generation for domain-specific languages. Naturally, we do not cover all DSL compilation issues. We hope our work will enlighten and encourage future research on the application of partial evaluation to this area.
Adapting Petri Nets Reductions to Promela Specifications
Authors: C. Pajault, J. -F. Pradat-Peyre, P. Rousseau
Venue: Proceedings of the 28th IFIP WG 6.1 international conference on Formal Techniques for Networked and Distributed Systems (2008)

The interleaving of concurrent processes actions leads to the well-known combinatorial explosion problem. Petri nets theory provides some structural reductions to tackle this phenomenon by agglomerating sequences of transitions into a single atomic transition. These reductions are easily checkable and preserve deadlocks, Petri nets liveness and any LTL formula that does not observe the modified transitions. Furthermore, they can be combined with other kinds of reductions such as partial-order techniques to improve the efficiency of state space reduction. We present in this paper an adaptation of these reductions for Promela specifications and propose simple rules to automatically infer atomic steps in the Promela model while preserving the checked property. We demonstrate on typical examples the efficiency of this approach and propose some perspectives of this work in the scope of software model checking.
Unguessable Atoms: A Logical Foundation for Security
Authors: Mark Bickford
Venue: Proceedings of the 2nd international conference on Verified Software: Theories, Tools, Experiments (2008)

We show how a type of atoms, which behave like urelements, and a new proposition that expresses the independence of a term from an atom can be added to any logical system after imposing minor restrictions on definitions and computations. Working in constructive type theory, we give rules for the independence proposition and show how cryptographic protocols can be modeled as automata exchanging atoms. This model provides a unifying framework for reasoning about security and allows us to combine a general model of computation with a simple model of acquisition of secret information. As an application, we prove a fundamental property of nonces that justifies the axioms for nonces used in the protocol composition logic (PCL) of Datta, Derek, Mitchell and Roy. The example shows that basic security properties are naturally expressed in terms of independence and the causal ordering of events. The rules and example proofs are fully implemented in the Nuprl proof development system. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Data stream algorithms
Authors: Yihui Tang
Venue:  (2008)

In recent years, there has been a dramatic growth of interest in developing algorithms for massive data sets. In particular, the data stream model has received a lot of attention. Many applications that deal with massive data, such as Internet traffic analysis and database mining, motivate this data stream model. In the data stream model, the data is treated as sequences, and the only feasible way of accessing data is through sequential access. This is a more appropriate computational model than the classic random access machine (RAM) model when dealing with massive data sets for which random access is expensive or even impossible. Due to these constraints, many data stream algorithms are randomized and/or compute only an approximation of the exact answer. Designing such data stream algorithms often involves trade-offs between time, space and accuracy. In this thesis we study several problems in this computational model. The first result is on estimating the frequency of each element in a data stream using a small amount of memory. Previous research on this topic has been focused on the algorithms that compute probabilistic results. Our study shows that an element's frequency can be estimated with guaranteed accuracy and we give a near optimal trade-off between space and accuracy in Chapter 3. Then we study the problem of quickly answering range mode and range median queries, which are two of the most important statistics of a data set. We propose the first non-trivial solutions to the approximate versions of the problem, first on one dimensional arrays (Chapter 4), then on matrices in higher (d&ge;2) dimensional space (Chapter 5). Finally, we study one of the earliest data stream problems, namely, sorting large data sets stored on tapes with limited internal memory. There is a gap of a factor of 4 in previous results on the lower bounds and upper bounds. We close this gap in Chapter 6. We also derive the first probabilistic lower bound for the problem.
A Heuristic Method for Selecting Support Features from Large Datasets
Authors: Hong Seo Ryoo, In-Yong Jang
Venue: Proceedings of the 3rd international conference on Algorithmic Aspects in Information and Management (2007)

For feature selection in machine learning, set covering (SC) is most suited, for it selects support features for data under analysis based on the individual and the collective roles of the candidate features. However, the SC-based feature selection requires the complete pair-wise comparisons of the members of the different classes in a dataset, and this renders the meritorious SC principle impracticable for selecting support features from a large number of data.Introducing the notion of implicit SC-based feature selection, this paper presents a feature selection procedure that is equivalent to the standard SC-based feature selection procedure in supervised learning but with the memory requirement that is multiple orders of magnitude less than the counterpart. With experiments on six large machine learning datasets, we demonstrate the usefulness of the proposed implicit SC-based feature selection scheme in large-scale supervised data analysis.
Automatic Image Annotation with Relevance Feedback and Latent Semantic Analysis
Authors: Donn Morrison, Stéphane Marchand-Maillet, Eric Bruno
Venue: Adaptive Multimedial Retrieval: Retrieval, User, and Semantics: 5th International Workshop, AMR 2007, Paris, France, July 5-6, 2007 Revised Selected Papers (2007)

The goal of this paper is to study the image-concept relationship as it pertains to image annotation. We demonstrate how automatic annotation of images can be implemented on partially annotated databases by learning image-concept relationships from positive examples via inter-query learning. Latent semantic analysis (LSA), a method originally designed for text retrieval, is applied to an image/session matrix where relevance feedback examples are collected from a large number of artificial queries (sessions). Singular value decomposition (SVD) is exploited during LSA to propagate image annotations using only relevance feedback information. We will show how SVD can be used to filter a noisy image/session matrix and reconstruct missing values.
Architectural Analysis Approaches: A Component-Based System Development Perspective
Authors: Novia Admodisastro, Gerald Kotonya
Venue: Proceedings of the 10th international conference on Software Reuse: High Confidence Software Reuse in Large Systems (2008)

Component-based system development (CBD) relies on the integration of existing software components to compose systems. These are often black-box components whose functionality and configuration may not match the "ideal" system context. Systematic architectural analysis can ensure that risks resulting from architectural adaptations and trade-offs do not adversely affect critical system qualities (e.g. cost, dependability and system resource constraints). The analysis is likely to reveal not only how well an architecture satisfies a particular system context, but also how change might affect critical system attributes. However, current architectural analysis techniques differ widely in their analytical capabilities and support for reuse-driven development making it difficult for developers to assess their effectiveness in CBD. This paper proposes an evaluation framework based on the design challenges in CBD and uses it to review existing architectural analysis techniques.
Htdp and dmda in the battlefield: a case study in first-year programming instruction
Authors: Annette Bieniusa, Markus Degen, Phillip Heidegger, Peter Thiemann, Stefan Wehr, Martin Gasbichler, Michael Sperber, Marcus Crestani, Herbert Klaeren, Eric Knauel
Venue: Proceedings of the 2008 international workshop on Functional and declarative programming in education (2008)

Teaching the introductory course on programming is hard, even with well-proven didactic methods and material. This is a report on the first-year programming course taught at Tübingen and Freiburg universities. The course builds on the well-developed systematic approaches using functional programming, pioneered by the PLT group. In recent years, we have introduced novel approaches to the teaching process itself. In particular, assisted programming sessions gave the students a solid basis for developing their programming skills. In this paper we trace the development of our approach. Furthermore, we have collected information on how well our course had worked, and how the results together with our experience gained over years have lead to substantial, measurable improvements.
Engineering Systems Which Generate Emergent Functionalities
Authors: Marie-Pierre Gleizes, Valérie Camps, Jean-Pierre Georgé, Davy Capera
Venue: Engineering Environment-Mediated Multi-Agent Systems: International Workshop, EEMMAS 2007, Dresden, Germany, October 5, 2007. Selected Revised and Invited Papers (2008)

Complexity of near future and even nowadays applications is exponentially increasing. In order to tackle the design of such complex systems, being able to engineer self-organising systems is a promising approach. This way, the whole system will autonomously changes its behaviour as its parts locally reorganise themselves, always providing an adapted function. This paper proposes to focus on engineering such systems generating emergent functionalities. We will first define two important concepts to take into account in such a context: Emergence and Self-Organisation. Building on these two concepts, we will highlight three main challenges researchers have to cope with: (i) how to control the system at the macro level by only focusing on the design of agents at the micro level, (ii) what kind of tools, models and guides are needed to develop such systems in order to help designers and (iii) how validation of such systems can be achieved? Each of these three challenges will be explained and positioned in regard to the main existing approaches. Our solutions combining emergence and self-organisation will be expounded for each challenge.
5i: A Design Framework for Hybrid Learning
Authors: Anthony Tik Wong
Venue: Proceedings of the 1st international conference on Hybrid Learning and Education (2008)

Existing challenge in offering education is the use of information technology in delivering contents and providing an interesting platform to enhance students' learning. Hybrid learning is becoming one of the important applications by integrating electronic learning and traditional learning platforms together. Teachers and course designers are interested in how to design a hybrid course in a more effective way. The author proposes a 5i design framework for designing course using hybrid learning approach. The 5i includes initiative, interaction, independent, incentive and improvement. The supporting arguments of the 5i framework are from the most recent and critical literatures in hybrid learning with most updated examples in teaching approaches. The author conducted a qualitative study in collecting feedback about the proposed 5i framework from students who are studying in different programmes and at different years of studies. The purpose of this paper is to suggest a design framework for teachers and course designers to design their hybrid course in a more effective manner.
A Context-Driven Approach to Route Planning
Authors: Hissam Tawfik, Atulya Nagar, Obinna Anya
Venue: Proceedings of the 8th international conference on Computational Science, Part II (2008)

Prototyping urban road network routes improves the accessibility of road layouts and enhances people's use of road networks by providing a framework for the analysis and evaluation of routes based on multiple criteria, such as spatial quality, transportation cost and aesthetics. However features identified in this way do not, often, incorporate information about current road condition in order to proactively provide real-time contextual information to users. Context-aware computing has the potential to provide useful information about current road condition by leveraging on contextual information of people, places and things. A prototype, which uses context information and a range of design and user-related criteria to analyse the accessibility of road layouts and plan routes, is developed. A case study is used to validate the prototype.
Toward a Topic Maps Amanuensis
Authors: Jack Park
Venue: Scaling Topic Maps: Third International Conference on Topic Maps Research and Applications, TMRA 2007 Leipzig, Germany, October 11-12, 2007 Revised Selected Papers (2008)

The CALO project at SRI International provides unique opportunities to explore the boundaries of knowledge representation and organization in a learning environment. A goal reported here is to develop methods for assistance in the preparation of documents through a topic map framework populated by combinations of machine learning and recorded social gestures. This work in progress continues the evolution of Tagomizer, our social bookmarking application, adding features necessary for annotations of websites beyond simple bookmark-like tagging, including the creation of new subjects in the topic map. We report on the coupling of Tagomizer with a Java wiki engine, and show how this new framework will serve as a platform for CALO's DocAssist application.
The structure of games
Authors: Tao Li
Venue:  (2007)

Computer Game Playing has been an active area of research since Samuel&rsquo;s first Checkers player (Samuel 1959). Recently interest beyond the classic games of Chess and Checkers has led to competitions such as the General Game Playing competition, in which players have no beforehand knowledge of the games they are to play, and the Computer Poker Competition which force players to reason about imperfect information under conditions of uncertainty. The purpose of this dissertation is to explore the area of General Game Playing both specifically and generally. On the specific side, we describe the design and implementation of our General Game Playing system OGRE. This system includes an innovative method for feature extraction that helped it to achieve second and fourth place in two international General Game Playing competitions. On the more general side, we also introduce the Regular Game Language, which goes beyond current works to provide support for both stochastic and imperfect information games as well as the more traditional games.
Genome Halving under DCJ Revisited
Authors: Julia Mixtacki
Venue: Proceedings of the 14th annual international conference on Computing and Combinatorics (2008)

The Genome Halving Problem is the following: Given a rearranged duplicated genome, find a perfectly duplicated genome such that the rearrangement distance between these genomes is minimal with respect to a particular model of genome rearrangement. Recently, Warren and Sankoff studied this problem under the general DCJ model where the pre-duplicated genome contains both, linear and circular chromosomes. In this paper, we revisit the Genome Halving Problem for the DCJ distance and we propose a genome model such that constraints for linear genomes, as well as the ones for circular genomes are taken into account. Moreover, we correct an error in the original paper.
The Research of Using Ant Colony Algorithm in Solving Sequencing Problem of Mixed Model Assembly Lines with Multi-objectives
Authors: Qiong Zhu, Lihui Wu, Jie Zhang
Venue: Proceedings of the 4th international conference on Intelligent Computing: Advanced Intelligent Computing Theories and Applications - with Aspects of Artificial Intelligence (2008)

Mixed model assembly lines (MMAL) sequencing problem is a typical NP-hard problem. It's important to search for an optimal sequence to maximize the efficiency of production lines. Therefore this work proposes a new mathematic programming model for measuring the efficiency of MMAL. A modified ant colony algorithm (MACA) is developed to determine a sequence which optimizes the objective function with elitist strategy. The experimental results indicate the applicability of the proposed objective function and availability of the algorithm in solving this problem.
Feature Implementation Modeling Based Product Derivation in Software Product Line
Authors: Xin Peng, Liwei Shen, Wenyun Zhao
Venue: Proceedings of the 10th international conference on Software Reuse: High Confidence Software Reuse in Large Systems (2008)

Although there has been significant research spent on feature modeling and application-oriented customization and some effective methods have been proposed, product derivation in SPL (Software Product Line) development is still a time- and effort-consuming activity due to the complicated mapping between feature model and program implementation. In this paper, we propose a feature implementation modeling based method for product derivation. In the method, feature implementation model is introduced as the intermediate level between feature model and program implementation. The feature implementation model captures feature interactions (including cross-cutting interactions) in the finer role level, and help to clarify the complex mapping between feature and program implementation. So, feature-driven program-level customization and configuration can be enabled by the model and role instantiation. AOP (Aspect-Oriented Programming) is adopted as the implementation technology for product derivation on the program level. Then program-level composition can be implemented by aspect weaving to finally achieve the feature-driven product derivation.
On the Security Analysis of Lee, Hwang & Lee (2004) and Song & Kim (2000) Key Exchange / Agreement Protocols
Authors: Kim-Kwang Raymond Choo
Venue: Informatica (2006)

We revisit the password-based group key exchange protocol due to Lee et al. (2004), which carries a claimed proof of security in the Bresson et al. model under the intractability of the Decisional Diffie-Hellman problem (DDH) and Computational Diffie-Hellman (CDH) problem. We reveal a previously unpublished flaw in the protocol and its proof, whereby we demonstrate that the protocol violates the definition of security in the model. To provide a better insight into the protocol and proof failures, we present a fixed protocol. We hope our analysis will enable similar mistakes to be avoided in the future. We also revisit protocol 4 of Song and Kim (2000), and reveal a previously unpublished flaw in the protocol (i.e., a reflection attack). The views and opinions expressed in this paper do not necessarily reflect those of the Commonwealth Government, the Minister for Justice and Customs, or the Australian Institute of Criminology. Research was performed while the author was with the Information Security Institute / Queensland University of Technology.
Secure E-Passport Protocol Using Elliptic Curve Diffie-Hellman Key Agreement Protocol
Authors: Mohamed Abid, Hossam Afifi
Venue: Proceedings of the 2008 The Fourth International Conference on Information Assurance and Security (2008)

Since 2006, many countries, all over the world, begin to issue E-passports containing biometric data for their citizens. The International Civil Aviation Organization (ICAO) specification for cryptography in E-passport is proven to be insecure and has many threats. The European Union (EU) has defined an Extended Access Control (EAC) mechanism for E-passports. But, even this solution presents many threats especially in security and privacy. In this paper, we present a new method for securing the exchange between an E-passport and the Inspection System IS. We propose an on-line authentication mechanism based on Elliptic Curve Diffie-Hellman Key Agreement Protocol. We create elliptic curve based on biometric data to validate the identity of the user. Our proposal uses a shorter key than others solutions.