3-D radiation problem solution in a far zone of an ideally conducting rectangular plane screen excited by an arbitrarily oriented electric dipole when changing the position of a screen has been obtained by the uniform...
详细信息
ISBN:
(纸本)078037391X
3-D radiation problem solution in a far zone of an ideally conducting rectangular plane screen excited by an arbitrarily oriented electric dipole when changing the position of a screen has been obtained by the uniform geometrical theory of diffraction method. Numerical comparative analysis of the radiation resistance of an dipole having different orientations depending on the screen displacement is carried out.
A large number of research groups across the world image and study the transport of various neuronal organelles of model organisms like C. elegans due to its clinical significance. These studies mainly characterize th...
详细信息
ISBN:
(纸本)9781479946655
A large number of research groups across the world image and study the transport of various neuronal organelles of model organisms like C. elegans due to its clinical significance. These studies mainly characterize the transport parameters such as flux (number of moving particles), velocity, pause time and pause frequency. The parameters are obtained from spatio-temporal maps called kymographs developed from time-lapse confocal microscopy movies of neurons. Due to in vivo nature of imaging, the kymographs developed have poor signal quality which makes their analysis difficult. We present a novel method to calculate the velocity of axonal transport. The method involves information fusion using a probabilistic framework followed by computer assisted extraction of spatially continuous structures. The method significantly reduces user effort and time.
The Cerebellar Model Articulation Controller (CMAC) neural network utilizes hypercube basis function domains, called cells. Because of the local nature of the cells the CMAC exhibits more weight drift (also called par...
详细信息
ISBN:
(纸本)9781509028733
The Cerebellar Model Articulation Controller (CMAC) neural network utilizes hypercube basis function domains, called cells. Because of the local nature of the cells the CMAC exhibits more weight drift (also called parameter drift or overlearning) compared to other types of neural networks. Typical robust weight update law modifications designed to prevent drift, like deadzone or e-modification, often sacrifice performance. This paper proposes a solution to this problem by using two CMACs in the control law, referred to as a performance CMAC and a robust CMAC. The performance CMAC reduces the state error to a small value during initial training, and then turns off its weight updates according to the output of a decision algorithm in order to capture the best performance. One proposed algorithm simply turns off the training of a weight after its cell has been activated for a certain period of time. A more advanced method, deemed the introspective algorithm, stops training in a cell when it appears that the average error measured over sequential cell domains is no longer being reduced by the weight update in a cell. The robust CMAC trains in parallel using a conservative e-modification algorithm, continuing to provide robustness after the performance CMAC has stopped training. Lyapunov methods show a guarantee of uniformly ultimately bounded signals. Simulations with a quadrotor helicopter demonstrate the superior performance of the proposed method over e-modification, deadzone, and a PID control.
Summary form only given. Static program analysis suffers from a fundamental trade-off between precision and scalability, and the analyses that scale to the largest programs are generally not the most precise methods k...
详细信息
ISBN:
(纸本)1424404215
Summary form only given. Static program analysis suffers from a fundamental trade-off between precision and scalability, and the analyses that scale to the largest programs are generally not the most precise methods known. This talk describes how recent advances in algorithms for solving instances of Boolean satisfiability (SAT) can be exploited to relax this trade-off, resulting in analyses that are both more precise and more scalable than existing techniques, as well as how these improved capabilities might be used in verification of properties of large systems
Up till now there does not exist an easy, mobile mechanism that allows to easily capture, recognize and count defined, multiple objects that are visible in surroundings of the user. For this purpose, feature detectors...
详细信息
ISBN:
(纸本)9781479958498
Up till now there does not exist an easy, mobile mechanism that allows to easily capture, recognize and count defined, multiple objects that are visible in surroundings of the user. For this purpose, feature detectors (such as SIFT, SURF or BRISK) are utilized to create a database of products box images and extracted keypoints are stored. Existing algorithms based on keypoints analysis do not allow to identify multiple identical logos, due to the fact that a homography calculated on found keypoints can span two or more objects and the result then can be skewed. In this paper a solution to this problem will be shown, that by using a sliding window that joins multiple found keypoints into individual objects, it is possible to correctly detect multiple identical objects. In this paper preliminary results of a mobile framework that allows recognition and counting of visible products in surroundings of the user will be presented. visual shelf monitoring product cover logo recognition keypoints detection mobile devices
By softwarizing traditional dedicated hardware based functions to virtualized network functions (VNFs) that can run on standard commodity servers, network function virtualization (NFV) technology promises high efficie...
详细信息
ISBN:
(纸本)9781538627044
By softwarizing traditional dedicated hardware based functions to virtualized network functions (VNFs) that can run on standard commodity servers, network function virtualization (NFV) technology promises high efficiency, flexibility and scalability. To NFV service providers, one primary concern is to maximize network throughput and reduce service time. To reach this goal, two main challenges should be tackled: 1) how to schedule the unpredictable and burst network flows;2) how to fairly allocate resources between various flows with different resource requirements. In this paper, we are motivated to investigate a throughput maximization problem with joint consideration of fairness between multiple flows using a discrete time queuing model. By taking advantages of Lyapunov optimization techniques, we propose a low-complexity online distributed algorithm that can achieve arbitrary optimal utility with different fairness levels by tuning the fairness bias. The high efficiency of our proposal is validated by both theoretical analysis and extensive simulation studies.
We pose a network-wide scheduling problem for cellular wireless networks in which users are capable of being served by several schedulers on the downlink, though not jointly. We present a distributed algorithm, with l...
详细信息
ISBN:
(纸本)9781457705953
We pose a network-wide scheduling problem for cellular wireless networks in which users are capable of being served by several schedulers on the downlink, though not jointly. We present a distributed algorithm, with limited communication across servers, that solves this problem optimally, in that it gives the network-wide proportional fair solution. An idealized version is presented first, in which all users are capable of being served by all schedulers and in which all the decision-making takes place among the schedulers alone. A practical version is also presented, in which users play a role in choosing their servers and servers decide how to allocate resources to the users that choose them. The practical version can achieve the same optimum as the idealized one and gives gains up to 60% in typical network deployments. This version can be implemented on any wireless technology to achieve optimal network scheduling. We have focused particularly on LTE, HSPA and 1xEV-DO and the first commercial deployment will soon occur on the 1xEV-DO system, based on the 3GPP2 standard, under the rubric of 'Smart Networks.'
In this paper, we propose a video extraction algorithm directly in compressed domain for low cost and fast content access to those compressed video data via MPEGs. Extensive experiments show that such extracted images...
详细信息
ISBN:
(纸本)0769519717
In this paper, we propose a video extraction algorithm directly in compressed domain for low cost and fast content access to those compressed video data via MPEGs. Extensive experiments show that such extracted images and videos not only maintain well-preserved content features, but also illustrate reasonable quality in terms of both PSNR values and visual inspection. In cases, where video processing tasks do not necessarily require full resolution pixel data such as browsing, pattern recognition, and object tracking in surveillance applications, the proposed algorithm will provide superior performance in terms of computing efficiency, under the context that millions of video frames need to be accessed, yet they are stored in compressed format.
Nelder-Mead algorithm (NMA) is the best-known algorithm for multidimensional optimization without involving derivative computations. Due to the simplicity in implementation and the fast convergent property of NMA, it ...
详细信息
ISBN:
(纸本)9781479951116
Nelder-Mead algorithm (NMA) is the best-known algorithm for multidimensional optimization without involving derivative computations. Due to the simplicity in implementation and the fast convergent property of NMA, it is widely used in the fields of statistics, engineering, physics and medical sciences. In practice, when objective function is complicated, the optimization procedure requires a lot of computation efforts, leading to a time-consuming process. This work introduces a NMA solver engine fully implemented on FPGA hardware and performs design space exploration to provide various solutions suitable for FPGA device.
NP-hard combinatorial optimization algorithms are often characterized by their approximation ratios. In real world applications, the resilience of algorithms to input fluctuations and to modelling errors pose importan...
详细信息
ISBN:
(纸本)9781509025299
NP-hard combinatorial optimization algorithms are often characterized by their approximation ratios. In real world applications, the resilience of algorithms to input fluctuations and to modelling errors pose important robustness requirements. This work suggests a provable algorithmic regularization and validation strategy based on posterior agreement. The strategy regularizes algorithms and ranks them according to the informativeness of their output given noisy input. To illustrate this strategy, we develop methods to evaluate the posterior distribution of the Goemans-Williamson's MAXCUT algorithm using semidefinite programming relaxation (MAXCUT-SDP, [1]). Experimental comparison with typical greedy MAXCUT algorithms shows that MAXCUT-SDP with the best known approximation ratio generalizes worse than greedy MAXCUT algorithms under high noise level.
暂无评论