Query: Square Root SAM: Simultaneous Localization and Mapping via Square Root Information Smoothing

Relevant passages:
Factor graphs and the sum-product algorithm <=SEP=> Algorithms that must deal with complicated global functions of many variables often exploit the manner in which the given functions factor as a product of “local” functions, each of which depends on a subset of the variables. Such a factorization can be visualized with a bipartite graph that we call afactor graph. In this tutorial paper, we present a generic message-passing algorithm, the sum-product algorithm, that operates in a factor graph. Following a single, simple computational rule, the sum-product algorithm computes—either exactly or approximately—various marginal functions derived from the global function. A wide variety of algorithms developed in artificial intelligence, signal processing, and digital communications can be derived as specific instances of the sum-product algorithm, including the forward/backward algorithm, the Viterbi algorithm, the iterative “turbo” decoding algorithm, Pearl’s belief propagation algorithm for Bayesian networks, the Kalman filter, and certain fast Fourier transform (FFT) algorithms.

A column approximate minimum degree ordering algorithm <=SEP=> Sparse Gaussian elimination with partial pivoting computes the factorization <b>PAQ</b> = <b>LU</b> of a sparse matrix <b>A</b>, where the row ordering <b>P</b> is selected during factorization using standard partial pivoting with row interchanges. The goal is to select a column preordering, <b>Q</b>, based solely on the nonzero pattern of <b>A</b>, that limits the worst-case number of nonzeros in the factorization. The fill-in also depends on <b>P</b>, but <b>Q</b> is selected to reduce an upper bound on the fill-in for any subsequent choice of <b>P</b>. The choice of <b>Q</b> can have a dramatic impact on the number of nonzeros in <b>L</b> and <b>U</b>. One scheme for determining a good column ordering for <b>A</b> is to compute a symmetric ordering that reduces fill-in in the Cholesky factorization of <b>A<sup>T</sup>A</b>. A conventional minimum degree ordering algorithm would require the sparsity structure of <b>A<sup>T</sup>A</b> to be computed, which can be expensive both in terms of space and time since <b>A<sup>T</sup>A</b> may be much denser than <b>A</b>. An alternative is to compute <b>Q</b> directly from the sparsity structure of <b>A</b>; this strategy is used by MATLAB's COLMMD preordering algorithm. A new ordering algorithm, COLAMD, is presented. It is based on the same strategy but uses a better ordering heuristic. COLAMD is faster and computes better orderings, with fewer nonzeros in the factors of the matrix.

Simultaneous map building and localization for an autonomous mobile robot <=SEP=> In this paper, we discuss a significant open problem in mobile robotics: simultaneous map building and localization, which we define as long-term globally referenced position estimation without a priori information. This problem is difficult because of the following paradox: to move precisely, a mobile robot must have an accurate environment map; however, to build an accurate map, the mobile robot’s sensing locations must be known precisely. In this way, simultaneous map building and localization can be seen to present a question of “which came first, the chicken or the egg?” (The map or the motion?) When using ultrasonic sensing, to overcome this issue we equip the vehicle with multiple servo-mounted sonar sensors, to provide a means in which a subset of environment features can be precisely learned from the robot’s initial location and subsequently tracked to provide precise positioning.

The generalized distributive law <=SEP=> In this semitutorial paper we discuss a general message passing algorithm, which we call the generalized distributive law (GDL). The GDL is a synthesis of the work of many authors in the information theory, digital communications, signal processing, statistics, and artificial intelligence communities. It includes as special cases the Baum–Welch algorithm, the fast Fourier transform (FFT) on any finite Abelian group, the Gallager–Tanner–Wiberg decoding algorithm, Viterbi’s algorithm, the BCJR algorithm, Pearl’s “belief propagation” algorithm, the Shafer–Shenoy probability propagation algorithm, and the turbo decoding algorithm. Although this algorithm is guaranteed to give exact answers only in certain cases (the “junction tree” condition), unfortunately not including the cases of GTW with cycles or turbo decoding, there is much experimental evidence, and a few theorems, suggesting that it often works approximately even when it is not supposed to.

