By Julia Conley Common Dreams “Nature is not a ‘nice to have’—it is our life-support system.” Scientists from around the world issued a stark warning to humanity Tuesday in a semi-annual report on the Earth’s declining biodiversity, which shows that … Continue reading →

The notoriously independent-minded federal judge who once said he was disgusted by the conduct of Michael Flynn could block the administration's bid to drop criminal charges against the former adviser to President Donald Trump, legal experts said.

Consider that $u_0$ nodes are aware of some piece of data $d_0$. This note derives the expected time required for the data $d_0$ to be disseminated through-out a network of $n$ nodes, when communication between nodes evolves according to a graphical Markov model $overline{ mathcal{G}}_{n,hat{p}}$ with probability parameter $hat{p}$. In this model, an edge between two nodes exists at discrete time $k in mathbb{N}^+$ with probability $hat{p}$ if this edge existed at $k-1$, and with probability $(1-hat{p})$ if this edge did not exist at $k-1$. Each edge is interpreted as a bidirectional communication link over which data between neighbors is shared. The initial communication graph is assumed to be an Erdos-Renyi random graph with parameters $(n,hat{p})$, hence we consider a emph{stationary} Markov model $overline{mathcal{G}}_{n,hat{p}}$. The asymptotic "$u_0$-expected flooding time" of $overline{mathcal{G}}_{n,hat{p}}$ is defined as the expected number of iterations required to transmit the data $d_0$ from $u_0$ nodes to $n$ nodes, in the limit as $n$ approaches infinity. Although most previous results on the asymptotic flooding time in graphical Markov models are either emph{almost sure} or emph{with high probability}, the bounds obtained here are emph{in expectation}. However, our bounds are tighter and can be more complete than previous results.

Here we prove that under a lower sectional curvature bound, a sequence of manifolds diffeomorphic to the standard $m$-dimensional torus cannot converge in the Gromov-Hausdorff sense to a closed interval.

We prove the following result: Let $(M,g_0)$ be a compact manifold of dimension $ngeq 12$ with positive isotropic curvature. Then $M$ is diffeomorphic to a spherical space form, or a compact quotient manifold of $mathbb{S}^{n-1} imes mathbb{R}$ by diffeomorphisms, or a connected sum of a finite number of such manifolds. This extends a recent work of Brendle, and implies a conjecture of Schoen in dimensions $ngeq 12$. The proof uses Ricci flow with surgery on compact orbifolds with isolated singularities.

We prove an inequality between the sum of the Betti numbers of a complex projective manifold and its total curvature, and we characterize the complex projective manifolds whose total curvature is minimal. These results extend the classical theorems of Chern and Lashof to complex projective space.

We extend the analytic theory of Frobenius manifolds to semisimple points with coalescing eigenvalues of the operator of multiplication by the Euler vector field. We clarify which freedoms, ambiguities and mutual constraints are allowed in the definition of monodromy data, in view of their importance for conjectural relationships between Frobenius manifolds and derived categories. Detailed examples and applications are taken from singularity and quantum cohomology theories. We explicitly compute the monodromy data at points of the Maxwell Stratum of the A3-Frobenius manifold, as well as at the small quantum cohomology of the Grassmannian G(2,4). In the latter case, we analyse in details the action of the braid group on the monodromy data. This proves that these data can be expressed in terms of characteristic classes of mutations of Kapranov's exceptional 5-block collection, as conjectured by one of the authors.

We use Ricci flow to obtain a local bi-Holder correspondence between Ricci limit spaces in three dimensions and smooth manifolds. This is more than a complete resolution of the three-dimensional case of the conjecture of Anderson-Cheeger-Colding-Tian, describing how Ricci limit spaces in three dimensions must be homeomorphic to manifolds, and we obtain this in the most general, locally non-collapsed case. The proofs build on results and ideas from recent papers of Hochard and the current authors.

