Maximum Number Of Nodes Research Articles

Efecto del momento de aplicación y de las cantidades de progesterona de mamíferos y ácido giberélico sobre el crecimiento de Zinnia elegans

The use of animal sex hormones in plants does not have a long history, but the presence of these hormones in plants has been proven. The aim of the research was to investigate the effects of gibberellic acid and progesterone on growth and development of Zinnia elegans flower in a factorial experiment based on a completely randomized design with three factors considering three replications. The first factor included application times (pre-sowing, four-leaf stage and two months after sowing), the second factor was progesterone rates (0, 5 and 10 mg·L-1) and three gibberellic acid rates (0, 100, and 200 mg·L-1). The measured traits were dry weight and fresh weight of aerial organ and root, number of nodes, number of flowers, number of buds, number of branches and leaves, the distance from the crown to the first leaf, the distance from the crown to the first branch, plant height, chlorophyll a, b and total chlorophyll and leaf area. Results showed that the highest fresh weight of aerial organ and root, maximum number of nodes, flower number, bud number, branch number, the highest plant height and the highest content of chlorophyll a occurred two months after planting. Overall, 10 mg·L-1 progesterone had the best effects on the traits. The maximum leaf area was obtained by applying 5 mg·L-1 two months after sowing.

On the Assessment of Systematic Risk in Networked Systems

In a networked system, the risk of security compromises depends not only on each node’s security but also on the topological structure formed by the connected individuals, businesses, and computer systems. Research in network security has been exploring this phenomenon for a long time, with a variety of modeling frameworks predicting how many nodes we should expect to lose, on average, for a given network topology, after certain types of incidents. Meanwhile, the pricing of insurance contracts for risks related to information technology (better known as cyber-insurance) requires determining additional information, for example, the maximum number of nodes we should expect to lose within a 99.5% confidence interval. Previous modeling research in network security has not addressed these types of questions, while research on cyber-insurance pricing for networked systems has not taken into account the network’s topology. Our goal is to bridge that gap, by providing a mathematical basis for the assessment of systematic risk in networked systems. We define a loss-number distribution to be a probability distribution on the total number of compromised nodes within a network following the occurrence of a given incident, and we provide a number of modeling results that aim to be useful for cyber-insurers in this context. We prove NP-hardness for the general case of computing the loss-number distribution for an arbitrary network topology but obtain simplified computable formulas for the special cases of star topologies, ER-random topologies, and uniform topologies. We also provide a simulation algorithm that approximates the loss-number distribution for an arbitrary network topology and that appears to converge efficiently for many common classes of topologies. Scale-free network topologies have a degree distribution that follows a power law and are commonly found in real-world networks. We provide an example of a scale-free network in which a cyber-insurance pricing mechanism that relies naively on incidence reporting data will fail to accurately predict the true risk level of the entire system. We offer an alternative mechanism that yields an accurate forecast by taking into account the network topology, thus highlighting the lack/importance of topological data in security incident reporting. Our results constitute important steps toward the understanding of systematic risk and help to contribute to the emergence of a viable cyber-insurance market.

On approximating maximum covering cycles in undirected graphs

We consider the problem to find a cycle in an undirected graph such that a maximum number of nodes is in the cycle or adjacent to a node in the cycle. The problem is known to be NP-hard and we strengthen this result by showing that there is no constant factor approximation algorithm unless $$P=NP$$ .

Minimum-latency data aggregation scheduling based on multi-path routing structures under physical interference model

Minimum-Latency Aggregation Scheduling is a significant problem in wireless sensor networks. The key challenge is to find an effective solution to aggregate data from all sensors to the sink with minimum aggregation latency. In this article, we propose a novel data aggregation scheduling algorithm under the physical interference model. First, the algorithm partitions the network into square cells according to the communication range of a sensor. Second, a node is selected randomly as the aggregated node to receive the data from the other nodes in the same cell. Finally, a data aggregation tree, which consists of multiple disjoint paths, is constructed to aggregate data from all aggregated nodes to the sink. We empirically proved that the delay of the aggregation schedule generated by our algorithm is ( K+1)2Δ− K−1+2λ time-slots at most, where K is a constant depending on the sensors transmitting power, the signal-to-interference-plus-noise-ratio threshold, and the path-loss exponent; [Formula: see text] represents the maximal number of nodes in a cell; and [Formula: see text] denotes the number of cells at a row/column in a square network area. Simulation results also show that our algorithm achieves lower average latency than the previous works.

