合同与报价系统 PB8开发，sysbase sql anywhere7 默认密码：user:admin password:admin ODBC设置为 Database=HxFirm UserId=tt ServerName=order LogId=tt
上传时间： 2017-03-17
上传用户：龙飞艇
this program is insertion_sort that writted with c++. this program get an array and sort it in order n^2.
标签： program this insertion_sort writted
上传时间： 2014-11-09
上传用户：rocketrevenge
This paper shows the development of a 1024-point radix-4 FFT VHDL core for applications in hardware signal processing, targeting low-cost FPGA technologies. The developed core is targeted into a Xilinx庐 Spartan鈩?3 XC3S200 FPGA with the inclusion of a VGA display interface and an external 16-bit data acquisition system for performance evaluation purposes. Several tests were performed in order to verify FFT core functionality, besides the time performance analysis highlights the core advantages over commercially available DSPs and Pentium-based PCs. The core is compared with similar third party IP cores targeting resourceful FPGA technologies. The novelty of this work is to provide a lowcost, resource efficient core for spectrum analysis applications.
标签： applications development hardware paper
上传时间： 2013-12-21
上传用户：jichenxi0730
It was proposed that perfect invisibility cloaks can be constructed for hiding objects from electromagnetic illumination (Pendry et al., Science 312, p. 1780). The cylindrical cloaks experimentally demonstrated (Schurig et al., Science 314, p. 997) and theoretically proposed (Cai et al., Nat. Photon. 1, p. 224) have however simplified material parameters in order to facilitate easier realization as well as to avoid infinities in optical constants. Here we show that the cylindrical cloaks with simplified material parameters inherently allow the zeroth-order cylindrical wave to pass through the cloak as if the cloak is made of a homogeneous isotropic medium, and thus visible. To all high-order cylindrical waves, our numerical simulation suggests that the simplified cloak inherits some properties of the ideal cloak, but finite scatterings exist.
标签： invisibility constructed proposed electrom
上传时间： 2013-12-18
上传用户：13215175592
A cylindrical wave expansion method is developed to obtain the scattering field for an ideal two-dimensional cylindrical invisibility cloak. A near-ideal model of the invisibility cloak is set up to solve the boundary problem at the inner boundary of the cloak shell. We confirm that a cloak with the ideal material parameters is a perfect invisibility cloak by systematically studying the change of the scattering coefficients from the near-ideal case to the ideal one. However, due to the slow convergence of the zeroth order scattering coefficients, a tiny perturbation on the cloak would induce a noticeable field scattering and penetration.
标签： cylindrical scattering expansion developed
上传时间： 2017-03-30
上传用户：lhc9102
In an electromagnetic cloak based on a transformation approach, reduced sets of material properties are generally favored due to their easier implementation in reality, although a seemingly inevitable drawback of undesired reflection exists in such cloaks. Here we suggest using high-order transformations to create smooth moduli at the outer boundary of the cloak, therefore completely eliminating the detrimental scattering within the limit of geometric optics. We apply this scheme to a non-magnetic cylindrical cloak and demonstrate that the scattered field is reduced substantially in a cloak with optimal quadratic transformation as compared to its linear counterpart.
标签： electromagnetic transformation properties approach
上传时间： 2017-03-30
上传用户：pkkkkp
In computer vision, sets of data acquired by sampling the same scene or object at different times, or from different perspectives, will be in different coordinate systems. Image registration is the process of transforming the different sets of data into one coordinate system. Registration is necessary in order to be able to compare or integrate the data obtained from different measurements. Image registration is the process of transforming the different sets of data into one coordinate system. To be precise it involves finding transformations that relate spatial information conveyed in one image to that in another or in physical space. Image registration is performed on a series of at least two images, where one of these images is the reference image to which all the others will be registered. The other images are referred to as target images.
标签： different computer acquired sampling
上传时间： 2013-12-28
上传用户：来茴
SA Encryption and Decryption using Matlab The program set contains thirteen files listed below. errormeg.fig errormsg.m helpmsg.fig helpmsg.m inputmsg.fig inputmsg.m mesgcut.m pro2.fig pro2.m rsacore.m readme.txt screenshot.gif In order to run the program please call pro2.m under Matlab 6.0 Environment. System Requirement Matlab version 6.0 and if necessary, Maple version 6.0 on any platform PentiumII 300 MHz or equivalent.
标签： Encryption Decryption contains thirteen
上传时间： 2017-04-06
上传用户：dreamboy36
1. It is located in the root directory - SecurityBuilderDemo.exe. Leave password box blank and click on Security button in order to Add/Remove users and set user rights. Once you entered Security dialog you may select your Supervisor password. 2. Click OK when finished configuring users. Don t forget to disable some features in order to see what happens with GUI elements - menus, and buttons.
标签： SecurityBuilderDemo directory password located
上传时间： 2014-01-23
上传用户：chongcongying
c pgm to find redundant paths in a graph.Many fault-tolerant network algorithms rely on an underlying assumption that there are possibly distinct network paths between a source-destination pair. Given a directed graph as input, write a program that uses depth-first search to determine all such paths. Note that, these paths are not vertex-disjoint i.e., the vertices may repeat but they are all edge-disjoint i.e., no two paths have the same edges. The input is the adjacency matrix of a directed acyclic graph and a pair(s) of source and destination vertices and the output should be the number of such disjoint paths and the paths themselves on separate lines. In case of multiple paths the output should be in order of paths with minimum vertices first. In case of tie the vertex number should be taken in consideration for ordering.
标签： fault-tolerant algorithms redundant underlyin
上传时间： 2013-12-18
上传用户：jkhjkh1982