A recursive approach to low complexity codes <=SEP=> A bstruciA method is described for constructing long error-correcting codes from one or more shorter error-correcting codes, referred to as subcodes, and a bipartite graph. A graph is shown which specifies carefully chosen subsets of the digits of the new codes that must be codewords in one of the shorter subcodes. Lower bounds to the rate and the minimum distance of the new code are derived in terms of the parameters of the graph and the subcodes. Both the encoders and decoders proposed are shown to take advantage of the code’s explicit decomposition into subcodes to decompose and simplify the associated computational processes. Bounds on the performance of two specific decoding algorithms are established, and the asymptotic growth of the complexity of decoding for two types of codes and decoders is analyzed. The proposed decoders are able to mahe effective use of probabilistic information supplied by the channel receiver, e.g., reliability information, without greatly increasing the number of computations required. It is shown that choosing a transmission order for the digits that is appropriate for the graph and the subcodes can give the code excellent burst-error correction abilities. The construction principles are illustrated by several examples.

Stiffness analysis for a 3-PUU parallel kinematic machine <=SEP=> This paper presents the stiffness characteristics of a three-prismatic-universal–universal (3-PUU) translational parallel kinematic machine (PKM). The stiffness matrix is derived intuitively based upon an alternative approach considering actuations and constraints, and the compliances subject to both actuators and legs are involved in the stiffness model. The stiffness performance of the manipulator is evaluated by utilizing the extremum stiffness values, and the influences of design parameters on the stiffness properties are presented, which will be valuable for the architecture design of a 3-PUU PKM. Moreover, the stiffness behavior of the PKM is investigated via the eigenscrew decomposition of the stiffness matrix, which provides a physical interpretation of the PKM stiffness and allows the identification of the stiffness center and compliant axis. 2007 Elsevier Ltd. All rights reserved.

Controllable Text Generation <=SEP=> Generic generation and manipulation of text is challenging and has limited success compared to recent deep generative modeling in visual domain. This paper aims at generating plausible natural language sentences, whose attributes are dynamically controlled by learning disentangled latent representations with designated semantics. We propose a new neural generative model which combines variational auto-encoders and holistic attribute discriminators for effective imposition of semantic structures. With differentiable approximation to discrete text samples, explicit constraints on independent attribute controls, and efficient collaborative learning of generator and discriminators, our model learns highly interpretable representations from even only word annotations, and produces realistic sentences with desired attributes. Quantitative evaluation validates the accuracy of sentence and attribute generation.

Large-scale visual sentiment ontology and detectors using adjective noun pairs <=SEP=> We address the challenge of sentiment analysis from visual content. In contrast to existing methods which infer sentiment or emotion directly from visual low-level features, we propose a novel approach based on understanding of the visual concepts that are strongly related to sentiments. Our key contribution is two-fold: first, we present a method built upon psychological theories and web mining to automatically construct a large-scale Visual Sentiment Ontology (VSO) consisting of more than 3,000 Adjective Noun Pairs (ANP). Second, we propose SentiBank, a novel visual concept detector library that can be used to detect the presence of 1,200 ANPs in an image. The VSO and SentiBank are distinct from existing work and will open a gate towards various applications enabled by automatic sentiment analysis. Experiments on detecting sentiment of image tweets demonstrate significant improvement in detection accuracy when comparing the proposed SentiBank based predictors with the text-based approaches. The effort also leads to a large publicly available resource consisting of a visual sentiment ontology, a large detector library, and the training/testing benchmark for visual sentiment analysis.

