Mixed convection laminar flow along a horizontal plate subject to streamwise sinusoidal surface temperature

Mixed convection of a two-dimensional laminar incompressible flow along a horizontal flat plate with streamwise sinusoidal surface temperature has been numerically investigated for different values of Rayleigh number and Reynolds number for constant values of Prandtl number, amplitude and frequency of periodic temperature. The numerical scheme is based on the finite element method adapted to rectangular non-uniform mesh elements by a non-linear parametric solution algorithm. The fluid considered in this study is air. The results are obtained for the Rayleigh number and Reynolds number ranging from 102 to 104 and 1 to 100, respectively, with constant physical properties for the fluid medium considered. Velocity and temperature profiles, streamlines, isotherms, and average Nusselt numbers are presented to observe the effect of the investigating parameters on fluid flow and heat transfer characteristics. The present results show that the convective phenomena are greatly influenced by the variation of Rayleigh numbers and Reynolds number.

Towards a provably secure DoS-Resilient key exchange protocol with perfect forward secrecy

Just Fast Keying (JFK) is a simple, efficient and secure key exchange protocol proposed by Aiello et al. (ACM TISSEC, 2004). JFK is well known for its novel design features, notably its resistance to denial-of-service (DoS) attacks. Using Meadows’ cost-based framework, we identify a new DoS vulnerability in JFK. The JFK protocol is claimed secure in the Canetti-Krawczyk model under the Decisional Diffie-Hellman (DDH) assumption. We show that security of the JFK protocol, when reusing ephemeral Diffie-Hellman keys, appears to require the Gap Diffie-Hellman (GDH) assumption in the random oracle model. We propose a new variant of JFK that avoids the identified DoS vulnerability and provides perfect forward secrecy even under the DDH assumption, achieving the full security promised by the JFK protocol.

Efficient modular exponentiation-based puzzles for denial-of-service protection

Client puzzles are moderately-hard cryptographic problems neither easy nor impossible to solve that can be used as a counter-measure against denial of service attacks on network protocols. Puzzles based on modular exponentiation are attractive as they provide important properties such as non-parallelisability, deterministic solving time, and linear granularity. We propose an efficient client puzzle based on modular exponentiation. Our puzzle requires only a few modular multiplications for puzzle generation and verification. For a server under denial of service attack, this is a significant improvement as the best known non-parallelisable puzzle proposed by Karame and Capkun (ESORICS 2010) requires at least 2k-bit modular exponentiation, where k is a security parameter. We show that our puzzle satisfies the unforgeability and difficulty properties defined by Chen et al. (Asiacrypt 2009). We present experimental results which show that, for 1024-bit moduli, our proposed puzzle can be up to 30 times faster to verify than the Karame-Capkun puzzle and 99 times faster than the Rivest et al.'s time-lock puzzle.

Attractive subfamilies of BLS curves for implementing high-security pairings

Barreto-Lynn-Scott (BLS) curves are a stand-out candidate for implementing high-security pairings. This paper shows that particular choices of the pairing-friendly search parameter give rise to four subfami- lies of BLS curves, all of which offer highly efficient and implementation- friendly pairing instantiations. Curves from these particular subfamilies are defined over prime fields that support very efficient towering options for the full extension field. The coefficients for a specific curve and its correct twist are automat-ically determined without any computational effort. The choice of an extremely sparse search parameter is immediately reflected by a highly efficient optimal ate Miller loop and final exponentiation. As a resource for implementors, we give a list with examples of implementation-friendly BLS curves through several high-security levels.

Towards lifelong navigation and mapping in an office environment

This paper addresses the challenge of developing robots that map and navigate autonomously in real world, dynamic environments throughout the robot’s entire lifetime – the problem of lifelong navigation. Static mapping algorithms can produce highly accurate maps, but have found few applications in real environments that are in constant flux. Environments change in many ways: both rapidly and gradually, transiently and permanently, geometrically and in appearance. This paper demonstrates a biologically inspired navigation algorithm, RatSLAM, that uses principles found in rodent neural circuits. The algorithm is demonstrated in an office delivery challenge where the robot was required to perform mock deliveries to goal locations in two different buildings. The robot successfully completed 1177 out of 1178 navigation trials over 37 hours of around the clock operation spread over 11 days.

