Open Access. Powered by Scholars. Published by Universities.®

Computer Engineering Commons

Open Access. Powered by Scholars. Published by Universities.®

Computer Sciences

2007

Institution
Keyword
Publication
Publication Type
File Type

Articles 271 - 300 of 321

Full-Text Articles in Computer Engineering

Price Of Asynchrony: Queuing Under Ideally Smooth Congestion Control, Maxim Podlesny, Sergey Gorinsky Jan 2007

Price Of Asynchrony: Queuing Under Ideally Smooth Congestion Control, Maxim Podlesny, Sergey Gorinsky

All Computer Science and Engineering Research

The ability of TCP (Transmission Control Protocol) or alternative congestion control algorithms to operate successfully in networks with small link buffers has recently become a subject of intensive research. In this paper, we investigate fundamental limitations on minimum buffer requirements for any congestion control. We present an idealized protocol where all flows always transmit at their fair rates. The ideally smooth congestion control causes link queuing only due to asynchrony of flow arrivals, which is intrinsic to computer networks. Our analysis and simulations for different distributions of flow interarrival times agree that the buffer size needed for a fixed loss …


Fair Efficiency, Or Low Average Delay Without Starvation, Christoph Jechlitschek, Sergey Gorinsky Jan 2007

Fair Efficiency, Or Low Average Delay Without Starvation, Christoph Jechlitschek, Sergey Gorinsky

All Computer Science and Engineering Research

Elastic applications are primarily interested in minimal delay achievable for their messages under current network load. In this paper, we investigate how to transmit such messages over a bottleneck link efficiently and fairly. While SRPT (Shortest Remaining Processing Time) is an optimally efficient algorithm that minimizes average delay of messages, large messages might starve under SRPT in heavy load conditions. PS (Processor Sharing) and ViFi (Virtual Finish Time First) are fair but yield higher average delays than under SRPT. We explore the class of fair algorithms further and prove that no online algorithm in this class is optimally efficient. Then, …


A Fingerspelling Sign Language Visualization , Carol S. Brickman Jan 2007

A Fingerspelling Sign Language Visualization , Carol S. Brickman

All Computer Science and Engineering Research

The goal of the Fingerspell Visualization Project is to research methods to improve learning of reading skills through sign language. The techniques are centered on Fingerspelling as the method to bridge stages of skill development. Visualization of a string of text in images of a hand performing the letters of the alphabet in standardized fingerspell sign language positions provide Full Motion Learning as opposed to learning from single pictures.


Lower Bounds On Queuing And Loss At Highly Multiplexed Links, Maxim Podlesny, Sergey Gorinsky Jan 2007

Lower Bounds On Queuing And Loss At Highly Multiplexed Links, Maxim Podlesny, Sergey Gorinsky

All Computer Science and Engineering Research

Explicit and delay-driven congestion control protocols strive to preclude overflow of link buffers by reducing transmission upon incipient congestion. In this paper, we explore fundamental limitations of any congestion control with respect to minimum queuing and loss achievable at highly multiplexed links. We present and evaluate an idealized protocol where all flows always transmit at equal rates. The ideally smooth congestion control causes link queuing only due to asynchrony of flow arrivals, which is intrinsic to computer networks. With overprovisioned buffers, our analysis and simulations for different smooth distributions of flow interarrival times agree that minimum queuing at a fully …


Hexa: Compact Data Structures For Faster Packet Processing, Sailesh Kumar, Jonathan Turner, Patrick Crowley, Michael Mitzenmacher Jan 2007

Hexa: Compact Data Structures For Faster Packet Processing, Sailesh Kumar, Jonathan Turner, Patrick Crowley, Michael Mitzenmacher

All Computer Science and Engineering Research

Directed graphs with edge labels are used in packet processing algorithms for a variety of network applications. In this paper we present a novel representation for such graph that significantly reduces the memory required for such graphs. This approach called History-based Encoding, eXecution and Addressing (HEXA) challenges the conventional assumption that graph data structures must store pointers of log2n bits to identify successor nodes. HEXA takes advantage of implict information to reduce the information that must be stored explicitly. We demonstrate that the binary tries used for IP route lookup can be implemented using just two bytes per stored prefix …


