Planar subgraphs without low-degree nodes

We study the following problem: given a geometric graph G and an integer k, determine if G has a planar spanning subgraph (with the original embedding and straight-line edges) such that all nodes have degree at least k. If G is a unit disk graph, the problem is trivial to solve for k = 1. We show that even the slightest deviation from the trivial case (e.g., quasi unit disk graphs or k = 1) leads to NP-hard problems.

Ultimate Strength of RC Wall Panels with Openings

Test results of 12 reinforced concrete (RC) wall panels with openings are presented. The panels have been subjected to in-plane vertical loads applied at an eccentricity to represent possible accidental eccentricity that occurs in practice due to constructional imperfections. The 12 specimens consist of two identical groups of six panels each. One group of panels is tested in one-way in-plane action (i.e., supported at top and bottom edges against lateral displacement). The second group of panels is tested in two-way in-plane action (i.e., supported on all the four edges against lateral displacement). Openings in the panels represent typical door and window openings. Cracking loads, ultimate loads, crack patterns, and lateral deflections of the panels are studied. Empirical methods have been developed for the prediction of ultimate load. Also, lateral deflections, cracking loads, and ultimate loads of identical loads tested under one-way and two-way action are compared.

Compression of Weighted Graphs

We propose to compress weighted graphs (networks), motivated by the observation that large networks of social, biological, or other relations can be complex to handle and visualize. In the process also known as graph simplication, nodes and (unweighted) edges are grouped to supernodes and superedges, respectively, to obtain a smaller graph. We propose models and algorithms for weighted graphs. The interpretation (i.e. decompression) of a compressed, weighted graph is that a pair of original nodes is connected by an edge if their supernodes are connected by one, and that the weight of an edge is approximated to be the weight of the superedge. The compression problem now consists of choosing supernodes, superedges, and superedge weights so that the approximation error is minimized while the amount of compression is maximized. In this paper, we formulate this task as the 'simple weighted graph compression problem'. We then propose a much wider class of tasks under the name of 'generalized weighted graph compression problem'. The generalized task extends the optimization to preserve longer-range connectivities between nodes, not just individual edge weights. We study the properties of these problems and propose a range of algorithms to solve them, with dierent balances between complexity and quality of the result. We evaluate the problems and algorithms experimentally on real networks. The results indicate that weighted graphs can be compressed efficiently with relatively little compression error.

Dislocation characterization in crystals of potash alum grown by seeded solution growth under conditions of low supersaturation

An analysis has been carried out of the genesis and character of growth dislocations present in all growth sectors of single crystals of potash alum. The crystals, grown from seeded solutions by the temperature lowering method under conditions of low supersaturation, presented the well-developed forms: {111} dominant, {100} and {110}. Growth dislocations formed predominately during refacetting of the edges and corners of the seed, rounded during preparation and insertion into the supersaturated solution. From here they become refracted into the {111} sectors which proved to be the most defective. Smaller numbers of dislocations form at the {111}, {100} and {110} seed interfaces and propagate in these sectors. In crystals of inferior quality, a number of inclusions were found predominantly in the fast growing {100} sectors which become the source of additional dislocations. Dislocations present in the original seed did not propagate across the interface into the developing crystal. Dislocations of all characters were observed. The principal Burgers vectors were found to be left angle bracket100right-pointing angle bracket, left angle bracket110right-pointing angle bracket and left angle bracket111right-pointing angle bracket.

Sequence Independent Recombination Triple Helices: A Molecular Dynamics Study

Recent experimental studies have shown that the Rec-A mediated homologous recombination reaction involves a triple helical intermediate, in which the third strand base forms hydrogen bonds with both the bases in the major groove of the Watson-Crick duplex. Such 'mixed' hydrogen bonds allow formation of sequence independent triplexes. DNA triple helices involving 'mixed' hydrogen bonds have been studied, using model building, molecular mechanics (MM) and molecular dynamics (MD). Models were built for a tripler comprising all four possible triplets viz., G.C*C, C.G*G, A.T*T and T.A*A. To check the stability of all the 'mixed' hydrogen bonds in such triplexes and the conformational preferences of such tripler structures, MD studies were carried out starting from two structures with 30 degrees and 36 degrees twist between the basepairs. It was observed that though the two triplexes converged towards a similar structure, the various hydrogen bonds between the WC duplex and the third strand showed differential stabilities. An MD simulation with restrained hydrogen bonds showed that the resulting structure was stable and remained close to the starting structure. These studies help us in defining stable hydrogen bond geometries involving the third strand and the WC duplex. It was observed that in the C.G*G triplets the N7 atom of the second strand is always involved in hydrogen bonding. In the G.C*C triplets, either N3 or O2 in the third strand cytosine can interchangeably act as a hydrogen bond acceptor.