A DNA nanorobot functions as a cancer therapeutic in response to a molecular trigger in vivo <=SEP=> Nanoscale robots have potential as intelligent drug delivery systems that respond to molecular triggers. Using DNA origami we constructed an autonomous DNA robot programmed to transport payloads and present them specifically in tumors. Our nanorobot is functionalized on the outside with a DNA aptamer that binds nucleolin, a protein specifically expressed on tumor-associated endothelial cells, and the blood coagulation protease thrombin within its inner cavity. The nucleolin-targeting aptamer serves both as a targeting domain and as a molecular trigger for the mechanical opening of the DNA nanorobot. The thrombin inside is thus exposed and activates coagulation at the tumor site. Using tumor-bearing mouse models, we demonstrate that intravenously injected DNA nanorobots deliver thrombin specifically to tumor-associated blood vessels and induce intravascular thrombosis, resulting in tumor necrosis and inhibition of tumor growth. The nanorobot proved safe and immunologically inert in mice and Bama miniature pigs. Our data show that DNA nanorobots represent a promising strategy for precise drug delivery in cancer therapy.

60-GHz Millimeter-Wave Life Detection System (MLDS) for Noncontact Human Vital-Signal Monitoring <=SEP=> A first reported experimental study of a 60 GHz millimeter-wave life detection system (MLDS) for noncontact human vital-signal monitoring is presented. This detection system is constructed by using V-band millimeter-wave waveguide components. A clutter canceller is implemented in the system with an adjustable attenuator and phase shifter. It performs clutter cancellation for the transmitting power leakage from the circulator and background reflection to enhance the detecting sensitivity of weak vital signals. The noncontact vital signal measurements have been conducted on a human subject in four different physical orientations from distances of 1 and 2 m. The time-domain and spectrum waveforms of the measured breathing and heartbeat are presented. This prototype system will be useful for the development of the 60-GHz CMOS MLDS detector chip design.

Working-memory capacity protects model-based learning from stress. <=SEP=> Accounts of decision-making have long posited the operation of separate, competing valuation systems in the control of choice behavior. Recent theoretical and experimental advances suggest that this classic distinction between habitual and goal-directed (or more generally, automatic and controlled) choice may arise from two computational strategies for reinforcement learning, called model-free and model-based learning. Popular neurocomputational accounts of reward processing emphasize the involvement of the dopaminergic system in model-free learning and prefrontal, central executive-dependent control systems in model-based choice. Here we hypothesized that the hypothalamic-pituitary-adrenal (HPA) axis stress response--believed to have detrimental effects on prefrontal cortex function--should selectively attenuate model-based contributions to behavior. To test this, we paired an acute stressor with a sequential decision-making task that affords distinguishing the relative contributions of the two learning strategies. We assessed baseline working-memory (WM) capacity and used salivary cortisol levels to measure HPA axis stress response. We found that stress response attenuates the contribution of model-based, but not model-free, contributions to behavior. Moreover, stress-induced behavioral changes were modulated by individual WM capacity, such that low-WM-capacity individuals were more susceptible to detrimental stress effects than high-WM-capacity individuals. These results enrich existing accounts of the interplay between acute stress, working memory, and prefrontal function and suggest that executive function may be protective against the deleterious effects of acute stress.

Service-Oriented Architecture for Big Data Analytics in Smart Cities <=SEP=> A smart city has recently become an aspiration for many cities around the world. These cities are looking to apply the smart city concept to improve sustainability, quality of life for residents, and economic development. The smart city concept depends on employing a wide range of advanced technologies to improve the performance of various services and activities such as transportation, energy, healthcare, and education, while at the same time improve the city's resources utilization and initiate new business opportunities. One of the promising technologies to support such efforts is the big data technology. Effective and intelligent use of big data accumulated over time in various sectors can offer many advantages to enhance decision making in smart cities. In this paper we identify the different types of decision making processes involved in smart cities. Then we propose a service-oriented architecture to support big data analytics for decision making in smart cities. This architecture allows for integrating different technologies such as fog and cloud computing to support different types of analytics and decision-making operations needed to effectively utilize available big data. It provides different functions and capabilities to use big data and provide smart capabilities as services that the architecture supports. As a result, different big data applications will be able to access and use these services for varying proposes within the smart city.

