Relevant bibliographies by topics / Optical complexity

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Books
  4. Book chapters
  5. Conference papers
  6. Reports

Academic literature on the topic 'Optical complexity'

Author: Grafiati
Published: 4 June 2021
Last updated: 13 February 2022

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Optical complexity.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Optical complexity"

1

Bishop, AlanR, and DavidD Awschalom. "Optical and magnetic materials unraveling complexity." Current Opinion in Solid State and Materials Science 3, no. 2 (April 1998): 169–70. http://dx.doi.org/10.1016/s1359-0286(98)80083-1.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Louri, Ahmed, and Arthur Post. "Complexity analysis of optical-computing paradigms." Applied Optics 31, no. 26 (September 10, 1992): 5568. http://dx.doi.org/10.1364/ao.31.005568.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Caulfield, H. J. "Space-time complexity in optical computing." Multidimensional Systems and Signal Processing 2, no. 4 (November 1991): 373–78. http://dx.doi.org/10.1007/bf01937172.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Angelsky, O. V., P. P. Maksimyak, and T. O. Perun. "Optical correlation method for measuring spatial complexity in optical fields." Optics Letters 18, no. 2 (January 15, 1993): 90. http://dx.doi.org/10.1364/ol.18.000090.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Wang Huiqin, 王惠琴, 肖博 Xiao Bo, 贾非 Jia Fei, 曹明华 Cao Minghua, and 孙剑锋 Sun Jianfeng. "Low-Complexity Optical Space-Time Trellis Code." Acta Optica Sinica 36, no. 8 (2016): 0806008. http://dx.doi.org/10.3788/aos201636.0806008.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Rondoni, Lamberto, M. R. K. Ariffin, Renuganth Varatharajoo, Sayan Mukherjee, Sanjay K. Palit, and Santo Banerjee. "Optical complexity in external cavity semiconductor laser." Optics Communications 387 (March 2017): 257–66. http://dx.doi.org/10.1016/j.optcom.2016.11.011.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Yao, Eric, Francesco Papoff, and Gian-Luca Oppo. "Characterisation of spatio-temporal complexity in optical experiments." Optics Communications 155, no. 1-3 (October 1998): 73–78. http://dx.doi.org/10.1016/s0030-4018(98)00369-1.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Borneman, Joshua D., Evie Malaia, and Ronnie B. Wilbur. "Motion characterization using optical flow and fractal complexity." Journal of Electronic Imaging 27, no. 05 (July 11, 2018): 1. http://dx.doi.org/10.1117/1.jei.27.5.051229.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Knight, P. L. "Nonlinear Dynamics and Spatial Complexity in Optical Systems." Journal of Modern Optics 42, no. 1 (January 1995): 255. http://dx.doi.org/10.1080/09500349514550241.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Maggio, Gabriel N., Mario R. Hueda, and Oscar E. Agazzi. "Reduced Complexity MLSD Receivers for Nonlinear Optical Channels." IEEE Photonics Technology Letters 26, no. 4 (February 2014): 398–401. http://dx.doi.org/10.1109/lpt.2013.2295200.

Full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Optical complexity"

1

Saad, Mohamed Elsayed Mostafa Luo Zhi-Quan. "Design of optical networks: performance bounds, complexity and algorithms /." *McMaster only, 2004.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
2

Lim, Dong Sung. "Phase singularities and spatial-temporal complexity in optical fibres." Thesis, Heriot-Watt University, 1995. http://hdl.handle.net/10399/772.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Li, Yunxi. "Study of low-complexity modal multiplexing for optical communication links." Thesis, University of Cambridge, 2015. https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.708925.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Post, Arthur David 1954. "Complexity of optical computing paradigms: Computational implications and a suggested improvement." Thesis, The University of Arizona, 1992. http://hdl.handle.net/10150/291592.

