9,811 Hits in 2.6 sec

Report on the CLEF-IP 2013 Experiments: Multilayer Collection Selection on Topically Organized Patents

Anastasia Giachanou, Michail Salampasis, Maya Satratzemi, Nikolaos Samaras
2013 Conference and Labs of the Evaluation Forum  
For source selection, we tested CORI and a new collection selection method, the Multilayer method. We also tested CORI and SSL results merging algorithms.  ...  We run experiments using different combinations of the number of collections requested and documents retrieved from each collection.  ...  We believe that the discussion and the experiment presented in this paper are also useful to the designers of patent search systems which are based on DIR methods. ACKNOWLEDGMENT.  ... 
dblp:conf/clef/GiachanouSSS13 fatcat:4f3tfeosczh4tmvpkmrpg5ddhi

Report on the CLEF-IP 2012 Experiments: Search of Topically Organized Patents

Michail Salampasis, Georgios Paltoglou, Anastasia Giahanou
2012 Conference and Labs of the Evaluation Forum  
We tested different combinations of source selection (CORI, BordaFuse, Reciprocal Rank) and results merging algorithms (SSL, CORI).  ...  However, the most important aim was to examine how DIR methods will perform if patents are topically organized using their IPC and if DIR methods can approximate the performance of a centralized index  ...  We did an adaptation to source selection algorithms which are used in the experiments.  ... 
dblp:conf/clef/SalampasisPG12 fatcat:loss2v2ozje5nboe7zlytdw4si

CLEF-IP 2011 Working Notes: Utilizing Prior Art Candidate Search Results for Refined IPC Classification

Hyung-Kook Seo, Kyouyeol Han, Jaean Lee
2011 Conference and Labs of the Evaluation Forum  
For the refined IPC classification in the CLEF-IP 2011 task, we constructed classification system with KNN classification which uses PAC (Prior Art Candidate) search results as neighbors.  ...  Our test showed an improved result in the refined IPC classification.  ...  In fact, it's true that model-based classification method works well up to subclass level, so our IPC classification system should use classification model like SVM does.  ... 
dblp:conf/clef/SeoHL11 fatcat:p676kjhcpje3hf2o5g2d3cl5gy

Algorithm-level Feedback-controlled Adaptive data prefetcher: Accelerating data access for high-performance processors

Yong Chen, Huaiyu Zhu, Hui Jin, Xian-He Sun
2012 Parallel Computing  
It can be used for efficient implementation of many data prefetching algorithms [6] .  ...  generic prefetching structure, Data-Access History Cache (DAHC) [6] , and runtime feedback collected by hardware counters.  ...  Adaptive selection After collecting statistics and computing the metrics, the AFA prefetcher makes the decision to adaptively select the suitable prefetching algorithms.  ... 
doi:10.1016/j.parco.2012.06.002 fatcat:cvphilrl5fb27junstmpma5eaa

A Robust Algorithm For Gait Cycle Segmentation

Axel Graeser, Shuo Jiang, Maria Kyrarini, Xingchen Wang
2018 Zenodo  
c) Find the initial potential cycle (IPC) in reference dataset: Two consecutive peaks should be selected in this step as the initial cycle of the algorithm.  ...  The first database is open source gait signal database on the website of Physionet [11] .The data used for test are collected at sampling rate of 100 Hz.  ... 
doi:10.5281/zenodo.1159926 fatcat:e6r4xjlbnzgdpblp3z4ywo5em4

A User-Centered Evaluation of a Web Based Patent Classification Tool

Anastasia Giachanou, Michail Salampasis, Maya Satratzemi, Nikolaos Samaras
2014 iConference  
However, the two systems differ in their ability to allow patent examiners selecting the level from which the results will be returned.  ...  The multilayer algorithm is a collection selection method that uses multiple evidence utilizing (when calculating the relevant IPCs/collections) the ranking of ancestors collections in higher level of  ...  The system can automatically suggest IPCs given a query and be used as a classification search tool. MCS implementation is based on the multilayer collection selection algorithm [GSSS13].  ... 
dblp:conf/iconference/GiachanouSSS14 fatcat:bihnttyyjvczrnojbeedwlbdoq

ASAP: An Automatic Algorithm Selection Approach for Planning

Mauro Vallati, Lukáš Chrpa, Diane Kitchin
2014 International journal on artificial intelligence tools  
This observation motivates the idea of selecting different planning algorithms for different domains.  ...  then (iii) selects the most promising algorithm for optimising either the runtimes or the quality of the solution plans.  ...  Acknowledgments The authors would like to acknowledge the use of the University of Huddersfield Queensgate Grid in carrying out this work.  ... 
doi:10.1142/s021821301460032x fatcat:quv4ih5yhzdbhdpnznuyuhu3ha

DC-BENCH: Dataset Condensation Benchmark [article]

Justin Cui, Ruochen Wang, Si Si, Cho-Jui Hsieh
2022 arXiv   pre-print
To analyze the performance of condensation algorithms under larger compression ratios, we rerun the selected methods with IPC up to 1,000.  ...  Our collection of methods are open-sourced and representative of recent progress, including four Data-Synthesis methods and two Data-Selection methods.  ...  A.7 Impact of different optimizers In Table 8 , we show the results of using SGD optimizer versus Adam optimizer with all IPCs(1, 10, 50) on CIFAR-10.  ... 
arXiv:2207.09639v1 fatcat:dbetw7wtgfbnhi5zhndex4mql4