Comparative transcriptome analysis of hypothalamus-regulated feed intake induced by exogenous visfatin in chicks

BackgroundThe intracerebroventricular injection of visfatin increases feed intake. However, little is known about the molecular mechanism in chicks. This study was conducted to assess the effect of visfatin on the feeding behavior of chicks and the associated molecular mechanism.ResultsIn response to the intraventricular injection of 40 ng and 400 ng visfatin, feed intake in chicks was significantly increased, and the concentrations of glucose, insulin, TG, HDL and LDL were significantly altered. Using RNA-seq, we identified DEGs in the chick hypothalamus at 60 min after injection with various doses of visfatin. In total, 325, 85 and 519 DEGs were identified in the treated chick hypothalamus in the LT vs C, HT vs C and LT vs HT comparisons, respectively. The changes in the expression profiles of DEGs, GO functional categories, KEGG pathways, and PPI networks by visfatin-mediated regulation of feed intake were analyzed. The DEGs were grouped into 8 clusters based on their expression patterns via K-mean clustering; there were 14 appetite-related DEGs enriched in the hormone activity GO term. The neuroactive ligand-receptor interaction pathway was the key pathway affected by visfatin. The PPI analysis of DEGs showed that POMC was a hub gene that interacted with the maximum number of nodes and ingestion-related pathways, including POMC, CRH, AgRP, NPY, TRH, VIP, NPYL, CGA and TSHB.ConclusionThese common DEGs were enriched in the hormone activity GO term and the neuroactive ligand-receptor interaction pathway. Therefore, visfatin causes hyperphagia via the POMC/CRH and NPY/AgRP signaling pathways. These results provide valuable information about the molecular mechanisms of the regulation of food intake by visfatin.

Packing $k$-Matchings and $k$-Critical Graphs

A (simple) $k$-matching in a graph is a subgraph all of whose nodes have degree at most $k$. The $k$-matching problem is to find a $k$-matching with a maximum number of edges. Well-known results for the classical $1$-matching problem, such as the Tutte--Berge min-max theorem and Edmonds's polynomial-time algorithm, are known to generalize to $k$-matchings. These 1-matching results are also known to generalize to the problem of finding a subgraph, with a maximum number of nodes, whose connected components are isolated edges and 1-critical (or hypomatchable) graphs from a specified set (e.g., triangles or pentagons). In this paper we present a new common generalization of these two generalized 1-matching problems. We present an algorithm, a min-max theorem, and a structure theorem (that generalizes the Edmonds--Gallai theorem for 1-matchings). Even when specialized to $k$-matchings, our min-max and structure theorems appear to be new.

Computational Investigation on the Crack in Kevlar Based Composite Materials at Cryogenic Temperatures to be used in Superconducting Motors

The compatibility of Kevlar based composites at cryogenic temperatures made it possible to be used in various superconducting applications including superconducting motors. The torque tube used in the superconducting motors is made up of Kevlar due its capability to hinder the heat transfer between driving to the driven end of the motor. However, at cryogenic temperatures brittle fracture is highly pronounced due to contraction of the Kevlar. Hence, in the present work, the fracture behaviour of Kevlar-49/Epoxy with 60% fibre volume fraction at cryogenic temperatures is investigated using a commercial code namely ABAQUS. This code uses extended finite element method (XFEM) of formulation in solving the stiffness matrix with realistic boundary conditions. A uniaxial tensile load of 700MPa is considered with one end as fixed. Further, Kevlar-49/Epoxy is considered to be isotropic with the magnitude of Young’s modulus to be 99GPa and the poison’s ratio to be 0.34 at 75K. The consideration of isotropic properties would be valid as the XFEM assumes linear elastic fracture mechanics (LEFM) approach. Further, the accuracy of XFEM is superior over contour integral method due to the enrichment of elements in the entire computational domain including the crack tip. A Kevlar specimen of 50X30 mm is modeled and meshed (quadrilateral) in ABAQUS. The mesh size is considered to be 2 mm to capture the results at maximum number of nodes. Three cases of edge crack, one being towards the loading end, the second being at the middle and the last being towards the fixed end of the specimen are considered. It is found that significant changes in Von Mises stress, strain and strain energy density exist according to the initiation of crack location. Further, the computational results are validated with the obtained analytical results.

