Results 81 to 90 of about 4,979,723 (296)

Network Maketing: Analisis Terhadap Pemasaran Jejaring Dalam Penjualan Langsung Berjenjang Syariah

open access: yesAl-Intaj, 2017
This paper describing the dynamics and development of the marketing system in the tiered direct network sales in Sharia. The main idea of this paper seeks to examine the rules set out in DSN-MUI Fatwa No.
Rohimin Rohimin
doaj   +1 more source

Bulk‐Like Spin Cycloid and Fast Switching in Freestanding BiFeO3

open access: yesAdvanced Functional Materials, EarlyView.
Freestanding BiFeO3 membranes overcome substrate‐induced constraints by simultaneously restoring the intrinsic bulk‐like spin cycloid and enabling ≈50% faster ferroelectric switching than substrate‐clamped epitaxial thin films. This combination of robust noncollinear antiferromagnetic order and efficient electric‐field switching establishes ...
Pratap Pal   +12 more
wiley   +1 more source

A Characterization of 2-Tree Probe Interval Graphs

open access: yesDiscussiones Mathematicae Graph Theory, 2014
A graph is a probe interval graph if its vertices correspond to some set of intervals of the real line and can be partitioned into sets P and N so that vertices are adjacent if and only if their corresponding intervals intersect and at least one belongs ...
Brown David E.   +2 more
doaj   +1 more source

An Integrated Oxygen‐Supplying Device and Predictive Multiphysics Model for Extended Ambient Transport of Insulin‐Producing Cells

open access: yesAdvanced Functional Materials, EarlyView.
Cell therapies typically rely on cold‐chain logistics and cryopreservation, limiting access and compromising cell quality. Here, a dual‐chamber device separates an oxygen‐supplying chamber from a hyaluronic acid cargo chamber, sustaining oxygen delivery for over 70 h and enabling ambient‐temperature shipment.
Daniel A. Domingo‐Lopez   +9 more
wiley   +1 more source

On Sequential Heuristic Methods for the Maximum Independent Set Problem

open access: yesDiscussiones Mathematicae Graph Theory, 2017
We consider sequential heuristics methods for the Maximum Independent Set (MIS) problem. Three classical algorithms, VO [11], MIN [12], or MAX [6] , are revisited. We combine Algorithm MIN with the α-redundant vertex technique[3].
Lê Ngoc C.   +2 more
doaj   +1 more source

Plick Graphs with Crossing Number 1 [PDF]

open access: yes, 2011
In this paper, we deduce a necessary and sufficient condition for graphs whose plick graphs have crossing number 1. We also obtain a necessary and sufficient condition for plick graphs to have crossing number 1 in terms of forbidden ...
Basavanagoud, B., Kulli, V.R.
core   +1 more source

Enhanced Ferroelectric Phase Formation via Local Structure Modification in the Pre‐Crystalline State of Hafnium Zirconium Oxide Thin Films

open access: yesAdvanced Functional Materials, EarlyView.
Hafnium zirconium oxide thin films are grown using plasma‐enhanced atomic layer deposition with the addition of an atomic layer annealing (ALA) step. ALA leads to a change in the short‐range structure of the deposit and encourages formation of the ferroelectric Pca21 phase. The result is wake‐up‐free performance with films exposed to ALA.
Nicolas K. Lam   +18 more
wiley   +1 more source

Global behavior of a rational difference equation with quadratic term [PDF]

open access: yesMathematica Moravica, 2014
In this paper, we determine the forbidden set, introduce an explicit formula for the solutions and discuss the global behavior of all solutions of the difference equation Xn+1 = aXnXn-1 bXn - CXn-2, n = 0, 1, … where a, b, c are positive real numbers and
Abo-Zeid R.
doaj  

Further Operations (Complement, Intersection, Union) for IndetermSoft Set, IndetermHyperSoft Set, and TreeSoft Set and their Applications

open access: yes
In this paper, efforts are intensified as much as possible to explicitly and clearly give the definitions as regards the operations involving the complement, intersection as well as the union for IndetermSoft Set, IndetermHyperSoft Set, and Tree Soft Set
Adesina, Adebisi Sunday
core   +1 more source

Automata and forbidden words [PDF]

open access: yes, 1998
International audienceLet L(M) be the (factorial) language avoiding a given anti-factorial language M. We design an automaton accepting L(M) and built from the language M. The construction is effective if M is finite. If M is the set of minimal forbidden
Restivo, Antonio   +2 more
core   +1 more source

Home - About - Disclaimer - Privacy