Results 51 to 60 of about 95,786 (283)
Advanced Theory and Simulations, EarlyView.FreqD‐LBM simulates the oscillatory flow at the surface of a QCM‐D resonator in the presence of structured adsorbates. It derives shifts of frequency and bandwidth (equivalent to dissipation) on different overtones. Applications include rough surfaces, adsorbed rigid particles, adsorbed viscoelastic particles, spheres floating freely above the surface,
Diethelm Johannsmann +5 more
wiley +1 more source
Advanced Science, EarlyView.Traditional Chinese Medicine (TCM), while holistic and historically esteemed, faces challenges in “miracle cures” due to slow onset, long cycles, and difficulty controlling quality. This study obtains the active ingredients, glabridin (GLA) and puerarin (PUE), from Ge‐Gen Decoction (GGD), developing a safe and effective drug delivery system, GLA‐PUE ...
Jianhong Qi +7 more
wiley +1 more source
La subsistance de l’homme : l’économie selon Karl Polanyi
Revue de la Régulation, 2012 The Livelihood of Man, posthumous work of Karl Polanyi, is now available in French. In a historical perspective this book, primarily theoretical, leans on the role of the economy in society.
Pierre Alary
doaj +1 more source
Arabic Sentiment Analysis Based on Word Embeddings and Deep Learning
Computers, 2023 Social media networks have grown exponentially over the last two decades, providing the opportunity for users of the internet to communicate and exchange ideas on a variety of topics.
Nasrin Elhassan +9 more
doaj +1 more source
Book Embeddings of Nonplanar Graphs with Small Faces in Few Pages [PDF]
arXiv, 2020 An embedding of a graph in a book, called book embedding, consists of a linear ordering of its vertices along the spine of the book and an assignment of its edges to the pages of the book, so that no two edges on the same page cross. The book thickness of a graph is the minimum number of pages over all its book embeddings.
arxiv
Bipartite cubic planar graphs are dispersable [PDF]
arXiv, 2021 The book embedding of a graph $G$ is to place the vertices of $G$ on the spine and draw the edges to the pages so that the edges in the same page do not cross with each other. A book embedding is matching if the vertices in the same page have maximum degree at most 1.
arxiv
From Lab to Life: Self‐Powered Sweat Sensors and Their Future in Personal Health Monitoring
Advanced Science, EarlyView.This review focuses on recent advances in self‐powered sweat sensors in personal health monitoring, including sweat sensors, energy harvesters, energy management, and their applications. It analyzes the difficulties and challenges in the research field of self‐powered sweat sensors and looks into the future direction of self‐powered sweat sensors from ...
Nan Gao +3 more
wiley +1 more source
Embedding the Complete Expansion Graph in Books [PDF]
arXiv, 2020 A book embedding of a graph consists of an embedding of its vertices along the spine of a book, and an embedding of its edges on the pages such that edges embedded on the same page do not intersect. The pagenumber is the minimum number of pages in which the graph $G$ can be embedded.
arxiv
Machine Learning‐Enabled Drug‐Induced Toxicity Prediction
Advanced Science, EarlyView.Unexpected toxicity accounts for 30% of drug development failures. This review highlights ML innovations in predicting drug‐induced toxicity, emphasizing comparative analyses, interpretable algorithms, and multi‐source data integration. It categorizes toxicity types, summarizes ML models, and organizes key databases, offering strategies to address ...
Changsen Bai +5 more
wiley +1 more source
Four Pages Are Indeed Necessary for Planar Graphs [PDF]
arXiv, 2020 An embedding of a graph in a book consists of a linear order of its vertices along the spine of the book and of an assignment of its edges to the pages of the book, so that no two edges on the same page cross. The book thickness of a graph is the minimum number of pages over all its book embeddings.
arxiv