SearcharxivSearch

SEARCH · Searcharxiv

Results for “cs.OH”

Search indexed arXiv papers on artificial intelligence, large language models, computer vision and robotics. Read source abstracts and follow links to arXiv.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 19 recordsLinked to original sources

Logic Design

Electronic circuits can be separated into two groups, digital and analog circuits. Analog circuits operate on analog quantities that are continuous in value, whereas digital circuits operate on digital quantities that are discrete in value and limited in precision. In practice, most digital systems contain combinational circuits along with memory; these systems are known as sequential circuits. Sequential circuits are of two types: synchronous and asynchronous. In a synchronous sequential circuit, a clock signal is used at discrete instants of time to synchronize desired operations. Asynchronous sequential circuits do not require synchronizing clock pulses; however, the completion of an operation signals the start of the next operation in sequence. The basic logic design steps are generally identical for sequential and combinational circuits; these are specification, formulation, optimization, and the implementation of the optimized equations using a suitable hardware technology. The differences between sequential and combinational design steps appear in the details of each step. The minimization (optimization) techniques used in logic design range from simple (manual) to complex (automated). An example of manual optimization methods is the Karnough map (K-map). Indeed, hardware implementation technology has been growing faster than the ability of designers to produce hardware designs. Hence, there has been a growing interest in developing techniques and tools that facilitate the process of logic design.

cs.OH

Supporting Knowledge and Expertise Finding within Australia's Defence Science and Technology Organisation

This paper reports on work aimed at supporting knowledge and expertise finding within a large Research and Development (R&D) organisation. The paper first discusses the nature of knowledge important to R&D organisations and presents a prototype information system developed to support knowledge and expertise finding. The paper then discusses a trial of the system within an R&D organisation, the implications and limitations of the trial, and discusses future research questions.

cs.OH

Performance Analysis of the IEEE 802.11e Enhanced Distributed Coordination Function using Cycle Time Approach

The recently ratified IEEE 802.11e standard defines the Enhanced Distributed Channel Access (EDCA) function for Quality-of-Service (QoS) provisioning in the Wireless Local Area Networks (WLANs). The EDCA uses Carrier Sense Multiple Access with Collision Avoidance (CSMA/CA) and slotted Binary Exponential Backoff (BEB) mechanism. We present a simple mathematical analysis framework for the EDCA function. Our analysis considers the fact that the distributed random access systems exhibit cyclic behavior where each station successfully transmits a packet in a cycle. Our analysis shows that an AC-specific cycle time exists for the EDCA function. Validating the theoretical results via simulations, we show that the proposed analysis accurately captures EDCA saturation performance in terms of average throughput, medium access delay, and packet loss ratio. The cycle time analysis is a simple and insightful substitute for previously proposed more complex EDCA models.

cs.OH

Fairness Provision in the IEEE 802.11e Infrastructure Basic Service Set

Most of the deployed IEEE 802.11e Wireless Local Area Networks (WLANs) use infrastructure Basic Service Set (BSS) in which an Access Point (AP) serves as a gateway between wired and wireless domains. We present the unfairness problem between the uplink and the downlink flows of any Access Category (AC) in the 802.11e Enhanced Distributed Channel Access (EDCA) when the default settings of the EDCA parameters are used. We propose a simple analytical model to calculate the EDCA parameter settings that achieve weighted fair resource allocation for all uplink and downlink flows. We also propose a simple model-assisted measurement-based dynamic EDCA parameter adaptation algorithm. Moreover, our dynamic solution addresses the differences in the transport layer and the Medium Access Control (MAC) layer interactions of User Datagram Protocol (UDP) and Transmission Control Protocol (TCP). We show that proposed Contention Window (CW) and Transmit Opportunity (TXOP) limit adaptation at the AP provides fair UDP and TCP access between uplink and downlink flows of the same AC while preserving prioritization among ACs.

cs.OH

Kekulé Cells for Molecular Computation

