Book from different start stations to get confirmation tickets

I was booking the Viramgam Junction ticket to Madgaon, since confirmation tickets are available, however, I will board from Khed, which is more than 500 km from Viramgam, will there be any problem even if I mentioned the Khed boarding station when booking ?

networks – ftp denied stations denied by ACL

This is my configuration.
ubuntuhost1 – firewall – ubuntuhost2

On both hosts:

The firewall is inactive.
i don't have any ip table
I don't have any firewall rules.

When I include a firewall in the middle, ftp crashes saying it is rejected by ACL.

In firewall :: connect from 60.0.0.2 to 50.0.0.2, denied by ACLS, logging out

TCPdump reflects the following:
15: 33: 27.905510 IP 60.0.0.2.45130> 50.0.0.2.21: Flags [.], Ack 1, win 29200, options [nop, nop, TS val 5486074 ecr 36439], length 0
15: 33: 32.914501 ARP, Request who is 60.0.0.2 say 60.0.0.1, length 46
15: 33: 32.914521 ARP, answer 60.0.0.2 is-at 00: 0c: 29: e8: 72: 8b, length 28
15: 33: 38.236111 IP 50.0.0.2.21> 60.0.0.2.45130: Flags [P.], seq 1:29, ack 1, win 28960, options [nop, nop, TS val 38975 ecr 5486074], length 28
15: 33: 38.236133 IP 50.0.0.2.21> 60.0.0.2.45130: Flags [R.], seq 29, ack 1, win 28960, options [nop, nop, TS val 38986 ecr 5486074], length 0
15: 33: 38.236189 IP 60.0.0.2.45130> 50.0.0.2.21: Flags [.], Ack 29, win 29200, options [nop, nop, TS val 5488657 ecr 38975], length 0
15: 33: 38.236594 IP 50.0.0.2.21> 60.0.0.2.45130: Flags [R], seq 1611893496, victory 0, length 0

I can see that the rest package was sent at the end.

Can someone help me please.

mysql – Database design for stations and subway train schedules

I am creating a city subway train application, and for that, I need some advice from all of you experts on how to design a database for the following requirements.

  • The subway has several lines (see table), and each station is associated with its respective line.
  • When selecting two stations, the system must show all stations
    between routes That includes the total number of stations, the total distance and the total time.
  • If the route has several lines at the point where the line changes, I want to indicate something like (change line)
  • Train schedule and schedules at each station during the week. So that the user can see all the trains of the stations or train by schedules

I have created the following tables now pasted how I can make a schedule that is associated with the train and with each station, how can I check to get the entire list of stations on the route with change of line indication.

Please ignore everything NOT NULL since I still have to finish it.

CREATE TABLE IF NOT EXISTS staff
(
    id         INT UNSIGNED AUTO_INCREMENT PRIMARY KEY,
    username   VARCHAR(55) UNIQUE  NOT NULL,
    password   VARCHAR(100)        NOT NULL,
    email      VARCHAR(100) UNIQUE NOT NULL,
    phone      INT(12) UNIQUE      NOT NULL,
    created_at TIMESTAMP           NOT NULL DEFAULT CURRENT_TIMESTAMP,
    updated_at TIMESTAMP                    DEFAULT NULL,
    INDEX staff_index (username, email, phone)
) ENGINE = INNODB;

CREATE TABLE IF NOT EXISTS route_lines
(
    id   INT UNSIGNED AUTO_INCREMENT PRIMARY KEY,
    name VARCHAR(100) NOT NULL,
    INDEX route_index (name)
) ENGINE = INNODB;

CREATE TABLE IF NOT EXISTS stations
(
    id         INT UNSIGNED AUTO_INCREMENT PRIMARY KEY,
    name       VARCHAR(100)    NOT NULL,
    code       CHAR(10) UNIQUE NOT NULL,
    line_id    INT UNSIGNED    NOT NULL,
    created_by INT UNSIGNED    NOT NULL,
    updated_by INT UNSIGNED             DEFAULT NULL,
    created_at TIMESTAMP       NOT NULL DEFAULT CURRENT_TIMESTAMP,
    updated_at TIMESTAMP                DEFAULT NULL,
    INDEX station_index (name, code),
    CONSTRAINT station_route_line FOREIGN KEY (line_id) REFERENCES route_lines (id) ON UPDATE CASCADE ON DELETE RESTRICT
) ENGINE = INNODB;

