I'm trying set up a JWE encrypted with a given JWK using the ECDH-ES Algorithm and the curve brainpoolP256r1. I would really like to use a Jose package, like Nimbus Jose or jose4j. Unfortunately both don't support the brainpool-curve. I've searched their documentations for days to find out if there is any way to include it. Can anyone help me?
Brainpool curves are not registered for use with JOSE, see https://www.iana.org/assignments/jose/jose.xhtml#web-key-elliptic-curve
As Filip points out, the Brainpool curves are not registered or defined for use with JOSE. But https://bitbucket.org/b_c/jose4j/pull-requests/24 might be of interest for DYI with jose4j.
Related
I'm a newbie at Encfs. After I read a paper about Encfs, I figured out there is a Encryption layer in Encfs. So I tried to find exact encryption function. but I couldn't find that because there are many functions. Does anyone have any idea or advice?
It's called "Cipher" in Encfs:
http://en.wikipedia.org/wiki/EncFS#Cipher
And at the moment is Blowfish and AES.
I am working as researcher at University of Genoa in Italy. I am using the C++ during my work at this Univeristy (I am new in using Visual C++). I would like to know "How can use Wxwidgets library to plot two columns from Matrix that includes on 4 columns?"
From another side, If there in any documentions that relate with Wxwidgets library that should help me to understand "How can I make plotting??", please send me the links for these documentions....
Thank you very much
There is no support for plotting in wxWidgets.
There is however number of libraries you can use located here.
One of them is wxFreeChart last updated 2010 (and so no problem with wx 2.8). SVN Version seem to show some life so its your best bet!
See the answers to this question. wxFreeChar is probably the most promising of the libraries mentioned there and should allow you to plot just about anything (I'm really not sure about what do you mean by plotting matrix columns...).
Does someone have an implementation of Iterative Closest Point (ICP) algorithm for two dimensions (2D) in R?
Here is an attempt in c#
Iterative Closest Point Implementation
Here is a more general question
iterative closest point library
This is to match two sets of points through translation and scaling.
Spacedman's comment is probably best. You might also take a look at http://www.mathworks.com/matlabcentral/fileexchange/loadFile.do?objectId=12627&objectType=file for a matlab implementation. Assuming it works ok, translating Matlab to R code is relatively easy.
This is somewhat of an answer in the form of a non-answer.
There are many variants of ICP. The design choices are at least partially organized by the late 90's Ph.D. work of Pulli and by Rusinkiewicz & Levoy. If you're going to be using ICP for anything remotely important (translation: "more than just a class assignment"), you should understand the tradeoffs.
Thus, it's probably best to take one of the existing implementations and port it to R.
3 Years too late, but there is the function icpmat in the package Morpho by the same guy who wrote Rvcg. I don't know which variant is implemented though.
Link:
https://github.com/zarquon42b/Morpho
There is a self-contained (as far as I can tell) C++ implementation of ICP here. Maybe you can create your own R wrapper around this C++ code.
I am doing a project that involves processing large, sparse graphs. Does anyone know of any publicly available data sets that can be processed into large graphs for testing? I'm looking for something like a Facebook friend network, or something a little smaller with the same flavor.
I found the Stanford Large Network Dataset Collection pretty useful.
If you asked nicely, you might be able to get Brian O'Meara's data set for treetapper. It's a pretty nice example of real-world data in that genre. Particularly, you'd probably be interested in the coauthorship data.
http://www.treetapper.org/
http://www.brianomeara.info/
Github's API is nice for building out graphs. I've messed around using the python lib networkx to generate graphs of that network. Here's some sample code if you're interested.
Apologies for the double post, evidently I can only post two links at a time since I have <10 reputation...
DIMACS also has some data sets from their cluser challenge and there's always the Graph500. The Boost Graph Library has a number of graph generators as well.
Depending on what you consider "large", there's the University of Florida Sparse Matrix Collection as well as some DIMACS Road Networks (mostly planar of course).
A few other ones:
Newman's page
Barabasi's page
Pajek software
Arena's page
Network Science
I want to count no of objects in an image using open cv. I have a soybean image and now I want to count the soybean numbers. If possible please help me and let me know the counting algorithms.
Thanks and I look forward to hear from you.
Regards,
Sumon
Sumon,
There is no one algorithm for counting objects. It greatly depends on the image itself. Depending on the contrast of the beans to the background it may be possible to use a simple threshold then a labeling algorithm, or even just finding contours.
The threshold function in opencv is cvThreshold. The contour finding algorithm is cvFindContours using this you could count the number of contours found.
Also the blob library has many facilities for this type of machine vision applications including connected component labeling which is basically what you need here. The library's description I believe is already included in opencv. The description of it can be found here.
I could provide some more assistance if I knew a little more about the image.