- Boost - lists.boost.org

[GSoC 2010] Boost.Graph topology generators
by Omair Mohammed Abdullah 01 Apr '10

01 Apr '10

Hi, I am interested in implementing topology generators for Boost.Graph. I have a few questions: What is the scope of this project? Is it expeced to implement the common topologies with detection methods or more? For example, are generators like PLOD, Erdos-Renyi and small-world are already there. Are we supposed to extend them?

2 1

GSOC 2010 :BOOST Heaps and Queues
by shivaraaj kotini 01 Apr '10

01 Apr '10

Hi all, Im Shivaraaj, Im from Birla Institute of Technology Science (B.I.T.S) pilani, India. I recently came across GSOC 2010 and Im very interested in it.Though Im late I dont want to give up and continue discussing ideas before submitting an application. Im very much interested in BOOST Heaps and Queues project. My idea was to create a replica of JSDL api in BOOST

1 0

Second iteration of Boost.XInt library uploaded, requesting further comments
by Chad Nelson 01 Apr '10

01 Apr '10

-----BEGIN PGP SIGNED MESSAGE----- Hash: SHA1 I've just uploaded the second iteration of the Boost.XInt library to the Boost Vault. I very much appreciate all of the comments and suggestions everyone has offered on the first one, and I've incorporated a number of them. Maybe I'm just a masochist, but please take a look and let me know what you think. - -- Chad Nelson Oak Circle Software, Inc. * * * -----BEGIN PGP SIGNATURE----- Version: GnuPG v1.4.9 (GNU/Linux) Comment: Using GnuPG with Mozilla - http://enigmail.mozdev.org/ iEYEARECAAYFAkuypFUACgkQp9x9jeZ9/wRD3wCeMKRKaeml9UzhMNTpl15RvBFE pw8AniN8kkXNEFelgY4VYtWNzaCi88cV =lHLU -----END PGP SIGNATURE-----

5 13

[lock-free] CDS -yet another lock-free library
by Khiszinsky, Maxim 01 Apr '10

01 Apr '10

Hi, I'd like to present to boost community the CDS (Concurrent Data Structure) C++ library at libcds.sourceforge.net. It is an attempt to generalize well-known lock-free (and a few lock-based) data structures discovered by famous researches (M.Michael, N.Shavit and others). The library is mostly header-based, only the kernel of light-weight memory managers is resided in small dynamic library. The CDS library supports a set of modern processor architectures: x86, amd64, ia64, sparc; compiler supported is GCC 4 and MS Visual C++ 2008. The last CDS release 0.6.0 is developed close to C++ Memory Model proposal. I need the recommendations from boost community about : 1. Are the atomic primitives implemented correct for each of supported processor?.. I'm not an expert in this area... 2. Is the memory order constraint (from C++1x proposal) choosed correctly for lock-free data structure implementation?.. I known it is very large and magic question. Maybe, somebody analyzes the library code and find the errors. And I be very glad if anybody joins to CDS project. It is very interesting area of computing science with nonstandard algorithms and crazy implementation (and debugging notably).

9 35

[GSoC] Boost.XML proposal: 1st draft
by Ilie Halip 01 Apr '10

01 Apr '10

Hi, I almost finished writing the first draft of my project proposal (boost.xml). It has about everything except the schedule, for which I need a bit more time. I expect it to be finished in 2-3 hours from now. You can find the draft here: http://docs.google.com/View?docID=0Aa-6sdK9e3RZZGQydHd2ODVfNGZmdmtoNmM2 Please provide feedback. Thanks, Ilie.

1 0

GSOC Application Dates.
by swagat konchada 31 Mar '10

31 Mar '10

Does Boost suggest submitting the proposals for GSOC'10 as early as possible? Or is it ok if I take time? -- Problem is a phenomenon indicating lack of thought. Swagat Konchada

2 1

GSOC BigInt Numeric_adaptor
by swagat konchada 31 Mar '10

31 Mar '10

> swagat konchada wrote: > > > If we consider performance issues based on design, planning the > > BigInt architecture could be designed in two ways > > > > 1. 3 layers to allow optional binding to Boost's own bigint, > > GMP, or anyother bigint library, for the user during compile > > time. > > > > 2. 2 layers if we plan to limit Boost.Bigint's options to only > > itself and GMP. > > [snip] >IMO you should look at the discussion on a numeric_adaptor by Barend Gehrels and some draft code mentioned in > http://archive.freebsd.se/?ml=freebsd-questions&a=2007-05&m=11343770<http://archive.freebsd.se/?ml=freebsd-questions&a=2007-05&m=11343770> >to get some idea of the problem and a plausible framework which might include 'BoostsOwnBigInt' as an alternative to GMP >etc. >Paul >PS But you should also be aware that another xInt project is being discussed on this group. I checked out the numeric_adaptor scheme. It has used the GMP library and the CLN library's API to optionally provide some basic arithmetic operators on arbitrary precision decimal numbers(it was surprising since i expected adaptation for integer operations first, though i realise that there'd be no much change in the code). The main idea of the numeric_adaptor scheme though is the to_traits struct, which would cast the library dependent types to Boost's types by using explicit templates(i hope this is the right term). In fact the scheme paves the way for a direct start of the implementation of Bigint since it provided the core design(the very expression template system which was called for) of an optional BigInt library. Making this expression template system exhaustive and make it work with any one of the libraries(GMP ofcourse), must be our priority. @Paul. A. Bristow : I am also following the discussion on Xint, and would comment on it asap. Suggestions and criticism please! -- Problem is a phenomenon indicating lack of thought. Swagat Konchada

