全文获取类型
收费全文 | 115篇 |
免费 | 6篇 |
专业分类
化学工业 | 23篇 |
金属工艺 | 1篇 |
机械仪表 | 11篇 |
建筑科学 | 6篇 |
矿业工程 | 2篇 |
能源动力 | 5篇 |
轻工业 | 20篇 |
无线电 | 8篇 |
一般工业技术 | 14篇 |
冶金工业 | 5篇 |
自动化技术 | 26篇 |
出版年
2023年 | 1篇 |
2022年 | 3篇 |
2021年 | 8篇 |
2020年 | 1篇 |
2019年 | 6篇 |
2018年 | 1篇 |
2017年 | 7篇 |
2016年 | 9篇 |
2015年 | 2篇 |
2014年 | 4篇 |
2013年 | 3篇 |
2012年 | 7篇 |
2011年 | 12篇 |
2010年 | 6篇 |
2009年 | 5篇 |
2008年 | 5篇 |
2007年 | 6篇 |
2006年 | 8篇 |
2005年 | 2篇 |
2004年 | 3篇 |
2003年 | 4篇 |
2000年 | 2篇 |
1998年 | 2篇 |
1997年 | 2篇 |
1995年 | 1篇 |
1990年 | 1篇 |
1989年 | 1篇 |
1987年 | 1篇 |
1983年 | 2篇 |
1982年 | 2篇 |
1981年 | 1篇 |
1980年 | 2篇 |
1977年 | 1篇 |
排序方式: 共有121条查询结果,搜索用时 15 毫秒
1.
Effects of storage period on hydroxymethylfurfural, pH and colour were studied in white hard grape pekmez (Zile pekmezi), a Turkish traditional product. Pekmez samples were stored at 20 °C for 8 months. Analysis of variance revealed significant differences in hydroxymethylfurfural, pH, L, a and b values (P<0.01) based on storage time. 相似文献
2.
The kernelized fuzzy c-means algorithm uses kernel methods to improve the clustering performance of the well known fuzzy c-means algorithm by mapping a given dataset into a higher dimensional space non-linearly. Thus, the newly obtained dataset is more likely to be linearly seprable. However, to further improve the clustering performance, an optimization method is required to overcome the drawbacks of the traditional algorithms such as, sensitivity to initialization, trapping into local minima and lack of prior knowledge for optimum paramaters of the kernel functions. In this paper, to overcome these drawbacks, a new clustering method based on kernelized fuzzy c-means algorithm and a recently proposed ant based optimization algorithm, hybrid ant colony optimization for continuous domains, is proposed. The proposed method is applied to a dataset which is obtained from MIT–BIH arrhythmia database. The dataset consists of six types of ECG beats including, Normal Beat (N), Premature Ventricular Contraction (PVC), Fusion of Ventricular and Normal Beat (F), Artrial Premature Beat (A), Right Bundle Branch Block Beat (R) and Fusion of Paced and Normal Beat (f). Four time domain features are extracted for each beat type and training and test sets are formed. After several experiments it is observed that the proposed method outperforms the traditional fuzzy c-means and kernelized fuzzy c-means algorithms. 相似文献
3.
As software systems continue to play an important role in our daily lives, their quality is of paramount importance. Therefore, a plethora of prior research has focused on predicting components of software that are defect-prone. One aspect of this research focuses on predicting software changes that are fix-inducing. Although the prior research on fix-inducing changes has many advantages in terms of highly accurate results, it has one main drawback: It gives the same level of impact to all fix-inducing changes. We argue that treating all fix-inducing changes the same is not ideal, since a small typo in a change is easier to address by a developer than a thread synchronization issue. Therefore, in this paper, we study high impact fix-inducing changes (HIFCs). Since the impact of a change can be measured in different ways, we first propose a measure of impact of the fix-inducing changes, which takes into account the implementation work that needs to be done by developers in later (fixing) changes. Our measure of impact for a fix-inducing change uses the amount of churn, the number of files and the number of subsystems modified by developers during an associated fix of the fix-inducing change. We perform our study using six large open source projects to build specialized models that identify HIFCs, determine the best indicators of HIFCs and examine the benefits of prioritizing HIFCs. Using change factors, we are able to predict 56 % to 77 % of HIFCs with an average false alarm (misclassification) rate of 16 %. We find that the lines of code added, the number of developers who worked on a change, and the number of prior modifications on the files modified during a change are the best indicators of HIFCs. Lastly, we observe that a specialized model for HIFCs can provide inspection effort savings of 4 % over the state-of-the-art models. We believe our results would help practitioners prioritize their efforts towards the most impactful fix-inducing changes and save inspection effort. 相似文献
4.
5.
Ayse Tosun Oscar Dieste Davide Fucci Sira Vegas Burak Turhan Hakan Erdogmus Adrian Santos Markku Oivo Kimmo Toro Janne Jarvinen Natalia Juristo 《Empirical Software Engineering》2017,22(6):2763-2805
Existing empirical studies on test-driven development (TDD) report different conclusions about its effects on quality and productivity. Very few of those studies are experiments conducted with software professionals in industry. We aim to analyse the effects of TDD on the external quality of the work done and the productivity of developers in an industrial setting. We conducted an experiment with 24 professionals from three different sites of a software organization. We chose a repeated-measures design, and asked subjects to implement TDD and incremental test last development (ITLD) in two simple tasks and a realistic application close to real-life complexity. To analyse our findings, we applied a repeated-measures general linear model procedure and a linear mixed effects procedure. We did not observe a statistical difference between the quality of the work done by subjects in both treatments. We observed that the subjects are more productive when they implement TDD on a simple task compared to ITLD, but the productivity drops significantly when applying TDD to a complex brownfield task. So, the task complexity significantly obscured the effect of TDD. Further evidence is necessary to conclude whether TDD is better or worse than ITLD in terms of external quality and productivity in an industrial setting. We found that experimental factors such as selection of tasks could dominate the findings in TDD studies. 相似文献
6.
Ali Şaman Tosun 《Distributed and Parallel Databases》2006,19(2-3):107-124
Declustering is a common technique used to reduce query response times. Data is declustered over multiple disks and query
retrieval can be parallelized. Most of the research on declustering is targeted at spatial range queries and investigates
schemes with low additive error. Recently, declustering using replication has been proposed to reduce the additive overhead.
Replication significantly reduces retrieval cost of arbitrary queries. In this paper, we propose a disk allocation and retrieval
mechanism for arbitrary queries based on design theory. Using the proposed c-copy replicated declustering scheme,
buckets can be retrieved using at most k disk accesses. Retrieval algorithm is very efficient and is asymptotically optimal with
complexity for a query Q. In addition to the deterministic worst-case bound and efficient retrieval, proposed algorithm handles nonuniform data, high
dimensions, supports incremental declustering and has good fault-tolerance property. Experimental results show the feasibility
of the algorithm.
Recommended by: Sunil Prabhakar 相似文献
7.
Isil Oz Haluk Rahmi Topcuoglu Mahmut Kandemir Oguz Tosun 《Journal of Parallel and Distributed Computing》2012
Continuously reducing transistor sizes and aggressive low power operating modes employed by modern architectures tend to increase transient error rates. Concurrently, multicore machines are dominating the architectural spectrum today in various application domains. These two trends require a fresh look at resiliency of multithreaded applications against transient errors from a software perspective. In this paper, we propose and evaluate a new metric called the Thread Vulnerability Factor (TVF). A distinguishing characteristic of TVF is that its calculation for a given thread (which is typically one of the threads of a multithreaded application) does not depend on its code alone, but also on the codes of the threads that share resources and data with that thread. As a result, we decompose TVF of a thread into two complementary parts: local and remote. While the former captures the TVF induced by the code of the target thread, the latter represents the vulnerability impact of the threads that interact with the target thread. We quantify the local and remote TVF values for three architectural components (register file, ALUs, and caches) using a set of ten multithreaded applications from the Parsec and Splash-2 benchmark suites. Our experimental evaluation shows that TVF values tend to increase as the number of cores increases, which means the system becomes more vulnerable as the core count rises. We further discuss how TVF metric can be employed to explore performance–reliability tradeoffs in multicores. Reliability-based analysis of compiler optimizations and redundancy-based fault tolerance are also mentioned as potential usages of our TVF metric. 相似文献
8.
Suleyman Tosun 《The Journal of supercomputing》2012,62(1):265-289
Scheduling periodic tasks onto a multiprocessor architecture under several constraints such as performance, cost, energy, and reliability is a major challenge in embedded systems. In this paper, we present an Integer Linear Programming (ILP) based framework that maps a given task set onto an Heterogeneous Multiprocessor System-on-Chip (HMPSoC) architecture. Our framework can be used with several objective functions; minimizing energy consumption, minimizing cost (i.e., the number of heterogeneous processors), and maximizing reliability of the system under performance constraints. We use Dynamic Voltage Scaling (DVS) for reducing energy consumption while we employ task duplication to maximize reliability. We illustrate the effectiveness of our approach through several experiments, each with a different number of tasks to be scheduled. We also propose two heuristics based on Earliest Deadline First (EDF) algorithm for minimizing energy under performance and cost constraints. Our experiments on generated task sets show that ILP-based method reduces the energy consumption up to 62% percent against a method that does not apply DVS. Heuristic methods obtain promising results when compared to optimal results generated by our ILP-based method. 相似文献
9.
Rukiye Babacan Tosun Kadriye Özlem Hamaloğlu Cengiz Kavaklı Pınar Akkaş Kavaklı Ali Tuncel 《International Journal of Hydrogen Energy》2021,46(29):15482-15496
A reusable catalyst with dual active center for chemical water oxidation is synthesized for the first time by immobilization of iridium oxide nanoparticles (IrO2 NPs) on monodisperse-porous manganese oxide microspheres acting both catalytic active center and support. Individual catalytic activity of manganese oxide microspheres is explained by multiple oxidation states of manganese which are capable of forming oxidative oxygen species. Monodisperse-porous microspheres in the form of Mn5O8, MnO2 and Mn2O3 are used for synthesis of different catalysts and the highest activity in water oxidation is observed with the catalyst synthesized using Mn5O8 microspheres. The catalytic activity is correlated with the total Mn(II) and Mn(III) percentage of manganese oxide type selected for composite catalyst. The oxygen evolution up to 244 μmol is achieved in 30 min with the catalyst synthesized using Mn5O8 microspheres. Maximum TON and TOF numbers are obtained as 298 and 557 h?1 with excellent reusability. 相似文献
10.