Introduction to the First International Workshop on Empirical Research in Business Process Management (ER-BPM 2009)

Providing effective IT support for business processes has become crucial for enterprises to stay competitive. In response to this need numerous process support paradigms (e.g., workflow management, service flow management, case handling), process specification standards (e.g., WS-BPEL, BPML, BPMN), process tools (e.g., ARIS Toolset, Tibco Staffware, FLOWer), and supporting methods have emerged in recent years. Summarized under the term “Business Process Management” (BPM), these paradigms, standards, tools, and methods have become a success-critical instrument for improving process performance.

Quo Vadis? Reliable and Practical Rule Extraction from Neural Networks

Rule extraction from neural network algorithms have been investigated for two decades and there have been significant applications. Despite this level of success, rule extraction from neural network methods are generally not part of data mining tools, and a significant commercial breakthrough may still be some time away. This paper briefly reviews the state-of-the-art and points to some of the obstacles, namely a lack of evaluation techniques in experiments and larger benchmark data sets. A significant new development is the view that rule extraction from neural networks is an interactive process which actively involves the user. This leads to the application of assessment and evaluation techniques from information retrieval which may lead to a range of new methods.

Regulations and policy measures related to the reduction of ambient particulate matter

-

Overview of INEX 2008 Link the Wiki Track

The Link the Wiki track at INEX 2008 offered two tasks, file-to-file link discovery and anchor-to-BEP link discovery. In the former 6600 topics were used and in the latter 50 were used. Manual assessment of the anchor-to-BEP runs was performed using a tool developed for the purpose. Runs were evaluated using standard precision & recall measures such as MAP and precision / recall graphs. 10 groups participated and the approaches they took are discussed. Final evaluation results for all runs are presented.

Privacy compliance verification in cryptographic protocols

To provide privacy protection, cryptographic primitives are frequently applied to communication protocols in an open environment (e.g. the Internet). We call these protocols privacy enhancing protocols (PEPs) which constitute a class of cryptographic protocols. Proof of the security properties, in terms of the privacy compliance, of PEPs is desirable before they can be deployed. However, the traditional provable security approach, though well-established for proving the security of cryptographic primitives, is not applicable to PEPs. We apply the formal language of Coloured Petri Nets (CPNs) to construct an executable specification of a representative PEP, namely the Private Information Escrow Bound to Multiple Conditions Protocol (PIEMCP). Formal semantics of the CPN specification allow us to reason about various privacy properties of PIEMCP using state space analysis techniques. This investigation provides insights into the modelling and analysis of PEPs in general, and demonstrates the benefit of applying a CPN-based formal approach to the privacy compliance verification of PEPs.

The association between maternal infant feeding practices and child weight at 11-17 months in first-time Australian mothers

Introduction: Emerging evidence reveals that early feeding practices are associated with child food intake, eating behaviour and weight status. This cross-sectional analysis examined the association between maternal infant feeding practices/beliefs and child weight in Australian infants aged 11-17 months. Methods: Participants were 293 first-time mothers of healthy term infants (144 boys, mean age 14±1 months) enrolled in the NOURISH RCT. Mothers self-reported infant feeding practices and beliefs using the Infant Feeding Questionnaire (Baughcum, 2001). Anthropometric data were also measured at baseline (infants aged 4 months). Multiple regression analysis was used, adjusting for infant age, gender, birth weight, infant feeding mode (breast vs. formula), maternal perceptions of infant weight status, pre-pregnancy weight, weight concern, age and education. Results: The average child weight-for-age z-score (WAZ) was 0.62±0.83 (range:-1.56 to 2.94) and the mean change in WAZ (WAZ change) from 4 to 14 months was 0.62±0.69 (range:-1.50 to 2.76). Feeding practices/beliefs partly explained child WAZ (R2=0.28) and WAZ change (R2=0.13) in the adjusted models. While child weight status at 14 months was inversely associated with responsive feeding (e.g. baby feeds whenever she wants, feeding to stop baby being unsettled) (β=-0.104, p=0.06) and maternal concern about the child becoming underweight (β=-0.224, p<0.001), it was positively associated with mother’s concern about child overweight (β=0.197, p<0.05). Birth weight, infant’s age, maternal weight concern and perceiving her child as overweight were significant covariates. WAZ change was only significantly associated with responsive feeding (β=-0.147, p<0.05). Conclusion: Responsive feeding may be an important strategy to promote healthy child weight.

Childbirth and the development of acute trauma symptoms : incidence and contributing factors

Background: Little is known about the relationship between women's birthing experiences and the development of trauma symptoms. This study aimed to determine the incidence of acute trauma symptoms and posttraumatic stress disorder in women as a result of their labor and birth experiences, and to identify factors that contributed to the women's psychological distress. Method: Using a prospective, longitudinal design, women in their last trimester of pregnancy were recruited from four public hospital antenatal clinics. Telephone interviews with 499 participants were conducted at 4 to 6 weeks postpartum to explore the medical and midwifery management of the birth, perceptions of intrapartum care, and the presence of trauma symptoms. Results: One in three women (33%) identified a traumatic birthing event and reported the presence of at least three trauma symptoms. Twenty-eight women (5.6%) met DSM-IV criteria for acute posttraumatic stress disorder. Antenatal variables did not contribute to the development of acute or chronic trauma symptoms. The level of obstetric intervention experienced during childbirth (β= 0.351, p < 0.0001)and the perception of inadequate intrapartum care (β= 0.319, p < 0.0001) during labor were consistently associated with the development of acute trauma symptoms. Conclusions: Posttraumatic stress disorder after childbirth is a poorly recognized phenomenon. Women who experienced both a high level of obstetric intervention and dissatisfaction with their intrapartum care were more likely to develop trauma symptoms than women who received a high level of obstetric intervention or women who perceived their care to be inadequate. These findings should prompt a serious review of intrusive obstetric intervention during labor and delivery, and the care provided to birthing women.

Measuring bitrate and quality trade-off in a fast region-of-interest based video coding

Prevailing video adaptation solutions change the quality of the video uniformly throughout the whole frame in the bitrate adjustment process; while region-of-interest (ROI)-based solutions selectively retains the quality in the areas of the frame where the viewers are more likely to pay more attention to. ROI-based coding can improve perceptual quality and viewer satisfaction while trading off some bandwidth. However, there has been no comprehensive study to measure the bitrate vs. perceptual quality trade-off so far. The paper proposes an ROI detection scheme for videos, which is characterized with low computational complexity and robustness, and measures the bitrate vs. quality trade-off for ROI-based encoding using a state-of-the-art H.264/AVC encoder to justify the viability of this type of encoding method. The results from the subjective quality test reveal that ROI-based encoding achieves a significant perceptual quality improvement over the encoding with uniform quality at the cost of slightly more bits. Based on the bitrate measurements and subjective quality assessments, the bitrate and the perceptual quality estimation models for non-scalable ROI-based video coding (AVC) are developed, which are found to be similar to the models for scalable video coding (SVC).

Group law computations on Jacobians of hyperelliptic Curves

We derive an explicit method of computing the composition step in Cantor’s algorithm for group operations on Jacobians of hyperelliptic curves. Our technique is inspired by the geometric description of the group law and applies to hyperelliptic curves of arbitrary genus. While Cantor’s general composition involves arithmetic in the polynomial ring F_q[x], the algorithm we propose solves a linear system over the base field which can be written down directly from the Mumford coordinates of the group elements. We apply this method to give more efficient formulas for group operations in both affine and projective coordinates for cryptographic systems based on Jacobians of genus 2 hyperelliptic curves in general form.

Approximate clone detection in repositories of business process models

Evidence exists that repositories of business process models used in industrial practice contain significant amounts of duplication. This duplication may stem from the fact that the repository describes variants of the same pro- cesses and/or because of copy/pasting activity throughout the lifetime of the repository. Previous work has put forward techniques for identifying duplicate fragments (clones) that can be refactored into shared subprocesses. However, these techniques are limited to finding exact clones. This paper analyzes the prob- lem of approximate clone detection and puts forward two techniques for detecting clusters of approximate clones. Experiments show that the proposed techniques are able to accurately retrieve clusters of approximate clones that originate from copy/pasting followed by independent modifications to the copied fragments.