Leveraging Est Evidence To Automatically Predict Alternatively Spliced Genes, Master's Thesis, December 2006, Robert Zimmermann Jan 2007

Leveraging Est Evidence To Automatically Predict Alternatively Spliced Genes, Master's Thesis, December 2006, Robert Zimmermann

All Computer Science and Engineering Research

Current methods for high-throughput automatic annotation of newly sequenced genomes are largely limited to tools which predict only one transcript per gene locus. Evidence suggests that 20-50% of genes in higher eukariotic organisms are alternatively spliced. This leaves the remainder of the transcripts to be annotated by hand, an expensive time-consuming process. Genomes are being sequenced at a much higher rate than they can be annotated. We present three methods for using the alignments of inexpensive Expressed Sequence Tags in combination with HMM-based gene prediction with N-SCAN EST to recreate the vast majority of hand annotations in the D.melanogaster genome. …


Distributed Allocation Of Workflow Tasks In Manets, Rohan Sen, Gruia-Catalin Roman, Christopher Gill Jan 2007

Distributed Allocation Of Workflow Tasks In Manets, Rohan Sen, Gruia-Catalin Roman, Christopher Gill

All Computer Science and Engineering Research

When multiple participants work on a workflow that represents a large, collaborative activity, it is important to have a well defined process to determine the portions of the workflow that each participant is responsible for executing. In this paper, we describe a process and related algorithms required to assign tasks in a workflow, to hosts that are willing to carry out the execution of these tasks, and thereby contributing to the completion of the activity. This problem is a stylized form of the multi-processor scheduling algorithm which has been shown to be NP-Hard. Further complicating the issue is that we …


Efficient Fair Algorithms For Message Communication, Sergey Gorinsky, Eric J. Friedman, Shane Henderson, Christoph Jechlitschek Jan 2007

Efficient Fair Algorithms For Message Communication, Sergey Gorinsky, Eric J. Friedman, Shane Henderson, Christoph Jechlitschek

All Computer Science and Engineering Research

A computer network serves distributed applications by communicating messages between their remote ends. Many such applications desire minimal delay for their messages. Beside this efficiency objective, allocation of the network capacity is also subject to the fairness constraint of not shutting off communication for any individual message. Processor Sharing (PS) is a de facto standard of fairness but provides significantly higher average delay than Shortest Remaining Processing Time (SRPT), which is an optimally efficient but unfair algorithm. In this paper, we explore efficient fair algorithms for message communication where fairness means that no message is delivered later than under PS. …


Context-Aware Publish Subscribe In Mobile Ad Hoc Networks, Davide Frey, Gruia-Catalin Roman Jan 2007

Context-Aware Publish Subscribe In Mobile Ad Hoc Networks, Davide Frey, Gruia-Catalin Roman

All Computer Science and Engineering Research

The publish-subscribe communication paradigm is enjoying increasing popularity thanks to its ability to simplify the development of complex distributed applications. However, existing solutions in the publish-subscribe domain address only part of the challenges associated with the development of applications in dynamic scenarios such as mobile ad hoc networks. Mobile applications must be able to assist users in a variety of situations, responding not only to their inputs but also to the characteristics of the environment in which they operate. In this paper, we address these challenges by extending the publish-subscribe paradigm with the ability to manage and exploit context information …


Roadmap Analysis Of Protein-Protein Interactions. Master's Thesis, August 2007, Brian C. Haynes Jan 2007

Roadmap Analysis Of Protein-Protein Interactions. Master's Thesis, August 2007, Brian C. Haynes

All Computer Science and Engineering Research

The ability to effectively model the interaction between proteins is an important and open problem. In molecular biology it is well accepted that from sequence arises form and from form arises function but relating structure to function remains a challenge. The function of a given protein is defined by its interactions. Likewise a malfunction or a change in protein-protein interactions is a hallmark of many diseases. Many researchers are studying the mechanisms of protein-protein interactions and one of the overarching goals of the community is to predict whether two proteins will bind, and if so what the final conformation will …


