= P.convexity_properties()
> }}}
I did some other tests, and found no more leaks. It may make sense to run
this in a more systematic way after leaks in MILP interface has been
resolved. And it's not a bad idea to do similar tests in, say, matrix
functions over finite field etc.
--
Jori Mäntysalo
On Mon, 3 Dec 2018, Dima Pasechnik wrote:
please post the test you use.
import gc
i = 0
for P in Posets(8):
if i % 1000 == 0:
gc.collect()
print get_memory_usage()
i += 1
_ = P.dimension()
--
Jori Mäntysalo
On Sun, 2 Dec 2018, Dima Pasechnik wrote:
do you still see it with https://trac.sagemath.org/ticket/26795 ?
Yes, it is still there.
--
Jori Mäntysalo
the function ends without bitset_free. I suppose that someone
has already done something like that.
--
Jori Mäntysalo
This shows a leak:
i = 0
for P in Posets(8):
if i % 1000 == 0:
gc.collect()
print get_memory_usage()
i += 1
_ = P.dimension()
To compare, width() and height() does not seem to leak.
--
Jori Mäntysalo
On Sat, 1 Dec 2018, 'Martin R' via sage-devel wrote:
I confirm that the following leaks:
I created https://trac.sagemath.org/ticket/26795 for this and similar.
--
Jori Mäntysalo
for this.
--
Jori Mäntysalo
someone else should look at this. OTOH I
suppose this is an easy one, just add a destructor function (whatever it
is called in cython).
Harder one is to search for other similar bugs.
--
Jori Mäntysalo
. Try
addin break after P.breadth_first_search(i).
--
Jori Mäntysalo
:
. . .
break
else:
bitset_free(self.seen)
raise StopIteration
So, now when there is no reference to Search_iterator any more, should
Cython automatically clean up the space taken, or should there be an
explicit destructor?
--
Jori Mäntysalo
UniqueRepresentation.
Can this be a bug in Python? Maybe we can make quick modification to
digraph code so that we can create posets with Py3-compiled Sage, and test
that. But all of this is above my knowledge. :=(
--
Jori Mäntysalo
Weird.
--
Jori Mäntysalo
means that the
result is implicitly cached.
--
Jori Mäntysalo
There are, in 21 different files, 31 @rename_keyword statements without a
trac number.
Could we fix them, and if so, is it possible to always require the ticket
number, i.e. deprecation-parameter?
--
Jori Mäntysalo
that 50 simultaneous connection will be the maximum. The use might
be, for example, a course on graph theory having mandatory but trivial
exercise about SageMath graph functions.
--
Jori Mäntysalo
them.
--
Jori Mäntysalo
s available for
advanced users?
With SageNB I have just installed new version. If something brokes for
some user, then it brokes -- there are deprecation warnings that hopefully
helps.
--
Jori Mäntysalo
On Mon, 5 Nov 2018, François Bissey wrote:
I’d be curious about that, but yes that may be off-list.
Of course if I can make a good step-by-step manual, then I will write
about that in this list.
--
Jori Mäntysalo
Now it's time for polyamory, i.e. getting also shibboleth ready. But that
will be off-topic for this list.
--
Jori Mäntysalo
to ignore environment.
What next?
--
Jori Mäntysalo
git), run "make"
without -j, and I have Ubuntu 18.04 LTS which is, IIRC, former Ubuntu
14.04 upgraded twice.
And now after make dist-clean it compiled also manuals and everything is
up and running. Let's suppose this was a heisenbug.
--
Jori Mäntysalo
ing "make all". Now "make
doc-clean" done and "make all" running again.)
--
Jori Mäntysalo
to start.
--
Jori Mäntysalo
Just to ping... Anyone looking at https://trac.sagemath.org/ticket/25872 ?
Working modular decomposition => working decomposition of poset ("converse
of lexicographic sum") => optimizations for the jump number etc.
--
Jori Mäntysalo
%lprun is a nice tool that shows how much time each line of the function
uses. But can I do profiling for an internal function defined inside outer
function?
--
Jori Mäntysalo
On Thu, 6 Sep 2018, John H Palmieri wrote:
Also not ideal, but you could first try u < v, and if that fails, catch the
error and use str(u) < str(v).
But we can have Graph({'1': [1]}) and so not total order for str() of
vertices.
--
Jori Mäntysalo
ces() for (di)graphs.
It is trivial to try sort vertices, and when failed, return them in an
arbitrary order, but I don't know what would be broken then.
--
Jori Mäntysalo
, planar lattices, it is much faster if we do the filtering
in C-phase. For graded, semimodular and modular lattices we could even
make the generating part in C.)
--
Jori Mäntysalo
, b: a < b and
S[b*(b-1)/2+a]=='1']), category=FiniteLatticePosets())
I think someone, like me, should make an optional package from this.
--
Jori Mäntysalo
for others to decide.
--
Jori Mäntysalo
.
Then there is a need for better maintainer on the machine.
Also, limiting number of CPU cores is the most less efective restriction.
Timesharing works very well in any case; much more problematic is program
that eats memory or just runs heavy I/O.
--
Jori Mäntysalo
distribution. Maybe also
a link to page telling about cgroups and even about at-command.)
--
Jori Mäntysalo
Graph({1:[2]}).is_prime() returns False, and the documentation says "A
graph is prime if all its modules are trivial (i.e. empty, all of the
graph or singletons)".
Is this an error, or are the two-element graphs by convention classified
as prime graphs?
--
Jori Mäntysalo
for now.
--
Jori Mäntysalo
(L) is None # Long time
True
We could check, for example, that matrix AB is invertible iff both A and B
are, and so on.
* * *
Another thing, should we try to classify bugs we found? I mean that could
we get insight of places to look for possible other bugs?
--
Jori Mäntysalo
h is not
3-colorable. I would like to submit a function for smallgraphs.py that lets
this be a named graph in sage.
Good idea, but first check that it is not already included with some other
name.
You may also want to add a function to recognize unit distance graphs.
--
Jori Mäntysalo
).
There is no easy way in SageNB to handle users, like grouping them to
courses and deleting accounts that are not marked as being "staff"-group
etc. Even deleting a user does not delete worksheets.
--
Jori Mäntysalo
So I guess
the problem is somehow some memory exhausting(?).
--
Jori Mäntysalo
to
another.
--
Jori Mäntysalo
a class Graphs analogous to
the class Posets, and have the cardinality of the first few layers built
in (analogous to Posets(16).cardinality())
I am not sure about that. What should be the meaning of, say "g in
graphs(10)" or "g in graphs"?
--
Jori Mäntysalo
graphs(n, property=lambda x: True). I think that Sage documentation makes
no promise at all about the order in which graphs are generated.
--
Jori Mäntysalo
How are merge conflicts handled, and is there any use for priority-flag on
trac? It would make sense that lower priority tickets would be merged
after more important ones.
--
Jori Mäntysalo
o remove a
covering relation. With those we could have principal upper and lower sets
of a power poset, i.e. an extensions poset you asked.
--
Jori Mäntysalo
ost graphs that this-and-this-too
can be shown with .show()? I see no added value to the user.
--
Jori Mäntysalo
/generators/platonic_solids.py
the test time dropped from 3,5 to 0,5 seconds.
However, the output of the plot should be something that says
how many graphics objects, which generally should not change.
True.
Should it be on TESTS or in EXAMPLES?
--
Jori Mäntysalo
should be exactly the same as plot(). And then, is even
plot() usefull as an example?
--
Jori Mäntysalo
Many examples at graph_generators.py use show() as an example of use. What
you think about this? It tests that plotting of the graph does not return
an error, but nothing more. And it will take time, not that much but
cutting the testing time would not be a bad idea.
--
Jori Mäntysalo
Does anyone here currently adminstrate a Sagemath installation having
shibboleth as the main authentication?
--
Jori Mäntysalo
ization software (VirtualBox is my favorite in
desktop), install Sage inside the virtual machine, and then make snapshots
of the virtual machine sometimes. You can even make it automatic, see
https://www.techrepublic.com/article/how-to-automate-virtualbox-snapshots-with-the-vboxmanage-command/
--
Jori Mäntysalo
somorphism.
Btw, just extending poset by adding a new maximal element covering all
possible subsets of maximal elements will give you all posets having 1, 2,
..., n as a linear extension. That is not enought?
--
Jori Mäntysalo
ondPoset(5)?
By the way, can anyone give me CPU power of a supercomputer for free?
Try to make a paper together with someone in Finland... 1000 CPU hours is
automatically available here for any researcher in any university, more by
asking.
--
Jori Mäntysalo
=column-3_p_col_count=1
"With power user rights on the system you can customise your own
notebooks. Lecturers can e.g. create ready-made course notebooks with
required applications, datasets and exercises."
--
Jori Mäntysalo
Using edge_labels=True in canonical_label() of graph seems to work, i.e.
canonization transforms isomorphism to equality. Also the parameter does
*something*, it is not ignored.
But what is the meaning of it? For partition-parameter the meaning is
clear (but not clearly documented).
--
Jori
t;. And he is not happy
about this.
--
Jori Mäntysalo
this better?
--
Jori Mäntysalo
On Tue, 12 Dec 2017, Dima Pasechnik wrote:
Have you tested against a real LDAP server?
Yes. It works.
Could you comment on https://github.com/sagemath/sagenb/issues/177
rather than here?
OK, I'll continue there.
--
Jori Mäntysalo
/sage -i openssl" and/or "./sage -pip install
pyopenssl" is needed. As for easy_install I just tried different options.
I think that now we know what commands are sufficient to have LDAP. I am
not sure if we know what are necessary commands.
--
Jori Mäntysalo
to show.
--
Jori Mäntysalo
ation: On
LDAP URI: ldap://ldap.forumsys.com:389/
Bind DN: cn=read-only-admin,dc=example,dc=com
Bind Password: password
Use GSSAPI instead of Bind DN/Password: Off
Base DN: ou=mathematicians,dc=example,dc=com
Username Attribute (i.e. cn, uid or userPrincipalName): uid
Query timeout (seconds): 5
B
On Sun, 10 Dec 2017, Dima Pasechnik wrote:
How do I reproduce your error?
You need a working LDAP server for that. Maybe this works:
https://www.forumsys.com/tutorials/integration-how-to/ldap/online-ldap-test-server/
I'll continue with this tomorrow.
--
Jori Mäntysalo
.egg/ldap/filter.py:from
ldap.functions import strf_secs
./local/lib64/python2.7/site-packages/ldap/filter.py:from ldap.functions import
strf_secs
./local/lib64/python3.6/site-packages/python_ldap-3.0.0b1-py3.6-linux-x86_64.egg/ldap/filter.py:from
ldap.functions import strf_secs
--
Jori Mäntysalo
te:
It's probably coming from one of (non-standard ?) python packages you
have installed.
True, I installed some optional packages (gap_database, dot2tex etc.). But
I don't get that -- how those affect login on SageNB?
--
Jori Mäntysalo
tself.
But propably this was wrong path anyways?
--
Jori Mäntysalo
, not for sharing a notebook
within a group (or to a teacher).
I've been working on interface coding fulltime most of the last 5 years.
One would think that many other can make interface, but quite few people
are capable of adding some number theory parts to Sage...
--
Jori Mäntysalo
try looking too hard, but ldap.functions seems to be something Python
3-only...)
As always, I started by downloading the stable version and compiled from
scratch. So it should be there, or otherwise there are ghosts in the
server.
--
Jori Mäntysalo
for other to implement it all. :=)
--
Jori Mäntysalo
such that it
either says that my password is wrong or give 500 Internal error, so I
suppose that most parts of the system are working.
--
Jori Mäntysalo
s/perm_gps/permgroup_named.py.
I would like to see only one spelling, i.e. no color and colour etc, but
that has been discussed earlier without ending to a common view.
--
Jori Mäntysalo
o see the
vertices, edges, etc. listed in an order that makes the output easy to
read - -".
--
Jori Mäntysalo
.
--
Jori Mäntysalo
Is it possible to run min(L) in Python2 and at the same time check if it
could be run in Python3 for given L?
Reason: allow_multiple_edges() on generic_graph.py and keep_label='min'
(or 'max'), can we have a nice deprecation?
--
Jori Mäntysalo
not be used anyway.)
--
Jori Mäntysalo
happened. Maybe some tcp fragmentation
thing, timings, or some other things.
--
Jori Mäntysalo
There is #24088 already in positive_review. But as a sidenote: I was able
to compile Sage with many, many rounds. So here is a workaround to those
seeing an error from ipython in compilation:
until make; do echo Duh. Another try.; done
--
Jori Mäntysalo
o those related to Eulerian path/cycle.
--
Jori Mäntysalo
rue when the graph has an
Eulerian path BUT has not Eulerian cycle. Is this normal use in graph
theory?
--
Jori Mäntysalo
rian",
and the same for is_traceable / "semi-hamiltonian".
Later get back to functions hamiltonian_cycle() etc.
--
Jori Mäntysalo
emi-hamiltonian
graph": A graph is
semi-hamiltonian if it contains a hamiltonian path but no hamiltonian cycle.
Duh. And then there is the concept of hypohamiltonian.
--
Jori Mäntysalo
On Fri, 13 Oct 2017, Frédéric Chapoton wrote:
Cool, no ? Or maybe nobody cares ?
Cool, yes!
--
Jori Mäntysalo
th)
or (False, None) as output.
But I am not an expert, so maybe graph theorists have something to say
about this.
--
Jori Mäntysalo
Should the empty graph be defined as cograph?
It can not be made from 1-vertex graphs by disjoint union and
complementation, so it is not. OTOH it has no induced subgraph isomorphic
to 4-vertex path, and it is the comparibility graph of the empty poset, so
it kind of is.
--
Jori Mäntysalo
minor-free ? transitively reduced ?
True, and there has been a discussion about is_tree in this list.
Anyways, different parts of Sage should use same definitions.
--
Jori Mäntysalo
le we have a method of generating iso-classes of
trees in constant time per tree. This is meant to be a useful
general-purpose generator.
True.
--
Jori Mäntysalo
graph, is preserved if you
delete a vertex but not if you delete an edge.
True. But it is propably not what one will generate orderly...
--
Jori Mäntysalo
is augment='edges' usefull? Is
sum(sum(1 for _ in graphs(i, augment='edges')) for i in range(9))
faster in someone's computer than
sum(1 for _ in graphs(8, augment='vertices'))
?
--
Jori Mäntysalo
On Tue, 10 Oct 2017, Dima Pasechnik wrote:
I cannot think of a reason other than different authors/reviewers,
different weather, different amount of coffee... :-)
Haha. I opened #24003 for this, but will wait some days to see if there
will be more comments.
--
Jori Mäntysalo
Try
g = graphs.StarGraph(3)
print(g.hamiltonian_path())
print(g.hamiltonian_cycle())
Is there a reason for this? If not, which way we should correct it?
(#23994 is waiting for a review, will also depend on this.)
--
Jori Mäntysalo
/hubshare/issues/15
Maybe I wait for this to stabilize and then try to install all parts and
see if it works.
--
Jori Mäntysalo
And I have used bc as an
example of using xinetd to make a simple listener for telnet connections.
Fortunately the bug was corrected before my example.
--
Jori Mäntysalo
-- lead a compromise to the
server.
--
Jori Mäntysalo
On Thu, 7 Sep 2017, Volker Braun wrote:
You can share worksheets just by uploading them to github, for example:
Isn't that publishing worksheet, not sharing?
--
Jori Mäntysalo
LDAP or Shibboleth, so that everyone with an
account on them can just sign in to Sage.
- Local user accounts too.
- Security, so that a user A can not see worksheets for user B.
- Importing SageNB worksheet to a new system worksheet.
--
Jori Mäntysalo
, as that change did, though I could be barking up the wrong tree too.
Thanks for pursuing this.
Another question: Can I downgrade SageNB when waiting correction for this
bug? Is so, how?
--
Jori Mäntysalo
I have tried to grep the source, but without help.
* * *
However, this seems to be documented bug already:
https://github.com/sagemath/sagenb/issues/432
--
Jori Mäntysalo
)?
--
Jori Mäntysalo
() is broken or dual() is broken, but we don't know
which one.
--
Jori Mäntysalo
the tests are in there, we can see
how many of them are better lifted to the category of
FiniteLattticePosets as _tests_* methods.
I think I didn't understood. Categories of posets ja lattices contains
just few functions. A PoC code?
--
Jori Mäntysalo
n or b)
smaller regression that happens in some slow function.
--
Jori Mäntysalo
function -- if something very
odd happens and for example is_modular() takes a minute instead of few
milliseconds, it would be noticed.
--
Jori Mäntysalo
going, not something that could be corrected by
changing href="foo" to href=".foo".
Would be nice if Someone Else(tm) could check this.
--
Jori Mäntysalo
1 - 100 of 508 matches
Mail list logo