Full text
Abstract:
Optical computing has been suggested as a means of achieving a high degree of parallelism for both scientific and symbolic applications. While a number of implementations of logic operations have been forwarded, all have some characteristic which prevents their direct extension to functions of a large number of input bits. This paper will analyze several of these implementations and demonstrate that all these implementations require some measure of the system (area, space-bandwidth product, or time) to grow exponentially with the number of inputs. We will then suggest an implementation whose complexity is not greater than the best theoretical realization of a boolean function. We will demonstrate the optimality of the realization, to within a constant multiple, for digital optical computing systems realized by bulk space-variant elements.
APA, Harvard, Vancouver, ISO, and other styles
5

Barrami, Fatima. "Low-complexity direct-detection optical OFDM systems for high data rate communications." Thesis, Université Grenoble Alpes (ComUE), 2015. http://www.theses.fr/2015GREAT057/document.

Full text
Abstract:
Une approche pour augmenter le débit par longueur d'onde, est d'utiliser la modulation DMT (Discrete Multitone) à haute efficacité spectrale. Le travail présenté dans cette thèse se focalise principalement sur l'optimisation de la consommation en puissance et le coût de la DMT, qui présentent des obstacles majeurs à son industrialisation. Dans ce cadre, nous avons tout d'abord développé des nouvelles techniques permettant d'exclure la symétrie Hermitienne des modulations DMT, réduisant ainsi considérablement la consommation en puissance et le coût du système. Nous avons ensuite proposé un algorithme de compression linéaire asymétrique permettant de réduire la puissance optique de la modulation DMT avec une complexité modérée. Un nouveau modèle comportemental du VCSEL basé sur la caractéristique quasi-statique a été également développé. Nous avons enfin validé expérimentalement les techniques que nous avons proposées. Plusieurs résultats de simulations et de mesures sont ainsi présentés
A possible approach to maximize the data rate per wavelength, is to employ the high spectral efficiency discrete multitone (DMT) modulation. The work presented in this thesis mainly focuses on optimizing the power consumption and cost of DMT, that are the major obstacles to its market development. Within this context, we have first developed novel techniques permitting to discard the use of Hermitian symmetry in DMT modulations, thus significantly reducing the power consumption and the system cost. We have next proposed an asymmetric linear companding algorithm permitting to reduce the optical power of conventional DCO-OFDM modulation with a moderate complexity. A new VCSEL behavioural model based on the use of the VCSEL quasi-static characteristic was also developed to accurately evaluate the VCSEL impact on DMT modulations. Finally, we have built an experimental system to experimentally validate our proposed techniques. Several simulations and measurement results are then provided
APA, Harvard, Vancouver, ISO, and other styles
6

Nadal, Reixats Laia. "Design and implementation of low complexity adaptive optical OFDM systems for software-defined transmission in elastic optical networks." Doctoral thesis, Universitat Politècnica de Catalunya, 2014. http://hdl.handle.net/10803/284714.

