نتایج جستجو برای: multiple assignments method
تعداد نتایج: 2289054 فیلتر نتایج به سال:
Numerous cryptographic algorithms (ElGamal, Rabin, RSA, NTRU etc) require multiple computations of modulo multiplicative inverses. This paper describes and validates a new algorithm, called the Enhanced Euclid Algorithm, for modular multiplicative inverse (MMI). Analysis of the proposed algorithm shows that it is more efficient than the Extended Euclid algorithm (XEA). In addition, if a MMI doe...
BACKGROUND Controlling the false discovery rate is important when testing multiple hypotheses. To enhance the detection capability of a false discovery rate control test, we applied the likelihood ratio-based multiple testing method in neuroimage data and compared the performance with the existing methods. METHODS We analysed the performance of the likelihood ratio-based false discovery rate ...
The concept of assignments was introduced in [GGK99] as a method for extracting geometric information about group actions on manifolds from combinatorial data encoded in the infinitesimal orbit-type stratification. In this paper we will answer in the affirmative a question posed in [GGK99] by showing that the equivariant cohomology ring of M is to a large extent determined by this data.
Lab Assignments Instrumentation Labs: Name of Lab Assignment: Lab 1 Introductory Experiments and Linear Circuits I [1] Lab 2 Linear Circuits II [2] Lab 3 Semiconductor Diodes [3] Lab 4 JFET Circuits I [4] Lab 5 JFET Circuits II [5] Lab 6 Op Amps I [6] Lab 7 Op Amps II [7] Lab 8 Op Amps III [8] Lab 9 LabVIEW Programming [9] Lab 10 Analog to Digital and Digital to Analog Conversion [10] Lab 11 Si...
Many spectral clustering algorithms have been proposed and successfully applied to many highdimensional applications. However, there are still two problems that need to be solved: 1) existing methods for obtaining the final clustering assignments may deviate from the true discrete solution, and 2) most of these methods usually have very high computational complexity. In this paper, we propose a...
Many pressing issues associated with control of cooperative intelligent systems involve challenges that arise from the difficulty of coordinating multiple task objectives in highly dynamic, unstructured environments. This chapter presents a multi-objective cooperative control methodology for a team of autonomous surface vehicles deployed with the purpose of protecting a waterway against hostile...
Chasing multiple mobile targets with multiple agents is important in several applications, such as computer games and police chasing scenarios. Existing approaches can compute optimal policies. However, they have a limited scalability, as they implement expensive minimax searches. We introduce a sub-optimal but scalable approach that assigns individual agents to individual targets and that can ...
Long-Term Evolution (LTE) systems will employ single carrier frequency division multiple access (SC-FDMA) for the uplink. Similar to the Orthogonal frequency-division multiple access (OFDMA) technology, SC-FDMA is sensitive to frequency offsets leading to intercarrier interference (ICI). In this paper, we propose a Kalman filter-based approach in order to mitigate ICI under high Doppler spread ...
Background: Professional ethics as a branch of ethical knowledge examines ethical assignments in a profession and its ethical issues and seeks to provide ways and guidelines that determine these assignments for individuals and professional groups. The overall purpose of this study was to determine the effectiveness of professional ethics training on job involvement and organizational commitment...
the robust coloring problem (rcp) is a generalization of the well-known graph coloring problem where we seek for a solution that remains valid when extra edges are added. the rcp is used in scheduling of events with possible last-minute changes and study frequency assignments of the electromagnetic spectrum. this problem has been proved as np-hard and in instances larger than 30 vertices, meta-...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید