The mechanical properties and micro-forming of the Au-based bulk metallic glasses are reported in this thesis. The original ingots were prepared by arc melting and induction melting. The Au49Ag5.5Pd2.3Cu26.9Si16.3 bulk metallic glasses with different diameters 2 and 3 mm were successfully fabricated by conventional copper mold casting in an inert atmosphere. By the observation of transmission electron microscopy diffraction pattern, there are crystalline phases among the amorphous matrix phase. The Au49Ag5.5Pd2.3Cu26.9Si16.3 bulk metallic glass shows the high glass forming ability and good thermal stability. By the Differential scanning calorimetry (DSC) results, the values of£G£Vx and £G£Vm are 50 and 21 K. And Trg, £^, and £^m values for the Au49Ag5.5Pd2.3Cu26.9Si16.3 bulk metallic glass (BMG) at the heating rate of 0.67 K/s are 0.619, 0.430 and 0.774, respectively. The mechanical properties of Au49Ag5.5Pd2.3Cu26.9Si16.3 in terms of compression testing are examined using an Instron 5582 universal testing machine. Room temperature compression tests are conducted on specimens with various strain rates. To know the size effect, the micro-pillars were made by using a focus ion beam (FIB) technique. The micro-pillars were under the tests of compression at different strain rates, compared with macro-scale 2 mm rod specimens. In contrast to the brittle fracture in a bulk sample, these micro-pillar specimens show significant plasticity. The morphology of compressed pillar samples indicates that the number of shear bands increased with the sample size and strain rates.

Along with the popularity of the financial industry¡¦s becoming more and more free, large and international, the merging of banking industries becomes the inevitable trend. This research applied the resource-based theory to conduct a case study of merging of public banks by means of the qualitative research so as to understand the financial revolution policy of the financial governmental department and the comprehensive development of the banks studied. This research also focused on the study if the surviving bank made great use of ¡§resources¡¨ to connect with performances & generate the merging synergy. In this research, the main motivation of merging of banks lies in the managing efficacy of economies of scale and economies of scope and the external growth of incorporation can be reached by that. The key factors of successful merging for Bank of Taiwan and Central Trust of China lied in the low homogeneity, fair complementary financial business as well as the excellent base of management. ¡§Resources¡¨ are the key point of incorporation competitive advantage. By the mutual cooperation of capacity renewal and extension, incorporation can make growth and profit as well as reduce the managing risk. Accordingly, the construction and accumulation of resources is the primary consideration of the strategic decision-makers. This research not only justified the effectiveness of the rise in the corporation competitive advantages by ¡§resources¡¨ but also richened the versatility of the resource-based theory. The conclusion of this research was as follows. 1. The merging of Bank of Taiwan and Central Trust of China could enhance the competitive advantages of Bank of Taiwan, develop the managing synergy and achieve the external growth. 2. The merging of Bank of Taiwan and Central Trust of China had the positive assistance in enhancing the economies of scale and extending the economies of scope for Bank of Taiwan. 3. The merging of Bank of Taiwan and Central Trust of China made the application of Bank of Taiwan¡¦s incorporation resources and the connection with performances more efficiently as well as reduced the management cost.

Proteins are the structural components of living cells and tissues, and thus an important building block in all living organisms. Patterns in proteins sequences are some subsequences which appear frequently. Patterns often denote important functional regions in proteins and can be used to characterize a protein family or discover the function of proteins. Moreover, it provides valuable information about the evolution of species. Patterns contain gaps of arbitrary size. Considering the no--gap--limit sequential pattern problem in a protein database, we may use the algorithm of mining sequential patterns to solve it. However, in a protein database, the order of segment appearing in protein sequences is important and it may appear many times repeatedly in a protein sequence. Therefore, we can not directly use the traditional sequential pattern mining algorithms to mine them. Many algorithms have been proposed to mine sequential patterns in protein databases, for example, the SP-index algorithm. They enumerate patterns of limited sizes (segments) in the solution space and find all patterns. The SP-index algorithm is based on the traditional sequential pattern mining algorithms and considers the the problem of the multiple--appearances of segments in a protein sequence. Although the SP-index algorithm considers the characteristics of bioinformatics, it still contains a time--consuming step which constructs the SP-tree to find the frequent patterns. In this step, it has to trace many nodes to get the result. Therefore, in this thesis, we propose a Bit--Pattern--based (BP) algorithm to improve the disadvantages of the SP-index algorithm. First, we transform the protein sequences into bit sequences. Second, we construct the frequent segments by using the AND operator. Because we use the bit operator, it is efficient to get the frequent segments. Then, we prune unnecessary frequent segments, which results in the case that we do not have to test many frequent segments in the following step. Third, we use the OR operator to get the longest pattern. In this step, we test whether two segments can be linked together to construct a long segment, and we get the result by testing once. Because we focus on which position the segment appears on, we can use the OR operator and then judge the bit sequences to get the result. Thus, we can avoid many testing processes. From our performance study based on the biological data, we show that we can improve the efficiency of the SP-index algorithm. Moreover, from our simulation results, we show that our proposed algorithm can improve the processing time up to 50\% as compared to the SP-index algorithm, since the SP--index algorithm has to trace many nodes to construct the longest pattern.