Full text
Abstract:
Due to the increasing global IP traffic and the exponential growing demand for broadband services, optical networks are experimenting significant changes. Advanced modulation formats are being implemented at the Digital Signal Processing (DSP) level as key enablers for high data rate transmission. Whereas in the network layer, flexi Dense Wavelength-Division Multiplexing (DWDM) grids are being investigated in order to efficiently use the optical spectrum according to the traffic demand. Enabling these capabilities makes high data rate transmission more feasible. Hence, introducing flexibility in the system is one of the main goals of this thesis. Furthermore, minimizing the cost and enhancing the Spectral Efficiency (SE) of the system are two crucial issues to consider in the transceiver design. This dissertation investigates the use of Optical Orthogonal Frequency Division Multiplexing (O-OFDM) based either on the Fast Fourier Transform (FFT) or the Fast Hartley Transform (FHT) and flexi-grid technology to allow high data rate transmission over the fiber. Different cost-effective solutions for Elastic Optical Networks (EON) are provided. On the one hand, Direct Detection (DD) systems are investigated and proposed to cope with present and future traffic demand. After an introduction to the principles of OFDM and its application in optical systems, the main problems of such modulation is introduced. In particular, Peak-to-Average Power Ratio (PAPR) is presented as a limitation in OFDM systems, as well as clipping and quantization noise. Hence, PAPR reduction techniques are proposed to mitigate these impairments. Additionally, Low Complexity (LC) PAPR reduction techniques based on the FHT have also been presented with a simplified DSP. On the other hand, loading schemes have also been introduced in the analyzed system to combat Chromatic Dispersion (CD) when transmitting over the optical link. Moreover, thanks to Bit Loading (BL) and Power Loading (PL), flexible and software-defined transceivers can be implemented maximizing the spectral efficiency by adapting the data rate to the current demand and the actual network conditions. Specifically, OFDM symbols are created by mapping the different subcarriers with different modulation formats according to the channel profile. Experimental validation of the proposed flexible transceivers is also provided in this dissertation. The benefits of including loading capabilities in the design, such as enabling high data rate and software-defined transmission, are highlighted.
Degut al creixement del tràfic IP i de la demanda de serveis de banda ampla, les xarxes òptiques estan experimentant canvis significatius. Els formats avançats de modulació, implementats a nivell de processat del senyal digital, habiliten la transmissió a alta velocitat. Mentre que a la capa de xarxa, l'espectre òptic es dividit en ranures flexibles ocupant l'ample de banda necessari segons la demanda de tràfic. La transmissió a alta velocitat és fa més tangible un cop habilitades totes aquestes funcionalitats. D'aquesta manera un dels principals objectius d'aquesta tesis es introduir flexibilitat al sistema. A demés, minimitzar el cost i maximitzar l'eficiència espectral del sistema són també dos aspectes crucials a considerar en el disseny del transmissor i receptor. Aquesta tesis investiga l'ús de la tecnologia Optical Orthogonal Frequency Division Multiplexing (OFDM) basada en la transformada de Fourier (FFT) i la de Hartley (FHT) per tal de dissenyar un sistema flexible i capaç de transmetre a alta velocitat a través de la fibra òptica. Per tant, es proposen diferent solucions de baix cost vàlides per a utilitzar en xarxes òptiques elàstiques. En primer lloc, s'investiguen i es proposen sistemes basats en detecció directa per tal de suportar la present i futura demanda. Després d'una introducció dels principis d' OFDM i la seva aplicació als sistemes òptics, s'introdueixen alguns dels problemes d'aquesta modulació. En particular, es presenten el Peak-to-Average Power Ratio (PAPR) i els sorolls de clipping i de quantizació com a limitació dels sistemes OFDM. S'analitzen tècniques de reducció de PAPR per tal de reduir l'impacte d'aquests impediments. També es proposen tècniques de baixa complexitat per a reduir el PAPR basades en la FHT. Finalment, s'utilitzen algoritmes d'assignació de bits i de potència, Bit Loading (BL) i Power Loading (PL), per tal de combatre la dispersió cromàtica quan es transmet pel canal òptic. Amb la implementació dels algoritmes de BL i PL, es poden dissenyar transmissors i receptors flexibles adaptant la velocitat a la demanda del moment i a les actuals condicions de la xarxa. En particular, els símbols OFDM es creen mapejant cada portadora amb un format de modulació diferent segons el perfil del canal. El sistema és validat experimentalment mostrant les prestacions i els beneficis d'incloure flexibilitat per tal de facilitar la transmissió a alta velocitat i cobrir les necessitats de l'Internet del futur
Debido al crecimiento del tráfico IP y de la demanda de servicios de banda ancha, las redes ópticas están experimentando cambios significativos. Los formatos avanzados de modulación, implementados a nivel de procesado de la señal digital, habilitan la transmisión a alta velocidad. Mientras que en la capa de red, el espectro óptico se divide en ranuras flexibles ocupando el ancho de banda necesario según la demanda de tráfico. La transmisión a alta velocidad es más tangible una vez habilitadas todas estas funcionalidades. De este modo uno de los principales objetivos de esta tesis es introducir flexibilidad en el sistema. Además, minimizar el coste y maximizar la eficiencia espectral del sistema son también dos aspectos cruciales a considerar en el diseño del transmisor y receptor. Esta tesis investiga el uso de la tecnologia Optical Orthogonal Frequency Division Multiplexing (OFDM) basada en la transformada de Fourier (FFT) y en la de Hartley (FHT) con tal de diseñar un sistema flexible y capaz de transmitir a alta velocidad a través de la fibra óptica. Por lo tanto, se proponen distintas soluciones de bajo coste válidas para utilizar en redes ópticas elásticas. En primer lugar, se investigan y se proponen sistemas basados en detección directa con tal de soportar la presente y futura demanda. Después de una introducción de los principios de OFDM y su aplicación en los sistemas ópticos, se introduce el principal problema de esta modulación. En particular se presentan el Peak-to-Average Power Ratio (PAPR) y los ruidos de clipping y cuantización como limitaciones de los sistemas OFDM. Se analizan técnicas de reducción de PAPR con tal de reducir el impacto de estos impedimentos. También se proponen técnicas de baja complejidad para reducir el PAPR basadas en la FHT. Finalmente, se utilizan algoritmos de asignación de bits y potencia, Bit Loading (BL) y Power Loading (PL), con tal de combatir la dispersión cromática cuando se transmite por el canal óptico. Con la implementación de los algoritmos de BL y PL, se pueden diseñar transmisores y receptores flexibles adaptando la velocidad a la demanda del momento y a las actuales condiciones de la red. En particular, los símbolos OFDM se crean mapeando cada portadora con un formato de modulaci_on distinto según el perfil del canal. El sistema se valida experimentalmente mostrando las prestaciones y los beneficios de incluir flexibilidad con tal de facilitar la transmisión a alta velocidad y cubrir las necesidades de Internet del futuro.
APA, Harvard, Vancouver, ISO, and other styles
7