Determination of Appropriate Planting Space and Vertical Number s for Hybrid Arabica Coffee at Yeki District, Southwestern Ethiopia

An experiment was conducted at Tepi National Spices Research Center for five years, to determine the optimum planting space and vertical numbers that promote growth and yield of hybrid Arabica coffee variety. The treatments consisted of three levels of planting space (2.5 m x 2.5 m, 2.5 m x 2.0 m, 2.0 m x 2.0 m) and three vertical numbers (single stem, two stem, free growth). The experiment was laid out in Randomized Complete Block Design with three replications. The recorded data on yield and yield attributes like internode length of primary branches, number of bearing and non-bearing primary branches, number of nodes of primary branch and the main stem were significantly influenced by the interaction effects of planting space and vertical numbers. Similarly, the coffee yield was also significantly influenced by the interaction of planting space and vertical numbers. The highest plant height and internode length of primary branches were recorded at the same planting space of 2.0 m x 2.0 m with two stem and free growth habit, respectively. Whereas, the maximum node number on primary branches and main stem were recorded from treatments which had the same planting space (2.5 m x 2.0 m) with single stem and two stem, respectively. The maximum number of bearing primary branches were recorded from trees which treated with 2.0 m x 2.0 m with free growth habit. Likewise, the highest coffee yield was found in a planting space of 2.0 m x 2.0 m with free growth habit. Therefore, it could be concluded that using of an optimum planting space of 2 m x 2 m with free growth habit enhanced the growth, yield and yield components of hybrid coffee. However, it is important to repeat the study in different locations for further investigation on yield and quality attributes.

Performance Evaluation of Bluetooth Low Energy: A Systematic Review.

Small, compact and embedded sensors are a pervasive technology in everyday life for a wide number of applications (e.g., wearable devices, domotics, e-health systems, etc.). In this context, wireless transmission plays a key role, and among available solutions, Bluetooth Low Energy (BLE) is gaining more and more popularity. BLE merges together good performance, low-energy consumption and widespread diffusion. The aim of this work is to review the main methodologies adopted to investigate BLE performance. The first part of this review is an in-depth description of the protocol, highlighting the main characteristics and implementation details. The second part reviews the state of the art on BLE characteristics and performance. In particular, we analyze throughput, maximum number of connectable sensors, power consumption, latency and maximum reachable range, with the aim to identify what are the current limits of BLE technology. The main results can be resumed as follows: throughput may theoretically reach the limit of ~230 kbps, but actual applications analyzed in this review show throughputs limited to ~100 kbps; the maximum reachable range is strictly dependent on the radio power, and it goes up to a few tens of meters; the maximum number of nodes in the network depends on connection parameters, on the network architecture and specific device characteristics, but it is usually lower than 10; power consumption and latency are largely modeled and analyzed and are strictly dependent on a huge number of parameters. Most of these characteristics are based on analytical models, but there is a need for rigorous experimental evaluations to understand the actual limits.

DISTANCE AND HOPS-BASED ENERGY ESTIMATION IN WIRELESS SENSOR NETWORKS

