Network fault identification is an important network management function, which is closely related to fault management and has an impact on other network management functions such as configuration management, and performance management. This paper investigates fault surveillance and fault identification mechanisms for a transparent optical network in which data travels optically from the source node to the destination node without going through any optical-to-electrical (O/E) or electrical-to-optical (E/O) conversion. Mechanisms and algorithms are proposed to detect and isolate faults such as fiber cuts, laser, receiver, or router failures. These mechanisms allow nonintrusive device monitoring without requiring any prior knowledge of the actual protocols being used in the data transmission 相似文献
In the wake of growing importance for quality and the need to reduce inspection costs simultaneously, the need for a scientific method of selecting an optimum inspection strategy for coordinate measuring machine (CMM) based inspection has become very important. The inspection error resulting from CMM inspection is greatly affected by the profile irregularities and the sampling strategy, which includes sample size, sampling methods, and algorithms used for form evaluation. This paper describes a system that can recommend an optimal inspection plan based on the needs of the user. A design of experiments (DOE) based approach is used to relate the inspection error with sampling strategies. Surface irregularities are included in the form of lobes formed on the profile. A new two-way model is proposed that works in both directions between the sampling strategy and the performance metrics. The results indicate that the number of lobes and the sampling method used have little impact on the inspection error, while the sample size and form evaluation algorithms have a significant influence. An inspection plan advisor is presented, which provides an inspection plan based on the estimated shape and acceptable measurement error. 相似文献
Motivated by field data which showed a large number of link changeovers and incidences of link oscillations between in-service and out-of-service states in common channel signalling (CCS) networks, a number of analyses of the link error monitoring procedures in the SS7 protocol were performed by the authors. This paper summarizes the results obtained thus far and include the following: (a) results of an exact analysis of the performance of the error monitoring procedures under both random and bursty errors; (b) a demonstration that there exists a range of error rates within which the error monitoring procedures of SS7 may induce frequent changeovers and changebacks; (c) an analysis of the performance of the SS7 level-2 transmission protocol to determine the tolerable error rates within which the delay requirements can be met; (d) a demonstration that the tolerable error rate depends strongly on various link and traffic characteristics, thereby implying that a single set of error monitor parameters will not work well in all situations; and (e) some recommendations on a customizable/adaptable scheme of error monitoring with a discussion on their implementability. These issues may be particularly relevant in the presence of anticipated increases in SS7 traffic due to widespread deployment of advanced intelligent network (AIN) and personal communications service (PCS) as well as for developing procedures for high-speed SS7 links currently under consideration by standards bodies 相似文献
The mechanical, electrical, and thermal expansion properties of carbon nanotube(CNT)-based silver and silver–palladium(10:1, w/w) alloy nanocomposites are reported. To tailor the properties of silver, CNTs were incorporated into a silver matrix by a modified molecular level-mixing process. CNTs interact weakly with silver because of their non-reactive nature and lack of mutual solubility. Therefore, palladium was utilized as an alloying element to improve interfacial adhesion. Comparative microstructural characterizations and property evaluations of the nanocomposites were performed. The structural characterizations revealed that decorated type-CNTs were dispersed, embedded, and anchored into the silver matrix. The experimental results indicated that the modification of the silver and silver–palladium nanocomposite with CNT resulted in increases in the hardness and Young's modulus along with concomitant decreases in the electrical conductivity and the coefficient of thermal expansion(CTE). The hardness and Young's modulus of the nanocomposites were increased by 30%?40% whereas the CTE was decreased to 50%-60% of the CTE of silver. The significantly improved CTE and the mechanical properties of the CNT-reinforced silver and silver–palladium nanocomposites are correlated with the intriguing properties of CNTs and with good interfacial adhesion between the CNTs and silver as a result of the fabrication process and the contact action of palladium as an alloying element. 相似文献
Fine-grained image search is one of the most challenging tasks
in computer vision that aims to retrieve similar images at the fine-grained
level for a given query image. The key objective is to learn discriminative
fine-grained features by training deep models such that similar images are
clustered, and dissimilar images are separated in the low embedding space.
Previous works primarily focused on defining local structure loss functions
like triplet loss, pairwise loss, etc. However, training via these approaches
takes a long training time, and they have poor accuracy. Additionally, representations learned through it tend to tighten up in the embedded space and
lose generalizability to unseen classes. This paper proposes a noise-assisted
representation learning method for fine-grained image retrieval to mitigate
these issues. In the proposed work, class manifold learning is performed
in which positive pairs are created with noise insertion operation instead
of tightening class clusters. And other instances are treated as negatives
within the same cluster. Then a loss function is defined to penalize when
the distance between instances of the same class becomes too small relative
to the noise pair in that class in embedded space. The proposed approach is
validated on CARS-196 and CUB-200 datasets and achieved better retrieval
results (85.38% recall@1 for CARS-196% and 70.13% recall@1 for CUB-200)
compared to other existing methods. 相似文献
Wireless communication networks have much data to sense, process, and transmit. It tends to develop a security mechanism to care for these needs for such modern-day systems. An intrusion detection system (IDS) is a solution that has recently gained the researcher’s attention with the application of deep learning techniques in IDS. In this paper, we propose an IDS model that uses a deep learning algorithm, conditional generative adversarial network (CGAN), enabling unsupervised learning in the model and adding an eXtreme gradient boosting (XGBoost) classifier for faster comparison and visualization of results. The proposed method can reduce the need to deploy extra sensors to generate fake data to fool the intruder 1.2–2.6%, as the proposed system generates this fake data. The parameters were selected to give optimal results to our model without significant alterations and complications. The model learns from its dataset samples with the multiple-layer network for a refined training process. We aimed that the proposed model could improve the accuracy and thus, decrease the false detection rate and obtain good precision in the cases of both the datasets, NSL-KDD and the CICIDS2017, which can be used as a detector for cyber intrusions. The false alarm rate of the proposed model decreases by about 1.827%.
The aggregate batch mixing problem determines the proportion (or relative masses) in which aggregate batches with different gradations are to be blended so as to achieve a target mix with a given gradation. As shown in previous studies, the gradation of a batch is not homogeneous and should be considered stochastic. Also, when batches are blended in the field there are random variations in the masses or proportions of individual batches in the mix. Assuming batch gradation and blend masses as stochastic implies that the notion of a mix (blend) satisfying the gradation of a target mix becomes stochastic. In such a framework, every mix has a reliability with which it satisfies the definition of the target mix. In addition, a mix is also required to satisfy various restrictions. This article presents an optimization formulation to determine the most reliable mix while satisfying restrictions on available quantity, budget, etc.相似文献
Presynaptic terminals contain several specialized compartments, which have been described by electron microscopy. We show in an identified Drosophila neuromuscular synapse that several of these compartments-synaptic vesicle clusters, presynaptic plasma membrane, presynaptic cytosol, and axonal cytoskeleton-labeled by specific reagents may be resolved from one another by laser scanning confocal microscopy. Using a panel of compartment-specific markers and Drosophila shibire(ts1) mutants to trap an intermediate stage in synaptic vesicle recycling, we have examined the localization and redistribution of dynamin within single synaptic varicosities at the larval neuromuscular junction. Our results suggest that dynamin is not a freely diffusible molecule in resting nerve terminals; rather, it appears localized to synaptic sites by association with yet uncharacterized presynaptic components. In shi(ts1) nerve terminals depleted of synaptic vesicles, dynamin is quantitatively redistributed to the plasma membrane. It is not, however, distributed uniformly over presynaptic plasmalemma; instead, fluorescence images show "hot spots" of dynamin on the plasma membrane of vesicle-depleted nerve terminals. We suggest that these dynamin-rich domains may mark the active zones for synaptic vesicle endocytosis first described at the frog neuromuscular junction. 相似文献
In recent years, evolutionary algorithms (EAs) have been extensively developed and utilized to solve multi-objective optimization problems. However, some previous studies have shown that for certain problems, an approach which allows for non-greedy or uphill moves (unlike EAs), can be more beneficial. One such approach is simulated annealing (SA). SA is a proven heuristic for solving numerical optimization problems. But owing to its point-to-point nature of search, limited efforts has been made to explore its potential for solving multi-objective problems. The focus of the presented work is to develop a simulated annealing algorithm for constrained multi-objective problems. The performance of the proposed algorithm is reported on a number of difficult constrained benchmark problems. A comparison with other established multi-objective optimization algorithms, such as infeasibility driven evolutionary algorithm (IDEA), Non-dominated sorting genetic algorithm II (NSGA-II) and multi-objective Scatter search II (MOSS-II) has been included to highlight the benefits of the proposed approach. 相似文献
The purpose of this paper is to establish a coupled coincidence point for a pair of commuting mappings in partially ordered complete metric spaces. We also present a result on the existence and uniqueness of coupled common fixed points. An example is given to support the usability of our results. 相似文献