Results 211 to 220 of about 7,870 (244)
Preparation of Polylactic Acid/Modified Natto Composite Films and Property Evaluation. [PDF]
ACS OmegaPramualkijja W, Srikulkit K.
europepmc +1 more source
Exploiting nozzle geometry to predict resolution in extrusion-based bioprinting: mathematical modelling of a power-law fluid. [PDF]
R Soc Open SciTansell AV +5 more
europepmc +1 more source
Machine Learning in Gel-Based Additive Manufacturing: From Material Design to Process Optimization. [PDF]
GelsZhang Z, Wang Y, Wang W.
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Printability in extrusion bioprinting
Biofabrication, 2021Abstract Extrusion bioprinting has been widely used to extrude continuous filaments of bioink (or the mixture of biomaterial and living cells), layer-by-layer, to build three-dimensional constructs for biomedical applications. In extrusion bioprinting, printability is an important parameter used to measure the difference between the ...
Zhouquan Fu +5 more
openaire +2 more sources
Proceedings of Computational Complexity (Formerly Structure in Complexity Theory), 1998
Summary: A language is \(L\)-printable if there is a logspace algorithm which, on input \(1^{n}\), prints all members in the language of length \(n\). Following the work of \textit{E. W. Allender} and \textit{R. S. Rubinstein} [SIAM J. Comput. 17, No. 6, 1193-1202 (1988; Zbl 0682.68039)] on \(P\)-printable sets, we present some simple properties of the
Fortnow, Lance +3 more
openaire +1 more source
Summary: A language is \(L\)-printable if there is a logspace algorithm which, on input \(1^{n}\), prints all members in the language of length \(n\). Following the work of \textit{E. W. Allender} and \textit{R. S. Rubinstein} [SIAM J. Comput. 17, No. 6, 1193-1202 (1988; Zbl 0682.68039)] on \(P\)-printable sets, we present some simple properties of the
Fortnow, Lance +3 more
openaire +1 more source
SIAM Journal on Computing, 1988
Recall that generalized Kolmogorov complexity is a measure of how far a string can be compressed and how fast it can be restored. Sets containing only strings that can be ``greatly'' compressed and ``quickly'' restored are said to have ``small'' generalized Kolmogorov complexity.
Allender, Eric W., Rubinstein, Roy S.
openaire +2 more sources
Recall that generalized Kolmogorov complexity is a measure of how far a string can be compressed and how fast it can be restored. Sets containing only strings that can be ``greatly'' compressed and ``quickly'' restored are said to have ``small'' generalized Kolmogorov complexity.
Allender, Eric W., Rubinstein, Roy S.
openaire +2 more sources
Printable Giant Magnetoresistive Devices
Advanced Materials, 2012The first printable magnetic sensor relying on the giant magnetoresistance effect (GMR) is demonstrated. It is prepared in the form of magneto-sensitive inks adherent to any kind of arbitrarily shaped surface. The fabricated sensor exhibits a room-temperature GMR of up to 8% showing great potential for contactless switching in hybrid electronic ...
Daniil, Karnaushenko +4 more
openaire +2 more sources