Wolfram Computation Meets Knowledge

Date Archive: 2014 September

Products

Modeling Aircraft Flap System Failure Scenarios with SystemModeler

Explore the contents of this article with a free Wolfram SystemModeler trial. Have you heard about the Boeing 747 Dreamlifter that flew to the wrong airport and was forced to land on too short of a runway? Luckily, that story had a happy ending, and no passengers were hurt. Still, it is a potentially dangerous scenario when the landing distance required (LDR) is longer than the runway, and there are other possible reasons for such a situation besides a pilot gone astray. One potential cause of such a scenario is a flap system failure. Flaps are hinged devices located on the trailing edges of the wings, where their angular position can be adjusted to change the lift properties of the plane. For example, suitably adjusting the flap position can enable the plane to be flown at a lower speed while maintaining its lift, or allow it to be landed with a steeper angle of descent without any increase in speed. One of several resulting advantages is that the LDR becomes shorter. This makes me wonder: Could a small flap failure increase the LDR so much that the assigned runway is suddenly too short? To answer such a question, you have to understand the effects that a failure on a component level have at a system level. How will the control system react to it? Can we somehow figure out how to detect it during a test procedure? Can we come up with a safety procedure to compensate for it, and what happens if the pilot or maintenance personnel for some reason fail to follow that procedure?
Announcements & Events

Presentations Available from Wolfram Experts Live: New in Mathematica 10

Following one of our most anticipated releases to date, we hosted the virtual workshop Wolfram Experts Live: New in Mathematica 10 to give the Wolfram community the details on this latest version of our flagship product Mathematica. A dozen Wolfram experts and Mathematica developers came together at our headquarters—both in person and remotely via online connections---to take turns showing off new advances in usability, algorithmic functionality, and integration with the Wolfram Cloud. Presenters participated in a live Q&A with the online audience, and in turn were able to hear from Mathematica users and enthusiasts.
Products

Introducing Tweet-a-Program

In the Wolfram Language a little code can go a long way. And to use that fact to let everyone have some fun, today we’re introducing Tweet-a-Program. Compose a tweet-length Wolfram Language program, and tweet it to @WolframTaP. Our Twitter bot will run your program in the Wolfram Cloud and tweet back the result.

Announcements & Events

Launching Today: Mathematica Online!

It’s been many years in the making, and today I’m excited to announce the launch of Mathematica Online: a version of Mathematica that operates completely in the cloud—and is accessible just through any modern web browser. In the past, using Mathematica has always involved first installing software on your computer. But as of today that’s […]

Education & Academic

Mathematica Summer Camp 2014 Comes to a Close

Thirty students from six different countries came together to explore their passion for programming and mathematics for two weeks in July, and the result was extraordinary! Each and every one of these students created a significant Wolfram Language project during the camp. Their projects and interests ranged from physics and mathematics to automotive engines to poker and blackjack.
Computation & Analysis

Solving the Knight’s Tour on and off the Chess Board

I first came across the knight's tour problem in the early '80s when a performer on the BBC's The Paul Daniels Magic Show demonstrated that he could find a route for a knight to visit every square on the chess board, once and only once, from a random start point chosen by the audience. Of course, the act was mostly showmanship, but it was a few years before I realized that he had simply memorized a closed (or reentrant) tour (one that ended back where he started), so whatever the audience chose, he could continue the same sequence from that point. In college a few years later, I spent some hours trying, and failing, to find any knight's tour, using pencil and paper in various systematic and haphazard ways. And for no particular reason, this memory came to me while I was driving to work today, along with the realization that the problem can be reduced to finding a Hamiltonian cycle—a closed path that visits every vertex—of the graph of possible knight moves. Something that is easy to do in Mathematica. Here is how.