Accessibility as a determinant of opportunities : A case study from Peruvian Amazonia

Accessibility is a crucial factor for interaction between areas in economic, cultural, political and environmental terms. Therefore, information concerning accessibility is relevant for informed decision making, planning and research. The Loreto region in the Peruvian Amazonia provides an interesting scene for an accessibility study. Loreto is sparsely populated and because there are few roads in the region, in practice all movement and transportation happens along the river network. Due to the proximity of the Andes, river dynamics are strong and annual changes in water level combined with these dynamic processes constantly reshape accessibility patterns of the region. Selling non-timber forest products (NTFP) and agricultural products (AP) in regional centres is an important income source for local rain forest dwellers. Thus, accessibility to the centres is crucial for the livelihood of local population. -- In this thesis I studied how accessible the regional centre Iquitos is from other parts of Loreto. In addition, I studied the regional NTFP/AP trade patterns and compared them with patterns of accessibility. Based on GPS-measurements, using GIS, I created a time-distance surface covering Loreto. This surface describes the time-distance to Iquitos, along the river network. Based on interview material, I assessed annual changes to accessibility patterns in the region. The most common regional NTFP/AP were classified according to the amount of time they can be preserved, and based on the accessibility surface, I modelled a catchment area for each of these product classes. -- According to my results, navigation speeds vary considerably in different parts of the river network, depending on river types, vessels, flow direction and season. Navigating downstream is, generally, faster than upstream navigation. Thus, Iquitos is better accessible from areas situated south and south west of the city, like along the rivers Ucayali and Marañon. Differences in accessibility between different seasons are also substantial: during the dry season navigation is slower due to lower water levels and emerging sand bars. Regularly operating boats follow routes only along certain rivers and close to Iquitos transport facilities are more abundant than in more distant areas. Most of the products present in Iquitos market places are agricultural products, and the share of NTFP is significantly smaller. Most of the products were classified in product class 2, and the catchment area for these products is rather small. Many products also belonged to class 5, and the catchment area for these products reaches up to the edges of my study area, following the patterns of the river network. -- The accessibility model created in this study predicts travel times relatively well, although in some cases the modelled time-distances are substantially shorter than observed time-distances. This is partly caused by the fact that real-life navigation routes are more complicated than the modelled routes. Rain forest dwellers having easier access to Iquitos have more opportunities in terms of the products they decide to market. Thus, they can better take advantage of other factors affecting the market potential of different products. -- In all, understanding spatial variation in accessibility is important. In the Amazonian context it is difficult to combine the accessibility-related needs of the local dwellers with conservation purposes and the future challenge lies in finding solution that satisfy both of these needs.

Dietary habits and obesity: the role of emotional and cognitive factors

