全文获取类型
收费全文 | 127篇 |
免费 | 13篇 |
国内免费 | 16篇 |
专业分类
综合类 | 11篇 |
机械仪表 | 1篇 |
建筑科学 | 17篇 |
矿业工程 | 2篇 |
轻工业 | 1篇 |
水利工程 | 4篇 |
无线电 | 7篇 |
自动化技术 | 113篇 |
出版年
2023年 | 2篇 |
2022年 | 1篇 |
2021年 | 1篇 |
2020年 | 2篇 |
2019年 | 3篇 |
2018年 | 6篇 |
2017年 | 10篇 |
2016年 | 5篇 |
2015年 | 14篇 |
2014年 | 16篇 |
2013年 | 16篇 |
2012年 | 13篇 |
2011年 | 19篇 |
2010年 | 11篇 |
2009年 | 11篇 |
2008年 | 10篇 |
2007年 | 8篇 |
2006年 | 1篇 |
2005年 | 2篇 |
2004年 | 1篇 |
2002年 | 2篇 |
1999年 | 1篇 |
1993年 | 1篇 |
排序方式: 共有156条查询结果,搜索用时 0 毫秒
101.
In a number of emerging streaming applications, the data values that are produced have an associated time interval for which they are valid. A useful computation over such streaming data is to produce a continuous and valid skyline summary. Previous work on skyline algorithms have only focused on evaluating skylines over static data sets, and there are no known algorithms for skyline computation in the continuous setting. In this paper, we introduce the continuous time-interval skyline operator, which continuously computes the current skyline over a data stream. We present a new algorithm called LookOut for evaluating such queries efficiently, and empirically demonstrate the scalability of this algorithm. In addition, we also examine the effect of the underlying spatial index structure when evaluating skylines. Whereas previous work on skyline computations have only considered using the R∗-tree index structure, we show that for skyline computations using an underlying quadtree has significant performance benefits over an R∗-tree index. 相似文献
102.
基于Skyline与GIS技术,利用Microsoft Visual Studio2005平台的C#.Net语言进行二次开发,搭建了堰塞湖应急管理系统平台,该平台较好地与数据库及GIS系统相融合,具有信息服务(增、删、改、查等)、三维展示(空间查看、飞行、地图导航、空间信息查询、三维信息标注、3D模型加载、专题图层的管理等)、空间分析(空间距离测量、面积测量、生成横断面、生成等高线等)以及专业的淹没分析、体积估算、洪水演进、风险评价和灾情评估等功能,为堰塞湖应急管理提供了辅助决策平台. 相似文献
103.
104.
天际线检测在视觉导航、地理图像标注中有着重要的作用。首先采用区域协方差算法对图像进行初分割,确定天际线检测的目标区域;接着根据分析数据集中的样本图片梯度值得到的最优梯度阈值,在初分割的天际线检测目标区域,提出一种循环梯度算法来检测出图像中各列的天际线位置坐标;最后采用中值滤波算法对检测的天际线各点坐标值进行校正,消除可能存在的天际线奇异点,检测出输入图像中的天际线。所提算法在内华达大学机器视觉实验室Web set和Baatz set数据集上进行了测试,实验结果表明:提出的算法能有效地检测出数据集中输入图像的天际线,不需要对图像的边缘信息进行提取,具有良好的有效性和时效性。 相似文献
105.
How to process a skyline query efficiently has received considerable attention in recent years. A skyline query identifies a set of non-dominated data records in a multidimensional dataset. Whereas most previous studies have resolved this problem in a centralized environment, this work considers it in a distributed sensor network environment. An algorithm, known as Skyline Sensor Algorithm (SkySensor), is presented to efficiently retrieve skyline results from a sensor network. A cluster-based architecture is designed in SkySensor to collect all sensor readings. A pruning method is then proposed to progressively sift out the skyline results from the sensor network. SkySensor avoids the need of collecting data from all sensors in the network, which is an extremely expensive action, when searching for the skyline results. The performance study indicates that SkySensor is highly efficient, and significantly outperforms previous methods in processing skyline queries. 相似文献
106.
由于无线传感器网络的能源有限,且在许多应用中Skyline 查询的部分结果即可满足用户需求,提出了一
种近似Skyline 查询处理算法,在满足用户查询需求的前提下最大化地节省能量.该算法仅需无线传感器网络中的部
分传感器节点回传其感知数据即可计算出Skyline 查询的一个近似结果集.由于该算法在处理查询时,每个传感器节
点只需考察自身数据信息即可决定是否回传其感知数据,而无须与其他传感器节点的感知数据进行比较,因此可以
避免大量的网内通信开销,从而节省网络能源.模拟环境下的大量实验结果表明,该算法可以根据用户的应用需求,
节能地处理传感器网络中的近似skyline 查询. 相似文献
107.
108.
Shiyuan Wang Quang Hieu Vu Beng Chin Ooi Anthony K. H. Tung Lizhen Xu 《The VLDB Journal The International Journal on Very Large Data Bases》2009,18(1):345-362
This paper looks at the processing of skyline queries on peer-to-peer (P2P) networks. We propose Skyframe, a framework for
efficient skyline query processing in P2P systems, which addresses the challenges of quick response time, low network communication
cost and query load balancing among peers. Skyframe consists of two querying methods: one is optimized for network communication
while the other focuses on query response time. These methods are different in the way in which the query search space is
defined. In particular, the first method uses a high dominating point that has a large dominating region to prune the search
space to achieve a low cost in network communication. On the other hand, the second method relaxes the search space in order
to allow parallel query processing to speed up query response. Skyframe achieves query load balancing by both query load conscious
data space splitting/merging during the join/departure of nodes and dynamic load migration. We further show how to apply Skyframe
to both the P2P systems supporting multi-dimensional indexing and the P2P systems supporting single-dimensional indexing.
Finally, we have conducted extensive experiments on both real and synthetic data sets over two existing P2P systems: CAN (Ratnasamy
in A scalable content-addressable network. In: Proceedings of SIGCOMM Conference, pp. 161–172, 2001) and BATON (Jagadish et
al. in A balanced tree structure for peer-to-peer networks. In: Proceedings of VLDB Conference, pp. 661–672, 2005) to evaluate
the effectiveness and scalability of Skyframe. 相似文献
109.
Bee-Chung Chen Kristen LeFevre Raghu Ramakrishnan 《The VLDB Journal The International Journal on Very Large Data Bases》2009,18(2):429-467
Privacy is an important issue in data publishing. Many organizations distribute non-aggregate personal data for research,
and they must take steps to ensure that an adversary cannot predict sensitive information pertaining to individuals with high
confidence. This problem is further complicated by the fact that, in addition to the published data, the adversary may also
have access to other resources (e.g., public records and social networks relating individuals), which we call adversarial knowledge. A robust privacy framework should allow publishing organizations to analyze data privacy by means of not only data dimensions (data that a publishing organization has), but also adversarial-knowledge dimensions (information not in the data). In this paper, we first describe a general framework for reasoning about privacy in the presence
of adversarial knowledge. Within this framework, we propose a novel multidimensional approach to quantifying adversarial knowledge.
This approach allows the publishing organization to investigate privacy threats and enforce privacy requirements in the presence
of various types and amounts of adversarial knowledge. Our main technical contributions include a multidimensional privacy
criterion that is more intuitive and flexible than previous approaches to modeling background knowledge. In addition, we identify
an important congregation property of the adversarial-knowledge dimensions. Based on this property, we provide algorithms for measuring disclosure
and sanitizing data that improve computational efficiency several orders of magnitude over the best known techniques. 相似文献
110.