Bilbeisi, Hana. "Time-slotted scheduling for agile all-photonics networks : performance and complexity." Thesis, McGill University, 2007. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=112558.

Full text
Abstract:
Schedulers in optical switches are still electronic, the performance of these units has a significant impact on the performance of the network and could form a bottleneck in high speed networks, such as AAPN. Four time-slotted scheduling algorithms are investigated in this study, PIM, iSlip, PHM and Adapted-SRA. The study addresses the performance of AAPN for each of the algorithms, and evaluates the hardware complexity, estimating the running time of the algorithms. Performance measures were collected from an OPNET model, designed to emulate AAPN. Furthermore, hardware complexity and timing constraints were evaluated through hardware simulations, for iSlip, and through analysis for the rest of the algorithms. iSlip confirmed its feasibility by meeting the 10us timing constraint set by AAPN. The study revealed the superiority of iSlip and PHM over PIM and Adapted-SRA.
APA, Harvard, Vancouver, ISO, and other styles
8

Sachs, Antonio de Campos. "Rede auto-organizada utilizando chaveamento de pacotes ópticos." Universidade de São Paulo, 2011. http://www.teses.usp.br/teses/disponiveis/3/3141/tde-05082011-152444/.

Full text
Abstract:
A tecnologia de chaveamento de pacotes ópticos comumente utiliza componentes muito complexos, relegando sua viabilidade para o futuro. A utilização de pacotes ópticos, entretanto, é uma boa opção para melhorar a granularidade dos enlaces ópticos, bem como para tornar os processos de distribuição de banda muito mais eficientes e flexíveis. Esta tese propõe simplificações nas chaves ópticas que além de tornarem o pacote óptico viável para um futuro mais próximo, permitem montar redes ópticas complexas, com muitos nós, que operam de maneira auto-organizada. A rede proposta nesta tese não possui sinalização para reserva ou estabelecimento de caminho. As rotas são definidas pacote a pacote, em tempo real, durante o seu percurso, utilizando roteamento por deflexão. Com funções muito simples realizadas localmente, a rede ganha características desejáveis como: alta escalabilidade e eficiente sistema de proteção de enlace. Estas características desejáveis são tratadas como funções da rede que emergem de funções realizadas em cada um dos nós de rede individualmente. A tese apresenta um modelo analítico estatístico, validado por simulação, para caracterização da rede. No sistema de proteção contra falhas, os cálculos realizados para redes com até 256 nós mostram que o aumento do número médio de saltos ocorre apenas para destinos localizados no entorno da falha. Para demonstrar a viabilidade de construção de chave óptica rápida simplificada utilizando somente componentes já disponíveis no mercado foi montado um protótipo, que mostrou ter um tempo de chaveamento inferior a dois nanossegundos, sendo compatível com as operações de chaveamento de pacotes ópticos.
The Optical Packet Switching (OPS) technology usually involves complex and expensive components relegating its application viability to the future. Nevertheless the OPS utilization is a good option for improving the granularity at high bit rate transmissions, as well as for operation involving flexibility and fast bandwidth distribution. This thesis proposes simplifications on optical switching devices that besides getting closer future viability enable the deployment of highly scalable and self-organized complex network architecture. The proposed network operates without resources reservation or previous path establishment. The routes are defined packet-by-packet in a real time deflection routing procedure. With simple local functions the network starts to operate with desirable performance characteristics such as high scalability and automatic protection system. Those desirable performance characteristics are treated as Emerging Functions. For the network characterization it is presented a statistical analytical model validated by simulation. In the automatic protection functions investigation the results for a 256 nodes network showed that the mean number of hops enhancement occurs only around the failure neighborhood. To demonstrate the switch viability, a prototype was fabricated utilizing components already available in the market. The switching time obtained was below two nanoseconds showing compatibility with the optical packet switching technology.
APA, Harvard, Vancouver, ISO, and other styles
9

