Abstract: Design is often seen at the heart of software engineering, a practice directed at the production of software systems. While research examining user involvement in designing systems for people with special needs has yielded insights into methodological considerations, work on involving users with SpLDs has often focused on design implications of tools or applications [1-3]

Abstract: Leakage.- Circular and Leakage Resilient Public-Key Encryption under Subgroup Indistinguishability.- Leakage-Resilient Pseudorandom Functions and Side-Channel Attacks on Feistel Networks.- Protecting Cryptographic Keys against Continual Leakage.- Securing Computation against Continuous Leakage.- Lattice.- An Efficient and Parallel Gaussian Sampler for Lattices.- Lattice Basis Delegation in Fixed Dimension and Shorter-Ciphertext Hierarchical IBE.- Homomorphic Encryption.- Toward Basing Fully Homomorphic Encryption on Worst-Case Hardness.- Additively Homomorphic Encryption with d-Operand Multiplications.- i-Hop Homomorphic Encryption and Rerandomizable Yao Circuits.- Theory and Applications.- Interactive Locking, Zero-Knowledge PCPs, and Unconditional Cryptography.- Fully Secure Functional Encryption with General Relations from the Decisional Linear Assumption.- Structure-Preserving Signatures and Commitments to Group Elements.- Efficient Indifferentiable Hashing into Ordinary Elliptic Curves.- Key Exchange, OAEP/RSA, CCA.- Credential Authenticated Identification and Key Exchange.- Password-Authenticated Session-Key Generation on the Internet in the Plain Model.- Instantiability of RSA-OAEP under Chosen-Plaintext Attack.- Efficient Chosen-Ciphertext Security via Extractable Hash Proofs.- Attacks.- Factorization of a 768-Bit RSA Modulus.- Correcting Errors in RSA Private Keys.- Improved Differential Attacks for ECHO and Grostl.- A Practical-Time Related-Key Attack on the KASUMI Cryptosystem Used in GSM and 3G Telephony.- Composition.- Universally Composable Incoercibility.- Concurrent Non-Malleable Zero Knowledge Proofs.- Equivalence of Uniform Key Agreement and Composition Insecurity.- Computation Delegation and Obfuscation.- Non-interactive Verifiable Computing: Outsourcing Computation to Untrusted Workers.- Improved Delegation of Computation Using Fully Homomorphic Encryption.- Oblivious RAM Revisited.- On Strong Simulation and Composable Point Obfuscation.- Multiparty Computation.- Protocols for Multiparty Coin Toss with Dishonest Majority.- Multiparty Computation for Dishonest Majority: From Passive to Active Security at Low Cost.- Secure Multiparty Computation with Minimal Interaction.- A Zero-One Law for Cryptographic Complexity with Respect to Computational UC Security.- Pseudorandomness.- On Generalized Feistel Networks.- Cryptographic Extraction and Key Derivation: The HKDF Scheme.- Time Space Tradeoffs for Attacks against One-Way Functions and PRGs.- Pseudorandom Functions and Permutations Provably Secure against Related-Key Attacks.- Quantum.- Secure Two-Party Quantum Evaluation of Unitaries against Specious Adversaries.- On the Efficiency of Classical and Quantum Oblivious Transfer Reductions.- Sampling in a Quantum Population, and Applications.

Abstract: Flow cytometry is widely used for single cell interrogation of surface and intracellular protein expression by measuring fluorescence intensity of fluorophore-conjugated reagents. We focus on the recently developed procedure of Pyne et al. (2009, Proceedings of the National Academy of Sciences USA 106, 8519-8524) for automated high- dimensional flow cytometric analysis called FLAME (FLow analysis with Automated Multivariate Estimation). It introduced novel finite mixture models of heavy-tailed and asymmetric distributions to identify and model cell populations in a flow cytometric sample. This approach robustly addresses the complexities of flow data without the need for transformation or projection to lower dimensions. It also addresses the critical task of matching cell populations across samples that enables downstream analysis. It thus facilitates application of flow cytometry to new biological and clinical problems. To facilitate pipelining with standard bioinformatic applications such as high-dimensional visualization, subject classification or outcome prediction, FLAME has been incorporated with the GenePattern package of the Broad Institute. Thereby analysis of flow data can be approached similarly as other genomic platforms. We also consider some new work that proposes a rigorous and robust solution to the registration problem by a multi-level approach that allows us to model and register cell populations simultaneously across a cohort of high-dimensional flow samples. This new approach is called JCM (Joint Clustering and Matching). It enables direct and rigorous comparisons across different time points or phenotypes in a complex biological study as well as for classification of new patient samples in a more clinical setting.

Abstract: A run is an inclusion maximal occurrence in a string (as a subinterval) of a repetition v with a period p such that 2p≤|v|. The maximal number of runs in a string of length n has been thoroughly studied, and is known to be between 0.944 n and 1.029 n. In this paper we investigate cubic runs, in which the shortest period p satisfies 3p≤|v|. We show the upper bound of 0.5 n on the maximal number of such runs in a string of length n, and construct an infinite sequence of words over binary alphabet for which the lower bound is 0.406 n.

