全文获取类型
收费全文 | 2091篇 |
免费 | 135篇 |
国内免费 | 3篇 |
专业分类
电工技术 | 22篇 |
综合类 | 8篇 |
化学工业 | 335篇 |
金属工艺 | 32篇 |
机械仪表 | 32篇 |
建筑科学 | 64篇 |
矿业工程 | 2篇 |
能源动力 | 70篇 |
轻工业 | 130篇 |
水利工程 | 30篇 |
石油天然气 | 2篇 |
无线电 | 344篇 |
一般工业技术 | 420篇 |
冶金工业 | 398篇 |
原子能技术 | 7篇 |
自动化技术 | 333篇 |
出版年
2023年 | 29篇 |
2022年 | 22篇 |
2021年 | 47篇 |
2020年 | 43篇 |
2019年 | 63篇 |
2018年 | 63篇 |
2017年 | 62篇 |
2016年 | 72篇 |
2015年 | 55篇 |
2014年 | 76篇 |
2013年 | 124篇 |
2012年 | 124篇 |
2011年 | 150篇 |
2010年 | 109篇 |
2009年 | 110篇 |
2008年 | 107篇 |
2007年 | 94篇 |
2006年 | 80篇 |
2005年 | 71篇 |
2004年 | 70篇 |
2003年 | 39篇 |
2002年 | 45篇 |
2001年 | 29篇 |
2000年 | 35篇 |
1999年 | 33篇 |
1998年 | 60篇 |
1997年 | 48篇 |
1996年 | 32篇 |
1995年 | 30篇 |
1994年 | 21篇 |
1993年 | 39篇 |
1992年 | 19篇 |
1991年 | 18篇 |
1990年 | 12篇 |
1989年 | 13篇 |
1988年 | 13篇 |
1987年 | 10篇 |
1986年 | 9篇 |
1985年 | 12篇 |
1984年 | 11篇 |
1983年 | 9篇 |
1982年 | 8篇 |
1981年 | 6篇 |
1980年 | 7篇 |
1979年 | 12篇 |
1978年 | 10篇 |
1977年 | 10篇 |
1976年 | 11篇 |
1975年 | 6篇 |
1964年 | 9篇 |
排序方式: 共有2229条查询结果,搜索用时 15 毫秒
61.
Mobility path information of cell phone users play a crucial role in a wide range of cell phone applications, including context based search and advertising, early warning systems, city-wide sensing applications such as air pollution exposure estimation and traffic planning. However, there is a disconnect between the low level location data logs available from the cell phones and the high level mobility path information required to support these cell phone applications. In this paper, we present formal definitions to capture the cell phone users’ mobility patterns and profiles, and provide a complete framework, Mobility Profiler, for discovering mobile cell phone user profiles starting from cell based location data. We use real-world cell phone log data (of over 350 K h of coverage) to demonstrate our framework and perform experiments for discovering frequent mobility patterns and profiles. Our analysis of mobility profiles of cell phone users expose a significant long tail in a user’s location-time distribution: A total of 15% of a cell phone user’s time is spent on average in locations that each appears with less than 1% of total time. 相似文献
62.
The feasibility of general task systems with precedence constraints on multiprocessor platforms 总被引:1,自引:1,他引:0
Feasibility analysis determines (prior to system execution-time) whether a specified collection of hard-real-time jobs executed
on a processing platform can meet all deadlines. In this paper, we derive near-optimal sufficient tests for determining whether
a given collection of jobs can feasibly meet all deadlines upon a specified multiprocessor platform assuming job migration
is permitted. The collection of jobs may contain precedence constraints upon the order of execution of these jobs. The derived
tests are general enough to be applied even when the collection of jobs is incompletely specified. We discuss the applicability
of these tests to the scheduling of collections of jobs that are generated by systems of recurrent real-time tasks. We also
show that our feasibility conditions may be used to obtain global-EDF schedulability conditions.
相似文献
Sanjoy BaruahEmail: |
63.
In this paper, we first introduce the use of an interactive hidden Markov model (IHMM) for modeling and analyzing default
data in a sector. Under the IHMM, transitions of the hidden risk states of the sector depend on the observed number of bonds
in the sector that default in the current time period. This incorporates the feedback effect of the number of defaults on
the transitions of the hidden risk states. This feature seems to be more realistic and does not enjoy by the traditional HMMs.
We then develop a “dynamic” version of the binomial expansion technique (BET) modulated by the IHMM for modeling the occurrence
of defaults of bonds issued by firms in the same sector. Under the BET modulated by the IHMM, the number of bonds defaulting
in each time period follows a Markov-modulated binomial distribution with the probability of defaulting of each bond depending
on the states of the IHMM, which represent the hidden risk states of the sector. Efficient method will be presented for estimating
the model parameters in the BET modulated by the IHMM. We shall compare the hidden risk state process extracted from the IHMM-modulated
BET with that extracted from the BET modulated by HMM in order to illustrate the significance of the feedback effect using
real data. We shall also present the estimation results for the BET modulated by the IHMM and compare them with those for
the BET modulated by the HMM. 相似文献
64.
We introduce Process Overview, a situation awareness characterisation of the knowledge derived from monitoring process plants. Process Overview is based on observational studies of process control work in the literature. The characterisation is applied to develop a query-based measure called the Process Overview Measure. The goal of the measure is to improve coupling between situation and awareness according to process plant properties and operator cognitive work. A companion article presents the empirical evaluation of the Process Overview Measure in a realistic process control setting. The Process Overview Measure demonstrated sensitivity and validity by revealing significant effects of experimental manipulations that corroborated with other empirical results. The measure also demonstrated adequate inter-rater reliability and practicality for measuring SA based on data collected by process experts.
Practitioner Summary: The Process Overview Measure is a query-based measure for assessing operator situation awareness from monitoring process plants in representative settings. 相似文献
65.
Alessandro Farinelli Masoume M. Raeissi Nicolo’ Marchi Nathan Brooks Paul Scerri 《Autonomous Agents and Multi-Agent Systems》2017,31(2):332-361
Team oriented plans have become a popular tool for operators to control teams of autonomous robots to pursue complex objectives in complex environments. Such plans allow an operator to specify high level directives and allow the team to autonomously determine how to implement such directives. However, the operators will often want to interrupt the activities of individual team members to deal with particular situations, such as a danger to a robot that the robot team cannot perceive. Previously, after such interrupts, the operator would usually need to restart the team plan to ensure its success. In this paper, we present an approach to encoding how interrupts can be smoothly handled within a team plan. Building on a team plan formalism that uses Colored Petri Nets, we describe a mechanism that allows a range of interrupts to be handled smoothly, allowing the team to efficiently continue with its task after the operator intervention. We validate the approach with an application of robotic watercraft and show improved overall efficiency. In particular, we consider a situation where several platforms should travel through a set of pre-specified locations, and we identify three specific cases that require the operator to interrupt the plan execution: (i) a boat must be pulled out; (ii) all boats should stop the plan and move to a pre-specified assembly position; (iii) a set of boats must synchronize to traverse a dangerous area one after the other. Our experiments show that the use of our interrupt mechanism decreases the time to complete the plan (up to 48 % reduction) and decreases the operator load (up to 80 % reduction in number of user actions). Moreover, we performed experiments with real robotic platforms to validate the applicability of our mechanism in the actual deployment of robotic watercraft. 相似文献
66.
Ariel Felner Uzi Zahavi Robert Holte Jonathan Schaeffer Nathan Sturtevant Zhifu Zhang 《Artificial Intelligence》2011,175(9-10):1570-1603
In the field of heuristic search it is usually assumed that admissible heuristics are consistent, implying that consistency is a desirable attribute. The term “inconsistent heuristic” has, at times, been portrayed negatively, as something to be avoided. Part of this is historical: early research discovered that inconsistency can lead to poor performance for A? (nodes might be re-expanded many times). However, the issue has never been fully investigated, and was not re-considered after the invention of IDA?.This paper shows that many of the preconceived notions about inconsistent heuristics are outdated. The worst-case exponential time of inconsistent heuristics is shown to only occur on contrived graphs with edge weights that are exponential in the size of the graph. Furthermore, the paper shows that rather than being something to be avoided, inconsistent heuristics often add a diversity of heuristic values into a search which can lead to a reduction in the number of node expansions. Inconsistent heuristics are easy to create, contrary to the common perception in the AI literature. To demonstrate this, a number of methods for achieving effective inconsistent heuristics are presented.Pathmax is a way of propagating inconsistent heuristic values in the search from parent to children. This technique is generalized into bidirectional pathmax (BPMX) which propagates values from a parent to a child node, and vice versa. BPMX can be integrated into IDA? and A?. When inconsistent heuristics are used with BPMX, experimental results show a large reduction in the search effort required by IDA?. Positive results are also presented for A? searches. 相似文献
67.
A discrete-time control problem of a finite-state hidden Markov chain partially observed in a fractional Gaussian process is discussed using filtering. The control problem is then recast as a separated problem with information variables given by the unnormalized conditional probabilities of the whole path of the hidden Markov chain. A dynamic programming result and a minimum principle are obtained. 相似文献
68.
We present a linear system for modelling 3D surfaces from curves. Our system offers better performance, stability and precision in control than previous non‐linear systems. By exploring the direct relationship between a standard higher‐order Laplacian editing framework and Hermite spline curves, we introduce a new form of Cauchy constraint that makes our system easy to both implement and control. We introduce novel workflows that simplify the construction of 3D models from sketches. We show how to convert existing 3D meshes into our curve‐based representation for subsequent editing and modelling, allowing our technique to be applied to a wide range of existing 3D content. 相似文献
69.
The Stanford Hydra CMP 总被引:5,自引:0,他引:5
The Hydra chip multiprocessor (CMP) integrates four MIPS-based processors and their primary caches on a single chip together with a shared secondary cache. A standard CMP offers implementation and performance advantages compared to wide-issue superscalar designs. However, it must be programmed with a more complicated parallel programming model to obtain maximum performance. To simplify parallel programming, the Hydra CMP supports thread-level speculation and memory renaming, a paradigm that allows performance similar to a uniprocessor of comparable die area on integer programs. This article motivates the design of a CMP, describes the architecture of the Hydra design with a focus on its speculative thread support, and describes our prototype implementation. Chip multiprocessors offer an economical, scalable architecture for future microprocessors. Thread-level speculation support allows them to speed up past software 相似文献
70.
David M. Mount Nathan S. Netanyahu Kathleen Romanik Ruth Silverman 《Computational statistics & data analysis》2007,51(5):2461-2486
The problem of fitting a straight line to a finite collection of points in the plane is an important problem in statistical estimation. Robust estimators are widely used because of their lack of sensitivity to outlying data points. The least median-of-squares (LMS) regression line estimator is among the best known robust estimators. Given a set of n points in the plane, it is defined to be the line that minimizes the median squared residual or, more generally, the line that minimizes the residual of any given quantile q, where 0<q?1. This problem is equivalent to finding the strip defined by two parallel lines of minimum vertical separation that encloses at least half of the points.The best known exact algorithm for this problem runs in O(n2) time. We consider two types of approximations, a residual approximation, which approximates the vertical height of the strip to within a given error bound εr?0, and a quantile approximation, which approximates the fraction of points that lie within the strip to within a given error bound εq?0. We present two randomized approximation algorithms for the LMS line estimator. The first is a conceptually simple quantile approximation algorithm, which given fixed q and εq>0 runs in O(nlogn) time. The second is a practical algorithm, which can solve both types of approximation problems or be used as an exact algorithm. We prove that when used as a quantile approximation, this algorithm's expected running time is . We present empirical evidence that the latter algorithm is quite efficient for a wide variety of input distributions, even when used as an exact algorithm. 相似文献