The world of internet of things (IoT) and automation has been catching a robust pace to impact wide range of commercial and domestic applications for some time now. The IoT holds ad-hoc or wireless sensor networks (WSNs) at its very primary implementation level, the hardware level. The increasing requirement of these networks demands a renewed and better design of the network that improves the already existing setbacks of WSNs, which is mainly the power consumption and optimization. Routing highly affects the power consumed in the nodes in WSNs, hence having a modified routing algorithm which is specific to the application and meets its needs, particularly it is a good approach instead of having a generalized existent routing approach. Currently, for WSN having adequate number of nodes, routing involves maximum number of nodes and hops so as to reduce power consumption. However, for restricted areas and limited nodes, this scenario concludes with using up more number of nodes simultaneously resulting in reducing several batteries simultaneously. A routing algorithm is proposed in this paper for such applications that have a bounded region with limited resources. The work proposed in this paper is motivated from the routing algorithm positional attribute based next-hop determination approach (PANDA-TP) which proposes the increase in number of hops to reduce the requirement of transmission power. The aim of the proposed work is to compute the distance between the sending and receiving node and to measure the transmission power that would be required for a direct(path with minimum possible hops) and a multi-hop path. If the node is within the thresh-hold distance of the source, the packet is undoubtedly transferred directly; if the node is out of the thresh-hold distance, then the extra distance is calculated. Based on this, the power boosting factor for the source node, and if necessary, then the extra number of nodes that would be required to transmit is determined. An extra decision-making step is added to this approach which makes it convenient to utilize in varied situations. This routing approach suits the current level of robustness that the WSNs demand.

Flexible online multi-objective optimization framework for ISA100.11a standard in beacon-enabled CSMA/CA mode

Maintaining high quality of service (QoS) for sensor nodes is important in industrial wireless sensor networks (IWSNs). Wide range of factors severely affects QoS; however more research is still needed. In this article, a flexible online multi-objective optimization framework (FOMOF) in carrier sense multiple access with collision avoidance (CSMA/CA) mode is proposed. Nodes are predominantly grouped based on their QoS requirements and then optimized in online mode using a constrained genetic based multi-objective approach. FOMOF to maintain a minimum desired QoS of the pre-determined groups with maximum number of nodes. Furthermore, the packet delivery ratio (PDR) obtained in FOMOF was higher than the one obtained by ISA100.11a standard. Accordingly, the grouping strategy enhanced the number of nodes by 12.5% with End-to-End delay reduction of 16.36% for 27 nodes.

Microarray analysis of differentially-expressed genes and linker genes associated with the molecular mechanism of colorectal cancer.

Colorectal cancer (CRC) is one of the most prevalent malignancies worldwide and remains the third leading cause of cancer-associated mortality. The present study aimed to fully elucidate the pathogenesis of CRC and identify associated genes in tumor development. Microarray GSE44076, GSE41328 and GSE44861 datasets were downloaded from the Gene Expression Omnibus database and integrated with meta-analysis. Differentially-expressed genes (DEGs) were identified from CRC samples compared with adjacent non-cancerous controls using the Limma package in R, followed by functional analysis using the Database for Annotation, Visualization, and Integrated Discovery online tool. A protein-protein interaction (PPI) network of DEGs and linker genes was constructed using NetBox software and modules were also mined. Functional annotation was performed for modules with a maximum number of nodes. Subsequent to meta-analysis to pool the data, one dataset that included 327 samples involved in 11,081 genes was obtained. A total of 697 DEGs were identified between CRC samples and adjacent non-cancerous controls. In the PPI network, modules 1 and 5 contained the maximum number of nodes. Collagen, type I, α1 (COL1A1), COL1A2 and matrix metallopeptidase 9 (MMP9) in module 1 and UDP-glucose 6-dehydrogenase (UGDH), aldehyde dehydrogenase 1 family, member A1 (ALDH1A1), fatty acid binding protein 4 (FABP4) and monoglyceride lipase (MGLL) in module 5 exhibited a high degree of connectivity. Functional analysis indicated that the genes in module 1 were involved in extracellular matrix (ECM)-associated functions and that the genes in module 5 were involved in metabolism-related functions. Overall, significant DEGs and linker genes, namely COL1A1, COL1A2, MMP9, UGDH, ALDH1A1, FABP4 and MGLL, play a crucial role in the development of CRC via regulating the ECM and cell metabolism.

On Order-Constrained Transitive Distance Clustering

