全文获取类型
收费全文 | 231篇 |
免费 | 11篇 |
专业分类
电工技术 | 2篇 |
化学工业 | 42篇 |
建筑科学 | 5篇 |
能源动力 | 2篇 |
轻工业 | 15篇 |
无线电 | 38篇 |
一般工业技术 | 49篇 |
冶金工业 | 30篇 |
原子能技术 | 1篇 |
自动化技术 | 58篇 |
出版年
2022年 | 3篇 |
2021年 | 4篇 |
2020年 | 2篇 |
2019年 | 5篇 |
2018年 | 5篇 |
2017年 | 2篇 |
2016年 | 7篇 |
2015年 | 3篇 |
2014年 | 9篇 |
2013年 | 16篇 |
2012年 | 14篇 |
2011年 | 21篇 |
2010年 | 21篇 |
2009年 | 11篇 |
2008年 | 15篇 |
2007年 | 14篇 |
2006年 | 8篇 |
2005年 | 5篇 |
2004年 | 9篇 |
2003年 | 5篇 |
2002年 | 5篇 |
2001年 | 8篇 |
2000年 | 4篇 |
1999年 | 2篇 |
1998年 | 6篇 |
1997年 | 7篇 |
1996年 | 8篇 |
1995年 | 1篇 |
1994年 | 4篇 |
1993年 | 3篇 |
1992年 | 5篇 |
1991年 | 1篇 |
1990年 | 3篇 |
1989年 | 1篇 |
1987年 | 1篇 |
1982年 | 1篇 |
1980年 | 1篇 |
1976年 | 2篇 |
排序方式: 共有242条查询结果,搜索用时 10 毫秒
1.
NADPH diaphorase histochemistry is commonly used to identify cells containing nitric oxide synthase (NOS), the enzyme catalyzing the production of nitric oxide from L-arginine. NADPH diaphorase activity and NOS immunostaining was demonstrated in different cells of the vertebrate retina; photoreceptors, horizontal cells, amacrine cells, ganglion cells, and Müller cells. However, the physiological role of nitric oxide (NO) in the retina has yet to be elucidated. In this study, we tested the assumption that NADPH diaphorase activity in the retinas of rabbits and rats depended on the state of visual adaptation. In the rabbit, light adaptation enhanced NADPH diaphorase activity in amacrine cells and practically eliminated it in horizontal cells. Dark adaptation induced the opposite effects; the NADPH diaphorase activity was reduced in amacrine cells and enhanced in horizontal cells. Retinas from eyes that were injected intravitreally with L-glutamate exhibited a pattern of NADPH diaphorase activity that was similar to that seen in dark-adapted retinas. In rats, the NADPH diaphorase activity of amacrine and horizontal cells exhibited adaptation dependency similar to that of the rabbit retina. But, the most pronounced effect of dark adaptation in the rat's retina was an enhancement of NADPH diaphorase activity in Müller cells, especially of the endfoot region. Assuming that NADPH diaphorase activity is a marker for NOS, these findings suggest that NO production in the mammalian retina is modulated by the level of ambient illumination and support the notion that NO plays a physiological role in the retina. 相似文献
2.
We present in this paper BP-QL, a novel query language for querying business processes. The BP-QL language is based on an intuitive model of business processes, an abstraction of the emerging BPEL (business process execution language) standard. It allows users to query business processes visually, in a manner very analogous to how such processes are typically specified, and can be employed in a distributed setting, where process components may be provided by distinct providers. 相似文献
3.
A fiber-optic radiometer is used to monitor and control, in real time, the temperature of samples of biological tissue irradiated with a CO(2) laser. Several control algorithms are investigated and the optimal control mode is obtained. A silver halide infrared fiber is used both to deliver the CO(2) laser radiation needed to irradiate the target and to deliver the thermal radiation emitted from the target back to the radiometer. Such a system can be useful in medical applications of CO(2) lasers. 相似文献
4.
5.
中国作为目前世界上最大的移动市场,对于移动标准的发展,希望制定不同于西方的自己的标准。这就是目前的3G标准TD-SCDMA以及未来的4G标准TD-LTE。在2006年初,中国政府宣布TD-SCDMA正式成为中国的3G移动通信的标准。在2009年,世界最大的移动运营商中国移动宣布将提供基于TD-SCDMA为标准的3G服务;同时,中国联通以及中国电信分别将以WCDMA以及CDMA-2000标准推出3G服务。这就意味着,中国在接下来的时间将会同时存在3种不同的3G网络。显而易见的是,中国的3G服务的启动要远远晚于西方世界。中国移动明白不可能只是依靠TD-SCDMA来确保其目前领先的地位。因此,中国移 相似文献
6.
A note on maximizing the spread of influence in social networks 总被引:2,自引:0,他引:2
Eyal Even-Dar 《Information Processing Letters》2011,111(4):184-187
We consider the spread maximization problem that was defined by Domingos and Richardson (2001, 2002) [7] and [22]. In this problem, we are given a social network represented as a graph and are required to find the set of the most “influential” individuals that by introducing them with a new technology, we maximize the expected number of individuals in the network, later in time, that adopt the new technology. This problem has applications in viral marketing, where a company may wish to spread the rumor of a new product via the most influential individuals in popular social networks such as Myspace and Blogsphere.The spread maximization problem was recently studied in several models of social networks (Kempe et al. (2003, 2005) [14] and [15], Mossel and Roch (2007) [20]). In this short paper we study this problem in the context of the well studied probabilistic voter model. We provide very simple and efficient algorithms for solving this problem. An interesting special case of our result is that the most natural heuristic solution, which picks the nodes in the network with the highest degree, is indeed the optimal solution. 相似文献
7.
Low overhead analysis of large distributed data sets is necessary for current data centers and for future sensor networks. In such systems, each node holds some data value, e.g., a local sensor read, and a concise picture of the global system state needs to be obtained. In resource-constrained environments like sensor networks, this needs to be done without collecting all the data at any location, i.e., in a distributed manner. To this end, we address the distributed clustering problem, in which numerous interconnected nodes compute a clustering of their data, i.e., partition these values into multiple clusters, and describe each cluster concisely. We present a generic algorithm that solves the distributed clustering problem and may be implemented in various topologies, using different clustering types. For example, the generic algorithm can be instantiated to cluster values according to distance, targeting the same problem as the famous k-means clustering algorithm. However, the distance criterion is often not sufficient to provide good clustering results. We present an instantiation of the generic algorithm that describes the values as a Gaussian Mixture (a set of weighted normal distributions), and uses machine learning tools for clustering decisions. Simulations show the robustness, speed and scalability of this algorithm. We prove that any implementation of the generic algorithm converges over any connected topology, clustering criterion and cluster representation, in fully asynchronous settings. 相似文献
8.
Consider the “Number in Hand” multiparty communication complexity model, where k players holding inputs x1,…,xk∈{0,1}n communicate to compute the value f(x1,…,xk) of a function f known to all of them. The main lower bound technique for the communication complexity of such problems is that of partition arguments: partition the k players into two disjoint sets of players and find a lower bound for the induced two-party communication complexity problem.In this paper, we study the power of partition arguments. Our two main results are very different in nature:
- (i)
- For randomized communication complexity, we show that partition arguments may yield bounds that are exponentially far from the true communication complexity. Specifically, we prove that there exists a 3-argument function f whose communication complexity is Ω(n), while partition arguments can only yield an Ω(logn) lower bound. The same holds for nondeterministiccommunication complexity.
- (ii)
- For deterministic communication complexity, we prove that finding significant gaps between the true communication complexity and the best lower bound that can be obtained via partition arguments, would imply progress on a generalized version of the “log-rank conjecture” in communication complexity. We also observe that, in the case of computing relations (search problems), very large gaps do exist.
9.
Lennart Åqvist (1992) proposed a logical theory of legal evidence, based on the Bolding-Ekelöf of degrees of evidential strength. This paper reformulates Åqvist's model in terms of the probabilistic version of the kappa calculus. Proving its acceptability in the legal context is beyond the present scope, but the epistemological debate about Bayesian Law isclearly relevant. While the present model is a possible link to that lineof inquiry, we offer some considerations about the broader picture of thepotential of AI & Law in the evidentiary context. Whereas probabilisticreasoning is well-researched in AI, calculations about the threshold ofpersuasion in litigation, whatever their value, are just the tip of theiceberg. The bulk of the modeling desiderata is arguably elsewhere, if one isto ideally make the most of AI's distinctive contribution as envisaged forlegal evidence research. 相似文献
10.