The configurations of single and double bonds in polycyclic hydrocarbons are abstracted as Kekulé states of graphs. Sending a so-called soliton over an open channel between ports (external nodes) of the graph changes the Kekulé state and therewith the set of open channels in the graph. This switching behaviour is proposed as a basis for molecular computation. The proposal is highly speculative but may have tremendous impact. Kekulé states with the same boundary behaviour (port assignment) can be regarded as equivalent. This gives rise to the abstraction of Kekulé cells. The basic theory of Kekulé states and Kekulé cells is developed here, up to the classification of Kekulé cells with $\leq 4$ ports. To put the theory in context, we generalize Kekulé states to semi-Kekulé states, which form the solutions of a linear system of equations over the field of the bits 0 and 1. We briefly study so-called omniconjugated graphs, in which every port assignment of the right signature has a Kekulé state. Omniconjugated graphs may be useful as connectors between computational elements. We finally investigate some examples with potentially useful switching behaviour.

cs.OH

The Use of ITIL for Process Optimisation in the IT Service Centre of Harz University, exemplified in the Release Management Process

This paper details the use of the IT Infrastructure Library Framework (ITIL) for optimising process workflows in the IT Service Centre of Harz University in Wernigerode, Germany, exemplified by the Release Management Process. It is described, how, during the course of a special ITIL project, the As-Is-Status of the various original processes was documented as part of the process life cycle and then transformed in the To-Be-Status, according to the ITIL Best Practice Framework. It is also shown, how the ITIL framework fits into the four-layered-process model, that could be derived from interviews with the universities IT support staff, and how the various modified processes interconnect with each other to form a value chain. The paper highlights the final results of the project and gives an outlook on the future use of ITIL as a business modelling tool in the IT Service Centre of Harz University. It is currently being considered, whether the process model developed during the project could be used as a reference model for other university IT centres.

cs.OH

Hypocomputation

Hypercomputational formal theories will, clearly, be both structurally and foundationally different from the formal theories underpinning computational theories. However, many of the maps that might guide us into this strange realm have been lost. So little work has been done recently in the area of metamathematics, and so many of the previous results have been folded into other theories, that we are in danger of loosing an appreciation of the broader structure of formal theories. As an aid to those looking to develop hypercomputational theories, we will briefly survey the known landmarks both inside and outside the borders of computational theory. We will not focus in this paper on why the structure of formal theory looks the way it does. Instead we will focus on what this structure looks like, moving from hypocomputational, through traditional computational theories, and then beyond to hypercomputational theories.

cs.OH

Hilbert++ Manual

We present here an installation guide, a hand-on mini-tutorial through examples, and the theoretical foundations of the Hilbert++ code.

cs.OH

Bandlimited Field Reconstruction for Wireless Sensor Networks

Wireless sensor networks are often used for environmental monitoring applications. In this context sampling and reconstruction of a physical field is one of the most important problems to solve. We focus on a bandlimited field and find under which conditions on the network topology the reconstruction of the field is successful, with a given probability. We review irregular sampling theory, and analyze the problem using random matrix theory. We show that even a very irregular spatial distribution of sensors may lead to a successful signal reconstruction, provided that the number of collected samples is large enough with respect to the field bandwidth. Furthermore, we give the basis to analytically determine the probability of successful field reconstruction.

cs.OH

Design of Multistage Decimation Filters Using Cyclotomic Polynomials: Optimization and Design Issues

This paper focuses on the design of multiplier-less decimation filters suitable for oversampled digital signals. The aim is twofold. On one hand, it proposes an optimization framework for the design of constituent decimation filters in a general multistage decimation architecture. The basic building blocks embedded in the proposed filters belong, for a simple reason, to the class of cyclotomic polynomials (CPs): the first 104 CPs have a z-transfer function whose coefficients are simply {-1,0,+1}. On the other hand, the paper provides a bunch of useful techniques, most of which stemming from some key properties of CPs, for designing the proposed filters in a variety of architectures. Both recursive and non-recursive architectures are discussed by focusing on a specific decimation filter obtained as a result of the optimization algorithm. Design guidelines are provided with the aim to simplify the design of the constituent decimation filters in the multistage chain.

cs.OH

RS-232 Led Board

This article demonstrates how to develop a Microchip PIC16F84 based device that supports RS-232 interface with PC. Circuit (LED Board) design and software development will be discussed. PicBasic Pro Compiler from microEngineering Labs, Inc. is used for PIC programming. Development of LED Board Control Console using C/C++ is also briefly discussed. The project requires basic work experience with Microchip PICs, serial communication and programming.

cs.OH

Products of irreducible random matrices in the (Max,+) Algebra

We consider the recursive equation ``x(n+1)=A(n)x(n)'' where x(n+1) and x(n) are column vectors of size k and where A(n) is an irreducible random matrix of size k x k. The matrix-vector multiplication in the (max,+) algebra is defined by (A(n)x(n))_i= max_j [ A(n)_{ij} +x(n)_j ]. This type of equation can be used to represent the evolution of Stochastic Event Graphs which include cyclic Jackson Networks, some manufacturing models and models with general blocking (such as Kanban). Let us assume that the sequence (A(n))_n is i.i.d or more generally stationary and ergodic. The main result of the paper states that the system couples in finite time with a unique stationary regime if and only if there exists a set of matrices C such that P {A(0) in C} > 0, and the matrices in C have a unique periodic regime.

cs.OH

Further Comments on "Residue-to-Binary Converters Based on New Chinese Remainder Theorems"

Ananda Mohan suggested that the first New Chinese Remainder Theorem introduced by Wang can be derived from the constructive proof of the well-known Chinese Remainder Theorem (CRT) and claimed that Wang's approach is the same as the one proposed earlier by Huang. Ananda Mohan's proof is however erroneous and we show here that Wang's New CRT I is a rewriting of an algorithm previously sketched by Hitz and Kaltofen.

cs.OH

Reductionism, emergence, and levels of abstractions

Can there be independent higher level laws of nature if everything is reducible to the fundamental laws of physics? The computer science notion of level of abstraction explains why there can -- illustrating how computational thinking can solve one of philosophy's most vexing problems.

cs.OH

Modeling Context, Collaboration, and Civilization in End-User Informatics

End-user informatics applications are Internet data web management automation solutions. These are mass modeling and mass management collaborative communal consensus solutions. They are made and maintained by managerial, professional, technical and specialist end-users. In end-user informatics the end-users are always right. So it becomes necessary for information technology professionals to understand information and informatics from the end-user perspective. End-user informatics starts with the observation that practical prose is a mass consensus communal modeling technology. This high technology is the mechanistic modeling medium we all use every day in all of our practical pursuits. Practical information flows are the lifeblood of modern capitalist communities. But what exactly is practical information? It's ultimately physical information, but the physics is highly emergent rather than elementary. So practical reality is just physical reality in deep disguise. Practical prose is the medium that we all use to model the everyday and elite mechanics of practical reality. So this is the medium that end-user informatics must automate and animate.

cs.OH

The Accidental Detection Index as a Fault Ordering Heuristic for Full-Scan Circuits

We investigate a new fault ordering heuristic for test generation in full-scan circuits. The heuristic is referred to as the accidental detection index. It associates a value ADI (f) with every circuit fault f. The heuristic estimates the number of faults that will be detected by a test generated for f. Fault ordering is done such that a fault with a higher accidental detection index appears earlier in the ordered fault set and targeted earlier during test generation. This order is effective for generating compact test sets, and for obtaining a test set with a steep fault coverage curve. Such a test set has several applications. We present experimental results to demonstrate the effectiveness of the heuristic.

cs.OH

RIP: An Efficient Hybrid Repeater Insertion Scheme for Low Power

This paper presents a novel repeater insertion algorithm for interconnect power minimization. The novelty of our approach is in the judicious integration of an analytical solver and a dynamic programming based method. Specifically, the analytical solver chooses a concise repeater library and a small set of repeater location candidates such that the dynamic programming algorithm can be performed fast with little degradation of the solution quality. In comparison with previously reported repeater insertion schemes, within comparable runtimes, our approach achieves up to 37% higher power savings. Moreover, for the same design quality, our scheme attains a speedup of two orders of magnitude.

cs.OH