In this paper we introduce various types of harmonic Finsler manifolds and study the relation between them. We give several characterizations of such spaces in terms of the mean curvature and Laplacian. In addition, we prove that some harmonic Finsler manifolds are of Einstein type and a technique to construct harmonic Finsler manifolds of Rander type is given. Moreover, we provide many examples of non-Riemmanian Finsler harmonic manifolds of constant flag curvature and constant $S$-curvature. Finally, we analyze Busemann functions in a general Finsler setting and in certain kind of Finsler harmonic manifolds, namely asymptotically harmonic Finsler manifolds along with studying some applications. In particular, we show the Busemann function is smooth in asymptotically harmonic Finsler manifolds and the total Busemann function is continuous in $C^{infty}$ topology.

Let $Gamma subset operatorname{PU}(1,n)$ be a lattice, and $S_Gamma$ the associated ball quotient. We prove that, if $S_Gamma$ contains infinitely many maximal totally geodesic subvarieties, then $Gamma$ is arithmetic. We also prove an Ax-Schanuel Conjecture for $S_Gamma$, similar to the one recently proven by Mok, Pila and Tsimerman. One of the main ingredients in the proofs is to realise $S_Gamma$ inside a period domain for polarised integral variations of Hodge structures and interpret totally geodesic subvarieties as unlikely intersections.

We show that any toric K"ahler cone with smooth compact cross-section admits a family of Calabi-Yau cone metrics with conical singularities along its toric divisors. The family is parametrized by the Reeb cone and the angles are given explicitly in terms of the Reeb vector field. The result is optimal, in the sense that any toric Calabi-Yau cone metric with conical singularities along the toric divisor (and smooth elsewhere) belongs to this family. We also provide examples and interpret our results in terms of Sasaki-Einstein metrics.

In cite{S 2017}, Suh gave a non-existence theorem for Hopf real hypersurfaces in the complex quadric with parallel normal Jacobi operator. Motivated by this result, in this paper, we introduce some generalized conditions named $mathcal C$-parallel or Reeb parallel normal Jacobi operators. By using such weaker parallelisms of normal Jacobi operator, first we can assert a non-existence theorem of Hopf real hypersurfaces with $mathcal C$-parallel normal Jacobi operator in the complex quadric $Q^{m}$, $m geq 3$. Next, we prove that a Hopf real hypersurface has Reeb parallel normal Jacobi operator if and only if it has an $mathfrak A$-isotropic singular normal vector field.

We define local indices for projective umbilics and godrons (also called cusps of Gauss) on generic smooth surfaces in projective 3-space. By means of these indices, we provide formulas that relate the algebraic numbers of those characteristic points on a surface (and on domains of the surface) with the Euler characteristic of that surface (resp. of those domains). These relations determine the possible coexistences of projective umbilics and godrons on the surface. Our study is based on a "fundamental cubic form" for which we provide a closed simple expression.

We observe that the DeTurck Laplacian flow of G2-structures introduced by Bryant and Xu as a gauge fixing of the Laplacian flow can be regarded as a flow of G2-structures (not necessarily closed) which fits in the general framework introduced by Hamilton in [4].

In this note, we establish a local maximum principle along Ricci flow under scaling invariant curvature condition. This unifies the known preservation of nonnegativity results along Ricci flow with unbounded curvature. By combining with the Dirichlet heat kernel estimates, we also give a more direct proof of Hochard's localized version of a maximum principle given by R. Bamler, E. Cabezas-Rivas, and B. Wilking on the lower bound of curvature conditions.

We introduce natural deformation classes of generalized K"ahler structures using the Courant symmetry group. We show that these yield natural extensions of the notions of K"ahler class and K"ahler cone to generalized K"ahler geometry. Lastly we show that the generalized K"ahler-Ricci flow preserves this generalized K"ahler cone, and the underlying real Poisson tensor.

A k-proper edge-coloring of a graph G is called adjacent vertex-distinguishing if any two adjacent vertices are distinguished by the set of colors appearing in the edges incident to each vertex. The smallest value k for which G admits such coloring is denoted by $chi$'a (G). We prove that $chi$'a (G) = 2R + 1 for most circulant graphs Cn([[1, R]]).

Existing patient data analytics platforms fail to incorporate information that has context, is personal, and topical to patients. For a recommendation system to give a suitable response to a query or to derive meaningful insights from patient data, it should consider personal information about the patient's health history, including but not limited to their preferences, locations, and life choices that are currently applicable to them. In this review paper, we critique existing literature in this space and also discuss the various research challenges that come with designing, building, and operationalizing a personal health knowledge graph (PHKG) for patients.

It has recently been shown that word embeddings encode social biases, with a harmful impact on downstream tasks. However, to this point there has been no similar work done in the field of graph embeddings. We present the first study on social bias in knowledge graph embeddings, and propose a new metric suitable for measuring such bias. We conduct experiments on Wikidata and Freebase, and show that, as with word embeddings, harmful social biases related to professions are encoded in the embeddings with respect to gender, religion, ethnicity and nationality. For example, graph embeddings encode the information that men are more likely to be bankers, and women more likely to be homekeepers. As graph embeddings become increasingly utilized, we suggest that it is important the existence of such biases are understood and steps taken to mitigate their impact.

We design and implement the first private and anonymous decentralized crowdsourcing system ZebraLancer, and overcome two fundamental challenges of decentralizing crowdsourcing, i.e., data leakage and identity breach.

First, our outsource-then-prove methodology resolves the tension between the blockchain transparency and the data confidentiality to guarantee the basic utilities/fairness requirements of data crowdsourcing, thus ensuring: (i) a requester will not pay more than what data deserve, according to a policy announced when her task is published via the blockchain; (ii) each worker indeed gets a payment based on the policy, if he submits data to the blockchain; (iii) the above properties are realized not only without a central arbiter, but also without leaking the data to the open blockchain. Second, the transparency of blockchain allows one to infer private information about workers and requesters through their participation history. Simply enabling anonymity is seemingly attempting but will allow malicious workers to submit multiple times to reap rewards. ZebraLancer also overcomes this problem by allowing anonymous requests/submissions without sacrificing accountability. The idea behind is a subtle linkability: if a worker submits twice to a task, anyone can link the submissions, or else he stays anonymous and unlinkable across tasks. To realize this delicate linkability, we put forward a novel cryptographic concept, i.e., the common-prefix-linkable anonymous authentication. We remark the new anonymous authentication scheme might be of independent interest. Finally, we implement our protocol for a common image annotation task and deploy it in a test net of Ethereum. The experiment results show the applicability of our protocol atop the existing real-world blockchain.

Predicate constraints of general-purpose knowledge bases (KBs) like Wikidata, DBpedia and Freebase are often limited to subproperty, domain and range constraints. In this demo we showcase CounQER, a system that illustrates the alignment of counting predicates, like staffSize, and enumerating predicates, like workInstitution^{-1} . In the demonstration session, attendees can inspect these alignments, and will learn about the importance of these alignments for KB question answering and curation. CounQER is available at https://counqer.mpi-inf.mpg.de/spo.

Rescue vessels are the main actors in maritime safety and rescue operations. At the same time, aerial drones bring a significant advantage into this scenario. This paper presents the research directions of the AutoSOS project, where we work in the development of an autonomous multi-robot search and rescue assistance platform capable of sensor fusion and object detection in embedded devices using novel lightweight AI models. The platform is meant to perform reconnaissance missions for initial assessment of the environment using novel adaptive deep learning algorithms that efficiently use the available sensors and computational resources on drones and rescue vessel. When drones find potential objects, they will send their sensor data to the vessel to verity the findings with increased accuracy. The actual rescue and treatment operation are left as the responsibility of the rescue personnel. The drones will autonomously reconfigure their spatial distribution to enable multi-hop communication, when a direct connection between a drone transmitting information and the vessel is unavailable.