CREATE TABLE IF NOT EXISTS routes
(
    id     INT UNSIGNED AUTO_INCREMENT PRIMARY KEY,
    number INT UNSIGNED NOT NULL,
    INDEX route_index (number)
) ENGINE = INNODB;

CREATE TABLE IF NOT EXISTS route_stations
(
    id              INT UNSIGNED AUTO_INCREMENT PRIMARY KEY,
    route_id        INT UNSIGNED NOT NULL,
    station_id      INT UNSIGNED NOT NULL,
    next_station_id INT UNSIGNED          DEFAULT NULL,
    station_order   INT UNSIGNED NOT NULL DEFAULT 0,
    line_id         INT UNSIGNED NOT NULL,
    distance        FLOAT        NOT NULL,
    time            TIME         NOT NULL,
    INDEX route_stations_index (station_id),
    CONSTRAINT route_id_fk FOREIGN KEY (route_id) REFERENCES routes (id) ON UPDATE CASCADE ON DELETE RESTRICT,
    CONSTRAINT station_id_fk FOREIGN KEY (station_id) REFERENCES stations (id) ON UPDATE CASCADE ON DELETE RESTRICT,
    CONSTRAINT next_station_id_fk FOREIGN KEY (next_station_id) REFERENCES stations (id) ON UPDATE CASCADE ON DELETE RESTRICT,
) ENGINE = INNODB;

CREATE TABLE IF NOT EXISTS categories
(
    id   INT UNSIGNED AUTO_INCREMENT PRIMARY KEY,
    name VARCHAR(100) NOT NULL,
    slug VARCHAR(100) NOT NULL,
    INDEX cat_index (name)
) ENGINE = INNODB;

CREATE TABLE IF NOT EXISTS trains
(
    id             INT UNSIGNED AUTO_INCREMENT PRIMARY KEY,
    name           VARCHAR(100) NOT NULL,
    number         INT UNSIGNED NOT NULL,
    origin_id      INT UNSIGNED NOT NULL,
    destination_id INT UNSIGNED NOT NULL,
    category_id    INT UNSIGNED NOT NULL,
    route_id       INT UNSIGNED NOT NULL,
    created_by     INT UNSIGNED NOT NULL,
    updated_by     INT UNSIGNED NOT NULL,
    created_at     TIMESTAMP    NOT NULL DEFAULT CURRENT_TIMESTAMP,
    updated_at     TIMESTAMP             DEFAULT NULL,
    INDEX train_index (name, number),
    CONSTRAINT train_cat_fk FOREIGN KEY (category_id) REFERENCES categories (id) ON UPDATE CASCADE ON DELETE RESTRICT,
    CONSTRAINT train_origin_fk FOREIGN KEY (origin_id) REFERENCES stations (id) ON UPDATE CASCADE ON DELETE RESTRICT,
    CONSTRAINT train_destination_fk FOREIGN KEY (destination_id) REFERENCES stations (id) ON UPDATE CASCADE ON DELETE RESTRICT,
    CONSTRAINT train_route_id_fk FOREIGN KEY (route_id) REFERENCES routes (id) ON UPDATE CASCADE ON DELETE RESTRICT
) ENGINE = INNODB;

enter the description of the image here

I have also added some placeholder data for a visual demonstration.

enter the description of the image here

enter the description of the image here

enter the description of the image here

enter the description of the image here

enter the description of the image here

enter the description of the image here

Transportation: Where can I find some maps that show where stations and lines of microphones and other types of minibuses (for example, combis) are located in Lima, Peru?

According to the Wikipedia page on Transportation in Lima:

The micros (minibus) are the most common means of public transport in Lima.

I could find some maps for the Metropolitan stations / lines (fast transit bus opened in 2010) and the subway (opened in 2011) in Lima, but I couldn't easily find similar maps for minibuses.

Where can I find some maps that show where stations and lines of microphones and other types of minibuses (for example, combis) are located in Lima?

Online radio stations

I've been listening to a Miami radio station through iheartradio, but it seems that it only has US stations. UU., Aus and New Zealand. What application do the Spanish and South American stations use for transmission?

dnd 5e – I just read the Volume of Mordenkaiden's enemies and I have a question about Eladrin's stations