1 0

[intrusive doc] slist says that both push_front and push_back are constant-time
by Andy Venikov 31 Mar '10

31 Mar '10

The doc for slist says that if using non-constant size semantics, the size of the slist is the size of a single pointer. That means that either push_front or push_back cannot be constant time since we first need to find it. Am I missing something? Thanks, Andy.

2 2

[1.43.0] Cutoff for major code changes approaching
by Beman Dawes 31 Mar '10

31 Mar '10

The cutoff date for major code changes is this weekend, so please complete any pending merges to the release branch. Also, now might be a good time to check the release regression tests and inspection reports to make sure your library is in good shape: http://beta.boost.org/development/tests/release/developer/summary.html http://boost.cowic.de/rc/inspect-snapshot.html PS: The beta is scheduled for April 17th, and the release for May 1. The calendar can be seen at: http://www.boost.org/development/index.html -- The Release Managers, Beman Dawes Daniel James Eric Niebler Rene Rivera Vladimir Prus

1 0

Proposal for semantic graph : Boost Mentors, please comment on it
by Chinmaya Poswalia 31 Mar '10

31 Mar '10

*Need For Semantic Graph* First thing I would like to mention is that semantic graph is not merely a graph with links and nodes. It’s a graph in which nodes links can be of different data types and similarly links. It's a graph of interconnected things that is machine-understandable, its meaning or "semantics" can be explicitly represented on any common database, just like its data. This is the real way to make social networks, applications, libraries and information/data open. Merely opening up their API's is just the first step. Through it, applications can start using the functions and properties written in other languages. Since the Semantic Library makes data-integration easier, it will ultimately be widely adopted and will cater most to the community. Simply put, applications that wish to access or integrate data in the modern age can more easily be done. That alone is reason enough to use this library. Summarising the above Ø Making data more accessible, connectable, and reusable across applications would be a huge benefit. Ø Ability to do more sophisticated reasoning across data. Ø Applications in which its use can directly be seen is World Wide Web. Please refer the above link for more detail. http://novaspivack.typepad.com/nova_spivacks_weblog/2007/11/defining-the-se… http://www.signosemio.com/rastier/a_graphe.asp *Project Proposal* [dog] <- (ERG) <- [bite] -> (ACC) -> [man] <---------------------- Semantic Graph Here dog, bite and man all are of different types and ERG and ACC are the relations where ERG -> *corresponds to the ergative case (the agent of an action)* ACC-> to* the accusative case (the patient of an action, the one affected by it)* I am aiming to make the first steps towards the conceptualization and formulation of Semantics Graphs for the Boost Graph Library (BGL). *1) **Node Data Structure* Node should have a container to store data and an array of functions whose scope will be limited to only process the data of its own node and attached links. These nodes can process their data individually and this functionality would be defined by the functions which user would provide through the array of functions and can transmit request for processing to another nodes through links joined to them. Nodes will also contain the pointer to all the links leaving it. *2) **Link Data Structure* Links apart from containing data it will contain some defined constants whose actions value would be provided at the start time and should. These constants would define the relation between the nodes it is connecting to. Majorly relations would include of the following types like who is the agent of action, who is the recipient of action, which is the proposed result of the action, what is the final result, what is the beneficiary action and who is the beneficent of the action, who is the comparing element and who is being compared. The following paper clearly states what semantic graph is mathematically. http://www.revue-texto.net/Parutions/Livres-E/Hebert_AS/12.Semantic-Graph.p… *3) **Algorithms For Traversal of The Graph* Here I want to state that I found a library for semantic graphs which is in the CLI library. It can be obtained at http://www.codesynthesis.com/~boris/tmp/cli/cli-0.0.2+dep.tar.bz2<http://www.codesynthesis.com/%7Eboris/tmp/cli/cli-0.0.2+dep.tar.bz2> The basic algorithm of Traversal can be used but here since the nodes and links are of different data types, this can be implemented with the help of a void pointer. Once we reaches a node, we will mark it explore and the will move to the links that leaves it. This will even provide the functionality to enable us to find a link. How knowledge will be represented and how what variables and functions need to be implemented, these issues and their solution are clearly stated in the following research paper. http://www.edmondchow.com/pubs/SS105ChowE.pdf An application of semantic sub-graph involving knowledge representation and text summarisation is given in the following paper written under Microsoft Research. http://nl.ijs.si/isjt04/zbornik/sdjt04-05leskovec.pdf Please note the fact that through this way, i think the space occupied by the graph is minimal as it only depends on the containers used by the user. We just used 3 pointers for linking the nodes.

2 1