Sau, Ignasi. "Optimization in Graphs under Degree Constraints. Application to Telecommunication Networks." Phd thesis, Université de Nice Sophia-Antipolis, 2009. http://tel.archives-ouvertes.fr/tel-00429092.

Full text
Abstract:
La première partie de cette thèse s'intéresse au groupage de trafic dans les réseaux de télécommunications. La notion de groupage de trafic correspond à l'agrégation de flux de faible débit dans des conduits de plus gros débit. Cependant, à chaque insertion ou extraction de trafic sur une longueur d'onde il faut placer dans le noeud du réseau un multiplexeur à insertion/extraction (ADM). De plus il faut un ADM pour chaque longueur d'onde utilisée dans le noeud, ce qui représente un coût d'équipements important. Les objectifs du groupage de trafic sont d'une part le partage efficace de la bande passante et d'autre part la réduction du coût des équipements de routage. Nous présentons des résultats d'inapproximabilité, des algorithmes d'approximation, un nouveau modèle qui permet au réseau de pouvoir router n'importe quel graphe de requêtes de degré borné, ainsi que des solutions optimales pour deux scénarios avec trafic all-to-all: l'anneau bidirectionnel et l'anneau unidirectionnel avec un facteur de groupage qui change de manière dynamique. La deuxième partie de la thèse s'intéresse aux problèmes consistant à trouver des sous-graphes avec contraintes sur le degré. Cette classe de problèmes est plus générale que le groupage de trafic, qui est un cas particulier. Il s'agit de trouver des sous-graphes d'un graphe donné avec contraintes sur le degré, tout en optimisant un paramètre du graphe (très souvent, le nombre de sommets ou d'arêtes). Nous présentons des algorithmes d'approximation, des résultats d'inapproximabilité, des études sur la complexité paramétrique, des algorithmes exacts pour les graphes planaires, ainsi qu'une méthodologie générale qui permet de résoudre efficacement cette classe de problèmes (et de manière plus générale, la classe de problèmes tels qu'une solution peut être codé avec une partition d'un sous-ensemble des sommets) pour les graphes plongés dans une surface. Finalement, plusieurs annexes présentent des résultats sur des problèmes connexes.
APA, Harvard, Vancouver, ISO, and other styles
10

