Skip to main content

Privacy policy

 Privacy Policy


Effective date: 2024-02-16


This Privacy Policy applies to the website [bozskyfilip.blogspot.com] operated by [Filip Jurcicek] ("us", "we", or "our"). This Policy informs you of our policies regarding the collection, use, and disclosure of personal data we receive from users of our website.


1. Information Collection and Use

We may collect and process the following types of data:


1.1 Personal Data:

We may collect personally identifiable information including, but not limited to, your name, email address, and contact information. We collect this information for the purpose of providing and improving our services to you.


1.2 Usage Data:

We may collect non-personally identifiable information about how you use our website. This may include your IP address, browser type, device type, operating system, and other similar information. We collect this information to analyze trends, administer the site, track users' movements, and gather demographic information for aggregate use.


2. Use of Data

We use your personal data for the following purposes:


2.1 To provide and maintain the website,

2.2 To notify you about changes to our website,

2.3 To allow you to participate in interactive features of our website when you choose to do so,

2.4 To provide customer support,

2.5 To gather analysis or valuable information so that we can improve our website,

2.6 To monitor the usage of our website,

2.7 To detect, prevent and address technical issues,


3. Disclosure of Data

We may disclose personal data in the good faith belief that such action is necessary to:


3.1 Comply with a legal obligation,

3.2 Protect and defend our rights or property,

3.3 Prevent or investigate possible wrongdoing,

3.4 Protect the personal safety of users of the website or the public,

3.5 Protect against legal liability.


We may also share non-personally identifiable information with third-party service providers to help us analyze how our website is used and improve our services. These third-party service providers are obligated to keep your information confidential.


4. Third-Party Services

This website uses Google AdSense AdWords to serve advertisements. Please note that Google AdSense AdWords uses cookies to provide personalized ads based on your interests. You can opt-out of Google AdSense AdWords services by visiting the Google Ads Settings page.


5. Security

We take reasonable measures to protect your personal data; however, no method of transmission over the internet or electronic storage is completely secure. We cannot guarantee the absolute security of your data.


6. Your Rights

You have the right to:


6.1 Request access and receive a copy of the personal data we hold about you,

6.2 Request rectification of any inaccurate personal data we hold about you,

6.3 Request erasure of your personal data,

6.4 Object to the processing of your personal data,

6.5 Request the restriction of processing of your personal data,

6.6 Request the transfer of your personal data to another party.


If you wish to exercise any of these rights, please contact us using the contact information provided at the end of this Privacy Policy.


7. Children's Privacy

Our website is not intended for use by individuals under the age of 13. We do not knowingly collect personally identifiable information from children under 13. If you are a parent or guardian and you areaware that your child has provided us with personal data, please contact us so that we can take necessary action to delete such information from our servers.


8. Changes to This Privacy Policy

We may update our Privacy Policy from time to time. We will notify you of any changes by posting the new Privacy Policy on this page. It is advised to review this Privacy Policy periodically for any changes. Changes are effective immediately upon posting on this page.


9. Contact Us

If you have any questions or concerns regarding this Privacy Policy, please contact us at [filip.jurcicek@gmail.com].


Please note that this privacy policy is designed to comply with the General Data Protection Regulation (GDPR) and the California Consumer Privacy Act (CCPA). This policy outlines the information we collect, how we use it, and offers transparency on our usage of Google AdSense AdWords. By using our website, you agree to the terms outlined in this Privacy Policy.


Last updated: 2024-02-15

Comments

Post a Comment

Popular posts from this blog

how the make HCL and G graphs, and on the fly compositon of HCL and G for KALDI

Well, I had again to do something ;-) The task is to generate/create/update a decoding graph for KALDI on the fly. In my case, I aim at changing a G (grammar) in the context of a dialogue system. One can generate a new HCLG but this would take a lot of time as this involves FST determinization, epsilon-removal, minimization, etc. Therefore, I tried to use on-the-fly composition of statically prepared HCL and G. At first, I struggled with it but later I made it work. See  https://github.com/jpuigcerver/kaldi-decoders/issues/1 Here is a short summary: At the end, I managed to get LabelLookAheadMatcher to work. It is mostly based on the code and examples in opendcd, e.g. https://github.com/opendcd/opendcd/blob/master/script/makegraphotf.sh . First, Here is how I build and prepare the HCL and G. Please not that OpenFST must be compiled with  --enable-lookahead-fsts , see http://www.openfst.org/twiki/bin/view/FST/ReadMe . #--------------- fstdeterminize ${lang}/...
2 comments
Read more

Viterbi Algorithm in C++ and using STL

To practice my C++ and STL skills, I implemented the Viterbi algorithm example from the Wikipedia page:  http://en.wikipedia.org/wiki/Viterbi_algorithm . The original algorithm was implemented in Python. I reimplemented the example in C++ and I used STL (mainly  vector  and  map  classes).  This code is in public-domain. So, use it as you want.  The complete solution for MS Visual C++ 2008 can be found at  http://filip.jurcicek.googlepages.com/ViterbiSTL.rar // ViterbiSTL.cpp : is an C++ and STL implementatiton of the Wikipedia example // Wikipedia: http://en.wikipedia.org/wiki/Viterbi_algorithm#A_concrete_example // It as accurate implementation as it was possible #include "stdafx.h" #include "string" #include "vector" #include "map" #include "iostream" using namespace std; //states = ('Rainy', 'Sunny') //  //observations = ('walk', 'shop', 'clean') //  //start_probability = {'Rainy': 0.6...
6 comments
Read more

kaldi editing nnet3 chain model - adding a softmax layer on top of the chain output

I had to do one more thing: to edit a trained  kaldi  nnet3 chain model and add a softmax layer on top of the chain model. The reason for this is to get "probability" like output directly from the chain model First, let's look at the nnet structure: nnet3-am-info final.mdl input-dim: 20 ivector-dim: -1 num-pdfs: 6105 prior-dimension: 0 # Nnet info follows. left-context: 15 right-context: 15 num-parameters: 15499085 modulus: 1 input-node name=input dim=20 component-node name=L0_fixaffine component=L0_fixaffine input=Append(Offset(input, -1), input, Offset(input, 1)) input-dim=60 output-dim=60 component-node name=Tdnn_0_affine component=Tdnn_0_affine input=L0_fixaffine input-dim=60 output-dim=625 component-node name=Tdnn_0_relu component=Tdnn_0_relu input=Tdnn_0_affine input-dim=625 output-dim=625 component-node name=Tdnn_0_renorm component=Tdnn_0_renorm input=Tdnn_0_relu input-dim=625 output-dim=625 component-node name=Tdnn_1_affine component=Tdnn_1_affi...
Post a Comment
Read more