- Boost - lists.boost.org

gsoc project
by Shamsher Siddiqui 14 Apr '13

14 Apr '13

i know c++ well and i like algorithm very much .So I have chosen 1)Algorithms 2)Boost.Chrono/Date I would like to work on this project this summer . I have read https://svn.boost.org/svn/boost/sandbox/chrono_date/libs/date/doc/date.html this plz give me how to start developing. I have completed the Algorithm course in my major and pretty good at it .help me in this project so that i can on this project

2 3

[gsoc 2013] Boost.odeint project
by Artemy Margaritov 14 Apr '13

14 Apr '13

Hello. My name is Artemy Margaritov. I am a third year student of Moscow Institute of Physics and Technology and I'd like to participate in Gsoc this year. I have some questions to start with. 1. Are the parts "Implicit Routines" and "Parallelized Backends" of Boost.odeint project separate tasks? 2. Is it possible for two students to be enrolled in Boost.odeint (one student to "Implicit Routines", another to "Parallelized Backends")? -- Best regards, Artemy Margaritov

2 1

Re: [boost] GSOC 2013
by Antony Polukhin 14 Apr '13

14 Apr '13

2013/4/14 Niranjan Singh <niranjan32331(a)gmail.com>: > Hello sir, > > Sorry for not being clear in my previous message , here I want to propose > you two ideas..which we can work on > > 1. Implementing a graphical interface for problems so that all outputs can > be viewed by user in a good way. Algorithms will be the same like Dijkstra's > , Bellman ford , Kruskul e.t.c as they are already present in BGL. BGL can output to DOT format (the one that is used by graphviz to visualize graphs). Are you going to improve that output or proposing something absolutely different? > 2. Implementing algorithms for Travelling Salesman problem or Chinese > postman problem, Job scheduling or Edge colouring. This sounds interesting. Can you write code using same approaches as in Boost.Graph? See some sources of BGL, get the idea of how it works. > P.S: Actually Sir I have many ideas in my mind, that's why I tell them > whichever be the best or worth full. :)) > > with many thanks > Niranjan Singh See this link https://svn.boost.org/trac/boost/wiki/SoCSubmissionTemplate and fill a proposal. This link may also help https://svn.boost.org/trac/boost/wiki/SoCHints -- Best regards, Antony Polukhin

1 0

[preprocessor] BOOST_PP_OVERLOAD not defined if variadic macros not supported.
by Mostafa 14 Apr '13

14 Apr '13

I just found out the hard way that BOOST_PP_OVERLOAD is "silently" not defined if variadic macros are not supported , ie in c++03. This led to quite a frustrating session of debugging on the premise that there's something wrong with my include paths/environment variables. It would be very nice if BOOST_PP_OVERLOAD errored explicitly if variadic macros were not supported by the compiler, or at lease have a gentle reminder to the reader in BOOST_PP_OVERLOAD documentation (and, where appropriate, in other places) that variadic macros are only standard in c++11 and may not be supported on all compilers, hence one might get a BOOST_PP_OVERLOAD undeclared error. Mostafa

4 10

GSOC 2013 . BOOST GLB
by Niranjan Singh 14 Apr '13

14 Apr '13

@antoshk Hello sir, As I go through the graph library of boost, everything seems to be done like all major algorithms for graphs. That's pretty good however we can use it to implement a structure of methods which deals with problems like Chinese postman problem, Decision making poblem , Project management.,Graph partitioning and clustering , Distribution of Eigen values and compression e.t.c With graph we can solve friend-of-friend problems and also implement a simple command line social network based on c++ with the help of graphs. This would be really interesting. However shortest path algorithms can be implemented from one cutting plane algorithm , and Ant algorithm. It would be better if we can change the input and output display by using graphics so that user gets an interactive output of graph. With these graph techniques and algorithms can be use for calculating polynomials time verification via hamiltonian cycles and NP problems. May be useful in Boost uBLabs. with many thanks and regards Niranjan Singh

1 0

GSOC 2013
by Niranjan Singh 14 Apr '13

14 Apr '13