A Scoring Function for Learning Bayesian Networks based on Mutual Information and Conditional Independence Tests <=SEP=> We propose a new scoring function for learning Bayesian networks from data using score+search algorithms. This is based on the concept of mutual information and exploits some well-known properties of this measure in a novel way. Essentially, a statistical independence test based on the chi-square distribution, associated with the mutual information measure, together with a property of additive decomposition of this measure, are combined in order to measure the degree of interaction between each variable and its parent variables in the network. The result is a non-Bayesian scoring function called MIT (mutual information tests) which belongs to the family of scores based on information theory. The MIT score also represents a penalization of the Kullback-Leibler divergence between the joint probability distributions associated with a candidate network and with the available data set. Detailed results of a complete experimental evaluation of the proposed scoring function and its comparison with the well-known K2, BDeu and BIC/MDL scores are also presented.

A data mining approach for location prediction in mobile environments <=SEP=> Mobility prediction is one of the most essential issues that need to be explored for mobility management in mobile computing systems. In this paper, we propose a new algorithm for predicting the next inter-cell movement of a mobile user in a Personal Communication Systems network. In the first phase of our threephase algorithm, user mobility patterns are mined from the history of mobile user trajectories. In the second phase, mobility rules are extracted from these patterns, and in the last phase, mobility predictions are accomplished by using these rules. The performance of the proposed algorithm is evaluated through simulation as compared to two other prediction methods. The performance results obtained in terms of Precision and Recall indicate that our method can make more accurate predictions than the other methods. 2004 Elsevier B.V. All rights reserved.

Temporally Grounding Natural Sentence in Video <=SEP=> We introduce an effective and efficient method that grounds (i.e., localizes) natural sentences in long, untrimmed video sequences. Specifically, a novel Temporal GroundNet (TGN)1 is proposed to temporally capture the evolving fine-grained frame-by-word interactions between video and sentence. TGN sequentially scores a set of temporal candidates ended at each frame based on the exploited frameby-word interactions, and finally grounds the segment corresponding to the sentence. Unlike traditional methods treating the overlapping segments separately in a sliding window fashion, TGN aggregates the historical information and generates the final grounding result in one single pass. We extensively evaluate our proposed TGN on three public datasets with significant improvements over the stateof-the-arts. We further show the consistent effectiveness and efficiency of TGN through an ablation study and a runtime test.

Coping through emotional approach: scale construction and validation. <=SEP=> Four studies demonstrate the psychometric adequacy and validity of scales designed to assess coping through emotional approach. In separate undergraduate samples, exploratory and confirmatory factor analyses of dispositional (Study 1) and situational (Study 3) coping item sets yielded 2 distinct emotional approach coping factors: emotional processing (i.e., active attempts to acknowledge and understand emotions) and emotional expression. The 2 scales yielded high internal consistency and test-retest reliability, as well as convergent and discriminant validity. A study (Study 2) of young adults and their parents established the scales' interjudge reliabilities. Longitudinal (Study 3) and experimental (Study 4) research supported the predictive validity of the emotional approach coping scales with regard to adjustment to stressful encounters. Findings highlight the utility of functionalist theories of emotion as applied to coping theory.

Lévy flights and random searches <=SEP=> In this work we discuss some recent contributions to the random search problem. Our analysis includes superdiffusive Lévy processes and correlated random walks in several regimes of target site density, mobility and revisitability. We present results in the context of mean-field-like and closed-form average calculations, as well as numerical simulations. We then consider random searches performed in regular lattices and lattices with defects, and we discuss a necessary criterion for distinguishing true superdiffusion from correlated random walk processes. We invoke energy considerations in relation to critical survival states on the edge of extinction, and we analyze the emergence of Lévy behavior in deterministic search walks. Finally, we comment on the random search problem in the context of biological foraging. PACS numbers: 05.50.Fb, 05.40.−a

