This thesis examines the construction of social spaces in the interstices of the Internet by members of dispersed national societies. Red de Argentinos is explored as an example one of such spaces. Red emerged as an email based solidarity network of the Argentine diaspora and is now a community attached to multiple locales, for which cyberspace has a central articulatory role. These locales include the homeland but, as well, the variety of places in which individuals identifying themselves as Argentinian may be found. This project analyzes some of the factors that allow these types of virtual communities to develop. Special attention is placed on the elements that ensure bonds between members. Self-organization, solidarity, and positioning in relation to the Argentine social reality are seen here as factors that foster the development of a sense of citizenship that is constructed from below in this particular online social space. The need to include the Internet practices of diasporas as part of emerging online cultures in Latin America is finally suggested as an avenue for future exploration.

This thesis will examine issues related to the formation and validity of electronic contracts on a comparative basis between the English, American and UNCITRAL approaches.  When examining the English approach, reference will be made to relevant EC Directives in relation to the subject matter. This thesis has four main objectives.  First, to assess the impact of using electronic communication tools to reach agreement.  Second, to identify some key points that should be considered when examining the formal validity of electronic contracts. Third, to establish a foundation for having a valid contract in which rights and obligations could arise accordingly.  Finally, this thesis aims to identify whether the traditional contract law rules are able to meet the challenges that are brought by the use of electronic communication tools, or whether they require reform. It will be noticed throughout that electronic contracts come in different types.  This leads to difficulty with introducing one rule to cover all types of electronic contracts. Furthermore, some concerns arise when electronic communication tools are used to form contracts as to the exact time of contracting. Other concerns arise when trying to fulfil some legal formalities such as writing and signature.  This is because of the special and dual nature of electronic data and the possibility of using different types of signature methods in cyberspace. Finally, it is important to consider taking steps to update some of the current contract law rules to work alongside the electronic technology revolution.  Some aspects of the traditional contract law rules become challenging when applied to electronic contracts.  For example, the issues of contract formation and the use of electronic and intelligent software require direct attention when considering the issue of e-contracts.  The reference to such challenging well-established contract law rules is necessary throughout this thesis, however, since the current rules which deal with electronic commerce in general and electronic contracts in particular do not cover all the issues that are related to electronic contracts.  Lastly, this thesis will sound the alarm on the need to raise the legal awareness of both online users and website developers when contracting online. <i>Chapter Two</i> will assess the use of electronic communication tools to form such contracts, and the sorts of problems that could arise as a consequence. <i>Chapter Three</i> will highlight whether or not electronic contracts can be considered written and signed when the law imposes such requirement.  This chapter will also seek to determine whether there is a need for such formalities in cyberspace. <i>Chapter Four</i> is designed to deal with selected issues of material validity of electronic contracts.  This chapter is essential when considering all types of electronic contracts, including formal ones.  It will consider issues that are related to mutual assent in cyberspace, and the problems that could arise with web-based contracts in relation to these.

