With enormous vulnerability discovered and Internet prevailing in the word, users confront with the more dangerous environment. As a result, the users have to understand the system risk necessarily. The vulnerability scanner provides the functionality that could check if the system is vulnerable. Nessus is a vulnerability scanner. It provides the customization capability that users could defined the security check. It develops a attack language called NASL. By use of NASL, users could write the security check by themselves. But before writing the security check, the users must know the architecture of Nessus and study how to write the security check by NASL. Different vulnerabilities have different the detection approach and communications method. If users don't know about above knowledge, they couldn¡¦t write the security check. In this research, we develop a automatic mechanism of generating code for the Nessus scanner and produce a security check. And we also provide two approaches to produce the security check. The one is the modularization. It takes part of function codes into a module, and combines the modules into a security check. The other one is package. The users can't involve the attack code and just only fill in some of parameters to produce the security check. This research proposes the design above and actually implements a system to generate attack codes. It attempts to decrease the needs of knowledge to users about security check, reduce the error rates by human typos, and enhance the efficiency and correctness for writing the security check

Smart antenna, which weights are obtained by Wiener solution, would suppress some undesired interference signals in spatial domain. The other interference signals that cannot be suppressed by smart antenna or caused by near-far effect will be post-processed by multiuser detectors. In the proposed algorithm, the cross-correlation matrix of desired signal and received signal from smart antenna algorithm would be applied to multiuser detector to reduce the complexity. From computer simulation results, the proposed algorithm has lower complexity and better BER performance than separate smart antenna or multiuser detection algorithms. Detail derivations of complexity and BER performance are also provided in this thesis.

Captain is a key player for controlling the commercial shipping and has the major role in dealing with the occurrence and process of stowaway case. His decision on handling the stowaway is often complicated by the unnecessary legal issues if it is not following the normal process such as the violation of unlawful action on processing the stowaway issue. The stowaway case always has been a serious problem in commercial shipping. It often causes unnecessary legal issues for shipping owner and captain because of unwise decision from the ship captain. Since the occurrence of 911 terrorism in 2001, International Ship and Port facility Security Code (ISPS Code) has adopted more restrict security code on the prevention of stowaway, but it has indirectly resulted in the tendency toward underground and better organized shipping stowaway crime. This change has also provided guidance for captain¡¦s decision on the process of stowaway case. The present study illustrates two important stowaway cases occurred at Taiwan commercial shipping lines. One is related to liner, the Maersk Dubai, and the other is for tramp, the Well Pescadoies. The present study made comparison on both case handling processes and their treatments on stowaways and the problems of derived legal actions resulting from the unwise and unnecessary actions from the ship captains. The study adopted the person to person interview results and discussion with ship captains, literature search, and case legal documents for analyzing the possible process problem of stowaway associated with both cases. The present study summarized the precautionary approaches and guidance for ship owner and captain on the prevention of stowaway and the requirement of ISPSC code including related IMO convention, protocol, and regulation. Other main concerns are how to promote the shipping security including the duty of captain and the interests of shipping owner.

In this thesis, we consider decentralized multiclass classification problem in wireless sensor networks. In literature, the decentralized detection using error correcting code has been shown to have good fault-tolerance capability. In this thesis, we provide fault-tolerance capability by employing the code with a particular structure so that the decoding at the fusion center can be efficient. Specifically, the convolution code is employed to decode the local decision vector sent from all the local sensors. In addition, we proposed an efficient convolution code design algorithm by using simulated annealing. The simulation result shows that the proposed approach has good performance.

In the end of 1978, China started to launch reforms, especially in economy. Thus, the Chinese advertising industry brings the market back; the commercial advertisement rises again. Over twenty years, some advertisement copies have created billions of sales, however, some of the copies was judged without any creativity. This paper primarily concentrates on studying the Chinese advertisement copy. In reviewing the studies of the Chinese advertisement, this paper takes the approach of cognitive psychology as a theoretical framework. In Richard Atkinson and Richard Shiffrin¡¦s view, when the information inputs in one¡¦s eyes it will become a short-term memory which stored in human brain, by repeating the broadcast information, which will also become a long-term memory. Eventually, if consumers touch the products, no matter the brand or the advertisement, their memories will be aroused from their long-term memory. This research concluded that audiences are attracted by the advertisement because of various affective reactions /emotional response. It showed that the advertisement may focus on consumers¡¦ emotional code ¢w cultural code. So the copywriter can input the Chinese traditional culture in an advertisement copy such as piety, decorum and familism, it will arouse Chinese emotional response more easily.

