969 resultados para Synaptonemal complex failure
Resumo:
Superplastic materials exhibit very large elongations to failure,typically >500%, and this enables commercial forming of complex shaped components at slow strain rates of similar to 10(-4) s(-1). We report extraordinary record superplastic elongations to failure of up to 5300% at both high strain rates and low temperature in electrodeposited nanocrystalline Ni and some Ni alloys. Superplasticity is not related to the presence of sulfur or a low melting phase at grain boundaries. (C) 2010 Acta Materialia Inc. Published by Elsevier Ltd. All rights reserved.
Resumo:
1. Anhydrous aluminium chloride reacts with phosphorus oxychloride to give a complex with a composition AlCl3.2 POCl3 which can be prepared in the form of a free flowing powder. 2. The phosphorus oxychloride-aluminium chloride complex in nitrobenzene dissociates into AlCl3.POCl3 and POCl3 as indicated by the cryoscopic measurements. 3. The solution of the complex in nitrobenzene has a higher specific conductivity than the corresponding electrical conductivities of individual components. Similar higher electrical conductance is observed when the two components are mixed in nitrobenzene in different proportions. 4.When a solution of anhydrous aluminium chloride in nitrobenzene is titrated conductometrically against a solution of phosphorus oxychloride in nitrobenzene, a limiting value in the conductivity is reached at point corresponding to the molecular composition, the components in the ratio of 1:2 AlCl3: POCl3 in solution. 5. The absorption maxima of the complex in nitrobenzene solution differ from the absorption maximum of the individual components.
Resumo:
The titled complex, obtained by co-crystallization (EtOH/25 degrees C),is apparently the only known complex of the free bases. Its crystal structure, as determined by X-ray diffraction at both 90 K and 313 K, showed that one A-T pair involves a Hoogsteen interaction, and the other a Watson-Crick interaction but only with respect to the adenine unit. The absence of a clear-cut Watson-Crick base pair raises intriguing questions about the basis of the DNA double helix. (C) 2010 Elsevier Ltd. All rights reserved.
Resumo:
The crystal structure of the complex La(NO3)3.4(CH3)2SO has been solved by the heavy-atom method. The complex crystallizes in the monoclinic space group C2/e with four formula units in a unit cell of dimensions a= 14.94, b= 11.04, c= 15.54 A and fl= 109 ° 10'. The parameters have been refined by threedimensional least-squares procedures with anisotropic thermal parameters for all atoms except hydrogen. The final R index for 1257 observed reflexions is 0.094. The La 3 + ion is coordinated by ten oxygen atoms with La-O distances varying from 2.47 to 2.71 A. The geometry of the coordination polyhedron is described.
Resumo:
As the virtual world grows more complex, finding a standard way for storing data becomes increasingly important. Ideally, each data item would be brought into the computer system only once. References for data items need to be cryptographically verifiable, so the data can maintain its identity while being passed around. This way there will be only one copy of the users family photo album, while the user can use multiple tools to show or manipulate the album. Copies of users data could be stored on some of his family members computer, some of his computers, but also at some online services which he uses. When all actors operate over one replicated copy of the data, the system automatically avoids a single point of failure. Thus the data will not disappear with one computer breaking, or one service provider going out of business. One shared copy also makes it possible to delete a piece of data from all systems at once, on users request. In our research we tried to find a model that would make data manageable to users, and make it possible to have the same data stored at various locations. We studied three systems, Persona, Freenet, and GNUnet, that suggest different models for protecting user data. The main application areas of the systems studied include securing online social networks, providing anonymous web, and preventing censorship in file-sharing. Each of the systems studied store user data on machines belonging to third parties. The systems differ in measures they take to protect their users from data loss, forged information, censorship, and being monitored. All of the systems use cryptography to secure names used for the content, and to protect the data from outsiders. Based on the gained knowledge, we built a prototype platform called Peerscape, which stores user data in a synchronized, protected database. Data items themselves are protected with cryptography against forgery, but not encrypted as the focus has been disseminating the data directly among family and friends instead of letting third parties store the information. We turned the synchronizing database into peer-to-peer web by revealing its contents through an integrated http server. The REST-like http API supports development of applications in javascript. To evaluate the platform’s suitability for application development we wrote some simple applications, including a public chat room, bittorrent site, and a flower growing game. During our early tests we came to the conclusion that using the platform for simple applications works well. As web standards develop further, writing applications for the platform should become easier. Any system this complex will have its problems, and we are not expecting our platform to replace the existing web, but are fairly impressed with the results and consider our work important from the perspective of managing user data.
Resumo:
As the virtual world grows more complex, finding a standard way for storing data becomes increasingly important. Ideally, each data item would be brought into the computer system only once. References for data items need to be cryptographically verifiable, so the data can maintain its identity while being passed around. This way there will be only one copy of the users family photo album, while the user can use multiple tools to show or manipulate the album. Copies of users data could be stored on some of his family members computer, some of his computers, but also at some online services which he uses. When all actors operate over one replicated copy of the data, the system automatically avoids a single point of failure. Thus the data will not disappear with one computer breaking, or one service provider going out of business. One shared copy also makes it possible to delete a piece of data from all systems at once, on users request. In our research we tried to find a model that would make data manageable to users, and make it possible to have the same data stored at various locations. We studied three systems, Persona, Freenet, and GNUnet, that suggest different models for protecting user data. The main application areas of the systems studied include securing online social networks, providing anonymous web, and preventing censorship in file-sharing. Each of the systems studied store user data on machines belonging to third parties. The systems differ in measures they take to protect their users from data loss, forged information, censorship, and being monitored. All of the systems use cryptography to secure names used for the content, and to protect the data from outsiders. Based on the gained knowledge, we built a prototype platform called Peerscape, which stores user data in a synchronized, protected database. Data items themselves are protected with cryptography against forgery, but not encrypted as the focus has been disseminating the data directly among family and friends instead of letting third parties store the information. We turned the synchronizing database into peer-to-peer web by revealing its contents through an integrated http server. The REST-like http API supports development of applications in javascript. To evaluate the platform s suitability for application development we wrote some simple applications, including a public chat room, bittorrent site, and a flower growing game. During our early tests we came to the conclusion that using the platform for simple applications works well. As web standards develop further, writing applications for the platform should become easier. Any system this complex will have its problems, and we are not expecting our platform to replace the existing web, but are fairly impressed with the results and consider our work important from the perspective of managing user data.
Resumo:
This article concentrates on the discursive constmction of success and failure in narratives of post-merger integration. Drawing on extensive interview material from eight Finnish-Swedish mergers and acquisitions, the empirical analysis leads to distinguishing four types of discourse — 'rationalistic', 'cultural', 'role-bound' and 'individualistic' — that narrators employ in recounting their experiences. In particular, the empirical material illustrates how the discursive frameworks enable specific (di.scursive) strategies and moves for (re)framing the success/failure, justification/legitimization of one's own actions, and (re)constniction of responsibility when dealing with socio-psychological pressures associated with success/failtire. The analysis also suggests that, as a result of making use of these discursive strategies and moves, success stories are likely to lead to overly optimistic or, in the case of failure stories, overly pessimistic views on the management's ability to control these change processes. Tliese findings imply that we should take the discursive elements that both constrain our descriptions and explanations seriously, and provide opportunities for more or less intentional (re)interpretations of postmerger integration or other organizational change processes.
Resumo:
Flaviviruses have been shown to induce cell surface expression of major histocompatibility complex class I (MHC-I) through the activation of NF-kappa B. Using IKK1(-/-), IKK2(-/-), NEMO-/-, and IKK1-/- IKK2-/- double mutant as well as p50(-/-) RelA(-/-) cRel(-/-) triple mutant mouse embryonic fibroblasts infected with Japanese encephalitis virus (JEV), we show that this flavivirus utilizes the canonical pathway to activate NF-kappa B in an IKK2- and NEMO-, but not IKK1-, dependent manner. NF-kappa B DNA binding activity induced upon virus infection was shown to be composed of RelA: p50 dimers in these fibroblasts. Type I interferon (IFN) production was significantly decreased but not completely abolished upon virus infection in cells defective in NF-kappa B activation. In contrast, induction of classical MHC-I (class 1a) genes and their cell surface expression remained unaffected in these NF-kappa B-defective cells. However, MHC-I induction was impaired in IFNAR(-/-) cells that lack the alpha/beta IFN receptor, indicating a dominant role of type I IFNs but not NF-kappa B for the induction of MHC-I molecules by Japanese encephalitis virus. Our further analysis revealed that the residual type I IFN signaling in NF-kappa B-deficient cells is sufficient to drive MHC-I gene expression upon virus infection in mouse embryonic fibroblasts. However, NF-kappa B could indirectly regulate MHC-I expression, since JEV-induced type I IFN expression was found to be critically dependent on it.
Resumo:
In Somalia the central government collapsed in 1991 and since then state failure became a widespread phenomenon and one of the greatest political and humanitarian problems facing the world in this century. Thus, the main objective of this research is to answer the following question: What went wrong? Most of the existing literature on the political economy of conflict starts from the assumption that state in Africa is predatory by nature. Unlike these studies, the present research, although it uses predation theory, starts from the social contract approach of state definition. Therefore, rather than contemplating actions and policies of the rulers alone, this approach allows us to deliberately bring the role of the society – as citizens – and other players into the analyses. In Chapter 1, after introducing the study, a simple principal-agent model will be developed to check the logical consistence of the argument and to make the identification of causal mechanism easier. I also identify three main actors in the process of state failure in Somalia: the Somali state, Somali society and the superpowers. In Chapter 2, so as to understand the incentives, preferences and constraints of each player in the state failure game, I in some depth analyse the evolution and structure of three central informal institutions: identity based patronage system of leadership, political tribalism, and the Cold War. These three institutions are considered as the rules of the game in the Somali state failure. Chapter 3 summarises the successive civilian governments’ achievements and failures (1960-69) concerning the main national goals, national unification and socio-economic development. Chapter 4 shows that the military regime, although it assumed power through extralegal means, served to some extent the developmental interest of the citizens in the first five years of its rule. Chapter 5 shows the process, and the factors involved, of the military regime’s self-transformation from being an agent for the developmental interests of the society to a predatory state that not only undermines the interests of the society but that also destroys the state itself. Chapter 6 addresses the process of disintegration of the post-colonial state of Somalia. The chapter shows how the regime’s merciless reactions to political ventures by power-seeking opposition leaders shattered the entire country and wrecked the state institutions. Chapter 7 concludes the study by summarising the main findings: due to the incentive structures generated by the informal institutions, the formal state institutions fell apart.
Resumo:
We prove that the group of continuous isometries for the Kobayashi or Caratheodory metrics of a strongly convex domain in C-n is compact unless the domain is biholomorphic to the ball. A key ingredient, proved using differential geometric ideas, is that a continuous isometry between a strongly convex domain and the ball has to be biholomorphic or anti-biholomorphic. Combining this with a metric version of Pinchuk's rescaling technique gives the main result.
Resumo:
Large quantities of single-crystalline ZnO nanorods and nanotubes have been prepared by the microwave, irradiation of a metalorganic complex of zinc, in the presence of a surfactant. The method is simple, fast, and inexpensive (as it uses a domestic microwave oven), and yields pure nanostructures of the hexagonal wurtzite phase of ZnO in min, and requires no conventional templating. The ZnO nanotubes formed have a hollow core with inner diameter varying from 140-160 nm and a wall of thickness, 40-50 nm. The length of nanorods and nanotubes varies in the narrow range of 500-600 nm. These nanostructures have been characterized by X-ray diffraction (XRD), scanning electron microscopy (SEM), transmission electron microscopy (TEM), and selected area electron diffraction (SAED). The ZnO nanorods and nanotubes are found by SAED to be single-crystalline. The growth process of ZnO nanorods and nanotubes has been investigated by varying the surfactant concentration and microwave irradiation time. Based on the various results obtained, a tentative and plausible mechanism for the formation of ZnO nanostructures is proposed.
Resumo:
For p x n complex orthogonal designs in k variables, where p is the number of channels uses and n is the number of transmit antennas, the maximal rate L of the design is asymptotically half as n increases. But, for such maximal rate codes, the decoding delay p increases exponentially. To control the delay, if we put the restriction that p = n, i.e., consider only the square designs, then, the rate decreases exponentially as n increases. This necessitates the study of the maximal rate of the designs with restrictions of the form p = n+1, p = n+2, p = n+3 etc. In this paper, we study the maximal rate of complex orthogonal designs with the restrictions p = n+1 and p = n+2. We derive upper and lower bounds for the maximal rate for p = n+1 and p = n+2. Also for the case of p = n+1, we show that if the orthogonal design admit only the variables, their negatives and multiples of these by root-1 and zeros as the entries of the matrix (other complex linear combinations are not allowed), then the maximal rate always equals the lower bound.