Results 61 to 70 of about 73,753 (309)

AI–Guided 4D Printing of Carnivorous Plants–Inspired Microneedles for Accelerated Wound Healing

Advanced Materials, EarlyView.
This work presents an artificial intelligence (AI)‐guided 4D‐printed microneedle platform inspired by carnivorous plants for wound healing. A thermo‐responsive shape memory polymer enables body temperature–triggered self‐coiling for autonomous wound closure.
Hyun Lee, Moon‐Jo Kim, DongEung Kim, Chan Ho Moon, Seojoon Bang, Hyeong Seok Kang, Ju Yeong Gwon, Jong Hwa Seo, Junhyub Jeon, Junhyuk Son, Munwon Lim, Minho Kang, Dong Yun Lee, Donghyun Lim, Jung‐Hoon Park, Gi Doo Cha, Soo‐Hong Lee, Tae‐Sik Jang, Kisuk Yang, Yunho Jeong, Youngho Eom, Hyun‐Do Jung   +21 more
wiley   +1 more source

FIXED RATIO POLYNOMIAL TIME APPROXIMATION ALGORITHM FOR THE PRIZE-COLLECTING ASYMMETRIC TRAVELING SALESMAN PROBLEM

Ural Mathematical Journal, 2023
We develop the first fixed-ratio approximation algorithm for the well-known Prize-Collecting Asymmetric Traveling Salesman Problem,  which has numerous valuable applications in operations research. An instance of this problem is given by a complete node-
Ksenia Rizhenko, Katherine Neznakhina, Michael Khachay   +2 more
doaj   +1 more source

A polynomial time circle packing algorithm

Discrete Mathematics, 1993
A map on a surface \(S\) is a pair \((G,S)\) with \(G\) a graph which is 2-cell embedded in \(S\). A circle packing is a set of geodesic circles, with disjoint interiors, in a Riemannian surface \(S'\) of constant curvature. Connecting the midpoints of the circles with the touching points (with other circles or the same circle), one gets a graph on \(S'
openaire   +1 more source

Machine Learning Accelerated Computational Design of Bio‐Inspired Catalysts in the Nitrogen Reduction Reaction

Advanced Materials, EarlyView.
We introduce a computational workflow that combines quantum chemical calculations and machine learning techniques to predict the catalytic performance of a wide range of catalysts in the nitrogen reduction reaction (NRR). The analysis of the trained models provides insights into the complex structure–activity relationship in experimental catalytic ...
Leonardo Di Ciano, Zihan You, Haoran Chen, Qifan Zhong, Rong‐Zhen Liao, Shaoqi Zhan   +5 more
wiley   +1 more source

The Subset Sum Problem: Reducing Time Complexity of NP-Completeness with Quantum Search

Undergraduate Journal of Mathematical Modeling: One + Two, 2012
The Subset Sum Problem is a member of the NP-complete class, so no known polynomial time algorithm exists for it. Although there are polynomial time approximations and heuristics, these are not always acceptable, yet exact-solution algorithms are ...
Bo Moon
doaj   +1 more source

A verified factorization algorithm for integer polynomials with polynomial complexity [PDF]

, 2018
Short vectors in lattices and factors of integer polynomials are related. Each factor of an integer polynomial belongs to a certain lattice. When factoring polynomials, the condition that we are looking for an irreducible polynomial means that we must ...
Yamada, Akihisa, Jose Divasón [0000-0002-5173-128X], Sebastiaan Joosten, Akihisa Yamada, Divasón, Jose, René Thiemann, Joosten, Sebastiaan, Thiemann, René   +7 more
core  

Characterization of Droplet Formation in Ultrasonic Spray Coating: Influence of Ink Formulation Using Phase Doppler Anemometry and Machine Learning

Advanced Materials Technologies, EarlyView.
This study explores how machine learning models, trained on small experimental datasets obtained via Phase Doppler Anemometry (PDA), can accurately predict droplet size (D32) in ultrasonic spray coating (USSC). By capturing the influence of ink complexity (solvent, polymer, nanoparticles), power, and flow rate, the model enables precise droplet control
Pieter Verding, Danny E. P. Vanpoucke, Yunus T. Aksoy, Tobias Corthouts, Maria R. Vetrano, Wim Deferme   +5 more
wiley   +1 more source

Polynomial time algorithm for solving k-coverage problem in wireless sensor networks

Dianxin kexue, 2017
How to solve the k-coverage problem,which was divided into worst-case and best-case,inside the two-dimensional target area in wireless sensor networks was explored,and a polynomial time algorithm for solving this problem was put forward.In this algorithm,
Qi WANG, Zheng’an XIAO, Huaixing WANG
doaj   +2 more sources

Stochasticity in Algorithmic Statistics for Polynomial Time.

Electron. Colloquium Comput. Complex., 2017
A fundamental notion in Algorithmic Statistics is that of a stochastic object, i.e., an object having a simple plausible explanation. Informally, a probability distribution is a plausible explanation for x if it looks likely that x was drawn at random with respect to that distribution.
Alexey Milovanov, Nikolay K. Vereshchagin   +1 more
openaire   +4 more sources

A polynomial-time parsing algorithm for TT-MCTAG [PDF]

Proceedings of the Joint Conference of the 47th Annual Meeting of the ACL and the 4th International Joint Conference on Natural Language Processing of the AFNLP: Volume 2 - ACL-IJCNLP '09, 2009
This paper investigates the class of Tree-Tuple MCTAG with Shared Nodes, TT-MCTAG for short, an extension of Tree Adjoining Grammars that has been proposed for natural language processing, in particular for dealing with discontinuities and word order variation in languages such as German.
KALLMEYER L, SATTA, GIORGIO
openaire   +3 more sources