Searcharxiv⌕ Search

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 307 records · Page 17Linked to original sources
arXiv2009

Self-assembly of the discrete Sierpinski carpet and related fractals

It is well known that the discrete Sierpinski triangle can be defined as the nonzero residues modulo 2 of Pascal's triangle, and that from this definition one can easily construct a tileset with which the discrete Sierpinski triangle self-assembles in Winfree's tile assembly model. In this paper we introduce an infinite class of discrete self-similar fractals that are defined by the residues modulo a prime p of the entries in a two-dimensional matrix obtained from a simple recursive equation. We prove that every fractal in this class self-assembles using a uniformly constructed tileset. As a special case we show that the discrete Sierpinski carpet self-assembles using a set of 30 tiles.

cs.OH↗
arXiv2014

Finite-size effects in the dependency networks of free and open-source software

We propose a continuum model for the degree distribution of directed networks in free and open-source software. The degree distributions of links in both the in-directed and out-directed dependency networks follow Zipf's law for the intermediate nodes, but the heavily linked nodes and the poorly linked nodes deviate from this trend and exhibit finite-size effects. The finite-size parameters make a quantitative distinction between the in-directed and out-directed networks. For the out-degree distribution, the initial condition for a dynamic evolution corresponds to the limiting count of the most heavily liked nodes that the out-directed network can finally have. The number of nodes contributing out-directed links grows with every generation of software release, but this growth ultimately saturates towards a terminal value due to the finiteness of semantic possibilities in the network.

cs.OH↗
arXiv2009

Hierarchical Triple-Modular Redundancy (H-TMR) Network For Digital Systems

Hierarchical application of Triple-Modular Redundancy (TMR) increases fault tolerance of digital Integrated Circuit (IC). In this paper, a simple probabilistic model was proposed for analysis of fault masking performance of hierarchical TMR networks. Performance improvements obtained by second order TMR network were theoretically compared with first order TMR network.

cs.OH↗
arXiv2009

MicroSim: Modeling the Swedish Population

This article presents a unique, large-scale and spatially explicit microsimulation model that uses official anonymized register data collected from all individuals living in Sweden. Individuals are connected to households and workplaces and represent crucial links in the Swedish social contact network. This enables significant policy experiments in the domain of epidemic outbreaks. Development of the model started in 2004 at the Swedish Institute for Infectious Disease Control (SMI) in Solna, Sweden with the goal of creating a tool for testing the effects of intervention policies. These interventions include mass vaccination, targeted vaccination, isolation and social distancing. The model was initially designed for simulating smallpox outbreaks. In 2006, it was modified to support simulations of pandemic influenza. All nine millions members of the Swedish population are represented in the model. This article is a technical description of the simulation model; the input data, the simulation engine and the basic object types.

cs.OH↗
arXiv2009

On Why and What of Randomness

This paper has several objectives. First, it separates randomness from lawlessness and shows why even genuine randomness does not imply lawlessness. Second, it separates the question -why should I call a phenomenon random? (and answers it in part one) from the patent question -What is a random sequence? -for which the answer lies in Kolmogorov complexity (which is explained in part two). While answering the first question the note argues why there should be four motivating factors for calling a phenomenon random: ontic, epistemic, pseudo and telescopic, the first two depicting genuine randomness and the last two false. Third, ontic and epistemic randomness have been distinguished from ontic and epistemic probability. Fourth, it encourages students to be applied statisticians and advises against becoming armchair theorists but this is interestingly achieved by a straight application of telescopic randomness. Overall, it tells (the teacher) not to jump to probability without explaining randomness properly first and similarly advises the students to read (and understand) randomness minutely before taking on probability.

cs.OH↗
arXiv2009

Directing RF Terminals Using TELNET Applications

The present study aims to emphasize the way in which the TELNET protocol for directing the mobile terminals is used and works. The paper is structured in three parts: the first two parts are a theoretic presentation of the TELNET protocol, respectively of the mobile terminals. The third part contains an application of the way in which a mobile terminal can be programmed using the TELNET protocol.

cs.OH↗
arXiv2009

Quantum Information Science and Nanotechnology

In this note is touched upon an application of quantum information science (QIS) in nanotechnology area. The laws of quantum mechanics may be very important for nano-scale objects. A problem with simulating of quantum systems is well known and quantum computer was initially suggested by R. Feynman just as the way to overcome such difficulties. Mathematical methods developed in QIS also may be applied for description of nano-devices. Few illustrative examples are mentioned and they may be related with so-called fourth generation of nanotechnology products.

quant-ph↗
arXiv2009

Airport Gate Assignment A Hybrid Model and Implementation

With the rapid development of airlines, airports today become much busier and more complicated than previous days. During airlines daily operations, assigning the available gates to the arriving aircrafts based on the fixed schedule is a very important issue, which motivates researchers to study and solve Airport Gate Assignment Problems (AGAP) with all kinds of state-of-the-art combinatorial optimization techniques. In this paper, we study the AGAP and propose a novel hybrid mathematical model based on the method of constraint programming and 0 - 1 mixed-integer programming. With the objective to minimize the number of gate conflicts of any two adjacent aircrafts assigned to the same gate, we build a mathematical model with logical constraints and the binary constraints. For practical considerations, the potential objective of the model is also to minimize the number of gates that airlines must lease or purchase in order to run their business smoothly. We implement the model in the Optimization Programming Language (OPL) and carry out empirical studies with the data obtained from online timetable of Continental Airlines, Houston Gorge Bush Intercontinental Airport IAH, which demonstrate that our model can provide an efficient evaluation criteria for the airline companies to estimate the efficiency of their current gate assignments.

