Gradient index (GRIN) lenses are used both in imaging and beam shaping optical systems. Usually, to design a GRIN lens system, we would find the equivalent lens effective focal length and the principal planes position...
详细信息
ISBN:
(纸本)0819451487
Gradient index (GRIN) lenses are used both in imaging and beam shaping optical systems. Usually, to design a GRIN lens system, we would find the equivalent lens effective focal length and the principal planes position. then if we design an imaging system the Newton formula gives the image position or, if we design a beam shaping system the Kogelnik's ABCD law gives the Gaussian beam waist size and position. the Hamilton's phase plane approach gives the same results as these sets of formulas, but is more spectacular and clearer. Hamilton's phase plane approach gives a vivid and clear illustration of GRIN lens imaging and beam shaping properties and does not require substitution by an equivalent lens. Hamilton's phase plane approach allows easy derivation of transparent and simple direct formulas for a GRIN lens created image and beam transformation, including Gaussian beams and multimode fiber beams. these formulas and graphical illustrations facilitate solving, and give a clearer understanding, of practical problems.
the proceedings contain 13 papers. the special focus in this conference is on theoretical Computer Science. the topics include: A Survey on the Classic Active Measurement Methods for IPv6;deriving Security Protocols B...
ISBN:
(纸本)9789811618765
the proceedings contain 13 papers. the special focus in this conference is on theoretical Computer Science. the topics include: A Survey on the Classic Active Measurement Methods for IPv6;deriving Security Protocols Based on Protocol Derivation System;An Offloading Strategy Based on RSU Cooperation for Vehicular Edge computing System;algorithm Design through the Optimization of Reuse-Based Generation;an Improved Firefly Algorithm for Software Defect Prediction;semi-online algorithms for Hierarchical Scheduling on three Parallel Machines with a Buffer Size of 1;GDAssister: Graphic Design Assistant System with Optimal Algorithm of Associated Rule Mining;late Fusion Multi-view Clustering with Learned Consensus Similarity Matrix;minimal Residual Based Iterative Methods and Its Parallel Implementation for Sparse Linear systems;a Simple yet Effective Unsupervised Adversarial Example Generation Framework for Vulnerability Assessment on Deep Learning;application of Graph Neural Network in Automatic Text Summarization.
Water distribution systems are comprised of a variety of different components that must be monitored in order to combat crises as effectively as possible. In particular, the subsystemsthat monitor the different compo...
详细信息
Unobtrusive capturing of program execution traces in real-time is crucial in debugging cyber-physical systems. However, tracing even limited program segments is often cost-prohibitive, requiring wide trace ports and l...
详细信息
ISBN:
(纸本)9781605589039
Unobtrusive capturing of program execution traces in real-time is crucial in debugging cyber-physical systems. However, tracing even limited program segments is often cost-prohibitive, requiring wide trace ports and large on-chip trace buffers. this paper introduces a new cost-effective technique for capturing and compressing program execution traces in real time. It uses branch predictor-like structures in the trace module to losslessly compress the traces. this approach results in high compression ratios because it only has to transmit misprediction events to the software debugger. Coupled with an effective variable encoding scheme, our technique requires merely 0.036 bits/instruction of trace port bandwidth (a 28-fold improvement over the commercial state-of-the-art) at a cost of roughly 5,200 logic gates.
Capturing program and data traces during program execution unobtrusively in real-time is crucial in debugging and testing of cyber-physical systems. However, tracing a complete program unobtrusively is often cost-proh...
详细信息
ISBN:
(纸本)9781605589039
Capturing program and data traces during program execution unobtrusively in real-time is crucial in debugging and testing of cyber-physical systems. However, tracing a complete program unobtrusively is often cost-prohibitive, requiring large on-chip trace buffers and wide trace ports. Whereas program execution traces can be efficiently compressed in hardware, compression of data address and data value traces is much more challenging due to limited redundancy. In this paper we describe two hardware-based filtering techniques for data traces: cache first-access tracking for load data values and data address filtering using partial register-file replay. the results of our experimental analysis indicate that the proposed filtering techniques can significantly reduce the size of the data traces (similar to 5-20 times for the load data value trace, depending on the data cache size;and similar to 5 times for the data address trace) at the cost of rather small hardware structures in the trace module.
the work is devoted to the development of methods and algorithms for forecasting of helicopters turboshaft engines technical state in flight modes based on neural network technology. Methods of probability theory and ...
详细信息
computing today is shifting from hosting services in servers owned by individual organizations to data centres providing resources to a number of organizations on a shared infrastructure. Managing such a data centre p...
详细信息
the transformation of speech to words is not necessary to emulate human linguistic performance in some contexts. A large vocabulary continuous speech recognition (LVCSR) system can perform more accurately with a sylla...
the transformation of speech to words is not necessary to emulate human linguistic performance in some contexts. A large vocabulary continuous speech recognition (LVCSR) system can perform more accurately with a syllable-based, as opposed to a word-based, language model. this accuracy can be further enhanced by the addition of a concept model, where a concept is an equivalence class of words and phrases.
the proceedings contain 31 papers. the special focus in this conference is on theoretical Computer Science. the topics include: Une extension aux mots infinis de la notion de transduction rationnelle;algebraic and ope...
ISBN:
(纸本)9783540119739
the proceedings contain 31 papers. the special focus in this conference is on theoretical Computer Science. the topics include: Une extension aux mots infinis de la notion de transduction rationnelle;algebraic and operational semantics of exceptions and errors;the expected number of nodes and leaves at level k in ordered trees;complexity theory on real numbers and functions;a multifit algorithm for uniform multiprocessor scheduling;analysis of polynomial approximation algorithms for constraint expressions;heuristics for minimum edge length rectangular partitions of rectilinear figures;an axiomatic approach to semantics of specification languages;efficiency of universal parallel computers;a Monte Carlo factoring algorithm with finite storage;coroutines and processes in block structured languages;a general scheme for some deterministically parsable grammars and their strong equivalents;a decidability result about sufficient-completeness of axiomatically specified abstract data types;two remarks on the power of counting;some operations and transductions that preserve rationality;on algebras of computation sequences and proofs of equivalence of operational and denotational semantics;sur les morphismes qui engendrent des mots infinis ayant des facteurs prescrits;the equivalence problem for N.T.S. languages is deoidable;weakest expressible preconditions: A new tool for proving completeness results about Hoare calculi;a hierarchy of sets of infinite trees;theory of concurrency control;maintaining order in a generalized linked list;periodic versus arbitrary tessellations of the plane using polyominos of a single type;interprocedural data flow systems;on the crossing-free, rectangular embedding of weighted graphs in the plane;discreteness, K-density and D-continuity of occurrence nets.
暂无评论