Fashion trend forecasting is a crucial task for both academia and industry. Although some efforts have been devoted to tackling this challenging task, they only studied limited fashion elements with highly seasonal or simple patterns, which could hardly reveal the real fashion trends. Towards insightful fashion trend forecasting, this work focuses on investigating fine-grained fashion element trends for specific user groups. We first contribute a large-scale fashion trend dataset (FIT) collected from Instagram with extracted time series fashion element records and user information. Further-more, to effectively model the time series data of fashion elements with rather complex patterns, we propose a Knowledge EnhancedRecurrent Network model (KERN) which takes advantage of the capability of deep recurrent neural networks in modeling time-series data. Moreover, it leverages internal and external knowledge in fashion domain that affects the time-series patterns of fashion element trends. Such incorporation of domain knowledge further enhances the deep learning model in capturing the patterns of specific fashion elements and predicting the future trends. Extensive experiments demonstrate that the proposed KERN model can effectively capture the complicated patterns of objective fashion elements, therefore making preferable fashion trend forecast.

Multi-view data capture permits free-viewpoint video (FVV) content creation. To this end, several users must capture video streams, calibrated in both time and pose, framing the same object/scene, from different viewpoints. New-generation network architectures (e.g. 5G) promise lower latency and larger bandwidth connections supported by powerful edge computing, properties that seem ideal for reliable FVV capture. We have explored this possibility, aiming to remove the need for bespoke synchronisation hardware when capturing a scene from multiple viewpoints, making it possible through off-the-shelf mobiles. We propose a novel and scalable data capture architecture that exploits edge resources to synchronise and harvest frame captures. We have designed an edge computing unit that supervises the relaying of timing triggers to and from multiple mobiles, in addition to synchronising frame harvesting. We empirically show the benefits of our edge computing unit by analysing latencies and show the quality of 3D reconstruction outputs against an alternative and popular centralised solution based on Unity3D.

We analyze the computational complexity of motion planning through local "input/output" gadgets with separate entrances and exits, and a subset of allowed traversals from entrances to exits, each of which changes the state of the gadget and thereby the allowed traversals. We study such gadgets in the 0-, 1-, and 2-player settings, in particular extending past motion-planning-through-gadgets work to 0-player games for the first time, by considering "branchless" connections between gadgets that route every gadget's exit to a unique gadget's entrance. Our complexity results include containment in L, NL, P, NP, and PSPACE; as well as hardness for NL, P, NP, and PSPACE. We apply these results to show PSPACE-completeness for certain mechanics in Factorio, [the Sequence], and a restricted version of Trainyard, improving prior results. This work strengthens prior results on switching graphs and reachability switching games.

Recently, the Edge Computing paradigm has gained significant popularity both in industry and academia. Researchers now increasingly target to improve performance and reduce energy consumption of such devices. Some recent efforts focus on using emerging RRAM technologies for improving energy efficiency, thanks to their no leakage property and high integration density. As the complexity and dynamism of applications supported by such devices escalate, it has become difficult to maintain ideal performance by static RRAM controllers. Machine Learning provides a promising solution for this, and hence, this work focuses on extending such controllers to allow dynamic parameter updates. In this work we propose an Adaptive RRAM Variability-Aware Controller, AVAC, which periodically updates Wait Buffer and batch sizes using on-the-fly learning models and gradient ascent. AVAC allows Edge devices to adapt to different applications and their stages, to improve computation performance and reduce energy consumption. Simulations demonstrate that the proposed model can provide up to 29% increase in performance and 19% decrease in energy, compared to static controllers, using traces of real-life healthcare applications on a Raspberry-Pi based Edge deployment.

Making changes to a program to optimize its performance is an unscalable task that relies entirely upon human intuition and experience. In addition, companies operating at large scale are at a stage where no single individual understands the code controlling its systems, and for this reason, making changes to improve performance can become intractably difficult. In this paper, a learning system is introduced that provides AI assistance for finding recommended changes to a program. Specifically, it is shown how the evaluative feedback, delayed-reward performance programming domain can be effectively formulated via the Monte Carlo tree search (MCTS) framework. It is then shown that established methods from computational games for using learning to expedite tree-search computation can be adapted to speed up computing recommended program alterations. Estimates of expected utility from MCTS trees built for previous problems are used to learn a sampling policy that remains effective across new problems, thus demonstrating transferability of optimization knowledge. This formulation is applied to the Apache Spark distributed computing environment, and a preliminary result is observed that the time required to build a search tree for finding recommendations is reduced by up to a factor of 10x.

[IMAGE-1] First of all: No. Why would a suddenly single dad to traumatized young children leave said shocked and distressed kids with his new fiancée, who is also the sole survivor of her own massive childhood trauma?…

[IMAGE-1] Harrison Ford has gone full Grizzly Adams and Buck the canine hero is fully CGI, 100-percent digital, not a scrap of real fur or dog farts about him. There is so much about this new umpteenth film version of Jack London's classic novel The Call of the Wild that is ready-made for meme-iriffic snarking.…

ON INLANDER.COM COVER: While Washington state forges alliances, Idaho battles coronavirus its own way.…

Disclosed is a method for producing graphene functionalized at its edge positions of graphite. Organic material having one or more functional groups is reacted with graphite in reaction medium comprising methanesulfonic acid and phosphorus pentoxide, or in reaction medium comprising trifluoromethanesulfonic acid, to produce graphene having organic material fuctionalized at edges. And then, high purity and large scaled graphene and film can be obtained by dispersing, centrifugal separating the functionalized graphene in a solvent and reducing, in particular heat treating the graphene. According to the present invention graphene can be produced inexpensively in a large amount with a minimum loss of graphite. (FIG. 1)

A method for performing relational analysis of parsed input is employed to create a visual map of knowledge information. A title, header or subject line for an input item of information is parsed into syntactical components of at least a subject component and any predicate component(s) relationally linked as topic and subtopics. A search of topics and subtopics is carried out for each parsed component. If a match is found, then the parsed component is taken as a chosen topic/subtopic label. If no match is found, then the parsed component is formatted as a new entry in the knowledge map. A translation function for translating topics and subtopics from an original language into one or more target languages is enabled by user request or indicated user preference for display on a generated visual map of knowledge information.

This invention relates to a process for polymerizing ethylene comprising contacting ethylene and optional comonomers with a catalyst system comprising an activator and a transition metal compound represented by the formula: ##STR1## Wherein R1 and R2 are independently hydrogen or a group having up to 100 carbon atoms, Cp1 is a bulky ligand; Cp2 is a bulky ligand or a heteroatom optionally bound to a C1 to C50 hydrocarbyl group, n is the valence state of the transition metal, Tm is a Group 3 to 10 metal, and each X is independently an anionic leaving group.

Metallocene compounds having two fluorenyl ligands bridged with a single silicon or germanium atom, said atom having two substituent groups containing a total of at least four carbon atoms, are useful as catalyst components for the polymerization of olefins. Particularly, it is possible to prepare high molecular weight atactic polypropylene with improved yields with respect to the known catalysts.

The present invention relates to a process for preparing a methylene-bridged biscyclopentadienyl compound having the formula I ##STR1##where L are, independently of one another, identical or different and are each a cyclopentadienyl group, by reacting one or two cyclopentadienyl compounds LH with formaldehyde in monomeric, oligomeric or polymeric form or formaldehyde-generating reagents in the presence of at least one base and at least one phase transfer catalyst.

A process for obtaining silicon-bridged metallocene compounds comprising the following steps: a) reacting, at a temperature of between −10° C. and 70° C., the starting ligand with about 2 molar equivalents of an alkylating agent;b) after the reaction has been completed, adding at least 2 molar equivalents of an alkylating agent that can be also different from the first one; andc) reacting, at a temperature of between −10° C. and 70° C., the product obtained from step b) with at least 1 molar equivalent of a compound of formula ML's, wherein M is a transition metal; s is an integer corresponding to the oxidation state of the metal; and L' is an halogen atom selected from chlorine, bromine and iodine.