Jerk-bounded manipulator trajectory planning: design for real-time applications <=SEP=> An online method for obtaining smooth, jerk-bounded trajectories has been developed and implemented. Jerk limitation is important in industrial robot applications, since it results in improved path tracking and reduced wear on the robot. The method described herein uses a concatenation of fifth-order polynomials to provide a smooth trajectory between two way points. The trajectory approximates a linear segment with parabolic blends trajectory. A sine wave template is used to calculate the end conditions (control points) for ramps from zero acceleration to nonzero acceleration. Joining these control points with quintic polynomials results in a controlled quintic trajectory that does not oscillate, and is near time optimal for the jerk and acceleration limits specified. The method requires only the computation of the quintic control points, up to a maximum of eight points per trajectory way point. This provides hard bounds for online motion algorithm computation time. A method for blending these straight-line trajectories over a series of way points is also discussed. Simulations and experimental results on an industrial robot are presented.

Residual Reconstruction for Block-Based Compressed Sensing of Video <=SEP=> A simple block-based compressed-sensing reconstruction for still images is adapted to video. Incorporating reconstruction from a residual arising from motion estimation and compensation, the proposed technique alternatively reconstructs frames of the video sequence and their corresponding motion fields in an iterative fashion. Experimental results reveal that the proposed technique achieves significantly higher quality than a straightforward reconstruction that applies a still-image reconstruction independently frame by frame, a 3D reconstruction that exploits temporal correlation between frames merely in the form of a motion-agnostic 3D transform, and a similar, yet non-iterative, motion-compensated residual reconstruction.

Nonclassical Computation - A Dynamical Systems Perspective <=SEP=> In this chapter we investigate computation from a dynamical systems perspective. A dynamical system is described in terms of its abstract state space, the system’s current state within its state space, and a rule that determines its motion through its state space. In a classical computational system, that rule is given explicitly by the computer program; in a physical system, that rule is the underlying physical law governing the behaviour of the system. So a dynamical systems approach to computation allows us to take a unified view of computation in classical discrete systems and in systems performing non-classical computation. In particular, it gives a route to a computational interpretation of physical embodied systems exploiting the natural dynamics of their material substrates. We start with autonomous (closed) dynamical systems: those whose dynamics is not an explicit function of time, in particular, those with no inputs from an external environment. We begin with computationally conventional discrete systems, examining their computational abilities from a dynamical systems perspective. The aim here is both to introduce the necessary dynamical systems concepts, and to demonstrate how classical computation can be viewed from this perspective. We then move on to continuous dynamical systems, such as those inherent in the complex dynamics of matter, and show how these too can be interpreted computationally, and see how the material embodiment can give such computation “for free”, without the need to explicitly implement the dynamics. We next broaden the outlook to open (non-autonomous) dynamical systems, where the dynamics is a function of time, in the form of inputs from an external environment, and which may be in a closely coupled feedback loop with that environment. We finally look at constructive, or developmental, dynamical systems, where the structure of the state space is changing during the computation. This includes vari-

Energy-aware wireless microsensor networks <=SEP=> Self-configuring wireless sensor networks can be invaluable in many civil and military applications for collecting, processing, and disseminating wide ranges of complex environmental data. Because of this, they have attracted considerable research attention in the last few years. The WINS [1] and SmartDust [2] projects, for instance, aim to integrate sensing, computing, and wireless communication capabilities into a small form factor to enable low-cost production of these tiny nodes in large numbers. Several other groups are investigating efficient hardware/software system architectures, signal processing algorithms, and network protocols for wireless sensor networks [3]-[5]. Sensor nodes are battery driven and hence operate on an extremely frugal energy budget. Further, they must have a lifetime on the order of months to years, since battery replacement is not an option for networks with thousands of physically embedded nodes. In some cases, these networks may be required to operate solely on energy scavenged from the environment through seismic, photovoltaic, or thermal conversion. This transforms energy consumption into the most important factor that determines sensor node lifetime. Conventional low-power design techniques [6] and hardware architectures only provide point solutions which are insufficient for these highly energy-constrained systems. Energy optimization, in the case of sensor networks, is much more complex, since it involves not only reducing the energy consumption of a single sensor node but also maximizing the lifetime of an entire network. The network lifetime can be maximized

Differences in procrastination and motivation between undergraduate and graduate students <=SEP=> Procrastination became increasingly prevalent among students in recent years. However, little research was found that directly compares academic procrastination across different academic grade levels.	  The	  present study used a self-regulated learning perspective to compare procrastination types and associated motivation between undergraduate and graduate students. Sixty-six undergraduate and sixty-eight graduate students responded to a packet of questionnaires concerning their experience in an educational psychology class. The results show that students’ beliefs about the usefulness of procrastination were a better predictor of academic procrastination than self-efficacy beliefs and achievement goal orientations. Student age was related to procrastination types. Among the undergraduate procrastinators, the younger students were more likely to engage in active procrastination while the older students tended to engage in passive procrastination. Implications and future research directions are discussed.

OpenPiton: An Open Source Manycore Research Framework <=SEP=> Industry is building larger, more complex, manycore processors on the back of strong institutional knowledge, but academic projects face difficulties in replicating that scale. To alleviate these difficulties and to develop and share knowledge, the community needs open architecture frameworks for simulation, synthesis, and software exploration which support extensibility, scalability, and configurability, alongside an established base of verification tools and supported software. In this paper we present OpenPiton, an open source framework for building scalable architecture research prototypes from 1 core to 500 million cores. OpenPiton is the world's first open source, general-purpose, multithreaded manycore processor and framework. OpenPiton leverages the industry hardened OpenSPARC T1 core with modifications and builds upon it with a scratch-built, scalable uncore creating a flexible, modern manycore design. In addition, OpenPiton provides synthesis and backend scripts for ASIC and FPGA to enable other researchers to bring their designs to implementation. OpenPiton provides a complete verification infrastructure of over 8000 tests, is supported by mature software tools, runs full-stack multiuser Debian Linux, and is written in industry standard Verilog. Multiple implementations of OpenPiton have been created including a taped-out 25-core implementation in IBM's 32nm process and multiple Xilinx FPGA prototypes.

Inertial properties of the human trunk of males determined from magnetic resonance imaging <=SEP=> The purpose of this study was to evaluate the segmental parameters of the human trunk of malesin vivo using magnetic resonance imaging (MRI). In addition, the efficacy of volumetric estimation and existing prediction formulas to produce segmental properties similar to those produced by MRI was evaluated. As opposed to finding one representative normal value for these parameters, a range of normal values was defined. For instance, the average trunk mass was 42.2%±3.5% (x±SD) of body mass, but values ranged from 35.8% to 48.0%. To account for segment parameters more accurately, specific anthropometric measures need to be considered in addition to overall measures of body height and mass. These specific measures included segment length, circumference, width, and depth. Studies reporting general percentages based on height and/or mass were found to be inadequate predictors of segmental parameters of the trunk compared with MRI estimates. Volumebased estimates, which assume a uniform density distribution within a segment, were found to correspond closely to MRI values except for the thorax. However, the use of density values reflective of the livingin vivo state would likely alleviate this disparity, thus indicating that the volumetric technique may be effective for deriving segmental parameters for large segments of the trunk. Future research should adopt noninvasive techniques such as MRI and/or volumetric estimation to enhance the predictability of segmental parameters of the body for specific population groups characterized by gender, developmental age, body type, and fitness level. Further efforts should be made to establish standardized boundary definitions for trunk segments to avoid unnecessary confusion, from which substantial errors may be introduced into biomechanical linked-segment analyses of human movement.

A New Dataset for Fine-Grained Citation Field Extraction <=SEP=> Citation field extraction entails segmenting a citation string into its constituent parts, such as title, authors, publisher and year. Despite the importance of this task, there is a lack of well-annotated citation data. This paper presents a new labeled dataset for citation extraction that, in comparison to the previous standard dataset, exceeds four-times more data, supplies detailed nested labels rather than coarse-grained flat labels, and is derived from four different academic fields rather than one. We describe our new dataset in detail, and provide baseline experimental results from a state-of-the-art extraction method.