We consider the problem of approximating order-constrained transitive distance (OCTD) and its clustering applications. Given any pairwise data, transitive distance (TD) is defined as the smallest possible "gap" on the set of paths connecting them. While such metric definition renders significant capability of addressing elongated clusters, it is sometimes also an over-simplified representation which loses necessary regularization on cluster structure and overfits to short links easily. As a result, conventional TD often suffers from degraded performance given clusters with "thick" structures. Our key intuition is that the maximum (path) order, which is the maximum number of nodes on a path, controls the level of flexibility. Reducing this order benefits the clustering performance by finding a trade-off between flexibility and regularization on cluster structure. Unlike TD, finding OCTD becomes an intractable problem even though the number of connecting paths is reduced. We therefore propose a fast approximation framework, using random samplings to generate multiple diversified TD matrices and a pooling to output the final approximated OCTD matrix. Comprehensive experiments on toy, image and speech datasets show the excellent performance of OCTD, surpassing TD with significant gains and giving state-of-the-art performance on several datasets.

Micropropagation and Assessment of Genetic Stability of In Vitro Raised Jojoba (Simmondsia chinensis Link.) Plants Using SCoT and ISSR Markers

This study is aimed at developing an efficient method for micropropagation of true-to-type jojoba plants. Nodal segments were used for in vitro shoots proliferation. Among three concentrations of BA used for multiplication, 1 mg/l BA gave the highest number of shoots. To enhance growth of shoots, combinations of BA and Kn were investigated. The greater value of shoot length and the maximum number of nodes were observed in the medium containing 1 mg/l BA + 1.5 mg/l Kn. Among different medium used to increase the rate of multiplication, the maximum number of shoots was recorded at ½ MS + Gamborg B5 (B5) vitamins + 2 mg/l Kn + 10 mg/l adenine sulphate (AS). Rooting was obtained upon supplementation of ½ Woody Plant Medium (WPM) with 1 mg/l IBA. Acclimation was achieved by transplanting rooted plantlets into pots containing peat moss and vermiculite. Start codon targeted (SCoT) and intersimple sequence repeat (ISSR) analyses were carried out to assess the genetic fidelity of micropropagated plantlets. All banding profiles of the two analyses from micropropagated plants were monomorphic and similar to the mother plant. Hence, this protocol can be employed for commercial micropropagation of jojoba without the risk of losing genetic stability.Plant Tissue Cult. & Biotech. 25(2): 165-179, 2015 (December)

Equilibrate and Minimize the Energy Consumption in a Cluster for Routing Protocols in Wireless Sensor Network

The Cluster Head is selected on the basis of maximum number of nodes connected, thus several sensor nodes cannot reach any CH, even though they are in the transmission range. These nodes are called the isolated nodes. To solve this problem, the proposed a sub_cluster protocol, its role is to reduce the sensor nodes which do not belong the cluster. The major novel contribution of the proposed work is the sub_cluster protocol which provides coverage of the whole network with a minimum number of isolated nodes and has a very high connectivity rates. The sub_cluster protocol allows firstly with great cluster can be grouped many sub_cluster protocol connected to major CH, each sub_cluster protocol, can be connected of the maximum nodes non CH.

Evaluation of arabica coffee cultivars under Pulney hill conditions of Tamil Nadu

A study was conducted to assess the vegetative and reproductive growth in field in four arabica coffee cultivars. The data revealed an improvement in production of more number of leaves after receipt of summer showers, which continued up to May-June and thereafter started defoliating. The formation of maximum number of nodes per tertiary branch was noticed at the initial stage of fruit ripening during October in Chandragiri (43.22%) followed by Sln.5B (43.03%), Sln.9 (35.77%) and Sln.7.3 (30.42%). Among the cultivars, Chandragiri produced highest cropping node/branch of 8.35 Nos., flower buds/branch of 90.24 Nos. and fruit set of 95.09% compared to other cultivars. However, production of flower buds/cropping node was more in Sln.5B (11.59) on par with Chandragiri (11.03) followed by Sln.9 (10.39) and Sln.7.3 (8.09). The average of four season's recorded data on total fruit drop was 28.95, 31.74, 39.47 and 42.73 per cent in Chandragiri, Sln.\5B, Sln.\7.3 and Sln.\9, respectively. Assessment of fruit drop at monthly interval indicated maximum fruit drop during June-July in Sln.\5B, Sln.\9 and Chandragiri and in July-August in Sln.\7.3. Chandragiri (semi-dwarf) and Sln.5B (tall) arabica cultivars were found better physiological efficient genotypes for Pulney hill region of Tamil Nadu.

