Thursday, January 11, 2018

101 most used websites on the WWW


  • Screenr.com - record movies of your desktop and send them straight to YouTube.
  • ctrlq.org/screenshots - capture screenshots of web pages on mobile and desktops.
  • goo.gl- shorten long URLs and convert URLs into OR codes.
  • unfurlr.com- find the original URL that's hiding behind a short URL.
  • qClock- find the local time of a city using a Goo* Map.
  • copypastecharacter.com -copy special characters that aren't on your keyboard.
  • postpost.com - a better search engine for twitter.
  • lovelycharts.com - create flowcharts, network diagrams, sitemaps, etc.
  • iconfindercom - the best place to find icons of all sizes.
  • office.com - download templates, clipart and images for your Office documents.
  • followupthen.com - the easiest way to setup email reminders.
  • jotti.org - scan any suspicious file or email attachment for viruses.
  • wolfra malpha .com - gets answers directly without searching.
  • printwhatyouli ke.com - print web pages without the clutter.
  • joliprint.com - reformats news articles and blog content as a newspaper.
  • ctrql.org/rss - a search engine for RSS feeds.
  • e.ggtimer.com - a simple online timer for your daily needs.
  • coralcdn.org - if a site is down due to heavy traffic, try accessing it through coral CON.
  • random.org - pick random numbers, flip coins, and more.
  • pdfescape.com - lets you can quickly edit PDFs in the browser itself.
  • viewer.zoho.com-Preview PDFs and Presentations directly in the browser.
  • tubemogul.com - simultaneously upload videos to WuTube and other video sites.
  • ctrlq.org/dictation -online voice recognition in the browser itself.
  • scrim -share you email address online without worrying about seam.
  • spypig.com - now get read receipts for your email.
  • sizeasy.com - visualize and compare the size of any product.
  • myfonts.com/WhatTheFont - quickly determine the font name from an image.
  • google.com/webtonts - a good collection of open source fonts.
  • regex.info - find data hidden in your photographs -see more BitIF tools.
  • livestream .com - broadcast events live over the web, including your desktop screen.
  • iwantmyname.com -helps you search domains across all TLDs.
  • homestyler.com - design from scratch or re -model your home in 3d.
  • join.me - share you screen with anyone over the web.
  • onlineocr.net - recognize text from scanned PDFs - see other OCR toots.
  • flightstats.com- Track flight status at airports worldwide.
  • wetransfer.com - for sharing really big files online.
  • hundredzeros.com - the site lets you download free Kindle books.
  • polish mywriting.com - check your writing for spelling or grammatical errors.
  • marker.to-easily highlight the important parts of a web page for sharing.
  • typewith.me - work on the same document with multiple people.
  • whichdateworks.com - planning an event? find a date that works for all.
  • everytimezone.com - a less confusing view of the world time zones.
  • gtmetrix.com - the perfect tool for measuring your site performance online.
  • noteflight.com - print music sheets, write your own music online (review).
  • moire - chat with your buddies on Skype, Facebook, Google Talk, etc. from one place.
  • translate.google.com - translate web pages, PDFs and Office documents.
  • kleki.com - create paintings and sketches with a wide variety of brushes.
  • similarsites.com - discover new sites that are similar to what you like already.
  • wordle.net - quick summarize long pieces of text with tag clouds.
  • bubbl.us - create mind -maps, brainstorm ideas in the browser.
  • kuler.adobe.com - get color ideas, also extract colors from photographs.
  • liveshare.com -share your photos in an album instantly.
  • Imgtfy.com - when your friends are too lazy to use Google on their owl.
  • midomi.com - when you need to find the name of a song.
  • bing.conVimages- automatically find perfectly -sized wallpapers for mobiles.
  • faxzero.com - send an online fax for free - see more fax services.
  • feed myinbox.com - get RSS feeds as an email newsletter.
  • ge.tt - quickly send a file to someone, they can even preview it before downloading.
  • pipebytes.com -transfer files of any size without uploading to a third -party server.
  • tinychat.com - setup a private chat room in micro -seconds.
  • privnote.com - create text notes that will self-destruct after being read.
  • boxoh .com --track the status of any shipment on Google Maps - attemative.
  • chipin.com - when you need to raise funds online for an event or a cause.
  • downforeveryoneorjustme.com - find if your favorite website is offline or not?
  • ewhois.com - find the other websites of a person with reverse Analytics lookup.
  • whoishostingthis.com - find the web host of any website.
  • google.com/history - found something on Google but can't remember it now?
  • aviary.com/myna - an online audio editor that lets record, and remix audio clips online.
  • disposablewebpage.com - create a temporary web page that self-destruct.
  • uthandictionary.com - find definitions of slangs and informal words.
  • seatguru.com - consult this site before choosing a seat for your next flight.
  • sxc.hu - download stock images absolutely free.
  • zoom it - view very high -resolution images in your browser without scrolling.
  • scribblemaps.com -create custom Google Maps easily.
  • alertful.com - quickly setup email reminders for important events.
  • picmonkey.com - Picnik is offline but PicMonkey is an even better image editor.
  • formspring.me - you can ask or answer personal questions here.
  • sumopaint.com - an excellent layer -based online image editor.
  • snopes.com -find if that email offer you received is real or just another scam.
  • typingweb.com - master touch-typing with these practice sessions.
  • mailvu.com - send video emits to anyone using your web cam.
  • timerime.com - create timelines with audio, video and images.
  • stupeflix.com - make a movie out of your images, audio and video dips.
  • safeweb.norton.com - check the trust level of any website.
  • teuxdeux.com - a beautiful to-do app that looks like your paper dairy.
  • deadurl.com - you'll need this when your bookmarked web pages are deleted.
  • minutes.io - quickly capture effective notes during meetings.
  • youtube.corn/leanback-Watch YouTube channels in TV mode.
  • youtube.com/disco - quickly create a video playlist of your favorite artist.
  • talltweets.com - Send tweets longer than 140 characters.
  • pancake.io - create a free aid simple website using your Dropbox account.
  • built with.com - find the technology stack of any website.
  • woorank.com - research a website from the SW perspective.
  • mix1r.com - broadcast live audio over the web.
  • radbox.me - bookmark online videos and watch them later (review).
  • tagmydoc.com - add OR codes to your documents and presentations (review).
  • notes.io - the easiest way to write short text notes in the browser.
  • ctrlq.org/html-mail - send rich -text mails to anyone, anonymously.
  • fiverr.com - hire people to do little things for $5.
  • otixo.com - easily manage your online files on Dropbox, Google Does, etc.
  • ifttt.com - create a connection between all your online accounts