Perpetual: Byzantine Fault Tolerance For Federated Distributed Applications, Sajeeva L. Pallemulle, Haraldur D. Thorvaldsson, Kenneth J. Goldman Jan 2007

Perpetual: Byzantine Fault Tolerance For Federated Distributed Applications, Sajeeva L. Pallemulle, Haraldur D. Thorvaldsson, Kenneth J. Goldman

All Computer Science and Engineering Research

Modern distributed applications rely upon the functionality of services from multiple providers. Mission-critical services, possibly shared by multiple applications, must be replicated to guarantee correct execution and availability in spite of arbitrary (Byzantine) faults. Furthermore, shared services must enforce strict fault isolation policies to prevent cascading failures across organizational and application boundaries. Most existing protocols for Byzantine fault-tolerant execution do not support interoperability between replicated services while others provide poor fault isolation. Moreover, existing protocols place impractical limitations on application development by disallowing long-running threads of computation, asynchronous operation invocation, and asynchronous request processing. We present Perpetual, a protocol that …


A Critical Review On Electromagnetic Precursors And Earthquake Prediction, Levent Sevgi̇ Jan 2007

A Critical Review On Electromagnetic Precursors And Earthquake Prediction, Levent Sevgi̇

Turkish Journal of Electrical Engineering and Computer Sciences

Seismo-electromagnetic precursory-based earthquake prediction studies are criticized in terms of their scientific content, problem complexity, signal excitation and propagation, causal relations with earthquakes, and public awareness and expectations. One aim is to trigger a new debate on this hot topic in the Electromagnetic Society.


Analysis Of Finline Structures With Consideration Of Metallization Thickness And Substrate Mounting Grooves, Abderrahmane Ouadi, Hadj Bourdoucen Jan 2007

Analysis Of Finline Structures With Consideration Of Metallization Thickness And Substrate Mounting Grooves, Abderrahmane Ouadi, Hadj Bourdoucen

Turkish Journal of Electrical Engineering and Computer Sciences

In this paper, mathematical analysis and numerical calculations of main parameters of finline structures with finite metallization thickness and substrate mounting grooves are developed based on the Method of Lines (MoL). The results obtained provide confirmation of the validity of the technique used and prove its simplicity and adequacy for treating different types of planar structures mainly finline based structures. Unilateral and bilateral finlines including practical parameters, such as metallization thickness and grooves' depths, have been investigated. The effect of these two parameters have been discussed based on realistic configurations and the results show that, at higher frequencies, the grooves …


A Variable Gain Pi Controller Used For Speed Control Of A Direct Torque Neuro Fuzzy Controlled Induction Machine Drive, A. Miloudi, Eid A. Al-Radadi, Azeddine Draou Jan 2007

A Variable Gain Pi Controller Used For Speed Control Of A Direct Torque Neuro Fuzzy Controlled Induction Machine Drive, A. Miloudi, Eid A. Al-Radadi, Azeddine Draou

Turkish Journal of Electrical Engineering and Computer Sciences

This paper presents an original variable gain PI (VGPI) controller for speed control of a direct torque neuro fuzzy controlled (DTNFC) induction motor drive. First, a VGPI speed controller is designed to replace the classical PI controller in a conventional direct torque controlled induction motor drive. Its simulated performances are then compared to those of a classical PI controller. Then, a direct torque neuro fuzzy control (DTNFC) for a voltage source PWM inverter fed induction motor drive is presented. This control scheme uses the stator flux amplitude and the electromagnetic torque errors through an adaptive NF inference system (ANFIS) to …


New Method For Investigation Of Dynamic Parameters Of Thermoelectric Modules, Raşi̇t Ahiska Jan 2007

New Method For Investigation Of Dynamic Parameters Of Thermoelectric Modules, Raşi̇t Ahiska

Turkish Journal of Electrical Engineering and Computer Sciences

Precise calculation of parameters of thermoelectric modules and thermoelectric devices under operating conditions by present methods is very difficult. In this study, a new method is developed to calculate all parameters of thermoelectric modules. This new method makes it possible to determine the dynamic parameters of a real thermoelectric module operated under different working regimes. Measurement of thermoemf created by an operating module is the basis of this new method. An unloaded thermoelectric module, whose dynamic output parameters are necessary in the design of a medical helmet for the cooling of brain, has been investigated using this new method. A …


