Contest – Website Graphics

Hi, I need a graphic for this website. The company is a venture capital company. The graphic will go to the right of the text where the current abstract graphic is located. I want to replace the existing graphic with ours. I like what it looks like but I want different images that go with the rest of the site. Right now, the hallmark of the company is helping to shape the visions of entrepreneurs, so I like the idea of ​​shapes with pictures in the lines. Examples of images that can be included:

1) Steps / blocks / building blocks – imagery representing the building.
2) Abstract architecture – imagery representing the sky is the limit.
3) Shapes – shape the vision.
4) Chess – imagery representing strategy (if using something like this, make sure the king is visible)
SEMrush

I'll leave the rest to you. When creating the graph, please overlay it on the website so that we can see what it looks like. Thank you!

Payment via PayPal.
Payment is AUD 20.
The competition will take place over the weekend and a little longer if there are few entries.

Evolution of graphic rewritings between trees (representing JSON) and graphics (representing relational database schemas)

I have different input, say 100, types of trees with labeled nodes (representing JSON files). I need to transform the information contained in the trees into graphics with labeled nodes (representing instructions for inserting into tables in a relational database).

The structure of trees changes very quickly. Each month, certain labels are moved, renamed or their type changes.

Say I know how to transform trees into graphs at time t, is it possible to somehow infer at least some of the new transformations with the new tree structure?

Are there any articles or books I should read to find a theory that could help me undertake this task?

javascript – Help, generate graphics with json

I need to generate a Pie Cart type graph using js and json, I have the json file with the name of the courses and the number of approved courses per course, I need the js to read this information and generate the graph with them

var nome_course;
var aprovados;

$(document).ready(function () {
$.getJSON("./report/report_curso.json", function (json) {

let nome_curso = json("nome_curso");
let aprovados = json("aprovados");

});
});


Chart.defaults.global.defaultFontFamily = 'Nunito', '-apple-system,system- 
ui,BlinkMacSystemFont,"Segoe UI",Roboto,"Helvetica Neue",Arial,sans-serif';
Chart.defaults.global.defaultFontColor = '#858796';

// Pie Chart Example
var ctx = document.getElementById("myPieChart");
var myPieChart = new Chart(ctx, {
type: 'doughnut',
data: {
labels: (nome_curso),
datasets: ({
  data: (aprovados),
  backgroundColor: ('#4e73df', '#1cc88a', '#36b9cc'),
  hoverBackgroundColor: ('#2e59d9', '#17a673', '#2c9faf'),
  hoverBorderColor: "rgba(234, 236, 244, 1)",
  }),
  },
  options: {
   maintainAspectRatio: false,
   tooltips: {
  backgroundColor: "rgb(255,255,255)",
  bodyFontColor: "#858796",
  borderColor: '#dddfeb',
  borderWidth: 1,
  xPadding: 15,
  yPadding: 15,
  displayColors: false,
  caretPadding: 10,
  },
   legend: {

  display: false
   },
   cutoutPercentage: 80,
   },
   });

insert description of image here

Graphics – How to fix the legend and the dotted edges in WolframCloud?

Following the problems of the question:

How to get good images for Graph in published notebooks

I found a way to fix the alias problem, apparently, the Graph is not automatic Antialiasing in wolfram cloud so i have to convert it to Graphics then use explicit Antialiasing but this introduced another set of problems. Following the same example in my last question:

$diagram=Graph(
    {"Square"->"Rectangle","Rectangle"->"Parallelogram","Parallelogram"->"Four-Sided Polygon","Trapezoid"->"Four-Sided Polygon","Rectangle"->"Trapezoid","Four-Sided Polygon"->"Polygon","Polygon"->"Shape","Circle"->"Ellipsoid","Ellipsoid"->"Shape","Triangle"->"Polygon","Equilateral Triangle"->"Isosceles Triangle","Isosceles Triangle"->"Triangle"}/.{
        "Rectangle"->Hyperlink("Rectangle","https://en.wikipedia.org/wiki/Rectangle"),
        "Square"->Hyperlink("Square","https://en.wikipedia.org/wiki/Square")
    },

    EdgeShapeFunction->({
        Black,Opacity(1),
        GraphElementData({"ShortUnfilledArrow","ArrowSize"->0.01,"ArrowPositions"->0.5})@##
    }&),

    VertexShapeFunction->(Inset(Framed(#2,Background->LightYellow,FrameStyle->Directive(If(Head@#2===Hyperlink,If(First@#2=="Square",{Black,Dotted},{Black,Dashed}),{Black,DotDashed}))),#1)&),

    GraphLayout->{"LayeredDigraphEmbedding","Orientation"->Left},
    AspectRatio->0.4,
    ImageSize->{700,300},

    Epilog->Inset(Column({
        LineLegend(
            (Directive(DeleteDuplicates({Black,#}))&/@{Dotted,DotDashed,Dashed,Black}),
            Range(4)
        )
    }),{-0.5,1.5})
)

enter description of image here

Style(Show@$diagram,Antialiasing->True)

enter description of image here

I hope you can see that the different types of dotted edges have been transformed into single points. Second, the legend shown on the graphic has been destroyed.

I'm just looking for a workaround if someone could find it so that I could publish the desired graphic to the cloud notebook to share it. Thank you!

graphics – Project 3D points on a plane, then project again on 3D

I have a table in 3D space, represented by a plan.

I want to project arbitrary points representing an object (mug, toy, etc.) on this table, execute an analysis of 2D main components to obtain an oriented delimitation frame (https://www.sciencedirect.com/topics/computer- science / oriented- bounding box)

This gives me 2D oriented bounding boxes (defined by 8 corner points) that lie along the plane of the table. Now, I want to project these points in 3D so that I can get 3D bounding boxes aligned with the plane.

The projection from the 3D plane to the 2D plane is not invertible .. so how to do it?

I will do any Photoshop editing job in 24 hours for $ 20

I will do any Photoshop editing job within 24 hours

Your professional Photoshop editor is just one click away!

If you want your images to be modified, manipulated or beautiful. I do it all for you with express delivery options
PHOTOSHOP SERVICES

  • Photo manipulation and editing
  • Logo editing, color change and transparency
  • Amazon and eBay products white background
  • Removing or changing the background
  • Touch-up and removal of appropriate imperfections
  • Reshape and touch up the body
  • Background touch-up and cleaning
  • Recover highlights and shadows
  • Swap heads for different photos
  • Transform shape with Liquify
  • Eye, lip and mouth touch-up

If you have a specific requirement that is not listed above, send me a message so we can discuss it.Always on time delivery with UNLIMITED revisions!

thank you,
Ashennew.

.

share the graphics card on the network

in my small office, i have 2 desktops that both work to win 10 businesses. one of them has an nvidia 1060 graphics card which is used for rendering revit designs. the second pc also uses revit but does not have a powerful GPU for rendering. the second pc must use this remote nvidia graphics card for rendering. I want to share the graphics card on the network to be accessible by the second pc.
is there any software for this problem?
if you have any other solution to this problem, please help me.

graphics and networks – 2D cluster points in clusters of particular group size?

Imagine i have a set of 2D points pts, and I want to partition them into groups by spatial contiguity, but limit this partition to particular group sizes. I thought that NearestNeighborGraph() could be a starting point, but the problem is that percolation soon leads to a large connected component:

pts = RandomReal(1, {1000, 2});

NeighborsToCluster = 4;

NearestNeighborGraph(pts, NeighborsToCluster)

Given:

enter description of image here

How could I limit clustering so that only n number of points belong to each group (but always use Euclidean distance as a base)?

I do not need an exact n, in fact (which will also be impossible in many cases), I would like a distribution around n (normal distribution, with an arbitrary average, std).

Any help with this goal is appreciated!

graphics – Using floyd warshel to find the shortest path between two places

To resolve the following question, I used the itinerant vendor algorithm and got results, but I don't know if this is the right way. Can anyone help

Butale is a really weird country. Even stranger are the mayors and their decisions. The latter is particularly interesting, namely that the mayor Francot Turkavidel adopted a decree according to which all the roads of Butale must have a length of one mile Butale. Peter Puzzle immediately felt a business opportunity and came to offer an online service that calculates the shortest route between two locations in Butale. Let n be the number of places in Butale and m the number of routes.

A) (i.) Describe a data structure that Peter should use for efficient implementation of his service.

(ii.) Write an algorithm that calculates the distance between locations a and b.

(iii.) What is the time complexity of your algorithm? Justify your answer.

B) Peter decided to calculate the shortest paths once and for all among all the Butale place pairs.

(i.) Note the Floyd-Warshal algorithm for finding the shortest paths between two arbitrary locations but in such a way that it will be possible to reconstruct the path.

(ii.) Can Peter calculate it faster than using the Floyd-Warshal algorithm? Justify the answer.

C) New mayor and new decisions. Francot's son Gregor Brezhlaˇcnice slightly modified his father's decree by allowing the roads to now be one or two kilometers from Butale.

(i.) What must Pierre do so that he can always use A's solution? Justify the answer.

(ii.) How does the time complexity of the solution change? Justify the answer.