Tuesday, July 18, 2017

Why Microservices?



(Click following image to read full article)


(Click following image to watch full video)




Thursday, July 13, 2017

HL 7 History


HL7 International considers the following standards to be its primary standards:

  • Version 2.x Messaging Standard – an interoperability specification for health and medical transactions (1989)
  • Version 3 Messaging Standard – an interoperability specification for health and medical transactions (2005)
  • Clinical Document Architecture (CDA) – an exchange model for clinical documents, based on HL7 Version 3 
  • Continuity of Care Document (CCD) – a US specification for the exchange of medical summaries, based on CDA.
  • Structured Product Labeling (SPL) – the published information that accompanies a medicine, based on HL7 Version 3
  • Clinical Context Object Workgroup (CCOW) – an interoperability specification for the visual integration of user applications
  • Fast Healthcare Interoperability Resources (FHIR) – a draft standard for the exchange of resources (2015)
ref: https://en.wikipedia.org/wiki/Fast_Healthcare_Interoperability_Resources

Friday, May 12, 2017

Ransomware WanaCry caused by EternalBlue exploit, Fix

To ensure you are not a victim of recent ransomware (know as WanaCry, caused by EternalBlue exploit) download patch here... 

  https://technet.microsoft.com/en-us/library/security/ms17-010.aspx

Thank you.

Thursday, April 14, 2016

Research Themes

Research Themes

This sections shows a number of Research Themes of interested for our group. You can click on the picture or on 'More >>' to get more information about each of these topics.
Research ThemeDescription

Machine Learning and Data Mining.
Machine Learning, or how to construct programs that automatically learn from experience is a core component of Artificial Intelligence. Its aim is to identify patterns in data and construct some knowledge (e.g. rules, decision trees, support vectors) that model this data. Some of its applications include medical diagnosis, bioinformatics, stock markets predictions, search engines, recommendation systems, etc. and, in general, any kind of prediction. Data Mining deals with the extraction of knowledge from vasts amounts of data. It contains machine learning as one of its main core components. While machine learning aim is to obtain accurate models, data mining is more focused on knowledge discovery. That is, providing the users with new insight about the data being mined.

