1,389 Hits in 1.3 sec

Constructive neural network learning [article]

Shaobo Lin, Jinshan Zeng, Xiaoqin Zhang
2016 arXiv   pre-print
The corresponding author is Jinshan Zeng.  ...  Zhang are with the College of Mathematics and Information Science, Wenzhou University, Wenzhou 325035, China, and J.  ... 
arXiv:1605.00079v1 fatcat:mw6pgxishvah5h2z4ypzfk3wce

Deep Blind Video Super-resolution [article]

Jinshan Pan, Songsheng Cheng, Jiawei Zhang, Jinhui Tang
2020 arXiv   pre-print
Existing video super-resolution (SR) algorithms usually assume that the blur kernels in the degradation process are known and do not model the blur kernels in the restoration. However, this assumption does not hold for video SR and usually leads to over-smoothed super-resolved images. In this paper, we propose a deep convolutional neural network (CNN) model to solve video SR by a blur kernel modeling approach. The proposed deep CNN model consists of motion blur estimation, motion estimation,
more » ... latent image restoration modules. The motion blur estimation module is used to provide reliable blur kernels. With the estimated blur kernel, we develop an image deconvolution method based on the image formation model of video SR to generate intermediate latent images so that some sharp image contents can be restored well. However, the generated intermediate latent images may contain artifacts. To generate high-quality images, we use the motion estimation module to explore the information from adjacent frames, where the motion estimation can constrain the deep CNN model for better image restoration. We show that the proposed algorithm is able to generate clearer images with finer structural details. Extensive experimental results show that the proposed algorithm performs favorably against state-of-the-art methods.
arXiv:2003.04716v1 fatcat:dj5mpfitgjhxpgj6n6vevyvspa

Nitrogen Dynamics Variation in Overlying Water of Jinshan Lake, China

Xiaohong Zhou, Mingyuan Wang, Longmei Liu, Zhigang Chen, Yimin Li, Jinping Zhang
2015 Journal of Chemistry  
Nitrogen concentrations had dramatic spatial changes in 18 sampling points of Jinshan Lake.  ...  Jinshan Lake is a famous urban landscape lake with approximately 8.8 km2water area, which is located on the north of Zhenjiang, of Jiangsu Province, China.  ...  These results were consistent with the findings of previous studies by Zhang et al. 2008 [5] , Berman et al. 1984 [23] , and Gu et al. 1997 [24] .  ... 
doi:10.1155/2015/759496 fatcat:k2yqsdt2bzbhtbfxpudiwjyaiu

Report on "American Option Pricing and Hedging Strategies" [article]

Jinshan Zhang
2007 arXiv   pre-print
This paper mainly discusses the American option's hedging strategies via binomialmodel and the basic idea of pricing and hedging American option. Although the essential scheme of hedging is almost the same as European option, small differences may arise when simulating the process for American option holder has more rights, spelling that the option can be exercised at anytime before its maturity. Our method is dynamic-hedging method.
arXiv:0711.4324v1 fatcat:7liitbcrbnhjncwohoxqqac5am

Lecture notes on "Combinatorial Criteria for Uniqueness of Gibbs Measures" [article]

Jinshan Zhang
2008 arXiv   pre-print
These notes are dedicated to whom may be interested in algorithms, Markov chain, coupling, and graph theory etc. I present some preliminaries on coupling and explanations of the important formulas or phrases, which may be helpful for us to understand D. Weitz's paper "Combinatorial Criteria for Uniqueness of Gibbs Measures" with ease.
arXiv:0812.2168v1 fatcat:g473wkjxp5gh3m32bkguwlqs5m

Strong Spatial Mixing for Binary Markov Random Fields [article]

Jinshan Zhang, Heng Liang, Fengshan Bai
2009 arXiv   pre-print
Gibbs distribution of binary Markov random fields on a sparse on average graph is considered in this paper. The strong spatial mixing is proved under the condition that the 'external field' is uniformly large or small. Such condition on 'external field' is meaningful in physics.
arXiv:0911.5487v1 fatcat:pfndqxrt2veinm6u6dfl2wi3dq

Approximating Partition Functions of Two-State Spin Systems [article]

Jinshan Zhang, Heng Liang, Fengshan Bai
2009 arXiv   pre-print
Two-state spin systems is a classical topic in statistical physics. We consider the problem of computing the partition function of the systems on a bounded degree graph. Based on the self-avoiding tree, we prove the systems exhibits strong correlation decay under the condition that the absolute value of "inverse temperature" is small. Due to strong correlation decay property, an FPTAS for the partition function is presented under the same condition. This condition is sharp for Ising model.
arXiv:0911.5486v1 fatcat:tjmyrle6jrf2banfxsropu4nou

An analysis of a random algorithm for estimating all the matchings [article]

Jinshan Zhang
2008 arXiv   pre-print
Counting the number of all the matchings on a bipartite graph has been transformed into calculating the permanent of a matrix obtained from the extended bipartite graph by Yan Huo, and Rasmussen presents a simple approach (RM) to approximate the permanent, which just yields a critical ratio O(nω(n)) for almost all the 0-1 matrices, provided it's a simple promising practical way to compute this #P-complete problem. In this paper, the performance of this method will be shown when it's applied to
more » ... ompute all the matchings based on that transformation. The critical ratio will be proved to be very large with a certain probability, owning an increasing factor larger than any polynomial of n even in the sense for almost all the 0-1 matrices. Hence, RM fails to work well when counting all the matchings via computing the permanent of the matrix. In other words, we must carefully utilize the known methods of estimating the permanent to count all the matchings through that transformation.
arXiv:0812.1119v1 fatcat:jgdqttmuafgf3gkh62mqnv37x4

The Community Structure of Econophysicist Collaboration Networks [article]

Peng Zhang, Menghui Li, Jinshan Wu, Zengru Di, Ying Fan
2005 arXiv   pre-print
This paper uses a database of collaboration recording between Econophysics Scientists to study the community structure of this collaboration network, which with a single type of vertex and a type of undirected, weighted edge. Hierarchical clustering and the algorithm of Girvan and Newman are presented to analyze the data. And it emphasizes the influence of the weight to results of communities by comparing the different results obtained in different weights. A function D is proposed to
more » ... h the difference between above results. At last the paper also gives explanation to the results and discussion about community structure.
arXiv:physics/0505064v1 fatcat:asxgkpp2c5bnfh4kdtb5s7dqd4

DAVANet: Stereo Deblurring with View Aggregation [article]

Shangchen Zhou, Jiawei Zhang, Wangmeng Zuo, Haozhe Xie, Jinshan Pan, Jimmy Ren
2019 arXiv   pre-print
To handle spatially variant blur in dynamic scenes, Zhang et al. [44] adopt a VGG network to estimate the pixel-wise weights of the spatially variant RNNs [21] for blur removal in feature space.  ...  With GPU implementation, deep learning-based methods Method Nah [24] Kupyn [16] Zhang [44] Tao [38] Ours-Single PSNR 28.49 25.86 29.19 30.26 30.55 SSIM 0.9165 0.8359 0.9306 0.9342 0.9400  ... 
arXiv:1904.05065v1 fatcat:nmq5kkfg2fdmjaqhsqycpald5m

Network Pollution Games

Eleftherios Anastasiadis, Xiaotie Deng, Piotr Krysta, Minming Li, Han Qiao, Jinshan Zhang
2018 Algorithmica  
The problem of pollution control has been mainly studied in the environmental economics literature where the methodology of game theory is applied for the pollution control. To the best of our knowledge this is the first time this problem is studied from the computational point of view. We introduce a new network model for pollution control and present two applications of this model. On a high level, our model comprises a graph whose nodes represent the agents, which can be thought of as the
more » ... rces of pollution in the network. The edges between agents represent the effect of spread of pollution. The government who is the regulator, is responsible for the maximization of the social welfare and sets bounds on the levels of emitted pollution in both local areas as well as globally in the whole network. We first prove that the above optimization problem is NP-hard even on some special cases of graphs such as trees. We then turn our attention on the classes of trees and planar graphs which model realistic scenarios of the emitted pollution in water and air, respectively. We derive approximation algorithms for these two kinds of networks and provide deterministic truthful and truthful in expectation mechanisms. In some settings of the problem that we study, we achieve the best possible approximation results under standard complexity theoretic assumptions. Our approximation algorithm on planar graphs is obtained by a novel decomposition technique to deal with constraints on vertices. We note that no known planar decomposition techniques can be used here and our technique can be of independent interest. For trees we design a two level dynamic programming approach to obtain an FPTAS. This approach is crucial to deal with the global pollution quota constraint. It uses a special multiple choice, multi-dimensional knapsack problem where coefficients of all constraints except one are bounded by a polynomial of the input size. We furthermore derive truthful in expectation mechanisms on general networks with bounded degree.
doi:10.1007/s00453-018-0435-4 pmid:30872881 pmcid:PMC6390722 fatcat:bf4j6z7fljbt3owyfkrsdi46qy

Biomechanical evaluation of a novel integrated artificial axis

Yongqiang Zheng, Jianhua Wang, Suixiang Liao, Dongsheng Zhang, Jinshan Zhang, Limin Ma, Hong Xia
2017 Medicine  
Various modified instruments are used for the anterior reconstruction of the tumor lesion affecting the second cervical vertebra, but there have been no reports regarding individual integrated artificial axis (IAA) prosthesis fabricated by selective laser melting. In the present work, a new type of IAA prosthesis has been designed with a 3-dimensional (3D) finite element model of normal occiput-the fourth cervical vertebra being established to assess its biomechanics. For easy comparison,
more » ... r 3D finite element model is also established for the T-shaped Harms cage and an additional posterior fixation was performed on each model. The models are tested under a preliminary loading of 40 N to simulate cervical physical action including flexion, extension, lateral bending, and rotation. Under various loads from 4 different directions, the maximum stress and displacement of the IAA are less than those of the modified T-shaped Harms cage. Except for flexion, the maximum stress of the third cervical vertebra endplate of the IAA is smaller than that of the modified T-shaped Harms cage. The new prosthesis with axis is a good choice for upper cervical operation, which not only can greatly increase the operation stability of the upper cervical segment but also could significantly reduce the risk of fixation failure due to Harms cage subsidence. Abbreviations: 3D = 3-dimensional, ATPS = anterior transpedicular screw, C0 = occiput, C1 = the first cervical vertebra, C2 = the second cervical vertebra, C3 = the third cervical vertebra, C4 = the fourth cervical vertebra, CT = computed tomography, FE = finite element, IAA = integrated artificial axis, ROM = range of motion, SLM = selective laser melting.
doi:10.1097/md.0000000000008597 pmid:29381931 pmcid:PMC5708930 fatcat:obx7h2f2azfq3dezbtuo7qljiy

Pricing Ad Slots with Consecutive Multi-unit Demand [article]

Xiaotie Deng, Paul Goldberg, Yang Sun, Bo Tang, Jinshan Zhang
2013 arXiv   pre-print
We consider the optimal pricing problem for a model of the rich media advertisement market, as well as other related applications. In this market, there are multiple buyers (advertisers), and items (slots) that are arranged in a line such as a banner on a website. Each buyer desires a particular number of consecutive slots and has a per-unit-quality value v_i (dependent on the ad only) while each slot j has a quality q_j (dependent on the position only such as click-through rate in position
more » ... ions). Hence, the valuation of the buyer i for item j is v_iq_j. We want to decide the allocations and the prices in order to maximize the total revenue of the market maker. A key difference from the traditional position auction is the advertiser's requirement of a fixed number of consecutive slots. Consecutive slots may be needed for a large size rich media ad. We study three major pricing mechanisms, the Bayesian pricing model, the maximum revenue market equilibrium model and an envy-free solution model. Under the Bayesian model, we design a polynomial time computable truthful mechanism which is optimum in revenue. For the market equilibrium paradigm, we find a polynomial time algorithm to obtain the maximum revenue market equilibrium solution. In envy-free settings, an optimal solution is presented when the buyers have the same demand for the number of consecutive slots. We conduct a simulation that compares the revenues from the above schemes and gives convincing results.
arXiv:1308.1382v1 fatcat:5hdjlawyyfarppcoitdpzy43wm

Size Versus Truthfulness in the House Allocation Problem

Piotr Krysta, David Manlove, Baharak Rastegari, Jinshan Zhang
2019 Algorithmica  
We study the House Allocation problem (also known as the Assignment problem), i.e., the problem of allocating a set of objects among a set of agents, where each agent has ordinal preferences (possibly involving ties) over a subset of the objects. We focus on truthful mechanisms without monetary transfers for finding large Pareto optimal matchings. It is straightforward to show that no deterministic truthful mechanism can approximate a maximum cardinality Pareto optimal matching with ratio
more » ... than 2. We thus consider randomised mechanisms. We give a natural and explicit extension of the classical Random Serial Dictatorship Mechanism (RSDM) specifically for the House Allocation problem where preference lists can include ties. We thus obtain a universally truthful randomised mechanism for finding a Pareto optimal matching and show that it achieves an approximation ratio of e e−1 . The same bound holds even when agents have priorities (weights) and our goal is to find a maximum weight (as opposed to maximum cardinality) Pareto optimal matching. On the other hand we give a lower bound of 18 13 on the approximation ratio of any universally truthful Pareto optimal mechanism in settings with strict preferences. By using a characterisation result of Bade, we show that any randomised mechanism that is a symmetrisation of a truthful, non-bossy and Pareto optimal mechanism has an improved lower bound of e e−1 . Since our new mechanism is a symmetrisation of RSDM for strict preferences, it follows that this lower bound is tight. We moreover interpret our problem in terms of the classical secretary problem and prove that our mechanism provides the best randomised strategy of the administrator who interviews the applicants.
doi:10.1007/s00453-019-00584-7 fatcat:qhobo44opfeoffucujuq5cv6ae

Rex Shunt for Extra-Hepatic Portal Venous Obstruction in Children

Jinshan Zhang, Long Li
2022 Children  
Zhang et al. [46] found that the failure rate of re-Rex shunt was 62.5% (5/8), which was significantly higher than 20% (1/5) of Warren operation in the treatment of recurrence after Rex shunt.  ...  Lurie 2013 Bhat, R. [41] Children's Hospital of 1999-2009 0.07-111 (30.8) 65 14 (5/65) Chicago (USA) 2013 Guerin, F. [42] Bicetre hospital (France) 1996-2010 6-167 (55) 32 18.8 (6/32) 2017 Zhang, J.S.  ... 
doi:10.3390/children9020297 pmid:35205017 pmcid:PMC8870553 fatcat:zxn2pmkxpbgbnadx7vzvpadumm
« Previous Showing results 1 — 15 out of 1,389 results