@antoshk Hello sir, As I go through the graph library of boost, everything seems to be done like all major algorithms for graphs. That's pretty good however we can use it to implement a structure of methods which deals with problems like Chinese postman problem, Decision making poblem , Project management.,Graph partitioning and clustering , Distribution of Eigen values and compression e.t.c With graph we can solve friend-of-friend problems and also implement a simple command line social network based on c++ with the help of graphs. This would be really interesting. However shortest path algorithms can be implemented from one cutting plane algorithm , and Ant algorithm. It would be better if we can change the input and output display by using graphics so that user gets an interactive output of graph. With these graph techniques and algorithms can be use for calculating polynomials time verification via hamiltonian cycles and NP problems. May be useful in Boost uBLabs.

1 0

GSOC 2013
by Niranjan Singh 13 Apr '13

13 Apr '13

Hello, My name is Niranjan , It was really a pleasure seeing a poject like this, and the ideas were also very good. I like to contribute to the vector ,making new matrix class. I would like to propose you my idea as below As *Graph theory* as a subject also and is becoming increasingly significant as it is applied to other areas of mathematics, science and technology. It is being actively used in fields as varied as *biochemistry (genomics), electrical engineering (communication networks and coding theory), computer science (algorithms and computation) and operations research (scheduling).* The powerful *combinatorial methods* found in graph theory have also been used to prove fundamental results in other areas of pure mathematics. And so is becoming an important subject in mathematics and algorithms also. So I was thinking to make a library to implement all the graph functions and its various properties and applications in it so that it can be used by student to understand the concept and it can also be used to solve problems like *Travelling Salesman problem, finding chromatic number, edge colouring. * Finding *shortest path , face colouring* e.t.c. With the help of small functions user can create a program which tackles the big problem. Lots of data-structures can also be implemented. Thanks. P.S. Sir, As my end semester are exams are on .. so its possible that i couldn't reply you fast but I do want to do this project. Exams will over on 30 april.. Thanks for you concern.

4 3

Niranjan Singh has invited you to open a Google mail account
by Niranjan Singh 13 Apr '13

13 Apr '13

I've been using Gmail and thought you might like to try it out. Here's an invitation to create an account. You're Invited to Google Mail! Niranjan Singh has invited you to open a Google Mail account. Google Mail is Google's free email service, built on the idea that email can be intuitive, efficient and fun. Google Mail has: *Less spam* Keep unwanted messages out of your inbox with Google's innovative technology. *Lots of space* Enough storage so that you'll never have to delete another message. *Built-in chat* Text or video chat with Niranjan Singh and other friends in real time. *Mobile access* Get your email anywhere with Google Mail on your mobile phone. You can even import your contacts and email from Yahoo!, Hotmail, AOL or any other web mail or POP accounts. Once you create your account, Niranjan Singh will be notified of your new Google Mail address so you can stay in touch. Learn more<http://mail.google.com/mail/help/intl/en/about.html>or get started<http://mail.google.com/mail/a-b2df9a7699-186fc6feff-CUGUbjU3pJUkhZ0HbL1w6xE…> ! Sign up<http://mail.google.com/mail/a-b2df9a7699-186fc6feff-CUGUbjU3pJUkhZ0HbL1w6xE…> Google Inc. | 1600 Amphitheatre Parkway | Mountain View, California 94043

1 0

JSON Parser GSoC 2013
by Stephan Bourgeois 13 Apr '13

13 Apr '13

Hi everybody, I am studying for an MSc in Computer Science at Oxford Brookes University. I have taken a compiler construction course this year and I am therefore interested in the JSON Parser idea for the Boost library. Open Source JSON parsers have already been implemented in C++ and in Java. Examples of Java libraries are: Gson, quick-json. Even if other libraries already exist, developers who are using Boost for their project will appreciate having a JSON parser within Boost. >From a compiler construction background, writing a JSON parser is not difficult. The JSON grammar is simple and the specification is easy to find. Potential difficulties can exist with robustness of error handling and recovery. The question is what data structure we should use to represent JSON objects, and how the user can access key/value pairs in those objects. (examples: Boost.PropertyTree, pre-existing C++ object, ...) Ideally we should offer validating and non-validating implementations. We should also offer JSON generation as well as parsing. Let me know what you think. Kind regards, Stephan.

10 14

Regarding proposal for GSOC
by Niranjan Singh 12 Apr '13

12 Apr '13

If I have to send my proposal for the poject in GSOC then whom should I mail. This link only or is there some other email. Thanks

2 1