Von, Eden Elric Omar. "Optical arbitrary waveform generation using chromatic dispersion in silica fibers." Thesis, Atlanta, Ga. : Georgia Institute of Technology, 2007. http://hdl.handle.net/1853/24780.

Full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "Optical complexity"

1

Tsotsos, John Konstantine. Analyzing vision at the complexity level: Constrains on an architecture, an explanation for visual search performance, and computational justification for attentive processes. Toronto: University of Toronto, Dept. of Computer Science, 1987.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
2

1944-, Harrison R. G., and Uppal J. S, eds. Nonlinear dynamics and spatial complexity in optical systems: The Forty-first Scottish Universities' Summer School in Physics, Edinburgh, August 1992. Edinburgh, Scotland: The School, 1993.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
3

1949-, Recio T. (Tómas), and SpringerLink (Online service), eds. Automated Deduction in Geometry: 6th International Workshop, ADG 2006, Pontevedra, Spain, August 31-September 2, 2006. Revised Papers. Berlin, Heidelberg: Springer-Verlag Berlin Heidelberg, 2007.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
4

Debled-Rennesson, Isabelle. Discrete Geometry for Computer Imagery: 16th IAPR International Conference, DGCI 2011, Nancy, France, April 6-8, 2011. Proceedings. Berlin, Heidelberg: Springer Berlin Heidelberg, 2011.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
5

Liu, Derong. Advances in Neural Networks – ISNN 2011: 8th International Symposium on Neural Networks, ISNN 2011, Guilin, China, May 29–June 1, 2011, Proceedings, Part III. Berlin, Heidelberg: Springer Berlin Heidelberg, 2011.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
6

Liu, Derong. Advances in Neural Networks – ISNN 2011: 8th International Symposium on Neural Networks, ISNN 2011, Guilin, China, May 29–June 1, 2011, Proceedings, Part II. Berlin, Heidelberg: Springer Berlin Heidelberg, 2011.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
7

Liu, Derong. Advances in Neural Networks – ISNN 2011: 8th International Symposium on Neural Networks, ISNN 2011, Guilin, China, May 29–June 1, 2011, Proceedings, Part I. Berlin, Heidelberg: Springer Berlin Heidelberg, 2011.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
8

T, Tamir, Griffel Giora, and Bertoni Henry L, eds. Guided-wave optoelectronics: Device characterization, analysis, and design. New York: Plenum Press, 1995.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
9

Vitoria, Lobo Niels da, International Workshop on Statistical Techniques in Pattern Recognition (2008 : Orlando, Fla.), and International Association for Pattern Recognition, eds. Structural, syntactic, and statistical pattern recognition: Joint IAPR international workshop, SSPR & SPR 2008, Orlando, USA, December 4-6, 2008 : proceedings. Berlin: Springer, 2008.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
10

GbRPR 2011 (2011 Münster in Westfalen, Germany). Graph-based representations in pattern recognition: 8th IAPR-TC-15 International Workshop, GbRPR 2011, Münster, Germany, May 18-20, 2011, : proceedings. Berlin: Springer, 2011.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Book chapters on the topic "Optical complexity"

1

