Didn't find any results in this catalog!
But we have some results in other catalogs.Filters
total: 2558
-
Catalog
displaying 1000 best results Help
Search results for: NO FREE LUNCH
-
FREE RADICAL BIOLOGY AND MEDICINE
Journals -
FREE RADICAL RESEARCH
Journals -
Launch of the Immersive 3D Visualization Laboratory
PublicationThe paper presents the concept of Immersive 3D Visualization Laboratory, formed at the Faculty of Electronics, Telecommunications and Informatics at Gdańsk University of Technology under the project Gdańsk University of Technology's Modern auditoriums. The basic unit of this laboratory will be cubic CAVE (Cave Automatic Virtual Environment) enriched with spherical walk simulator. This device will allow the user unlimited walking,...
-
Hunch: Berlage Institute
Journals -
The influence of effective distance on the impact of a punch - Preliminary Analysis
Publication -
INTERFACES AND FREE BOUNDARIES
Journals -
Isocyanate-Free Polyurethanes
PublicationIsocyanate-free polyurethanes (also called non-isocyanate polyurethanes, or NIPUs) are alternatives to the conventional (commercially used) polyurethanes synthesized using di- or polyisocyanates, polyols, and chain extenders with low molecular weight. The major routes of NIPUs’ synthesis involve polyaddition of cyclic carbonates and di- or polyamines, polycondensation of carbamates, and diols. The most important intermediates are...
-
Regenerative Drug Discovery Using Ear Pinna Punch Wound Model in Mice
PublicationThe ear pinna is a complex tissue consisting of the dermis, cartilage, muscles, vessels, and nerves. Ear pinna healing is a model of regeneration in mammals. In some mammals, including rabbits, punch wounds in the ear pinna close spontaneously; in common-use laboratory mice, they remain for life. Agents inducing ear pinna healing are potential regenerative drugs. We tested the effects of selected bioactive agents on 2 mm ear pinna...
-
TREE PHYSIOLOGY
Journals -
Collision-Free Network Exploration
PublicationA set of mobile agents is placed at different nodes of a n-node network. The agents synchronously move along the network edges in a collision-free way, i.e., in no round may two agents occupy the same node. In each round, an agent may choose to stay at its currently occupied node or to move to one of its neighbors. An agent has no knowledge of the number and initial positions of other agents. We are looking for the shortest possible...