941 resultados para Algorithms, Properties, the KCube Graphs
Resumo:
Objectives and Methods: Contact angle, as a representative measure of surface wettability, is often employed to interpret contact lens surface properties. The literature is often contradictory and can lead to confusion. This literature review is part of a series regarding the analysis of hydrogel contact lenses using contact angle techniques. Here we present an overview of contact angle terminology, methodology, and analysis. Having discussed this background material, subsequent parts of the series will discuss the analysis of contact lens contact angles and evaluate differences in published laboratory results. Results: The concepts of contact angle, wettability and wetting are presented as an introduction. Contact angle hysteresis is outlined and highlights the advantages in using dynamic analytical techniques over static methods. The surface free energy of a material illustrates how contact angle analysis is capable of providing supplementary surface characterization. Although single values are able to distinguish individual material differences, surface free energy and dynamic methods provide an improved understanding of material behavior. The frequently used sessile drop, captive bubble, and Wilhelmy plate techniques are discussed. Their use as both dynamic and static methods, along with the advantages and disadvantages of each technique, is explained. Conclusions: No single contact angle technique fully characterizes the wettability of a material surface, and the application of complimenting methods allows increased characterization. At present, there is not an ISO standard method designed for soft materials. It is important that each contact angle technique has a standard protocol, as small protocol differences between laboratories often contribute to a variety of published data that are not easily comparable. © 2013 Contact Lens Association of Ophthalmologists.
Resumo:
Since the initial launch of silicone hydrogel lenses, there has been a considerable broadening in the range of available commercial material properties. The very mobile silicon–oxygen bonds convey distinctive surface and mechanical properties on silicone hydrogels, in which advantages of enhanced oxygen permeability, reduced protein deposition, and modest frictional interaction are balanced by increased lipid and elastic response. There are now some 15 silicone hydrogel material variants available to practitioners; arguably, the changes that have taken place have been strongly influenced by feedback based on clinical experience. Water content is one of the most influential properties, and the decade has seen a progressive rise from lotrafilcon-A (24%) to efrofilcon-A (74%). Moduli have decreased over the same period from 1.4 to 0.3 MPa, but not solely as a result of changes in water content. Surface properties do not correlate directly with water content, and ingenious approaches have been used to achieve desirable improvements (e.g., greater lubricity and lower contact angle hysteresis). This is demonstrated by comparing the hysteresis value of the earliest (lotrafilcon-A, >40°) and most recent (delefilcon-A, <10°) coated silicone hydrogels. Although wettability is important, it is not of itself a good predictor of ocular response because this involves a much wider range of physicochemical and biochemical factors. The interference of the lens with ocular dynamics is complex leading separately to tissue–material interactions involving anterior and posterior lens surfaces. The biochemical consequences of these interactions may hold the key to a greater understanding of ocular incompatibility and end of day discomfort.
Resumo:
Networking encompasses a variety of tasks related to the communication of information on networks; it has a substantial economic and societal impact on a broad range of areas including transportation systems, wired and wireless communications and a range of Internet applications. As transportation and communication networks become increasingly more complex, the ever increasing demand for congestion control, higher traffic capacity, quality of service, robustness and reduced energy consumption requires new tools and methods to meet these conflicting requirements. The new methodology should serve for gaining better understanding of the properties of networking systems at the macroscopic level, as well as for the development of new principled optimization and management algorithms at the microscopic level. Methods of statistical physics seem best placed to provide new approaches as they have been developed specifically to deal with nonlinear large-scale systems. This review aims at presenting an overview of tools and methods that have been developed within the statistical physics community and that can be readily applied to address the emerging problems in networking. These include diffusion processes, methods from disordered systems and polymer physics, probabilistic inference, which have direct relevance to network routing, file and frequency distribution, the exploration of network structures and vulnerability, and various other practical networking applications. © 2013 IOP Publishing Ltd.
Resumo:
We propose two algorithms involving the relaxation of either the given Dirichlet data (boundary displacements) or the prescribed Neumann data (boundary tractions) on the over-specified boundary in the case of the alternating iterative algorithm of Kozlov et al. [16] applied to Cauchy problems in linear elasticity. A convergence proof of these relaxation methods is given, along with a stopping criterion. The numerical results obtained using these procedures, in conjunction with the boundary element method (BEM), show the numerical stability, convergence, consistency and computational efficiency of the proposed method.
Resumo:
We introduce a flexible visual data mining framework which combines advanced projection algorithms from the machine learning domain and visual techniques developed in the information visualization domain. The advantage of such an interface is that the user is directly involved in the data mining process. We integrate principled projection algorithms, such as generative topographic mapping (GTM) and hierarchical GTM (HGTM), with powerful visual techniques, such as magnification factors, directional curvatures, parallel coordinates and billboarding, to provide a visual data mining framework. Results on a real-life chemoinformatics dataset using GTM are promising and have been analytically compared with the results from the traditional projection methods. It is also shown that the HGTM algorithm provides additional value for large datasets. The computational complexity of these algorithms is discussed to demonstrate their suitability for the visual data mining framework. Copyright 2006 ACM.
Resumo:
Heme oxygenase (Hmox) is an endogenous system that offers protection against placental cytotoxic damage associated with preeclampsia. The Hmox1/carbon monoxide (CO) pathway inhibits soluble Flt-1 (sFlt-1) and soluble Endoglin (sEng). More importantly, statins induce Hmox1 and suppress the release of sFlt-1 and sEng; thus, statins and Hmox1 activators are potential novel therapeutic agents for treating preeclampsia. The contribution of the Hmox system to the pathogenesis of preeclampsia has been further indicated by the incidence of preeclampsia being reduced by a third in smokers, who had reduced levels of circulating sFlt-1. Interestingly, preeclamptic women exhale less CO compared with women with healthy pregnancies. Hmox1 is reduced prior to the increase in sFlt-1 as Hmox1 mRNA expression in the trophoblast is decreased in the first trimester in women who go on to develop preeclampsia. Induction of Hmox1 or exposure to CO or bilirubin has been shown to inhibit the release of sFlt-1 and sEng in animal models of preeclampsia. The functional benefit of statins and Hmox1 induction in women with preeclampsia is valid not only because they inhibit sFlt-1 release, but also because statins and Hmox1 are associated with anti-apoptotic, anti-inflammatory, and anti-oxidant properties. The StAmP trial is the first randomized control trial (RCT) evaluating the use of pravastatin to ameliorate severe preeclampsia. This proof-of-concept study will pave the way for future global RCT, the success of which will greatly contribute to achieving the United Nations Millennium Development Goals (MDG4 and MDG5) and offering an affordable and easily accessible therapy for preeclampsia. © 2014 The Authors.
Resumo:
This paper identifies gaps in standardization of agri-food logistics. Out of the European FP7 SmartAgriFood project a framework for classifying existing standards within the agri-food supply chain is introduced. Furthermore the characteristics to which a semantic standard should adhere are investigated. The standards classified as semantic out of the framework are assessed along these properties. The resulting conclusion is that the standards that are already present in the chain are more focused on syntax and lack semantic properties.
Resumo:
The aging responses of 2124 Al-SiC p metal matrix composite (MMC) and unreinforced matrix alloy are studied and related to variations in tensile properties. The MMC is aged from Wo starting conditions: (i) stretched and naturally aged and (ii) re-solution treated. Accelerated aging occurs in both MMC conditions compared with unreinforced alloy. Tensile strengths and elastic moduli are improved in the MMC compared with the alloy, but ductility is reduced. Stretched MMC exhibits higher strength but lower ductility and modulus than re-solutioned MMC. The re-solutioned MMC fails by microvoid coalescence in low aging conditions, and by void nucleation and shear in high aging conditions. Failure of the stretched MMC initiates at the surface at specimen shoulders, illustrating the increased notch sensitivity of this condition, and propagates via a zigzag shear fracture mode. Zigzag facet size increases on gross aging. Particle fracture occurs during tensile failure, but also before testing as a result of the manufacturing process. © 1995 The Institute of Materials.
Resumo:
Ant Colony Optimisation algorithms mimic the way ants use pheromones for marking paths to important locations. Pheromone traces are followed and reinforced by other ants, but also evaporate over time. As a consequence, optimal paths attract more pheromone, whilst the less useful paths fade away. In the Multiple Pheromone Ant Clustering Algorithm (MPACA), ants detect features of objects represented as nodes within graph space. Each node has one or more ants assigned to each feature. Ants attempt to locate nodes with matching feature values, depositing pheromone traces on the way. This use of multiple pheromone values is a key innovation. Ants record other ant encounters, keeping a record of the features and colony membership of ants. The recorded values determine when ants should combine their features to look for conjunctions and whether they should merge into colonies. This ability to detect and deposit pheromone representative of feature combinations, and the resulting colony formation, renders the algorithm a powerful clustering tool. The MPACA operates as follows: (i) initially each node has ants assigned to each feature; (ii) ants roam the graph space searching for nodes with matching features; (iii) when departing matching nodes, ants deposit pheromones to inform other ants that the path goes to a node with the associated feature values; (iv) ant feature encounters are counted each time an ant arrives at a node; (v) if the feature encounters exceed a threshold value, feature combination occurs; (vi) a similar mechanism is used for colony merging. The model varies from traditional ACO in that: (i) a modified pheromone-driven movement mechanism is used; (ii) ants learn feature combinations and deposit multiple pheromone scents accordingly; (iii) ants merge into colonies, the basis of cluster formation. The MPACA is evaluated over synthetic and real-world datasets and its performance compares favourably with alternative approaches.
Resumo:
The structures of linear chain Fe(II) spin-crossover compounds of α,β- and α,ω-bis (tetrazol-1-yl)alkane type ligands are described in relation to their magnetic properties. The first threefold interlocked 3-D catenane Fe(II) spin-transition system, [μ-tris(1,4-bis(tetrazol-1-yl)butane-N1,N1′) iron(II)] bis(perchlorate), will be discussed. An analysis is made among the structures and the cooperativity of the spin-crossover behaviour of polynuclear Fe(II) spin-transition materials.
Resumo:
The paper has been presented at the 12th International Conference on Applications of Computer Algebra, Varna, Bulgaria, June, 2006
Resumo:
We describe several algorithms for the generation of integer Heronian triangles with diameter at most n. Two of them have running time O(n^(2+ε)). We enumerate all integer Heronian triangles for n ≤ 600000 and apply the complete list on some related problems.
Resumo:
GraphChi is the first reported disk-based graph engine that can handle billion-scale graphs on a single PC efficiently. GraphChi is able to execute several advanced data mining, graph mining and machine learning algorithms on very large graphs. With the novel technique of parallel sliding windows (PSW) to load subgraph from disk to memory for vertices and edges updating, it can achieve data processing performance close to and even better than those of mainstream distributed graph engines. GraphChi mentioned that its memory is not effectively utilized with large dataset, which leads to suboptimal computation performances. In this paper we are motivated by the concepts of 'pin ' from TurboGraph and 'ghost' from GraphLab to propose a new memory utilization mode for GraphChi, which is called Part-in-memory mode, to improve the GraphChi algorithm performance. The main idea is to pin a fixed part of data inside the memory during the whole computing process. Part-in-memory mode is successfully implemented with only about 40 additional lines of code to the original GraphChi engine. Extensive experiments are performed with large real datasets (including Twitter graph with 1.4 billion edges). The preliminary results show that Part-in-memory mode memory management approach effectively reduces the GraphChi running time by up to 60% in PageRank algorithm. Interestingly it is found that a larger portion of data pinned in memory does not always lead to better performance in the case that the whole dataset cannot be fitted in memory. There exists an optimal portion of data which should be kept in the memory to achieve the best computational performance.
Resumo:
* This work has been partially supported by Spanish Project TIC2003-9319-c03-03 “Neural Networks and Networks of Evolutionary Processors”.
Resumo:
* The research is supported partly by INTAS: 04-77-7173 project, http://www.intas.be