Dominance order
-
This practice-led research project considers human agency in relation to matter and materialism. Seeking to unlearn human assertions of agency as dominant, this project fosters relational and collaborative exchanges with matter that manifest as installations and sculptural interventions. Informed by new materialist and posthuman frameworks, it recognises that material hierarchies are held in place by what we choose to prioritise in human worlds.
106p runthenight04 02-02-2023 7 4 Download
-
The new antigen receptor (IgNAR) from sharks is a disul-phide bonded dimer of two protein chains,each containing one variable and five constant domains,and functions as an antibody. In order to assess the antigen-binding capabilities of isolated IgNAR variable domains (VNAR),we have con-structed anin vitro library incorporating synthetic CDR3 regions of 15–18 residues in length.
12p tumor12 20-04-2013 26 3 Download
-
TRPP2, also called polycystin-2, the gene product ofPKD2, is a membrane protein defective in 10–15% of cases of autosomal dominant polycystic kidney disease. Mutations in PKD2 are also associated with extrarenal dis-orders, such as hepatic cystogenesis and cardiovascular abnormalities.
9p inspiron33 23-03-2013 35 4 Download
-
NONOSCILLATORY HALF-LINEAR DIFFERENCE EQUATIONS AND RECESSIVE SOLUTIONS ˇ ´ MARIELLA CECCHI, ZUZANA DOSLA, AND MAURO MARINI Received 30 January 2004 and in revised form 26 May 2004 Recessive and dominant solutions for the nonoscillatory half-linear difference equation are investigated. By using a uniqueness result for the zero-convergent solutions satisfying a suitable final condition, we prove that recessive solutions are the “smallest solutions in a neighborhood of infinity,” like in the linear case. Other asymptotic properties of recessive and dominant solutions are treated too. 1.
12p sting12 10-03-2012 43 5 Download
-
We gave a new criterion for graphical partitions. We derive a new recursion formula, which allows the computation of the number g(n) of graphical partitions of weight n for up to n 900.A partition of weight n is a nonincreasing sequence of nonnegative integers (1, 2, . . . , k, . . .) whose sum is n. The weight is denoted by ||. The number of nonzero elements in the sequence is the length of the partition denoted by l(). The set of all partitions of weight n is denoted by P(n).
17p thulanh5 12-09-2011 53 4 Download
-
Tuyển tập các báo cáo nghiên cứu khoa học hay nhất của tạp chí toán học quốc tế đề tài: Tight Upper Bounds for the Domination Numbers of Graphs with Given Order and Minimum Degree, II...
19p thulanh4 11-09-2011 47 2 Download
-
Tuyển tập các báo cáo nghiên cứu khoa học ngành toán học tạp chí toán học quốc tế đề tài: TIGHT UPPER BOUNDS FOR THE DOMINATION NUMBERS OF GRAPHS WITH GIVEN ORDER AND MINIMUM DEGREE...
24p thulanh3 10-09-2011 38 4 Download