D. Ali-Sisto, P. Packalen
2017 The International Archives of the Photogrammetry, Remote Sensing and Spatial Information Sciences  
Both IPCs and LiDAR data were used in this process. The IPCs were constructed with the Semi-Global Matching (SGM) algorithm.  ...  In conclusion, the LiDAR data proved to be more accurate method to predict the minor changes in forests than IPCs, but both methods are useful in detection of major changes.  ...  We created IPCs from overlapping aerial stereo images with the Semi-Global Matching (SGM) (Hirschmüller, 2005) algorithm.  ... 
doi:10.5194/isprs-archives-xlii-3-w3-1-2017 fatcat:23wrvvq2njhafiradohn7xbmzu

Development of a Quantitative Recombinase Polymerase Amplification Assay with an Internal Positive Control

Zachary A. Crannell, Brittany Rohrman, Rebecca Richards-Kortum
2015 Journal of Visualized Experiments  
Using HIV-1 DNA quantification as an example, the assembly of real-time RPA reactions, the design of an internal positive control (IPC) sequence, and co-amplification of the IPC and target of interest  ...  Finally, an alternative method for collecting real-time fluorescence data with a microscope and a stage heater as a step towards developing a point-of-care qRPA assay is described.  ...  Instead of adding 3.2 µl of nuclease free water as was done in step 3.2.4, add 0.6 μl of IPC FAM-labeled probe [10 μM], and 2.6 μl of IPC DNA. Figure 6 : 6 Algorithm tunability.  ... 
doi:10.3791/52620 pmid:25867513 pmcid:PMC4401391 fatcat:2mv235nd7ngddgl7cuv7p3nwea

Visual Exploration of Patent Collections with IPC Clouds

Dominik Herr, Qi Han, Steffen Lohmann, Sören Brügmann, Thomas Ertl
2014 Conference on Natural Language Processing  
However, the selection of appropriate IPC symbols can be challenging and there is the risk that important patents are overlooked because relevant IPC symbols are not considered in the search.  ...  The International Patent Classification (IPC) is the most widely used system for the classification of patents.  ...  Once these patents have been loaded into our database, we will investigate if there are distinguishable clusters or patterns of IPC symbols.  ... 
dblp:conf/konvens/HerrHLBE14 fatcat:6j7vbtkkdbfihjgqas22nyuju4

Bandwidth-Aware On-Line Scheduling in SMT Multicores

Josue Feliu, Julio Sahuquillo, Salvador Petit, Jose Duato
2016 IEEE transactions on computers  
To implement the algorithm, the IPC of each process during its last execution quantum, measured with performance counters, is used as predicted IPC for the next quantum.  ...  Xu et al. correct this issue using a polynomial regression, which is not required by the OATR. The pseudocode of the process selection policy is presented in Algorithm 2.  ... 
doi:10.1109/tc.2015.2428694 fatcat:gtsipjvf7nbrnb56at3tfh3e6i

Interactive Process Clustering with t-SNE

Steffen Schumann, Jana-Rebecca Rehse, Sebastian Baumann
2020 International Conference on Business Process Management  
In this paper, we propose an interactive tool to trace clustering based on the t-SNE algorithm.  ...  We also offer the user some guidance with a predefined selection of possible clusters.  ...  Therefore, we designed a novel interactive process clustering (IPC) tool based on the t-SNE algorithm [8] .  ... 
dblp:conf/bpm/SchumannRBRBF20 fatcat:ayidpf2pjjabjcn32nmqu6pzni

A Supervised Requirement-oriented Patent Classification Scheme Based on the Combination of Metadata and Citation Information

Fujin Zhu, Xuefeng Wang, Donghua Zhu, Yuqin Liu
2015 International Journal of Computational Intelligence Systems  
Through a set of experiments on a collection of 14,414 patents in a case study in the technology area of system on a chip (SoC), we recommend using the combination of the metadata and citation information  ...  The former ones, such as the IPC and UPC, are normally developed by different patent offices in the world mainly for the purpose of patentability examination and patent retrieval, while the latter is for  ...  patent classifications, the structure and content of patent collections used, selected algorithms and tools, evaluation approaches, use cases and future challenges of automatic patent classification.  ... 
doi:10.1080/18756891.2015.1023588 fatcat:gj7ofy6yxvadnejhqlpgnpqfwi

Puppeteer: A Random Forest-based Manager for Hardware Prefetchers across the Memory Hierarchy [article]

Furkan Eris, Marcia S. Louis, Kubra Eris, Jose L. Abellan, Ajay Joshi
2022 arXiv   pre-print
Compared to a design with no prefetchers, using Puppeteer we improve IPC by 46.0% in 1 Core (1C), 25.8% in 4 Core (4C), and 11.9% in 8 Core (8C) processors on average across traces generated from SPEC2017  ...  In this work, we propose Puppeteer, which is a hardware prefetcher manager that uses a suite of random forest regressors to determine at runtime which prefetcher should be ON at each level in the memory  ...  Suite of Regressors vs Single Regressor: When using regression algorithms, we have two options: (i) use a single regressor, where all data collected from all the PSCs are used to train that single regressor  ... 
arXiv:2201.12027v1 fatcat:lyp5rgzltngjrm75w3so2urrym
« Previous Showing results 1 — 15 out of 9,811 results