Data Mining And Costas Arrays, Konstantinos Drakakis Jan 2007

Data Mining And Costas Arrays, Konstantinos Drakakis

Turkish Journal of Electrical Engineering and Computer Sciences

Costas arrays are used in RADAR (and SONAR) engineering to represent frequency-hopping patterns that optimize the RADAR's performance. In this work, using all available Costas arrays up to and including order 26, as well as data mining techniques, we investigate how the Costas property and the balance of signs in the difference triangle of a permutation are related. Our conclusion is that there is sufficient evidence to believe that the mechanism responsible for the formation of Costas arrays changes from low to high orders.


A Combinatorial Approach Of Real Ga & Fuzzy To Atc Enhancement, Hossein Farahmand, Masoud Rashidinejad, Ali Akbar Gharaveici Jan 2007

A Combinatorial Approach Of Real Ga & Fuzzy To Atc Enhancement, Hossein Farahmand, Masoud Rashidinejad, Ali Akbar Gharaveici

Turkish Journal of Electrical Engineering and Computer Sciences

Under new de-regulated environment an open access to transmission system seems to be desired. Transmission system operators (TSOs) are encouraged to use the existing facilities more efficiently. This paper focuses on study of the best location for SVC as a FACTS device to improve voltage profile as well as maximum available transfer capacity (ATC) in order to achieve lower prices. Real genetic algorithm (RGA) is used for optimization technique and analytical hierarchy process (AHP) associated with fuzzy sets to obtain priority vector for each alternative to evaluate the GA fitness. The effectiveness of the proposed methodology is shown through case …


Offline Signature Verification Using Graph Matching, Ibrahim S. I. Abuhaiba Jan 2007

Offline Signature Verification Using Graph Matching, Ibrahim S. I. Abuhaiba

Turkish Journal of Electrical Engineering and Computer Sciences

In this paper, we present a simple and effective signature verification method that depends only on the raw binary pixel intensities and avoids using complex sets of features. The method looks at the signature verification problem as a graph matching problem. The method is tested using genuine and forgery signatures produced by five subjects. An equal error rate of 26.7% and 5.6% was achieved for skilled and random forgeries, respectively. A positive property of our algorithm is that the false acceptance rate of random forgeries vanishes at the point of equal false rejection and skilled forgery false acceptance rates. Keeping …


Aggregation, Foraging, And Formation Control Of Swarms With Non-Holonomic Agents Using Potential Functions And Sliding Mode Techniques, Veysel Gazi̇, Bariş Fi̇dan, Y. Si̇nan Hanay, İlter Köksal Jan 2007

Aggregation, Foraging, And Formation Control Of Swarms With Non-Holonomic Agents Using Potential Functions And Sliding Mode Techniques, Veysel Gazi̇, Bariş Fi̇dan, Y. Si̇nan Hanay, İlter Köksal

Turkish Journal of Electrical Engineering and Computer Sciences

In this article we consider the aggregation, foraging, and formation control of swarms whose agents are moving in 2-dimensions with non-holonomic unicycle agent dynamics. We approach these problems using artificial potentials and sliding mode control. The main contribution is extension of the recent results (mainly for aggregation) in the literature based on a similar approach for simple integrator agent dynamics models to a significantly more realistic and more difficult setting with non-holonomic unicycle agent dynamics models. In particular, we design continuous-time control schemes via a constructive analysis based on artificial potential functions and sliding mode control techniques. The effectiveness of …


Aggregation In Swarm Robotic Systems: Evolution And Probabilistic Control, Onur Soysal, Erki̇n Bahçeci̇, Erol Şahi̇n Jan 2007

Aggregation In Swarm Robotic Systems: Evolution And Probabilistic Control, Onur Soysal, Erki̇n Bahçeci̇, Erol Şahi̇n

Turkish Journal of Electrical Engineering and Computer Sciences

In this study we investigate two approachees for aggregation behavior in swarm robotics systems: Evolutionary methods and probabilistic control. In first part, aggregation behavior is chosen as a case, where performance and scalability of aggregation behaviors of perceptron controllers that are evolved for a simulated swarm robotic system are systematically studied with different parameter settings. Using a cluster of computers to run simulations in parallel, four experiments are conducted varying some of the parameters. Rules of thumb are derived, which can be of guidance to the use of evolutionary methods to generate other swarm robotic behaviors as well. In the …


Modelling A Deposition Process In Collective Construction, Robert L. Stewart, R. Andrew Russell, Lindsay Kleeman Jan 2007

Modelling A Deposition Process In Collective Construction, Robert L. Stewart, R. Andrew Russell, Lindsay Kleeman

Turkish Journal of Electrical Engineering and Computer Sciences

During collective construction tasks, swarm robots coordinate their actions in space and time to build structures that conform to some given design or specification. In this paper, a simulation model and a mathematical model (based on a Markov chain) are introduced to describe the deposition process of a previously detailed robotic swarm system that uses templates and feedback to facilitate construction. The models are based on the behaviour and geometry of real robots and predict the dynamics observed during practical trials as well as explaining the occurrence of different spatial patterns of building blocks. Furthermore, the models provide an insight …


Swarm Robot Systems Based On The Evolution Of Personality Traits, Sidney Nascimento Givigi Jr. Jan 2007

Swarm Robot Systems Based On The Evolution Of Personality Traits, Sidney Nascimento Givigi Jr.

Turkish Journal of Electrical Engineering and Computer Sciences

Game theory may be very useful in modeling and analyzing swarms of robots. Using game theory in conjunction with traits of personalities, we achieve intelligent swarm robots. Traits of personality are characteristics of each robot that define the robots' behaviours. The environment is represented as a game and due to the evolution of the traits through a learning process, we show how the robots may react intelligently to changes in the environment. A proof of convergence for the proposed algorithm is offered. The process of selection of traits is discussed and the potential of the modeling is demonstrated in several …


A Communication Module And Tdma Scheduling For A Swarm Of Small Submarines, Ram Somaraju, Felix Schill Jan 2007

A Communication Module And Tdma Scheduling For A Swarm Of Small Submarines, Ram Somaraju, Felix Schill

Turkish Journal of Electrical Engineering and Computer Sciences

Swarming algorithms usually require fast and reliable local information distribution among neighbouring nodes. Additionally, many applications also require global information distribution in the shortest possible time. We show that communication links with a range which is small compared to the size of the swarm offer many advantages. We propose a system using low frequency radio communication as a viable alternative to acoustic communication. A time division multiple access algorithm is presented together with results from simulations. The presented system can be effectively used in large scale swarms of small submersibles.


Optimal Location For Shunt Connected Facts Devices In A Series Compensated Long Transmission Line, P.R. Sharma, Ashok Kumar, Narender Kumar Jan 2007

Optimal Location For Shunt Connected Facts Devices In A Series Compensated Long Transmission Line, P.R. Sharma, Ashok Kumar, Narender Kumar

Turkish Journal of Electrical Engineering and Computer Sciences

Shunt FACTS devices are used for controlling transmission voltage, power flow, reducing reactive losses, and damping of power system oscillations for high power transfer levels. In this paper the optimal location of a shunt FACT device is investigated for an actual line model of a transmission line having series compensation at the center. Effect of change in degree of series compensation on the optimal location of the shunt FACTS device to get the highest possible benefit is studied. It is found that the optimal location of the shunt FACTS device varies with the change in the level of series compensation …


A Novel Method For Load Flow Analysis Of Unbalanced Three-Phase Radial Distribution Networks, Masoud Aliakbar Golkar Jan 2007

A Novel Method For Load Flow Analysis Of Unbalanced Three-Phase Radial Distribution Networks, Masoud Aliakbar Golkar

Turkish Journal of Electrical Engineering and Computer Sciences

This paper presents a novel method for load flow analysis in radially operated 3-phase distribution networks without solving the well-known conventional load flow equations. The method can be applied for distribution systems in which the loads are unbalanced. As the size of matrix used is very small compared to those in conventional methods, the amount of memory used is very small, the speed is very high, and the relative speed of calculation increases with the size of the system. The method was applied to some practical networks and the results show the superiority of this method over the conventional ones. …