A continuous process for the thermal treatment of a refinery sludge, comprising the following operations: a. drying of the refinery sludge, possibly mixed with pet-coke, at a temperature ranging from 110 to 120° C.; b. gasification of the dried sludge, at a temperature ranging from 750 to 950° C., for a time of 30 to 60 minutes, in the presence of a gas containing oxygen and water vapour, with the associated production of synthesis gas (CO+H2) and a solid residue; c. combustion of the synthesis gas at a temperature ranging from 850 to 1,200° C. and recycling of the combustion products for the drying and gasification phases; and d. inertization of the solid residue, at a temperature ranging from 1,300 to 1,500° C., by vitrification with plasma torches.

A bridge circuit of an embodiment includes: a command transfer portion which is configured by wired logic into which a host controller capable of sending a command that corresponds to each of a plurality of devices inputs the command, and which is configured to transfer the inputted command to the plurality of devices; a command analysis portion which is configured by wired logic, and which is configured to analyze the command from the host controller; and a response reply portion which is configured by wired logic, and which is capable of reading out a response based on an analysis result of the command analysis portion from a register that holds a response corresponding to the command and sending the response to the host controller.

A bridge includes a Peripheral Component Interconnect Express interface supporting at least two lanes, an Extensible Host Controller Interface, and a Universal Serial Bus 3.0 root hub. The Peripheral Component Interconnect Express interface is used for coupling to a host. Each lane of the at least two lanes provides a highest data transmission speed. The Extensible Host Controller Interface is coupled to the Peripheral Component Interconnect Express interface for storing data transmitted by the Peripheral Component Interconnect Express interface. The Universal Serial Bus 3.0 root hub includes a first controller and a second controller. The first controller and the second controller are used for controlling data transmission of four ports, and a highest data transmission speed provided by each port of the four ports is not more than the highest data transmission speed provided by the lane.

According to an embodiment, based on task border information, and first-type dependency relationship information containing N number of nodes corresponding to data accesses to one set of data, containing edges representing dependency relationship between the nodes, and having at least one node with an access reliability flag indicating reliability/unreliability of corresponding data access; task border edges, of edges extending over task borders, are identified that have an unreliable access node linked to at least one end, and presentation information containing unreliable access nodes is generated. According to dependency existence information input corresponding to the set of data, conversion information indicating absence of data access to the unreliable access nodes is output. According to the conversion information, the first-type dependency relationship information is converted into second-type dependency relationship information containing M number of nodes (0≦M≦N) corresponding to data accesses to the set of data and containing edges representing inter-node dependency relationship.

An apparatus for measuring a time interval between a start signal edge and a stop signal edge provides a stable clock signal as input to a delay line formed by a series of similar logic gates. The output signal of the last gate of the series is phase locked to the clock signal by adjusting a bias signal controlling the switching speed of all gates. The clock signal and the output signal of each gate form a set of phase distributed periodic timing signals applied to a start time measurement unit (TMU) and a similar stop TMU. The start TMU counts edges of one of the timing signals occurring between an edge of an arming signal and the start signal edge and generates output data representing a time delay between the arming signal and the start signal edge. The data represents the start delay as a whole and fractional number of clock signal periods by conveying the counter output and by indicating which of the timing signals had an edge most closely following the start signal edge. The stop TMU similarly produces output data indicating a whole an fractional number of clock cycles occurring between the arming signal and the stop signal edge. The delay represented by the start TMU output data is subtracted from the delay represented by the stop TMU output data to determine the interval between the start and stop signal edges.

A power controller can set the power state of a processor bridge based on which processor modules are in a communicative state. In addition, for a power state where selected processor modules are expected to be non-communicative, the power controller can set the supplied voltage to have a reduced voltage guard band as compared to other power states. These power management techniques can reduce the power consumed by the processor.

A peak-relevant value device acquires a peak-relevant value (for example, the peak value of an R wave (R peak value)) every cycle from an electrocardiogram acquired. The frequencies of the peak-relevant value acquired as time-series data and the magnitudes for the respective frequencies are analyzed. A peak-relevant value LF calculating device calculates an LF component (peak-relevant value LF component) from the frequency component of the peak-relevant value. An interval acquiring device acquires the interval between characteristic points of the electrocardiographic complex from the electrocardiogram acquired and the frequencies of the feature point interval acquired as time-series data to acquire the magnitudes of the respective frequency component are analyzed. An interval HF calculating device calculates the HF component from the frequency components of the feature point interval acquired and pain is judged on the basis of the variations of the peak-relevant value LF components and the interval HF components.

