全文获取类型
收费全文 | 672篇 |
免费 | 22篇 |
国内免费 | 1篇 |
专业分类
电工技术 | 2篇 |
综合类 | 1篇 |
化学工业 | 91篇 |
金属工艺 | 3篇 |
机械仪表 | 7篇 |
建筑科学 | 20篇 |
矿业工程 | 2篇 |
能源动力 | 21篇 |
轻工业 | 39篇 |
水利工程 | 3篇 |
石油天然气 | 1篇 |
无线电 | 77篇 |
一般工业技术 | 69篇 |
冶金工业 | 261篇 |
原子能技术 | 2篇 |
自动化技术 | 96篇 |
出版年
2023年 | 3篇 |
2022年 | 5篇 |
2021年 | 12篇 |
2019年 | 8篇 |
2018年 | 7篇 |
2017年 | 12篇 |
2016年 | 9篇 |
2015年 | 14篇 |
2014年 | 12篇 |
2013年 | 17篇 |
2012年 | 14篇 |
2011年 | 28篇 |
2010年 | 18篇 |
2009年 | 23篇 |
2008年 | 24篇 |
2007年 | 19篇 |
2006年 | 22篇 |
2005年 | 16篇 |
2004年 | 14篇 |
2003年 | 7篇 |
2002年 | 14篇 |
2001年 | 12篇 |
2000年 | 7篇 |
1999年 | 12篇 |
1998年 | 60篇 |
1997年 | 41篇 |
1996年 | 33篇 |
1995年 | 14篇 |
1994年 | 30篇 |
1993年 | 24篇 |
1992年 | 12篇 |
1991年 | 7篇 |
1990年 | 10篇 |
1989年 | 3篇 |
1988年 | 14篇 |
1987年 | 8篇 |
1986年 | 8篇 |
1985年 | 10篇 |
1983年 | 5篇 |
1982年 | 11篇 |
1981年 | 9篇 |
1980年 | 8篇 |
1978年 | 4篇 |
1977年 | 8篇 |
1976年 | 12篇 |
1975年 | 6篇 |
1974年 | 6篇 |
1973年 | 3篇 |
1972年 | 4篇 |
1970年 | 3篇 |
排序方式: 共有695条查询结果,搜索用时 15 毫秒
1.
Ron Kimmel Doron Shaked Michael Elad Irwin Sobel 《IEEE transactions on image processing》2005,14(6):796-803
Gamut mapping deals with the need to adjust a color image to fit into the constrained color gamut of a given rendering medium. A typical use for this tool is the reproduction of a color image prior to its printing, such that it exploits best the given printer/medium color gamut, namely the colors the printer can produce on the given medium. Most of the classical gamut mapping methods involve a pixel-by-pixel mapping and ignore the spatial color configuration. Recently proposed spatial-dependent approaches for gamut mapping are either based on heuristic assumptions or involve a high computational cost. In this paper, we present a new variational approach for space-dependent gamut mapping. Our treatment starts with the presentation of a new measure for the problem, closely related to a recent measure proposed for Retinex. We also link our method to recent measures that attempt to couple spectral and spatial perceptual measures. It is shown that the gamut mapping problem leads to a quadratic programming formulation, guaranteed to have a unique solution if the gamut of the target device is convex. An efficient numerical solution is proposed with promising results. 相似文献
2.
Steinberg Y. 《IEEE transactions on information theory / Professional Technical Group on Information Theory》1998,44(2):472-487
We study the randomness needed for approximating the output distribution of a multiple-access channel, where the original input processes are independent of each other. The approximation is achieved by simulating (possibly alternative) input processes at each of the entries, where the sources of randomness available for the simulators are independent of each other, and the simulators do not cooperate. The resolvability region of a multiple-access channel is defined as the set of all random-bit rate pairs at which accurate output approximation is possible, where the simulation accuracy is measured by the variational distance between finite-dimensional output distributions. Inner and outer bounds on the resolvability region are derived, and close relations between the concepts of resolvability region and capacity region are demonstrated 相似文献
3.
4.
Steinberg Y. Poor H.V. 《IEEE transactions on information theory / Professional Technical Group on Information Theory》1994,40(1):11-20
Considers the problem of multiuser amplitude estimation, i.e., the problem of estimating the amplitudes of several digital communications signals superimposed in the same channel. This problem is of importance in communications environments such as spread-spectrum radio networks, in which nonorthogonal multiplexing is used. Multiuser amplitude estimation is a critical prerequisite to the optimum demodulation of such signals using, for example, Verdu's algorithm. In the present paper, a sequential detection-estimation approach is applied to this problem, and several estimation paradigms, including the method of moments and likelihood-based estimators, are considered. The consistency, asymptotic variance, and complexity of these estimators are examined. A new method of constructing a recursive consistent and asymptotically efficient estimation algorithm out of a consistent estimator sequence is also suggested and is applied to the current setup. It is seen that detector-estimators that use these estimators in Verdu's algorithm result, asymptotically, in (known-amplitude) optimum error probabilities with little relative increase in complexity per demodulated bit 相似文献
5.
6.
Tobin David L.; Johnson Craig; Steinberg Stacey; Staats Marian; Dennis Amy Baker 《Canadian Metallurgical Quarterly》1991,100(1):14
Investigated a multifactorial approach to the assessment of bulimia nervosa by means of hierarchical factor analysis. 245 bulimia nervosa patients and 68 patients with either anorexia nervosa or eating disorders not otherwise specified were administered a self-report battery that was organized into 21 dimensions relevant to eating disorder patients. When dimensions from this battery were subjected to hierarchical factor analysis, support for bulimia nervosa as a unique diagnostic category was obtained. However, the emergence of 3 secondary factors and 6 primary factors suggests that bulimia nervosa can also be described more complexly. The emergence of a multifactorial model of bulimia nervosa that incorporates several existing unidimensional models suggests the potential for both divergent and complicated clinical presentation in bulimia nervosa patients. (PsycINFO Database Record (c) 2010 APA, all rights reserved) 相似文献
7.
Phosphorylation of the catalytic subunit of cyclic AMP-dependent protein kinase, or protein kinase A, on Thr-197 is required for optimal enzyme activity, and enzyme isolated from either animal sources or bacterial expression strains is found phosphorylated at this site. Autophosphorylation of Thr-197 occurs in Escherichia coli and in vitro but is an inefficient intermolecular reaction catalyzed primarily by active, previously phosphorylated molecules. In contrast, the Thr-197 phosphorylation of newly synthesized protein kinase A in intact S49 mouse lymphoma cells is both efficient and insensitive to activators or inhibitors of intracellular protein kinase A. Using [35S]methionine-labeled, nonphosphorylated, recombinant catalytic subunit as the substrate in a gel mobility shift assay, we have identified an activity in extracts of protein kinase A-deficient S49 cells that phosphorylates catalytic subunit on Thr-197. The protein kinase A kinase activity partially purified by anion-exchange and hydroxylapatite chromatography is an efficient catalyst of protein kinase A phosphorylation in terms of both a low Km for ATP and a rapid time course. Phosphorylation of wild-type catalytic subunit by the kinase kinase activates the subunit for binding to a pseudosubstrate peptide inhibitor of protein kinase A. By both the gel shift assay and a [gamma-32P]ATP incorporation assay, the enzyme is active on wild-type catalytic subunit and on an inactive mutant with Met substituted for Lys-72 but inactive on a mutant with Ala substituted for Thr-197. Combined with the results from mutant subunits, phosphoamino acid analysis suggests that the enzyme is specific for phosphorylation of Thr-197. 相似文献
8.
Data on adolescents' after-school experiences and their susceptibility to peer pressure were derived from surveys administered to a heterogeneous sample of 865 adolescents in Grades 5–9. Consistent with the findings of previous studies, the results show that Ss who reported home after school were not significantly different from those who were supervised by their parents at home during after-school hours. However, when a 2nd sample of latchkey children (n?=?594) was studied to include greater variation in after-school experiences, Ss who were more removed from adult supervision were found to be more susceptible to peer pressure to engage in antisocial activity. Ss who were home alone were less susceptible to peer pressure than are those who were at a friend's house after school, and those who were at a friend's house, in turn, were less susceptible than were those who describe themselves as "hanging out." Moreover, latchkey Ss whose parents knew their whereabouts and those who had been raised authoritatively were less susceptible to peer influence than were their peers, even if their afternoons were spent in contexts in which adult supervision was lax and susceptibility to peer pressure was generally high. (17 ref) (PsycINFO Database Record (c) 2010 APA, all rights reserved) 相似文献
9.
Conventional access methods cannot be effectively used in large Scientific/Statistical Database (SSDB) applications. A file structure (called bit transposed file (BTF)) is proposed which offers several attractive features that are better suited for the special characteristics that SSDBs exhibit. This file structure is an extreme version of the (attribute) transposed file. The data are stored by vertical bit partitions. The bit patterns of attributes are assigned using one of several data encoding methods. Each of these encoding methods is appropriate for different query types. The bit partitions can also be compressed using a version of the run length encoding scheme. Efficient operators on compressed bit vectors have been developed and form the basis of a query language. Because of the simplicity of the file structure and query language, optimization problems for database design, query evaluation, and common subexpression removal can be formalized and efficient exact solution or near optimal solution can be achieved. In addition to selective power with low overheads for SSDBs, the BTF is also amenable to special parallel hardware. Results from experiments with the file structure suggest that this approach may be a reasonable alternative file structure for large SSDBs. 相似文献
10.
Doron Drusinsky 《Innovations in Systems and Software Engineering》2014,10(2):123-136
This paper describes a technique for runtime monitoring (RM) and runtime verification (RV) of systems with invisible events and data artifacts. Our approach combines well-known hidden markov model (HMM) techniques for learning and subsequent identification of hidden artifacts, with runtime monitoring of probabilistic formal specifications. The proposed approach entails a process in which the end-user first develops and validates deterministic formal specification assertions, s/he then identifies hidden artifacts in those assertions. Those artifacts induce the state set of the identifying HMM. HMM parameters are learned using standard frequency analysis techniques. In the verification or monitoring phase, the system emits visible events and data symbols, used by the HMM to deduce invisible events and data symbols, and sequences thereof; both types of symbols are then used by a probabilistic formal specification assertion to monitor or verify the system. 相似文献