Search
Didn't find any results in this catalog!
But we have some results in other catalogs.Filters
total: 8537
-
Catalog
- Publications 7702 available results
- Journals 9 available results
- Conferences 7 available results
- People 109 available results
- Inventions 3 available results
- Projects 17 available results
- Research Equipment 8 available results
- e-Learning Courses 121 available results
- Events 5 available results
- Open Research Data 556 available results
displaying 1000 best results Help
Search results for: K-EPSILON MODEL
-
Top k Recommendations using Contextual Conditional Preferences Model
PublicationRecommender systems are software tools and techniques which aim at suggesting to users items they might be interested in. Context-aware recommender systems are a particular category of recommender systems which exploit contextual information to provide more adequate recommendations. However, recommendation engines still suffer from the cold-start problem, namely where not enough information about users and their ratings is available....
-
The chapter analyses the K-Means algorithm in its parallel setting. We provide detailed description of the algorithm as well as the way we paralellize the computations. We identified complexity of the particular steps of the algorithm that allows us to build the algorithm model in MERPSYS system. The simulations with the MERPSYS have been performed for different size of the data as well as for different number of the processors used for the computations. The results we got using the model have been compared to the results obtained from real computational environment.
PublicationThe chapter analyses the K-Means algorithm in its parallel setting. We provide detailed description of the algorithm as well as the way we paralellize the computations. We identified complexity of the particular steps of the algorithm that allows us to build the algorithm model in MERPSYS system. The simulations with the MERPSYS have been performed for different size of the data as well as for different number of the processors used...
-
CFD analysis of fluid flow through the labyrinth seal
PublicationSteam and gas turbines are some of the fundamental means of power generation. The energy efficiency of the turbines, however, is not satisfactory. Ever since the start-up of the first turbine in the world, engineers have been striving for their increased efficiency. Multiple solutions to the problem of steam loss in an operating turbine are available. The use of seals is one of them. Empirical methods or numerical calculations...
-
Karol Grębowski dr inż.
PeopleKarol Grębowski (M.Sc.) works as an assistant at the Department of Technical Fundamentals of Architecture Design of the Faculty of Architecture at Gdansk University of Technology. His scientific research deals with dynamic phenomena occurring during the vibration of structures, bridges, and studies the design methodology of the elements forming passive protection system of the vehicles degraded by struck or explosion in the context...
-
Synthesis of linear tuftsin analogues modified at the epsilon-amino group of lysine
PublicationZsyntetyzowano na fazie stałej nowe analogi tuftsyny i retro-tuftsyny zawierające wiązanie isopeptydowe na epsilon-aminowej grupie lizyny jako potencjalne immunostymulatory. Do syntezy wykorzystano standardową procedurę Fmoc. Po zdjęciu osłon kwasem TFA końcowe związki były oczyszczane, liofilizowane i charakteryzowane: MS, HPLC i NMR.
-
Wiktoria Wojnicz dr hab. inż.
PeopleDSc in Mechanics (in the field of Biomechanics) - Lodz Univeristy of Technology, 2019 PhD in Mechanics (in the field of Biomechanics) - Lodz Univeristy of Technology, 2009 (with distinction) List of papers (2009 - ) Wojnicz W., Wittbrodt E., Analysis of muscles' behaviour. Part I. The computational model of muscle. Acta of Bioengineering and Biomechanics, Vol. 11, No.4, 2009, p. 15-21 Wojnicz W., Wittbrodt E., Analysis of...
-
Deterministic rendezvous of asynchronous bounded-memory agents in polygonal terrains
PublicationTwo mobile agents, modeled as points starting at differentlocations of an unknown terrain, have to meet. The terrain is a polygon with polygonal holes. We consider two versions of this rendezvous problem: exact RV, when the points representing the agents have to coincide at some time, and epsilon-RV, when these points have to get at distance less than epsilon in the terrain. In any terrain, each agent chooses its trajectory, but...
-
The maximum edge-disjoint paths problem in complete graphs
PublicationRozważono problem ścieżek krawędziowo rozłącznych w grafach pełnych. Zaproponowano wielomianowe algorytmy: 3.75-przybliżony (off-line) oraz 6.47-przybliżony (on-line), poprawiając tym samym wyniki wcześniej znane z literatury [P. Carmi, T. Erlebach, Y. Okamoto, Greedy edge-disjoint paths in complete graphs, in: Proc. 29th Workshop on Graph Theoretic Concepts in Computer Science, in: LNCS, vol. 2880, 2003, pp. 143-155]. Ponadto...
-
A new approach to numerical solution of fixed-point problems and its application to delay differential equations
PublicationW pracy rozpatruje się pewne aproksymacje punktu stałego ciągłego operatora A odwzorowującego przestrzeń metryczną w siebie. Wspomniany punkt stały przybliża się tzw. epsilon przybliżonym punktem stałym z przestrzeni skończenie wymiarowej. Udowodnione zostało twierdzenie dające warunki konieczne i dostateczne istnienia punktu stałego w ogólnej przestrzeni metrycznej. Warunki te wyrażone są w terminach epsilon przybliżonego punktu...
-
Approximation Strategies for Generalized Binary Search in Weighted Trees
PublicationWe consider the following generalization of the binary search problem. A search strategy is required to locate an unknown target node t in a given tree T. Upon querying a node v of the tree, the strategy receives as a reply an indication of the connected component of T\{v} containing the target t. The cost of querying each node is given by a known non-negative weight function, and the considered objective is to minimize the total...