Finitely presented quadratic algebras of intermediate growth

In this article, we give two examples of finitely presented quadratic algebras (algebras presented by quadratic relations) of intermediate growth

K-ary n-cube based off-chip communications architecture for high-speed packet processors

A k-ary n-cube interconnect architecture is proposed, as an off-chip communications architecture for line cards, to increase the throughput of the currently used memory system. The k-ary n-cube architecture allows multiple packet processing elements on a line card to access multiple memory modules. The main advantage of the proposed architecture is that it can sustain current line rates and higher while distributing the load among multiple memories. Moreover, the proposed interconnect can scale to adopt more memories and/or processors and as a result increasing the line card processing power. Our results portray that k-ary n-cube sustained higher incoming traffic load while keeping latency lower than its shared-bus competitor. © 2005 IEEE

Energy-efficient pipelined bloom filters for network intrusion detection

This document is made available in accordance with publisher policies. Please cite only the published version using the reference above. Full terms of use are available

Parliament membership during the single-party system in Turkey (1925-1945)

The official legitimization of the single-party regime in Turkey lay with Parliament, which, as a representative of the people, controlled the legislature, the executive and the judiciary. However, the parliamentary period after 1925 was highlighted by a lack of freedom of speech, with scope for political discussion limited. This paper aims to establish the role of MPs during this period. At the head of the single-party system, the President was free to choose every party member for Parliament. This meant competition was very restricted, be it in the form of short-lived opposition parties or independent candidates. During the selection process, some social classes, for example high-ranking officer and bureaucrats were privileged. These two groups were the most common in Parliament. On the other hand, local ties were sometimes respected by the regime: rural notables with close relations with party headquarters were easily elected, and remained in Parliament. A MPs’ chance of re-election was significant if he performed his duty with loyalty to the party. The author underlines a stabilization of political personnel throughout this period

Backward recalculation of seasonal series affected by economic crisis: a Model-Based-Link method for the case of Turkish GDP

When attempting to deal with the recalculation process, it is hard to answer the question “Does the recalculated series include economic events and seasonal behaviours in the past?”. This paper discusses some alternative backward recalculation methods and presents the applications and their results relative to the Turkish Gross Domestic Product (GDP) series. Using comparative analysis, it is shown that ordinary ARIMA forecasts and signal extraction methods are not successful at taking into account past events in the backward recalculated series. A new innovative method, named Modelbased-link, is then proposed and suggested by the authors in order to be able to take past economic events and seasonal patterns into account when the series is to be backward recalculated. A first application of this new method is run on the quarterly series of the Turkish GDP. In addition, it is shown that the Model-based-link method can be extended to data sets of different frequencies (i.e. annual data). Consequently, it can be claimed that a comparable recalculated quarterly and annual Turkish GDP series for forthcoming data is obtained. The paper is structured as following: section 1 introduces the reader to the state of the art in the current literature; section 2 defines the information set to be backward recalculated and presents some statistics on the data while section 3 presents the main methodological statistical aspects of classical methods compared to the methodological scheme of the Model-based-link that can be used for the recalculation process. Section 4 presents results of the methods mentioned in the previous section and section 5 discusses the extension of the Model-based-link method to monthly data and includes an application for annual data; section 6 concludes. Finally, section 7 presents topics for discussion and challenges for continuation of the analysis

A low-power network search engine based on statistical partitioning

Network search engines based on Ternary CAMs are widely used in routers. However, due to parallel search nature of TCAMs power consumption becomes a critical issue. In this work we propose an architecture that partitions the lookup table into multiple TCAM chips based on individual TCAM cell status and achieves lower power figures

A network processor for a learning based routing protocol

Recently, Cognitive Packet Networks (CPN) is proposed as an alternative to the IP based network architectures and shows similarity with the discrete active networks. In CPN, there is no routing table, instead reinforcement learning (Random Neural Networks) is used to route packets. CPN routes packets based on QoS, using measurements that are constantly collected by packets and deposited in mailboxes at routers. The applicability of the CPN concept has been demonstrated through several software implementations. However, higher data traffic and increasing packet processing demands require the implementation of this new network architecture in hardware. In this paper, we present a network processor architecture which supports this learning based protocol. ©2004 IEEE

Increasing the power efficiency of Bloom filters for network string matching

Although software based techniques are widely accepted in computer security systems, there is a growing interest to utilize hardware opportunities in order to compensate for the network bandwidth increases. Recently, hardware based virus protection systems have started to emerge. These type of hardware systems work by identifying the malicious content and removing it from the network streams. In principle, they make use of string matching. Bit by bit, they compare the virus signatures with the bit strings in the network. The Bloom filters are ideal data structures for string matching. Nonetheless, they consume large power when many of them used in parallel to match different virus signatures. In this paper, we propose a new type of Bloom filter architecture which exploits well-known pipelining technique. © 2006 IEEE

Low-power bloom filter architecture for deep packet inspection

Bloom filters are frequently used to identify malicious content like viruses in high speed networks. However, architectures proposed to implement Bloom filters are not power efficient. In this letter, we propose a new Bloom filter architecture that exploits the well-known pipelining technique. Through power analysis we show that pipelining can reduce the power consumption of Bloom filters up to 90%, which leads to the energy-efficient implementation of intrusion detection systems. © 2006 IEEE