Добірка наукової літератури з теми "Node repair"
Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями
Ознайомтеся зі списками актуальних статей, книг, дисертацій, тез та інших наукових джерел на тему "Node repair".
Біля кожної праці в переліку літератури доступна кнопка «Додати до бібліографії». Скористайтеся нею – і ми автоматично оформимо бібліографічне посилання на обрану працю в потрібному вам стилі цитування: APA, MLA, «Гарвард», «Чикаго», «Ванкувер» тощо.
Також ви можете завантажити повний текст наукової публікації у форматі «.pdf» та прочитати онлайн анотацію до роботи, якщо відповідні параметри наявні в метаданих.
Статті в журналах з теми "Node repair"
1
Zhang, Pengtao, Peng Bai, Chaoqi Fu, and Shanshan Li. "Dynamic Repair and Robust Optimization of Complex Networks." Mathematical Problems in Engineering 2020 (May 31, 2020): 1–7. http://dx.doi.org/10.1155/2020/4131502.
Повний текст джерелаАнотація:
Network repair is indispensable for maintaining network security. Conventional static repair is relatively inefficient. In this study, by considering the energy transfer between nodes, a dynamic repair model was established. The fundamental reason for the secondary failure of repaired nodes during the dynamic repair process is the coupling structure of failure networks. A dynamic repair strategy was proposed that can effectively prevent the secondary failure of repair nodes influenced by energy during repair and can cause the redundant capacity of repair nodes to be used reasonably. By turning off the energy transfer function of the link to control the excessive flow of energy into the repair node to avoid the occurrence of secondary failure; on the other hand, by sharing part of the load of the failure node, realize the rational use of the redundant capacity of the repair node to reduce the impact of the failure node on the overall function of the network. The proposed strategy mitigated the effect of failure nodes on network functions and substantially improved the recovery efficiency of network functions. Furthermore, redundant edges, behaving as energy redundant links in a network structure, can considerably improve the robustness of the network by optimizing the removal of redundant edges. Dynamic repair is not only an efficient repair method but also a highly flexible choice for network repair.
2
Ye, Miao, Qinghao Zhang, Ruoyu Wei, Yong Wang, and Xiaofang Deng. "A New Method for Reconstructing Data Considering the Factor of Selected Provider Nodes Set in Distributed Storage System." Mathematics 10, no. 10 (May 19, 2022): 1739. http://dx.doi.org/10.3390/math10101739.
Повний текст джерелаАнотація:
In the distributed storage system, when data need to be recovered after node failure, the erasure code redundancy method occupies less storage space than the multi-copy method. At present, the repair mechanism using erasure code to reconstruct the failed node only considers the improvement of link bandwidth on the repair rate and does not consider the impact of the selection of data providing node-set on the repair performance. A single node fault data reconstruction method based on the Software Defined Network (SDN) using the erasure code method is designed to solve the above problems. This method collects the network link-state through SDN, establishes a multi-attribute decision-making model of the data providing node-set based on the node performance, and determines the data providing nodes participating in providing data through the ideal point method. Then, the data recovery problem of a single fault node is modeled as the optimization problem of an optimal repair tree, and a hybrid genetic algorithm is designed to solve it. The experimental results show that under the same erasure code scale, after selecting the nodes of the data providing node-set, compared with the traditional tree topology and star topology, the repair delay distribution of the designed single fault node repair method for a distributed storage system is reduced by 15% and 45% respectively, and the repair flow is close to the star topology, which is reduced by 40% compared with the traditional tree repair.
3
Xu, Bao, and Yong Feng Ju. "Distributed Coverage-Hole Repair Algorithm towards Nodes Failure in Wireless Sensor Networks." Applied Mechanics and Materials 135-136 (October 2011): 464–69. http://dx.doi.org/10.4028/www.scientific.net/amm.135-136.464.
Повний текст джерелаАнотація:
In order to preserve the coverage and ensure the efficiency of Wireless Sensor Networks (WSNs), a distributed coverage-hole repair algorithm towards nodes failure is proposed in this paper. Every node has a energy threshold, if node’s energy is lower than its threshold, it sends a failure message to the nearest node and appoints it as the head node, the head node consideres all the neighbors of the failure node are preparatory boundary nodes at first, then judges every preparatory boundary nodes whether be a non-boundary node through the intersection angle with the failure node. In the last, the head node activates the redundant node within the sensing range of failure node which has the most boundary nodes as neighbor nodes. Analyzes and simulation on Matlab platform indicate that this algorithm has a low time complexity and the repair efficiency has a grate relation with node density and node sensing radius.
4
Ye, Miao, Ruoyu Wei, Wei Guo, Qiuxiang Jiang, Hongbing Qiu, and Yong Wang. "A New Method for Reconstructing Data on a Single Failure Node in the Distributed Storage System Based on the MSR Code." Wireless Communications and Mobile Computing 2021 (March 31, 2021): 1–14. http://dx.doi.org/10.1155/2021/5574255.
Повний текст джерелаАнотація:
As a storage method for a distributed storage system, an erasure code can save storage space and repair the data of failed nodes. However, most studies that discuss the repair of fault nodes in the erasure code mode only focus on the condition that the bandwidth of heterogeneous links restricts the repair rate but ignore the condition that the storage node is heterogeneous, the cost of repair traffic in the repair process, and the influence of the failure of secondary nodes on the repair process. An optimal repair strategy based on the minimum storage regenerative (MSR) code and a hybrid genetic algorithm is proposed for single-node fault scenarios to solve the above problems. In this work, the single-node data repair problem is modeled as an optimization problem of an optimal Steiner tree with constraints considering heterogeneous link bandwidth and heterogeneous node processing capacity and takes repair traffic and repair delay as optimization objectives. After that, a hybrid genetic algorithm is designed to solve the problem. The experimental results show that under the same scales used in the MSR code cases, our approach has good robustness and its repair delay decreases by 10% and 55% compared with the conventional tree repair topology and star repair topology, respectively; the repair flow increases by 10% compared with the star topology, and the flow rate of the conventional tree repair topology decreases by 40%.
5
Chen, Ningjiang, Weitao Liu, Wenjuan Pu, Yifei Liu, and Qingwei Zhong. "SDNC-Repair: A Cooperative Data Repair Strategy Based on Erasure Code for Software-Defined Storage." Sensors 23, no. 13 (June 22, 2023): 5809. http://dx.doi.org/10.3390/s23135809.
Повний текст джерелаАнотація:
Erasure-code-based storage systems suffer from problems such as long repair time and low I/O performance, resulting in high repair costs. For many years, researchers have focused on reducing the cost of repairing erasure-code-based storage systems. In this study, we discuss the demerits of node selecting, data transferring and data repair in erasure-code-based storage systems. Based on the network topology and node structure, we propose SDNC-Repair, a cooperative data repair strategy based on erasure code for SDS (Software Defined Storage), and describe its framework. Then, we propose a data source selection algorithm that senses the available network bandwidth between nodes and a data flow scheduling algorithm in SDNC-Repair. Additionally, we propose a data repair method based on node collaboration and data aggregation. Experiments illustrate that the proposed method has better repair performance under different data granularities. Compared to the conventional repair method, although the SDNC-Repair is more constrained by the cross-rack bandwidth, it improves system throughput effectively and significantly reduces data repair time in scenarios where multiple nodes fail and bandwidth is limited.
6
Platt, James Robert, Christopher Williams, Nicholas West, Jenny F. Seligmann, and Damian JM Tolan. "Exploring the radiological differences of lymph nodes between mismatch repair deficient and mismatch repair proficient colon cancer." Journal of Clinical Oncology 41, no. 16_suppl (June 1, 2023): e15643-e15643. http://dx.doi.org/10.1200/jco.2023.41.16_suppl.e15643.
Повний текст джерелаАнотація:
e15643 Background: Mismatch repair (MMR) deficient (dMMR) colon cancer (CC) accounts for 15-20% of CC diagnoses and is characterised by clinicopathological features distinct from MMR proficient (pMMR) CC. Regardless of MMR status, CT staging is a critical part of the workup for newly diagnosed CC. Whilst CT can accurately predict T stage, it is less effective for N stage. Incorrect N staging may risk poor prognostication, more invasive surgery and may have implications for emerging neoadjuvant therapies. We recently illustrated the impact of MMR status on CT staging, with N staging accuracy significantly worse in dMMR than pMMR CC. Furthermore, we highlighted the clinical utility of using serum inflammatory markers to predict N stage more accurately in dMMR CC. It is increasingly apparent that MMR status has implications for CT staging and should be considered when developing strategies to improve performance. It is therefore crucial to understand how lymph node appearances differ according to MMR status. Here, we investigated whether radiological features of lymph nodes differ between dMMR and pMMR CC. Methods: CT scans were retrospectively assessed for patients who underwent curative resection from March 2019 to July 2020. Axial images were used to identify nodes > 5mm in longest diameter within the tumour drainage territory. The following were collected for each node: location (pericolic, intermediate, main; according to Japanese Society for Cancer of the Colon and Rectum criteria), long axis diameter and short axis diameter. The following were collected for the largest node: short to long axis ratio (SLAr), attenuation and heterogeneity. Characteristics were compared between the dMMR and pMMR groups. Results: This cohort comprised 92 patients, with 53 and 39 in the pMMR and dMMR groups, respectively. As expected, there were greater proportions of females and right-sided tumours in the dMMR group. Median SLAr and median attenuation of the largest node were significantly greater in the dMMR than the pMMR group (0.7 v 0.57, p = 0.0012 and 53.1HU v 40.4HU, p = 0.013, respectively). Number and distribution of enlarged nodes, and location, long axis and heterogeneity of the largest node did not differ between the groups. Conclusions: dMMR and pMMR CC are increasingly recognised as distinct entities, with implications for prognosis and treatment. There is growing evidence illustrating the impact of MMR status on CT staging, and in particular N staging. Here, we illustrated the similarities and differences of lymph nodes on CT between dMMR and pMMR CC. To the best of our knowledge, this is the first analysis to explore the relevance of the largest node and to illustrate the SLAr and attenuation of the largest node being significantly greater in dMMR CC. Recognising these differences will be crucial as we develop strategies for selecting patients to receive neoadjuvant immunotherapy in dMMR CC.
7
Liu, Shangdong, Donghui Liu, Yujian Feng, and Yimu Ji. "Distributed Connectivity Restoration Algorithm with Optimal Repair Path in Wireless Sensor and Actor Networks." Journal of Sensors 2022 (April 19, 2022): 1–16. http://dx.doi.org/10.1155/2022/9299564.
Повний текст джерелаАнотація:
The actor nodes in wireless sensor and actor network (WSAN) are responsible for receiving the perceived data, processing and collaborating with each other. In most scenarios, maintaining the connectivity of the interactor network is necessary to plan the optimal coordinated response. However, actors are vulnerable to damage due to their limited energy and harsh environment. At worst, such failure can split the interactor network, which is affecting network performance. To restore the network connectivity, the existing methods replace the failed node by selecting a redundant node in the network. Multiple nodes may be involved in moving from the redundant node to the failed node, thus forming a repair path. However, the repair paths generated by such methods are often not optimal. In this paper, we use the gradient generation and diffusion mechanism to restore the connectivity of the interactor network and propose a gradient-based distributed connectivity recovery (GDCR) algorithm. GDCR selects an optimal repair path from the global network based on the generated gradient distribution under fully distributed and localized conditions. GDCR can timely respond to the repair and minimize the recovery range and movement overhead. Simulation results verify the performance of the proposed algorithm.
8
Wang, Zhangquan, Yourong Chen, Banteng Liu, Haibo Yang, Ziyi Su, and Yunkai Zhu. "A sensor node scheduling algorithm for heterogeneous wireless sensor networks." International Journal of Distributed Sensor Networks 15, no. 1 (January 2019): 155014771982631. http://dx.doi.org/10.1177/1550147719826311.
Повний текст джерелаАнотація:
To improve the regional coverage rate and network lifetime of heterogeneous wireless sensor networks, a sensor node scheduling algorithm for heterogeneous wireless sensor networks is proposed. In sensor node scheduling algorithm, heterogeneous perception radius of sensor node is considered. Incomplete coverage constraint and arc coverage interval are analyzed. Regional coverage increment optimization model, arc coverage increment optimization model, and residual energy optimization model are proposed. Multi-objective scheduling model is established using weight factors and integrated function. Furthermore, the heuristic method is proposed to solve the multi-objective optimization model, and scheduling scheme of heterogeneous sensor nodes is obtained. When the network is in operation for a period of time, some sensor nodes are invalid and relevant regions are uncovered. The repair method is proposed to wake up sleep sensor nodes and repair the coverage blind area. The simulation results show that if keeping the same regional coverage rate, sensor node scheduling algorithm improves network lifetime, increases number of living sensor nodes, and keeps average node energy consumption at a low level. Under certain conditions, sensor node scheduling algorithm outperforms DGREEDY, two-tiered scheduling, and minimum connected cover.
9
Mittal, Swati, Anu Mehra, Nitin Rakesh, and Rakesh Matam. "Optimizing Regeneration Time by Node Selection in Group Repair Code." International Journal of Mathematical, Engineering and Management Sciences 7, no. 2 (March 14, 2022): 299–311. http://dx.doi.org/10.33889/ijmems.2022.7.2.020.
Повний текст джерелаАнотація:
Distributed storage systems use network coding techniques like replication, erasure codes, local codes, regeneration codes, hybrid code, double code and group repair code to store data efficiently and provide speedy recovery of data during failures. The performance of these approaches is mainly compared on the basis of storage required and repair bandwidth. Out of these, Group Repair Codes is the one that has optimal repair bandwidth for regeneration of nodes. Traditionally, the cost of regeneration was considered to be dependent on the number of nodes participating in the process and the amount of data being transferred. There was not much discussion on the heterogeneity of the network and the capacity of the links between the nodes. In real-time, the nodes are connected to each other with different link capacities due to which the same amount of data takes different duration in reaching its destination. Selecting the node with higher link capacity helps in reducing the data transfer time. So, considering the heterogeneous nature of the network, this paper reduces the regeneration time for Group Repair Codes (GRC). The node selection algorithms for data regeneration have been proposed for GRC and the results of simulation show significant improvement in the regeneration time. Further, the network coding in heterogeneous systems may be explored for factors like network traffic, intermediate nodes, data routing etc.
10
Gou, Pingzhang, Miao Guo, Baoyong Guo, and Shun Mao. "DHD-MEPO: A Novel Distributed Coverage Hole Detection and Repair Method for Three-Dimensional Hybrid Wireless Sensor Networks." Electronics 12, no. 11 (May 28, 2023): 2445. http://dx.doi.org/10.3390/electronics12112445.
Повний текст джерелаАнотація:
A coverage hole is a problem that cannot be completely avoided in three-dimensional hybrid wireless sensor networks. It can lead to hindrances in monitoring tasks and adversely affect network performance. To address the problem of coverage holes caused by the uneven initial deployment of the network and node damage during operation, we propose a distributed hole detection and multi-objective optimization emperor penguin repair algorithm (DHD-MEPO). In the detection phase, the monitoring region is zoned as units according to the quantity of nodes and the sensing range, and static nodes use the sum-of-weights method to campaign for group nodes on their terms, determining the location of holes by calculating the coverage of each cell. In the repair phase, the set of repair nodes is determined by calculating the mobile node coverage redundancy. Based on the characteristics of complex environments, the regions of high hole levels are prioritized. Moreover, the residual energy homogeneity of nodes is considered for the design of multi-objective functions. A lens-imaging mapping learning strategy is introduced to perturb the location of repair nodes for the optimization of the emperor penguin algorithm. Experimental results illustrate that the DHD-MEPO, compared with the C-CICHH, 3D-VPCA, RA, EMSCOLER, and IERP algorithms, can balance the uniformity of the residual energy of each node while satisfying the network coverage requirements and network connectivity, which effectively improves the network coverage performance.
Дисертації з теми "Node repair"
1
Han, Chuan. "Modeling and Optimization of Wireless Routing." Diss., Virginia Tech, 2012. http://hdl.handle.net/10919/77069.
Повний текст джерелаАнотація:
Recently, many new types of wireless networks have emerged, such as mobile ad hoc networks (MANETs), cognitive radio networks (CRNs) and large scale wireless sensor networks. To get better performance in these wireless networks, various schemes, e.g., metrics, policies, algorithms, protocols, etc., have been proposed. Among them, optimal schemes that can achieve optimal performance are of great importance. On the theoretical side, they provide important design guidelines and performance benchmarks. On the practical side, they guarantee best communication performance with limited network resources. In this dissertation, we focus on the modeling and optimization of routing in wireless networks, including both broadcast routing, unicast routing, and convergecast routing. We study two aspects of routing: algorithm analysis and Qos analysis. In the algorithmic work, we focus on how to build optimal broadcast trees. We investigate the optimality compatibility between three tree-based broadcast routing algorithms and routing metrics. The Qos work includes three parts. First, we focus on how to optimally repair broken paths to minimize impact of path break in MANETs. We propose a provably optimal cached-based route repair policy for real-time traffic in MANETs. Second, we focus on the impact of secondary user (SU) node placement on SU traffic delay in CRNs. We design SU node placement schemes that can minimize the multi-hop delay in CRNs. Third, we analyze the convergecast delay of a large scale sensor network which coexists with WiFi nodes. We derive a closed form delay formula, which can be used to estimate sensor packet convergecast delay given the distance between a sensor node and the sink node together with other networking setting parameters. The main contributions of this dissertation are summarized as follows:
Optimality compatibility study between tree-based broadcast routing algorithms and routing metrics: Broadcast routing is a critical component in the routing design. While there are plenty of routing metrics and broadcast routing schemes in current literature, arbitrary combination of broadcast routing metrics with broadcast tree construction (BTC) algorithms may not result in optimal broadcast trees. In this work, we study the requirement on the combination of routing metrics and BTC algorithms to ensure optimal broadcast tree construction. When a BTC algorithm fails to find the optimal broadcast tree, we define that the BTC algorithm and the metric are not optimality compatible. We show that different BTC algorithms have different requirements on the properties of broadcast routing metrics. The metric properties for BTC algorithms in both undirected network topologies and directed network topologies are developed and proved. They are successfully used to verify the optimality compatibility between broadcast routing metrics and BTC algorithms.
Optimal cache-based route repair policy for real-time traffic in mobile ad hoc networks: Real-time applications in ad hoc networks require fast route repair mechanisms to minimize the interruptions to their communications. Cache-based route repair schemes are popular choices since they can quickly resume communications using cached backup paths after a route break. In this work, through thorough theoretical modeling of the cache-based route repair process, we derive a provably optimal cache-based route repair policy. This optimal policy considers both the overhead of the route repair schemes and the promptness of the repair action. The correctness and advantages of our optimal policy are validated by extensive simulations.
Optimal secondary user node placement study in cognitive radio networks: Information propagation speed (IPS) in a multi-hop CRN is an important factor that affects the network's delay performance and needs to be considered in network planning. The impact of primary user (PU) activities on IPS makes the problem of analyzing IPS in multi-hop CRNs very challenging and hence unsolved in existing literature. In this work, we fill this technical void. We establish models of IPS in multi-hop CRNs and compute how to maximize IPS in two cases. The first case, named the maximum network IPS, maximizes IPS across a network topology over an infinite plane. The second case, named the maximum flow IPS, maximizes the IPS between a given pair of source and destination nodes separated by a fixed distance. We reveal that both maximum IPSs are determined by the PU activity level and the placement of SU relay nodes. We design optimal relay placement strategies in CRNs to maximize these two IPS under different PU activity levels. The correctness of our analytical results is validated by simulations and numerical experiments.
Convergecast delay analysis of large scale sensor networks coexisting with WiFi networks: Due to the increasing popularity of wireless devices, such as WiFi (IEEE 802.11) and ZigBee (IEEE 802.15.4), the ISM bands have become more and more crowded. Since ZigBee is the de facto radio technology of sensor networks, coexistence of WiFi networks and sensor (ZigBee) networks is challenging because of the great heterogeneity between WiFi and ZigBee technologies. In the presence of interference from WiFi and other sensor nodes, the performance of sensor networks is not clearly understood. In this work, we study delay performance of a large scale sensor network which coexists with WiFi networks. Given the distance from the sensor node to the sink node, we are interested in the expected delay of sensor packets to reach the sink node in the presence of both WiFi and sensor interference. We formulate the delay analysis problem as a two priority M/G/1 preemptive repeat identical queueing system, and analyze the delay using queueing theory and probability theory. First, we use a path probabilistic approach to derive the expected delay. Second, we develop a simplified linear approximation model for delay analysis. The correctness of both models is validated by NS2 simulations.Recently, many new types of wireless networks have emerged, such as mobile ad hoc networks (MANETs), cognitive radio networks (CRNs) and large scale wireless sensor networks. To get better performance in these wireless networks, various schemes, e.g., metrics, policies, algorithms, protocols, etc., have been proposed. Among them, optimal schemes that can achieve optimal performance are of great importance. On the theoretical side, they provide important design guidelines and performance benchmarks. On the practical side, they guarantee best communication performance with limited network resources. In this dissertation, we focus on the modeling and optimization of routing in wireless networks, including both broadcast routing, unicast routing, and convergecast routing. We study two aspects of routing: algorithm analysis and Qos analysis. In the algorithmic work, we focus on how to build optimal broadcast trees. We investigate the optimality compatibility between three tree-based broadcast routing algorithms and routing metrics. The Qos work includes three parts. First, we focus on how to optimally repair broken paths to minimize impact of path break in MANETs. We propose a provably optimal cached-based route repair policy for real-time traffic in MANETs. Second, we focus on the impact of secondary user (SU) node placement on SU traffic delay in CRNs. We design SU node placement schemes that can minimize the multi-hop delay in CRNs. Third, we analyze the convergecast delay of a large scale sensor network which coexists with WiFi nodes. We derive a closed form delay formula, which can be used to estimate sensor packet convergecast delay given the distance between a sensor node and the sink node together with other networking setting parameters. The main contributions of this dissertation are summarized as follows:
Optimality compatibility study between tree-based broadcast routing algorithms and routing metrics: Broadcast routing is a critical component in the routing design. While there are plenty of routing metrics and broadcast routing schemes in current literature, arbitrary combination of broadcast routing metrics with broadcast tree construction (BTC) algorithms may not result in optimal broadcast trees. In this work, we study the requirement on the combination of routing metrics and BTC algorithms to ensure optimal broadcast tree construction. When a BTC algorithm fails to find the optimal broadcast tree, we define that the BTC algorithm and the metric are not optimality compatible. We show that different BTC algorithms have different requirements on the properties of broadcast routing metrics. The metric properties for BTC algorithms in both undirected network topologies and directed network topologies are developed and proved. They are successfully used to verify the optimality compatibility between broadcast routing metrics and BTC algorithms.
Optimal cache-based route repair policy for real-time traffic in mobile ad hoc networks: Real-time applications in ad hoc networks require fast route repair mechanisms to minimize the interruptions to their communications. Cache-based route repair schemes are popular choices since they can quickly resume communications using cached backup paths after a route break. In this work, through thorough theoretical modeling of the cache-based route repair process, we derive a provably optimal cache-based route repair policy. This optimal policy considers both the overhead of the route repair schemes and the promptness of the repair action. The correctness and advantages of our optimal policy are validated by extensive simulations.
Optimal secondary user node placement study in cognitive radio networks: Information propagation speed (IPS) in a multi-hop CRN is an important factor that affects the network's delay performance and needs to be considered in network planning. The impact of primary user (PU) activities on IPS makes the problem of analyzing IPS in multi-hop CRNs very challenging and hence unsolved in existing literature. In this work, we fill this technical void. We establish models of IPS in multi-hop CRNs and compute how to maximize IPS in two cases. The first case, named the maximum network IPS, maximizes IPS across a network topology over an infinite plane. The second case, named the maximum flow IPS, maximizes the IPS between a given pair of source and destination nodes separated by a fixed distance. We reveal that both maximum IPSs are determined by the PU activity level and the placement of SU relay nodes. We design optimal relay placement strategies in CRNs to maximize these two IPS under different PU activity levels. The correctness of our analytical results is validated by simulations and numerical experiments.
Convergecast delay analysis of large scale sensor networks coexisting with WiFi networks: Due to the increasing popularity of wireless devices, such as WiFi (IEEE 802.11) and ZigBee (IEEE 802.15.4), the ISM bands have become more and more crowded. Since ZigBee is the de facto radio technology of sensor networks, coexistence of WiFi networks and sensor (ZigBee) networks is challenging because of the great heterogeneity between WiFi and ZigBee technologies. In the presence of interference from WiFi and other sensor nodes, the performance of sensor networks is not clearly understood. In this work, we study delay performance of a large scale sensor network which coexists with WiFi networks. Given the distance from the sensor node to the sink node, we are interested in the expected delay of sensor packets to reach the sink node in the presence of both WiFi and sensor interference. We formulate the delay analysis problem as a two priority M/G/1 preemptive repeat identical queueing system, and analyze the delay using queueing theory and probability theory. First, we use a path probabilistic approach to derive the expected delay. Second, we develop a simplified linear approximation model for delay analysis. The correctness of both models is validated by NS2 simulations.Ph. D.
2
Yang, Ling. "Nodes failure detection in large scale network." Thesis, The University of Sydney, 2005. https://hdl.handle.net/2123/27923.
Повний текст джерелаАнотація:
It is the age of information technology. Around the world, millions of computers
are being linked together in networks of all sizes, from small local area
networks to giant enterprise wide area networks. This rapid growth means a lot
of opportunity for people working or preparing to work, in the computer
industry.
In today’s world of LANs and WANs, almost all business depends on
internetworking for data communication. From the world wide internet to
private intranet, internetworking technology is present in virtually every aspect
of a business technical operation. And in this age of information technology it is
very important to discover network failure as soon as possible.
in this project, we present a set of methods to detect network nodes failure and
predict network nodes failure with failure reasons. We describe the design and
implementation by using a resource-combined algorithm, Nai've Bayes
Classifier and Bayes Network.
Results show that with the resource-combined algorithm the performance of
actual nodes failure detection can be improved. Results also show that
network nodes failure can be predicted in a fixed time before actual failure with
a high degree of accuracy.
3
Kadlubiec, Janusz. "Dlouhodobé posuzování vozovek opravených recyklací podkladů." Master's thesis, Vysoké učení technické v Brně. Fakulta stavební, 2012. http://www.nusl.cz/ntk/nusl-225491.
Повний текст джерелаАнотація:
My work deals with monitoring communications sections, which were renovated zrecyklováním existing surface. I documented these communications and to assess their condition after the time of use. Subscribed sections I put into the database PMS.
4
Rocha, Carolina de Lourdes Julião Vieira. "Avaliação da terapia laser de baixa intensidade sobre a resposta inflamatória e o processo de reparo tecidual de feridas cutâneas de camundongos diabéticos." Universidade Federal de Juiz de Fora (UFJF), 2010. https://repositorio.ufjf.br/jspui/handle/ufjf/3896.
Повний текст джерелаАнотація:
Submitted by Renata Lopes (renatasil82@gmail.com) on 2017-03-29T13:30:24Z
No. of bitstreams: 1
carolinadelourdesjuliaovieirarocha.pdf: 438849 bytes, checksum: 0e5f838b152a2294e48909758b185709 (MD5)Approved for entry into archive by Adriana Oliveira (adriana.oliveira@ufjf.edu.br) on 2017-03-30T11:20:43Z (GMT) No. of bitstreams: 1 carolinadelourdesjuliaovieirarocha.pdf: 438849 bytes, checksum: 0e5f838b152a2294e48909758b185709 (MD5)
Made available in DSpace on 2017-03-30T11:20:43Z (GMT). No. of bitstreams: 1 carolinadelourdesjuliaovieirarocha.pdf: 438849 bytes, checksum: 0e5f838b152a2294e48909758b185709 (MD5) Previous issue date: 2010-01-01
O Diabetes Mellitus é um problema mundial de saúde pública, de incidência elevada, em termos de pessoas afetadas e mortalidade prematura. As ulcerações em membros inferiores são a maior causa de morbidade entre os diabéticos, tendo como conseqüência a amputação. Na presença desta doença, o processo cicatricial é mais dificultado. Diversos estudos estão sendo realizados com a utilização da Terapia Laser de Baixa Intensidade no processo de cicatrização e reparo tecidual. A terapia laser de baixa intensidade tem sido relatada como importante moduladora da cicatrização de feridas cutâneas. No presente estudo, nós avaliamos os efeitos da terapia laser de baixa intensidade sobre a intensidade do infiltrado inflamatório e quantidade de vasos sangüíneos em feridas cutâneas de camundongos diabéticos não obesos (NOD), adicionalmente, analisamos a expressão da enzima ciclooxigenase 2 no sítio do reparo tecidual utilizando o modelo experimental camundongos NOD para estudar a cicatrização de feridas cutâneas. Foram utilizados 30 camundongos NOD. Destes, 14 ficaram diabéticos e foram divididos em dois grupos: grupo I (n = 7), controle, composto por camundongos NOD não submetidos à terapia laser de baixa intensidade e grupo II (n = 7), tratado, composto por camundongos NOD submetidos à terapia laser de baixa intensidade nos seguintes parâmetros: 15 mW de potência, dose de 3,8 J/cm2, e tempo de aplicação de 20 segundos. Após sete dias do ato cirúrgico e após aplicação do laser, os animais foram eutanasiados com sobredose de anestesia e foram colhidas amostras das feridas para posterior análise histopatológica, histomorfométrica e imunohistoquímica. Os resultados em conjunto sugeriram que a terapia laser de baixa intensidade é capaz de modular negativamente a expressão da enzima ciclooxigenase 2 contribuindo para o controle da resposta inflamatória em feridas cutâneas de camundongos NOD.
Diabetes Mellitus is a worldwide problem of public health, the high incidence, in terms of people affected and premature mortality. Ulcers of the lower limbs are the leading cause of morbidity among diabetic patients, which resulted in amputation. In this disease, the healing process is hampered. Several studies are being conducted with the use of low-level laser therapy in the process of healing and tissue repair. The low-level laser therapy has been reported as an important modulator of healing of skin wounds. In this study we evaluated the effects of low-level laser therapy intensity of the inflammatory infiltrate and number of blood vessels in wounds of non-obese diabetic mice (NOD), in addition, we analyzed the expression of cyclooxygenase 2 enzyme at the site of repair tissue using the NOD mice experimental model to study the healing of skin wounds. Were used thirty NOD mice, these fourteen were diabetic and were divided into two groups: group I (n = 7) underwent a surgical procedure of skin wounds and group II (n = 7) underwent a surgical procedure of skin wounds and treated with LLLT. Group II was submitted to LLLT in the following parameters: 15 mW of power, dose of 3.8 J/cm2 and exposure time of 20 seconds. Seven days after surgery and after laser application, animals were euthanized with an overdose of anesthesia and were submitted colleted tissue samples for subsequent histological analysis, histomorphometry and immunohistochemistry. A low-level laser therapy has promoted the inhibition of cyclooxygenase 2 expression in skin wounds in mice diabetic. The results together suggested that low-level laser therapy is able to negatively modulate the expression of cyclooxygenase 2 enzyme contributing to the inflammatory response in cutaneous wounds in NOD mice.
5
Farhad, Etezadi Ghovanlou. "Étude des stratégies linguistiques de locuteurs de français L1 et d'apprenants étrangers lors de la prise de notes en français : perspectives en didactique des langues." Thesis, Aix-Marseille 1, 2011. http://www.theses.fr/2011AIX10162.
Повний текст джерелаАнотація:
Cette thèse se propose d’étudier les différents types de traitement utilisés par des locuteurs de français L1 et des apprenants étrangers de français lors de la prise de notes dans cette langue, à partir du discours oral magistral. Ce travail qui s’inscrit dans une perspective psycholinguistique vise à analyser la conformité et la fidélité sémantique et formelle des textes-cibles (les productions) par rapport au texte-source (le discours émis). Le cadre théorique de la thèse analyse différentes approches et taxinomies relatives aux stratégies communicatives en langue étrangère, notamment celle de Kellerman, dans le but de dégager une typologie des stratégies de traitement à étudier dans les données empiriques relevées. Afin d’étudier l’efficacité des prises de notes des participants à l’enquête observés, nous avons conçu une grille d’analyse intitulée une « grille de matrices » permettant d’analyser d’une part, le discours professoral (par la méthode de l’analyse discursive de Van Dijk) et d’identifier et de quantifier différents procédés audiographiques déployés par les noteurs observés. A l’issue d’analyses portant sur la forme et le fond des textes recueillis, nous avons dégagé des résultats détaillés relatifs à l’efficacité de la prise de notes des participants observés. Au terme des analyses, des propositions didactiques en matière de prise de notes en langue maternelle et étrangère sont formuléesThis thesis intends to study different types of treatments used by speakers of French L1 and foreign learners of French for note-taking during an oral lecture in that language. From a psycholinguistic perspective, this assignment aims to analyze compliance and definite semantic fidelity of targets-texts (productions) in comparison with the source-text (the issued speech). The theoretical context of the thesis analyzes different approaches and taxonomies relating to conversational strategies in a foreign language notably that of Kellerman, with the intention of identifying a typology of treatment strategies to be studied in gathered empirical data. To study the effectiveness of the participants’ note-taking, we conceived an analysis grid called “matrix grid” allowing to analyze, on one hand, professorial speech (through the method of the discursive analysis of Van Dijk) and on the other hand, to identify and quantify different audiographique techniques used by examined note takers. After analyzing the form and semantic content of the gathered texts, we formulated detailed results relating to the effectiveness of the examined participants’ note-taking. As a consequence of these analyses, didactic proposals in note-taking in a native or foreign language were formulated
6
Bredenkamp, Francois A. "Retrofit repair rethink : redevelopment of the typological suburban retail node." Thesis, 2014.
Знайти повний текст джерела
7
CHANG, WAN-HAN, and 張文瀚. "Design of Coverage Hole Repair Mechanism for Mobile Wireless Sensor Networks with Simultaneous Multiple Node Deaths." Thesis, 2019. http://ndltd.ncl.edu.tw/handle/767unu.
Повний текст джерелаАнотація:
碩士國立臺北科技大學
電機工程系
107
Wireless sensor networks are usually deployed in areas that are difficult for humans to reach or contact, and cannot avoid node deaths (malfunctions) and coverage holes caused by natural disasters or physical damage. Since this phenomenon affects the integrity of the monitoring area, the coverage hole repair has always been an important research topic. Therefore, this thesis proposes a Coverage Hole Repair Mechanism (CHRM). This strategy consists of two folds, a global deployment method that makes all nodes more evenly distributed, and a regional coverage repair method that responds to sudden node deaths. In view of the fact that the shapes of coverage holes are difficult to predict when simultaneously multiple sensor nodes die, this thesis proposes a Genetic Algorithm Coverage Hole Repair Mechanism (GACR). Using the coverage ratio in the coverage area, the total moving distance and lowest residual energy of all participating repair nodes as reference indicators of the fitness function, the proposed method uses GA to find the best moving policy of all participating repair nodes by way of the evolution mechanism. Since the method considers the remaining energies of participating repair nodes, it is possible to improve the situation in which the low residual energy node participates in the repair to move too long or to die due to energy exhaustion during the movement. In addition, as the traditional global repair method does not consider the shortcomings of the remaining energy of the node, this thesis proposes a Vertex Virtual Forces strategy with Genetic Algorithm (VVF_GA) to take into account the residual energy of the node in genetic algorithm. The selected set of nodes is thus suitable for involving in the repair and avoids the situation that the node runs out of energy during the movement. Finally, in order to verify the effectiveness of the CHRM method, this thesis simulates the random multi-node death scenario of the regional coverage repair mechanism GACR and the VVF_GA+GACR algorithm combination respectively, and compares the performance with other coverage hole repair methods. The simulation results show that considering the multiple node deaths the GACR is superior to DCHR, NIBP_VVF, and NIFP that do not take into account the death of multiple nodes. In the metrics of maintaining more than 90% of network coverage time, total moving distance of nodes, and minimum node residual energy, the GACR outperforms. Moreover, comparing with CHRM with the combination of VVF+GACR algorithm, CHRM can effectively reduce unnecessary node movement distance during repair and is more suitable for wireless sensor networks with heterogeneous initial node energies.
8
Pei-YuHuang and 黃珮瑜. "Design and Implementation of the Node Tolerance and Repair Procedure in Wireless Sensor Network and Its Application." Thesis, 2014. http://ndltd.ncl.edu.tw/handle/08251373845919580774.
Повний текст джерелаАнотація:
碩士國立成功大學
工程科學系
102
In recent years, the wireless sensor network (WSN) has gradually been noticed for monitoring the various environmental parameters. The WSN is constituted with a large number of sensor nodes which connect to one another by wireless communication deployed in the unattended region. Generally, sensor nodes are used to sense the environment, collect and calculate the interested data. Then, the sensor nodes deliver the sensed data to the Root, a single node in the highest layer of the tree network, by multi-hop transmission. During the sensor node’s monitoring the environment, the consumption of power is an extremely significant factor that directly effects the lifetime of the WSN. Due to the limited power of the sensor node and the influence from the external factors, it is possible that the sensor nodes may break down. In this respect, we have to take the protection measures to avoid the network from crashing caused by failure of a few sensor nodes’ working. In this thesis, we propose node tolerance to maintain the normal operation of the sensor network, enhance the network structure and its robustness, and reduce the error rate of the sensed data in the broken region where the sensor nodes fail to link with the Root. In this thesis, general sensor nodes are established by the traditional Cluster-Tree (CT) topology. Therefore, for increasing the flexibility of network structure, the combination of the Cluster-Mesh-Tree (CMT) and the CT topology will be used to conquer the weakness of immovable link in traditional CT topology, and also maintain the basic structure of tree topology. Eventually, a repair procedure to restore the failure nodes and avoid the sensed data lost is proposed. The repair robot can repair the failure nodes by re-booting and collecting the sensed data of the failure nodes through directly contacting before personnel arrive at the site. To contact with the failure node directly, the position method is critical for repair procedure. Regarding this concern, we therefore employ a positioning algorithm called fingerprinting in the received signal strength (RSS) model, and use the IR positioning with infrared sensor to compensate the error distance generated from fingerprinting algorithm method. The research saves human labor to maintain the WSN and its routine mission. In this thesis, the GUI software has been implemented by Visual Basic 2010 development platform. The User can store the sensed data, monitor, observe and manage the changes of environment with the platform.
9
Balaji, S. B. "Erasure Codes for Distributed Storage: Tight Bounds and Matching Constructions." Thesis, 2018. https://etd.iisc.ac.in/handle/2005/5330.
Повний текст джерелаАнотація:
The reliable storage of Big Data across a spatially distributed network of nodes, calls for erasure-correcting codes that in addition to protecting against data loss, can also efficiently handle node repair. The need for node repair could arise on account of device failure, need for a maintenance reboot, or simply because the node is busy serving other demands. An important consideration here is the rate of the code, which is the ratio of the number of data symbols to the total amount of storage needed to reliably store these data symbols.
In response, coding theorists have come up with two new classes of codes, known respectively as regenerating codes and Locally Recoverable Codes (LRC). While the focus of the thesis is on LRC, there are also contributions to the theory of regenerating codes.
Contributions to LRC: A LRC is quite simply, a code where a given code symbol can be recovered by contacting at most r other code symbols, where the parameter r is much smaller than the dimension k of the code. A LRC with sequential recovery, is a code that can recover from an arbitrary set of trerasures in t steps in a sequential fashion. Each step recovers an erased symbol and makes use of at most r other code symbols comprising of unerased symbols as well as previously recovered symbols. In this thesis, a tight upper bound on the rate of LRC with sequential recovery is provided, for any value of the number t of erasures and any value of the locality parameter r ≥ 3. This bound proves an earlier conjecture due to Song, Cai and Yuen. While the bound is valid irrespective of the field over which the code is defined, a matching construction of binary codes that achieve the upper bound on rate is also presented.
Contributions to Regenerating Codes: Regenerating codes aim to minimize the amount of data download needed to repair a failed node. Regenerating codes are linear codes that operate over a vector alphabet, i.e., each code symbol in a regenerating code is a vector of α
symbols drawn from a field F. An important open question relates to the minimum possible value of α for a given storage overhead. Here we present tight lower bounds on α for the case when the codes belong to a certain class of codes called MSR codes as well as have the property of optimal access, i.e., symbols are accessed and transmitted as such without any computation by helper node for repair of a failed node.
Contribution to availability Codes: A code in which each code symbol can be recovered in t different ways using respectively t pairwise disjoint set of code symbols with each set of size at most r is called a code with t-availability. The contributions of the thesis in the direction of t-availability codes include improved upper bounds on the minimum distance dmin of this class of codes, both with and without a constraint on the size q of the code-symbol alphabet. An improved upper bound on code rate R is also provided for a subclass of t-availability codes, termed as codes with strict availability. Among the class of t-availability codes, codes with strict availability typically have high rate. A complete characterization of optimal tradeoff between rate and fractional minimum distance for a special class of t-availability codes is also provided.
There are additional results which are not mentioned above including results relating to a class of codes called maximum recoverable codes.
Книги з теми "Node repair"
1
Davdiev, Kurban, and Ayub Omarov. Repair of cars and engines: final qualifying work. ru: INFRA-M Academic Publishing LLC., 2022. http://dx.doi.org/10.12737/1014616.
Повний текст джерелаАнотація:
The general provisions concerning the design of production sites of an auto repair enterprise are outlined, the features of the design of production sites of auto repair production are described. The main goals and objectives of the completion of the final qualification work by students of secondary educational institutions, the sequence of its development are indicated. The structure of the calculation and explanatory note, compiled during the performance of the final qualification work on the design of production sites for the repair of various facilities and for the disassembly and assembly of assembly units, is considered in detail.
The issues of technological calculations of production sites are considered in detail. The features of the design of production sites of classes I, II and III are indicated, differences in the organization of work of these sites are shown, the features of calculations used in the development of their projects are given, examples of calculations are given. The development and design of the design part are considered. The measures for occupational health and safety, fire safety and environmental protection are listed. The appendices provide extensive reference material used in the development of the final qualifying work.
It is intended for students of secondary vocational educational institutions in the preparation of final qualifying work on the subject "Repair of cars and engines" in the specialty 23.02.03 "Maintenance and repair of cars" and university students in the course work and final qualifying work on the subject "Organization of car repair".
2
Henshūbu, Sutajio Takku Kurieitibu, ed. Gong lu che wei xiu bao yang quan gong lue: Shimano pian = : Roadbike maintenance note for Shimano. Taibei Xian Zhonghe Shi: San yue wen hua tu shu shi ye you xian gong si, 2010.
Знайти повний текст джерела
3
Commissioners of Sewers of the City of London, ed. By the Commissioners for Sewers, Pavements, &c. in London: It is ordered, that the clerk do forthwith send to the deputies and common council-men of the several wards, a note of the names of the pavier or paviers designed for each ward .. [London]: Printed by Andrew Clark ..., 1985.
Знайти повний текст джерела
4
House, Tree. Workshop Repair and Maintenance: VW Enthusiasts College Lined Note Book Journal and Repair Workbook. Independently Published, 2021.
Знайти повний текст джерела
5
Refurbishment of Air-conditioned Buildings for Natural Ventilation (Technical Note). BSRIA, 1998.
Знайти повний текст джерела
6
House, Tree. Type 3 Fasteback: Car Enthusiasts College Lined Note Book Journal and Repair Workbook. Independently Published, 2019.
Знайти повний текст джерела
7
Agarwal, Anil, Neil Borley, and Greg McLatchie. Upper gastrointestinal surgery. Oxford University Press, 2017. http://dx.doi.org/10.1093/med/9780199608911.003.0002.
Повний текст джерелаАнотація:
This chapter covers oesophago-gastro-duodenoscopy, including operations like perforated peptic ulcer closure, laparoscopic cholecystectomy, surgery for bleeding peptic ulcer, antireflex surgery—Nissen, Dor, Toupet. It gives a classification of regional lymph nodes of the stomach and explains lymphadenectomy, and the steps of total and subtotal gastrectomy. Types of oesophagectomy and the steps of operations are explained. Details of the operative steps of Heller’s cardiomyotomy for achalasia are provided. Obesity surgery includes laparoscopic adjustable gastric banding (LAGB), sleeve gastrectomy (LSG), and Roux-en-Y gastric bypass (RYGB). Managing oesophageal rupture and perforation includes non-operative and surgical and T tube repair.
8
Leeming, M. B. Standard Tests for Repair Materials and Coatings for Concrete (Technical Note - Construction Industry Research & Information Association). Construction Industry Research and Information Ass, 1993.
Знайти повний текст джерела
9
Kay, E. A., B. W. Staynes, Geoff Mays, B. Tillyer, and J. G. M. Wood. Standard Tests for Repair Materials and Coatings for Concrete (Technical Note - Construction Industry Research & Information Association). Construction Industry Research & Information Association (CIRIA), 1993.
Знайти повний текст джерела
10
McLeish, A. Standard Tests for Repair Materials and Coatings for Concrete (Technical Note - Construction Industry Research & Information Association). Construction Industry Research and Information Ass, 1993.
Знайти повний текст джерелаЧастини книг з теми "Node repair"
1
Shi, Wei, Mengfei Peng, Jean-Pierre Corriveau, and William Lee Croft. "Faulty Node Repair and Dynamically Spawned Black Hole Search." In Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering, 144–62. Cham: Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-59608-2_8.
Повний текст джерела
2
Wang, Niannian, Ye Wang, Jia Yu, and Siyun Chen. "Multi-node Repair Based on GA $$\_$$ PSO with Fractional Regenerating Code Combined with Prior Replication." In Lecture Notes in Electrical Engineering, 252–60. Singapore: Springer Singapore, 2019. http://dx.doi.org/10.1007/978-981-13-6508-9_32.
Повний текст джерела
3
Li, Chenghao, and Bing Shi. "Bilateral Cleft Lip Repair." In Atlas of Lip and Nose Plastic and Cosmetic Surgery, 69–76. Singapore: Springer Singapore, 2021. http://dx.doi.org/10.1007/978-981-16-1911-3_7.
Повний текст джерела
4
Shi, Bing. "Unilateral Cleft Lip Repair." In Atlas of Lip and Nose Plastic and Cosmetic Surgery, 57–67. Singapore: Springer Singapore, 2021. http://dx.doi.org/10.1007/978-981-16-1911-3_6.
Повний текст джерела
5
Dubey, Siba P., and Charles P. Molumi. "Repair of External Nose Defects." In Color Atlas of Head and Neck Surgery, 89–106. Cham: Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-15645-3_5.
Повний текст джерела
6
Burnett, Mark E., and John A. Zitelli. "Repairs of the Nose." In Evidence-Based Procedural Dermatology, 523–39. Cham: Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-02023-1_32.
Повний текст джерела
7
Shetty, Pritham N., Jaideep Singh Chauhan, Mamatha Patil, Neha Aggarwal, and Dipesh Rao. "Cleft Lip." In Oral and Maxillofacial Surgery for the Clinician, 1593–631. Singapore: Springer Singapore, 2021. http://dx.doi.org/10.1007/978-981-15-1346-6_72.
Повний текст джерелаАнотація:
AbstractMany techniques exist at present for surgical repair of primary cleft lip. Since the introduction of Millard, most of the techniques are based on Millard’s Rotation advancement principle. However, every cleft surgeon aims to modify his/her technique to achieve optimum symmetry and function of the nose and lip. In this chapter, we have presented the principles of lip repair followed at our centre based on the very principles of Millard. We have also discussed embryology and anatomy from a surgical pint of view so as to understand the anatomic basis if cleft surgery.
8
Bennun, Ricardo D., and George K. B. Sándor. "Bilateral cleft lip and nose repair." In Cleft lip and palate management, 143–62. Hoboken, NJ, USA: John Wiley & Sons, Inc, 2015. http://dx.doi.org/10.1002/9781119050858.ch10.
Повний текст джерела
9
Bennun, Ricardo D., and David Genecov. "Unilateral cleft lip and nose repair." In Cleft lip and palate management, 113–42. Hoboken, NJ, USA: John Wiley & Sons, Inc, 2015. http://dx.doi.org/10.1002/9781119050858.ch9.
Повний текст джерела
10
Nadjmi, Nasser. "Primary Unilateral Cleft Lip-Nose Repair." In Surgical Management of Cleft Lip and Palate, 21–42. Cham: Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-91686-6_2.
Повний текст джерелаТези доповідей конференцій з теми "Node repair"
1
Rawat, Ankit Singh, O. Ozan Koyluoglu, and Sriram Vishwanath. "Centralized repair of multiple node failures." In 2016 IEEE International Symposium on Information Theory (ISIT). IEEE, 2016. http://dx.doi.org/10.1109/isit.2016.7541450.
Повний текст джерела
2
Patra, Adway, and Alexander Barg. "Node Repair for Adversarial Graphical Networks." In 2023 IEEE International Symposium on Information Theory (ISIT). IEEE, 2023. http://dx.doi.org/10.1109/isit54713.2023.10206680.
Повний текст джерела
3
Gulcu, Talha Cihad. "Secure Node Repair of Reed-Solomon Codes." In 2020 IEEE International Symposium on Information Theory (ISIT). IEEE, 2020. http://dx.doi.org/10.1109/isit44484.2020.9174291.
Повний текст джерела
4
Zorgui, Marwen, and Zhiying Wang. "Centralized multi-node repair in distributed storage." In 2016 54th Annual Allerton Conference on Communication, Control, and Computing (Allerton). IEEE, 2016. http://dx.doi.org/10.1109/allerton.2016.7852289.
Повний текст джерела
5
Robinson, Tod, Andrew Dinsdale, Ron Bozak, Roy White, David A. Lee, and Ken Roessler. "Mask repair for the 65-nm technology node." In Photomask Technology 2005, edited by J. Tracy Weed and Patrick M. Martin. SPIE, 2005. http://dx.doi.org/10.1117/12.634758.
Повний текст джерела
6
Li, Weihong, Fanfan Shen, and Xiaohui Cheng. "Research on node repair mechanisms in wireless sensor networks." In 2012 IEEE International Conference on Computer Science and Automation Engineering (CSAE). IEEE, 2012. http://dx.doi.org/10.1109/csae.2012.6273034.
Повний текст джерела
7
Zorgui, Marwen, and Zhiying Wang. "Centralized multi-node repair for minimum storage regenerating codes." In 2017 IEEE International Symposium on Information Theory (ISIT). IEEE, 2017. http://dx.doi.org/10.1109/isit.2017.8006922.
Повний текст джерела
8
Wang, Dan, Shirui Yu, Zhibiao Mao, Xiang Wang, Yanpeng Chen, and Jianqiang Zhou. "Metal layer OPC repair flow for 28NM node and beyond." In 2016 China Semiconductor Technology International Conference (CSTIC). IEEE, 2016. http://dx.doi.org/10.1109/cstic.2016.7463975.
Повний текст джерела
9
Robinson, Tod, Roy White, Ron Bozak, Ken Roessler, Bernie Arruza, Dennis Hogle, Mike Archuletta, and David Lee. "New tools to enable photomask repair to the 32nm node." In SPIE Photomask Technology, edited by Larry S. Zurbrick and M. Warren Montgomery. SPIE, 2009. http://dx.doi.org/10.1117/12.847238.
Повний текст джерела
10
Sung, Moon Gyu, Sungmin Huh, Byung Cheol Cha, Sungwoon Choi, and Woosung Han. "The specification of the 45-nm node photomask repair process." In 26th Annual BACUS Symposium on Photomask Technology, edited by Patrick M. Martin and Robert J. Naber. SPIE, 2006. http://dx.doi.org/10.1117/12.686509.
Повний текст джерелаЗвіти організацій з теми "Node repair"
1
Jaske and Hart. L52047 PRCI Pipeline Repair Manual 6th Edition. Chantilly, Virginia: Pipeline Research Council International, Inc. (PRCI), August 2006. http://dx.doi.org/10.55274/r0010249.
Повний текст джерелаАнотація:
Note the PRCI Pipeline Repair Manual 2021 Edition is now available and supersedes this edition. The 2021 Edition is available here. Technology advancements in materials, techniques, new products, procedures, etc. offer pipeline companies the opportunity to extend the safe life of assets in place. A comprehensive Pipeline Repair Manual is needed to address these new advances, provide engineering guidance to choose appropriate repair techniques for specific defects in pipelines. This new updated Pipeline Repair Manual provides guidance to pipeline operators as they: (1) choose appropriate repair techniques for specific defects in in-service pipelines; (2) develop or enhance their own procedures and/or manuals for pipeline repairs; (3) or train or qualify maintenance personnel. The manual presents a catalog of known pipeline repair techniques, and discusses the various types of pipeline defects that lend themselves to being repaired while in-service. A matrix is provided to match defects in need of repair with appropriate repair methods. In addition defect assessment methods are presented as are safety considerations related to making in-service repairs. The manual is divided into the following major sections: (1) Response to the discovery of an anomaly or defect - this section presents safety issues and defines critical information that is required to make an appropriate repair response. (2) Pipeline repair methods - this section describes the known methods of repairing in-service pipelines. (3) Appropriate repairs for various types of defects - this section matches the types of defects that are likely to be encountered in in-service pipelines with appropriate repair methods. (4) Repair methods in Europe - this section was added after a review of the draft by a committee of pipeline repair specialists from several European pipeline operators who are members of the Group Europeene de Recherches Gazieres (GERG). It contains suggestions made by the committee to enhance the substance of this manual and to inform readers concerning European practices. (5) Guidelines for repair procedures - this section presents a model procedure, which a pipeline operator may use to create, enhance, or evaluate repair procedures. This document was formerly known as 'Updated Pipeline Repair Manual Revision 6'
2
Wilson, Gerald G. XL8920 Attention Prioritizing and Pipe Replacement-Renewal Decisions. Chantilly, Virginia: Pipeline Research Council International, Inc. (PRCI), January 1990. http://dx.doi.org/10.55274/r0011817.
Повний текст джерелаАнотація:
This technical note represents a collection of papers that provide a good overview of procedures in current use to maximize the benefits received from repair and replacement expenditures in existing gas distribution systems. It includes coverage of cast iron, steel, and, to a very limited extent, plastic systems. The three basic issues associated with this area are: I. Establishing annual maintenance and replacement budgets 2. Establishing attention priorities for the sections of main that comprise a distribution system 3. Determining whether a troublesome section should be repaired or replaced
3
Riveros, Guillermo, and Hussam Mahmoud. Underwater carbon fiber reinforced polymer (CFRP)–retrofitted steel hydraulic structures (SHS) fatigue cracks. Engineer Research and Development Center (U.S.), March 2023. http://dx.doi.org/10.21079/11681/46588.
Повний текст джерелаАнотація:
Recent advances in the use of fiber-reinforced polymers (FRP) to retrofit steel structures subjected to fatigue cracks have shown to be a viable solution for increasing fatigue life in steel hydraulic structures (SHS). Although several studies have been conducted to evaluate the use of FRP for retrofitting metal alloys and the promising potential of such has been well-demonstrated, the application has never been implemented in underwater steel structures. This Coastal and Hydraulics Engineering Technical Note presents the implementation of FRP patches to repair fatigue cracks at Old Hickory Lock and Dam miter gate.
4
Goeckeritz, Joel, Nathan Schank, Ryan L Wood, Beverly L Roeder, and Alonzo D Cook. Use of Urinary Bladder Matrix Conduits in a Rat Model of Sciatic Nerve Regeneration after Nerve Transection Injury. Science Repository, December 2022. http://dx.doi.org/10.31487/j.rgm.2022.03.01.
Повний текст джерелаАнотація:
Previous research has demonstrated the use of single-channel porcine-derived urinary bladder matrix (UBM) conduits in segmental-loss, peripheral nerve repairs as comparable to criterion-standard nerve autografts. This study aimed to replicate and expand upon this research with additional novel UBM conduits and coupled therapies. Fifty-four Wistar Albino rats were divided into 6 groups, and each underwent a surgical neurectomy to remove a 7-millimeter section of the sciatic nerve. Bridging of this nerve gap and treatment for each group was as follows: i) reverse autograft—the segmented nerve was reversed 180 degrees and used to reconnect the proximal and distal nerve stumps; ii) the nerve gap was bridged via a silicone conduit; iii) a single-channel UBM conduit; iv) a multi-channel UBM conduit; v) a single-channel UBM conduit identical to group 3 coupled with fortnightly transcutaneous electrical nerve stimulation (TENS); vi) or, a multi-channel UBM conduit identical to group 4 coupled with fortnightly TENS. The extent of nerve recovery was assessed by behavioural parameters: foot fault asymmetry scoring measured weekly for six weeks; electrophysiological parameters: compound muscle action potential (CMAP) amplitudes, measured at weeks 0 and 6; and morphological parameters: total fascicle areas, myelinated fiber counts, fiber densities, and fiber sizes measured at week 6. All the above parameters demonstrated recovery of the test groups (3-6) as being either comparable or less than that of reverse autograft, but none were shown to outperform reverse autograft. As such, UBM conduits may yet prove to be an effective treatment to repair relatively short segmental peripheral nerve injuries, but further research is required to demonstrate greater efficacy over nerve autografts.
5
Goeckeritz, Joel, Nathan Schank, Ryan L Wood, Beverly L Roeder, and Alonzo D Cook. Use of Urinary Bladder Matrix Conduits in a Rat Model of Sciatic Nerve Regeneration after Nerve Transection Injury. Science Repository, December 2022. http://dx.doi.org/10.31487/j.rgm.2022.03.01.sup.
Повний текст джерелаАнотація:
Previous research has demonstrated the use of single-channel porcine-derived urinary bladder matrix (UBM) conduits in segmental-loss, peripheral nerve repairs as comparable to criterion-standard nerve autografts. This study aimed to replicate and expand upon this research with additional novel UBM conduits and coupled therapies. Fifty-four Wistar Albino rats were divided into 6 groups, and each underwent a surgical neurectomy to remove a 7-millimeter section of the sciatic nerve. Bridging of this nerve gap and treatment for each group was as follows: i) reverse autograft—the segmented nerve was reversed 180 degrees and used to reconnect the proximal and distal nerve stumps; ii) the nerve gap was bridged via a silicone conduit; iii) a single-channel UBM conduit; iv) a multi-channel UBM conduit; v) a single-channel UBM conduit identical to group 3 coupled with fortnightly transcutaneous electrical nerve stimulation (TENS); vi) or, a multi-channel UBM conduit identical to group 4 coupled with fortnightly TENS. The extent of nerve recovery was assessed by behavioural parameters: foot fault asymmetry scoring measured weekly for six weeks; electrophysiological parameters: compound muscle action potential (CMAP) amplitudes, measured at weeks 0 and 6; and morphological parameters: total fascicle areas, myelinated fiber counts, fiber densities, and fiber sizes measured at week 6. All the above parameters demonstrated recovery of the test groups (3-6) as being either comparable or less than that of reverse autograft, but none were shown to outperform reverse autograft. As such, UBM conduits may yet prove to be an effective treatment to repair relatively short segmental peripheral nerve injuries, but further research is required to demonstrate greater efficacy over nerve autografts.
6
Wright, Adam, Marija Milacic, Karen Rothfels, Joel Weiser, Quang Trinh, Bijay Jassal, Robin Haw, and Lincoln Stein. Evaluating the Predictive Accuracy of Reactome's Curated Biological Pathways. Reactome, November 2022. http://dx.doi.org/10.3180/poster/20221109wright.
Повний текст джерелаАнотація:
Reactome is a database of human biological pathways manually curated from the primary literature and peer-reviewed by experts. To evaluate the utility of Reactome pathways for predicting functional consequences of genetic perturbations, we compared predictions of perturbation effects based on Reactome pathways against published empirical observations. Ten cancer-relevant Reactome pathways, representing diverse biological processes such as signal transduction, cell division, DNA repair, and transcriptional regulation, were selected for testing. For each pathway, root input nodes and key pathway outputs were defined. We then used pathway-diagram-derived logic graphs to predict, either by inspection by biocurators or using a novel algorithm MP-BioPath, the effects of bidirectional perturbations (upregulation/activation or downregulation/inhibition) of single root inputs on the status of key outputs. These predictions were then compared to published empirical tests.
7
Lazor, Robert B. DTRS56-03-T-0011 Validation of Sleeve Weld Integrity and Workmanship Level Development. Chantilly, Virginia: Pipeline Research Council International, Inc. (PRCI), July 2006. http://dx.doi.org/10.55274/r0012038.
Повний текст джерелаАнотація:
This project was initiated to support a methodology for conducting an engineering assessment to determine the tolerable dimensions of flaw indications at full encirclement repair sleeve welds. The work described herein has been undertaken to validate the stresses estimated in finite element analysis (FEA) models against actual in-service loading conditions experienced at reinforcing sleeves. This project was intended to prove the feasibility of the concept and to provide details that could be incorporated into a future guidance note on sleeve installation procedures. The following general tasks were undertaken: (1) Collection of full-scale structural behavior data during the sleeve installation process and during line operation;, (2) Calibration of a sleeve weld finite element model against field data; and (3) Demonstration of the model as a design tool.
8
Bruce. PR-186-104504-R01 Guidelines to Address Pipeline Construction Quality Issues. Chantilly, Virginia: Pipeline Research Council International, Inc. (PRCI), February 2013. http://dx.doi.org/10.55274/r0010400.
Повний текст джерелаАнотація:
The objective of this project was to develop guidelines pertaining to these issues and how they should be addressed in the field. A review of recent incidents involving girth weld failures in newly-constructed pipelines indicate that all incidents involved production welds in pipelines constructed using conventional techniques (i.e., using cellulosic-coated electrodes) � particularly welds at wall thickness transitions � and repair and tie-in welds made using cellulosic-coated electrodes in pipelines otherwise constructed using mechanized gas-metal arc welding. None of the recent failures involved mechanized gas-metal arc welds. Many of these failures were attributed, at least in part, to hydrogen-assisted cracking and high stresses. A review of the factors related to hydrogen cracking in modern pipeline girth welds indicates that managing weld hydrogen levels and the stresses acting on these welds is the most appropriate strategy for controlling the risk of hydrogen-assisted cracking, which became the primary focus of this project.
9
Swankie, Martin, and Andrews. L51641 Evaluate NDT Methods for Welds in Service. Chantilly, Virginia: Pipeline Research Council International, Inc. (PRCI), March 1990. http://dx.doi.org/10.55274/r0010626.
Повний текст джерелаАнотація:
The inspection of welds made onto in-service pipelines, which are made primarily for attaching branch connections and repair sleeves, has been the subject of much concern in recent years. The difficulties associated with the inspection of these welds have long been recognized and, historically, the amount of inspection given to such welds has been small. The inspection of welds joining various appurtenances to pipelines is hampered for a number of reasons. The joint geometries can vary considerably, but none of them are particularly suited to detailed inspection. Surface techniques, such as magnetic particle and liquid-penetrant testing, rely on the flaws being at or near the surface, and this is not necessarily the case with the welds of concern. Radiography is difficult since it is not possible to place a radiation source within the pipeline. Ultrasonic inspection is, therefore, the only option if a full volumetric inspection is required. This is made difficult by the inherent complex geometries, and limited access to many of the welds. Welding on pipelines containing flowing, pressurized products results in very rapid cooling of the weld metal and heat-affected-zone regions, significantly increasing the risk of cracking. The use of high hydrogen consumables (specifically EXX10 SMAW electrodes) adds considerably to the risk The probability of discontinuities forming during welding on in-service pipelines is therefore considerably greater than for pipelines that do not contain flowing products. The goal of the present work was to evaluate existing techniques, and to develop and verify improved methodsfor inspection of such welds. In the first phase of this program, welded assemblies that contain realistic examples of discontinuities that occur in practice were produced In the second phase, the reliability of existing nondestructive testing methods were evaluated along with the reliability of novel nondestructive testing systems. The overall objectives of these first two phases were to evaluate the accuracy and reliability of nondestructive testing methods currently applied to welds made onto in-service pipelines, and to assess the improvement possible with methods that are more advanced, but so far have had limited application to these welds. The objective for the Phase III continuation of this project is to demonstrate the accuracy and reliability of nondestructive testing methods using procedures that are optimized based on the knowledge acquired in the first two phases.
10
Mazzoni, Silvia, Nicholas Gregor, Linda Al Atik, Yousef Bozorgnia, David Welch, and Gregory Deierlein. Probabilistic Seismic Hazard Analysis and Selecting and Scaling of Ground-Motion Records (PEER-CEA Project). Pacific Earthquake Engineering Research Center, University of California, Berkeley, CA, November 2020. http://dx.doi.org/10.55461/zjdn7385.
Повний текст джерелаАнотація:
This report is one of a series of reports documenting the methods and findings of a multi-year, multi-disciplinary project coordinated by the Pacific Earthquake Engineering Research Center (PEER) and funded by the California Earthquake Authority (CEA). The overall project is titled “Quantifying the Performance of Retrofit of Cripple Walls and Sill Anchorage in Single-Family Wood-Frame Buildings,” henceforth referred to as the “PEER–CEA Project.” The overall objective of the PEER–CEA Project is to provide scientifically based information (e.g., testing, analysis, and resulting loss models) that measure and assess the effectiveness of seismic retrofit to reduce the risk of damage and associated losses (repair costs) of wood-frame houses with cripple wall and sill anchorage deficiencies as well as retrofitted conditions that address those deficiencies. Tasks that support and inform the loss-modeling effort are: (1) collecting and summarizing existing information and results of previous research on the performance of wood-frame houses; (2) identifying construction features to characterize alternative variants of wood-frame houses; (3) characterizing earthquake hazard and ground motions at representative sites in California; (4) developing cyclic loading protocols and conducting laboratory tests of cripple wall panels, wood-frame wall subassemblies, and sill anchorages to measure and document their response (strength and stiffness) under cyclic loading; and (5) the computer modeling, simulations, and the development of loss models as informed by a workshop with claims adjustors. This report is a product of Working Group 3 (WG3), Task 3.1: Selecting and Scaling Ground-motion records. The objective of Task 3.1 is to provide suites of ground motions to be used by other working groups (WGs), especially Working Group 5: Analytical Modeling (WG5) for Simulation Studies. The ground motions used in the numerical simulations are intended to represent seismic hazard at the building site. The seismic hazard is dependent on the location of the site relative to seismic sources, the characteristics of the seismic sources in the region and the local soil conditions at the site. To achieve a proper representation of hazard across the State of California, ten sites were selected, and a site-specific probabilistic seismic hazard analysis (PSHA) was performed at each of these sites for both a soft soil (Vs30 = 270 m/sec) and a stiff soil (Vs30=760 m/sec). The PSHA used the UCERF3 seismic source model, which represents the latest seismic source model adopted by the USGS [2013] and NGA-West2 ground-motion models. The PSHA was carried out for structural periods ranging from 0.01 to 10 sec. At each site and soil class, the results from the PSHA—hazard curves, hazard deaggregation, and uniform-hazard spectra (UHS)—were extracted for a series of ten return periods, prescribed by WG5 and WG6, ranging from 15.5–2500 years. For each case (site, soil class, and return period), the UHS was used as the target spectrum for selection and modification of a suite of ground motions. Additionally, another set of target spectra based on “Conditional Spectra” (CS), which are more realistic than UHS, was developed [Baker and Lee 2018]. The Conditional Spectra are defined by the median (Conditional Mean Spectrum) and a period-dependent variance. A suite of at least 40 record pairs (horizontal) were selected and modified for each return period and target-spectrum type. Thus, for each ground-motion suite, 40 or more record pairs were selected using the deaggregation of the hazard, resulting in more than 200 record pairs per target-spectrum type at each site. The suites contained more than 40 records in case some were rejected by the modelers due to secondary characteristics; however, none were rejected, and the complete set was used. For the case of UHS as the target spectrum, the selected motions were modified (scaled) such that the average of the median spectrum (RotD50) [Boore 2010] of the ground-motion pairs follow the target spectrum closely within the period range of interest to the analysts. In communications with WG5 researchers, for ground-motion (time histories, or time series) selection and modification, a period range between 0.01–2.0 sec was selected for this specific application for the project. The duration metrics and pulse characteristics of the records were also used in the final selection of ground motions. The damping ratio for the PSHA and ground-motion target spectra was set to 5%, which is standard practice in engineering applications. For the cases where the CS was used as the target spectrum, the ground-motion suites were selected and scaled using a modified version of the conditional spectrum ground-motion selection tool (CS-GMS tool) developed by Baker and Lee [2018]. This tool selects and scales a suite of ground motions to meet both the median and the user-defined variability. This variability is defined by the relationship developed by Baker and Jayaram [2008]. The computation of CS requires a structural period for the conditional model. In collaboration with WG5 researchers, a conditioning period of 0.25 sec was selected as a representative of the fundamental mode of vibration of the buildings of interest in this study. Working Group 5 carried out a sensitivity analysis of using other conditioning periods, and the results and discussion of selection of conditioning period are reported in Section 4 of the WG5 PEER report entitled Technical Background Report for Structural Analysis and Performance Assessment. The WG3.1 report presents a summary of the selected sites, the seismic-source characterization model, and the ground-motion characterization model used in the PSHA, followed by selection and modification of suites of ground motions. The Record Sequence Number (RSN) and the associated scale factors are tabulated in the Appendices of this report, and the actual time-series files can be downloaded from the PEER Ground-motion database Portal (https://ngawest2.berkeley.edu/)(link is external).