Kooperativer Bibliotheksverbund

Berlin Brandenburg

and
and

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
Filter
  • Engineering
Type of Medium
Language
Year
  • 1
    Language: English
    In: Journal of Electromagnetic Waves and Applications, 13 June 2014, Vol.28(9), pp.1075-1084
    Description: The backscatter properties of millimeter wave radar in sand and dust storms have been addressed. An expression for signal attenuation of millimeter wave radar is derived in terms of visibility and frequency. The results show that the values calculated by the proposed model are in good agreement...
    Keywords: Sand and Dust Storms ; Backscattering ; Attenuation ; Millimeter ; Engineering ; Physics
    ISSN: 0920-5071
    E-ISSN: 1569-3937
    Source: Taylor & Francis (Taylor & Francis Group)
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 2
    Language: English
    In: Computers and Electrical Engineering, April 2013, Vol.39(3), pp.934-944
    Description: ► The shrinkage operates in the gradient domain. ► The scheme is formed in statistical sense. ► A new parameter tuning method for the Perona–Malik anisotropic diffusion is presented. In this paper, we develop a new adaptive image denoising algorithm in the presence of Gaussian noise. Because the proposed method operates in the gradient domain and is close to Wiener filter, it is named as gradient-based Wiener filter (GWF). Inspired by the Perona–Malik anisotropic diffusion (PMAD), the proposed algorithm is implemented by iterations. The parameters for the GWF are studied in full detail. At the same time, the tuning method of the gradient thresholding based on noise variance for PMAD is presented. Experimental results indicate the proposed algorithm achieves higher peak signal-to-noise ratio (PSNR) and better visual effect compared to related algorithms. On the other hand, the simulation results also show the tremendous power of the given parameter tuning method for PMAD.
    Keywords: Engineering
    ISSN: 0045-7906
    E-ISSN: 1879-0755
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 3
    In: Energy and Power Engineering, 2010, Vol.02(02), pp.122-126
    Description: The transformation of parameter tensors for anisotropic medium in different coordinate systems is derived. The electric field for a magnetized cold plasma sphere and the general expression of scattering field from anisotropic target are obtained. The functional relations of differential scattering cross section and the RCS for the magnetized plasma sphere are presented. Simulation results are in agree with that in the literatures, which shows the method used and results obtained are correct and the results provide a theoretical base for anisotropic target identification etc.
    Keywords: Engineering;
    ISSN: 1949-243X
    E-ISSN: 1947-3818
    Source: CrossRef
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 4
    Conference Proceeding
    Conference Proceeding
    Language: English
    In: Proceedings of the 12th ACM SIGMETRICS/PERFORMANCE joint international conference on measurement and modeling of computer systems, 11 June 2012, pp.379-380
    Description: Regular expression matching as the core packet inspection engine of network systems has long been striving to be both fast in matching speed (like DFA) and scalable in storage space (like NFA). Recently, ternary content addressable memory (TCAM) has been investigated as a promising way out, by implementing DFA using TCAM for regular express matching. In this paper, we present the first method for implementing NFA using TCAM. Through proper TCAM encoding, our method matches each input byte with one single TCAM lookup --- operating at precisely the same speed as DFA, while using a number of TCAM entries that can be close to NFA size. These properties make our method an important step along a new path --- TCAM-based NFA implementation --- towards the long-standing goal of fast and scalable regular expression matching.
    Keywords: Nfa ; Tcam ; Regular Expression Matching ; Engineering
    ISBN: 9781450310970
    ISBN: 1450310974
    ISSN: 01635999
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 5
    Language: English
    In: IEEE/ACM Transactions on Networking, August 2017, Vol.25(4), pp.2281-2294
    Description: Optical data center networks (DCNs) are becoming increasingly attractive due to their technological strengths compared with the traditional electrical networks. However, existing optical DCNs are either hard to scale, vulnerable to single point of failure, or provide limited network bisection bandwidth for many practical data center workloads. To this end, we present WaveCube, a scalable, fault-tolerant, high-performance optical DCN architecture. To scale, WaveCube removes MEMS,〈sup〉1〈/sup〉 a potential bottleneck, from its design. WaveCube is fault-tolerant, since it does not have single point of failure and there are multiple node-disjoint parallel paths between any pair of top-of-rack switches. WaveCube delivers high performance by exploiting multi-pathing and dynamic link bandwidth along the path. For example, our evaluation results show that, in terms of network bisection bandwidth, WaveCube outperforms prior optical DCNs by up to 400% and is 70%-85% of the ideal non-blocking network (ı.e., theoretical upper bound) under both realistic and synthetic traffic patterns. WaveCube's performance degrades gracefully under failures-it drops 20% even with 20% links cut. WaveCube also holds promise in practice-its wiring complexity is orders of magnitude lower than Fattree, BCube, and c-Through at scale, and its power consumption is 35% of them.
    Keywords: Optical Switches ; Bandwidth ; Optical Fiber Networks ; Micromechanical Devices ; Fault Tolerance ; Fault Tolerant Systems ; Ports (Computers) ; Data Center Networks ; Network Structure ; Optical Networking ; Engineering
    ISSN: 1063-6692
    E-ISSN: 1558-2566
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 6
    Language: English
    In: 2011 IEEE Nineteenth IEEE International Workshop on Quality of Service, June 2011, pp.1-3
    Description: The paper discusses the implementation of deterministic finite automaton (DFA) using ternary content addressable memory (TCAM) for regular expression matching. Regular expression matching is the foundation of many network functions including intrusion detection, worm detection, traffic analysis and so on, where known patterns such as worm fingerprints are characterized using regular expressions and searched in network traffic for pattern match. As the quantity and diversity of known patterns keep increasing, regular expression pattern sets have rapidly grown in both size and complexity, while having to be matched in network traffic at accelerating wire speeds. Fast and scalable regular expression matching, therefore, is fundamental to the development of practical network systems.Regular expression matching is carried out using either nondeterministic finite automaton (NFA) or deterministic finite automaton (DFA). The paper states that no existing method has been able to deflate exponentially growing DFA state space, without paying penalty on matching efficiency. Fast and scalable regular expression matching, where it takes merely a small constant number of memory accesses to match each input character and storage space growing linearly with pattern set size, remains an open problem calling for innovative research.
    Keywords: Doped Fiber Amplifiers ; Random Access Memory ; Encoding ; Pattern Matching ; Ions ; Solids ; Explosions ; Engineering
    ISBN: 9781457701047
    ISBN: 1457701049
    ISSN: 1548615X
    E-ISSN: 1548615X
    Source: IEEE Conference Publications
    Source: IEEE Xplore
    Source: IEEE Journals & Magazines 
    Source: IEEE eBooks
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 7
    Language: English
    In: Tribology Letters, 2013, Vol.52(1), pp.47-55
    Description: In the present paper, the influence of load and sliding speed on super-low friction of Nitinol 60 alloy was investigated experimentally using Nitinol 60 alloy pin sliding over GCr15 steel disk under castor oil lubrication. Super-low coefficient of friction (COF) of Nitinol 60 alloy was achieved at the stable state, corresponding to so-called superlubricity regime in the presence of castor oil. The experimental results indicate that sliding speed employed in the friction tests plays great roles in the lubrication behaviors of Nitinol 60 alloy. When the friction tests are executed from low sliding speed to high sliding speed, COF decreases at the initial stage and on the contrary, COF increases at the stable stage. However, with the increase in load, COF firstly increases and then decreases at the initial stage. COF is unstable but still super low and remains almost the same value at the stable stage. These phenomena are explained and discussed in viewpoint of the characteristics of castor oil during the friction tests. It is found that the influence of sliding speed on the lubrication behaviors of Nitinol 60 alloy under castor oil lubrication is more obvious than that of load due to the characteristics structure of castor oil, therefore maintaining appropriate level of sliding speed to achieve super-low friction of Nitinol 60 alloy.
    Keywords: Super-low friction ; Nitinol 60 alloy ; Castor oil ; Test parameters ; Lubrication behaviors
    ISSN: 1023-8883
    E-ISSN: 1573-2711
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 8
    Language: English
    In: Journal of Global Optimization, 2002, Vol.22(1), pp.365-375
    Description: We describe a linear-time algorithm for solving the molecular distance geometry problem with exact distances between all pairs of atoms. This problem needs to be solved in every iteration of general distance geometry algorithms for protein modeling such as the EMBED algorithm by Crippen and Havel ( Distance Geometry and Molecular Conformation , Wiley, 1988). However, previous approaches to the problem rely on decomposing an distance matrix or minimizing an error function and require O(n 2 ) to O( 3 ) floating point operations. The linear-time algorithm will provide a much more efficient approach to the problem, especially in large-scale applications. It exploits the problem structure and hence is able to identify infeasible data more easily as well.
    Keywords: Molecular distance geometry ; Protein structure determination ; Numerical linear algebra and optimization
    ISSN: 0925-5001
    E-ISSN: 1573-2916
    Source: Springer Science & Business Media B.V.
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 9
    Language: English
    In: Journal of Global Optimization, 2003, Vol.26(3), pp.321-333
    Description: Nuclear magnetic resonance (NMR) structure modeling usually produces a sparse set of inter-atomic distances in protein. In order to calculate the three-dimensional structure of protein, current approaches need to estimate all other “missing” distances to build a full set of distances. However, the estimation step is costly and prone to introducing errors. In this report, we describe a geometric build-up algorithm for solving protein structure by using only a sparse set of inter-atomic distances. Such a sparse set of distances can be obtained by combining NMR data with our knowledge on certain bond lengths and bond angles. It can also include confident estimations on some “missing” distances. Our algorithm utilizes a simple geometric relationship between coordinates and distances. The coordinates for each atom are calculated by using the coordinates of previously determined atoms and their distances. We have implemented the algorithm and tested it on several proteins. Our results showed that our algorithm successfully determined the protein structures with sparse sets of distances. Therefore, our algorithm reduces the need of estimating the “missing” distances and promises a more efficient approach to NMR structure modeling.
    Keywords: Molecular distance geometry ; Protein structure determination ; Numerical linear algebra and optimization
    ISSN: 0925-5001
    E-ISSN: 1573-2916
    Source: Springer Science & Business Media B.V.
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 10
    Language: English
    In: 30th IEEE International Performance Computing and Communications Conference, November 2011, pp.1-8
    Description: Multi-class network traffic classification is a fundamental function for network services and management. Support vector machine (SVM) based network traffic classification has recently attracted increasing interest, for its high accuracy and low training sample size requirement. However, to better fit applications with delay requirements, it is desirable to reduce the high computation cost of existing SVM-based traffic classifiers. In this paper, we propose a novel scheme for SVM-based traffic classification (called fuzzy tournament). Experiment results based on real network traffic traces show that our proposed scheme can reduce computation cost by as much as 7.65 times; in the mean time, misclassification ratio is consistently reduced by up to 2.35 times as well.
    Keywords: Support Vector Machines ; Training ; Games ; Equations ; Mathematical Model ; Electronic Mail ; Accuracy ; Engineering
    ISBN: 9781467300100
    ISBN: 1467300101
    ISSN: 10972641
    Source: IEEE Conference Publications
    Source: IEEE Xplore
    Source: IEEE Journals & Magazines 
    Source: IEEE eBooks
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
Close ⊗
This website uses cookies and the analysis tool Matomo. Further information can be found on the KOBV privacy pages