 spend a little more on travel, and if you were a business person you could knock the cost of your travel off of your tax bill. But, as a student you are stuck with having to pay from your limited budget. So, here are eight ideas that will help you save a little money when traveling.
There are often lots of different discounts for students, and a common one is some sort of travel discount. You may have applicable discounts that you can use in your area, town, city, borough, or even in your entire state. You should look into the various discounts available for the train, bus, tube and trams. You may be missing out on some great money saving discounts. Your school or college will also probably have information on all of your applicable discounts.
If you book any trip well in advance and pay for it in advance then you are more likely to get a better deal. Travel companies like people who book ahead because it saves them a lot of marketing and administration money, plus it is a form of potential/guaranteed income. This rule applies mostly to package holidays, flights and trains. It is possible to get last minute deals for these things, but you take a massive risk of not getting anything at all if you wait too long; especially if you are planning to travel around the holiday season.
If you are going abroad then you should expect a big phone bill when you get back. Roaming fees are still massive, but there are two things you can do. You can turn off your phone and leave it off so that there is no chance of you being charged, (or you can leave it at home). Alternatively, you can call your carrier, explain the situation and ask what your options are. Some may put you on a temporarily lower plan, and others may give you an Internet deal in your foreign land so that you can Video chat home over the Internet.
You may think that you have very little worth stealing, but traveling insurance is not just about being robbed in foreign lands. It is also about injury and sickness. You have to remember that Britain (and possibly Turkey) are our only real allies and are the only ones that actually like us. If you go abroad somewhere else and say you are American in the wrong area, then you may have medical bills to pay for. But, it is not only that, even if your appendix bursts or you break your leg skiing, it is going to cost you a lot of money if you do not have travel insurance.
The good ones are expensive to buy, but they may last you a very long time. Plus, there is nothing worse than those small rips that start to appear in your luggage, through which you lose tablet batteries and credit cards. Also, try to buy luggage that you can lock so that baggage handler, coach drivers, and other students cannot get their thieving little hands into it. The lock will also make it less likely for you to leave your luggage open when you take it with you.
Do not rely on them, but do check them. It is more about luck than it is about them being great. You may just get lucky and find a last minute deal that happens to be going where you want to go at the right time. With comparison sites it is different as the competition often means that companies hide charges for holidays and packages. The luck come in when you find a package that has add-on charges that you can afford.
No, this is not a joke; if you want to save money you should buy a bicycle. Some people will say that you should walk or take the bus if you want to save money on traveling, but a bike is far better. A bicycle will get you places that may appear un-walk-able. It may seem ridiculous to walk 5 miles for a doctor’s appointment, but you can get there on a bike in 20 minutes (average speed of 15 miles per hour). Better still, if the journey is mostly downhill then take your bike there and get a train or bus back.
Share car journeys with your fellow students, but actually sit down and discuss it. You can arrange weekly car trips to the sports grounds or to the superstores. You can all either chip in for gas money with one car, or alternate whose car you take each week. If you actually create a small car-pool group and make a few decisions about who, when and where, then you can actually save a lot of money in the long run.
Data Hiding and Retrieval Using Permutation Index Method

In this paper a novel approach for matrix manipulation and indexing is proposed.Here the elements in a row of matrix are designated by numeric value called permutation index followed by the elements of the row being randomised. This is done for all the rows of the matrix and in the end the set of permutation indices are put in the parent matrix and random locations depending on a pre decided scheme called passkey. This passkey is used to put back the elements of all the rows back in the correct sequence. This approach finds application in data encapsulation and hiding.


Introduction
Sound files and Image files in electronic formats are basically stored as numeric data in matrix forms. Thus data manipulation of electronic sound and image files is nothing but matrix manipulation. Two matrices having different sequence of elements belonging to the same domain set are fundamentally different and thus represent different data. We use this very basic concept and manipulate and randomise the sequence of elements that make up the matrix, thus rendering it obscure, followed by putting back the elements in the correct sequence. This approach can be used to protect all data that are essentially in matrix forms.
Sound files are read as column matrix while Image files are read as two or three dimensional matrices depending on them being greyscale, RGB etc. As already described we randomise the sequence of matrix elements and render it obscure to an unauthorized system or person. The highly randomized sets of elements are organized using a scheme called 'passkey' which will be present by default with a person to whom the data is supposed to be delivered.
In this method each row of the matrix is analysed and the 'permutation-index', later described, of the entire is row found out. This is followed by placement of permutation indices in the parent matrix as per a pre decided scheme between transmitter and receiver called passkey. This process is carried out for all the rows and in the end all the permutation-indices are arranged in the parent matrix according the passkey scheme that is pre decided during shuffling and alteration of rows.
The authorized person who is meant to decrypt the haphazard set of data has the passkey which helps to organize the elements of the matrix to fetch meaningful information. [27] [28]

Related Work
This techniques holds application in the field of data hiding and thus before analysing this work we put forth a survey of various data hiding techniques Kuo et al's work put forth a novel method to hide and conceal data by fragmenting an image into smaller blocks and then developing the histogram for each block [1] [2]. This is followed by creating minimum and maximum points so as to create space to embed and hide the data. [3] [4]. In Kodos {5] work we come across a method of data hiding in audio formats [26] which the polarity of reverberations are embedded in high frequency audio signals. The embedded data is fetched by correlation of addition and subtraction of audio signals. Data hiding in video signals was proposed in Le et al [6] which is based on individual video frames that make up the entire video sequence [7]. It is an adaptive embedding algorithm wherein residual 4x4 DCT blocks are scanned in an inverse zig zag fashion until first non zero coefficient is encountered. This coefficient is compared with a predefined value and embedding is done if the coefficient is larger. [8] [9] The authors in [10] have provided a novel approach to hide more data in an image wherein the histogram of blocks of an image are shifted to a point corresponding to the minimum point on the histogram and data is stored between these points. A bit plane splicing algorithm was proposed by Naseem et al [11]. In this approach rather than hiding the data in pixel by pixel we store data depending on the intensity of individual pixels. Various ranges are defined for various pixels and data bits are stored randomly in the matrix rather than being adjacent to each other. Similar approach was implemented by the authors of [12][13] to hide data in halftone images.

Sequence Alteration or Shuffling.
For description purpose we take an arbitrary 5x5 matrix "A".
A If all the elements of all the rows are randomized then the probability of finding the correct sequence of all the elements in all the rows : It can be clearly seen that brute force attack to guess all the elements of even a small 5 cross 5 matrix is implausible owing to such minimal probability. Thus for higher order matrices brute force guessing is impractical. It is more convenient to use this approach for matrices having less than or around 8 or 9 columns in each row as higher number of columns lead to big and complex 'permutation matrices', described henceforth [14].

Permutation Index (#P)
It was earlier stated that rows of matrices are designated by a numeric value called permutation index. Def of Permutation Index: Permutation index of a row in a matrix, say R1, carrying n elements is the row index number of a matrix, called Permutation matrix, which represents all the permutations of the elements of the row R1taken n at a time and in reverse lexicographic order.
Let's take an arbitrary 3x3 matrix:  A matrix containing all the permutations of a set of elements in a sequence would also be its superset. As per the above definition the permutation index of row R3 will be the row which represents all the elements of R3 in the exact sequence. Thus the permutation index of R3 here is, 5 or