Recently, Botnet has become one of the most severe threats on the Internet because it is hard to be prevented and cause huge losses. Prior intrusion detection system researches focused on traditional threats like virus, worm or Trojan. However, traditional intrusion detection system cannot detect Botnet activities before Botmasters launch final attack. In Botnet attack, in order to control a large amount of compromised hosts (bots), Botmasters use public internet service as communication and control channel (C&C Channel). IRC (Internet Relay Chat) is the most popular communication service which Botmasters use to send command to their bots. Once bots receive commands from Botmasters, they will do the corresponding abnormal action. It seems that Botnet activities could be detected by observing abnormal IRC traffic. In this paper, we will focus on IRC Server and, we will use four unique characteristics of abnormal channel, (1) the prefix of Botmaster communication in C&C channel, (2) the response messages of bots, (3) average response time from bots, and (4) average length of message, to detect abnormal Channel in IRC Server. We develop an on-line IRC IDS to detect abnormal IRC channel. In the proposed system, abnormal IRC channel can be detect and we can (1) identify the infected hosts (bots) and Botmaster in C&C Channel, (2) trackback the IP of Bots and Botmaster, (3) identify Bots before Botmasters launch final attack, and (4) find the pattern of abnormal channel. The experiments show that the proposed system can indeed detect abnormal IRC channel and find out bots and Botmaster.

The design of SoC is growing into more complicated, hence it is necessary to determine an efficient way to develop an SoC. If we can explore the relation between hardware architecture and software operation, there will be a great help for designing SoC platform. This paper builds the highly abstract simulation platform by using the development tool of SystemC and Coware for 3D graphics SoC. SystemC is entirely based on C++, so that Coware Inc. supports many TLM IP modules (like ARM CPU, ARM BUS, Memory, and etc.) for designer. For the purpose of fast building and modifying module by designer, this paper discusses 1. the behavior module performance in 3D Graphics Traditional Architecture, Tile-based Architecture of non-pipeline, pipeline, and GE&DMA Concurrence. 2. If it can use the software application to control procedure order of GE and RE, it would decrease the read/write times for RE reading from Tile. 3. To modify the read/write mechanism of Tile Buffer and change the returned values from memory, it would reduce the read/write times from memory. 4. And we need to observe FIFO sizes of traditional architecture to estimate affection performance.5. It uses Tile-Divider to predict the cutting triangle. Finally, 6. it modifies the AHB bus to AXI bus and divides single memory; therefore it can reduce the waiting bus time of GE and RE and improve the efficient of bus communication.

Botnet is a combination of Cyber Attack, infection, and dissemination. Cross the Internet, the infected hosts might launch DDoS (Distributed Denial-of-Service) Attack, become a proxy sending SPAM according to commands from botmasters via some public services such as IRC, P2P or Web (HTTP) protocol. Among these command and control channel, Web-based Botnet is much difficult to detect because the command and control messages of Web-based Botnet are spread through HTTP protocol and hide behind normal Flows. In this research, we focus on analysis and detection of Web-based Botnet, detection by features - Timeslot, calculation of NetFlow, B2S(Bot to Server) and S2B(Server to Bot) of Web-based Botnet. The experimental result shows the proposed approach which uses the features mention above is good in many different topology designs. In addition, we also got nice detection rate in real network design.

In this work, a novel type of optical waveguide, namely two-step undercut-etching Si waveguide (TSUESW), fabricated in Si-substrate is proposed and demonstrated. All this waveguide processing is based on two step of SF6-based dry etching method. In the first step, an anisotropic etching by Reactive Ion Etching (RIE) is used to define the waveguide core. After that, an undercut etching through an isotropic etching processing Electron Cyclotron Resonance (ECR) is then utilized to decouple the optical light of the waveguide core from Si substrate. In the measurement setup, an optical propagation loss coefficient of 2.89dB/cm is obtained by extracting from Fabry-Perot oscillation, suggesting the confined optical mode in TSUESW can be realized. A tapered optical waveguide is also designed and fabricated, where the core of tapered structure is defined as widths of from 20£gm to 6£gm for optical fiber coupler. A 4.13dB/cm of loss from 700£gm long waveguide is found in such tapered waveguide. Through the nonlinear properties of Si material, a Four-Wave Mixing (FWM) behavior is observed in tapered waveguide, further confirming the optical power can be highly confined in small core of TSUESW. It also should be noted that the waveguide technology template can be processed in a Si-substrate to realize CMOS-compatible processing, avoiding high-cost Silicon-On-Insulator (SOI) technology.

Many location-based routing protocols have been developed recently, and have been demonstrated to be scalable and efficient for packet routing in mobile ad hoc networks. Using location-based routing requires that a node obtains the node position with which it wants to communicate. This task is generally achieved by a location service. This work presents a novel routing protocol, called Hierarchical Cell-Structured Routing (HCR) Scheme, with a location service. The network area is divided into a number of regular triangular regions, called cells. The nodes forward the packets by some chosen cells, and are classified to be three level hierarchical structures. The hierarchical approach of HCR makes it especially suitable for high network density. Moreover, the traffic loads in HCR are shared by all nodes rather than just by some specific nodes, thus the overhead is reduced at high traffic loads. Simulation results indicate that HCR has better performance than Location-Aid Routing (LAR), in terms of packet delivery ratio, end-to-end delay and overhead in high traffic load.

Thesis (Ph. D.)--University of Oregon, 2000. / Typescript. Includes vita and abstract. Includes bibliographical references (leaves 241-252). Also available for download via the World Wide Web; free to University of Oregon users.

Dissertation (Ph. D.)--University of Akron, Dept. of Sociology, 2009. / "May, 2009." Title from electronic dissertation title page (viewed 11/25/2009) Advisor, Kathryn M. Feltey; Committee members, Joanna Dreby, Rudy Fenwick, Baffour Takyi, Peggy Stephens; Department Chair, John F. Zipp; Dean of the College, Chand Midha; Dean of the Graduate School, George R. Newkome. Includes bibliographical references.