Minos | 一个基于Tornado/mongodb/redis的社区系统。 | DB Client library

I have a file with several worksheets. In the "J4:BA1000" of some of these sheets are drop down options where the user can select letters from A to I. What I'm trying to achieve is that upon selection, the selected option is replaced by its corresponding code: 1 to 9. With this, I tried out the code below, which is also something I saw from stack overflow. However, it's not working and I'm not sure why. I believe the logic is correct, the sheet names are exact and the conditions are there.

I'm reaching out to the community for your advise.

Likewise, I believe there's an improvement on how I do the checking of sheet names to avoid the multiple || (or), and as well the changing of values to avoid the multiple ifs.

Hoping for your advise on this. Thanks!

I'm currently trying to setup a hugo blog with blogdown and can't find a way to add feature or thumbnail images to posts from within .Rmd files, which would like this with the tranquilpeak theme:

As far as I understand, it is easy to do in .md files by just adding some syntax like this:

I have a string :

I have question about the syntax for a structure inside a chained list:

I have this chain list structure:

I have designed an AMPL model.

I want to add to it some constraints such as:

I'm learning to build a hexo theme recently, but I am confused about __() function. I didn't find answer in hexo doc. I have no idea this is in-built or what?

this code is from theme-minos:

I an trying to get the user input do two different behaviors with the same input key.

like this :

I'm currently trying to solve an AMPL model, that runs for me using minos, with cplex and integral variables.

Most of the problems I've solved (i think). Helped myself with a "ratio trick" from here: http://lpsolve.sourceforge.net/5.5/ratio.htm, yet right now I get "QP Hessian is not positive semi-definite." error from one of my constraints.

I kinda know what the error means, yet I am not sure why it is showing for this constraint :/

I am attempting to create a puzzle to let players piece together an n×n grid using n connected n-minos (definition: connected piece of n 1×1 blocks, e.g. each of the Tetris pieces is a 4-mino). However, generating a way to cut the grid first proves to be a challenge despite seemingly easy enough for a human.

example board

For human, generating such a solution is a relative easy task by recursively following the following logic/pseudo-code:

:start_of_recursion:

• Start with a random "least connected" piece (end, corner, edge pieces that has the fewest member connecting to it) to be the starting mino block

  :start_of_recursion:

  • Make a "grow" in a random available direction from a random piece in the current mino
    • If "grow" results in a "separated" remaining board(, if the separated region isn't a multiple of n), try some other location and direction
      • if all location and direction has been attempted, revert to previous board configuration (shouldn't really occur?)
  • If size-n has been reached, exit recursion

  :end_of_recursion:

• if board has been filled, exit recursion

:end_of_recursion:

Performing this routine seem to generate an O(n^2) method of solution generation, however the condition checks prove to be really expensive for computers. In order to determine whether the board to be connected, a human simply checks for any "gap" inside the remaining region, and is processed in almost O(1) fashion for a simple non-overlapping graph, whereas my code implementation need to "spread" from a point on the graph into its neighboring territories and check after the spreading is complete to check whether if any points lies outside of reach (O(n) at best). Since this check is to be performed every time in the innermost iteration, it degenerates the complexity into an O(n^(3+)) problem and becomes really inefficient.

Is there a method to check for "gap" in a manner similar to that of human cognition? Or can the problem be fundamentally thought of and simplified into a problem easier for computer to solve?