Recherche avancée

Sur d’autres sites (6262)

• Matomo maker InnoCraft named 2023 Hi-Tech Awards finalist

  20 avril 2023, par Erin — Press Releases

  WELLINGTON, N.Z., April 20, 2023 – InnoCraft, the makers of world-leading open-source web analytics platform Matomo, has been named an ASX Hi-Tech Emerging Company of the Year finalist in the 2023 Hi-Tech Awards. 



  Matomo founder Matthieu Aubry says, “At Matomo, we believe in empowering individuals and organizations to make informed decisions about their digital presence. By providing an open-source website analytics platform, we have created a more transparent and trustworthy digital ecosystem. We are proud to be recognised as a finalist for the Hi-Tech Awards, and we will continue to work towards a more open and ethical digital landscape, and grow the business in New Zealand and worldwide.”



  About Matomo

  Matomo, launched in 2007 as an open-source, privacy-friendly Google Analytics alternative, is trusted by over 1.5 million websites in 220 countries and has been translated in over 50 languages. Matomo tracks and analyses online visits and traffic to give users a deeper understanding of their website visitors to drive conversions and revenue ; while keeping businesses compliant with privacy laws worldwide, such as the EU’s General Data Protection Regulation (GDPR) and The California Consumer Privacy Act (CCPA).

  Aubry says Matomo is performing extremely well internationally as consumers and organizations look for privacy-focused analytics solutions, with several European countries already ruling the use of Google Analytics illegal due to data transfers to the US. In addition, Matomo’s user increase was recognized earlier this year with W3Tech’s award for the best web analytics software in its Web Technologies of the Year 2022 – with previous winners including Google Analytics and Facebook Pixel.



  A record number of companies entered the 2023 Hi-Tech Awards, with entries coming in from across the country and from all areas of the Hi-Tech sector. This depth is reflected in the line-up of finalists this year, according to David Downs, Chair of the Hi-Tech Trust, who says the standard of entries continue to grow every year.

”

  The hi-tech sector continues to flourish and it’s fantastic to see the success that so many of our companies enjoy on the international stage. This sector continues to prove its resilience and is at the forefront of our export economy in turbulent times,” says Downs.



  The Hi-Tech Awards Gala Dinner will take place on Friday, the 23rd of June, in Christchurch. 


   

  &lt;script type=&quot;text/javascript&quot;&gt;<br />
console.log('script started!!!!');<br />
   var _paq = _paq || [];<br />
   _paq.push(['AbTesting::create', {<br />
       name: 'LanceTesting', // you can also use '18' (ID of the experiment) to hide the name<br />
       percentage: 100,<br />
       includedTargets: [{&quot;attribute&quot;:&quot;url&quot;,&quot;inverted&quot;:&quot;0&quot;,&quot;type&quot;:&quot;equals_simple&quot;,&quot;value&quot;:&quot;https:\/\/matomo.org\/blog\/2023\/01\/matomo-privacy-friendly-web-analytics-software-named-best-of-the-year-2022\/&quot;}],<br />
       excludedTargets: [],<br />
       variations: [<br />
           {<br />
               name: 'original',<br />
               activate: function (event) {<br />
                   // usually nothing needs to be done here<br />
                   console.log('group1');<br />
               }<br />
           },<br />
           {<br />
               name: 'Variation1', // you can also use '45' (ID of the variation) to hide the name<br />
               percentage: 90,<br />
               activate: function(event) {<br />
                   console.log('group2');<br />
                   event.redirect('https://matomo.org/blog/2023/08/matomo-named-2023-hi-tech-awards-finalist/');<br />
               }<br />
           }            <br />
       ],<br />
       trigger: function () {<br />
           return true; // here you can further customize which of your visitors will participate in this experiment<br />
       }<br />
   }]);<br />
&lt;/script&gt;

• Understanding the VP8 Token Tree

  7 juin 2010, par Multimedia Mike — VP8

  I got tripped up on another part of the VP8 decoding process today. So I drew a picture to help myself understand it. Then I went back and read David Conrad’s comment on my last post regarding my difficulty understanding the VP8 spec and saw that he ran into the same problem. Since we both experienced the same hindrance in trying to sort out this matter, I thought I may as well publish the picture I drew.

  VP8 defines various trees for decoding different syntax elements. There is one tree for decoding the tokens and it is expressed in the VP8 spec as such :

  PLAIN TEXT

  C :

  1. const tree_index coef_tree [2 * (num_dct_tokens - 1)] =
  2. {
  3.  -dct_eob, 2,        /* eob = "0"  */
  4.   -DCT_0, 4,        /* 0  = "10" */
  5.   -DCT_1, 6,        /* 1  = "110" */
  6.    8, 12,
  7.    -DCT_2, 10,      /* 2  = "11100" */
  8.     -DCT_3, -DCT_4,    /* 3  = "111010", 4 = "111011" */
  9.    14, 16,
  10.     -dct_cat1, -dct_cat2, /* cat1 = "111100", cat2 = "111101" */
  11.    18, 20,
  12.     -dct_cat3, -dct_cat4, /* cat3 = "1111100", cat4 = "1111101" */
  13.     -dct_cat5, -dct_cat6 /* cat4 = "1111110", cat4 = "1111111" */
  14. } ;

  Here is what the table looks like when you make a tree out of it (click for full size image) :

  
  
  

  The catch is that it makes no sense for an end-of-block (EOB) token to follow a 0 token since EOB already indicates that the remainder of the coefficients should be 0 anyway. Thus, the spec states that, "decoding of certain DCT coefficients may skip the first branch, whose preceding coefficient is a DCT_0." I confess, I didn’t understand what "skip the first branch" meant until I drew the tree.

  
  
  

  For those wondering why it might be sub-optimal (clarity-wise) for a spec to simply regurgitate vast chunks of C code, this makes a decent case. As you can see, the spec makes certain assumptions about how a binary tree should be organized in a static array (node n points to elements n*2 and n*2+1 as its branches ; leaves are either negative or 0). This is the second method I have seen ; another piece of code (not the VP8 spec) had the nodes in the first half of the array and pointed to leaves in the second half. There must be other arrangements.

• Revision 31972 : Et maintenant on peut aussi importer les fichiers d’export. On peut aussi ...

  8 octobre 2009, par rastapopoulos@… — Log

  Et maintenant on peut aussi importer les fichiers d’export.
  On peut aussi supprimer entièrement un menu, ce qui n’était bizarement pas possible avant.
  Pour la peine, on hausse la version, parce que c’est une nouvelle fonctionnalité d’ajoutée.