Learning Feature Pyramids for Human Pose Estimation <=SEP=> Articulated human pose estimation is a fundamental yet challenging task in computer vision. The difficulty is particularly pronounced in scale variations of human body parts when camera view changes or severe foreshortening happens. Although pyramid methods are widely used to handle scale changes at inference time, learning feature pyramids in deep convolutional neural networks (DCNNs) is still not well explored. In this work, we design a Pyramid Residual Module (PRMs) to enhance the invariance in scales of DCNNs. Given input features, the PRMs learn convolutional filters on various scales of input features, which are obtained with different subsampling ratios in a multibranch network. Moreover, we observe that it is inappropriate to adopt existing methods to initialize the weights of multi-branch networks, which achieve superior performance than plain networks in many tasks recently. Therefore, we provide theoretic derivation to extend the current weight initialization scheme to multi-branch network structures. We investigate our method on two standard benchmarks for human pose estimation. Our approach obtains state-of-the-art results on both benchmarks. Code is available at https://github.com/bearpaw/PyraNet.

Treating patellar tendinopathy with Fascial Manipulation. <=SEP=> According to Fascial Manipulation theory, patellar tendon pain is often due to uncoordinated quadriceps contraction caused by anomalous fascial tension in the thigh. Therefore, the focus of treatment is not the patellar tendon itself, but involves localizing the cause of this incoordination, considered to be within the muscular fascia of the thigh region. Eighteen patients suffering from patellar tendon pain were treated with the Fascial Manipulation technique. Pain was assessed (in VAS) before (VAS 67.8/100) and after (VAS 26.5/100) treatment, plus a follow-up evaluation at 1 month (VAS 17.2/100). Results showed a substantial decrease in pain immediately after treatment (p<0.0001) and remained unchanged or improved in the short term. The results show that the patellar tendon may be only the zone of perceived pain and that interesting results can be obtained by treating the muscular fascia of the quadriceps muscle, whose alteration may cause motor incoordination and subsequent pathology.

Automatic question answering using the web: Beyond the Factoid <=SEP=> In this paper we describe and evaluate a Question Answering (QA) system that goes beyond answering factoid questions. Our approach to QA assumes no restrictions on the type of questions that are handled, and no assumption that the answers to be provided are factoids. We present an unsupervised approach for collecting question and answer pairs from FAQ pages, which we use to collect a corpus of 1 million question/answer pairs from FAQ pages available on the Web. This corpus is used to train various statistical models employed by our QA system: a statistical chunker used to transform a natural language-posed question into a phrase-based query to be submitted for exact match to an off-the-shelf search engine; an answer/question translation model, used to assess the likelihood that a proposed answer is indeed an answer to the posed question; and an answer language model, used to assess the likelihood that a proposed answer is a well-formed answer. We evaluate our QA system in a modular fashion, by comparing the performance of baseline algorithms against our proposed algorithms for various modules in our QA system. The evaluation shows that our system achieves reasonable performance in terms of answer accuracy for a large variety of complex, non-factoid questions.

A simulation-based software design framework for network-centric and parallel systems <=SEP=> In this paper we discuss a software design framework that is capable of realizing network-centricity and the rising multicore technology. Instead of producing static design documents in the form of UML diagrams, we propose automatic generation of a visual simulation model, which represents the target system design. We discuss a design environment that is responsible for the generation and execution of the simulation model.

Computational systems biology <=SEP=> To understand complex biological systems requires the integration of experimental and computational research — in other words a systems biology approach. Computational biology, through pragmatic modelling and theoretical exploration, provides a powerful foundation from which to address critical scientific questions head-on. The reviews in this Insight cover many different aspects of this energetic field, although all, in one way or another, illuminate the functioning of modular circuits, including their robustness, design and manipulation. Computational systems biology addresses questions fundamental to our understanding of life, yet progress here will lead to practical innovations in medicine, drug discovery and engineering.