Abstract: While qualitative analyses of the problems involved in building natural language interfaces (NLIs) have been available, a quantitative grounding in empirical data has been missing. We fill this gap ...

Abstract: This book constitutes the refereed proceedings of the 12th International Workshop on Cryptographic Hardware and Embedded Systems, CHES 2010, held in Santa Barbara, USA during August 17-20, 2010. This year it was co-located with the 30th International Cryptology Conference (CRYPTO). The book contains 2 invited talks and 30 revised full papers which were carefully reviewed and selected from from 108 submissions. The papers are organized in topical sections on low cost cryptography, efficient implementation, side-channel attacks and countermeasures, tamper resistance, hardware trojans, PUFs and RNGs.

Abstract: Keynote 1.- Code Roots.- Programming Environments and Tools.- Detecting Missing Method Calls in Object-Oriented Software.- Debugging Model-Transformation Failures Using Dynamic Tainting.- Automatically Extracting Class Diagrams from Spreadsheets.- Theoretical Foundations of Programming Languages.- Adding Dynamic Types to C .- Essential AOP: The A Calculus.- The Essence of JavaScript.- Formal Methods.- Verifying Executable Object-Oriented Specifications with Separation Logic.- Verifying Generics and Delegates.- Recency Types for Analyzing Scripting Languages.- Concurrency Models in Java.- Correct Refactoring of Concurrent Java Code.- Programming Coordinated Behavior in Java.- JCoBox: Generalizing Active Objects to Concurrent Components.- Special Session: Empirical Methods.- Doubts about the Positive Impact of Static Type Systems on Programming Tasks in Single Developer Projects - An Empirical Study.- Type Systems.- A Type System for Data-Centric Synchronization.- Type-Safe Eventful Sessions in Java.- Capabilities for Uniqueness and Borrowing.- Keynote 2.- Secret Valley.- Language Design and Implementation.- Embedding Languages without Breaking Tools.- Modules as Objects in Newspeak.- Inline Caching Meets Quickening.- Concurrency Abstractions.- Self-Replicating Objects for Multicore Platforms.- Reasoning about the Implementation of Concurrency Abstractions on x86-TSO.- Concurrent Abstract Predicates.- Experiences.- The Use of Overloading in Java Programs.- Falling Back on Executable Specifications.- Contract-Based Data Structure Repair Using Alloy.

Abstract: Business process models can be compared, for example, to determine their consistency. Any comparison between process models relies on a mapping that identifies which activity in one model corresponds to which activity in another. Tools that generate such mappings are called matchers. This paper presents the ICoP framework, which can be used to develop such matchers. It consists of an architecture and re-usable matcher components. The framework enables the creation of matchers from the re-usable components and, if desired, newly developed components. It focuses on matchers that also detect complex correspondences between groups of activities, where existing matchers focus on 1:1 correspondences. We evaluate the framework by applying it to find matches in process models from practice. We show that the framework can be used to develop matchers in a flexible and adaptable manner and that the resulting matchers can identify a significant number of complex correspondences.

Abstract: To enable computers to listen, speak, see, and learn like humans, and even more to build computers that analyze, infer, predict, and make decisions better than humans is the ultimate dream of artificial intelligence. In the near future, we envision that with advanced AI technologies each person and each enterprise will have multiple intelligent computer assistants to help accomplish various tasks with results that are as good or even better than if they were performed by humans. Huawei Technologies, one of the major telecommunication equipment and service companies in the world, is also conducting research toward this noble goal of AI. In this talk, I will introduce some progresses which Huawei, and particularly its Noah’ Ark Lab, have made recently, including a platform for deep learning research, natural language processing using deep learning, construction and utilization of large-scale knowledge base in telecommunication domain. Bio. Hang Li is director of the Noah’s Ark Lab of Huawei Technologies. His research areas include natural language processing, information retrieval, statistical machine learning, and data mining. He graduated from Kyoto University in 1988 and earned his PhD from the University of Tokyo in 1998. He worked at the NEC lab in Japan during 1991 and 2001, and Microsoft Research Asia during 2001 and 2012.

Abstract: This volume brings together, through a peer-revision process, the advanced research results obtained by the European COST Action 2102: Cross-Modal Analysis of Verbal and Nonverbal Communication, primarily discussed for the first time at the Second COST 2102 International Training School on “Development of Multimodal Interfaces: Active Listening and Synchrony” held in Dublin, Ireland, March 23–27 2009. The school was sponsored by COST (European Cooperation in the Field of Scientific and Technical Research, www.cost.esf.org ) in the domain of Information and Communication Technologies (ICT) for disseminating the advances of the research activities developed within the COST Action 2102: “Cross-Modal Analysis of Verbal and Nonverbal Communication” (cost2102.cs.stir.ac.uk).