cs.AI↗
arXiv2009

Generating Hierarchically Modular Networks via Link Switching

This paper introduces a method to generate hierarchically modular networks with prescribed node degree list by link switching. Unlike many existing network generating models, our method does not use link probabilities to achieve modularity. Instead, it utilizes a user-specified topology to determine relatedness between pairs of nodes in terms of edge distances and links are switched to increase edge distances. To measure the modular-ness of a network as a whole, a new metric called Q2 is proposed. Comparisons are made between the Q [15] and Q2 measures. We also comment on the effect of our modularization method on other network characteristics such as clustering, hierarchy, average path length, small-worldness, degree correlation and centrality. An application of this method is reported elsewhere [12]. Briefly, the generated networks are used as test problems to explore the effect of modularity and degree distribution on evolutionary search algorithms.

cs.OH↗
arXiv2009

Boolean Logic with Fault Tolerant Coding

Error detectable and error correctable coding in Hamming space was researched to discover possible fault tolerant coding constellations, which can implement Boolean logic with fault tolerant property. Basic logic operators of the Boolean algebra were developed to apply fault tolerant coding in the logic circuits. It was shown that application of three-bit fault tolerant codes have provided the digital system skill of auto-recovery without need for designing additional-fault tolerance mechanisms.

cs.OH↗
arXiv2009

Analysis of some properties for a basic Petri net model

The formalism of the models with Petri networks provides a sound theoretical base, supported by powerful mathematical methods able to extract information necessary for the formalism and simulation of the real system that provides features of competition and synchronization. The paper presents a model based on a Petri net, in order to extract information relative to the technological producing process of a food additive.

cs.OH↗
arXiv2009

Pipeline Leak Detection Techniques

Leak detection systems range from simple, visual line walking and checking ones to complex arrangements of hard-ware and software. No one method is universally applicable and operating requirements dictate which method is the most cost effective. The aim of the paper is to review the basic techniques of leak detection that are currently in use. The advantages and disadvantages of each method are discussed and some indications of applicability are outlined.

cs.OH↗
arXiv2009

Computer Systems to Oil Pipeline Transporting

Computer systems in the pipeline oil transporting that the greatest amount of data can be gathered, analyzed and acted upon in the shortest amount of time. Most operators now have some form of computer based monitoring system employing either commercially available or custom developed software to run the system. This paper presented the SCADA systems to oil pipeline in concordance to the Romanian environmental reglementations.

cs.OH↗
arXiv2009

Mapping of transrectal ultrasonographic prostate biopsies: quality control and learning curve assessment by image processing

Objective: Mapping of transrectal ultrasonographic (TRUS) prostate biopsies is of fundamental importance for either diagnostic purposes or the management and treatment of prostate cancer, but the localization of the cores seems inaccurate. Our objective was to evaluate the capacities of an operator to plan transrectal prostate biopsies under 2-dimensional TRUS guidance using a registration algorithm to represent the localization of biopsies in a reference 3-dimensional ultrasonographic volume. Methods: Thirty-two patients underwent a series of 12 prostate biopsies under local anesthesia performed by 1 operator using a TRUS probe combined with specific third-party software to verify that the biopsies were indeed conducted within the planned targets. RESULTS: The operator reached 71% of the planned targets with substantial variability that depended on their localization (100% success rate for targets in the middle and right parasagittal parts versus 53% for targets in the left lateral base). Feedback from this system after each series of biopsies enabled the operator to significantly improve his dexterity over the course of time (first 16 patients: median score, 7 of 10 and cumulated median biopsy length in targets of 90 mm; last 16 patients, median score, 9 of 10 and a cumulated median length of 121 mm; P = .046). Conclusions: In addition to being a useful tool to improve the distribution of prostate biopsies, the potential of this system is above all the preparation of a detailed "map" of each patient showing biopsy zones without substantial changes in routine clinical practices.

physics.med-ph↗
arXiv2009

5-axis High Speed Milling Optimisation

Manufacturing of free form parts relies on the calculation of a tool path based on a CAD model, on a machining strategy and on a given numerically controlled machine tool. In order to reach the best possible performances, it is necessary to take into account a maximum of constraints during tool path calculation. For this purpose, we have developed a surface representation of the tool paths to manage 5-axis High Speed Milling, which is the most complicated case. This model allows integrating early in the step of tool path computation the machine tool geometrical constraints (axis ranges, part holder orientation), kinematical constraints (speed and acceleration on the axes, singularities) as well as gouging issues between the tool and the part. The aim of the paper is to optimize the step of 5-axis HSM tool path calculation with a bi-parameter surface representation of the tool path. We propose an example of integration of the digital process for tool path computation, ensuring the required quality and maximum productivity

cs.OH↗
arXiv2009

Usinage de poches en UGV - Aide au choix de stratégies

The paper deals with associating the optimal machining strategy to a given pocket geometry, within the context of High-Speed Machining (HSM) of aeronautical pockets. First we define different classes of pocket features according to geometrical criteria. Following, we propose a method allowing to associate a set of capable tools to the features. Each capable tool defines a machined zone with a specific geometry. The last part of the paper is thus dedicated to associate the optimal machining strategy to a given geometry within the context of HSM. Results highlight that analyses must be conducted in a dynamical as well as a geometrical viewpoint. In particular, it becomes necessary to integrate dynamical specifities associated to the behavior of the couple machine/NC unit in the tool path calculation.

cs.OH↗