My thesis is to design a Controlled Area Network (CAN) simulator For Microsoft Windows. In a modern world we deal with complex mechanical systems that require special electronic control to guarantee ultimate safety and efficiency. These electronic control systems are responsible for monitoring subsystems within the mechanical systems. A good example of this is the motor vehicles that are being driven on the road today. These vehicles have been designed with increased safety and efficiency, such as electronic controlled anti lock breaks, fuel injection, and power control steering. To run all of these components, the car needs a very well designed protocol to be able to control series of messages being passed from one subsystem to another. To determine which message being passed has higher priority than any other messages. To deal with such circumstances, the Controlled Area Network (CAN) was designed. The purpose of the CAN simulator is to gather statistical information concerning the arbitration, message transfer, error detection, error signaling, and retransmision. The CAN simulating model will consist of one to sixty nodes. Each node is considered as a subsystem for the CAN simulator. The subsystems will be characterized as the breaks, engine, transmission, or any part of a car which needs to be connected to the CAN system. Each node will send one to ten messages through the CAN system. The CAN system will take the messages from the nodes and place them into an Arrival queue. Each node will have its own Arrival queue, and no nodes can have two messages on the bus at the same time. The messages will be sorted in the queues in the order of the time needed to be released onto the bus. There will be an internal clock that will monitor the time for when the messages are needed to be placed onto the bus. If there is a situation where two messages need to be sent at the same time, the arbitrator will determine the priority of the messages to be placed onto the bus. Once the message is on the bus, it will go to a transfer queue. Periodically, there will be an error signal sent with the message that will be detected by the error detection, and it will be required that the message to be retransmitted. At critical points on the simulation, statistical information will be gathered for an analyzation. Some examples of information to be analyzed are 1) verification of the simulation performance on a single node with a single message, 2) network load which is a rate of a utilized bus time to the total bus time, 3) network throughput which is a total number of messages that are transmitted per second, and 4) average response time which will be the average time taken by all messages to gain bus access.PLATFORM DESCRIPTIONThe computer to be used in this project will be an Intel Pentum 100 with 16 megs RAM, two 853 megabyte harddrive, and a 17 inch super VGA monitor. The user interface will be windows 3.1 application. The compiling language to be used will be Microsoft Visual C++. / Department of Computer Science

No description available.

No description available.

Over the past decade, webcriminality has become a real issue. Because they allow the botmasters to control hundreds to millions of machines, botnets became the first-choice attack platform for the network attackers, to launch distributed denial of service attacks, steal sensitive information and spend spam emails. This work aims at designing and implementing a honeynet, specific to IRC bots. Our system works in 3 phasis: (1) binaries collection, (2) simulation, and (3) activity capturing and monitoring. Our phase 2 simulation uses an IRC redirection to extract the connection information thanks to a IRC redirection (using a DNS redirection and a "fakeserver"). In phase 3, we use the information previously extracted to launch our honeyclient, which will capture and monitor the traffic on the C&C channel. Thanks to our honeynet, we create a database of the activity of IRC botnets (their connection characteristics, commands on the C&C ), and hope to learn more about their behavior and the underground market they create.

A Hybrid Meshnet LAN, a new local area network architecture, has been proposed by Dr. Cheoul-Shin Kang and Dr. James Herzog. It provides for distributed control hybrid architecture which is good for effective load sharing under various local area network environments. Hybrid Meshnet has a dual channel structure, a token ring and a collection of full-duplex data links. The multiple high-speed transmissions, private and secure communications and large volume of data transmission capability are some of the features of Hybrid Meshnet. The design features necessary to implement the network interface unit (NIU) for the Hybrid Meshnet are presented. The unit is a multiprocessor system with each processor having a RISC-like architecture. Various asynchronous activities are distributed among the three processors resulting in a balanced network interface unit. Except for the time critical and non-varying functions, all the functionalities of the unit are programmable. The hybrid meshnet protocol is still in the development stage. The programmable unit will accommodate the changes in the protocol. The network interface unit will be compatible with most of the host computer systems. The study is one step forward in the direction of Hybrid Meshnet Local Area Network's implementation. / Graduation date: 1993

"The topology of a network (such as a telecommunications, multiprocessor, or local area network, to name just a few) is usually modelled by a graph in which vertices represent 'nodes' (stations or processors) while undirected or directed edges stand for 'links' or other types of connections, physical or virtual. A cycle that contains every vertex of a graph is called a hamiltonian cycle and a graph which contains a hamiltonian cycle is called a hamiltonian graph. The problem of the existence of a hamiltonian cycle is closely related to the well known problem of a travelling salesman. These problems are NP-complete and NP-hard, respectively. While some necessary and sufficient conditions are known, to date, no practical characterization of hamiltonian graphs has been found. There are several ways to generalize the notion of a hamiltonian cycle. In this thesis we make original contributions in two of them, namely k-walks and r-trestles." --Abstract. / Doctor of Philosophy

Doctor of Philosophy

Thesis (PhDTelecommunications)--University of South Australia, 2008.