Astrophysics and Cosmology

Recent

+ Concepts Rules

Wish / ProblemWhy?

"I wish this thing be like that..."

0
| (18327) Astrophysics and Cosmology
0
| (18320) General Relativity and Quantum Cosmology

see more..

+ Ideas Rules

Method / PrincipleHow?

"I found a way this could work..."

+1
| (18992) Bio-evolutionary Hypothesis for Absence of Green or Purple Stars : Take the evolutionary approach, and explain it by narrow spectra of survival-critical (evolutionarilyy rewarding) plants spectra due to narrow-spectrum chlorophyll and retinal.

see more..

+ Projects Rules

Work / GroupAct !

"Here's what I did, and will do next..."

see more..

Operations

o-60001

3 dweeks 5 days ago Blog categorisation and website updates @ Ruta

☑️ Font update: Rubik for body instead of Quicksand to improve blog readability

☑️ Redesigned a blog archive with categories as sections and specific post-by-category loading in each section; each post as a card with title only to resemble a look of paper sticky notes

☑️ Single blog post template updates (header, body, responsive, breadcrumbs)

☑️ Editing the design of 87 blogs and changing settings from Draft to Published

☑️ After reviewing my blog, I realised my value proposition, so updated a homepage with my process and tools

☑️ Gallery next to Reviews

☑️ Started a facilitator page

☑️ Made about page

☑️ Design adjustments: no border radius for buttons, contact form fields and photos; colors (selected text as yellow), simpler footer, newsletter forms adjustments

☑️ Translations update for homepage

☑️ Speed optimisation

—Ruta

-16.0000 ħ (16.0 HUR) (+0.0)

3 dweeks 5 days ago Instructional video on starting with Odoo on Linode @ idoo

I made a 17-min video about setting up Odoo on your own server. I'll later continue by adding more info, how to very cheaply run multiple websites on one database, and run multiple websites on multiple databases on that single server (which you could also run at home).

—Mindey

-4.8000 ħ (2.0 HOUR) (+0.0)

3 dweeks 6 days ago Verslo profilis Google @ ogiziu

☑️ I created a Google My Business profile (for local SEO)

- show in source language -

☑️ Sukūriau Google My Business profilį (dėl vietinio SEO)

—Ruta

-0.5000 ħ (0.5 HUR) (+0.0)

o-56001

4 dweeks 5 days ago Website in English @ ogiziu

☑️ I made and polished the English version of the website (e.g. Header, buttons, colors, etc.)

—Ruta

-2.0000 ħ (2.0 HUR) (+0.0)

o-56001

4 dweeks 7 days ago ogiziu.lt internetinė svetainė @ ogiziu

☑️ I downloaded WordPress in Lithuanian with the plugins I need (Elementor, Yoast, etc.)

☑️ I created a "header" with Elementor with the slogan "housewarming"

☑️ Editing fonts, colors, etc. stylistics "Site Settings"

☑️ Design of magazine archives and individual entries with sample text and images

☑️ reCAPTCHA V3 and email

- show in source language -

☑️ Įsirašiau WordPress lietuvių kalba su man reikiamais įskiepiais (Elementor, Yoast, etc.)

☑️ Sukūriau "header" su Elementor su reklaminiu šūkiu "namisėdos kuria"

☑️ Šriftų, spalvų redagavimas ir kt. stilistikos "Site Settings"

☑️ Žurnalo archyvo bei individualių įrašų dizainas su pavyzdiniu tekstu ir paveikslėliais

☑️ reCAPTCHA V3 ir el.paštas

—Ruta

-2.5000 ħ (2.5 HUR) (+0.0)

>>

Conversations

1 days 4 dhours ago @ Can A* be used to generate algorithm sourcecode?

We can scan the output structure and generate facts of each relationship … (expand) We can scan the output structure and generate facts of each relationship of data. We can compare where the data moved through based on a path traversal of source data to destination data. Generate a patch. This has a pointer to this object to this piece of data. Input data Node1 is root Node1 children node2 Node1 children node3 Example 1 Insert a node node4 Desired Output data Node1 is root Node1 children node2 Node1 children node3 Node1 children node4 Patch Node4 inserted into node1 children Why node1? Theorise. Node1 is root Run operators against node1, node4 Len(node1.children) <= Maxsize Example 2 Node split - insert node5 Input data Root node is node1 Node1 children node2 Node1 children node3 Node1 children node4 Desired target data Root node is node3 Node3 children node1 Node3 children node2 Node3 children node4 Node4 children node5 This represents a node split as each node can only have 3 items inside it. How do we learn the rule that a node can only have 3 nodes? Insert a constant into the system of facts MaxSize is 3 Insert operators in system Len(node.children) MaxSize == Equal to = Greater than or equal to <= Less than or equal to Greater than < Less than Run every permutation of each operator to decide to do patch command steps. Patch instructions Node1 is no longer root node Node3 is root node Node2 children is node1 Remove node4 from node1 Why was node4 removed from node1 Why was node4 added to node3 Theorise. What fact was true. Compare node1 properties to node4 Eventually.... Len(node1.children) == MaxSize Add node4 to node3 Why? Theorise. What fact is true Node4 >= Node3 true Does >= hold for all examples? Or is it more complicated Twist operation. One goes down, one goes up and going down joins one going down. Root = A Node1 is A New root = B Twist operation is - Root = B B.children = A And see where the data moves. We need to generate the steps that deterministically creates the same structure with the same data in the right places. There shall be patterns. So there is usually a property in the object that is compared against to do a btree split. So there is at most one field or a comparison that determines the destination of the object in the btree. I thought we can randomly generate condition statements for each input object. Walk the patch and insert condition objects. It's a graph transformation problem