Lecture Notes in Computer Science Journal Impact Factor & Information

Publisher: Springer Verlag

Journal description

The series Lecture Notes in Computer Science (LNCS), including its subseries Lecture Notes in Artificial Intelligence (LNAI) and Lecture Notes in Bioinformatics (LNBI), has established itself as a medium for the publication of new developments in computer science and information technology research and teaching - quickly, informally, and at a high level. The cornerstone of LNCS's editorial policy is its unwavering commitment to report the latest results from all areas of computer science and information technology research, development, and education. LNCS has always enjoyed close cooperation with the computer science R & D community, with numerous renowned academics, and with prestigious institutes and learned societies. Our mission is to serve this community by providing a most valuable publication service.

Current impact factor: 0.51

Impact Factor Rankings

2015 Impact Factor Available summer 2016
2005 Impact Factor 0.302
2004 Impact Factor 0.251
2002 Impact Factor 0.515
2001 Impact Factor 0.415
2000 Impact Factor 0.253
1999 Impact Factor 0.53

Impact factor over time

Impact factor

Additional details

5-year impact 0.00
Cited half-life 0.00
Immediacy index 0.00
Eigenfactor 0.00
Article influence 0.00
Website Lecture Notes in Computer Science website
Other titles Lecture notes in computer science, Lecture notes in artificial intelligence, Lecture notes in computer science
ISSN 0302-9743
OCLC 3719235
Material type Series, Internet resource
Document type Journal / Magazine / Newspaper, Internet Resource

Publisher details

Springer Verlag

  • Pre-print
    • Author can archive a pre-print version
  • Post-print
    • Author can archive a post-print version
  • Conditions
    • Author's pre-print on pre-print servers such as arXiv.org
    • Author's post-print on author's personal website immediately
    • Author's post-print on any open access repository after 12 months after publication
    • Publisher's version/PDF cannot be used
    • Published source must be acknowledged
    • Must link to publisher version
    • Set phrase to accompany link to published version (see policy)
    • Articles in some journals can be made Open Access on payment of additional charge
  • Classification
    ​ green

Publications in this journal

  • [Show abstract] [Hide abstract]
    ABSTRACT: Introducing a number of innovative and powerful coding tools, the High Efficiency Video Coding (HEVC) standard promises double compression efficiency, compared to its predecessor H.264, with similar perceptual quality. The increased computational time complexity is an important issue for the video coding research community as well. An attempt to reduce this complexity of HEVC is adopted in this paper, by efficient selection of appropriate block-partitioning modes based on motion features and the saliency applied to the difference between successive image blocks. As this difference gives us the explicit visible motion and salient information, we develop a cost function by combining the motion features and image difference salient feature. The combined features are then converted into area of interest (AOI) based binary pattern for the current block. This pattern is then compared with a previously defined codebook of binary pattern templates for a subset of mode selection. Motion estimation (ME) and motion compensation (MC) are performed only on the selected subset of modes, without exhaustive exploration of all modes available in HEVC. The experimental results reveal a reduction of 42% encoding time complexity of HEVC encoder with similar subjective and objective image quality.
    Lecture Notes in Computer Science 11/2015;
  • Lecture Notes in Computer Science 11/2015;
  • [Show abstract] [Hide abstract]
    ABSTRACT: The Mexican government studies the possibility of building a new international airport (NAICM) in ZFLT or Tizayuca. The aim of this paper is to determine which the best location site of the NAICM is (ZFLT or Tizayuca) considering the maximization of the sum of expected air pax demand as main factor. To solve such problem, we propose: a mathematical formulation with the objective of maximizing the sum of expected air pax demand and a methodology to estimate air pax demand at each demand point based on an index to measure wealth. Results indicate that Tizayuca is the place where the NAICM should be located for a catchment area smaller than 500km or 4 hours travel time, and ZFLT is the place where the NAICM should be constructed for a catchment area longer than 500km or 4 hours travel time.
    Lecture Notes in Computer Science 09/2015; 9335(40):586. DOI:10.1007/978-3-319-24264-4
  • [Show abstract] [Hide abstract]
    ABSTRACT: The aim of this paper is to propose an approach for forecasting passenger (pax) demand between airports based on the median pax demand and distance. The approach is based on three phases. First, the implement of bootstrap procedures to estimate the distribution of the mean pax demand and the median pax demand for each block of routes distance; second, the estimate pax demand by calculating boostrap confidence intervals for the mean pax demand and the median pax demand using bias corrected accelerated method (BCa); and third, by carrying out Monte Carlo experiments to analyse the finite sample performance of the proposed bootstrap procedure. The results indicate that in the air transport industry it is important to estimate the median of the pax demand.
    Lecture Notes in Computer Science 09/2015; 40(22):315-327. DOI:10.1007/978-3-319-24264-4-22
  • [Show abstract] [Hide abstract]
    ABSTRACT: Freight networks are more exposed to unforeseen events leading to delays compromising the delivery of cargo on time. Cooperation among different parties present at freight networks are requiered to accommodate the occurrence delays. Cargo assignment to the available transport capacity at the terminal is addressed using a Model Predictive Control approach in this paper, taking into consideration the final destination and the remaining time until due time of cargo. A cooperative framework for transport providers and intermodal hubs is proposed in this paper. The cooperation is based on information exchange regarding the amount of cargo at risk of not reaching the destination on time. The terminal searches for a faster connection at the terminal to allocate the cargo at risk such that the final destination is reached on time. The proposed heuristic is a step towards sustainable and synchromodal transportation networks. Simulation experiments illustrate the validity of these statements.
    Lecture Notes in Computer Science 09/2015; 9335(33):478 - 494. DOI:10.1007/978-3-319-24264-4_33
  • [Show abstract] [Hide abstract]
    ABSTRACT: The purpose of this study is to verify the statistical validity of a collaborative public sector innovation model in the Brazilian Federal Government context. This model essentially addresses aspects of co-creation, public sector innovation, and innovation ecosystem. Structural Equation Modeling results show a good model fit. It is concluded that the creative collaborative processes (co-creation) may generate new public values and foster public sector innovation. This stimulates the development of an innovation ecosystem supported by new public values and co-creative dynamics.
    Lecture Notes in Computer Science 09/2015; 9265:132-145. DOI:10.1007/978-3-319-22389-6_10
  • [Show abstract] [Hide abstract]
    ABSTRACT: In this paper we will present a contribution to the design of an expressive speech synthesis system for the Arabic language. The system uses diphone concatenation as the synthesis method for the generation of 10 phonetically balanced sentences in Arabic. Rules for the orthographic-to-phonetic transcription are detailed, as well as the methodology employed for recording the diphone database. The sentences were synthesized with both “neutral” and “sadness” expressions and rated by 10 listeners, and the results of the test are provided.
    Lecture Notes in Computer Science 09/2015; 9319:178. DOI:10.1007/978-3-319-23132-7_22
  • [Show abstract] [Hide abstract]
    ABSTRACT: Facade-layout synthesis occurs when renovating buildings to improve their thermal insulation and reduce the impact of heating on the environment. This interesting problem involves to cover a facade with a set of disjoint and configurable insulating panels. Therefore, it can be seen as a constrained rectangle packing problem, but for which the number of rectangles to be used and their size are not known a priori. This paper proposes an efficient way of solving this problem using constraint programming. The model is based on an open variant of the DiffN global constraint in order to deal with an unfixed number of rectangles, as well as a simple but efficient search procedure to solve this problem. An empirical evaluation shows the practical impact of every choice in the design of our model. A prototype implemented in the general purpose solver Choco is intended to assist architect decision-making in the context of building thermal retrofit.
    Lecture Notes in Computer Science 09/2015; 9255:508-523. DOI:10.1007/978-3-319-23219-5_36
  • [Show abstract] [Hide abstract]
    ABSTRACT: Augmented Reality (AR) has been studied from different application fields since the early 60s. In particular, AR has been usefully applied in the educational field, specially based on a versatile AR application called Augmented Book. We introduce the Augmented Reality Book System (ARBS), an interactive and collaborative application for traditional books augmentation. The proposed system allows the incorporation of AR content to any pre-existent traditional book. Once the AR content is incorporated to the book, it can be shared and explored by other users, allowing collaboration among readers. The ARBS does not require special programming or previous technical knowledge from the user. To validate the proposed system, we designed and conducted a novel experimental study with novice AR users. Very positive feedback from participants confirms the usefulness of the ARBS.
    Lecture Notes in Computer Science 09/2015; 9254:89-108.
  • Lecture Notes in Computer Science 09/2015;
  • [Show abstract] [Hide abstract]
    ABSTRACT: Response times are arguably the most representative and important metric for measuring the performance of modern computer systems. Further, service level agreements (SLAs), ranging from data centres to smartphone users, demand quick and, equally important, predictable response times. Hence, it is necessary to calculate moments, at least, and ideally response time distributions, which is not straightforward. A new moment-generating algorithm for calculating response times analytically is obtained, based on M/M/1 processor sharing (PS) queueing models. This algorithm is compared against existing work on response times in M/M/1-PS queues and extended to M/M/1 discriminatory PS queues. Two real-world case studies are evaluated.
    Lecture Notes in Computer Science 09/2015; 9272:80-95. DOI:10.1007/978-3-319-23267-6_6
  • [Show abstract] [Hide abstract]
    ABSTRACT: Civic hackathon is a participatory event for prototyping of innovative services through collaboration between citizens and engineers towards addressing social issues. Although continuous contributions are needed for improving the prototypes and for applying them to social issues, participants frequently stop contributions after the hackathon due to their day job. To address this problem, we applied our Web system, called GoalShare, which gathers linked open data (LOD) of hierarchical goals to address social issues, to civic hackathons held in the city of Nagoya in Japan. We compared goal structures between two situations. The results showed that goal structures input by team members themselves with enough instruction time were relatively detailed but varied widely among teams, and those input by a single GoalShare user with limited time remained at a simple overview level but had uniform level of detail. A more user-friendly interface usable without instruction is required for real-world situations.
    Lecture Notes in Computer Science 09/2015; 9249:81-92. DOI:10.1007/978-3-319-22500-5_7
  • Lecture Notes in Computer Science 09/2015; 9344.