similar to: GSOC 2011 - QueryParser Reimplementation

Hi, First of all,I would like to congratulate Sabrina, Parth, Nikita and Atiamars for their selection into GSOC 2011 and wish them Good Luck. I had a good experience with GSOC this year but the being not selected has been slightly disappointing for me. I have learned about lot of things during the GSOC selection period and will carry the experience to improve my future. I will try to contribute

This is a very simple question but I couldn't form a site search quesry that would return a reasonable result set. Say I have a vector: x <- c(0,2,3,4,5,-1,-2) I want to replace all of the values in 'x' with the log of x. Naturally this runs into problems since some of the values are negative or zero. So how can I replace all of the positive elements of x with the log(x) and the

Hello, My name is Sean Mikalson. I am a second year Software Engineering student with a combined degree in Philosophy. I am interested in participating with Xapian in GSOC this year and a couple of projects have initially caught my eye: - Dynamic Snippets - QueryParser Reimplementation I have good working knowledge in C/C++, Java and SQL (specifically Transact-SQL). In order to determine

*Hi all,* * * *The following is my general idea for the project. For a complete query parser I still need to consider more details. Please give me feedback because the description of this project is lack of detailed information, and I can submit my proposal without giant deviation.* * * design principle of query parsing: 1) better understanding user input. All search engine do is understanding

Hello, I am Sehaj Singh Kalra, an Indian student. I am an undergraduation student in Indian Institute of Technology-Delhi (IIT-Delhi) pursuing Computer Science and Engineering. I want to work on the idea "QueryParser Reimplementation ". With the background I have in this field, I am fully comfortable with this project. I have went through the specification and through Query Parser

Hi Friends, Have a look over R package "imputeTestbench". It provides a Test bench for comparison of missing data imputation models/methods. It compares imputing methods with reference to RMSE, MAE or MAPE parameters. It allows to add new proposed methods to test bench and to compare with other methods. The function 'append_method()' allows to add multiple numbers of methods to

Hi Friends, Have a look over R package "imputeTestbench". It provides a Test bench for comparison of missing data imputation models/methods. It compares imputing methods with reference to RMSE, MAE or MAPE parameters. It allows to add new proposed methods to test bench and to compare with other methods. The function 'append_method()' allows to add multiple numbers of methods to

Dear Researchers, Have a look over updated *R package PSF*. Pattern Sequence Based Forecasting (PSF) takes univariate time series data as input and assist to forecast its future values. This algorithm forecasts the behavior of time series based on similarity of pattern sequences. Initially, clustering is done with the labeling of samples from database. The labels associated with samples are then

Dear Researchers, Have a look over updated *R package PSF*. Pattern Sequence Based Forecasting (PSF) takes univariate time series data as input and assist to forecast its future values. This algorithm forecasts the behavior of time series based on similarity of pattern sequences. Initially, clustering is done with the labeling of samples from database. The labels associated with samples are then

Yes running LLVM performance test suite with LTO and Thin LTO enabled. Thanks, Siddharth On Fri, May 11, 2018 at 7:32 PM, Teresa Johnson <tejohnson at google.com> wrote: > I'm not completely sure what you are asking. Are you looking for > performance benchmarks to use for LTO and ThinLTO testing? Or are you > asking how to build/run with LTO and ThinLTO? Are you asking how to

Hopefully someone else on the dev list who has experience with LNT and the LLVM test-suite will chime in. I've never run it myself. Adding Mehdi since he ran it with LTO/ThinLTO. I found some documentation for the test-suite: https://llvm.org/docs/TestingGuide.html#test-suite-overview http://llvm.org/docs/lnt/quickstart.html http://llvm.org/docs/lnt/tests.html#llvm-cmake-test-suite But I

Thanks. I am just trying to find a relocation and linking design for Hexagon architecture, whether to follow the MIPS style of relocation or other architecture style of relocation. Thats my question . Thats why i was asking about the functions and their differences Please guide. Thanks, Siddharth On Fri, Apr 21, 2017 at 8:37 PM, mats petersson <mats at planetcatfish.com> wrote: > If

Hello LLVM Developers, We are working on extending currently available register rematerialization to include cases where sequence of multiple instructions is required to rematerialize a value. We had a discussion on this in community mailing list and link is here: http://lists.llvm.org/pipermail/llvm-dev/2016-September/subject.html#104777 >From the above discussion and studying the code we

Thanks for reply, it was really helpful. Can u just be more specific and tell about processRelocationRef() and resolveRelocation() in Targets/RuntimeDyld(objectfile format)(arch).h and also in RuntimeDyldELF.cpp and how the same function is implemented in different ways in both the files ? Thanks, Siddharth On Thu, Apr 20, 2017 at 8:16 PM, mats petersson <mats at planetcatfish.com> wrote:

My name is Udit and I?m a 3rd year undergrad at BITS,Pilani, India. I have experience in programming (C/C++, python, Java) and web development(PHP, HTML5, CSS). I went through the project ideas mentioned on your GSOC project ideas page and found "Improving Python's Bindings " quite interesting. Could I have more information about this project? Can this project pan out the entire

Thanks for the reply. I was just asking about in general whatever header files are there in Targets/ for different architectures are not including any function except this processRelocationRef() to be used in RuntimeDyldELF.cpp or RuntimeDyldCOFF.cpp or RuntimeDyldMachO.cpp and i think these files are the ones which are actually doing the relocation and linking work. So what purpose do these

Hi, I have submitted a draft proposal on the GSoC website but I also wanted to share my draft proposal through Dropbox to get your feedback quickly through it. Please review it and let me know your feedbacks as soon as possible. I haven't written much about automated testing as I haven't written any test yet ( I will learn writing automated tests before April end ). Link to my

Moi! I was helping to teach a course on mixed models this week, and we came across a problem with coding more than one random effect in lme when they aren't nested. As an example, suppose we have an experiment where we sample moths from several populations, and place the moths on different trees, and measure a trait (in this case survival of offspring, but that's less important). We

Hi, Thanks for the info, If i only want to run performance test on benchmarks for LTO and Thin LTO enabled target, Can u suggest ways to do it ? I want to do it at my end. Thanks, Siddharth On Wed, May 2, 2018 at 7:03 PM, Teresa Johnson <tejohnson at google.com> wrote: > I've only measured performance on x86. There are some old results for SPEC > cpu2006 in the blog post here:

Hi Chris, Thanks for answering, Can u clarify on this comment mentioned in https://github.com/Z3Prover/z3/issues/861 . cplusplus no exception support · Issue #861 · Z3Prover/z3 · GitHub - LLVM's *source code* does not use exceptions for performance reasons and so is compiled by default with -fno-exceptions. When using LLVM's libraries via it's C++ interface it is important