Case-Based Reasoning.
As a knowledge based methodology, CBR solves problems by reusing knowledge for solving previous similar problems. The knowledge is modeled and stored as cases in the reasoning system. We investigate CBR techniques to solve complicated scheduling problems including personal scheduling and timetabling problems. Not only solutions themselves are reused, but also are previous heuristics in similar problem solving situations reused for solving different scheduling problems.

Runtime Analysis.
Most research about evolutionary algorithms and other randomised search heuristics is of an empirical nature. The theoretical understanding of these methods has been limited. We analyse the runtime (also called optimisation time) of randomised search heuristics mathematically using techniques from probability theory, randomised algorithms, and computational complexity. This type of analysis provides mathematically proven statements about the performance of randomised search heuristics. Such results give valuable insights into how the performance of a given randomised search heuristic depends on its parameter-settings and on the characteristics of the underlying optimisation problem.

Fuzzy Systems.
Fuzzy systems is an alternative to traditional notions of set membership and logic. Many decision-making and problem-solving tasks are too complex to be understood quantitatively, however, people succeed by using knowledge that is imprecise rather than precise. We use this technology in application areas such as medical optimisation and production scheduling.

Heuristics and Metaheuristics.
Although powerful optimisation techniques and other exact algorithms exist to tackle difficult search and optimisation problems, in some cases such techniques take too long to produce a solution of the required quality within realistic timescales. Hence, heuristic and metaheuristic techniques are powerful and flexible alternatives to tackle these difficult problems. Heuristic and metaheuristic algorithms seek to produce good-quality solutions in reasonable computation times by following a series of pre-defined and often also randomised steps. Heuristics and metaheuristics can be constructive (produce a solution and then stop) or improvement (iteratively improve the current solution and then stop) approaches, but they can also be single-solution or population-based. We investigate and develop a range of heuristic and metaheuristic (H/MH) techniques including their hybridisation with other methods. We develop tailored H/MH algorithms to tackle specific problems. We also develop more generalised H/MH strategies to tackle a broader range of problems. Investigating the functioning and performance of these techniques is also part of our research work.

Multi-objective Optimisation.
Multi-objective optimisation is an important area of research that focuses on techniques to tackle problems in which multiple (possibly conflicting) objectives exist. For such problems, the goal is often to obtain a set of solutions representing a compromise between the various objectives. We investigate multi-objective optimisation techniques to solve a range of multi-objective problems. Our aim is to understand the nature of these multi-objective problems in order to tackle them within a multi-objective framework. We also investigate the applicability of multi-objective search and optimisation approaches to a variety of problems, mainly of combinatorial nature. Developing effective and efficient methods for tackling complex multi-objective optimisation problems is also part of our research work, which covers a range of multi-objective techniques including goal programming, evolutionary multi-objective algorithms and multi-objective variants of many other heuristic and metaheuristic algorithms.

Constraint Programming.
Constraint programming originated from constraint solving and logic
programming. Based on the strong constraint propagation and integrated with heuristic search, it has been successfully applied to many highly constrained combinatorial optimisation problems. We investigate advanced constraint programming techniques which are closely integrated with operational research techniques (including column generation) and heuristics for solving highly complex and constrained real world problems
including nurse scheduling problems.

Educational Timetabling.
In educational timetabling problems, a set of exams, courses or project presentations, etc. need to be scheduled into limited resources including rooms within a certain number of time periods. A number of constraints of different importance, which are usually different in different institutions also need to be satisfied. In ASAP group, we investigate a wide range of algorithms in meta-heuristics and different techniques concerning multi-objective and constraints handling, etc in educational timetabling problems. One of our research directions is to explore approaches that can operate at a higher level of generality than what the current timetabling system can support.

Personnel Scheduling.
Personnel scheduling problems are found in a wide variety of environments. Some of the most complex and challenging problems arise in hospitals and healthcare centres, for example nurse and physician rostering. The benefits of automating the rostering process in these situations include reducing the planner's workload and associated costs and being able to create higher quality and more flexible schedules. This has become more important recently in order to retain nurses and attract more people into the profession. Better quality rosters also reduce fatigue and stress due to overwork and poor scheduling and help to maximise the use of leisure time by satisfying more requests. A more contented workforce leads to higher productivity, increased quality of patient service and a better level of healthcare. The ASAP group has developed a number of novel and very effective rostering algorithms in real world scenarios. These approaches include tabu search, variable neighbourhood search, memetic algorithms, case-based reasoning, hyperheuristics, hybrid methods and many others. In order to scientifically test and validate these algorithms we have created a suite of highly challenging benchmark data sets from a number of hospitals around the world. These data sets are publicly available athttp://www.cs.nott.ac.uk/~tec/NRP/. This collection is the only source of a wide range of real world nurse rostering benchmark instances and a valuable asset of the personnel scheduling community.

