Posts tagged ‘solutie teoretica’

Decembrie 11, 2011

En: Autocracy and the Machine-Controlled Behavior

Here is a new model for a future society:

  • Small groups of people of 1 or more members that form each an independent nation. Practically each family or group of close friends may be nation members.
  • Each nation to be led by a leader, head of family, person of trust
  • Each person of trust to:
    • Compose a list of liberties and duties that his nation adheres to. (Use a policy-building application for that)
    • Publish this list on the Cloud and on a Personal Assistant machine of each nation member
    • Ensure that each nation member has a behavior as described on his machine (mobile phone, application player)

Practically each person will determine in time an exact set of rules for his behavior: from daily fitness program to the way to conduct himself with others in the most diverse of situations. The Personal Assistant machine acts as a reminder of what to do when. It will, in time, be able to determine the situations when explicit rules apply. Eg: If a person reveals to us an information under condition of confidentiality, the machine will remind you abut that before you try to share it. If you decide to share it, your public trust level should be decreased. In the Cloud we should be able to know all public policies of a group. And compare with the public policies of our own group to see what are the compatibilities.

Some advantages:

  • Clearer relationships and mutual understanding
  • Anyone would be able to „import” and „export” policies, fitness schedule, habit forming behavior
  • Easiness of evolution to create policies for groups of nations or families
  • Easiness of presentation and shortest path to implementation of any new habit. (The personal assistant machine will publish to the Cloud and import from the Cloud in a format that will explain the new habit in 2 forms: a human-readable format and a machine-readable format (algorithm, schedule, calculation formulae))
  • Reduces the need for police. Each group leader or person of trust will police himself and his group/nation. Otherwise the public trust of the nation gets degraded by automatic announcement of lack of auto-police.
Etichete:
Noiembrie 27, 2011

Informare independentă

Orice votant ar trebui sa isi faca datoria de a se informa in detaliu si independent de sursele de opinie de masa. Practic ar trebui sa aiba posibilitatea de a obtine informatiile despre faptele in sine si apoi a-si forma o opine si singur.

Multimea tuturor vontantilor la nivel local sau national ar trebui sa creeze infrastructura potrivita pentru a putea sa contribuie financiar pentru o informare verificabila si independenta de canalele neindependente. Altfel nu vor putea sa aiba pretentia la o informare dezinteresata sau obiectiva.

Practic e normal sa nu putem avea incredere in surse de informare care nu sunt platite pentru calitatea si obiectivitatea informarii ci pentru reclamele strecurate in continut in mod legitim sau nu. Am dori sa stabilim algoritmi si protocoale pentru a obtine publicarea de informatii cat mai aproape de sursa factuala. Acesta este o problema care trebuie rezolvata imediat dupa implementarea unei retele de incredere. Orice votant care nu contribuie la incurajarea informarii independente este de mai putina incredere decat unul care face aceasta. Acest factor ar trebui inclus in formula de calcul al puterii de vot.

Noiembrie 24, 2011

En: TN: Property Adding Algorithm

This is the new node property adding algorithm for trust networks:

  1. The property is proposed to your reverse-trust tree (graph)
  2. Property awaits approval by x nodes
  3. Authenticating nodes have to have the proposed property already authenticated and public for themselves
  4. If not authenticated in d days, the user is alerted
  5. When property is authenticated by x nodes without cyclic paths, property may be presented as authenticated with trust weight being the sum of trust-domain diversity factored with the reverse-trust weights of the authenticating nodes (exact formula to be voted on later)
  6. The list of nodes that authenticated each property has to remain as public as the property itself

Possible properties that have to be added, authenticated for any voter:

  • previous user id (in case of recovering identity)
  • Name
  • Age
  • Electoral college (only in an impure democracy)
  • job, expert domain
Noiembrie 24, 2011

En: Trust Domains

The real-world trust network is a collection of graphs with the same nodes liked by weighted double-directed edges. The number of graphs is a finite natural number and can be associated with the sum between the common sense set cardinality and the cardinality of the expert domains. We already compiled a set of domains of expertise with cardinality 1376. For practical reasons we will use only 1-10 types of trust (domains of trust) out of these possible domains. We may try to mix onto the traceable trust network most of the trust domains (most of the inbound edges of each node to be in different trust domains)

Common-sense trust weight is imparted in habitual environments:

  • family
  • school, peers
  • sports, peers
  • job, peers
  • church
  • low-level tests
  • local competitions
Expert-domain trust weight is imparted in expert environments:
  • Academic
  • Performance Sports
  • Expert tests
  • Professional
  • Competitions at national or international levels

Each imparts a somewhat different type of trust. We can use each for knitting a more reliable trust net of a voting person.

Noiembrie 24, 2011

En: Trust Network

Given a densely-connected, double and weighted-directed, graph A, a natural number x>1, a natural number t > (the minimum weight of any edge of A), we will consider a subgraph B with the following properties:

  • contains all nodes in A
  • only one direction of any edge is part of B
  • all these edges have a weight equal or greater than t
  • there is no cycling in any direction
  • each node has at least x incoming edges
  • each node has at most x outgoing edges

We may assimilate the following:

  • A: the real-world trust network
  • B: the traceable trust network
  • x: the trust breadth
  • t: the trust level

Interesting properties:

  • Ability to uniquely determine a node where a breach of trust happens
  • Resistance to catastrophic failure and abstraction of compromised nodes – demonstrated here

To do:

  • Determine the optimal values of x and t
  • Solve for exceptions (sparsely-connected graph)
Noiembrie 21, 2011

Industrii si meserii

In afara domeniilor de expertiza (deja definite), in meritocratie vom calcula puterea de vot si dupa o lista neexhaustiva de meserii (~140):

Lista industrii si meserii

Avem nevoie de voluntari pentru cizelare/corectare.

%d blogeri au apreciat asta: