Results 91 to 100 of about 818,233 (281)

More on the Cohort-Component Model of Population Projection in the Context of HIV/AIDS: A Leslie Matrix Representation and New Estimates [PDF]

open access: yes
This article presents an extension of the cohort component model of population projection (CCMPP) first formulated by Heuveline that is capable of modeling a population affected by HIV.
Jason Thomas, Samuel J. Clark
core  

Incidence Matrix Games

open access: yes, 1996
We consider the two-person zero-sum game in which the strategy sets for Players I and II consist of the vertices and the edges of a directed graph respectively.If Player I chooses vertex v and Player II chooses edge e; then the payoff is zero if v and e are not incident and otherwise it is 1 or _1 according as e originates or terminates at v: We obtain
Bapat, R., Tijs, S.H.
openaire   +1 more source

Circular‐Polarization‐Sensitive Organic Photodetectors with a Chiral Nanopatterned Electrode Inverse‐Designed by Genetic Algorithm

open access: yesAdvanced Functional Materials, EarlyView.
A chiral photodetector capable of selectively distinguishing left‐ and right‐handed circularly polarized light is experimentally demonstrated. The device, which features a nanopatterned electrode inverse‐designed by a genetic algorithm within a metal–dielectric–metal nanocavity that incorporates a vacuum‐deposited small‐molecule multilayer, exhibits ...
Kyung Ryoul Park   +3 more
wiley   +1 more source

A Matrix-Based Analytical Approach for Reliability Assessment of Mesh Distribution Networks

open access: yesEnergies
To address the limitations of conventional reliability assessment methods in handling mesh distribution networks with flexible operation characteristics and complex topologies, namely their poor adaptability and low computational efficiency, this paper ...
Shuitian Li   +7 more
doaj   +1 more source

On the Incidence Energy of Some Toroidal Lattices

open access: yesAbstract and Applied Analysis, 2014
The incidence energy IE(G), defined as the sum of the singular values of the incidence matrix of G, is a much studied quantity with well known applications in chemical physics.
Jia-Bao Liu, Jinde Cao, Jin Xie
doaj   +1 more source

Predicting Atomic Charges in MOFs by Topological Charge Equilibration

open access: yesAdvanced Functional Materials, EarlyView.
An atomic charge prediction method is presented that is able to accurately reproduce ab‐initio‐derived reference charges for a large number of metal–organic frameworks. Based on a topological charge equilibration scheme, static charges that fulfill overall neutrality are quickly generated.
Babak Farhadi Jahromi   +2 more
wiley   +1 more source

Deterministic Construction of Measurement Matrices Based on Bose Balanced Incomplete Block Designs

open access: yesIEEE Access, 2018
Compressed sensing is a novel information collection theory. Compared with the Nyquist sampling theorem, compressed sensing can obtain all the information of a signal with very few samples.
Liu Haiqiang   +4 more
doaj   +1 more source

Counterion Dependent Side‐Chain Relaxation Stiffens a Chemically Doped Thienothiophene Copolymer

open access: yesAdvanced Functional Materials, EarlyView.
Oxidation of a thienothiophene copolymer, p(g3TT‐T2), via different doping strategies and dopant molecules resulted in materials with similar oxidation levels and a high electrical conductivity of ≈100 S cm−1. However, mechanical properties varied significantly, with sub‐glass transition temperatures and elastic moduli spanning from –44°C to –3°C and ...
Mariavittoria Craighero   +12 more
wiley   +1 more source

Interval Valued Secondary k-Range Symmetric Quadri Partitioned Neutrosophic Fuzzy Matrices with Decision Making [PDF]

open access: yesNeutrosophic Sets and Systems
The objective of this study is to establish the results concerning Interval-Valued (IV) Secondary k-Range Symmetric (RS) Quadri Partitioned Neutrosophic Fuzzy Matrices (QPNFM).
K. Radhika   +5 more
doaj   +1 more source

Mining Frequent Subgraph by Incidence Matrix Normalization

open access: yesJournal of Computers, 2008
Existing frequent subgraph mining algorithms can operate efficiently on graphs that are sparse, have vertices with low and bounded degrees, and contain welllabeled vertices and edges. However, there are a number of applications that lead to graphs that do not share these characteristics, for which these algorithms highly become inefficient.
Jia Wu, Ling Chen
openaire   +1 more source

Home - About - Disclaimer - Privacy