How to run web search by date and time?

Is it possible to perform Google search by date and time? Of course, I can restrict my search to some date interval. But how do I restrict the search to some intraday period?
For example, I want to search for “Fed rates cut” on January 22, 2008 between 8am and 11am. Ideally, I want to search by the time the web page was created.

If it is impossible via Google, do you know other search engine, which can do this?

A way to disable the SMB signing mechanism at the Apple Time Capsule?

I want to ask here an Apple Time Capsule related technical question.

In short, – exist there a way to disable at the Time Capsule the SMB signing feature?

Regarding the original SMB1 protocol, the signing mechanism is extremely slowing down the overall performance. For example, in my case, the writing to the Time Capsule network share is over a Gigabit LAN connection around 15 MB/s and goes down to around 2 – 3 MB/s when a lot of smaller files are transferred.

This behavior is SMB1 related and is therefore present on different operation systems and (older) NAS network devices. Newer SMB2+ versions have a different more efficient design which results in a far reduced overhead in conjunction with the signing feature. I can confirm this for several older Windows 7 computers were their (SMB2 based) network shares can handle transfer speeds up to 100 MB/s.

The usual solution is to disable the SMB signing. This can be done on Mac OS (and other OS) quite easy: https://dpron.com/os-x-10-11-5-slow-smb/

However, in my case it is somewhat more complex. Regarding the Time Capsule I had to do this at the “server side” which is effectively the Time Capsule. I have experimented to deactivate the signing at the client side (Mac OS, Windows 7) but it shows no effect. The SMB1 network share speed is always very slow because the SMB1 signing remains active.

So, my idea is to find a BSD command which deactivates the signing at the Time Capsule. The earlier Time Capsule models (up to the fourth generation) are NetBSD 4.0 based. The last model, the fifth generation, is based on NetBSD 6. There exist a nonofficial way to access the Time Capsule through SSH. 😉

And finally, a switch to the Apple AFP protocol is not a real solution because the Time Capsule share is also used under Linux and Windows. AFP is therefore only a solution for Mac OS based systems. However, Apple itself regards AFP as deprecated. It is no longer supported with the new APFS file system. Apple uses for APFS based network shares newer SMB versions.

Any help is welcome. 🙂

unity – How can I make the flag to be true and false but each time only once?

using System.Collections;
using System.Collections.Generic;
using UnityEngine;
using Cinemachine;

public class UnlockCrate : MonoBehaviour
{
    public Animation anim;
    public IKControl ikControl;
    public GameObject securityKeyPad;
    public CinemachineVirtualCamera virtualCam;
    public CinemachineFreeLook freeLookCam;
    public CamerasControl camerasContorl;

    private bool playAnimOnce = false;

    private void Update()
    {

        if (!playAnimOnce)
        {
            if (ikControl.handFinishedMove == true)
            {
                securityKeyPad.SetActive(true);
                virtualCam.enabled = true;
                freeLookCam.enabled = false;
                Cursor.visible = true;
                camerasContorl.enabled = false;                
            }

            playAnimOnce = true;
        }
        else if (playAnimOnce)
        {
            securityKeyPad.SetActive(false);
            virtualCam.enabled = false;
            freeLookCam.enabled = true;
            Cursor.visible = false;
            camerasContorl.enabled = true;
            playAnimOnce = false;
        }
    }
}

The problem is that the playAnimOnce flag is false then true then false then true all the time.
I want that if it’s false do something and then only if it’s true do something else.0

Should I use another flag helper and how ?

bitcoin wallet app – withdrawal is “in transit” or “under review” three weeks time

Could You kindly explain me please what does it mean when bitcoin withdrawal status is “intransit“ status as app shows and second bitcoin withdrawal is “under review” status on the website and this status last 22 days of time now please
thank You

Thank You very much for all comments do appreciated I am using the coin base and coin jar wallets and the website called www dot rcslv dot com the trading platform and three weeks ago I set up the bitcoin amount of 0.2 withdrawal transfer to the coin base bitcoin address and now the trading platform website is showing bitcoins withdrawal transfer is “under review” and the trading platform app is showing transfer bitcoin status “intransit” for three week time and I don’t know how long does it take what i can do with it how can i fix it and the customer service service at rcslv dot com does not replay to my emails at all which is very suspicious and concerned and am stuck a little bit and the website does not shows the hash tx address prefix to check
thank You very much for taking a time and help
Even if the website is having a maintenance service work check and when they finished the bitcoin will be transfer as status completed or rejected and only I can do is wait until they end up the maintenance work

time complexity – Is it true that $f(n) = c*g(n) + O(g(n))$ implies $f(n) = O(g(n))$?

Is this true for all $n$ and some $c>0$? I’m thinking the answer is yes, but I’m not sure. My thinking is as follows:

$f(n) = c*g(n)$ for all $n$ and some $c>0$ is the definition of Big-Oh.

So, $O(g(n))$ is substitutable for $c*g(n)$:

$f(n) = O(g(n)) + O(g(n))$

And by the max rule of sum:

$f(n) = O(g(n))$

Time for Another Awesome Time4VPS Offer: Linux/Windows in Lithuania from $5.99 + Bonus!

It’s time for another Time4VPS offer!  Way past time, in fact – they haven’t graced LEB’s offer sheets since 2018.  Way overdue!  You’ve undoubtedly heard of them because they’ve been around for 15 years, have over 100,000 clients, and are the largest web hosting provider in Lithuania.  They’re hosted out of Vilnius, the capital of Lithuania, which is nicely geographically positioned to serve both Eastern and Western Europe.

This time they’ve got an awesome deal for LEB readers with both Linux and Windows servers.  If you use the coupon code LEB, you can upgrade any component for free!  More port speed, backups, or 2x faster storage is yours – just pick what you want and enjoy.

They’re a Lithuanian company (registration 126350731) and you can find their TOS on their web site.  You can pay with PayPal, Credit Cards, Alipay, WebMoney, Bitcoins, and Altcoins.

Here’s what they had to say: 

“Time4VPS is a division of the company ‘Interneto vizija’ which was founded in 2003 and quickly grew to serve more than 100,000 clients across Europe. Due to our loyal customers and their referrals, by 2005 we had become the largest web hosting provider in Lithuania (Europe). Today we are proud to have more than 15 years’ experience in hosting business. We own a huge thanks to our community for trusting us.

With long years of experience and with a leading Hosting provider in the country backing it up, Time4VPS has secured its name a secure and trustworthy provider, where you can be sure that your VPS will remain active for years to come. Our oldest Time4VPS brand VPS is successfully running from 2013.”

More on their services after the jump, but first, here are the offers:

Linux 2

  •  2GB RAM
  • 1x vCPU
  • 20GB HDD space
  • 2TB transfer
  • 100Mbps uplink
  • 1x IPv4
  • /64 IPv6
  • KVM
  • €3.99/month
  • €39.99/year
  • Coupon Code LEB
    for component upgrade
  • (ORDER)

Linux 4

  • 4GB RAM
  • 1x vCPU
  • 40GB HDD space
  • 4TB transfer
  • 100Mbps uplink
  • 1x IPv4
  • /64 IPv6
  • KVM
  • €5.99/month
  • €59.99/year
  • Coupon Code LEB
    for component upgrade
  • (ORDER)

Windows 2

  • 2GB RAM
  • 1x vCPU
  • 20GB HDD space
  • 2TB transfer
  • 100Mbps uplink
  • 1x IPv4
  • /64 IPv6
  • KVM
  • €5.99/month
  • €59.99/year
  • Coupon Code LEB
    for component upgrade
  • (ORDER)

 

Network Info:

  • RACKRAY Tier III Data Center – Vilnius, Lithuania
  • Test IPv4: 212.24.110.207
  • Test IPv6: 2a02:7b40:d418:6ecf::1
  • Test file: https://lg.time4vps.com/100MB.test
  • Looking glass: https://lg.time4vps.com/Cloudlinux Limits:

Host Node Specifications:

  • 2x Intel Xeon Gold 6132 CPU
  • 768GB RAM
  • 10 x 960 GB SSDs
  • Hardware RAID6
  • 4Gbps uplink

Please let us know if you have any questions/comments and enjoy!

raindog308

I’m Andrew, techno polymath and long-time LowEndTalk community Moderator. My technical interests include all things Unix, perl, python, shell scripting, and relational database systems. I enjoy writing technical articles here on LowEndBox to help people get more out of their VPSes.

Is it true that if you solve an NP-complete problem in non-polynomial time, the solution also solves other NP-complete problems as well?

This relates to an answer for this question.

The opinion said that:

Personally, I don’t see much value in coding interviews. The problems I’ve seen asked as coding questions have been (for the most part):

asked by a person who has one specific solution in mind and is unable to recognise an alternative answer or even a better answer (Note: I actually faced this one time – the clown kept telling me I was wrong. For a metaphor of this, see 1 below);

Imagine a coding question to solve traveling salesman in non-polynomial time (a stupid question because it’s not realistic but I’m going for a metaphor here). Imagine, instead, you solved a different NP-complete problem in non-polynomial time and the interviewer wouldn’t accept that solving any one NP-complete problem in non-polynomial time solves them all. If the interviewer lacks the ability to grasp a great answer, then the candidate offering the great answer is filtered out.

I’ve read in Geeksforgeeks that:

The interesting part is, if any one of the NP complete problems can be solved in polynomial time, then all of them can be solved.

From what I understand, the interviewer gave a TSP problem, to be solved in brute-force approach. The interviewee solved a different problem of the same NP-completeness level in non-polynomial time (maybe using brute-force approach) too. And, literally what I quote from the Geeksforgeeks above.

My questions:

  • Is it true that if you solve an NP-complete problem in non-polynomial time, the solution also solves other NP-complete problems as well?
  • Are the solutions (in non-polynomial time) for NP-complete problems universal (one solution can be used for all)?
  • Why would the interviewee solve another problem instead of the given problem? Or am I misunderstanding something? Is it to show that the approach is universal?

Thank you in advance for your insights.

What does it mean when bitcoin withdrawal is “in transit” or “under review” three weeks time

Could You kindly explain me please what does it mean when bitcoin withdrawal status is “intransit“ status as app shows and second bitcoin withdrawal is “under review” status on the website and this status last 22 days of time now please
thank You

External hard drive I use for Time Machine corrupted, won’t mount

Today I plugged in my external hard drive to back up to Time Machine, but it won’t mount. I open up Disk Utility, run First Aid, and am greeted with a message that says “First Aid found corruption that needs to be repaired.” When I click Show Details, the last few lines are:

Load and verify Logical Volumes B-Trees 
Unable to bootstrap transaction group 282114: incorrect block type 
No valid commit checkpoint found
The volume 04890072-B347-41EB-AB08-87EC029276D8 was found corrupt and needs to be repaired
Storage system check exit code is 1.
Problems were found with the partition map which might prevent booting
Operation successful.

I see that the volume is corrupted, but is there a way to recover it?

I have tried mounting it through the terminal, ala diskutil mountDisk readOnly /dev/disk1, but am greeted with the message saying it failed to mount (I don’t know what I was expecting xD). The drive is encrypted, so I did try diskutil cs unlockvolume 04890072-B347-41EB-AB08-87EC029276D8 -stdinpassphrase, but it tells me “04890072-B347-41EB-AB08-87EC029276D8 is not a CoreStorage Logical Volume UUID”, even though it shows up on diskutil cs list ¯_(ツ)_/¯.

So I guess I’m left with the option of diskutil repairDisk /dev/disk1, but before I say y on Repairing the partition map might erase disk1s1, proceed?, I’m wondering if there’s anything else I can do. I know it’s likely I’ll just have to start fresh with my backups, and I suppose I don’t really need the old backups. I guess it’s good this happened now rather than when I needed to use them for a recovery.

periodic functions – What is the big-O time complexity of computing $1/N$ to $log_{2}(N)$ bits of precision?

I am considering large integer values of $N$ (100 or more digits in base-$10$).

In my algorithm, I need to be able to compute the reciprocal of $N$ with enough precision that the repetend will have been produced exactly. (I estimate this to be to $lfloor log N rfloor$ digits or $lfloor log_{2} N rfloor$ bits)

If I employ ordinary long division, how may I estimate the big-$mathcal{O}$ time complexity of calculating $frac{1}{N}$ with the desired level of precision?

I posted question(s) to this effect over on the Mathematics Stack Exchange, but have yet to garner an answer. I know that the complexity of the division of two $n$-digit numbers is $n^{2}$ using ordinary division, but that says nothing about the degree of precision required for non-terminating decimal expansions.

Thank you for your help.