Institution
Helsinki University of Technology
About: Helsinki University of Technology is a based out in . It is known for research contribution in the topics: Thin film & Vortex. The organization has 8962 authors who have published 20136 publications receiving 723787 citations. The organization is also known as: TKK & Teknillinen korkeakoulu.
Papers published on a yearly basis
Papers
More filters
••
TL;DR: In this paper, the use of N-point Pade approximants to analytically continue the complex frequency Green's function from the Matsubara points to the real frequency axis was studied.
Abstract: We study the use ofN-point Pade approximants to analytically continue the complex frequency Green's function from the Matsubara points to the real frequency axis. The method is applied to solutions of the Eliashberg equations and the approximants are compared with tabulated real frequency results. The overall agreement is good. We further show that the method can serve to make imaginary frequency calculations consistent with real frequency calculations by fixing the pseudopotential μ* to the energy gap Δ
o
.
458 citations
••
University of Technology, Sydney1, James Madison University2, Metropolitan State University3, Staffordshire University4, University of Auckland5, Aarhus University6, University of Connecticut7, Umeå University8, Rhode Island College9, Helsinki University of Technology10, University of San Diego11, Aberystwyth University12
TL;DR: A study by a ITiCSE 2001 working group established that many students do not know how to program at the conclusion of their introductory courses, and studied the alternative explanation, suggesting that such students have a fragile grasp of skills that are a prerequisite for problem-solving.
Abstract: A study by a ITiCSE 2001 working group ("the McCracken Group") established that many students do not know how to program at the conclusion of their introductory courses. A popular explanation for this incapacity is that the students lack the ability to problem-solve. That is, they lack the ability to take a problem description, decompose it into sub-problems and implement them, then assemble the pieces into a complete solution. An alternative explanation is that many students have a fragile grasp of both basic programming principles and the ability to systematically carry out routine programming tasks, such as tracing (or "desk checking") through code. This ITiCSE 2004 working group studied the alternative explanation, by testing students from seven countries, in two ways. First, students were tested on their ability to predict the outcome of executing a short piece of code. Second, students were tested on their ability, when given the desired function of short piece of near-complete code, to select the correct completion of the code from a small set of possibilities. Many students were weak at these tasks, especially the latter task, suggesting that such students have a fragile grasp of skills that are a prerequisite for problem-solving.
456 citations
••
TL;DR: This research proves that models like TAM should not treat mobile services as a generic concept, but instead to specifically address individual mobile services, and demonstrates the unique value of combining objective usage measurements with traditional survey data in more comprehensively modelling service adoption.
456 citations
••
TL;DR: In this article, a conceptual framework for identifying interdisciplinarity in research documents has been proposed, which attempts to fulfill the need for a robust and nuanced approach that is grounded in deeper knowledge of interdisciplinary research.
455 citations
••
28 Jul 1997
TL;DR: The Smodels system as mentioned in this paper is a C++ implementation of the well-founded and stable model semantics for range-restricted function-free normal programs, which is based on bottom-up backtracking search where a powerful pruning method is employed.
Abstract: The Smodels system is a C++ implementation of the well-founded and stable model semantics for range-restricted function-free normal programs. The system includes two modules: (i) smodels which implements the two semantics for ground programs and (ii) parse which computes a grounded version of a range-restricted function-free normal program. The latter module does not produce the whole set of ground instances of the program but a subset that is sufficient in the sense that no stable models are lost. The implementation of the stable model semantics for ground programs is based on bottom-up backtracking search where a powerful pruning method is employed. The pruning method exploits an approximation technique for stable models which is closely related to the well-founded semantics. One of the advantages of this novel technique is that it can be implemented to work in linear space. This makes it possible to apply the stable model semantics also in areas where resulting programs are highly non-stratified and can possess a large number of stable models. The implementation has been tested extensively and compared with a state of the art implementation of the stable model semantics, the SLG system. In tests involving ground programs it clearly outperforms SLG.
454 citations
Authors
Showing all 8962 results
Name | H-index | Papers | Citations |
---|---|---|---|
Ashok Kumar | 151 | 5654 | 164086 |
Hannu Kurki-Suonio | 138 | 433 | 99607 |
Nicolas Gisin | 125 | 827 | 64298 |
Anne Lähteenmäki | 116 | 485 | 81977 |
Riitta Hari | 111 | 491 | 43873 |
Andreas Richter | 110 | 769 | 48262 |
Mika Sillanpää | 96 | 1019 | 44260 |
Markku Leskelä | 94 | 876 | 36881 |
Ullrich Scherf | 92 | 735 | 36972 |
Mikko Ritala | 91 | 584 | 29934 |
Axel H. E. Müller | 89 | 564 | 30283 |
Karl Henrik Johansson | 88 | 1089 | 33751 |
T. Poutanen | 86 | 120 | 33158 |
Elina Lindfors | 86 | 420 | 23846 |
Günter Breithardt | 85 | 554 | 33165 |