669 research outputs found

    Informatics Related Branch’s Curriculum and Role of Project Management

    Get PDF
    The most important goal of the software industry is to produce successful product. During the process of production several times the product fails due to lack of proper management. This paper is exploring the role of software engineering courses in computer engineering related branches and then reasons why software developers lack project management in proper software management trainings. Our findings reflect that in majority of computer related branches like computer science, computer engineering, information system engineering there is no place for software project management course. Our findings are based on a survey of course curriculums of computer engineering, computer science and information system engineering courses taught in Turkish universities

    Inapproximability of maximal strip recovery

    Get PDF
    In comparative genomic, the first step of sequence analysis is usually to decompose two or more genomes into syntenic blocks that are segments of homologous chromosomes. For the reliable recovery of syntenic blocks, noise and ambiguities in the genomic maps need to be removed first. Maximal Strip Recovery (MSR) is an optimization problem proposed by Zheng, Zhu, and Sankoff for reliably recovering syntenic blocks from genomic maps in the midst of noise and ambiguities. Given dd genomic maps as sequences of gene markers, the objective of \msr{d} is to find dd subsequences, one subsequence of each genomic map, such that the total length of syntenic blocks in these subsequences is maximized. For any constant d2d \ge 2, a polynomial-time 2d-approximation for \msr{d} was previously known. In this paper, we show that for any d2d \ge 2, \msr{d} is APX-hard, even for the most basic version of the problem in which all gene markers are distinct and appear in positive orientation in each genomic map. Moreover, we provide the first explicit lower bounds on approximating \msr{d} for all d2d \ge 2. In particular, we show that \msr{d} is NP-hard to approximate within Ω(d/logd)\Omega(d/\log d). From the other direction, we show that the previous 2d-approximation for \msr{d} can be optimized into a polynomial-time algorithm even if dd is not a constant but is part of the input. We then extend our inapproximability results to several related problems including \cmsr{d}, \gapmsr{\delta}{d}, and \gapcmsr{\delta}{d}.Comment: A preliminary version of this paper appeared in two parts in the Proceedings of the 20th International Symposium on Algorithms and Computation (ISAAC 2009) and the Proceedings of the 4th International Frontiers of Algorithmics Workshop (FAW 2010

    Competitive portfolio selection using stochastic predictions

    Get PDF
    We study a portfolio selection problem where a player attempts to maximise a utility function that represents the growth rate of wealth. We show that, given some stochastic predictions of the asset prices in the next time step, a sublinear expected regret is attainable against an optimal greedy algorithm, subject to tradeoff against the \accuracy" of such predictions that learn (or improve) over time. We also study the effects of introducing transaction costs into the model

    Alcohol imagery and branding, and age classification of films popular in the UK

    Get PDF
    Background Exposure to alcohol products in feature films is a risk factor for use of alcohol by young people. This study was designed to document the extent to which alcohol imagery and brand appearances occur in popular UK films, and in relation to British Board of Film Classification (BBFC) age ratings intended to protect children and young people from harmful imagery

    Dynamics of Transformation from Segregation to Mixed Wealth Cities

    Get PDF
    We model the dynamics of the Schelling model for agents described simply by a continuously distributed variable - wealth. Agents move to neighborhoods where their wealth is not lesser than that of some proportion of their neighbors, the threshold level. As in the case of the classic Schelling model where segregation obtains between two races, we find here that wealth-based segregation occurs and persists. However, introducing uncertainty into the decision to move - that is, with some probability, if agents are allowed to move even though the threshold level condition is contravened - we find that even for small proportions of such disallowed moves, the dynamics no longer yield segregation but instead sharply transition into a persistent mixed wealth distribution. We investigate the nature of this sharp transformation between segregated and mixed states, and find that it is because of a non-linear relationship between allowed moves and disallowed moves. For small increases in disallowed moves, there is a rapid corresponding increase in allowed moves, but this tapers off as the fraction of disallowed moves increase further and finally settles at a stable value, remaining invariant to any further increase in disallowed moves. It is the overall effect of the dynamics in the initial region (with small numbers of disallowed moves) that shifts the system away from a state of segregation rapidly to a mixed wealth state. The contravention of the tolerance condition could be interpreted as public policy interventions like minimal levels of social housing or housing benefit transfers to poorer households. Our finding therefore suggests that it might require only very limited levels of such public intervention - just sufficient to enable a small fraction of disallowed moves, because the dynamics generated by such moves could spur the transformation from a segregated to mixed equilibrium.Comment: 12 pages, 7 figure

    Integrating Learning and Reasoning with Deep Logic Models

    Full text link
    Deep learning is very effective at jointly learning feature representations and classification models, especially when dealing with high dimensional input patterns. Probabilistic logic reasoning, on the other hand, is capable to take consistent and robust decisions in complex environments. The integration of deep learning and logic reasoning is still an open-research problem and it is considered to be the key for the development of real intelligent agents. This paper presents Deep Logic Models, which are deep graphical models integrating deep learning and logic reasoning both for learning and inference. Deep Logic Models create an end-to-end differentiable architecture, where deep learners are embedded into a network implementing a continuous relaxation of the logic knowledge. The learning process allows to jointly learn the weights of the deep learners and the meta-parameters controlling the high-level reasoning. The experimental results show that the proposed methodology overtakes the limitations of the other approaches that have been proposed to bridge deep learning and reasoning

    Smell-related quality of life changes after total laryngectomy : a multi-centre study

    Get PDF
    Purpose: A total laryngectomy creates an alternate airway for gas exchange that bypasses the upper aerodigestive tract. The subsequent reduction in nasal airflow, and therefore, reduction in deposition of particles to the olfactory neuroepithelium leads to hyposmia or anosmia. The aim of this study was to assess the quality of life impairment conferred by anosmia following laryngectomy and identify any specific patient-related risk factors that are associated with poorer outcomes. Methods: Consecutive patients with a total laryngectomy presenting for review at three tertiary head and neck services (in Australia, the United Kingdom and India) over a 12-month period were recruited. Patient demographic and clinical data were collected, and each subject completed the validated assessment of self-reported olfactory functioning and olfaction-related quality of life questionnaire (ASOF). Dichotomous comparisons were performed using the student's unpaired t-test for continuous variables (SRP), a chi-squared test for categorical variables, and a Kendall's tau-b for ordinal variables (SOC) to assess for a correlation with poorer questionnaire scores. Results: A total of 66 laryngectomees (13.4% female; age 65.7 ± 8.6 years) were included in the study. The mean SRP score of the cohort was found to be 15.6 ± 7.4, while the mean ORQ score was noted to be 16.4 ± 8.1. No other specific risk factors associated with poorer quality of life were identified. Conclusion: A significant quality of life detriment from hyposmia is conferred following laryngectomy. Further research to assess treatment options and the patient population that would best benefit from these interventions is required

    The complex TIE between macrophages and angiogenesis

    Get PDF
    Macrophages are primarily known as phagocytic immune cells, but they also play a role in diverse processes, such as morphogenesis, homeostasis and regeneration. In this review, we discuss the influence of macrophages on angiogenesis, the process of new blood vessel formation from the pre-existing vasculature. Macrophages play crucial roles at each step of the angiogenic cascade, starting from new blood vessel sprouting to the remodelling of the vascular plexus and vessel maturation. Macrophages form promising targets for both pro- and anti-angiogenic treatments. However, to target macrophages, we will first need to understand the mechanisms that control the functional plasticity of macrophages during each of the steps of the angiogenic cascade. Here, we review recent insights in this topic. Special attention will be given to the TIE2-expressing macrophage (TEM), which is a subtype of highly angiogenic macrophages that is able to influence angiogenesis via the angiopoietin-TIE pathway

    Inapproximability Results for Approximate Nash Equilibria.

    Get PDF
    We study the problem of finding approximate Nash equilibria that satisfy certain conditions, such as providing good social welfare. In particular, we study the problem ϵ\epsilon-NE δ\delta-SW: find an ϵ\epsilon-approximate Nash equilibrium (ϵ\epsilon-NE) that is within δ\delta of the best social welfare achievable by an ϵ\epsilon-NE. Our main result is that, if the exponential-time hypothesis (ETH) is true, then solving (18O(δ))\left(\frac{1}{8} - \mathrm{O}(\delta)\right)-NE O(δ)\mathrm{O}(\delta)-SW for an n×nn\times n bimatrix game requires nΩ~(logn)n^{\mathrm{\widetilde \Omega}(\log n)} time. Building on this result, we show similar conditional running time lower bounds on a number of decision problems for approximate Nash equilibria that do not involve social welfare, including maximizing or minimizing a certain player's payoff, or finding approximate equilibria contained in a given pair of supports. We show quasi-polynomial lower bounds for these problems assuming that ETH holds, where these lower bounds apply to ϵ\epsilon-Nash equilibria for all ϵ<18\epsilon < \frac{1}{8}. The hardness of these other decision problems has so far only been studied in the context of exact equilibria.Comment: A short (14-page) version of this paper appeared at WINE 2016. Compared to that conference version, this new version improves the conditional lower bounds, which now rely on ETH rather than RETH (Randomized ETH

    Measuring and Comparing Party Ideology and Heterogeneity

    Get PDF
    Estimates of party ideological positions in Western Democracies yield useful party-level information, but lack the ability to provide insight into intraparty politics. In this paper, we generate comparable measures of latent individual policy positions from elite survey data which enable analysis of elite-level party ideology and heterogeneity. This approach has advantages over both expert surveys and approaches based on behavioral data, such as roll call voting and is directly relevant to the study of party cohesion. We generate a measure of elite positions for several European countries using a common space scaling approach and demonstrate its validity as a measure of party ideology. We then apply these data to determine the sources of party heterogeneity, focusing on the role of intraparty competition in electoral systems, nomination rules, and party goals. We find that policy-seeking parties and centralized party nomination rules reduce party heterogeneity. While intraparty competition has no effect, the presence of these electoral rules conditions the effect of district magnitude
    corecore