Naughton, Thomas J., and Damien Woods. "Optical Computing." In Computational Complexity, 2138–56. New York, NY: Springer New York, 2012. http://dx.doi.org/10.1007/978-1-4614-1800-9_135.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Huang, Shu. "Computational Complexity." In Optical Networks, 57–72. Boston, MA: Springer US, 2008. http://dx.doi.org/10.1007/978-0-387-74518-3_5.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Naughton, Thomas J., and Damien Woods. "Optical Computing." In Encyclopedia of Complexity and Systems Science, 6388–407. New York, NY: Springer New York, 2009. http://dx.doi.org/10.1007/978-0-387-30440-3_377.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Naughton, Thomas J., and Damien Woods. "Optical Computing." In Encyclopedia of Complexity and Systems Science, 1–26. Berlin, Heidelberg: Springer Berlin Heidelberg, 2015. http://dx.doi.org/10.1007/978-3-642-27737-5_377-3.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Caulfield, H. J. "Space Time Complexity in Optical Computing." In Optical Signal Processing, 19–24. Boston, MA: Springer US, 1991. http://dx.doi.org/10.1007/978-1-4615-4006-9_4.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Woods, Damien. "Optical Computing and Computational Complexity." In Lecture Notes in Computer Science, 27–40. Berlin, Heidelberg: Springer Berlin Heidelberg, 2006. http://dx.doi.org/10.1007/11839132_4.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Tomio, Lauro, F. K. Abdullaev, H. L. F. da Luz, and A. Gammal. "Stability of BEC Systems in Nonlinear Optical Lattices." In Nonlinear Science and Complexity, 165–72. Dordrecht: Springer Netherlands, 2011. http://dx.doi.org/10.1007/978-90-481-9884-9_21.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Obiso, Vincenzo, Oriol Jorba, Carlos Pérez García-Pando, and Marco Pandolfi. "Aerosol Intensive Optical Properties in the NMMB-MONARCH." In Springer Proceedings in Complexity, 413–19. Cham: Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-22055-6_66.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Jiang, Shengming. "Quantitative End-to-End Arguments: Complexity Estimation." In Future Wireless and Optical Networks, 125–32. London: Springer London, 2012. http://dx.doi.org/10.1007/978-1-4471-2822-9_8.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Gargano, Luisa, and Ugo Vaccaro. "Routing in All-Optical Networks: Algorithmic and Graph-Theoretic Problems." In Numbers, Information and Complexity, 555–78. Boston, MA: Springer US, 2000. http://dx.doi.org/10.1007/978-1-4757-6048-4_45.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Optical complexity"

1

Kogan, H., and I. Keslassy. "Optimal-Complexity Optical Router." In IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications. IEEE, 2007. http://dx.doi.org/10.1109/infcom.2007.88.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

McGarry, Michael P., and Elliott Gurrola. "FTTdp: ONU Complexity Reduction." In Optical Fiber Communication Conference. Washington, D.C.: OSA, 2014. http://dx.doi.org/10.1364/ofc.2014.tu3c.3.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Khanna, Amit, Yaojia Chen, Ari Novack, Yang Liu, Ran Ding, Tom Baehr-Jones, and Michael Hochberg. "Complexity Scaling in Silicon Photonics." In Optical Fiber Communication Conference. Washington, D.C.: OSA, 2017. http://dx.doi.org/10.1364/ofc.2017.th1b.3.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Tornatore, Massimo, Cristina Rottondi, Giuseppe Rizzelli, and Annalisa Morea. "Complexity and Flexible Grid Networks." In Optical Fiber Communication Conference. Washington, D.C.: OSA, 2014. http://dx.doi.org/10.1364/ofc.2014.w3a.1.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Hou, Zhe, and Florian Bociort. "Reducible complexity in lens design." In SPIE Optical Systems Design, edited by Laurent Mazuray, Rolf Wartmann, and Andrew P. Wood. SPIE, 2015. http://dx.doi.org/10.1117/12.2191364.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Kogan, H., and I. Keslassy. "Fundamental Complexity of Optical Systems." In IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications. IEEE, 2007. http://dx.doi.org/10.1109/infcom.2007.310.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Hansson, T., D. Modotto, and S. Wabnitz. "Complex temporal dynamics in optical cavities." In 2015 Spatiotemporal Complexity in Nonlinear Optics (SCNO). IEEE, 2015. http://dx.doi.org/10.1109/scno.2015.7324038.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Carrillo, Paula, Hari Kalva, and Tao Pin. "Low complexity H.264 video encoding." In SPIE Optical Engineering + Applications, edited by Andrew G. Tescher. SPIE, 2009. http://dx.doi.org/10.1117/12.829400.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Ok, Jiheon, Seong Wook Han, Mielikainen Jarno, and Chulhee Lee. "Low complexity pixel-based halftone detection." In SPIE Optical Engineering + Applications. SPIE, 2011. http://dx.doi.org/10.1117/12.895089.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Meucci, R., S. De Nicola, K. Al Naimee, S. F. Abdalah, and F. T. Arecchi. "Polarization spatial dynamics in a transverse multimode CO2 laser with optical feedback." In 2012 Complexity in Engineering (COMPENG). IEEE, 2012. http://dx.doi.org/10.1109/compeng.2012.6242957.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Optical complexity"