The relevant features of Eladrin can be found on pages 61 and 62 of MtoF. These include the fact that choosing a season is mandatory:

Choose the season of your eladrina: autumn, winter, spring or summer.

As you can see, there is no option to have no season. You simply have to choose one. Keep in mind that you may be allowed to change the associated season on a prolonged break. On page 61, it is stated that:

At the end of a long break, any eladrina can change its season.

The way the season affects your passing ability is fey on the right side of page 62:

When you reach the 3rd level, your Fey Step gains an additional effect according to your season

This quote is followed by a description of how each season affects the Fey Pass in a different way.

trains – Which railway stations in the UK only offer one way trips?

Despite living relatively close, I recently learned about the Pilning station. I did not know so far is not particularly surprising, since there are only two services one week. (It attracted some news coverage since the second service is moving an hour earlier, which makes the schedule even less useful).

In addition, these are not made up of an incoming and outgoing pair (for example, a train to Bristol and one back); instead, both run in the same direction, to the east. This is because the platform to the west became inaccessible due to the elimination of the passenger's catwalk. Is Pilning unique in this regard, at least in the context of the British railways?

Clearly, any station that offers only one service per day would be another example. But possibly there may be others with a more regular service, but still in only one direction (maybe some kind of loop arrangement, or due to a similar loss of a platform). @Berend points out the obvious case of a terminal station; I would like to exclude them from consideration.

public transport: where can I find updated and online information about which facilities are closed at MTR stations in Hong Kong?

Battery exchange network

The Stack Exchange network consists of 175 question and answer communities, including Stack Overflow, the largest and most reliable online community for developers to learn, share their knowledge and develop their careers.

Visit Stack Exchange

laptop – What new noteboks stll docking stations support?

I've been looking for newer laptops that support docking stations. It seems that manufacturers do not make it very easy to know which specific models have built-in support for this function. Many say they support the coupling, but what they really mean is that the device supports port replication through the USB-c connector. That's not what I'm looking for … What I have in mind is something like the HP Slimdock.

This is my question….

What newer laptops still have an integrated capability to use a direct-style docking station through some type of integrated backplane connection?

search algorithms: find the shortest time to go from one stop to another in a train system with many train lines with connecting stations

Then, after discussing with my friend the other day, I was thinking, how would I use something like the search for breadth or depth to find the fastest time to go from one station to another if there are several different train lines in a system of subway. They can cross each other, maybe even several times.

Train line in this case means a train that goes from a departure station to an end station, with many station stops along the way, where certain station stops can give the option of the driver changing to another "line" It also has its start and stop stop. A simple example is a two-line metro system like this:

o : station   - : track

                     Line 2 
                     START
                       |
                       o
                       |
Line 1 START o -- o -- o -- o -- o -- o END 
                       |
                      END

I live in Taipei, Taiwan, so you can check the MRT train map there for reference, but it can seem quite complicated. I was looking for advice for a simpler start and ways to find a solution to a minor problem first, but the MRT system is my objective goal and that of my friend.

What I have thought so far

  • Have an array that contains each stop name along with the time
    take the previous stop to get to this stop represents a single train
    line, with each connection to another train line being a nested array
    in that article
  • Find out how to tell the algorithm to look through each route to find the destination stop, adding the necessary time on the way
    comparing to find the shortest time.

Things to consider

  • The time between each station is known to us. But for the purpose of this question, suppose it is 5 minutes between each station.
  • A train line has a start stop and an end stop, but on the way you can stop at a stop that connects to any other train line.
  • Any connection to another train line can be connected to another line, but this third line can be accessed by taking a more complicated route by changing the train lines. That is, if I try all the possibilities, you can take loop routes and try forever.
    • It is possible to take a transfer from one line to another and go left or right on the new line, that is, the trains are not unidirectional.

So how is it possible

Avoid our algorithm by making loops, for example:

If line 1 connects to line 2 at its third stop, and that connects to a third line, and then returns to line 1 later on line 3. Then, if we were to try to find the way more Short from a stop on line 1 to another stop on line 1, the algorithm can try to move from line 1 to line 2 by taking the connection and then to line 3 back to line 1 and vice versa.

And also, how do we decide where to make the turns, and what is a better way to represent this problem and find the shortest time?