Browsing by Subject "Networks (circuits)"
Now showing 1 - 6 of 6
Results Per Page
Sort Options
Item Open Access Autonomous multiple teams establishment for mobile sensor networks by SVMs within a potential field(2012) Nazlibilek, S.In this work, a new method and algorithm for autonomous teams establishment with mobile sensor network units by SVMs based on task allocations within a potential field is proposed. The sensor network deployed into the environment using the algorithm is composed of robot units with sensing capability of magnetic anomaly of the earth. A new algorithm is developed for task assignment. It is based on the optimization of weights between robots and tasks. The weights are composed of skill ratings of the robots and priorities of the tasks. Multiple teams of mobile units are established in a local area based on these mission vectors. A mission vector is the genetic and gained background information of the mobile units. The genetic background is the inherent structure of their knowledge base in a vector form but it can be dynamically updated with the information gained later on by experience. The mission is performed in a magnetic anomaly environment. The initial values of the mission vectors are loaded by the task assignment algorithm. The mission vectors are updated at the beginning of each sampling period of the motion. Then the teams of robots are created by the support vector machines. A linear optimal hyperplane is calculated by the use of SVM algorithm during training period. Then the robots are classified as teams by use of SVM mechanism embedded in the robots. The support vector machines are implemented in the robots by ordinary op-amps and basic logical gates. Team establishment is tested by simulations and a practical test-bed. Both simulations and the actual operation of the system prove that the system functions satisfactorily. © 2012 Elsevier Ltd. All rights reserved.Item Open Access Cournot competition in networked markets(ACM, 2014) Bimpikis, K.; Ehsani, S.; İlkılıç, RahmiThe paper considers a model of competition among firms that produce a homogeneous good in a networked environment. A bipartite graph determines which subset of markets a firm can supply to. Firms compete a la Cournot and decide how to allocate their production output to the markets they are directly connected to. We assume that markets have inverse linear demand and firms have quadratic production costs. First, we show that the resulting Cournot game has a unique equilibrium for any given network and provide a characterization of the production quantities at equilibrium. Our results identify a close connection between the equilibrium outcome and supply paths in the underlying network structure. In particular, we show that whether two firms see their output in different markets as strategic substitutes or complements depends critically on the paths between those markets in the line graph induced by the original bipartite network. Armed with a characterization of the equilibrium supply decisions, we explore the effect of changes in the network structure on firms' profits and consumer welfare. First, we study the question of a firm entering a new market. We show that entry may not be beneficial for either the firm or the consumers as such a move affects the entire vector of production quantities. The firm might face a more aggressive competition in its original markets due to its entry to a new market. Moreover, the effect on other firms and consumers also depends on their location in the network. This is in stark contrast with standard results in Cournot oligopoly where entry implies more competition in the market and thus higher consumer welfare. Similarly, the effect of a merger between two firms on profits and overall welfare largely depends on the structure of competition in the original Cournot market. In particular, we show that insights from analyzing mergers in a single market do not carry over in a networked environment. Market concentration indices are insufficient to correctly account for the network effect of a merger and one should not restrict attention to the set of markets that the firms participating in the merger supply to. Finally, we study the operations of a cartel including the entire set of firms. We show that the cartel maximizes its profits by appropriately segmenting the markets among its members so that a firm supplies solely to the ones allocated to it, and we provide an algorithm that computes the optimal production quantities for each firm in the cartel. © 2014 Authors.Item Open Access Energy reduction in 3D NoCs through communication optimization(Springer Wien, 2015) Ozturk, O.; Akturk I.; Kadayif I.; Tosun, S.Network-on-Chip (NoC) architectures and three-dimensional (3D) integrated circuits have been introduced as attractive options for overcoming the barriers in interconnect scaling while increasing the number of cores. Combining these two approaches is expected to yield better performance and higher scalability. This paper explores the possibility of combining these two techniques in a heterogeneity aware fashion. Specifically, on a heterogeneous 3D NoC architecture, we explore how different types of processors can be optimally placed to minimize data access costs. Moreover, we select the optimal set of links with optimal voltage levels. The experimental results indicate significant savings in energy consumption across a wide range of values of our major simulation parameters.Item Open Access Improving AWE accuracy using multipoint Pade approximation(IEEE, 1994-05-06) Çelik, Mustafa; Ocali, Ogan; Tan, Mehmet Ali; Atalar, AbdullahA new method is proposed for dominant pole-zero analysis of large linear circuits containing both lumped and distributed elements. This method is based on a multipoint Pade approximation. It finds a reduced order s-domain transfer function using a data set obtained by solving the circuit at only a few frequency points. The proposed method yields more accurate computation of transient and frequency responses with respect to the AWE-type techniques.Item Open Access On the Delay Margin for Consensus in Directed Networks of Anticipatory Agents(Elsevier B.V., 2016) Irofti D.; Atay, F. M.We consider a linear consensus problem involving a time delay that arises from predicting the future states of agents based on their past history. In case the agents are coupled in a connected and undirected network, the exact condition for consensus is that the delay be less than a constant threshold that is independent of the network topology or size. In directed networks, however, the situation is quite different. We show that the allowable maximum delay for consensus depends on the network topology in a nontrivial way. We study this delay margin in several network constellations, including various circulant networks with directed links. We show that the delay margin depends not only on the number of neighbors, but also on the directionality of connections with those neighbors. Furthermore, the delay margin improves as the circulant networks are rewired en route to a small-world configuration. © 2016Item Open Access Plasmonics: merging photonics and electronics at nanoscale dimensions((AAAS) American Association for the Advancement of Science, 2006) Özbay, EkmelElectronic circuits provide us with the ability to control the transport and storage of electrons. However, the performance of electronic circuits is now becoming rather limited when digital information needs to be sent from one point to another. Photonics offers an effective solution to this problem by implementing optical communication systems based on optical fibers and photonic circuits. Unfortunately, the micrometer-scale bulky components of photonics have limited the integration of these components into electronic chips, which are now measured in nanometers. Surface plasmon-based circuits, which merge electronics and photonics at the nanoscale, may offer a solution to this size-compatibility problem. Here we review the current status and future prospects of plasmonics in various applications including plasmonic chips, light generation, and nanolithography.