In this paper, we propose a new compact fourth-order accurate method for solving the two-dimensional fourth-order elliptic boundary value problem with third-order nonlinear derivative terms. We use only 9-point single computational cell in the scheme. The proposed method is then employed to solve Navier–Stokes equations of motion in terms of streamfunction–velocity formulation, and the lid-driven square cavity problem. We describe the derivation of the method in details and also discuss how our streamfunction–velocity formulation is able to handle boundary conditions in terms of normal derivatives. Numerical results show that the proposed method enables us to obtain oscillation-free high accuracy solution. 相似文献
In this paper, a novel pyramid coding based rate control scheme is proposed for video streaming applications constrained by a constant channel bandwidth. To achieve the target bit rate with the best quality, the initial quantization parameter (QP) is determined by the average spatio-temporal complexity of the sequence, its resolution and the target bit rate. Simple linear estimation models are then used to predict the number of bits that would be necessary to encode a frame for a given complexity and QP. The experimental results demonstrate that the proposed rate control scheme significantly outperforms the existing rate control scheme in the Joint Model (JM) reference software in terms of Peak Signal to Noise Ratio (PSNR) and consistent perceptual visual quality while achieving the target bit rate. Finally, the proposed scheme is validated through experimental evaluation over a miniature test-bed.
Interest point detection has a wide range of applications, such as image retrieval and object recognition. Given an image, many previous interest point detectors first assign interest strength to each image point using a certain filtering technique, and then apply non-maximum suppression scheme to select a set of interest point candidates. However, we observe that non-maximum suppression tends to over-suppress good candidates for a weakly textured image such as a face image. We propose a new candidate selection scheme that chooses image points whose zero-/first-order intensities can be clustered into two imbalanced classes (in size), as candidates. Our tests of repeatability across image rotations and lighting conditions show the advantage of imbalance oriented selection. We further present a new face recognition application—facial identity representability evaluation—to show the value of imbalance oriented selection. 相似文献
In this paper we consider the p-ary transitive reduction (TRp) problem where p>0 is an integer; for p=2 this problem arises in inferring a sparsest possible (biological) signal transduction network consistent with a set of
experimental observations with a goal to minimize false positive inferences even if risking false negatives. Special cases
of TRp have been investigated before in different contexts; the best previous results are as follows:
(1)
The minimum equivalent digraph problem, that correspond to a special case of TR1 with no critical edges, is known to be MAX-SNP-hard, admits a polynomial time algorithm with an approximation ratio of 1.617+ε for any constant ε>0 (Chiu and Liu in Sci. Sin. 4:1396–1400, 1965) and can be solved in linear time for directed acyclic graphs (Aho et al. in SIAM J. Comput. 1(2):131–137, 1972).
(2)
A 2-approximation algorithm exists for TR1 (Frederickson and JàJà in SIAM J. Comput. 10(2):270–283, 1981; Khuller et al. in 19th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 937–938, 1999).
In this paper, our contributions are as follows:
•
We observe that TRp, for any integer p>0, can be solved in linear time for directed acyclic graphs using the ideas in Aho et al. (SIAM J. Comput. 1(2):131–137,
1972).
•
We provide a 1.78-approximation for TR1 that improves the 2-approximation mentioned in (2) above.
•
We provide a 2+o(1)-approximation for TRp on general graphs for any fixed prime p>1.
R. Albert’s research was partly supported by a Sloan Research Fellowship in Science and Technology.
B. DasGupta’s research was partly supported by NSF grants DBI-0543365, IIS-0612044 and IIS-0346973.
E. Sontag’s research was partly supported by NSF grants EIA 0205116 and DMS-0504557. 相似文献
An attempt was made to modify the band gap of CdS ( 2.4 eV) by preparing a mixed lattice with a low-band-gap material, PbS (0.3 eV), giving a new set of materials, CdxPb1–xS. Band gaps as low as 1.9 eV were achieved with increasing x. The preparation of CdxPb1–xS was carried out by chemical-bath deposition. Structural characterization studies using X-ray diffraction (XRD), energy dispersion analysis by X-rays (EDAX), and optical microscopy were performed. The optical-absorption studies used to find the band gap are also described. 相似文献
All-solid-state Li batteries (ASSLBs) with solid-polymer electrolytes are considered promising battery systems to achieve improved safety and high energy density. However, Li dendrite formation at the Li anode under high charging current density/capacity has limited their development. To tackle the issue, Li-metal alloying has been proposed as an alternative strategy to suppress Li dendrite growth in ASSLBs. One drawback of alloying is the relatively lower operating cell voltages, which will inevitably lower energy density compared to cells with pure Li anode. Herein, a Li-rich Li13In3 alloy electrode (LiRLIA) is proposed, where the Li13In3 alloy scaffold guides Li nucleation and hinders Li dendrite formation. Meanwhile, the free Li can recover Li's potential and facilitate fast charge transfer kinetics to realize high-energy-density ASSLBs. Benefitting from the stronger adsorption energy and lower diffusion energy barrier of Li on a Li13In3 substrate, Li prefers to deposit in the 3D Li13In3 scaffold selectively. Therefore, the Li–Li symmetric cell constructed with LiRLIA can operate at a high current density/capacity of 5 mA cm−2/5 mAh cm−2 for almost 1000 h. 相似文献
An energy harvesting (EH) and cooperative cognitive radio (CR) network (CRN) is studied in this paper where CR users transmit data through a primary user (PU) channel if the channel remains idle, else an optimal number CRs helps in transmission of PU. To achieve the optimum number of CRs (ONCR) involved in cooperation, a novel scheme based on a combination of channel censoring and total error is proposed. The performance of the proposed scheme is investigated under RF harvesting scenario. The EH is dependent on sensing decision and a CR source harvests energy from PU's RF signal. The harvested energy (HE) is split into two parts: One part is used by the CR network (CRN) for its own transmission, and the other part is used for supporting PU. The effect of the energy allocation factor on total throughput is also investigated. New expressions for optimal number of CRs and throughput are developed. The effect of network parameters such as sensing time, censoring threshold, and energy allocation parameter (EAP) on throughput is investigated. Impact of distance between nodes is also studied. 相似文献
Domestic fund transfers are all the time immediate, handier and obtainable however in overseas fund transfer, funds are transferred from payers account to payees account through the correspondent banks, central bank and messaging network which involves intermediaries and allied charges. Blockchain Technology has grabbed the interest of financial systems due to its inventive benefits such as decentralised structure, faster speed, cost-effectiveness and more security over conventional approaches. Adopting Blockchain Technology for overseas fund transfer can overcome the transaction delays, intermediaries’ failures and recurring costs involved in the current system. In this paper, a Consortium Blockchain based overseas fund transfer process is proposed to achieve faster operations, security and transparency. Hyperledger Fabric Blockchain framework has been used for overseas fund transfer process and web-user interface is developed for the same. Simulation results demonstrate the significance of Blockchain as a promising technology for overseas fund transfer process to facilitate speed, security, transparency and efficiency for overseas fund transfer.