Tag: machine

Reverse Proxy – How many ports the HAProxy machine opens

I have configured below the port range

cat /proc/sys/net/ipv4/ip_local_port_range
32768 61000

28232 so no ports are available

I configured HAProxy to take 5000 connection with 2 processor
So HAProxy records 10,000 concurrent connections

Example file haproxy.conf

frontend main
bind *:80
acl is_app_user -i ^/myApp/app/.*/user.*
acl is_app_members path_reg -i ^/myApp/.*

use_backend user if is_app_user
use_backend member if is_app_members

backend user
   server app1 127.0.0.1:8081

backend member
   server app2 member.app.com:443 ssl verify none check

How many ports does this computer open on which HAProxy is running?

28232 x 2 = 56.464. Since the backend has a different IP address or independent of the backend server, the source port always stays at 28,232.

Repair of SQL Server 2017 Machine Learning fails

The CU17 update failed on an Enterprise 2017 box, R and Python (we both use it).

I have removed both of them.

Trying to add a feature and R still fails – Python is good. R was removed after stopping Launchpad Service if it's locked. Repeated, still holding Launchpad – fails …

The bootstrap log does not seem to contain anything that might find a hit on a web search. Of course, the specific URL in the summary file will NOTHING! 

Detailed results:
  Feature:                       Python
  Status:                        Passed

  Feature:                       R
  Status:                        Failed
  Reason for failure:            An error occurred during the setup process of the feature.
  Next Step:                     Use the following information to resolve the error, uninstall this feature, and then run the setup process again.
  Component name:                R
  Component error code:          0x80131500
  Error description:             R Install failed. Check /logfile "C:Program FilesMicrosoft SQL Server140Setup BootstrapLog20191119_080700RSetup.log" for details.

Error Help link: https://go.microsoft.com/fwlink?LinkId=20476&ProdName=Microsoft+SQL+Server&EvtSrc=setup.rll&EvtID=50000&ProdVer=14.0.3223.3&EvtType=0x0C040519%400xC0x0C0C068F78B78B

The last lines in the current RSetup.log are:

2019-11-19T00:57:19 INFO    Running command: C:Program FilesMicrosoft SQL ServerMSSQL14.MSSQLSERVERR_SERVICES\libraryRevoScaleRrxLibsx64registerRext.exe /uninstall /sqlbinnpath:"C:Program FilesMicrosoft SQL ServerMSSQL14.MSSQLSERVERR_SERVICES\..MSSQLBinn" /userpoolsize:0 /instance:"MSSQLSERVER"
    2019-11-19T00:57:19 WARN    C:Program FilesMicrosoft SQL ServerMSSQL14.MSSQLSERVERR_SERVICES\libraryRevoScaleRrxLibsx64registerRext.exe: Command returned exit code -1
    2019-11-19T00:57:19 INFO    Running command: C:Program FilesMicrosoft SQL ServerMSSQL14.MSSQLSERVERR_SERVICES\libraryRevoScaleRrxLibsx64registerRext.exe /install /sqlbinnpath:"C:Program FilesMicrosoft SQL ServerMSSQL14.MSSQLSERVERR_SERVICES\..MSSQLBinn" /userpoolsize:0 /instance:"MSSQLSERVER"
    2019-11-19T00:57:19 WARN    C:Program FilesMicrosoft SQL ServerMSSQL14.MSSQLSERVERR_SERVICES\libraryRevoScaleRrxLibsx64registerRext.exe: Command returned exit code 0
    2019-11-19T00:57:19 INFO    Exiting with code 5

I am at a loss!

Does anyone have a solution, please?

Time Machine backups can not be started on Catalina

On OS X Catalina, I can not make backup copies of Time Machine. The destination disk is an external drive with a lot of space (a multiple of the space on the internal drive that I want to back up). Here is the UI error I get:

user error

When burying under the hood I find console error backupd that consistently looks like this:

Failed to create APFS snapshot with name
  'com.apple.TimeMachine.2019-11-17-174139.local' on volume
  '/System/Volumes/Data',
  error: Error Domain=NSPOSIXErrorDomain Code=28 "No space left on device"

There, however is Space on this drive:

free space

If the cause was a file system error, I rebooted through Internet recovery and did the following:

fsck_apfs /dev/disk1

and found no mistakes.

I tried to re-enable local snapshots, but it seems that the command is no longer available in Catalina:

NoVerb

Do you have any idea how to get Time Machine backups up and running again?

Note: This question seems to be similar to this question, which also seems to have no satisfactory answer.

Machine Learning with Mac OS and OpenCL

Recently, I was interested in Deep Learning / Machine Learning / Neural Networks / ….
A quick look at the literature makes me believe the following:
a] If I want to do ML, the preferred choice is either Python or C. C is usually faster, but the syntax is more complicated. Python is perfect for playing around, but is also used by professionals. This is due to powerful libraries like TensorFlow. C code can be used in Python using wrappers. A famous example of this is NumPy / Pandas.
b] The training takes place on the GPU and usually CUDA is used for this. Unfortunately, CUDA is limited to NVIDIA GPUs.
c] Training on a non-NVIDIA GPU uses OpenCL.

My situation is that I'm using a pretty powerful Mac with a 4GB GPU and this seems to be sufficient for starters. Unfortunately, it comes with a non-NVIDIA GPU and so I have to use OpenCL. On the other hand, I would like to use TensorFlow, for example, and work with Python.
The only thing that made a quick search on the Internet possible was this Python wrapper, which unfortunately seems to work for Windows and Linux, but not for Mac OS.

Here is my question: How can I train on the GPU of my Mac and use Python? With that I mean, Do the programming in Python and not Write the code in C and use a Python wrapper,

Sell ​​3 in 1 auction machine

Sell ​​auction machine. The engine is very flexible, you can create almost any kind of auction.
Information:
What is an auction? Auction – public sale of goods, securities, company property, works of art and other objects under specified auctioning rules. In this case the object will be acquired by the winner of the auction. A common principle for all auctions is the principle of competition between buyers. In the competition between buyers for the right to purchase goods, the winner of the auction is determined. The winner of the auction is the person who won the auction according to the rules.
For the user to use the auction, he must:
Buy bets (There are different packages).
Packages are created in a way that motivates people to buy more profitable packages. (In the admin section, you can set all the packages listed below, only describing the basic packages we have defined.)
100 bids cost 30 euros,
150 bids cost – 50 euros,
200 bids worth – 80 euros.

After the purchase, the players can bet. After selecting a product and submitting bids based on the type of offer. At the same place, the user can place a bet in another currency, for example in euros. Co-factors are also configured in the admin area.
user account
At the top right you can go to your personal account, where you can see information about your bets, active won and completed bets.
Description of auction types (basic types already included in the engine)

This engine supports 3 basic auction types:
1. An auction with a time limit as the bidding time increases.
Operating principle.
The auction is limited in time, for example to 15 minutes.
There is a lot set by the seller (project administrator).
Take for example an Apple iPhone XS 256 GB phone. Starting price 10 €.
A group of people starts to bet, but the price should not exceed 10 €.
The auction will start only after the number of bids has been announced. (In settings, the administrator himself sets the number of bids to start the auction.)
You can bet with decimal places (eg € 9.99).
Note: If 2 users place the same bets, their bid will burn.
The auction is won by the user who sets the highest bid that did not burn.
SEMrush

2nd auction with a start after a certain number of bids.
Operating principle.
There is no time, users are given a certain number of seats and bets (in the admin area, the conditions for the number of participants and the number of bets for the participants are set).
In order to participate, the user must place all bets at once, otherwise he will not be able to participate.
The winner of the auction will be determined as in option 1.

3. Auction of the highest bid with time limit.
principle of operation
After the free bets have been used, a certain number of free bets will be issued to the users from the user's credit.
The auction starts on the due date and at a certain time. The auction will be awarded a certain number of times, with the winner winning the highest bid.

From all this, questions can arise as to how the seller can make money when he pays expensive things for a small amount. The answer is simple. The whole system is structured so that the seller always writes black numbers. You can read more about it on the internet using an auction example like Auction.
The engine is written to the Yii 2 + NodeJs frame.
It has a very handy template engine and can also change the time of the auction bids in real time without reloading the page. This is a very multi-functional admin panel.

Running Windows 10 on the Parallels Virtual Machine – The poker application desktop is visible, but not individual tables

I just started using Parallels Virtual Machine to run Windows 10 and a poker application from Best Poker. When I start the application, all content is visible and I can not interact with it. However, when I open a single table, it's black and no content is visible. At the same time I can hear the action sounds. As I float across the screen, I can find and interact with buttons even when I'm not seeing them. I tried to mess around with the resolution and update drivers, but can not get them up and running.
Does anyone know this problem and has a solution?

Greetings rubber

formal languages ​​- Maximum number of configurations of the Turing machine after $ n $ moves

I came across the following question:

What is the maximum number of configuration of Turing Machine after $ n $ is moving?

The answer was:

$ k ^ n $, Where $ k $ is a branching factor.

And this "branching factor" confused me. So I thought: Given $ Q $ Total number of states $ Gamma $ be a band alphabet and two moves, left and right $ {L, R } $For every transition function we have $ 2 ^ {Q times gamma times 2} $ possible transitions in each of these $ n $ is moving. Consequently, $ k $ must be $ 2 ^ {Q times gamma times 2} $, So, total number of configurations of the Turing machine after $ n $ it has to be moving $ {(2 ​​^ {Q times Gamma times 2})} ^ n $, Am I right?