A Sensitive Ann Based Differential Relay For Transformer Protection With Security Against Ct Saturation And Tap Changer Operation, Hassan Khorashadi Zadeh, Zuyi Li Jan 2007

A Sensitive Ann Based Differential Relay For Transformer Protection With Security Against Ct Saturation And Tap Changer Operation, Hassan Khorashadi Zadeh, Zuyi Li

Turkish Journal of Electrical Engineering and Computer Sciences

This paper presents an artificial neural network (ANN) based scheme for fault identification in power transformer protection. The proposed scheme is featured by the application of ANN to identifying system patterns, the unique choice of harmonics of positive sequence differential currents as ANN inputs, the effective handling of current transformer (CT) saturation with an ANN based approach, and the consideration of tap changer position for correcting secondary CT current. Performance of the proposed scheme is studied for a wide variety of operating conditions using data generated from simulation. The results indicate that the proposed scheme provides a fast and sensitive …


Pi-Calculus In Logical Form, Marcello M. Bonsangue, Alexander Kurz Jan 2007

Pi-Calculus In Logical Form, Marcello M. Bonsangue, Alexander Kurz

Engineering Faculty Articles and Research

Abramsky’s logical formulation of domain theory is extended to encompass the domain theoretic model for picalculus processes of Stark and of Fiore, Moggi and Sangiorgi. This is done by defining a logical counterpart of categorical constructions including dynamic name allocation and name exponentiation, and showing that they are dual to standard constructs in functor categories. We show that initial algebras of functors defined in terms of these constructs give rise to a logic that is sound, complete, and characterises bisimilarity. The approach is modular, and we apply it to derive a logical formulation of pi-calculus. The resulting logic is a …


A Review Of Studies In Swarm Robotics, Levent Bayindir, Erol Şahi̇n Jan 2007

A Review Of Studies In Swarm Robotics, Levent Bayindir, Erol Şahi̇n

Turkish Journal of Electrical Engineering and Computer Sciences

Swarm robotics is a new approach to the coordination of large numbers of relatively simple robots. The approach takes its inspiration from the system-level functioning of social insects which demonstrate three desired characteristics for multi-robot systems: robustness, flexibility and scalability. In this paper we have presented a preliminary taxonomy for swarm robotics and classified existing studies into this taxonomy after investigating the existing surveys related to swarm robotics literature. Our parent taxonomic units are modeling, behavior design, communication, analytical studies and problems. We are classifying existing studies into these main axes. Since existing reviews do not have enough number of …


Using Angle Of Arrival (Bearing) Information For Localization In Robot Networks, Tolga Eren Jan 2007

Using Angle Of Arrival (Bearing) Information For Localization In Robot Networks, Tolga Eren

Turkish Journal of Electrical Engineering and Computer Sciences

In this paper, we consider using angle of arrival information (bearing) for localization in robot networks. The essential property we require in this paper is that a node can infer heading information from its neighbors. We address the uniqueness of network localization solutions by the theory of globally rigid graphs. We show that while the parallel rigidity problem for formations with bearings is isomorphic to the distance case, the global rigidity of the formation is simpler (in fact identical to the simpler rigidity case) for a network with bearings, compared to formations with distances. We provide the conditions of localization …


A Vrp-Based Route Planning For A Mobile Robot Group, Osman Parlaktuna, Aydin Si̇pahi̇oğlu, Ahmet Yazici Jan 2007

A Vrp-Based Route Planning For A Mobile Robot Group, Osman Parlaktuna, Aydin Si̇pahi̇oğlu, Ahmet Yazici

Turkish Journal of Electrical Engineering and Computer Sciences

In this study, a vehicle routing problem-based approach is presented to construct non-intersecting routes for the members of a mobile robot team. It is assumed that each robot starts from a central location such as the charging point, completes its route and returns to the starting location. The proposed method consists of three algorithms: a sweep algorithm determines the position of each node in clockwise (or counter clockwise) manner with respect to the starting location; savings algorithm calculates the saving obtained by adding a node to the route of a robot; Dijkstra's shortest path algorithm is used to calculate the …