نتایج جستجو برای: data plane

تعداد نتایج: 2509176  

Journal: :IEEE/ACM Transactions on Networking 2015

A. Asadi E. Afsharid Gh.R. Ghodrati Amiri, S.M. Pourhoseini Nejad Z. Tabrizian

This paper uses a PSOPC model based non-destructive damage identification procedure using frequency and modal data. The objective function formulation for the minimization problem is based on the frequency changes. The method is demonstrated by using a cantilever beam, four-bay plane truss and two-bay two-story plane frame with different scenarios. In this study, the modal data are provided nume...

Journal: :Monthly Notices of the Royal Astronomical Society 2014

Journal: :Computer Communication Review 2022

High-speed programmable switches have emerged as a promising building block for developing performant data-plane applications. In this paper, we argue that the resource constraints and programming model of hardware led to developers adopting problematic design patterns, whose security implications are not widely understood. We bridge gap by identifying major challenges common pitfalls in switch...

Journal: :ACM Transactions on Architecture and Code Optimization 2022

Programmable network data planes have extended the capabilities of packet processing in devices by allowing custom pipelines and agnostic processing. While a variety applications can be implemented on current programmable planes, there are significant constraints due to hardware limitations. One way meet these is optimizing plane programs. Program optimization achieved specializing code that le...

B Singh Baljeet Singh,

The analysis of rotational effect on the characteristics of plane waves propagating in a half space of generalized thermo-piezoelectric medium is presented in context of linear theory of thermo-piezoelectricity including Coriolis and centrifugal forces. The governing equations for a rotating generalized thermo-piezoelectric medium are formulated and solved for plane wave solutions to show the p...

vspace{0.2cm}In this paper, we design a data structure for the following problem. Let $pi$ be an $x$-monotone trajectory with $n$ vertices in the plane and $epsilon >0$. We show how to preprocess $pi$ and $epsilon$ into a data structure such that for any horizontal query segment $Q$ in the plane, one can quickly determine the minimal continuous fraction of $pi$ whose Fr{'e}chet and Hausdo...

Journal: :Proceedings on Privacy Enhancing Technologies 2016

Journal: :Journal of Research of the National Institute of Standards and Technology 2010

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید