期刊文献+
共找到6篇文章
< 1 >
每页显示 20 50 100
关于小数乘法中积的位数问题
1
作者 张述霞 《中小学数学(小学版)》 2005年第3期40-40,共1页
最近和同事探讨小数乘法中关于乘积的位数问题时,又碰到了一个老问题,乘积末尾有0的情况下(如0.056×0.15=0.0084或0.00840),这个积到底是几位小数?它是如何确定的?现在大致有三种观点:(以0.056×0.15=0.0084或0.00... 最近和同事探讨小数乘法中关于乘积的位数问题时,又碰到了一个老问题,乘积末尾有0的情况下(如0.056×0.15=0.0084或0.00840),这个积到底是几位小数?它是如何确定的?现在大致有三种观点:(以0.056×0.15=0.0084或0.00840为例) 展开更多
关键词 小数乘法 乘积 位数问题 小学 数学
原文传递
Heap-Leaching of Low-Grade Uranium Ore at SOMAIR: From Laboratory Tests to Production of 700 Tonnes U Per Year
2
作者 Nicolas Durupt Jean Jacques Blanvillain 《Journal of Chemistry and Chemical Engineering》 2011年第6期549-557,共9页
In 2006, SOMAIR decided to increase the uranium production by 50% using heap leaching for the treatment of low grade ores. These ores, which come from different lodes with various properties, have been studied in four... In 2006, SOMAIR decided to increase the uranium production by 50% using heap leaching for the treatment of low grade ores. These ores, which come from different lodes with various properties, have been studied in four steps: ( 1 ) Lab tests: to compare the ores (characterization, acid consumptions, recovery...); (2) Column tests on an average sample: to define significant parameters for a feasibility study; (3) Column tests on specific samples: to optimize recovery for each ore and identify problems of percolation due to the clays; (4) Pilot tests in large boxes (stalls): to validate process parameters. Uranium production by heap leaching started in July 2009. 展开更多
关键词 URANIUM heap-leaching low grade ores clays column tests acid consumption.
下载PDF
谁是谁非?
3
作者 姜国英 《小学教育科研论坛》 2004年第7期128-128,共1页
此问题按作者原文刊出,诚请广大读者积极参与进来,发表自己的真知灼见。同时,也请广大教师朋友有什么疑难问题提出来,供大家探讨,以集思广义。
关键词 小数乘法 位数问题 数学 小学 计算规则
原文传递
Robust estimation in inverse problems via quantile coupling 被引量:2
4
作者 TIAN MaoZai 《Science China Mathematics》 SCIE 2012年第5期1029-1041,共13页
In this article we consider a sequence of hierarchical space model of inverse problems.The underlying function is estimated from indirect observations over a variety of error distributions including those that are hea... In this article we consider a sequence of hierarchical space model of inverse problems.The underlying function is estimated from indirect observations over a variety of error distributions including those that are heavy-tailed and may not even possess variances or means.The main contribution of this paper is that we establish some oracle inequalities for the inverse problems by using quantile coupling technique that gives a tight bound for the quantile coupling between an arbitrary sample p-quantile and a normal variable,and an automatic selection principle for the nonrandom filters.This leads to the data-driven choice of weights.We also give an algorithm for its implementation.The quantile coupling inequality developed in this paper is of independent interest,because it includes the median coupling inequality in literature as a special case. 展开更多
关键词 inverse problem robust estimation oracle inequalities quantile coupling inequalities heavy-tailed distributions hierarchical sequence space model
原文传递
A NOTE ON THE NESTEDNESS PROPERTY FOR ORDERED MEDIAN PROBLEMS IN TREE NETWORKS
5
作者 TANG Huajun 《Journal of Systems Science & Complexity》 SCIE EI CSCD 2013年第3期335-340,共6页
The nestedness property has become an increasingly important means for devising efficient algorithms for network location problems.There have been attempts to explore the nestedness property of network location proble... The nestedness property has become an increasingly important means for devising efficient algorithms for network location problems.There have been attempts to explore the nestedness property of network location problems with some special cases of the convex ordered median objectives.However,there is little research on the nestedness property for those problems with the concave ordered median objectives.This paper constructs a tree network T and shows that the nestedness property cannot hold for the concave ordered median problem,which fills a gap in the research on the nestedness property.Finally,the authors pose an open problem on identifying the nestedness property for the continuous strategic ordered median problem. 展开更多
关键词 Nestedness property ordered median problem tree network.
原文传递
MULTI-FACILITY ORDERED MEDIAN PROBLEMS IN DIRECTED NETWORKS
6
作者 Huajun TANG T. C. Edwin CHENG C. T. NG 《Journal of Systems Science & Complexity》 SCIE EI CSCD 2011年第1期61-67,共7页
This paper uses a finite dominating set (FDS) to investigate the multi-facility ordered median problem (OMP) in a strongly connected directed network. The authors first prove that the multi-facility OMP has an FDS... This paper uses a finite dominating set (FDS) to investigate the multi-facility ordered median problem (OMP) in a strongly connected directed network. The authors first prove that the multi-facility OMP has an FDS in the node set, which not only generalizes the FDS result provided by Kalcsics, et al. (2002), but also extends the FDS result from the single-facility Case to the multiple case, filling an important gap. Then, based on this FDS result, the authors develop an exact algorithm to solve the problem. However, if the number of facilities is large, it is not practical to find the optimal solution, because the multi-facility OMP in directed networks is NP-hard. Hence, we present a constant-approximation algorithm for the p-median problem in directed networks. Finally, we pose an open problem for future research. 展开更多
关键词 ALGORITHMS finite dominating sets multi-facility ordered median problem pseudoequilibria.
原文传递
上一页 1 下一页 到第
使用帮助 返回顶部