In post-industrialised societies, food is more plentiful, accessible and palatable than ever before and technological development has reduced the need for physical activity. Consequently, the prevalence of obesity is increasing, which is problematic as obesity is related to a number of diseases. Various psychological and social factors have an important influence on dietary habits and the development of obesity in the current food-rich and sedentary environments. The present study concentrates on the associations of emotional and cognitive factors with dietary intake and obesity as well as on the role these factors play in socioeconomic disparities in diet. Many people cognitively restrict their food intake to prevent weight gain or to lose weight, but research on whether restrained eating is a useful weight control strategy has produced conflicting findings. With respect to emotional factors, the evidence is accumulating that depressive symptoms are related to less healthy dietary intake and obesity, but the mechanisms explaining these associations remain unclear. Furthermore, it is not fully understood why socioeconomically disadvantaged individuals tend to have unhealthier dietary habits and the motives underlying food choices (e.g., price and health) could be relevant in this respect. The specific aims of the study were to examine 1) whether obesity status and dieting history moderate the associations of restrained eating with overeating tendencies, self-control and obesity indicators; 2) whether the associations of depressive symptoms with unhealthier dietary intake and obesity are attributable to a tendency for emotional eating and a low level of physical activity self-efficacy; and 3) whether the absolute or relative importance of food choice motives (health, pleasure, convenience, price, familiarity and ethicality) contribute to the socioeconomic disparities in dietary habits. The study was based on a large population-based sample of Finnish adults: the participants were men (N=2325) and women (N=2699) aged 25-74 who took part in the DILGOM (Dietary, Lifestyle and Genetic Determinants of Obesity and Metabolic Syndrome) sub-study of the National FINRISK Study 2007. The participants weight, height, waist circumference and body fat percentage were measured in a health examination. Psychological eating styles (the Three-Factor Eating Questionnaire-R18), food choice motives (a shortened version of the Food Choice Questionnaire), depressive symptoms (the Center for Epidemiological Studies Depression Scale) and self-control (the Brief Self-Control Scale) were measured with pre-existing questionnaires. A validated food frequency questionnaire was used to assess the average consumption of sweet and non-sweet energy-dense foods and vegetables/fruit. Self-reported total years of education and gross household income were used as indicators of socioeconomic position. The results indicated that 1) restrained eating was related to a lower body mass index, waist circumference, emotional eating and uncontrolled eating, and to a higher self-control in obese participants and current/past dieters. In contrast, the associations were the opposite in normal weight individuals and those who had never dieted. Thus, restrained eating may be related to better weight control among obese individuals and those with dieting experiences, while among others it may function as an indicator of problems with eating and an attempt to solve them. 2) Emotional eating and depressive symptoms were both related to less healthy dietary intake, and the greater consumption of energy-dense sweet foods among participants with elevated depressive symptoms was attributable to the susceptibility for emotional eating. In addition, emotional eating and physical activity self-efficacy were both important in explaining the positive association between depressive symptoms and obesity. 3) The lower vegetable/fruit intake and higher energy-dense food intake among individuals with a low socioeconomic position were partly explained by the higher priority they placed on price and familiarity and the lower priority they gave to health motives in their daily food choices. In conclusion, although policy interventions to change the obesogenic nature of the current environment are definitely needed, knowledge of the factors that hinder or facilitate people s ability to cope with the food-rich environment is also necessary. This study implies that more emphasis should be placed on various psychological and social factors in weight control programmes and interventions.

Armchair or Zigzag? A tool for characterizing graphene edge

Electronic, magnetic, and structural properties of graphene flakes depend sensitively upon the type of edge atoms. We present a simple software tool for determining the type of edge atoms in a honeycomb lattice. The algorithm is based on nearest neighbor counting. Whether an edge atom is of armchair or zigzag type is decided by the unique pattern of its nearest neighbors. Particular attention is paid to the practical aspects of using the tool, as additional features such as extracting out the edges from the lattice could help in analyzing images from transmission microscopy or other experimental probes. Ultimately, the tool in combination with density-functional theory or tight-binding method can also be helpful in correlating the properties of graphene flakes with the different armchair-to-zigzag ratios. Program summary Program title: edgecount Catalogue identifier: AEIA_v1_0 Program summary URL: http://cpc.cs.qub.ac.uk/summaries/AEIA_v1_0.html Program obtainable from: CPC Program Library, Queen's University, Belfast, N. Ireland Licensing provisions: Standard CPC licence, http://cpc.cs.qub.ac.uk/licence/licence.html No. of lines in distributed program, including test data, etc.: 66685 No. of bytes in distributed program, including test data, etc.: 485 381 Distribution format: tar.gz Programming language: FORTRAN 90/95 Computer: Most UNIX-based platforms Operating system: Linux, Mac OS Classification: 16.1, 7.8 Nature of problem: Detection and classification of edge atoms in a finite patch of honeycomb lattice. Solution method: Build nearest neighbor (NN) list; assign types to edge atoms on the basis of their NN pattern. Running time: Typically similar to second(s) for all examples. (C) 2010 Elsevier B.V. All rights reserved.

Paleoseismological evidence of surface faulting along the northeastern Himalayan front, India: Timing, size, and spatial extent of great earthquakes