1

Reif, John H. Computational Complexity and Efficiency in Electro-Optical Computing Systems. Fort Belvoir, VA: Defense Technical Information Center, June 1990. http://dx.doi.org/10.21236/ada229195.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Harrison, Robert G. Dynamical Instabilities, Chaos And Spatial Complexity In Fundamental Nonlinear Optical Interactions. Fort Belvoir, VA: Defense Technical Information Center, May 1994. http://dx.doi.org/10.21236/ada291223.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Meyer, Tom, Alfred Hubler, and Norman Packard. Reduction of Complexity by Optimal Driving Forces. Fort Belvoir, VA: Defense Technical Information Center, June 1989. http://dx.doi.org/10.21236/ada245834.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Kaplow, Louis. A Model of the Optimal Complexity of Rules. Cambridge, MA: National Bureau of Economic Research, January 1992. http://dx.doi.org/10.3386/w3958.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Luo, Zhi-Quan. Complexity Analysis and Algorithms for Optimal Resource Allocation in Wireless Networks. Fort Belvoir, VA: Defense Technical Information Center, September 2012. http://dx.doi.org/10.21236/ada579191.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Zhang, Ye. Final Report: Optimal Model Complexity in Geological Carbon Sequestration: A Response Surface Uncertainty Analysis. Office of Scientific and Technical Information (OSTI), January 2018. http://dx.doi.org/10.2172/1417199.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Dynarski, Susan, and Judith Scott-Clayton. The Cost of Complexity in Federal Student Aid: Lessons from Optimal Tax Theory and Behavioral Economics. Cambridge, MA: National Bureau of Economic Research, May 2006. http://dx.doi.org/10.3386/w12227.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Gaponenko, Artiom, and Andrey Golovin. Electronic magazine with rating system of an estimation of individual and collective work of students. Science and Innovation Center Publishing House, October 2017. http://dx.doi.org/10.12731/er0043.06102017.

Full text
Abstract:
«The electronic magazine with rating system of an estimation of individual and collective work of students» (EM) is developed in document Microsoft Excel with use of macros. EM allows to automate all the calculated operations connected with estimation of amount scored by students in each form of the current control. EM provides automatic calculation of rating of the student with reflection of a maximum quantity of the points received in given educational group. The rating equal to “1” is assigned to the student who has got a maximum quantity of points for the certain date. For the other students the share of their points in this maximum size is indicated. The choice of an estimation is made in an alphabetic format according to requirements of the European translation system of test units for the international recognition of results of educational outcomes (ECTS - European Credit Transfer System), by use of a corresponding scale of an estimation. The list of students is placed on the first page of magazine and automatically displayed on all subsequent pages. For each page of magazine the optimal size of document printing is set with automatic enter of current date and time. Owing to accounting rate of complexity of task EM is the universal technical tool which can be used for any subject matter.
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Optical complexity' for particular source types:
Journal articles Dissertations / Theses Books
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography