Results 71 to 80 of about 1,087,226 (284)
The Narrative of Manufactured Division and Artificial Segregation in Train to Pakistan and Cracking India [PDF]
Indian author Khushwant Singh’s novel Train to Pakistan, and Pakistani author Bapsi Sidhwa’s novel cracking India recount the events of the partition of India.
Sheikh Zobaer
doaj
The Complexity of the List Partition Problem for Graphs [PDF]
The k-partition problem is as follows: Given a graph G and a positive integer k, partition the vertices of G into at most k parts A1, A2, . . . , Ak, where it may be specified that Ai induces a stable set, a clique, or an arbitrary subgraph, and pairs Ai,
Cameron, Kathie +3 more
core +2 more sources
We introduce a new concept, which we call partition expanders. The basic idea is to study quantitative properties of graphs in a slightly different way than it is in the standard definition of expanders. While in the definition of expanders it is required that the number of edges between any pair of sufficiently large sets is close to the expected ...
Gavinsky, Dmitry, Pudlák, Pavel
openaire +6 more sources
POWER PARTITIONS AND SEMI--FIBONACCI PARTITIONS
Andrews [‘Binary and semi-Fibonacci partitions’, J. Ramanujan Soc. Math. Math. Sci.7(1) (2019), 1–6] recently proved a new identity between the cardinalities of the set of semi-Fibonacci partitions and the set of partitions into powers of 2 with all parts appearing an odd number of times.
ABDULAZIZ M. ALANAZI +2 more
openaire +2 more sources
ZFAS1 is a lncRNA promoting cell proliferation and migration, exhibiting high expression in various cancers. It is conserved, widely expressed, and produces multiple splice variants with unclear roles. We identified several splice variants in hepatocyte models, and found that inhibiting or suppressing regulators of the unfolded protein response (PERK ...
Sébastien Soubeyrand +2 more
wiley +1 more source
Probabilistic Partitive Partitioning (PPP)
Clustering is a NP-hard problem. Thus, no optimal algorithm exists, heuristics are applied to cluster the data. Heuristics can be very resource-intensive, if not applied properly. For substantially large data sets computational efficiencies can be achieved by reducing the input space if a minimal loss of information can be achieved.
openaire +2 more sources
Hypergraphs are generalization of graphs where each edge (hyperedge) can connect more than two vertices. In simple terms, the hypergraph partitioning problem can be defined as the task of dividing the vertices of hypergraph into two or more roughly equal sized parts such that a cost function on the hyperedges connecting vertices in different parts is ...
Quincey Koziol +13 more
openaire +3 more sources
Nuclear pore links Fob1‐dependent rDNA damage relocation to lifespan control
Damaged rDNA accumulates at a specific perinuclear interface that couples nucleolar escape with nuclear envelope association. Nuclear pores at this site help inhibit Fob1‐induced rDNA instability. This spatial organization of damage handling supports a functional link between nuclear architecture, rDNA stability, and replicative lifespan in yeast.
Yamato Okada +5 more
wiley +1 more source
Applications of Electrochemistry at the ITIES in Drug Discovery and Development – A Review
The field of electrochemistry at the interface between two immiscible electrolyte solutions (ITIES) has been continuously expanding over the years due to their vast number of applications, including to investigate the partitioning of ionizable drugs at ...
José A. Ribeiro, Carlos M. Pereira
doaj +1 more source
Artifacts in ultracentrifugal estimation of aqueous fattv acid concentration
Ultracentrifugation for determination of isotropic concentrations of fatty acids is widely used. However, several artifacts, which would affect the isotropic concentration, could occur if care is not taken.
K.Y. Lee
doaj +1 more source

