Explore chapters and articles related to this topic
Honeypots
Published in Mohssen Mohammed, Al-Sakib Khan Pathan, Automatic Defense Against Zero-day Polymorphic Worms in Communication Networks, 2016
Mohssen Mohammed, Al-Sakib Khan Pathan
One of the advantages of this approach is that the activities of the attacker are naturally “sandboxed” within the boundaries of the software running on a host operating system. The honeypot can pretend to be, for example, a Solaris server, with TCP/IP stack characteristics of a Solaris system emulated to fool operating system fingerprinting and services that one would expect to see on such a server running Solaris. However, because these services are incompletely implemented, exploits written to compromise a Solaris server will at best result in a simulated compromise of the honeypot. That is, if the exploit is known and handled by the honeypot, the actual host operating system is not compromised. For the worst case, the exploit will fail because the exploit is unknown or the vulnerability is not implemented in the honeypot.
A computational journey in the true north
Published in International Journal of Parallel, Emergent and Distributed Systems, 2020
I went from a personal computer based on an Intel Pentium processor, to a Sun workstation running the Unix (and then the Solaris) operating system. I currently use a LENOVO ThinkPad laptop, a Microsoft Surface, and an Apple iMac. I used to travel to conferences laden with a stack of acetate transparencies on which my talk was inscribed. Then I moved to digital slide presentations and carried the talk on my computer. Shortly thereafter, I only needed to take a USB stick on which the talk was stored. Now, all I have to do is put the presentation online and travel hands free! My first digital camera in 1997, was a Kodak DC210; it had a resolution of one Megapixel. I now carry a SONY α 7Rii which has a resolution of 42.4 Megapixels. Incidentally, I was one of the first users of a computer tablet: I owned a WACOM tablet that I used in my digital dark room.
The facility layout instances of the generalised travelling salesman problem
Published in International Journal of Production Research, 2021
Ardavan Asef-Vaziri, Morteza Kazemi, Maryam Radman
We now present our computational considerations. We have used the general-purpose MIP solver IBM ILOGCPLEX V12.1 to solve the problem. All computations were carried out on a Sun Microsystems Ultra 10 workstation with a 440 MHz UltraSPARC-IIi processor and 128 MBytes of RAM, running the Solaris 8 operating system. We computationally compare the optimal global solution with (i) Sh-loop, (ii) MNC-loop, and (iii) the I-MNC-loop. We show that the complementary heuristics developed in the space between (i) and (iii) provide promising solutions to minimise the total loaded and empty flow in AGVSs.