全文获取类型
收费全文 | 1126篇 |
免费 | 59篇 |
国内免费 | 75篇 |
专业分类
电工技术 | 5篇 |
综合类 | 40篇 |
化学工业 | 4篇 |
机械仪表 | 10篇 |
建筑科学 | 4篇 |
矿业工程 | 4篇 |
能源动力 | 2篇 |
轻工业 | 1篇 |
石油天然气 | 1篇 |
武器工业 | 3篇 |
无线电 | 144篇 |
一般工业技术 | 7篇 |
冶金工业 | 4篇 |
自动化技术 | 1031篇 |
出版年
2024年 | 2篇 |
2023年 | 8篇 |
2022年 | 3篇 |
2021年 | 7篇 |
2020年 | 8篇 |
2019年 | 7篇 |
2018年 | 7篇 |
2017年 | 25篇 |
2016年 | 18篇 |
2015年 | 48篇 |
2014年 | 56篇 |
2013年 | 30篇 |
2012年 | 59篇 |
2011年 | 86篇 |
2010年 | 76篇 |
2009年 | 84篇 |
2008年 | 90篇 |
2007年 | 112篇 |
2006年 | 86篇 |
2005年 | 67篇 |
2004年 | 62篇 |
2003年 | 48篇 |
2002年 | 46篇 |
2001年 | 48篇 |
2000年 | 49篇 |
1999年 | 31篇 |
1998年 | 24篇 |
1997年 | 11篇 |
1996年 | 11篇 |
1995年 | 12篇 |
1994年 | 7篇 |
1993年 | 4篇 |
1992年 | 1篇 |
1991年 | 2篇 |
1990年 | 5篇 |
1989年 | 5篇 |
1988年 | 1篇 |
1986年 | 1篇 |
1985年 | 3篇 |
1984年 | 1篇 |
1983年 | 2篇 |
1982年 | 1篇 |
1981年 | 1篇 |
1980年 | 1篇 |
1978年 | 2篇 |
1977年 | 1篇 |
1973年 | 1篇 |
排序方式: 共有1260条查询结果,搜索用时 31 毫秒
171.
An evaluation of XML queries such as XQuery or XPath expressions represents a challenging task due to its complexity. Many algorithms have been introduced to cope with this problem. Some of them, called binary joins, evaluate separated parts of a query and subsequently merge intermediate results, while the others, called holistic twig joins, evaluate a query as a whole. Moreover, these algorithms also differ in what index data structure they use to handle XML data. There exist cost-based approaches utilizing binary joins and various index data structures; however, they share a limitation. The limitation is that they cannot perform a join between query nodes not having a direct XPath relationship. Such a join can be advantageous especially if their joint selectivity is high. Since holistic joins work with all query nodes they overcome this limitation. In this article, we introduce such a holistic twig join called CostTwigJoin. To the best of our knowledge, CostTwigJoin is the first holistic join capable of combining various index data structures during an evaluation of an XML query. Usage of the holistic join has yet another advantage for cost-based approaches: an optimizer does not have to resolve the order of binary joins; therefore, the search space is reduced. In this article, we perform thorough experiments on hundreds of queries to evaluate our approach and demonstrate its advantages. 相似文献
172.
In this paper we demonstrate that it is possible to enrich query answering with a short data movie that gives insights to the original results of an OLAP query. Our method, implemented in an actual system, CineCubes, includes the following steps. The user submits a query over an underlying star schema. Taking this query as input, the system comes up with a set of queries complementing the information content of the original query, and executes them. For each of the query results, we execute a set of highlight extraction algorithms that identify interesting patterns and values in the data of the results. Then, the system visualizes the query results and accompanies this presentation with a text commenting on the result highlights. Moreover, via a text-to-speech conversion the system automatically produces audio for the constructed text. Each combination of visualization, text and audio practically constitutes a movie, which is wrapped as a PowerPoint presentation and returned to the user. 相似文献
173.
Although nonuniform memory access architecture provides better scalability for multicore systems, cores accessing memory on remote nodes take longer than those accessing on local nodes. Remote memory access accompanied by contention for internode interconnection degrades performance. Properly mapping threads to cores and data accessed to their nodes can substantially improve performance and energy efficiency. However, an operating system kernel's load-balancing activity may migrate threads across nodes, which thus messes up the thread mapping. Besides, subsequent data mapping behavior pays for the cost of page migration to reduce remote memory access. Once unsuitable threads are migrated, it is detrimental to system performance. This paper focuses on improving the kernel's internode load balancing on nonuniform memory access systems. We develop a memory-aware kernel mechanism and policies to reduce remote memory access incurred by internode thread migration. The Linux kernel's load balancing mechanism is modified to incorporate selection policies in the internode thread migration, and the kernel is modified to track the amount of memory used by each thread on each node. With this information, well-designed policies can then choose suitable threads for internode migration. The purpose is to avoid migrating a thread that might incur relatively more remote memory access and page migration. The experimental results show that with our mechanism and the proposed selection policies, the system performance is substantially increased when compared with the unmodified Linux kernel that does not consider memory usage and always migrates the first-fit thread in the runqueue that can be migrated to the target central processing unit. 相似文献
174.
Syed Adeel Ali Shah Ejaz Ahmed Muhammad Ahsan Qureshi Sadeeq Jan Rafidah MD Noor 《International Journal of Communication Systems》2019,32(13)
In safety‐critical scenarios, reliable reception of beacons transmitted by a subject vehicle is critical to avoid vehicle collision. According to the employed contention window sizes in IEEE 802.11p, beacons are transmitted with a small contention window size. As a result, multiple vehicles contend for the shared channel access by selecting the same back‐off slot. This is a perfect recipe for synchronous collisions wherein reliable beacon delivery cannot be guaranteed for any vehicle. We consider the problem of selecting the back‐off slots from the current contention window to provide reliable delivery of beacons transmitted by a subject vehicle to its neighbors. Given a safety scenario, we propose a Pseudo‐Random Number Generator (PRNG)‐inspired back‐off selection (PBS) technique. The proposed technique works on the hypothesis that synchronous collisions of beacons transmitted by a subject vehicle can be reduced if all its neighbors select different back‐off slots (ie, not the back‐off slot selected by the subject vehicle). The discrete‐event simulations demonstrate that PBS can increase the overall message reception from a subject vehicle, in comparison with the uniform random probability back‐off selection in IEEE 802.11p. 相似文献
175.
The directional antennas and beamforming techniques in millimeter wave (mmWave) bands are used to make concurrent transmission between multiple flows become possible.However,higher mutual interference may be caused by concurrent transmission.Therefore,when the time slots were limited and the number of data flows was large,how to schedule the concurrent flows efficiently was solved by proposed algorithm.The contention graph based spatial-time division multiple access (CB-STDMA) concurrent scheduling algorithm guaranteed the quality of service (QoS) of users,and aimed at maximizing the number of flows with their QoS requirements satisfied.It considered the interference between different flows,and a higher priority was given to the flow with fewer time slots requirement.Extensive simulations demonstrated that the proposed CB-STDMA algorithm increased the number of flows with their QoS requirements satisfied and the network throughput by 50% and 20% respectively compared with the existing algorithms. 相似文献
176.
SOH(SQL over HDFS)系统通常将数据存储于分布式文件系统HDFS中,采用Map/Reduce或分布式查询引擎来处理查询任务。得益于HDFS以及Map/Reduce的容错能力和可扩展性,SOH系统可以很好地应对数据规模的飞速增长,完成分析型查询处理。然而,在处理选择型查询或交互式查询时,这类系统暴露出性能上的缺陷。本文提出一个通用的索引技术,可以应用于SOH系统中,以提高其查询处理的效率。分析了SOH系统访问HDFS文件的过程,指出了其中影响数据加载时间的关键因素;提出了split层和split内部双层索引机制;设计并实现了聚集索引和非聚集索引。最后,在标准数据集上进行了大量实验,并与现有基于HDFS的索引技术进行了比较。实验结果表明,所提出的索引技术可以有效地提高查询处理的效率。 相似文献
177.
高校资料室是重要的教学、科研信息中心。提高资料的利用效率,最大限度地满足教学、科研的需要是人们追求的目标。本文通过资料室管理各部分功能的分析,设计了资料室管理系统的体系结构,叙述了基于VC++6.0环境开发本系统的具体过程,并重点阐述了系统实现过程中数据库操作和网络连接技术的应用。 相似文献
178.
Modeling and performance analysis of VI‐CRA: A congestion control algorithm for vehicular networks
下载免费PDF全文
![点击此处可从《International Journal of Communication Systems》网站下载免费的PDF全文](/ch/ext_images/free.gif)
This study proposes a Vehicle ID‐based CAM Rate Adaptation (VI‐CRA) algorithm for beacon messages in the vehicular network. Foremost, an improved vehicle ID–based analytical model is proposed at the MAC layer of vehicular network. The model weighs the random back‐off number chosen by vehicles participating in the back‐off process, with the vehicle ID incorporated in their respective CAMs. This eventually leads to the selection of a vehicle ID–based random back‐off number, minimizing the probability of collision due to same back‐off number selection. It is worth noting that the improved analytical model outperforms the existing works in terms of average packet delay since only one fourth of the contention window size is used throughout the simulation. To enhance the performance of the analytical model, the paper incorporates a congestion control algorithm, by adapting the rate of CAM broadcast over the control channel. The algorithm is designed considering a wide range of scenarios, ranging from nonsaturated to extremely saturated network (in terms of collision probability) and sparsely distributed to teemed network (in terms of vehicular density). For better analyses of simulation results, the algorithm is applied over different vehicle ID–based back‐off numbers. Simulation results for all the back‐off numbers show that vehicle ID–based CAM rate adaptation algorithm performs better than the traditional fixed CAM rate IEEE 802.11p, even at high vehicular density. 相似文献
179.
180.
Steve Jones Shona McInnes Mark S. Staveley 《International Journal on Digital Libraries》1999,2(2-3):207-223
Online information repositories commonly provide keyword search facilities through textual query languages based on Boolean
logic. However, there is evidence to suggest that the syntactic demands of such languages can lead to user errors and adversely
affect the time that it takes users to form queries. Users also face difficulties because of the conflict in semantics between
AND and OR when used in Boolean logic and English language. Analysis of usage logs for the New Zealand Digital Library (NZDL)
show that few Boolean queries contain more than three terms, use of the intersection operator dominates and that query refinement
is common. We suggest that graphical query languages, in particular Venn-like diagrams, can alleviate the problems that users
experience when forming Boolean expressions with textual languages. A study of the utility of Venn diagrams for query specification
indicates that with little or no training users can interpret and form Venn-like diagrams in a consistent manner which accurately
correspond to Boolean expressions. We describe VQuery, a Venn-diagram based user interface to the New Zealand Digital Library
(NZDL). In a study which compared VQuery with a standard textual Boolean interface, users took significantly longer to form
queries and produced more erroneous queries when using VQuery. We discuss the implications of these results and suggest directions
for future work.
Received: 15 December 1997 / Revised: June 1999 相似文献