Production Scheduling/Re-scheduling.
Real world production scheduling problems, which require the efficient allocation of jobs onto machines, are notoriously complex: machines are many and of different characteristics, workers get sick, new jobs arrive to the shop floor, machines break down, etc. Moreover, the case where two or more objective functions have to be optimised simultaneously is often present. Under these circumstances, classical optimisation methods are usually insufficient and, in order to be successful, scheduling systems have to make use of modern artificial intelligence (AI) based techniques. ASAP is a leader in the investigation, design and application of AI techniques, including evolutionary algorithms and hyperheuristics, hybridised with fuzzy systems and multi-objective optimisation approaches, to the scheduling and rescheduling of production shops. Algorithms developed by ASAP have been successfully applied to a wide variety of problems that emerge, among others, from steel production, printed circuit board assembly, cardboard box manufacturing and the printing industry.

Cutting and Packing.
We are conducting research into a variety of stock cutting problems. These include the knapsack problem, regular and irregular 2-dimensional nesting, and other stock cutting variants. We are looking at placement algorithms, case-based reasoning approaches and other current techniques to solve such problems whilst also developing new heuristics and metaheuristics to reduce the size of the search space and produce good solutions. Our research is particularly relevent to the manufacturing industry, so we are closely working with a local company so that our research can be implemented for real world applications.

Portfolio Optimisation.
Recent research on both combinatorial optimisation and financial engineering leads to an increased amount of research in portfolio optimisation based on the modern portfolio theory, i.e the Mean-Variance model. By selecting a subset of investment assets, the objectives of the problem are to maximise the expected return as well as to minimise the risk. We investigate advanced computational methods including matheuristics based on mathematical programming and heuristics to address large scale portfolio optimisation problems with additional constraints to the basic model. In addition, intelligent search algorithms are studied concerning a range of real world trading constraints and multiple objectives.

Network Routing.
Multicast routing in wireless telecommunication aims to identify least cost paths in multicast groups satisfying a range of constraints including delay bound. Recent multimedia multicast applications are featured with a range of Quality of Service requirements. These include bandwidth, delay variation as well as link cost and utilisation. The introduction of network coding further extends the complexity of the problem, attracting an increasing research attention in both information theory and operational research. We investigate advanced evolutionary algorithms to address such problems with real world constraints and multiple objectives. Fundamental analysis on the fitness landscape also provide insight on designing effective evolutionary algorithms. Robust techniques are also investigated conncerning dynamic and delay tolerant network routing.

Office Space Allocation.
The office space allocation problem refers to the allocation of entities to the available office space. Entities can be people (e.g. staff, research students, etc.) or 'functions' (e.g. meeting room, utility room, toilet, etc.). The available office space is usually a set of physical rooms within a building. Each entity requires certain office space (i.e. floor area) and each room has certain capacity (i.e. room size). There are additional requirements that limit the way in which the entities can be allocated to the rooms. For example, certain entities must not share a room with another entitiy or certain entities should be allocated to the same or 'nearby' rooms as other entities. The problem is then to assign each entity to a room in such as way that the utilisation of the available office space is maximised while considering the additional requirements. This is very difficult combinatorial optimisation problem given its highly constrained nature (the additional requirements). We have investigated this problem for several years now including the modelling and understanding of the problem as well as the development of mathematical programming, heuristic and metaheuristic techniques to solve it effectively and efficiently.

Transportation Logistics Optimisation.
There is a variety of difficult optimisation problems in transport logistics and we conduct research on the modelling and solving of several of these problems. In particular, we conduct research on problems arising in air transport and also road transport scenarios. For example, our expertise in air transportation problems includes airport operations such as aircraft landing and take-off, baggage handling and stand/gate allocation among others. Our expertise on road transportation problems includes truck loading and routing, warehouse operations, packing of good in HGVs and planning of maintenance operations. Our research at the interface of operations research, computer science and artificial intelligence focuses on the development of effective computational techniques to underpin the implementation of decision support systems to assist in the more efficient execution of these transportation operations. We have a strong record of working with industry in the modelling and solution of real-world complex transportation logistics problems.