Neural-Like Growing Networks in Intelligent System of Recognition of Images

The neural-like growing networks used in the intelligent system of recognition of images are under consideration in this paper. All operations made over the image on a pre-design stage and also classification and storage of the information about the images and their further identification are made extremely by mechanisms of neural-like networks without usage of complex algorithms requiring considerable volumes of calculus. At the conforming hardware support the neural network methods allow considerably to increase the effectiveness of the solution of the given class of problems, saving a high accuracy of result and high level of response, both in a mode of training, and in a mode of identification

アルツハイマー病における微小管関連蛋白質タウの異常蓄積の細胞生物学的制御に関する研究

筑波大学 (University of Tsukuba)201

Symbolic Analysis of Large-Scale Networks

A new approach to the problem of symbolic circuit analysis of large-scale circuits is presented in this report. The methodology has been implemented in a computer program called SCAPP (Symbolic Circuit Analysis Program with Partitioning). The method solves the problem by utilizing a hierarchical network approach and the sequence of expressions concept rather than a topological approach and the single expression idea which have dominated symbolic analysis in the past. The method employs further modifications to the modified nodal analysis (MNA) technique by allowing ideal opamps in the matrix formulation process and introducing the reduced modified analysis matrix (RMNA). The analysis algorithm is most efficient when network partitioning is used. A node-tearing binary partitioning algorithm based on the concepts of loop index and tearing index is also presented. The partitioning technique is very suitable for the hierarchical network analysis approach

Combinatorial Optimization

This report summarizes the meeting on Combinatorial Optimization where new and promising developments in the field were discussed. Th

Optimization, Design, and Analysis of Flexible-Grid Optical Networks with Physical-Layer Constraints

The theme of this thesis is the optimization, design, and analysis of flexible-grid optical networks that are constrained by physical-layer impairments (PLIs). We consider three flexible-grid network scenarios. The networks in the first class are static nonlinear transparent backbone networks where physical-layer resources are allocated to each traffic demand. The networks in the second class are traffic-variable nonlinear translucent backbone networks where regenerator sites are necessary to recover optical signals from the accumulated noise in long-distance transmission. The third class is data-center networks based on optical spatial division multiplexing. Within each class, our focus is primarily on an efficient and balanced allocation of network resources. Both optimization formulations and heuristic algorithms are proposed for each class. The contributions of this thesis can thus be categorized into three topics, as outlined below.First, we consider the optimization of network resources in the presence of PLI. The PLI between optical connections is characterized by the Gaussian noise (GN) model and incorporated into resource allocation algorithms. As an example, for a link-level optical communication system, the spectrum usage can be reduced by roughly up to 22% by accurately modelling the PLIs and assigning proper modulation formats and spectrum to optical connections. For resource allocation in the network level, the power spectral density of each optical connection is optimized in addition to the previously mentioned resources.As a second topic, the design of flexible-grid optical networks is studied. Specifically, we consider the regenerator location problem in traffic-variable translucent backbone networks. Due to the constantly changing traffic, the PLIs suffered by optical connections are also stochastic and, thus, have to be handled from a probabilistic perspective. A statistical network assessment process is used to characterize the noise distributions suffered by optical connections on each link, based on which a heuristic algorithm is proposed to select a set of regenerator sites with the minimum blocking probability.Finally, we study the trade-off between the blocking probability and total throughput in the modular data center networks (DCNs) based on different optical spatial division multiplexing switching schemes. This performance trade-off is caused by the coexistence of traffic demands with extremely different data rates and number of requests in DCNs. A heuristic resource allocation algorithm is proposed to enable flexible tuning of the objective function and achieve a balanced network performance

Hardware node for sensing temperature and humidity in a Mutiprotocol wireless sensor network (WSN)

En este proyecto presentamos un enfoque novedoso para una red de sensores inalámbricos de tecnología múltiple y protocolo (MTPWSN) para el monitoreo ambiental. Este enfoque utiliza múltiples tecnologías de red y protocolos para presentar un sistema más estable y una red más grande. Finalmente, un experimento comparativo para la WSN y cada una de las tecnologías que emplea fueron realizado. El experimento final fue una configuración para una red de sensores inalámbricos de tecnología avanzada. Esta configuración tenía un promedio de 95.5% de la recepción de paquetes no corruptos y se confirmaron 2.04% de paquetes dañados. El experimento concluyó con menos del 0.5% de la pérdida del paquete para una prueba de 8 horas.In this project we presented a novel approach to a Multi Technology and Protocol Wireless Sensor Network (MTPWSN) for environmental monitoring. This approach uses multiple networking technologies and protocols to present a more stable and larger network. Finally, a comparative experiment for the WSN and each of the technologies that it employs were performed. The final experiment was a set up for a working multi technology wireless sensor network. This set up had an average of 95.5% of uncorrupted package reception and were confirmed 2.04% of corrupted packages. The experiment concluded on less than 0.5% of package loss for an 8-hour trial.Magíster en Ingeniería ElectrónicaMaestrí

Z-Numbers-Based Approach to Hotel Service Quality Assessment

In this study, we are analyzing the possibility of using Z-numbers for measuring the service quality and decision-making for quality improvement in the hotel industry. Techniques used for these purposes are based on consumer evalu- ations - expectations and perceptions. As a rule, these evaluations are expressed in crisp numbers (Likert scale) or fuzzy estimates. However, descriptions of the respondent opinions based on crisp or fuzzy numbers formalism not in all cases are relevant. The existing methods do not take into account the degree of con- fidence of respondents in their assessments. A fuzzy approach better describes the uncertainties associated with human perceptions and expectations. Linguis- tic values are more acceptable than crisp numbers. To consider the subjective natures of both service quality estimates and confidence degree in them, the two- component Z-numbers Z = (A, B) were used. Z-numbers express more adequately the opinion of consumers. The proposed and computationally efficient approach (Z-SERVQUAL, Z-IPA) allows to determine the quality of services and iden- tify the factors that required improvement and the areas for further development. The suggested method was applied to evaluate the service quality in small and medium-sized hotels in Turkey and Azerbaijan, illustrated by the example

Switching techniques for broadband ISDN

The properties of switching techniques suitable for use in broadband networks have been investigated. Methods for evaluating the performance of such switches have been reviewed. A notation has been introduced to describe a class of binary self-routing networks. Hence a technique has been developed for determining the nature of the equivalence between two networks drawn from this class. The necessary and sufficient condition for two packets not to collide in a binary self-routing network has been obtained. This has been used to prove the non-blocking property of the Batcher-banyan switch. A condition for a three-stage network with channel grouping and link speed-up to be nonblocking has been obtained, of which previous conditions are special cases. A new three-stage switch architecture has been proposed, based upon a novel cell-level algorithm for path allocation in the intermediate stage of the switch. The algorithm is suited to hardware implementation using parallelism to achieve a very short execution time. An array of processors is required to implement the algorithm The processor has been shown to be of simple design. It must be initialised with a count representing the number of cells requesting a given output module. A fast method has been described for performing the request counting using a non-blocking binary self-routing network. Hardware is also required to forward routing tags from the processors to the appropriate data cells, when they have been allocated a path through the intermediate stage. A method of distributing these routing tags by means of a non-blocking copy network has been presented. The performance of the new path allocation algorithm has been determined by simulation. The rate of cell loss can increase substantially in a three-stage switch when the output modules are non-uniformly loaded. It has been shown that the appropriate use of channel grouping in the intermediate stage of the switch can reduce the effect of non-uniform loading on performance