全文获取类型
收费全文 | 11883篇 |
免费 | 1815篇 |
国内免费 | 2371篇 |
专业分类
电工技术 | 101篇 |
综合类 | 787篇 |
化学工业 | 322篇 |
金属工艺 | 66篇 |
机械仪表 | 169篇 |
建筑科学 | 102篇 |
矿业工程 | 45篇 |
能源动力 | 140篇 |
轻工业 | 304篇 |
水利工程 | 20篇 |
石油天然气 | 10篇 |
武器工业 | 23篇 |
无线电 | 1708篇 |
一般工业技术 | 379篇 |
冶金工业 | 31篇 |
原子能技术 | 43篇 |
自动化技术 | 11819篇 |
出版年
2024年 | 206篇 |
2023年 | 569篇 |
2022年 | 687篇 |
2021年 | 820篇 |
2020年 | 703篇 |
2019年 | 578篇 |
2018年 | 708篇 |
2017年 | 1051篇 |
2016年 | 953篇 |
2015年 | 866篇 |
2014年 | 1151篇 |
2013年 | 925篇 |
2012年 | 1106篇 |
2011年 | 1092篇 |
2010年 | 882篇 |
2009年 | 856篇 |
2008年 | 658篇 |
2007年 | 624篇 |
2006年 | 575篇 |
2005年 | 306篇 |
2004年 | 74篇 |
2003年 | 105篇 |
2002年 | 85篇 |
2001年 | 70篇 |
2000年 | 65篇 |
1999年 | 63篇 |
1998年 | 22篇 |
1997年 | 27篇 |
1996年 | 26篇 |
1995年 | 17篇 |
1994年 | 16篇 |
1993年 | 9篇 |
1992年 | 7篇 |
1991年 | 4篇 |
1990年 | 8篇 |
1989年 | 7篇 |
1988年 | 30篇 |
1987年 | 33篇 |
1986年 | 47篇 |
1985年 | 3篇 |
1984年 | 3篇 |
1983年 | 4篇 |
1982年 | 4篇 |
1981年 | 7篇 |
1980年 | 3篇 |
1979年 | 7篇 |
1978年 | 1篇 |
1977年 | 4篇 |
1976年 | 2篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
1.
High dimensionality in real-world multi-reservoir systems greatly hinders the application and popularity of evolutionary algorithms, especially for systems with heterogeneous units. An efficient hierarchical optimization framework is presented for search space reduction, determining the best water distributions, not only between cascade reservoirs, but also among different types of hydropower units. The framework is applied to the Three Gorges Project (TGP) system and the results demonstrate that the difficulties of multi-reservoir optimization caused by high dimensionality can be effectively solved by the proposed hierarchical method. For the day studied, power output could be increased by 6.79 GWh using an optimal decision with the same amount of water actually used; while the same amount of power could be generated with 2.59 × 107 m3 less water compared to the historical policy. The methodology proposed is general in that it can be used for other reservoir systems and other types of heterogeneous unit generators. 相似文献
2.
Steganography is the science of hiding secret message in an appropriate digital multimedia in such a way that the existence of the embedded message should be invisible to anyone apart from the sender or the intended recipient. This paper presents an irreversible scheme for hiding a secret image in the cover image that is able to improve both the visual quality and the security of the stego-image while still providing a large embedding capacity. This is achieved by a hybrid steganography scheme incorporates Noise Visibility Function (NVF) and an optimal chaotic based encryption scheme. In the embedding process, first to reduce the image distortion and to increase the embedding capacity, the payload of each region of the cover image is determined dynamically according to NVF. NVF analyzes the local image properties to identify the complex areas where more secret bits should be embedded. This ensures to maintain a high visual quality of the stego-image as well as a large embedding capacity. Second, the security of the secret image is brought about by an optimal chaotic based encryption scheme to transform the secret image into an encrypted image. Third, the optimal chaotic based encryption scheme is achieved by using a hybrid optimization of Particle Swarm Optimization (PSO) and Genetic Algorithm (GA) which is allowing us to find an optimal secret key. The optimal secret key is able to encrypt the secret image so as the rate of changes after embedding process be decreased which results in increasing the quality of the stego-image. In the extracting process, the secret image can be extracted from the stego-image losslessly without referring to the original cover image. The experimental results confirm that the proposed scheme not only has the ability to achieve a good trade-off between the payload and the stego-image quality, but also can resist against the statistics and image processing attacks. 相似文献
3.
We investigate the problem of efficient wireless power transfer in wireless sensor networks. In our approach, special mobile entities (called the Mobile Chargers) traverse the network and wirelessly replenish the energy of sensor nodes. In contrast to most current approaches, we envision methods that are distributed and use limited network information. We propose four new protocols for efficient charging, addressing key issues which we identify, most notably (i) what are good coordination procedures for the Mobile Chargers and (ii) what are good trajectories for the Mobile Chargers. Two of our protocols (DC, DCLK) perform distributed, limited network knowledge coordination and charging, while two others (CC, CCGK) perform centralized, global network knowledge coordination and charging. As detailed simulations demonstrate, one of our distributed protocols outperforms a known state of the art method, while its performance gets quite close to the performance of the powerful centralized global knowledge method. 相似文献
4.
Many argue that digital technologies have the potential to enhance the teaching and learning of mathematics. However, the availability of technology is not sufficient to realise this potential. The study reported takes a detailed approach to investigate the utility of the particular offerings of the available technologies in the teaching and learning of a specific area of mathematics, functions. Sixteen affordances identified in the data are described. The complexity of the process involved in resolving a situation where particular affordances would be useful so as they are perceived and enacted is detailed. Finally, a grounded theory framework arising from the data analysis from this study that can be used to explain, predict and guide action in other digital environments is presented. 相似文献
5.
An Intermediate Bulk Container (IBC) was punctured during its handling, releasing oil onto soil at an environmentally-sensitive region of Australia. The telehandler did not pierce the plastic of the IBC directly (as was expected) but rather one of the tynes had caught on the underside of the metal base plate, despite numerous controls being in place at time of spill, revealing a previously unreported mechanism for a fluid spill from handling of petroleum hydrocarbons. The diverse investigation team used a root cause analysis (RCA) technique to identify the underlying cause: the inspection process was inadequate with contributing factors of not using a spotter and design of IBC did not anticipate conditions. Engineering controls were put in place as part of the change management process to help prevent spills from occurring from piercing from telehandler tynes on the current project site. 相似文献
6.
The grouping of pixels based on some similarity criteria is called image segmentation. In this paper the problem of color image segmentation is considered as a clustering problem and a fixed length genetic algorithm (GA) is used to handle it. The effectiveness of GA depends on the objective function (fitness function) and the initialization of the population. A new objective function is proposed to evaluate the quality of the segmentation and the fitness of a chromosome. In fixed length genetic algorithm the chromosomes have same length, which is normally set by the user. Here, a self organizing map (SOM) is used to determine the number of segments in order to set the length of a chromosome automatically. An opposition based strategy is adopted for the initialization of the population in order to diversify the search process. In some cases the proposed method makes the small regions of an image as separate segments, which leads to noisy segmentation. A simple ad hoc mechanism is devised to refine the noisy segmentation. The qualitative and quantitative results show that the proposed method performs better than the state-of-the-art methods. 相似文献
7.
The architectural choices underlying Linked Data have led to a compendium of data sources which contain both duplicated and fragmented information on a large number of domains. One way to enable non-experts users to access this data compendium is to provide keyword search frameworks that can capitalize on the inherent characteristics of Linked Data. Developing such systems is challenging for three main reasons. First, resources across different datasets or even within the same dataset can be homonyms. Second, different datasets employ heterogeneous schemas and each one may only contain a part of the answer for a certain user query. Finally, constructing a federated formal query from keywords across different datasets requires exploiting links between the different datasets on both the schema and instance levels. We present Sina, a scalable keyword search system that can answer user queries by transforming user-supplied keywords or natural-languages queries into conjunctive SPARQL queries over a set of interlinked data sources. Sina uses a hidden Markov model to determine the most suitable resources for a user-supplied query from different datasets. Moreover, our framework is able to construct federated queries by using the disambiguated resources and leveraging the link structure underlying the datasets to query. We evaluate Sina over three different datasets. We can answer 25 queries from the QALD-1 correctly. Moreover, we perform as well as the best question answering system from the QALD-3 competition by answering 32 questions correctly while also being able to answer queries on distributed sources. We study the runtime of SINA in its mono-core and parallel implementations and draw preliminary conclusions on the scalability of keyword search on Linked Data. 相似文献
8.
Crowdsourcing technology offers exciting possibilities for local governments. Specifically, citizens are increasingly taking part in reporting and discussing issues related to their neighborhood and problems they encounter on a daily basis, such as overflowing trash-bins, broken footpaths and lifts, illegal graffiti, and potholes. Pervasive citizen participation enables local governments to respond more efficiently to these urban issues. This interaction between citizens and municipalities is largely promoted by civic engagement platforms, such as See-Click-Fix, FixMyStreet, CitySourced, and OpenIDEO, which allow citizens to report urban issues by entering free text describing what needs to be done, fixed or changed. In order to develop appropriate action plans and priorities, government officials need to figure out how urgent are the reported issues. In this paper we propose to estimate the urgency of urban issues by mining different emotions that are implicit in the text describing the issue. More specifically, a reported issue is first categorized according to the emotions expressed in it, and then the corresponding emotion scores are combined in order to produce a final urgency level for the reported issue. Our experiments use the SeeClickFix hackathon data and diverse emotion classification algorithms. They indicate that (i) emotions can be categorized efficiently with supervised learning algorithms, and (ii) the use of citizen emotions leads to accurate urgency estimates. Further, using additional features such as the type of issue or its author leads to no further accuracy gains. 相似文献
9.
A new matching cost computation method based on nonsubsampled contourlet transform (NSCT) for stereo image matching is proposed in this paper. Firstly, stereo image is decomposed into high frequency sub-band images at different scales and along different directions by NSCT. Secondly, by utilizing coefficients in high frequency domain and grayscales in RGB color space, the computation model of weighted matching cost between two pixels is designed based on the gestalt laws. Lastly, two types of experiments are carried out with standard stereopairs in the Middlebury benchmark. One of the experiments is to confirm optimum values of NSCT scale and direction parameters, and the other is to compare proposed matching cost with nine known matching costs. Experimental results show that the optimum values of scale and direction parameters are respectively 2 and 3, and the matching accuracy of the proposed matching cost is twice higher than that of traditional NCC cost. 相似文献
10.
A double optimal projection method that involves projections for intra-cluster and inter-cluster dimensionality reduction are proposed for video fingerprinting. The video is initially set as a graph with frames as its vertices in a high-dimensional space. A similarity measure that can compute the weights of the edges is then proposed. Subsequently, the video frames are partitioned into different clusters based on the graph model. Double optimal projection is used to explore the optimal mapping points in a low-dimensional space to reduce the video dimensions. The statistics and geometrical fingerprints are generated to determine whether a query video is copied from one of the videos in the database. During matching, the video can be roughly matched by utilizing the statistics fingerprint. Further matching is thereafter performed in the corresponding group using geometrical fingerprints. Experimental results show the good performance of the proposed video fingerprinting method in robustness and discrimination. 相似文献