A combination of a substrate selected from silicon, silicon carbide or a metal and a grapheme precursor having the following properties: (a) an aromatic structure that forms the basis of the graphene structure, said aromatic structure being selected from the group consisting of: benzene, naphthalene, pyrene, anthracene, chrysene, coronene, and phenanthrene, or a cyclic or acyclic structures which can be converted to aromatic structures and (b) functional groups that can react with each other to form additional aromatic structures.

The present invention provides methods of making stereo-enriched ansa-metallocene compounds using an unchelated amine compound. Generally, these methods result in a rac:meso isomer selectivity of the stereo-enriched ansa-metallocene compound of greater than 4:1.

The invention relates to a cartridge (1) for accommodating blood bags (35), which is provided for the separation of blood components for the application in a centrifuge. The cartridge (1) has a partition wall (3) which separates a blood bag section (5) positioned radially inside from a product section (7) positioned radially outside, and a cover (9) disposed in a mounting position above the blood bag section (5). The cover (9) is connected to the partition wall (3) pivotally in a first point (11) and detachably in a second point (13), so that the blood bag section (5) is freely accessible by means of laterally pivoting the cover (9) out of the way. The cartridge is applicable in the rotor of a centrifuge.

The invention is a decanter centrifuge for separating a first substance and a second substance with different densities, comprising a bowl rotating in use around a horizontal axis of rotation in a direction of rotation, said axis of rotation extending in a longitudinal direction of said bowl, a radial direction extending perpendicular to the longitudinal direction, a base plate provided at one longitudinal end of said bowl, said base plate having an internal side and an external side, an outlet opening provided in said base plate for discharge of one of said substances. A slide valve body is adapted for covering an adjustable part of the outlet opening to delimit an effective area of the outlet opening.

A cartridge (1) for accommodating blood bags (35) to be inserted into a centrifuge is used for the separation of blood components. Said cartridge (1) is provided with a partition wall (3) which separates a blood bag section (5) positioned radially inside from a product section (7) positioned radially outside, wherein a fixture (29) for a filter (31) is provided in the product section (7), a product transport path (36) which leads from the blood bag section (5) via the fixture (29) for the filter (31) to the product section (7). The product transport path (36) coming from the blood bag section (5) leads into the fixture (29) for the filter (31) radially from the outside and from below.

Provided are an electrophotographic photosensitive member in which leakage doesn't easily occur, a process cartridge and an electrophotographic apparatus each including the electrophotographic photosensitive member, and a method of manufacturing the electrophotographic photosensitive member. The electrophotographic photosensitive member includes a conductive layer including titanium oxide particle coated with tin oxide doped with a hetero element. When an absolute value of a maximum current amount flowing through the conductive layer in a case of performing a test of applying −1.0 kV including DC voltage to the conductive layer is defined as Ia, and an absolute value of a current amount flowing through the conductive layer in a case where a decrease ratio of a current amount per minute reaches 1% or less for the first time is defined as Ib, the relations of Ia≦6000 and 10≦Ib are satisfied. A volume resistivity of the conductive layer before the test is 1.0×108 Ω·cm to 5.0×1012 Ω·cm.

To provide an amine compound, represented by General Formula (I) below: [In General Formula (I), R1 and R2 represent a substituted or unsubstituted alkyl group, a substituted or unsubstituted aralkyl group, or a substituted or unsubstituted aromatic hydrocarbon group, which may be identical or different; m and n are an integer of 1 or 0; Ar1 represents a substituted or unsubstituted aromatic hydrocarbon group; Ar2 and Ar3 represent a substituted or unsubstituted alkyl group, a substituted or unsubstituted aralkyl group, or a substituted or unsubstituted aromatic hydrocarbon group; and Ar1 and Ar2 or Ar2 and Ar3 may bind to each other to form a substituted or unsubstituted heterocyclic group including a nitrogen atom.]