The similar to 2500 km long Himalayan arc has experienced three large to great earthquakes of M-w 7.8 to 8.4 during the past century, but none produced surface rupture. Paleoseismic studies have been conducted during the last decade to begin understanding the timing, size, rupture extent, return period, and mechanics of the faulting associated with the occurrence of large surface rupturing earthquakes along the similar to 2500 km long Himalayan Frontal Thrust (HFT) system of India and Nepal. The previous studies have been limited to about nine sites along the western two-thirds of the HFT extending through northwest India and along the southern border of Nepal. We present here the results of paleoseismic investigations at three additional sites further to the northeast along the HFT within the Indian states of West Bengal and Assam. The three sites reside between the meizoseismal areas of the 1934 Bihar-Nepal and 1950 Assam earthquakes. The two westernmost of the sites, near the village of Chalsa and near the Nameri Tiger Preserve, show that offsets during the last surface rupture event were at minimum of about 14 m and 12 m, respectively. Limits on the ages of surface rupture at Chalsa (site A) and Nameri (site B), though broad, allow the possibility that the two sites record the same great historical rupture reported in Nepal around A.D. 1100. The correlation between the two sites is supported by the observation that the large displacements as recorded at Chalsa and Nameri would most likely be associated with rupture lengths of hundreds of kilometers or more and are on the same order as reported for a surface rupture earthquake reported in Nepal around A.D. 1100. Assuming the offsets observed at Chalsa and Nameri occurred synchronously with reported offsets in Nepal, the rupture length of the event would approach 700 to 800 km. The easternmost site is located within Harmutty Tea Estate (site C) at the edges of the 1950 Assam earthquake meizoseismal area. Here the most recent event offset is relatively much smaller (<2.5 m), and radiocarbon dating shows it to have occurred after A.D. 1100 (after about A.D. 1270). The location of the site near the edge of the meizoseismal region of the 1950 Assam earthquake and the relatively lesser offset allows speculation that the displacement records the 1950 M-w 8.4 Assam earthquake. Scatter in radiocarbon ages on detrital charcoal has not resulted in a firm bracket on the timing of events observed in the trenches. Nonetheless, the observations collected here, when taken together, suggest that the largest of thrust earthquakes along the Himalayan arc have rupture lengths and displacements of similar scale to the largest that have occurred historically along the world's subduction zones.

New Approximation Algorithms for Minimum Cycle Bases of Graphs

We consider the problem of computing an approximate minimum cycle basis of an undirected non-negative edge-weighted graph G with m edges and n vertices; the extension to directed graphs is also discussed. In this problem, a {0,1} incidence vector is associated with each cycle and the vector space over F-2 generated by these vectors is the cycle space of G. A set of cycles is called a cycle basis of G if it forms a basis for its cycle space. A cycle basis where the sum of the weights of the cycles is minimum is called a minimum cycle basis of G. Cycle bases of low weight are useful in a number of contexts, e.g. the analysis of electrical networks, structural engineering, chemistry, and surface reconstruction. Although in most such applications any cycle basis can be used, a low weight cycle basis often translates to better performance and/or numerical stability. Despite the fact that the problem can be solved exactly in polynomial time, we design approximation algorithms since the performance of the exact algorithms may be too expensive for some practical applications. We present two new algorithms to compute an approximate minimum cycle basis. For any integer k >= 1, we give (2k - 1)-approximation algorithms with expected running time O(kmn(1+2/k) + mn((1+1/k)(omega-1))) and deterministic running time O(n(3+2/k) ), respectively. Here omega is the best exponent of matrix multiplication. It is presently known that omega < 2.376. Both algorithms are o(m(omega)) for dense graphs. This is the first time that any algorithm which computes sparse cycle bases with a guarantee drops below the Theta(m(omega) ) bound. We also present a 2-approximation algorithm with expected running time O(M-omega root n log n), a linear time 2-approximation algorithm for planar graphs and an O(n(3)) time 2.42-approximation algorithm for the complete Euclidean graph in the plane.

Edge Stabilities of Hexagonal Boron Nitride Nanoribbons: A First-Principles Study

We investigate the comparative stability of sp(2) bonded planar hexagonal boron nitride (h-BN) nanoribbon (BNNR) edges, using first principles calculations. We find that the pristine armchair edges have the highest degree of stability. Pristine zigzag edges are metastable, favoring planar reconstructions in the form of 5-7 rings] that minimizes the energy. Our investigation further reveals that the pristine zigzag edges can be stabilized against 5-7 reconstructions by passivating the dangling bonds at the edges by other elements, such as hydrogen (H) atoms. Electronic and magnetic properties of nanoribbons depend on the edge shapes and are strongly affected by edge reconstructions.

