Now showing items 562-581 of 1759

    • Failure Prediction based on Log Files Using Random Indexing and Support Vector Machines 

      Fronza, I; Sillitti, A; Succi, G; Vlasenko, J; Terho, M (Elsevier, 2013)
      Research problem: The impact of failures on software systems can be substantial since the recovery process can require unexpected amounts of time and resources. Accurate failure predictions can help in mitigating the impact ...
    • “Failures” to be celebrated: an analysis of major pivots of software startups 

      Bajwa S; Wang X; Nguyen Duc A; Abrahamsson P (Springer New York LLC, 2017)
      In the context of software startups, project failure is embraced actively and considered crucial to obtain validated learning that can lead to pivots. A pivot is the strategic change of a business concept, product or the ...
    • Fast and accurate link prediction in social networking systems 

      Papadimitriou A; Symeonidis P; Manolopoulos Y (2012)
      Online social networks (OSNs) recommend new friends to registered users based on local-based features of the graph (i.e. based on the number of common friends that two users share). However, OSNs do not exploit all different ...
    • Fast and Parallel Computational Techniques Applied to Numerical Modeling of RFX-mod Fusion Device 

      Abate D; Carpentieri B; Chiariello AG; Marchiori G; Marconato N; Mastrostefano S; Rubinacci G; Ventre S; Villone F (2018)
      This paper presents fast computational techniques applied to modelling the RFX-mod fusion device. An integral equation model is derived for the current distribution on the active coils of the conducting structures, and the ...
    • Fast and Simple Data Scaling for OBDA Benchmarks 

      Lanti D; Xiao G; Calvanese D (CEUR-WS, 2016)
      In this paper we describe VIG, a data scaler for OBDA benchmarks. Data scaling is a relatively recent approach, proposed in the database community, that allows for quickly scaling an input data instance to $n$ times its ...
    • Fast Computation of Continental-Sized Isochrones 

      Bolzoni P; Helmer S; Lachish O (Springer, 2016)
      We propose an approach to speed up the computation of isochrones, which are maps showing the reachability of locations given a starting point and a time constraint. The core idea of our technique is to materialize large ...
    • Fast construction of efficient composite likelihood equations 

      Huang Z; Ferrari D (2017)
      Growth in both size and complexity of modern data challenges the applicability of traditional likelihood-based inference. Composite likelihood (CL) methods address the difficulties related to model selection and computational ...
    • Fast integral equation solvers in Computational Electromagnetics 

      Carpentieri B (Editura Academiei Române, 2012)
    • Fast Iterative Method with a Second-Order Implicit Difference Scheme for Time-Space Fractional Convection–Diffusion Equation 

      Gu XM; Huang TZ; Carpentieri B; Ji CC; Alikhanov AA (2017)
      In this paper we intend to establish fast numerical approaches to solve a class of initial-boundary problem of time-space fractional convection-diffusion equations. We present a new unconditionally stable implicit difference ...
    • Fast Sampling-Based Whole-Genome Haplotype Block Recognition 

      Taliun, D; Gamper, J; Leser, U; Pattaro, C (2016)
      Scaling linkage disequilibrium (LD) based haplotype block recognition to the entire human genome has always been a challenge. The best-known algorithm has quadratic runtime complexity and, even when sophisticated search ...
    • Fault Tolerance in the R-GMA Information and Monitoring System 

      Byrom, R; Coghlan, B; Cooke, A; Cordenonsi, R; Cornwall, L; Craig, M; Djaoui, A; Duncan, A; Fisher, S; Gray, A; Hicks, S; Kenny, S; Leake, J; Lyttleton, O; Magowan, J; Middleton, R; Nutt, W; O'Callaghan, D; Podhorszki, N; Taylor, P; Walk, J; Wilson, A (Springer, 2005)
      R-GMA (Relational Grid Monitoring Architecture) [1] is a grid monitoring and information system that provides a global view of data distributed across a grid system. R-GMA creates the impression of a single centralised ...
    • Feature Usage Diagram for Feature Reduction 

      Marciuska, S; Gencel, C; Wang, X; Abrahamsson, P (Springer, 2013)
      Feature creep, if not managed well, cause software bloat. This in turn makes software applications become slower. Currently, software industry urgently requires mechanisms and approaches to reduce unnecessary or low value ...
    • Feature-weighted user model for recommender systems 

      Symeonidis P; Nanopoulos A; Manolopoulos Y (Springer, 2007)
      Recommender systems are gaining widespread acceptance in e-commerce applications to confront the "information overload" problem. Collaborative Filtering (CF) is a successful recommendation technique, which is based on past ...
    • Features and Components in Product Models 

      Sanfilippo EM; Masolo C; Borgo S; Porello D (IOS Press, 2016)
      Product structures are represented in engineering models by depicting and linking components, features and assemblies. Their understanding requires knowledge of both design and manufacturing practices, and yet further ...
    • A finite element method for nonlinear elliptic problems 

      Lakkis O; Pryer T (2013)
      We present a Galerkin method with piecewise polynomial continuous elements for fully nonlinear elliptic equations. A key tool is the discretization proposed in Lakkis and Pryer, 2011, allowing us to work directly on the ...
    • A finite element method for second order nonvariational elliptic problems 

      Lakkis O; Pryer T (2011)
      We propose a numerical method to approximate the solution of second order elliptic problems in nonvariational form. The method is of Galerkin type using conforming finite elements and applied directly to the nonvariational ...
    • Finite Lattices Do Not Make Reasoning in ALCI Harder 

      Borgwardt S; Peñaloza R (CEUR, 2011)
      We consider the fuzzy logic ALCI with semantics based on a finite residuated lattice. We show that the problems of satisfiability and subsumption of concepts in this logic are ExpTime-complete w.r.t. general TBoxes and ...
    • Finite model reasoning on UML class diagrams via constraint programming 

      Cadoli M; Calvanese D; De Giacomo G; Mancini T (Springer, 2007)
      Finite model reasoning in UML class diagrams is an important task for assessing the quality of the analysis phase in the development of software applications in which it is assumed that the number of objects of the domain ...
    • Finite Model Reasoning on UML Class Diagrams via Constraint Programming 

      Cadoli M; Calvanese D; De Giacomo G; Mancini T (2013)
      Finite model reasoning in UML class diagrams is an important task for assessing the quality of the analysis phase in the development of software applications in which it is assumed that the number of objects of the domain ...