In vitro seed germination and node culture of the nutraceutical plant Grewia tenax

Grewia tenax is an important nutraceutical plant threatened due to excessive fruit collection and physiological dormancy of seeds. In vitro propagation is required for ex situ conservation of this neglected plant. Improving germination rate is vital for providing the uniform explant material required for propagation and in vitro studies. The aim of this study was to optimize cultivation conditions for in vitro seed germination and micropropagation of G. tenax. Full seed germination was achieved in all treatments. Tests in distilled water medium showed the least number of days for germination and highest seedling length. Full Murashige and Skoog medium produced the maximum number of nodes. Darkness promoted germination rate and seedling length, but decreased the number of nodes per seedling. Benzyladenine and kinetin slightly increased the number of nodes compared to the control. Each uninodal explant cultivated on Murashige and Skoog medium free of plant growth regulators developed into a plantlet within one week. Well-rooted plants were successfully established in a greenhouse with 95% survival rate. This plant growth regulator-free system can successfully overcome seed dormancy and provide a rapid-continuous supply of plant material of G. tenax.

Enhanced Voting based Secure Localization for Wireless Sensor Networks

Development of location estimation algorithms with improvement in location precision with lower cost, less energy consumption and less hardware support has become more important for many applications in Wireless Sensor Networks (WSNs). This paper addresses the problem of secure location determination, known as secure localization in WSNs using voting based technique which gives a search region in presence of anchor nodes. From the obtained search region trilateration is applied to know the position of sensor nodes. To avoid the involvement of sensor nodes in further location estimation process, bilateration is applied. Experimental analysis shows that the maximum number of nodes can be localized and accurate location of a node can be determined efficiently with low estimation error. To avoid the attacks and involvement of malicious nodes in the localization process, we implement an improved authentication and security algorithm. Using few location reference points in the localization process reduces the communication cost. The proposed scheme also provides very good localization accuracy.

Parallel Glauber dynamics‐based scheduling in static wireless grid networks with polynomially fading interference

The process of designing low-cost scheduling algorithms, which allows maximum number of nodes to communicate simultaneously while avoiding interference along with resource constraints becomes a challenging task. Graph-based models underestimate the effective adjacent nodes by using signal-to-noise ratio measure instead of signal-to-interference-plus-noise-ratio as suggested by polynomial fading models. A hybrid model is developed to accurately estimate the minimum number of schedules required for interference-free communication.

PC1Dmod 6.1 – state-of-the-art models in a well-known interface for improved simulation of Si solar cells

In this paper, we present a new, updated version of the commonly used semiconductor device simulator PC1D named PC1Dmod 6.1. The new program is based on the previously published command line version cmd-PC1D 6.0, which has implemented several new options related to the device physics, but now uses an updated version of the original PC1D graphical user interface. The program thus provides the possibility for using Fermi–Dirac statistics and a selection of state-of-the-art models for crystalline silicon, including injection-dependent band gap narrowing, carrier mobility and Auger recombination, in a familiar setting.Version 6.1 also has implemented the recently published band gap narrowing model by Yan and Cuevas, which is based on empirical studies of a large selection of both n+ and p+ emitters, in addition to Schenk's model. It has also implemented the mobility model for compensated material by Schindler et al. Finally, the maximum number of nodes, time steps and wavelengths have been increased in order to reduce unnecessary constraints on simulations and external files.The results from the PC1Dmod 6.1 simulations have been compared with those of other simulation tools and with previously published data to verify the correct implementation of the new models. Emitter saturation currents calculated using PC1Dmod 6.1 showed an excellent agreement with those obtained using the emitter recombination calculator EDNA 2, and the new program was able to successfully reproduce previously published experimental data and previous implementations of the models. Both PC1Dmod 6.1 and the command line version cmd-PC1D 6.1 are open source software, and are freely available for download.