On Network-Error Correcting Convolutional Codes under the BSC Edge Error Model

Convolutional network-error correcting codes (CNECCs) are known to provide error correcting capability in acyclic instantaneous networks within the network coding paradigm under small field size conditions. In this work, we investigate the performance of CNECCs under the error model of the network where the edges are assumed to be statistically independent binary symmetric channels, each with the same probability of error pe(0 <= p(e) < 0.5). We obtain bounds on the performance of such CNECCs based on a modified generating function (the transfer function) of the CNECCs. For a given network, we derive a mathematical condition on how small p(e) should be so that only single edge network-errors need to be accounted for, thus reducing the complexity of evaluating the probability of error of any CNECC. Simulations indicate that convolutional codes are required to possess different properties to achieve good performance in low p(e) and high p(e) regimes. For the low p(e) regime, convolutional codes with good distance properties show good performance. For the high p(e) regime, convolutional codes that have a good slope ( the minimum normalized cycle weight) are seen to be good. We derive a lower bound on the slope of any rate b/c convolutional code with a certain degree.

Non-uniform slot injection (suction) or wall enthalpy into a steady nonsimilar compressible laminar boundary layer

Steady two-dimensional and axisymmetric compressible nonsimilar laminar boundary-layer flows with non-uniform slot injection (or suction) and non-uniform wall enthalpy have been studied from the starting point of the streamwise co-ordinate to the exact point of separation. The effect of different free stream Mach number has also been considered. The finite discontinuities arising at the leading and trailing edges of the slot for the uniform slot injection (suction) or wall enthalpy are removed by choosing appropriate non-uniform slot injection (suction) or wall enthalpy. The difficulties arising at the starting point of the streamwise co-ordinate, at the edges of the slot and at the point of separation are overcome by applying the method of quasilinear implicit finite difference scheme with an appropriate selection of finer step size along the streamwise direction. It is observed that the non-uniform slot injection moves the point of separation downstream but the non-uniform slot suction has the reverse effect. The increase of Mach number shifts the point of separation upstream due to the adverse pressure gradient. The increase of total enthalpy at the wall causes the separation to occur earlier while cooling delays it. The non-uniform total enthalpy at the wall (i.e., the cooling or heating of the wall in a slot) along the streamwise co-ordinate has very little effect on the skin friction and thus on the point of separation.

The structure of amorphous platinum disulfide as studied by anomalous x-ray-scattering

Anomalous X-ray scattering (AXS) has been applied to study the structure of amorphous platinum disulfide, Pt1-xS2, prepared by the precipitation process. The local atomic arrangement in amorphous Pt1-xS2 was determined by the least-squares variational method so as to reproduce the experimental differential interference function at the Pt L(III) absorption edge by the AXS method as well as the ordinary interference function by MoK alpha. The structural unit in amorphous Pt1-xS2 is found to be a PtS6 octahedron, similar to that in crystalline PtS2. These octahedra share both their corners and edges, while only edge-sharing linkages occur in crystalline PtS2.

Anomalous X-ray scattering study of local structures in the superionic conducting class (CuI)(0.3)(Cu2O)(0.35)(MoO3)(0.35)

The anomalous X-ray scattering (AXS) method using Cu and Mo K absorption edges has been employed for obtaining the local structural information of superionic conducting glass having the composition (CuI)(0.3)(Cu2O)(0.35)(MoO3)(0.35). The possible atomic arrangements in near-neighbor region of this glass were estimated by coupling the results with the least-squares analysis so as to reproduce two differential intensity profiles for Cu and Mo as well as the ordinary scattering profile. The coordination number of oxygen around Mo is found to be 6.1 at the distance of 0.187 nm. This implies that the MoO6 octahedral unit is a more probable structural entity in the glass rather than MoO4 tetrahedra which has been proposed based on infrared spectroscopy. The pre-peak shoulder observed at about 10 nm(-1) may be attributed to density fluctuation originating from the MoO6 octahedral units connected with the corner sharing linkage, in which the correlation length is about 0.8 nm. The value of the coordination number of I- around Cu+ is estimated as 4.3 at 0.261 nm, suggesting an arrangement similar to that in molten CuI.