In this thesis, we consider the distributed classification problem in wireless sensor networks (WSNs). Sensor nodes in WSNs detect environmental variations and make their decisions individually, after which their decisions, possibly in the presence of faults, are transmitted to a fusion center. In literature, the distributed classification fusion using error correcting codes has been shown to have good sensor fault-tolerance capability. In this thesis, we extend the fault-tolerant classification system using error correcting code by using two-dimensional channel coding. We also extend the binary coding in literature to the M-ary code. This thesis then suggests a code construction method with low computational complexity. Based on the suggest code construction method, this thesis then conducts a series experiment to investigate the performance of the suggested method.

Code optimization or code transformation is a complex function of a compiler involving analyses and modifications with the entire program as its scope. In spite of its complexity, hardly any tools exist to support this function of the compiler. This thesis presents the development of a code transformation system, specifically for scalar transformations, which can be used either as a tool to assist the generation of code transformers or as an environment for experimentation with code transformations. The development of the code transformation system involves the formal specification of code transformations using dependence relations. We have written formal specifications for the whole class of traditional scalar transformations, including induction variable elimination - a complex transformation - for which no formal specifications are available in the literature. All transformations considered in this thesis are global. Most of the specifications given here, for which specifications are already available in the literature, are improved versions, in terms of conservativeness.The study of algorithms for code transformations, in the context of their formal specification, lead us to the development of a new algorithm for partial redundancy elimination. The basic idea behind the algorithm is the new concepts of safe partial availability and safe partial anticipability. Our algorithm is computationally and lifetime optimal. It works on flow graphs whose nodes are basic blocks, which makes it practical.In comparison with existing algorithms the new algorithm also requires four unidirectional analyses, but saves some preprocessing time. The main advantage of the algorithm is its conceptual simplicity. The code transformation system provides an environment in which one can specify a transformation using dependence relations (in the specification language we have designed), generate code for a transformer from its specification,and experiment with the generated transformers on real-world programs. The system takes a program to be transformed, in C or FORTRAN, as input,translates it into intermediate code, interacts with the user to decide the transformation to be performed, computes the necessary dependence relations using the dependence analyzer, applies the specified transformer on the intermediate code, and converts the transformed intermediate code back to high-level. The system is unique of its kind,providing a complete environment for the generation of code transformers, and allowing experimentations with them using real-world programs.

<p>Software systems form an essential part of Western society,serving as tools to uphold institutions, processes andservices. It is understandable, therefore, that the mostfundamental aspects of programs are their function and utility.But they are not, however, the only things programmers areconcerned with when writing them.</p><p>On the contrary, programmers also discuss about many otheraspects of software, including the beauty of code. Theydistinguish between different programming styles and expresstheir personal preferences, often by way of admiring andvilifying other people's code. Programmers' identification withaesthetic preferences may give rise to vanity, to disagreementsso entrenched that they deserve the name of 'holy wars' and toother similar phenomena.</p><p>This thesis describes and analyses these phenomena, whichultimately originate in the human faculty to create andappreciate nuances, to become attached to them and to engage indisputes because of them - even infields as standardised ascomputer programming. Its aim is to expose the aesthetics ofcode, and in doing so, to discuss the symbolic aspects ofinstrumental action at large.</p><p><b>Keywords:</b>aesthetics, code, instrumental action,internet discussion fora, programming, symbolic action</p>

<p>This essay investigates cases of Swedish-English code-switching in a bilingual discussion forum on the Internet. Code-switching is a linguistic term used to describe switches from one language to another in discourse. The material consists of excerpts from the forum which have been analyzed and presents various cases of code-switching which appeared in the forum. The examples from the forum presented in this essay are chosen due to their relevance to code-switching and bilingualism. The examples were analyzed according to Romaine’s (1989) and Klintborg’s (1999) classifications of code-switching.</p><p>The research questions sought to find out if, how and why the bilingual users in this forum code-switch when communicating. The results proved that the bilingual users do code-switch, and that the most common switch is the insertion of one word, or several words, in another language into an otherwise monolingual sentence. The discussion part also consists of a summary of the switches in the forum.</p><p>The conclusion of the study is that code-switching does exist in this forum, and the participants code-switch in different ways, however mainly to show hospitality and to signal a belonging to the group.</p>

<p>The introduction of Java 5.0 came along with an extension of the language syntax. Several new language features as generic types and enumeration types were added to the language specification. These features cause downward-incompatibilities, code written in Java 5.0 will not work on older versions of the Java runtime environment. For some active projects, however, it is not possible to upgrade to higher Java versions, since some code might not be supported on Java 5.0. If one still wants to use components written in Java 5.0, these must be downgraded. Up to now this has been accomplished mostly by transforming the byte code of these programs.</p><p>In this thesis, we present a set of transformations which transform Java 5.0 source code to Java 1.4 compatible code. We successfully apply these transformations to two larger projects and compare our approach to the up to now common byte-code based tools.</p>