Abstract: PunchScan is a precinct-read optical-scan balloting system that allows voters to take their ballot with them after scanning This does not violate the secret ballot principle because the ballots cannot be read without secret information held by the distributed authority in charge of the election In fact, this election authority will publish the ballots for everyone to see, allowing voters whose ballots were incorrectly omitted to complain PunchScan vote-counting is performed in private by the election authority – who uses their secret information to decode the ballots – but is verified in public by an auditorIn this paper we describe how and why PunchScan works We have kept most of the description at an outline level so that it may be used as a straw model of a cryptographic voting system

Abstract: Embedded systems engineering problems often involve many domains, each with their own experts and tools. To help these experts with analysis and decision making in their domain, it is desirable to present them with a view of the system that is tailored to their particular task. In this paper, a model integration framework is demonstrated to address issues associated with multi-view modeling. The Systems Modeling Language (OMG SysMLTM) is used as a general language to represent a common model for the system as well as the dependencies between the different domain-specific tools and languages. To maintain consistency between these domain-specific views, model transformations are defined that map the interdependent constructs to and from a common SysML model. The approach is illustrated bymeans of amechatronic design problem involving views in multiple domain-specific tools, namely EPLAN FluidTM (to create production ready layouts) and Modelica® (for dynamic system analysis).

Abstract: A number of wireless sensor network (WSN) applications demand timely data delivery. However, existing WSNs are designed to conserve energy and not to support timely data transmission. This paper shows how WSNs can be dimensioned, deployed and operated such that both reliable and timely data delivery is ensured while scarce energy is preserved. The presented solution employs a novel Medium Access Control (MAC) protocol that incorporates topology control mechanisms to ensure timely data delivery and reliability control mechanisms to deal with inherently fluctuating wireless links. An industrial process automation and control scenario at an oil refinery in Portugal is used to define protocol requirements. The paper details a TinyOS implementation of the protocol and its evaluation in a testbed. Under high traffic load, the protocol delivers 100% of data in time using a maximum node duty cycle as little as 2.48%. In an idle network a maximum node duty cycle of only 0.62% is achieved. This proposed protocol is thus an extremely energy efficient solution for time-critical data delivery.

Abstract: In this paper, we analyze the literature on Formal Concept Analysis (FCA) using FCA. We collected 702 papers published between 2003-2009 mentioning Formal Concept Analysis in the abstract. We developed a knowledge browsing environment to support our literature analysis process. The pdf-files containing the papers were converted to plain text and indexed by Lucene using a thesaurus containing terms related to FCA research. We use the visualization capabilities of FCA to explore the literature, to discover and conceptually represent the main research topics in the FCA community. As a case study, we zoom in on the 140 papers on using FCA in knowledge discovery and data mining and give an extensive overview of the contents of this literature.

Abstract: Concept lattices built on noisy data tend to be large and hence hard to interpret. We introduce several measures that can be used in selecting relevant concepts and discuss how they can be combined together. We study their performance in a series of experiments.

Abstract: We present PARAM 1.0, a model checker for parametric discrete-time Markov chains (PMCs) PARAM can evaluate temporal properties of PMCs and certain extensions of this class Due to parametricity, evaluation results are polynomials or rational functions By instantiating the parameters in the result function, one can cheaply obtain results for multiple individual instantiations, based on only a single more expensive analysis In addition, it is possible to post-process the result function symbolically using for instance computer algebra packages, to derive optimum parameters or to identify worst cases.

Abstract: To ensure the quality of an information system, the conceptual schema that represents its domain must be semantically correct. We present a prototype to automatically check whether a UML schema with OCL constraints is right in this sense. It is well known that the full expressiveness of OCL leads to undecidability of reasoning. To deal with this problem, our approach finds a compromise between expressiveness and decidability, thus being able to handle very expressive constraints guaranteeing termination in many cases.

Abstract: Why should wait for some days to get or receive the software product lines going beyond 14th international conference splc 2010 jeju island south k book that you order? Why should you take it if you can get the faster one? You can find the same book that you order right here. This is it the book that you can receive directly after purchasing. This software product lines going beyond 14th international conference splc 2010 jeju island south k is well known book in the world, of course many people will try to own it. Why don't you become the first? Still confused with the way?

Abstract: There has been a growing interest in the philosophy and constituents of design research by a vast amount of IS-scholars There are several unresolved concerns and issues in design research (DR) Some examples are the outcomes of design research, the role of theorizing in DR, how to conduct evaluation and validation, and the need for different grounding processes to generate valid knowledge from design research endeavors This paper describes a multi-grounded approach for design research; consisting of three types of grounding processes (theoretical, empirical and internal grounding) The purpose is to investigate DR-based design knowledge and its roles during design research and design practice A key feature in this approach is the division between the meta-design (within design research) producing abstract design knowledge and the empirical design practice producing situational knowledge and artefacts The multi-grounding approach to design research will be illustrated by the support of two design cases.